* parse.y (maybe_yank_clinit): Don't crash if bbody is NULL.
[official-gcc.git] / gcc / tree.def
blobbcb38849857e9f4d4af26336543b3ffb6ea1aaf6
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 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 2, or (at your option) any later
11 version.
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
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
21 02111-1307, USA. */
24 /* For tcc_references, tcc_expression, tcc_comparison, tcc_unary,
25 tcc_binary, and tcc_statement nodes, which use struct tree_exp, the
26 4th element is the number of argument slots to allocate. This
27 determines the size of the tree node object. Other nodes use
28 different structures, and the size is determined by the tree_union
29 member structure; the 4th element should be zero. Languages that
30 define language-specific tcc_exceptional or tcc_constant codes must
31 define the tree_size langhook to say how big they are.
33 These tree codes have been sorted so that the macros in tree.h that
34 check for various tree codes are optimized into range checks. This
35 gives a measurable performance improvement. When adding a new
36 code, consider its placement in relation to the other codes. */
38 /* Any erroneous construct is parsed into a node of this type.
39 This type of node is accepted without complaint in all contexts
40 by later parsing activities, to avoid multiple error messages
41 for one error.
42 No fields in these nodes are used except the TREE_CODE. */
43 DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 0)
45 /* Used to represent a name (such as, in the DECL_NAME of a decl node).
46 Internally it looks like a STRING_CST node.
47 There is only one IDENTIFIER_NODE ever made for any particular name.
48 Use `get_identifier' to get it (or create it, the first time). */
49 DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0)
51 /* Has the TREE_VALUE and TREE_PURPOSE fields. */
52 /* These nodes are made into lists by chaining through the
53 TREE_CHAIN field. The elements of the list live in the
54 TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
55 used as well to get the effect of Lisp association lists. */
56 DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0)
58 /* These nodes contain an array of tree nodes. */
59 DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0)
61 /* A symbol binding block. These are arranged in a tree,
62 where the BLOCK_SUBBLOCKS field contains a chain of subblocks
63 chained through the BLOCK_CHAIN field.
64 BLOCK_SUPERCONTEXT points to the parent block.
65 For a block which represents the outermost scope of a function, it
66 points to the FUNCTION_DECL node.
67 BLOCK_VARS points to a chain of decl nodes.
68 BLOCK_TYPE_TAGS points to a chain of types which have their own names.
69 BLOCK_CHAIN points to the next BLOCK at the same level.
70 BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
71 this block is an instance of, or else is NULL to indicate that this
72 block is not an instance of anything else. When non-NULL, the value
73 could either point to another BLOCK node or it could point to a
74 FUNCTION_DECL node (e.g. in the case of a block representing the
75 outermost scope of a particular inlining of a function).
76 BLOCK_ABSTRACT is nonzero if the block represents an abstract
77 instance of a block (i.e. one which is nested within an abstract
78 instance of an inline function).
79 TREE_ASM_WRITTEN is nonzero if the block was actually referenced
80 in the generated assembly. */
81 DEFTREECODE (BLOCK, "block", tcc_exceptional, 0)
83 /* Each data type is represented by a tree node whose code is one of
84 the following: */
85 /* Each node that represents a data type has a component TYPE_SIZE
86 containing a tree that is an expression for the size in bits.
87 The TYPE_MODE contains the machine mode for values of this type.
88 The TYPE_POINTER_TO field contains a type for a pointer to this type,
89 or zero if no such has been created yet.
90 The TYPE_NEXT_VARIANT field is used to chain together types
91 that are variants made by type modifiers such as "const" and "volatile".
92 The TYPE_MAIN_VARIANT field, in any member of such a chain,
93 points to the start of the chain.
94 The TYPE_NONCOPIED_PARTS field is a list specifying which parts
95 of an object of this type should *not* be copied by assignment.
96 The TREE_VALUE of each is a FIELD_DECL that should not be
97 copied. The TREE_PURPOSE is an initial value for that field when
98 an object of this type is initialized via an INIT_EXPR. It may
99 be NULL if no special value is required. Even the things in this
100 list are copied if the right-hand side of an assignment is known
101 to be a complete object (rather than being, perhaps, a subobject
102 of some other object.) The determination of what constitutes a
103 complete object is done by fixed_type_p.
104 The TYPE_NAME field contains info on the name used in the program
105 for this type (for GDB symbol table output). It is either a
106 TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
107 in the case of structs, unions or enums that are known with a tag,
108 or zero for types that have no special name.
109 The TYPE_CONTEXT for any sort of type which could have a name or
110 which could have named members (e.g. tagged types in C/C++) will
111 point to the node which represents the scope of the given type, or
112 will be NULL_TREE if the type has "file scope". For most types, this
113 will point to a BLOCK node or a FUNCTION_DECL node, but it could also
114 point to a FUNCTION_TYPE node (for types whose scope is limited to the
115 formal parameter list of some function type specification) or it
116 could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node
117 (for C++ "member" types).
118 For non-tagged-types, TYPE_CONTEXT need not be set to anything in
119 particular, since any type which is of some type category (e.g.
120 an array type or a function type) which cannot either have a name
121 itself or have named members doesn't really have a "scope" per se.
122 The TREE_CHAIN field is used as a forward-references to names for
123 ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes;
124 see below. */
126 /* The ordering of the following codes is optimized for the checking
127 macros in tree.h. Changing the order will degrade the speed of the
128 compiler. OFFSET_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, CHAR_TYPE,
129 INTEGER_TYPE, REAL_TYPE, POINTER_TYPE. */
131 /* An offset is a pointer relative to an object.
132 The TREE_TYPE field is the type of the object at the offset.
133 The TYPE_OFFSET_BASETYPE points to the node for the type of object
134 that the offset is relative to. */
135 DEFTREECODE (OFFSET_TYPE, "offset_type", tcc_type, 0)
137 /* C enums. The type node looks just like an INTEGER_TYPE node.
138 The symbols for the values of the enum type are defined by
139 CONST_DECL nodes, but the type does not point to them;
140 however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE
141 is a name and the TREE_VALUE is the value (an INTEGER_CST node). */
142 /* A forward reference `enum foo' when no enum named foo is defined yet
143 has zero (a null pointer) in its TYPE_SIZE. The tag name is in
144 the TYPE_NAME field. If the type is later defined, the normal
145 fields are filled in.
146 RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are
147 treated similarly. */
148 DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0)
150 /* Boolean type (true or false are the only values). Looks like an
151 INTEGRAL_TYPE. */
152 DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0)
154 /* CHAR in Java; not used in C. Looks like an INTEGRAL_TYPE. */
155 DEFTREECODE (CHAR_TYPE, "char_type", tcc_type, 0)
157 /* Integer types in all languages, including char in C.
158 Also used for sub-ranges of other discrete types.
159 Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
160 and TYPE_PRECISION (number of bits used by this type).
161 In the case of a subrange type in Pascal, the TREE_TYPE
162 of this will point at the supertype (another INTEGER_TYPE,
163 or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_TYPE).
164 Otherwise, the TREE_TYPE is zero. */
165 DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 0)
167 /* C's float and double. Different floating types are distinguished
168 by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */
169 DEFTREECODE (REAL_TYPE, "real_type", tcc_type, 0)
171 /* The ordering of the following codes is optimized for the checking
172 macros in tree.h. Changing the order will degrade the speed of the
173 compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range
174 overlaps the previous range of ordered types. */
176 /* All pointer-to-x types have code POINTER_TYPE.
177 The TREE_TYPE points to the node for the type pointed to. */
178 DEFTREECODE (POINTER_TYPE, "pointer_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. */
190 DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0)
192 /* Vector types. The TREE_TYPE field is the data type of the vector
193 elements. The TYPE_PRECISION field is the number of subparts of
194 the vector. */
195 DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0)
197 /* The ordering of the following codes is optimized for the checking
198 macros in tree.h. Changing the order will degrade the speed of the
199 compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE.
200 Note that this range overlaps the previous range. */
202 /* Types of arrays. Special fields:
203 TREE_TYPE Type of an array element.
204 TYPE_DOMAIN Type to index by.
205 Its range of values specifies the array length.
206 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
207 and holds the type to coerce a value of that array type to in C.
208 TYPE_STRING_FLAG indicates a string (in contrast to an array of chars)
209 in languages (such as Chill) that make a distinction. */
210 /* Array types in C or Pascal */
211 DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0)
213 /* Struct in C, or record in Pascal. */
214 /* Special fields:
215 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct,
216 and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables,
217 types and enumerators.
218 A few may need to be added for Pascal. */
219 /* See the comment above, before ENUMERAL_TYPE, for how
220 forward references to struct tags are handled in C. */
221 DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0)
223 /* Union in C. Like a struct, except that the offsets of the fields
224 will all be zero. */
225 /* See the comment above, before ENUMERAL_TYPE, for how
226 forward references to union tags are handled in C. */
227 DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */
229 /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER
230 in each FIELD_DECL determine what the union contains. The first
231 field whose DECL_QUALIFIER expression is true is deemed to occupy
232 the union. */
233 DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0)
235 /* The ordering of the following codes is optimized for the checking
236 macros in tree.h. Changing the order will degrade the speed of the
237 compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */
239 /* The void type in C */
240 DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0)
242 /* Type of functions. Special fields:
243 TREE_TYPE type of value returned.
244 TYPE_ARG_TYPES list of types of arguments expected.
245 this list is made of TREE_LIST nodes.
246 Types of "Procedures" in languages where they are different from functions
247 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
248 DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0)
250 /* METHOD_TYPE is the type of a function which takes an extra first
251 argument for "self", which is not present in the declared argument list.
252 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
253 is the type of "self". TYPE_ARG_TYPES is the real argument list, which
254 includes the hidden argument for "self". */
255 DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0)
257 /* Used for Pascal; details not determined right now. */
258 DEFTREECODE (FILE_TYPE, "file_type", tcc_type, 0)
260 /* This is a language-specific kind of type.
261 Its meaning is defined by the language front end.
262 layout_type does not know how to lay this out,
263 so the front-end must do so manually. */
264 DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0)
266 /* Expressions */
268 /* First, the constants. */
270 /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
271 32 bits each, giving us a 64 bit constant capability. INTEGER_CST
272 nodes can be shared, and therefore should be considered read only.
273 They should be copied, before setting a flag such as
274 TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW or
275 TREE_CONSTANT_OVERFLOW already set, it is known to be unique.
276 INTEGER_CST nodes are created for the integral types, for pointer
277 types and for vector and float types in some circumstances. */
278 DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0)
280 /* Contents are in TREE_REAL_CST field. */
281 DEFTREECODE (REAL_CST, "real_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)
307 instance.
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 or it 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
338 promotion.
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
349 inline function. */
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,
356 TYPE_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 /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other
365 _DECLs, providing a hierarchy of names. */
366 DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0)
368 /* A translation unit. This is not technically a declaration, since it
369 can't be looked up, but it's close enough. */
370 DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\
371 tcc_declaration, 0)
373 /* References to storage. */
375 /* Value is structure or union component.
376 Operand 0 is the structure or union (an expression).
377 Operand 1 is the field (a node of type FIELD_DECL).
378 Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured
379 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */
380 DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3)
382 /* Reference to a group of bits within an object. Similar to COMPONENT_REF
383 except the position is given explicitly rather than via a FIELD_DECL.
384 Operand 0 is the structure or union expression;
385 operand 1 is a tree giving the number of bits being referenced;
386 operand 2 is a tree giving the position of the first referenced bit.
387 The field can be either a signed or unsigned field;
388 BIT_FIELD_REF_UNSIGNED says which. */
389 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3)
391 /* The ordering of the following codes is optimized for the checking
392 macros in tree.h. Changing the order will degrade the speed of the
393 compiler. INDIRECT_REF, ALIGN_INDIRECT_REF, MISALIGNED_INDIRECT_REF. */
395 /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
396 DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1)
398 /* Like above, but aligns the referenced address (i.e, if the address
399 in P is not aligned on TYPE_ALIGN boundary, then &(*P) != P). */
400 DEFTREECODE (ALIGN_INDIRECT_REF, "align_indirect_ref", tcc_reference, 1)
402 /* Same as INDIRECT_REF, but also specifies the alignment of the referenced
403 address:
404 Operand 0 is the referenced address (a pointer);
405 Operand 1 is an INTEGER_CST which represents the alignment of the address,
406 or 0 if the alignment is unknown. */
407 DEFTREECODE (MISALIGNED_INDIRECT_REF, "misaligned_indirect_ref", tcc_reference, 2)
409 /* Array indexing.
410 Operand 0 is the array; operand 1 is a (single) array index.
411 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
412 Operand 3, if present, is the element size, measured in units of
413 the alignment of the element type. */
414 DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4)
416 /* Likewise, except that the result is a range ("slice") of the array. The
417 starting index of the resulting array is taken from operand 1 and the size
418 of the range is taken from the type of the expression. */
419 DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4)
421 /* Used to represent lookup of runtime type dependent data. Often this is
422 a reference to a vtable, but it needn't be. Operands are:
423 OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use.
424 OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is
425 being performed. Through this the optimizers may be able to statically
426 determine the dynamic type of the object.
427 OBJ_TYPE_REF_TOKEN: Something front-end specific used to resolve the
428 reference to something simpler, usually to the address of a DECL.
429 Never touched by the middle-end. Good choices would be either an
430 identifier or a vtable index. */
431 DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3)
433 /* The exception object from the runtime. */
434 DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", tcc_expression, 0)
436 /* The filter object from the runtime. */
437 DEFTREECODE (FILTER_EXPR, "filter_expr", tcc_expression, 0)
439 /* Constructor: return an aggregate value made from specified components.
440 In C, this is used only for structure and array initializers.
441 The operand is a list of component values made out of a chain of
442 TREE_LIST nodes.
444 For ARRAY_TYPE:
445 The TREE_PURPOSE of each node is the corresponding index.
446 If the TREE_PURPOSE is a RANGE_EXPR, it is a short-hand for many nodes,
447 one for each index in the range. (If the corresponding TREE_VALUE
448 has side-effects, they are evaluated once for each element. Wrap the
449 value in a SAVE_EXPR if you want to evaluate side effects only once.)
451 For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE:
452 The TREE_PURPOSE of each node is a FIELD_DECL. */
453 DEFTREECODE (CONSTRUCTOR, "constructor", tcc_expression, 1)
455 /* The expression types are mostly straightforward, with the fourth argument
456 of DEFTREECODE saying how many operands there are.
457 Unless otherwise specified, the operands are expressions and the
458 types of all the operands and the expression must all be the same. */
460 /* Contains two expressions to compute, one followed by the other.
461 the first value is ignored. The second one's value is used. The
462 type of the first expression need not agree with the other types. */
463 DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2)
465 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */
466 DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2)
468 /* Initialization expression. Operand 0 is the variable to initialize;
469 Operand 1 is the initializer. */
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. */
488 DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3)
490 /* Vector conditional expression. It is like COND_EXPR, but with
491 vector operands.
493 A = VEC_COND_EXPR ( X < Y, B, C)
495 means
497 for (i=0; i<N; i++)
498 A[i] = X[i] < Y[i] ? B[i] : C[i];
500 DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", tcc_expression, 3)
502 /* Declare local variables, including making RTL and allocating space.
503 BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables.
504 BIND_EXPR_BODY is the body, the expression to be computed using
505 the variables. The value of operand 1 becomes that of the BIND_EXPR.
506 BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings
507 for debugging purposes. If this BIND_EXPR is actually expanded,
508 that sets the TREE_USED flag in the BLOCK.
510 The BIND_EXPR is not responsible for informing parsers
511 about these variables. If the body is coming from the input file,
512 then the code that creates the BIND_EXPR is also responsible for
513 informing the parser of the variables.
515 If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
516 This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
517 If the BIND_EXPR should be output for debugging but will not be expanded,
518 set the TREE_USED flag by hand.
520 In order for the BIND_EXPR to be known at all, the code that creates it
521 must also install it as a subblock in the tree of BLOCK
522 nodes for the function. */
523 DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3)
525 /* Function call. Operand 0 is the function.
526 Operand 1 is the argument list, a list of expressions
527 made out of a chain of TREE_LIST nodes.
528 Operand 2 is the static chain argument, or NULL. */
529 DEFTREECODE (CALL_EXPR, "call_expr", tcc_expression, 3)
531 /* Specify a value to compute along with its corresponding cleanup.
532 Operand 0 is the cleanup expression.
533 The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR,
534 which must exist. This differs from TRY_CATCH_EXPR in that operand 1
535 is always evaluated when cleanups are run. */
536 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1)
538 /* Specify a cleanup point.
539 Operand 0 is an expression that may have cleanups. If it does, those
540 cleanups are executed after the expression is expanded.
542 Note that if the expression is a reference to storage, it is forced out
543 of memory before the cleanups are run. This is necessary to handle
544 cases where the cleanups modify the storage referenced; in the
545 expression 't.i', if 't' is a struct with an integer member 'i' and a
546 cleanup which modifies 'i', the value of the expression depends on
547 whether the cleanup is run before or after 't.i' is evaluated. When
548 expand_expr is run on 't.i', it returns a MEM. This is not good enough;
549 the value of 't.i' must be forced out of memory.
551 As a consequence, the operand of a CLEANUP_POINT_EXPR must not have
552 BLKmode, because it will not be forced out of memory. */
553 DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1)
555 /* The following two codes are used in languages that have types where
556 some field in an object of the type contains a value that is used in
557 the computation of another field's offset or size and/or the size of
558 the type. The positions and/or sizes of fields can vary from object
559 to object of the same type or even for one and the same object within
560 its scope.
562 Record types with discriminants in Ada or schema types in Pascal are
563 examples of such types. This mechanism is also used to create "fat
564 pointers" for unconstrained array types in Ada; the fat pointer is a
565 structure one of whose fields is a pointer to the actual array type
566 and the other field is a pointer to a template, which is a structure
567 containing the bounds of the array. The bounds in the type pointed
568 to by the first field in the fat pointer refer to the values in the
569 template.
571 When you wish to construct such a type you need "self-references"
572 that allow you to reference the object having this type from the
573 TYPE node, i.e. without having a variable instantiating this type.
575 Such a "self-references" is done using a PLACEHOLDER_EXPR. This is
576 a node that will later be replaced with the object being referenced.
577 Its type is that of the object and selects which object to use from
578 a chain of references (see below). No other slots are used in the
579 PLACEHOLDER_EXPR.
581 For example, if your type FOO is a RECORD_TYPE with a field BAR,
582 and you need the value of <variable>.BAR to calculate TYPE_SIZE
583 (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR
584 whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with
585 the PLACEHOLDER_EXPR as the first operand (which has the correct
586 type). Later, when the size is needed in the program, the back-end
587 will find this PLACEHOLDER_EXPR and generate code to calculate the
588 actual size at run-time. In the following, we describe how this
589 calculation is done.
591 When we wish to evaluate a size or offset, we check whether it contains a
592 PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr
593 passing both that tree and an expression within which the object may be
594 found. The latter expression is the object itself in the simple case of
595 an Ada record with discriminant, but it can be the array in the case of an
596 unconstrained array.
598 In the latter case, we need the fat pointer, because the bounds of
599 the array can only be accessed from it. However, we rely here on the
600 fact that the expression for the array contains the dereference of
601 the fat pointer that obtained the array pointer. */
603 /* Denotes a record to later be substituted before evaluating this expression.
604 The type of this expression is used to find the record to replace it. */
605 DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0)
607 /* Simple arithmetic. */
608 DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2)
609 DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2)
610 DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2)
612 /* Division for integer result that rounds the quotient toward zero. */
613 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2)
615 /* Division for integer result that rounds the quotient toward infinity. */
616 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2)
618 /* Division for integer result that rounds toward minus infinity. */
619 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2)
621 /* Division for integer result that rounds toward nearest integer. */
622 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2)
624 /* Four kinds of remainder that go with the four kinds of division. */
625 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2)
626 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2)
627 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2)
628 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2)
630 /* Division for real result. */
631 DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2)
633 /* Division which is not supposed to need rounding.
634 Used for pointer subtraction in C. */
635 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2)
637 /* Conversion of real to fixed point: four ways to round,
638 like the four ways to divide.
639 CONVERT_EXPR can also be used to convert a real to an integer,
640 and that is what is used in languages that do not have ways of
641 specifying which of these is wanted. Maybe these are not needed. */
642 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1)
643 DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", tcc_unary, 1)
644 DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", tcc_unary, 1)
645 DEFTREECODE (FIX_ROUND_EXPR, "fix_round_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)
702 or real types.
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
748 generating insns. */
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
839 must not be NULL.
840 Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs
841 of all the cases. */
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
880 expanding. */
881 DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2)
883 /* Node used for describing a property that is known at compile
884 time. */
885 DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0)
887 /* Node used for describing a property that is not known at compile
888 time. */
889 DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0)
891 /* Polynomial chains of recurrences.
892 Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */
893 DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3)
895 /* Used to chain children of container statements together.
896 Use the interface in tree-iterator.h to access this node. */
897 DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0)
899 /* Value handles. Artificial nodes to represent expressions in
900 partial redundancy elimination (tree-ssa-pre.c). These nodes are
901 used for expression canonicalization. If two expressions compute
902 the same value, they will be assigned the same value handle. */
903 DEFTREECODE (VALUE_HANDLE, "value_handle", tcc_exceptional, 0)
905 /* Base class information. Holds information about a class as a
906 baseclass of itself or another class. */
907 DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0)
909 /* Records the size for an expression of variable size type. This is
910 for use in contexts in which we are accessing the entire object,
911 such as for a function call, or block copy.
912 Operand 0 is the real expression.
913 Operand 1 is the size of the type in the expression. */
914 DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2)
916 /* Extract elements from two input vectors Operand 0 and Operand 1
917 size VS, according to the offset OFF defined by Operand 2 as
918 follows:
919 If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to
920 the first OFF elements of the vector OP1.
921 If OFF == 0, then the returned vector is OP1.
922 On different targets OFF may take different forms; It can be an address, in
923 which case its low log2(VS)-1 bits define the offset, or it can be a mask
924 generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */
925 DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3)
928 Local variables:
929 mode:c
930 End: