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