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