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