]>
Commit | Line | Data |
---|---|---|
6d77ee89 | 1 | /* This file contains the definitions and documentation for the |
5e6908ea | 2 | tree codes used in GCC. |
a6dd4094 | 3 | Copyright (C) 1987, 1988, 1993, 1995, 1997, 1998, 2000, 2001, 2004 |
b4e3fabb | 4 | Free Software Foundation, Inc. |
6d77ee89 | 5 | |
1322177d | 6 | This file is part of GCC. |
6d77ee89 | 7 | |
1322177d LB |
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. | |
6d77ee89 | 12 | |
1322177d LB |
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. | |
6d77ee89 BK |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d LB |
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. */ | |
6d77ee89 | 22 | |
9f63daea | 23 | |
6615c446 JO |
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. */ | |
6d77ee89 BK |
32 | |
33 | /* Any erroneous construct is parsed into a node of this type. | |
34 | This type of node is accepted without complaint in all contexts | |
35 | by later parsing activities, to avoid multiple error messages | |
36 | for one error. | |
37 | No fields in these nodes are used except the TREE_CODE. */ | |
6615c446 | 38 | DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 0) |
6d77ee89 BK |
39 | |
40 | /* Used to represent a name (such as, in the DECL_NAME of a decl node). | |
41 | Internally it looks like a STRING_CST node. | |
42 | There is only one IDENTIFIER_NODE ever made for any particular name. | |
43 | Use `get_identifier' to get it (or create it, the first time). */ | |
6615c446 | 44 | DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0) |
6d77ee89 | 45 | |
6d77ee89 BK |
46 | /* Has the TREE_VALUE and TREE_PURPOSE fields. */ |
47 | /* These nodes are made into lists by chaining through the | |
48 | TREE_CHAIN field. The elements of the list live in the | |
49 | TREE_VALUE fields, while TREE_PURPOSE fields are occasionally | |
50 | used as well to get the effect of Lisp association lists. */ | |
6615c446 | 51 | DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0) |
6d77ee89 BK |
52 | |
53 | /* These nodes contain an array of tree nodes. */ | |
6615c446 | 54 | DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0) |
6d77ee89 BK |
55 | |
56 | /* A symbol binding block. These are arranged in a tree, | |
57 | where the BLOCK_SUBBLOCKS field contains a chain of subblocks | |
58 | chained through the BLOCK_CHAIN field. | |
59 | BLOCK_SUPERCONTEXT points to the parent block. | |
60 | For a block which represents the outermost scope of a function, it | |
61 | points to the FUNCTION_DECL node. | |
62 | BLOCK_VARS points to a chain of decl nodes. | |
63 | BLOCK_TYPE_TAGS points to a chain of types which have their own names. | |
64 | BLOCK_CHAIN points to the next BLOCK at the same level. | |
65 | BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which | |
66 | this block is an instance of, or else is NULL to indicate that this | |
67 | block is not an instance of anything else. When non-NULL, the value | |
68 | could either point to another BLOCK node or it could point to a | |
69 | FUNCTION_DECL node (e.g. in the case of a block representing the | |
70 | outermost scope of a particular inlining of a function). | |
0e9e1e0a | 71 | BLOCK_ABSTRACT is nonzero if the block represents an abstract |
6d77ee89 | 72 | instance of a block (i.e. one which is nested within an abstract |
9f63daea | 73 | instance of an inline function). |
0e9e1e0a | 74 | TREE_ASM_WRITTEN is nonzero if the block was actually referenced |
18c038b9 | 75 | in the generated assembly. */ |
6615c446 | 76 | DEFTREECODE (BLOCK, "block", tcc_exceptional, 0) |
6d77ee89 BK |
77 | \f |
78 | /* Each data type is represented by a tree node whose code is one of | |
79 | the following: */ | |
80 | /* Each node that represents a data type has a component TYPE_SIZE | |
81 | containing a tree that is an expression for the size in bits. | |
82 | The TYPE_MODE contains the machine mode for values of this type. | |
83 | The TYPE_POINTER_TO field contains a type for a pointer to this type, | |
84 | or zero if no such has been created yet. | |
85 | The TYPE_NEXT_VARIANT field is used to chain together types | |
86 | that are variants made by type modifiers such as "const" and "volatile". | |
87 | The TYPE_MAIN_VARIANT field, in any member of such a chain, | |
88 | points to the start of the chain. | |
89 | The TYPE_NONCOPIED_PARTS field is a list specifying which parts | |
90 | of an object of this type should *not* be copied by assignment. | |
c15398de MM |
91 | The TREE_VALUE of each is a FIELD_DECL that should not be |
92 | copied. The TREE_PURPOSE is an initial value for that field when | |
93 | an object of this type is initialized via an INIT_EXPR. It may | |
94 | be NULL if no special value is required. Even the things in this | |
95 | list are copied if the right-hand side of an assignment is known | |
96 | to be a complete object (rather than being, perhaps, a subobject | |
97 | of some other object.) The determination of what constitutes a | |
98 | complete object is done by fixed_type_p. | |
6d77ee89 BK |
99 | The TYPE_NAME field contains info on the name used in the program |
100 | for this type (for GDB symbol table output). It is either a | |
101 | TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE | |
102 | in the case of structs, unions or enums that are known with a tag, | |
103 | or zero for types that have no special name. | |
104 | The TYPE_CONTEXT for any sort of type which could have a name or | |
105 | which could have named members (e.g. tagged types in C/C++) will | |
106 | point to the node which represents the scope of the given type, or | |
107 | will be NULL_TREE if the type has "file scope". For most types, this | |
108 | will point to a BLOCK node or a FUNCTION_DECL node, but it could also | |
109 | point to a FUNCTION_TYPE node (for types whose scope is limited to the | |
110 | formal parameter list of some function type specification) or it | |
08703ee4 RK |
111 | could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node |
112 | (for C++ "member" types). | |
6d77ee89 BK |
113 | For non-tagged-types, TYPE_CONTEXT need not be set to anything in |
114 | particular, since any type which is of some type category (e.g. | |
115 | an array type or a function type) which cannot either have a name | |
08703ee4 RK |
116 | itself or have named members doesn't really have a "scope" per se. |
117 | The TREE_CHAIN field is used as a forward-references to names for | |
118 | ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes; | |
119 | see below. */ | |
6d77ee89 | 120 | |
6615c446 JO |
121 | DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0) |
122 | /* The void type in C */ | |
6d77ee89 | 123 | |
442cb32d PB |
124 | /* Integer types in all languages, including char in C. |
125 | Also used for sub-ranges of other discrete types. | |
126 | Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive) | |
6d77ee89 BK |
127 | and TYPE_PRECISION (number of bits used by this type). |
128 | In the case of a subrange type in Pascal, the TREE_TYPE | |
442cb32d PB |
129 | of this will point at the supertype (another INTEGER_TYPE, |
130 | or an ENUMERAL_TYPE, CHAR_TYPE, or BOOLEAN_TYPE). | |
6d77ee89 | 131 | Otherwise, the TREE_TYPE is zero. */ |
6615c446 | 132 | DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 0) |
6d77ee89 BK |
133 | |
134 | /* C's float and double. Different floating types are distinguished | |
135 | by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */ | |
6615c446 | 136 | DEFTREECODE (REAL_TYPE, "real_type", tcc_type, 0) |
6d77ee89 BK |
137 | |
138 | /* Complex number types. The TREE_TYPE field is the data type | |
139 | of the real and imaginary parts. */ | |
6615c446 | 140 | DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0) |
6d77ee89 | 141 | |
0b4565c9 | 142 | /* Vector types. The TREE_TYPE field is the data type of the vector |
26277d41 PB |
143 | elements. The TYPE_PRECISION field is the number of subparts of |
144 | the vector. */ | |
6615c446 | 145 | DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0) |
0b4565c9 | 146 | |
6d77ee89 BK |
147 | /* C enums. The type node looks just like an INTEGER_TYPE node. |
148 | The symbols for the values of the enum type are defined by | |
149 | CONST_DECL nodes, but the type does not point to them; | |
e6702919 | 150 | however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE |
6d77ee89 BK |
151 | is a name and the TREE_VALUE is the value (an INTEGER_CST node). */ |
152 | /* A forward reference `enum foo' when no enum named foo is defined yet | |
153 | has zero (a null pointer) in its TYPE_SIZE. The tag name is in | |
154 | the TYPE_NAME field. If the type is later defined, the normal | |
155 | fields are filled in. | |
08703ee4 RK |
156 | RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are |
157 | treated similarly. */ | |
6615c446 | 158 | DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0) |
6d77ee89 BK |
159 | |
160 | /* Pascal's boolean type (true or false are the only values); | |
161 | no special fields needed. */ | |
6615c446 | 162 | DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0) |
6d77ee89 BK |
163 | |
164 | /* CHAR in Pascal; not used in C. | |
165 | No special fields needed. */ | |
6615c446 | 166 | DEFTREECODE (CHAR_TYPE, "char_type", tcc_type, 0) |
6d77ee89 BK |
167 | |
168 | /* All pointer-to-x types have code POINTER_TYPE. | |
169 | The TREE_TYPE points to the node for the type pointed to. */ | |
6615c446 | 170 | DEFTREECODE (POINTER_TYPE, "pointer_type", tcc_type, 0) |
6d77ee89 BK |
171 | |
172 | /* An offset is a pointer relative to an object. | |
173 | The TREE_TYPE field is the type of the object at the offset. | |
174 | The TYPE_OFFSET_BASETYPE points to the node for the type of object | |
175 | that the offset is relative to. */ | |
6615c446 | 176 | DEFTREECODE (OFFSET_TYPE, "offset_type", tcc_type, 0) |
6d77ee89 BK |
177 | |
178 | /* A reference is like a pointer except that it is coerced | |
179 | automatically to the value it points to. Used in C++. */ | |
6615c446 | 180 | DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0) |
6d77ee89 BK |
181 | |
182 | /* METHOD_TYPE is the type of a function which takes an extra first | |
183 | argument for "self", which is not present in the declared argument list. | |
184 | The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE | |
185 | is the type of "self". TYPE_ARG_TYPES is the real argument list, which | |
186 | includes the hidden argument for "self". */ | |
6615c446 | 187 | DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0) |
6d77ee89 BK |
188 | |
189 | /* Used for Pascal; details not determined right now. */ | |
6615c446 | 190 | DEFTREECODE (FILE_TYPE, "file_type", tcc_type, 0) |
6d77ee89 BK |
191 | |
192 | /* Types of arrays. Special fields: | |
193 | TREE_TYPE Type of an array element. | |
194 | TYPE_DOMAIN Type to index by. | |
195 | Its range of values specifies the array length. | |
6d77ee89 | 196 | The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero |
70b78a26 PB |
197 | and holds the type to coerce a value of that array type to in C. |
198 | TYPE_STRING_FLAG indicates a string (in contrast to an array of chars) | |
991b6592 | 199 | in languages (such as Chill) that make a distinction. */ |
6d77ee89 | 200 | /* Array types in C or Pascal */ |
6615c446 | 201 | DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0) |
6d77ee89 BK |
202 | |
203 | /* Types of sets for Pascal. Special fields are the same as | |
38d42ddb PB |
204 | in an array type. The target type is always a boolean type. |
205 | Used for both bitstrings and powersets in Chill; | |
991b6592 | 206 | TYPE_STRING_FLAG indicates a bitstring. */ |
6615c446 | 207 | DEFTREECODE (SET_TYPE, "set_type", tcc_type, 0) |
6d77ee89 | 208 | |
6d77ee89 BK |
209 | /* Struct in C, or record in Pascal. */ |
210 | /* Special fields: | |
a082c85a JM |
211 | TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct, |
212 | and VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables, | |
213 | types and enumerators. | |
6d77ee89 BK |
214 | A few may need to be added for Pascal. */ |
215 | /* See the comment above, before ENUMERAL_TYPE, for how | |
216 | forward references to struct tags are handled in C. */ | |
6615c446 | 217 | DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0) |
6d77ee89 BK |
218 | |
219 | /* Union in C. Like a struct, except that the offsets of the fields | |
220 | will all be zero. */ | |
221 | /* See the comment above, before ENUMERAL_TYPE, for how | |
222 | forward references to union tags are handled in C. */ | |
6615c446 | 223 | DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */ |
6d77ee89 | 224 | |
08703ee4 RK |
225 | /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER |
226 | in each FIELD_DECL determine what the union contains. The first | |
227 | field whose DECL_QUALIFIER expression is true is deemed to occupy | |
228 | the union. */ | |
6615c446 | 229 | DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0) |
08703ee4 | 230 | |
6d77ee89 BK |
231 | /* Type of functions. Special fields: |
232 | TREE_TYPE type of value returned. | |
233 | TYPE_ARG_TYPES list of types of arguments expected. | |
234 | this list is made of TREE_LIST nodes. | |
235 | Types of "Procedures" in languages where they are different from functions | |
236 | have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */ | |
6615c446 | 237 | DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0) |
6d77ee89 BK |
238 | |
239 | /* This is a language-specific kind of type. | |
240 | Its meaning is defined by the language front end. | |
241 | layout_type does not know how to lay this out, | |
242 | so the front-end must do so manually. */ | |
6615c446 | 243 | DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0) |
6d77ee89 BK |
244 | \f |
245 | /* Expressions */ | |
246 | ||
247 | /* First, the constants. */ | |
248 | ||
249 | /* Contents are in TREE_INT_CST_LOW and TREE_INT_CST_HIGH fields, | |
89b0433e NS |
250 | 32 bits each, giving us a 64 bit constant capability. INTEGER_CST |
251 | nodes can be shared, and therefore should be considered read only. | |
252 | They should be copied, before setting a flag such as | |
253 | TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW or | |
254 | TREE_CONSTANT_OVERFLOW already set, it is known to be unique. | |
255 | INTEGER_CST nodes are created for the integral types, for pointer | |
256 | types and for vector and float types in some circumstances. */ | |
6615c446 | 257 | DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0) |
6d77ee89 | 258 | |
d78e771d | 259 | /* Contents are in TREE_REAL_CST field. */ |
6615c446 | 260 | DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0) |
6d77ee89 BK |
261 | |
262 | /* Contents are in TREE_REALPART and TREE_IMAGPART fields, | |
d78e771d | 263 | whose contents are other constant nodes. */ |
6615c446 | 264 | DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0) |
6d77ee89 | 265 | |
69ef87e2 | 266 | /* Contents are in TREE_VECTOR_CST_ELTS field. */ |
6615c446 | 267 | DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0) |
69ef87e2 | 268 | |
a396f8ae | 269 | /* Contents are TREE_STRING_LENGTH and the actual contents of the string. */ |
6615c446 | 270 | DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0) |
6d77ee89 | 271 | |
d1bd0ded GK |
272 | /* Declarations. All references to names are represented as ..._DECL |
273 | nodes. The decls in one binding context are chained through the | |
274 | TREE_CHAIN field. Each DECL has a DECL_NAME field which contains | |
275 | an IDENTIFIER_NODE. (Some decls, most often labels, may have zero | |
276 | as the DECL_NAME). DECL_CONTEXT points to the node representing | |
277 | the context in which this declaration has its scope. For | |
278 | FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or | |
279 | QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
280 | PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
281 | points to either the FUNCTION_DECL for the containing function, the | |
282 | RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or | |
283 | a TRANSLATION_UNIT_DECL if the given decl has "file scope". | |
6d77ee89 BK |
284 | DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract) |
285 | ..._DECL node of which this decl is an (inlined or template expanded) | |
286 | instance. | |
287 | The TREE_TYPE field holds the data type of the object, when relevant. | |
288 | LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field | |
289 | contents are the type whose name is being declared. | |
290 | The DECL_ALIGN, DECL_SIZE, | |
291 | and DECL_MODE fields exist in decl nodes just as in type nodes. | |
292 | They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes. | |
293 | ||
d1bd0ded GK |
294 | DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for |
295 | the location. DECL_VOFFSET holds an expression for a variable | |
296 | offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer). | |
6d77ee89 BK |
297 | These fields are relevant only in FIELD_DECLs and PARM_DECLs. |
298 | ||
299 | DECL_INITIAL holds the value to initialize a variable to, | |
300 | or the value of a constant. For a function, it holds the body | |
301 | (a node of type BLOCK representing the function's binding contour | |
302 | and whose body contains the function's statements.) For a LABEL_DECL | |
303 | in C, it is a flag, nonzero if the label's definition has been seen. | |
304 | ||
305 | PARM_DECLs use a special field: | |
306 | DECL_ARG_TYPE is the type in which the argument is actually | |
307 | passed, which may be different from its type within the function. | |
308 | ||
309 | FUNCTION_DECLs use four special fields: | |
310 | DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments. | |
311 | DECL_RESULT holds a RESULT_DECL node for the value of a function, | |
312 | or it is 0 for a function that returns no value. | |
313 | (C functions returning void have zero here.) | |
dce2e8c0 JW |
314 | The TREE_TYPE field is the type in which the result is actually |
315 | returned. This is usually the same as the return type of the | |
316 | FUNCTION_DECL, but it may be a wider integer type because of | |
317 | promotion. | |
6d77ee89 BK |
318 | DECL_FUNCTION_CODE is a code number that is nonzero for |
319 | built-in functions. Its value is an enum built_in_function | |
320 | that says which built-in function it is. | |
321 | ||
f31686a3 | 322 | DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE |
6d77ee89 BK |
323 | holds a line number. In some cases these can be the location of |
324 | a reference, if no definition has been seen. | |
325 | ||
0e9e1e0a | 326 | DECL_ABSTRACT is nonzero if the decl represents an abstract instance |
6d77ee89 BK |
327 | of a decl (i.e. one which is nested within an abstract instance of a |
328 | inline function. */ | |
329 | ||
6615c446 JO |
330 | DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0) |
331 | DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0) | |
332 | DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0) | |
333 | DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0) | |
334 | DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0) | |
335 | DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0) | |
336 | DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0) | |
337 | DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0) | |
2addbe1d JM |
338 | |
339 | /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other | |
340 | _DECLs, providing a hierarchy of names. */ | |
6615c446 | 341 | DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0) |
d1bd0ded GK |
342 | |
343 | /* A translation unit. This is not technically a declaration, since it | |
344 | can't be looked up, but it's close enough. */ | |
6615c446 JO |
345 | DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\ |
346 | tcc_declaration, 0) | |
6d77ee89 BK |
347 | \f |
348 | /* References to storage. */ | |
349 | ||
350 | /* Value is structure or union component. | |
44de5aeb RK |
351 | Operand 0 is the structure or union (an expression). |
352 | Operand 1 is the field (a node of type FIELD_DECL). | |
353 | Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured | |
354 | in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */ | |
6615c446 | 355 | DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3) |
6d77ee89 BK |
356 | |
357 | /* Reference to a group of bits within an object. Similar to COMPONENT_REF | |
358 | except the position is given explicitly rather than via a FIELD_DECL. | |
359 | Operand 0 is the structure or union expression; | |
360 | operand 1 is a tree giving the number of bits being referenced; | |
361 | operand 2 is a tree giving the position of the first referenced bit. | |
362 | The field can be either a signed or unsigned field; | |
a150de29 | 363 | BIT_FIELD_REF_UNSIGNED says which. */ |
6615c446 | 364 | DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3) |
9f63daea | 365 | |
6d77ee89 | 366 | /* C unary `*' or Pascal `^'. One operand, an expression for a pointer. */ |
6615c446 | 367 | DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1) |
6d77ee89 | 368 | |
7ccf35ed DN |
369 | /* Like above, but aligns the referenced address (i.e, if the address |
370 | in P is not aligned on TYPE_ALIGN boundary, then &(*P) != P). */ | |
371 | DEFTREECODE (ALIGN_INDIRECT_REF, "align_indirect_ref", tcc_reference, 1) | |
372 | ||
373 | /* Same as INDIRECT_REF, but also specifies the alignment of the referenced | |
374 | address: | |
375 | Operand 0 is the referenced address (a pointer); | |
376 | Operand 1 is an INTEGER_CST which represents the alignment of the address, | |
377 | or 0 if the alignment is unknown. */ | |
378 | DEFTREECODE (MISALIGNED_INDIRECT_REF, "misaligned_indirect_ref", tcc_reference, 2) | |
379 | ||
b4e3fabb | 380 | /* Array indexing. |
44de5aeb RK |
381 | Operand 0 is the array; operand 1 is a (single) array index. |
382 | Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index. | |
383 | Operand 3, if present, is the element size, measured in units of | |
384 | the alignment of the element type. */ | |
6615c446 | 385 | DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4) |
6d77ee89 | 386 | |
75c2550a RK |
387 | /* Likewise, except that the result is a range ("slice") of the array. The |
388 | starting index of the resulting array is taken from operand 1 and the size | |
389 | of the range is taken from the type of the expression. */ | |
6615c446 | 390 | DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4) |
b4e3fabb | 391 | |
0f59171d RH |
392 | /* Used to represent lookup of runtime type dependent data. Often this is |
393 | a reference to a vtable, but it needn't be. Operands are: | |
394 | OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use. | |
395 | OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is | |
396 | being performed. Through this the optimizers may be able to statically | |
397 | determine the dynamic type of the object. | |
398 | OBJ_TYPE_REF_TOKEN: Something front-end specific used to resolve the | |
399 | reference to something simpler, usually to the address of a DECL. | |
400 | Never touched by the middle-end. Good choices would be either an | |
401 | identifier or a vtable index. */ | |
6615c446 | 402 | DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3) |
4a8d0c9c | 403 | |
6de9cd9a | 404 | /* The exception object from the runtime. */ |
6615c446 | 405 | DEFTREECODE (EXC_PTR_EXPR, "exc_ptr_expr", tcc_expression, 0) |
6de9cd9a DN |
406 | |
407 | /* The filter object from the runtime. */ | |
6615c446 | 408 | DEFTREECODE (FILTER_EXPR, "filter_expr", tcc_expression, 0) |
6de9cd9a | 409 | |
6d77ee89 BK |
410 | /* Constructor: return an aggregate value made from specified components. |
411 | In C, this is used only for structure and array initializers. | |
69b4bf98 | 412 | Also used for SET_TYPE in Chill (and potentially Pascal). |
0864034e ZW |
413 | The operand is a list of component values made out of a chain of |
414 | TREE_LIST nodes. | |
69b4bf98 PB |
415 | |
416 | For ARRAY_TYPE: | |
417 | The TREE_PURPOSE of each node is the corresponding index. | |
418 | If the TREE_PURPOSE is a RANGE_EXPR, it is a short-hand for many nodes, | |
419 | one for each index in the range. (If the corresponding TREE_VALUE | |
420 | has side-effects, they are evaluated once for each element. Wrap the | |
421 | value in a SAVE_EXPR if you want to evaluate side effects only once.) | |
422 | ||
423 | For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE: | |
424 | The TREE_PURPOSE of each node is a FIELD_DECL. | |
425 | ||
426 | For SET_TYPE: | |
427 | The TREE_VALUE specifies a value (index) in the set that is true. | |
428 | If TREE_PURPOSE is non-NULL, it specifies the lower limit of a | |
429 | range of true values. Elements not listed are false (not in the set). */ | |
6615c446 | 430 | DEFTREECODE (CONSTRUCTOR, "constructor", tcc_expression, 1) |
6d77ee89 | 431 | |
340af9ef RK |
432 | /* The expression types are mostly straightforward, with the fourth argument |
433 | of DEFTREECODE saying how many operands there are. | |
434 | Unless otherwise specified, the operands are expressions and the | |
435 | types of all the operands and the expression must all be the same. */ | |
6d77ee89 BK |
436 | |
437 | /* Contains two expressions to compute, one followed by the other. | |
340af9ef RK |
438 | the first value is ignored. The second one's value is used. The |
439 | type of the first expression need not agree with the other types. */ | |
6615c446 | 440 | DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2) |
6d77ee89 BK |
441 | |
442 | /* Assignment expression. Operand 0 is the what to set; 1, the new value. */ | |
6615c446 | 443 | DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2) |
6d77ee89 BK |
444 | |
445 | /* Initialization expression. Operand 0 is the variable to initialize; | |
446 | Operand 1 is the initializer. */ | |
6615c446 | 447 | DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2) |
6d77ee89 BK |
448 | |
449 | /* For TARGET_EXPR, operand 0 is the target of an initialization, | |
2692eb7d | 450 | operand 1 is the initializer for the target, which may be void |
70c18d97 | 451 | if simply expanding it initializes the target. |
2692eb7d JM |
452 | operand 2 is the cleanup for this node, if any. |
453 | operand 3 is the saved initializer after this node has been | |
454 | expanded once; this is so we can re-expand the tree later. */ | |
6615c446 | 455 | DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4) |
6d77ee89 BK |
456 | |
457 | /* Conditional expression ( ... ? ... : ... in C). | |
458 | Operand 0 is the condition. | |
459 | Operand 1 is the then-value. | |
340af9ef | 460 | Operand 2 is the else-value. |
68626d4f MM |
461 | Operand 0 may be of any type. |
462 | Operand 1 must have the same type as the entire expression, unless | |
463 | it unconditionally throws an exception, in which case it should | |
464 | have VOID_TYPE. The same constraints apply to operand 2. */ | |
6615c446 | 465 | DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3) |
6d77ee89 | 466 | |
ad9f20cb DP |
467 | /* Vector conditional expresion. It is like COND_EXPR, but with |
468 | vector operands. | |
469 | ||
470 | A = VEC_COND_EXPR ( X < Y, B, C) | |
471 | ||
472 | means | |
473 | ||
474 | for (i=0; i<N; i++) | |
475 | A[i] = X[i] < Y[i] ? B[i] : C[i]; | |
476 | */ | |
477 | DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", 'e', 3) | |
478 | ||
6d77ee89 | 479 | /* Declare local variables, including making RTL and allocating space. |
6de9cd9a | 480 | BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables. |
9f63daea | 481 | BIND_EXPR_BODY is the body, the expression to be computed using |
6d77ee89 | 482 | the variables. The value of operand 1 becomes that of the BIND_EXPR. |
6de9cd9a | 483 | BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings |
6d77ee89 BK |
484 | for debugging purposes. If this BIND_EXPR is actually expanded, |
485 | that sets the TREE_USED flag in the BLOCK. | |
486 | ||
487 | The BIND_EXPR is not responsible for informing parsers | |
488 | about these variables. If the body is coming from the input file, | |
9f63daea | 489 | then the code that creates the BIND_EXPR is also responsible for |
6d77ee89 BK |
490 | informing the parser of the variables. |
491 | ||
492 | If the BIND_EXPR is ever expanded, its TREE_USED flag is set. | |
493 | This tells the code for debugging symbol tables not to ignore the BIND_EXPR. | |
9f63daea | 494 | If the BIND_EXPR should be output for debugging but will not be expanded, |
6d77ee89 BK |
495 | set the TREE_USED flag by hand. |
496 | ||
497 | In order for the BIND_EXPR to be known at all, the code that creates it | |
498 | must also install it as a subblock in the tree of BLOCK | |
499 | nodes for the function. */ | |
6615c446 | 500 | DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3) |
6d77ee89 | 501 | |
6de9cd9a DN |
502 | /* A labeled block. Operand 0 is the label that will be generated to |
503 | mark the end of the block. | |
504 | Operand 1 is the labeled block body. */ | |
6615c446 | 505 | DEFTREECODE (LABELED_BLOCK_EXPR, "labeled_block_expr", tcc_expression, 2) |
6de9cd9a | 506 | |
6d77ee89 BK |
507 | /* Function call. Operand 0 is the function. |
508 | Operand 1 is the argument list, a list of expressions | |
6de9cd9a DN |
509 | made out of a chain of TREE_LIST nodes. |
510 | Operand 2 is the static chain argument, or NULL. */ | |
6615c446 | 511 | DEFTREECODE (CALL_EXPR, "call_expr", tcc_expression, 3) |
6d77ee89 | 512 | |
6d77ee89 | 513 | /* Specify a value to compute along with its corresponding cleanup. |
ac45df5d RH |
514 | Operand 0 is the cleanup expression. |
515 | The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR, | |
516 | which must exist. This differs from TRY_CATCH_EXPR in that operand 1 | |
517 | is always evaluated when cleanups are run. */ | |
6615c446 | 518 | DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1) |
5dab5552 MS |
519 | |
520 | /* Specify a cleanup point. | |
8736e836 JM |
521 | Operand 0 is an expression that may have cleanups. If it does, those |
522 | cleanups are executed after the expression is expanded. | |
523 | ||
524 | Note that if the expression is a reference to storage, it is forced out | |
525 | of memory before the cleanups are run. This is necessary to handle | |
526 | cases where the cleanups modify the storage referenced; in the | |
527 | expression 't.i', if 't' is a struct with an integer member 'i' and a | |
528 | cleanup which modifies 'i', the value of the expression depends on | |
529 | whether the cleanup is run before or after 't.i' is evaluated. When | |
530 | expand_expr is run on 't.i', it returns a MEM. This is not good enough; | |
531 | the value of 't.i' must be forced out of memory. | |
532 | ||
533 | As a consequence, the operand of a CLEANUP_POINT_EXPR must not have | |
534 | BLKmode, because it will not be forced out of memory. */ | |
6615c446 | 535 | DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1) |
6d77ee89 | 536 | |
ab487f12 | 537 | /* The following two codes are used in languages that have types where |
2a7b6292 PG |
538 | some field in an object of the type contains a value that is used in |
539 | the computation of another field's offset or size and/or the size of | |
540 | the type. The positions and/or sizes of fields can vary from object | |
b00b4b88 PG |
541 | to object of the same type or even for one and the same object within |
542 | its scope. | |
2a7b6292 PG |
543 | |
544 | Record types with discriminants in Ada or schema types in Pascal are | |
545 | examples of such types. This mechanism is also used to create "fat | |
546 | pointers" for unconstrained array types in Ada; the fat pointer is a | |
547 | structure one of whose fields is a pointer to the actual array type | |
548 | and the other field is a pointer to a template, which is a structure | |
549 | containing the bounds of the array. The bounds in the type pointed | |
550 | to by the first field in the fat pointer refer to the values in the | |
551 | template. | |
552 | ||
553 | When you wish to construct such a type you need "self-references" | |
554 | that allow you to reference the object having this type from the | |
555 | TYPE node, i.e. without having a variable instantiating this type. | |
556 | ||
557 | Such a "self-references" is done using a PLACEHOLDER_EXPR. This is | |
558 | a node that will later be replaced with the object being referenced. | |
559 | Its type is that of the object and selects which object to use from | |
560 | a chain of references (see below). No other slots are used in the | |
561 | PLACEHOLDER_EXPR. | |
562 | ||
563 | For example, if your type FOO is a RECORD_TYPE with a field BAR, | |
564 | and you need the value of <variable>.BAR to calculate TYPE_SIZE | |
565 | (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR | |
b00b4b88 PG |
566 | whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with |
567 | the PLACEHOLDER_EXPR as the first operand (which has the correct | |
568 | type). Later, when the size is needed in the program, the back-end | |
569 | will find this PLACEHOLDER_EXPR and generate code to calculate the | |
570 | actual size at run-time. In the following, we describe how this | |
571 | calculation is done. | |
572 | ||
6fce44af RK |
573 | When we wish to evaluate a size or offset, we check whether it contains a |
574 | PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr | |
575 | passing both that tree and an expression within which the object may be | |
576 | found. The latter expression is the object itself in the simple case of | |
577 | an Ada record with discriminant, but it can be the array in the case of an | |
578 | unconstrained array. | |
2a7b6292 PG |
579 | |
580 | In the latter case, we need the fat pointer, because the bounds of | |
581 | the array can only be accessed from it. However, we rely here on the | |
582 | fact that the expression for the array contains the dereference of | |
6fce44af | 583 | the fat pointer that obtained the array pointer. */ |
ab487f12 | 584 | |
666c27b9 | 585 | /* Denotes a record to later be substituted before evaluating this expression. |
6fce44af | 586 | The type of this expression is used to find the record to replace it. */ |
6615c446 | 587 | DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0) |
ab487f12 | 588 | |
340af9ef | 589 | /* Simple arithmetic. */ |
6615c446 JO |
590 | DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2) |
591 | DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2) | |
592 | DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2) | |
6d77ee89 BK |
593 | |
594 | /* Division for integer result that rounds the quotient toward zero. */ | |
6615c446 | 595 | DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2) |
6d77ee89 BK |
596 | |
597 | /* Division for integer result that rounds the quotient toward infinity. */ | |
6615c446 | 598 | DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2) |
6d77ee89 BK |
599 | |
600 | /* Division for integer result that rounds toward minus infinity. */ | |
6615c446 | 601 | DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2) |
6d77ee89 BK |
602 | |
603 | /* Division for integer result that rounds toward nearest integer. */ | |
6615c446 | 604 | DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2) |
6d77ee89 BK |
605 | |
606 | /* Four kinds of remainder that go with the four kinds of division. */ | |
6615c446 JO |
607 | DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2) |
608 | DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2) | |
609 | DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2) | |
610 | DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2) | |
6d77ee89 | 611 | |
340af9ef | 612 | /* Division for real result. */ |
6615c446 | 613 | DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2) |
6d77ee89 BK |
614 | |
615 | /* Division which is not supposed to need rounding. | |
616 | Used for pointer subtraction in C. */ | |
6615c446 | 617 | DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2) |
6d77ee89 BK |
618 | |
619 | /* Conversion of real to fixed point: four ways to round, | |
620 | like the four ways to divide. | |
621 | CONVERT_EXPR can also be used to convert a real to an integer, | |
622 | and that is what is used in languages that do not have ways of | |
623 | specifying which of these is wanted. Maybe these are not needed. */ | |
6615c446 JO |
624 | DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1) |
625 | DEFTREECODE (FIX_CEIL_EXPR, "fix_ceil_expr", tcc_unary, 1) | |
626 | DEFTREECODE (FIX_FLOOR_EXPR, "fix_floor_expr", tcc_unary, 1) | |
627 | DEFTREECODE (FIX_ROUND_EXPR, "fix_round_expr", tcc_unary, 1) | |
6d77ee89 BK |
628 | |
629 | /* Conversion of an integer to a real. */ | |
6615c446 | 630 | DEFTREECODE (FLOAT_EXPR, "float_expr", tcc_unary, 1) |
6d77ee89 | 631 | |
340af9ef | 632 | /* Unary negation. */ |
6615c446 | 633 | DEFTREECODE (NEGATE_EXPR, "negate_expr", tcc_unary, 1) |
6d77ee89 | 634 | |
6615c446 JO |
635 | DEFTREECODE (MIN_EXPR, "min_expr", tcc_binary, 2) |
636 | DEFTREECODE (MAX_EXPR, "max_expr", tcc_binary, 2) | |
68e568c2 MM |
637 | |
638 | /* Represents the absolute value of the operand. | |
639 | ||
640 | An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The | |
641 | operand of the ABS_EXPR must have the same type. */ | |
6615c446 | 642 | DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1) |
68e568c2 | 643 | |
6d77ee89 | 644 | /* Shift operations for shift and rotate. |
4b7ee615 NS |
645 | Shift means logical shift if done on an |
646 | unsigned type, arithmetic shift if done on a signed type. | |
6d77ee89 | 647 | The second operand is the number of bits to |
7d46d516 TM |
648 | shift by; it need not be the same type as the first operand and result. |
649 | Note that the result is undefined if the second operand is larger | |
650 | than the first operand's type size. */ | |
6615c446 JO |
651 | DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2) |
652 | DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2) | |
653 | DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2) | |
654 | DEFTREECODE (RROTATE_EXPR, "rrotate_expr", tcc_binary, 2) | |
6d77ee89 BK |
655 | |
656 | /* Bitwise operations. Operands have same mode as result. */ | |
6615c446 JO |
657 | DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", tcc_binary, 2) |
658 | DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", tcc_binary, 2) | |
659 | DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", tcc_binary, 2) | |
660 | DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", tcc_unary, 1) | |
6d77ee89 | 661 | |
330aa9a3 MM |
662 | /* ANDIF and ORIF allow the second operand not to be computed if the |
663 | value of the expression is determined from the first operand. AND, | |
664 | OR, and XOR always compute the second operand whether its value is | |
665 | needed or not (for side effects). The operand may have | |
666 | BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be | |
667 | either zero or one. For example, a TRUTH_NOT_EXPR will never have | |
04d2be8e | 668 | an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be |
330aa9a3 MM |
669 | used to compare the VAR_DECL to zero, thereby obtaining a node with |
670 | value zero or one. */ | |
6615c446 JO |
671 | DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", tcc_expression, 2) |
672 | DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", tcc_expression, 2) | |
673 | DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", tcc_expression, 2) | |
674 | DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", tcc_expression, 2) | |
675 | DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", tcc_expression, 2) | |
676 | DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", tcc_expression, 1) | |
6d77ee89 BK |
677 | |
678 | /* Relational operators. | |
679 | `EQ_EXPR' and `NE_EXPR' are allowed for any types. | |
680 | The others are allowed only for integer (or pointer or enumeral) | |
681 | or real types. | |
682 | In all cases the operands will have the same type, | |
683 | and the value is always the type used by the language for booleans. */ | |
6615c446 JO |
684 | DEFTREECODE (LT_EXPR, "lt_expr", tcc_comparison, 2) |
685 | DEFTREECODE (LE_EXPR, "le_expr", tcc_comparison, 2) | |
686 | DEFTREECODE (GT_EXPR, "gt_expr", tcc_comparison, 2) | |
687 | DEFTREECODE (GE_EXPR, "ge_expr", tcc_comparison, 2) | |
688 | DEFTREECODE (EQ_EXPR, "eq_expr", tcc_comparison, 2) | |
689 | DEFTREECODE (NE_EXPR, "ne_expr", tcc_comparison, 2) | |
6d77ee89 | 690 | |
1eb8759b | 691 | /* Additional relational operators for floating point unordered. */ |
6615c446 JO |
692 | DEFTREECODE (UNORDERED_EXPR, "unordered_expr", tcc_comparison, 2) |
693 | DEFTREECODE (ORDERED_EXPR, "ordered_expr", tcc_comparison, 2) | |
1eb8759b | 694 | |
991b6592 | 695 | /* These are equivalent to unordered or ... */ |
6615c446 JO |
696 | DEFTREECODE (UNLT_EXPR, "unlt_expr", tcc_comparison, 2) |
697 | DEFTREECODE (UNLE_EXPR, "unle_expr", tcc_comparison, 2) | |
698 | DEFTREECODE (UNGT_EXPR, "ungt_expr", tcc_comparison, 2) | |
699 | DEFTREECODE (UNGE_EXPR, "unge_expr", tcc_comparison, 2) | |
700 | DEFTREECODE (UNEQ_EXPR, "uneq_expr", tcc_comparison, 2) | |
1eb8759b | 701 | |
d1a7edaf | 702 | /* This is the reverse of uneq_expr. */ |
6615c446 | 703 | DEFTREECODE (LTGT_EXPR, "ltgt_expr", tcc_comparison, 2) |
d1a7edaf | 704 | |
6615c446 | 705 | DEFTREECODE (RANGE_EXPR, "range_expr", tcc_binary, 2) |
6d77ee89 BK |
706 | |
707 | /* Represents a conversion of type of a value. | |
708 | All conversions, including implicit ones, must be | |
340af9ef | 709 | represented by CONVERT_EXPR or NOP_EXPR nodes. */ |
6615c446 | 710 | DEFTREECODE (CONVERT_EXPR, "convert_expr", tcc_unary, 1) |
6d77ee89 BK |
711 | |
712 | /* Represents a conversion expected to require no code to be generated. */ | |
6615c446 | 713 | DEFTREECODE (NOP_EXPR, "nop_expr", tcc_unary, 1) |
6d77ee89 BK |
714 | |
715 | /* Value is same as argument, but guaranteed not an lvalue. */ | |
6615c446 | 716 | DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", tcc_unary, 1) |
6d77ee89 | 717 | |
ed239f5a RK |
718 | /* Represents viewing something of one type as being of a second type. |
719 | This corresponds to an "Unchecked Conversion" in Ada and roughly to | |
720 | the idiom *(type2 *)&X in C. The only operand is the value to be | |
721 | viewed as being of another type. It is undefined if the type of the | |
c11c10d8 RK |
722 | input and of the expression have different sizes. |
723 | ||
724 | This code may also be used within the LHS of a MODIFY_EXPR, in which | |
725 | case no actual data motion may occur. TREE_ADDRESSABLE will be set in | |
726 | this case and GCC must abort if it could not do the operation without | |
727 | generating insns. */ | |
6615c446 | 728 | DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", tcc_reference, 1) |
ed239f5a | 729 | |
6d77ee89 | 730 | /* Represents something we computed once and will use multiple times. |
82c82743 RH |
731 | First operand is that expression. After it is evaluated once, it |
732 | will be replaced by the temporary variable that holds the value. */ | |
6615c446 | 733 | DEFTREECODE (SAVE_EXPR, "save_expr", tcc_expression, 1) |
6d77ee89 | 734 | |
6d77ee89 BK |
735 | /* & in C. Value is the address at which the operand's value resides. |
736 | Operand may have any mode. Result mode is Pmode. */ | |
6615c446 | 737 | DEFTREECODE (ADDR_EXPR, "addr_expr", tcc_expression, 1) |
6d77ee89 | 738 | |
9f63daea | 739 | /* Operand0 is a function constant; result is part N of a function |
67231816 | 740 | descriptor of type ptr_mode. */ |
6615c446 | 741 | DEFTREECODE (FDESC_EXPR, "fdesc_expr", tcc_expression, 2) |
67231816 | 742 | |
6d77ee89 BK |
743 | /* Given two real or integer operands of the same type, |
744 | returns a complex value of the corresponding complex type. */ | |
6615c446 | 745 | DEFTREECODE (COMPLEX_EXPR, "complex_expr", tcc_binary, 2) |
6d77ee89 | 746 | |
340af9ef | 747 | /* Complex conjugate of operand. Used only on complex types. */ |
6615c446 | 748 | DEFTREECODE (CONJ_EXPR, "conj_expr", tcc_unary, 1) |
6d77ee89 BK |
749 | |
750 | /* Used only on an operand of complex type, these return | |
751 | a value of the corresponding component type. */ | |
6615c446 JO |
752 | DEFTREECODE (REALPART_EXPR, "realpart_expr", tcc_reference, 1) |
753 | DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", tcc_reference, 1) | |
6d77ee89 BK |
754 | |
755 | /* Nodes for ++ and -- in C. | |
756 | The second arg is how much to increment or decrement by. | |
757 | For a pointer, it would be the size of the object pointed to. */ | |
6615c446 JO |
758 | DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", tcc_expression, 2) |
759 | DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", tcc_expression, 2) | |
760 | DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", tcc_expression, 2) | |
761 | DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", tcc_expression, 2) | |
e976b8b2 | 762 | |
d3707adb | 763 | /* Used to implement `va_arg'. */ |
6615c446 | 764 | DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", tcc_expression, 1) |
d3707adb | 765 | |
956d6950 | 766 | /* Evaluate operand 1. If and only if an exception is thrown during |
e976b8b2 MS |
767 | the evaluation of operand 1, evaluate operand 2. |
768 | ||
6de9cd9a DN |
769 | This differs from TRY_FINALLY_EXPR in that operand 2 is not evaluated |
770 | on a normal or jump exit, only on an exception. */ | |
6615c446 | 771 | DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", tcc_statement, 2) |
e976b8b2 | 772 | |
502bf1f3 | 773 | /* Evaluate the first operand. |
04d2be8e | 774 | The second operand is a cleanup expression which is evaluated |
ec86c71f | 775 | on any exit (normal, exception, or jump out) from this expression. */ |
6615c446 | 776 | DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", tcc_statement, 2) |
6d77ee89 BK |
777 | \f |
778 | /* These types of expressions have no useful value, | |
779 | and always have side effects. */ | |
780 | ||
350fae66 | 781 | /* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */ |
6615c446 | 782 | DEFTREECODE (DECL_EXPR, "decl_expr", tcc_statement, 1) |
350fae66 | 783 | |
6d77ee89 BK |
784 | /* A label definition, encapsulated as a statement. |
785 | Operand 0 is the LABEL_DECL node for the label that appears here. | |
786 | The type should be void and the value should be ignored. */ | |
6615c446 | 787 | DEFTREECODE (LABEL_EXPR, "label_expr", tcc_statement, 1) |
6d77ee89 | 788 | |
70e6ca43 | 789 | /* GOTO. Operand 0 is a LABEL_DECL node or an expression. |
6d77ee89 | 790 | The type should be void and the value should be ignored. */ |
6615c446 | 791 | DEFTREECODE (GOTO_EXPR, "goto_expr", tcc_statement, 1) |
6d77ee89 BK |
792 | |
793 | /* RETURN. Evaluates operand 0, then returns from the current function. | |
794 | Presumably that operand is an assignment that stores into the | |
795 | RESULT_DECL that hold the value to be returned. | |
796 | The operand may be null. | |
797 | The type should be void and the value should be ignored. */ | |
6615c446 | 798 | DEFTREECODE (RETURN_EXPR, "return_expr", tcc_statement, 1) |
6d77ee89 BK |
799 | |
800 | /* Exit the inner most loop conditionally. Operand 0 is the condition. | |
801 | The type should be void and the value should be ignored. */ | |
6615c446 | 802 | DEFTREECODE (EXIT_EXPR, "exit_expr", tcc_statement, 1) |
6d77ee89 BK |
803 | |
804 | /* A loop. Operand 0 is the body of the loop. | |
805 | It must contain an EXIT_EXPR or is an infinite loop. | |
806 | The type should be void and the value should be ignored. */ | |
6615c446 | 807 | DEFTREECODE (LOOP_EXPR, "loop_expr", tcc_statement, 1) |
6d77ee89 | 808 | |
0044c65c APB |
809 | /* Exit a labeled block, possibly returning a value. Operand 0 is a |
810 | LABELED_BLOCK_EXPR to exit. Operand 1 is the value to return. It | |
811 | may be left null. */ | |
6615c446 | 812 | DEFTREECODE (EXIT_BLOCK_EXPR, "exit_block_expr", tcc_statement, 2) |
7c226435 APB |
813 | |
814 | /* Switch expression. | |
52a11cbf | 815 | |
6de9cd9a DN |
816 | TREE_TYPE is the original type of the condition, before any |
817 | language required type conversions. It may be NULL, in which case | |
818 | the original type and final types are assumed to be the same. | |
819 | ||
820 | Operand 0 is the expression used to perform the branch, | |
821 | Operand 1 is the body of the switch, which probably contains | |
822 | CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2 | |
823 | must not be NULL. | |
824 | Operand 2 is either NULL_TREE or a TREE_VEC of the CASE_LABEL_EXPRs | |
825 | of all the cases. */ | |
6615c446 | 826 | DEFTREECODE (SWITCH_EXPR, "switch_expr", tcc_statement, 3) |
6de9cd9a DN |
827 | |
828 | /* Used to represent a case label. The operands are CASE_LOW and | |
829 | CASE_HIGH, respectively. If CASE_LOW is NULL_TREE, the label is a | |
830 | 'default' label. If CASE_HIGH is NULL_TREE, the label is a normal case | |
831 | label. CASE_LABEL is the corresponding LABEL_DECL. */ | |
6615c446 | 832 | DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", tcc_statement, 3) |
6de9cd9a | 833 | |
9f63daea | 834 | /* RESX. Resume execution after an exception. Operand 0 is a |
6de9cd9a | 835 | number indicating the exception region that is being left. */ |
6615c446 | 836 | DEFTREECODE (RESX_EXPR, "resx_expr", tcc_statement, 1) |
6de9cd9a DN |
837 | |
838 | /* Used to represent an inline assembly statement. ASM_STRING returns a | |
839 | STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS, | |
840 | ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers | |
841 | for the statement. */ | |
6615c446 | 842 | DEFTREECODE (ASM_EXPR, "asm_expr", tcc_statement, 4) |
6de9cd9a DN |
843 | |
844 | /* Variable references for SSA analysis. New SSA names are created every | |
845 | time a variable is assigned a new value. The SSA builder uses SSA_NAME | |
846 | nodes to implement SSA versioning. */ | |
6615c446 | 847 | DEFTREECODE (SSA_NAME, "ssa_name", tcc_exceptional, 0) |
6de9cd9a | 848 | |
6de9cd9a DN |
849 | /* SSA PHI operator. PHI_RESULT is the new SSA_NAME node created by |
850 | the PHI node. PHI_ARG_LENGTH is the number of arguments. | |
851 | PHI_ARG_ELT returns the Ith tuple <ssa_name, edge> from the | |
852 | argument list. Each tuple contains the incoming reaching | |
853 | definition (SSA_NAME node) and the edge via which that definition | |
854 | is coming through. */ | |
6615c446 | 855 | DEFTREECODE (PHI_NODE, "phi_node", tcc_exceptional, 0) |
6de9cd9a DN |
856 | |
857 | /* Used to represent a typed exception handler. CATCH_TYPES is the type (or | |
858 | list of types) handled, and CATCH_BODY is the code for the handler. */ | |
6615c446 | 859 | DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2) |
6de9cd9a DN |
860 | |
861 | /* Used to represent an exception specification. EH_FILTER_TYPES is a list | |
862 | of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on | |
863 | failure. EH_FILTER_MUST_NOT_THROW controls which range type to use when | |
864 | expanding. */ | |
6615c446 | 865 | DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2) |
6de9cd9a | 866 | |
c8a2ab6d SP |
867 | /* Node used for describing a property that is known at compile |
868 | time. */ | |
6615c446 | 869 | DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0) |
c8a2ab6d SP |
870 | |
871 | /* Node used for describing a property that is not known at compile | |
872 | time. */ | |
6615c446 | 873 | DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0) |
c8a2ab6d SP |
874 | |
875 | /* Polynomial chains of recurrences. | |
876 | Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */ | |
6615c446 | 877 | DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 3) |
c8a2ab6d | 878 | |
6de9cd9a DN |
879 | /* Used to chain children of container statements together. |
880 | Use the interface in tree-iterator.h to access this node. */ | |
6615c446 | 881 | DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0) |
52a11cbf | 882 | |
33c94679 DN |
883 | /* Value handles. Artificial nodes to represent expressions in |
884 | partial redundancy elimination (tree-ssa-pre.c). These nodes are | |
885 | used for expression canonicalization. If two expressions compute | |
886 | the same value, they will be assigned the same value handle. */ | |
6615c446 | 887 | DEFTREECODE (VALUE_HANDLE, "value_handle", tcc_exceptional, 0) |
33c94679 | 888 | |
95b4aca6 NS |
889 | /* Base class information. Holds information about a class as a |
890 | baseclass of itself or another class. */ | |
6615c446 | 891 | DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0) |
95b4aca6 | 892 | |
d25cee4d RH |
893 | /* Records the size for an expression of variable size type. This is |
894 | for use in contexts in which we are accessing the entire object, | |
895 | such as for a function call, or block copy. | |
896 | Operand 0 is the real expression. | |
897 | Operand 1 is the size of the type in the expression. */ | |
6615c446 | 898 | DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2) |
d25cee4d | 899 | |
7ccf35ed DN |
900 | /* Extract elements from two input vectors Operand 0 and Operand 1 |
901 | size VS, according to the offset OFF defined by Operand 2 as | |
902 | follows: | |
903 | If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to | |
904 | the first OFF elements of the vector OP1. | |
905 | If OFF == 0, then the returned vector is OP1. | |
906 | On different targets OFF may take different forms; It can be an address, in | |
907 | which case its low log2(VS)-1 bits define the offset, or it can be a mask | |
908 | generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */ | |
909 | DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3) | |
910 | ||
911 | /* Extract elements from two input vectors Operand 0 and Operand 1 | |
912 | size VS, according to the offset OFF defined by Operand 2 as | |
913 | follows: | |
914 | If OFF > 0, the last OFF elements of vector OP0 are concatenated to | |
915 | the first VS - OFF elements of the vector OP1. | |
916 | If OFF == 0, then the returned vector is OP0. | |
917 | On different targets OFF may take different forms; It can be an address, in | |
918 | which case its low log2(VS)-1 bits define the offset, or it can be a mask | |
919 | generated by the builtin targetm.vectorize.mask_for_store_builtin_decl. */ | |
920 | DEFTREECODE (REALIGN_STORE_EXPR, "realign_store", tcc_expression, 3) | |
921 | ||
6d77ee89 BK |
922 | /* |
923 | Local variables: | |
924 | mode:c | |
6d77ee89 BK |
925 | End: |
926 | */ |