OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-stable/] [gcc-4.5.1/] [gcc/] [tree.def] - Blame information for rev 816

Go to most recent revision | Details | Compare with Previous | View Log

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

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.