Mercurial > hg > CbC > CbC_gcc
annotate gcc/tree.def @ 131:84e7813d76e9
gcc-8.2
| author | mir3636 |
|---|---|
| date | Thu, 25 Oct 2018 07:37:49 +0900 |
| parents | 04ced10e8804 |
| children | 1830386684a0 |
| rev | line source |
|---|---|
| 0 | 1 /* This file contains the definitions and documentation for the |
| 2 tree codes used in GCC. | |
| 131 | 3 Copyright (C) 1987-2018 Free Software Foundation, Inc. |
| 0 | 4 |
| 5 This file is part of GCC. | |
| 6 | |
| 7 GCC is free software; you can redistribute it and/or modify it under | |
| 8 the terms of the GNU General Public License as published by the Free | |
| 9 Software Foundation; either version 3, or (at your option) any later | |
| 10 version. | |
| 11 | |
| 12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
| 13 WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 15 for more details. | |
| 16 | |
| 17 You should have received a copy of the GNU General Public License | |
| 18 along with GCC; see the file COPYING3. If not see | |
| 19 <http://www.gnu.org/licenses/>. */ | |
| 20 | |
| 21 | |
| 22 /* For tcc_references, tcc_expression, tcc_comparison, tcc_unary, | |
| 23 tcc_binary, and tcc_statement nodes, which use struct tree_exp, the | |
| 24 4th element is the number of argument slots to allocate. This | |
| 25 determines the size of the tree node object. Other nodes use | |
| 26 different structures, and the size is determined by the tree_union | |
| 27 member structure; the 4th element should be zero. Languages that | |
| 28 define language-specific tcc_exceptional or tcc_constant codes must | |
| 29 define the tree_size langhook to say how big they are. | |
| 30 | |
| 31 These tree codes have been sorted so that the macros in tree.h that | |
| 32 check for various tree codes are optimized into range checks. This | |
| 33 gives a measurable performance improvement. When adding a new | |
| 131 | 34 code, consider its placement in relation to the other codes. */ |
| 0 | 35 |
| 36 /* Any erroneous construct is parsed into a node of this type. | |
| 37 This type of node is accepted without complaint in all contexts | |
| 38 by later parsing activities, to avoid multiple error messages | |
| 39 for one error. | |
| 40 No fields in these nodes are used except the TREE_CODE. */ | |
| 41 DEFTREECODE (ERROR_MARK, "error_mark", tcc_exceptional, 0) | |
| 42 | |
| 43 /* Used to represent a name (such as, in the DECL_NAME of a decl node). | |
| 44 Internally it looks like a STRING_CST node. | |
| 45 There is only one IDENTIFIER_NODE ever made for any particular name. | |
| 46 Use `get_identifier' to get it (or create it, the first time). */ | |
| 47 DEFTREECODE (IDENTIFIER_NODE, "identifier_node", tcc_exceptional, 0) | |
| 48 | |
| 49 /* Has the TREE_VALUE and TREE_PURPOSE fields. */ | |
| 50 /* These nodes are made into lists by chaining through the | |
| 51 TREE_CHAIN field. The elements of the list live in the | |
| 52 TREE_VALUE fields, while TREE_PURPOSE fields are occasionally | |
| 53 used as well to get the effect of Lisp association lists. */ | |
| 54 DEFTREECODE (TREE_LIST, "tree_list", tcc_exceptional, 0) | |
| 55 | |
| 56 /* These nodes contain an array of tree nodes. */ | |
| 57 DEFTREECODE (TREE_VEC, "tree_vec", tcc_exceptional, 0) | |
| 58 | |
| 59 /* A symbol binding block. These are arranged in a tree, | |
| 60 where the BLOCK_SUBBLOCKS field contains a chain of subblocks | |
| 61 chained through the BLOCK_CHAIN field. | |
| 62 BLOCK_SUPERCONTEXT points to the parent block. | |
| 63 For a block which represents the outermost scope of a function, it | |
| 64 points to the FUNCTION_DECL node. | |
| 65 BLOCK_VARS points to a chain of decl nodes. | |
| 66 BLOCK_CHAIN points to the next BLOCK at the same level. | |
| 67 BLOCK_ABSTRACT_ORIGIN points to the original (abstract) tree node which | |
| 68 this block is an instance of, or else is NULL to indicate that this | |
| 69 block is not an instance of anything else. When non-NULL, the value | |
| 70 could either point to another BLOCK node or it could point to a | |
| 71 FUNCTION_DECL node (e.g. in the case of a block representing the | |
| 72 outermost scope of a particular inlining of a function). | |
| 73 TREE_ASM_WRITTEN is nonzero if the block was actually referenced | |
| 74 in the generated assembly. */ | |
| 75 DEFTREECODE (BLOCK, "block", tcc_exceptional, 0) | |
| 76 | |
| 77 /* Each data type is represented by a tree node whose code is one of | |
| 78 the following: */ | |
| 79 /* Each node that represents a data type has a component TYPE_SIZE | |
| 80 containing a tree that is an expression for the size in bits. | |
| 81 The TYPE_MODE contains the machine mode for values of this type. | |
| 82 The TYPE_POINTER_TO field contains a type for a pointer to this type, | |
| 83 or zero if no such has been created yet. | |
| 84 The TYPE_NEXT_VARIANT field is used to chain together types | |
| 85 that are variants made by type modifiers such as "const" and "volatile". | |
| 86 The TYPE_MAIN_VARIANT field, in any member of such a chain, | |
| 87 points to the start of the chain. | |
| 88 The TYPE_NAME field contains info on the name used in the program | |
| 89 for this type (for GDB symbol table output). It is either a | |
| 90 TYPE_DECL node, for types that are typedefs, or an IDENTIFIER_NODE | |
| 91 in the case of structs, unions or enums that are known with a tag, | |
| 92 or zero for types that have no special name. | |
| 93 The TYPE_CONTEXT for any sort of type which could have a name or | |
| 94 which could have named members (e.g. tagged types in C/C++) will | |
| 95 point to the node which represents the scope of the given type, or | |
| 96 will be NULL_TREE if the type has "file scope". For most types, this | |
| 97 will point to a BLOCK node or a FUNCTION_DECL node, but it could also | |
| 98 point to a FUNCTION_TYPE node (for types whose scope is limited to the | |
| 99 formal parameter list of some function type specification) or it | |
| 100 could point to a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE node | |
| 101 (for C++ "member" types). | |
| 102 For non-tagged-types, TYPE_CONTEXT need not be set to anything in | |
| 103 particular, since any type which is of some type category (e.g. | |
| 104 an array type or a function type) which cannot either have a name | |
| 105 itself or have named members doesn't really have a "scope" per se. | |
| 111 | 106 The TYPE_STUB_DECL field is used as a forward-references to names for |
| 0 | 107 ENUMERAL_TYPE, RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE nodes; |
| 108 see below. */ | |
| 109 | |
| 110 /* The ordering of the following codes is optimized for the checking | |
| 111 macros in tree.h. Changing the order will degrade the speed of the | |
| 112 compiler. OFFSET_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, INTEGER_TYPE, | |
| 113 REAL_TYPE, POINTER_TYPE. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
114 |
| 0 | 115 /* An offset is a pointer relative to an object. |
| 116 The TREE_TYPE field is the type of the object at the offset. | |
| 117 The TYPE_OFFSET_BASETYPE points to the node for the type of object | |
| 118 that the offset is relative to. */ | |
| 119 DEFTREECODE (OFFSET_TYPE, "offset_type", tcc_type, 0) | |
| 120 | |
| 121 /* C enums. The type node looks just like an INTEGER_TYPE node. | |
| 122 The symbols for the values of the enum type are defined by | |
| 123 CONST_DECL nodes, but the type does not point to them; | |
| 124 however, the TYPE_VALUES is a list in which each element's TREE_PURPOSE | |
| 125 is a name and the TREE_VALUE is the value (an INTEGER_CST node). */ | |
| 126 /* A forward reference `enum foo' when no enum named foo is defined yet | |
| 127 has zero (a null pointer) in its TYPE_SIZE. The tag name is in | |
| 128 the TYPE_NAME field. If the type is later defined, the normal | |
| 129 fields are filled in. | |
| 130 RECORD_TYPE, UNION_TYPE, and QUAL_UNION_TYPE forward refs are | |
| 131 treated similarly. */ | |
| 132 DEFTREECODE (ENUMERAL_TYPE, "enumeral_type", tcc_type, 0) | |
| 133 | |
| 134 /* Boolean type (true or false are the only values). Looks like an | |
| 135 INTEGRAL_TYPE. */ | |
| 136 DEFTREECODE (BOOLEAN_TYPE, "boolean_type", tcc_type, 0) | |
| 137 | |
| 138 /* Integer types in all languages, including char in C. | |
| 139 Also used for sub-ranges of other discrete types. | |
| 140 Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive) | |
| 131 | 141 and TYPE_PRECISION (number of bits used by this type). */ |
| 0 | 142 DEFTREECODE (INTEGER_TYPE, "integer_type", tcc_type, 0) |
| 143 | |
| 144 /* C's float and double. Different floating types are distinguished | |
| 145 by machine mode and by the TYPE_SIZE and the TYPE_PRECISION. */ | |
| 146 DEFTREECODE (REAL_TYPE, "real_type", tcc_type, 0) | |
| 147 | |
| 148 /* The ordering of the following codes is optimized for the checking | |
| 149 macros in tree.h. Changing the order will degrade the speed of the | |
| 150 compiler. POINTER_TYPE, REFERENCE_TYPE. Note that this range | |
| 151 overlaps the previous range of ordered types. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
152 |
| 0 | 153 /* All pointer-to-x types have code POINTER_TYPE. |
| 154 The TREE_TYPE points to the node for the type pointed to. */ | |
| 155 DEFTREECODE (POINTER_TYPE, "pointer_type", tcc_type, 0) | |
| 156 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
157 /* A reference is like a pointer except that it is coerced |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
158 automatically to the value it points to. Used in C++. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
159 DEFTREECODE (REFERENCE_TYPE, "reference_type", tcc_type, 0) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
160 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
161 /* The C++ decltype(nullptr) type. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
162 DEFTREECODE (NULLPTR_TYPE, "nullptr_type", tcc_type, 0) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
163 |
| 0 | 164 /* _Fract and _Accum types in Embedded-C. Different fixed-point types |
| 165 are distinguished by machine mode and by the TYPE_SIZE and the | |
| 166 TYPE_PRECISION. */ | |
| 167 DEFTREECODE (FIXED_POINT_TYPE, "fixed_point_type", tcc_type, 0) | |
| 168 | |
| 169 /* The ordering of the following codes is optimized for the checking | |
| 170 macros in tree.h. Changing the order will degrade the speed of the | |
| 171 compiler. COMPLEX_TYPE, VECTOR_TYPE, ARRAY_TYPE. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
172 |
| 0 | 173 /* Complex number types. The TREE_TYPE field is the data type |
| 174 of the real and imaginary parts. It must be of scalar | |
| 175 arithmetic type, not including pointer type. */ | |
| 176 DEFTREECODE (COMPLEX_TYPE, "complex_type", tcc_type, 0) | |
| 177 | |
| 178 /* Vector types. The TREE_TYPE field is the data type of the vector | |
| 179 elements. The TYPE_PRECISION field is the number of subparts of | |
| 180 the vector. */ | |
| 181 DEFTREECODE (VECTOR_TYPE, "vector_type", tcc_type, 0) | |
| 182 | |
| 183 /* The ordering of the following codes is optimized for the checking | |
| 184 macros in tree.h. Changing the order will degrade the speed of the | |
| 185 compiler. ARRAY_TYPE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE. | |
| 186 Note that this range overlaps the previous range. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
187 |
| 0 | 188 /* Types of arrays. Special fields: |
| 189 TREE_TYPE Type of an array element. | |
| 190 TYPE_DOMAIN Type to index by. | |
| 191 Its range of values specifies the array length. | |
| 192 The field TYPE_POINTER_TO (TREE_TYPE (array_type)) is always nonzero | |
| 193 and holds the type to coerce a value of that array type to in C. | |
| 194 TYPE_STRING_FLAG indicates a string (in contrast to an array of chars) | |
| 195 in languages (such as Chill) that make a distinction. */ | |
| 131 | 196 /* Array types in C */ |
| 0 | 197 DEFTREECODE (ARRAY_TYPE, "array_type", tcc_type, 0) |
| 198 | |
| 131 | 199 /* Struct in C. */ |
| 0 | 200 /* Special fields: |
| 201 TYPE_FIELDS chain of FIELD_DECLs for the fields of the struct, | |
| 111 | 202 VAR_DECLs, TYPE_DECLs and CONST_DECLs for record-scope variables, |
| 203 types and enumerators and FUNCTION_DECLs for methods associated | |
| 131 | 204 with the type. */ |
| 0 | 205 /* See the comment above, before ENUMERAL_TYPE, for how |
| 206 forward references to struct tags are handled in C. */ | |
| 207 DEFTREECODE (RECORD_TYPE, "record_type", tcc_type, 0) | |
| 208 | |
| 209 /* Union in C. Like a struct, except that the offsets of the fields | |
| 210 will all be zero. */ | |
| 211 /* See the comment above, before ENUMERAL_TYPE, for how | |
| 212 forward references to union tags are handled in C. */ | |
| 213 DEFTREECODE (UNION_TYPE, "union_type", tcc_type, 0) /* C union type */ | |
| 214 | |
| 215 /* Similar to UNION_TYPE, except that the expressions in DECL_QUALIFIER | |
| 216 in each FIELD_DECL determine what the union contains. The first | |
| 217 field whose DECL_QUALIFIER expression is true is deemed to occupy | |
| 218 the union. */ | |
| 219 DEFTREECODE (QUAL_UNION_TYPE, "qual_union_type", tcc_type, 0) | |
| 220 | |
| 221 /* The ordering of the following codes is optimized for the checking | |
| 222 macros in tree.h. Changing the order will degrade the speed of the | |
| 223 compiler. VOID_TYPE, FUNCTION_TYPE, METHOD_TYPE. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
224 |
| 0 | 225 /* The void type in C */ |
| 226 DEFTREECODE (VOID_TYPE, "void_type", tcc_type, 0) | |
| 227 | |
| 228 /* Type of functions. Special fields: | |
| 229 TREE_TYPE type of value returned. | |
| 230 TYPE_ARG_TYPES list of types of arguments expected. | |
| 231 this list is made of TREE_LIST nodes. | |
| 111 | 232 In this list TREE_PURPOSE can be used to indicate the default |
| 233 value of parameter (used by C++ frontend). | |
| 0 | 234 Types of "Procedures" in languages where they are different from functions |
| 235 have code FUNCTION_TYPE also, but then TREE_TYPE is zero or void type. */ | |
| 236 DEFTREECODE (FUNCTION_TYPE, "function_type", tcc_type, 0) | |
| 237 | |
| 238 /* METHOD_TYPE is the type of a function which takes an extra first | |
| 239 argument for "self", which is not present in the declared argument list. | |
| 240 The TREE_TYPE is the return type of the method. The TYPE_METHOD_BASETYPE | |
| 241 is the type of "self". TYPE_ARG_TYPES is the real argument list, which | |
| 242 includes the hidden argument for "self". */ | |
| 243 DEFTREECODE (METHOD_TYPE, "method_type", tcc_type, 0) | |
| 244 | |
| 245 /* This is a language-specific kind of type. | |
| 246 Its meaning is defined by the language front end. | |
| 247 layout_type does not know how to lay this out, | |
| 248 so the front-end must do so manually. */ | |
| 249 DEFTREECODE (LANG_TYPE, "lang_type", tcc_type, 0) | |
| 250 | |
| 251 /* Expressions */ | |
| 252 | |
| 253 /* First, the constants. */ | |
| 254 | |
| 111 | 255 DEFTREECODE (VOID_CST, "void_cst", tcc_constant, 0) |
| 256 | |
| 257 /* Contents are in an array of HOST_WIDE_INTs. | |
| 258 | |
| 259 We often access these constants both in their native precision and | |
| 260 in wider precisions (with the constant being implicitly extended | |
| 261 according to TYPE_SIGN). In each case, the useful part of the array | |
| 262 may be as wide as the precision requires but may be shorter when all | |
| 263 of the upper bits are sign bits. The length of the array when accessed | |
| 264 in the constant's native precision is given by TREE_INT_CST_NUNITS. | |
| 265 The length of the array when accessed in wider precisions is given | |
| 266 by TREE_INT_CST_EXT_NUNITS. Each element can be obtained using | |
| 267 TREE_INT_CST_ELT. | |
| 268 | |
| 269 INTEGER_CST nodes can be shared, and therefore should be considered | |
| 270 read only. They should be copied before setting a flag such as | |
| 271 TREE_OVERFLOW. If an INTEGER_CST has TREE_OVERFLOW already set, | |
| 272 it is known to be unique. INTEGER_CST nodes are created for the | |
| 273 integral types, for pointer types and for vector and float types in | |
| 274 some circumstances. */ | |
| 0 | 275 DEFTREECODE (INTEGER_CST, "integer_cst", tcc_constant, 0) |
| 276 | |
| 131 | 277 /* Contents are given by POLY_INT_CST_COEFF. */ |
| 278 DEFTREECODE (POLY_INT_CST, "poly_int_cst", tcc_constant, 0) | |
| 279 | |
| 0 | 280 /* Contents are in TREE_REAL_CST field. */ |
| 281 DEFTREECODE (REAL_CST, "real_cst", tcc_constant, 0) | |
| 282 | |
| 283 /* Contents are in TREE_FIXED_CST field. */ | |
| 284 DEFTREECODE (FIXED_CST, "fixed_cst", tcc_constant, 0) | |
| 285 | |
| 286 /* Contents are in TREE_REALPART and TREE_IMAGPART fields, | |
| 287 whose contents are other constant nodes. */ | |
| 288 DEFTREECODE (COMPLEX_CST, "complex_cst", tcc_constant, 0) | |
| 289 | |
| 131 | 290 /* See generic.texi for details. */ |
| 0 | 291 DEFTREECODE (VECTOR_CST, "vector_cst", tcc_constant, 0) |
| 292 | |
| 293 /* Contents are TREE_STRING_LENGTH and the actual contents of the string. */ | |
| 294 DEFTREECODE (STRING_CST, "string_cst", tcc_constant, 0) | |
| 295 | |
| 296 /* Declarations. All references to names are represented as ..._DECL | |
| 297 nodes. The decls in one binding context are chained through the | |
| 298 TREE_CHAIN field. Each DECL has a DECL_NAME field which contains | |
| 299 an IDENTIFIER_NODE. (Some decls, most often labels, may have zero | |
| 300 as the DECL_NAME). DECL_CONTEXT points to the node representing | |
| 301 the context in which this declaration has its scope. For | |
| 302 FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or | |
| 303 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, | |
| 304 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this | |
| 305 points to either the FUNCTION_DECL for the containing function, the | |
| 306 RECORD_TYPE or UNION_TYPE for the containing type, or NULL_TREE or | |
| 307 a TRANSLATION_UNIT_DECL if the given decl has "file scope". | |
| 308 DECL_ABSTRACT_ORIGIN, if non-NULL, points to the original (abstract) | |
| 309 ..._DECL node of which this decl is an (inlined or template expanded) | |
| 310 instance. | |
| 311 The TREE_TYPE field holds the data type of the object, when relevant. | |
| 312 LABEL_DECLs have no data type. For TYPE_DECL, the TREE_TYPE field | |
| 313 contents are the type whose name is being declared. | |
| 314 The DECL_ALIGN, DECL_SIZE, | |
| 315 and DECL_MODE fields exist in decl nodes just as in type nodes. | |
| 316 They are unused in LABEL_DECL, TYPE_DECL and CONST_DECL nodes. | |
| 317 | |
| 318 DECL_FIELD_BIT_OFFSET holds an integer number of bits offset for | |
| 319 the location. DECL_VOFFSET holds an expression for a variable | |
| 320 offset; it is to be multiplied by DECL_VOFFSET_UNIT (an integer). | |
| 321 These fields are relevant only in FIELD_DECLs and PARM_DECLs. | |
| 322 | |
| 323 DECL_INITIAL holds the value to initialize a variable to, | |
| 324 or the value of a constant. For a function, it holds the body | |
| 325 (a node of type BLOCK representing the function's binding contour | |
| 326 and whose body contains the function's statements.) For a LABEL_DECL | |
| 327 in C, it is a flag, nonzero if the label's definition has been seen. | |
| 328 | |
| 329 PARM_DECLs use a special field: | |
| 330 DECL_ARG_TYPE is the type in which the argument is actually | |
| 331 passed, which may be different from its type within the function. | |
| 332 | |
| 333 FUNCTION_DECLs use four special fields: | |
| 334 DECL_ARGUMENTS holds a chain of PARM_DECL nodes for the arguments. | |
| 335 DECL_RESULT holds a RESULT_DECL node for the value of a function. | |
| 336 The DECL_RTL field is 0 for a function that returns no value. | |
| 337 (C functions returning void have zero here.) | |
| 338 The TREE_TYPE field is the type in which the result is actually | |
| 339 returned. This is usually the same as the return type of the | |
| 340 FUNCTION_DECL, but it may be a wider integer type because of | |
| 341 promotion. | |
| 342 DECL_FUNCTION_CODE is a code number that is nonzero for | |
| 343 built-in functions. Its value is an enum built_in_function | |
| 344 that says which built-in function it is. | |
| 345 | |
| 346 DECL_SOURCE_FILE holds a filename string and DECL_SOURCE_LINE | |
| 347 holds a line number. In some cases these can be the location of | |
| 348 a reference, if no definition has been seen. | |
| 349 | |
| 350 DECL_ABSTRACT is nonzero if the decl represents an abstract instance | |
| 351 of a decl (i.e. one which is nested within an abstract instance of a | |
| 352 inline function. */ | |
| 353 | |
| 354 DEFTREECODE (FUNCTION_DECL, "function_decl", tcc_declaration, 0) | |
| 355 DEFTREECODE (LABEL_DECL, "label_decl", tcc_declaration, 0) | |
| 356 /* The ordering of the following codes is optimized for the checking | |
| 357 macros in tree.h. Changing the order will degrade the speed of the | |
| 358 compiler. FIELD_DECL, VAR_DECL, CONST_DECL, PARM_DECL, | |
| 359 TYPE_DECL. */ | |
| 360 DEFTREECODE (FIELD_DECL, "field_decl", tcc_declaration, 0) | |
| 361 DEFTREECODE (VAR_DECL, "var_decl", tcc_declaration, 0) | |
| 362 DEFTREECODE (CONST_DECL, "const_decl", tcc_declaration, 0) | |
| 363 DEFTREECODE (PARM_DECL, "parm_decl", tcc_declaration, 0) | |
| 364 DEFTREECODE (TYPE_DECL, "type_decl", tcc_declaration, 0) | |
| 365 DEFTREECODE (RESULT_DECL, "result_decl", tcc_declaration, 0) | |
| 366 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
367 /* A "declaration" of a debug temporary. It should only appear in |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
368 DEBUG stmts. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
369 DEFTREECODE (DEBUG_EXPR_DECL, "debug_expr_decl", tcc_declaration, 0) |
| 0 | 370 |
| 131 | 371 /* A stmt that marks the beginning of a source statement. */ |
| 372 DEFTREECODE (DEBUG_BEGIN_STMT, "debug_begin_stmt", tcc_statement, 0) | |
| 373 | |
| 0 | 374 /* A namespace declaration. Namespaces appear in DECL_CONTEXT of other |
| 375 _DECLs, providing a hierarchy of names. */ | |
| 376 DEFTREECODE (NAMESPACE_DECL, "namespace_decl", tcc_declaration, 0) | |
| 377 | |
| 378 /* A declaration import. | |
| 379 The C++ FE uses this to represent a using-directive; eg: | |
| 380 "using namespace foo". | |
| 381 But it could be used to represent any declaration import construct. | |
| 382 Whenever a declaration import appears in a lexical block, the BLOCK node | |
| 383 representing that lexical block in GIMPLE will contain an IMPORTED_DECL | |
| 384 node, linked via BLOCK_VARS accessor of the said BLOCK. | |
| 385 For a given NODE which code is IMPORTED_DECL, | |
| 386 IMPORTED_DECL_ASSOCIATED_DECL (NODE) accesses the imported declaration. */ | |
| 387 DEFTREECODE (IMPORTED_DECL, "imported_decl", tcc_declaration, 0) | |
| 388 | |
| 111 | 389 /* A namelist declaration. |
| 390 The Fortran FE uses this to represent a namelist statement, e.g.: | |
| 391 NAMELIST /namelist-group-name/ namelist-group-object-list. | |
| 392 Whenever a declaration import appears in a lexical block, the BLOCK node | |
| 393 representing that lexical block in GIMPLE will contain an NAMELIST_DECL | |
| 394 node, linked via BLOCK_VARS accessor of the said BLOCK. | |
| 395 For a given NODE which code is NAMELIST_DECL, | |
| 396 NAMELIST_DECL_ASSOCIATED_DECL (NODE) accesses the imported declaration. */ | |
| 397 DEFTREECODE (NAMELIST_DECL, "namelist_decl", tcc_declaration, 0) | |
| 398 | |
| 0 | 399 /* A translation unit. This is not technically a declaration, since it |
| 400 can't be looked up, but it's close enough. */ | |
| 401 DEFTREECODE (TRANSLATION_UNIT_DECL, "translation_unit_decl",\ | |
| 402 tcc_declaration, 0) | |
| 403 | |
| 404 /* References to storage. */ | |
| 405 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
406 /* The ordering of the following codes is optimized for the classification |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
407 in handled_component_p. Keep them in a consecutive group. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
408 |
| 0 | 409 /* Value is structure or union component. |
| 410 Operand 0 is the structure or union (an expression). | |
| 411 Operand 1 is the field (a node of type FIELD_DECL). | |
| 412 Operand 2, if present, is the value of DECL_FIELD_OFFSET, measured | |
| 413 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. */ | |
| 414 DEFTREECODE (COMPONENT_REF, "component_ref", tcc_reference, 3) | |
| 415 | |
| 416 /* Reference to a group of bits within an object. Similar to COMPONENT_REF | |
| 417 except the position is given explicitly rather than via a FIELD_DECL. | |
| 418 Operand 0 is the structure or union expression; | |
| 419 operand 1 is a tree giving the constant number of bits being referenced; | |
| 420 operand 2 is a tree giving the constant position of the first referenced bit. | |
| 421 The result type width has to match the number of bits referenced. | |
| 422 If the result type is integral, its signedness specifies how it is extended | |
| 423 to its mode width. */ | |
| 424 DEFTREECODE (BIT_FIELD_REF, "bit_field_ref", tcc_reference, 3) | |
| 425 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
426 /* Array indexing. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
427 Operand 0 is the array; operand 1 is a (single) array index. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
428 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index. |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
429 Operand 3, if present, is the element size, measured in units of |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
430 the alignment of the element type. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
431 DEFTREECODE (ARRAY_REF, "array_ref", tcc_reference, 4) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
432 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
433 /* Likewise, except that the result is a range ("slice") of the array. The |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
434 starting index of the resulting array is taken from operand 1 and the size |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
435 of the range is taken from the type of the expression. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
436 DEFTREECODE (ARRAY_RANGE_REF, "array_range_ref", tcc_reference, 4) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
437 |
| 111 | 438 /* Used only on an operand of complex type, these return |
| 439 a value of the corresponding component type. */ | |
| 440 DEFTREECODE (REALPART_EXPR, "realpart_expr", tcc_reference, 1) | |
| 441 DEFTREECODE (IMAGPART_EXPR, "imagpart_expr", tcc_reference, 1) | |
| 442 | |
| 443 /* Represents viewing something of one type as being of a second type. | |
| 444 This corresponds to an "Unchecked Conversion" in Ada and roughly to | |
| 445 the idiom *(type2 *)&X in C. The only operand is the value to be | |
| 446 viewed as being of another type. It is undefined if the type of the | |
| 447 input and of the expression have different sizes. | |
| 448 | |
| 449 This code may also be used within the LHS of a MODIFY_EXPR, in which | |
| 450 case no actual data motion may occur. TREE_ADDRESSABLE will be set in | |
| 451 this case and GCC must abort if it could not do the operation without | |
| 452 generating insns. */ | |
| 453 DEFTREECODE (VIEW_CONVERT_EXPR, "view_convert_expr", tcc_reference, 1) | |
| 454 | |
| 131 | 455 /* C unary `*'. One operand, an expression for a pointer. */ |
| 0 | 456 DEFTREECODE (INDIRECT_REF, "indirect_ref", tcc_reference, 1) |
| 457 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
458 /* Used to represent lookup in a virtual method table which is dependent on |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
459 the runtime type of an object. Operands are: |
| 0 | 460 OBJ_TYPE_REF_EXPR: An expression that evaluates the value to use. |
| 461 OBJ_TYPE_REF_OBJECT: Is the object on whose behalf the lookup is | |
| 462 being performed. Through this the optimizers may be able to statically | |
| 463 determine the dynamic type of the object. | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
464 OBJ_TYPE_REF_TOKEN: An integer index to the virtual method table. */ |
| 0 | 465 DEFTREECODE (OBJ_TYPE_REF, "obj_type_ref", tcc_expression, 3) |
| 466 | |
| 111 | 467 /* Used to represent the brace-enclosed initializers for a structure or an |
| 468 array. It contains a sequence of component values made out of a VEC of | |
| 469 constructor_elt. | |
| 470 | |
| 471 For RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE: | |
| 472 The field INDEX of each constructor_elt is a FIELD_DECL. | |
| 0 | 473 |
| 474 For ARRAY_TYPE: | |
| 475 The field INDEX of each constructor_elt is the corresponding index. | |
| 476 If the index is a RANGE_EXPR, it is a short-hand for many nodes, | |
| 477 one for each index in the range. (If the corresponding field VALUE | |
| 478 has side-effects, they are evaluated once for each element. Wrap the | |
| 479 value in a SAVE_EXPR if you want to evaluate side effects only once.) | |
| 480 | |
| 111 | 481 Components that aren't present are cleared as per the C semantics, |
| 482 unless the CONSTRUCTOR_NO_CLEARING flag is set, in which case their | |
| 483 value becomes undefined. */ | |
| 0 | 484 DEFTREECODE (CONSTRUCTOR, "constructor", tcc_exceptional, 0) |
| 485 | |
| 486 /* The expression types are mostly straightforward, with the fourth argument | |
| 487 of DEFTREECODE saying how many operands there are. | |
| 488 Unless otherwise specified, the operands are expressions and the | |
| 489 types of all the operands and the expression must all be the same. */ | |
| 490 | |
| 491 /* Contains two expressions to compute, one followed by the other. | |
| 492 the first value is ignored. The second one's value is used. The | |
| 493 type of the first expression need not agree with the other types. */ | |
| 494 DEFTREECODE (COMPOUND_EXPR, "compound_expr", tcc_expression, 2) | |
| 495 | |
| 496 /* Assignment expression. Operand 0 is the what to set; 1, the new value. */ | |
| 497 DEFTREECODE (MODIFY_EXPR, "modify_expr", tcc_expression, 2) | |
| 498 | |
| 499 /* Initialization expression. Operand 0 is the variable to initialize; | |
| 500 Operand 1 is the initializer. This differs from MODIFY_EXPR in that any | |
| 501 reference to the referent of operand 0 within operand 1 is undefined. */ | |
| 502 DEFTREECODE (INIT_EXPR, "init_expr", tcc_expression, 2) | |
| 503 | |
| 504 /* For TARGET_EXPR, operand 0 is the target of an initialization, | |
| 505 operand 1 is the initializer for the target, which may be void | |
| 506 if simply expanding it initializes the target. | |
| 507 operand 2 is the cleanup for this node, if any. | |
| 508 operand 3 is the saved initializer after this node has been | |
| 509 expanded once; this is so we can re-expand the tree later. */ | |
| 510 DEFTREECODE (TARGET_EXPR, "target_expr", tcc_expression, 4) | |
| 511 | |
| 512 /* Conditional expression ( ... ? ... : ... in C). | |
| 513 Operand 0 is the condition. | |
| 514 Operand 1 is the then-value. | |
| 515 Operand 2 is the else-value. | |
| 516 Operand 0 may be of any type. | |
| 517 Operand 1 must have the same type as the entire expression, unless | |
| 518 it unconditionally throws an exception, in which case it should | |
| 519 have VOID_TYPE. The same constraints apply to operand 2. The | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
520 condition in operand 0 must be of integral type. |
| 0 | 521 |
| 522 In cfg gimple, if you do not have a selection expression, operands | |
| 523 1 and 2 are NULL. The operands are then taken from the cfg edges. */ | |
| 524 DEFTREECODE (COND_EXPR, "cond_expr", tcc_expression, 3) | |
| 525 | |
| 131 | 526 /* Represents a vector in which every element is equal to operand 0. */ |
| 527 DEFTREECODE (VEC_DUPLICATE_EXPR, "vec_duplicate_expr", tcc_unary, 1) | |
| 528 | |
| 529 /* Vector series created from a start (base) value and a step. | |
| 530 | |
| 531 A = VEC_SERIES_EXPR (B, C) | |
| 532 | |
| 533 means | |
| 534 | |
| 535 for (i = 0; i < N; i++) | |
| 536 A[i] = B + C * i; */ | |
| 537 DEFTREECODE (VEC_SERIES_EXPR, "vec_series_expr", tcc_binary, 2) | |
| 538 | |
| 0 | 539 /* Vector conditional expression. It is like COND_EXPR, but with |
| 540 vector operands. | |
| 541 | |
| 542 A = VEC_COND_EXPR ( X < Y, B, C) | |
| 543 | |
| 544 means | |
| 545 | |
| 546 for (i=0; i<N; i++) | |
| 547 A[i] = X[i] < Y[i] ? B[i] : C[i]; | |
| 548 */ | |
| 549 DEFTREECODE (VEC_COND_EXPR, "vec_cond_expr", tcc_expression, 3) | |
| 550 | |
| 111 | 551 /* Vector permutation expression. A = VEC_PERM_EXPR<v0, v1, mask> means |
| 552 | |
| 553 N = length(mask) | |
| 554 foreach i in N: | |
| 555 M = mask[i] % (2*N) | |
| 556 A = M < N ? v0[M] : v1[M-N] | |
| 557 | |
| 558 V0 and V1 are vectors of the same type. MASK is an integer-typed | |
| 559 vector. The number of MASK elements must be the same with the | |
| 560 number of elements in V0 and V1. The size of the inner type | |
| 561 of the MASK and of the V0 and V1 must be the same. | |
| 562 */ | |
| 563 DEFTREECODE (VEC_PERM_EXPR, "vec_perm_expr", tcc_expression, 3) | |
| 564 | |
| 0 | 565 /* Declare local variables, including making RTL and allocating space. |
| 566 BIND_EXPR_VARS is a chain of VAR_DECL nodes for the variables. | |
| 567 BIND_EXPR_BODY is the body, the expression to be computed using | |
| 568 the variables. The value of operand 1 becomes that of the BIND_EXPR. | |
| 569 BIND_EXPR_BLOCK is the BLOCK that corresponds to these bindings | |
| 570 for debugging purposes. If this BIND_EXPR is actually expanded, | |
| 571 that sets the TREE_USED flag in the BLOCK. | |
| 572 | |
| 573 The BIND_EXPR is not responsible for informing parsers | |
| 574 about these variables. If the body is coming from the input file, | |
| 575 then the code that creates the BIND_EXPR is also responsible for | |
| 576 informing the parser of the variables. | |
| 577 | |
| 578 If the BIND_EXPR is ever expanded, its TREE_USED flag is set. | |
| 579 This tells the code for debugging symbol tables not to ignore the BIND_EXPR. | |
| 580 If the BIND_EXPR should be output for debugging but will not be expanded, | |
| 581 set the TREE_USED flag by hand. | |
| 582 | |
| 583 In order for the BIND_EXPR to be known at all, the code that creates it | |
| 584 must also install it as a subblock in the tree of BLOCK | |
| 585 nodes for the function. */ | |
| 586 DEFTREECODE (BIND_EXPR, "bind_expr", tcc_expression, 3) | |
| 587 | |
| 588 /* Function call. CALL_EXPRs are represented by variably-sized expression | |
| 589 nodes. There are at least three fixed operands. Operand 0 is an | |
| 590 INTEGER_CST node containing the total operand count, the number of | |
| 111 | 591 arguments plus 3. Operand 1 is the function or NULL, while operand 2 is |
| 0 | 592 is static chain argument, or NULL. The remaining operands are the |
| 593 arguments to the call. */ | |
| 594 DEFTREECODE (CALL_EXPR, "call_expr", tcc_vl_exp, 3) | |
| 595 | |
| 596 /* Specify a value to compute along with its corresponding cleanup. | |
| 597 Operand 0 is the cleanup expression. | |
| 598 The cleanup is executed by the first enclosing CLEANUP_POINT_EXPR, | |
| 599 which must exist. This differs from TRY_CATCH_EXPR in that operand 1 | |
| 600 is always evaluated when cleanups are run. */ | |
| 601 DEFTREECODE (WITH_CLEANUP_EXPR, "with_cleanup_expr", tcc_expression, 1) | |
| 602 | |
| 603 /* Specify a cleanup point. | |
| 604 Operand 0 is an expression that may have cleanups. If it does, those | |
| 605 cleanups are executed after the expression is expanded. | |
| 606 | |
| 607 Note that if the expression is a reference to storage, it is forced out | |
| 608 of memory before the cleanups are run. This is necessary to handle | |
| 609 cases where the cleanups modify the storage referenced; in the | |
| 610 expression 't.i', if 't' is a struct with an integer member 'i' and a | |
| 611 cleanup which modifies 'i', the value of the expression depends on | |
| 612 whether the cleanup is run before or after 't.i' is evaluated. When | |
| 613 expand_expr is run on 't.i', it returns a MEM. This is not good enough; | |
| 614 the value of 't.i' must be forced out of memory. | |
| 615 | |
| 616 As a consequence, the operand of a CLEANUP_POINT_EXPR must not have | |
| 617 BLKmode, because it will not be forced out of memory. */ | |
| 618 DEFTREECODE (CLEANUP_POINT_EXPR, "cleanup_point_expr", tcc_expression, 1) | |
| 619 | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
620 /* The following code is used in languages that have types where some |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
621 field in an object of the type contains a value that is used in the |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
622 computation of another field's offset or size and/or the size of the |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
623 type. The positions and/or sizes of fields can vary from object to |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
624 object of the same type or even for one and the same object within |
| 0 | 625 its scope. |
| 626 | |
| 131 | 627 Record types with discriminants in Ada are |
| 0 | 628 examples of such types. This mechanism is also used to create "fat |
| 629 pointers" for unconstrained array types in Ada; the fat pointer is a | |
| 630 structure one of whose fields is a pointer to the actual array type | |
| 631 and the other field is a pointer to a template, which is a structure | |
| 632 containing the bounds of the array. The bounds in the type pointed | |
| 633 to by the first field in the fat pointer refer to the values in the | |
| 634 template. | |
| 635 | |
| 636 When you wish to construct such a type you need "self-references" | |
| 637 that allow you to reference the object having this type from the | |
| 638 TYPE node, i.e. without having a variable instantiating this type. | |
| 639 | |
| 640 Such a "self-references" is done using a PLACEHOLDER_EXPR. This is | |
| 641 a node that will later be replaced with the object being referenced. | |
| 642 Its type is that of the object and selects which object to use from | |
| 643 a chain of references (see below). No other slots are used in the | |
| 644 PLACEHOLDER_EXPR. | |
| 645 | |
| 646 For example, if your type FOO is a RECORD_TYPE with a field BAR, | |
| 647 and you need the value of <variable>.BAR to calculate TYPE_SIZE | |
| 648 (FOO), just substitute <variable> above with a PLACEHOLDER_EXPR | |
| 649 whose TREE_TYPE is FOO. Then construct your COMPONENT_REF with | |
| 650 the PLACEHOLDER_EXPR as the first operand (which has the correct | |
| 651 type). Later, when the size is needed in the program, the back-end | |
| 652 will find this PLACEHOLDER_EXPR and generate code to calculate the | |
| 653 actual size at run-time. In the following, we describe how this | |
| 654 calculation is done. | |
| 655 | |
| 656 When we wish to evaluate a size or offset, we check whether it contains a | |
| 657 PLACEHOLDER_EXPR. If it does, we call substitute_placeholder_in_expr | |
| 658 passing both that tree and an expression within which the object may be | |
| 659 found. The latter expression is the object itself in the simple case of | |
| 660 an Ada record with discriminant, but it can be the array in the case of an | |
| 661 unconstrained array. | |
| 662 | |
| 663 In the latter case, we need the fat pointer, because the bounds of | |
| 664 the array can only be accessed from it. However, we rely here on the | |
| 665 fact that the expression for the array contains the dereference of | |
| 666 the fat pointer that obtained the array pointer. */ | |
| 667 | |
| 668 /* Denotes a record to later be substituted before evaluating this expression. | |
| 669 The type of this expression is used to find the record to replace it. */ | |
| 670 DEFTREECODE (PLACEHOLDER_EXPR, "placeholder_expr", tcc_exceptional, 0) | |
| 671 | |
| 672 /* Simple arithmetic. */ | |
| 673 DEFTREECODE (PLUS_EXPR, "plus_expr", tcc_binary, 2) | |
| 674 DEFTREECODE (MINUS_EXPR, "minus_expr", tcc_binary, 2) | |
| 675 DEFTREECODE (MULT_EXPR, "mult_expr", tcc_binary, 2) | |
| 676 | |
| 677 /* Pointer addition. The first operand is always a pointer and the | |
| 678 second operand is an integer of type sizetype. */ | |
| 679 DEFTREECODE (POINTER_PLUS_EXPR, "pointer_plus_expr", tcc_binary, 2) | |
| 680 | |
| 131 | 681 /* Pointer subtraction. The two arguments are pointers, and the result |
| 682 is a signed integer of the same precision. Pointers are interpreted | |
| 683 as unsigned, the difference is computed as if in infinite signed | |
| 684 precision. Behavior is undefined if the difference does not fit in | |
| 685 the result type. The result does not depend on the pointer type, | |
| 686 it is not divided by the size of the pointed-to type. */ | |
| 687 DEFTREECODE (POINTER_DIFF_EXPR, "pointer_diff_expr", tcc_binary, 2) | |
| 688 | |
| 111 | 689 /* Highpart multiplication. For an integral type with precision B, |
| 690 returns bits [2B-1, B] of the full 2*B product. */ | |
| 691 DEFTREECODE (MULT_HIGHPART_EXPR, "mult_highpart_expr", tcc_binary, 2) | |
| 692 | |
| 0 | 693 /* Division for integer result that rounds the quotient toward zero. */ |
| 694 DEFTREECODE (TRUNC_DIV_EXPR, "trunc_div_expr", tcc_binary, 2) | |
| 695 | |
| 111 | 696 /* Division for integer result that rounds it toward plus infinity. */ |
| 0 | 697 DEFTREECODE (CEIL_DIV_EXPR, "ceil_div_expr", tcc_binary, 2) |
| 698 | |
| 111 | 699 /* Division for integer result that rounds it toward minus infinity. */ |
| 0 | 700 DEFTREECODE (FLOOR_DIV_EXPR, "floor_div_expr", tcc_binary, 2) |
| 701 | |
| 111 | 702 /* Division for integer result that rounds it toward nearest integer. */ |
| 0 | 703 DEFTREECODE (ROUND_DIV_EXPR, "round_div_expr", tcc_binary, 2) |
| 704 | |
| 111 | 705 /* Four kinds of remainder that go with the four kinds of division: */ |
| 706 | |
| 707 /* The sign of the remainder is that of the dividend. */ | |
| 0 | 708 DEFTREECODE (TRUNC_MOD_EXPR, "trunc_mod_expr", tcc_binary, 2) |
| 111 | 709 |
| 710 /* The sign of the remainder is the opposite of that of the divisor. */ | |
| 0 | 711 DEFTREECODE (CEIL_MOD_EXPR, "ceil_mod_expr", tcc_binary, 2) |
| 111 | 712 |
| 713 /* The sign of the remainder is that of the divisor. */ | |
| 0 | 714 DEFTREECODE (FLOOR_MOD_EXPR, "floor_mod_expr", tcc_binary, 2) |
| 111 | 715 |
| 716 /* The sign of the remainder is not predictable. */ | |
| 0 | 717 DEFTREECODE (ROUND_MOD_EXPR, "round_mod_expr", tcc_binary, 2) |
| 718 | |
| 719 /* Division for real result. */ | |
| 720 DEFTREECODE (RDIV_EXPR, "rdiv_expr", tcc_binary, 2) | |
| 721 | |
| 722 /* Division which is not supposed to need rounding. | |
| 723 Used for pointer subtraction in C. */ | |
| 724 DEFTREECODE (EXACT_DIV_EXPR, "exact_div_expr", tcc_binary, 2) | |
| 725 | |
| 726 /* Conversion of real to fixed point by truncation. */ | |
| 727 DEFTREECODE (FIX_TRUNC_EXPR, "fix_trunc_expr", tcc_unary, 1) | |
| 728 | |
| 729 /* Conversion of an integer to a real. */ | |
| 730 DEFTREECODE (FLOAT_EXPR, "float_expr", tcc_unary, 1) | |
| 731 | |
| 732 /* Unary negation. */ | |
| 733 DEFTREECODE (NEGATE_EXPR, "negate_expr", tcc_unary, 1) | |
| 734 | |
| 735 /* Minimum and maximum values. When used with floating point, if both | |
| 736 operands are zeros, or if either operand is NaN, then it is unspecified | |
| 737 which of the two operands is returned as the result. */ | |
| 738 DEFTREECODE (MIN_EXPR, "min_expr", tcc_binary, 2) | |
| 739 DEFTREECODE (MAX_EXPR, "max_expr", tcc_binary, 2) | |
| 740 | |
| 741 /* Represents the absolute value of the operand. | |
| 742 | |
| 743 An ABS_EXPR must have either an INTEGER_TYPE or a REAL_TYPE. The | |
| 744 operand of the ABS_EXPR must have the same type. */ | |
| 745 DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1) | |
| 746 | |
| 131 | 747 /* Represents the unsigned absolute value of the operand. |
| 748 An ABSU_EXPR must have unsigned INTEGER_TYPE. The operand of the ABSU_EXPR | |
| 749 must have the corresponding signed type. */ | |
| 750 DEFTREECODE (ABSU_EXPR, "absu_expr", tcc_unary, 1) | |
| 751 | |
| 0 | 752 /* Shift operations for shift and rotate. |
| 753 Shift means logical shift if done on an | |
| 754 unsigned type, arithmetic shift if done on a signed type. | |
| 755 The second operand is the number of bits to | |
| 756 shift by; it need not be the same type as the first operand and result. | |
| 757 Note that the result is undefined if the second operand is larger | |
| 758 than or equal to the first operand's type size. | |
| 759 | |
| 760 The first operand of a shift can have either an integer or a | |
| 761 (non-integer) fixed-point type. We follow the ISO/IEC TR 18037:2004 | |
| 762 semantics for the latter. | |
| 763 | |
| 764 Rotates are defined for integer types only. */ | |
| 765 DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2) | |
| 766 DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2) | |
| 767 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2) | |
| 768 DEFTREECODE (RROTATE_EXPR, "rrotate_expr", tcc_binary, 2) | |
| 769 | |
| 770 /* Bitwise operations. Operands have same mode as result. */ | |
| 771 DEFTREECODE (BIT_IOR_EXPR, "bit_ior_expr", tcc_binary, 2) | |
| 772 DEFTREECODE (BIT_XOR_EXPR, "bit_xor_expr", tcc_binary, 2) | |
| 773 DEFTREECODE (BIT_AND_EXPR, "bit_and_expr", tcc_binary, 2) | |
| 774 DEFTREECODE (BIT_NOT_EXPR, "bit_not_expr", tcc_unary, 1) | |
| 775 | |
| 776 /* ANDIF and ORIF allow the second operand not to be computed if the | |
| 777 value of the expression is determined from the first operand. AND, | |
| 778 OR, and XOR always compute the second operand whether its value is | |
| 779 needed or not (for side effects). The operand may have | |
| 780 BOOLEAN_TYPE or INTEGER_TYPE. In either case, the argument will be | |
| 781 either zero or one. For example, a TRUTH_NOT_EXPR will never have | |
| 782 an INTEGER_TYPE VAR_DECL as its argument; instead, a NE_EXPR will be | |
| 783 used to compare the VAR_DECL to zero, thereby obtaining a node with | |
| 784 value zero or one. */ | |
| 785 DEFTREECODE (TRUTH_ANDIF_EXPR, "truth_andif_expr", tcc_expression, 2) | |
| 786 DEFTREECODE (TRUTH_ORIF_EXPR, "truth_orif_expr", tcc_expression, 2) | |
| 787 DEFTREECODE (TRUTH_AND_EXPR, "truth_and_expr", tcc_expression, 2) | |
| 788 DEFTREECODE (TRUTH_OR_EXPR, "truth_or_expr", tcc_expression, 2) | |
| 789 DEFTREECODE (TRUTH_XOR_EXPR, "truth_xor_expr", tcc_expression, 2) | |
| 790 DEFTREECODE (TRUTH_NOT_EXPR, "truth_not_expr", tcc_expression, 1) | |
| 791 | |
| 792 /* Relational operators. | |
| 793 `EQ_EXPR' and `NE_EXPR' are allowed for any types. | |
| 794 The others are allowed only for integer (or pointer or enumeral) | |
| 795 or real types. | |
| 796 In all cases the operands will have the same type, | |
| 111 | 797 and the value is either the type used by the language for booleans |
| 798 or an integer vector type of the same size and with the same number | |
| 799 of elements as the comparison operands. True for a vector of | |
| 800 comparison results has all bits set while false is equal to zero. */ | |
| 0 | 801 DEFTREECODE (LT_EXPR, "lt_expr", tcc_comparison, 2) |
| 802 DEFTREECODE (LE_EXPR, "le_expr", tcc_comparison, 2) | |
| 803 DEFTREECODE (GT_EXPR, "gt_expr", tcc_comparison, 2) | |
| 804 DEFTREECODE (GE_EXPR, "ge_expr", tcc_comparison, 2) | |
| 805 DEFTREECODE (EQ_EXPR, "eq_expr", tcc_comparison, 2) | |
| 806 DEFTREECODE (NE_EXPR, "ne_expr", tcc_comparison, 2) | |
| 807 | |
| 808 /* Additional relational operators for floating point unordered. */ | |
| 809 DEFTREECODE (UNORDERED_EXPR, "unordered_expr", tcc_comparison, 2) | |
| 810 DEFTREECODE (ORDERED_EXPR, "ordered_expr", tcc_comparison, 2) | |
| 811 | |
| 812 /* These are equivalent to unordered or ... */ | |
| 813 DEFTREECODE (UNLT_EXPR, "unlt_expr", tcc_comparison, 2) | |
| 814 DEFTREECODE (UNLE_EXPR, "unle_expr", tcc_comparison, 2) | |
| 815 DEFTREECODE (UNGT_EXPR, "ungt_expr", tcc_comparison, 2) | |
| 816 DEFTREECODE (UNGE_EXPR, "unge_expr", tcc_comparison, 2) | |
| 817 DEFTREECODE (UNEQ_EXPR, "uneq_expr", tcc_comparison, 2) | |
| 818 | |
| 819 /* This is the reverse of uneq_expr. */ | |
| 820 DEFTREECODE (LTGT_EXPR, "ltgt_expr", tcc_comparison, 2) | |
| 821 | |
| 822 DEFTREECODE (RANGE_EXPR, "range_expr", tcc_binary, 2) | |
| 823 | |
| 824 /* Represents a re-association barrier for floating point expressions | |
| 825 like explicit parenthesis in fortran. */ | |
| 826 DEFTREECODE (PAREN_EXPR, "paren_expr", tcc_unary, 1) | |
| 827 | |
| 828 /* Represents a conversion of type of a value. | |
| 829 All conversions, including implicit ones, must be | |
| 830 represented by CONVERT_EXPR or NOP_EXPR nodes. */ | |
| 831 DEFTREECODE (CONVERT_EXPR, "convert_expr", tcc_unary, 1) | |
| 832 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
833 /* Conversion of a pointer value to a pointer to a different |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
834 address space. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
835 DEFTREECODE (ADDR_SPACE_CONVERT_EXPR, "addr_space_convert_expr", tcc_unary, 1) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
836 |
| 0 | 837 /* Conversion of a fixed-point value to an integer, a real, or a fixed-point |
| 838 value. Or conversion of a fixed-point value from an integer, a real, or | |
| 839 a fixed-point value. */ | |
| 840 DEFTREECODE (FIXED_CONVERT_EXPR, "fixed_convert_expr", tcc_unary, 1) | |
| 841 | |
| 842 /* Represents a conversion expected to require no code to be generated. */ | |
| 843 DEFTREECODE (NOP_EXPR, "nop_expr", tcc_unary, 1) | |
| 844 | |
| 845 /* Value is same as argument, but guaranteed not an lvalue. */ | |
| 846 DEFTREECODE (NON_LVALUE_EXPR, "non_lvalue_expr", tcc_unary, 1) | |
| 847 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
848 /* A COMPOUND_LITERAL_EXPR represents a literal that is placed in a DECL. The |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
849 COMPOUND_LITERAL_EXPR_DECL_EXPR is the a DECL_EXPR containing the decl |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
850 for the anonymous object represented by the COMPOUND_LITERAL; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
851 the DECL_INITIAL of that decl is the CONSTRUCTOR that initializes |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
852 the compound literal. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
853 DEFTREECODE (COMPOUND_LITERAL_EXPR, "compound_literal_expr", tcc_expression, 1) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
854 |
| 0 | 855 /* Represents something we computed once and will use multiple times. |
| 856 First operand is that expression. After it is evaluated once, it | |
| 857 will be replaced by the temporary variable that holds the value. */ | |
| 858 DEFTREECODE (SAVE_EXPR, "save_expr", tcc_expression, 1) | |
| 859 | |
| 860 /* & in C. Value is the address at which the operand's value resides. | |
| 861 Operand may have any mode. Result mode is Pmode. */ | |
| 862 DEFTREECODE (ADDR_EXPR, "addr_expr", tcc_expression, 1) | |
| 863 | |
| 864 /* Operand0 is a function constant; result is part N of a function | |
| 865 descriptor of type ptr_mode. */ | |
| 866 DEFTREECODE (FDESC_EXPR, "fdesc_expr", tcc_expression, 2) | |
| 867 | |
| 111 | 868 /* Given a container value, a replacement value and a bit position within |
| 869 the container, produce the value that results from replacing the part of | |
| 870 the container starting at the bit position with the replacement value. | |
| 871 Operand 0 is a tree for the container value of integral or vector type; | |
| 872 Operand 1 is a tree for the replacement value of another integral or | |
| 873 the vector element type; | |
| 874 Operand 2 is a tree giving the constant bit position; | |
| 875 The number of bits replaced is given by the precision of the type of the | |
| 876 replacement value if it is integral or by its size if it is non-integral. | |
| 877 ??? The reason to make the size of the replacement implicit is to avoid | |
| 878 introducing a quaternary operation. | |
| 879 The replaced bits shall be fully inside the container. If the container | |
| 880 is of vector type, then these bits shall be aligned with its elements. */ | |
| 881 DEFTREECODE (BIT_INSERT_EXPR, "bit_insert_expr", tcc_expression, 3) | |
| 882 | |
| 0 | 883 /* Given two real or integer operands of the same type, |
| 884 returns a complex value of the corresponding complex type. */ | |
| 885 DEFTREECODE (COMPLEX_EXPR, "complex_expr", tcc_binary, 2) | |
| 886 | |
| 887 /* Complex conjugate of operand. Used only on complex types. */ | |
| 888 DEFTREECODE (CONJ_EXPR, "conj_expr", tcc_unary, 1) | |
| 889 | |
| 890 /* Nodes for ++ and -- in C. | |
| 891 The second arg is how much to increment or decrement by. | |
| 892 For a pointer, it would be the size of the object pointed to. */ | |
| 893 DEFTREECODE (PREDECREMENT_EXPR, "predecrement_expr", tcc_expression, 2) | |
| 894 DEFTREECODE (PREINCREMENT_EXPR, "preincrement_expr", tcc_expression, 2) | |
| 895 DEFTREECODE (POSTDECREMENT_EXPR, "postdecrement_expr", tcc_expression, 2) | |
| 896 DEFTREECODE (POSTINCREMENT_EXPR, "postincrement_expr", tcc_expression, 2) | |
| 897 | |
| 898 /* Used to implement `va_arg'. */ | |
| 899 DEFTREECODE (VA_ARG_EXPR, "va_arg_expr", tcc_expression, 1) | |
| 900 | |
| 111 | 901 /* Evaluate operand 0. If and only if an exception is thrown during |
| 902 the evaluation of operand 0, evaluate operand 1. | |
| 0 | 903 |
| 111 | 904 This differs from TRY_FINALLY_EXPR in that operand 1 is not evaluated |
| 0 | 905 on a normal or jump exit, only on an exception. */ |
| 906 DEFTREECODE (TRY_CATCH_EXPR, "try_catch_expr", tcc_statement, 2) | |
| 907 | |
| 908 /* Evaluate the first operand. | |
| 909 The second operand is a cleanup expression which is evaluated | |
| 910 on any exit (normal, exception, or jump out) from this expression. */ | |
| 911 DEFTREECODE (TRY_FINALLY_EXPR, "try_finally", tcc_statement, 2) | |
| 912 | |
| 913 /* These types of expressions have no useful value, | |
| 914 and always have side effects. */ | |
| 915 | |
| 916 /* Used to represent a local declaration. The operand is DECL_EXPR_DECL. */ | |
| 917 DEFTREECODE (DECL_EXPR, "decl_expr", tcc_statement, 1) | |
| 918 | |
| 919 /* A label definition, encapsulated as a statement. | |
| 920 Operand 0 is the LABEL_DECL node for the label that appears here. | |
| 921 The type should be void and the value should be ignored. */ | |
| 922 DEFTREECODE (LABEL_EXPR, "label_expr", tcc_statement, 1) | |
| 923 | |
| 924 /* GOTO. Operand 0 is a LABEL_DECL node or an expression. | |
| 925 The type should be void and the value should be ignored. */ | |
| 926 DEFTREECODE (GOTO_EXPR, "goto_expr", tcc_statement, 1) | |
| 927 | |
| 928 /* RETURN. Evaluates operand 0, then returns from the current function. | |
| 929 Presumably that operand is an assignment that stores into the | |
| 930 RESULT_DECL that hold the value to be returned. | |
| 931 The operand may be null. | |
| 932 The type should be void and the value should be ignored. */ | |
| 933 DEFTREECODE (RETURN_EXPR, "return_expr", tcc_statement, 1) | |
| 934 | |
| 935 /* Exit the inner most loop conditionally. Operand 0 is the condition. | |
| 936 The type should be void and the value should be ignored. */ | |
| 937 DEFTREECODE (EXIT_EXPR, "exit_expr", tcc_statement, 1) | |
| 938 | |
| 939 /* A loop. Operand 0 is the body of the loop. | |
| 940 It must contain an EXIT_EXPR or is an infinite loop. | |
| 941 The type should be void and the value should be ignored. */ | |
| 942 DEFTREECODE (LOOP_EXPR, "loop_expr", tcc_statement, 1) | |
| 943 | |
| 944 /* Switch expression. | |
| 945 | |
| 946 TREE_TYPE is the original type of the condition, before any | |
| 947 language required type conversions. It may be NULL, in which case | |
| 948 the original type and final types are assumed to be the same. | |
| 949 | |
| 950 Operand 0 is the expression used to perform the branch, | |
| 951 Operand 1 is the body of the switch, which probably contains | |
| 952 CASE_LABEL_EXPRs. It may also be NULL, in which case operand 2 | |
| 131 | 953 must not be NULL. */ |
| 954 DEFTREECODE (SWITCH_EXPR, "switch_expr", tcc_statement, 2) | |
| 0 | 955 |
| 111 | 956 /* Used to represent a case label. |
| 957 | |
| 958 Operand 0 is CASE_LOW. It may be NULL_TREE, in which case the label | |
| 959 is a 'default' label. | |
| 960 Operand 1 is CASE_HIGH. If it is NULL_TREE, the label is a simple | |
| 961 (one-value) case label. If it is non-NULL_TREE, the case is a range. | |
| 962 Operand 2 is CASE_LABEL, which is is the corresponding LABEL_DECL. | |
| 963 Operand 3 is CASE_CHAIN. This operand is only used in tree-cfg.c to | |
| 964 speed up the lookup of case labels which use a particular edge in | |
| 965 the control flow graph. */ | |
| 966 DEFTREECODE (CASE_LABEL_EXPR, "case_label_expr", tcc_statement, 4) | |
| 0 | 967 |
| 968 /* Used to represent an inline assembly statement. ASM_STRING returns a | |
| 969 STRING_CST for the instruction (e.g., "mov x, y"). ASM_OUTPUTS, | |
| 970 ASM_INPUTS, and ASM_CLOBBERS represent the outputs, inputs, and clobbers | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
971 for the statement. ASM_LABELS, if present, indicates various destinations |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
972 for the asm; labels cannot be combined with outputs. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
973 DEFTREECODE (ASM_EXPR, "asm_expr", tcc_statement, 5) |
| 0 | 974 |
| 975 /* Variable references for SSA analysis. New SSA names are created every | |
| 976 time a variable is assigned a new value. The SSA builder uses SSA_NAME | |
| 977 nodes to implement SSA versioning. */ | |
| 978 DEFTREECODE (SSA_NAME, "ssa_name", tcc_exceptional, 0) | |
| 979 | |
| 980 /* Used to represent a typed exception handler. CATCH_TYPES is the type (or | |
| 981 list of types) handled, and CATCH_BODY is the code for the handler. */ | |
| 982 DEFTREECODE (CATCH_EXPR, "catch_expr", tcc_statement, 2) | |
| 983 | |
| 984 /* Used to represent an exception specification. EH_FILTER_TYPES is a list | |
| 985 of allowed types, and EH_FILTER_FAILURE is an expression to evaluate on | |
| 111 | 986 failure. */ |
| 0 | 987 DEFTREECODE (EH_FILTER_EXPR, "eh_filter_expr", tcc_statement, 2) |
| 988 | |
| 989 /* Node used for describing a property that is known at compile | |
| 990 time. */ | |
| 991 DEFTREECODE (SCEV_KNOWN, "scev_known", tcc_expression, 0) | |
| 992 | |
| 993 /* Node used for describing a property that is not known at compile | |
| 994 time. */ | |
| 995 DEFTREECODE (SCEV_NOT_KNOWN, "scev_not_known", tcc_expression, 0) | |
| 996 | |
| 997 /* Polynomial chains of recurrences. | |
| 111 | 998 cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}_CHREC_VARIABLE (cr). */ |
| 999 DEFTREECODE (POLYNOMIAL_CHREC, "polynomial_chrec", tcc_expression, 2) | |
| 0 | 1000 |
| 1001 /* Used to chain children of container statements together. | |
| 1002 Use the interface in tree-iterator.h to access this node. */ | |
| 1003 DEFTREECODE (STATEMENT_LIST, "statement_list", tcc_exceptional, 0) | |
| 1004 | |
| 1005 /* Predicate assertion. Artificial expression generated by the optimizers | |
| 1006 to keep track of predicate values. This expression may only appear on | |
| 1007 the RHS of assignments. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1008 |
| 0 | 1009 Given X = ASSERT_EXPR <Y, EXPR>, the optimizers can infer |
| 1010 two things: | |
| 1011 | |
| 1012 1- X is a copy of Y. | |
| 1013 2- EXPR is a conditional expression and is known to be true. | |
| 1014 | |
| 1015 Valid and to be expected forms of conditional expressions are | |
| 1016 valid GIMPLE conditional expressions (as defined by is_gimple_condexpr) | |
| 1017 and conditional expressions with the first operand being a | |
| 1018 PLUS_EXPR with a variable possibly wrapped in a NOP_EXPR first | |
| 1019 operand and an integer constant second operand. | |
| 1020 | |
| 1021 The type of the expression is the same as Y. */ | |
| 1022 DEFTREECODE (ASSERT_EXPR, "assert_expr", tcc_expression, 2) | |
| 1023 | |
| 1024 /* Base class information. Holds information about a class as a | |
| 1025 baseclass of itself or another class. */ | |
| 1026 DEFTREECODE (TREE_BINFO, "tree_binfo", tcc_exceptional, 0) | |
| 1027 | |
| 1028 /* Records the size for an expression of variable size type. This is | |
| 1029 for use in contexts in which we are accessing the entire object, | |
| 1030 such as for a function call, or block copy. | |
| 1031 Operand 0 is the real expression. | |
| 1032 Operand 1 is the size of the type in the expression. */ | |
| 1033 DEFTREECODE (WITH_SIZE_EXPR, "with_size_expr", tcc_expression, 2) | |
| 1034 | |
| 1035 /* Extract elements from two input vectors Operand 0 and Operand 1 | |
| 1036 size VS, according to the offset OFF defined by Operand 2 as | |
| 1037 follows: | |
| 1038 If OFF > 0, the last VS - OFF elements of vector OP0 are concatenated to | |
| 1039 the first OFF elements of the vector OP1. | |
| 1040 If OFF == 0, then the returned vector is OP1. | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1041 On different targets OFF may take different forms; It can be an address, in |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1042 which case its low log2(VS)-1 bits define the offset, or it can be a mask |
| 0 | 1043 generated by the builtin targetm.vectorize.mask_for_load_builtin_decl. */ |
| 1044 DEFTREECODE (REALIGN_LOAD_EXPR, "realign_load", tcc_expression, 3) | |
| 1045 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1046 /* Low-level memory addressing. Operands are BASE (address of static or |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1047 global variable or register), OFFSET (integer constant), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1048 INDEX (register), STEP (integer constant), INDEX2 (register), |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1049 The corresponding address is BASE + STEP * INDEX + INDEX2 + OFFSET. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1050 Only variations and values valid on the target are allowed. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1051 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1052 The type of STEP, INDEX and INDEX2 is sizetype. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1053 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1054 The type of BASE is a pointer type. If BASE is not an address of |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1055 a static or global variable INDEX2 will be NULL. |
| 0 | 1056 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1057 The type of OFFSET is a pointer type and determines TBAA the same as |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1058 the constant offset operand in MEM_REF. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1059 |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1060 DEFTREECODE (TARGET_MEM_REF, "target_mem_ref", tcc_reference, 5) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1061 |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1062 /* Memory addressing. Operands are a pointer and a tree constant integer |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1063 byte offset of the pointer type that when dereferenced yields the |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1064 type of the base object the pointer points into and which is used for |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1065 TBAA purposes. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1066 The type of the MEM_REF is the type the bytes at the memory location |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1067 are interpreted as. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1068 MEM_REF <p, c> is equivalent to ((typeof(c))p)->x... where x... is a |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1069 chain of component references offsetting p by c. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1070 DEFTREECODE (MEM_REF, "mem_ref", tcc_reference, 2) |
| 0 | 1071 |
| 111 | 1072 /* OpenACC and OpenMP. As it is exposed in TREE_RANGE_CHECK invocations, do |
| 1073 not change the ordering of these codes. */ | |
| 1074 | |
| 1075 /* OpenACC - #pragma acc parallel [clause1 ... clauseN] | |
| 1076 Operand 0: OMP_BODY: Code to be executed in parallel. | |
| 1077 Operand 1: OMP_CLAUSES: List of clauses. */ | |
| 1078 | |
| 1079 DEFTREECODE (OACC_PARALLEL, "oacc_parallel", tcc_statement, 2) | |
| 1080 | |
| 1081 /* OpenACC - #pragma acc kernels [clause1 ... clauseN] | |
| 1082 Operand 0: OMP_BODY: Sequence of kernels. | |
| 1083 Operand 1: OMP_CLAUSES: List of clauses. */ | |
| 1084 | |
| 1085 DEFTREECODE (OACC_KERNELS, "oacc_kernels", tcc_statement, 2) | |
| 1086 | |
| 1087 /* OpenACC - #pragma acc data [clause1 ... clauseN] | |
| 1088 Operand 0: OACC_DATA_BODY: Data construct body. | |
| 1089 Operand 1: OACC_DATA_CLAUSES: List of clauses. */ | |
| 1090 | |
| 1091 DEFTREECODE (OACC_DATA, "oacc_data", tcc_statement, 2) | |
| 1092 | |
| 1093 /* OpenACC - #pragma acc host_data [clause1 ... clauseN] | |
| 1094 Operand 0: OACC_HOST_DATA_BODY: Host_data construct body. | |
| 1095 Operand 1: OACC_HOST_DATA_CLAUSES: List of clauses. */ | |
| 1096 | |
| 1097 DEFTREECODE (OACC_HOST_DATA, "oacc_host_data", tcc_statement, 2) | |
| 1098 | |
| 0 | 1099 /* OpenMP - #pragma omp parallel [clause1 ... clauseN] |
| 1100 Operand 0: OMP_PARALLEL_BODY: Code to be executed by all threads. | |
| 1101 Operand 1: OMP_PARALLEL_CLAUSES: List of clauses. */ | |
| 1102 | |
| 1103 DEFTREECODE (OMP_PARALLEL, "omp_parallel", tcc_statement, 2) | |
| 1104 | |
| 1105 /* OpenMP - #pragma omp task [clause1 ... clauseN] | |
| 1106 Operand 0: OMP_TASK_BODY: Code to be executed by all threads. | |
| 1107 Operand 1: OMP_TASK_CLAUSES: List of clauses. */ | |
| 1108 | |
| 1109 DEFTREECODE (OMP_TASK, "omp_task", tcc_statement, 2) | |
| 1110 | |
| 1111 /* OpenMP - #pragma omp for [clause1 ... clauseN] | |
| 1112 Operand 0: OMP_FOR_BODY: Loop body. | |
| 1113 Operand 1: OMP_FOR_CLAUSES: List of clauses. | |
| 1114 Operand 2: OMP_FOR_INIT: Initialization code of the form | |
| 1115 VAR = N1. | |
| 1116 Operand 3: OMP_FOR_COND: Loop conditional expression of the form | |
| 1117 VAR { <, >, <=, >= } N2. | |
| 1118 Operand 4: OMP_FOR_INCR: Loop index increment of the form | |
| 1119 VAR { +=, -= } INCR. | |
| 1120 Operand 5: OMP_FOR_PRE_BODY: Filled by the gimplifier with things | |
| 1121 from INIT, COND, and INCR that are technically part of the | |
| 1122 OMP_FOR structured block, but are evaluated before the loop | |
| 1123 body begins. | |
| 111 | 1124 Operand 6: OMP_FOR_ORIG_DECLS: If non-NULL, list of DECLs initialized |
| 1125 in OMP_FOR_INIT. In some cases, like C++ iterators, the original | |
| 1126 DECL init has been lost in gimplification and now contains a | |
| 1127 temporary (D.nnnn). This list contains the original DECLs in | |
| 1128 the source. | |
| 0 | 1129 |
| 1130 VAR must be an integer or pointer variable, which is implicitly thread | |
| 1131 private. N1, N2 and INCR are required to be loop invariant integer | |
| 1132 expressions that are evaluated without any synchronization. | |
| 1133 The evaluation order, frequency of evaluation and side-effects are | |
| 111 | 1134 unspecified by the standards. */ |
| 1135 DEFTREECODE (OMP_FOR, "omp_for", tcc_statement, 7) | |
| 1136 | |
| 1137 /* OpenMP - #pragma omp simd [clause1 ... clauseN] | |
| 1138 Operands like for OMP_FOR. */ | |
| 1139 DEFTREECODE (OMP_SIMD, "omp_simd", tcc_statement, 7) | |
| 1140 | |
| 1141 /* OpenMP - #pragma omp distribute [clause1 ... clauseN] | |
| 1142 Operands like for OMP_FOR. */ | |
| 1143 DEFTREECODE (OMP_DISTRIBUTE, "omp_distribute", tcc_statement, 7) | |
| 1144 | |
| 1145 /* OpenMP - #pragma omp taskloop [clause1 ... clauseN] | |
| 1146 Operands like for OMP_FOR. */ | |
| 1147 DEFTREECODE (OMP_TASKLOOP, "omp_taskloop", tcc_statement, 7) | |
| 1148 | |
| 1149 /* OpenMP - #pragma acc loop [clause1 ... clauseN] | |
| 1150 Operands like for OMP_FOR. */ | |
| 1151 DEFTREECODE (OACC_LOOP, "oacc_loop", tcc_statement, 7) | |
| 1152 | |
| 1153 /* OpenMP - #pragma omp teams [clause1 ... clauseN] | |
| 1154 Operand 0: OMP_TEAMS_BODY: Teams body. | |
| 1155 Operand 1: OMP_TEAMS_CLAUSES: List of clauses. */ | |
| 1156 DEFTREECODE (OMP_TEAMS, "omp_teams", tcc_statement, 2) | |
| 1157 | |
| 1158 /* OpenMP - #pragma omp target data [clause1 ... clauseN] | |
| 1159 Operand 0: OMP_TARGET_DATA_BODY: Target data construct body. | |
| 1160 Operand 1: OMP_TARGET_DATA_CLAUSES: List of clauses. */ | |
| 1161 DEFTREECODE (OMP_TARGET_DATA, "omp_target_data", tcc_statement, 2) | |
| 1162 | |
| 1163 /* OpenMP - #pragma omp target [clause1 ... clauseN] | |
| 1164 Operand 0: OMP_TARGET_BODY: Target construct body. | |
| 1165 Operand 1: OMP_TARGET_CLAUSES: List of clauses. */ | |
| 1166 DEFTREECODE (OMP_TARGET, "omp_target", tcc_statement, 2) | |
| 0 | 1167 |
| 1168 /* OpenMP - #pragma omp sections [clause1 ... clauseN] | |
| 1169 Operand 0: OMP_SECTIONS_BODY: Sections body. | |
| 1170 Operand 1: OMP_SECTIONS_CLAUSES: List of clauses. */ | |
| 1171 DEFTREECODE (OMP_SECTIONS, "omp_sections", tcc_statement, 2) | |
| 1172 | |
| 111 | 1173 /* OpenMP - #pragma omp ordered |
| 1174 Operand 0: OMP_ORDERED_BODY: Master section body. | |
| 1175 Operand 1: OMP_ORDERED_CLAUSES: List of clauses. */ | |
| 1176 DEFTREECODE (OMP_ORDERED, "omp_ordered", tcc_statement, 2) | |
| 1177 | |
| 1178 /* OpenMP - #pragma omp critical [name] | |
| 1179 Operand 0: OMP_CRITICAL_BODY: Critical section body. | |
| 1180 Operand 1: OMP_CRITICAL_CLAUSES: List of clauses. | |
| 1181 Operand 2: OMP_CRITICAL_NAME: Identifier for critical section. */ | |
| 1182 DEFTREECODE (OMP_CRITICAL, "omp_critical", tcc_statement, 3) | |
| 1183 | |
| 0 | 1184 /* OpenMP - #pragma omp single |
| 1185 Operand 0: OMP_SINGLE_BODY: Single section body. | |
| 1186 Operand 1: OMP_SINGLE_CLAUSES: List of clauses. */ | |
| 1187 DEFTREECODE (OMP_SINGLE, "omp_single", tcc_statement, 2) | |
| 1188 | |
| 1189 /* OpenMP - #pragma omp section | |
| 1190 Operand 0: OMP_SECTION_BODY: Section body. */ | |
| 1191 DEFTREECODE (OMP_SECTION, "omp_section", tcc_statement, 1) | |
| 1192 | |
| 1193 /* OpenMP - #pragma omp master | |
| 1194 Operand 0: OMP_MASTER_BODY: Master section body. */ | |
| 1195 DEFTREECODE (OMP_MASTER, "omp_master", tcc_statement, 1) | |
| 1196 | |
| 111 | 1197 /* OpenMP - #pragma omp taskgroup |
| 1198 Operand 0: OMP_TASKGROUP_BODY: Taskgroup body. */ | |
| 1199 DEFTREECODE (OMP_TASKGROUP, "omp_taskgroup", tcc_statement, 1) | |
| 1200 | |
| 1201 /* OpenACC - #pragma acc cache (variable1 ... variableN) | |
| 1202 Operand 0: OACC_CACHE_CLAUSES: List of variables (transformed into | |
| 1203 OMP_CLAUSE__CACHE_ clauses). */ | |
| 1204 DEFTREECODE (OACC_CACHE, "oacc_cache", tcc_statement, 1) | |
| 1205 | |
| 1206 /* OpenACC - #pragma acc declare [clause1 ... clauseN] | |
| 1207 Operand 0: OACC_DECLARE_CLAUSES: List of clauses. */ | |
| 1208 DEFTREECODE (OACC_DECLARE, "oacc_declare", tcc_statement, 1) | |
| 1209 | |
| 1210 /* OpenACC - #pragma acc enter data [clause1 ... clauseN] | |
| 1211 Operand 0: OACC_ENTER_DATA_CLAUSES: List of clauses. */ | |
| 1212 DEFTREECODE (OACC_ENTER_DATA, "oacc_enter_data", tcc_statement, 1) | |
| 0 | 1213 |
| 111 | 1214 /* OpenACC - #pragma acc exit data [clause1 ... clauseN] |
| 1215 Operand 0: OACC_EXIT_DATA_CLAUSES: List of clauses. */ | |
| 1216 DEFTREECODE (OACC_EXIT_DATA, "oacc_exit_data", tcc_statement, 1) | |
| 1217 | |
| 1218 /* OpenACC - #pragma acc update [clause1 ... clauseN] | |
| 1219 Operand 0: OACC_UPDATE_CLAUSES: List of clauses. */ | |
| 1220 DEFTREECODE (OACC_UPDATE, "oacc_update", tcc_statement, 1) | |
| 1221 | |
| 1222 /* OpenMP - #pragma omp target update [clause1 ... clauseN] | |
| 1223 Operand 0: OMP_TARGET_UPDATE_CLAUSES: List of clauses. */ | |
| 1224 DEFTREECODE (OMP_TARGET_UPDATE, "omp_target_update", tcc_statement, 1) | |
| 1225 | |
| 1226 /* OpenMP - #pragma omp target enter data [clause1 ... clauseN] | |
| 1227 Operand 0: OMP_TARGET_ENTER_DATA_CLAUSES: List of clauses. */ | |
| 1228 DEFTREECODE (OMP_TARGET_ENTER_DATA, "omp_target_enter_data", tcc_statement, 1) | |
| 1229 | |
| 1230 /* OpenMP - #pragma omp target exit data [clause1 ... clauseN] | |
| 1231 Operand 0: OMP_TARGET_EXIT_DATA_CLAUSES: List of clauses. */ | |
| 1232 DEFTREECODE (OMP_TARGET_EXIT_DATA, "omp_target_exit_data", tcc_statement, 1) | |
| 1233 | |
| 1234 /* OMP_ATOMIC through OMP_ATOMIC_CAPTURE_NEW must be consecutive, | |
| 1235 or OMP_ATOMIC_SEQ_CST needs adjusting. */ | |
| 0 | 1236 |
| 1237 /* OpenMP - #pragma omp atomic | |
| 1238 Operand 0: The address at which the atomic operation is to be performed. | |
| 1239 This address should be stabilized with save_expr. | |
| 1240 Operand 1: The expression to evaluate. When the old value of the object | |
| 1241 at the address is used in the expression, it should appear as if | |
| 1242 build_fold_indirect_ref of the address. */ | |
| 1243 DEFTREECODE (OMP_ATOMIC, "omp_atomic", tcc_statement, 2) | |
| 1244 | |
| 111 | 1245 /* OpenMP - #pragma omp atomic read |
| 1246 Operand 0: The address at which the atomic operation is to be performed. | |
| 1247 This address should be stabilized with save_expr. */ | |
| 1248 DEFTREECODE (OMP_ATOMIC_READ, "omp_atomic_read", tcc_statement, 1) | |
| 1249 | |
| 1250 /* OpenMP - #pragma omp atomic capture | |
| 1251 Operand 0: The address at which the atomic operation is to be performed. | |
| 1252 This address should be stabilized with save_expr. | |
| 1253 Operand 1: The expression to evaluate. When the old value of the object | |
| 1254 at the address is used in the expression, it should appear as if | |
| 1255 build_fold_indirect_ref of the address. | |
| 1256 OMP_ATOMIC_CAPTURE_OLD returns the old memory content, | |
| 1257 OMP_ATOMIC_CAPTURE_NEW the new value. */ | |
| 1258 DEFTREECODE (OMP_ATOMIC_CAPTURE_OLD, "omp_atomic_capture_old", tcc_statement, 2) | |
| 1259 DEFTREECODE (OMP_ATOMIC_CAPTURE_NEW, "omp_atomic_capture_new", tcc_statement, 2) | |
| 1260 | |
| 0 | 1261 /* OpenMP clauses. */ |
| 1262 DEFTREECODE (OMP_CLAUSE, "omp_clause", tcc_exceptional, 0) | |
| 1263 | |
| 111 | 1264 /* TRANSACTION_EXPR tree code. |
| 1265 Operand 0: BODY: contains body of the transaction. */ | |
| 1266 DEFTREECODE (TRANSACTION_EXPR, "transaction_expr", tcc_expression, 1) | |
| 1267 | |
| 0 | 1268 /* Widening dot-product. |
| 1269 The first two arguments are of type t1. | |
| 1270 The third argument and the result are of type t2, such that t2 is at least | |
| 1271 twice the size of t1. DOT_PROD_EXPR(arg1,arg2,arg3) is equivalent to: | |
| 1272 tmp = WIDEN_MULT_EXPR(arg1, arg2); | |
| 1273 arg3 = PLUS_EXPR (tmp, arg3); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1274 or: |
| 0 | 1275 tmp = WIDEN_MULT_EXPR(arg1, arg2); |
| 1276 arg3 = WIDEN_SUM_EXPR (tmp, arg3); */ | |
| 1277 DEFTREECODE (DOT_PROD_EXPR, "dot_prod_expr", tcc_expression, 3) | |
| 1278 | |
| 1279 /* Widening summation. | |
| 1280 The first argument is of type t1. | |
| 1281 The second argument is of type t2, such that t2 is at least twice | |
| 1282 the size of t1. The type of the entire expression is also t2. | |
| 1283 WIDEN_SUM_EXPR is equivalent to first widening (promoting) | |
| 1284 the first argument from type t1 to type t2, and then summing it | |
| 1285 with the second argument. */ | |
| 1286 DEFTREECODE (WIDEN_SUM_EXPR, "widen_sum_expr", tcc_binary, 2) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1287 |
| 111 | 1288 /* Widening sad (sum of absolute differences). |
| 1289 The first two arguments are of type t1 which should be integer. | |
| 1290 The third argument and the result are of type t2, such that t2 is at least | |
| 1291 twice the size of t1. Like DOT_PROD_EXPR, SAD_EXPR (arg1,arg2,arg3) is | |
| 1292 equivalent to (note we don't have WIDEN_MINUS_EXPR now, but we assume its | |
| 1293 behavior is similar to WIDEN_SUM_EXPR): | |
| 1294 tmp = WIDEN_MINUS_EXPR (arg1, arg2) | |
| 1295 tmp2 = ABS_EXPR (tmp) | |
| 1296 arg3 = PLUS_EXPR (tmp2, arg3) | |
| 1297 or: | |
| 1298 tmp = WIDEN_MINUS_EXPR (arg1, arg2) | |
| 1299 tmp2 = ABS_EXPR (tmp) | |
| 1300 arg3 = WIDEN_SUM_EXPR (tmp2, arg3) | |
| 1301 */ | |
| 1302 DEFTREECODE (SAD_EXPR, "sad_expr", tcc_expression, 3) | |
| 1303 | |
| 0 | 1304 /* Widening multiplication. |
| 1305 The two arguments are of type t1. | |
| 1306 The result is of type t2, such that t2 is at least twice | |
| 1307 the size of t1. WIDEN_MULT_EXPR is equivalent to first widening (promoting) | |
| 1308 the arguments from type t1 to type t2, and then multiplying them. */ | |
| 1309 DEFTREECODE (WIDEN_MULT_EXPR, "widen_mult_expr", tcc_binary, 2) | |
| 1310 | |
|
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1311 /* Widening multiply-accumulate. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1312 The first two arguments are of type t1. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1313 The third argument and the result are of type t2, such as t2 is at least |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1314 twice the size of t1. t1 and t2 must be integral or fixed-point types. |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1315 The expression is equivalent to a WIDEN_MULT_EXPR operation |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1316 of the first two operands followed by an add or subtract of the third |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1317 operand. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1318 DEFTREECODE (WIDEN_MULT_PLUS_EXPR, "widen_mult_plus_expr", tcc_expression, 3) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1319 /* This is like the above, except in the final expression the multiply result |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1320 is subtracted from t3. */ |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1321 DEFTREECODE (WIDEN_MULT_MINUS_EXPR, "widen_mult_minus_expr", tcc_expression, 3) |
|
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
63
diff
changeset
|
1322 |
| 111 | 1323 /* Widening shift left. |
| 1324 The first operand is of type t1. | |
| 1325 The second operand is the number of bits to shift by; it need not be the | |
| 1326 same type as the first operand and result. | |
| 1327 Note that the result is undefined if the second operand is larger | |
| 1328 than or equal to the first operand's type size. | |
| 1329 The type of the entire expression is t2, such that t2 is at least twice | |
| 1330 the size of t1. | |
| 1331 WIDEN_LSHIFT_EXPR is equivalent to first widening (promoting) | |
| 1332 the first argument from type t1 to type t2, and then shifting it | |
| 1333 by the second argument. */ | |
| 1334 DEFTREECODE (WIDEN_LSHIFT_EXPR, "widen_lshift_expr", tcc_binary, 2) | |
| 1335 | |
| 0 | 1336 /* Widening vector multiplication. |
| 1337 The two operands are vectors with N elements of size S. Multiplying the | |
| 1338 elements of the two vectors will result in N products of size 2*S. | |
| 1339 VEC_WIDEN_MULT_HI_EXPR computes the N/2 high products. | |
| 1340 VEC_WIDEN_MULT_LO_EXPR computes the N/2 low products. */ | |
| 1341 DEFTREECODE (VEC_WIDEN_MULT_HI_EXPR, "widen_mult_hi_expr", tcc_binary, 2) | |
| 1342 DEFTREECODE (VEC_WIDEN_MULT_LO_EXPR, "widen_mult_lo_expr", tcc_binary, 2) | |
| 1343 | |
| 111 | 1344 /* Similarly, but return the even or odd N/2 products. */ |
| 1345 DEFTREECODE (VEC_WIDEN_MULT_EVEN_EXPR, "widen_mult_even_expr", tcc_binary, 2) | |
| 1346 DEFTREECODE (VEC_WIDEN_MULT_ODD_EXPR, "widen_mult_odd_expr", tcc_binary, 2) | |
| 1347 | |
| 0 | 1348 /* Unpack (extract and promote/widen) the high/low elements of the input |
| 1349 vector into the output vector. The input vector has twice as many | |
| 1350 elements as the output vector, that are half the size of the elements | |
| 1351 of the output vector. This is used to support type promotion. */ | |
| 1352 DEFTREECODE (VEC_UNPACK_HI_EXPR, "vec_unpack_hi_expr", tcc_unary, 1) | |
| 1353 DEFTREECODE (VEC_UNPACK_LO_EXPR, "vec_unpack_lo_expr", tcc_unary, 1) | |
| 1354 | |
| 1355 /* Unpack (extract) the high/low elements of the input vector, convert | |
| 1356 fixed point values to floating point and widen elements into the | |
| 1357 output vector. The input vector has twice as many elements as the output | |
| 1358 vector, that are half the size of the elements of the output vector. */ | |
| 1359 DEFTREECODE (VEC_UNPACK_FLOAT_HI_EXPR, "vec_unpack_float_hi_expr", tcc_unary, 1) | |
| 1360 DEFTREECODE (VEC_UNPACK_FLOAT_LO_EXPR, "vec_unpack_float_lo_expr", tcc_unary, 1) | |
| 1361 | |
| 131 | 1362 /* Unpack (extract) the high/low elements of the input vector, convert |
| 1363 floating point values to integer and widen elements into the output | |
| 1364 vector. The input vector has twice as many elements as the output | |
| 1365 vector, that are half the size of the elements of the output vector. */ | |
| 1366 DEFTREECODE (VEC_UNPACK_FIX_TRUNC_HI_EXPR, "vec_unpack_fix_trunc_hi_expr", | |
| 1367 tcc_unary, 1) | |
| 1368 DEFTREECODE (VEC_UNPACK_FIX_TRUNC_LO_EXPR, "vec_unpack_fix_trunc_lo_expr", | |
| 1369 tcc_unary, 1) | |
| 1370 | |
| 0 | 1371 /* Pack (demote/narrow and merge) the elements of the two input vectors |
| 1372 into the output vector using truncation/saturation. | |
| 1373 The elements of the input vectors are twice the size of the elements of the | |
| 1374 output vector. This is used to support type demotion. */ | |
| 1375 DEFTREECODE (VEC_PACK_TRUNC_EXPR, "vec_pack_trunc_expr", tcc_binary, 2) | |
| 1376 DEFTREECODE (VEC_PACK_SAT_EXPR, "vec_pack_sat_expr", tcc_binary, 2) | |
| 1377 | |
| 1378 /* Convert floating point values of the two input vectors to integer | |
| 1379 and pack (narrow and merge) the elements into the output vector. The | |
| 1380 elements of the input vector are twice the size of the elements of | |
| 1381 the output vector. */ | |
| 1382 DEFTREECODE (VEC_PACK_FIX_TRUNC_EXPR, "vec_pack_fix_trunc_expr", tcc_binary, 2) | |
| 1383 | |
| 131 | 1384 /* Convert fixed point values of the two input vectors to floating point |
| 1385 and pack (narrow and merge) the elements into the output vector. The | |
| 1386 elements of the input vector are twice the size of the elements of | |
| 1387 the output vector. */ | |
| 1388 DEFTREECODE (VEC_PACK_FLOAT_EXPR, "vec_pack_float_expr", tcc_binary, 2) | |
| 1389 | |
| 111 | 1390 /* Widening vector shift left in bits. |
| 1391 Operand 0 is a vector to be shifted with N elements of size S. | |
| 1392 Operand 1 is an integer shift amount in bits. | |
| 1393 The result of the operation is N elements of size 2*S. | |
| 1394 VEC_WIDEN_LSHIFT_HI_EXPR computes the N/2 high results. | |
| 1395 VEC_WIDEN_LSHIFT_LO_EXPR computes the N/2 low results. | |
| 1396 */ | |
| 1397 DEFTREECODE (VEC_WIDEN_LSHIFT_HI_EXPR, "widen_lshift_hi_expr", tcc_binary, 2) | |
| 1398 DEFTREECODE (VEC_WIDEN_LSHIFT_LO_EXPR, "widen_lshift_lo_expr", tcc_binary, 2) | |
| 0 | 1399 |
| 1400 /* PREDICT_EXPR. Specify hint for branch prediction. The | |
| 1401 PREDICT_EXPR_PREDICTOR specify predictor and PREDICT_EXPR_OUTCOME the | |
| 1402 outcome (0 for not taken and 1 for taken). Once the profile is guessed | |
| 1403 all conditional branches leading to execution paths executing the | |
| 1404 PREDICT_EXPR will get predicted by the specified predictor. */ | |
| 1405 DEFTREECODE (PREDICT_EXPR, "predict_expr", tcc_expression, 1) | |
| 1406 | |
| 1407 /* OPTIMIZATION_NODE. Node to store the optimization options. */ | |
| 1408 DEFTREECODE (OPTIMIZATION_NODE, "optimization_node", tcc_exceptional, 0) | |
| 1409 | |
| 1410 /* TARGET_OPTION_NODE. Node to store the target specific options. */ | |
| 1411 DEFTREECODE (TARGET_OPTION_NODE, "target_option_node", tcc_exceptional, 0) | |
| 1412 | |
| 111 | 1413 /* ANNOTATE_EXPR. |
| 1414 Operand 0 is the expression to be annotated. | |
| 131 | 1415 Operand 1 is the annotation kind. |
| 1416 Operand 2 is additional data. */ | |
| 1417 DEFTREECODE (ANNOTATE_EXPR, "annotate_expr", tcc_expression, 3) | |
| 111 | 1418 |
| 0 | 1419 /* |
| 1420 Local variables: | |
| 1421 mode:c | |
| 1422 End: | |
| 1423 */ |