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