1/* This file contains the definitions and documentation for the
2 tree codes used in GCC.
3 Copyright (C) 1987-2017 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 3, or (at your option) any later
10version.
11
12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3. If not see
19<http://www.gnu.org/licenses/>. */
20
21
22/* For tcc_references, tcc_expression, tcc_comparison, tcc_unary,
23 tcc_binary, and tcc_statement nodes, which use struct tree_exp, the
24 4th element is the number of argument slots to allocate. This
25 determines the size of the tree node object. Other nodes use
26 different structures, and the size is determined by the tree_union
27 member structure; the 4th element should be zero. Languages that
28 define language-specific tcc_exceptional or tcc_constant codes must
29 define the tree_size langhook to say how big they are.
30
31 These tree codes have been sorted so that the macros in tree.h that
32 check for various tree codes are optimized into range checks. This
33 gives a measurable performance improvement. When adding a new
34 code, consider its placement in relation to the other codes.
35
36 When adding a new tree code which might appear as GIMPLE_ASSIGN RHS
37 code, proper handler in chkp_compute_bounds_for_assignment may
38 be required. */
39
40/* Any erroneous construct is parsed into a node of this type.
41 This type of node is accepted without complaint in all contexts
42 by later parsing activities, to avoid multiple error messages
43 for one error.
44 No fields in these nodes are used except the TREE_CODE. */
45DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 0)
46
47/* Used to represent a name (such as, in the DECL_NAME of a decl node).
48 Internally it looks like a STRING_CST node.
49 There is only one IDENTIFIER_NODE ever made for any particular name.
50 Use `get_identifier' to get it (or create it, the first time). */
51DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0)
52
53/* Has the TREE_VALUE and TREE_PURPOSE fields. */
54/* These nodes are made into lists by chaining through the
55 TREE_CHAIN field. The elements of the list live in the
56 TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
57 used as well to get the effect of Lisp association lists. */
58DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0)
59
60/* These nodes contain an array of tree nodes. */
61DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0)
62
63/* A symbol binding block. These are arranged in a tree,
64 where the BLOCK_SUBBLOCKS field contains a chain of subblocks
65 chained through the BLOCK_CHAIN field.
66 BLOCK_SUPERCONTEXT points to the parent block.
67 For a block which represents the outermost scope of a function, it
68 points to the FUNCTION_DECL node.
69 BLOCK_VARS points to a chain of decl nodes.
70 BLOCK_CHAIN points to the next BLOCK at the same level.
71 BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
72 this block is an instance of, or else is NULL to indicate that this
73 block is not an instance of anything else. When non-NULL, the value
74 could either point to another BLOCK node or it could point to a
75 FUNCTION_DECL node (e.g. in the case of a block representing the
76 outermost scope of a particular inlining of a function).
77 BLOCK_ABSTRACT is nonzero if the block represents an abstract
78 instance of a block (i.e. one which is nested within an abstract
79 instance of an inline function).
80 TREE_ASM_WRITTEN is nonzero if the block was actually referenced
81 in the generated assembly. */
82DEFTREECODE (BLOCK, "block", tcc_exceptional, 0)
83
84/* Each data type is represented by a tree node whose code is one of
85 the following: */
86/* Each node that represents a data type has a component TYPE_SIZE
87 containing a tree that is an expression for the size in bits.
88 The TYPE_MODE contains the machine mode for values of this type.
89 The TYPE_POINTER_TO field contains a type for a pointer to this type,
90 or zero if no such has been created yet.
91 The TYPE_NEXT_VARIANT field is used to chain together types
92 that are variants made by type modifiers such as "const" and "volatile".
93 The TYPE_MAIN_VARIANT field, in any member of such a chain,
94 points to the start of the chain.
95 The TYPE_NAME field contains info on the name used in the program
96 for this type (for GDB symbol table output). It is either a
97 TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
98 in the case of structs, unions or enums that are known with a tag,
99 or zero for types that have no special name.
100 The TYPE_CONTEXT for any sort of type which could have a name or
101 which could have named members (e.g. tagged types in C/C++) will
102 point to the node which represents the scope of the given type, or
103 will be NULL_TREE if the type has "file scope". For most types, this
104 will point to a BLOCK node or a FUNCTION_DECL node, but it could also
105 point to a FUNCTION_TYPE node (for types whose scope is limited to the
106 formal parameter list of some function type specification) or it
107 could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node
108 (for C++ "member" types).
109 For non-tagged-types, TYPE_CONTEXT need not be set to anything in
110 particular, since any type which is of some type category (e.g.
111 an array type or a function type) which cannot either have a name
112 itself or have named members doesn't really have a "scope" per se.
113 The TYPE_STUB_DECL field is used as a forward-references to names for
114 ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes;
115 see below.
116 The TYPE_METHODS points to list of all methods associated with the type.
117 It is non-NULL only at main variant of the type and after free_lang_data
118 it may be set to error_mark_node instead of actual list to save memory. */
119
120/* The ordering of the following codes is optimized for the checking
121 macros in tree.h. Changing the order will degrade the speed of the
122 compiler. OFFSET_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, INTEGER_TYPE,
123 REAL_TYPE, POINTER_TYPE. */
124
125/* An offset is a pointer relative to an object.
126 The TREE_TYPE field is the type of the object at the offset.
127 The TYPE_OFFSET_BASETYPE points to the node for the type of object
128 that the offset is relative to. */
129DEFTREECODE (OFFSET_TYPE, "offset_type", tcc_type, 0)
130
131/* C enums. The type node looks just like an INTEGER_TYPE node.
132 The symbols for the values of the enum type are defined by
133 CONST_DECL nodes, but the type does not point to them;
134 however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE
135 is a name and the TREE_VALUE is the value (an INTEGER_CST node). */
136/* A forward reference `enum foo' when no enum named foo is defined yet
137 has zero (a null pointer) in its TYPE_SIZE. The tag name is in
138 the TYPE_NAME field. If the type is later defined, the normal
139 fields are filled in.
140 RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are
141 treated similarly. */
142DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0)
143
144/* Boolean type (true or false are the only values). Looks like an
145 INTEGRAL_TYPE. */
146DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0)
147
148/* Integer types in all languages, including char in C.
149 Also used for sub-ranges of other discrete types.
150 Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
151 and TYPE_PRECISION (number of bits used by this type).
152 In the case of a subrange type in Pascal, the TREE_TYPE
153 of this will point at the supertype (another INTEGER_TYPE,
154 or an ENUMERAL_TYPE or BOOLEAN_TYPE).
155 Otherwise, the TREE_TYPE is zero. */
156DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 0)
157
158/* C's float and double. Different floating types are distinguished
159 by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */
160DEFTREECODE (REAL_TYPE, "real_type", tcc_type, 0)
161
162/* The ordering of the following codes is optimized for the checking
163 macros in tree.h. Changing the order will degrade the speed of the
164 compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range
165 overlaps the previous range of ordered types. */
166
167/* All pointer-to-x types have code POINTER_TYPE.
168 The TREE_TYPE points to the node for the type pointed to. */
169DEFTREECODE (POINTER_TYPE, "pointer_type", tcc_type, 0)
170
171/* A reference is like a pointer except that it is coerced
172 automatically to the value it points to. Used in C++. */
173DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0)
174
175/* The C++ decltype(nullptr) type. */
176DEFTREECODE (NULLPTR_TYPE, "nullptr_type", tcc_type, 0)
177
178/* _Fract and _Accum types in Embedded-C. Different fixed-point types
179 are distinguished by machine mode and by the TYPE_SIZE and the
180 TYPE_PRECISION. */
181DEFTREECODE (FIXED_POINT_TYPE, "fixed_point_type", tcc_type, 0)
182
183/* The ordering of the following codes is optimized for the checking
184 macros in tree.h. Changing the order will degrade the speed of the
185 compiler. COMPLEX_TYPE, VECTOR_TYPE, ARRAY_TYPE. */
186
187/* Complex number types. The TREE_TYPE field is the data type
188 of the real and imaginary parts. It must be of scalar
189 arithmetic type, not including pointer type. */
190DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0)
191
192/* Vector types. The TREE_TYPE field is the data type of the vector
193 elements. The TYPE_PRECISION field is the number of subparts of
194 the vector. */
195DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0)
196
197/* The ordering of the following codes is optimized for the checking
198 macros in tree.h. Changing the order will degrade the speed of the
199 compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE.
200 Note that this range overlaps the previous range. */
201
202/* Types of arrays. Special fields:
203 TREE_TYPE Type of an array element.
204 TYPE_DOMAIN Type to index by.
205 Its range of values specifies the array length.
206 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
207 and holds the type to coerce a value of that array type to in C.
208 TYPE_STRING_FLAG indicates a string (in contrast to an array of chars)
209 in languages (such as Chill) that make a distinction. */
210/* Array types in C or Pascal */
211DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0)
212
213/* Struct in C, or record in Pascal. */
214/* Special fields:
215 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct,
216 and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables,
217 types and enumerators.
218 A few may need to be added for Pascal. */
219/* See the comment above, before ENUMERAL_TYPE, for how
220 forward references to struct tags are handled in C. */
221DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0)
222
223/* Union in C. Like a struct, except that the offsets of the fields
224 will all be zero. */
225/* See the comment above, before ENUMERAL_TYPE, for how
226 forward references to union tags are handled in C. */
227DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */
228
229/* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER
230 in each FIELD_DECL determine what the union contains. The first
231 field whose DECL_QUALIFIER expression is true is deemed to occupy
232 the union. */
233DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0)
234
235/* The ordering of the following codes is optimized for the checking
236 macros in tree.h. Changing the order will degrade the speed of the
237 compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */
238
239/* The void type in C */
240DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0)
241
242/* Type to hold bounds for a pointer.
243 Has TYPE_PRECISION component to specify number of bits used
244 by this type. */
245DEFTREECODE (POINTER_BOUNDS_TYPE, "pointer_bounds_type", tcc_type, 0)
246
247/* Type of functions. Special fields:
248 TREE_TYPE type of value returned.
249 TYPE_ARG_TYPES list of types of arguments expected.
250 this list is made of TREE_LIST nodes.
251 In this list TREE_PURPOSE can be used to indicate the default
252 value of parameter (used by C++ frontend).
253 Types of "Procedures" in languages where they are different from functions
254 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
255DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0)
256
257/* METHOD_TYPE is the type of a function which takes an extra first
258 argument for "self", which is not present in the declared argument list.
259 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
260 is the type of "self". TYPE_ARG_TYPES is the real argument list, which
261 includes the hidden argument for "self". */
262DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0)
263
264/* This is a language-specific kind of type.
265 Its meaning is defined by the language front end.
266 layout_type does not know how to lay this out,
267 so the front-end must do so manually. */
268DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0)
269
270/* Expressions */
271
272/* First, the constants. */
273
274DEFTREECODE (VOID_CST, "void_cst", tcc_constant, 0)
275
276/* Contents are in an array of HOST_WIDE_INTs.
277
278 We often access these constants both in their native precision and
279 in wider precisions (with the constant being implicitly extended
280 according to TYPE_SIGN). In each case, the useful part of the array
281 may be as wide as the precision requires but may be shorter when all
282 of the upper bits are sign bits. The length of the array when accessed
283 in the constant's native precision is given by TREE_INT_CST_NUNITS.
284 The length of the array when accessed in wider precisions is given
285 by TREE_INT_CST_EXT_NUNITS. Each element can be obtained using
286 TREE_INT_CST_ELT.
287
288 INTEGER_CST nodes can be shared, and therefore should be considered
289 read only. They should be copied before setting a flag such as
290 TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW already set,
291 it is known to be unique. INTEGER_CST nodes are created for the
292 integral types, for pointer types and for vector and float types in
293 some circumstances. */
294DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0)
295
296/* Contents are in TREE_REAL_CST field. */
297DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0)
298
299/* Contents are in TREE_FIXED_CST field. */
300DEFTREECODE (FIXED_CST, "fixed_cst", tcc_constant, 0)
301
302/* Contents are in TREE_REALPART and TREE_IMAGPART fields,
303 whose contents are other constant nodes. */
304DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0)
305
306/* Contents are in VECTOR_CST_ELTS field. */
307DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0)
308
309/* Contents are TREE_STRING_LENGTH and the actual contents of the string. */
310DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0)
311
312/* Declarations. All references to names are represented as ..._DECL
313 nodes. The decls in one binding context are chained through the
314 TREE_CHAIN field. Each DECL has a DECL_NAME field which contains
315 an IDENTIFIER_NODE. (Some decls, most often labels, may have zero
316 as the DECL_NAME). DECL_CONTEXT points to the node representing
317 the context in which this declaration has its scope. For
318 FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
319 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
320 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
321 points to either the FUNCTION_DECL for the containing function, the
322 RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or
323 a TRANSLATION_UNIT_DECL if the given decl has "file scope".
324 DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
325 ..._DECL node of which this decl is an (inlined or template expanded)
326 instance.
327 The TREE_TYPE field holds the data type of the object, when relevant.
328 LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field
329 contents are the type whose name is being declared.
330 The DECL_ALIGN, DECL_SIZE,
331 and DECL_MODE fields exist in decl nodes just as in type nodes.
332 They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
333
334 DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for
335 the location. DECL_VOFFSET holds an expression for a variable
336 offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer).
337 These fields are relevant only in FIELD_DECLs and PARM_DECLs.
338
339 DECL_INITIAL holds the value to initialize a variable to,
340 or the value of a constant. For a function, it holds the body
341 (a node of type BLOCK representing the function's binding contour
342 and whose body contains the function's statements.) For a LABEL_DECL
343 in C, it is a flag, nonzero if the label's definition has been seen.
344
345 PARM_DECLs use a special field:
346 DECL_ARG_TYPE is the type in which the argument is actually
347 passed, which may be different from its type within the function.
348
349 FUNCTION_DECLs use four special fields:
350 DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
351 DECL_RESULT holds a RESULT_DECL node for the value of a function.
352 The DECL_RTL field is 0 for a function that returns no value.
353 (C functions returning void have zero here.)
354 The TREE_TYPE field is the type in which the result is actually
355 returned. This is usually the same as the return type of the
356 FUNCTION_DECL, but it may be a wider integer type because of
357 promotion.
358 DECL_FUNCTION_CODE is a code number that is nonzero for
359 built-in functions. Its value is an enum built_in_function
360 that says which built-in function it is.
361
362 DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
363 holds a line number. In some cases these can be the location of
364 a reference, if no definition has been seen.
365
366 DECL_ABSTRACT is nonzero if the decl represents an abstract instance
367 of a decl (i.e. one which is nested within an abstract instance of a
368 inline function. */
369
370DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0)
371DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0)
372/* The ordering of the following codes is optimized for the checking
373 macros in tree.h. Changing the order will degrade the speed of the
374 compiler. FIELD_DECL, VAR_DECL, CONST_DECL, PARM_DECL,
375 TYPE_DECL. */
376DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0)
377DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0)
378DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0)
379DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0)
380DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0)
381DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0)
382
383/* A "declaration" of a debug temporary. It should only appear in
384 DEBUG stmts. */
385DEFTREECODE (DEBUG_EXPR_DECL, "debug_expr_decl", tcc_declaration, 0)
386
387/* A namespace declaration. Namespaces appear in DECL_CONTEXT of other
388 _DECLs, providing a hierarchy of names. */
389DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0)
390
391/* A declaration import.
392 The C++ FE uses this to represent a using-directive; eg:
393 "using namespace foo".
394 But it could be used to represent any declaration import construct.
395 Whenever a declaration import appears in a lexical block, the BLOCK node
396 representing that lexical block in GIMPLE will contain an IMPORTED_DECL
397 node, linked via BLOCK_VARS accessor of the said BLOCK.
398 For a given NODE which code is IMPORTED_DECL,
399 IMPORTED_DECL_ASSOCIATED_DECL (NODE) accesses the imported declaration. */
400DEFTREECODE (IMPORTED_DECL, "imported_decl", tcc_declaration, 0)
401
402/* A namelist declaration.
403 The Fortran FE uses this to represent a namelist statement, e.g.:
404 NAMELIST /namelist-group-name/ namelist-group-object-list.
405 Whenever a declaration import appears in a lexical block, the BLOCK node
406 representing that lexical block in GIMPLE will contain an NAMELIST_DECL
407 node, linked via BLOCK_VARS accessor of the said BLOCK.
408 For a given NODE which code is NAMELIST_DECL,
409 NAMELIST_DECL_ASSOCIATED_DECL (NODE) accesses the imported declaration. */
410DEFTREECODE (NAMELIST_DECL, "namelist_decl", tcc_declaration, 0)
411
412/* A translation unit. This is not technically a declaration, since it
413 can't be looked up, but it's close enough. */
414DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\
415 tcc_declaration, 0)
416
417/* References to storage. */
418
419/* The ordering of the following codes is optimized for the classification
420 in handled_component_p. Keep them in a consecutive group. */
421
422/* Value is structure or union component.
423 Operand 0 is the structure or union (an expression).
424 Operand 1 is the field (a node of type FIELD_DECL).
425 Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured
426 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */
427DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3)
428
429/* Reference to a group of bits within an object. Similar to COMPONENT_REF
430 except the position is given explicitly rather than via a FIELD_DECL.
431 Operand 0 is the structure or union expression;
432 operand 1 is a tree giving the constant number of bits being referenced;
433 operand 2 is a tree giving the constant position of the first referenced bit.
434 The result type width has to match the number of bits referenced.
435 If the result type is integral, its signedness specifies how it is extended
436 to its mode width. */
437DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3)
438
439/* Array indexing.
440 Operand 0 is the array; operand 1 is a (single) array index.
441 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
442 Operand 3, if present, is the element size, measured in units of
443 the alignment of the element type. */
444DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4)
445
446/* Likewise, except that the result is a range ("slice") of the array. The
447 starting index of the resulting array is taken from operand 1 and the size
448 of the range is taken from the type of the expression. */
449DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4)
450
451/* Used only on an operand of complex type, these return
452 a value of the corresponding component type. */
453DEFTREECODE (REALPART_EXPR, "realpart_expr", tcc_reference, 1)
454DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", tcc_reference, 1)
455
456/* Represents viewing something of one type as being of a second type.
457 This corresponds to an "Unchecked Conversion" in Ada and roughly to
458 the idiom *(type2 *)&X in C. The only operand is the value to be
459 viewed as being of another type. It is undefined if the type of the
460 input and of the expression have different sizes.
461
462 This code may also be used within the LHS of a MODIFY_EXPR, in which
463 case no actual data motion may occur. TREE_ADDRESSABLE will be set in
464 this case and GCC must abort if it could not do the operation without
465 generating insns. */
466DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", tcc_reference, 1)
467
468/* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
469DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1)
470
471/* Used to represent lookup in a virtual method table which is dependent on
472 the runtime type of an object. Operands are:
473 OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use.
474 OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is
475 being performed. Through this the optimizers may be able to statically
476 determine the dynamic type of the object.
477 OBJ_TYPE_REF_TOKEN: An integer index to the virtual method table. */
478DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3)
479
480/* Used to represent the brace-enclosed initializers for a structure or an
481 array. It contains a sequence of component values made out of a VEC of
482 constructor_elt.
483
484 For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE:
485 The field INDEX of each constructor_elt is a FIELD_DECL.
486
487 For ARRAY_TYPE:
488 The field INDEX of each constructor_elt is the corresponding index.
489 If the index is a RANGE_EXPR, it is a short-hand for many nodes,
490 one for each index in the range. (If the corresponding field VALUE
491 has side-effects, they are evaluated once for each element. Wrap the
492 value in a SAVE_EXPR if you want to evaluate side effects only once.)
493
494 Components that aren't present are cleared as per the C semantics,
495 unless the CONSTRUCTOR_NO_CLEARING flag is set, in which case their
496 value becomes undefined. */
497DEFTREECODE (CONSTRUCTOR, "constructor", tcc_exceptional, 0)
498
499/* The expression types are mostly straightforward, with the fourth argument
500 of DEFTREECODE saying how many operands there are.
501 Unless otherwise specified, the operands are expressions and the
502 types of all the operands and the expression must all be the same. */
503
504/* Contains two expressions to compute, one followed by the other.
505 the first value is ignored. The second one's value is used. The
506 type of the first expression need not agree with the other types. */
507DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2)
508
509/* Assignment expression. Operand 0 is the what to set; 1, the new value. */
510DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2)
511
512/* Initialization expression. Operand 0 is the variable to initialize;
513 Operand 1 is the initializer. This differs from MODIFY_EXPR in that any
514 reference to the referent of operand 0 within operand 1 is undefined. */
515DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2)
516
517/* For TARGET_EXPR, operand 0 is the target of an initialization,
518 operand 1 is the initializer for the target, which may be void
519 if simply expanding it initializes the target.
520 operand 2 is the cleanup for this node, if any.
521 operand 3 is the saved initializer after this node has been
522 expanded once; this is so we can re-expand the tree later. */
523DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4)
524
525/* Conditional expression ( ... ? ... : ... in C).
526 Operand 0 is the condition.
527 Operand 1 is the then-value.
528 Operand 2 is the else-value.
529 Operand 0 may be of any type.
530 Operand 1 must have the same type as the entire expression, unless
531 it unconditionally throws an exception, in which case it should
532 have VOID_TYPE. The same constraints apply to operand 2. The
533 condition in operand 0 must be of integral type.
534
535 In cfg gimple, if you do not have a selection expression, operands
536 1 and 2 are NULL. The operands are then taken from the cfg edges. */
537DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3)
538
539/* Vector conditional expression. It is like COND_EXPR, but with
540 vector operands.
541
542 A = VEC_COND_EXPR ( X < Y, B, C)
543
544 means
545
546 for (i=0; i<N; i++)
547 A[i] = X[i] < Y[i] ? B[i] : C[i];
548*/
549DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", tcc_expression, 3)
550
551/* Vector permutation expression. A = VEC_PERM_EXPR<v0, v1, mask> means
552
553 N = length(mask)
554 foreach i in N:
555 M = mask[i] % (2*N)
556 A = M < N ? v0[M] : v1[M-N]
557
558 V0 and V1 are vectors of the same type. MASK is an integer-typed
559 vector. The number of MASK elements must be the same with the
560 number of elements in V0 and V1. The size of the inner type
561 of the MASK and of the V0 and V1 must be the same.
562*/
563DEFTREECODE (VEC_PERM_EXPR, "vec_perm_expr", tcc_expression, 3)
564
565/* Declare local variables, including making RTL and allocating space.
566 BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables.
567 BIND_EXPR_BODY is the body, the expression to be computed using
568 the variables. The value of operand 1 becomes that of the BIND_EXPR.
569 BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings
570 for debugging purposes. If this BIND_EXPR is actually expanded,
571 that sets the TREE_USED flag in the BLOCK.
572
573 The BIND_EXPR is not responsible for informing parsers
574 about these variables. If the body is coming from the input file,
575 then the code that creates the BIND_EXPR is also responsible for
576 informing the parser of the variables.
577
578 If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
579 This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
580 If the BIND_EXPR should be output for debugging but will not be expanded,
581 set the TREE_USED flag by hand.
582
583 In order for the BIND_EXPR to be known at all, the code that creates it
584 must also install it as a subblock in the tree of BLOCK
585 nodes for the function. */
586DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3)
587
588/* Function call. CALL_EXPRs are represented by variably-sized expression
589 nodes. There are at least three fixed operands. Operand 0 is an
590 INTEGER_CST node containing the total operand count, the number of
591 arguments plus 3. Operand 1 is the function or NULL, while operand 2 is
592 is static chain argument, or NULL. The remaining operands are the
593 arguments to the call. */
594DEFTREECODE (CALL_EXPR, "call_expr", tcc_vl_exp, 3)
595
596/* Specify a value to compute along with its corresponding cleanup.
597 Operand 0 is the cleanup expression.
598 The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR,
599 which must exist. This differs from TRY_CATCH_EXPR in that operand 1
600 is always evaluated when cleanups are run. */
601DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1)
602
603/* Specify a cleanup point.
604 Operand 0 is an expression that may have cleanups. If it does, those
605 cleanups are executed after the expression is expanded.
606
607 Note that if the expression is a reference to storage, it is forced out
608 of memory before the cleanups are run. This is necessary to handle
609 cases where the cleanups modify the storage referenced; in the
610 expression 't.i', if 't' is a struct with an integer member 'i' and a
611 cleanup which modifies 'i', the value of the expression depends on
612 whether the cleanup is run before or after 't.i' is evaluated. When
613 expand_expr is run on 't.i', it returns a MEM. This is not good enough;
614 the value of 't.i' must be forced out of memory.
615
616 As a consequence, the operand of a CLEANUP_POINT_EXPR must not have
617 BLKmode, because it will not be forced out of memory. */
618DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1)
619
620/* The following code is used in languages that have types where some
621 field in an object of the type contains a value that is used in the
622 computation of another field's offset or size and/or the size of the
623 type. The positions and/or sizes of fields can vary from object to
624 object of the same type or even for one and the same object within
625 its scope.
626
627 Record types with discriminants in Ada or schema types in Pascal are
628 examples of such types. This mechanism is also used to create "fat
629 pointers" for unconstrained array types in Ada; the fat pointer is a
630 structure one of whose fields is a pointer to the actual array type
631 and the other field is a pointer to a template, which is a structure
632 containing the bounds of the array. The bounds in the type pointed
633 to by the first field in the fat pointer refer to the values in the
634 template.
635
636 When you wish to construct such a type you need "self-references"
637 that allow you to reference the object having this type from the
638 TYPE node, i.e. without having a variable instantiating this type.
639
640 Such a "self-references" is done using a PLACEHOLDER_EXPR. This is
641 a node that will later be replaced with the object being referenced.
642 Its type is that of the object and selects which object to use from
643 a chain of references (see below). No other slots are used in the
644 PLACEHOLDER_EXPR.
645
646 For example, if your type FOO is a RECORD_TYPE with a field BAR,
647 and you need the value of <variable>.BAR to calculate TYPE_SIZE
648 (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR
649 whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with
650 the PLACEHOLDER_EXPR as the first operand (which has the correct
651 type). Later, when the size is needed in the program, the back-end
652 will find this PLACEHOLDER_EXPR and generate code to calculate the
653 actual size at run-time. In the following, we describe how this
654 calculation is done.
655
656 When we wish to evaluate a size or offset, we check whether it contains a
657 PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr
658 passing both that tree and an expression within which the object may be
659 found. The latter expression is the object itself in the simple case of
660 an Ada record with discriminant, but it can be the array in the case of an
661 unconstrained array.
662
663 In the latter case, we need the fat pointer, because the bounds of
664 the array can only be accessed from it. However, we rely here on the
665 fact that the expression for the array contains the dereference of
666 the fat pointer that obtained the array pointer. */
667
668/* Denotes a record to later be substituted before evaluating this expression.
669 The type of this expression is used to find the record to replace it. */
670DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0)
671
672/* Simple arithmetic. */
673DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2)
674DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2)
675DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2)
676
677/* Pointer addition. The first operand is always a pointer and the
678 second operand is an integer of type sizetype. */
679DEFTREECODE (POINTER_PLUS_EXPR, "pointer_plus_expr", tcc_binary, 2)
680
681/* Highpart multiplication. For an integral type with precision B,
682 returns bits [2B-1, B] of the full 2*B product. */
683DEFTREECODE (MULT_HIGHPART_EXPR, "mult_highpart_expr", tcc_binary, 2)
684
685/* Division for integer result that rounds the quotient toward zero. */
686DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2)
687
688/* Division for integer result that rounds it toward plus infinity. */
689DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2)
690
691/* Division for integer result that rounds it toward minus infinity. */
692DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2)
693
694/* Division for integer result that rounds it toward nearest integer. */
695DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2)
696
697/* Four kinds of remainder that go with the four kinds of division: */
698
699/* The sign of the remainder is that of the dividend. */
700DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2)
701
702/* The sign of the remainder is the opposite of that of the divisor. */
703DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2)
704
705/* The sign of the remainder is that of the divisor. */
706DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2)
707
708/* The sign of the remainder is not predictable. */
709DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2)
710
711/* Division for real result. */
712DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2)
713
714/* Division which is not supposed to need rounding.
715 Used for pointer subtraction in C. */
716DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2)
717
718/* Conversion of real to fixed point by truncation. */
719DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1)
720
721/* Conversion of an integer to a real. */
722DEFTREECODE (FLOAT_EXPR, "float_expr", tcc_unary, 1)
723
724/* Unary negation. */
725DEFTREECODE (NEGATE_EXPR, "negate_expr", tcc_unary, 1)
726
727/* Minimum and maximum values. When used with floating point, if both
728 operands are zeros, or if either operand is NaN, then it is unspecified
729 which of the two operands is returned as the result. */
730DEFTREECODE (MIN_EXPR, "min_expr", tcc_binary, 2)
731DEFTREECODE (MAX_EXPR, "max_expr", tcc_binary, 2)
732
733/* Represents the absolute value of the operand.
734
735 An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The
736 operand of the ABS_EXPR must have the same type. */
737DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1)
738
739/* Shift operations for shift and rotate.
740 Shift means logical shift if done on an
741 unsigned type, arithmetic shift if done on a signed type.
742 The second operand is the number of bits to
743 shift by; it need not be the same type as the first operand and result.
744 Note that the result is undefined if the second operand is larger
745 than or equal to the first operand's type size.
746
747 The first operand of a shift can have either an integer or a
748 (non-integer) fixed-point type. We follow the ISO/IEC TR 18037:2004
749 semantics for the latter.
750
751 Rotates are defined for integer types only. */
752DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2)
753DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2)
754DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2)
755DEFTREECODE (RROTATE_EXPR, "rrotate_expr", tcc_binary, 2)
756
757/* Bitwise operations. Operands have same mode as result. */
758DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", tcc_binary, 2)
759DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", tcc_binary, 2)
760DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", tcc_binary, 2)
761DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", tcc_unary, 1)
762
763/* ANDIF and ORIF allow the second operand not to be computed if the
764 value of the expression is determined from the first operand. AND,
765 OR, and XOR always compute the second operand whether its value is
766 needed or not (for side effects). The operand may have
767 BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be
768 either zero or one. For example, a TRUTH_NOT_EXPR will never have
769 an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be
770 used to compare the VAR_DECL to zero, thereby obtaining a node with
771 value zero or one. */
772DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", tcc_expression, 2)
773DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", tcc_expression, 2)
774DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", tcc_expression, 2)
775DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", tcc_expression, 2)
776DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", tcc_expression, 2)
777DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", tcc_expression, 1)
778
779/* Relational operators.
780 `EQ_EXPR' and `NE_EXPR' are allowed for any types.
781 The others are allowed only for integer (or pointer or enumeral)
782 or real types.
783 In all cases the operands will have the same type,
784 and the value is either the type used by the language for booleans
785 or an integer vector type of the same size and with the same number
786 of elements as the comparison operands. True for a vector of
787 comparison results has all bits set while false is equal to zero. */
788DEFTREECODE (LT_EXPR, "lt_expr", tcc_comparison, 2)
789DEFTREECODE (LE_EXPR, "le_expr", tcc_comparison, 2)
790DEFTREECODE (GT_EXPR, "gt_expr", tcc_comparison, 2)
791DEFTREECODE (GE_EXPR, "ge_expr", tcc_comparison, 2)
792DEFTREECODE (EQ_EXPR, "eq_expr", tcc_comparison, 2)
793DEFTREECODE (NE_EXPR, "ne_expr", tcc_comparison, 2)
794
795/* Additional relational operators for floating point unordered. */
796DEFTREECODE (UNORDERED_EXPR, "unordered_expr", tcc_comparison, 2)
797DEFTREECODE (ORDERED_EXPR, "ordered_expr", tcc_comparison, 2)
798
799/* These are equivalent to unordered or ... */
800DEFTREECODE (UNLT_EXPR, "unlt_expr", tcc_comparison, 2)
801DEFTREECODE (UNLE_EXPR, "unle_expr", tcc_comparison, 2)
802DEFTREECODE (UNGT_EXPR, "ungt_expr", tcc_comparison, 2)
803DEFTREECODE (UNGE_EXPR, "unge_expr", tcc_comparison, 2)
804DEFTREECODE (UNEQ_EXPR, "uneq_expr", tcc_comparison, 2)
805
806/* This is the reverse of uneq_expr. */
807DEFTREECODE (LTGT_EXPR, "ltgt_expr", tcc_comparison, 2)
808
809DEFTREECODE (RANGE_EXPR, "range_expr", tcc_binary, 2)
810
811/* Represents a re-association barrier for floating point expressions
812 like explicit parenthesis in fortran. */
813DEFTREECODE (PAREN_EXPR, "paren_expr", tcc_unary, 1)
814
815/* Represents a conversion of type of a value.
816 All conversions, including implicit ones, must be
817 represented by CONVERT_EXPR or NOP_EXPR nodes. */
818DEFTREECODE (CONVERT_EXPR, "convert_expr", tcc_unary, 1)
819
820/* Conversion of a pointer value to a pointer to a different
821 address space. */
822DEFTREECODE (ADDR_SPACE_CONVERT_EXPR, "addr_space_convert_expr", tcc_unary, 1)
823
824/* Conversion of a fixed-point value to an integer, a real, or a fixed-point
825 value. Or conversion of a fixed-point value from an integer, a real, or
826 a fixed-point value. */
827DEFTREECODE (FIXED_CONVERT_EXPR, "fixed_convert_expr", tcc_unary, 1)
828
829/* Represents a conversion expected to require no code to be generated. */
830DEFTREECODE (NOP_EXPR, "nop_expr", tcc_unary, 1)
831
832/* Value is same as argument, but guaranteed not an lvalue. */
833DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", tcc_unary, 1)
834
835/* A COMPOUND_LITERAL_EXPR represents a literal that is placed in a DECL. The
836 COMPOUND_LITERAL_EXPR_DECL_EXPR is the a DECL_EXPR containing the decl
837 for the anonymous object represented by the COMPOUND_LITERAL;
838 the DECL_INITIAL of that decl is the CONSTRUCTOR that initializes
839 the compound literal. */
840DEFTREECODE (COMPOUND_LITERAL_EXPR, "compound_literal_expr", tcc_expression, 1)
841
842/* Represents something we computed once and will use multiple times.
843 First operand is that expression. After it is evaluated once, it
844 will be replaced by the temporary variable that holds the value. */
845DEFTREECODE (SAVE_EXPR, "save_expr", tcc_expression, 1)
846
847/* & in C. Value is the address at which the operand's value resides.
848 Operand may have any mode. Result mode is Pmode. */
849DEFTREECODE (ADDR_EXPR, "addr_expr", tcc_expression, 1)
850
851/* Operand0 is a function constant; result is part N of a function
852 descriptor of type ptr_mode. */
853DEFTREECODE (FDESC_EXPR, "fdesc_expr", tcc_expression, 2)
854
855/* Given a container value, a replacement value and a bit position within
856 the container, produce the value that results from replacing the part of
857 the container starting at the bit position with the replacement value.
858 Operand 0 is a tree for the container value of integral or vector type;
859 Operand 1 is a tree for the replacement value of another integral or
860 the vector element type;
861 Operand 2 is a tree giving the constant bit position;
862 The number of bits replaced is given by the precision of the type of the
863 replacement value if it is integral or by its size if it is non-integral.
864 ??? The reason to make the size of the replacement implicit is to avoid
865 introducing a quaternary operation.
866 The replaced bits shall be fully inside the container. If the container
867 is of vector type, then these bits shall be aligned with its elements. */
868DEFTREECODE (BIT_INSERT_EXPR, "bit_insert_expr", tcc_expression, 3)
869
870/* Given two real or integer operands of the same type,
871 returns a complex value of the corresponding complex type. */
872DEFTREECODE (COMPLEX_EXPR, "complex_expr", tcc_binary, 2)
873
874/* Complex conjugate of operand. Used only on complex types. */
875DEFTREECODE (CONJ_EXPR, "conj_expr", tcc_unary, 1)
876
877/* Nodes for ++ and -- in C.
878 The second arg is how much to increment or decrement by.
879 For a pointer, it would be the size of the object pointed to. */
880DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", tcc_expression, 2)
881DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", tcc_expression, 2)
882DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", tcc_expression, 2)
883DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", tcc_expression, 2)
884
885/* Used to implement `va_arg'. */
886DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", tcc_expression, 1)
887
888/* Evaluate operand 0. If and only if an exception is thrown during
889 the evaluation of operand 0, evaluate operand 1.
890
891 This differs from TRY_FINALLY_EXPR in that operand 1 is not evaluated
892 on a normal or jump exit, only on an exception. */
893DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", tcc_statement, 2)
894
895/* Evaluate the first operand.
896 The second operand is a cleanup expression which is evaluated
897 on any exit (normal, exception, or jump out) from this expression. */
898DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", tcc_statement, 2)
899
900/* These types of expressions have no useful value,
901 and always have side effects. */
902
903/* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */
904DEFTREECODE (DECL_EXPR, "decl_expr", tcc_statement, 1)
905
906/* A label definition, encapsulated as a statement.
907 Operand 0 is the LABEL_DECL node for the label that appears here.
908 The type should be void and the value should be ignored. */
909DEFTREECODE (LABEL_EXPR, "label_expr", tcc_statement, 1)
910
911/* GOTO. Operand 0 is a LABEL_DECL node or an expression.
912 The type should be void and the value should be ignored. */
913DEFTREECODE (GOTO_EXPR, "goto_expr", tcc_statement, 1)
914
915/* RETURN. Evaluates operand 0, then returns from the current function.
916 Presumably that operand is an assignment that stores into the
917 RESULT_DECL that hold the value to be returned.
918 The operand may be null.
919 The type should be void and the value should be ignored. */
920DEFTREECODE (RETURN_EXPR, "return_expr", tcc_statement, 1)
921
922/* Exit the inner most loop conditionally. Operand 0 is the condition.
923 The type should be void and the value should be ignored. */
924DEFTREECODE (EXIT_EXPR, "exit_expr", tcc_statement, 1)
925
926/* A loop. Operand 0 is the body of the loop.
927 It must contain an EXIT_EXPR or is an infinite loop.
928 The type should be void and the value should be ignored. */
929DEFTREECODE (LOOP_EXPR, "loop_expr", tcc_statement, 1)
930
931/* Switch expression.
932
933 TREE_TYPE is the original type of the condition, before any
934 language required type conversions. It may be NULL, in which case
935 the original type and final types are assumed to be the same.
936
937 Operand 0 is the expression used to perform the branch,
938 Operand 1 is the body of the switch, which probably contains
939 CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2
940 must not be NULL.
941 Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs
942 of all the cases. */
943DEFTREECODE (SWITCH_EXPR, "switch_expr", tcc_statement, 3)
944
945/* Used to represent a case label.
946
947 Operand 0 is CASE_LOW. It may be NULL_TREE, in which case the label
948 is a 'default' label.
949 Operand 1 is CASE_HIGH. If it is NULL_TREE, the label is a simple
950 (one-value) case label. If it is non-NULL_TREE, the case is a range.
951 Operand 2 is CASE_LABEL, which is is the corresponding LABEL_DECL.
952 Operand 3 is CASE_CHAIN. This operand is only used in tree-cfg.c to
953 speed up the lookup of case labels which use a particular edge in
954 the control flow graph. */
955DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", tcc_statement, 4)
956
957/* Used to represent an inline assembly statement. ASM_STRING returns a
958 STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS,
959 ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers
960 for the statement. ASM_LABELS, if present, indicates various destinations
961 for the asm; labels cannot be combined with outputs. */
962DEFTREECODE (ASM_EXPR, "asm_expr", tcc_statement, 5)
963
964/* Variable references for SSA analysis. New SSA names are created every
965 time a variable is assigned a new value. The SSA builder uses SSA_NAME
966 nodes to implement SSA versioning. */
967DEFTREECODE (SSA_NAME, "ssa_name", tcc_exceptional, 0)
968
969/* Used to represent a typed exception handler. CATCH_TYPES is the type (or
970 list of types) handled, and CATCH_BODY is the code for the handler. */
971DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2)
972
973/* Used to represent an exception specification. EH_FILTER_TYPES is a list
974 of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on
975 failure. */
976DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2)
977
978/* Node used for describing a property that is known at compile
979 time. */
980DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0)
981
982/* Node used for describing a property that is not known at compile
983 time. */
984DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0)
985
986/* Polynomial chains of recurrences.
987 Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */
988DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3)
989
990/* Used to chain children of container statements together.
991 Use the interface in tree-iterator.h to access this node. */
992DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0)
993
994/* Predicate assertion. Artificial expression generated by the optimizers
995 to keep track of predicate values. This expression may only appear on
996 the RHS of assignments.
997
998 Given X = ASSERT_EXPR <Y, EXPR>, the optimizers can infer
999 two things:
1000
1001 1- X is a copy of Y.
1002 2- EXPR is a conditional expression and is known to be true.
1003
1004 Valid and to be expected forms of conditional expressions are
1005 valid GIMPLE conditional expressions (as defined by is_gimple_condexpr)
1006 and conditional expressions with the first operand being a
1007 PLUS_EXPR with a variable possibly wrapped in a NOP_EXPR first
1008 operand and an integer constant second operand.
1009
1010 The type of the expression is the same as Y. */
1011DEFTREECODE (ASSERT_EXPR, "assert_expr", tcc_expression, 2)
1012
1013/* Base class information. Holds information about a class as a
1014 baseclass of itself or another class. */
1015DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0)
1016
1017/* Records the size for an expression of variable size type. This is
1018 for use in contexts in which we are accessing the entire object,
1019 such as for a function call, or block copy.
1020 Operand 0 is the real expression.
1021 Operand 1 is the size of the type in the expression. */
1022DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2)
1023
1024/* Extract elements from two input vectors Operand 0 and Operand 1
1025 size VS, according to the offset OFF defined by Operand 2 as
1026 follows:
1027 If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to
1028 the first OFF elements of the vector OP1.
1029 If OFF == 0, then the returned vector is OP1.
1030 On different targets OFF may take different forms; It can be an address, in
1031 which case its low log2(VS)-1 bits define the offset, or it can be a mask
1032 generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */
1033DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3)
1034
1035/* Low-level memory addressing. Operands are BASE (address of static or
1036 global variable or register), OFFSET (integer constant),
1037 INDEX (register), STEP (integer constant), INDEX2 (register),
1038 The corresponding address is BASE + STEP * INDEX + INDEX2 + OFFSET.
1039 Only variations and values valid on the target are allowed.
1040
1041 The type of STEP, INDEX and INDEX2 is sizetype.
1042
1043 The type of BASE is a pointer type. If BASE is not an address of
1044 a static or global variable INDEX2 will be NULL.
1045
1046 The type of OFFSET is a pointer type and determines TBAA the same as
1047 the constant offset operand in MEM_REF. */
1048
1049DEFTREECODE (TARGET_MEM_REF, "target_mem_ref", tcc_reference, 5)
1050
1051/* Memory addressing. Operands are a pointer and a tree constant integer
1052 byte offset of the pointer type that when dereferenced yields the
1053 type of the base object the pointer points into and which is used for
1054 TBAA purposes.
1055 The type of the MEM_REF is the type the bytes at the memory location
1056 are interpreted as.
1057 MEM_REF <p, c> is equivalent to ((typeof(c))p)->x... where x... is a
1058 chain of component references offsetting p by c. */
1059DEFTREECODE (MEM_REF, "mem_ref", tcc_reference, 2)
1060
1061/* OpenACC and OpenMP. As it is exposed in TREE_RANGE_CHECK invocations, do
1062 not change the ordering of these codes. */
1063
1064/* OpenACC - #pragma acc parallel [clause1 ... clauseN]
1065 Operand 0: OMP_BODY: Code to be executed in parallel.
1066 Operand 1: OMP_CLAUSES: List of clauses. */
1067
1068DEFTREECODE (OACC_PARALLEL, "oacc_parallel", tcc_statement, 2)
1069
1070/* OpenACC - #pragma acc kernels [clause1 ... clauseN]
1071 Operand 0: OMP_BODY: Sequence of kernels.
1072 Operand 1: OMP_CLAUSES: List of clauses. */
1073
1074DEFTREECODE (OACC_KERNELS, "oacc_kernels", tcc_statement, 2)
1075
1076/* OpenACC - #pragma acc data [clause1 ... clauseN]
1077 Operand 0: OACC_DATA_BODY: Data construct body.
1078 Operand 1: OACC_DATA_CLAUSES: List of clauses. */
1079
1080DEFTREECODE (OACC_DATA, "oacc_data", tcc_statement, 2)
1081
1082/* OpenACC - #pragma acc host_data [clause1 ... clauseN]
1083 Operand 0: OACC_HOST_DATA_BODY: Host_data construct body.
1084 Operand 1: OACC_HOST_DATA_CLAUSES: List of clauses. */
1085
1086DEFTREECODE (OACC_HOST_DATA, "oacc_host_data", tcc_statement, 2)
1087
1088/* OpenMP - #pragma omp parallel [clause1 ... clauseN]
1089 Operand 0: OMP_PARALLEL_BODY: Code to be executed by all threads.
1090 Operand 1: OMP_PARALLEL_CLAUSES: List of clauses. */
1091
1092DEFTREECODE (OMP_PARALLEL, "omp_parallel", tcc_statement, 2)
1093
1094/* OpenMP - #pragma omp task [clause1 ... clauseN]
1095 Operand 0: OMP_TASK_BODY: Code to be executed by all threads.
1096 Operand 1: OMP_TASK_CLAUSES: List of clauses. */
1097
1098DEFTREECODE (OMP_TASK, "omp_task", tcc_statement, 2)
1099
1100/* OpenMP - #pragma omp for [clause1 ... clauseN]
1101 Operand 0: OMP_FOR_BODY: Loop body.
1102 Operand 1: OMP_FOR_CLAUSES: List of clauses.
1103 Operand 2: OMP_FOR_INIT: Initialization code of the form
1104 VAR = N1.
1105 Operand 3: OMP_FOR_COND: Loop conditional expression of the form
1106 VAR { <, >, <=, >= } N2.
1107 Operand 4: OMP_FOR_INCR: Loop index increment of the form
1108 VAR { +=, -= } INCR.
1109 Operand 5: OMP_FOR_PRE_BODY: Filled by the gimplifier with things
1110 from INIT, COND, and INCR that are technically part of the
1111 OMP_FOR structured block, but are evaluated before the loop
1112 body begins.
1113 Operand 6: OMP_FOR_ORIG_DECLS: If non-NULL, list of DECLs initialized
1114 in OMP_FOR_INIT. In some cases, like C++ iterators, the original
1115 DECL init has been lost in gimplification and now contains a
1116 temporary (D.nnnn). This list contains the original DECLs in
1117 the source.
1118
1119 VAR must be an integer or pointer variable, which is implicitly thread
1120 private. N1, N2 and INCR are required to be loop invariant integer
1121 expressions that are evaluated without any synchronization.
1122 The evaluation order, frequency of evaluation and side-effects are
1123 unspecified by the standards. */
1124DEFTREECODE (OMP_FOR, "omp_for", tcc_statement, 7)
1125
1126/* OpenMP - #pragma omp simd [clause1 ... clauseN]
1127 Operands like for OMP_FOR. */
1128DEFTREECODE (OMP_SIMD, "omp_simd", tcc_statement, 7)
1129
1130/* Cilk Plus - #pragma simd [clause1 ... clauseN]
1131 Operands like for OMP_FOR. */
1132DEFTREECODE (CILK_SIMD, "cilk_simd", tcc_statement, 7)
1133
1134/* Cilk Plus - _Cilk_for (..)
1135 Operands like for OMP_FOR. */
1136DEFTREECODE (CILK_FOR, "cilk_for", tcc_statement, 7)
1137
1138/* OpenMP - #pragma omp distribute [clause1 ... clauseN]
1139 Operands like for OMP_FOR. */
1140DEFTREECODE (OMP_DISTRIBUTE, "omp_distribute", tcc_statement, 7)
1141
1142/* OpenMP - #pragma omp taskloop [clause1 ... clauseN]
1143 Operands like for OMP_FOR. */
1144DEFTREECODE (OMP_TASKLOOP, "omp_taskloop", tcc_statement, 7)
1145
1146/* OpenMP - #pragma acc loop [clause1 ... clauseN]
1147 Operands like for OMP_FOR. */
1148DEFTREECODE (OACC_LOOP, "oacc_loop", tcc_statement, 7)
1149
1150/* OpenMP - #pragma omp teams [clause1 ... clauseN]
1151 Operand 0: OMP_TEAMS_BODY: Teams body.
1152 Operand 1: OMP_TEAMS_CLAUSES: List of clauses. */
1153DEFTREECODE (OMP_TEAMS, "omp_teams", tcc_statement, 2)
1154
1155/* OpenMP - #pragma omp target data [clause1 ... clauseN]
1156 Operand 0: OMP_TARGET_DATA_BODY: Target data construct body.
1157 Operand 1: OMP_TARGET_DATA_CLAUSES: List of clauses. */
1158DEFTREECODE (OMP_TARGET_DATA, "omp_target_data", tcc_statement, 2)
1159
1160/* OpenMP - #pragma omp target [clause1 ... clauseN]
1161 Operand 0: OMP_TARGET_BODY: Target construct body.
1162 Operand 1: OMP_TARGET_CLAUSES: List of clauses. */
1163DEFTREECODE (OMP_TARGET, "omp_target", tcc_statement, 2)
1164
1165/* OpenMP - #pragma omp sections [clause1 ... clauseN]
1166 Operand 0: OMP_SECTIONS_BODY: Sections body.
1167 Operand 1: OMP_SECTIONS_CLAUSES: List of clauses. */
1168DEFTREECODE (OMP_SECTIONS, "omp_sections", tcc_statement, 2)
1169
1170/* OpenMP - #pragma omp ordered
1171 Operand 0: OMP_ORDERED_BODY: Master section body.
1172 Operand 1: OMP_ORDERED_CLAUSES: List of clauses. */
1173DEFTREECODE (OMP_ORDERED, "omp_ordered", tcc_statement, 2)
1174
1175/* OpenMP - #pragma omp critical [name]
1176 Operand 0: OMP_CRITICAL_BODY: Critical section body.
1177 Operand 1: OMP_CRITICAL_CLAUSES: List of clauses.
1178 Operand 2: OMP_CRITICAL_NAME: Identifier for critical section. */
1179DEFTREECODE (OMP_CRITICAL, "omp_critical", tcc_statement, 3)
1180
1181/* OpenMP - #pragma omp single
1182 Operand 0: OMP_SINGLE_BODY: Single section body.
1183 Operand 1: OMP_SINGLE_CLAUSES: List of clauses. */
1184DEFTREECODE (OMP_SINGLE, "omp_single", tcc_statement, 2)
1185
1186/* OpenMP - #pragma omp section
1187 Operand 0: OMP_SECTION_BODY: Section body. */
1188DEFTREECODE (OMP_SECTION, "omp_section", tcc_statement, 1)
1189
1190/* OpenMP - #pragma omp master
1191 Operand 0: OMP_MASTER_BODY: Master section body. */
1192DEFTREECODE (OMP_MASTER, "omp_master", tcc_statement, 1)
1193
1194/* OpenMP - #pragma omp taskgroup
1195 Operand 0: OMP_TASKGROUP_BODY: Taskgroup body. */
1196DEFTREECODE (OMP_TASKGROUP, "omp_taskgroup", tcc_statement, 1)
1197
1198/* OpenACC - #pragma acc cache (variable1 ... variableN)
1199 Operand 0: OACC_CACHE_CLAUSES: List of variables (transformed into
1200 OMP_CLAUSE__CACHE_ clauses). */
1201DEFTREECODE (OACC_CACHE, "oacc_cache", tcc_statement, 1)
1202
1203/* OpenACC - #pragma acc declare [clause1 ... clauseN]
1204 Operand 0: OACC_DECLARE_CLAUSES: List of clauses. */
1205DEFTREECODE (OACC_DECLARE, "oacc_declare", tcc_statement, 1)
1206
1207/* OpenACC - #pragma acc enter data [clause1 ... clauseN]
1208 Operand 0: OACC_ENTER_DATA_CLAUSES: List of clauses. */
1209DEFTREECODE (OACC_ENTER_DATA, "oacc_enter_data", tcc_statement, 1)
1210
1211/* OpenACC - #pragma acc exit data [clause1 ... clauseN]
1212 Operand 0: OACC_EXIT_DATA_CLAUSES: List of clauses. */
1213DEFTREECODE (OACC_EXIT_DATA, "oacc_exit_data", tcc_statement, 1)
1214
1215/* OpenACC - #pragma acc update [clause1 ... clauseN]
1216 Operand 0: OACC_UPDATE_CLAUSES: List of clauses. */
1217DEFTREECODE (OACC_UPDATE, "oacc_update", tcc_statement, 1)
1218
1219/* OpenMP - #pragma omp target update [clause1 ... clauseN]
1220 Operand 0: OMP_TARGET_UPDATE_CLAUSES: List of clauses. */
1221DEFTREECODE (OMP_TARGET_UPDATE, "omp_target_update", tcc_statement, 1)
1222
1223/* OpenMP - #pragma omp target enter data [clause1 ... clauseN]
1224 Operand 0: OMP_TARGET_ENTER_DATA_CLAUSES: List of clauses. */
1225DEFTREECODE (OMP_TARGET_ENTER_DATA, "omp_target_enter_data", tcc_statement, 1)
1226
1227/* OpenMP - #pragma omp target exit data [clause1 ... clauseN]
1228 Operand 0: OMP_TARGET_EXIT_DATA_CLAUSES: List of clauses. */
1229DEFTREECODE (OMP_TARGET_EXIT_DATA, "omp_target_exit_data", tcc_statement, 1)
1230
1231/* OMP_ATOMIC through OMP_ATOMIC_CAPTURE_NEW must be consecutive,
1232 or OMP_ATOMIC_SEQ_CST needs adjusting. */
1233
1234/* OpenMP - #pragma omp atomic
1235 Operand 0: The address at which the atomic operation is to be performed.
1236 This address should be stabilized with save_expr.
1237 Operand 1: The expression to evaluate. When the old value of the object
1238 at the address is used in the expression, it should appear as if
1239 build_fold_indirect_ref of the address. */
1240DEFTREECODE (OMP_ATOMIC, "omp_atomic", tcc_statement, 2)
1241
1242/* OpenMP - #pragma omp atomic read
1243 Operand 0: The address at which the atomic operation is to be performed.
1244 This address should be stabilized with save_expr. */
1245DEFTREECODE (OMP_ATOMIC_READ, "omp_atomic_read", tcc_statement, 1)
1246
1247/* OpenMP - #pragma omp atomic capture
1248 Operand 0: The address at which the atomic operation is to be performed.
1249 This address should be stabilized with save_expr.
1250 Operand 1: The expression to evaluate. When the old value of the object
1251 at the address is used in the expression, it should appear as if
1252 build_fold_indirect_ref of the address.
1253 OMP_ATOMIC_CAPTURE_OLD returns the old memory content,
1254 OMP_ATOMIC_CAPTURE_NEW the new value. */
1255DEFTREECODE (OMP_ATOMIC_CAPTURE_OLD, "omp_atomic_capture_old", tcc_statement, 2)
1256DEFTREECODE (OMP_ATOMIC_CAPTURE_NEW, "omp_atomic_capture_new", tcc_statement, 2)
1257
1258/* OpenMP clauses. */
1259DEFTREECODE (OMP_CLAUSE, "omp_clause", tcc_exceptional, 0)
1260
1261/* TRANSACTION_EXPR tree code.
1262 Operand 0: BODY: contains body of the transaction. */
1263DEFTREECODE (TRANSACTION_EXPR, "transaction_expr", tcc_expression, 1)
1264
1265/* Reduction operations.
1266 Operations that take a vector of elements and "reduce" it to a scalar
1267 result (e.g. summing the elements of the vector, finding the minimum over
1268 the vector elements, etc).
1269 Operand 0 is a vector.
1270 The expression returns a scalar, with type the same as the elements of the
1271 vector, holding the result of the reduction of all elements of the operand.
1272 */
1273DEFTREECODE (REDUC_MAX_EXPR, "reduc_max_expr", tcc_unary, 1)
1274DEFTREECODE (REDUC_MIN_EXPR, "reduc_min_expr", tcc_unary, 1)
1275DEFTREECODE (REDUC_PLUS_EXPR, "reduc_plus_expr", tcc_unary, 1)
1276
1277/* Widening dot-product.
1278 The first two arguments are of type t1.
1279 The third argument and the result are of type t2, such that t2 is at least
1280 twice the size of t1. DOT_PROD_EXPR(arg1,arg2,arg3) is equivalent to:
1281 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1282 arg3 = PLUS_EXPR (tmp, arg3);
1283 or:
1284 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1285 arg3 = WIDEN_SUM_EXPR (tmp, arg3); */
1286DEFTREECODE (DOT_PROD_EXPR, "dot_prod_expr", tcc_expression, 3)
1287
1288/* Widening summation.
1289 The first argument is of type t1.
1290 The second argument is of type t2, such that t2 is at least twice
1291 the size of t1. The type of the entire expression is also t2.
1292 WIDEN_SUM_EXPR is equivalent to first widening (promoting)
1293 the first argument from type t1 to type t2, and then summing it
1294 with the second argument. */
1295DEFTREECODE (WIDEN_SUM_EXPR, "widen_sum_expr", tcc_binary, 2)
1296
1297/* Widening sad (sum of absolute differences).
1298 The first two arguments are of type t1 which should be integer.
1299 The third argument and the result are of type t2, such that t2 is at least
1300 twice the size of t1. Like DOT_PROD_EXPR, SAD_EXPR (arg1,arg2,arg3) is
1301 equivalent to (note we don't have WIDEN_MINUS_EXPR now, but we assume its
1302 behavior is similar to WIDEN_SUM_EXPR):
1303 tmp = WIDEN_MINUS_EXPR (arg1, arg2)
1304 tmp2 = ABS_EXPR (tmp)
1305 arg3 = PLUS_EXPR (tmp2, arg3)
1306 or:
1307 tmp = WIDEN_MINUS_EXPR (arg1, arg2)
1308 tmp2 = ABS_EXPR (tmp)
1309 arg3 = WIDEN_SUM_EXPR (tmp2, arg3)
1310 */
1311DEFTREECODE (SAD_EXPR, "sad_expr", tcc_expression, 3)
1312
1313/* Widening multiplication.
1314 The two arguments are of type t1.
1315 The result is of type t2, such that t2 is at least twice
1316 the size of t1. WIDEN_MULT_EXPR is equivalent to first widening (promoting)
1317 the arguments from type t1 to type t2, and then multiplying them. */
1318DEFTREECODE (WIDEN_MULT_EXPR, "widen_mult_expr", tcc_binary, 2)
1319
1320/* Widening multiply-accumulate.
1321 The first two arguments are of type t1.
1322 The third argument and the result are of type t2, such as t2 is at least
1323 twice the size of t1. t1 and t2 must be integral or fixed-point types.
1324 The expression is equivalent to a WIDEN_MULT_EXPR operation
1325 of the first two operands followed by an add or subtract of the third
1326 operand. */
1327DEFTREECODE (WIDEN_MULT_PLUS_EXPR, "widen_mult_plus_expr", tcc_expression, 3)
1328/* This is like the above, except in the final expression the multiply result
1329 is subtracted from t3. */
1330DEFTREECODE (WIDEN_MULT_MINUS_EXPR, "widen_mult_minus_expr", tcc_expression, 3)
1331
1332/* Widening shift left.
1333 The first operand is of type t1.
1334 The second operand is the number of bits to shift by; it need not be the
1335 same type as the first operand and result.
1336 Note that the result is undefined if the second operand is larger
1337 than or equal to the first operand's type size.
1338 The type of the entire expression is t2, such that t2 is at least twice
1339 the size of t1.
1340 WIDEN_LSHIFT_EXPR is equivalent to first widening (promoting)
1341 the first argument from type t1 to type t2, and then shifting it
1342 by the second argument. */
1343DEFTREECODE (WIDEN_LSHIFT_EXPR, "widen_lshift_expr", tcc_binary, 2)
1344
1345/* Fused multiply-add.
1346 All operands and the result are of the same type. No intermediate
1347 rounding is performed after multiplying operand one with operand two
1348 before adding operand three. */
1349DEFTREECODE (FMA_EXPR, "fma_expr", tcc_expression, 3)
1350
1351/* Widening vector multiplication.
1352 The two operands are vectors with N elements of size S. Multiplying the
1353 elements of the two vectors will result in N products of size 2*S.
1354 VEC_WIDEN_MULT_HI_EXPR computes the N/2 high products.
1355 VEC_WIDEN_MULT_LO_EXPR computes the N/2 low products. */
1356DEFTREECODE (VEC_WIDEN_MULT_HI_EXPR, "widen_mult_hi_expr", tcc_binary, 2)
1357DEFTREECODE (VEC_WIDEN_MULT_LO_EXPR, "widen_mult_lo_expr", tcc_binary, 2)
1358
1359/* Similarly, but return the even or odd N/2 products. */
1360DEFTREECODE (VEC_WIDEN_MULT_EVEN_EXPR, "widen_mult_even_expr", tcc_binary, 2)
1361DEFTREECODE (VEC_WIDEN_MULT_ODD_EXPR, "widen_mult_odd_expr", tcc_binary, 2)
1362
1363/* Unpack (extract and promote/widen) the high/low elements of the input
1364 vector into the output vector. The input vector has twice as many
1365 elements as the output vector, that are half the size of the elements
1366 of the output vector. This is used to support type promotion. */
1367DEFTREECODE (VEC_UNPACK_HI_EXPR, "vec_unpack_hi_expr", tcc_unary, 1)
1368DEFTREECODE (VEC_UNPACK_LO_EXPR, "vec_unpack_lo_expr", tcc_unary, 1)
1369
1370/* Unpack (extract) the high/low elements of the input vector, convert
1371 fixed point values to floating point and widen elements into the
1372 output vector. The input vector has twice as many elements as the output
1373 vector, that are half the size of the elements of the output vector. */
1374DEFTREECODE (VEC_UNPACK_FLOAT_HI_EXPR, "vec_unpack_float_hi_expr", tcc_unary, 1)
1375DEFTREECODE (VEC_UNPACK_FLOAT_LO_EXPR, "vec_unpack_float_lo_expr", tcc_unary, 1)
1376
1377/* Pack (demote/narrow and merge) the elements of the two input vectors
1378 into the output vector using truncation/saturation.
1379 The elements of the input vectors are twice the size of the elements of the
1380 output vector. This is used to support type demotion. */
1381DEFTREECODE (VEC_PACK_TRUNC_EXPR, "vec_pack_trunc_expr", tcc_binary, 2)
1382DEFTREECODE (VEC_PACK_SAT_EXPR, "vec_pack_sat_expr", tcc_binary, 2)
1383
1384/* Convert floating point values of the two input vectors to integer
1385 and pack (narrow and merge) the elements into the output vector. The
1386 elements of the input vector are twice the size of the elements of
1387 the output vector. */
1388DEFTREECODE (VEC_PACK_FIX_TRUNC_EXPR, "vec_pack_fix_trunc_expr", tcc_binary, 2)
1389
1390/* Widening vector shift left in bits.
1391 Operand 0 is a vector to be shifted with N elements of size S.
1392 Operand 1 is an integer shift amount in bits.
1393 The result of the operation is N elements of size 2*S.
1394 VEC_WIDEN_LSHIFT_HI_EXPR computes the N/2 high results.
1395 VEC_WIDEN_LSHIFT_LO_EXPR computes the N/2 low results.
1396 */
1397DEFTREECODE (VEC_WIDEN_LSHIFT_HI_EXPR, "widen_lshift_hi_expr", tcc_binary, 2)
1398DEFTREECODE (VEC_WIDEN_LSHIFT_LO_EXPR, "widen_lshift_lo_expr", tcc_binary, 2)
1399
1400/* PREDICT_EXPR. Specify hint for branch prediction. The
1401 PREDICT_EXPR_PREDICTOR specify predictor and PREDICT_EXPR_OUTCOME the
1402 outcome (0 for not taken and 1 for taken). Once the profile is guessed
1403 all conditional branches leading to execution paths executing the
1404 PREDICT_EXPR will get predicted by the specified predictor. */
1405DEFTREECODE (PREDICT_EXPR, "predict_expr", tcc_expression, 1)
1406
1407/* OPTIMIZATION_NODE. Node to store the optimization options. */
1408DEFTREECODE (OPTIMIZATION_NODE, "optimization_node", tcc_exceptional, 0)
1409
1410/* TARGET_OPTION_NODE. Node to store the target specific options. */
1411DEFTREECODE (TARGET_OPTION_NODE, "target_option_node", tcc_exceptional, 0)
1412
1413/* ANNOTATE_EXPR.
1414 Operand 0 is the expression to be annotated.
1415 Operand 1 is the annotation kind. */
1416DEFTREECODE (ANNOTATE_EXPR, "annotate_expr", tcc_expression, 2)
1417
1418/* Cilk spawn statement
1419 Operand 0 is the CALL_EXPR. */
1420DEFTREECODE (CILK_SPAWN_STMT, "cilk_spawn_stmt", tcc_statement, 1)
1421
1422/* Cilk Sync statement: Does not have any operands. */
1423DEFTREECODE (CILK_SYNC_STMT, "cilk_sync_stmt", tcc_statement, 0)
1424
1425/*
1426Local variables:
1427mode:c
1428End:
1429*/
1430