1 /* This file contains the definitions and documentation for the
2 tree codes used in GCC.
3 Copyright (C) 1987, 1988, 1993, 1995, 1997, 1998, 2000, 2001, 2004, 2005,
4 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* For tcc_references, tcc_expression, tcc_comparison, tcc_unary,
24 tcc_binary, and tcc_statement nodes, which use struct tree_exp, the
25 4th element is the number of argument slots to allocate. This
26 determines the size of the tree node object. Other nodes use
27 different structures, and the size is determined by the tree_union
28 member structure; the 4th element should be zero. Languages that
29 define language-specific tcc_exceptional or tcc_constant codes must
30 define the tree_size langhook to say how big they are.
32 These tree codes have been sorted so that the macros in tree.h that
33 check for various tree codes are optimized into range checks. This
34 gives a measurable performance improvement. When adding a new
35 code, consider its placement in relation to the other codes. */
37 /* Any erroneous construct is parsed into a node of this type.
38 This type of node is accepted without complaint in all contexts
39 by later parsing activities, to avoid multiple error messages
41 No fields in these nodes are used except the TREE_CODE. */
42 DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 0)
44 /* Used to represent a name (such as, in the DECL_NAME of a decl node).
45 Internally it looks like a STRING_CST node.
46 There is only one IDENTIFIER_NODE ever made for any particular name.
47 Use `get_identifier' to get it (or create it, the first time). */
48 DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0)
50 /* Has the TREE_VALUE and TREE_PURPOSE fields. */
51 /* These nodes are made into lists by chaining through the
52 TREE_CHAIN field. The elements of the list live in the
53 TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
54 used as well to get the effect of Lisp association lists. */
55 DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0)
57 /* These nodes contain an array of tree nodes. */
58 DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0)
60 /* A symbol binding block. These are arranged in a tree,
61 where the BLOCK_SUBBLOCKS field contains a chain of subblocks
62 chained through the BLOCK_CHAIN field.
63 BLOCK_SUPERCONTEXT points to the parent block.
64 For a block which represents the outermost scope of a function, it
65 points to the FUNCTION_DECL node.
66 BLOCK_VARS points to a chain of decl nodes.
67 BLOCK_CHAIN points to the next BLOCK at the same level.
68 BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
69 this block is an instance of, or else is NULL to indicate that this
70 block is not an instance of anything else. When non-NULL, the value
71 could either point to another BLOCK node or it could point to a
72 FUNCTION_DECL node (e.g. in the case of a block representing the
73 outermost scope of a particular inlining of a function).
74 BLOCK_ABSTRACT is nonzero if the block represents an abstract
75 instance of a block (i.e. one which is nested within an abstract
76 instance of an inline function).
77 TREE_ASM_WRITTEN is nonzero if the block was actually referenced
78 in the generated assembly. */
79 DEFTREECODE (BLOCK, "block", tcc_exceptional, 0)
81 /* Each data type is represented by a tree node whose code is one of
83 /* Each node that represents a data type has a component TYPE_SIZE
84 containing a tree that is an expression for the size in bits.
85 The TYPE_MODE contains the machine mode for values of this type.
86 The TYPE_POINTER_TO field contains a type for a pointer to this type,
87 or zero if no such has been created yet.
88 The TYPE_NEXT_VARIANT field is used to chain together types
89 that are variants made by type modifiers such as "const" and "volatile".
90 The TYPE_MAIN_VARIANT field, in any member of such a chain,
91 points to the start of the chain.
92 The TYPE_NONCOPIED_PARTS field is a list specifying which parts
93 of an object of this type should *not* be copied by assignment.
94 The TREE_VALUE of each is a FIELD_DECL that should not be
95 copied. The TREE_PURPOSE is an initial value for that field when
96 an object of this type is initialized via an INIT_EXPR. It may
97 be NULL if no special value is required. Even the things in this
98 list are copied if the right-hand side of an assignment is known
99 to be a complete object (rather than being, perhaps, a subobject
100 of some other object.) The determination of what constitutes a
101 complete object is done by fixed_type_p.
102 The TYPE_NAME field contains info on the name used in the program
103 for this type (for GDB symbol table output). It is either a
104 TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
105 in the case of structs, unions or enums that are known with a tag,
106 or zero for types that have no special name.
107 The TYPE_CONTEXT for any sort of type which could have a name or
108 which could have named members (e.g. tagged types in C/C++) will
109 point to the node which represents the scope of the given type, or
110 will be NULL_TREE if the type has "file scope". For most types, this
111 will point to a BLOCK node or a FUNCTION_DECL node, but it could also
112 point to a FUNCTION_TYPE node (for types whose scope is limited to the
113 formal parameter list of some function type specification) or it
114 could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node
115 (for C++ "member" types).
116 For non-tagged-types, TYPE_CONTEXT need not be set to anything in
117 particular, since any type which is of some type category (e.g.
118 an array type or a function type) which cannot either have a name
119 itself or have named members doesn't really have a "scope" per se.
120 The TREE_CHAIN field is used as a forward-references to names for
121 ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes;
124 /* The ordering of the following codes is optimized for the checking
125 macros in tree.h. Changing the order will degrade the speed of the
126 compiler. OFFSET_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, INTEGER_TYPE,
127 REAL_TYPE, POINTER_TYPE. */
129 /* An offset is a pointer relative to an object.
130 The TREE_TYPE field is the type of the object at the offset.
131 The TYPE_OFFSET_BASETYPE points to the node for the type of object
132 that the offset is relative to. */
133 DEFTREECODE (OFFSET_TYPE, "offset_type", tcc_type, 0)
135 /* C enums. The type node looks just like an INTEGER_TYPE node.
136 The symbols for the values of the enum type are defined by
137 CONST_DECL nodes, but the type does not point to them;
138 however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE
139 is a name and the TREE_VALUE is the value (an INTEGER_CST node). */
140 /* A forward reference `enum foo' when no enum named foo is defined yet
141 has zero (a null pointer) in its TYPE_SIZE. The tag name is in
142 the TYPE_NAME field. If the type is later defined, the normal
143 fields are filled in.
144 RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are
145 treated similarly. */
146 DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0)
148 /* Boolean type (true or false are the only values). Looks like an
150 DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0)
152 /* Integer types in all languages, including char in C.
153 Also used for sub-ranges of other discrete types.
154 Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
155 and TYPE_PRECISION (number of bits used by this type).
156 In the case of a subrange type in Pascal, the TREE_TYPE
157 of this will point at the supertype (another INTEGER_TYPE,
158 or an ENUMERAL_TYPE or BOOLEAN_TYPE).
159 Otherwise, the TREE_TYPE is zero. */
160 DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 0)
162 /* C's float and double. Different floating types are distinguished
163 by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */
164 DEFTREECODE (REAL_TYPE, "real_type", tcc_type, 0)
166 /* The ordering of the following codes is optimized for the checking
167 macros in tree.h. Changing the order will degrade the speed of the
168 compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range
169 overlaps the previous range of ordered types. */
171 /* All pointer-to-x types have code POINTER_TYPE.
172 The TREE_TYPE points to the node for the type pointed to. */
173 DEFTREECODE (POINTER_TYPE, "pointer_type", tcc_type, 0)
175 /* _Fract and _Accum types in Embedded-C. Different fixed-point types
176 are distinguished by machine mode and by the TYPE_SIZE and the
178 DEFTREECODE (FIXED_POINT_TYPE, "fixed_point_type", tcc_type, 0)
180 /* A reference is like a pointer except that it is coerced
181 automatically to the value it points to. Used in C++. */
182 DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0)
184 /* The ordering of the following codes is optimized for the checking
185 macros in tree.h. Changing the order will degrade the speed of the
186 compiler. COMPLEX_TYPE, VECTOR_TYPE, ARRAY_TYPE. */
188 /* Complex number types. The TREE_TYPE field is the data type
189 of the real and imaginary parts. It must be of scalar
190 arithmetic type, not including pointer type. */
191 DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0)
193 /* Vector types. The TREE_TYPE field is the data type of the vector
194 elements. The TYPE_PRECISION field is the number of subparts of
196 DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0)
198 /* The ordering of the following codes is optimized for the checking
199 macros in tree.h. Changing the order will degrade the speed of the
200 compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE.
201 Note that this range overlaps the previous range. */
203 /* Types of arrays. Special fields:
204 TREE_TYPE Type of an array element.
205 TYPE_DOMAIN Type to index by.
206 Its range of values specifies the array length.
207 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
208 and holds the type to coerce a value of that array type to in C.
209 TYPE_STRING_FLAG indicates a string (in contrast to an array of chars)
210 in languages (such as Chill) that make a distinction. */
211 /* Array types in C or Pascal */
212 DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0)
214 /* Struct in C, or record in Pascal. */
216 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct,
217 and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables,
218 types and enumerators.
219 A few may need to be added for Pascal. */
220 /* See the comment above, before ENUMERAL_TYPE, for how
221 forward references to struct tags are handled in C. */
222 DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0)
224 /* Union in C. Like a struct, except that the offsets of the fields
226 /* See the comment above, before ENUMERAL_TYPE, for how
227 forward references to union tags are handled in C. */
228 DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */
230 /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER
231 in each FIELD_DECL determine what the union contains. The first
232 field whose DECL_QUALIFIER expression is true is deemed to occupy
234 DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0)
236 /* The ordering of the following codes is optimized for the checking
237 macros in tree.h. Changing the order will degrade the speed of the
238 compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */
240 /* The void type in C */
241 DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0)
243 /* Type of functions. Special fields:
244 TREE_TYPE type of value returned.
245 TYPE_ARG_TYPES list of types of arguments expected.
246 this list is made of TREE_LIST nodes.
247 Types of "Procedures" in languages where they are different from functions
248 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
249 DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0)
251 /* METHOD_TYPE is the type of a function which takes an extra first
252 argument for "self", which is not present in the declared argument list.
253 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
254 is the type of "self". TYPE_ARG_TYPES is the real argument list, which
255 includes the hidden argument for "self". */
256 DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0)
258 /* This is a language-specific kind of type.
259 Its meaning is defined by the language front end.
260 layout_type does not know how to lay this out,
261 so the front-end must do so manually. */
262 DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0)
266 /* First, the constants. */
268 /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
269 32 bits each, giving us a 64 bit constant capability. INTEGER_CST
270 nodes can be shared, and therefore should be considered read only.
271 They should be copied, before setting a flag such as TREE_OVERFLOW.
272 If an INTEGER_CST has TREE_OVERFLOW already set, it is known to be unique.
273 INTEGER_CST nodes are created for the integral types, for pointer
274 types and for vector and float types in some circumstances. */
275 DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0)
277 /* Contents are in TREE_REAL_CST field. */
278 DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0)
280 /* Contents are in TREE_FIXED_CST field. */
281 DEFTREECODE (FIXED_CST, "fixed_cst", tcc_constant, 0)
283 /* Contents are in TREE_REALPART and TREE_IMAGPART fields,
284 whose contents are other constant nodes. */
285 DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0)
287 /* Contents are in TREE_VECTOR_CST_ELTS field. */
288 DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0)
290 /* Contents are TREE_STRING_LENGTH and the actual contents of the string. */
291 DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0)
293 /* Declarations. All references to names are represented as ..._DECL
294 nodes. The decls in one binding context are chained through the
295 TREE_CHAIN field. Each DECL has a DECL_NAME field which contains
296 an IDENTIFIER_NODE. (Some decls, most often labels, may have zero
297 as the DECL_NAME). DECL_CONTEXT points to the node representing
298 the context in which this declaration has its scope. For
299 FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
300 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
301 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
302 points to either the FUNCTION_DECL for the containing function, the
303 RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or
304 a TRANSLATION_UNIT_DECL if the given decl has "file scope".
305 DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
306 ..._DECL node of which this decl is an (inlined or template expanded)
308 The TREE_TYPE field holds the data type of the object, when relevant.
309 LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field
310 contents are the type whose name is being declared.
311 The DECL_ALIGN, DECL_SIZE,
312 and DECL_MODE fields exist in decl nodes just as in type nodes.
313 They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
315 DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for
316 the location. DECL_VOFFSET holds an expression for a variable
317 offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer).
318 These fields are relevant only in FIELD_DECLs and PARM_DECLs.
320 DECL_INITIAL holds the value to initialize a variable to,
321 or the value of a constant. For a function, it holds the body
322 (a node of type BLOCK representing the function's binding contour
323 and whose body contains the function's statements.) For a LABEL_DECL
324 in C, it is a flag, nonzero if the label's definition has been seen.
326 PARM_DECLs use a special field:
327 DECL_ARG_TYPE is the type in which the argument is actually
328 passed, which may be different from its type within the function.
330 FUNCTION_DECLs use four special fields:
331 DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
332 DECL_RESULT holds a RESULT_DECL node for the value of a function.
333 The DECL_RTL field is 0 for a function that returns no value.
334 (C functions returning void have zero here.)
335 The TREE_TYPE field is the type in which the result is actually
336 returned. This is usually the same as the return type of the
337 FUNCTION_DECL, but it may be a wider integer type because of
339 DECL_FUNCTION_CODE is a code number that is nonzero for
340 built-in functions. Its value is an enum built_in_function
341 that says which built-in function it is.
343 DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
344 holds a line number. In some cases these can be the location of
345 a reference, if no definition has been seen.
347 DECL_ABSTRACT is nonzero if the decl represents an abstract instance
348 of a decl (i.e. one which is nested within an abstract instance of a
351 DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0)
352 DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0)
353 /* The ordering of the following codes is optimized for the checking
354 macros in tree.h. Changing the order will degrade the speed of the
355 compiler. FIELD_DECL, VAR_DECL, CONST_DECL, PARM_DECL,
357 DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0)
358 DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0)
359 DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0)
360 DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0)
361 DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0)
362 DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0)
364 /* Memory tags used in tree-ssa to represent memory locations in
366 DEFTREECODE (NAME_MEMORY_TAG, "name_memory_tag", tcc_declaration, 0)
367 DEFTREECODE (SYMBOL_MEMORY_TAG, "symbol_memory_tag", tcc_declaration, 0)
368 DEFTREECODE (MEMORY_PARTITION_TAG, "memory_partition_tag", tcc_declaration, 0)
370 /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other
371 _DECLs, providing a hierarchy of names. */
372 DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0)
374 /* A declaration import.
375 The C++ FE uses this to represent a using-directive; eg:
376 "using namespace foo".
377 But it could be used to represent any declaration import construct.
378 Whenever a declaration import appears in a lexical block, the BLOCK node
379 representing that lexical block in GIMPLE will contain an IMPORTED_DECL
380 node, linked via BLOCK_VARS accessor of the said BLOCK.
381 For a given NODE which code is IMPORTED_DECL,
382 IMPORTED_DECL_ASSOCIATED_DECL (NODE) accesses the imported declaration. */
383 DEFTREECODE (IMPORTED_DECL, "imported_decl", tcc_declaration, 0)
385 /* A translation unit. This is not technically a declaration, since it
386 can't be looked up, but it's close enough. */
387 DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\
390 /* References to storage. */
392 /* Value is structure or union component.
393 Operand 0 is the structure or union (an expression).
394 Operand 1 is the field (a node of type FIELD_DECL).
395 Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured
396 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */
397 DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3)
399 /* Reference to a group of bits within an object. Similar to COMPONENT_REF
400 except the position is given explicitly rather than via a FIELD_DECL.
401 Operand 0 is the structure or union expression;
402 operand 1 is a tree giving the constant number of bits being referenced;
403 operand 2 is a tree giving the constant position of the first referenced bit.
404 The result type width has to match the number of bits referenced.
405 If the result type is integral, its signedness specifies how it is extended
406 to its mode width. */
407 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3)
409 /* The ordering of the following codes is optimized for the checking
410 macros in tree.h. Changing the order will degrade the speed of the
411 compiler. INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */
413 /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
414 DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1)
416 /* Like above, but aligns the referenced address (i.e, if the address
417 in P is not aligned on TYPE_ALIGN boundary, then &(*P) != P). */
418 DEFTREECODE (ALIGN_INDIRECT_REF, "align_indirect_ref", tcc_reference, 1)
420 /* Same as INDIRECT_REF, but also specifies the alignment of the referenced
422 Operand 0 is the referenced address (a pointer);
423 Operand 1 is an INTEGER_CST which represents the alignment of the address,
424 or 0 if the alignment is unknown. */
425 DEFTREECODE (MISALIGNED_INDIRECT_REF, "misaligned_indirect_ref", tcc_reference, 2)
428 Operand 0 is the array; operand 1 is a (single) array index.
429 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
430 Operand 3, if present, is the element size, measured in units of
431 the alignment of the element type. */
432 DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4)
434 /* Likewise, except that the result is a range ("slice") of the array. The
435 starting index of the resulting array is taken from operand 1 and the size
436 of the range is taken from the type of the expression. */
437 DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4)
439 /* Used to represent lookup of runtime type dependent data. Often this is
440 a reference to a vtable, but it needn't be. Operands are:
441 OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use.
442 OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is
443 being performed. Through this the optimizers may be able to statically
444 determine the dynamic type of the object.
445 OBJ_TYPE_REF_TOKEN: Something front-end specific used to resolve the
446 reference to something simpler, usually to the address of a DECL.
447 Never touched by the middle-end. Good choices would be either an
448 identifier or a vtable index. */
449 DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3)
451 /* The exception object from the runtime. */
452 DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", tcc_expression, 0)
454 /* The filter object from the runtime. */
455 DEFTREECODE (FILTER_EXPR, "filter_expr", tcc_expression, 0)
457 /* Constructor: return an aggregate value made from specified components.
458 In C, this is used only for structure and array initializers.
459 The operand is a sequence of component values made out of a VEC of
460 struct constructor_elt.
463 The field INDEX of each constructor_elt is the corresponding index.
464 If the index is a RANGE_EXPR, it is a short-hand for many nodes,
465 one for each index in the range. (If the corresponding field VALUE
466 has side-effects, they are evaluated once for each element. Wrap the
467 value in a SAVE_EXPR if you want to evaluate side effects only once.)
469 For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE:
470 The field INDEX of each node is a FIELD_DECL. */
471 DEFTREECODE (CONSTRUCTOR, "constructor", tcc_exceptional, 0)
473 /* The expression types are mostly straightforward, with the fourth argument
474 of DEFTREECODE saying how many operands there are.
475 Unless otherwise specified, the operands are expressions and the
476 types of all the operands and the expression must all be the same. */
478 /* Contains two expressions to compute, one followed by the other.
479 the first value is ignored. The second one's value is used. The
480 type of the first expression need not agree with the other types. */
481 DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2)
483 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */
484 DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2)
486 /* Initialization expression. Operand 0 is the variable to initialize;
487 Operand 1 is the initializer. This differs from MODIFY_EXPR in that any
488 reference to the referent of operand 0 within operand 1 is undefined. */
489 DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2)
491 /* For TARGET_EXPR, operand 0 is the target of an initialization,
492 operand 1 is the initializer for the target, which may be void
493 if simply expanding it initializes the target.
494 operand 2 is the cleanup for this node, if any.
495 operand 3 is the saved initializer after this node has been
496 expanded once; this is so we can re-expand the tree later. */
497 DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4)
499 /* Conditional expression ( ... ? ... : ... in C).
500 Operand 0 is the condition.
501 Operand 1 is the then-value.
502 Operand 2 is the else-value.
503 Operand 0 may be of any type.
504 Operand 1 must have the same type as the entire expression, unless
505 it unconditionally throws an exception, in which case it should
506 have VOID_TYPE. The same constraints apply to operand 2. The
507 condition in operand 0 must be of integral type.
509 In cfg gimple, if you do not have a selection expression, operands
510 1 and 2 are NULL. The operands are then taken from the cfg edges. */
511 DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3)
513 /* Vector conditional expression. It is like COND_EXPR, but with
516 A = VEC_COND_EXPR ( X < Y, B, C)
521 A[i] = X[i] < Y[i] ? B[i] : C[i];
523 DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", tcc_expression, 3)
525 /* Declare local variables, including making RTL and allocating space.
526 BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables.
527 BIND_EXPR_BODY is the body, the expression to be computed using
528 the variables. The value of operand 1 becomes that of the BIND_EXPR.
529 BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings
530 for debugging purposes. If this BIND_EXPR is actually expanded,
531 that sets the TREE_USED flag in the BLOCK.
533 The BIND_EXPR is not responsible for informing parsers
534 about these variables. If the body is coming from the input file,
535 then the code that creates the BIND_EXPR is also responsible for
536 informing the parser of the variables.
538 If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
539 This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
540 If the BIND_EXPR should be output for debugging but will not be expanded,
541 set the TREE_USED flag by hand.
543 In order for the BIND_EXPR to be known at all, the code that creates it
544 must also install it as a subblock in the tree of BLOCK
545 nodes for the function. */
546 DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3)
548 /* Function call. CALL_EXPRs are represented by variably-sized expression
549 nodes. There are at least three fixed operands. Operand 0 is an
550 INTEGER_CST node containing the total operand count, the number of
551 arguments plus 3. Operand 1 is the function, while operand 2 is
552 is static chain argument, or NULL. The remaining operands are the
553 arguments to the call. */
554 DEFTREECODE (CALL_EXPR, "call_expr", tcc_vl_exp, 3)
556 /* Specify a value to compute along with its corresponding cleanup.
557 Operand 0 is the cleanup expression.
558 The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR,
559 which must exist. This differs from TRY_CATCH_EXPR in that operand 1
560 is always evaluated when cleanups are run. */
561 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1)
563 /* Specify a cleanup point.
564 Operand 0 is an expression that may have cleanups. If it does, those
565 cleanups are executed after the expression is expanded.
567 Note that if the expression is a reference to storage, it is forced out
568 of memory before the cleanups are run. This is necessary to handle
569 cases where the cleanups modify the storage referenced; in the
570 expression 't.i', if 't' is a struct with an integer member 'i' and a
571 cleanup which modifies 'i', the value of the expression depends on
572 whether the cleanup is run before or after 't.i' is evaluated. When
573 expand_expr is run on 't.i', it returns a MEM. This is not good enough;
574 the value of 't.i' must be forced out of memory.
576 As a consequence, the operand of a CLEANUP_POINT_EXPR must not have
577 BLKmode, because it will not be forced out of memory. */
578 DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1)
580 /* The following two codes are used in languages that have types where
581 some field in an object of the type contains a value that is used in
582 the computation of another field's offset or size and/or the size of
583 the type. The positions and/or sizes of fields can vary from object
584 to object of the same type or even for one and the same object within
587 Record types with discriminants in Ada or schema types in Pascal are
588 examples of such types. This mechanism is also used to create "fat
589 pointers" for unconstrained array types in Ada; the fat pointer is a
590 structure one of whose fields is a pointer to the actual array type
591 and the other field is a pointer to a template, which is a structure
592 containing the bounds of the array. The bounds in the type pointed
593 to by the first field in the fat pointer refer to the values in the
596 When you wish to construct such a type you need "self-references"
597 that allow you to reference the object having this type from the
598 TYPE node, i.e. without having a variable instantiating this type.
600 Such a "self-references" is done using a PLACEHOLDER_EXPR. This is
601 a node that will later be replaced with the object being referenced.
602 Its type is that of the object and selects which object to use from
603 a chain of references (see below). No other slots are used in the
606 For example, if your type FOO is a RECORD_TYPE with a field BAR,
607 and you need the value of <variable>.BAR to calculate TYPE_SIZE
608 (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR
609 whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with
610 the PLACEHOLDER_EXPR as the first operand (which has the correct
611 type). Later, when the size is needed in the program, the back-end
612 will find this PLACEHOLDER_EXPR and generate code to calculate the
613 actual size at run-time. In the following, we describe how this
616 When we wish to evaluate a size or offset, we check whether it contains a
617 PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr
618 passing both that tree and an expression within which the object may be
619 found. The latter expression is the object itself in the simple case of
620 an Ada record with discriminant, but it can be the array in the case of an
623 In the latter case, we need the fat pointer, because the bounds of
624 the array can only be accessed from it. However, we rely here on the
625 fact that the expression for the array contains the dereference of
626 the fat pointer that obtained the array pointer. */
628 /* Denotes a record to later be substituted before evaluating this expression.
629 The type of this expression is used to find the record to replace it. */
630 DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0)
632 /* Simple arithmetic. */
633 DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2)
634 DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2)
635 DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2)
637 /* Pointer addition. The first operand is always a pointer and the
638 second operand is an integer of type sizetype. */
639 DEFTREECODE (POINTER_PLUS_EXPR, "pointer_plus_expr", tcc_binary, 2)
641 /* Division for integer result that rounds the quotient toward zero. */
642 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2)
644 /* Division for integer result that rounds the quotient toward infinity. */
645 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2)
647 /* Division for integer result that rounds toward minus infinity. */
648 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2)
650 /* Division for integer result that rounds toward nearest integer. */
651 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2)
653 /* Four kinds of remainder that go with the four kinds of division. */
654 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2)
655 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2)
656 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2)
657 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2)
659 /* Division for real result. */
660 DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2)
662 /* Division which is not supposed to need rounding.
663 Used for pointer subtraction in C. */
664 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2)
666 /* Conversion of real to fixed point by truncation. */
667 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1)
669 /* Conversion of an integer to a real. */
670 DEFTREECODE (FLOAT_EXPR, "float_expr", tcc_unary, 1)
672 /* Unary negation. */
673 DEFTREECODE (NEGATE_EXPR, "negate_expr", tcc_unary, 1)
675 /* Minimum and maximum values. When used with floating point, if both
676 operands are zeros, or if either operand is NaN, then it is unspecified
677 which of the two operands is returned as the result. */
678 DEFTREECODE (MIN_EXPR, "min_expr", tcc_binary, 2)
679 DEFTREECODE (MAX_EXPR, "max_expr", tcc_binary, 2)
681 /* Represents the absolute value of the operand.
683 An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The
684 operand of the ABS_EXPR must have the same type. */
685 DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1)
687 /* Shift operations for shift and rotate.
688 Shift means logical shift if done on an
689 unsigned type, arithmetic shift if done on a signed type.
690 The second operand is the number of bits to
691 shift by; it need not be the same type as the first operand and result.
692 Note that the result is undefined if the second operand is larger
693 than or equal to the first operand's type size.
695 The first operand of a shift can have either an integer or a
696 (non-integer) fixed-point type. We follow the ISO/IEC TR 18037:2004
697 semantics for the latter.
699 Rotates are defined for integer types only. */
700 DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2)
701 DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2)
702 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2)
703 DEFTREECODE (RROTATE_EXPR, "rrotate_expr", tcc_binary, 2)
705 /* Bitwise operations. Operands have same mode as result. */
706 DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", tcc_binary, 2)
707 DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", tcc_binary, 2)
708 DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", tcc_binary, 2)
709 DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", tcc_unary, 1)
711 /* ANDIF and ORIF allow the second operand not to be computed if the
712 value of the expression is determined from the first operand. AND,
713 OR, and XOR always compute the second operand whether its value is
714 needed or not (for side effects). The operand may have
715 BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be
716 either zero or one. For example, a TRUTH_NOT_EXPR will never have
717 an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be
718 used to compare the VAR_DECL to zero, thereby obtaining a node with
719 value zero or one. */
720 DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", tcc_expression, 2)
721 DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", tcc_expression, 2)
722 DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", tcc_expression, 2)
723 DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", tcc_expression, 2)
724 DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", tcc_expression, 2)
725 DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", tcc_expression, 1)
727 /* Relational operators.
728 `EQ_EXPR' and `NE_EXPR' are allowed for any types.
729 The others are allowed only for integer (or pointer or enumeral)
731 In all cases the operands will have the same type,
732 and the value is always the type used by the language for booleans. */
733 DEFTREECODE (LT_EXPR, "lt_expr", tcc_comparison, 2)
734 DEFTREECODE (LE_EXPR, "le_expr", tcc_comparison, 2)
735 DEFTREECODE (GT_EXPR, "gt_expr", tcc_comparison, 2)
736 DEFTREECODE (GE_EXPR, "ge_expr", tcc_comparison, 2)
737 DEFTREECODE (EQ_EXPR, "eq_expr", tcc_comparison, 2)
738 DEFTREECODE (NE_EXPR, "ne_expr", tcc_comparison, 2)
740 /* Additional relational operators for floating point unordered. */
741 DEFTREECODE (UNORDERED_EXPR, "unordered_expr", tcc_comparison, 2)
742 DEFTREECODE (ORDERED_EXPR, "ordered_expr", tcc_comparison, 2)
744 /* These are equivalent to unordered or ... */
745 DEFTREECODE (UNLT_EXPR, "unlt_expr", tcc_comparison, 2)
746 DEFTREECODE (UNLE_EXPR, "unle_expr", tcc_comparison, 2)
747 DEFTREECODE (UNGT_EXPR, "ungt_expr", tcc_comparison, 2)
748 DEFTREECODE (UNGE_EXPR, "unge_expr", tcc_comparison, 2)
749 DEFTREECODE (UNEQ_EXPR, "uneq_expr", tcc_comparison, 2)
751 /* This is the reverse of uneq_expr. */
752 DEFTREECODE (LTGT_EXPR, "ltgt_expr", tcc_comparison, 2)
754 DEFTREECODE (RANGE_EXPR, "range_expr", tcc_binary, 2)
756 /* Represents a re-association barrier for floating point expressions
757 like explicit parenthesis in fortran. */
758 DEFTREECODE (PAREN_EXPR, "paren_expr", tcc_unary, 1)
760 /* Represents a conversion of type of a value.
761 All conversions, including implicit ones, must be
762 represented by CONVERT_EXPR or NOP_EXPR nodes. */
763 DEFTREECODE (CONVERT_EXPR, "convert_expr", tcc_unary, 1)
765 /* Conversion of a fixed-point value to an integer, a real, or a fixed-point
766 value. Or conversion of a fixed-point value from an integer, a real, or
767 a fixed-point value. */
768 DEFTREECODE (FIXED_CONVERT_EXPR, "fixed_convert_expr", tcc_unary, 1)
770 /* Represents a conversion expected to require no code to be generated. */
771 DEFTREECODE (NOP_EXPR, "nop_expr", tcc_unary, 1)
773 /* Value is same as argument, but guaranteed not an lvalue. */
774 DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", tcc_unary, 1)
776 /* Represents viewing something of one type as being of a second type.
777 This corresponds to an "Unchecked Conversion" in Ada and roughly to
778 the idiom *(type2 *)&X in C. The only operand is the value to be
779 viewed as being of another type. It is undefined if the type of the
780 input and of the expression have different sizes.
782 This code may also be used within the LHS of a MODIFY_EXPR, in which
783 case no actual data motion may occur. TREE_ADDRESSABLE will be set in
784 this case and GCC must abort if it could not do the operation without
786 DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", tcc_reference, 1)
788 /* A COMPOUND_LITERAL_EXPR represents a literal that is placed in a DECL. The
789 COMPOUND_LITERAL_EXPR_DECL_EXPR is the a DECL_EXPR containing the decl
790 for the anonymous object represented by the COMPOUND_LITERAL;
791 the DECL_INITIAL of that decl is the CONSTRUCTOR that initializes
792 the compound literal. */
793 DEFTREECODE (COMPOUND_LITERAL_EXPR, "compound_literal_expr", tcc_expression, 1)
795 /* Represents something we computed once and will use multiple times.
796 First operand is that expression. After it is evaluated once, it
797 will be replaced by the temporary variable that holds the value. */
798 DEFTREECODE (SAVE_EXPR, "save_expr", tcc_expression, 1)
800 /* & in C. Value is the address at which the operand's value resides.
801 Operand may have any mode. Result mode is Pmode. */
802 DEFTREECODE (ADDR_EXPR, "addr_expr", tcc_expression, 1)
804 /* Operand0 is a function constant; result is part N of a function
805 descriptor of type ptr_mode. */
806 DEFTREECODE (FDESC_EXPR, "fdesc_expr", tcc_expression, 2)
808 /* Given two real or integer operands of the same type,
809 returns a complex value of the corresponding complex type. */
810 DEFTREECODE (COMPLEX_EXPR, "complex_expr", tcc_binary, 2)
812 /* Complex conjugate of operand. Used only on complex types. */
813 DEFTREECODE (CONJ_EXPR, "conj_expr", tcc_unary, 1)
815 /* Used only on an operand of complex type, these return
816 a value of the corresponding component type. */
817 DEFTREECODE (REALPART_EXPR, "realpart_expr", tcc_reference, 1)
818 DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", tcc_reference, 1)
820 /* Nodes for ++ and -- in C.
821 The second arg is how much to increment or decrement by.
822 For a pointer, it would be the size of the object pointed to. */
823 DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", tcc_expression, 2)
824 DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", tcc_expression, 2)
825 DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", tcc_expression, 2)
826 DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", tcc_expression, 2)
828 /* Used to implement `va_arg'. */
829 DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", tcc_expression, 1)
831 /* Evaluate operand 1. If and only if an exception is thrown during
832 the evaluation of operand 1, evaluate operand 2.
834 This differs from TRY_FINALLY_EXPR in that operand 2 is not evaluated
835 on a normal or jump exit, only on an exception. */
836 DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", tcc_statement, 2)
838 /* Evaluate the first operand.
839 The second operand is a cleanup expression which is evaluated
840 on any exit (normal, exception, or jump out) from this expression. */
841 DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", tcc_statement, 2)
843 /* These types of expressions have no useful value,
844 and always have side effects. */
846 /* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */
847 DEFTREECODE (DECL_EXPR, "decl_expr", tcc_statement, 1)
849 /* A label definition, encapsulated as a statement.
850 Operand 0 is the LABEL_DECL node for the label that appears here.
851 The type should be void and the value should be ignored. */
852 DEFTREECODE (LABEL_EXPR, "label_expr", tcc_statement, 1)
854 /* GOTO. Operand 0 is a LABEL_DECL node or an expression.
855 The type should be void and the value should be ignored. */
856 DEFTREECODE (GOTO_EXPR, "goto_expr", tcc_statement, 1)
858 /* RETURN. Evaluates operand 0, then returns from the current function.
859 Presumably that operand is an assignment that stores into the
860 RESULT_DECL that hold the value to be returned.
861 The operand may be null.
862 The type should be void and the value should be ignored. */
863 DEFTREECODE (RETURN_EXPR, "return_expr", tcc_statement, 1)
865 /* Exit the inner most loop conditionally. Operand 0 is the condition.
866 The type should be void and the value should be ignored. */
867 DEFTREECODE (EXIT_EXPR, "exit_expr", tcc_statement, 1)
869 /* A loop. Operand 0 is the body of the loop.
870 It must contain an EXIT_EXPR or is an infinite loop.
871 The type should be void and the value should be ignored. */
872 DEFTREECODE (LOOP_EXPR, "loop_expr", tcc_statement, 1)
874 /* Switch expression.
876 TREE_TYPE is the original type of the condition, before any
877 language required type conversions. It may be NULL, in which case
878 the original type and final types are assumed to be the same.
880 Operand 0 is the expression used to perform the branch,
881 Operand 1 is the body of the switch, which probably contains
882 CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2
884 Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs
886 DEFTREECODE (SWITCH_EXPR, "switch_expr", tcc_statement, 3)
888 /* Used to represent a case label. The operands are CASE_LOW and
889 CASE_HIGH, respectively. If CASE_LOW is NULL_TREE, the label is a
890 'default' label. If CASE_HIGH is NULL_TREE, the label is a normal case
891 label. CASE_LABEL is the corresponding LABEL_DECL. */
892 DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", tcc_statement, 3)
894 /* RESX. Resume execution after an exception. Operand 0 is a
895 number indicating the exception region that is being left. */
896 DEFTREECODE (RESX_EXPR, "resx_expr", tcc_statement, 1)
898 /* Used to represent an inline assembly statement. ASM_STRING returns a
899 STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS,
900 ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers
901 for the statement. */
902 DEFTREECODE (ASM_EXPR, "asm_expr", tcc_statement, 4)
904 /* Variable references for SSA analysis. New SSA names are created every
905 time a variable is assigned a new value. The SSA builder uses SSA_NAME
906 nodes to implement SSA versioning. */
907 DEFTREECODE (SSA_NAME, "ssa_name", tcc_exceptional, 0)
909 /* Used to represent a typed exception handler. CATCH_TYPES is the type (or
910 list of types) handled, and CATCH_BODY is the code for the handler. */
911 DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2)
913 /* Used to represent an exception specification. EH_FILTER_TYPES is a list
914 of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on
915 failure. EH_FILTER_MUST_NOT_THROW controls which range type to use when
917 DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2)
919 /* Indicates a change in the dynamic type of a memory location. This
920 has no value and generates no executable code. It is only used for
921 type based alias analysis. This is generated by C++ placement new.
922 CHANGE_DYNAMIC_TYPE_NEW_TYPE, the first operand, is the new type.
923 CHANGE_DYNAMIC_TYPE_LOCATION, the second operand, is the location
924 whose type is being changed. */
925 DEFTREECODE (CHANGE_DYNAMIC_TYPE_EXPR, "change_dynamic_type_expr",
928 /* Node used for describing a property that is known at compile
930 DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0)
932 /* Node used for describing a property that is not known at compile
934 DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0)
936 /* Polynomial chains of recurrences.
937 Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */
938 DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3)
940 /* Used to chain children of container statements together.
941 Use the interface in tree-iterator.h to access this node. */
942 DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0)
944 /* Predicate assertion. Artificial expression generated by the optimizers
945 to keep track of predicate values. This expression may only appear on
946 the RHS of assignments.
948 Given X = ASSERT_EXPR <Y, EXPR>, the optimizers can infer
952 2- EXPR is a conditional expression and is known to be true.
954 Valid and to be expected forms of conditional expressions are
955 valid GIMPLE conditional expressions (as defined by is_gimple_condexpr)
956 and conditional expressions with the first operand being a
957 PLUS_EXPR with a variable possibly wrapped in a NOP_EXPR first
958 operand and an integer constant second operand.
960 The type of the expression is the same as Y. */
961 DEFTREECODE (ASSERT_EXPR, "assert_expr", tcc_expression, 2)
963 /* Base class information. Holds information about a class as a
964 baseclass of itself or another class. */
965 DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0)
967 /* Records the size for an expression of variable size type. This is
968 for use in contexts in which we are accessing the entire object,
969 such as for a function call, or block copy.
970 Operand 0 is the real expression.
971 Operand 1 is the size of the type in the expression. */
972 DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2)
974 /* Extract elements from two input vectors Operand 0 and Operand 1
975 size VS, according to the offset OFF defined by Operand 2 as
977 If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to
978 the first OFF elements of the vector OP1.
979 If OFF == 0, then the returned vector is OP1.
980 On different targets OFF may take different forms; It can be an address, in
981 which case its low log2(VS)-1 bits define the offset, or it can be a mask
982 generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */
983 DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3)
985 /* Low-level memory addressing. Operands are SYMBOL (static or global
986 variable), BASE (register), INDEX (register), STEP (integer constant),
987 OFFSET (integer constant). Corresponding address is
988 SYMBOL + BASE + STEP * INDEX + OFFSET. Only variations and values valid on
989 the target are allowed.
991 The type of STEP, INDEX and OFFSET is sizetype. The type of BASE is
992 sizetype or a pointer type (if SYMBOL is NULL).
994 The sixth argument is the reference to the original memory access, which
995 is preserved for the purposes of the RTL alias analysis. The seventh
996 argument is a tag representing results of the tree level alias analysis. */
998 DEFTREECODE (TARGET_MEM_REF, "target_mem_ref", tcc_reference, 7)
1000 /* The ordering of the codes between OMP_PARALLEL and OMP_CRITICAL is
1001 exposed to TREE_RANGE_CHECK. */
1002 /* OpenMP - #pragma omp parallel [clause1 ... clauseN]
1003 Operand 0: OMP_PARALLEL_BODY: Code to be executed by all threads.
1004 Operand 1: OMP_PARALLEL_CLAUSES: List of clauses. */
1006 DEFTREECODE (OMP_PARALLEL, "omp_parallel", tcc_statement, 2)
1008 /* OpenMP - #pragma omp task [clause1 ... clauseN]
1009 Operand 0: OMP_TASK_BODY: Code to be executed by all threads.
1010 Operand 1: OMP_TASK_CLAUSES: List of clauses. */
1012 DEFTREECODE (OMP_TASK, "omp_task", tcc_statement, 2)
1014 /* OpenMP - #pragma omp for [clause1 ... clauseN]
1015 Operand 0: OMP_FOR_BODY: Loop body.
1016 Operand 1: OMP_FOR_CLAUSES: List of clauses.
1017 Operand 2: OMP_FOR_INIT: Initialization code of the form
1019 Operand 3: OMP_FOR_COND: Loop conditional expression of the form
1020 VAR { <, >, <=, >= } N2.
1021 Operand 4: OMP_FOR_INCR: Loop index increment of the form
1022 VAR { +=, -= } INCR.
1023 Operand 5: OMP_FOR_PRE_BODY: Filled by the gimplifier with things
1024 from INIT, COND, and INCR that are technically part of the
1025 OMP_FOR structured block, but are evaluated before the loop
1028 VAR must be an integer or pointer variable, which is implicitly thread
1029 private. N1, N2 and INCR are required to be loop invariant integer
1030 expressions that are evaluated without any synchronization.
1031 The evaluation order, frequency of evaluation and side-effects are
1032 unspecified by the standard. */
1033 DEFTREECODE (OMP_FOR, "omp_for", tcc_statement, 6)
1035 /* OpenMP - #pragma omp sections [clause1 ... clauseN]
1036 Operand 0: OMP_SECTIONS_BODY: Sections body.
1037 Operand 1: OMP_SECTIONS_CLAUSES: List of clauses. */
1038 DEFTREECODE (OMP_SECTIONS, "omp_sections", tcc_statement, 2)
1040 /* OpenMP - #pragma omp single
1041 Operand 0: OMP_SINGLE_BODY: Single section body.
1042 Operand 1: OMP_SINGLE_CLAUSES: List of clauses. */
1043 DEFTREECODE (OMP_SINGLE, "omp_single", tcc_statement, 2)
1045 /* OpenMP - #pragma omp section
1046 Operand 0: OMP_SECTION_BODY: Section body. */
1047 DEFTREECODE (OMP_SECTION, "omp_section", tcc_statement, 1)
1049 /* OpenMP - #pragma omp master
1050 Operand 0: OMP_MASTER_BODY: Master section body. */
1051 DEFTREECODE (OMP_MASTER, "omp_master", tcc_statement, 1)
1053 /* OpenMP - #pragma omp ordered
1054 Operand 0: OMP_ORDERED_BODY: Master section body. */
1055 DEFTREECODE (OMP_ORDERED, "omp_ordered", tcc_statement, 1)
1057 /* OpenMP - #pragma omp critical [name]
1058 Operand 0: OMP_CRITICAL_BODY: Critical section body.
1059 Operand 1: OMP_CRITICAL_NAME: Identifier for critical section. */
1060 DEFTREECODE (OMP_CRITICAL, "omp_critical", tcc_statement, 2)
1062 /* OpenMP - #pragma omp atomic
1063 Operand 0: The address at which the atomic operation is to be performed.
1064 This address should be stabilized with save_expr.
1065 Operand 1: The expression to evaluate. When the old value of the object
1066 at the address is used in the expression, it should appear as if
1067 build_fold_indirect_ref of the address. */
1068 DEFTREECODE (OMP_ATOMIC, "omp_atomic", tcc_statement, 2)
1070 /* OpenMP clauses. */
1071 DEFTREECODE (OMP_CLAUSE, "omp_clause", tcc_exceptional, 0)
1073 /* Reduction operations.
1074 Operations that take a vector of elements and "reduce" it to a scalar
1075 result (e.g. summing the elements of the vector, finding the minimum over
1076 the vector elements, etc).
1077 Operand 0 is a vector; the first element in the vector has the result.
1078 Operand 1 is a vector. */
1079 DEFTREECODE (REDUC_MAX_EXPR, "reduc_max_expr", tcc_unary, 1)
1080 DEFTREECODE (REDUC_MIN_EXPR, "reduc_min_expr", tcc_unary, 1)
1081 DEFTREECODE (REDUC_PLUS_EXPR, "reduc_plus_expr", tcc_unary, 1)
1083 /* Widening dot-product.
1084 The first two arguments are of type t1.
1085 The third argument and the result are of type t2, such that t2 is at least
1086 twice the size of t1. DOT_PROD_EXPR(arg1,arg2,arg3) is equivalent to:
1087 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1088 arg3 = PLUS_EXPR (tmp, arg3);
1090 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1091 arg3 = WIDEN_SUM_EXPR (tmp, arg3); */
1092 DEFTREECODE (DOT_PROD_EXPR, "dot_prod_expr", tcc_expression, 3)
1094 /* Widening summation.
1095 The first argument is of type t1.
1096 The second argument is of type t2, such that t2 is at least twice
1097 the size of t1. The type of the entire expression is also t2.
1098 WIDEN_SUM_EXPR is equivalent to first widening (promoting)
1099 the first argument from type t1 to type t2, and then summing it
1100 with the second argument. */
1101 DEFTREECODE (WIDEN_SUM_EXPR, "widen_sum_expr", tcc_binary, 2)
1103 /* Widening multiplication.
1104 The two arguments are of type t1.
1105 The result is of type t2, such that t2 is at least twice
1106 the size of t1. WIDEN_MULT_EXPR is equivalent to first widening (promoting)
1107 the arguments from type t1 to type t2, and then multiplying them. */
1108 DEFTREECODE (WIDEN_MULT_EXPR, "widen_mult_expr", tcc_binary, 2)
1110 /* Whole vector left/right shift in bits.
1111 Operand 0 is a vector to be shifted.
1112 Operand 1 is an integer shift amount in bits. */
1113 DEFTREECODE (VEC_LSHIFT_EXPR, "vec_lshift_expr", tcc_binary, 2)
1114 DEFTREECODE (VEC_RSHIFT_EXPR, "vec_rshift_expr", tcc_binary, 2)
1116 /* Widening vector multiplication.
1117 The two operands are vectors with N elements of size S. Multiplying the
1118 elements of the two vectors will result in N products of size 2*S.
1119 VEC_WIDEN_MULT_HI_EXPR computes the N/2 high products.
1120 VEC_WIDEN_MULT_LO_EXPR computes the N/2 low products. */
1121 DEFTREECODE (VEC_WIDEN_MULT_HI_EXPR, "widen_mult_hi_expr", tcc_binary, 2)
1122 DEFTREECODE (VEC_WIDEN_MULT_LO_EXPR, "widen_mult_lo_expr", tcc_binary, 2)
1124 /* Unpack (extract and promote/widen) the high/low elements of the input
1125 vector into the output vector. The input vector has twice as many
1126 elements as the output vector, that are half the size of the elements
1127 of the output vector. This is used to support type promotion. */
1128 DEFTREECODE (VEC_UNPACK_HI_EXPR, "vec_unpack_hi_expr", tcc_unary, 1)
1129 DEFTREECODE (VEC_UNPACK_LO_EXPR, "vec_unpack_lo_expr", tcc_unary, 1)
1131 /* Unpack (extract) the high/low elements of the input vector, convert
1132 fixed point values to floating point and widen elements into the
1133 output vector. The input vector has twice as many elements as the output
1134 vector, that are half the size of the elements of the output vector. */
1135 DEFTREECODE (VEC_UNPACK_FLOAT_HI_EXPR, "vec_unpack_float_hi_expr", tcc_unary, 1)
1136 DEFTREECODE (VEC_UNPACK_FLOAT_LO_EXPR, "vec_unpack_float_lo_expr", tcc_unary, 1)
1138 /* Pack (demote/narrow and merge) the elements of the two input vectors
1139 into the output vector using truncation/saturation.
1140 The elements of the input vectors are twice the size of the elements of the
1141 output vector. This is used to support type demotion. */
1142 DEFTREECODE (VEC_PACK_TRUNC_EXPR, "vec_pack_trunc_expr", tcc_binary, 2)
1143 DEFTREECODE (VEC_PACK_SAT_EXPR, "vec_pack_sat_expr", tcc_binary, 2)
1145 /* Convert floating point values of the two input vectors to integer
1146 and pack (narrow and merge) the elements into the output vector. The
1147 elements of the input vector are twice the size of the elements of
1148 the output vector. */
1149 DEFTREECODE (VEC_PACK_FIX_TRUNC_EXPR, "vec_pack_fix_trunc_expr", tcc_binary, 2)
1151 /* Extract even/odd fields from vectors. */
1152 DEFTREECODE (VEC_EXTRACT_EVEN_EXPR, "vec_extracteven_expr", tcc_binary, 2)
1153 DEFTREECODE (VEC_EXTRACT_ODD_EXPR, "vec_extractodd_expr", tcc_binary, 2)
1155 /* Merge input vectors interleaving their fields. */
1156 DEFTREECODE (VEC_INTERLEAVE_HIGH_EXPR, "vec_interleavehigh_expr", tcc_binary, 2)
1157 DEFTREECODE (VEC_INTERLEAVE_LOW_EXPR, "vec_interleavelow_expr", tcc_binary, 2)
1159 /* PREDICT_EXPR. Specify hint for branch prediction. The
1160 PREDICT_EXPR_PREDICTOR specify predictor and PREDICT_EXPR_OUTCOME the
1161 outcome (0 for not taken and 1 for taken). Once the profile is guessed
1162 all conditional branches leading to execution paths executing the
1163 PREDICT_EXPR will get predicted by the specified predictor. */
1164 DEFTREECODE (PREDICT_EXPR, "predict_expr", tcc_expression, 1)
1166 /* OPTIMIZATION_NODE. Node to store the optimization options. */
1167 DEFTREECODE (OPTIMIZATION_NODE, "optimization_node", tcc_exceptional, 0)
1169 /* TARGET_OPTION_NODE. Node to store the target specific options. */
1170 DEFTREECODE (TARGET_OPTION_NODE, "target_option_node", tcc_exceptional, 0)