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