1 /* This file contains the definitions and documentation for the
2 tree codes used in the GNU C compiler.
3 Copyright (C) 1987, 1988 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
22 /* The third argument can be:
23 "x" for an exceptional code (fits no category).
24 "t" for a type object code.
25 "b" for a lexical block.
26 "c" for codes for constants.
27 "d" for codes for declarations (also serving as variable refs).
28 "r" for codes for references to storage.
29 "<" for codes for comparison expressions.
30 "1" for codes for unary arithmetic expressions.
31 "2" for codes for binary arithmetic expressions.
32 "s" for codes for expressions with inherent side effects.
33 "e" for codes for other kinds of expressions. */
35 /* For `r', `e', `<', `1', `2', `s' and `x' nodes,
36 the 4th element is the number of argument slots to allocate.
37 This determines the size of the tree node object. */
39 /* Any erroneous construct is parsed into a node of this type.
40 This type of node is accepted without complaint in all contexts
41 by later parsing activities, to avoid multiple error messages
43 No fields in these nodes are used except the TREE_CODE. */
44 DEFTREECODE (ERROR_MARK, "error_mark", "x", 0)
46 /* Used to represent a name (such as, in the DECL_NAME of a decl node).
47 Internally it looks like a STRING_CST node.
48 There is only one IDENTIFIER_NODE ever made for any particular name.
49 Use `get_identifier' to get it (or create it, the first time). */
50 DEFTREECODE (IDENTIFIER_NODE, "identifier_node", "x", -1)
52 /* Used to hold information to identify an operator (or combination
53 of two operators) considered as a `noun' rather than a `verb'.
54 The first operand is encoded in the TREE_TYPE field. */
55 DEFTREECODE (OP_IDENTIFIER, "op_identifier", "x", 2)
57 /* Has the TREE_VALUE and TREE_PURPOSE fields. */
58 /* These nodes are made into lists by chaining through the
59 TREE_CHAIN field. The elements of the list live in the
60 TREE_VALUE fields, while TREE_PURPOSE fields are occasionally
61 used as well to get the effect of Lisp association lists. */
62 DEFTREECODE (TREE_LIST, "tree_list", "x", 2)
64 /* These nodes contain an array of tree nodes. */
65 DEFTREECODE (TREE_VEC, "tree_vec", "x", 2)
67 /* A symbol binding block. These are arranged in a tree,
68 where the BLOCK_SUBBLOCKS field contains a chain of subblocks
69 chained through the BLOCK_CHAIN field.
70 BLOCK_SUPERCONTEXT points to the parent block.
71 For a block which represents the outermost scope of a function, it
72 points to the FUNCTION_DECL node.
73 BLOCK_VARS points to a chain of decl nodes.
74 BLOCK_TYPE_TAGS points to a chain of types which have their own names.
75 BLOCK_CHAIN points to the next BLOCK at the same level.
76 BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which
77 this block is an instance of, or else is NULL to indicate that this
78 block is not an instance of anything else. When non-NULL, the value
79 could either point to another BLOCK node or it could point to a
80 FUNCTION_DECL node (e.g. in the case of a block representing the
81 outermost scope of a particular inlining of a function).
82 BLOCK_ABSTRACT is non-zero if the block represents an abstract
83 instance of a block (i.e. one which is nested within an abstract
84 instance of a inline function. */
85 DEFTREECODE (BLOCK, "block", "b", 0)
87 /* Each data type is represented by a tree node whose code is one of
89 /* Each node that represents a data type has a component TYPE_SIZE
90 containing a tree that is an expression for the size in bits.
91 The TYPE_MODE contains the machine mode for values of this type.
92 The TYPE_POINTER_TO field contains a type for a pointer to this type,
93 or zero if no such has been created yet.
94 The TYPE_NEXT_VARIANT field is used to chain together types
95 that are variants made by type modifiers such as "const" and "volatile".
96 The TYPE_MAIN_VARIANT field, in any member of such a chain,
97 points to the start of the chain.
98 The TYPE_NONCOPIED_PARTS field is a list specifying which parts
99 of an object of this type should *not* be copied by assignment.
100 The TREE_PURPOSE of each element is the offset of the part
101 and the TREE_VALUE is the size in bits of the part.
102 The TYPE_NAME field contains info on the name used in the program
103 for this type (for GDB symbol table output). It is either a
104 TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE
105 in the case of structs, unions or enums that are known with a tag,
106 or zero for types that have no special name.
107 The TYPE_CONTEXT for any sort of type which could have a name or
108 which could have named members (e.g. tagged types in C/C++) will
109 point to the node which represents the scope of the given type, or
110 will be NULL_TREE if the type has "file scope". For most types, this
111 will point to a BLOCK node or a FUNCTION_DECL node, but it could also
112 point to a FUNCTION_TYPE node (for types whose scope is limited to the
113 formal parameter list of some function type specification) or it
114 could point to a RECORD_TYPE or UNION_TYPE node (for C++ "member" types).
115 For non-tagged-types, TYPE_CONTEXT need not be set to anything in
116 particular, since any type which is of some type category (e.g.
117 an array type or a function type) which cannot either have a name
118 itself or have named members doesn't really have a "scope" per se. */
119 /* TREE_CHAIN is used for ENUMERAL_TYPE, RECORD_TYPE and UNION_TYPE
120 nodes used as forward-references to names; see below. */
122 DEFTREECODE (VOID_TYPE, "void_type", "t", 0) /* The void type in C */
124 /* Integer types in all languages, including char in C. */
125 /* Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
126 and TYPE_PRECISION (number of bits used by this type).
127 In the case of a subrange type in Pascal, the TREE_TYPE
128 of this will point at the supertype (another INTEGER_TYPE).
129 Otherwise, the TREE_TYPE is zero. */
130 DEFTREECODE (INTEGER_TYPE, "integer_type", "t", 0)
132 /* C's float and double. Different floating types are distinguished
133 by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */
134 DEFTREECODE (REAL_TYPE, "real_type", "t", 0)
136 /* Complex number types. The TREE_TYPE field is the data type
137 of the real and imaginary parts. */
138 DEFTREECODE (COMPLEX_TYPE, "complex_type", "t", 0)
140 /* C enums. The type node looks just like an INTEGER_TYPE node.
141 The symbols for the values of the enum type are defined by
142 CONST_DECL nodes, but the type does not point to them;
143 however, the TREE_VALUES is a list in which each elements' TREE_PURPOSE
144 is a name and the TREE_VALUE is the value (an INTEGER_CST node). */
145 /* A forward reference `enum foo' when no enum named foo is defined yet
146 has zero (a null pointer) in its TYPE_SIZE. The tag name is in
147 the TYPE_NAME field. If the type is later defined, the normal
148 fields are filled in.
149 RECORD_TYPE and UNION_TYPE forward refs are treated similarly. */
150 DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", "t", 0)
152 /* Pascal's boolean type (true or false are the only values);
153 no special fields needed. */
154 DEFTREECODE (BOOLEAN_TYPE, "boolean_type", "t", 0)
156 /* CHAR in Pascal; not used in C.
157 No special fields needed. */
158 DEFTREECODE (CHAR_TYPE, "char_type", "t", 0)
160 /* All pointer-to-x types have code POINTER_TYPE.
161 The TREE_TYPE points to the node for the type pointed to. */
162 DEFTREECODE (POINTER_TYPE, "pointer_type", "t", 0)
164 /* An offset is a pointer relative to an object.
165 The TREE_TYPE field is the type of the object at the offset.
166 The TYPE_OFFSET_BASETYPE points to the node for the type of object
167 that the offset is relative to. */
168 DEFTREECODE (OFFSET_TYPE, "offset_type", "t", 0)
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", "t", 0)
174 /* METHOD_TYPE is the type of a function which takes an extra first
175 argument for "self", which is not present in the declared argument list.
176 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE
177 is the type of "self". TYPE_ARG_TYPES is the real argument list, which
178 includes the hidden argument for "self". */
179 DEFTREECODE (METHOD_TYPE, "method_type", "t", 0)
181 /* Used for Pascal; details not determined right now. */
182 DEFTREECODE (FILE_TYPE, "file_type", "t", 0)
184 /* Types of arrays. Special fields:
185 TREE_TYPE Type of an array element.
186 TYPE_DOMAIN Type to index by.
187 Its range of values specifies the array length.
188 TYPE_SEP Expression for units from one elt to the next.
189 TYPE_SEP_UNIT Number of bits in a unit for previous.
190 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero
191 and holds the type to coerce a value of that array type to in C. */
192 /* Array types in C or Pascal */
193 DEFTREECODE (ARRAY_TYPE, "array_type", "t", 0)
195 /* Types of sets for Pascal. Special fields are the same as
196 in an array type. The target type is always a boolean type. */
197 DEFTREECODE (SET_TYPE, "set_type", "t", 0)
199 /* Not known whether Pascal really needs this
200 or what it should contain. */
201 DEFTREECODE (STRING_TYPE, "string_type", "t", 0)
203 /* Struct in C, or record in Pascal. */
205 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct.
206 A few may need to be added for Pascal. */
207 /* See the comment above, before ENUMERAL_TYPE, for how
208 forward references to struct tags are handled in C. */
209 DEFTREECODE (RECORD_TYPE, "record_type", "t", 0)
211 /* Union in C. Like a struct, except that the offsets of the fields
213 /* See the comment above, before ENUMERAL_TYPE, for how
214 forward references to union tags are handled in C. */
215 DEFTREECODE (UNION_TYPE, "union_type", "t", 0) /* C union type */
217 /* Type of functions. Special fields:
218 TREE_TYPE type of value returned.
219 TYPE_ARG_TYPES list of types of arguments expected.
220 this list is made of TREE_LIST nodes.
221 Types of "Procedures" in languages where they are different from functions
222 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */
223 DEFTREECODE (FUNCTION_TYPE, "function_type", "t", 0)
225 /* This is a language-specific kind of type.
226 Its meaning is defined by the language front end.
227 layout_type does not know how to lay this out,
228 so the front-end must do so manually. */
229 DEFTREECODE (LANG_TYPE, "lang_type", "t", 0)
233 /* First, the constants. */
235 /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields,
236 32 bits each, giving us a 64 bit constant capability.
237 Note: constants of type char in Pascal are INTEGER_CST,
238 and so are pointer constants such as nil in Pascal or NULL in C.
239 `(int *) 1' in C also results in an INTEGER_CST. */
240 DEFTREECODE (INTEGER_CST, "integer_cst", "c", 2)
242 /* Contents are in TREE_REAL_CST field. Also there is TREE_CST_RTL. */
243 DEFTREECODE (REAL_CST, "real_cst", "c", 3)
245 /* Contents are in TREE_REALPART and TREE_IMAGPART fields,
246 whose contents are other constant nodes.
247 Also there is TREE_CST_RTL. */
248 DEFTREECODE (COMPLEX_CST, "complex_cst", "c", 3)
250 /* Contents are TREE_STRING_LENGTH and TREE_STRING_POINTER fields.
251 Also there is TREE_CST_RTL. */
252 DEFTREECODE (STRING_CST, "string_cst", "c", 3)
254 /* Declarations. All references to names are represented as ..._DECL nodes.
255 The decls in one binding context are chained through the TREE_CHAIN field.
256 Each DECL has a DECL_NAME field which contains an IDENTIFIER_NODE.
257 (Some decls, most often labels, may have zero as the DECL_NAME).
258 DECL_CONTEXT points to the node representing the context in which
259 this declaration has its scope. For FIELD_DECLs, this is the
260 RECORD_TYPE or UNION_TYPE node that the field is a member of. For
261 VAR_DECL, PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes,
262 this points to the FUNCTION_DECL for the containing function, or else
263 yields NULL_TREE if the given decl has "file scope".
264 DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract)
265 ..._DECL node of which this decl is an (inlined or template expanded)
267 The TREE_TYPE field holds the data type of the object, when relevant.
268 LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field
269 contents are the type whose name is being declared.
270 The DECL_ALIGN, DECL_SIZE,
271 and DECL_MODE fields exist in decl nodes just as in type nodes.
272 They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes.
274 DECL_OFFSET holds an integer number of bits offset for the location.
275 DECL_VOFFSET holds an expression for a variable offset; it is
276 to be multiplied by DECL_VOFFSET_UNIT (an integer).
277 These fields are relevant only in FIELD_DECLs and PARM_DECLs.
279 DECL_INITIAL holds the value to initialize a variable to,
280 or the value of a constant. For a function, it holds the body
281 (a node of type BLOCK representing the function's binding contour
282 and whose body contains the function's statements.) For a LABEL_DECL
283 in C, it is a flag, nonzero if the label's definition has been seen.
285 PARM_DECLs use a special field:
286 DECL_ARG_TYPE is the type in which the argument is actually
287 passed, which may be different from its type within the function.
289 FUNCTION_DECLs use four special fields:
290 DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments.
291 DECL_RESULT holds a RESULT_DECL node for the value of a function,
292 or it is 0 for a function that returns no value.
293 (C functions returning void have zero here.)
294 DECL_RESULT_TYPE holds the type in which the result is actually
295 returned. This is usually the same as the type of DECL_RESULT,
296 but (1) it may be a wider integer type and
297 (2) it remains valid, for the sake of inlining, even after the
298 function's compilation is done.
299 DECL_FUNCTION_CODE is a code number that is nonzero for
300 built-in functions. Its value is an enum built_in_function
301 that says which built-in function it is.
303 DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE
304 holds a line number. In some cases these can be the location of
305 a reference, if no definition has been seen.
307 DECL_ABSTRACT is non-zero if the decl represents an abstract instance
308 of a decl (i.e. one which is nested within an abstract instance of a
311 DEFTREECODE (FUNCTION_DECL, "function_decl", "d", 0)
312 DEFTREECODE (LABEL_DECL, "label_decl", "d", 0)
313 DEFTREECODE (CONST_DECL, "const_decl", "d", 0)
314 DEFTREECODE (TYPE_DECL, "type_decl", "d", 0)
315 DEFTREECODE (VAR_DECL, "var_decl", "d", 0)
316 DEFTREECODE (PARM_DECL, "parm_decl", "d", 0)
317 DEFTREECODE (RESULT_DECL, "result_decl", "d", 0)
318 DEFTREECODE (FIELD_DECL, "field_decl", "d", 0)
320 /* References to storage. */
322 /* Value is structure or union component.
323 Operand 0 is the structure or union (an expression);
324 operand 1 is the field (a node of type FIELD_DECL). */
325 DEFTREECODE (COMPONENT_REF, "component_ref", "r", 2)
327 /* Reference to a group of bits within an object. Similar to COMPONENT_REF
328 except the position is given explicitly rather than via a FIELD_DECL.
329 Operand 0 is the structure or union expression;
330 operand 1 is a tree giving the number of bits being referenced;
331 operand 2 is a tree giving the position of the first referenced bit.
332 The field can be either a signed or unsigned field;
333 TREE_UNSIGNED says which. */
334 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", "r", 3)
336 /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */
337 DEFTREECODE (INDIRECT_REF, "indirect_ref", "r", 1)
339 /* Reference to the contents of an offset
340 (a value whose type is an OFFSET_TYPE).
341 Operand 0 is the object within which the offset is taken.
342 Operand 1 is the offset. */
343 DEFTREECODE (OFFSET_REF, "offset_ref", "r", 2)
345 /* Pascal `^` on a file. One operand, an expression for the file. */
346 DEFTREECODE (BUFFER_REF, "buffer_ref", "r", 1)
348 /* Array indexing in languages other than C.
349 Operand 0 is the array; operand 1 is a list of indices
350 stored as a chain of TREE_LIST nodes. */
351 DEFTREECODE (ARRAY_REF, "array_ref", "r", 2)
353 /* Constructor: return an aggregate value made from specified components.
354 In C, this is used only for structure and array initializers.
355 The first "operand" is really a pointer to the RTL,
356 for constant constructors only.
357 The second operand is a list of component values
358 made out of a chain of TREE_LIST nodes. */
359 DEFTREECODE (CONSTRUCTOR, "constructor", "e", 2)
361 /* The expression types are mostly straightforward,
362 with the fourth argument of DEFTREECODE saying
363 how many operands there are.
364 Unless otherwise specified, the operands are expressions. */
366 /* Contains two expressions to compute, one followed by the other.
367 the first value is ignored. The second one's value is used. */
368 DEFTREECODE (COMPOUND_EXPR, "compound_expr", "e", 2)
370 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */
371 DEFTREECODE (MODIFY_EXPR, "modify_expr", "e", 2)
373 /* Initialization expression. Operand 0 is the variable to initialize;
374 Operand 1 is the initializer. */
375 DEFTREECODE (INIT_EXPR, "init_expr", "e", 2)
377 /* For TARGET_EXPR, operand 0 is the target of an initialization,
378 operand 1 is the initializer for the target,
379 and operand 2 is the cleanup for this node, if any. */
380 DEFTREECODE (TARGET_EXPR, "target_expr", "e", 3)
382 /* Conditional expression ( ... ? ... : ... in C).
383 Operand 0 is the condition.
384 Operand 1 is the then-value.
385 Operand 2 is the else-value. */
386 DEFTREECODE (COND_EXPR, "cond_expr", "e", 3)
388 /* Declare local variables, including making RTL and allocating space.
389 Operand 0 is a chain of VAR_DECL nodes for the variables.
390 Operand 1 is the body, the expression to be computed using
391 the variables. The value of operand 1 becomes that of the BIND_EXPR.
392 Operand 2 is the BLOCK that corresponds to these bindings
393 for debugging purposes. If this BIND_EXPR is actually expanded,
394 that sets the TREE_USED flag in the BLOCK.
396 The BIND_EXPR is not responsible for informing parsers
397 about these variables. If the body is coming from the input file,
398 then the code that creates the BIND_EXPR is also responsible for
399 informing the parser of the variables.
401 If the BIND_EXPR is ever expanded, its TREE_USED flag is set.
402 This tells the code for debugging symbol tables not to ignore the BIND_EXPR.
403 If the BIND_EXPR should be output for debugging but will not be expanded,
404 set the TREE_USED flag by hand.
406 In order for the BIND_EXPR to be known at all, the code that creates it
407 must also install it as a subblock in the tree of BLOCK
408 nodes for the function. */
409 DEFTREECODE (BIND_EXPR, "bind_expr", "e", 3)
411 /* Function call. Operand 0 is the function.
412 Operand 1 is the argument list, a list of expressions
413 made out of a chain of TREE_LIST nodes.
414 There is no operand 2. That slot is used for the
415 CALL_EXPR_RTL macro (see preexpand_calls). */
416 DEFTREECODE (CALL_EXPR, "call_expr", "e", 3)
418 /* Call a method. Operand 0 is the method, whose type is a METHOD_TYPE.
419 Operand 1 is the expression for "self".
420 Operand 2 is the list of explicit arguments. */
421 DEFTREECODE (METHOD_CALL_EXPR, "method_call_expr", "e", 4)
423 /* Specify a value to compute along with its corresponding cleanup.
424 Operand 0 argument is an expression whose value needs a cleanup.
425 Operand 1 is an RTL_EXPR which will eventually represent that value.
426 Operand 2 is the cleanup expression for the object.
427 The RTL_EXPR is used in this expression, which is how the expression
428 manages to act on the proper value.
429 The cleanup is executed when the value is no longer needed,
430 which is not at precisely the same time that this value is computed. */
431 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", "e", 3)
433 /* Simple arithmetic. Operands must have the same machine mode
434 and the value shares that mode. */
435 DEFTREECODE (PLUS_EXPR, "plus_expr", "2", 2)
436 DEFTREECODE (MINUS_EXPR, "minus_expr", "2", 2)
437 DEFTREECODE (MULT_EXPR, "mult_expr", "2", 2)
439 /* Division for integer result that rounds the quotient toward zero. */
440 /* Operands must have the same machine mode.
441 In principle they may be real, but that is not currently supported.
442 The result is always fixed point, and it has the same type as the
443 operands if they are fixed point. */
444 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", "2", 2)
446 /* Division for integer result that rounds the quotient toward infinity. */
447 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", "2", 2)
449 /* Division for integer result that rounds toward minus infinity. */
450 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", "2", 2)
452 /* Division for integer result that rounds toward nearest integer. */
453 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", "2", 2)
455 /* Four kinds of remainder that go with the four kinds of division. */
456 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", "2", 2)
457 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", "2", 2)
458 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", "2", 2)
459 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", "2", 2)
461 /* Division for real result. The two operands must have the same type.
462 In principle they could be integers, but currently only real
463 operands are supported. The result must have the same type
465 DEFTREECODE (RDIV_EXPR, "rdiv_expr", "2", 2)
467 /* Division which is not supposed to need rounding.
468 Used for pointer subtraction in C. */
469 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", "2", 2)
471 /* Conversion of real to fixed point: four ways to round,
472 like the four ways to divide.
473 CONVERT_EXPR can also be used to convert a real to an integer,
474 and that is what is used in languages that do not have ways of
475 specifying which of these is wanted. Maybe these are not needed. */
476 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", "1", 1)
477 DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", "1", 1)
478 DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", "1", 1)
479 DEFTREECODE (FIX_ROUND_EXPR, "fix_round_expr", "1", 1)
481 /* Conversion of an integer to a real. */
482 DEFTREECODE (FLOAT_EXPR, "float_expr", "1", 1)
484 /* Exponentiation. Operands may have any types;
485 constraints on value type are not known yet. */
486 DEFTREECODE (EXPON_EXPR, "expon_expr", "2", 2)
488 /* Unary negation. Value has same type as operand. */
489 DEFTREECODE (NEGATE_EXPR, "negate_expr", "1", 1)
491 DEFTREECODE (MIN_EXPR, "min_expr", "2", 2)
492 DEFTREECODE (MAX_EXPR, "max_expr", "2", 2)
493 DEFTREECODE (ABS_EXPR, "abs_expr", "1", 1)
494 DEFTREECODE (FFS_EXPR, "ffs_expr", "1", 1)
496 /* Shift operations for shift and rotate.
497 Shift is supposed to mean logical shift if done on an
498 unsigned type, arithmetic shift on a signed type.
499 The second operand is the number of bits to
500 shift by, and must always have mode SImode.
501 The result has the same mode as the first operand. */
502 DEFTREECODE (LSHIFT_EXPR, "alshift_expr", "2", 2)
503 DEFTREECODE (RSHIFT_EXPR, "arshift_expr", "2", 2)
504 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", "2", 2)
505 DEFTREECODE (RROTATE_EXPR, "rrotate_expr", "2", 2)
507 /* Bitwise operations. Operands have same mode as result. */
508 DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", "2", 2)
509 DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", "2", 2)
510 DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", "2", 2)
511 DEFTREECODE (BIT_ANDTC_EXPR, "bit_andtc_expr", "2", 2)
512 DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", "1", 1)
514 /* Combination of boolean values or of integers considered only
515 as zero or nonzero. ANDIF and ORIF allow the second operand
516 not to be computed if the value of the expression is determined
517 from the first operand. AND, OR, and XOR always compute the second
518 operand whether its value is needed or not (for side effects). */
519 DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", "e", 2)
520 DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", "e", 2)
521 DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", "2", 2)
522 DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", "2", 2)
523 DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", "2", 2)
524 DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", "e", 1)
526 /* Relational operators.
527 `EQ_EXPR' and `NE_EXPR' are allowed for any types.
528 The others are allowed only for integer (or pointer or enumeral)
530 In all cases the operands will have the same type,
531 and the value is always the type used by the language for booleans. */
532 DEFTREECODE (LT_EXPR, "lt_expr", "<", 2)
533 DEFTREECODE (LE_EXPR, "le_expr", "<", 2)
534 DEFTREECODE (GT_EXPR, "gt_expr", "<", 2)
535 DEFTREECODE (GE_EXPR, "ge_expr", "<", 2)
536 DEFTREECODE (EQ_EXPR, "eq_expr", "<", 2)
537 DEFTREECODE (NE_EXPR, "ne_expr", "<", 2)
539 /* Operations for Pascal sets. Not used now. */
540 DEFTREECODE (IN_EXPR, "in_expr", "2", 2)
541 DEFTREECODE (SET_LE_EXPR, "set_le_expr", "<", 2)
542 DEFTREECODE (CARD_EXPR, "card_expr", "1", 1)
543 DEFTREECODE (RANGE_EXPR, "range_expr", "2", 2)
545 /* Represents a conversion of type of a value.
546 All conversions, including implicit ones, must be
547 represented by CONVERT_EXPR nodes. */
548 DEFTREECODE (CONVERT_EXPR, "convert_expr", "1", 1)
550 /* Represents a conversion expected to require no code to be generated. */
551 DEFTREECODE (NOP_EXPR, "nop_expr", "1", 1)
553 /* Value is same as argument, but guaranteed not an lvalue. */
554 DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", "1", 1)
556 /* Represents something we computed once and will use multiple times.
557 First operand is that expression. Second is the function decl
558 in which the SAVE_EXPR was created. The third operand is the RTL,
559 nonzero only after the expression has been computed. */
560 DEFTREECODE (SAVE_EXPR, "save_expr", "e", 3)
562 /* Represents something whose RTL has already been expanded
563 as a sequence which should be emitted when this expression is expanded.
564 The first operand is the RTL to emit. It is the first of a chain of insns.
565 The second is the RTL expression for the result. */
566 DEFTREECODE (RTL_EXPR, "rtl_expr", "e", 2)
568 /* & in C. Value is the address at which the operand's value resides.
569 Operand may have any mode. Result mode is Pmode. */
570 DEFTREECODE (ADDR_EXPR, "addr_expr", "e", 1)
572 /* Non-lvalue reference or pointer to an object. */
573 DEFTREECODE (REFERENCE_EXPR, "reference_expr", "e", 1)
575 /* Operand is a function constant; result is a function variable value
576 of typeEPmode. Used only for languages that need static chains. */
577 DEFTREECODE (ENTRY_VALUE_EXPR, "entry_value_expr", "e", 1)
579 /* Given two real or integer operands of the same type,
580 returns a complex value of the corresponding complex type. */
581 DEFTREECODE (COMPLEX_EXPR, "complex_expr", "2", 2)
583 /* Complex conjugate of operand. Used only on complex types.
584 The value has the same type as the operand. */
585 DEFTREECODE (CONJ_EXPR, "conj_expr", "1", 1)
587 /* Used only on an operand of complex type, these return
588 a value of the corresponding component type. */
589 DEFTREECODE (REALPART_EXPR, "realpart_expr", "1", 1)
590 DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", "1", 1)
592 /* Nodes for ++ and -- in C.
593 The second arg is how much to increment or decrement by.
594 For a pointer, it would be the size of the object pointed to. */
595 DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", "e", 2)
596 DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", "e", 2)
597 DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", "e", 2)
598 DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", "e", 2)
600 /* These types of expressions have no useful value,
601 and always have side effects. */
603 /* A label definition, encapsulated as a statement.
604 Operand 0 is the LABEL_DECL node for the label that appears here.
605 The type should be void and the value should be ignored. */
606 DEFTREECODE (LABEL_EXPR, "label_expr", "s", 1)
608 /* GOTO. Operand 0 is a LABEL_DECL node.
609 The type should be void and the value should be ignored. */
610 DEFTREECODE (GOTO_EXPR, "goto_expr", "s", 1)
612 /* RETURN. Evaluates operand 0, then returns from the current function.
613 Presumably that operand is an assignment that stores into the
614 RESULT_DECL that hold the value to be returned.
615 The operand may be null.
616 The type should be void and the value should be ignored. */
617 DEFTREECODE (RETURN_EXPR, "return_expr", "s", 1)
619 /* Exit the inner most loop conditionally. Operand 0 is the condition.
620 The type should be void and the value should be ignored. */
621 DEFTREECODE (EXIT_EXPR, "exit_expr", "s", 1)
623 /* A loop. Operand 0 is the body of the loop.
624 It must contain an EXIT_EXPR or is an infinite loop.
625 The type should be void and the value should be ignored. */
626 DEFTREECODE (LOOP_EXPR, "loop_expr", "s", 1)