1 /* Definitions for the ubiquitous 'tree' type for GNU compilers. 2 Copyright (C) 1989-2013 Free Software Foundation, Inc. 3 4 This file is part of GCC. 5 6 GCC is free software; you can redistribute it and/or modify it under 7 the terms of the GNU General Public License as published by the Free 8 Software Foundation; either version 3, or (at your option) any later 9 version. 10 11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY 12 WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 for more details. 15 16 You should have received a copy of the GNU General Public License 17 along with GCC; see the file COPYING3. If not see 18 <http://www.gnu.org/licenses/>. */ 19 20 #ifndef GCC_TREE_H 21 #define GCC_TREE_H 22 23 #include "hashtab.h" 24 #include "machmode.h" 25 #include "input.h" 26 #include "statistics.h" 27 #include "vec.h" 28 #include "double-int.h" 29 #include "real.h" 30 #include "fixed-value.h" 31 #include "alias.h" 32 #include "flags.h" 33 34 /* Codes of tree nodes */ 35 36 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, 37 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE, 38 39 enum tree_code { 40 #include "all-tree.def" 41 MAX_TREE_CODES 42 }; 43 44 #undef DEFTREECODE 45 #undef END_OF_BASE_TREE_CODES 46 47 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64]; 48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) 49 50 /* Macros for initializing `tree_contains_struct'. */ 51 #define MARK_TS_BASE(C) \ 52 do { \ 53 tree_contains_struct[C][TS_BASE] = 1; \ 54 } while (0) 55 56 #define MARK_TS_TYPED(C) \ 57 do { \ 58 MARK_TS_BASE (C); \ 59 tree_contains_struct[C][TS_TYPED] = 1; \ 60 } while (0) 61 62 #define MARK_TS_COMMON(C) \ 63 do { \ 64 MARK_TS_TYPED (C); \ 65 tree_contains_struct[C][TS_COMMON] = 1; \ 66 } while (0) 67 68 #define MARK_TS_TYPE_COMMON(C) \ 69 do { \ 70 MARK_TS_COMMON (C); \ 71 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \ 72 } while (0) 73 74 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ 75 do { \ 76 MARK_TS_TYPE_COMMON (C); \ 77 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \ 78 } while (0) 79 80 #define MARK_TS_DECL_MINIMAL(C) \ 81 do { \ 82 MARK_TS_COMMON (C); \ 83 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \ 84 } while (0) 85 86 #define MARK_TS_DECL_COMMON(C) \ 87 do { \ 88 MARK_TS_DECL_MINIMAL (C); \ 89 tree_contains_struct[C][TS_DECL_COMMON] = 1; \ 90 } while (0) 91 92 #define MARK_TS_DECL_WRTL(C) \ 93 do { \ 94 MARK_TS_DECL_COMMON (C); \ 95 tree_contains_struct[C][TS_DECL_WRTL] = 1; \ 96 } while (0) 97 98 #define MARK_TS_DECL_WITH_VIS(C) \ 99 do { \ 100 MARK_TS_DECL_WRTL (C); \ 101 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \ 102 } while (0) 103 104 #define MARK_TS_DECL_NON_COMMON(C) \ 105 do { \ 106 MARK_TS_DECL_WITH_VIS (C); \ 107 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \ 108 } while (0) 109 110 /* Number of language-independent tree codes. */ 111 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) 112 113 /* Tree code classes. */ 114 115 /* Each tree_code has an associated code class represented by a 116 TREE_CODE_CLASS. */ 117 118 enum tree_code_class { 119 tcc_exceptional, /* An exceptional code (fits no category). */ 120 tcc_constant, /* A constant. */ 121 /* Order of tcc_type and tcc_declaration is important. */ 122 tcc_type, /* A type object code. */ 123 tcc_declaration, /* A declaration (also serving as variable refs). */ 124 tcc_reference, /* A reference to storage. */ 125 tcc_comparison, /* A comparison expression. */ 126 tcc_unary, /* A unary arithmetic expression. */ 127 tcc_binary, /* A binary arithmetic expression. */ 128 tcc_statement, /* A statement expression, which have side effects 129 but usually no interesting value. */ 130 tcc_vl_exp, /* A function call or other expression with a 131 variable-length operand vector. */ 132 tcc_expression /* Any other expression. */ 133 }; 134 135 /* Each tree code class has an associated string representation. 136 These must correspond to the tree_code_class entries. */ 137 138 extern const char *const tree_code_class_strings[]; 139 140 /* Returns the string representing CLASS. */ 141 142 #define TREE_CODE_CLASS_STRING(CLASS)\ 143 tree_code_class_strings[(int) (CLASS)] 144 145 extern const enum tree_code_class tree_code_type[]; 146 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] 147 148 /* Nonzero if CODE represents an exceptional code. */ 149 150 #define EXCEPTIONAL_CLASS_P(CODE)\ 151 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) 152 153 /* Nonzero if CODE represents a constant. */ 154 155 #define CONSTANT_CLASS_P(CODE)\ 156 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) 157 158 /* Nonzero if CODE represents a type. */ 159 160 #define TYPE_P(CODE)\ 161 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) 162 163 /* Nonzero if CODE represents a declaration. */ 164 165 #define DECL_P(CODE)\ 166 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) 167 168 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ 169 170 #define VAR_OR_FUNCTION_DECL_P(DECL)\ 171 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) 172 173 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in 174 ascending code order. */ 175 176 #define INDIRECT_REF_P(CODE)\ 177 (TREE_CODE (CODE) == INDIRECT_REF) 178 179 /* Nonzero if CODE represents a reference. */ 180 181 #define REFERENCE_CLASS_P(CODE)\ 182 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) 183 184 /* Nonzero if CODE represents a comparison. */ 185 186 #define COMPARISON_CLASS_P(CODE)\ 187 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) 188 189 /* Nonzero if CODE represents a unary arithmetic expression. */ 190 191 #define UNARY_CLASS_P(CODE)\ 192 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) 193 194 /* Nonzero if CODE represents a binary arithmetic expression. */ 195 196 #define BINARY_CLASS_P(CODE)\ 197 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) 198 199 /* Nonzero if CODE represents a statement expression. */ 200 201 #define STATEMENT_CLASS_P(CODE)\ 202 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) 203 204 /* Nonzero if CODE represents a function call-like expression with a 205 variable-length operand vector. */ 206 207 #define VL_EXP_CLASS_P(CODE)\ 208 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp) 209 210 /* Nonzero if CODE represents any other expression. */ 211 212 #define EXPRESSION_CLASS_P(CODE)\ 213 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) 214 215 /* Returns nonzero iff CODE represents a type or declaration. */ 216 217 #define IS_TYPE_OR_DECL_P(CODE)\ 218 (TYPE_P (CODE) || DECL_P (CODE)) 219 220 /* Returns nonzero iff CLASS is the tree-code class of an 221 expression. */ 222 223 #define IS_EXPR_CODE_CLASS(CLASS)\ 224 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) 225 226 /* Returns nonzero iff NODE is an expression of some kind. */ 227 228 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) 229 230 /* Number of argument-words in each kind of tree-node. */ 231 232 extern const unsigned char tree_code_length[]; 233 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] 234 235 /* Names of tree components. */ 236 237 extern const char *const tree_code_name[]; 238 239 /* When procesing aliases on symtab level, we need the declaration of target. 240 For this reason we need to queue aliases and process them after all declarations 241 has been produced. */ 242 243 typedef struct GTY(()) alias_pair 244 { 245 tree decl; 246 tree target; 247 } alias_pair; 248 249 /* Define gc'd vector type. */ 250 251 extern GTY(()) vec<alias_pair, va_gc> *alias_pairs; 252 253 254 /* Classify which part of the compiler has defined a given builtin function. 256 Note that we assume below that this is no more than two bits. */ 257 enum built_in_class 258 { 259 NOT_BUILT_IN = 0, 260 BUILT_IN_FRONTEND, 261 BUILT_IN_MD, 262 BUILT_IN_NORMAL 263 }; 264 265 /* Last marker used for LTO stremaing of built_in_class. We can not add it 266 to the enum since we need the enumb to fit in 2 bits. */ 267 #define BUILT_IN_LAST (BUILT_IN_NORMAL + 1) 268 269 /* Names for the above. */ 270 extern const char *const built_in_class_names[4]; 271 272 /* Codes that identify the various built in functions 273 so that expand_call can identify them quickly. */ 274 275 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, 276 enum built_in_function 277 { 278 #include "builtins.def" 279 280 /* Complex division routines in libgcc. These are done via builtins 281 because emit_library_call_value can't handle complex values. */ 282 BUILT_IN_COMPLEX_MUL_MIN, 283 BUILT_IN_COMPLEX_MUL_MAX 284 = BUILT_IN_COMPLEX_MUL_MIN 285 + MAX_MODE_COMPLEX_FLOAT 286 - MIN_MODE_COMPLEX_FLOAT, 287 288 BUILT_IN_COMPLEX_DIV_MIN, 289 BUILT_IN_COMPLEX_DIV_MAX 290 = BUILT_IN_COMPLEX_DIV_MIN 291 + MAX_MODE_COMPLEX_FLOAT 292 - MIN_MODE_COMPLEX_FLOAT, 293 294 /* Upper bound on non-language-specific builtins. */ 295 END_BUILTINS 296 }; 297 #undef DEF_BUILTIN 298 299 /* Names for the above. */ 300 extern const char * built_in_names[(int) END_BUILTINS]; 301 302 /* Helper macros for math builtins. */ 303 304 #define BUILTIN_EXP10_P(FN) \ 305 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ 306 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) 307 308 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ 309 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ 310 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) 311 312 #define BUILTIN_SQRT_P(FN) \ 313 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) 314 315 #define BUILTIN_CBRT_P(FN) \ 316 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) 317 318 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) 319 320 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L 321 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R 322 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL 323 324 /* In an OMP_CLAUSE node. */ 326 327 /* Number of operands and names for each clause. */ 328 extern unsigned const char omp_clause_num_ops[]; 329 extern const char * const omp_clause_code_name[]; 330 331 /* Clause codes. Do not reorder, as this is used to index into the tables 332 omp_clause_num_ops and omp_clause_code_name. */ 333 enum omp_clause_code 334 { 335 /* Clause zero is special-cased inside the parser 336 (c_parser_omp_variable_list). */ 337 OMP_CLAUSE_ERROR = 0, 338 339 /* OpenMP clause: private (variable_list). */ 340 OMP_CLAUSE_PRIVATE, 341 342 /* OpenMP clause: shared (variable_list). */ 343 OMP_CLAUSE_SHARED, 344 345 /* OpenMP clause: firstprivate (variable_list). */ 346 OMP_CLAUSE_FIRSTPRIVATE, 347 348 /* OpenMP clause: lastprivate (variable_list). */ 349 OMP_CLAUSE_LASTPRIVATE, 350 351 /* OpenMP clause: reduction (operator:variable_list). 352 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator. 353 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var. 354 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var 355 into the shared one. 356 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL 357 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */ 358 OMP_CLAUSE_REDUCTION, 359 360 /* OpenMP clause: copyin (variable_list). */ 361 OMP_CLAUSE_COPYIN, 362 363 /* OpenMP clause: copyprivate (variable_list). */ 364 OMP_CLAUSE_COPYPRIVATE, 365 366 /* OpenMP clause: if (scalar-expression). */ 367 OMP_CLAUSE_IF, 368 369 /* OpenMP clause: num_threads (integer-expression). */ 370 OMP_CLAUSE_NUM_THREADS, 371 372 /* OpenMP clause: schedule. */ 373 OMP_CLAUSE_SCHEDULE, 374 375 /* OpenMP clause: nowait. */ 376 OMP_CLAUSE_NOWAIT, 377 378 /* OpenMP clause: ordered. */ 379 OMP_CLAUSE_ORDERED, 380 381 /* OpenMP clause: default. */ 382 OMP_CLAUSE_DEFAULT, 383 384 /* OpenMP clause: collapse (constant-integer-expression). */ 385 OMP_CLAUSE_COLLAPSE, 386 387 /* OpenMP clause: untied. */ 388 OMP_CLAUSE_UNTIED, 389 390 /* OpenMP clause: final (scalar-expression). */ 391 OMP_CLAUSE_FINAL, 392 393 /* OpenMP clause: mergeable. */ 394 OMP_CLAUSE_MERGEABLE 395 }; 396 397 /* The definition of tree nodes fills the next several pages. */ 399 400 /* A tree node can represent a data type, a variable, an expression 401 or a statement. Each node has a TREE_CODE which says what kind of 402 thing it represents. Some common codes are: 403 INTEGER_TYPE -- represents a type of integers. 404 ARRAY_TYPE -- represents a type of pointer. 405 VAR_DECL -- represents a declared variable. 406 INTEGER_CST -- represents a constant integer value. 407 PLUS_EXPR -- represents a sum (an expression). 408 409 As for the contents of a tree node: there are some fields 410 that all nodes share. Each TREE_CODE has various special-purpose 411 fields as well. The fields of a node are never accessed directly, 412 always through accessor macros. */ 413 414 /* Every kind of tree node starts with this structure, 415 so all nodes have these fields. 416 417 See the accessor macros, defined below, for documentation of the 418 fields, and the table below which connects the fields and the 419 accessor macros. */ 420 421 struct GTY(()) tree_base { 422 ENUM_BITFIELD(tree_code) code : 16; 423 424 unsigned side_effects_flag : 1; 425 unsigned constant_flag : 1; 426 unsigned addressable_flag : 1; 427 unsigned volatile_flag : 1; 428 unsigned readonly_flag : 1; 429 unsigned asm_written_flag: 1; 430 unsigned nowarning_flag : 1; 431 unsigned visited : 1; 432 433 unsigned used_flag : 1; 434 unsigned nothrow_flag : 1; 435 unsigned static_flag : 1; 436 unsigned public_flag : 1; 437 unsigned private_flag : 1; 438 unsigned protected_flag : 1; 439 unsigned deprecated_flag : 1; 440 unsigned default_def_flag : 1; 441 442 union { 443 /* The bits in the following structure should only be used with 444 accessor macros that constrain inputs with tree checking. */ 445 struct { 446 unsigned lang_flag_0 : 1; 447 unsigned lang_flag_1 : 1; 448 unsigned lang_flag_2 : 1; 449 unsigned lang_flag_3 : 1; 450 unsigned lang_flag_4 : 1; 451 unsigned lang_flag_5 : 1; 452 unsigned lang_flag_6 : 1; 453 unsigned saturating_flag : 1; 454 455 unsigned unsigned_flag : 1; 456 unsigned packed_flag : 1; 457 unsigned user_align : 1; 458 unsigned nameless_flag : 1; 459 unsigned spare0 : 4; 460 461 unsigned spare1 : 8; 462 463 /* This field is only used with TREE_TYPE nodes; the only reason it is 464 present in tree_base instead of tree_type is to save space. The size 465 of the field must be large enough to hold addr_space_t values. */ 466 unsigned address_space : 8; 467 } bits; 468 /* The following fields are present in tree_base to save space. The 469 nodes using them do not require any of the flags above and so can 470 make better use of the 4-byte sized word. */ 471 /* VEC length. This field is only used with TREE_VEC. */ 472 int length; 473 /* SSA version number. This field is only used with SSA_NAME. */ 474 unsigned int version; 475 } GTY((skip(""))) u; 476 }; 477 478 /* The following table lists the uses of each of the above flags and 479 for which types of nodes they are defined. 480 481 addressable_flag: 482 483 TREE_ADDRESSABLE in 484 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL 485 SSA_NAME 486 all types 487 CONSTRUCTOR, IDENTIFIER_NODE 488 STMT_EXPR 489 490 CALL_EXPR_TAILCALL in 491 CALL_EXPR 492 493 CASE_LOW_SEEN in 494 CASE_LABEL_EXPR 495 496 PREDICT_EXPR_OUTCOME in 497 PREDICT_EXPR 498 499 static_flag: 500 501 TREE_STATIC in 502 VAR_DECL, FUNCTION_DECL 503 CONSTRUCTOR 504 505 TREE_NO_TRAMPOLINE in 506 ADDR_EXPR 507 508 BINFO_VIRTUAL_P in 509 TREE_BINFO 510 511 TREE_SYMBOL_REFERENCED in 512 IDENTIFIER_NODE 513 514 CLEANUP_EH_ONLY in 515 TARGET_EXPR, WITH_CLEANUP_EXPR 516 517 TRY_CATCH_IS_CLEANUP in 518 TRY_CATCH_EXPR 519 520 ASM_INPUT_P in 521 ASM_EXPR 522 523 TYPE_REF_CAN_ALIAS_ALL in 524 POINTER_TYPE, REFERENCE_TYPE 525 526 CASE_HIGH_SEEN in 527 CASE_LABEL_EXPR 528 529 ENUM_IS_SCOPED in 530 ENUMERAL_TYPE 531 532 TRANSACTION_EXPR_OUTER in 533 TRANSACTION_EXPR 534 535 public_flag: 536 537 TREE_OVERFLOW in 538 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST 539 540 TREE_PUBLIC in 541 VAR_DECL, FUNCTION_DECL 542 IDENTIFIER_NODE 543 544 ASM_VOLATILE_P in 545 ASM_EXPR 546 547 CALL_EXPR_VA_ARG_PACK in 548 CALL_EXPR 549 550 TYPE_CACHED_VALUES_P in 551 all types 552 553 SAVE_EXPR_RESOLVED_P in 554 SAVE_EXPR 555 556 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in 557 OMP_CLAUSE_LASTPRIVATE 558 559 OMP_CLAUSE_PRIVATE_DEBUG in 560 OMP_CLAUSE_PRIVATE 561 562 TRANSACTION_EXPR_RELAXED in 563 TRANSACTION_EXPR 564 565 private_flag: 566 567 TREE_PRIVATE in 568 all decls 569 570 CALL_EXPR_RETURN_SLOT_OPT in 571 CALL_EXPR 572 573 OMP_SECTION_LAST in 574 OMP_SECTION 575 576 OMP_PARALLEL_COMBINED in 577 OMP_PARALLEL 578 579 OMP_CLAUSE_PRIVATE_OUTER_REF in 580 OMP_CLAUSE_PRIVATE 581 582 TYPE_REF_IS_RVALUE in 583 REFERENCE_TYPE 584 585 ENUM_IS_OPAQUE in 586 ENUMERAL_TYPE 587 588 protected_flag: 589 590 TREE_PROTECTED in 591 BLOCK 592 all decls 593 594 CALL_FROM_THUNK_P and 595 CALL_ALLOCA_FOR_VAR_P in 596 CALL_EXPR 597 598 side_effects_flag: 599 600 TREE_SIDE_EFFECTS in 601 all expressions 602 all decls 603 all constants 604 605 FORCED_LABEL in 606 LABEL_DECL 607 608 volatile_flag: 609 610 TREE_THIS_VOLATILE in 611 all expressions 612 all decls 613 614 TYPE_VOLATILE in 615 all types 616 617 readonly_flag: 618 619 TREE_READONLY in 620 all expressions 621 all decls 622 623 TYPE_READONLY in 624 all types 625 626 constant_flag: 627 628 TREE_CONSTANT in 629 all expressions 630 all decls 631 all constants 632 633 TYPE_SIZES_GIMPLIFIED in 634 all types 635 636 unsigned_flag: 637 638 TYPE_UNSIGNED in 639 all types 640 641 DECL_UNSIGNED in 642 all decls 643 644 asm_written_flag: 645 646 TREE_ASM_WRITTEN in 647 VAR_DECL, FUNCTION_DECL, TYPE_DECL 648 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE 649 BLOCK, STRING_CST 650 651 SSA_NAME_OCCURS_IN_ABNORMAL_PHI in 652 SSA_NAME 653 654 used_flag: 655 656 TREE_USED in 657 all expressions 658 all decls 659 IDENTIFIER_NODE 660 661 nothrow_flag: 662 663 TREE_NOTHROW in 664 CALL_EXPR 665 FUNCTION_DECL 666 667 TYPE_ALIGN_OK in 668 all types 669 670 TREE_THIS_NOTRAP in 671 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF 672 673 SSA_NAME_IN_FREELIST in 674 SSA_NAME 675 676 deprecated_flag: 677 678 TREE_DEPRECATED in 679 all decls 680 all types 681 682 IDENTIFIER_TRANSPARENT_ALIAS in 683 IDENTIFIER_NODE 684 685 visited: 686 687 TREE_VISITED in 688 all trees (used liberally by many passes) 689 690 saturating_flag: 691 692 TYPE_SATURATING in 693 all types 694 695 VAR_DECL_IS_VIRTUAL_OPERAND in 696 VAR_DECL 697 698 nowarning_flag: 699 700 TREE_NO_WARNING in 701 all expressions 702 all decls 703 704 TYPE_ARTIFICIAL in 705 all types 706 707 default_def_flag: 708 709 TYPE_VECTOR_OPAQUE in 710 VECTOR_TYPE 711 712 SSA_NAME_IS_DEFAULT_DEF in 713 SSA_NAME 714 715 DECL_NONLOCAL_FRAME in 716 VAR_DECL 717 */ 718 719 struct GTY(()) tree_typed { 720 struct tree_base base; 721 tree type; 722 }; 723 724 struct GTY(()) tree_common { 725 struct tree_typed typed; 726 tree chain; 727 }; 728 729 #undef DEFTREESTRUCT 730 #define DEFTREESTRUCT(ENUM, NAME) ENUM, 731 enum tree_node_structure_enum { 732 #include "treestruct.def" 733 LAST_TS_ENUM 734 }; 735 #undef DEFTREESTRUCT 736 737 /* Define accessors for the fields that all tree nodes have 738 (though some fields are not used for all kinds of nodes). */ 739 740 /* The tree-code says what kind of node it is. 741 Codes are defined in tree.def. */ 742 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) 743 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) 744 745 /* When checking is enabled, errors will be generated if a tree node 746 is accessed incorrectly. The macros die with a fatal error. */ 747 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 748 749 #define TREE_CHECK(T, CODE) \ 750 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) 751 752 #define TREE_NOT_CHECK(T, CODE) \ 753 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE))) 754 755 #define TREE_CHECK2(T, CODE1, CODE2) \ 756 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) 757 758 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \ 759 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2))) 760 761 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \ 762 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3))) 763 764 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \ 765 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \ 766 (CODE1), (CODE2), (CODE3))) 767 768 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ 769 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ 770 (CODE1), (CODE2), (CODE3), (CODE4))) 771 772 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \ 773 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \ 774 (CODE1), (CODE2), (CODE3), (CODE4))) 775 776 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ 777 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ 778 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) 779 780 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \ 781 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \ 782 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5))) 783 784 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \ 785 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__)) 786 787 #define TREE_CLASS_CHECK(T, CLASS) \ 788 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__)) 789 790 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \ 791 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__)) 792 793 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \ 794 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__)) 795 796 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \ 797 (omp_clause_range_check ((T), (CODE1), (CODE2), \ 798 __FILE__, __LINE__, __FUNCTION__)) 799 800 /* These checks have to be special cased. */ 801 #define EXPR_CHECK(T) \ 802 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__)) 803 804 /* These checks have to be special cased. */ 805 #define NON_TYPE_CHECK(T) \ 806 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__)) 807 808 #define TREE_VEC_ELT_CHECK(T, I) \ 809 (*(CONST_CAST2 (tree *, typeof (T)*, \ 810 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) 811 812 #define OMP_CLAUSE_ELT_CHECK(T, I) \ 813 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))) 814 815 /* Special checks for TREE_OPERANDs. */ 816 #define TREE_OPERAND_CHECK(T, I) \ 817 (*(CONST_CAST2 (tree*, typeof (T)*, \ 818 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))) 819 820 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \ 821 (*(tree_operand_check_code ((T), (CODE), (I), \ 822 __FILE__, __LINE__, __FUNCTION__))) 823 824 /* Nodes are chained together for many purposes. 825 Types are chained together to record them for being output to the debugger 826 (see the function `chain_type'). 827 Decls in the same scope are chained together to record the contents 828 of the scope. 829 Statement nodes for successive statements used to be chained together. 830 Often lists of things are represented by TREE_LIST nodes that 831 are chained together. */ 832 833 #define TREE_CHAIN(NODE) \ 834 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain) 835 836 /* In all nodes that are expressions, this is the data type of the expression. 837 In POINTER_TYPE nodes, this is the type that the pointer points to. 838 In ARRAY_TYPE nodes, this is the type of the elements. 839 In VECTOR_TYPE nodes, this is the type of the elements. */ 840 #define TREE_TYPE(NODE) \ 841 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type) 842 843 extern void tree_contains_struct_check_failed (const_tree, 844 const enum tree_node_structure_enum, 845 const char *, int, const char *) 846 ATTRIBUTE_NORETURN; 847 848 extern void tree_check_failed (const_tree, const char *, int, const char *, 849 ...) ATTRIBUTE_NORETURN; 850 extern void tree_not_check_failed (const_tree, const char *, int, const char *, 851 ...) ATTRIBUTE_NORETURN; 852 extern void tree_class_check_failed (const_tree, const enum tree_code_class, 853 const char *, int, const char *) 854 ATTRIBUTE_NORETURN; 855 extern void tree_range_check_failed (const_tree, const char *, int, 856 const char *, enum tree_code, 857 enum tree_code) 858 ATTRIBUTE_NORETURN; 859 extern void tree_not_class_check_failed (const_tree, 860 const enum tree_code_class, 861 const char *, int, const char *) 862 ATTRIBUTE_NORETURN; 863 extern void tree_vec_elt_check_failed (int, int, const char *, 864 int, const char *) 865 ATTRIBUTE_NORETURN; 866 extern void phi_node_elt_check_failed (int, int, const char *, 867 int, const char *) 868 ATTRIBUTE_NORETURN; 869 extern void tree_operand_check_failed (int, const_tree, 870 const char *, int, const char *) 871 ATTRIBUTE_NORETURN; 872 extern void omp_clause_check_failed (const_tree, const char *, int, 873 const char *, enum omp_clause_code) 874 ATTRIBUTE_NORETURN; 875 extern void omp_clause_operand_check_failed (int, const_tree, const char *, 876 int, const char *) 877 ATTRIBUTE_NORETURN; 878 extern void omp_clause_range_check_failed (const_tree, const char *, int, 879 const char *, enum omp_clause_code, 880 enum omp_clause_code) 881 ATTRIBUTE_NORETURN; 882 883 #else /* not ENABLE_TREE_CHECKING, or not gcc */ 884 885 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) 886 #define TREE_CHECK(T, CODE) (T) 887 #define TREE_NOT_CHECK(T, CODE) (T) 888 #define TREE_CHECK2(T, CODE1, CODE2) (T) 889 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) 890 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) 891 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) 892 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 893 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 894 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 895 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 896 #define TREE_CLASS_CHECK(T, CODE) (T) 897 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) 898 #define EXPR_CHECK(T) (T) 899 #define NON_TYPE_CHECK(T) (T) 900 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) 901 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) 902 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) 903 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) 904 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) 905 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) 906 907 #define TREE_CHAIN(NODE) ((NODE)->common.chain) 908 #define TREE_TYPE(NODE) ((NODE)->typed.type) 909 910 #endif 911 912 #define TREE_BLOCK(NODE) (tree_block (NODE)) 913 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B))) 914 915 #include "tree-check.h" 916 917 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) 918 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) 919 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) 920 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) 921 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) 922 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) 923 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) 924 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) 925 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) 926 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) 927 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) 928 929 #define RECORD_OR_UNION_CHECK(T) \ 930 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 931 #define NOT_RECORD_OR_UNION_CHECK(T) \ 932 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 933 934 #define NUMERICAL_TYPE_CHECK(T) \ 935 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ 936 FIXED_POINT_TYPE) 937 938 /* Here is how primitive or already-canonicalized types' hash codes 939 are made. */ 940 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) 941 942 /* A simple hash function for an arbitrary tree node. This must not be 943 used in hash tables which are saved to a PCH. */ 944 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) 945 946 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ 947 #define CONVERT_EXPR_CODE_P(CODE) \ 948 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) 949 950 /* Similarly, but accept an expressions instead of a tree code. */ 951 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) 952 953 /* Generate case for NOP_EXPR, CONVERT_EXPR. */ 954 955 #define CASE_CONVERT \ 956 case NOP_EXPR: \ 957 case CONVERT_EXPR 958 959 /* Given an expression as a tree, strip any conversion that generates 960 no instruction. Accepts both tree and const_tree arguments since 961 we are not modifying the tree itself. */ 962 963 #define STRIP_NOPS(EXP) \ 964 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) 965 966 /* Like STRIP_NOPS, but don't let the signedness change either. */ 967 968 #define STRIP_SIGN_NOPS(EXP) \ 969 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) 970 971 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ 972 973 #define STRIP_TYPE_NOPS(EXP) \ 974 while ((CONVERT_EXPR_P (EXP) \ 975 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 976 && TREE_OPERAND (EXP, 0) != error_mark_node \ 977 && (TREE_TYPE (EXP) \ 978 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 979 (EXP) = TREE_OPERAND (EXP, 0) 980 981 /* Remove unnecessary type conversions according to 982 tree_ssa_useless_type_conversion. */ 983 984 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ 985 (EXP) = tree_ssa_strip_useless_type_conversions (EXP) 986 987 /* Nonzero if TYPE represents an integral type. Note that we do not 988 include COMPLEX types here. Keep these checks in ascending code 989 order. */ 990 991 #define INTEGRAL_TYPE_P(TYPE) \ 992 (TREE_CODE (TYPE) == ENUMERAL_TYPE \ 993 || TREE_CODE (TYPE) == BOOLEAN_TYPE \ 994 || TREE_CODE (TYPE) == INTEGER_TYPE) 995 996 /* Nonzero if TYPE represents a non-saturating fixed-point type. */ 997 998 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ 999 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) 1000 1001 /* Nonzero if TYPE represents a saturating fixed-point type. */ 1002 1003 #define SAT_FIXED_POINT_TYPE_P(TYPE) \ 1004 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) 1005 1006 /* Nonzero if TYPE represents a fixed-point type. */ 1007 1008 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) 1009 1010 /* Nonzero if TYPE represents a scalar floating-point type. */ 1011 1012 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) 1013 1014 /* Nonzero if TYPE represents a complex floating-point type. */ 1015 1016 #define COMPLEX_FLOAT_TYPE_P(TYPE) \ 1017 (TREE_CODE (TYPE) == COMPLEX_TYPE \ 1018 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 1019 1020 /* Nonzero if TYPE represents a vector integer type. */ 1021 1022 #define VECTOR_INTEGER_TYPE_P(TYPE) \ 1023 (TREE_CODE (TYPE) == VECTOR_TYPE \ 1024 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) 1025 1026 1027 /* Nonzero if TYPE represents a vector floating-point type. */ 1028 1029 #define VECTOR_FLOAT_TYPE_P(TYPE) \ 1030 (TREE_CODE (TYPE) == VECTOR_TYPE \ 1031 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 1032 1033 /* Nonzero if TYPE represents a floating-point type, including complex 1034 and vector floating-point types. The vector and complex check does 1035 not use the previous two macros to enable early folding. */ 1036 1037 #define FLOAT_TYPE_P(TYPE) \ 1038 (SCALAR_FLOAT_TYPE_P (TYPE) \ 1039 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ 1040 || TREE_CODE (TYPE) == VECTOR_TYPE) \ 1041 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) 1042 1043 /* Nonzero if TYPE represents a decimal floating-point type. */ 1044 #define DECIMAL_FLOAT_TYPE_P(TYPE) \ 1045 (SCALAR_FLOAT_TYPE_P (TYPE) \ 1046 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) 1047 1048 /* Nonzero if TYPE is a record or union type. */ 1049 #define RECORD_OR_UNION_TYPE_P(TYPE) \ 1050 (TREE_CODE (TYPE) == RECORD_TYPE \ 1051 || TREE_CODE (TYPE) == UNION_TYPE \ 1052 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) 1053 1054 /* Nonzero if TYPE represents an aggregate (multi-component) type. 1055 Keep these checks in ascending code order. */ 1056 1057 #define AGGREGATE_TYPE_P(TYPE) \ 1058 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) 1059 1060 /* Nonzero if TYPE represents a pointer or reference type. 1061 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in 1062 ascending code order. */ 1063 1064 #define POINTER_TYPE_P(TYPE) \ 1065 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) 1066 1067 /* Nonzero if TYPE represents a pointer to function. */ 1068 #define FUNCTION_POINTER_TYPE_P(TYPE) \ 1069 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE) 1070 1071 /* Nonzero if this type is a complete type. */ 1072 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) 1073 1074 /* Nonzero if this type is the (possibly qualified) void type. */ 1075 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) 1076 1077 /* Nonzero if this type is complete or is cv void. */ 1078 #define COMPLETE_OR_VOID_TYPE_P(NODE) \ 1079 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) 1080 1081 /* Nonzero if this type is complete or is an array with unspecified bound. */ 1082 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ 1083 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) 1084 1085 1086 /* Define many boolean fields that all tree nodes have. */ 1088 1089 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address 1090 of this is needed. So it cannot be in a register. 1091 In a FUNCTION_DECL it has no meaning. 1092 In LABEL_DECL nodes, it means a goto for this label has been seen 1093 from a place outside all binding contours that restore stack levels. 1094 In an artificial SSA_NAME that points to a stack partition with at least 1095 two variables, it means that at least one variable has TREE_ADDRESSABLE. 1096 In ..._TYPE nodes, it means that objects of this type must be fully 1097 addressable. This means that pieces of this object cannot go into 1098 register parameters, for example. If this a function type, this 1099 means that the value must be returned in memory. 1100 In CONSTRUCTOR nodes, it means object constructed must be in memory. 1101 In IDENTIFIER_NODEs, this means that some extern decl for this name 1102 had its address taken. That matters for inline functions. 1103 In a STMT_EXPR, it means we want the result of the enclosed expression. */ 1104 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) 1105 1106 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the 1107 exit of a function. Calls for which this is true are candidates for tail 1108 call optimizations. */ 1109 #define CALL_EXPR_TAILCALL(NODE) \ 1110 (CALL_EXPR_CHECK(NODE)->base.addressable_flag) 1111 1112 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 1113 CASE_LOW operand has been processed. */ 1114 #define CASE_LOW_SEEN(NODE) \ 1115 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) 1116 1117 #define PREDICT_EXPR_OUTCOME(NODE) \ 1118 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)) 1119 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ 1120 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME) 1121 #define PREDICT_EXPR_PREDICTOR(NODE) \ 1122 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0)) 1123 1124 /* In a VAR_DECL, nonzero means allocate static storage. 1125 In a FUNCTION_DECL, nonzero if function has been defined. 1126 In a CONSTRUCTOR, nonzero means allocate static storage. */ 1127 #define TREE_STATIC(NODE) ((NODE)->base.static_flag) 1128 1129 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ 1130 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) 1131 1132 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup 1133 should only be executed if an exception is thrown, not on normal exit 1134 of its scope. */ 1135 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) 1136 1137 /* In a TRY_CATCH_EXPR, means that the handler should be considered a 1138 separate cleanup in honor_protect_cleanup_actions. */ 1139 #define TRY_CATCH_IS_CLEANUP(NODE) \ 1140 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) 1141 1142 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 1143 CASE_HIGH operand has been processed. */ 1144 #define CASE_HIGH_SEEN(NODE) \ 1145 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) 1146 1147 /* Used to mark scoped enums. */ 1148 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) 1149 1150 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ 1151 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) 1152 1153 /* In an expr node (usually a conversion) this means the node was made 1154 implicitly and should not lead to any sort of warning. In a decl node, 1155 warnings concerning the decl should be suppressed. This is used at 1156 least for used-before-set warnings, and it set after one warning is 1157 emitted. */ 1158 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) 1159 1160 /* Used to indicate that this TYPE represents a compiler-generated entity. */ 1161 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) 1162 1163 /* In an IDENTIFIER_NODE, this means that assemble_name was called with 1164 this string as an argument. */ 1165 #define TREE_SYMBOL_REFERENCED(NODE) \ 1166 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) 1167 1168 /* Nonzero in a pointer or reference type means the data pointed to 1169 by this type can alias anything. */ 1170 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ 1171 (PTR_OR_REF_CHECK (NODE)->base.static_flag) 1172 1173 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means 1174 there was an overflow in folding. */ 1175 1176 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) 1177 1178 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ 1179 1180 #define TREE_OVERFLOW_P(EXPR) \ 1181 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) 1182 1183 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, 1184 nonzero means name is to be accessible from outside this translation unit. 1185 In an IDENTIFIER_NODE, nonzero means an external declaration 1186 accessible from outside this translation unit was previously seen 1187 for this name in an inner scope. */ 1188 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) 1189 1190 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector 1191 of cached values, or is something else. */ 1192 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag) 1193 1194 /* In a SAVE_EXPR, indicates that the original expression has already 1195 been substituted with a VAR_DECL that contains the value. */ 1196 #define SAVE_EXPR_RESOLVED_P(NODE) \ 1197 (SAVE_EXPR_CHECK (NODE)->base.public_flag) 1198 1199 /* Set on a CALL_EXPR if this stdarg call should be passed the argument 1200 pack. */ 1201 #define CALL_EXPR_VA_ARG_PACK(NODE) \ 1202 (CALL_EXPR_CHECK(NODE)->base.public_flag) 1203 1204 /* In any expression, decl, or constant, nonzero means it has side effects or 1205 reevaluation of the whole expression could produce a different value. 1206 This is set if any subexpression is a function call, a side effect or a 1207 reference to a volatile variable. In a ..._DECL, this is set only if the 1208 declaration said `volatile'. This will never be set for a constant. */ 1209 #define TREE_SIDE_EFFECTS(NODE) \ 1210 (NON_TYPE_CHECK (NODE)->base.side_effects_flag) 1211 1212 /* In a LABEL_DECL, nonzero means this label had its address taken 1213 and therefore can never be deleted and is a jump target for 1214 computed gotos. */ 1215 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) 1216 1217 /* Nonzero means this expression is volatile in the C sense: 1218 its address should be of type `volatile WHATEVER *'. 1219 In other words, the declared item is volatile qualified. 1220 This is used in _DECL nodes and _REF nodes. 1221 On a FUNCTION_DECL node, this means the function does not 1222 return normally. This is the same effect as setting 1223 the attribute noreturn on the function in C. 1224 1225 In a ..._TYPE node, means this type is volatile-qualified. 1226 But use TYPE_VOLATILE instead of this macro when the node is a type, 1227 because eventually we may make that a different bit. 1228 1229 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ 1230 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) 1231 1232 /* Nonzero means this node will not trap. In an INDIRECT_REF, means 1233 accessing the memory pointed to won't generate a trap. However, 1234 this only applies to an object when used appropriately: it doesn't 1235 mean that writing a READONLY mem won't trap. 1236 1237 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index 1238 (or slice of the array) always belongs to the range of the array. 1239 I.e. that the access will not trap, provided that the access to 1240 the base to the array will not trap. */ 1241 #define TREE_THIS_NOTRAP(NODE) \ 1242 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ 1243 ARRAY_RANGE_REF)->base.nothrow_flag) 1244 1245 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, 1246 nonzero means it may not be the lhs of an assignment. 1247 Nonzero in a FUNCTION_DECL means this function should be treated 1248 as "const" function (can only read its arguments). */ 1249 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) 1250 1251 /* Value of expression is constant. Always on in all ..._CST nodes. May 1252 also appear in an expression or decl where the value is constant. */ 1253 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) 1254 1255 /* Nonzero if NODE, a type, has had its sizes gimplified. */ 1256 #define TYPE_SIZES_GIMPLIFIED(NODE) \ 1257 (TYPE_CHECK (NODE)->base.constant_flag) 1258 1259 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ 1260 #define DECL_UNSIGNED(NODE) \ 1261 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag) 1262 1263 /* In integral and pointer types, means an unsigned type. */ 1264 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag) 1265 1266 /* True if overflow wraps around for the given integral type. That 1267 is, TYPE_MAX + 1 == TYPE_MIN. */ 1268 #define TYPE_OVERFLOW_WRAPS(TYPE) \ 1269 (TYPE_UNSIGNED (TYPE) || flag_wrapv) 1270 1271 /* True if overflow is undefined for the given integral type. We may 1272 optimize on the assumption that values in the type never overflow. 1273 1274 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED 1275 must issue a warning based on warn_strict_overflow. In some cases 1276 it will be appropriate to issue the warning immediately, and in 1277 other cases it will be appropriate to simply set a flag and let the 1278 caller decide whether a warning is appropriate or not. */ 1279 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \ 1280 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow) 1281 1282 /* True if overflow for the given integral type should issue a 1283 trap. */ 1284 #define TYPE_OVERFLOW_TRAPS(TYPE) \ 1285 (!TYPE_UNSIGNED (TYPE) && flag_trapv) 1286 1287 /* True if pointer types have undefined overflow. */ 1288 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow) 1289 1290 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. 1291 Nonzero in a FUNCTION_DECL means that the function has been compiled. 1292 This is interesting in an inline function, since it might not need 1293 to be compiled separately. 1294 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE 1295 or TYPE_DECL if the debugging info for the type has been written. 1296 In a BLOCK node, nonzero if reorder_blocks has already seen this block. 1297 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal 1298 PHI node. */ 1299 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) 1300 1301 /* Nonzero in a _DECL if the name is used in its scope. 1302 Nonzero in an expr node means inhibit warning if value is unused. 1303 In IDENTIFIER_NODEs, this means that some extern decl for this name 1304 was used. 1305 In a BLOCK, this means that the block contains variables that are used. */ 1306 #define TREE_USED(NODE) ((NODE)->base.used_flag) 1307 1308 /* In a FUNCTION_DECL, nonzero means a call to the function cannot 1309 throw an exception. In a CALL_EXPR, nonzero means the call cannot 1310 throw. We can't easily check the node type here as the C++ 1311 frontend also uses this flag (for AGGR_INIT_EXPR). */ 1312 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) 1313 1314 /* In a CALL_EXPR, means that it's safe to use the target of the call 1315 expansion as the return slot for a call that returns in memory. */ 1316 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ 1317 (CALL_EXPR_CHECK (NODE)->base.private_flag) 1318 1319 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is 1320 passed by invisible reference (and the TREE_TYPE is a pointer to the true 1321 type). */ 1322 #define DECL_BY_REFERENCE(NODE) \ 1323 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ 1324 RESULT_DECL)->decl_common.decl_by_reference_flag) 1325 1326 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for 1327 being set. */ 1328 #define DECL_READ_P(NODE) \ 1329 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) 1330 1331 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes 1332 attempting to share the stack slot with some other variable. */ 1333 #define DECL_NONSHAREABLE(NODE) \ 1334 (TREE_CHECK2 (NODE, VAR_DECL, \ 1335 RESULT_DECL)->decl_common.decl_nonshareable_flag) 1336 1337 /* In a CALL_EXPR, means that the call is the jump from a thunk to the 1338 thunked-to function. */ 1339 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) 1340 1341 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that 1342 it has been built for the declaration of a variable-sized object. */ 1343 #define CALL_ALLOCA_FOR_VAR_P(NODE) \ 1344 (CALL_EXPR_CHECK (NODE)->base.protected_flag) 1345 1346 /* In a type, nonzero means that all objects of the type are guaranteed by the 1347 language or front-end to be properly aligned, so we can indicate that a MEM 1348 of this type is aligned at least to the alignment of the type, even if it 1349 doesn't appear that it is. We see this, for example, in object-oriented 1350 languages where a tag field may show this is an object of a more-aligned 1351 variant of the more generic type. 1352 1353 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME 1354 freelist. */ 1355 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) 1356 1357 /* Used in classes in C++. */ 1358 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) 1359 /* Used in classes in C++. */ 1360 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) 1361 1362 /* True if reference type NODE is a C++ rvalue reference. */ 1363 #define TYPE_REF_IS_RVALUE(NODE) \ 1364 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) 1365 1366 /* Nonzero in a _DECL if the use of the name is defined as a 1367 deprecated feature by __attribute__((deprecated)). */ 1368 #define TREE_DEPRECATED(NODE) \ 1369 ((NODE)->base.deprecated_flag) 1370 1371 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose 1372 uses are to be substituted for uses of the TREE_CHAINed identifier. */ 1373 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ 1374 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) 1375 1376 /* In fixed-point types, means a saturating type. */ 1377 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag) 1378 1379 /* These flags are available for each language front end to use internally. */ 1380 #define TREE_LANG_FLAG_0(NODE) \ 1381 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0) 1382 #define TREE_LANG_FLAG_1(NODE) \ 1383 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1) 1384 #define TREE_LANG_FLAG_2(NODE) \ 1385 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2) 1386 #define TREE_LANG_FLAG_3(NODE) \ 1387 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3) 1388 #define TREE_LANG_FLAG_4(NODE) \ 1389 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4) 1390 #define TREE_LANG_FLAG_5(NODE) \ 1391 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5) 1392 #define TREE_LANG_FLAG_6(NODE) \ 1393 (TREE_NOT_CHECK2(NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6) 1394 1395 /* Define additional fields and accessors for nodes representing constants. */ 1397 1398 /* In an INTEGER_CST node. These two together make a 2-word integer. 1399 If the data type is signed, the value is sign-extended to 2 words 1400 even though not all of them may really be in use. 1401 In an unsigned constant shorter than 2 words, the extra bits are 0. */ 1402 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) 1403 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) 1404 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) 1405 1406 #define INT_CST_LT(A, B) \ 1407 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ 1408 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ 1409 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 1410 1411 #define INT_CST_LT_UNSIGNED(A, B) \ 1412 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 1413 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 1414 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 1415 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 1416 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 1417 1418 struct GTY(()) tree_int_cst { 1419 struct tree_typed typed; 1420 double_int int_cst; 1421 }; 1422 1423 /* In a REAL_CST node. struct real_value is an opaque entity, with 1424 manipulators defined in real.h. We don't want tree.h depending on 1425 real.h and transitively on tm.h. */ 1426 struct real_value; 1427 1428 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) 1429 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) 1430 1431 struct GTY(()) tree_real_cst { 1432 struct tree_typed typed; 1433 struct real_value * real_cst_ptr; 1434 }; 1435 1436 /* In a FIXED_CST node. */ 1437 struct fixed_value; 1438 1439 #define TREE_FIXED_CST_PTR(NODE) \ 1440 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) 1441 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) 1442 1443 struct GTY(()) tree_fixed_cst { 1444 struct tree_typed typed; 1445 struct fixed_value * fixed_cst_ptr; 1446 }; 1447 1448 /* In a STRING_CST */ 1449 /* In C terms, this is sizeof, not strlen. */ 1450 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) 1451 #define TREE_STRING_POINTER(NODE) \ 1452 ((const char *)(STRING_CST_CHECK (NODE)->string.str)) 1453 1454 struct GTY(()) tree_string { 1455 struct tree_typed typed; 1456 int length; 1457 char str[1]; 1458 }; 1459 1460 /* In a COMPLEX_CST node. */ 1461 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) 1462 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) 1463 1464 struct GTY(()) tree_complex { 1465 struct tree_typed typed; 1466 tree real; 1467 tree imag; 1468 }; 1469 1470 /* In a VECTOR_CST node. */ 1471 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE))) 1472 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts) 1473 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX]) 1474 1475 struct GTY(()) tree_vector { 1476 struct tree_typed typed; 1477 tree GTY ((length ("TYPE_VECTOR_SUBPARTS (TREE_TYPE ((tree)&%h))"))) elts[1]; 1478 }; 1479 1480 #include "symtab.h" 1482 1483 /* Define fields and accessors for some special-purpose tree nodes. */ 1484 1485 #define IDENTIFIER_LENGTH(NODE) \ 1486 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) 1487 #define IDENTIFIER_POINTER(NODE) \ 1488 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) 1489 #define IDENTIFIER_HASH_VALUE(NODE) \ 1490 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) 1491 1492 /* Translate a hash table identifier pointer to a tree_identifier 1493 pointer, and vice versa. */ 1494 1495 #define HT_IDENT_TO_GCC_IDENT(NODE) \ 1496 ((tree) ((char *) (NODE) - sizeof (struct tree_common))) 1497 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) 1498 1499 struct GTY(()) tree_identifier { 1500 struct tree_common common; 1501 struct ht_identifier id; 1502 }; 1503 1504 /* In a TREE_LIST node. */ 1505 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) 1506 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) 1507 1508 struct GTY(()) tree_list { 1509 struct tree_common common; 1510 tree purpose; 1511 tree value; 1512 }; 1513 1514 /* In a TREE_VEC node. */ 1515 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length) 1516 #define TREE_VEC_END(NODE) \ 1517 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length])) 1518 1519 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) 1520 1521 struct GTY(()) tree_vec { 1522 struct tree_common common; 1523 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; 1524 }; 1525 1526 /* In a CONSTRUCTOR node. */ 1527 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) 1528 #define CONSTRUCTOR_ELT(NODE,IDX) \ 1529 (&(*CONSTRUCTOR_ELTS (NODE))[IDX]) 1530 #define CONSTRUCTOR_NELTS(NODE) \ 1531 (vec_safe_length (CONSTRUCTOR_ELTS (NODE))) 1532 1533 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the 1534 value of each element (stored within VAL). IX must be a scratch variable 1535 of unsigned integer type. */ 1536 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ 1537 for (IX = 0; (IX >= vec_safe_length (V)) \ 1538 ? false \ 1539 : ((VAL = (*(V))[IX].value), \ 1540 true); \ 1541 (IX)++) 1542 1543 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both 1544 the value of each element (stored within VAL) and its index (stored 1545 within INDEX). IX must be a scratch variable of unsigned integer type. */ 1546 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ 1547 for (IX = 0; (IX >= vec_safe_length (V)) \ 1548 ? false \ 1549 : (((void) (VAL = (*V)[IX].value)), \ 1550 (INDEX = (*V)[IX].index), \ 1551 true); \ 1552 (IX)++) 1553 1554 /* Append a new constructor element to V, with the specified INDEX and VAL. */ 1555 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ 1556 do { \ 1557 constructor_elt _ce___ = {INDEX, VALUE}; \ 1558 vec_safe_push ((V), _ce___); \ 1559 } while (0) 1560 1561 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for 1562 constructor output purposes. */ 1563 #define CONSTRUCTOR_BITFIELD_P(NODE) \ 1564 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) 1565 1566 /* True if NODE is a clobber right hand side, an expression of indeterminate 1567 value that clobbers the LHS in a copy instruction. We use a volatile 1568 empty CONSTRUCTOR for this, as it matches most of the necessary semantic. 1569 In particular the volatile flag causes us to not prematurely remove 1570 such clobber instructions. */ 1571 #define TREE_CLOBBER_P(NODE) \ 1572 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) 1573 1574 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the 1575 element. INDEX can optionally design the position of VALUE: in arrays, 1576 it is the index where VALUE has to be placed; in structures, it is the 1577 FIELD_DECL of the member. */ 1578 typedef struct GTY(()) constructor_elt_d { 1579 tree index; 1580 tree value; 1581 } constructor_elt; 1582 1583 1584 struct GTY(()) tree_constructor { 1585 struct tree_typed typed; 1586 vec<constructor_elt, va_gc> *elts; 1587 }; 1588 1589 /* Define fields and accessors for some nodes that represent expressions. */ 1590 1591 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ 1592 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ 1593 && VOID_TYPE_P (TREE_TYPE (NODE)) \ 1594 && integer_zerop (TREE_OPERAND (NODE, 0))) 1595 1596 /* In ordinary expression nodes. */ 1597 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) 1598 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) 1599 1600 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand 1601 length. Its value includes the length operand itself; that is, 1602 the minimum valid length is 1. 1603 Note that we have to bypass the use of TREE_OPERAND to access 1604 that field to avoid infinite recursion in expanding the macros. */ 1605 #define VL_EXP_OPERAND_LENGTH(NODE) \ 1606 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) 1607 1608 /* Nonzero if is_gimple_debug() may possibly hold. */ 1609 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments) 1610 1611 /* In a LOOP_EXPR node. */ 1612 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) 1613 1614 /* The source location of this expression. Non-tree_exp nodes such as 1615 decls and constants can be shared among multiple locations, so 1616 return nothing. */ 1617 #define EXPR_LOCATION(NODE) \ 1618 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) 1619 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) 1620 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \ 1621 != UNKNOWN_LOCATION) 1622 /* The location to be used in a diagnostic about this expression. Do not 1623 use this macro if the location will be assigned to other expressions. */ 1624 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \ 1625 ? (NODE)->exp.locus : input_location) 1626 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \ 1627 ? (NODE)->exp.locus : (LOCUS)) 1628 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) 1629 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) 1630 1631 /* True if a tree is an expression or statement that can have a 1632 location. */ 1633 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) 1634 1635 extern void protected_set_expr_location (tree, location_t); 1636 1637 /* In a TARGET_EXPR node. */ 1638 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) 1639 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) 1640 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) 1641 1642 /* DECL_EXPR accessor. This gives access to the DECL associated with 1643 the given declaration statement. */ 1644 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) 1645 1646 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) 1647 1648 /* COMPOUND_LITERAL_EXPR accessors. */ 1649 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ 1650 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) 1651 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ 1652 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) 1653 1654 /* SWITCH_EXPR accessors. These give access to the condition, body and 1655 original condition type (before any compiler conversions) 1656 of the switch statement, respectively. */ 1657 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) 1658 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) 1659 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) 1660 1661 /* CASE_LABEL_EXPR accessors. These give access to the high and low values 1662 of a case label, respectively. */ 1663 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) 1664 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) 1665 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) 1666 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) 1667 1668 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match 1669 corresponding MEM_REF operands. */ 1670 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) 1671 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) 1672 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) 1673 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) 1674 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) 1675 1676 /* The operands of a BIND_EXPR. */ 1677 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) 1678 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) 1679 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) 1680 1681 /* GOTO_EXPR accessor. This gives access to the label associated with 1682 a goto statement. */ 1683 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) 1684 1685 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the 1686 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and 1687 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the 1688 statement. */ 1689 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) 1690 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) 1691 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) 1692 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) 1693 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) 1694 /* Nonzero if we want to create an ASM_INPUT instead of an 1695 ASM_OPERAND with no operands. */ 1696 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) 1697 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) 1698 1699 /* COND_EXPR accessors. */ 1700 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) 1701 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) 1702 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) 1703 1704 /* Accessors for the chains of recurrences. */ 1705 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) 1706 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) 1707 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) 1708 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) 1709 1710 /* LABEL_EXPR accessor. This gives access to the label associated with 1711 the given label expression. */ 1712 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) 1713 1714 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other 1715 accessors for SSA operands. */ 1716 1717 /* CATCH_EXPR accessors. */ 1718 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) 1719 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) 1720 1721 /* EH_FILTER_EXPR accessors. */ 1722 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) 1723 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) 1724 1725 /* OBJ_TYPE_REF accessors. */ 1726 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) 1727 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) 1728 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) 1729 1730 /* ASSERT_EXPR accessors. */ 1731 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) 1732 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) 1733 1734 /* CALL_EXPR accessors. 1735 */ 1736 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) 1737 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) 1738 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) 1739 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3) 1740 1741 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. 1742 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if 1743 the argument count is zero when checking is enabled. Instead, do 1744 the pointer arithmetic to advance past the 3 fixed operands in a 1745 CALL_EXPR. That produces a valid pointer to just past the end of the 1746 operand array, even if it's not valid to dereference it. */ 1747 #define CALL_EXPR_ARGP(NODE) \ 1748 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) 1749 1750 /* TM directives and accessors. */ 1751 #define TRANSACTION_EXPR_BODY(NODE) \ 1752 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) 1753 #define TRANSACTION_EXPR_OUTER(NODE) \ 1754 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) 1755 #define TRANSACTION_EXPR_RELAXED(NODE) \ 1756 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) 1757 1758 /* OpenMP directive and clause accessors. */ 1759 1760 #define OMP_BODY(NODE) \ 1761 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0) 1762 #define OMP_CLAUSES(NODE) \ 1763 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1) 1764 1765 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) 1766 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) 1767 1768 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) 1769 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) 1770 1771 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) 1772 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) 1773 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) 1774 1775 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0) 1776 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1) 1777 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2) 1778 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3) 1779 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4) 1780 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5) 1781 1782 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) 1783 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) 1784 1785 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) 1786 1787 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) 1788 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) 1789 1790 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) 1791 1792 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) 1793 1794 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) 1795 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) 1796 1797 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) 1798 #define OMP_CLAUSE_DECL(NODE) \ 1799 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ 1800 OMP_CLAUSE_PRIVATE, \ 1801 OMP_CLAUSE_COPYPRIVATE), 0) 1802 #define OMP_CLAUSE_HAS_LOCATION(NODE) \ 1803 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \ 1804 != UNKNOWN_LOCATION) 1805 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus 1806 1807 /* True on an OMP_SECTION statement that was the last lexical member. 1808 This status is meaningful in the implementation of lastprivate. */ 1809 #define OMP_SECTION_LAST(NODE) \ 1810 (OMP_SECTION_CHECK (NODE)->base.private_flag) 1811 1812 /* True on an OMP_PARALLEL statement if it represents an explicit 1813 combined parallel work-sharing constructs. */ 1814 #define OMP_PARALLEL_COMBINED(NODE) \ 1815 (OMP_PARALLEL_CHECK (NODE)->base.private_flag) 1816 1817 /* True on a PRIVATE clause if its decl is kept around for debugging 1818 information only and its DECL_VALUE_EXPR is supposed to point 1819 to what it has been remapped to. */ 1820 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ 1821 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) 1822 1823 /* True on a PRIVATE clause if ctor needs access to outer region's 1824 variable. */ 1825 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ 1826 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) 1827 1828 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same 1829 decl is present in the chain. */ 1830 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ 1831 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) 1832 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ 1833 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ 1834 OMP_CLAUSE_LASTPRIVATE),\ 1835 1) 1836 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ 1837 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1838 1839 #define OMP_CLAUSE_FINAL_EXPR(NODE) \ 1840 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) 1841 #define OMP_CLAUSE_IF_EXPR(NODE) \ 1842 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) 1843 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ 1844 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) 1845 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ 1846 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) 1847 1848 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ 1849 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) 1850 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ 1851 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) 1852 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ 1853 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) 1854 1855 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ 1856 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) 1857 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ 1858 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) 1859 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ 1860 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) 1861 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ 1862 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1863 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ 1864 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge 1865 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ 1866 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) 1867 1868 enum omp_clause_schedule_kind 1869 { 1870 OMP_CLAUSE_SCHEDULE_STATIC, 1871 OMP_CLAUSE_SCHEDULE_DYNAMIC, 1872 OMP_CLAUSE_SCHEDULE_GUIDED, 1873 OMP_CLAUSE_SCHEDULE_AUTO, 1874 OMP_CLAUSE_SCHEDULE_RUNTIME 1875 }; 1876 1877 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ 1878 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) 1879 1880 enum omp_clause_default_kind 1881 { 1882 OMP_CLAUSE_DEFAULT_UNSPECIFIED, 1883 OMP_CLAUSE_DEFAULT_SHARED, 1884 OMP_CLAUSE_DEFAULT_NONE, 1885 OMP_CLAUSE_DEFAULT_PRIVATE, 1886 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE 1887 }; 1888 1889 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ 1890 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) 1891 1892 struct GTY(()) tree_exp { 1893 struct tree_typed typed; 1894 location_t locus; 1895 tree GTY ((special ("tree_exp"), 1896 desc ("TREE_CODE ((tree) &%0)"))) 1897 operands[1]; 1898 }; 1899 1900 /* SSA_NAME accessors. */ 1902 1903 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE 1904 if there is no name associated with it. */ 1905 #define SSA_NAME_IDENTIFIER(NODE) \ 1906 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \ 1907 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ 1908 ? (NODE)->ssa_name.var \ 1909 : DECL_NAME ((NODE)->ssa_name.var)) \ 1910 : NULL_TREE) 1911 1912 /* Returns the variable being referenced. This can be NULL_TREE for 1913 temporaries not associated with any user variable. 1914 Once released, this is the only field that can be relied upon. */ 1915 #define SSA_NAME_VAR(NODE) \ 1916 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \ 1917 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \ 1918 ? NULL_TREE : (NODE)->ssa_name.var) 1919 1920 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \ 1921 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0) 1922 1923 /* Returns the statement which defines this SSA name. */ 1924 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt 1925 1926 /* Returns the SSA version number of this SSA name. Note that in 1927 tree SSA, version numbers are not per variable and may be recycled. */ 1928 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version 1929 1930 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are 1931 never output, so we can safely use the ASM_WRITTEN_FLAG for this 1932 status bit. */ 1933 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ 1934 SSA_NAME_CHECK (NODE)->base.asm_written_flag 1935 1936 /* Nonzero if this SSA_NAME expression is currently on the free list of 1937 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing 1938 has no meaning for an SSA_NAME. */ 1939 #define SSA_NAME_IN_FREE_LIST(NODE) \ 1940 SSA_NAME_CHECK (NODE)->base.nothrow_flag 1941 1942 /* Nonzero if this SSA_NAME is the default definition for the 1943 underlying symbol. A default SSA name is created for symbol S if 1944 the very first reference to S in the function is a read operation. 1945 Default definitions are always created by an empty statement and 1946 belong to no basic block. */ 1947 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ 1948 SSA_NAME_CHECK (NODE)->base.default_def_flag 1949 1950 /* Attributes for SSA_NAMEs for pointer-type variables. */ 1951 #define SSA_NAME_PTR_INFO(N) \ 1952 SSA_NAME_CHECK (N)->ssa_name.ptr_info 1953 1954 /* Defined in tree-flow.h. */ 1955 struct ptr_info_def; 1956 1957 /* Immediate use linking structure. This structure is used for maintaining 1958 a doubly linked list of uses of an SSA_NAME. */ 1959 typedef struct GTY(()) ssa_use_operand_d { 1960 struct ssa_use_operand_d* GTY((skip(""))) prev; 1961 struct ssa_use_operand_d* GTY((skip(""))) next; 1962 /* Immediate uses for a given SSA name are maintained as a cyclic 1963 list. To recognize the root of this list, the location field 1964 needs to point to the original SSA name. Since statements and 1965 SSA names are of different data types, we need this union. See 1966 the explanation in struct immediate_use_iterator_d. */ 1967 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc; 1968 tree *GTY((skip(""))) use; 1969 } ssa_use_operand_t; 1970 1971 /* Return the immediate_use information for an SSA_NAME. */ 1972 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses 1973 1974 struct GTY(()) tree_ssa_name { 1975 struct tree_typed typed; 1976 1977 /* _DECL wrapped by this SSA name. */ 1978 tree var; 1979 1980 /* Statement that defines this SSA name. */ 1981 gimple def_stmt; 1982 1983 /* Pointer attributes used for alias analysis. */ 1984 struct ptr_info_def *ptr_info; 1985 1986 /* Immediate uses list for this SSA_NAME. */ 1987 struct ssa_use_operand_d imm_uses; 1988 }; 1989 1990 struct GTY(()) phi_arg_d { 1992 /* imm_use MUST be the first element in struct because we do some 1993 pointer arithmetic with it. See phi_arg_index_from_use. */ 1994 struct ssa_use_operand_d imm_use; 1995 tree def; 1996 location_t locus; 1997 }; 1998 1999 2000 #define OMP_CLAUSE_CODE(NODE) \ 2002 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code 2003 2004 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ 2005 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) 2006 2007 #define OMP_CLAUSE_CODE(NODE) \ 2008 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code 2009 2010 #define OMP_CLAUSE_OPERAND(NODE, I) \ 2011 OMP_CLAUSE_ELT_CHECK (NODE, I) 2012 2013 struct GTY(()) tree_omp_clause { 2014 struct tree_common common; 2015 location_t locus; 2016 enum omp_clause_code code; 2017 union omp_clause_subcode { 2018 enum omp_clause_default_kind default_kind; 2019 enum omp_clause_schedule_kind schedule_kind; 2020 enum tree_code reduction_code; 2021 } GTY ((skip)) subcode; 2022 2023 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's 2024 usage. */ 2025 gimple_seq gimple_reduction_init; 2026 gimple_seq gimple_reduction_merge; 2027 2028 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1]; 2029 }; 2030 2031 2033 /* In a BLOCK node. */ 2034 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) 2035 #define BLOCK_NONLOCALIZED_VARS(NODE) \ 2036 (BLOCK_CHECK (NODE)->block.nonlocalized_vars) 2037 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ 2038 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE)) 2039 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N] 2040 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) 2041 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) 2042 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) 2043 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) 2044 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) 2045 2046 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */ 2047 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag) 2048 2049 /* An index number for this block. These values are not guaranteed to 2050 be unique across functions -- whether or not they are depends on 2051 the debugging output format in use. */ 2052 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) 2053 2054 /* If block reordering splits a lexical block into discontiguous 2055 address ranges, we'll make a copy of the original block. 2056 2057 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. 2058 In that case, we have one source block that has been replicated 2059 (through inlining or unrolling) into many logical blocks, and that 2060 these logical blocks have different physical variables in them. 2061 2062 In this case, we have one logical block split into several 2063 non-contiguous address ranges. Most debug formats can't actually 2064 represent this idea directly, so we fake it by creating multiple 2065 logical blocks with the same variables in them. However, for those 2066 that do support non-contiguous regions, these allow the original 2067 logical block to be reconstructed, along with the set of address 2068 ranges. 2069 2070 One of the logical block fragments is arbitrarily chosen to be 2071 the ORIGIN. The other fragments will point to the origin via 2072 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer 2073 be null. The list of fragments will be chained through 2074 BLOCK_FRAGMENT_CHAIN from the origin. */ 2075 2076 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) 2077 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) 2078 2079 /* For an inlined function, this gives the location where it was called 2080 from. This is only set in the top level block, which corresponds to the 2081 inlined function scope. This is used in the debug output routines. */ 2082 2083 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) 2084 2085 struct GTY(()) tree_block { 2086 struct tree_base base; 2087 tree chain; 2088 2089 unsigned abstract_flag : 1; 2090 unsigned block_num : 31; 2091 2092 location_t locus; 2093 2094 tree vars; 2095 vec<tree, va_gc> *nonlocalized_vars; 2096 2097 tree subblocks; 2098 tree supercontext; 2099 tree abstract_origin; 2100 tree fragment_origin; 2101 tree fragment_chain; 2102 }; 2103 2104 /* Define fields and accessors for nodes representing data types. */ 2106 2107 /* See tree.def for documentation of the use of these fields. 2108 Look at the documentation of the various ..._TYPE tree codes. 2109 2110 Note that the type.values, type.minval, and type.maxval fields are 2111 overloaded and used for different macros in different kinds of types. 2112 Each macro must check to ensure the tree node is of the proper kind of 2113 type. Note also that some of the front-ends also overload these fields, 2114 so they must be checked as well. */ 2115 2116 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) 2117 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) 2118 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) 2119 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) 2120 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) 2121 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) 2122 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) 2123 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) 2124 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) 2125 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) 2126 2127 /* Vector types need to check target flags to determine type. */ 2128 extern enum machine_mode vector_type_mode (const_tree); 2129 #define TYPE_MODE(NODE) \ 2130 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \ 2131 ? vector_type_mode (NODE) : (NODE)->type_common.mode) 2132 #define SET_TYPE_MODE(NODE, MODE) \ 2133 (TYPE_CHECK (NODE)->type_common.mode = (MODE)) 2134 2135 /* The "canonical" type for this type node, which is used by frontends to 2136 compare the type for equality with another type. If two types are 2137 equal (based on the semantics of the language), then they will have 2138 equivalent TYPE_CANONICAL entries. 2139 2140 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus 2141 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot 2142 be used for comparison against other types. Instead, the type is 2143 said to require structural equality checks, described in 2144 TYPE_STRUCTURAL_EQUALITY_P. 2145 2146 For unqualified aggregate and function types the middle-end relies on 2147 TYPE_CANONICAL to tell whether two variables can be assigned 2148 to each other without a conversion. The middle-end also makes sure 2149 to assign the same alias-sets to the type partition with equal 2150 TYPE_CANONICAL of their unqualified variants. */ 2151 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) 2152 /* Indicates that the type node requires structural equality 2153 checks. The compiler will need to look at the composition of the 2154 type to determine whether it is equal to another type, rather than 2155 just comparing canonical type pointers. For instance, we would need 2156 to look at the return and parameter types of a FUNCTION_TYPE 2157 node. */ 2158 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) 2159 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the 2160 type node requires structural equality. */ 2161 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) 2162 2163 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) 2164 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) 2165 2166 /* The (language-specific) typed-based alias set for this type. 2167 Objects whose TYPE_ALIAS_SETs are different cannot alias each 2168 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been 2169 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this 2170 type can alias objects of any type. */ 2171 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) 2172 2173 /* Nonzero iff the typed-based alias set for this type has been 2174 calculated. */ 2175 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ 2176 (TYPE_CHECK (NODE)->type_common.alias_set != -1) 2177 2178 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply 2179 to this type. */ 2180 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) 2181 2182 /* The alignment necessary for objects of this type. 2183 The value is an int, measured in bits. */ 2184 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align) 2185 2186 /* 1 if the alignment for this type was requested by "aligned" attribute, 2187 0 if it is the default for this type. */ 2188 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align) 2189 2190 /* The alignment for NODE, in bytes. */ 2191 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) 2192 2193 /* If your language allows you to declare types, and you want debug info 2194 for them, then you need to generate corresponding TYPE_DECL nodes. 2195 These "stub" TYPE_DECL nodes have no name, and simply point at the 2196 type node. You then set the TYPE_STUB_DECL field of the type node 2197 to point back at the TYPE_DECL node. This allows the debug routines 2198 to know that the two nodes represent the same type, so that we only 2199 get one debug info record for them. */ 2200 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) 2201 2202 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means 2203 the type has BLKmode only because it lacks the alignment required for 2204 its size. */ 2205 #define TYPE_NO_FORCE_BLK(NODE) \ 2206 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) 2207 2208 /* Nonzero in a type considered volatile as a whole. */ 2209 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) 2210 2211 /* Means this type is const-qualified. */ 2212 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) 2213 2214 /* If nonzero, this type is `restrict'-qualified, in the C sense of 2215 the term. */ 2216 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) 2217 2218 /* If nonzero, type's name shouldn't be emitted into debug info. */ 2219 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag) 2220 2221 /* The address space the type is in. */ 2222 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space) 2223 2224 /* There is a TYPE_QUAL value for each type qualifier. They can be 2225 combined by bitwise-or to form the complete set of qualifiers for a 2226 type. */ 2227 enum cv_qualifier 2228 { 2229 TYPE_UNQUALIFIED = 0x0, 2230 TYPE_QUAL_CONST = 0x1, 2231 TYPE_QUAL_VOLATILE = 0x2, 2232 TYPE_QUAL_RESTRICT = 0x4 2233 }; 2234 2235 /* Encode/decode the named memory support as part of the qualifier. If more 2236 than 8 qualifiers are added, these macros need to be adjusted. */ 2237 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) 2238 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) 2239 2240 /* Return all qualifiers except for the address space qualifiers. */ 2241 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) 2242 2243 /* Only keep the address space out of the qualifiers and discard the other 2244 qualifiers. */ 2245 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) 2246 2247 /* The set of type qualifiers for this type. */ 2248 #define TYPE_QUALS(NODE) \ 2249 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2250 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2251 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ 2252 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) 2253 2254 /* The same as TYPE_QUALS without the address space qualifications. */ 2255 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ 2256 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2257 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2258 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) 2259 2260 /* These flags are available for each language front end to use internally. */ 2261 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) 2262 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) 2263 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) 2264 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) 2265 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) 2266 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) 2267 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) 2268 2269 /* Used to keep track of visited nodes in tree traversals. This is set to 2270 0 by copy_node and make_node. */ 2271 #define TREE_VISITED(NODE) ((NODE)->base.visited) 2272 2273 /* If set in an ARRAY_TYPE, indicates a string type (for languages 2274 that distinguish string from array of char). 2275 If set in a INTEGER_TYPE, indicates a character type. */ 2276 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) 2277 2278 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ 2279 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ 2280 (((unsigned HOST_WIDE_INT) 1) \ 2281 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision) 2282 2283 /* Set precision to n when we have 2^n sub-parts of the vector. */ 2284 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ 2285 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X)) 2286 2287 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings 2288 about missing conversions to other vector types of the same size. */ 2289 #define TYPE_VECTOR_OPAQUE(NODE) \ 2290 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) 2291 2292 /* Indicates that objects of this type must be initialized by calling a 2293 function when they are created. */ 2294 #define TYPE_NEEDS_CONSTRUCTING(NODE) \ 2295 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) 2296 2297 /* Indicates that a UNION_TYPE object should be passed the same way that 2298 the first union alternative would be passed, or that a RECORD_TYPE 2299 object should be passed the same way that the first (and only) member 2300 would be passed. */ 2301 #define TYPE_TRANSPARENT_AGGR(NODE) \ 2302 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) 2303 2304 /* For an ARRAY_TYPE, indicates that it is not permitted to take the 2305 address of a component of the type. This is the counterpart of 2306 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ 2307 #define TYPE_NONALIASED_COMPONENT(NODE) \ 2308 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) 2309 2310 /* Indicated that objects of this type should be laid out in as 2311 compact a way as possible. */ 2312 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag) 2313 2314 /* Used by type_contains_placeholder_p to avoid recomputation. 2315 Values are: 0 (unknown), 1 (false), 2 (true). Never access 2316 this field directly. */ 2317 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ 2318 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) 2319 2320 /* The debug output functions use the symtab union field to store 2321 information specific to the debugging format. The different debug 2322 output hooks store different types in the union field. These three 2323 macros are used to access different fields in the union. The debug 2324 hooks are responsible for consistently using only a specific 2325 macro. */ 2326 2327 /* Symtab field as an integer. Used by stabs generator in dbxout.c to 2328 hold the type's number in the generated stabs. */ 2329 #define TYPE_SYMTAB_ADDRESS(NODE) \ 2330 (TYPE_CHECK (NODE)->type_common.symtab.address) 2331 2332 /* Symtab field as a string. Used by COFF generator in sdbout.c to 2333 hold struct/union type tag names. */ 2334 #define TYPE_SYMTAB_POINTER(NODE) \ 2335 (TYPE_CHECK (NODE)->type_common.symtab.pointer) 2336 2337 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator 2338 in dwarf2out.c to point to the DIE generated for the type. */ 2339 #define TYPE_SYMTAB_DIE(NODE) \ 2340 (TYPE_CHECK (NODE)->type_common.symtab.die) 2341 2342 /* The garbage collector needs to know the interpretation of the 2343 symtab field. These constants represent the different types in the 2344 union. */ 2345 2346 #define TYPE_SYMTAB_IS_ADDRESS (0) 2347 #define TYPE_SYMTAB_IS_POINTER (1) 2348 #define TYPE_SYMTAB_IS_DIE (2) 2349 2350 struct die_struct; 2351 2352 struct GTY(()) tree_type_common { 2353 struct tree_common common; 2354 tree size; 2355 tree size_unit; 2356 tree attributes; 2357 unsigned int uid; 2358 2359 unsigned int precision : 10; 2360 unsigned no_force_blk_flag : 1; 2361 unsigned needs_constructing_flag : 1; 2362 unsigned transparent_aggr_flag : 1; 2363 unsigned restrict_flag : 1; 2364 unsigned contains_placeholder_bits : 2; 2365 2366 ENUM_BITFIELD(machine_mode) mode : 8; 2367 2368 unsigned string_flag : 1; 2369 unsigned lang_flag_0 : 1; 2370 unsigned lang_flag_1 : 1; 2371 unsigned lang_flag_2 : 1; 2372 unsigned lang_flag_3 : 1; 2373 unsigned lang_flag_4 : 1; 2374 unsigned lang_flag_5 : 1; 2375 unsigned lang_flag_6 : 1; 2376 2377 unsigned int align; 2378 alias_set_type alias_set; 2379 tree pointer_to; 2380 tree reference_to; 2381 union tree_type_symtab { 2382 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address; 2383 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer; 2384 struct die_struct * GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die; 2385 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab; 2386 tree name; 2387 tree next_variant; 2388 tree main_variant; 2389 tree context; 2390 tree canonical; 2391 }; 2392 2393 #define TYPE_LANG_SPECIFIC(NODE) \ 2394 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) 2395 2396 struct GTY(()) tree_type_with_lang_specific { 2397 struct tree_type_common common; 2398 /* Points to a structure whose details depend on the language in use. */ 2399 struct lang_type *lang_specific; 2400 }; 2401 2402 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) 2403 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) 2404 #define TYPE_FIELDS(NODE) \ 2405 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) 2406 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values) 2407 #define TYPE_ARG_TYPES(NODE) \ 2408 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) 2409 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values) 2410 2411 #define TYPE_METHODS(NODE) \ 2412 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) 2413 #define TYPE_VFIELD(NODE) \ 2414 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) 2415 #define TYPE_METHOD_BASETYPE(NODE) \ 2416 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) 2417 #define TYPE_OFFSET_BASETYPE(NODE) \ 2418 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) 2419 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) 2420 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) 2421 #define TYPE_NEXT_PTR_TO(NODE) \ 2422 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) 2423 #define TYPE_NEXT_REF_TO(NODE) \ 2424 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) 2425 #define TYPE_MIN_VALUE(NODE) \ 2426 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) 2427 #define TYPE_MAX_VALUE(NODE) \ 2428 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) 2429 2430 /* If non-NULL, this is an upper bound of the size (in bytes) of an 2431 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be 2432 allocated. */ 2433 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ 2434 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) 2435 2436 /* For record and union types, information about this type, as a base type 2437 for itself. */ 2438 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) 2439 2440 /* For non record and union types, used in a language-dependent way. */ 2441 #define TYPE_LANG_SLOT_1(NODE) \ 2442 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) 2443 2444 struct GTY(()) tree_type_non_common { 2445 struct tree_type_with_lang_specific with_lang_specific; 2446 tree values; 2447 tree minval; 2448 tree maxval; 2449 tree binfo; 2450 }; 2451 2452 /* Define accessor macros for information about type inheritance 2454 and basetypes. 2455 2456 A "basetype" means a particular usage of a data type for inheritance 2457 in another type. Each such basetype usage has its own "binfo" 2458 object to describe it. The binfo object is a TREE_VEC node. 2459 2460 Inheritance is represented by the binfo nodes allocated for a 2461 given type. For example, given types C and D, such that D is 2462 inherited by C, 3 binfo nodes will be allocated: one for describing 2463 the binfo properties of C, similarly one for D, and one for 2464 describing the binfo properties of D as a base type for C. 2465 Thus, given a pointer to class C, one can get a pointer to the binfo 2466 of D acting as a basetype for C by looking at C's binfo's basetypes. */ 2467 2468 /* BINFO specific flags. */ 2469 2470 /* Nonzero means that the derivation chain is via a `virtual' declaration. */ 2471 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) 2472 2473 /* Flags for language dependent use. */ 2474 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) 2475 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) 2476 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) 2477 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) 2478 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) 2479 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) 2480 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) 2481 2482 /* The actual data type node being inherited in this basetype. */ 2483 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) 2484 2485 /* The offset where this basetype appears in its containing type. 2486 BINFO_OFFSET slot holds the offset (in bytes) 2487 from the base of the complete object to the base of the part of the 2488 object that is allocated on behalf of this `type'. 2489 This is always 0 except when there is multiple inheritance. */ 2490 2491 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) 2492 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) 2493 2494 /* The virtual function table belonging to this basetype. Virtual 2495 function tables provide a mechanism for run-time method dispatching. 2496 The entries of a virtual function table are language-dependent. */ 2497 2498 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) 2499 2500 /* The virtual functions in the virtual function table. This is 2501 a TREE_LIST that is used as an initial approximation for building 2502 a virtual function table for this basetype. */ 2503 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) 2504 2505 /* A vector of binfos for the direct basetypes inherited by this 2506 basetype. 2507 2508 If this basetype describes type D as inherited in C, and if the 2509 basetypes of D are E and F, then this vector contains binfos for 2510 inheritance of E and F by C. */ 2511 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) 2512 2513 /* The number of basetypes for NODE. */ 2514 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ()) 2515 2516 /* Accessor macro to get to the Nth base binfo of this binfo. */ 2517 #define BINFO_BASE_BINFO(NODE,N) \ 2518 ((*BINFO_BASE_BINFOS (NODE))[(N)]) 2519 #define BINFO_BASE_ITERATE(NODE,N,B) \ 2520 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B))) 2521 #define BINFO_BASE_APPEND(NODE,T) \ 2522 (BINFO_BASE_BINFOS (NODE)->quick_push ((T))) 2523 2524 /* For a BINFO record describing a virtual base class, i.e., one where 2525 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual 2526 base. The actual contents are language-dependent. In the C++ 2527 front-end this field is an INTEGER_CST giving an offset into the 2528 vtable where the offset to the virtual base can be found. */ 2529 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) 2530 2531 /* Indicates the accesses this binfo has to its bases. The values are 2532 access_public_node, access_protected_node or access_private_node. 2533 If this array is not present, public access is implied. */ 2534 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) 2535 2536 #define BINFO_BASE_ACCESS(NODE,N) \ 2537 (*BINFO_BASE_ACCESSES (NODE))[(N)] 2538 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ 2539 BINFO_BASE_ACCESSES (NODE)->quick_push ((T)) 2540 2541 /* The index in the VTT where this subobject's sub-VTT can be found. 2542 NULL_TREE if there is no sub-VTT. */ 2543 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) 2544 2545 /* The index in the VTT where the vptr for this subobject can be 2546 found. NULL_TREE if there is no secondary vptr in the VTT. */ 2547 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) 2548 2549 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base 2550 inheriting this base for non-virtual bases. For virtual bases it 2551 points either to the binfo for which this is a primary binfo, or to 2552 the binfo of the most derived type. */ 2553 #define BINFO_INHERITANCE_CHAIN(NODE) \ 2554 (TREE_BINFO_CHECK(NODE)->binfo.inheritance) 2555 2556 struct GTY (()) tree_binfo { 2557 struct tree_common common; 2558 2559 tree offset; 2560 tree vtable; 2561 tree virtuals; 2562 tree vptr_field; 2563 vec<tree, va_gc> *base_accesses; 2564 tree inheritance; 2565 2566 tree vtt_subvtt; 2567 tree vtt_vptr; 2568 2569 vec<tree, va_gc> base_binfos; 2570 }; 2571 2572 2573 /* Define fields and accessors for nodes representing declared names. */ 2575 2576 /* Nonzero if DECL represents an SSA name or a variable that can possibly 2577 have an associated SSA name. */ 2578 #define SSA_VAR_P(DECL) \ 2579 (TREE_CODE (DECL) == VAR_DECL \ 2580 || TREE_CODE (DECL) == PARM_DECL \ 2581 || TREE_CODE (DECL) == RESULT_DECL \ 2582 || TREE_CODE (DECL) == SSA_NAME) 2583 2584 2585 2586 /* Enumerate visibility settings. */ 2587 #ifndef SYMBOL_VISIBILITY_DEFINED 2588 #define SYMBOL_VISIBILITY_DEFINED 2589 enum symbol_visibility 2590 { 2591 VISIBILITY_DEFAULT, 2592 VISIBILITY_PROTECTED, 2593 VISIBILITY_HIDDEN, 2594 VISIBILITY_INTERNAL 2595 }; 2596 #endif 2597 2598 struct function; 2599 2600 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) 2601 2602 /* This is the name of the object as written by the user. 2603 It is an IDENTIFIER_NODE. */ 2604 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) 2605 2606 /* Every ..._DECL node gets a unique number. */ 2607 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) 2608 2609 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous 2610 uses. */ 2611 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) 2612 2613 /* Every ..._DECL node gets a unique number that stays the same even 2614 when the decl is copied by the inliner once it is set. */ 2615 #define DECL_PT_UID(NODE) \ 2616 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ 2617 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) 2618 /* Initialize the ..._DECL node pt-uid to the decls uid. */ 2619 #define SET_DECL_PT_UID(NODE, UID) \ 2620 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) 2621 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to 2622 be preserved when copyin the decl. */ 2623 #define DECL_PT_UID_SET_P(NODE) \ 2624 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) 2625 2626 /* These two fields describe where in the source code the declaration 2627 was. If the declaration appears in several places (as for a C 2628 function that is declared first and then defined later), this 2629 information should refer to the definition. */ 2630 #define DECL_SOURCE_LOCATION(NODE) \ 2631 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) 2632 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) 2633 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) 2634 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE)) 2635 #define DECL_IS_BUILTIN(DECL) \ 2636 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION) 2637 2638 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or 2639 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, 2640 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL 2641 nodes, this points to either the FUNCTION_DECL for the containing 2642 function, the RECORD_TYPE or UNION_TYPE for the containing type, or 2643 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file 2644 scope". In particular, for VAR_DECLs which are virtual table pointers 2645 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type 2646 they belong to. */ 2647 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) 2648 #define DECL_FIELD_CONTEXT(NODE) \ 2649 (FIELD_DECL_CHECK (NODE)->decl_minimal.context) 2650 2651 /* If nonzero, decl's name shouldn't be emitted into debug info. */ 2652 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag) 2653 2654 struct GTY(()) tree_decl_minimal { 2655 struct tree_common common; 2656 location_t locus; 2657 unsigned int uid; 2658 tree name; 2659 tree context; 2660 }; 2661 2662 2663 /* For any sort of a ..._DECL node, this points to the original (abstract) 2664 decl node which this decl is an inlined/cloned instance of, or else it 2665 is NULL indicating that this decl is not an instance of some other decl. 2666 2667 The C front-end also uses this in a nested declaration of an inline 2668 function, to point back to the definition. */ 2669 #define DECL_ABSTRACT_ORIGIN(NODE) \ 2670 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) 2671 2672 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract 2673 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ 2674 #define DECL_ORIGIN(NODE) \ 2675 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) 2676 2677 /* Nonzero for any sort of ..._DECL node means this decl node represents an 2678 inline instance of some original (abstract) decl from an inline function; 2679 suppress any warnings about shadowing some other variable. FUNCTION_DECL 2680 nodes can also have their abstract origin set to themselves. */ 2681 #define DECL_FROM_INLINE(NODE) \ 2682 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ 2683 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) 2684 2685 /* In a DECL this is the field where attributes are stored. */ 2686 #define DECL_ATTRIBUTES(NODE) \ 2687 (DECL_COMMON_CHECK (NODE)->decl_common.attributes) 2688 2689 /* For a FUNCTION_DECL, holds the tree of BINDINGs. 2690 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. 2691 For a VAR_DECL, holds the initial value. 2692 For a PARM_DECL, used for DECL_ARG_TYPE--default 2693 values for parameters are encoded in the type of the function, 2694 not in the PARM_DECL slot. 2695 For a FIELD_DECL, this is used for enumeration values and the C 2696 frontend uses it for temporarily storing bitwidth of bitfields. 2697 2698 ??? Need to figure out some way to check this isn't a PARM_DECL. */ 2699 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) 2700 2701 /* Holds the size of the datum, in bits, as a tree expression. 2702 Need not be constant. */ 2703 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) 2704 /* Likewise for the size in bytes. */ 2705 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) 2706 /* Holds the alignment required for the datum, in bits. */ 2707 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) 2708 /* The alignment of NODE, in bytes. */ 2709 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) 2710 /* Set if the alignment of this DECL has been set by the user, for 2711 example with an 'aligned' attribute. */ 2712 #define DECL_USER_ALIGN(NODE) \ 2713 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align) 2714 /* Holds the machine mode corresponding to the declaration of a variable or 2715 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a 2716 FIELD_DECL. */ 2717 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) 2718 2719 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in 2720 operation it is. Note, however, that this field is overloaded, with 2721 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be 2722 checked before any access to the former. */ 2723 #define DECL_FUNCTION_CODE(NODE) \ 2724 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) 2725 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \ 2726 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from) 2727 2728 #define DECL_FUNCTION_PERSONALITY(NODE) \ 2729 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) 2730 2731 /* Nonzero for a given ..._DECL node means that the name of this node should 2732 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that 2733 the associated type should be ignored. For a FUNCTION_DECL, the body of 2734 the function should also be ignored. */ 2735 #define DECL_IGNORED_P(NODE) \ 2736 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) 2737 2738 /* Nonzero for a given ..._DECL node means that this node represents an 2739 "abstract instance" of the given declaration (e.g. in the original 2740 declaration of an inline function). When generating symbolic debugging 2741 information, we mustn't try to generate any address information for nodes 2742 marked as "abstract instances" because we don't actually generate 2743 any code or allocate any data space for such instances. */ 2744 #define DECL_ABSTRACT(NODE) \ 2745 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) 2746 2747 /* Language-specific decl information. */ 2748 #define DECL_LANG_SPECIFIC(NODE) \ 2749 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) 2750 2751 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: 2752 do not allocate storage, and refer to a definition elsewhere. Note that 2753 this does not necessarily imply the entity represented by NODE 2754 has no program source-level definition in this translation unit. For 2755 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and 2756 DECL_EXTERNAL may be true simultaneously; that can be the case for 2757 a C99 "extern inline" function. */ 2758 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) 2759 2760 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. 2761 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. 2762 2763 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. 2764 2765 Also set in some languages for variables, etc., outside the normal 2766 lexical scope, such as class instance variables. */ 2767 #define DECL_NONLOCAL(NODE) \ 2768 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) 2769 2770 /* Used in VAR_DECLs to indicate that the variable is a vtable. 2771 Used in FIELD_DECLs for vtable pointers. 2772 Used in FUNCTION_DECLs to indicate that the function is virtual. */ 2773 #define DECL_VIRTUAL_P(NODE) \ 2774 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) 2775 2776 /* Used to indicate that this DECL represents a compiler-generated entity. */ 2777 #define DECL_ARTIFICIAL(NODE) \ 2778 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) 2779 2780 /* Additional flags for language-specific uses. */ 2781 #define DECL_LANG_FLAG_0(NODE) \ 2782 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) 2783 #define DECL_LANG_FLAG_1(NODE) \ 2784 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) 2785 #define DECL_LANG_FLAG_2(NODE) \ 2786 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) 2787 #define DECL_LANG_FLAG_3(NODE) \ 2788 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) 2789 #define DECL_LANG_FLAG_4(NODE) \ 2790 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) 2791 #define DECL_LANG_FLAG_5(NODE) \ 2792 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) 2793 #define DECL_LANG_FLAG_6(NODE) \ 2794 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) 2795 #define DECL_LANG_FLAG_7(NODE) \ 2796 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) 2797 #define DECL_LANG_FLAG_8(NODE) \ 2798 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) 2799 2800 /* Nonzero for a scope which is equal to file scope. */ 2801 #define SCOPE_FILE_SCOPE_P(EXP) \ 2802 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) 2803 /* Nonzero for a decl which is at file scope. */ 2804 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) 2805 /* Nonzero for a type which is at file scope. */ 2806 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) 2807 2808 /* Nonzero for a decl that is decorated using attribute used. 2809 This indicates to compiler tools that this decl needs to be preserved. */ 2810 #define DECL_PRESERVE_P(DECL) \ 2811 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag 2812 2813 /* For function local variables of COMPLEX and VECTOR types, 2814 indicates that the variable is not aliased, and that all 2815 modifications to the variable have been adjusted so that 2816 they are killing assignments. Thus the variable may now 2817 be treated as a GIMPLE register, and use real instead of 2818 virtual ops in SSA form. */ 2819 #define DECL_GIMPLE_REG_P(DECL) \ 2820 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag 2821 2822 struct GTY(()) tree_decl_common { 2823 struct tree_decl_minimal common; 2824 tree size; 2825 2826 ENUM_BITFIELD(machine_mode) mode : 8; 2827 2828 unsigned nonlocal_flag : 1; 2829 unsigned virtual_flag : 1; 2830 unsigned ignored_flag : 1; 2831 unsigned abstract_flag : 1; 2832 unsigned artificial_flag : 1; 2833 unsigned preserve_flag: 1; 2834 unsigned debug_expr_is_from : 1; 2835 2836 unsigned lang_flag_0 : 1; 2837 unsigned lang_flag_1 : 1; 2838 unsigned lang_flag_2 : 1; 2839 unsigned lang_flag_3 : 1; 2840 unsigned lang_flag_4 : 1; 2841 unsigned lang_flag_5 : 1; 2842 unsigned lang_flag_6 : 1; 2843 unsigned lang_flag_7 : 1; 2844 unsigned lang_flag_8 : 1; 2845 2846 /* In LABEL_DECL, this is DECL_ERROR_ISSUED. 2847 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ 2848 unsigned decl_flag_0 : 1; 2849 /* In FIELD_DECL, this is DECL_BIT_FIELD 2850 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. 2851 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */ 2852 unsigned decl_flag_1 : 1; 2853 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P 2854 In VAR_DECL, PARM_DECL and RESULT_DECL, this is 2855 DECL_HAS_VALUE_EXPR_P. */ 2856 unsigned decl_flag_2 : 1; 2857 /* 1 bit unused. */ 2858 unsigned decl_flag_3 : 1; 2859 /* Logically, these two would go in a theoretical base shared by var and 2860 parm decl. */ 2861 unsigned gimple_reg_flag : 1; 2862 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */ 2863 unsigned decl_by_reference_flag : 1; 2864 /* In a VAR_DECL and PARM_DECL, this is DECL_READ_P. */ 2865 unsigned decl_read_flag : 1; 2866 /* In a VAR_DECL or RESULT_DECL, this is DECL_NONSHAREABLE. */ 2867 unsigned decl_nonshareable_flag : 1; 2868 2869 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */ 2870 unsigned int off_align : 8; 2871 2872 /* 24 bits unused. */ 2873 2874 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */ 2875 unsigned int align; 2876 2877 /* UID for points-to sets, stable over copying from inlining. */ 2878 unsigned int pt_uid; 2879 2880 tree size_unit; 2881 tree initial; 2882 tree attributes; 2883 tree abstract_origin; 2884 2885 /* Points to a structure whose details depend on the language in use. */ 2886 struct lang_decl *lang_specific; 2887 }; 2888 2889 extern tree decl_value_expr_lookup (tree); 2890 extern void decl_value_expr_insert (tree, tree); 2891 2892 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, 2893 if transformations have made this more complicated than evaluating the 2894 decl itself. This should only be used for debugging; once this field has 2895 been set, the decl itself may not legitimately appear in the function. */ 2896 #define DECL_HAS_VALUE_EXPR_P(NODE) \ 2897 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ 2898 ->decl_common.decl_flag_2) 2899 #define DECL_VALUE_EXPR(NODE) \ 2900 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) 2901 #define SET_DECL_VALUE_EXPR(NODE, VAL) \ 2902 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) 2903 2904 /* Holds the RTL expression for the value of a variable or function. 2905 This value can be evaluated lazily for functions, variables with 2906 static storage duration, and labels. */ 2907 #define DECL_RTL(NODE) \ 2908 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ 2909 ? (NODE)->decl_with_rtl.rtl \ 2910 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) 2911 2912 /* Set the DECL_RTL for NODE to RTL. */ 2913 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) 2914 2915 /* Returns nonzero if NODE is a tree node that can contain RTL. */ 2916 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) 2917 2918 /* Returns nonzero if the DECL_RTL for NODE has already been set. */ 2919 #define DECL_RTL_SET_P(NODE) \ 2920 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) 2921 2922 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for 2923 NODE1, it will not be set for NODE2; this is a lazy copy. */ 2924 #define COPY_DECL_RTL(NODE1, NODE2) \ 2925 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \ 2926 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) 2927 2928 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ 2929 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) 2930 2931 #if (GCC_VERSION >= 2007) 2932 #define DECL_RTL_KNOWN_SET(decl) __extension__ \ 2933 ({