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