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 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 /* A reference is like a pointer except that it is coerced
176 automatically to the value it points to. Used in C++. */
177 DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0)
179 /* The ordering of the following codes is optimized for the checking
180 macros in tree.h. Changing the order will degrade the speed of the
181 compiler. COMPLEX_TYPE, VECTOR_TYPE, ARRAY_TYPE. */
183 /* Complex number types. The TREE_TYPE field is the data type
184 of the real and imaginary parts. */
185 DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0)
187 /* Vector types. The TREE_TYPE field is the data type of the vector
188 elements. The TYPE_PRECISION field is the number of subparts of
190 DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0)
192 /* The ordering of the following codes is optimized for the checking
193 macros in tree.h. Changing the order will degrade the speed of the
194 compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE.
195 Note that this range overlaps the previous range. */
197 /* Types of arrays. Special fields:
198 TREE_TYPE Type of an array element.
199 TYPE_DOMAIN Type to index by.
200 Its range of values specifies the array length.
201 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
202 and holds the type to coerce a value of that array type to in C.
203 TYPE_STRING_FLAG indicates a string (in contrast to an array of chars)
204 in languages (such as Chill) that make a distinction. */
205 /* Array types in C or Pascal */
206 DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0)
208 /* Struct in C, or record in Pascal. */
210 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct,
211 and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables,
212 types and enumerators.
213 A few may need to be added for Pascal. */
214 /* See the comment above, before ENUMERAL_TYPE, for how
215 forward references to struct tags are handled in C. */
216 DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0)
218 /* Union in C. Like a struct, except that the offsets of the fields
220 /* See the comment above, before ENUMERAL_TYPE, for how
221 forward references to union tags are handled in C. */
222 DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */
224 /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER
225 in each FIELD_DECL determine what the union contains. The first
226 field whose DECL_QUALIFIER expression is true is deemed to occupy
228 DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0)
230 /* The ordering of the following codes is optimized for the checking
231 macros in tree.h. Changing the order will degrade the speed of the
232 compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */
234 /* The void type in C */
235 DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0)
237 /* Type of functions. Special fields:
238 TREE_TYPE type of value returned.
239 TYPE_ARG_TYPES list of types of arguments expected.
240 this list is made of TREE_LIST nodes.
241 Types of "Procedures" in languages where they are different from functions
242 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
243 DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0)
245 /* METHOD_TYPE is the type of a function which takes an extra first
246 argument for "self", which is not present in the declared argument list.
247 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
248 is the type of "self". TYPE_ARG_TYPES is the real argument list, which
249 includes the hidden argument for "self". */
250 DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0)
252 /* This is a language-specific kind of type.
253 Its meaning is defined by the language front end.
254 layout_type does not know how to lay this out,
255 so the front-end must do so manually. */
256 DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0)
260 /* First, the constants. */
262 /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
263 32 bits each, giving us a 64 bit constant capability. INTEGER_CST
264 nodes can be shared, and therefore should be considered read only.
265 They should be copied, before setting a flag such as
266 TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW or
267 TREE_CONSTANT_OVERFLOW already set, it is known to be unique.
268 INTEGER_CST nodes are created for the integral types, for pointer
269 types and for vector and float types in some circumstances. */
270 DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0)
272 /* Contents are in TREE_REAL_CST field. */
273 DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0)
275 /* Contents are in TREE_REALPART and TREE_IMAGPART fields,
276 whose contents are other constant nodes. */
277 DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0)
279 /* Contents are in TREE_VECTOR_CST_ELTS field. */
280 DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0)
282 /* Contents are TREE_STRING_LENGTH and the actual contents of the string. */
283 DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0)
285 /* Declarations. All references to names are represented as ..._DECL
286 nodes. The decls in one binding context are chained through the
287 TREE_CHAIN field. Each DECL has a DECL_NAME field which contains
288 an IDENTIFIER_NODE. (Some decls, most often labels, may have zero
289 as the DECL_NAME). DECL_CONTEXT points to the node representing
290 the context in which this declaration has its scope. For
291 FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
292 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
293 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
294 points to either the FUNCTION_DECL for the containing function, the
295 RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or
296 a TRANSLATION_UNIT_DECL if the given decl has "file scope".
297 DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
298 ..._DECL node of which this decl is an (inlined or template expanded)
300 The TREE_TYPE field holds the data type of the object, when relevant.
301 LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field
302 contents are the type whose name is being declared.
303 The DECL_ALIGN, DECL_SIZE,
304 and DECL_MODE fields exist in decl nodes just as in type nodes.
305 They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
307 DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for
308 the location. DECL_VOFFSET holds an expression for a variable
309 offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer).
310 These fields are relevant only in FIELD_DECLs and PARM_DECLs.
312 DECL_INITIAL holds the value to initialize a variable to,
313 or the value of a constant. For a function, it holds the body
314 (a node of type BLOCK representing the function's binding contour
315 and whose body contains the function's statements.) For a LABEL_DECL
316 in C, it is a flag, nonzero if the label's definition has been seen.
318 PARM_DECLs use a special field:
319 DECL_ARG_TYPE is the type in which the argument is actually
320 passed, which may be different from its type within the function.
322 FUNCTION_DECLs use four special fields:
323 DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
324 DECL_RESULT holds a RESULT_DECL node for the value of a function.
325 The DECL_RTL field is 0 for a function that returns no value.
326 (C functions returning void have zero here.)
327 The TREE_TYPE field is the type in which the result is actually
328 returned. This is usually the same as the return type of the
329 FUNCTION_DECL, but it may be a wider integer type because of
331 DECL_FUNCTION_CODE is a code number that is nonzero for
332 built-in functions. Its value is an enum built_in_function
333 that says which built-in function it is.
335 DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
336 holds a line number. In some cases these can be the location of
337 a reference, if no definition has been seen.
339 DECL_ABSTRACT is nonzero if the decl represents an abstract instance
340 of a decl (i.e. one which is nested within an abstract instance of a
343 DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0)
344 DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0)
345 /* The ordering of the following codes is optimized for the checking
346 macros in tree.h. Changing the order will degrade the speed of the
347 compiler. FIELD_DECL, VAR_DECL, CONST_DECL, PARM_DECL,
349 DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0)
350 DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0)
351 DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0)
352 DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0)
353 DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0)
354 DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0)
356 /* Memory tags used in tree-ssa to represent memory locations in
358 DEFTREECODE (STRUCT_FIELD_TAG, "struct_field_tag", tcc_declaration, 0)
359 DEFTREECODE (NAME_MEMORY_TAG, "name_memory_tag", tcc_declaration, 0)
360 DEFTREECODE (SYMBOL_MEMORY_TAG, "symbol_memory_tag", tcc_declaration, 0)
361 DEFTREECODE (MEMORY_PARTITION_TAG, "memory_partition_tag", tcc_declaration, 0)
363 /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other
364 _DECLs, providing a hierarchy of names. */
365 DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0)
367 /* A translation unit. This is not technically a declaration, since it
368 can't be looked up, but it's close enough. */
369 DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\
372 /* References to storage. */
374 /* Value is structure or union component.
375 Operand 0 is the structure or union (an expression).
376 Operand 1 is the field (a node of type FIELD_DECL).
377 Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured
378 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */
379 DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3)
381 /* Reference to a group of bits within an object. Similar to COMPONENT_REF
382 except the position is given explicitly rather than via a FIELD_DECL.
383 Operand 0 is the structure or union expression;
384 operand 1 is a tree giving the number of bits being referenced;
385 operand 2 is a tree giving the position of the first referenced bit.
386 The field can be either a signed or unsigned field;
387 BIT_FIELD_REF_UNSIGNED says which. */
388 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3)
390 /* The ordering of the following codes is optimized for the checking
391 macros in tree.h. Changing the order will degrade the speed of the
392 compiler. INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */
394 /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
395 DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1)
397 /* Like above, but aligns the referenced address (i.e, if the address
398 in P is not aligned on TYPE_ALIGN boundary, then &(*P) != P). */
399 DEFTREECODE (ALIGN_INDIRECT_REF, "align_indirect_ref", tcc_reference, 1)
401 /* Same as INDIRECT_REF, but also specifies the alignment of the referenced
403 Operand 0 is the referenced address (a pointer);
404 Operand 1 is an INTEGER_CST which represents the alignment of the address,
405 or 0 if the alignment is unknown. */
406 DEFTREECODE (MISALIGNED_INDIRECT_REF, "misaligned_indirect_ref", tcc_reference, 2)
409 Operand 0 is the array; operand 1 is a (single) array index.
410 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
411 Operand 3, if present, is the element size, measured in units of
412 the alignment of the element type. */
413 DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4)
415 /* Likewise, except that the result is a range ("slice") of the array. The
416 starting index of the resulting array is taken from operand 1 and the size
417 of the range is taken from the type of the expression. */
418 DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4)
420 /* Used to represent lookup of runtime type dependent data. Often this is
421 a reference to a vtable, but it needn't be. Operands are:
422 OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use.
423 OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is
424 being performed. Through this the optimizers may be able to statically
425 determine the dynamic type of the object.
426 OBJ_TYPE_REF_TOKEN: Something front-end specific used to resolve the
427 reference to something simpler, usually to the address of a DECL.
428 Never touched by the middle-end. Good choices would be either an
429 identifier or a vtable index. */
430 DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3)
432 /* The exception object from the runtime. */
433 DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", tcc_expression, 0)
435 /* The filter object from the runtime. */
436 DEFTREECODE (FILTER_EXPR, "filter_expr", tcc_expression, 0)
438 /* Constructor: return an aggregate value made from specified components.
439 In C, this is used only for structure and array initializers.
440 The operand is a sequence of component values made out of a VEC of
441 struct constructor_elt.
444 The field INDEX of each constructor_elt is the corresponding index.
445 If the index is a RANGE_EXPR, it is a short-hand for many nodes,
446 one for each index in the range. (If the corresponding field VALUE
447 has side-effects, they are evaluated once for each element. Wrap the
448 value in a SAVE_EXPR if you want to evaluate side effects only once.)
450 For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE:
451 The field INDEX of each node is a FIELD_DECL. */
452 DEFTREECODE (CONSTRUCTOR, "constructor", tcc_exceptional, 0)
454 /* The expression types are mostly straightforward, with the fourth argument
455 of DEFTREECODE saying how many operands there are.
456 Unless otherwise specified, the operands are expressions and the
457 types of all the operands and the expression must all be the same. */
459 /* Contains two expressions to compute, one followed by the other.
460 the first value is ignored. The second one's value is used. The
461 type of the first expression need not agree with the other types. */
462 DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2)
464 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */
465 DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2)
467 /* Initialization expression. Operand 0 is the variable to initialize;
468 Operand 1 is the initializer. This differs from MODIFY_EXPR in that any
469 reference to the referent of operand 0 within operand 1 is undefined. */
470 DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2)
472 /* For TARGET_EXPR, operand 0 is the target of an initialization,
473 operand 1 is the initializer for the target, which may be void
474 if simply expanding it initializes the target.
475 operand 2 is the cleanup for this node, if any.
476 operand 3 is the saved initializer after this node has been
477 expanded once; this is so we can re-expand the tree later. */
478 DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4)
480 /* Conditional expression ( ... ? ... : ... in C).
481 Operand 0 is the condition.
482 Operand 1 is the then-value.
483 Operand 2 is the else-value.
484 Operand 0 may be of any type.
485 Operand 1 must have the same type as the entire expression, unless
486 it unconditionally throws an exception, in which case it should
487 have VOID_TYPE. The same constraints apply to operand 2. The
488 condition in operand 0 must be of integral type. */
489 DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3)
491 /* Vector conditional expression. It is like COND_EXPR, but with
494 A = VEC_COND_EXPR ( X < Y, B, C)
499 A[i] = X[i] < Y[i] ? B[i] : C[i];
501 DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", tcc_expression, 3)
503 /* Declare local variables, including making RTL and allocating space.
504 BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables.
505 BIND_EXPR_BODY is the body, the expression to be computed using
506 the variables. The value of operand 1 becomes that of the BIND_EXPR.
507 BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings
508 for debugging purposes. If this BIND_EXPR is actually expanded,
509 that sets the TREE_USED flag in the BLOCK.
511 The BIND_EXPR is not responsible for informing parsers
512 about these variables. If the body is coming from the input file,
513 then the code that creates the BIND_EXPR is also responsible for
514 informing the parser of the variables.
516 If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
517 This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
518 If the BIND_EXPR should be output for debugging but will not be expanded,
519 set the TREE_USED flag by hand.
521 In order for the BIND_EXPR to be known at all, the code that creates it
522 must also install it as a subblock in the tree of BLOCK
523 nodes for the function. */
524 DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3)
526 /* Function call. CALL_EXPRs are represented by variably-sized expression
527 nodes. There are at least three fixed operands. Operand 0 is an
528 INTEGER_CST node containing the total operand count, the number of
529 arguments plus 3. Operand 1 is the function, while operand 2 is
530 is static chain argument, or NULL. The remaining operands are the
531 arguments to the call. */
532 DEFTREECODE (CALL_EXPR, "call_expr", tcc_vl_exp, 3)
534 /* Specify a value to compute along with its corresponding cleanup.
535 Operand 0 is the cleanup expression.
536 The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR,
537 which must exist. This differs from TRY_CATCH_EXPR in that operand 1
538 is always evaluated when cleanups are run. */
539 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1)
541 /* Specify a cleanup point.
542 Operand 0 is an expression that may have cleanups. If it does, those
543 cleanups are executed after the expression is expanded.
545 Note that if the expression is a reference to storage, it is forced out
546 of memory before the cleanups are run. This is necessary to handle
547 cases where the cleanups modify the storage referenced; in the
548 expression 't.i', if 't' is a struct with an integer member 'i' and a
549 cleanup which modifies 'i', the value of the expression depends on
550 whether the cleanup is run before or after 't.i' is evaluated. When
551 expand_expr is run on 't.i', it returns a MEM. This is not good enough;
552 the value of 't.i' must be forced out of memory.
554 As a consequence, the operand of a CLEANUP_POINT_EXPR must not have
555 BLKmode, because it will not be forced out of memory. */
556 DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1)
558 /* The following two codes are used in languages that have types where
559 some field in an object of the type contains a value that is used in
560 the computation of another field's offset or size and/or the size of
561 the type. The positions and/or sizes of fields can vary from object
562 to object of the same type or even for one and the same object within
565 Record types with discriminants in Ada or schema types in Pascal are
566 examples of such types. This mechanism is also used to create "fat
567 pointers" for unconstrained array types in Ada; the fat pointer is a
568 structure one of whose fields is a pointer to the actual array type
569 and the other field is a pointer to a template, which is a structure
570 containing the bounds of the array. The bounds in the type pointed
571 to by the first field in the fat pointer refer to the values in the
574 When you wish to construct such a type you need "self-references"
575 that allow you to reference the object having this type from the
576 TYPE node, i.e. without having a variable instantiating this type.
578 Such a "self-references" is done using a PLACEHOLDER_EXPR. This is
579 a node that will later be replaced with the object being referenced.
580 Its type is that of the object and selects which object to use from
581 a chain of references (see below). No other slots are used in the
584 For example, if your type FOO is a RECORD_TYPE with a field BAR,
585 and you need the value of <variable>.BAR to calculate TYPE_SIZE
586 (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR
587 whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with
588 the PLACEHOLDER_EXPR as the first operand (which has the correct
589 type). Later, when the size is needed in the program, the back-end
590 will find this PLACEHOLDER_EXPR and generate code to calculate the
591 actual size at run-time. In the following, we describe how this
594 When we wish to evaluate a size or offset, we check whether it contains a
595 PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr
596 passing both that tree and an expression within which the object may be
597 found. The latter expression is the object itself in the simple case of
598 an Ada record with discriminant, but it can be the array in the case of an
601 In the latter case, we need the fat pointer, because the bounds of
602 the array can only be accessed from it. However, we rely here on the
603 fact that the expression for the array contains the dereference of
604 the fat pointer that obtained the array pointer. */
606 /* Denotes a record to later be substituted before evaluating this expression.
607 The type of this expression is used to find the record to replace it. */
608 DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0)
610 /* Simple arithmetic. */
611 DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2)
612 DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2)
613 DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2)
615 /* Pointer addition. The first operand is always a pointer and the
616 second operand is an integer of type sizetype. */
617 DEFTREECODE (POINTER_PLUS_EXPR, "pointer_plus_expr", tcc_binary, 2)
619 /* Division for integer result that rounds the quotient toward zero. */
620 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2)
622 /* Division for integer result that rounds the quotient toward infinity. */
623 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2)
625 /* Division for integer result that rounds toward minus infinity. */
626 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2)
628 /* Division for integer result that rounds toward nearest integer. */
629 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2)
631 /* Four kinds of remainder that go with the four kinds of division. */
632 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2)
633 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2)
634 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2)
635 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2)
637 /* Division for real result. */
638 DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2)
640 /* Division which is not supposed to need rounding.
641 Used for pointer subtraction in C. */
642 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2)
644 /* Conversion of real to fixed point by truncation. */
645 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1)
647 /* Conversion of an integer to a real. */
648 DEFTREECODE (FLOAT_EXPR, "float_expr", tcc_unary, 1)
650 /* Unary negation. */
651 DEFTREECODE (NEGATE_EXPR, "negate_expr", tcc_unary, 1)
653 /* Minimum and maximum values. When used with floating point, if both
654 operands are zeros, or if either operand is NaN, then it is unspecified
655 which of the two operands is returned as the result. */
656 DEFTREECODE (MIN_EXPR, "min_expr", tcc_binary, 2)
657 DEFTREECODE (MAX_EXPR, "max_expr", tcc_binary, 2)
659 /* Represents the absolute value of the operand.
661 An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The
662 operand of the ABS_EXPR must have the same type. */
663 DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1)
665 /* Shift operations for shift and rotate.
666 Shift means logical shift if done on an
667 unsigned type, arithmetic shift if done on a signed type.
668 The second operand is the number of bits to
669 shift by; it need not be the same type as the first operand and result.
670 Note that the result is undefined if the second operand is larger
671 than or equal to the first operand's type size. */
672 DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2)
673 DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2)
674 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2)
675 DEFTREECODE (RROTATE_EXPR, "rrotate_expr", tcc_binary, 2)
677 /* Bitwise operations. Operands have same mode as result. */
678 DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", tcc_binary, 2)
679 DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", tcc_binary, 2)
680 DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", tcc_binary, 2)
681 DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", tcc_unary, 1)
683 /* ANDIF and ORIF allow the second operand not to be computed if the
684 value of the expression is determined from the first operand. AND,
685 OR, and XOR always compute the second operand whether its value is
686 needed or not (for side effects). The operand may have
687 BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be
688 either zero or one. For example, a TRUTH_NOT_EXPR will never have
689 an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be
690 used to compare the VAR_DECL to zero, thereby obtaining a node with
691 value zero or one. */
692 DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", tcc_expression, 2)
693 DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", tcc_expression, 2)
694 DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", tcc_expression, 2)
695 DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", tcc_expression, 2)
696 DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", tcc_expression, 2)
697 DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", tcc_expression, 1)
699 /* Relational operators.
700 `EQ_EXPR' and `NE_EXPR' are allowed for any types.
701 The others are allowed only for integer (or pointer or enumeral)
703 In all cases the operands will have the same type,
704 and the value is always the type used by the language for booleans. */
705 DEFTREECODE (LT_EXPR, "lt_expr", tcc_comparison, 2)
706 DEFTREECODE (LE_EXPR, "le_expr", tcc_comparison, 2)
707 DEFTREECODE (GT_EXPR, "gt_expr", tcc_comparison, 2)
708 DEFTREECODE (GE_EXPR, "ge_expr", tcc_comparison, 2)
709 DEFTREECODE (EQ_EXPR, "eq_expr", tcc_comparison, 2)
710 DEFTREECODE (NE_EXPR, "ne_expr", tcc_comparison, 2)
712 /* Additional relational operators for floating point unordered. */
713 DEFTREECODE (UNORDERED_EXPR, "unordered_expr", tcc_comparison, 2)
714 DEFTREECODE (ORDERED_EXPR, "ordered_expr", tcc_comparison, 2)
716 /* These are equivalent to unordered or ... */
717 DEFTREECODE (UNLT_EXPR, "unlt_expr", tcc_comparison, 2)
718 DEFTREECODE (UNLE_EXPR, "unle_expr", tcc_comparison, 2)
719 DEFTREECODE (UNGT_EXPR, "ungt_expr", tcc_comparison, 2)
720 DEFTREECODE (UNGE_EXPR, "unge_expr", tcc_comparison, 2)
721 DEFTREECODE (UNEQ_EXPR, "uneq_expr", tcc_comparison, 2)
723 /* This is the reverse of uneq_expr. */
724 DEFTREECODE (LTGT_EXPR, "ltgt_expr", tcc_comparison, 2)
726 DEFTREECODE (RANGE_EXPR, "range_expr", tcc_binary, 2)
728 /* Represents a conversion of type of a value.
729 All conversions, including implicit ones, must be
730 represented by CONVERT_EXPR or NOP_EXPR nodes. */
731 DEFTREECODE (CONVERT_EXPR, "convert_expr", tcc_unary, 1)
733 /* Represents a conversion expected to require no code to be generated. */
734 DEFTREECODE (NOP_EXPR, "nop_expr", tcc_unary, 1)
736 /* Value is same as argument, but guaranteed not an lvalue. */
737 DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", tcc_unary, 1)
739 /* Represents viewing something of one type as being of a second type.
740 This corresponds to an "Unchecked Conversion" in Ada and roughly to
741 the idiom *(type2 *)&X in C. The only operand is the value to be
742 viewed as being of another type. It is undefined if the type of the
743 input and of the expression have different sizes.
745 This code may also be used within the LHS of a MODIFY_EXPR, in which
746 case no actual data motion may occur. TREE_ADDRESSABLE will be set in
747 this case and GCC must abort if it could not do the operation without
749 DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", tcc_reference, 1)
751 /* Represents something we computed once and will use multiple times.
752 First operand is that expression. After it is evaluated once, it
753 will be replaced by the temporary variable that holds the value. */
754 DEFTREECODE (SAVE_EXPR, "save_expr", tcc_expression, 1)
756 /* & in C. Value is the address at which the operand's value resides.
757 Operand may have any mode. Result mode is Pmode. */
758 DEFTREECODE (ADDR_EXPR, "addr_expr", tcc_expression, 1)
760 /* Operand0 is a function constant; result is part N of a function
761 descriptor of type ptr_mode. */
762 DEFTREECODE (FDESC_EXPR, "fdesc_expr", tcc_expression, 2)
764 /* Given two real or integer operands of the same type,
765 returns a complex value of the corresponding complex type. */
766 DEFTREECODE (COMPLEX_EXPR, "complex_expr", tcc_binary, 2)
768 /* Complex conjugate of operand. Used only on complex types. */
769 DEFTREECODE (CONJ_EXPR, "conj_expr", tcc_unary, 1)
771 /* Used only on an operand of complex type, these return
772 a value of the corresponding component type. */
773 DEFTREECODE (REALPART_EXPR, "realpart_expr", tcc_reference, 1)
774 DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", tcc_reference, 1)
776 /* Nodes for ++ and -- in C.
777 The second arg is how much to increment or decrement by.
778 For a pointer, it would be the size of the object pointed to. */
779 DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", tcc_expression, 2)
780 DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", tcc_expression, 2)
781 DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", tcc_expression, 2)
782 DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", tcc_expression, 2)
784 /* Used to implement `va_arg'. */
785 DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", tcc_expression, 1)
787 /* Evaluate operand 1. If and only if an exception is thrown during
788 the evaluation of operand 1, evaluate operand 2.
790 This differs from TRY_FINALLY_EXPR in that operand 2 is not evaluated
791 on a normal or jump exit, only on an exception. */
792 DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", tcc_statement, 2)
794 /* Evaluate the first operand.
795 The second operand is a cleanup expression which is evaluated
796 on any exit (normal, exception, or jump out) from this expression. */
797 DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", tcc_statement, 2)
799 /* These types of expressions have no useful value,
800 and always have side effects. */
802 /* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */
803 DEFTREECODE (DECL_EXPR, "decl_expr", tcc_statement, 1)
805 /* A label definition, encapsulated as a statement.
806 Operand 0 is the LABEL_DECL node for the label that appears here.
807 The type should be void and the value should be ignored. */
808 DEFTREECODE (LABEL_EXPR, "label_expr", tcc_statement, 1)
810 /* GOTO. Operand 0 is a LABEL_DECL node or an expression.
811 The type should be void and the value should be ignored. */
812 DEFTREECODE (GOTO_EXPR, "goto_expr", tcc_statement, 1)
814 /* RETURN. Evaluates operand 0, then returns from the current function.
815 Presumably that operand is an assignment that stores into the
816 RESULT_DECL that hold the value to be returned.
817 The operand may be null.
818 The type should be void and the value should be ignored. */
819 DEFTREECODE (RETURN_EXPR, "return_expr", tcc_statement, 1)
821 /* Exit the inner most loop conditionally. Operand 0 is the condition.
822 The type should be void and the value should be ignored. */
823 DEFTREECODE (EXIT_EXPR, "exit_expr", tcc_statement, 1)
825 /* A loop. Operand 0 is the body of the loop.
826 It must contain an EXIT_EXPR or is an infinite loop.
827 The type should be void and the value should be ignored. */
828 DEFTREECODE (LOOP_EXPR, "loop_expr", tcc_statement, 1)
830 /* Switch expression.
832 TREE_TYPE is the original type of the condition, before any
833 language required type conversions. It may be NULL, in which case
834 the original type and final types are assumed to be the same.
836 Operand 0 is the expression used to perform the branch,
837 Operand 1 is the body of the switch, which probably contains
838 CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2
840 Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs
842 DEFTREECODE (SWITCH_EXPR, "switch_expr", tcc_statement, 3)
844 /* Used to represent a case label. The operands are CASE_LOW and
845 CASE_HIGH, respectively. If CASE_LOW is NULL_TREE, the label is a
846 'default' label. If CASE_HIGH is NULL_TREE, the label is a normal case
847 label. CASE_LABEL is the corresponding LABEL_DECL. */
848 DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", tcc_statement, 3)
850 /* RESX. Resume execution after an exception. Operand 0 is a
851 number indicating the exception region that is being left. */
852 DEFTREECODE (RESX_EXPR, "resx_expr", tcc_statement, 1)
854 /* Used to represent an inline assembly statement. ASM_STRING returns a
855 STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS,
856 ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers
857 for the statement. */
858 DEFTREECODE (ASM_EXPR, "asm_expr", tcc_statement, 4)
860 /* Variable references for SSA analysis. New SSA names are created every
861 time a variable is assigned a new value. The SSA builder uses SSA_NAME
862 nodes to implement SSA versioning. */
863 DEFTREECODE (SSA_NAME, "ssa_name", tcc_exceptional, 0)
865 /* SSA PHI operator. PHI_RESULT is the new SSA_NAME node created by
866 the PHI node. PHI_ARG_LENGTH is the number of arguments.
867 PHI_ARG_ELT returns the Ith tuple <ssa_name, edge> from the
868 argument list. Each tuple contains the incoming reaching
869 definition (SSA_NAME node) and the edge via which that definition
870 is coming through. */
871 DEFTREECODE (PHI_NODE, "phi_node", tcc_exceptional, 0)
873 /* Used to represent a typed exception handler. CATCH_TYPES is the type (or
874 list of types) handled, and CATCH_BODY is the code for the handler. */
875 DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2)
877 /* Used to represent an exception specification. EH_FILTER_TYPES is a list
878 of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on
879 failure. EH_FILTER_MUST_NOT_THROW controls which range type to use when
881 DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2)
883 /* Indicates a change in the dynamic type of a memory location. This
884 has no value and generates no executable code. It is only used for
885 type based alias analysis. This is generated by C++ placement new.
886 CHANGE_DYNAMIC_TYPE_NEW_TYPE, the first operand, is the new type.
887 CHANGE_DYNAMIC_TYPE_LOCATION, the second operand, is the location
888 whose type is being changed. */
889 DEFTREECODE (CHANGE_DYNAMIC_TYPE_EXPR, "change_dynamic_type_expr",
892 /* Node used for describing a property that is known at compile
894 DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0)
896 /* Node used for describing a property that is not known at compile
898 DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0)
900 /* Polynomial chains of recurrences.
901 Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */
902 DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3)
904 /* Used to chain children of container statements together.
905 Use the interface in tree-iterator.h to access this node. */
906 DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0)
908 /* Value handles. Artificial nodes to represent expressions in
909 partial redundancy elimination (tree-ssa-pre.c). These nodes are
910 used for expression canonicalization. If two expressions compute
911 the same value, they will be assigned the same value handle. */
912 DEFTREECODE (VALUE_HANDLE, "value_handle", tcc_exceptional, 0)
914 /* Predicate assertion. Artificial expression generated by the optimizers
915 to keep track of predicate values. This expression may only appear on
916 the RHS of assignments.
918 Given X = ASSERT_EXPR <Y, EXPR>, the optimizers can infer
922 2- EXPR is a GIMPLE conditional expression (as defined by
923 is_gimple_condexpr) and is known to be true.
925 The type of the expression is the same as Y. */
926 DEFTREECODE (ASSERT_EXPR, "assert_expr", tcc_expression, 2)
928 /* Base class information. Holds information about a class as a
929 baseclass of itself or another class. */
930 DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0)
932 /* Records the size for an expression of variable size type. This is
933 for use in contexts in which we are accessing the entire object,
934 such as for a function call, or block copy.
935 Operand 0 is the real expression.
936 Operand 1 is the size of the type in the expression. */
937 DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2)
939 /* Extract elements from two input vectors Operand 0 and Operand 1
940 size VS, according to the offset OFF defined by Operand 2 as
942 If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to
943 the first OFF elements of the vector OP1.
944 If OFF == 0, then the returned vector is OP1.
945 On different targets OFF may take different forms; It can be an address, in
946 which case its low log2(VS)-1 bits define the offset, or it can be a mask
947 generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */
948 DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3)
950 /* Low-level memory addressing. Operands are SYMBOL (static or global
951 variable), BASE (register), INDEX (register), STEP (integer constant),
952 OFFSET (integer constant). Corresponding address is
953 SYMBOL + BASE + STEP * INDEX + OFFSET. Only variations and values valid on
954 the target are allowed.
956 The type of STEP, INDEX and OFFSET is sizetype. The type of BASE is
957 sizetype or a pointer type (if SYMBOL is NULL).
959 The sixth argument is the reference to the original memory access, which
960 is preserved for the purposes of the RTL alias analysis. The seventh
961 argument is a tag representing results of the tree level alias analysis. */
963 DEFTREECODE (TARGET_MEM_REF, "target_mem_ref", tcc_reference, 7)
965 /* The ordering of the codes between OMP_PARALLEL and OMP_CRITICAL is
966 exposed to TREE_RANGE_CHECK. */
967 /* OpenMP - #pragma omp parallel [clause1 ... clauseN]
968 Operand 0: OMP_PARALLEL_BODY: Code to be executed by all threads.
969 Operand 1: OMP_PARALLEL_CLAUSES: List of clauses.
970 Operand 2: OMP_PARALLEL_FN: FUNCTION_DECL used when outlining the
971 body of the parallel region. Only valid after
973 Operand 3: OMP_PARALLEL_DATA_ARG: Local variable in the parent
974 function containing data to be shared with the child
977 DEFTREECODE (OMP_PARALLEL, "omp_parallel", tcc_statement, 4)
979 /* OpenMP - #pragma omp for [clause1 ... clauseN]
980 Operand 0: OMP_FOR_BODY: Loop body.
981 Operand 1: OMP_FOR_CLAUSES: List of clauses.
982 Operand 2: OMP_FOR_INIT: Initialization code of the form
984 Operand 3: OMP_FOR_COND: Loop conditional expression of the form
985 VAR { <, >, <=, >= } N2.
986 Operand 4: OMP_FOR_INCR: Loop index increment of the form
988 Operand 5: OMP_FOR_PRE_BODY: Filled by the gimplifier with things
989 from INIT, COND, and INCR that are technically part of the
990 OMP_FOR structured block, but are evaluated before the loop
993 VAR must be a signed integer variable, which is implicitly thread
994 private. N1, N2 and INCR are required to be loop invariant integer
995 expressions that are evaluated without any synchronization.
996 The evaluation order, frequency of evaluation and side-effects are
997 unspecified by the standard. */
998 DEFTREECODE (OMP_FOR, "omp_for", tcc_statement, 6)
1000 /* OpenMP - #pragma omp sections [clause1 ... clauseN]
1001 Operand 0: OMP_SECTIONS_BODY: Sections body.
1002 Operand 1: OMP_SECTIONS_CLAUSES: List of clauses. */
1003 DEFTREECODE (OMP_SECTIONS, "omp_sections", tcc_statement, 2)
1005 /* OpenMP - #pragma omp single
1006 Operand 0: OMP_SINGLE_BODY: Single section body.
1007 Operand 1: OMP_SINGLE_CLAUSES: List of clauses. */
1008 DEFTREECODE (OMP_SINGLE, "omp_single", tcc_statement, 2)
1010 /* OpenMP - #pragma omp section
1011 Operand 0: OMP_SECTION_BODY: Section body. */
1012 DEFTREECODE (OMP_SECTION, "omp_section", tcc_statement, 1)
1014 /* OpenMP - #pragma omp master
1015 Operand 0: OMP_MASTER_BODY: Master section body. */
1016 DEFTREECODE (OMP_MASTER, "omp_master", tcc_statement, 1)
1018 /* OpenMP - #pragma omp ordered
1019 Operand 0: OMP_ORDERED_BODY: Master section body. */
1020 DEFTREECODE (OMP_ORDERED, "omp_ordered", tcc_statement, 1)
1022 /* OpenMP - #pragma omp critical [name]
1023 Operand 0: OMP_CRITICAL_BODY: Critical section body.
1024 Operand 1: OMP_CRITICAL_NAME: Identifier for critical section. */
1025 DEFTREECODE (OMP_CRITICAL, "omp_critical", tcc_statement, 2)
1027 /* Return from an OpenMP directive. */
1028 DEFTREECODE (OMP_RETURN, "omp_return", tcc_statement, 0)
1030 /* OpenMP - An intermediate tree code to mark the location of the
1031 loop or sections iteration in the partially lowered code. */
1032 DEFTREECODE (OMP_CONTINUE, "omp_continue", tcc_statement, 0)
1034 /* OpenMP - #pragma omp atomic
1035 Operand 0: The address at which the atomic operation is to be performed.
1036 This address should be stabilized with save_expr.
1037 Operand 1: The expression to evaluate. When the old value of the object
1038 at the address is used in the expression, it should appear as if
1039 build_fold_indirect_ref of the address. */
1040 DEFTREECODE (OMP_ATOMIC, "omp_atomic", tcc_statement, 2)
1042 /* OpenMP clauses. */
1043 DEFTREECODE (OMP_CLAUSE, "omp_clause", tcc_exceptional, 0)
1045 /* Reduction operations.
1046 Operations that take a vector of elements and "reduce" it to a scalar
1047 result (e.g. summing the elements of the vector, finding the minimum over
1048 the vector elements, etc).
1049 Operand 0 is a vector; the first element in the vector has the result.
1050 Operand 1 is a vector. */
1051 DEFTREECODE (REDUC_MAX_EXPR, "reduc_max_expr", tcc_unary, 1)
1052 DEFTREECODE (REDUC_MIN_EXPR, "reduc_min_expr", tcc_unary, 1)
1053 DEFTREECODE (REDUC_PLUS_EXPR, "reduc_plus_expr", tcc_unary, 1)
1055 /* Widenning dot-product.
1056 The first two arguments are of type t1.
1057 The third argument and the result are of type t2, such that t2 is at least
1058 twice the size of t1. DOT_PROD_EXPR(arg1,arg2,arg3) is equivalent to:
1059 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1060 arg3 = PLUS_EXPR (tmp, arg3);
1062 tmp = WIDEN_MULT_EXPR(arg1, arg2);
1063 arg3 = WIDEN_SUM_EXPR (tmp, arg3); */
1064 DEFTREECODE (DOT_PROD_EXPR, "dot_prod_expr", tcc_expression, 3)
1066 /* Widenning summation.
1067 The first argument is of type t1.
1068 The second argument is of type t2, such that t2 is at least twice
1069 the size of t1. The type of the entire expression is also t2.
1070 WIDEN_SUM_EXPR is equivalent to first widening (promoting)
1071 the first argument from type t1 to type t2, and then summing it
1072 with the second argument. */
1073 DEFTREECODE (WIDEN_SUM_EXPR, "widen_sum_expr", tcc_binary, 2)
1075 /* Widenning multiplication.
1076 The two arguments are of type t1.
1077 The result is of type t2, such that t2 is at least twice
1078 the size of t1. WIDEN_MULT_EXPR is equivalent to first widening (promoting)
1079 the arguments from type t1 to type t2, and then multiplying them. */
1080 DEFTREECODE (WIDEN_MULT_EXPR, "widen_mult_expr", tcc_binary, 2)
1082 /* Whole vector left/right shift in bits.
1083 Operand 0 is a vector to be shifted.
1084 Operand 1 is an integer shift amount in bits. */
1085 DEFTREECODE (VEC_LSHIFT_EXPR, "vec_lshift_expr", tcc_binary, 2)
1086 DEFTREECODE (VEC_RSHIFT_EXPR, "vec_rshift_expr", tcc_binary, 2)
1088 /* GIMPLE tree codes. */
1090 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */
1091 DEFTREECODE (GIMPLE_MODIFY_STMT, "gimple_modify_stmt", tcc_gimple_stmt, 2)
1093 /* Widening vector multiplication.
1094 The two operands are vectors with N elements of size S. Multiplying the
1095 elements of the two vectors will result in N products of size 2*S.
1096 VEC_WIDEN_MULT_HI_EXPR computes the N/2 high products.
1097 VEC_WIDEN_MULT_LO_EXPR computes the N/2 low products. */
1098 DEFTREECODE (VEC_WIDEN_MULT_HI_EXPR, "widen_mult_hi_expr", tcc_binary, 2)
1099 DEFTREECODE (VEC_WIDEN_MULT_LO_EXPR, "widen_mult_lo_expr", tcc_binary, 2)
1101 /* Unpack (extract and promote/widen) the high/low elements of the input
1102 vector into the output vector. The input vector has twice as many
1103 elements as the output vector, that are half the size of the elements
1104 of the output vector. This is used to support type promotion. */
1105 DEFTREECODE (VEC_UNPACK_HI_EXPR, "vec_unpack_hi_expr", tcc_unary, 1)
1106 DEFTREECODE (VEC_UNPACK_LO_EXPR, "vec_unpack_lo_expr", tcc_unary, 1)
1108 /* Unpack (extract) the high/low elements of the input vector, convert
1109 fixed point values to floating point and widen elements into the
1110 output vector. The input vector has twice as many elements as the output
1111 vector, that are half the size of the elements of the output vector. */
1112 DEFTREECODE (VEC_UNPACK_FLOAT_HI_EXPR, "vec_unpack_float_hi_expr", tcc_unary, 1)
1113 DEFTREECODE (VEC_UNPACK_FLOAT_LO_EXPR, "vec_unpack_float_lo_expr", tcc_unary, 1)
1115 /* Pack (demote/narrow and merge) the elements of the two input vectors
1116 into the output vector using truncation/saturation.
1117 The elements of the input vectors are twice the size of the elements of the
1118 output vector. This is used to support type demotion. */
1119 DEFTREECODE (VEC_PACK_TRUNC_EXPR, "vec_pack_trunc_expr", tcc_binary, 2)
1120 DEFTREECODE (VEC_PACK_SAT_EXPR, "vec_pack_sat_expr", tcc_binary, 2)
1122 /* Convert floating point values of the two input vectors to integer
1123 and pack (narrow and merge) the elements into the output vector. The
1124 elements of the input vector are twice the size of the elements of
1125 the output vector. */
1126 DEFTREECODE (VEC_PACK_FIX_TRUNC_EXPR, "vec_pack_fix_trunc_expr", tcc_binary, 2)
1128 /* Extract even/odd fields from vectors. */
1129 DEFTREECODE (VEC_EXTRACT_EVEN_EXPR, "vec_extracteven_expr", tcc_binary, 2)
1130 DEFTREECODE (VEC_EXTRACT_ODD_EXPR, "vec_extractodd_expr", tcc_binary, 2)
1132 /* Merge input vectors interleaving their fields. */
1133 DEFTREECODE (VEC_INTERLEAVE_HIGH_EXPR, "vec_interleavehigh_expr", tcc_binary, 2)
1134 DEFTREECODE (VEC_INTERLEAVE_LOW_EXPR, "vec_interleavelow_expr", tcc_binary, 2)