1 /* Front-end tree definitions for GNU compiler. 2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 3 2001, 2002, 2003, 2004 Free Software Foundation, Inc. 4 5 This file is part of GCC. 6 7 GCC is free software; you can redistribute it and/or modify it under 8 the terms of the GNU General Public License as published by the Free 9 Software Foundation; either version 2, or (at your option) any later 10 version. 11 12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY 13 WARRANTY; without even the implied warranty of MERCHANTABILITY or 14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 for more details. 16 17 You should have received a copy of the GNU General Public License 18 along with GCC; see the file COPYING. If not, write to the Free 19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 20 02111-1307, USA. */ 21 22 #ifndef GCC_TREE_H 23 #define GCC_TREE_H 24 25 #include "machmode.h" 26 #include "version.h" 27 #include "input.h" 28 29 /* Codes of tree nodes */ 30 31 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, 32 33 enum tree_code { 34 #include "tree.def" 35 36 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for 37 NUM_TREE_CODE. */ 38 }; 39 40 #undef DEFTREECODE 41 42 /* Number of language-independent tree codes. */ 43 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) 44 45 /* Indexed by enum tree_code, contains a character which is 46 `<' for a comparison expression, `1', for a unary arithmetic 47 expression, `2' for a binary arithmetic expression, `e' for 48 other types of expressions, `r' for a reference, `c' for a 49 constant, `d' for a decl, `t' for a type, `s' for a statement, 50 and `x' for anything else (TREE_LIST, IDENTIFIER, etc). */ 51 52 #define MAX_TREE_CODES 256 53 extern const char tree_code_type[]; 54 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] 55 56 /* Returns nonzero iff CLASS is the tree-code class of an 57 expression. */ 58 59 #define IS_EXPR_CODE_CLASS(CLASS) (strchr ("<12ers", (CLASS)) != 0) 60 61 /* Returns nonzero iff NODE is an expression of some kind. */ 62 63 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) 64 65 /* Number of argument-words in each kind of tree-node. */ 66 67 extern const unsigned char tree_code_length[]; 68 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] 69 70 /* Names of tree components. */ 71 72 extern const char *const tree_code_name[]; 73 74 /* Classify which part of the compiler has defined a given builtin function. 75 Note that we assume below that this is no more than two bits. */ 76 enum built_in_class 77 { 78 NOT_BUILT_IN = 0, 79 BUILT_IN_FRONTEND, 80 BUILT_IN_MD, 81 BUILT_IN_NORMAL 82 }; 83 84 /* Names for the above. */ 85 extern const char *const built_in_class_names[4]; 86 87 /* Codes that identify the various built in functions 88 so that expand_call can identify them quickly. */ 89 90 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM) ENUM, 91 enum built_in_function 92 { 93 #include "builtins.def" 94 95 /* Upper bound on non-language-specific builtins. */ 96 END_BUILTINS 97 }; 98 #undef DEF_BUILTIN 99 100 /* Names for the above. */ 101 extern const char *const built_in_names[(int) END_BUILTINS]; 102 103 /* An array of _DECL trees for the above. */ 104 extern GTY(()) tree built_in_decls[(int) END_BUILTINS]; 105 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS]; 106 107 /* The definition of tree nodes fills the next several pages. */ 108 109 /* A tree node can represent a data type, a variable, an expression 110 or a statement. Each node has a TREE_CODE which says what kind of 111 thing it represents. Some common codes are: 112 INTEGER_TYPE -- represents a type of integers. 113 ARRAY_TYPE -- represents a type of pointer. 114 VAR_DECL -- represents a declared variable. 115 INTEGER_CST -- represents a constant integer value. 116 PLUS_EXPR -- represents a sum (an expression). 117 118 As for the contents of a tree node: there are some fields 119 that all nodes share. Each TREE_CODE has various special-purpose 120 fields as well. The fields of a node are never accessed directly, 121 always through accessor macros. */ 122 123 /* Every kind of tree node starts with this structure, 124 so all nodes have these fields. 125 126 See the accessor macros, defined below, for documentation of the 127 fields. */ 128 129 struct tree_common GTY(()) 130 { 131 tree chain; 132 tree type; 133 134 ENUM_BITFIELD(tree_code) code : 8; 135 136 unsigned side_effects_flag : 1; 137 unsigned constant_flag : 1; 138 unsigned addressable_flag : 1; 139 unsigned volatile_flag : 1; 140 unsigned readonly_flag : 1; 141 unsigned unsigned_flag : 1; 142 unsigned asm_written_flag: 1; 143 unsigned unused_0 : 1; 144 145 unsigned used_flag : 1; 146 unsigned nothrow_flag : 1; 147 unsigned static_flag : 1; 148 unsigned public_flag : 1; 149 unsigned private_flag : 1; 150 unsigned protected_flag : 1; 151 unsigned deprecated_flag : 1; 152 unsigned unused_1 : 1; 153 154 unsigned lang_flag_0 : 1; 155 unsigned lang_flag_1 : 1; 156 unsigned lang_flag_2 : 1; 157 unsigned lang_flag_3 : 1; 158 unsigned lang_flag_4 : 1; 159 unsigned lang_flag_5 : 1; 160 unsigned lang_flag_6 : 1; 161 unsigned unused_2 : 1; 162 }; 163 164 /* The following table lists the uses of each of the above flags and 165 for which types of nodes they are defined. Note that expressions 166 include decls. 167 168 addressable_flag: 169 170 TREE_ADDRESSABLE in 171 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL, 172 ..._TYPE, IDENTIFIER_NODE. 173 In a STMT_EXPR, it means we want the result of the enclosed 174 expression. 175 176 static_flag: 177 178 TREE_STATIC in 179 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR 180 TREE_NO_UNUSED_WARNING in 181 CONVERT_EXPR, NOP_EXPR, COMPOUND_EXPR 182 TREE_VIA_VIRTUAL in 183 TREE_LIST or TREE_VEC 184 TREE_CONSTANT_OVERFLOW in 185 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST 186 TREE_SYMBOL_REFERENCED in 187 IDENTIFIER_NODE 188 CLEANUP_EH_ONLY in 189 TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, 190 TREE_LIST elements of a block's cleanup list. 191 192 public_flag: 193 194 TREE_OVERFLOW in 195 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST 196 TREE_PUBLIC in 197 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE 198 EXPR_WFL_EMIT_LINE_NOTE in 199 EXPR_WITH_FILE_LOCATION 200 201 private_flag: 202 203 TREE_PRIVATE in 204 ..._DECL 205 CALL_EXPR_HAS_RETURN_SLOT_ADDR in 206 CALL_EXPR 207 208 protected_flag: 209 210 TREE_PROTECTED in 211 BLOCK 212 ..._DECL 213 CALL_FROM_THUNK_P in 214 CALL_EXPR 215 216 side_effects_flag: 217 218 TREE_SIDE_EFFECTS in 219 all expressions 220 221 volatile_flag: 222 223 TREE_THIS_VOLATILE in 224 all expressions 225 TYPE_VOLATILE in 226 ..._TYPE 227 228 readonly_flag: 229 230 TREE_READONLY in 231 all expressions 232 TYPE_READONLY in 233 ..._TYPE 234 235 constant_flag: 236 237 TREE_CONSTANT in 238 all expressions 239 240 unsigned_flag: 241 242 TREE_UNSIGNED in 243 INTEGER_TYPE, ENUMERAL_TYPE, FIELD_DECL 244 SAVE_EXPR_NOPLACEHOLDER in 245 SAVE_EXPR 246 247 asm_written_flag: 248 249 TREE_ASM_WRITTEN in 250 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE 251 BLOCK 252 253 used_flag: 254 255 TREE_USED in 256 expressions, IDENTIFIER_NODE 257 258 nothrow_flag: 259 260 TREE_NOTHROW in 261 CALL_EXPR, FUNCTION_DECL 262 263 TYPE_ALIGN_OK in 264 ..._TYPE 265 266 deprecated_flag: 267 268 TREE_DEPRECATED in 269 ..._DECL 270 271 */ 272 273 /* Define accessors for the fields that all tree nodes have 274 (though some fields are not used for all kinds of nodes). */ 275 276 /* The tree-code says what kind of node it is. 277 Codes are defined in tree.def. */ 278 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code) 279 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE)) 280 281 /* When checking is enabled, errors will be generated if a tree node 282 is accessed incorrectly. The macros abort with a fatal error. */ 283 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 284 285 #define TREE_CHECK(T, CODE) __extension__ \ 286 ({ const tree __t = (T); \ 287 if (TREE_CODE (__t) != (CODE)) \ 288 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \ 289 __t; }) 290 291 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ 292 ({ const tree __t = (T); \ 293 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ 294 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ 295 __FUNCTION__); \ 296 __t; }) 297 298 /* These checks have to be special cased. */ 299 #define EXPR_CHECK(T) __extension__ \ 300 ({ const tree __t = (T); \ 301 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ 302 if (!IS_EXPR_CODE_CLASS (__c)) \ 303 tree_class_check_failed (__t, 'e', __FILE__, __LINE__, \ 304 __FUNCTION__); \ 305 __t; }) 306 307 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ 308 (*({const tree __t = (T); \ 309 const int __i = (I); \ 310 if (TREE_CODE (__t) != TREE_VEC) \ 311 tree_check_failed (__t, TREE_VEC, \ 312 __FILE__, __LINE__, __FUNCTION__); \ 313 if (__i < 0 || __i >= __t->vec.length) \ 314 tree_vec_elt_check_failed (__i, __t->vec.length, \ 315 __FILE__, __LINE__, __FUNCTION__); \ 316 &__t->vec.a[__i]; })) 317 318 /* Special checks for TREE_OPERANDs. */ 319 #define TREE_OPERAND_CHECK(T, I) __extension__ \ 320 (*({const tree __t = EXPR_CHECK (T); \ 321 const int __i = (I); \ 322 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \ 323 tree_operand_check_failed (__i, TREE_CODE (__t), \ 324 __FILE__, __LINE__, __FUNCTION__); \ 325 &__t->exp.operands[__i]; })) 326 327 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ 328 (*({const tree __t = (T); \ 329 const int __i = (I); \ 330 if (TREE_CODE (__t) != CODE) \ 331 tree_check_failed (__t, CODE, __FILE__, __LINE__, __FUNCTION__); \ 332 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \ 333 tree_operand_check_failed (__i, (CODE), \ 334 __FILE__, __LINE__, __FUNCTION__); \ 335 &__t->exp.operands[__i]; })) 336 337 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \ 338 (*(rtx *) \ 339 ({const tree __t = (T); \ 340 const int __i = (I); \ 341 if (TREE_CODE (__t) != (CODE)) \ 342 tree_check_failed (__t, (CODE), __FILE__, __LINE__, __FUNCTION__); \ 343 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \ 344 tree_operand_check_failed (__i, (CODE), \ 345 __FILE__, __LINE__, __FUNCTION__); \ 346 &__t->exp.operands[__i]; })) 347 348 extern void tree_check_failed (const tree, enum tree_code, 349 const char *, int, const char *) 350 ATTRIBUTE_NORETURN; 351 extern void tree_class_check_failed (const tree, int, 352 const char *, int, const char *) 353 ATTRIBUTE_NORETURN; 354 extern void tree_vec_elt_check_failed (int, int, const char *, 355 int, const char *) 356 ATTRIBUTE_NORETURN; 357 358 extern void tree_operand_check_failed (int, enum tree_code, 359 const char *, int, const char *) 360 ATTRIBUTE_NORETURN; 361 362 #else /* not ENABLE_TREE_CHECKING, or not gcc */ 363 364 #define TREE_CHECK(T, CODE) (T) 365 #define TREE_CLASS_CHECK(T, CODE) (T) 366 #define EXPR_CHECK(T) (T) 367 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) 368 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) 369 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) 370 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I])) 371 372 #endif 373 374 #include "tree-check.h" 375 376 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, 't') 377 #define DECL_CHECK(T) TREE_CLASS_CHECK (T, 'd') 378 #define CST_CHECK(T) TREE_CLASS_CHECK (T, 'c') 379 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, 's') 380 381 /* In all nodes that are expressions, this is the data type of the expression. 382 In POINTER_TYPE nodes, this is the type that the pointer points to. 383 In ARRAY_TYPE nodes, this is the type of the elements. 384 In VECTOR_TYPE nodes, this is the type of the elements. */ 385 #define TREE_TYPE(NODE) ((NODE)->common.type) 386 387 /* Here is how primitive or already-canonicalized types' hash codes 388 are made. */ 389 #define TYPE_HASH(TYPE) ((size_t) (TYPE) & 0777777) 390 391 /* Nodes are chained together for many purposes. 392 Types are chained together to record them for being output to the debugger 393 (see the function `chain_type'). 394 Decls in the same scope are chained together to record the contents 395 of the scope. 396 Statement nodes for successive statements used to be chained together. 397 Often lists of things are represented by TREE_LIST nodes that 398 are chained together. */ 399 400 #define TREE_CHAIN(NODE) ((NODE)->common.chain) 401 402 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs 403 that don't change the machine mode. */ 404 405 #define STRIP_NOPS(EXP) \ 406 while ((TREE_CODE (EXP) == NOP_EXPR \ 407 || TREE_CODE (EXP) == CONVERT_EXPR \ 408 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 409 && TREE_OPERAND (EXP, 0) != error_mark_node \ 410 && (TYPE_MODE (TREE_TYPE (EXP)) \ 411 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ 412 (EXP) = TREE_OPERAND (EXP, 0) 413 414 /* Like STRIP_NOPS, but don't let the signedness change either. */ 415 416 #define STRIP_SIGN_NOPS(EXP) \ 417 while ((TREE_CODE (EXP) == NOP_EXPR \ 418 || TREE_CODE (EXP) == CONVERT_EXPR \ 419 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 420 && TREE_OPERAND (EXP, 0) != error_mark_node \ 421 && (TYPE_MODE (TREE_TYPE (EXP)) \ 422 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 423 && (TREE_UNSIGNED (TREE_TYPE (EXP)) \ 424 == TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ 425 (EXP) = TREE_OPERAND (EXP, 0) 426 427 /* Like STRIP_NOPS, but don't alter the TREE_TYPE main variant either. */ 428 429 #define STRIP_MAIN_TYPE_NOPS(EXP) \ 430 while ((TREE_CODE (EXP) == NOP_EXPR \ 431 || TREE_CODE (EXP) == CONVERT_EXPR \ 432 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 433 && TREE_OPERAND (EXP, 0) != error_mark_node \ 434 && (TYPE_MAIN_VARIANT (TREE_TYPE (EXP)) \ 435 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \ 436 (EXP) = TREE_OPERAND (EXP, 0) 437 438 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ 439 440 #define STRIP_TYPE_NOPS(EXP) \ 441 while ((TREE_CODE (EXP) == NOP_EXPR \ 442 || TREE_CODE (EXP) == CONVERT_EXPR \ 443 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 444 && TREE_OPERAND (EXP, 0) != error_mark_node \ 445 && (TREE_TYPE (EXP) \ 446 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 447 (EXP) = TREE_OPERAND (EXP, 0) 448 449 /* Nonzero if TYPE represents an integral type. Note that we do not 450 include COMPLEX types here. */ 451 452 #define INTEGRAL_TYPE_P(TYPE) \ 453 (TREE_CODE (TYPE) == INTEGER_TYPE || TREE_CODE (TYPE) == ENUMERAL_TYPE \ 454 || TREE_CODE (TYPE) == BOOLEAN_TYPE || TREE_CODE (TYPE) == CHAR_TYPE) 455 456 /* Nonzero if TYPE represents a scalar floating-point type. */ 457 458 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) 459 460 /* Nonzero if TYPE represents a complex floating-point type. */ 461 462 #define COMPLEX_FLOAT_TYPE_P(TYPE) \ 463 (TREE_CODE (TYPE) == COMPLEX_TYPE \ 464 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 465 466 /* Nonzero if TYPE represents a floating-point type, including complex 467 floating-point types. */ 468 469 #define FLOAT_TYPE_P(TYPE) \ 470 (SCALAR_FLOAT_TYPE_P (TYPE) || COMPLEX_FLOAT_TYPE_P (TYPE)) 471 472 /* Nonzero if TYPE represents an aggregate (multi-component) type. */ 473 474 #define AGGREGATE_TYPE_P(TYPE) \ 475 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \ 476 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE \ 477 || TREE_CODE (TYPE) == SET_TYPE) 478 479 /* Nonzero if TYPE represents a pointer or reference type. 480 (It should be renamed to INDIRECT_TYPE_P.) */ 481 482 #define POINTER_TYPE_P(TYPE) \ 483 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) 484 485 /* Nonzero if this type is a complete type. */ 486 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) 487 488 /* Nonzero if this type is the (possibly qualified) void type. */ 489 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) 490 491 /* Nonzero if this type is complete or is cv void. */ 492 #define COMPLETE_OR_VOID_TYPE_P(NODE) \ 493 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) 494 495 /* Nonzero if this type is complete or is an array with unspecified bound. */ 496 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ 497 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) 498 499 /* Nonzero if TYPE represents a type. */ 500 501 #define TYPE_P(TYPE) (TREE_CODE_CLASS (TREE_CODE (TYPE)) == 't') 502 503 /* Define many boolean fields that all tree nodes have. */ 504 505 /* In VAR_DECL nodes, nonzero means address of this is needed. 506 So it cannot be in a register. 507 In a FUNCTION_DECL, nonzero means its address is needed. 508 So it must be compiled even if it is an inline function. 509 In a FIELD_DECL node, it means that the programmer is permitted to 510 construct the address of this field. This is used for aliasing 511 purposes: see record_component_aliases. 512 In CONSTRUCTOR nodes, it means object constructed must be in memory. 513 In LABEL_DECL nodes, it means a goto for this label has been seen 514 from a place outside all binding contours that restore stack levels. 515 In ..._TYPE nodes, it means that objects of this type must 516 be fully addressable. This means that pieces of this 517 object cannot go into register parameters, for example. 518 In IDENTIFIER_NODEs, this means that some extern decl for this name 519 had its address taken. That matters for inline functions. */ 520 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag) 521 522 /* In a VAR_DECL, nonzero means allocate static storage. 523 In a FUNCTION_DECL, nonzero if function has been defined. 524 In a CONSTRUCTOR, nonzero means allocate static storage. */ 525 #define TREE_STATIC(NODE) ((NODE)->common.static_flag) 526 527 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, CLEANUP_STMT, or element of a 528 block's cleanup list, means that the pertinent cleanup should only be 529 executed if an exception is thrown, not on normal exit of its scope. */ 530 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag) 531 532 /* In a CONVERT_EXPR, NOP_EXPR or COMPOUND_EXPR, this means the node was 533 made implicitly and should not lead to an "unused value" warning. */ 534 #define TREE_NO_UNUSED_WARNING(NODE) ((NODE)->common.static_flag) 535 536 /* Nonzero for a TREE_LIST or TREE_VEC node means that the derivation 537 chain is via a `virtual' declaration. */ 538 #define TREE_VIA_VIRTUAL(NODE) ((NODE)->common.static_flag) 539 540 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means 541 there was an overflow in folding. This is distinct from 542 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows 543 occur in constant expressions. */ 544 #define TREE_CONSTANT_OVERFLOW(NODE) ((NODE)->common.static_flag) 545 546 /* In an IDENTIFIER_NODE, this means that assemble_name was called with 547 this string as an argument. */ 548 #define TREE_SYMBOL_REFERENCED(NODE) \ 549 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag) 550 551 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means 552 there was an overflow in folding, and no warning has been issued 553 for this subexpression. TREE_OVERFLOW implies 554 TREE_CONSTANT_OVERFLOW, but not vice versa. */ 555 #define TREE_OVERFLOW(NODE) ((NODE)->common.public_flag) 556 557 /* In a VAR_DECL or FUNCTION_DECL, 558 nonzero means name is to be accessible from outside this module. 559 In an IDENTIFIER_NODE, nonzero means an external declaration 560 accessible from outside this module was previously seen 561 for this name in an inner scope. */ 562 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag) 563 564 /* In any expression, nonzero means it has side effects or reevaluation 565 of the whole expression could produce a different value. 566 This is set if any subexpression is a function call, a side effect 567 or a reference to a volatile variable. 568 In a ..._DECL, this is set only if the declaration said `volatile'. */ 569 #define TREE_SIDE_EFFECTS(NODE) ((NODE)->common.side_effects_flag) 570 571 /* Nonzero means this expression is volatile in the C sense: 572 its address should be of type `volatile WHATEVER *'. 573 In other words, the declared item is volatile qualified. 574 This is used in _DECL nodes and _REF nodes. 575 576 In a ..._TYPE node, means this type is volatile-qualified. 577 But use TYPE_VOLATILE instead of this macro when the node is a type, 578 because eventually we may make that a different bit. 579 580 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ 581 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag) 582 583 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, 584 nonzero means it may not be the lhs of an assignment. 585 In a ..._TYPE node, means this type is const-qualified 586 (but the macro TYPE_READONLY should be used instead of this macro 587 when the node is a type). */ 588 #define TREE_READONLY(NODE) ((NODE)->common.readonly_flag) 589 590 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */ 591 #define TREE_READONLY_DECL_P(NODE) (TREE_READONLY (NODE) && DECL_P (NODE)) 592 593 /* Value of expression is constant. 594 Always appears in all ..._CST nodes. 595 May also appear in an arithmetic expression, an ADDR_EXPR or a CONSTRUCTOR 596 if the value is constant. */ 597 #define TREE_CONSTANT(NODE) ((NODE)->common.constant_flag) 598 599 /* In INTEGER_TYPE or ENUMERAL_TYPE nodes, means an unsigned type. 600 In FIELD_DECL nodes, means an unsigned bit field. */ 601 #define TREE_UNSIGNED(NODE) ((NODE)->common.unsigned_flag) 602 603 #define TYPE_TRAP_SIGNED(NODE) \ 604 (flag_trapv && ! TREE_UNSIGNED (TYPE_CHECK (NODE))) 605 606 /* Nonzero in a VAR_DECL means assembler code has been written. 607 Nonzero in a FUNCTION_DECL means that the function has been compiled. 608 This is interesting in an inline function, since it might not need 609 to be compiled separately. 610 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE 611 if the sdb debugging info for the type has been written. 612 In a BLOCK node, nonzero if reorder_blocks has already seen this block. */ 613 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag) 614 615 /* Nonzero in a _DECL if the name is used in its scope. 616 Nonzero in an expr node means inhibit warning if value is unused. 617 In IDENTIFIER_NODEs, this means that some extern decl for this name 618 was used. */ 619 #define TREE_USED(NODE) ((NODE)->common.used_flag) 620 621 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw 622 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */ 623 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag) 624 625 /* In a CALL_EXPR, means that the address of the return slot is part of the 626 argument list. */ 627 #define CALL_EXPR_HAS_RETURN_SLOT_ADDR(NODE) ((NODE)->common.private_flag) 628 629 /* In a CALL_EXPR, means that the call is the jump from a thunk to the 630 thunked-to function. */ 631 #define CALL_FROM_THUNK_P(NODE) ((NODE)->common.protected_flag) 632 633 /* In a type, nonzero means that all objects of the type are guaranteed by the 634 language or front-end to be properly aligned, so we can indicate that a MEM 635 of this type is aligned at least to the alignment of the type, even if it 636 doesn't appear that it is. We see this, for example, in object-oriented 637 languages where a tag field may show this is an object of a more-aligned 638 variant of the more generic type. */ 639 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag) 640 641 /* Used in classes in C++. */ 642 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag) 643 /* Used in classes in C++. 644 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */ 645 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag) 646 647 /* Nonzero in an IDENTIFIER_NODE if the use of the name is defined as a 648 deprecated feature by __attribute__((deprecated)). */ 649 #define TREE_DEPRECATED(NODE) ((NODE)->common.deprecated_flag) 650 651 /* These flags are available for each language front end to use internally. */ 652 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0) 653 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1) 654 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2) 655 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3) 656 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4) 657 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5) 658 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6) 659 660 /* Define additional fields and accessors for nodes representing constants. */ 661 662 /* In an INTEGER_CST node. These two together make a 2-word integer. 663 If the data type is signed, the value is sign-extended to 2 words 664 even though not all of them may really be in use. 665 In an unsigned constant shorter than 2 words, the extra bits are 0. */ 666 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) 667 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) 668 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) 669 670 #define INT_CST_LT(A, B) \ 671 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ 672 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ 673 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 674 675 #define INT_CST_LT_UNSIGNED(A, B) \ 676 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 677 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 678 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 679 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 680 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 681 682 struct tree_int_cst GTY(()) 683 { 684 struct tree_common common; 685 /* A sub-struct is necessary here because the function `const_hash' 686 wants to scan both words as a unit and taking the address of the 687 sub-struct yields the properly inclusive bounded pointer. */ 688 struct tree_int_cst_lowhi { 689 unsigned HOST_WIDE_INT low; 690 HOST_WIDE_INT high; 691 } int_cst; 692 }; 693 694 /* In a REAL_CST node. struct real_value is an opaque entity, with 695 manipulators defined in real.h. We don't want tree.h depending on 696 real.h and transitively on tm.h. */ 697 struct real_value; 698 699 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) 700 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) 701 702 struct tree_real_cst GTY(()) 703 { 704 struct tree_common common; 705 struct real_value * real_cst_ptr; 706 }; 707 708 /* In a STRING_CST */ 709 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) 710 #define TREE_STRING_POINTER(NODE) (STRING_CST_CHECK (NODE)->string.pointer) 711 712 struct tree_string GTY(()) 713 { 714 struct tree_common common; 715 int length; 716 const char *pointer; 717 }; 718 719 /* In a COMPLEX_CST node. */ 720 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) 721 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) 722 723 struct tree_complex GTY(()) 724 { 725 struct tree_common common; 726 tree real; 727 tree imag; 728 }; 729 730 /* In a VECTOR_CST node. */ 731 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) 732 733 struct tree_vector GTY(()) 734 { 735 struct tree_common common; 736 tree elements; 737 }; 738 739 #include "hashtable.h" 740 741 /* Define fields and accessors for some special-purpose tree nodes. */ 742 743 #define IDENTIFIER_LENGTH(NODE) \ 744 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) 745 #define IDENTIFIER_POINTER(NODE) \ 746 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) 747 #define IDENTIFIER_HASH_VALUE(NODE) \ 748 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) 749 750 /* Translate a hash table identifier pointer to a tree_identifier 751 pointer, and vice versa. */ 752 753 #define HT_IDENT_TO_GCC_IDENT(NODE) \ 754 ((tree) ((char *) (NODE) - sizeof (struct tree_common))) 755 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) 756 757 struct tree_identifier GTY(()) 758 { 759 struct tree_common common; 760 struct ht_identifier id; 761 }; 762 763 /* In a TREE_LIST node. */ 764 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) 765 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) 766 767 struct tree_list GTY(()) 768 { 769 struct tree_common common; 770 tree purpose; 771 tree value; 772 }; 773 774 /* In a TREE_VEC node. */ 775 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) 776 #define TREE_VEC_END(NODE) \ 777 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) 778 779 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) 780 781 struct tree_vec GTY(()) 782 { 783 struct tree_common common; 784 int length; 785 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; 786 }; 787 788 /* Define fields and accessors for some nodes that represent expressions. */ 789 790 /* In a SAVE_EXPR node. */ 791 #define SAVE_EXPR_CONTEXT(NODE) TREE_OPERAND_CHECK_CODE (NODE, SAVE_EXPR, 1) 792 #define SAVE_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, SAVE_EXPR, 2) 793 794 #define SAVE_EXPR_NOPLACEHOLDER(NODE) TREE_UNSIGNED (SAVE_EXPR_CHECK (NODE)) 795 /* Nonzero if the SAVE_EXPRs value should be kept, even if it occurs 796 both in normal code and in a handler. (Normally, in a handler, all 797 SAVE_EXPRs are unsaved, meaning that their values are 798 recalculated.) */ 799 #define SAVE_EXPR_PERSISTENT_P(NODE) TREE_ASM_WRITTEN (SAVE_EXPR_CHECK (NODE)) 800 801 /* In a RTL_EXPR node. */ 802 #define RTL_EXPR_SEQUENCE(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 0) 803 #define RTL_EXPR_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 1) 804 #define RTL_EXPR_ALT_RTL(NODE) TREE_RTL_OPERAND_CHECK (NODE, RTL_EXPR, 2) 805 806 /* In a WITH_CLEANUP_EXPR node. */ 807 #define WITH_CLEANUP_EXPR_RTL(NODE) \ 808 TREE_RTL_OPERAND_CHECK (NODE, WITH_CLEANUP_EXPR, 2) 809 810 /* In a CONSTRUCTOR node. */ 811 #define CONSTRUCTOR_ELTS(NODE) TREE_OPERAND_CHECK_CODE (NODE, CONSTRUCTOR, 0) 812 813 /* In ordinary expression nodes. */ 814 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) 815 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity) 816 817 /* In a LABELED_BLOCK_EXPR node. */ 818 #define LABELED_BLOCK_LABEL(NODE) \ 819 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 0) 820 #define LABELED_BLOCK_BODY(NODE) \ 821 TREE_OPERAND_CHECK_CODE (NODE, LABELED_BLOCK_EXPR, 1) 822 823 /* In an EXIT_BLOCK_EXPR node. */ 824 #define EXIT_BLOCK_LABELED_BLOCK(NODE) \ 825 TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 0) 826 #define EXIT_BLOCK_RETURN(NODE) TREE_OPERAND_CHECK_CODE (NODE, EXIT_BLOCK_EXPR, 1) 827 828 /* In a LOOP_EXPR node. */ 829 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) 830 831 /* In an EXPR_WITH_FILE_LOCATION node. */ 832 #define EXPR_WFL_EMIT_LINE_NOTE(NODE) \ 833 (EXPR_WITH_FILE_LOCATION_CHECK (NODE)->common.public_flag) 834 #define EXPR_WFL_NODE(NODE) \ 835 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 0) 836 #define EXPR_WFL_FILENAME_NODE(NODE) \ 837 TREE_OPERAND_CHECK_CODE (NODE, EXPR_WITH_FILE_LOCATION, 1) 838 #define EXPR_WFL_FILENAME(NODE) \ 839 IDENTIFIER_POINTER (EXPR_WFL_FILENAME_NODE (NODE)) 840 /* ??? Java uses this in all expressions. */ 841 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity) 842 #define EXPR_WFL_LINENO(NODE) (EXPR_WFL_LINECOL (NODE) >> 12) 843 #define EXPR_WFL_COLNO(NODE) (EXPR_WFL_LINECOL (NODE) & 0xfff) 844 #define EXPR_WFL_SET_LINECOL(NODE, LINE, COL) \ 845 (EXPR_WFL_LINECOL(NODE) = ((LINE) << 12) | ((COL) & 0xfff)) 846 847 /* In a TARGET_EXPR node. */ 848 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) 849 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) 850 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) 851 852 struct tree_exp GTY(()) 853 { 854 struct tree_common common; 855 int complexity; 856 tree GTY ((special ("tree_exp"), 857 desc ("TREE_CODE ((tree) &%0)"))) 858 operands[1]; 859 }; 860 861 /* In a BLOCK node. */ 862 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) 863 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) 864 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) 865 /* Note: when changing this, make sure to find the places 866 that use chainon or nreverse. */ 867 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE)) 868 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) 869 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) 870 871 /* Nonzero means that this block is prepared to handle exceptions 872 listed in the BLOCK_VARS slot. */ 873 #define BLOCK_HANDLER_BLOCK(NODE) \ 874 (BLOCK_CHECK (NODE)->block.handler_block_flag) 875 876 /* An index number for this block. These values are not guaranteed to 877 be unique across functions -- whether or not they are depends on 878 the debugging output format in use. */ 879 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) 880 881 /* If block reordering splits a lexical block into discontiguous 882 address ranges, we'll make a copy of the original block. 883 884 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. 885 In that case, we have one source block that has been replicated 886 (through inlining or unrolling) into many logical blocks, and that 887 these logical blocks have different physical variables in them. 888 889 In this case, we have one logical block split into several 890 non-contiguous address ranges. Most debug formats can't actually 891 represent this idea directly, so we fake it by creating multiple 892 logical blocks with the same variables in them. However, for those 893 that do support non-contiguous regions, these allow the original 894 logical block to be reconstructed, along with the set of address 895 ranges. 896 897 One of the logical block fragments is arbitrarily chosen to be 898 the ORIGIN. The other fragments will point to the origin via 899 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer 900 be null. The list of fragments will be chained through 901 BLOCK_FRAGMENT_CHAIN from the origin. */ 902 903 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) 904 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) 905 906 struct tree_block GTY(()) 907 { 908 struct tree_common common; 909 910 unsigned handler_block_flag : 1; 911 unsigned abstract_flag : 1; 912 unsigned block_num : 30; 913 914 tree vars; 915 tree subblocks; 916 tree supercontext; 917 tree abstract_origin; 918 tree fragment_origin; 919 tree fragment_chain; 920 }; 921 922 /* Define fields and accessors for nodes representing data types. */ 923 924 /* See tree.def for documentation of the use of these fields. 925 Look at the documentation of the various ..._TYPE tree codes. */ 926 927 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid) 928 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size) 929 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit) 930 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode) 931 #define TYPE_VALUES(NODE) (TYPE_CHECK (NODE)->type.values) 932 #define TYPE_DOMAIN(NODE) (TYPE_CHECK (NODE)->type.values) 933 #define TYPE_FIELDS(NODE) (TYPE_CHECK (NODE)->type.values) 934 #define TYPE_METHODS(NODE) (TYPE_CHECK (NODE)->type.maxval) 935 #define TYPE_VFIELD(NODE) (TYPE_CHECK (NODE)->type.minval) 936 #define TYPE_ARG_TYPES(NODE) (TYPE_CHECK (NODE)->type.values) 937 #define TYPE_METHOD_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) 938 #define TYPE_OFFSET_BASETYPE(NODE) (TYPE_CHECK (NODE)->type.maxval) 939 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to) 940 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to) 941 #define TYPE_MIN_VALUE(NODE) (TYPE_CHECK (NODE)->type.minval) 942 #define TYPE_MAX_VALUE(NODE) (TYPE_CHECK (NODE)->type.maxval) 943 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision) 944 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address) 945 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer) 946 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die) 947 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name) 948 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant) 949 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant) 950 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context) 951 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific) 952 953 /* For a VECTOR_TYPE node, this describes a different type which is emitted 954 in the debugging output. We use this to describe a vector as a 955 structure containing an array. */ 956 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (TYPE_CHECK (NODE)->type.values) 957 958 /* For aggregate types, information about this type, as a base type 959 for itself. Used in a language-dependent way for types that are 960 neither a RECORD_TYPE, QUAL_UNION_TYPE, nor a UNION_TYPE. */ 961 #define TYPE_BINFO(NODE) (TYPE_CHECK (NODE)->type.binfo) 962 963 /* The (language-specific) typed-based alias set for this type. 964 Objects whose TYPE_ALIAS_SETs are different cannot alias each 965 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been 966 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this 967 type can alias objects of any type. */ 968 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set) 969 970 /* Nonzero iff the typed-based alias set for this type has been 971 calculated. */ 972 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1) 973 974 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply 975 to this type. */ 976 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes) 977 978 /* The alignment necessary for objects of this type. 979 The value is an int, measured in bits. */ 980 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align) 981 982 /* 1 if the alignment for this type was requested by "aligned" attribute, 983 0 if it is the default for this type. */ 984 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align) 985 986 /* The alignment for NODE, in bytes. */ 987 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) 988 989 /* If your language allows you to declare types, and you want debug info 990 for them, then you need to generate corresponding TYPE_DECL nodes. 991 These "stub" TYPE_DECL nodes have no name, and simply point at the 992 type node. You then set the TYPE_STUB_DECL field of the type node 993 to point back at the TYPE_DECL node. This allows the debug routines 994 to know that the two nodes represent the same type, so that we only 995 get one debug info record for them. */ 996 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) 997 998 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type 999 has BLKmode only because it lacks the alignment requirement for 1000 its size. */ 1001 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag) 1002 1003 /* In an INTEGER_TYPE, it means the type represents a size. We use 1004 this both for validity checking and to permit optimizations that 1005 are unsafe for other types. Note that the C `size_t' type should 1006 *not* have this flag set. The `size_t' type is simply a typedef 1007 for an ordinary integer type that happens to be the type of an 1008 expression returned by `sizeof'; `size_t' has no special 1009 properties. Expressions whose type have TYPE_IS_SIZETYPE set are 1010 always actual sizes. */ 1011 #define TYPE_IS_SIZETYPE(NODE) \ 1012 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag) 1013 1014 /* In a FUNCTION_TYPE, indicates that the function returns with the stack 1015 pointer depressed. */ 1016 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \ 1017 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag) 1018 1019 /* Nonzero in a type considered volatile as a whole. */ 1020 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag) 1021 1022 /* Means this type is const-qualified. */ 1023 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag) 1024 1025 /* If nonzero, this type is `restrict'-qualified, in the C sense of 1026 the term. */ 1027 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag) 1028 1029 /* There is a TYPE_QUAL value for each type qualifier. They can be 1030 combined by bitwise-or to form the complete set of qualifiers for a 1031 type. */ 1032 1033 #define TYPE_UNQUALIFIED 0x0 1034 #define TYPE_QUAL_CONST 0x1 1035 #define TYPE_QUAL_VOLATILE 0x2 1036 #define TYPE_QUAL_RESTRICT 0x4 1037 1038 /* The set of type qualifiers for this type. */ 1039 #define TYPE_QUALS(NODE) \ 1040 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 1041 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 1042 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)) 1043 1044 /* These flags are available for each language front end to use internally. */ 1045 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0) 1046 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1) 1047 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2) 1048 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3) 1049 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4) 1050 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5) 1051 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6) 1052 1053 /* If set in an ARRAY_TYPE, indicates a string type (for languages 1054 that distinguish string from array of char). 1055 If set in a SET_TYPE, indicates a bitstring type. */ 1056 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag) 1057 1058 /* If non-NULL, this is an upper bound of the size (in bytes) of an 1059 object of the given ARRAY_TYPE. This allows temporaries to be 1060 allocated. */ 1061 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ 1062 TYPE_MAX_VALUE (ARRAY_TYPE_CHECK (ARRAY_TYPE)) 1063 1064 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ 1065 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ 1066 GET_MODE_NUNITS (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.mode) 1067 1068 /* Indicates that objects of this type must be initialized by calling a 1069 function when they are created. */ 1070 #define TYPE_NEEDS_CONSTRUCTING(NODE) \ 1071 (TYPE_CHECK (NODE)->type.needs_constructing_flag) 1072 1073 /* Indicates that objects of this type (a UNION_TYPE), should be passed 1074 the same way that the first union alternative would be passed. */ 1075 #define TYPE_TRANSPARENT_UNION(NODE) \ 1076 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag) 1077 1078 /* For an ARRAY_TYPE, indicates that it is not permitted to 1079 take the address of a component of the type. */ 1080 #define TYPE_NONALIASED_COMPONENT(NODE) \ 1081 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag) 1082 1083 /* Indicated that objects of this type should be laid out in as 1084 compact a way as possible. */ 1085 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag) 1086 1087 struct die_struct; 1088 1089 struct tree_type GTY(()) 1090 { 1091 struct tree_common common; 1092 tree values; 1093 tree size; 1094 tree size_unit; 1095 tree attributes; 1096 unsigned int uid; 1097 1098 unsigned int precision : 9; 1099 ENUM_BITFIELD(machine_mode) mode : 7; 1100 1101 unsigned string_flag : 1; 1102 unsigned no_force_blk_flag : 1; 1103 unsigned needs_constructing_flag : 1; 1104 unsigned transparent_union_flag : 1; 1105 unsigned packed_flag : 1; 1106 unsigned restrict_flag : 1; 1107 unsigned spare : 2; 1108 1109 unsigned lang_flag_0 : 1; 1110 unsigned lang_flag_1 : 1; 1111 unsigned lang_flag_2 : 1; 1112 unsigned lang_flag_3 : 1; 1113 unsigned lang_flag_4 : 1; 1114 unsigned lang_flag_5 : 1; 1115 unsigned lang_flag_6 : 1; 1116 unsigned user_align : 1; 1117 1118 unsigned int align; 1119 tree pointer_to; 1120 tree reference_to; 1121 union tree_type_symtab { 1122 int GTY ((tag ("0"))) address; 1123 char * GTY ((tag ("1"))) pointer; 1124 struct die_struct * GTY ((tag ("2"))) die; 1125 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"), 1126 descbits ("2"))) symtab; 1127 tree name; 1128 tree minval; 1129 tree maxval; 1130 tree next_variant; 1131 tree main_variant; 1132 tree binfo; 1133 tree context; 1134 HOST_WIDE_INT alias_set; 1135 /* Points to a structure whose details depend on the language in use. */ 1136 struct lang_type *lang_specific; 1137 }; 1138 1139 /* Define accessor macros for information about type inheritance 1140 and basetypes. 1141 1142 A "basetype" means a particular usage of a data type for inheritance 1143 in another type. Each such basetype usage has its own "binfo" 1144 object to describe it. The binfo object is a TREE_VEC node. 1145 1146 Inheritance is represented by the binfo nodes allocated for a 1147 given type. For example, given types C and D, such that D is 1148 inherited by C, 3 binfo nodes will be allocated: one for describing 1149 the binfo properties of C, similarly one for D, and one for 1150 describing the binfo properties of D as a base type for C. 1151 Thus, given a pointer to class C, one can get a pointer to the binfo 1152 of D acting as a basetype for C by looking at C's binfo's basetypes. */ 1153 1154 /* The actual data type node being inherited in this basetype. */ 1155 #define BINFO_TYPE(NODE) TREE_TYPE (NODE) 1156 1157 /* The offset where this basetype appears in its containing type. 1158 BINFO_OFFSET slot holds the offset (in bytes) 1159 from the base of the complete object to the base of the part of the 1160 object that is allocated on behalf of this `type'. 1161 This is always 0 except when there is multiple inheritance. */ 1162 1163 #define BINFO_OFFSET(NODE) TREE_VEC_ELT ((NODE), 1) 1164 #define TYPE_BINFO_OFFSET(NODE) BINFO_OFFSET (TYPE_BINFO (NODE)) 1165 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) 1166 1167 /* The virtual function table belonging to this basetype. Virtual 1168 function tables provide a mechanism for run-time method dispatching. 1169 The entries of a virtual function table are language-dependent. */ 1170 1171 #define BINFO_VTABLE(NODE) TREE_VEC_ELT ((NODE), 2) 1172 #define TYPE_BINFO_VTABLE(NODE) BINFO_VTABLE (TYPE_BINFO (NODE)) 1173 1174 /* The virtual functions in the virtual function table. This is 1175 a TREE_LIST that is used as an initial approximation for building 1176 a virtual function table for this basetype. */ 1177 #define BINFO_VIRTUALS(NODE) TREE_VEC_ELT ((NODE), 3) 1178 #define TYPE_BINFO_VIRTUALS(NODE) BINFO_VIRTUALS (TYPE_BINFO (NODE)) 1179 1180 /* A vector of binfos for the direct basetypes inherited by this 1181 basetype. 1182 1183 If this basetype describes type D as inherited in C, and if the 1184 basetypes of D are E and F, then this vector contains binfos for 1185 inheritance of E and F by C. 1186 1187 ??? This could probably be done by just allocating the 1188 base types at the end of this TREE_VEC (instead of using 1189 another TREE_VEC). This would simplify the calculation 1190 of how many basetypes a given type had. */ 1191 #define BINFO_BASETYPES(NODE) TREE_VEC_ELT ((NODE), 4) 1192 #define TYPE_BINFO_BASETYPES(NODE) TREE_VEC_ELT (TYPE_BINFO (NODE), 4) 1193 1194 /* The number of basetypes for NODE. */ 1195 #define BINFO_N_BASETYPES(NODE) \ 1196 (BINFO_BASETYPES (NODE) ? TREE_VEC_LENGTH (BINFO_BASETYPES (NODE)) : 0) 1197 1198 /* Accessor macro to get to the Nth basetype of this basetype. */ 1199 #define BINFO_BASETYPE(NODE,N) TREE_VEC_ELT (BINFO_BASETYPES (NODE), (N)) 1200 #define TYPE_BINFO_BASETYPE(NODE,N) \ 1201 BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (NODE)), (N))) 1202 1203 /* For a BINFO record describing a virtual base class, i.e., one where 1204 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual 1205 base. The actual contents are language-dependent. In the C++ 1206 front-end this field is an INTEGER_CST giving an offset into the 1207 vtable where the offset to the virtual base can be found. */ 1208 #define BINFO_VPTR_FIELD(NODE) TREE_VEC_ELT (NODE, 5) 1209 1210 /* Indicates the accesses this binfo has to its bases. The values are 1211 access_public_node, access_protected_node or access_private_node. 1212 If this array is not present, public access is implied. */ 1213 #define BINFO_BASEACCESSES(NODE) TREE_VEC_ELT ((NODE), 6) 1214 #define BINFO_BASEACCESS(NODE,N) TREE_VEC_ELT (BINFO_BASEACCESSES(NODE), (N)) 1215 1216 /* Number of language independent elements in a binfo. Languages may 1217 add additional trailing elements. */ 1218 1219 #define BINFO_ELTS 7 1220 1221 /* Slot used to build a chain that represents a use of inheritance. 1222 For example, if X is derived from Y, and Y is derived from Z, 1223 then this field can be used to link the binfo node for X to 1224 the binfo node for X's Y to represent the use of inheritance 1225 from X to Y. Similarly, this slot of the binfo node for X's Y 1226 can point to the Z from which Y is inherited (in X's inheritance 1227 hierarchy). In this fashion, one can represent and traverse specific 1228 uses of inheritance using the binfo nodes themselves (instead of 1229 consing new space pointing to binfo nodes). 1230 It is up to the language-dependent front-ends to maintain 1231 this information as necessary. */ 1232 #define BINFO_INHERITANCE_CHAIN(NODE) TREE_VEC_ELT ((NODE), 0) 1233 1234 /* Define fields and accessors for nodes representing declared names. */ 1235 1236 /* Nonzero if DECL represents a decl. */ 1237 #define DECL_P(DECL) (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'd') 1238 1239 /* This is the name of the object as written by the user. 1240 It is an IDENTIFIER_NODE. */ 1241 #define DECL_NAME(NODE) (DECL_CHECK (NODE)->decl.name) 1242 1243 /* The name of the object as the assembler will see it (but before any 1244 translations made by ASM_OUTPUT_LABELREF). Often this is the same 1245 as DECL_NAME. It is an IDENTIFIER_NODE. */ 1246 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) 1247 1248 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, 1249 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set 1250 yet. */ 1251 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ 1252 (DECL_CHECK (NODE)->decl.assembler_name != NULL_TREE) 1253 1254 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ 1255 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ 1256 (DECL_CHECK (NODE)->decl.assembler_name = (NAME)) 1257 1258 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's 1259 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause 1260 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the 1261 semantics of using this macro, are different than saying: 1262 1263 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) 1264 1265 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ 1266 1267 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ 1268 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ 1269 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ 1270 DECL_ASSEMBLER_NAME (DECL1)) \ 1271 : (void) 0) 1272 1273 /* Records the section name in a section attribute. Used to pass 1274 the name from decl_attributes to make_function_rtl and make_decl_rtl. */ 1275 #define DECL_SECTION_NAME(NODE) (DECL_CHECK (NODE)->decl.section_name) 1276 1277 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or 1278 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, 1279 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this 1280 points to either the FUNCTION_DECL for the containing function, 1281 the RECORD_TYPE or UNION_TYPE for the containing type, or 1282 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file 1283 scope". */ 1284 #define DECL_CONTEXT(NODE) (DECL_CHECK (NODE)->decl.context) 1285 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.context) 1286 /* In a DECL this is the field where attributes are stored. */ 1287 #define DECL_ATTRIBUTES(NODE) (DECL_CHECK (NODE)->decl.attributes) 1288 /* In a FIELD_DECL, this is the field position, counting in bytes, of the 1289 byte containing the bit closest to the beginning of the structure. */ 1290 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.arguments) 1291 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the 1292 field from DECL_FIELD_OFFSET. */ 1293 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->decl.u2.t) 1294 /* In a FIELD_DECL, this indicates whether the field was a bit-field and 1295 if so, the type that was originally specified for it. 1296 TREE_TYPE may have been modified (in finish_struct). */ 1297 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->decl.result) 1298 /* In FUNCTION_DECL, a chain of ..._DECL nodes. 1299 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific 1300 uses. */ 1301 #define DECL_ARGUMENTS(NODE) (DECL_CHECK (NODE)->decl.arguments) 1302 /* This field is used to reference anything in decl.result and is meant only 1303 for use by the garbage collector. */ 1304 #define DECL_RESULT_FLD(NODE) (DECL_CHECK (NODE)->decl.result) 1305 /* In FUNCTION_DECL, holds the decl for the return value. */ 1306 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.result) 1307 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ 1308 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl.result) 1309 /* In PARM_DECL, holds the type as written (perhaps a function or array). */ 1310 #define DECL_ARG_TYPE_AS_WRITTEN(NODE) (PARM_DECL_CHECK (NODE)->decl.result) 1311 /* For a FUNCTION_DECL, holds the tree of BINDINGs. 1312 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. 1313 For a VAR_DECL, holds the initial value. 1314 For a PARM_DECL, not used--default 1315 values for parameters are encoded in the type of the function, 1316 not in the PARM_DECL slot. */ 1317 #define DECL_INITIAL(NODE) (DECL_CHECK (NODE)->decl.initial) 1318 /* For a PARM_DECL, records the data type used to pass the argument, 1319 which may be different from the type seen in the program. */ 1320 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl.initial) 1321 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which 1322 if nonzero, indicates that the field occupies the type. */ 1323 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->decl.initial) 1324 /* These two fields describe where in the source code the declaration 1325 was. If the declaration appears in several places (as for a C 1326 function that is declared first and then defined later), this 1327 information should refer to the definition. */ 1328 #define DECL_SOURCE_LOCATION(NODE) (DECL_CHECK (NODE)->decl.locus) 1329 #define DECL_SOURCE_FILE(NODE) (DECL_SOURCE_LOCATION (NODE).file) 1330 #define DECL_SOURCE_LINE(NODE) (DECL_SOURCE_LOCATION (NODE).line) 1331 /* Holds the size of the datum, in bits, as a tree expression. 1332 Need not be constant. */ 1333 #define DECL_SIZE(NODE) (DECL_CHECK (NODE)->decl.size) 1334 /* Likewise for the size in bytes. */ 1335 #define DECL_SIZE_UNIT(NODE) (DECL_CHECK (NODE)->decl.size_unit) 1336 /* Holds the alignment required for the datum, in bits. */ 1337 #define DECL_ALIGN(NODE) (DECL_CHECK (NODE)->decl.u1.a.align) 1338 /* The alignment of NODE, in bytes. */ 1339 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) 1340 /* For FIELD_DECLs, off_align holds the number of low-order bits of 1341 DECL_FIELD_OFFSET which are known to be always zero. 1342 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET 1343 has. */ 1344 #define DECL_OFFSET_ALIGN(NODE) \ 1345 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align) 1346 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ 1347 #define SET_DECL_OFFSET_ALIGN(NODE, X) \ 1348 (FIELD_DECL_CHECK (NODE)->decl.u1.a.off_align = exact_log2 ((X) & -(X))) 1349 /* 1 if the alignment for this type was requested by "aligned" attribute, 1350 0 if it is the default for this type. */ 1351 #define DECL_USER_ALIGN(NODE) (DECL_CHECK (NODE)->decl.user_align) 1352 /* Holds the machine mode corresponding to the declaration of a variable or 1353 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a 1354 FIELD_DECL. */ 1355 #define DECL_MODE(NODE) (DECL_CHECK (NODE)->decl.mode) 1356 /* Holds the RTL expression for the value of a variable or function. 1357 This value can be evaluated lazily for functions, variables with 1358 static storage duration, and labels. */ 1359 #define DECL_RTL(NODE) \ 1360 (DECL_CHECK (NODE)->decl.rtl \ 1361 ? (NODE)->decl.rtl \ 1362 : (make_decl_rtl (NODE, NULL), (NODE)->decl.rtl)) 1363 /* Set the DECL_RTL for NODE to RTL. */ 1364 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) 1365 /* Returns nonzero if the DECL_RTL for NODE has already been set. */ 1366 #define DECL_RTL_SET_P(NODE) (DECL_CHECK (NODE)->decl.rtl != NULL) 1367 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for 1368 NODE1, it will not be set for NODE2; this is a lazy copy. */ 1369 #define COPY_DECL_RTL(NODE1, NODE2) \ 1370 (DECL_CHECK (NODE2)->decl.rtl = DECL_CHECK (NODE1)->decl.rtl) 1371 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ 1372 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) 1373 1374 /* For PARM_DECL, holds an RTL for the stack slot or register 1375 where the data was actually passed. */ 1376 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->decl.u2.r) 1377 1378 /* For FUNCTION_DECL, if it is inline, holds the saved insn chain. */ 1379 #define DECL_SAVED_INSNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u2.f) 1380 1381 /* For FUNCTION_DECL, if it is built-in, 1382 this identifies which built-in operation it is. */ 1383 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.u1.f) 1384 1385 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. 1386 Before the struct containing the FUNCTION_DECL is laid out, 1387 DECL_VINDEX may point to a FUNCTION_DECL in a base class which 1388 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual 1389 function. When the class is laid out, this pointer is changed 1390 to an INTEGER_CST node which is suitable for use as an index 1391 into the virtual function table. */ 1392 #define DECL_VINDEX(NODE) (DECL_CHECK (NODE)->decl.vindex) 1393 1394 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in 1395 which this FIELD_DECL is defined. This information is needed when 1396 writing debugging information about vfield and vbase decls for C++. */ 1397 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl.vindex) 1398 1399 /* Every ..._DECL node gets a unique number. */ 1400 #define DECL_UID(NODE) (DECL_CHECK (NODE)->decl.uid) 1401 1402 /* For any sort of a ..._DECL node, this points to the original (abstract) 1403 decl node which this decl is an instance of, or else it is NULL indicating 1404 that this decl is not an instance of some other decl. For example, 1405 in a nested declaration of an inline function, this points back to the 1406 definition. */ 1407 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_CHECK (NODE)->decl.abstract_origin) 1408 1409 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract 1410 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ 1411 #define DECL_ORIGIN(NODE) \ 1412 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) 1413 1414 /* Nonzero for any sort of ..._DECL node means this decl node represents an 1415 inline instance of some original (abstract) decl from an inline function; 1416 suppress any warnings about shadowing some other variable. FUNCTION_DECL 1417 nodes can also have their abstract origin set to themselves. */ 1418 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ 1419 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) 1420 1421 /* Nonzero if a _DECL means that the name of this decl should be ignored 1422 for symbolic debug purposes. */ 1423 #define DECL_IGNORED_P(NODE) (DECL_CHECK (NODE)->decl.ignored_flag) 1424 1425 /* Nonzero for a given ..._DECL node means that this node represents an 1426 "abstract instance" of the given declaration (e.g. in the original 1427 declaration of an inline function). When generating symbolic debugging 1428 information, we mustn't try to generate any address information for nodes 1429 marked as "abstract instances" because we don't actually generate 1430 any code or allocate any data space for such instances. */ 1431 #define DECL_ABSTRACT(NODE) (DECL_CHECK (NODE)->decl.abstract_flag) 1432 1433 /* Nonzero if a _DECL means that no warnings should be generated just 1434 because this decl is unused. */ 1435 #define DECL_IN_SYSTEM_HEADER(NODE) \ 1436 (DECL_CHECK (NODE)->decl.in_system_header_flag) 1437 1438 /* Nonzero for a given ..._DECL node means that this node should be 1439 put in .common, if possible. If a DECL_INITIAL is given, and it 1440 is not error_mark_node, then the decl cannot be put in .common. */ 1441 #define DECL_COMMON(NODE) (DECL_CHECK (NODE)->decl.common_flag) 1442 1443 /* Language-specific decl information. */ 1444 #define DECL_LANG_SPECIFIC(NODE) (DECL_CHECK (NODE)->decl.lang_specific) 1445 1446 /* In a VAR_DECL or FUNCTION_DECL, 1447 nonzero means external reference: 1448 do not allocate storage, and refer to a definition elsewhere. */ 1449 #define DECL_EXTERNAL(NODE) (DECL_CHECK (NODE)->decl.external_flag) 1450 1451 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority 1452 initializations. */ 1453 #define DEFAULT_INIT_PRIORITY 65535 1454 #define MAX_INIT_PRIORITY 65535 1455 #define MAX_RESERVED_INIT_PRIORITY 100 1456 1457 /* In a TYPE_DECL 1458 nonzero means the detail info about this type is not dumped into stabs. 1459 Instead it will generate cross reference ('x') of names. 1460 This uses the same flag as DECL_EXTERNAL. */ 1461 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ 1462 (TYPE_DECL_CHECK (NODE)->decl.external_flag) 1463 1464 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ 1465 #define DECL_REGISTER(NODE) (DECL_CHECK (NODE)->decl.regdecl_flag) 1466 1467 /* In LABEL_DECL nodes, nonzero means that an error message about 1468 jumping into such a binding contour has been printed for this label. */ 1469 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl.regdecl_flag) 1470 1471 /* In a FIELD_DECL, indicates this field should be bit-packed. */ 1472 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl.regdecl_flag) 1473 1474 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a 1475 static chain is not needed. */ 1476 #define DECL_NO_STATIC_CHAIN(NODE) \ 1477 (FUNCTION_DECL_CHECK (NODE)->decl.regdecl_flag) 1478 1479 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. 1480 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. 1481 1482 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. 1483 1484 Also set in some languages for variables, etc., outside the normal 1485 lexical scope, such as class instance variables. */ 1486 #define DECL_NONLOCAL(NODE) (DECL_CHECK (NODE)->decl.nonlocal_flag) 1487 1488 /* Nonzero in a FUNCTION_DECL means this function can be substituted 1489 where it is called. */ 1490 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inline_flag) 1491 1492 /* Nonzero in a FUNCTION_DECL means that this function was declared inline, 1493 such as via the `inline' keyword in C/C++. This flag controls the linkage 1494 semantics of 'inline'; whether or not the function is inlined is 1495 controlled by DECL_INLINE. */ 1496 #define DECL_DECLARED_INLINE_P(NODE) \ 1497 (FUNCTION_DECL_CHECK (NODE)->decl.declared_inline_flag) 1498 1499 /* Value of the decls's visibility attribute */ 1500 #define DECL_VISIBILITY(NODE) (DECL_CHECK (NODE)->decl.visibility) 1501 1502 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ 1503 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.uninlinable) 1504 1505 /* In a VAR_DECL, nonzero if the data should be allocated from 1506 thread-local storage. */ 1507 #define DECL_THREAD_LOCAL(NODE) (VAR_DECL_CHECK (NODE)->decl.thread_local_flag) 1508 1509 /* In a FUNCTION_DECL, the saved representation of the body of the 1510 entire function. Usually a COMPOUND_STMT, but in C++ this may also 1511 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */ 1512 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.saved_tree) 1513 1514 /* List of FUNCTION_DECLs inlined into this function's body. */ 1515 #define DECL_INLINED_FNS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.inlined_fns) 1516 1517 /* Nonzero in a FUNCTION_DECL means this function should be treated 1518 as if it were a malloc, meaning it returns a pointer that is 1519 not an alias. */ 1520 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.malloc_flag) 1521 1522 /* Nonzero in a FUNCTION_DECL means this function should be treated 1523 as "pure" function (like const function, but may read global memory). */ 1524 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl.pure_flag) 1525 1526 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed 1527 specially. */ 1528 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl.bit_field_flag) 1529 1530 /* In a LABEL_DECL, nonzero means label was defined inside a binding 1531 contour that restored a stack level and which is now exited. */ 1532 #define DECL_TOO_LATE(NODE) (LABEL_DECL_CHECK (NODE)->decl.bit_field_flag) 1533 1534 /* Unused in FUNCTION_DECL. */ 1535 1536 /* In a VAR_DECL that's static, 1537 nonzero if the space is in the text section. */ 1538 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl.bit_field_flag) 1539 1540 /* In a FUNCTION_DECL, nonzero means a built in function. */ 1541 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) 1542 1543 /* For a builtin function, identify which part of the compiler defined it. */ 1544 #define DECL_BUILT_IN_CLASS(NODE) \ 1545 (FUNCTION_DECL_CHECK (NODE)->decl.built_in_class) 1546 1547 /* Used in VAR_DECLs to indicate that the variable is a vtable. 1548 Used in FIELD_DECLs for vtable pointers. 1549 Used in FUNCTION_DECLs to indicate that the function is virtual. */ 1550 #define DECL_VIRTUAL_P(NODE) (DECL_CHECK (NODE)->decl.virtual_flag) 1551 1552 /* Used to indicate that the linkage status of this DECL is not yet known, 1553 so it should not be output now. */ 1554 #define DECL_DEFER_OUTPUT(NODE) (DECL_CHECK (NODE)->decl.defer_output) 1555 1556 /* Used in PARM_DECLs whose type are unions to indicate that the 1557 argument should be passed in the same way that the first union 1558 alternative would be passed. */ 1559 #define DECL_TRANSPARENT_UNION(NODE) \ 1560 (PARM_DECL_CHECK (NODE)->decl.transparent_union) 1561 1562 /* Used in FUNCTION_DECLs to indicate that they should be run automatically 1563 at the beginning or end of execution. */ 1564 #define DECL_STATIC_CONSTRUCTOR(NODE) \ 1565 (FUNCTION_DECL_CHECK (NODE)->decl.static_ctor_flag) 1566 1567 #define DECL_STATIC_DESTRUCTOR(NODE) \ 1568 (FUNCTION_DECL_CHECK (NODE)->decl.static_dtor_flag) 1569 1570 /* Used to indicate that this DECL represents a compiler-generated entity. */ 1571 #define DECL_ARTIFICIAL(NODE) (DECL_CHECK (NODE)->decl.artificial_flag) 1572 1573 /* Used to indicate that this DECL has weak linkage. */ 1574 #define DECL_WEAK(NODE) (DECL_CHECK (NODE)->decl.weak_flag) 1575 1576 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in 1577 multiple translation units should be merged. */ 1578 #define DECL_ONE_ONLY(NODE) (DECL_CHECK (NODE)->decl.transparent_union) 1579 1580 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need 1581 not be put out unless it is needed in this translation unit. 1582 Entities like this are shared across translation units (like weak 1583 entities), but are guaranteed to be generated by any translation 1584 unit that needs them, and therefore need not be put out anywhere 1585 where they are not needed. DECL_COMDAT is just a hint to the 1586 back-end; it is up to front-ends which set this flag to ensure 1587 that there will never be any harm, other than bloat, in putting out 1588 something which is DECL_COMDAT. */ 1589 #define DECL_COMDAT(NODE) (DECL_CHECK (NODE)->decl.comdat_flag) 1590 1591 /* Used in FUNCTION_DECLs to indicate that function entry and exit should 1592 be instrumented with calls to support routines. */ 1593 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ 1594 (FUNCTION_DECL_CHECK (NODE)->decl.no_instrument_function_entry_exit) 1595 1596 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be 1597 disabled in this function. */ 1598 #define DECL_NO_LIMIT_STACK(NODE) \ 1599 (FUNCTION_DECL_CHECK (NODE)->decl.no_limit_stack) 1600 1601 /* Additional flags for language-specific uses. */ 1602 #define DECL_LANG_FLAG_0(NODE) (DECL_CHECK (NODE)->decl.lang_flag_0) 1603 #define DECL_LANG_FLAG_1(NODE) (DECL_CHECK (NODE)->decl.lang_flag_1) 1604 #define DECL_LANG_FLAG_2(NODE) (DECL_CHECK (NODE)->decl.lang_flag_2) 1605 #define DECL_LANG_FLAG_3(NODE) (DECL_CHECK (NODE)->decl.lang_flag_3) 1606 #define DECL_LANG_FLAG_4(NODE) (DECL_CHECK (NODE)->decl.lang_flag_4) 1607 #define DECL_LANG_FLAG_5(NODE) (DECL_CHECK (NODE)->decl.lang_flag_5) 1608 #define DECL_LANG_FLAG_6(NODE) (DECL_CHECK (NODE)->decl.lang_flag_6) 1609 #define DECL_LANG_FLAG_7(NODE) (DECL_CHECK (NODE)->decl.lang_flag_7) 1610 1611 /* Used to indicate that the pointer to this DECL cannot be treated as 1612 an address constant. */ 1613 #define DECL_NON_ADDR_CONST_P(NODE) (DECL_CHECK (NODE)->decl.non_addr_const_p) 1614 1615 /* Used in a FIELD_DECL to indicate that we cannot form the address of 1616 this component. */ 1617 #define DECL_NONADDRESSABLE_P(NODE) \ 1618 (FIELD_DECL_CHECK (NODE)->decl.non_addressable) 1619 1620 /* Used to indicate an alias set for the memory pointed to by this 1621 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have 1622 pointer (or reference) type. */ 1623 #define DECL_POINTER_ALIAS_SET(NODE) \ 1624 (DECL_CHECK (NODE)->decl.pointer_alias_set) 1625 1626 /* Nonzero if an alias set has been assigned to this declaration. */ 1627 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \ 1628 (DECL_POINTER_ALIAS_SET (NODE) != - 1) 1629 1630 /* Nonzero for a decl which is at file scope. */ 1631 #define DECL_FILE_SCOPE_P(EXP) \ 1632 (! DECL_CONTEXT (EXP) \ 1633 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL) 1634 1635 /* Enumerate visibility settings. */ 1636 1637 enum symbol_visibility 1638 { 1639 VISIBILITY_DEFAULT, 1640 VISIBILITY_INTERNAL, 1641 VISIBILITY_HIDDEN, 1642 VISIBILITY_PROTECTED 1643 }; 1644 1645 struct function; 1646 1647 struct tree_decl GTY(()) 1648 { 1649 struct tree_common common; 1650 location_t locus; 1651 unsigned int uid; 1652 tree size; 1653 ENUM_BITFIELD(machine_mode) mode : 8; 1654 1655 unsigned external_flag : 1; 1656 unsigned nonlocal_flag : 1; 1657 unsigned regdecl_flag : 1; 1658 unsigned inline_flag : 1; 1659 unsigned bit_field_flag : 1; 1660 unsigned virtual_flag : 1; 1661 unsigned ignored_flag : 1; 1662 unsigned abstract_flag : 1; 1663 1664 unsigned in_system_header_flag : 1; 1665 unsigned common_flag : 1; 1666 unsigned defer_output : 1; 1667 unsigned transparent_union : 1; 1668 unsigned static_ctor_flag : 1; 1669 unsigned static_dtor_flag : 1; 1670 unsigned artificial_flag : 1; 1671 unsigned weak_flag : 1; 1672 1673 unsigned non_addr_const_p : 1; 1674 unsigned no_instrument_function_entry_exit : 1; 1675 unsigned comdat_flag : 1; 1676 unsigned malloc_flag : 1; 1677 unsigned no_limit_stack : 1; 1678 ENUM_BITFIELD(built_in_class) built_in_class : 2; 1679 unsigned pure_flag : 1; 1680 1681 unsigned non_addressable : 1; 1682 unsigned user_align : 1; 1683 unsigned uninlinable : 1; 1684 unsigned thread_local_flag : 1; 1685 unsigned declared_inline_flag : 1; 1686 ENUM_BITFIELD(symbol_visibility) visibility : 2; 1687 unsigned unused : 1; 1688 /* one unused bit. */ 1689 1690 unsigned lang_flag_0 : 1; 1691 unsigned lang_flag_1 : 1; 1692 unsigned lang_flag_2 : 1; 1693 unsigned lang_flag_3 : 1; 1694 unsigned lang_flag_4 : 1; 1695 unsigned lang_flag_5 : 1; 1696 unsigned lang_flag_6 : 1; 1697 unsigned lang_flag_7 : 1; 1698 1699 union tree_decl_u1 { 1700 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is 1701 DECL_FUNCTION_CODE. */ 1702 enum built_in_function f; 1703 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this 1704 is used by language-dependent code. */ 1705 HOST_WIDE_INT i; 1706 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for 1707 FUNCTION_DECLs). */ 1708 struct tree_decl_u1_a { 1709 unsigned int align : 24; 1710 unsigned int off_align : 8; 1711 } a; 1712 } GTY ((skip (""))) u1; 1713 1714 tree size_unit; 1715 tree name; 1716 tree context; 1717 tree arguments; /* Also used for DECL_FIELD_OFFSET */ 1718 tree result; /* Also used for DECL_BIT_FIELD_TYPE */ 1719 tree initial; /* Also used for DECL_QUALIFIER */ 1720 tree abstract_origin; 1721 tree assembler_name; 1722 tree section_name; 1723 tree attributes; 1724 rtx rtl; /* RTL representation for object. */ 1725 1726 /* In FUNCTION_DECL, if it is inline, holds the saved insn chain. 1727 In FIELD_DECL, is DECL_FIELD_BIT_OFFSET. 1728 In PARM_DECL, holds an RTL for the stack slot 1729 of register where the data was actually passed. 1730 Used by Chill and Java in LABEL_DECL and by C++ and Java in VAR_DECL. */ 1731 union tree_decl_u2 { 1732 struct function * GTY ((tag ("FUNCTION_DECL"))) f; 1733 rtx GTY ((tag ("PARM_DECL"))) r; 1734 tree GTY ((tag ("FIELD_DECL"))) t; 1735 int GTY ((tag ("VAR_DECL"))) i; 1736 } GTY ((desc ("TREE_CODE((tree) &(%0))"))) u2; 1737 1738 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */ 1739 tree saved_tree; 1740 1741 /* In a FUNCTION_DECL, these are function data which is to be kept 1742 as long as FUNCTION_DECL is kept. */ 1743 tree inlined_fns; 1744 1745 tree vindex; 1746 HOST_WIDE_INT pointer_alias_set; 1747 /* Points to a structure whose details depend on the language in use. */ 1748 struct lang_decl *lang_specific; 1749 }; 1750 1751 enum tree_node_structure_enum { 1752 TS_COMMON, 1753 TS_INT_CST, 1754 TS_REAL_CST, 1755 TS_VECTOR, 1756 TS_STRING, 1757 TS_COMPLEX, 1758 TS_IDENTIFIER, 1759 TS_DECL, 1760 TS_TYPE, 1761 TS_LIST, 1762 TS_VEC, 1763 TS_EXP, 1764 TS_BLOCK, 1765 LAST_TS_ENUM 1766 }; 1767 1768 /* Define the overall contents of a tree node. 1769 It may be any of the structures declared above 1770 for various types of node. */ 1771 1772 union tree_node GTY ((ptr_alias (union lang_tree_node), 1773 desc ("tree_node_structure (&%h)"))) 1774 { 1775 struct tree_common GTY ((tag ("TS_COMMON"))) common; 1776 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; 1777 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; 1778 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; 1779 struct tree_string GTY ((tag ("TS_STRING"))) string; 1780 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; 1781 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; 1782 struct tree_decl GTY ((tag ("TS_DECL"))) decl; 1783 struct tree_type GTY ((tag ("TS_TYPE"))) type; 1784 struct tree_list GTY ((tag ("TS_LIST"))) list; 1785 struct tree_vec GTY ((tag ("TS_VEC"))) vec; 1786 struct tree_exp GTY ((tag ("TS_EXP"))) exp; 1787 struct tree_block GTY ((tag ("TS_BLOCK"))) block; 1788 }; 1789 1790 /* Standard named or nameless data types of the C compiler. */ 1791 1792 enum tree_index 1793 { 1794 TI_ERROR_MARK, 1795 TI_INTQI_TYPE, 1796 TI_INTHI_TYPE, 1797 TI_INTSI_TYPE, 1798 TI_INTDI_TYPE, 1799 TI_INTTI_TYPE, 1800 1801 TI_UINTQI_TYPE, 1802 TI_UINTHI_TYPE, 1803 TI_UINTSI_TYPE, 1804 TI_UINTDI_TYPE, 1805 TI_UINTTI_TYPE, 1806 1807 TI_INTEGER_ZERO, 1808 TI_INTEGER_ONE, 1809 TI_INTEGER_MINUS_ONE, 1810 TI_NULL_POINTER, 1811 1812 TI_SIZE_ZERO, 1813 TI_SIZE_ONE, 1814 1815 TI_BITSIZE_ZERO, 1816 TI_BITSIZE_ONE, 1817 TI_BITSIZE_UNIT, 1818 1819 TI_PUBLIC, 1820 TI_PROTECTED, 1821 TI_PRIVATE, 1822 1823 TI_BOOLEAN_FALSE, 1824 TI_BOOLEAN_TRUE, 1825 1826 TI_COMPLEX_INTEGER_TYPE, 1827 TI_COMPLEX_FLOAT_TYPE, 1828 TI_COMPLEX_DOUBLE_TYPE, 1829 TI_COMPLEX_LONG_DOUBLE_TYPE, 1830 1831 TI_FLOAT_TYPE, 1832 TI_DOUBLE_TYPE, 1833 TI_LONG_DOUBLE_TYPE, 1834 1835 TI_FLOAT_PTR_TYPE, 1836 TI_DOUBLE_PTR_TYPE, 1837 TI_LONG_DOUBLE_PTR_TYPE, 1838 TI_INTEGER_PTR_TYPE, 1839 1840 TI_VOID_TYPE, 1841 TI_PTR_TYPE, 1842 TI_CONST_PTR_TYPE, 1843 TI_SIZE_TYPE, 1844 TI_PTRDIFF_TYPE, 1845 TI_VA_LIST_TYPE, 1846 TI_BOOLEAN_TYPE, 1847 1848 TI_VOID_LIST_NODE, 1849 1850 TI_UV4SF_TYPE, 1851 TI_UV4SI_TYPE, 1852 TI_UV8HI_TYPE, 1853 TI_UV8QI_TYPE, 1854 TI_UV4HI_TYPE, 1855 TI_UV2HI_TYPE, 1856 TI_UV2SI_TYPE, 1857 TI_UV2SF_TYPE, 1858 TI_UV2DI_TYPE, 1859 TI_UV1DI_TYPE, 1860 TI_UV16QI_TYPE, 1861 1862 TI_V4SF_TYPE, 1863 TI_V16SF_TYPE, 1864 TI_V4SI_TYPE, 1865 TI_V8HI_TYPE, 1866 TI_V8QI_TYPE, 1867 TI_V4HI_TYPE, 1868 TI_V2HI_TYPE, 1869 TI_V2SI_TYPE, 1870 TI_V2SF_TYPE, 1871 TI_V2DF_TYPE, 1872 TI_V2DI_TYPE, 1873 TI_V1DI_TYPE, 1874 TI_V16QI_TYPE, 1875 TI_V4DF_TYPE, 1876 1877 TI_MAIN_IDENTIFIER, 1878 1879 TI_MAX 1880 }; 1881 1882 extern GTY(()) tree global_trees[TI_MAX]; 1883 1884 #define error_mark_node global_trees[TI_ERROR_MARK] 1885 1886 #define intQI_type_node global_trees[TI_INTQI_TYPE] 1887 #define intHI_type_node global_trees[TI_INTHI_TYPE] 1888 #define intSI_type_node global_trees[TI_INTSI_TYPE] 1889 #define intDI_type_node global_trees[TI_INTDI_TYPE] 1890 #define intTI_type_node global_trees[TI_INTTI_TYPE] 1891 1892 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] 1893 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] 1894 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] 1895 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] 1896 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] 1897 1898 #define integer_zero_node global_trees[TI_INTEGER_ZERO] 1899 #define integer_one_node global_trees[TI_INTEGER_ONE] 1900 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] 1901 #define size_zero_node global_trees[TI_SIZE_ZERO] 1902 #define size_one_node global_trees[TI_SIZE_ONE] 1903 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] 1904 #define bitsize_one_node global_trees[TI_BITSIZE_ONE] 1905 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] 1906 1907 /* Base access nodes. */ 1908 #define access_public_node global_trees[TI_PUBLIC] 1909 #define access_protected_node global_trees[TI_PROTECTED] 1910 #define access_private_node global_trees[TI_PRIVATE] 1911 1912 #define null_pointer_node global_trees[TI_NULL_POINTER] 1913 1914 #define float_type_node global_trees[TI_FLOAT_TYPE] 1915 #define double_type_node global_trees[TI_DOUBLE_TYPE] 1916 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] 1917 1918 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] 1919 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] 1920 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] 1921 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] 1922 1923 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] 1924 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] 1925 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] 1926 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] 1927 1928 #define void_type_node global_trees[TI_VOID_TYPE] 1929 /* The C type `void *'. */ 1930 #define ptr_type_node global_trees[TI_PTR_TYPE] 1931 /* The C type `const void *'. */ 1932 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] 1933 /* The C type `size_t'. */ 1934 #define size_type_node global_trees[TI_SIZE_TYPE] 1935 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] 1936 #define va_list_type_node global_trees[TI_VA_LIST_TYPE] 1937 1938 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] 1939 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] 1940 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] 1941 1942 /* The node that should be placed at the end of a parameter list to 1943 indicate that the function does not take a variable number of 1944 arguments. The TREE_VALUE will be void_type_node and there will be 1945 no TREE_CHAIN. Language-independent code should not assume 1946 anything else about this node. */ 1947 #define void_list_node global_trees[TI_VOID_LIST_NODE] 1948 1949 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] 1950 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) 1951 1952 #define unsigned_V16QI_type_node global_trees[TI_UV16QI_TYPE] 1953 #define unsigned_V4SI_type_node global_trees[TI_UV4SI_TYPE] 1954 #define unsigned_V8QI_type_node global_trees[TI_UV8QI_TYPE] 1955 #define unsigned_V8HI_type_node global_trees[TI_UV8HI_TYPE] 1956 #define unsigned_V4HI_type_node global_trees[TI_UV4HI_TYPE] 1957 #define unsigned_V2HI_type_node global_trees[TI_UV2HI_TYPE] 1958 #define unsigned_V2SI_type_node global_trees[TI_UV2SI_TYPE] 1959 #define unsigned_V2DI_type_node global_trees[TI_UV2DI_TYPE] 1960 #define unsigned_V1DI_type_node global_trees[TI_UV1DI_TYPE] 1961 1962 #define V16QI_type_node global_trees[TI_V16QI_TYPE] 1963 #define V4SF_type_node global_trees[TI_V4SF_TYPE] 1964 #define V4SI_type_node global_trees[TI_V4SI_TYPE] 1965 #define V8QI_type_node global_trees[TI_V8QI_TYPE] 1966 #define V8HI_type_node global_trees[TI_V8HI_TYPE] 1967 #define V4HI_type_node global_trees[TI_V4HI_TYPE] 1968 #define V2HI_type_node global_trees[TI_V2HI_TYPE] 1969 #define V2SI_type_node global_trees[TI_V2SI_TYPE] 1970 #define V2SF_type_node global_trees[TI_V2SF_TYPE] 1971 #define V2DI_type_node global_trees[TI_V2DI_TYPE] 1972 #define V2DF_type_node global_trees[TI_V2DF_TYPE] 1973 #define V16SF_type_node global_trees[TI_V16SF_TYPE] 1974 #define V1DI_type_node global_trees[TI_V1DI_TYPE] 1975 #define V4DF_type_node global_trees[TI_V4DF_TYPE] 1976 1977 /* An enumeration of the standard C integer types. These must be 1978 ordered so that shorter types appear before longer ones, and so 1979 that signed types appear before unsigned ones, for the correct 1980 functioning of interpret_integer() in c-lex.c. */ 1981 enum integer_type_kind 1982 { 1983 itk_char, 1984 itk_signed_char, 1985 itk_unsigned_char, 1986 itk_short, 1987 itk_unsigned_short, 1988 itk_int, 1989 itk_unsigned_int, 1990 itk_long, 1991 itk_unsigned_long, 1992 itk_long_long, 1993 itk_unsigned_long_long, 1994 itk_none 1995 }; 1996 1997 typedef enum integer_type_kind integer_type_kind; 1998 1999 /* The standard C integer types. Use integer_type_kind to index into 2000 this array. */ 2001 extern GTY(()) tree integer_types[itk_none]; 2002 2003 #define char_type_node integer_types[itk_char] 2004 #define signed_char_type_node integer_types[itk_signed_char] 2005 #define unsigned_char_type_node integer_types[itk_unsigned_char] 2006 #define short_integer_type_node integer_types[itk_short] 2007 #define short_unsigned_type_node integer_types[itk_unsigned_short] 2008 #define integer_type_node integer_types[itk_int] 2009 #define unsigned_type_node integer_types[itk_unsigned_int] 2010 #define long_integer_type_node integer_types[itk_long] 2011 #define long_unsigned_type_node integer_types[itk_unsigned_long] 2012 #define long_long_integer_type_node integer_types[itk_long_long] 2013 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] 2014 2015 /* Set to the default thread-local storage (tls) model to use. */ 2016 2017 enum tls_model { 2018 TLS_MODEL_GLOBAL_DYNAMIC = 1, 2019 TLS_MODEL_LOCAL_DYNAMIC, 2020 TLS_MODEL_INITIAL_EXEC, 2021 TLS_MODEL_LOCAL_EXEC 2022 }; 2023 2024 extern enum tls_model flag_tls_default; 2025 2026 2027 /* A pointer-to-function member type looks like: 2028 2029 struct { 2030 __P __pfn; 2031 ptrdiff_t __delta; 2032 }; 2033 2034 If __pfn is NULL, it is a NULL pointer-to-member-function. 2035 2036 (Because the vtable is always the first thing in the object, we 2037 don't need its offset.) If the function is virtual, then PFN is 2038 one plus twice the index into the vtable; otherwise, it is just a 2039 pointer to the function. 2040 2041 Unfortunately, using the lowest bit of PFN doesn't work in 2042 architectures that don't impose alignment requirements on function 2043 addresses, or that use the lowest bit to tell one ISA from another, 2044 for example. For such architectures, we use the lowest bit of 2045 DELTA instead of the lowest bit of the PFN, and DELTA will be 2046 multiplied by 2. */ 2047 2048 enum ptrmemfunc_vbit_where_t 2049 { 2050 ptrmemfunc_vbit_in_pfn, 2051 ptrmemfunc_vbit_in_delta 2052 }; 2053 2054 #define NULL_TREE (tree) NULL 2055 2056 extern tree decl_assembler_name (tree); 2057 2058 /* Compute the number of bytes occupied by 'node'. This routine only 2059 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ 2060 2061 extern size_t tree_size (tree); 2062 2063 /* Lowest level primitive for allocating a node. 2064 The TREE_CODE is the only argument. Contents are initialized 2065 to zero except for a few of the common fields. */ 2066 2067 extern tree make_node (enum tree_code); 2068 2069 /* Make a copy of a node, with all the same contents. */ 2070 2071 extern tree copy_node (tree); 2072 2073 /* Make a copy of a chain of TREE_LIST nodes. */ 2074 2075 extern tree copy_list (tree); 2076 2077 /* Make a TREE_VEC. */ 2078 2079 extern tree make_tree_vec (int); 2080 2081 /* Return the (unique) IDENTIFIER_NODE node for a given name. 2082 The name is supplied as a char *. */ 2083 2084 extern tree get_identifier (const char *); 2085 2086 #if GCC_VERSION >= 3000 2087 #define get_identifier(str) \ 2088 (__builtin_constant_p (str) \ 2089 ? get_identifier_with_length ((str), strlen (str)) \ 2090 : get_identifier (str)) 2091 #endif 2092 2093 2094 /* Identical to get_identifier, except that the length is assumed 2095 known. */ 2096 2097 extern tree get_identifier_with_length (const char *, size_t); 2098 2099 /* If an identifier with the name TEXT (a null-terminated string) has 2100 previously been referred to, return that node; otherwise return 2101 NULL_TREE. */ 2102 2103 extern tree maybe_get_identifier (const char *); 2104 2105 /* Construct various types of nodes. */ 2106 2107 #define build_int_2(LO, HI) \ 2108 build_int_2_wide ((unsigned HOST_WIDE_INT) (LO), (HOST_WIDE_INT) (HI)) 2109 2110 extern tree build (enum tree_code, tree, ...); 2111 extern tree build_nt (enum tree_code, ...); 2112 2113 extern tree build_int_2_wide (unsigned HOST_WIDE_INT, HOST_WIDE_INT); 2114 extern tree build_vector (tree, tree); 2115 extern tree build_constructor (tree, tree); 2116 extern tree build_real_from_int_cst (tree, tree); 2117 extern tree build_complex (tree, tree, tree); 2118 extern tree build_string (int, const char *); 2119 extern tree build1 (enum tree_code, tree, tree); 2120 extern tree build_tree_list (tree, tree); 2121 extern tree build_decl (enum tree_code, tree, tree); 2122 extern tree build_block (tree, tree, tree, tree, tree); 2123 extern tree build_expr_wfl (tree, const char *, int, int); 2124 2125 /* Construct various nodes representing data types. */ 2126 2127 extern tree make_signed_type (int); 2128 extern tree make_unsigned_type (int); 2129 extern void initialize_sizetypes (void); 2130 extern void set_sizetype (tree); 2131 extern void fixup_unsigned_type (tree); 2132 extern tree build_pointer_type_for_mode (tree, enum machine_mode); 2133 extern tree build_pointer_type (tree); 2134 extern tree build_reference_type_for_mode (tree, enum machine_mode); 2135 extern tree build_reference_type (tree); 2136 extern tree build_type_no_quals (tree); 2137 extern tree build_index_type (tree); 2138 extern tree build_index_2_type (tree, tree); 2139 extern tree build_array_type (tree, tree); 2140 extern tree build_function_type (tree, tree); 2141 extern tree build_function_type_list (tree, ...); 2142 extern tree build_method_type_directly (tree, tree, tree); 2143 extern tree build_method_type (tree, tree); 2144 extern tree build_offset_type (tree, tree); 2145 extern tree build_complex_type (tree); 2146 extern tree array_type_nelts (tree); 2147 2148 extern tree value_member (tree, tree); 2149 extern tree purpose_member (tree, tree); 2150 extern tree binfo_member (tree, tree); 2151 extern unsigned int attribute_hash_list (tree); 2152 extern int attribute_list_equal (tree, tree); 2153 extern int attribute_list_contained (tree, tree); 2154 extern int tree_int_cst_equal (tree, tree); 2155 extern int tree_int_cst_lt (tree, tree); 2156 extern int tree_int_cst_compare (tree, tree); 2157 extern int host_integerp (tree, int); 2158 extern HOST_WIDE_INT tree_low_cst (tree, int); 2159 extern int tree_int_cst_msb (tree); 2160 extern int tree_int_cst_sgn (tree); 2161 extern int tree_expr_nonnegative_p (tree); 2162 extern int rtl_expr_nonnegative_p (rtx); 2163 extern tree get_inner_array_type (tree); 2164 2165 /* From expmed.c. Since rtl.h is included after tree.h, we can't 2166 put the prototype here. Rtl.h does declare the prototype if 2167 tree.h had been included. */ 2168 2169 extern tree make_tree (tree, rtx); 2170 2171 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES 2172 is ATTRIBUTE. 2173 2174 Such modified types already made are recorded so that duplicates 2175 are not made. */ 2176 2177 extern tree build_type_attribute_variant (tree, tree); 2178 extern tree build_decl_attribute_variant (tree, tree); 2179 2180 /* Structure describing an attribute and a function to handle it. */ 2181 struct attribute_spec 2182 { 2183 /* The name of the attribute (without any leading or trailing __), 2184 or NULL to mark the end of a table of attributes. */ 2185 const char *const name; 2186 /* The minimum length of the list of arguments of the attribute. */ 2187 const int min_length; 2188 /* The maximum length of the list of arguments of the attribute 2189 (-1 for no maximum). */ 2190 const int max_length; 2191 /* Whether this attribute requires a DECL. If it does, it will be passed 2192 from types of DECLs, function return types and array element types to 2193 the DECLs, function types and array types respectively; but when 2194 applied to a type in any other circumstances, it will be ignored with 2195 a warning. (If greater control is desired for a given attribute, 2196 this should be false, and the flags argument to the handler may be 2197 used to gain greater control in that case.) */ 2198 const bool decl_required; 2199 /* Whether this attribute requires a type. If it does, it will be passed 2200 from a DECL to the type of that DECL. */ 2201 const bool type_required; 2202 /* Whether this attribute requires a function (or method) type. If it does, 2203 it will be passed from a function pointer type to the target type, 2204 and from a function return type (which is not itself a function 2205 pointer type) to the function type. */ 2206 const bool function_type_required; 2207 /* Function to handle this attribute. NODE points to the node to which 2208 the attribute is to be applied. If a DECL, it should be modified in 2209 place; if a TYPE, a copy should be created. NAME is the name of the 2210 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST 2211 of the arguments (which may be NULL). FLAGS gives further information 2212 about the context of the attribute. Afterwards, the attributes will 2213 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, 2214 unless *NO_ADD_ATTRS is set to true (which should be done on error, 2215 as well as in any other cases when the attributes should not be added 2216 to the DECL or TYPE). Depending on FLAGS, any attributes to be 2217 applied to another type or DECL later may be returned; 2218 otherwise the return value should be NULL_TREE. This pointer may be 2219 NULL if no special handling is required beyond the checks implied 2220 by the rest of this structure. */ 2221 tree (*const handler) (tree *node, tree name, tree args, 2222 int flags, bool *no_add_attrs); 2223 }; 2224 2225 /* Flags that may be passed in the third argument of decl_attributes, and 2226 to handler functions for attributes. */ 2227 enum attribute_flags 2228 { 2229 /* The type passed in is the type of a DECL, and any attributes that 2230 should be passed in again to be applied to the DECL rather than the 2231 type should be returned. */ 2232 ATTR_FLAG_DECL_NEXT = 1, 2233 /* The type passed in is a function return type, and any attributes that 2234 should be passed in again to be applied to the function type rather 2235 than the return type should be returned. */ 2236 ATTR_FLAG_FUNCTION_NEXT = 2, 2237 /* The type passed in is an array element type, and any attributes that 2238 should be passed in again to be applied to the array type rather 2239 than the element type should be returned. */ 2240 ATTR_FLAG_ARRAY_NEXT = 4, 2241 /* The type passed in is a structure, union or enumeration type being 2242 created, and should be modified in place. */ 2243 ATTR_FLAG_TYPE_IN_PLACE = 8, 2244 /* The attributes are being applied by default to a library function whose 2245 name indicates known behavior, and should be silently ignored if they 2246 are not in fact compatible with the function type. */ 2247 ATTR_FLAG_BUILT_IN = 16 2248 }; 2249 2250 /* Default versions of target-overridable functions. */ 2251 2252 extern tree merge_decl_attributes (tree, tree); 2253 extern tree merge_type_attributes (tree, tree); 2254 extern void default_register_cpp_builtins (struct cpp_reader *); 2255 2256 /* Split a list of declspecs and attributes into two. */ 2257 2258 extern void split_specs_attrs (tree, tree *, tree *); 2259 2260 /* Strip attributes from a list of combined specs and attrs. */ 2261 2262 extern tree strip_attrs (tree); 2263 2264 /* Return 1 if an attribute and its arguments are valid for a decl or type. */ 2265 2266 extern int valid_machine_attribute (tree, tree, tree, tree); 2267 2268 /* Given a tree node and a string, return nonzero if the tree node is 2269 a valid attribute name for the string. */ 2270 2271 extern int is_attribute_p (const char *, tree); 2272 2273 /* Given an attribute name and a list of attributes, return the list element 2274 of the attribute or NULL_TREE if not found. */ 2275 2276 extern tree lookup_attribute (const char *, tree); 2277 2278 /* Given two attributes lists, return a list of their union. */ 2279 2280 extern tree merge_attributes (tree, tree); 2281 2282 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES 2283 /* Given two Windows decl attributes lists, possibly including 2284 dllimport, return a list of their union . */ 2285 extern tree merge_dllimport_decl_attributes (tree, tree); 2286 #endif 2287 2288 /* Return a version of the TYPE, qualified as indicated by the 2289 TYPE_QUALS, if one exists. If no qualified version exists yet, 2290 return NULL_TREE. */ 2291 2292 extern tree get_qualified_type (tree, int); 2293 2294 /* Like get_qualified_type, but creates the type if it does not 2295 exist. This function never returns NULL_TREE. */ 2296 2297 extern tree build_qualified_type (tree, int); 2298 2299 /* Like build_qualified_type, but only deals with the `const' and 2300 `volatile' qualifiers. This interface is retained for backwards 2301 compatibility with the various front-ends; new code should use 2302 build_qualified_type instead. */ 2303 2304 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ 2305 build_qualified_type ((TYPE), \ 2306 ((CONST_P) ? TYPE_QUAL_CONST : 0) \ 2307 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) 2308 2309 /* Make a copy of a type node. */ 2310 2311 extern tree build_type_copy (tree); 2312 2313 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its 2314 fields. Optionally specify an alignment, and then lsy it out. */ 2315 2316 extern void finish_builtin_struct (tree, const char *, 2317 tree, tree); 2318 2319 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, 2320 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one 2321 node, does nothing except for the first time. */ 2322 2323 extern void layout_type (tree); 2324 2325 /* These functions allow a front-end to perform a manual layout of a 2326 RECORD_TYPE. (For instance, if the placement of subsequent fields 2327 depends on the placement of fields so far.) Begin by calling 2328 start_record_layout. Then, call place_field for each of the 2329 fields. Then, call finish_record_layout. See layout_type for the 2330 default way in which these functions are used. */ 2331 2332 typedef struct record_layout_info_s 2333 { 2334 /* The RECORD_TYPE that we are laying out. */ 2335 tree t; 2336 /* The offset into the record so far, in bytes, not including bits in 2337 BITPOS. */ 2338 tree offset; 2339 /* The last known alignment of SIZE. */ 2340 unsigned int offset_align; 2341 /* The bit position within the last OFFSET_ALIGN bits, in bits. */ 2342 tree bitpos; 2343 /* The alignment of the record so far, in bits. */ 2344 unsigned int record_align; 2345 /* The alignment of the record so far, ignoring #pragma pack and 2346 __attribute__ ((packed)), in bits. */ 2347 unsigned int unpacked_align; 2348 /* The previous field layed out. */ 2349 tree prev_field; 2350 /* The static variables (i.e., class variables, as opposed to 2351 instance variables) encountered in T. */ 2352 tree pending_statics; 2353 /* Bits remaining in the current alignment group */ 2354 int remaining_in_alignment; 2355 /* True if we've seen a packed field that didn't have normal 2356 alignment anyway. */ 2357 int packed_maybe_necessary; 2358 } *record_layout_info; 2359 2360 extern void set_lang_adjust_rli (void (*) (record_layout_info)); 2361 extern record_layout_info start_record_layout (tree); 2362 extern tree bit_from_pos (tree, tree); 2363 extern tree byte_from_pos (tree, tree); 2364 extern void pos_from_bit (tree *, tree *, unsigned int, tree); 2365 extern void normalize_offset (tree *, tree *, unsigned int); 2366 extern tree rli_size_unit_so_far (record_layout_info); 2367 extern tree rli_size_so_far (record_layout_info); 2368 extern void normalize_rli (record_layout_info); 2369 extern void place_field (record_layout_info, tree); 2370 extern void compute_record_mode (tree); 2371 extern void finish_record_layout (record_layout_info, int); 2372 2373 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), 2374 return a canonicalized ..._TYPE node, so that duplicates are not made. 2375 How the hash code is computed is up to the caller, as long as any two 2376 callers that could hash identical-looking type nodes agree. */ 2377 2378 extern tree type_hash_canon (unsigned int, tree); 2379 2380 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, 2381 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE 2382 fields. Call this only once for any given decl node. 2383 2384 Second argument is the boundary that this field can be assumed to 2385 be starting at (in bits). Zero means it can be assumed aligned 2386 on any boundary that may be needed. */ 2387 2388 extern void layout_decl (tree, unsigned); 2389 2390 /* Return the mode for data of a given size SIZE and mode class CLASS. 2391 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. 2392 The value is BLKmode if no other mode is found. This is like 2393 mode_for_size, but is passed a tree. */ 2394 2395 extern enum machine_mode mode_for_size_tree (tree, enum mode_class, int); 2396 2397 /* Return an expr equal to X but certainly not valid as an lvalue. */ 2398 2399 extern tree non_lvalue (tree); 2400 extern tree pedantic_non_lvalue (tree); 2401 2402 extern tree convert (tree, tree); 2403 extern unsigned int expr_align (tree); 2404 extern tree expr_first (tree); 2405 extern tree expr_last (tree); 2406 extern int expr_length (tree); 2407 extern tree size_in_bytes (tree); 2408 extern HOST_WIDE_INT int_size_in_bytes (tree); 2409 extern tree bit_position (tree); 2410 extern HOST_WIDE_INT int_bit_position (tree); 2411 extern tree byte_position (tree); 2412 extern HOST_WIDE_INT int_byte_position (tree); 2413 2414 /* Define data structures, macros, and functions for handling sizes 2415 and the various types used to represent sizes. */ 2416 2417 enum size_type_kind 2418 { 2419 SIZETYPE, /* Normal representation of sizes in bytes. */ 2420 SSIZETYPE, /* Signed representation of sizes in bytes. */ 2421 USIZETYPE, /* Unsigned representation of sizes in bytes. */ 2422 BITSIZETYPE, /* Normal representation of sizes in bits. */ 2423 SBITSIZETYPE, /* Signed representation of sizes in bits. */ 2424 UBITSIZETYPE, /* Unsigned representation of sizes in bits. */ 2425 TYPE_KIND_LAST}; 2426 2427 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; 2428 2429 #define sizetype sizetype_tab[(int) SIZETYPE] 2430 #define bitsizetype sizetype_tab[(int) BITSIZETYPE] 2431 #define ssizetype sizetype_tab[(int) SSIZETYPE] 2432 #define usizetype sizetype_tab[(int) USIZETYPE] 2433 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] 2434 #define ubitsizetype sizetype_tab[(int) UBITSIZETYPE] 2435 2436 extern tree size_binop (enum tree_code, tree, tree); 2437 extern tree size_diffop (tree, tree); 2438 extern tree size_int_wide (HOST_WIDE_INT, enum size_type_kind); 2439 extern tree size_int_type_wide (HOST_WIDE_INT, tree); 2440 2441 #define size_int_type(L, T) size_int_type_wide ((HOST_WIDE_INT) (L), T) 2442 #define size_int(L) size_int_wide ((HOST_WIDE_INT) (L), SIZETYPE) 2443 #define ssize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SSIZETYPE) 2444 #define bitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), BITSIZETYPE) 2445 #define sbitsize_int(L) size_int_wide ((HOST_WIDE_INT) (L), SBITSIZETYPE) 2446 2447 extern tree round_up (tree, int); 2448 extern tree round_down (tree, int); 2449 extern tree get_pending_sizes (void); 2450 extern int is_pending_size (tree); 2451 extern void put_pending_size (tree); 2452 extern void put_pending_sizes (tree); 2453 2454 /* Type for sizes of data-type. */ 2455 2456 #define BITS_PER_UNIT_LOG \ 2457 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ 2458 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ 2459 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) 2460 2461 /* If nonzero, an upper limit on alignment of structure fields, in bits. */ 2462 extern unsigned int maximum_field_alignment; 2463 2464 /* If nonzero, the alignment of a bitstring or (power-)set value, in bits. */ 2465 extern unsigned int set_alignment; 2466 2467 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y 2468 by making the last node in X point to Y. 2469 Returns X, except if X is 0 returns Y. */ 2470 2471 extern tree chainon (tree, tree); 2472 2473 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ 2474 2475 extern tree tree_cons (tree, tree, tree); 2476 2477 /* Return the last tree node in a chain. */ 2478 2479 extern tree tree_last (tree); 2480 2481 /* Reverse the order of elements in a chain, and return the new head. */ 2482 2483 extern tree nreverse (tree); 2484 2485 /* Returns the length of a chain of nodes 2486 (number of chain pointers to follow before reaching a null pointer). */ 2487 2488 extern int list_length (tree); 2489 2490 /* Returns the number of FIELD_DECLs in a type. */ 2491 2492 extern int fields_length (tree); 2493 2494 /* Given an initializer INIT, return TRUE if INIT is zero or some 2495 aggregate of zeros. Otherwise return FALSE. */ 2496 2497 extern bool initializer_zerop (tree); 2498 2499 /* Given an initializer INIT, return TRUE if INIT is at least 3/4 zeros. 2500 Otherwise return FALSE. */ 2501 2502 extern int mostly_zeros_p (tree); 2503 2504 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */ 2505 2506 extern int integer_zerop (tree); 2507 2508 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */ 2509 2510 extern int integer_onep (tree); 2511 2512 /* integer_all_onesp (tree x) is nonzero if X is an integer constant 2513 all of whose significant bits are 1. */ 2514 2515 extern int integer_all_onesp (tree); 2516 2517 /* integer_pow2p (tree x) is nonzero is X is an integer constant with 2518 exactly one bit 1. */ 2519 2520 extern int integer_pow2p (tree); 2521 2522 /* integer_nonzerop (tree x) is nonzero if X is an integer constant 2523 with a nonzero value. */ 2524 2525 extern int integer_nonzerop (tree); 2526 2527 /* staticp (tree x) is nonzero if X is a reference to data allocated 2528 at a fixed address in memory. */ 2529 2530 extern int staticp (tree); 2531 2532 /* Gets an error if argument X is not an lvalue. 2533 Also returns 1 if X is an lvalue, 0 if not. */ 2534 2535 extern int lvalue_or_else (tree, const char *); 2536 2537 /* save_expr (EXP) returns an expression equivalent to EXP 2538 but it can be used multiple times within context CTX 2539 and only evaluate EXP once. */ 2540 2541 extern tree save_expr (tree); 2542 2543 /* Look inside EXPR and into any simple arithmetic operations. Return 2544 the innermost non-arithmetic node. */ 2545 2546 extern tree skip_simple_arithmetic (tree); 2547 2548 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a 2549 SAVE_EXPR. Return FALSE otherwise. */ 2550 2551 extern bool saved_expr_p (tree); 2552 2553 /* Returns the index of the first non-tree operand for CODE, or the number 2554 of operands if all are trees. */ 2555 2556 extern int first_rtl_op (enum tree_code); 2557 2558 /* Return which tree structure is used by T. */ 2559 2560 enum tree_node_structure_enum tree_node_structure (tree); 2561 2562 /* unsave_expr (EXP) returns an expression equivalent to EXP but it 2563 can be used multiple times and will evaluate EXP in its entirety 2564 each time. */ 2565 2566 extern tree unsave_expr (tree); 2567 2568 /* Reset EXP in place so that it can be expanded again. Does not 2569 recurse into subtrees. */ 2570 2571 extern void unsave_expr_1 (tree); 2572 2573 /* Return 0 if it is safe to evaluate EXPR multiple times, 2574 return 1 if it is safe if EXPR is unsaved afterward, or 2575 return 2 if it is completely unsafe. */ 2576 extern int unsafe_for_reeval (tree); 2577 2578 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size 2579 or offset that depends on a field within a record. 2580 2581 Note that we only allow such expressions within simple arithmetic 2582 or a COND_EXPR. */ 2583 2584 extern bool contains_placeholder_p (tree); 2585 2586 /* This macro calls the above function but short-circuits the common 2587 case of a constant to save time. Also check for null. */ 2588 2589 #define CONTAINS_PLACEHOLDER_P(EXP) \ 2590 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) 2591 2592 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR. 2593 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field 2594 positions. */ 2595 2596 extern bool type_contains_placeholder_p (tree); 2597 2598 /* Return 1 if EXP contains any expressions that produce cleanups for an 2599 outer scope to deal with. Used by fold. */ 2600 2601 extern int has_cleanups (tree); 2602 2603 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, 2604 return a tree with all occurrences of references to F in a 2605 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP 2606 contains only arithmetic expressions. */ 2607 2608 extern tree substitute_in_expr (tree, tree, tree); 2609 2610 /* variable_size (EXP) is like save_expr (EXP) except that it 2611 is for the special case of something that is part of a 2612 variable size for a data type. It makes special arrangements 2613 to compute the value at the right time when the data type 2614 belongs to a function parameter. */ 2615 2616 extern tree variable_size (tree); 2617 2618 /* stabilize_reference (EXP) returns a reference equivalent to EXP 2619 but it can be used multiple times 2620 and only evaluate the subexpressions once. */ 2621 2622 extern tree stabilize_reference (tree); 2623 2624 /* Subroutine of stabilize_reference; this is called for subtrees of 2625 references. Any expression with side-effects must be put in a SAVE_EXPR 2626 to ensure that it is only evaluated once. */ 2627 2628 extern tree stabilize_reference_1 (tree); 2629 2630 /* Return EXP, stripped of any conversions to wider types 2631 in such a way that the result of converting to type FOR_TYPE 2632 is the same as if EXP were converted to FOR_TYPE. 2633 If FOR_TYPE is 0, it signifies EXP's type. */ 2634 2635 extern tree get_unwidened (tree, tree); 2636 2637 /* Return OP or a simpler expression for a narrower value 2638 which can be sign-extended or zero-extended to give back OP. 2639 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended 2640 or 0 if the value should be sign-extended. */ 2641 2642 extern tree get_narrower (tree, int *); 2643 2644 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF, 2645 look for nested component-refs or array-refs at constant positions 2646 and find the ultimate containing object, which is returned. */ 2647 2648 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, 2649 tree *, enum machine_mode *, int *, int *); 2650 2651 /* Return 1 if T is an expression that get_inner_reference handles. */ 2652 2653 extern int handled_component_p (tree); 2654 2655 /* Given a DECL or TYPE, return the scope in which it was declared, or 2656 NUL_TREE if there is no containing scope. */ 2657 2658 extern tree get_containing_scope (tree); 2659 2660 /* Return the FUNCTION_DECL which provides this _DECL with its context, 2661 or zero if none. */ 2662 extern tree decl_function_context (tree); 2663 2664 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides 2665 this _DECL with its context, or zero if none. */ 2666 extern tree decl_type_context (tree); 2667 2668 /* Given the FUNCTION_DECL for the current function, 2669 return zero if it is ok for this function to be inline. 2670 Otherwise return a warning message with a single %s 2671 for the function's name. */ 2672 2673 extern const char *function_cannot_inline_p (tree); 2674 2675 /* Return 1 if EXPR is the real constant zero. */ 2676 extern int real_zerop (tree); 2677 2678 /* Declare commonly used variables for tree structure. */ 2679 2680 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. 2681 Zero means allow extended lvalues. */ 2682 2683 extern int pedantic_lvalues; 2684 2685 /* Nonzero means can safely call expand_expr now; 2686 otherwise layout_type puts variable sizes onto `pending_sizes' instead. */ 2687 2688 extern int immediate_size_expand; 2689 2690 /* Points to the FUNCTION_DECL of the function whose body we are reading. */ 2691 2692 extern GTY(()) tree current_function_decl; 2693 2694 /* Nonzero means a FUNC_BEGIN label was emitted. */ 2695 extern GTY(()) tree current_function_func_begin_label; 2696 2697 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ 2698 2699 extern int all_types_permanent; 2700 2701 /* Exit a binding level. This function is provided by each language 2702 frontend. */ 2703 extern tree poplevel (int, int, int); 2704 2705 /* Declare a predefined function. Return the declaration. This function is 2706 provided by each language frontend. */ 2707 extern tree builtin_function (const char *, tree, int, enum built_in_class, 2708 const char *, tree); 2709 2710 /* In tree.c */ 2711 extern unsigned crc32_string (unsigned, const char *); 2712 extern void clean_symbol_name (char *); 2713 extern tree get_file_function_name_long (const char *); 2714 extern tree get_set_constructor_bits (tree, char *, int); 2715 extern tree get_set_constructor_bytes (tree, unsigned char *, int); 2716 extern tree get_callee_fndecl (tree); 2717 extern void change_decl_assembler_name (tree, tree); 2718 extern int type_num_arguments (tree); 2719 extern tree lhd_unsave_expr_now (tree); 2720 2721 2722 /* In stmt.c */ 2723 2724 extern void expand_fixups (rtx); 2725 extern tree expand_start_stmt_expr (int); 2726 extern tree expand_end_stmt_expr (tree); 2727 extern void expand_expr_stmt (tree); 2728 extern void expand_expr_stmt_value (tree, int, int); 2729 extern int warn_if_unused_value (tree); 2730 extern void expand_decl_init (tree); 2731 extern void clear_last_expr (void); 2732 extern void expand_label (tree); 2733 extern void expand_goto (tree); 2734 extern void expand_asm (tree, int); 2735 extern void expand_start_cond (tree, int); 2736 extern void expand_end_cond (void); 2737 extern void expand_start_else (void); 2738 extern void expand_start_elseif (tree); 2739 extern struct nesting *expand_start_loop (int); 2740 extern struct nesting *expand_start_loop_continue_elsewhere (int); 2741 extern struct nesting *expand_start_null_loop (void); 2742 extern void expand_loop_continue_here (void); 2743 extern void expand_end_loop (void); 2744 extern void expand_end_null_loop (void); 2745 extern int expand_continue_loop (struct nesting *); 2746 extern int expand_exit_loop (struct nesting *); 2747 extern int expand_exit_loop_if_false (struct nesting *,tree); 2748 extern int expand_exit_loop_top_cond (struct nesting *, tree); 2749 extern int expand_exit_something (void); 2750 2751 extern void expand_return (tree); 2752 extern int optimize_tail_recursion (tree, rtx); 2753 extern void expand_start_bindings_and_block (int, tree); 2754 #define expand_start_bindings(flags) \ 2755 expand_start_bindings_and_block(flags, NULL_TREE) 2756 extern void expand_end_bindings (tree, int, int); 2757 extern void warn_about_unused_variables (tree); 2758 extern void start_cleanup_deferral (void); 2759 extern void end_cleanup_deferral (void); 2760 extern int is_body_block (tree); 2761 2762 extern int conditional_context (void); 2763 extern struct nesting * current_nesting_level (void); 2764 extern tree last_cleanup_this_contour (void); 2765 extern void expand_start_case (int, tree, tree, const char *); 2766 extern void expand_end_case_type (tree, tree); 2767 #define expand_end_case(cond) expand_end_case_type (cond, NULL) 2768 extern int add_case_node (tree, tree, tree, tree *); 2769 extern int pushcase (tree, tree (*) (tree, tree), tree, tree *); 2770 extern int pushcase_range (tree, tree, tree (*) (tree, tree), tree, tree *); 2771 extern void using_eh_for_cleanups (void); 2772 2773 /* In fold-const.c */ 2774 2775 /* Fold constants as much as possible in an expression. 2776 Returns the simplified expression. 2777 Acts only on the top level of the expression; 2778 if the argument itself cannot be simplified, its 2779 subexpressions are not changed. */ 2780 2781 extern tree fold (tree); 2782 extern tree fold_initializer (tree); 2783 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree); 2784 2785 extern int force_fit_type (tree, int); 2786 extern int add_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2787 unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2788 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); 2789 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2790 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); 2791 extern int mul_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2792 unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2793 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); 2794 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2795 HOST_WIDE_INT, unsigned int, 2796 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); 2797 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2798 HOST_WIDE_INT, unsigned int, 2799 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int); 2800 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2801 HOST_WIDE_INT, unsigned int, 2802 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); 2803 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT, 2804 HOST_WIDE_INT, unsigned int, 2805 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *); 2806 2807 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT, 2808 HOST_WIDE_INT, unsigned HOST_WIDE_INT, 2809 HOST_WIDE_INT, unsigned HOST_WIDE_INT *, 2810 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, 2811 HOST_WIDE_INT *); 2812 2813 extern int operand_equal_p (tree, tree, int); 2814 extern tree omit_one_operand (tree, tree, tree); 2815 extern tree invert_truthvalue (tree); 2816 2817 /* In builtins.c */ 2818 extern tree fold_builtin (tree); 2819 extern enum built_in_function builtin_mathfn_code (tree); 2820 extern tree build_function_call_expr (tree, tree); 2821 extern tree mathfn_built_in (tree, enum built_in_function fn); 2822 2823 /* In convert.c */ 2824 extern tree strip_float_extensions (tree); 2825 2826 /* In alias.c */ 2827 extern void record_component_aliases (tree); 2828 extern HOST_WIDE_INT get_alias_set (tree); 2829 extern int alias_sets_conflict_p (HOST_WIDE_INT, HOST_WIDE_INT); 2830 extern int readonly_fields_p (tree); 2831 extern int objects_must_conflict_p (tree, tree); 2832 2833 /* In tree.c */ 2834 extern int really_constant_p (tree); 2835 extern int int_fits_type_p (tree, tree); 2836 extern bool variably_modified_type_p (tree); 2837 extern int tree_log2 (tree); 2838 extern int tree_floor_log2 (tree); 2839 extern int simple_cst_equal (tree, tree); 2840 extern unsigned int iterative_hash_expr (tree, unsigned int); 2841 extern int compare_tree_int (tree, unsigned HOST_WIDE_INT); 2842 extern int type_list_equal (tree, tree); 2843 extern int chain_member (tree, tree); 2844 extern tree type_hash_lookup (unsigned int, tree); 2845 extern void type_hash_add (unsigned int, tree); 2846 extern unsigned int type_hash_list (tree); 2847 extern int simple_cst_list_equal (tree, tree); 2848 extern void dump_tree_statistics (void); 2849 extern void expand_function_end (void); 2850 extern void expand_function_start (tree, int); 2851 extern void expand_pending_sizes (tree); 2852 extern tree make_vector (enum machine_mode, tree, int); 2853 extern tree reconstruct_complex_type (tree, tree); 2854 2855 extern int real_onep (tree); 2856 extern int real_twop (tree); 2857 extern int real_minus_onep (tree); 2858 extern void init_ttree (void); 2859 extern void build_common_tree_nodes (int); 2860 extern void build_common_tree_nodes_2 (int); 2861 extern tree build_range_type (tree, tree, tree); 2862 2863 /* In function.c */ 2864 extern void setjmp_protect_args (void); 2865 extern void setjmp_protect (tree); 2866 extern void expand_main_function (void); 2867 extern void init_dummy_function_start (void); 2868 extern void expand_dummy_function_end (void); 2869 extern void init_function_for_compilation (void); 2870 extern void allocate_struct_function (tree); 2871 extern void init_function_start (tree); 2872 extern void assign_parms (tree); 2873 extern void put_var_into_stack (tree, int); 2874 extern void flush_addressof (tree); 2875 extern void uninitialized_vars_warning (tree); 2876 extern void setjmp_args_warning (void); 2877 extern void mark_all_temps_used (void); 2878 extern void init_temp_slots (void); 2879 extern void combine_temp_slots (void); 2880 extern void free_temp_slots (void); 2881 extern void pop_temp_slots (void); 2882 extern void push_temp_slots (void); 2883 extern void preserve_temp_slots (rtx); 2884 extern void preserve_rtl_expr_temps (tree); 2885 extern int aggregate_value_p (tree, tree); 2886 extern void free_temps_for_rtl_expr (tree); 2887 extern void instantiate_virtual_regs (tree, rtx); 2888 extern void unshare_all_rtl (tree, rtx); 2889 extern void push_function_context (void); 2890 extern void pop_function_context (void); 2891 extern void push_function_context_to (tree); 2892 extern void pop_function_context_from (tree); 2893 2894 /* In print-rtl.c */ 2895 #ifdef BUFSIZ 2896 extern void print_rtl (FILE *, rtx); 2897 #endif 2898 2899 /* In print-tree.c */ 2900 extern void debug_tree (tree); 2901 #ifdef BUFSIZ 2902 extern void print_node (FILE *, const char *, tree, int); 2903 extern void print_node_brief (FILE *, const char *, tree, int); 2904 extern void indent_to (FILE *, int); 2905 #endif 2906 2907 /* In expr.c */ 2908 extern int apply_args_register_offset (int); 2909 extern rtx expand_builtin_return_addr (enum built_in_function, int, rtx); 2910 extern void check_max_integer_computation_mode (tree); 2911 2912 /* In emit-rtl.c */ 2913 extern void start_sequence_for_rtl_expr (tree); 2914 extern rtx emit_line_note (location_t); 2915 2916 /* In calls.c */ 2917 2918 /* Nonzero if this is a call to a `const' function. */ 2919 #define ECF_CONST 1 2920 /* Nonzero if this is a call to a `volatile' function. */ 2921 #define ECF_NORETURN 2 2922 /* Nonzero if this is a call to malloc or a related function. */ 2923 #define ECF_MALLOC 4 2924 /* Nonzero if it is plausible that this is a call to alloca. */ 2925 #define ECF_MAY_BE_ALLOCA 8 2926 /* Nonzero if this is a call to a function that won't throw an exception. */ 2927 #define ECF_NOTHROW 16 2928 /* Nonzero if this is a call to setjmp or a related function. */ 2929 #define ECF_RETURNS_TWICE 32 2930 /* Nonzero if this is a call to `longjmp'. */ 2931 #define ECF_LONGJMP 64 2932 /* Nonzero if this is a syscall that makes a new process in the image of 2933 the current one. */ 2934 #define ECF_FORK_OR_EXEC 128 2935 #define ECF_SIBCALL 256 2936 /* Nonzero if this is a call to "pure" function (like const function, 2937 but may read memory. */ 2938 #define ECF_PURE 512 2939 /* Nonzero if this is a call to a function that returns with the stack 2940 pointer depressed. */ 2941 #define ECF_SP_DEPRESSED 1024 2942 /* Nonzero if this call is known to always return. */ 2943 #define ECF_ALWAYS_RETURN 2048 2944 /* Create libcall block around the call. */ 2945 #define ECF_LIBCALL_BLOCK 4096 2946 2947 extern int flags_from_decl_or_type (tree); 2948 extern int call_expr_flags (tree); 2949 2950 extern int setjmp_call_p (tree); 2951 extern bool alloca_call_p (tree); 2952 2953 /* In attribs.c. */ 2954 2955 /* Process the attributes listed in ATTRIBUTES and install them in *NODE, 2956 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, 2957 it should be modified in place; if a TYPE, a copy should be created 2958 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further 2959 information, in the form of a bitwise OR of flags in enum attribute_flags 2960 from tree.h. Depending on these flags, some attributes may be 2961 returned to be applied at a later stage (for example, to apply 2962 a decl attribute to the declaration rather than to its type). */ 2963 extern tree decl_attributes (tree *, tree, int); 2964 2965 /* In integrate.c */ 2966 extern void save_for_inline (tree); 2967 extern void set_decl_abstract_flags (tree, int); 2968 extern void output_inline_function (tree); 2969 extern void set_decl_origin_self (tree); 2970 2971 /* In stor-layout.c */ 2972 extern void set_min_and_max_values_for_integral_type (tree, int, bool); 2973 extern void fixup_signed_type (tree); 2974 extern void internal_reference_types (void); 2975 2976 /* varasm.c */ 2977 extern void make_decl_rtl (tree, const char *); 2978 extern void make_decl_one_only (tree); 2979 extern int supports_one_only (void); 2980 extern void variable_section (tree, int); 2981 enum tls_model decl_tls_model (tree); 2982 extern void resolve_unique_section (tree, int, int); 2983 extern void mark_referenced (tree); 2984 extern void notice_global_symbol (tree); 2985 2986 /* In stmt.c */ 2987 extern void emit_nop (void); 2988 extern void expand_computed_goto (tree); 2989 extern bool parse_output_constraint (const char **, int, int, int, 2990 bool *, bool *, bool *); 2991 extern bool parse_input_constraint (const char **, int, int, int, int, 2992 const char * const *, bool *, bool *); 2993 extern void expand_asm_operands (tree, tree, tree, tree, int, location_t); 2994 extern tree resolve_asm_operand_names (tree, tree, tree); 2995 extern int any_pending_cleanups (void); 2996 extern void init_stmt_for_function (void); 2997 extern void expand_start_target_temps (void); 2998 extern void expand_end_target_temps (void); 2999 extern void expand_elseif (tree); 3000 extern void save_stack_pointer (void); 3001 extern void expand_decl (tree); 3002 extern int expand_decl_cleanup (tree, tree); 3003 extern int expand_decl_cleanup_eh (tree, tree, int); 3004 extern void expand_anon_union_decl (tree, tree, tree); 3005 extern void expand_start_case_dummy (void); 3006 extern HOST_WIDE_INT all_cases_count (tree, int *); 3007 extern void check_for_full_enumeration_handling (tree); 3008 extern void declare_nonlocal_label (tree); 3009 3010 /* If KIND=='I', return a suitable global initializer (constructor) name. 3011 If KIND=='D', return a suitable global clean-up (destructor) name. */ 3012 extern tree get_file_function_name (int); 3013 3014 /* Interface of the DWARF2 unwind info support. */ 3015 3016 /* Generate a new label for the CFI info to refer to. */ 3017 3018 extern char *dwarf2out_cfi_label (void); 3019 3020 /* Entry point to update the canonical frame address (CFA). */ 3021 3022 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT); 3023 3024 /* Add the CFI for saving a register window. */ 3025 3026 extern void dwarf2out_window_save (const char *); 3027 3028 /* Add a CFI to update the running total of the size of arguments pushed 3029 onto the stack. */ 3030 3031 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT); 3032 3033 /* Entry point for saving a register to the stack. */ 3034 3035 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT); 3036 3037 /* Entry point for saving the return address in the stack. */ 3038 3039 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT); 3040 3041 /* Entry point for saving the return address in a register. */ 3042 3043 extern void dwarf2out_return_reg (const char *, unsigned); 3044 3045 /* The type of a function that walks over tree structure. */ 3046 3047 typedef tree (*walk_tree_fn) (tree *, int *, void *); 3048 3049 /* In tree-dump.c */ 3050 3051 /* Different tree dump places. When you add new tree dump places, 3052 extend the DUMP_FILES array in tree-dump.c */ 3053 enum tree_dump_index 3054 { 3055 TDI_all, /* dump the whole translation unit */ 3056 TDI_class, /* dump class hierarchy */ 3057 TDI_original, /* dump each function before optimizing it */ 3058 TDI_optimized, /* dump each function after optimizing it */ 3059 TDI_inlined, /* dump each function after inlining 3060 within it. */ 3061 TDI_end 3062 }; 3063 3064 /* Bit masks to control tree dumping. Not all values are applicable to 3065 all tree dumps. Add new ones at the end. When you define new 3066 values, extend the DUMP_OPTIONS array in tree-dump.c */ 3067 #define TDF_ADDRESS (1 << 0) /* dump node addresses */ 3068 #define TDF_SLIM (1 << 1) /* don't go wild following links */ 3069 3070 typedef struct dump_info *dump_info_p; 3071 3072 extern int dump_flag (dump_info_p, int, tree); 3073 extern int dump_enabled_p (enum tree_dump_index); 3074 extern FILE *dump_begin (enum tree_dump_index, int *); 3075 extern void dump_end (enum tree_dump_index, FILE *); 3076 extern void dump_node (tree, int, FILE *); 3077 extern int dump_switch_p (const char *); 3078 extern const char *dump_flag_name (enum tree_dump_index); 3079 /* Assign the RTX to declaration. */ 3080 3081 extern void set_decl_rtl (tree, rtx); 3082 3083 /* Redefine abort to report an internal error w/o coredump, and 3084 reporting the location of the error in the source file. This logic 3085 is duplicated in rtl.h and tree.h because every file that needs the 3086 special abort includes one or both. toplev.h gets too few files, 3087 system.h gets too many. */ 3088 3089 extern void fancy_abort (const char *, int, const char *) 3090 ATTRIBUTE_NORETURN; 3091 #define abort() fancy_abort (__FILE__, __LINE__, __FUNCTION__) 3092 3093 /* Enum and arrays used for tree allocation stats. 3094 Keep in sync with tree.c:tree_node_kind_names. */ 3095 typedef enum 3096 { 3097 d_kind, 3098 t_kind, 3099 b_kind, 3100 s_kind, 3101 r_kind, 3102 e_kind, 3103 c_kind, 3104 id_kind, 3105 perm_list_kind, 3106 temp_list_kind, 3107 vec_kind, 3108 x_kind, 3109 lang_decl, 3110 lang_type, 3111 all_kinds 3112 } tree_node_kind; 3113 3114 extern int tree_node_counts[]; 3115 extern int tree_node_sizes[]; 3116 3117 #endif /* GCC_TREE_H */ 3118