1 /* Front-end tree definitions for GNU compiler. 2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 4 Free Software Foundation, Inc. 5 6 This file is part of GCC. 7 8 GCC is free software; you can redistribute it and/or modify it under 9 the terms of the GNU General Public License as published by the Free 10 Software Foundation; either version 3, or (at your option) any later 11 version. 12 13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY 14 WARRANTY; without even the implied warranty of MERCHANTABILITY or 15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 16 for more details. 17 18 You should have received a copy of the GNU General Public License 19 along with GCC; see the file COPYING3. If not see 20 <http://www.gnu.org/licenses/>. */ 21 22 #ifndef GCC_TREE_H 23 #define GCC_TREE_H 24 25 #include "hashtab.h" 26 #include "machmode.h" 27 #include "input.h" 28 #include "statistics.h" 29 #include "vec.h" 30 #include "vecir.h" 31 #include "double-int.h" 32 #include "real.h" 33 #include "fixed-value.h" 34 #include "alias.h" 35 #include "flags.h" 36 37 /* Codes of tree nodes */ 38 39 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM, 40 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE, 41 42 enum tree_code { 43 #include "all-tree.def" 44 MAX_TREE_CODES 45 }; 46 47 #undef DEFTREECODE 48 #undef END_OF_BASE_TREE_CODES 49 50 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64]; 51 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)]) 52 53 /* Macros for initializing `tree_contains_struct'. */ 54 #define MARK_TS_BASE(C) \ 55 do { \ 56 tree_contains_struct[C][TS_BASE] = 1; \ 57 } while (0) 58 59 #define MARK_TS_TYPED(C) \ 60 do { \ 61 MARK_TS_BASE (C); \ 62 tree_contains_struct[C][TS_TYPED] = 1; \ 63 } while (0) 64 65 #define MARK_TS_COMMON(C) \ 66 do { \ 67 MARK_TS_TYPED (C); \ 68 tree_contains_struct[C][TS_COMMON] = 1; \ 69 } while (0) 70 71 #define MARK_TS_TYPE_COMMON(C) \ 72 do { \ 73 MARK_TS_COMMON (C); \ 74 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \ 75 } while (0) 76 77 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \ 78 do { \ 79 MARK_TS_TYPE_COMMON (C); \ 80 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \ 81 } while (0) 82 83 #define MARK_TS_DECL_MINIMAL(C) \ 84 do { \ 85 MARK_TS_COMMON (C); \ 86 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \ 87 } while (0) 88 89 #define MARK_TS_DECL_COMMON(C) \ 90 do { \ 91 MARK_TS_DECL_MINIMAL (C); \ 92 tree_contains_struct[C][TS_DECL_COMMON] = 1; \ 93 } while (0) 94 95 #define MARK_TS_DECL_WRTL(C) \ 96 do { \ 97 MARK_TS_DECL_COMMON (C); \ 98 tree_contains_struct[C][TS_DECL_WRTL] = 1; \ 99 } while (0) 100 101 #define MARK_TS_DECL_WITH_VIS(C) \ 102 do { \ 103 MARK_TS_DECL_WRTL (C); \ 104 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \ 105 } while (0) 106 107 #define MARK_TS_DECL_NON_COMMON(C) \ 108 do { \ 109 MARK_TS_DECL_WITH_VIS (C); \ 110 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \ 111 } while (0) 112 113 /* Number of language-independent tree codes. */ 114 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE) 115 116 /* Tree code classes. */ 117 118 /* Each tree_code has an associated code class represented by a 119 TREE_CODE_CLASS. */ 120 121 enum tree_code_class { 122 tcc_exceptional, /* An exceptional code (fits no category). */ 123 tcc_constant, /* A constant. */ 124 /* Order of tcc_type and tcc_declaration is important. */ 125 tcc_type, /* A type object code. */ 126 tcc_declaration, /* A declaration (also serving as variable refs). */ 127 tcc_reference, /* A reference to storage. */ 128 tcc_comparison, /* A comparison expression. */ 129 tcc_unary, /* A unary arithmetic expression. */ 130 tcc_binary, /* A binary arithmetic expression. */ 131 tcc_statement, /* A statement expression, which have side effects 132 but usually no interesting value. */ 133 tcc_vl_exp, /* A function call or other expression with a 134 variable-length operand vector. */ 135 tcc_expression /* Any other expression. */ 136 }; 137 138 /* Each tree code class has an associated string representation. 139 These must correspond to the tree_code_class entries. */ 140 141 extern const char *const tree_code_class_strings[]; 142 143 /* Returns the string representing CLASS. */ 144 145 #define TREE_CODE_CLASS_STRING(CLASS)\ 146 tree_code_class_strings[(int) (CLASS)] 147 148 extern const enum tree_code_class tree_code_type[]; 149 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)] 150 151 /* Nonzero if CODE represents an exceptional code. */ 152 153 #define EXCEPTIONAL_CLASS_P(CODE)\ 154 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional) 155 156 /* Nonzero if CODE represents a constant. */ 157 158 #define CONSTANT_CLASS_P(CODE)\ 159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant) 160 161 /* Nonzero if CODE represents a type. */ 162 163 #define TYPE_P(CODE)\ 164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type) 165 166 /* Nonzero if CODE represents a declaration. */ 167 168 #define DECL_P(CODE)\ 169 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration) 170 171 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */ 172 173 #define VAR_OR_FUNCTION_DECL_P(DECL)\ 174 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL) 175 176 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in 177 ascending code order. */ 178 179 #define INDIRECT_REF_P(CODE)\ 180 (TREE_CODE (CODE) == INDIRECT_REF) 181 182 /* Nonzero if CODE represents a reference. */ 183 184 #define REFERENCE_CLASS_P(CODE)\ 185 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference) 186 187 /* Nonzero if CODE represents a comparison. */ 188 189 #define COMPARISON_CLASS_P(CODE)\ 190 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison) 191 192 /* Nonzero if CODE represents a unary arithmetic expression. */ 193 194 #define UNARY_CLASS_P(CODE)\ 195 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary) 196 197 /* Nonzero if CODE represents a binary arithmetic expression. */ 198 199 #define BINARY_CLASS_P(CODE)\ 200 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary) 201 202 /* Nonzero if CODE represents a statement expression. */ 203 204 #define STATEMENT_CLASS_P(CODE)\ 205 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement) 206 207 /* Nonzero if CODE represents a function call-like expression with a 208 variable-length operand vector. */ 209 210 #define VL_EXP_CLASS_P(CODE)\ 211 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp) 212 213 /* Nonzero if CODE represents any other expression. */ 214 215 #define EXPRESSION_CLASS_P(CODE)\ 216 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression) 217 218 /* Returns nonzero iff CODE represents a type or declaration. */ 219 220 #define IS_TYPE_OR_DECL_P(CODE)\ 221 (TYPE_P (CODE) || DECL_P (CODE)) 222 223 /* Returns nonzero iff CLASS is the tree-code class of an 224 expression. */ 225 226 #define IS_EXPR_CODE_CLASS(CLASS)\ 227 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression) 228 229 /* Returns nonzero iff NODE is an expression of some kind. */ 230 231 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) 232 233 /* Number of argument-words in each kind of tree-node. */ 234 235 extern const unsigned char tree_code_length[]; 236 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] 237 238 /* Names of tree components. */ 239 240 extern const char *const tree_code_name[]; 241 242 /* We have to be able to tell cgraph about the needed-ness of the target 243 of an alias. This requires that the decl have been defined. Aliases 244 that precede their definition have to be queued for later processing. */ 245 246 /* The deferred processing proceeds in several passes. We memorize the 247 diagnostics emitted for a pair to prevent repeating messages when the 248 queue gets re-scanned after possible updates. */ 249 250 typedef enum { 251 ALIAS_DIAG_NONE = 0x0, 252 ALIAS_DIAG_TO_UNDEF = 0x1, 253 ALIAS_DIAG_TO_EXTERN = 0x2 254 } alias_diag_flags; 255 256 typedef struct GTY(()) alias_pair 257 { 258 tree decl; 259 tree target; 260 int emitted_diags; /* alias_diags already emitted for this pair. */ 261 } alias_pair; 262 263 /* Define gc'd vector type. */ 264 DEF_VEC_O(alias_pair); 265 DEF_VEC_ALLOC_O(alias_pair,gc); 266 267 extern GTY(()) VEC(alias_pair,gc) * alias_pairs; 268 269 270 /* Classify which part of the compiler has defined a given builtin function. 271 Note that we assume below that this is no more than two bits. */ 272 enum built_in_class 273 { 274 NOT_BUILT_IN = 0, 275 BUILT_IN_FRONTEND, 276 BUILT_IN_MD, 277 BUILT_IN_NORMAL 278 }; 279 280 /* Last marker used for LTO stremaing of built_in_class. We can not add it 281 to the enum since we need the enumb to fit in 2 bits. */ 282 #define BUILT_IN_LAST (BUILT_IN_NORMAL + 1) 283 284 /* Names for the above. */ 285 extern const char *const built_in_class_names[4]; 286 287 /* Codes that identify the various built in functions 288 so that expand_call can identify them quickly. */ 289 290 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM, 291 enum built_in_function 292 { 293 #include "builtins.def" 294 295 /* Complex division routines in libgcc. These are done via builtins 296 because emit_library_call_value can't handle complex values. */ 297 BUILT_IN_COMPLEX_MUL_MIN, 298 BUILT_IN_COMPLEX_MUL_MAX 299 = BUILT_IN_COMPLEX_MUL_MIN 300 + MAX_MODE_COMPLEX_FLOAT 301 - MIN_MODE_COMPLEX_FLOAT, 302 303 BUILT_IN_COMPLEX_DIV_MIN, 304 BUILT_IN_COMPLEX_DIV_MAX 305 = BUILT_IN_COMPLEX_DIV_MIN 306 + MAX_MODE_COMPLEX_FLOAT 307 - MIN_MODE_COMPLEX_FLOAT, 308 309 /* Upper bound on non-language-specific builtins. */ 310 END_BUILTINS 311 }; 312 #undef DEF_BUILTIN 313 314 /* Names for the above. */ 315 extern const char * built_in_names[(int) END_BUILTINS]; 316 317 /* Helper macros for math builtins. */ 318 319 #define BUILTIN_EXP10_P(FN) \ 320 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \ 321 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L) 322 323 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \ 324 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \ 325 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L) 326 327 #define BUILTIN_SQRT_P(FN) \ 328 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL) 329 330 #define BUILTIN_CBRT_P(FN) \ 331 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL) 332 333 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN)) 334 335 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L 336 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R 337 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL 338 339 /* In an OMP_CLAUSE node. */ 340 341 /* Number of operands and names for each clause. */ 342 extern unsigned const char omp_clause_num_ops[]; 343 extern const char * const omp_clause_code_name[]; 344 345 /* Clause codes. Do not reorder, as this is used to index into the tables 346 omp_clause_num_ops and omp_clause_code_name. */ 347 enum omp_clause_code 348 { 349 /* Clause zero is special-cased inside the parser 350 (c_parser_omp_variable_list). */ 351 OMP_CLAUSE_ERROR = 0, 352 353 /* OpenMP clause: private (variable_list). */ 354 OMP_CLAUSE_PRIVATE, 355 356 /* OpenMP clause: shared (variable_list). */ 357 OMP_CLAUSE_SHARED, 358 359 /* OpenMP clause: firstprivate (variable_list). */ 360 OMP_CLAUSE_FIRSTPRIVATE, 361 362 /* OpenMP clause: lastprivate (variable_list). */ 363 OMP_CLAUSE_LASTPRIVATE, 364 365 /* OpenMP clause: reduction (operator:variable_list). 366 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator. 367 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var. 368 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var 369 into the shared one. 370 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL 371 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */ 372 OMP_CLAUSE_REDUCTION, 373 374 /* OpenMP clause: copyin (variable_list). */ 375 OMP_CLAUSE_COPYIN, 376 377 /* OpenMP clause: copyprivate (variable_list). */ 378 OMP_CLAUSE_COPYPRIVATE, 379 380 /* OpenMP clause: if (scalar-expression). */ 381 OMP_CLAUSE_IF, 382 383 /* OpenMP clause: num_threads (integer-expression). */ 384 OMP_CLAUSE_NUM_THREADS, 385 386 /* OpenMP clause: schedule. */ 387 OMP_CLAUSE_SCHEDULE, 388 389 /* OpenMP clause: nowait. */ 390 OMP_CLAUSE_NOWAIT, 391 392 /* OpenMP clause: ordered. */ 393 OMP_CLAUSE_ORDERED, 394 395 /* OpenMP clause: default. */ 396 OMP_CLAUSE_DEFAULT, 397 398 /* OpenMP clause: collapse (constant-integer-expression). */ 399 OMP_CLAUSE_COLLAPSE, 400 401 /* OpenMP clause: untied. */ 402 OMP_CLAUSE_UNTIED, 403 404 /* OpenMP clause: final (scalar-expression). */ 405 OMP_CLAUSE_FINAL, 406 407 /* OpenMP clause: mergeable. */ 408 OMP_CLAUSE_MERGEABLE 409 }; 410 411 /* The definition of tree nodes fills the next several pages. */ 412 413 /* A tree node can represent a data type, a variable, an expression 414 or a statement. Each node has a TREE_CODE which says what kind of 415 thing it represents. Some common codes are: 416 INTEGER_TYPE -- represents a type of integers. 417 ARRAY_TYPE -- represents a type of pointer. 418 VAR_DECL -- represents a declared variable. 419 INTEGER_CST -- represents a constant integer value. 420 PLUS_EXPR -- represents a sum (an expression). 421 422 As for the contents of a tree node: there are some fields 423 that all nodes share. Each TREE_CODE has various special-purpose 424 fields as well. The fields of a node are never accessed directly, 425 always through accessor macros. */ 426 427 /* Every kind of tree node starts with this structure, 428 so all nodes have these fields. 429 430 See the accessor macros, defined below, for documentation of the 431 fields. */ 432 433 struct GTY(()) tree_base { 434 ENUM_BITFIELD(tree_code) code : 16; 435 436 unsigned side_effects_flag : 1; 437 unsigned constant_flag : 1; 438 unsigned addressable_flag : 1; 439 unsigned volatile_flag : 1; 440 unsigned readonly_flag : 1; 441 unsigned unsigned_flag : 1; 442 unsigned asm_written_flag: 1; 443 unsigned nowarning_flag : 1; 444 445 unsigned used_flag : 1; 446 unsigned nothrow_flag : 1; 447 unsigned static_flag : 1; 448 unsigned public_flag : 1; 449 unsigned private_flag : 1; 450 unsigned protected_flag : 1; 451 unsigned deprecated_flag : 1; 452 unsigned saturating_flag : 1; 453 454 unsigned default_def_flag : 1; 455 unsigned lang_flag_0 : 1; 456 unsigned lang_flag_1 : 1; 457 unsigned lang_flag_2 : 1; 458 unsigned lang_flag_3 : 1; 459 unsigned lang_flag_4 : 1; 460 unsigned lang_flag_5 : 1; 461 unsigned lang_flag_6 : 1; 462 463 unsigned visited : 1; 464 unsigned packed_flag : 1; 465 unsigned user_align : 1; 466 unsigned nameless_flag : 1; 467 468 unsigned spare : 12; 469 470 /* This field is only used with type nodes; the only reason it is present 471 in tree_base instead of tree_type is to save space. The size of the 472 field must be large enough to hold addr_space_t values. */ 473 unsigned address_space : 8; 474 }; 475 476 struct GTY(()) tree_typed { 477 struct tree_base base; 478 tree type; 479 }; 480 481 struct GTY(()) tree_common { 482 struct tree_typed typed; 483 tree chain; 484 }; 485 486 /* The following table lists the uses of each of the above flags and 487 for which types of nodes they are defined. 488 489 addressable_flag: 490 491 TREE_ADDRESSABLE in 492 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL 493 SSA_NAME 494 all types 495 CONSTRUCTOR, IDENTIFIER_NODE 496 STMT_EXPR 497 498 CALL_EXPR_TAILCALL in 499 CALL_EXPR 500 501 CASE_LOW_SEEN in 502 CASE_LABEL_EXPR 503 504 static_flag: 505 506 TREE_STATIC in 507 VAR_DECL, FUNCTION_DECL 508 CONSTRUCTOR 509 510 TREE_NO_TRAMPOLINE in 511 ADDR_EXPR 512 513 BINFO_VIRTUAL_P in 514 TREE_BINFO 515 516 TREE_SYMBOL_REFERENCED in 517 IDENTIFIER_NODE 518 519 CLEANUP_EH_ONLY in 520 TARGET_EXPR, WITH_CLEANUP_EXPR 521 522 TRY_CATCH_IS_CLEANUP in 523 TRY_CATCH_EXPR 524 525 ASM_INPUT_P in 526 ASM_EXPR 527 528 TYPE_REF_CAN_ALIAS_ALL in 529 POINTER_TYPE, REFERENCE_TYPE 530 531 MOVE_NONTEMPORAL in 532 MODIFY_EXPR 533 534 CASE_HIGH_SEEN in 535 CASE_LABEL_EXPR 536 537 ENUM_IS_SCOPED in 538 ENUMERAL_TYPE 539 540 TRANSACTION_EXPR_OUTER in 541 TRANSACTION_EXPR 542 543 public_flag: 544 545 TREE_OVERFLOW in 546 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST 547 548 TREE_PUBLIC in 549 VAR_DECL, FUNCTION_DECL 550 IDENTIFIER_NODE 551 552 ASM_VOLATILE_P in 553 ASM_EXPR 554 555 CALL_EXPR_VA_ARG_PACK in 556 CALL_EXPR 557 558 TYPE_CACHED_VALUES_P in 559 all types 560 561 SAVE_EXPR_RESOLVED_P in 562 SAVE_EXPR 563 564 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in 565 OMP_CLAUSE_LASTPRIVATE 566 567 OMP_CLAUSE_PRIVATE_DEBUG in 568 OMP_CLAUSE_PRIVATE 569 570 TRANSACTION_EXPR_RELAXED in 571 TRANSACTION_EXPR 572 573 private_flag: 574 575 TREE_PRIVATE in 576 all decls 577 578 CALL_EXPR_RETURN_SLOT_OPT in 579 CALL_EXPR 580 581 OMP_SECTION_LAST in 582 OMP_SECTION 583 584 OMP_PARALLEL_COMBINED in 585 OMP_PARALLEL 586 OMP_CLAUSE_PRIVATE_OUTER_REF in 587 OMP_CLAUSE_PRIVATE 588 589 TYPE_REF_IS_RVALUE in 590 REFERENCE_TYPE 591 592 protected_flag: 593 594 TREE_PROTECTED in 595 BLOCK 596 all decls 597 598 CALL_FROM_THUNK_P and 599 CALL_ALLOCA_FOR_VAR_P in 600 CALL_EXPR 601 602 side_effects_flag: 603 604 TREE_SIDE_EFFECTS in 605 all expressions 606 all decls 607 all constants 608 609 FORCED_LABEL in 610 LABEL_DECL 611 612 volatile_flag: 613 614 TREE_THIS_VOLATILE in 615 all expressions 616 all decls 617 618 TYPE_VOLATILE in 619 all types 620 621 readonly_flag: 622 623 TREE_READONLY in 624 all expressions 625 all decls 626 627 TYPE_READONLY in 628 all types 629 630 constant_flag: 631 632 TREE_CONSTANT in 633 all expressions 634 all decls 635 all constants 636 637 TYPE_SIZES_GIMPLIFIED in 638 all types 639 640 unsigned_flag: 641 642 TYPE_UNSIGNED in 643 all types 644 645 DECL_UNSIGNED in 646 all decls 647 648 asm_written_flag: 649 650 TREE_ASM_WRITTEN in 651 VAR_DECL, FUNCTION_DECL, TYPE_DECL 652 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE 653 BLOCK, SSA_NAME, STRING_CST 654 655 used_flag: 656 657 TREE_USED in 658 all expressions 659 all decls 660 IDENTIFIER_NODE 661 662 nothrow_flag: 663 664 TREE_NOTHROW in 665 CALL_EXPR 666 FUNCTION_DECL 667 668 TYPE_ALIGN_OK in 669 all types 670 671 TREE_THIS_NOTRAP in 672 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF 673 674 deprecated_flag: 675 676 TREE_DEPRECATED in 677 all decls 678 all types 679 680 IDENTIFIER_TRANSPARENT_ALIAS in 681 IDENTIFIER_NODE 682 683 visited: 684 685 TREE_VISITED in 686 all trees (used liberally by many passes) 687 688 saturating_flag: 689 690 TYPE_SATURATING in 691 all types 692 693 nowarning_flag: 694 695 TREE_NO_WARNING in 696 all expressions 697 all decls 698 699 TYPE_ARTIFICIAL in 700 all types 701 702 default_def_flag: 703 704 TYPE_VECTOR_OPAQUE in 705 VECTOR_TYPE 706 707 SSA_NAME_IS_DEFAULT_DEF in 708 SSA_NAME 709 */ 710 711 #undef DEFTREESTRUCT 712 #define DEFTREESTRUCT(ENUM, NAME) ENUM, 713 enum tree_node_structure_enum { 714 #include "treestruct.def" 715 LAST_TS_ENUM 716 }; 717 #undef DEFTREESTRUCT 718 719 /* Define accessors for the fields that all tree nodes have 720 (though some fields are not used for all kinds of nodes). */ 721 722 /* The tree-code says what kind of node it is. 723 Codes are defined in tree.def. */ 724 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code) 725 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE)) 726 727 /* When checking is enabled, errors will be generated if a tree node 728 is accessed incorrectly. The macros die with a fatal error. */ 729 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) 730 731 #define TREE_CHECK(T, CODE) __extension__ \ 732 ({ __typeof (T) const __t = (T); \ 733 if (TREE_CODE (__t) != (CODE)) \ 734 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 735 (CODE), 0); \ 736 __t; }) 737 738 #define TREE_NOT_CHECK(T, CODE) __extension__ \ 739 ({ __typeof (T) const __t = (T); \ 740 if (TREE_CODE (__t) == (CODE)) \ 741 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 742 (CODE), 0); \ 743 __t; }) 744 745 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \ 746 ({ __typeof (T) const __t = (T); \ 747 if (TREE_CODE (__t) != (CODE1) \ 748 && TREE_CODE (__t) != (CODE2)) \ 749 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 750 (CODE1), (CODE2), 0); \ 751 __t; }) 752 753 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \ 754 ({ __typeof (T) const __t = (T); \ 755 if (TREE_CODE (__t) == (CODE1) \ 756 || TREE_CODE (__t) == (CODE2)) \ 757 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 758 (CODE1), (CODE2), 0); \ 759 __t; }) 760 761 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ 762 ({ __typeof (T) const __t = (T); \ 763 if (TREE_CODE (__t) != (CODE1) \ 764 && TREE_CODE (__t) != (CODE2) \ 765 && TREE_CODE (__t) != (CODE3)) \ 766 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 767 (CODE1), (CODE2), (CODE3), 0); \ 768 __t; }) 769 770 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \ 771 ({ __typeof (T) const __t = (T); \ 772 if (TREE_CODE (__t) == (CODE1) \ 773 || TREE_CODE (__t) == (CODE2) \ 774 || TREE_CODE (__t) == (CODE3)) \ 775 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 776 (CODE1), (CODE2), (CODE3), 0); \ 777 __t; }) 778 779 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ 780 ({ __typeof (T) const __t = (T); \ 781 if (TREE_CODE (__t) != (CODE1) \ 782 && TREE_CODE (__t) != (CODE2) \ 783 && TREE_CODE (__t) != (CODE3) \ 784 && TREE_CODE (__t) != (CODE4)) \ 785 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 786 (CODE1), (CODE2), (CODE3), (CODE4), 0); \ 787 __t; }) 788 789 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \ 790 ({ __typeof (T) const __t = (T); \ 791 if (TREE_CODE (__t) == (CODE1) \ 792 || TREE_CODE (__t) == (CODE2) \ 793 || TREE_CODE (__t) == (CODE3) \ 794 || TREE_CODE (__t) == (CODE4)) \ 795 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 796 (CODE1), (CODE2), (CODE3), (CODE4), 0); \ 797 __t; }) 798 799 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ 800 ({ __typeof (T) const __t = (T); \ 801 if (TREE_CODE (__t) != (CODE1) \ 802 && TREE_CODE (__t) != (CODE2) \ 803 && TREE_CODE (__t) != (CODE3) \ 804 && TREE_CODE (__t) != (CODE4) \ 805 && TREE_CODE (__t) != (CODE5)) \ 806 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 807 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ 808 __t; }) 809 810 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \ 811 ({ __typeof (T) const __t = (T); \ 812 if (TREE_CODE (__t) == (CODE1) \ 813 || TREE_CODE (__t) == (CODE2) \ 814 || TREE_CODE (__t) == (CODE3) \ 815 || TREE_CODE (__t) == (CODE4) \ 816 || TREE_CODE (__t) == (CODE5)) \ 817 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 818 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\ 819 __t; }) 820 821 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \ 822 ({ __typeof (T) const __t = (T); \ 823 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \ 824 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \ 825 __FUNCTION__); \ 826 __t; }) 827 828 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \ 829 ({ __typeof (T) const __t = (T); \ 830 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \ 831 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \ 832 __FUNCTION__); \ 833 __t; }) 834 835 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ 836 ({ __typeof (T) const __t = (T); \ 837 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \ 838 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 839 (CODE1), (CODE2)); \ 840 __t; }) 841 842 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \ 843 ({ __typeof (T) const __t = (T); \ 844 if (TREE_CODE (__t) != OMP_CLAUSE) \ 845 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 846 OMP_CLAUSE, 0); \ 847 if (__t->omp_clause.code != (CODE)) \ 848 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 849 (CODE)); \ 850 __t; }) 851 852 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \ 853 ({ __typeof (T) const __t = (T); \ 854 if (TREE_CODE (__t) != OMP_CLAUSE) \ 855 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 856 OMP_CLAUSE, 0); \ 857 if ((int) __t->omp_clause.code < (int) (CODE1) \ 858 || (int) __t->omp_clause.code > (int) (CODE2)) \ 859 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \ 860 __FUNCTION__, (CODE1), (CODE2)); \ 861 __t; }) 862 863 /* These checks have to be special cased. */ 864 #define EXPR_CHECK(T) __extension__ \ 865 ({ __typeof (T) const __t = (T); \ 866 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \ 867 if (!IS_EXPR_CODE_CLASS (__c)) \ 868 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \ 869 __FUNCTION__); \ 870 __t; }) 871 872 /* These checks have to be special cased. */ 873 #define NON_TYPE_CHECK(T) __extension__ \ 874 ({ __typeof (T) const __t = (T); \ 875 if (TYPE_P (__t)) \ 876 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \ 877 __FUNCTION__); \ 878 __t; }) 879 880 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \ 881 (*({__typeof (T) const __t = (T); \ 882 const int __i = (I); \ 883 if (TREE_CODE (__t) != TREE_VEC) \ 884 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 885 TREE_VEC, 0); \ 886 if (__i < 0 || __i >= __t->vec.length) \ 887 tree_vec_elt_check_failed (__i, __t->vec.length, \ 888 __FILE__, __LINE__, __FUNCTION__); \ 889 &__t->vec.a[__i]; })) 890 891 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \ 892 (*({__typeof (T) const __t = (T); \ 893 const int __i = (I); \ 894 if (TREE_CODE (__t) != OMP_CLAUSE) \ 895 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \ 896 OMP_CLAUSE, 0); \ 897 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \ 898 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \ 899 __FUNCTION__); \ 900 &__t->omp_clause.ops[__i]; })) 901 902 /* Special checks for TREE_OPERANDs. */ 903 #define TREE_OPERAND_CHECK(T, I) __extension__ \ 904 (*({__typeof (T) const __t = EXPR_CHECK (T); \ 905 const int __i = (I); \ 906 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \ 907 tree_operand_check_failed (__i, __t, \ 908 __FILE__, __LINE__, __FUNCTION__); \ 909 &__t->exp.operands[__i]; })) 910 911 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \ 912 (*({__typeof (T) const __t = (T); \ 913 const int __i = (I); \ 914 if (TREE_CODE (__t) != CODE) \ 915 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\ 916 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \ 917 tree_operand_check_failed (__i, __t, \ 918 __FILE__, __LINE__, __FUNCTION__); \ 919 &__t->exp.operands[__i]; })) 920 921 /* Nodes are chained together for many purposes. 922 Types are chained together to record them for being output to the debugger 923 (see the function `chain_type'). 924 Decls in the same scope are chained together to record the contents 925 of the scope. 926 Statement nodes for successive statements used to be chained together. 927 Often lists of things are represented by TREE_LIST nodes that 928 are chained together. */ 929 930 #define TREE_CHAIN(NODE) __extension__ \ 931 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_COMMON);\ 932 &__t->common.chain; })) 933 934 /* In all nodes that are expressions, this is the data type of the expression. 935 In POINTER_TYPE nodes, this is the type that the pointer points to. 936 In ARRAY_TYPE nodes, this is the type of the elements. 937 In VECTOR_TYPE nodes, this is the type of the elements. */ 938 #define TREE_TYPE(NODE) __extension__ \ 939 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_TYPED); \ 940 &__t->typed.type; })) 941 942 extern void tree_contains_struct_check_failed (const_tree, 943 const enum tree_node_structure_enum, 944 const char *, int, const char *) 945 ATTRIBUTE_NORETURN; 946 947 extern void tree_check_failed (const_tree, const char *, int, const char *, 948 ...) ATTRIBUTE_NORETURN; 949 extern void tree_not_check_failed (const_tree, const char *, int, const char *, 950 ...) ATTRIBUTE_NORETURN; 951 extern void tree_class_check_failed (const_tree, const enum tree_code_class, 952 const char *, int, const char *) 953 ATTRIBUTE_NORETURN; 954 extern void tree_range_check_failed (const_tree, const char *, int, 955 const char *, enum tree_code, 956 enum tree_code) 957 ATTRIBUTE_NORETURN; 958 extern void tree_not_class_check_failed (const_tree, 959 const enum tree_code_class, 960 const char *, int, const char *) 961 ATTRIBUTE_NORETURN; 962 extern void tree_vec_elt_check_failed (int, int, const char *, 963 int, const char *) 964 ATTRIBUTE_NORETURN; 965 extern void phi_node_elt_check_failed (int, int, const char *, 966 int, const char *) 967 ATTRIBUTE_NORETURN; 968 extern void tree_operand_check_failed (int, const_tree, 969 const char *, int, const char *) 970 ATTRIBUTE_NORETURN; 971 extern void omp_clause_check_failed (const_tree, const char *, int, 972 const char *, enum omp_clause_code) 973 ATTRIBUTE_NORETURN; 974 extern void omp_clause_operand_check_failed (int, const_tree, const char *, 975 int, const char *) 976 ATTRIBUTE_NORETURN; 977 extern void omp_clause_range_check_failed (const_tree, const char *, int, 978 const char *, enum omp_clause_code, 979 enum omp_clause_code) 980 ATTRIBUTE_NORETURN; 981 982 #else /* not ENABLE_TREE_CHECKING, or not gcc */ 983 984 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T) 985 #define TREE_CHECK(T, CODE) (T) 986 #define TREE_NOT_CHECK(T, CODE) (T) 987 #define TREE_CHECK2(T, CODE1, CODE2) (T) 988 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T) 989 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T) 990 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T) 991 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 992 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T) 993 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 994 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T) 995 #define TREE_CLASS_CHECK(T, CODE) (T) 996 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T) 997 #define EXPR_CHECK(T) (T) 998 #define NON_TYPE_CHECK(T) (T) 999 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I]) 1000 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I]) 1001 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I]) 1002 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i]) 1003 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T) 1004 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T) 1005 1006 #define TREE_CHAIN(NODE) ((NODE)->common.chain) 1007 #define TREE_TYPE(NODE) ((NODE)->typed.type) 1008 1009 #endif 1010 1011 #define TREE_BLOCK(NODE) *(tree_block (NODE)) 1012 1013 #include "tree-check.h" 1014 1015 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type) 1016 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL) 1017 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON) 1018 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL) 1019 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS) 1020 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON) 1021 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant) 1022 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement) 1023 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp) 1024 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE) 1025 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE) 1026 1027 #define RECORD_OR_UNION_CHECK(T) \ 1028 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 1029 #define NOT_RECORD_OR_UNION_CHECK(T) \ 1030 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE) 1031 1032 #define NUMERICAL_TYPE_CHECK(T) \ 1033 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \ 1034 FIXED_POINT_TYPE) 1035 1036 /* Here is how primitive or already-canonicalized types' hash codes 1037 are made. */ 1038 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE)) 1039 1040 /* A simple hash function for an arbitrary tree node. This must not be 1041 used in hash tables which are saved to a PCH. */ 1042 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777) 1043 1044 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */ 1045 #define CONVERT_EXPR_CODE_P(CODE) \ 1046 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR) 1047 1048 /* Similarly, but accept an expressions instead of a tree code. */ 1049 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP)) 1050 1051 /* Generate case for NOP_EXPR, CONVERT_EXPR. */ 1052 1053 #define CASE_CONVERT \ 1054 case NOP_EXPR: \ 1055 case CONVERT_EXPR 1056 1057 /* Given an expression as a tree, strip any conversion that generates 1058 no instruction. Accepts both tree and const_tree arguments since 1059 we are not modifying the tree itself. */ 1060 1061 #define STRIP_NOPS(EXP) \ 1062 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP)) 1063 1064 /* Like STRIP_NOPS, but don't let the signedness change either. */ 1065 1066 #define STRIP_SIGN_NOPS(EXP) \ 1067 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP)) 1068 1069 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */ 1070 1071 #define STRIP_TYPE_NOPS(EXP) \ 1072 while ((CONVERT_EXPR_P (EXP) \ 1073 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \ 1074 && TREE_OPERAND (EXP, 0) != error_mark_node \ 1075 && (TREE_TYPE (EXP) \ 1076 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \ 1077 (EXP) = TREE_OPERAND (EXP, 0) 1078 1079 /* Remove unnecessary type conversions according to 1080 tree_ssa_useless_type_conversion. */ 1081 1082 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \ 1083 (EXP) = tree_ssa_strip_useless_type_conversions (EXP) 1084 1085 /* Nonzero if TYPE represents an integral type. Note that we do not 1086 include COMPLEX types here. Keep these checks in ascending code 1087 order. */ 1088 1089 #define INTEGRAL_TYPE_P(TYPE) \ 1090 (TREE_CODE (TYPE) == ENUMERAL_TYPE \ 1091 || TREE_CODE (TYPE) == BOOLEAN_TYPE \ 1092 || TREE_CODE (TYPE) == INTEGER_TYPE) 1093 1094 /* Nonzero if TYPE represents a non-saturating fixed-point type. */ 1095 1096 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \ 1097 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE)) 1098 1099 /* Nonzero if TYPE represents a saturating fixed-point type. */ 1100 1101 #define SAT_FIXED_POINT_TYPE_P(TYPE) \ 1102 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE)) 1103 1104 /* Nonzero if TYPE represents a fixed-point type. */ 1105 1106 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE) 1107 1108 /* Nonzero if TYPE represents a scalar floating-point type. */ 1109 1110 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE) 1111 1112 /* Nonzero if TYPE represents a complex floating-point type. */ 1113 1114 #define COMPLEX_FLOAT_TYPE_P(TYPE) \ 1115 (TREE_CODE (TYPE) == COMPLEX_TYPE \ 1116 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 1117 1118 /* Nonzero if TYPE represents a vector integer type. */ 1119 1120 #define VECTOR_INTEGER_TYPE_P(TYPE) \ 1121 (TREE_CODE (TYPE) == VECTOR_TYPE \ 1122 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE) 1123 1124 1125 /* Nonzero if TYPE represents a vector floating-point type. */ 1126 1127 #define VECTOR_FLOAT_TYPE_P(TYPE) \ 1128 (TREE_CODE (TYPE) == VECTOR_TYPE \ 1129 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE) 1130 1131 /* Nonzero if TYPE represents a floating-point type, including complex 1132 and vector floating-point types. The vector and complex check does 1133 not use the previous two macros to enable early folding. */ 1134 1135 #define FLOAT_TYPE_P(TYPE) \ 1136 (SCALAR_FLOAT_TYPE_P (TYPE) \ 1137 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \ 1138 || TREE_CODE (TYPE) == VECTOR_TYPE) \ 1139 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE)))) 1140 1141 /* Nonzero if TYPE represents a decimal floating-point type. */ 1142 #define DECIMAL_FLOAT_TYPE_P(TYPE) \ 1143 (SCALAR_FLOAT_TYPE_P (TYPE) \ 1144 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE))) 1145 1146 /* Nonzero if TYPE is a record or union type. */ 1147 #define RECORD_OR_UNION_TYPE_P(TYPE) \ 1148 (TREE_CODE (TYPE) == RECORD_TYPE \ 1149 || TREE_CODE (TYPE) == UNION_TYPE \ 1150 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) 1151 1152 /* Nonzero if TYPE represents an aggregate (multi-component) type. 1153 Keep these checks in ascending code order. */ 1154 1155 #define AGGREGATE_TYPE_P(TYPE) \ 1156 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE)) 1157 1158 /* Nonzero if TYPE represents a pointer or reference type. 1159 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in 1160 ascending code order. */ 1161 1162 #define POINTER_TYPE_P(TYPE) \ 1163 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE) 1164 1165 /* Nonzero if this type is a complete type. */ 1166 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE) 1167 1168 /* Nonzero if this type is the (possibly qualified) void type. */ 1169 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE) 1170 1171 /* Nonzero if this type is complete or is cv void. */ 1172 #define COMPLETE_OR_VOID_TYPE_P(NODE) \ 1173 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE)) 1174 1175 /* Nonzero if this type is complete or is an array with unspecified bound. */ 1176 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \ 1177 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE))) 1178 1179 1180 /* Define many boolean fields that all tree nodes have. */ 1181 1182 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address 1183 of this is needed. So it cannot be in a register. 1184 In a FUNCTION_DECL it has no meaning. 1185 In LABEL_DECL nodes, it means a goto for this label has been seen 1186 from a place outside all binding contours that restore stack levels. 1187 In an artificial SSA_NAME that points to a stack partition with at least 1188 two variables, it means that at least one variable has TREE_ADDRESSABLE. 1189 In ..._TYPE nodes, it means that objects of this type must be fully 1190 addressable. This means that pieces of this object cannot go into 1191 register parameters, for example. If this a function type, this 1192 means that the value must be returned in memory. 1193 In CONSTRUCTOR nodes, it means object constructed must be in memory. 1194 In IDENTIFIER_NODEs, this means that some extern decl for this name 1195 had its address taken. That matters for inline functions. 1196 In a STMT_EXPR, it means we want the result of the enclosed expression. */ 1197 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag) 1198 1199 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the 1200 exit of a function. Calls for which this is true are candidates for tail 1201 call optimizations. */ 1202 #define CALL_EXPR_TAILCALL(NODE) \ 1203 (CALL_EXPR_CHECK(NODE)->base.addressable_flag) 1204 1205 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 1206 CASE_LOW operand has been processed. */ 1207 #define CASE_LOW_SEEN(NODE) \ 1208 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag) 1209 1210 #define PREDICT_EXPR_OUTCOME(NODE) \ 1211 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)) 1212 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \ 1213 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME) 1214 #define PREDICT_EXPR_PREDICTOR(NODE) \ 1215 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0)) 1216 1217 /* In a VAR_DECL, nonzero means allocate static storage. 1218 In a FUNCTION_DECL, nonzero if function has been defined. 1219 In a CONSTRUCTOR, nonzero means allocate static storage. */ 1220 #define TREE_STATIC(NODE) ((NODE)->base.static_flag) 1221 1222 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */ 1223 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag) 1224 1225 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup 1226 should only be executed if an exception is thrown, not on normal exit 1227 of its scope. */ 1228 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag) 1229 1230 /* In a TRY_CATCH_EXPR, means that the handler should be considered a 1231 separate cleanup in honor_protect_cleanup_actions. */ 1232 #define TRY_CATCH_IS_CLEANUP(NODE) \ 1233 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag) 1234 1235 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the 1236 CASE_HIGH operand has been processed. */ 1237 #define CASE_HIGH_SEEN(NODE) \ 1238 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag) 1239 1240 /* Used to mark scoped enums. */ 1241 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag) 1242 1243 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */ 1244 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag) 1245 1246 /* In an expr node (usually a conversion) this means the node was made 1247 implicitly and should not lead to any sort of warning. In a decl node, 1248 warnings concerning the decl should be suppressed. This is used at 1249 least for used-before-set warnings, and it set after one warning is 1250 emitted. */ 1251 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag) 1252 1253 /* Used to indicate that this TYPE represents a compiler-generated entity. */ 1254 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag) 1255 1256 /* In an IDENTIFIER_NODE, this means that assemble_name was called with 1257 this string as an argument. */ 1258 #define TREE_SYMBOL_REFERENCED(NODE) \ 1259 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag) 1260 1261 /* Nonzero in a pointer or reference type means the data pointed to 1262 by this type can alias anything. */ 1263 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \ 1264 (PTR_OR_REF_CHECK (NODE)->base.static_flag) 1265 1266 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */ 1267 #define MOVE_NONTEMPORAL(NODE) \ 1268 (EXPR_CHECK (NODE)->base.static_flag) 1269 1270 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means 1271 there was an overflow in folding. */ 1272 1273 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag) 1274 1275 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */ 1276 1277 #define TREE_OVERFLOW_P(EXPR) \ 1278 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR)) 1279 1280 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL, 1281 nonzero means name is to be accessible from outside this translation unit. 1282 In an IDENTIFIER_NODE, nonzero means an external declaration 1283 accessible from outside this translation unit was previously seen 1284 for this name in an inner scope. */ 1285 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag) 1286 1287 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector 1288 of cached values, or is something else. */ 1289 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag) 1290 1291 /* In a SAVE_EXPR, indicates that the original expression has already 1292 been substituted with a VAR_DECL that contains the value. */ 1293 #define SAVE_EXPR_RESOLVED_P(NODE) \ 1294 (SAVE_EXPR_CHECK (NODE)->base.public_flag) 1295 1296 /* Set on a CALL_EXPR if this stdarg call should be passed the argument 1297 pack. */ 1298 #define CALL_EXPR_VA_ARG_PACK(NODE) \ 1299 (CALL_EXPR_CHECK(NODE)->base.public_flag) 1300 1301 /* In any expression, decl, or constant, nonzero means it has side effects or 1302 reevaluation of the whole expression could produce a different value. 1303 This is set if any subexpression is a function call, a side effect or a 1304 reference to a volatile variable. In a ..._DECL, this is set only if the 1305 declaration said `volatile'. This will never be set for a constant. */ 1306 #define TREE_SIDE_EFFECTS(NODE) \ 1307 (NON_TYPE_CHECK (NODE)->base.side_effects_flag) 1308 1309 /* In a LABEL_DECL, nonzero means this label had its address taken 1310 and therefore can never be deleted and is a jump target for 1311 computed gotos. */ 1312 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag) 1313 1314 /* Nonzero means this expression is volatile in the C sense: 1315 its address should be of type `volatile WHATEVER *'. 1316 In other words, the declared item is volatile qualified. 1317 This is used in _DECL nodes and _REF nodes. 1318 On a FUNCTION_DECL node, this means the function does not 1319 return normally. This is the same effect as setting 1320 the attribute noreturn on the function in C. 1321 1322 In a ..._TYPE node, means this type is volatile-qualified. 1323 But use TYPE_VOLATILE instead of this macro when the node is a type, 1324 because eventually we may make that a different bit. 1325 1326 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */ 1327 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag) 1328 1329 /* Nonzero means this node will not trap. In an INDIRECT_REF, means 1330 accessing the memory pointed to won't generate a trap. However, 1331 this only applies to an object when used appropriately: it doesn't 1332 mean that writing a READONLY mem won't trap. 1333 1334 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index 1335 (or slice of the array) always belongs to the range of the array. 1336 I.e. that the access will not trap, provided that the access to 1337 the base to the array will not trap. */ 1338 #define TREE_THIS_NOTRAP(NODE) \ 1339 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \ 1340 ARRAY_RANGE_REF)->base.nothrow_flag) 1341 1342 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node, 1343 nonzero means it may not be the lhs of an assignment. 1344 Nonzero in a FUNCTION_DECL means this function should be treated 1345 as "const" function (can only read its arguments). */ 1346 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag) 1347 1348 /* Value of expression is constant. Always on in all ..._CST nodes. May 1349 also appear in an expression or decl where the value is constant. */ 1350 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag) 1351 1352 /* Nonzero if NODE, a type, has had its sizes gimplified. */ 1353 #define TYPE_SIZES_GIMPLIFIED(NODE) \ 1354 (TYPE_CHECK (NODE)->base.constant_flag) 1355 1356 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */ 1357 #define DECL_UNSIGNED(NODE) \ 1358 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag) 1359 1360 /* In integral and pointer types, means an unsigned type. */ 1361 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag) 1362 1363 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written. 1364 Nonzero in a FUNCTION_DECL means that the function has been compiled. 1365 This is interesting in an inline function, since it might not need 1366 to be compiled separately. 1367 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE 1368 or TYPE_DECL if the debugging info for the type has been written. 1369 In a BLOCK node, nonzero if reorder_blocks has already seen this block. 1370 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal 1371 PHI node. */ 1372 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag) 1373 1374 /* Nonzero in a _DECL if the name is used in its scope. 1375 Nonzero in an expr node means inhibit warning if value is unused. 1376 In IDENTIFIER_NODEs, this means that some extern decl for this name 1377 was used. 1378 In a BLOCK, this means that the block contains variables that are used. */ 1379 #define TREE_USED(NODE) ((NODE)->base.used_flag) 1380 1381 /* In a FUNCTION_DECL, nonzero means a call to the function cannot 1382 throw an exception. In a CALL_EXPR, nonzero means the call cannot 1383 throw. We can't easily check the node type here as the C++ 1384 frontend also uses this flag (for AGGR_INIT_EXPR). */ 1385 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag) 1386 1387 /* In a CALL_EXPR, means that it's safe to use the target of the call 1388 expansion as the return slot for a call that returns in memory. */ 1389 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \ 1390 (CALL_EXPR_CHECK (NODE)->base.private_flag) 1391 1392 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is 1393 passed by invisible reference (and the TREE_TYPE is a pointer to the true 1394 type). */ 1395 #define DECL_BY_REFERENCE(NODE) \ 1396 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ 1397 RESULT_DECL)->decl_common.decl_by_reference_flag) 1398 1399 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl 1400 can be used as restricted tag to disambiguate against other restrict 1401 pointers. Used by fortran to capture something like non-addressability 1402 (which it isn't really because the middle-end does take addresses of 1403 such variables). */ 1404 #define DECL_RESTRICTED_P(NODE) \ 1405 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \ 1406 RESULT_DECL)->decl_common.decl_restricted_flag) 1407 1408 #define DECL_READ_P(NODE) \ 1409 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag) 1410 1411 #define DECL_NONSHAREABLE(NODE) \ 1412 (TREE_CHECK2 (NODE, VAR_DECL, \ 1413 RESULT_DECL)->decl_common.decl_nonshareable_flag) 1414 1415 /* In a CALL_EXPR, means that the call is the jump from a thunk to the 1416 thunked-to function. */ 1417 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag) 1418 1419 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that 1420 it has been built for the declaration of a variable-sized object. */ 1421 #define CALL_ALLOCA_FOR_VAR_P(NODE) \ 1422 (CALL_EXPR_CHECK (NODE)->base.protected_flag) 1423 1424 /* In a type, nonzero means that all objects of the type are guaranteed by the 1425 language or front-end to be properly aligned, so we can indicate that a MEM 1426 of this type is aligned at least to the alignment of the type, even if it 1427 doesn't appear that it is. We see this, for example, in object-oriented 1428 languages where a tag field may show this is an object of a more-aligned 1429 variant of the more generic type. 1430 1431 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME 1432 freelist. */ 1433 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag) 1434 1435 /* Used in classes in C++. */ 1436 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag) 1437 /* Used in classes in C++. */ 1438 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag) 1439 1440 /* True if reference type NODE is a C++ rvalue reference. */ 1441 #define TYPE_REF_IS_RVALUE(NODE) \ 1442 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag) 1443 1444 /* Nonzero in a _DECL if the use of the name is defined as a 1445 deprecated feature by __attribute__((deprecated)). */ 1446 #define TREE_DEPRECATED(NODE) \ 1447 ((NODE)->base.deprecated_flag) 1448 1449 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose 1450 uses are to be substituted for uses of the TREE_CHAINed identifier. */ 1451 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \ 1452 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag) 1453 1454 /* In fixed-point types, means a saturating type. */ 1455 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag) 1456 1457 /* These flags are available for each language front end to use internally. */ 1458 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0) 1459 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1) 1460 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2) 1461 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3) 1462 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4) 1463 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5) 1464 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6) 1465 1466 /* Define additional fields and accessors for nodes representing constants. */ 1467 1468 /* In an INTEGER_CST node. These two together make a 2-word integer. 1469 If the data type is signed, the value is sign-extended to 2 words 1470 even though not all of them may really be in use. 1471 In an unsigned constant shorter than 2 words, the extra bits are 0. */ 1472 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst) 1473 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low) 1474 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high) 1475 1476 #define INT_CST_LT(A, B) \ 1477 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \ 1478 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \ 1479 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 1480 1481 #define INT_CST_LT_UNSIGNED(A, B) \ 1482 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 1483 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 1484 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \ 1485 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \ 1486 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B))) 1487 1488 struct GTY(()) tree_int_cst { 1489 struct tree_typed typed; 1490 double_int int_cst; 1491 }; 1492 1493 /* In a REAL_CST node. struct real_value is an opaque entity, with 1494 manipulators defined in real.h. We don't want tree.h depending on 1495 real.h and transitively on tm.h. */ 1496 struct real_value; 1497 1498 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr) 1499 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE)) 1500 1501 struct GTY(()) tree_real_cst { 1502 struct tree_typed typed; 1503 struct real_value * real_cst_ptr; 1504 }; 1505 1506 /* In a FIXED_CST node. */ 1507 struct fixed_value; 1508 1509 #define TREE_FIXED_CST_PTR(NODE) \ 1510 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr) 1511 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE)) 1512 1513 struct GTY(()) tree_fixed_cst { 1514 struct tree_typed typed; 1515 struct fixed_value * fixed_cst_ptr; 1516 }; 1517 1518 /* In a STRING_CST */ 1519 /* In C terms, this is sizeof, not strlen. */ 1520 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length) 1521 #define TREE_STRING_POINTER(NODE) \ 1522 ((const char *)(STRING_CST_CHECK (NODE)->string.str)) 1523 1524 struct GTY(()) tree_string { 1525 struct tree_typed typed; 1526 int length; 1527 char str[1]; 1528 }; 1529 1530 /* In a COMPLEX_CST node. */ 1531 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real) 1532 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag) 1533 1534 struct GTY(()) tree_complex { 1535 struct tree_typed typed; 1536 tree real; 1537 tree imag; 1538 }; 1539 1540 /* In a VECTOR_CST node. */ 1541 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements) 1542 1543 struct GTY(()) tree_vector { 1544 struct tree_typed typed; 1545 tree elements; 1546 }; 1547 1548 #include "symtab.h" 1549 1550 /* Define fields and accessors for some special-purpose tree nodes. */ 1551 1552 #define IDENTIFIER_LENGTH(NODE) \ 1553 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len) 1554 #define IDENTIFIER_POINTER(NODE) \ 1555 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str) 1556 #define IDENTIFIER_HASH_VALUE(NODE) \ 1557 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value) 1558 1559 /* Translate a hash table identifier pointer to a tree_identifier 1560 pointer, and vice versa. */ 1561 1562 #define HT_IDENT_TO_GCC_IDENT(NODE) \ 1563 ((tree) ((char *) (NODE) - sizeof (struct tree_common))) 1564 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id) 1565 1566 struct GTY(()) tree_identifier { 1567 struct tree_common common; 1568 struct ht_identifier id; 1569 }; 1570 1571 /* In a TREE_LIST node. */ 1572 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose) 1573 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value) 1574 1575 struct GTY(()) tree_list { 1576 struct tree_common common; 1577 tree purpose; 1578 tree value; 1579 }; 1580 1581 /* In a TREE_VEC node. */ 1582 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) 1583 #define TREE_VEC_END(NODE) \ 1584 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length])) 1585 1586 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I) 1587 1588 struct GTY(()) tree_vec { 1589 struct tree_common common; 1590 int length; 1591 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1]; 1592 }; 1593 1594 /* In a CONSTRUCTOR node. */ 1595 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts) 1596 #define CONSTRUCTOR_ELT(NODE,IDX) \ 1597 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX)) 1598 #define CONSTRUCTOR_NELTS(NODE) \ 1599 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE))) 1600 1601 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the 1602 value of each element (stored within VAL). IX must be a scratch variable 1603 of unsigned integer type. */ 1604 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \ 1605 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ 1606 ? false \ 1607 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \ 1608 true); \ 1609 (IX)++) 1610 1611 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both 1612 the value of each element (stored within VAL) and its index (stored 1613 within INDEX). IX must be a scratch variable of unsigned integer type. */ 1614 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \ 1615 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \ 1616 ? false \ 1617 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \ 1618 (INDEX = VEC_index (constructor_elt, V, IX)->index), \ 1619 true); \ 1620 (IX)++) 1621 1622 /* Append a new constructor element to V, with the specified INDEX and VAL. */ 1623 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \ 1624 do { \ 1625 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \ 1626 _ce___->index = INDEX; \ 1627 _ce___->value = VALUE; \ 1628 } while (0) 1629 1630 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for 1631 constructor output purposes. */ 1632 #define CONSTRUCTOR_BITFIELD_P(NODE) \ 1633 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode) 1634 1635 /* True if NODE is a clobber right hand side, an expression of indeterminate 1636 value that clobbers the LHS in a copy instruction. We use a volatile 1637 empty CONSTRUCTOR for this, as it matches most of the necessary semantic. 1638 In particular the volatile flag causes us to not prematurely remove 1639 such clobber instructions. */ 1640 #define TREE_CLOBBER_P(NODE) \ 1641 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE)) 1642 1643 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the 1644 element. INDEX can optionally design the position of VALUE: in arrays, 1645 it is the index where VALUE has to be placed; in structures, it is the 1646 FIELD_DECL of the member. */ 1647 typedef struct GTY(()) constructor_elt_d { 1648 tree index; 1649 tree value; 1650 } constructor_elt; 1651 1652 DEF_VEC_O(constructor_elt); 1653 DEF_VEC_ALLOC_O(constructor_elt,gc); 1654 1655 struct GTY(()) tree_constructor { 1656 struct tree_typed typed; 1657 VEC(constructor_elt,gc) *elts; 1658 }; 1659 1660 /* Define fields and accessors for some nodes that represent expressions. */ 1661 1662 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */ 1663 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \ 1664 && VOID_TYPE_P (TREE_TYPE (NODE)) \ 1665 && integer_zerop (TREE_OPERAND (NODE, 0))) 1666 1667 /* In ordinary expression nodes. */ 1668 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE) 1669 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I) 1670 1671 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand 1672 length. Its value includes the length operand itself; that is, 1673 the minimum valid length is 1. 1674 Note that we have to bypass the use of TREE_OPERAND to access 1675 that field to avoid infinite recursion in expanding the macros. */ 1676 #define VL_EXP_OPERAND_LENGTH(NODE) \ 1677 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0])) 1678 1679 /* Nonzero if is_gimple_debug() may possibly hold. */ 1680 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments) 1681 1682 /* In a LOOP_EXPR node. */ 1683 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0) 1684 1685 /* The source location of this expression. Non-tree_exp nodes such as 1686 decls and constants can be shared among multiple locations, so 1687 return nothing. */ 1688 #define EXPR_LOCATION(NODE) \ 1689 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION) 1690 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS) 1691 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION) 1692 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location) 1693 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus) 1694 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus) 1695 1696 /* True if a tree is an expression or statement that can have a 1697 location. */ 1698 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE)) 1699 1700 extern void protected_set_expr_location (tree, location_t); 1701 1702 /* In a TARGET_EXPR node. */ 1703 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0) 1704 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1) 1705 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2) 1706 1707 /* DECL_EXPR accessor. This gives access to the DECL associated with 1708 the given declaration statement. */ 1709 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0) 1710 1711 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0) 1712 1713 /* COMPOUND_LITERAL_EXPR accessors. */ 1714 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \ 1715 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0) 1716 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ 1717 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE)) 1718 1719 /* SWITCH_EXPR accessors. These give access to the condition, body and 1720 original condition type (before any compiler conversions) 1721 of the switch statement, respectively. */ 1722 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0) 1723 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1) 1724 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2) 1725 1726 /* CASE_LABEL_EXPR accessors. These give access to the high and low values 1727 of a case label, respectively. */ 1728 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0) 1729 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1) 1730 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2) 1731 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3) 1732 1733 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match 1734 corresponding MEM_REF operands. */ 1735 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0)) 1736 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1)) 1737 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2)) 1738 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3)) 1739 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4)) 1740 1741 /* The operands of a BIND_EXPR. */ 1742 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0)) 1743 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1)) 1744 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2)) 1745 1746 /* GOTO_EXPR accessor. This gives access to the label associated with 1747 a goto statement. */ 1748 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0) 1749 1750 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the 1751 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and 1752 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the 1753 statement. */ 1754 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0) 1755 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1) 1756 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2) 1757 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3) 1758 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4) 1759 /* Nonzero if we want to create an ASM_INPUT instead of an 1760 ASM_OPERAND with no operands. */ 1761 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag) 1762 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag) 1763 1764 /* COND_EXPR accessors. */ 1765 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) 1766 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1)) 1767 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2)) 1768 1769 /* Accessors for the chains of recurrences. */ 1770 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0) 1771 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1) 1772 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2) 1773 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) 1774 1775 /* LABEL_EXPR accessor. This gives access to the label associated with 1776 the given label expression. */ 1777 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0) 1778 1779 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other 1780 accessors for SSA operands. */ 1781 1782 /* CATCH_EXPR accessors. */ 1783 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0) 1784 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1) 1785 1786 /* EH_FILTER_EXPR accessors. */ 1787 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0) 1788 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1) 1789 1790 /* OBJ_TYPE_REF accessors. */ 1791 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0) 1792 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1) 1793 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2) 1794 1795 /* ASSERT_EXPR accessors. */ 1796 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0) 1797 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1) 1798 1799 /* CALL_EXPR accessors. 1800 */ 1801 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1) 1802 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2) 1803 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3) 1804 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3) 1805 1806 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE. 1807 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if 1808 the argument count is zero when checking is enabled. Instead, do 1809 the pointer arithmetic to advance past the 3 fixed operands in a 1810 CALL_EXPR. That produces a valid pointer to just past the end of the 1811 operand array, even if it's not valid to dereference it. */ 1812 #define CALL_EXPR_ARGP(NODE) \ 1813 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3) 1814 1815 /* TM directives and accessors. */ 1816 #define TRANSACTION_EXPR_BODY(NODE) \ 1817 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0) 1818 #define TRANSACTION_EXPR_OUTER(NODE) \ 1819 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag) 1820 #define TRANSACTION_EXPR_RELAXED(NODE) \ 1821 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag) 1822 1823 /* OpenMP directive and clause accessors. */ 1824 1825 #define OMP_BODY(NODE) \ 1826 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0) 1827 #define OMP_CLAUSES(NODE) \ 1828 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1) 1829 1830 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0) 1831 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1) 1832 1833 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0) 1834 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1) 1835 1836 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK) 1837 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0) 1838 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1) 1839 1840 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0) 1841 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1) 1842 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2) 1843 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3) 1844 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4) 1845 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5) 1846 1847 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0) 1848 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1) 1849 1850 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0) 1851 1852 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0) 1853 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1) 1854 1855 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0) 1856 1857 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0) 1858 1859 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0) 1860 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1) 1861 1862 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE)) 1863 #define OMP_CLAUSE_DECL(NODE) \ 1864 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \ 1865 OMP_CLAUSE_PRIVATE, \ 1866 OMP_CLAUSE_COPYPRIVATE), 0) 1867 #define OMP_CLAUSE_HAS_LOCATION(NODE) \ 1868 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION) 1869 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus 1870 1871 /* True on an OMP_SECTION statement that was the last lexical member. 1872 This status is meaningful in the implementation of lastprivate. */ 1873 #define OMP_SECTION_LAST(NODE) \ 1874 (OMP_SECTION_CHECK (NODE)->base.private_flag) 1875 1876 /* True on an OMP_PARALLEL statement if it represents an explicit 1877 combined parallel work-sharing constructs. */ 1878 #define OMP_PARALLEL_COMBINED(NODE) \ 1879 (OMP_PARALLEL_CHECK (NODE)->base.private_flag) 1880 1881 /* True on a PRIVATE clause if its decl is kept around for debugging 1882 information only and its DECL_VALUE_EXPR is supposed to point 1883 to what it has been remapped to. */ 1884 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \ 1885 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag) 1886 1887 /* True on a PRIVATE clause if ctor needs access to outer region's 1888 variable. */ 1889 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \ 1890 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)) 1891 1892 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same 1893 decl is present in the chain. */ 1894 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \ 1895 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag) 1896 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \ 1897 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \ 1898 OMP_CLAUSE_LASTPRIVATE),\ 1899 1) 1900 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \ 1901 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1902 1903 #define OMP_CLAUSE_FINAL_EXPR(NODE) \ 1904 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0) 1905 #define OMP_CLAUSE_IF_EXPR(NODE) \ 1906 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0) 1907 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \ 1908 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0) 1909 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \ 1910 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0) 1911 1912 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \ 1913 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0) 1914 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \ 1915 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1) 1916 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \ 1917 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2) 1918 1919 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \ 1920 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code) 1921 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \ 1922 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1) 1923 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \ 1924 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2) 1925 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \ 1926 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init 1927 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \ 1928 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge 1929 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \ 1930 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3) 1931 1932 enum omp_clause_schedule_kind 1933 { 1934 OMP_CLAUSE_SCHEDULE_STATIC, 1935 OMP_CLAUSE_SCHEDULE_DYNAMIC, 1936 OMP_CLAUSE_SCHEDULE_GUIDED, 1937 OMP_CLAUSE_SCHEDULE_AUTO, 1938 OMP_CLAUSE_SCHEDULE_RUNTIME 1939 }; 1940 1941 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \ 1942 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind) 1943 1944 enum omp_clause_default_kind 1945 { 1946 OMP_CLAUSE_DEFAULT_UNSPECIFIED, 1947 OMP_CLAUSE_DEFAULT_SHARED, 1948 OMP_CLAUSE_DEFAULT_NONE, 1949 OMP_CLAUSE_DEFAULT_PRIVATE, 1950 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE 1951 }; 1952 1953 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \ 1954 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind) 1955 1956 struct GTY(()) tree_exp { 1957 struct tree_typed typed; 1958 location_t locus; 1959 tree block; 1960 tree GTY ((special ("tree_exp"), 1961 desc ("TREE_CODE ((tree) &%0)"))) 1962 operands[1]; 1963 }; 1964 1965 /* SSA_NAME accessors. */ 1966 1967 /* Returns the variable being referenced. Once released, this is the 1968 only field that can be relied upon. */ 1969 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var 1970 1971 /* Returns the statement which defines this SSA name. */ 1972 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt 1973 1974 /* Returns the SSA version number of this SSA name. Note that in 1975 tree SSA, version numbers are not per variable and may be recycled. */ 1976 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version 1977 1978 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are 1979 never output, so we can safely use the ASM_WRITTEN_FLAG for this 1980 status bit. */ 1981 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \ 1982 SSA_NAME_CHECK (NODE)->base.asm_written_flag 1983 1984 /* Nonzero if this SSA_NAME expression is currently on the free list of 1985 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing 1986 has no meaning for an SSA_NAME. */ 1987 #define SSA_NAME_IN_FREE_LIST(NODE) \ 1988 SSA_NAME_CHECK (NODE)->base.nothrow_flag 1989 1990 /* Nonzero if this SSA_NAME is the default definition for the 1991 underlying symbol. A default SSA name is created for symbol S if 1992 the very first reference to S in the function is a read operation. 1993 Default definitions are always created by an empty statement and 1994 belong to no basic block. */ 1995 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \ 1996 SSA_NAME_CHECK (NODE)->base.default_def_flag 1997 1998 /* Attributes for SSA_NAMEs for pointer-type variables. */ 1999 #define SSA_NAME_PTR_INFO(N) \ 2000 SSA_NAME_CHECK (N)->ssa_name.ptr_info 2001 2002 /* Defined in tree-flow.h. */ 2003 struct ptr_info_def; 2004 2005 /* Immediate use linking structure. This structure is used for maintaining 2006 a doubly linked list of uses of an SSA_NAME. */ 2007 typedef struct GTY(()) ssa_use_operand_d { 2008 struct ssa_use_operand_d* GTY((skip(""))) prev; 2009 struct ssa_use_operand_d* GTY((skip(""))) next; 2010 /* Immediate uses for a given SSA name are maintained as a cyclic 2011 list. To recognize the root of this list, the location field 2012 needs to point to the original SSA name. Since statements and 2013 SSA names are of different data types, we need this union. See 2014 the explanation in struct immediate_use_iterator_d. */ 2015 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc; 2016 tree *GTY((skip(""))) use; 2017 } ssa_use_operand_t; 2018 2019 /* Return the immediate_use information for an SSA_NAME. */ 2020 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses 2021 2022 struct GTY(()) tree_ssa_name { 2023 struct tree_typed typed; 2024 2025 /* _DECL wrapped by this SSA name. */ 2026 tree var; 2027 2028 /* Statement that defines this SSA name. */ 2029 gimple def_stmt; 2030 2031 /* SSA version number. */ 2032 unsigned int version; 2033 2034 /* Pointer attributes used for alias analysis. */ 2035 struct ptr_info_def *ptr_info; 2036 2037 /* Immediate uses list for this SSA_NAME. */ 2038 struct ssa_use_operand_d imm_uses; 2039 }; 2040 2041 struct GTY(()) phi_arg_d { 2042 /* imm_use MUST be the first element in struct because we do some 2043 pointer arithmetic with it. See phi_arg_index_from_use. */ 2044 struct ssa_use_operand_d imm_use; 2045 tree def; 2046 location_t locus; 2047 }; 2048 2049 2050 #define OMP_CLAUSE_CODE(NODE) \ 2051 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code 2052 2053 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \ 2054 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE)) 2055 2056 #define OMP_CLAUSE_CODE(NODE) \ 2057 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code 2058 2059 #define OMP_CLAUSE_OPERAND(NODE, I) \ 2060 OMP_CLAUSE_ELT_CHECK (NODE, I) 2061 2062 struct GTY(()) tree_omp_clause { 2063 struct tree_common common; 2064 location_t locus; 2065 enum omp_clause_code code; 2066 union omp_clause_subcode { 2067 enum omp_clause_default_kind default_kind; 2068 enum omp_clause_schedule_kind schedule_kind; 2069 enum tree_code reduction_code; 2070 } GTY ((skip)) subcode; 2071 2072 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's 2073 usage. */ 2074 gimple_seq gimple_reduction_init; 2075 gimple_seq gimple_reduction_merge; 2076 2077 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1]; 2078 }; 2079 2080 2081 /* In a BLOCK node. */ 2082 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars) 2083 #define BLOCK_NONLOCALIZED_VARS(NODE) \ 2084 (BLOCK_CHECK (NODE)->block.nonlocalized_vars) 2085 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \ 2086 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE)) 2087 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \ 2088 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N) 2089 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks) 2090 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext) 2091 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain) 2092 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin) 2093 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag) 2094 2095 /* An index number for this block. These values are not guaranteed to 2096 be unique across functions -- whether or not they are depends on 2097 the debugging output format in use. */ 2098 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num) 2099 2100 /* If block reordering splits a lexical block into discontiguous 2101 address ranges, we'll make a copy of the original block. 2102 2103 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN. 2104 In that case, we have one source block that has been replicated 2105 (through inlining or unrolling) into many logical blocks, and that 2106 these logical blocks have different physical variables in them. 2107 2108 In this case, we have one logical block split into several 2109 non-contiguous address ranges. Most debug formats can't actually 2110 represent this idea directly, so we fake it by creating multiple 2111 logical blocks with the same variables in them. However, for those 2112 that do support non-contiguous regions, these allow the original 2113 logical block to be reconstructed, along with the set of address 2114 ranges. 2115 2116 One of the logical block fragments is arbitrarily chosen to be 2117 the ORIGIN. The other fragments will point to the origin via 2118 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer 2119 be null. The list of fragments will be chained through 2120 BLOCK_FRAGMENT_CHAIN from the origin. */ 2121 2122 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin) 2123 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain) 2124 2125 /* For an inlined function, this gives the location where it was called 2126 from. This is only set in the top level block, which corresponds to the 2127 inlined function scope. This is used in the debug output routines. */ 2128 2129 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus) 2130 2131 struct GTY(()) tree_block { 2132 struct tree_base base; 2133 tree chain; 2134 2135 unsigned abstract_flag : 1; 2136 unsigned block_num : 31; 2137 2138 location_t locus; 2139 2140 tree vars; 2141 VEC(tree,gc) *nonlocalized_vars; 2142 2143 tree subblocks; 2144 tree supercontext; 2145 tree abstract_origin; 2146 tree fragment_origin; 2147 tree fragment_chain; 2148 }; 2149 2150 /* Define fields and accessors for nodes representing data types. */ 2151 2152 /* See tree.def for documentation of the use of these fields. 2153 Look at the documentation of the various ..._TYPE tree codes. 2154 2155 Note that the type.values, type.minval, and type.maxval fields are 2156 overloaded and used for different macros in different kinds of types. 2157 Each macro must check to ensure the tree node is of the proper kind of 2158 type. Note also that some of the front-ends also overload these fields, 2159 so they must be checked as well. */ 2160 2161 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid) 2162 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size) 2163 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit) 2164 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to) 2165 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to) 2166 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision) 2167 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name) 2168 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant) 2169 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant) 2170 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context) 2171 2172 /* Vector types need to check target flags to determine type. */ 2173 extern enum machine_mode vector_type_mode (const_tree); 2174 #define TYPE_MODE(NODE) \ 2175 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \ 2176 ? vector_type_mode (NODE) : (NODE)->type_common.mode) 2177 #define SET_TYPE_MODE(NODE, MODE) \ 2178 (TYPE_CHECK (NODE)->type_common.mode = (MODE)) 2179 2180 /* The "canonical" type for this type node, which is used by frontends to 2181 compare the type for equality with another type. If two types are 2182 equal (based on the semantics of the language), then they will have 2183 equivalent TYPE_CANONICAL entries. 2184 2185 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus 2186 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot 2187 be used for comparison against other types. Instead, the type is 2188 said to require structural equality checks, described in 2189 TYPE_STRUCTURAL_EQUALITY_P. 2190 2191 For unqualified aggregate and function types the middle-end relies on 2192 TYPE_CANONICAL to tell whether two variables can be assigned 2193 to each other without a conversion. The middle-end also makes sure 2194 to assign the same alias-sets to the type partition with equal 2195 TYPE_CANONICAL of their unqualified variants. */ 2196 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical) 2197 /* Indicates that the type node requires structural equality 2198 checks. The compiler will need to look at the composition of the 2199 type to determine whether it is equal to another type, rather than 2200 just comparing canonical type pointers. For instance, we would need 2201 to look at the return and parameter types of a FUNCTION_TYPE 2202 node. */ 2203 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE) 2204 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the 2205 type node requires structural equality. */ 2206 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE) 2207 2208 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE))) 2209 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE))) 2210 2211 /* The (language-specific) typed-based alias set for this type. 2212 Objects whose TYPE_ALIAS_SETs are different cannot alias each 2213 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been 2214 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this 2215 type can alias objects of any type. */ 2216 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set) 2217 2218 /* Nonzero iff the typed-based alias set for this type has been 2219 calculated. */ 2220 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \ 2221 (TYPE_CHECK (NODE)->type_common.alias_set != -1) 2222 2223 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply 2224 to this type. */ 2225 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes) 2226 2227 /* The alignment necessary for objects of this type. 2228 The value is an int, measured in bits. */ 2229 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align) 2230 2231 /* 1 if the alignment for this type was requested by "aligned" attribute, 2232 0 if it is the default for this type. */ 2233 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.user_align) 2234 2235 /* The alignment for NODE, in bytes. */ 2236 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT) 2237 2238 /* If your language allows you to declare types, and you want debug info 2239 for them, then you need to generate corresponding TYPE_DECL nodes. 2240 These "stub" TYPE_DECL nodes have no name, and simply point at the 2241 type node. You then set the TYPE_STUB_DECL field of the type node 2242 to point back at the TYPE_DECL node. This allows the debug routines 2243 to know that the two nodes represent the same type, so that we only 2244 get one debug info record for them. */ 2245 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE))) 2246 2247 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type 2248 has BLKmode only because it lacks the alignment requirement for 2249 its size. */ 2250 #define TYPE_NO_FORCE_BLK(NODE) \ 2251 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag) 2252 2253 /* In an INTEGER_TYPE, it means the type represents a size. We use 2254 this both for validity checking and to permit optimizations that 2255 are unsafe for other types. Note that the C `size_t' type should 2256 *not* have this flag set. The `size_t' type is simply a typedef 2257 for an ordinary integer type that happens to be the type of an 2258 expression returned by `sizeof'; `size_t' has no special 2259 properties. Expressions whose type have TYPE_IS_SIZETYPE set are 2260 always actual sizes. */ 2261 #define TYPE_IS_SIZETYPE(NODE) \ 2262 (INTEGER_TYPE_CHECK (NODE)->type_common.no_force_blk_flag) 2263 2264 /* Nonzero in a type considered volatile as a whole. */ 2265 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag) 2266 2267 /* Means this type is const-qualified. */ 2268 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag) 2269 2270 /* If nonzero, this type is `restrict'-qualified, in the C sense of 2271 the term. */ 2272 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag) 2273 2274 /* If nonzero, type's name shouldn't be emitted into debug info. */ 2275 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag) 2276 2277 /* The address space the type is in. */ 2278 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space) 2279 2280 /* There is a TYPE_QUAL value for each type qualifier. They can be 2281 combined by bitwise-or to form the complete set of qualifiers for a 2282 type. */ 2283 enum cv_qualifier 2284 { 2285 TYPE_UNQUALIFIED = 0x0, 2286 TYPE_QUAL_CONST = 0x1, 2287 TYPE_QUAL_VOLATILE = 0x2, 2288 TYPE_QUAL_RESTRICT = 0x4 2289 }; 2290 2291 /* Encode/decode the named memory support as part of the qualifier. If more 2292 than 8 qualifiers are added, these macros need to be adjusted. */ 2293 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8) 2294 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF) 2295 2296 /* Return all qualifiers except for the address space qualifiers. */ 2297 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00) 2298 2299 /* Only keep the address space out of the qualifiers and discard the other 2300 qualifiers. */ 2301 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00) 2302 2303 /* The set of type qualifiers for this type. */ 2304 #define TYPE_QUALS(NODE) \ 2305 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2306 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2307 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \ 2308 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))) 2309 2310 /* The same as TYPE_QUALS without the address space qualifications. */ 2311 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \ 2312 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \ 2313 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \ 2314 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))) 2315 2316 /* These flags are available for each language front end to use internally. */ 2317 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0) 2318 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1) 2319 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2) 2320 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3) 2321 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4) 2322 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5) 2323 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6) 2324 2325 /* Used to keep track of visited nodes in tree traversals. This is set to 2326 0 by copy_node and make_node. */ 2327 #define TREE_VISITED(NODE) ((NODE)->base.visited) 2328 2329 /* If set in an ARRAY_TYPE, indicates a string type (for languages 2330 that distinguish string from array of char). 2331 If set in a INTEGER_TYPE, indicates a character type. */ 2332 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag) 2333 2334 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */ 2335 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \ 2336 (((unsigned HOST_WIDE_INT) 1) \ 2337 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision) 2338 2339 /* Set precision to n when we have 2^n sub-parts of the vector. */ 2340 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \ 2341 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X)) 2342 2343 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings 2344 about missing conversions to other vector types of the same size. */ 2345 #define TYPE_VECTOR_OPAQUE(NODE) \ 2346 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag) 2347 2348 /* Indicates that objects of this type must be initialized by calling a 2349 function when they are created. */ 2350 #define TYPE_NEEDS_CONSTRUCTING(NODE) \ 2351 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag) 2352 2353 /* Indicates that a UNION_TYPE object should be passed the same way that 2354 the first union alternative would be passed, or that a RECORD_TYPE 2355 object should be passed the same way that the first (and only) member 2356 would be passed. */ 2357 #define TYPE_TRANSPARENT_AGGR(NODE) \ 2358 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag) 2359 2360 /* For an ARRAY_TYPE, indicates that it is not permitted to take the 2361 address of a component of the type. This is the counterpart of 2362 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */ 2363 #define TYPE_NONALIASED_COMPONENT(NODE) \ 2364 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag) 2365 2366 /* Indicated that objects of this type should be laid out in as 2367 compact a way as possible. */ 2368 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.packed_flag) 2369 2370 /* Used by type_contains_placeholder_p to avoid recomputation. 2371 Values are: 0 (unknown), 1 (false), 2 (true). Never access 2372 this field directly. */ 2373 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \ 2374 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits) 2375 2376 /* The debug output functions use the symtab union field to store 2377 information specific to the debugging format. The different debug 2378 output hooks store different types in the union field. These three 2379 macros are used to access different fields in the union. The debug 2380 hooks are responsible for consistently using only a specific 2381 macro. */ 2382 2383 /* Symtab field as an integer. Used by stabs generator in dbxout.c to 2384 hold the type's number in the generated stabs. */ 2385 #define TYPE_SYMTAB_ADDRESS(NODE) \ 2386 (TYPE_CHECK (NODE)->type_common.symtab.address) 2387 2388 /* Symtab field as a string. Used by COFF generator in sdbout.c to 2389 hold struct/union type tag names. */ 2390 #define TYPE_SYMTAB_POINTER(NODE) \ 2391 (TYPE_CHECK (NODE)->type_common.symtab.pointer) 2392 2393 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator 2394 in dwarf2out.c to point to the DIE generated for the type. */ 2395 #define TYPE_SYMTAB_DIE(NODE) \ 2396 (TYPE_CHECK (NODE)->type_common.symtab.die) 2397 2398 /* The garbage collector needs to know the interpretation of the 2399 symtab field. These constants represent the different types in the 2400 union. */ 2401 2402 #define TYPE_SYMTAB_IS_ADDRESS (0) 2403 #define TYPE_SYMTAB_IS_POINTER (1) 2404 #define TYPE_SYMTAB_IS_DIE (2) 2405 2406 struct die_struct; 2407 2408 struct GTY(()) tree_type_common { 2409 struct tree_common common; 2410 tree size; 2411 tree size_unit; 2412 tree attributes; 2413 unsigned int uid; 2414 2415 unsigned int precision : 10; 2416 unsigned no_force_blk_flag : 1; 2417 unsigned needs_constructing_flag : 1; 2418 unsigned transparent_aggr_flag : 1; 2419 unsigned restrict_flag : 1; 2420 unsigned contains_placeholder_bits : 2; 2421 2422 ENUM_BITFIELD(machine_mode) mode : 8; 2423 2424 unsigned string_flag : 1; 2425 unsigned lang_flag_0 : 1; 2426 unsigned lang_flag_1 : 1; 2427 unsigned lang_flag_2 : 1; 2428 unsigned lang_flag_3 : 1; 2429 unsigned lang_flag_4 : 1; 2430 unsigned lang_flag_5 : 1; 2431 unsigned lang_flag_6 : 1; 2432 2433 unsigned int align; 2434 alias_set_type alias_set; 2435 tree pointer_to; 2436 tree reference_to; 2437 union tree_type_symtab { 2438 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address; 2439 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer; 2440 struct die_struct * GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die; 2441 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab; 2442 tree name; 2443 tree next_variant; 2444 tree main_variant; 2445 tree context; 2446 tree canonical; 2447 }; 2448 2449 #define TYPE_LANG_SPECIFIC(NODE) \ 2450 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific) 2451 2452 struct GTY(()) tree_type_with_lang_specific { 2453 struct tree_type_common common; 2454 /* Points to a structure whose details depend on the language in use. */ 2455 struct lang_type *lang_specific; 2456 }; 2457 2458 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values) 2459 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values) 2460 #define TYPE_FIELDS(NODE) \ 2461 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values) 2462 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values) 2463 #define TYPE_ARG_TYPES(NODE) \ 2464 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values) 2465 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values) 2466 2467 #define TYPE_METHODS(NODE) \ 2468 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval) 2469 #define TYPE_VFIELD(NODE) \ 2470 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval) 2471 #define TYPE_METHOD_BASETYPE(NODE) \ 2472 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval) 2473 #define TYPE_OFFSET_BASETYPE(NODE) \ 2474 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval) 2475 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval) 2476 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval) 2477 #define TYPE_NEXT_PTR_TO(NODE) \ 2478 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval) 2479 #define TYPE_NEXT_REF_TO(NODE) \ 2480 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval) 2481 #define TYPE_MIN_VALUE(NODE) \ 2482 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval) 2483 #define TYPE_MAX_VALUE(NODE) \ 2484 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval) 2485 2486 /* If non-NULL, this is an upper bound of the size (in bytes) of an 2487 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be 2488 allocated. */ 2489 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \ 2490 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval) 2491 2492 /* For record and union types, information about this type, as a base type 2493 for itself. */ 2494 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) 2495 2496 /* For non record and union types, used in a language-dependent way. */ 2497 #define TYPE_LANG_SLOT_1(NODE) \ 2498 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo) 2499 2500 struct GTY(()) tree_type_non_common { 2501 struct tree_type_with_lang_specific with_lang_specific; 2502 tree values; 2503 tree minval; 2504 tree maxval; 2505 tree binfo; 2506 }; 2507 2508 /* Define accessor macros for information about type inheritance 2509 and basetypes. 2510 2511 A "basetype" means a particular usage of a data type for inheritance 2512 in another type. Each such basetype usage has its own "binfo" 2513 object to describe it. The binfo object is a TREE_VEC node. 2514 2515 Inheritance is represented by the binfo nodes allocated for a 2516 given type. For example, given types C and D, such that D is 2517 inherited by C, 3 binfo nodes will be allocated: one for describing 2518 the binfo properties of C, similarly one for D, and one for 2519 describing the binfo properties of D as a base type for C. 2520 Thus, given a pointer to class C, one can get a pointer to the binfo 2521 of D acting as a basetype for C by looking at C's binfo's basetypes. */ 2522 2523 /* BINFO specific flags. */ 2524 2525 /* Nonzero means that the derivation chain is via a `virtual' declaration. */ 2526 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag) 2527 2528 /* Flags for language dependent use. */ 2529 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE)) 2530 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE)) 2531 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE)) 2532 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE)) 2533 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE)) 2534 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE)) 2535 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE)) 2536 2537 /* The actual data type node being inherited in this basetype. */ 2538 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE)) 2539 2540 /* The offset where this basetype appears in its containing type. 2541 BINFO_OFFSET slot holds the offset (in bytes) 2542 from the base of the complete object to the base of the part of the 2543 object that is allocated on behalf of this `type'. 2544 This is always 0 except when there is multiple inheritance. */ 2545 2546 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset) 2547 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE))) 2548 2549 /* The virtual function table belonging to this basetype. Virtual 2550 function tables provide a mechanism for run-time method dispatching. 2551 The entries of a virtual function table are language-dependent. */ 2552 2553 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable) 2554 2555 /* The virtual functions in the virtual function table. This is 2556 a TREE_LIST that is used as an initial approximation for building 2557 a virtual function table for this basetype. */ 2558 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals) 2559 2560 /* A vector of binfos for the direct basetypes inherited by this 2561 basetype. 2562 2563 If this basetype describes type D as inherited in C, and if the 2564 basetypes of D are E and F, then this vector contains binfos for 2565 inheritance of E and F by C. */ 2566 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos) 2567 2568 /* The number of basetypes for NODE. */ 2569 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE))) 2570 2571 /* Accessor macro to get to the Nth base binfo of this binfo. */ 2572 #define BINFO_BASE_BINFO(NODE,N) \ 2573 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N))) 2574 #define BINFO_BASE_ITERATE(NODE,N,B) \ 2575 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B))) 2576 #define BINFO_BASE_APPEND(NODE,T) \ 2577 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T))) 2578 2579 /* For a BINFO record describing a virtual base class, i.e., one where 2580 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual 2581 base. The actual contents are language-dependent. In the C++ 2582 front-end this field is an INTEGER_CST giving an offset into the 2583 vtable where the offset to the virtual base can be found. */ 2584 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field) 2585 2586 /* Indicates the accesses this binfo has to its bases. The values are 2587 access_public_node, access_protected_node or access_private_node. 2588 If this array is not present, public access is implied. */ 2589 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses) 2590 2591 #define BINFO_BASE_ACCESS(NODE,N) \ 2592 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N)) 2593 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \ 2594 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T)) 2595 2596 /* The index in the VTT where this subobject's sub-VTT can be found. 2597 NULL_TREE if there is no sub-VTT. */ 2598 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt) 2599 2600 /* The index in the VTT where the vptr for this subobject can be 2601 found. NULL_TREE if there is no secondary vptr in the VTT. */ 2602 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr) 2603 2604 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base 2605 inheriting this base for non-virtual bases. For virtual bases it 2606 points either to the binfo for which this is a primary binfo, or to 2607 the binfo of the most derived type. */ 2608 #define BINFO_INHERITANCE_CHAIN(NODE) \ 2609 (TREE_BINFO_CHECK(NODE)->binfo.inheritance) 2610 2611 struct GTY (()) tree_binfo { 2612 struct tree_common common; 2613 2614 tree offset; 2615 tree vtable; 2616 tree virtuals; 2617 tree vptr_field; 2618 VEC(tree,gc) *base_accesses; 2619 tree inheritance; 2620 2621 tree vtt_subvtt; 2622 tree vtt_vptr; 2623 2624 VEC(tree,none) base_binfos; 2625 }; 2626 2627 2628 /* Define fields and accessors for nodes representing declared names. */ 2629 2630 /* Nonzero if DECL represents a variable for the SSA passes. */ 2631 #define SSA_VAR_P(DECL) \ 2632 (TREE_CODE (DECL) == VAR_DECL \ 2633 || TREE_CODE (DECL) == PARM_DECL \ 2634 || TREE_CODE (DECL) == RESULT_DECL \ 2635 || (TREE_CODE (DECL) == SSA_NAME \ 2636 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \ 2637 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \ 2638 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL))) 2639 2640 2641 2642 2643 /* Enumerate visibility settings. */ 2644 #ifndef SYMBOL_VISIBILITY_DEFINED 2645 #define SYMBOL_VISIBILITY_DEFINED 2646 enum symbol_visibility 2647 { 2648 VISIBILITY_DEFAULT, 2649 VISIBILITY_PROTECTED, 2650 VISIBILITY_HIDDEN, 2651 VISIBILITY_INTERNAL 2652 }; 2653 #endif 2654 2655 struct function; 2656 2657 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE))) 2658 2659 /* This is the name of the object as written by the user. 2660 It is an IDENTIFIER_NODE. */ 2661 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name) 2662 2663 /* Every ..._DECL node gets a unique number. */ 2664 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid) 2665 2666 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous 2667 uses. */ 2668 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL))) 2669 2670 /* Every ..._DECL node gets a unique number that stays the same even 2671 when the decl is copied by the inliner once it is set. */ 2672 #define DECL_PT_UID(NODE) \ 2673 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \ 2674 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid) 2675 /* Initialize the ..._DECL node pt-uid to the decls uid. */ 2676 #define SET_DECL_PT_UID(NODE, UID) \ 2677 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID)) 2678 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to 2679 be preserved when copyin the decl. */ 2680 #define DECL_PT_UID_SET_P(NODE) \ 2681 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u) 2682 2683 /* These two fields describe where in the source code the declaration 2684 was. If the declaration appears in several places (as for a C 2685 function that is declared first and then defined later), this 2686 information should refer to the definition. */ 2687 #define DECL_SOURCE_LOCATION(NODE) \ 2688 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus) 2689 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE)) 2690 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE)) 2691 #define DECL_IS_BUILTIN(DECL) \ 2692 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION) 2693 2694 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or 2695 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL, 2696 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL 2697 nodes, this points to either the FUNCTION_DECL for the containing 2698 function, the RECORD_TYPE or UNION_TYPE for the containing type, or 2699 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file 2700 scope". In particular, for VAR_DECLs which are virtual table pointers 2701 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type 2702 they belong to. */ 2703 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context) 2704 #define DECL_FIELD_CONTEXT(NODE) \ 2705 (FIELD_DECL_CHECK (NODE)->decl_minimal.context) 2706 2707 /* If nonzero, decl's name shouldn't be emitted into debug info. */ 2708 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag) 2709 2710 struct GTY(()) tree_decl_minimal { 2711 struct tree_common common; 2712 location_t locus; 2713 unsigned int uid; 2714 tree name; 2715 tree context; 2716 }; 2717 2718 2719 /* For any sort of a ..._DECL node, this points to the original (abstract) 2720 decl node which this decl is an inlined/cloned instance of, or else it 2721 is NULL indicating that this decl is not an instance of some other decl. 2722 2723 The C front-end also uses this in a nested declaration of an inline 2724 function, to point back to the definition. */ 2725 #define DECL_ABSTRACT_ORIGIN(NODE) \ 2726 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin) 2727 2728 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract 2729 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */ 2730 #define DECL_ORIGIN(NODE) \ 2731 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE)) 2732 2733 /* Nonzero for any sort of ..._DECL node means this decl node represents an 2734 inline instance of some original (abstract) decl from an inline function; 2735 suppress any warnings about shadowing some other variable. FUNCTION_DECL 2736 nodes can also have their abstract origin set to themselves. */ 2737 #define DECL_FROM_INLINE(NODE) \ 2738 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \ 2739 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE)) 2740 2741 /* In a DECL this is the field where attributes are stored. */ 2742 #define DECL_ATTRIBUTES(NODE) \ 2743 (DECL_COMMON_CHECK (NODE)->decl_common.attributes) 2744 2745 /* For a FUNCTION_DECL, holds the tree of BINDINGs. 2746 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK. 2747 For a VAR_DECL, holds the initial value. 2748 For a PARM_DECL, used for DECL_ARG_TYPE--default 2749 values for parameters are encoded in the type of the function, 2750 not in the PARM_DECL slot. 2751 For a FIELD_DECL, this is used for enumeration values and the C 2752 frontend uses it for temporarily storing bitwidth of bitfields. 2753 2754 ??? Need to figure out some way to check this isn't a PARM_DECL. */ 2755 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial) 2756 2757 /* Holds the size of the datum, in bits, as a tree expression. 2758 Need not be constant. */ 2759 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size) 2760 /* Likewise for the size in bytes. */ 2761 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit) 2762 /* Holds the alignment required for the datum, in bits. */ 2763 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align) 2764 /* The alignment of NODE, in bytes. */ 2765 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT) 2766 /* Set if the alignment of this DECL has been set by the user, for 2767 example with an 'aligned' attribute. */ 2768 #define DECL_USER_ALIGN(NODE) \ 2769 (DECL_COMMON_CHECK (NODE)->base.user_align) 2770 /* Holds the machine mode corresponding to the declaration of a variable or 2771 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a 2772 FIELD_DECL. */ 2773 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode) 2774 2775 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in 2776 operation it is. Note, however, that this field is overloaded, with 2777 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be 2778 checked before any access to the former. */ 2779 #define DECL_FUNCTION_CODE(NODE) \ 2780 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code) 2781 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \ 2782 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from) 2783 2784 #define DECL_FUNCTION_PERSONALITY(NODE) \ 2785 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality) 2786 2787 /* Nonzero for a given ..._DECL node means that the name of this node should 2788 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that 2789 the associated type should be ignored. For a FUNCTION_DECL, the body of 2790 the function should also be ignored. */ 2791 #define DECL_IGNORED_P(NODE) \ 2792 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag) 2793 2794 /* Nonzero for a given ..._DECL node means that this node represents an 2795 "abstract instance" of the given declaration (e.g. in the original 2796 declaration of an inline function). When generating symbolic debugging 2797 information, we mustn't try to generate any address information for nodes 2798 marked as "abstract instances" because we don't actually generate 2799 any code or allocate any data space for such instances. */ 2800 #define DECL_ABSTRACT(NODE) \ 2801 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag) 2802 2803 /* Language-specific decl information. */ 2804 #define DECL_LANG_SPECIFIC(NODE) \ 2805 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific) 2806 2807 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference: 2808 do not allocate storage, and refer to a definition elsewhere. Note that 2809 this does not necessarily imply the entity represented by NODE 2810 has no program source-level definition in this translation unit. For 2811 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and 2812 DECL_EXTERNAL may be true simultaneously; that can be the case for 2813 a C99 "extern inline" function. */ 2814 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1) 2815 2816 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function. 2817 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes. 2818 2819 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted. 2820 2821 Also set in some languages for variables, etc., outside the normal 2822 lexical scope, such as class instance variables. */ 2823 #define DECL_NONLOCAL(NODE) \ 2824 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag) 2825 2826 /* Used in VAR_DECLs to indicate that the variable is a vtable. 2827 Used in FIELD_DECLs for vtable pointers. 2828 Used in FUNCTION_DECLs to indicate that the function is virtual. */ 2829 #define DECL_VIRTUAL_P(NODE) \ 2830 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag) 2831 2832 /* Used to indicate that this DECL represents a compiler-generated entity. */ 2833 #define DECL_ARTIFICIAL(NODE) \ 2834 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag) 2835 2836 /* Additional flags for language-specific uses. */ 2837 #define DECL_LANG_FLAG_0(NODE) \ 2838 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0) 2839 #define DECL_LANG_FLAG_1(NODE) \ 2840 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1) 2841 #define DECL_LANG_FLAG_2(NODE) \ 2842 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2) 2843 #define DECL_LANG_FLAG_3(NODE) \ 2844 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3) 2845 #define DECL_LANG_FLAG_4(NODE) \ 2846 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4) 2847 #define DECL_LANG_FLAG_5(NODE) \ 2848 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5) 2849 #define DECL_LANG_FLAG_6(NODE) \ 2850 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6) 2851 #define DECL_LANG_FLAG_7(NODE) \ 2852 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7) 2853 #define DECL_LANG_FLAG_8(NODE) \ 2854 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8) 2855 2856 /* Nonzero for a scope which is equal to file scope. */ 2857 #define SCOPE_FILE_SCOPE_P(EXP) \ 2858 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL) 2859 /* Nonzero for a decl which is at file scope. */ 2860 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP)) 2861 /* Nonzero for a type which is at file scope. */ 2862 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP)) 2863 2864 /* Nonzero for a decl that is decorated using attribute used. 2865 This indicates to compiler tools that this decl needs to be preserved. */ 2866 #define DECL_PRESERVE_P(DECL) \ 2867 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag 2868 2869 /* For function local variables of COMPLEX and VECTOR types, 2870 indicates that the variable is not aliased, and that all 2871 modifications to the variable have been adjusted so that 2872 they are killing assignments. Thus the variable may now 2873 be treated as a GIMPLE register, and use real instead of 2874 virtual ops in SSA form. */ 2875 #define DECL_GIMPLE_REG_P(DECL) \ 2876 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag 2877 2878 struct GTY(()) tree_decl_common { 2879 struct tree_decl_minimal common; 2880 tree size; 2881 2882 ENUM_BITFIELD(machine_mode) mode : 8; 2883 2884 unsigned nonlocal_flag : 1; 2885 unsigned virtual_flag : 1; 2886 unsigned ignored_flag : 1; 2887 unsigned abstract_flag : 1; 2888 unsigned artificial_flag : 1; 2889 unsigned preserve_flag: 1; 2890 unsigned debug_expr_is_from : 1; 2891 2892 unsigned lang_flag_0 : 1; 2893 unsigned lang_flag_1 : 1; 2894 unsigned lang_flag_2 : 1; 2895 unsigned lang_flag_3 : 1; 2896 unsigned lang_flag_4 : 1; 2897 unsigned lang_flag_5 : 1; 2898 unsigned lang_flag_6 : 1; 2899 unsigned lang_flag_7 : 1; 2900 unsigned lang_flag_8 : 1; 2901 2902 /* In LABEL_DECL, this is DECL_ERROR_ISSUED. 2903 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */ 2904 unsigned decl_flag_0 : 1; 2905 /* In FIELD_DECL, this is DECL_BIT_FIELD 2906 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL. 2907 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */ 2908 unsigned decl_flag_1 : 1; 2909 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P 2910 In VAR_DECL, PARM_DECL and RESULT_DECL, this is 2911 DECL_HAS_VALUE_EXPR_P. */ 2912 unsigned decl_flag_2 : 1; 2913 /* Logically, these two would go in a theoretical base shared by var and 2914 parm decl. */ 2915 unsigned gimple_reg_flag : 1; 2916 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */ 2917 unsigned decl_by_reference_flag : 1; 2918 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */ 2919 unsigned decl_restricted_flag : 1; 2920 2921 /* In VAR_DECL and PARM_DECL set when the decl has been used except for 2922 being set. */ 2923 unsigned decl_read_flag : 1; 2924 2925 /* In VAR_DECL or RESULT_DECL set when significant code movement precludes 2926 attempting to share the stack slot with some other variable. */ 2927 unsigned decl_nonshareable_flag : 1; 2928 2929 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */ 2930 unsigned int off_align : 8; 2931 2932 /* 24-bits unused. */ 2933 2934 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */ 2935 unsigned int align; 2936 2937 /* UID for points-to sets, stable over copying from inlining. */ 2938 unsigned int pt_uid; 2939 2940 tree size_unit; 2941 tree initial; 2942 tree attributes; 2943 tree abstract_origin; 2944 2945 /* Points to a structure whose details depend on the language in use. */ 2946 struct lang_decl *lang_specific; 2947 }; 2948 2949 extern tree decl_value_expr_lookup (tree); 2950 extern void decl_value_expr_insert (tree, tree); 2951 2952 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found, 2953 if transformations have made this more complicated than evaluating the 2954 decl itself. This should only be used for debugging; once this field has 2955 been set, the decl itself may not legitimately appear in the function. */ 2956 #define DECL_HAS_VALUE_EXPR_P(NODE) \ 2957 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \ 2958 ->decl_common.decl_flag_2) 2959 #define DECL_VALUE_EXPR(NODE) \ 2960 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE))) 2961 #define SET_DECL_VALUE_EXPR(NODE, VAL) \ 2962 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL)) 2963 2964 /* Holds the RTL expression for the value of a variable or function. 2965 This value can be evaluated lazily for functions, variables with 2966 static storage duration, and labels. */ 2967 #define DECL_RTL(NODE) \ 2968 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \ 2969 ? (NODE)->decl_with_rtl.rtl \ 2970 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl)) 2971 2972 /* Set the DECL_RTL for NODE to RTL. */ 2973 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL) 2974 2975 /* Returns nonzero if NODE is a tree node that can contain RTL. */ 2976 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL)) 2977 2978 /* Returns nonzero if the DECL_RTL for NODE has already been set. */ 2979 #define DECL_RTL_SET_P(NODE) \ 2980 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL) 2981 2982 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for 2983 NODE1, it will not be set for NODE2; this is a lazy copy. */ 2984 #define COPY_DECL_RTL(NODE1, NODE2) \ 2985 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \ 2986 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl) 2987 2988 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */ 2989 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL) 2990 2991 #if (GCC_VERSION >= 2007) 2992 #define DECL_RTL_KNOWN_SET(decl) __extension__ \ 2993 ({ tree const __d = (decl); \ 2994 gcc_checking_assert (DECL_RTL_SET_P (__d)); \ 2995 /* Dereference it so the compiler knows it can't be NULL even \ 2996 without assertion checking. */ \ 2997 &*DECL_RTL_IF_SET (__d); }) 2998 #else 2999 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl)) 3000 #endif 3001 3002 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */ 3003 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0) 3004 3005 struct GTY(()) tree_decl_with_rtl { 3006 struct tree_decl_common common; 3007 rtx rtl; 3008 }; 3009 3010 /* In a FIELD_DECL, this is the field position, counting in bytes, of the 3011 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning 3012 of the structure. */ 3013 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset) 3014 3015 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the 3016 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields 3017 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the 3018 natural alignment of the field's type). */ 3019 #define DECL_FIELD_BIT_OFFSET(NODE) \ 3020 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset) 3021 3022 /* In a FIELD_DECL, this indicates whether the field was a bit-field and 3023 if so, the type that was originally specified for it. 3024 TREE_TYPE may have been modified (in finish_struct). */ 3025 #define DECL_BIT_FIELD_TYPE(NODE) \ 3026 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type) 3027 3028 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage 3029 representative FIELD_DECL. */ 3030 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \ 3031 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) 3032 3033 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which 3034 if nonzero, indicates that the field occupies the type. */ 3035 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier) 3036 3037 /* For FIELD_DECLs, off_align holds the number of low-order bits of 3038 DECL_FIELD_OFFSET which are known to be always zero. 3039 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET 3040 has. */ 3041 #define DECL_OFFSET_ALIGN(NODE) \ 3042 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align) 3043 3044 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */ 3045 #define SET_DECL_OFFSET_ALIGN(NODE, X) \ 3046 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1) 3047 3048 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in 3049 which this FIELD_DECL is defined. This information is needed when 3050 writing debugging information about vfield and vbase decls for C++. */ 3051 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext) 3052 3053 /* In a FIELD_DECL, indicates this field should be bit-packed. */ 3054 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.packed_flag) 3055 3056 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed 3057 specially. */ 3058 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1) 3059 3060 /* Used in a FIELD_DECL to indicate that we cannot form the address of 3061 this component. This makes it possible for Type-Based Alias Analysis 3062 to disambiguate accesses to this field with indirect accesses using 3063 the field's type: 3064 3065 struct S { int i; } s; 3066 int *p; 3067 3068 If the flag is set on 'i', TBAA computes that s.i and *p never conflict. 3069 3070 From the implementation's viewpoint, the alias set of the type of the 3071 field 'i' (int) will not be recorded as a subset of that of the type of 3072 's' (struct S) in record_component_aliases. The counterpart is that 3073 accesses to s.i must not be given the alias set of the type of 'i' 3074 (int) but instead directly that of the type of 's' (struct S). */ 3075 #define DECL_NONADDRESSABLE_P(NODE) \ 3076 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2) 3077 3078 struct GTY(()) tree_field_decl { 3079 struct tree_decl_common common; 3080 3081 tree offset; 3082 tree bit_field_type; 3083 tree qualifier; 3084 tree bit_offset; 3085 tree fcontext; 3086 }; 3087 3088 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is 3089 dense, unique within any one function, and may be used to index arrays. 3090 If the value is -1, then no UID has been assigned. */ 3091 #define LABEL_DECL_UID(NODE) \ 3092 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid) 3093 3094 /* In a LABEL_DECL, the EH region number for which the label is the 3095 post_landing_pad. */ 3096 #define EH_LANDING_PAD_NR(NODE) \ 3097 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr) 3098 3099 /* In LABEL_DECL nodes, nonzero means that an error message about 3100 jumping into such a binding contour has been printed for this label. */ 3101 #define DECL_ERROR_ISSUED(NODE) \ 3102 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0) 3103 3104 struct GTY(()) tree_label_decl { 3105 struct tree_decl_with_rtl common; 3106 int label_decl_uid; 3107 int eh_landing_pad_nr; 3108 }; 3109 3110 struct var_ann_d; 3111 struct GTY(()) tree_result_decl { 3112 struct tree_decl_with_rtl common; 3113 struct var_ann_d *ann; 3114 }; 3115 3116 struct GTY(()) tree_const_decl { 3117 struct tree_decl_common common; 3118 }; 3119 3120 /* For a PARM_DECL, records the data type used to pass the argument, 3121 which may be different from the type seen in the program. */ 3122 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial) 3123 3124 /* For PARM_DECL, holds an RTL for the stack slot or register 3125 where the data was actually passed. */ 3126 #define DECL_INCOMING_RTL(NODE) \ 3127 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl) 3128 3129 struct GTY(()) tree_parm_decl { 3130 struct tree_decl_with_rtl common; 3131 rtx incoming_rtl; 3132 struct var_ann_d *ann; 3133 }; 3134 3135 3136 /* Nonzero for a given ..._DECL node means that no warnings should be 3137 generated just because this node is unused. */ 3138 #define DECL_IN_SYSTEM_HEADER(NODE) \ 3139 (in_system_header_at (DECL_SOURCE_LOCATION (NODE))) 3140 3141 /* Used to indicate that the linkage status of this DECL is not yet known, 3142 so it should not be output now. */ 3143 #define DECL_DEFER_OUTPUT(NODE) \ 3144 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output) 3145 3146 /* In a VAR_DECL that's static, 3147 nonzero if the space is in the text section. */ 3148 #define DECL_IN_TEXT_SECTION(NODE) \ 3149 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section) 3150 3151 /* In a VAR_DECL that's static, 3152 nonzero if it belongs to the global constant pool. */ 3153 #define DECL_IN_CONSTANT_POOL(NODE) \ 3154 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool) 3155 3156 /* Nonzero for a given ..._DECL node means that this node should be 3157 put in .common, if possible. If a DECL_INITIAL is given, and it 3158 is not error_mark_node, then the decl cannot be put in .common. */ 3159 #define DECL_COMMON(NODE) \ 3160 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag) 3161 3162 /* In a VAR_DECL, nonzero if the decl is a register variable with 3163 an explicit asm specification. */ 3164 #define DECL_HARD_REGISTER(NODE) \ 3165 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register) 3166 3167 /* Used to indicate that this DECL has weak linkage. */ 3168 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag) 3169 3170 /* Used to indicate that the DECL is a dllimport. */ 3171 #define DECL_DLLIMPORT_P(NODE) \ 3172 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag) 3173 3174 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need 3175 not be put out unless it is needed in this translation unit. 3176 Entities like this are shared across translation units (like weak 3177 entities), but are guaranteed to be generated by any translation 3178 unit that needs them, and therefore need not be put out anywhere 3179 where they are not needed. DECL_COMDAT is just a hint to the 3180 back-end; it is up to front-ends which set this flag to ensure 3181 that there will never be any harm, other than bloat, in putting out 3182 something which is DECL_COMDAT. */ 3183 #define DECL_COMDAT(NODE) \ 3184 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag) 3185 3186 #define DECL_COMDAT_GROUP(NODE) \ 3187 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group) 3188 3189 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in 3190 multiple translation units should be merged. */ 3191 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE) 3192 3193 /* The name of the object as the assembler will see it (but before any 3194 translations made by ASM_OUTPUT_LABELREF). Often this is the same 3195 as DECL_NAME. It is an IDENTIFIER_NODE. */ 3196 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE) 3197 3198 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME. 3199 This is true of all DECL nodes except FIELD_DECL. */ 3200 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \ 3201 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS)) 3202 3203 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero, 3204 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set 3205 yet. */ 3206 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \ 3207 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \ 3208 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE) 3209 3210 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */ 3211 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \ 3212 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME)) 3213 3214 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's 3215 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause 3216 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the 3217 semantics of using this macro, are different than saying: 3218 3219 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1)) 3220 3221 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */ 3222 3223 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \ 3224 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \ 3225 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \ 3226 DECL_ASSEMBLER_NAME (DECL1)) \ 3227 : (void) 0) 3228 3229 /* Records the section name in a section attribute. Used to pass 3230 the name from decl_attributes to make_function_rtl and make_decl_rtl. */ 3231 #define DECL_SECTION_NAME(NODE) \ 3232 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name) 3233 3234 /* Nonzero in a decl means that the gimplifier has seen (or placed) 3235 this variable in a BIND_EXPR. */ 3236 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \ 3237 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr) 3238 3239 /* Value of the decls's visibility attribute */ 3240 #define DECL_VISIBILITY(NODE) \ 3241 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility) 3242 3243 /* Nonzero means that the decl had its visibility specified rather than 3244 being inferred. */ 3245 #define DECL_VISIBILITY_SPECIFIED(NODE) \ 3246 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified) 3247 3248 /* In a VAR_DECL, the model to use if the data should be allocated from 3249 thread-local storage. */ 3250 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model) 3251 3252 /* In a VAR_DECL, nonzero if the data should be allocated from 3253 thread-local storage. */ 3254 #define DECL_THREAD_LOCAL_P(NODE) \ 3255 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL) 3256 3257 /* In a non-local VAR_DECL with static storage duration, true if the 3258 variable has an initialization priority. If false, the variable 3259 will be initialized at the DEFAULT_INIT_PRIORITY. */ 3260 #define DECL_HAS_INIT_PRIORITY_P(NODE) \ 3261 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p) 3262 3263 /* Specify whether the section name was set by user or by 3264 compiler via -ffunction-sections. */ 3265 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \ 3266 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p) 3267 3268 struct GTY(()) tree_decl_with_vis { 3269 struct tree_decl_with_rtl common; 3270 tree assembler_name; 3271 tree section_name; 3272 tree comdat_group; 3273 3274 /* Belong to VAR_DECL exclusively. */ 3275 unsigned defer_output : 1; 3276 unsigned hard_register : 1; 3277 unsigned thread_local : 1; 3278 unsigned common_flag : 1; 3279 unsigned in_text_section : 1; 3280 unsigned in_constant_pool : 1; 3281 unsigned dllimport_flag : 1; 3282 /* Don't belong to VAR_DECL exclusively. */ 3283 unsigned weak_flag : 1; 3284 3285 unsigned seen_in_bind_expr : 1; 3286 unsigned comdat_flag : 1; 3287 ENUM_BITFIELD(symbol_visibility) visibility : 2; 3288 unsigned visibility_specified : 1; 3289 /* Belongs to VAR_DECL exclusively. */ 3290 ENUM_BITFIELD(tls_model) tls_model : 3; 3291 3292 /* Belong to FUNCTION_DECL exclusively. */ 3293 unsigned init_priority_p : 1; 3294 /* Used by C++ only. Might become a generic decl flag. */ 3295 unsigned shadowed_for_var_p : 1; 3296 /* When SECTION_NAME is implied by -ffunsection-section. */ 3297 unsigned implicit_section_name_p : 1; 3298 /* 13 unused bits. */ 3299 }; 3300 3301 extern tree decl_debug_expr_lookup (tree); 3302 extern void decl_debug_expr_insert (tree, tree); 3303 /* For VAR_DECL, this is set to either an expression that it was split 3304 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of 3305 subexpressions that it was split into. */ 3306 #define DECL_DEBUG_EXPR(NODE) \ 3307 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE))) 3308 3309 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \ 3310 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL)) 3311 3312 /* An initialization priority. */ 3313 typedef unsigned short priority_type; 3314 3315 extern priority_type decl_init_priority_lookup (tree); 3316 extern priority_type decl_fini_priority_lookup (tree); 3317 extern void decl_init_priority_insert (tree, priority_type); 3318 extern void decl_fini_priority_insert (tree, priority_type); 3319 3320 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of 3321 NODE. */ 3322 #define DECL_INIT_PRIORITY(NODE) \ 3323 (decl_init_priority_lookup (NODE)) 3324 /* Set the initialization priority for NODE to VAL. */ 3325 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \ 3326 (decl_init_priority_insert (NODE, VAL)) 3327 3328 /* For a FUNCTION_DECL the finalization priority of NODE. */ 3329 #define DECL_FINI_PRIORITY(NODE) \ 3330 (decl_fini_priority_lookup (NODE)) 3331 /* Set the finalization priority for NODE to VAL. */ 3332 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \ 3333 (decl_fini_priority_insert (NODE, VAL)) 3334 3335 /* The initialization priority for entities for which no explicit 3336 initialization priority has been specified. */ 3337 #define DEFAULT_INIT_PRIORITY 65535 3338 3339 /* The maximum allowed initialization priority. */ 3340 #define MAX_INIT_PRIORITY 65535 3341 3342 /* The largest priority value reserved for use by system runtime 3343 libraries. */ 3344 #define MAX_RESERVED_INIT_PRIORITY 100 3345 3346 #define DECL_VAR_ANN_PTR(NODE) \ 3347 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \ 3348 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \ 3349 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \ 3350 : NULL) 3351 3352 struct GTY(()) tree_var_decl { 3353 struct tree_decl_with_vis common; 3354 struct var_ann_d *ann; 3355 }; 3356 3357 3358 /* This field is used to reference anything in decl.result and is meant only 3359 for use by the garbage collector. */ 3360 #define DECL_RESULT_FLD(NODE) \ 3361 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result) 3362 3363 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways. 3364 Before the struct containing the FUNCTION_DECL is laid out, 3365 DECL_VINDEX may point to a FUNCTION_DECL in a base class which 3366 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual 3367 function. When the class is laid out, this pointer is changed 3368 to an INTEGER_CST node which is suitable for use as an index 3369 into the virtual function table. 3370 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */ 3371 #define DECL_VINDEX(NODE) \ 3372 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex) 3373 3374 struct GTY(()) 3375 tree_decl_non_common { 3376 struct tree_decl_with_vis common; 3377 /* C++ uses this in namespaces. */ 3378 tree saved_tree; 3379 /* C++ uses this in templates. */ 3380 tree arguments; 3381 /* Almost all FE's use this. */ 3382 tree result; 3383 /* C++ uses this in namespaces and function_decls. */ 3384 tree vindex; 3385 }; 3386 3387 /* In FUNCTION_DECL, holds the decl for the return value. */ 3388 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result) 3389 3390 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */ 3391 #define DECL_UNINLINABLE(NODE) \ 3392 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable) 3393 3394 /* In a FUNCTION_DECL, the saved representation of the body of the 3395 entire function. */ 3396 #define DECL_SAVED_TREE(NODE) \ 3397 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree) 3398 3399 /* Nonzero in a FUNCTION_DECL means this function should be treated 3400 as if it were a malloc, meaning it returns a pointer that is 3401 not an alias. */ 3402 #define DECL_IS_MALLOC(NODE) \ 3403 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag) 3404 3405 /* Nonzero in a FUNCTION_DECL means this function should be treated as 3406 C++ operator new, meaning that it returns a pointer for which we 3407 should not use type based aliasing. */ 3408 #define DECL_IS_OPERATOR_NEW(NODE) \ 3409 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag) 3410 3411 /* Nonzero in a FUNCTION_DECL means this function may return more 3412 than once. */ 3413 #define DECL_IS_RETURNS_TWICE(NODE) \ 3414 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag) 3415 3416 /* Nonzero in a FUNCTION_DECL means this function should be treated 3417 as "pure" function (like const function, but may read global memory). */ 3418 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag) 3419 3420 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND 3421 the const or pure function may not terminate. When this is nonzero 3422 for a const or pure function, it can be dealt with by cse passes 3423 but cannot be removed by dce passes since you are not allowed to 3424 change an infinite looping program into one that terminates without 3425 error. */ 3426 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \ 3427 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag) 3428 3429 /* Nonzero in a FUNCTION_DECL means this function should be treated 3430 as "novops" function (function that does not read global memory, 3431 but may have arbitrary side effects). */ 3432 #define DECL_IS_NOVOPS(NODE) \ 3433 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag) 3434 3435 /* Used in FUNCTION_DECLs to indicate that they should be run automatically 3436 at the beginning or end of execution. */ 3437 #define DECL_STATIC_CONSTRUCTOR(NODE) \ 3438 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag) 3439 3440 #define DECL_STATIC_DESTRUCTOR(NODE) \ 3441 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag) 3442 3443 /* Used in FUNCTION_DECLs to indicate that function entry and exit should 3444 be instrumented with calls to support routines. */ 3445 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \ 3446 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit) 3447 3448 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be 3449 disabled in this function. */ 3450 #define DECL_NO_LIMIT_STACK(NODE) \ 3451 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack) 3452 3453 /* In a FUNCTION_DECL indicates that a static chain is needed. */ 3454 #define DECL_STATIC_CHAIN(NODE) \ 3455 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag) 3456 3457 /* Nonzero for a decl that cgraph has decided should be inlined into 3458 at least one call site. It is not meaningful to look at this 3459 directly; always use cgraph_function_possibly_inlined_p. */ 3460 #define DECL_POSSIBLY_INLINED(DECL) \ 3461 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined 3462 3463 /* Nonzero in a FUNCTION_DECL means that this function was declared inline, 3464 such as via the `inline' keyword in C/C++. This flag controls the linkage 3465 semantics of 'inline' */ 3466 #define DECL_DECLARED_INLINE_P(NODE) \ 3467 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag) 3468 3469 /* Nonzero in a FUNCTION_DECL means this function should not get 3470 -Winline warnings. */ 3471 #define DECL_NO_INLINE_WARNING_P(NODE) \ 3472 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag) 3473 3474 /* Nonzero if a FUNCTION_CODE is a TM load/store. */ 3475 #define BUILTIN_TM_LOAD_STORE_P(FN) \ 3476 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) 3477 3478 /* Nonzero if a FUNCTION_CODE is a TM load. */ 3479 #define BUILTIN_TM_LOAD_P(FN) \ 3480 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE) 3481 3482 /* Nonzero if a FUNCTION_CODE is a TM store. */ 3483 #define BUILTIN_TM_STORE_P(FN) \ 3484 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE) 3485 3486 #define CASE_BUILT_IN_TM_LOAD(FN) \ 3487 case BUILT_IN_TM_LOAD_##FN: \ 3488 case BUILT_IN_TM_LOAD_RAR_##FN: \ 3489 case BUILT_IN_TM_LOAD_RAW_##FN: \ 3490 case BUILT_IN_TM_LOAD_RFW_##FN 3491 3492 #define CASE_BUILT_IN_TM_STORE(FN) \ 3493 case BUILT_IN_TM_STORE_##FN: \ 3494 case BUILT_IN_TM_STORE_WAR_##FN: \ 3495 case BUILT_IN_TM_STORE_WAW_##FN 3496 3497 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner 3498 disregarding size and cost heuristics. This is equivalent to using 3499 the always_inline attribute without the required diagnostics if the 3500 function cannot be inlined. */ 3501 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \ 3502 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits) 3503 3504 extern VEC(tree, gc) **decl_debug_args_lookup (tree); 3505 extern VEC(tree, gc) **decl_debug_args_insert (tree); 3506 3507 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */ 3508 #define DECL_HAS_DEBUG_ARGS_P(NODE) \ 3509 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag) 3510 3511 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function") 3512 that describes the status of this function. */ 3513 #define DECL_STRUCT_FUNCTION(NODE) \ 3514 (FUNCTION_DECL_CHECK (NODE)->function_decl.f) 3515 3516 /* In a FUNCTION_DECL, nonzero means a built in function. */ 3517 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN) 3518 3519 /* For a builtin function, identify which part of the compiler defined it. */ 3520 #define DECL_BUILT_IN_CLASS(NODE) \ 3521 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class) 3522 3523 /* In FUNCTION_DECL, a chain of ..._DECL nodes. 3524 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific 3525 uses. */ 3526 #define DECL_ARGUMENTS(NODE) \ 3527 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments) 3528 #define DECL_ARGUMENT_FLD(NODE) \ 3529 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments) 3530 3531 /* In FUNCTION_DECL, the function specific target options to use when compiling 3532 this function. */ 3533 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \ 3534 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target) 3535 3536 /* In FUNCTION_DECL, the function specific optimization options to use when 3537 compiling this function. */ 3538 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \ 3539 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization) 3540 3541 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the 3542 arguments/result/saved_tree fields by front ends. It was either inherit 3543 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL, 3544 which seemed a bit strange. */ 3545 3546 struct GTY(()) tree_function_decl { 3547 struct tree_decl_non_common common; 3548 3549 struct function *f; 3550 3551 /* The personality function. Used for stack unwinding. */ 3552 tree personality; 3553 3554 /* Function specific options that are used by this function. */ 3555 tree function_specific_target; /* target options */ 3556 tree function_specific_optimization; /* optimization options */ 3557 3558 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is 3559 DECL_FUNCTION_CODE. Otherwise unused. 3560 ??? The bitfield needs to be able to hold all target function 3561 codes as well. */ 3562 ENUM_BITFIELD(built_in_function) function_code : 11; 3563 ENUM_BITFIELD(built_in_class) built_in_class : 2; 3564 3565 unsigned static_ctor_flag : 1; 3566 unsigned static_dtor_flag : 1; 3567 unsigned uninlinable : 1; 3568 3569 unsigned possibly_inlined : 1; 3570 unsigned novops_flag : 1; 3571 unsigned returns_twice_flag : 1; 3572 unsigned malloc_flag : 1; 3573 unsigned operator_new_flag : 1; 3574 unsigned declared_inline_flag : 1; 3575 unsigned regdecl_flag : 1; 3576 unsigned no_inline_warning_flag : 1; 3577 3578 unsigned no_instrument_function_entry_exit : 1; 3579 unsigned no_limit_stack : 1; 3580 unsigned disregard_inline_limits : 1; 3581 unsigned pure_flag : 1; 3582 unsigned looping_const_or_pure_flag : 1; 3583 unsigned has_debug_args_flag : 1; 3584 unsigned tm_clone_flag : 1; 3585 3586 /* 1 bit left */ 3587 }; 3588 3589 /* The source language of the translation-unit. */ 3590 #define TRANSLATION_UNIT_LANGUAGE(NODE) \ 3591 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language) 3592 3593 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */ 3594 3595 struct GTY(()) tree_translation_unit_decl { 3596 struct tree_decl_common common; 3597 /* Source language of this translation unit. Used for DWARF output. */ 3598 const char * GTY((skip(""))) language; 3599 /* TODO: Non-optimization used to build this translation unit. */ 3600 /* TODO: Root of a partial DWARF tree for global types and decls. */ 3601 }; 3602 3603 /* A vector of all translation-units. */ 3604 extern GTY (()) VEC(tree,gc) *all_translation_units; 3605 3606 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */ 3607 #define DECL_ORIGINAL_TYPE(NODE) \ 3608 (TYPE_DECL_CHECK (NODE)->decl_non_common.result) 3609 3610 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped 3611 into stabs. Instead it will generate cross reference ('x') of names. 3612 This uses the same flag as DECL_EXTERNAL. */ 3613 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \ 3614 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1) 3615 3616 /* Getter of the imported declaration associated to the 3617 IMPORTED_DECL node. */ 3618 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \ 3619 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE))) 3620 3621 struct GTY(()) tree_type_decl { 3622 struct tree_decl_non_common common; 3623 3624 }; 3625 3626 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE. 3627 To reduce overhead, the nodes containing the statements are not trees. 3628 This avoids the overhead of tree_common on all linked list elements. 3629 3630 Use the interface in tree-iterator.h to access this node. */ 3631 3632 #define STATEMENT_LIST_HEAD(NODE) \ 3633 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head) 3634 #define STATEMENT_LIST_TAIL(NODE) \ 3635 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail) 3636 3637 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node 3638 { 3639 struct tree_statement_list_node *prev; 3640 struct tree_statement_list_node *next; 3641 tree stmt; 3642 }; 3643 3644 struct GTY(()) tree_statement_list 3645 { 3646 struct tree_typed typed; 3647 struct tree_statement_list_node *head; 3648 struct tree_statement_list_node *tail; 3649 }; 3650 3651 3652 /* Optimization options used by a function. */ 3653 3654 struct GTY(()) tree_optimization_option { 3655 struct tree_common common; 3656 3657 /* The optimization options used by the user. */ 3658 struct cl_optimization opts; 3659 }; 3660 3661 #define TREE_OPTIMIZATION(NODE) \ 3662 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts) 3663 3664 /* Return a tree node that encapsulates the current optimization options. */ 3665 extern tree build_optimization_node (void); 3666 3667 /* Target options used by a function. */ 3668 3669 struct GTY(()) tree_target_option { 3670 struct tree_common common; 3671 3672 /* The optimization options used by the user. */ 3673 struct cl_target_option opts; 3674 }; 3675 3676 #define TREE_TARGET_OPTION(NODE) \ 3677 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts) 3678 3679 /* Return a tree node that encapsulates the current target options. */ 3680 extern tree build_target_option_node (void); 3681 3682 3683 /* Define the overall contents of a tree node. 3684 It may be any of the structures declared above 3685 for various types of node. */ 3686 3687 union GTY ((ptr_alias (union lang_tree_node), 3688 desc ("tree_node_structure (&%h)"), variable_size)) tree_node { 3689 struct tree_base GTY ((tag ("TS_BASE"))) base; 3690 struct tree_typed GTY ((tag ("TS_TYPED"))) typed; 3691 struct tree_common GTY ((tag ("TS_COMMON"))) common; 3692 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst; 3693 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst; 3694 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst; 3695 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector; 3696 struct tree_string GTY ((tag ("TS_STRING"))) string; 3697 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex; 3698 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier; 3699 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal; 3700 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common; 3701 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl; 3702 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common; 3703 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl; 3704 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis; 3705 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl; 3706 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl; 3707 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl; 3708 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl; 3709 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl; 3710 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl; 3711 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl; 3712 struct tree_translation_unit_decl GTY ((tag ("TS_TRANSLATION_UNIT_DECL"))) 3713 translation_unit_decl; 3714 struct tree_type_common GTY ((tag ("TS_TYPE_COMMON"))) type_common; 3715 struct tree_type_with_lang_specific GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC"))) 3716 type_with_lang_specific; 3717 struct tree_type_non_common GTY ((tag ("TS_TYPE_NON_COMMON"))) 3718 type_non_common; 3719 struct tree_list GTY ((tag ("TS_LIST"))) list; 3720 struct tree_vec GTY ((tag ("TS_VEC"))) vec; 3721 struct tree_exp GTY ((tag ("TS_EXP"))) exp; 3722 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name; 3723 struct tree_block GTY ((tag ("TS_BLOCK"))) block; 3724 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo; 3725 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list; 3726 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor; 3727 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause; 3728 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization; 3729 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option; 3730 }; 3731 3732 /* Standard named or nameless data types of the C compiler. */ 3733 3734 enum tree_index 3735 { 3736 TI_ERROR_MARK, 3737 TI_INTQI_TYPE, 3738 TI_INTHI_TYPE, 3739 TI_INTSI_TYPE, 3740 TI_INTDI_TYPE, 3741 TI_INTTI_TYPE, 3742 3743 TI_UINTQI_TYPE, 3744 TI_UINTHI_TYPE, 3745 TI_UINTSI_TYPE, 3746 TI_UINTDI_TYPE, 3747 TI_UINTTI_TYPE, 3748 3749 TI_UINT32_TYPE, 3750 TI_UINT64_TYPE, 3751 3752 TI_INTEGER_ZERO, 3753 TI_INTEGER_ONE, 3754 TI_INTEGER_THREE, 3755 TI_INTEGER_MINUS_ONE, 3756 TI_NULL_POINTER, 3757 3758 TI_SIZE_ZERO, 3759 TI_SIZE_ONE, 3760 3761 TI_BITSIZE_ZERO, 3762 TI_BITSIZE_ONE, 3763 TI_BITSIZE_UNIT, 3764 3765 TI_PUBLIC, 3766 TI_PROTECTED, 3767 TI_PRIVATE, 3768 3769 TI_BOOLEAN_FALSE, 3770 TI_BOOLEAN_TRUE, 3771 3772 TI_COMPLEX_INTEGER_TYPE, 3773 TI_COMPLEX_FLOAT_TYPE, 3774 TI_COMPLEX_DOUBLE_TYPE, 3775 TI_COMPLEX_LONG_DOUBLE_TYPE, 3776 3777 TI_FLOAT_TYPE, 3778 TI_DOUBLE_TYPE, 3779 TI_LONG_DOUBLE_TYPE, 3780 3781 TI_FLOAT_PTR_TYPE, 3782 TI_DOUBLE_PTR_TYPE, 3783 TI_LONG_DOUBLE_PTR_TYPE, 3784 TI_INTEGER_PTR_TYPE, 3785 3786 TI_VOID_TYPE, 3787 TI_PTR_TYPE, 3788 TI_CONST_PTR_TYPE, 3789 TI_SIZE_TYPE, 3790 TI_PID_TYPE, 3791 TI_PTRDIFF_TYPE, 3792 TI_VA_LIST_TYPE, 3793 TI_VA_LIST_GPR_COUNTER_FIELD, 3794 TI_VA_LIST_FPR_COUNTER_FIELD, 3795 TI_BOOLEAN_TYPE, 3796 TI_FILEPTR_TYPE, 3797 3798 TI_DFLOAT32_TYPE, 3799 TI_DFLOAT64_TYPE, 3800 TI_DFLOAT128_TYPE, 3801 TI_DFLOAT32_PTR_TYPE, 3802 TI_DFLOAT64_PTR_TYPE, 3803 TI_DFLOAT128_PTR_TYPE, 3804 3805 TI_VOID_LIST_NODE, 3806 3807 TI_MAIN_IDENTIFIER, 3808 3809 TI_SAT_SFRACT_TYPE, 3810 TI_SAT_FRACT_TYPE, 3811 TI_SAT_LFRACT_TYPE, 3812 TI_SAT_LLFRACT_TYPE, 3813 TI_SAT_USFRACT_TYPE, 3814 TI_SAT_UFRACT_TYPE, 3815 TI_SAT_ULFRACT_TYPE, 3816 TI_SAT_ULLFRACT_TYPE, 3817 TI_SFRACT_TYPE, 3818 TI_FRACT_TYPE, 3819 TI_LFRACT_TYPE, 3820 TI_LLFRACT_TYPE, 3821 TI_USFRACT_TYPE, 3822 TI_UFRACT_TYPE, 3823 TI_ULFRACT_TYPE, 3824 TI_ULLFRACT_TYPE, 3825 TI_SAT_SACCUM_TYPE, 3826 TI_SAT_ACCUM_TYPE, 3827 TI_SAT_LACCUM_TYPE, 3828 TI_SAT_LLACCUM_TYPE, 3829 TI_SAT_USACCUM_TYPE, 3830 TI_SAT_UACCUM_TYPE, 3831 TI_SAT_ULACCUM_TYPE, 3832 TI_SAT_ULLACCUM_TYPE, 3833 TI_SACCUM_TYPE, 3834 TI_ACCUM_TYPE, 3835 TI_LACCUM_TYPE, 3836 TI_LLACCUM_TYPE, 3837 TI_USACCUM_TYPE, 3838 TI_UACCUM_TYPE, 3839 TI_ULACCUM_TYPE, 3840 TI_ULLACCUM_TYPE, 3841 TI_QQ_TYPE, 3842 TI_HQ_TYPE, 3843 TI_SQ_TYPE, 3844 TI_DQ_TYPE, 3845 TI_TQ_TYPE, 3846 TI_UQQ_TYPE, 3847 TI_UHQ_TYPE, 3848 TI_USQ_TYPE, 3849 TI_UDQ_TYPE, 3850 TI_UTQ_TYPE, 3851 TI_SAT_QQ_TYPE, 3852 TI_SAT_HQ_TYPE, 3853 TI_SAT_SQ_TYPE, 3854 TI_SAT_DQ_TYPE, 3855 TI_SAT_TQ_TYPE, 3856 TI_SAT_UQQ_TYPE, 3857 TI_SAT_UHQ_TYPE, 3858 TI_SAT_USQ_TYPE, 3859 TI_SAT_UDQ_TYPE, 3860 TI_SAT_UTQ_TYPE, 3861 TI_HA_TYPE, 3862 TI_SA_TYPE, 3863 TI_DA_TYPE, 3864 TI_TA_TYPE, 3865 TI_UHA_TYPE, 3866 TI_USA_TYPE, 3867 TI_UDA_TYPE, 3868 TI_UTA_TYPE, 3869 TI_SAT_HA_TYPE, 3870 TI_SAT_SA_TYPE, 3871 TI_SAT_DA_TYPE, 3872 TI_SAT_TA_TYPE, 3873 TI_SAT_UHA_TYPE, 3874 TI_SAT_USA_TYPE, 3875 TI_SAT_UDA_TYPE, 3876 TI_SAT_UTA_TYPE, 3877 3878 TI_OPTIMIZATION_DEFAULT, 3879 TI_OPTIMIZATION_CURRENT, 3880 TI_TARGET_OPTION_DEFAULT, 3881 TI_TARGET_OPTION_CURRENT, 3882 TI_CURRENT_TARGET_PRAGMA, 3883 TI_CURRENT_OPTIMIZE_PRAGMA, 3884 3885 TI_MAX 3886 }; 3887 3888 extern GTY(()) tree global_trees[TI_MAX]; 3889 3890 #define error_mark_node global_trees[TI_ERROR_MARK] 3891 3892 #define intQI_type_node global_trees[TI_INTQI_TYPE] 3893 #define intHI_type_node global_trees[TI_INTHI_TYPE] 3894 #define intSI_type_node global_trees[TI_INTSI_TYPE] 3895 #define intDI_type_node global_trees[TI_INTDI_TYPE] 3896 #define intTI_type_node global_trees[TI_INTTI_TYPE] 3897 3898 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE] 3899 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE] 3900 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE] 3901 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE] 3902 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE] 3903 3904 #define uint32_type_node global_trees[TI_UINT32_TYPE] 3905 #define uint64_type_node global_trees[TI_UINT64_TYPE] 3906 3907 #define integer_zero_node global_trees[TI_INTEGER_ZERO] 3908 #define integer_one_node global_trees[TI_INTEGER_ONE] 3909 #define integer_three_node global_trees[TI_INTEGER_THREE] 3910 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE] 3911 #define size_zero_node global_trees[TI_SIZE_ZERO] 3912 #define size_one_node global_trees[TI_SIZE_ONE] 3913 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO] 3914 #define bitsize_one_node global_trees[TI_BITSIZE_ONE] 3915 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT] 3916 3917 /* Base access nodes. */ 3918 #define access_public_node global_trees[TI_PUBLIC] 3919 #define access_protected_node global_trees[TI_PROTECTED] 3920 #define access_private_node global_trees[TI_PRIVATE] 3921 3922 #define null_pointer_node global_trees[TI_NULL_POINTER] 3923 3924 #define float_type_node global_trees[TI_FLOAT_TYPE] 3925 #define double_type_node global_trees[TI_DOUBLE_TYPE] 3926 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE] 3927 3928 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE] 3929 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE] 3930 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE] 3931 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE] 3932 3933 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE] 3934 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE] 3935 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE] 3936 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE] 3937 3938 #define void_type_node global_trees[TI_VOID_TYPE] 3939 /* The C type `void *'. */ 3940 #define ptr_type_node global_trees[TI_PTR_TYPE] 3941 /* The C type `const void *'. */ 3942 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE] 3943 /* The C type `size_t'. */ 3944 #define size_type_node global_trees[TI_SIZE_TYPE] 3945 #define pid_type_node global_trees[TI_PID_TYPE] 3946 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE] 3947 #define va_list_type_node global_trees[TI_VA_LIST_TYPE] 3948 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD] 3949 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD] 3950 /* The C type `FILE *'. */ 3951 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE] 3952 3953 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE] 3954 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE] 3955 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] 3956 3957 /* The decimal floating point types. */ 3958 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE] 3959 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE] 3960 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE] 3961 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE] 3962 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE] 3963 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE] 3964 3965 /* The fixed-point types. */ 3966 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE] 3967 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE] 3968 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE] 3969 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE] 3970 #define sat_unsigned_short_fract_type_node \ 3971 global_trees[TI_SAT_USFRACT_TYPE] 3972 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE] 3973 #define sat_unsigned_long_fract_type_node \ 3974 global_trees[TI_SAT_ULFRACT_TYPE] 3975 #define sat_unsigned_long_long_fract_type_node \ 3976 global_trees[TI_SAT_ULLFRACT_TYPE] 3977 #define short_fract_type_node global_trees[TI_SFRACT_TYPE] 3978 #define fract_type_node global_trees[TI_FRACT_TYPE] 3979 #define long_fract_type_node global_trees[TI_LFRACT_TYPE] 3980 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE] 3981 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE] 3982 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE] 3983 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE] 3984 #define unsigned_long_long_fract_type_node \ 3985 global_trees[TI_ULLFRACT_TYPE] 3986 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE] 3987 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE] 3988 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE] 3989 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE] 3990 #define sat_unsigned_short_accum_type_node \ 3991 global_trees[TI_SAT_USACCUM_TYPE] 3992 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE] 3993 #define sat_unsigned_long_accum_type_node \ 3994 global_trees[TI_SAT_ULACCUM_TYPE] 3995 #define sat_unsigned_long_long_accum_type_node \ 3996 global_trees[TI_SAT_ULLACCUM_TYPE] 3997 #define short_accum_type_node global_trees[TI_SACCUM_TYPE] 3998 #define accum_type_node global_trees[TI_ACCUM_TYPE] 3999 #define long_accum_type_node global_trees[TI_LACCUM_TYPE] 4000 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE] 4001 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE] 4002 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE] 4003 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE] 4004 #define unsigned_long_long_accum_type_node \ 4005 global_trees[TI_ULLACCUM_TYPE] 4006 #define qq_type_node global_trees[TI_QQ_TYPE] 4007 #define hq_type_node global_trees[TI_HQ_TYPE] 4008 #define sq_type_node global_trees[TI_SQ_TYPE] 4009 #define dq_type_node global_trees[TI_DQ_TYPE] 4010 #define tq_type_node global_trees[TI_TQ_TYPE] 4011 #define uqq_type_node global_trees[TI_UQQ_TYPE] 4012 #define uhq_type_node global_trees[TI_UHQ_TYPE] 4013 #define usq_type_node global_trees[TI_USQ_TYPE] 4014 #define udq_type_node global_trees[TI_UDQ_TYPE] 4015 #define utq_type_node global_trees[TI_UTQ_TYPE] 4016 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE] 4017 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE] 4018 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE] 4019 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE] 4020 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE] 4021 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE] 4022 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE] 4023 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE] 4024 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE] 4025 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE] 4026 #define ha_type_node global_trees[TI_HA_TYPE] 4027 #define sa_type_node global_trees[TI_SA_TYPE] 4028 #define da_type_node global_trees[TI_DA_TYPE] 4029 #define ta_type_node global_trees[TI_TA_TYPE] 4030 #define uha_type_node global_trees[TI_UHA_TYPE] 4031 #define usa_type_node global_trees[TI_USA_TYPE] 4032 #define uda_type_node global_trees[TI_UDA_TYPE] 4033 #define uta_type_node global_trees[TI_UTA_TYPE] 4034 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE] 4035 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE] 4036 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE] 4037 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE] 4038 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE] 4039 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE] 4040 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE] 4041 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE] 4042 4043 /* The node that should be placed at the end of a parameter list to 4044 indicate that the function does not take a variable number of 4045 arguments. The TREE_VALUE will be void_type_node and there will be 4046 no TREE_CHAIN. Language-independent code should not assume 4047 anything else about this node. */ 4048 #define void_list_node global_trees[TI_VOID_LIST_NODE] 4049 4050 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER] 4051 #define MAIN_NAME_P(NODE) \ 4052 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node) 4053 4054 /* Optimization options (OPTIMIZATION_NODE) to use for default and current 4055 functions. */ 4056 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT] 4057 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT] 4058 4059 /* Default/current target options (TARGET_OPTION_NODE). */ 4060 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT] 4061 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT] 4062 4063 /* Default tree list option(), optimize() pragmas to be linked into the 4064 attribute list. */ 4065 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA] 4066 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA] 4067 4068 /* An enumeration of the standard C integer types. These must be 4069 ordered so that shorter types appear before longer ones, and so 4070 that signed types appear before unsigned ones, for the correct 4071 functioning of interpret_integer() in c-lex.c. */ 4072 enum integer_type_kind 4073 { 4074 itk_char, 4075 itk_signed_char, 4076 itk_unsigned_char, 4077 itk_short, 4078 itk_unsigned_short, 4079 itk_int, 4080 itk_unsigned_int, 4081 itk_long, 4082 itk_unsigned_long, 4083 itk_long_long, 4084 itk_unsigned_long_long, 4085 itk_int128, 4086 itk_unsigned_int128, 4087 itk_none 4088 }; 4089 4090 typedef enum integer_type_kind integer_type_kind; 4091 4092 /* The standard C integer types. Use integer_type_kind to index into 4093 this array. */ 4094 extern GTY(()) tree integer_types[itk_none]; 4095 4096 #define char_type_node integer_types[itk_char] 4097 #define signed_char_type_node integer_types[itk_signed_char] 4098 #define unsigned_char_type_node integer_types[itk_unsigned_char] 4099 #define short_integer_type_node integer_types[itk_short] 4100 #define short_unsigned_type_node integer_types[itk_unsigned_short] 4101 #define integer_type_node integer_types[itk_int] 4102 #define unsigned_type_node integer_types[itk_unsigned_int] 4103 #define long_integer_type_node integer_types[itk_long] 4104 #define long_unsigned_type_node integer_types[itk_unsigned_long] 4105 #define long_long_integer_type_node integer_types[itk_long_long] 4106 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long] 4107 #define int128_integer_type_node integer_types[itk_int128] 4108 #define int128_unsigned_type_node integer_types[itk_unsigned_int128] 4109 4110 /* A pointer-to-function member type looks like: 4111 4112 struct { 4113 __P __pfn; 4114 ptrdiff_t __delta; 4115 }; 4116 4117 If __pfn is NULL, it is a NULL pointer-to-member-function. 4118 4119 (Because the vtable is always the first thing in the object, we 4120 don't need its offset.) If the function is virtual, then PFN is 4121 one plus twice the index into the vtable; otherwise, it is just a 4122 pointer to the function. 4123 4124 Unfortunately, using the lowest bit of PFN doesn't work in 4125 architectures that don't impose alignment requirements on function 4126 addresses, or that use the lowest bit to tell one ISA from another, 4127 for example. For such architectures, we use the lowest bit of 4128 DELTA instead of the lowest bit of the PFN, and DELTA will be 4129 multiplied by 2. */ 4130 4131 enum ptrmemfunc_vbit_where_t 4132 { 4133 ptrmemfunc_vbit_in_pfn, 4134 ptrmemfunc_vbit_in_delta 4135 }; 4136 4137 #define NULL_TREE (tree) NULL 4138 4139 /* True if NODE is an erroneous expression. */ 4140 4141 #define error_operand_p(NODE) \ 4142 ((NODE) == error_mark_node \ 4143 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node)) 4144 4145 extern tree decl_assembler_name (tree); 4146 extern bool decl_assembler_name_equal (tree decl, const_tree asmname); 4147 extern hashval_t decl_assembler_name_hash (const_tree asmname); 4148 4149 /* Compute the number of bytes occupied by 'node'. This routine only 4150 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ 4151 4152 extern size_t tree_size (const_tree); 4153 4154 /* Compute the number of bytes occupied by a tree with code CODE. This 4155 function cannot be used for TREE_VEC codes, which are of variable 4156 length. */ 4157 extern size_t tree_code_size (enum tree_code); 4158 4159 /* Allocate and return a new UID from the DECL_UID namespace. */ 4160 extern int allocate_decl_uid (void); 4161 4162 /* Lowest level primitive for allocating a node. 4163 The TREE_CODE is the only argument. Contents are initialized 4164 to zero except for a few of the common fields. */ 4165 4166 extern tree make_node_stat (enum tree_code MEM_STAT_DECL); 4167 #define make_node(t) make_node_stat (t MEM_STAT_INFO) 4168 4169 /* Make a copy of a node, with all the same contents. */ 4170 4171 extern tree copy_node_stat (tree MEM_STAT_DECL); 4172 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO) 4173 4174 /* Make a copy of a chain of TREE_LIST nodes. */ 4175 4176 extern tree copy_list (tree); 4177 4178 /* Make a CASE_LABEL_EXPR. */ 4179 4180 extern tree build_case_label (tree, tree, tree); 4181 4182 /* Make a BINFO. */ 4183 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL); 4184 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO) 4185 4186 /* Make a TREE_VEC. */ 4187 4188 extern tree make_tree_vec_stat (int MEM_STAT_DECL); 4189 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO) 4190 4191 /* Return the (unique) IDENTIFIER_NODE node for a given name. 4192 The name is supplied as a char *. */ 4193 4194 extern tree get_identifier (const char *); 4195 4196 #if GCC_VERSION >= 3000 4197 #define get_identifier(str) \ 4198 (__builtin_constant_p (str) \ 4199 ? get_identifier_with_length ((str), strlen (str)) \ 4200 : get_identifier (str)) 4201 #endif 4202 4203 4204 /* Identical to get_identifier, except that the length is assumed 4205 known. */ 4206 4207 extern tree get_identifier_with_length (const char *, size_t); 4208 4209 /* If an identifier with the name TEXT (a null-terminated string) has 4210 previously been referred to, return that node; otherwise return 4211 NULL_TREE. */ 4212 4213 extern tree maybe_get_identifier (const char *); 4214 4215 /* Construct various types of nodes. */ 4216 4217 extern tree build_nt (enum tree_code, ...); 4218 extern tree build_nt_call_vec (tree, VEC(tree,gc) *); 4219 4220 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL); 4221 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO) 4222 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL); 4223 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO) 4224 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL); 4225 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO) 4226 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL); 4227 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO) 4228 extern tree build4_stat (enum tree_code, tree, tree, tree, tree, 4229 tree MEM_STAT_DECL); 4230 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO) 4231 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree, 4232 tree MEM_STAT_DECL); 4233 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) 4234 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree, 4235 tree, tree MEM_STAT_DECL); 4236 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \ 4237 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO) 4238 4239 /* _loc versions of build[1-6]. */ 4240 4241 static inline tree 4242 build1_stat_loc (location_t loc, enum tree_code code, tree type, 4243 tree arg1 MEM_STAT_DECL) 4244 { 4245 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT); 4246 if (CAN_HAVE_LOCATION_P (t)) 4247 SET_EXPR_LOCATION (t, loc); 4248 return t; 4249 } 4250 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO) 4251 4252 static inline tree 4253 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4254 tree arg1 MEM_STAT_DECL) 4255 { 4256 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT); 4257 if (CAN_HAVE_LOCATION_P (t)) 4258 SET_EXPR_LOCATION (t, loc); 4259 return t; 4260 } 4261 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO) 4262 4263 static inline tree 4264 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4265 tree arg1, tree arg2 MEM_STAT_DECL) 4266 { 4267 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT); 4268 if (CAN_HAVE_LOCATION_P (t)) 4269 SET_EXPR_LOCATION (t, loc); 4270 return t; 4271 } 4272 #define build3_loc(l,c,t1,t2,t3,t4) \ 4273 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO) 4274 4275 static inline tree 4276 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4277 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL) 4278 { 4279 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT); 4280 if (CAN_HAVE_LOCATION_P (t)) 4281 SET_EXPR_LOCATION (t, loc); 4282 return t; 4283 } 4284 #define build4_loc(l,c,t1,t2,t3,t4,t5) \ 4285 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO) 4286 4287 static inline tree 4288 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4289 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL) 4290 { 4291 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3, 4292 arg4 PASS_MEM_STAT); 4293 if (CAN_HAVE_LOCATION_P (t)) 4294 SET_EXPR_LOCATION (t, loc); 4295 return t; 4296 } 4297 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \ 4298 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO) 4299 4300 static inline tree 4301 build6_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0, 4302 tree arg1, tree arg2, tree arg3, tree arg4, 4303 tree arg5 MEM_STAT_DECL) 4304 { 4305 tree t = build6_stat (code, type, arg0, arg1, arg2, arg3, arg4, 4306 arg5 PASS_MEM_STAT); 4307 if (CAN_HAVE_LOCATION_P (t)) 4308 SET_EXPR_LOCATION (t, loc); 4309 return t; 4310 } 4311 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \ 4312 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO) 4313 4314 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL); 4315 #define build_var_debug_value(t1,t2) \ 4316 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO) 4317 4318 /* Constructs double_int from tree CST. */ 4319 4320 static inline double_int 4321 tree_to_double_int (const_tree cst) 4322 { 4323 return TREE_INT_CST (cst); 4324 } 4325 4326 extern tree double_int_to_tree (tree, double_int); 4327 extern bool double_int_fits_to_tree_p (const_tree, double_int); 4328 extern tree force_fit_type_double (tree, double_int, int, bool); 4329 4330 /* Create an INT_CST node with a CST value zero extended. */ 4331 4332 static inline tree 4333 build_int_cstu (tree type, unsigned HOST_WIDE_INT cst) 4334 { 4335 return double_int_to_tree (type, uhwi_to_double_int (cst)); 4336 } 4337 4338 extern tree build_int_cst (tree, HOST_WIDE_INT); 4339 extern tree build_int_cst_type (tree, HOST_WIDE_INT); 4340 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT); 4341 extern tree build_vector (tree, tree); 4342 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *); 4343 extern tree build_vector_from_val (tree, tree); 4344 extern tree build_constructor (tree, VEC(constructor_elt,gc) *); 4345 extern tree build_constructor_single (tree, tree, tree); 4346 extern tree build_constructor_from_list (tree, tree); 4347 extern tree build_real_from_int_cst (tree, const_tree); 4348 extern tree build_complex (tree, tree, tree); 4349 extern tree build_one_cst (tree); 4350 extern tree build_zero_cst (tree); 4351 extern tree build_string (int, const char *); 4352 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL); 4353 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO) 4354 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL); 4355 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO) 4356 extern tree build_decl_stat (location_t, enum tree_code, 4357 tree, tree MEM_STAT_DECL); 4358 extern tree build_fn_decl (const char *, tree); 4359 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO) 4360 extern tree build_translation_unit_decl (tree); 4361 extern tree build_block (tree, tree, tree, tree); 4362 extern tree build_empty_stmt (location_t); 4363 extern tree build_omp_clause (location_t, enum omp_clause_code); 4364 4365 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL); 4366 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO) 4367 4368 extern tree build_call_nary (tree, tree, int, ...); 4369 extern tree build_call_valist (tree, tree, int, va_list); 4370 #define build_call_array(T1,T2,N,T3)\ 4371 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3) 4372 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *); 4373 extern tree build_call_vec (tree, tree, VEC(tree,gc) *); 4374 4375 /* Construct various nodes representing data types. */ 4376 4377 extern tree make_signed_type (int); 4378 extern tree make_unsigned_type (int); 4379 extern tree signed_or_unsigned_type_for (int, tree); 4380 extern tree signed_type_for (tree); 4381 extern tree unsigned_type_for (tree); 4382 extern void initialize_sizetypes (void); 4383 extern void fixup_unsigned_type (tree); 4384 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool); 4385 extern tree build_pointer_type (tree); 4386 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool); 4387 extern tree build_reference_type (tree); 4388 extern tree build_vector_type_for_mode (tree, enum machine_mode); 4389 extern tree build_vector_type (tree innertype, int nunits); 4390 extern tree build_opaque_vector_type (tree innertype, int nunits); 4391 extern tree build_type_no_quals (tree); 4392 extern tree build_index_type (tree); 4393 extern tree build_array_type (tree, tree); 4394 extern tree build_nonshared_array_type (tree, tree); 4395 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT); 4396 extern tree build_function_type (tree, tree); 4397 extern tree build_function_type_list (tree, ...); 4398 extern tree build_function_decl_skip_args (tree, bitmap, bool); 4399 extern tree build_varargs_function_type_list (tree, ...); 4400 extern tree build_function_type_array (tree, int, tree *); 4401 extern tree build_varargs_function_type_array (tree, int, tree *); 4402 #define build_function_type_vec(RET, V) \ 4403 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V)) 4404 #define build_varargs_function_type_vec(RET, V) \ 4405 build_varargs_function_type_array (RET, VEC_length (tree, V), \ 4406 VEC_address (tree, V)) 4407 extern tree build_method_type_directly (tree, tree, tree); 4408 extern tree build_method_type (tree, tree); 4409 extern tree build_offset_type (tree, tree); 4410 extern tree build_complex_type (tree); 4411 extern tree array_type_nelts (const_tree); 4412 extern bool in_array_bounds_p (tree); 4413 extern bool range_in_array_bounds_p (tree); 4414 4415 extern tree value_member (tree, tree); 4416 extern tree purpose_member (const_tree, tree); 4417 extern bool vec_member (const_tree, VEC(tree,gc) *); 4418 extern tree chain_index (int, tree); 4419 4420 extern int attribute_list_equal (const_tree, const_tree); 4421 extern int attribute_list_contained (const_tree, const_tree); 4422 extern int tree_int_cst_equal (const_tree, const_tree); 4423 extern int tree_int_cst_lt (const_tree, const_tree); 4424 extern int tree_int_cst_compare (const_tree, const_tree); 4425 extern int host_integerp (const_tree, int) 4426 #ifndef ENABLE_TREE_CHECKING 4427 ATTRIBUTE_PURE /* host_integerp is pure only when checking is disabled. */ 4428 #endif 4429 ; 4430 extern HOST_WIDE_INT tree_low_cst (const_tree, int); 4431 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003) 4432 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT 4433 tree_low_cst (const_tree t, int pos) 4434 { 4435 gcc_assert (host_integerp (t, pos)); 4436 return TREE_INT_CST_LOW (t); 4437 } 4438 #endif 4439 extern HOST_WIDE_INT size_low_cst (const_tree); 4440 extern int tree_int_cst_sgn (const_tree); 4441 extern int tree_int_cst_sign_bit (const_tree); 4442 extern unsigned int tree_int_cst_min_precision (tree, bool); 4443 extern bool tree_expr_nonnegative_p (tree); 4444 extern bool tree_expr_nonnegative_warnv_p (tree, bool *); 4445 extern bool may_negate_without_overflow_p (const_tree); 4446 extern tree strip_array_types (tree); 4447 extern tree excess_precision_type (tree); 4448 4449 /* Construct various nodes representing fract or accum data types. */ 4450 4451 extern tree make_fract_type (int, int, int); 4452 extern tree make_accum_type (int, int, int); 4453 4454 #define make_signed_fract_type(P) make_fract_type (P, 0, 0) 4455 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0) 4456 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1) 4457 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1) 4458 #define make_signed_accum_type(P) make_accum_type (P, 0, 0) 4459 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0) 4460 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1) 4461 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1) 4462 4463 #define make_or_reuse_signed_fract_type(P) \ 4464 make_or_reuse_fract_type (P, 0, 0) 4465 #define make_or_reuse_unsigned_fract_type(P) \ 4466 make_or_reuse_fract_type (P, 1, 0) 4467 #define make_or_reuse_sat_signed_fract_type(P) \ 4468 make_or_reuse_fract_type (P, 0, 1) 4469 #define make_or_reuse_sat_unsigned_fract_type(P) \ 4470 make_or_reuse_fract_type (P, 1, 1) 4471 #define make_or_reuse_signed_accum_type(P) \ 4472 make_or_reuse_accum_type (P, 0, 0) 4473 #define make_or_reuse_unsigned_accum_type(P) \ 4474 make_or_reuse_accum_type (P, 1, 0) 4475 #define make_or_reuse_sat_signed_accum_type(P) \ 4476 make_or_reuse_accum_type (P, 0, 1) 4477 #define make_or_reuse_sat_unsigned_accum_type(P) \ 4478 make_or_reuse_accum_type (P, 1, 1) 4479 4480 /* From expmed.c. Since rtl.h is included after tree.h, we can't 4481 put the prototype here. Rtl.h does declare the prototype if 4482 tree.h had been included. */ 4483 4484 extern tree make_tree (tree, rtx); 4485 4486 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES 4487 is ATTRIBUTE. 4488 4489 Such modified types already made are recorded so that duplicates 4490 are not made. */ 4491 4492 extern tree build_type_attribute_variant (tree, tree); 4493 extern tree build_decl_attribute_variant (tree, tree); 4494 extern tree build_type_attribute_qual_variant (tree, tree, int); 4495 4496 /* Return 0 if the attributes for two types are incompatible, 1 if they 4497 are compatible, and 2 if they are nearly compatible (which causes a 4498 warning to be generated). */ 4499 extern int comp_type_attributes (const_tree, const_tree); 4500 4501 /* Structure describing an attribute and a function to handle it. */ 4502 struct attribute_spec 4503 { 4504 /* The name of the attribute (without any leading or trailing __), 4505 or NULL to mark the end of a table of attributes. */ 4506 const char *const name; 4507 /* The minimum length of the list of arguments of the attribute. */ 4508 const int min_length; 4509 /* The maximum length of the list of arguments of the attribute 4510 (-1 for no maximum). */ 4511 const int max_length; 4512 /* Whether this attribute requires a DECL. If it does, it will be passed 4513 from types of DECLs, function return types and array element types to 4514 the DECLs, function types and array types respectively; but when 4515 applied to a type in any other circumstances, it will be ignored with 4516 a warning. (If greater control is desired for a given attribute, 4517 this should be false, and the flags argument to the handler may be 4518 used to gain greater control in that case.) */ 4519 const bool decl_required; 4520 /* Whether this attribute requires a type. If it does, it will be passed 4521 from a DECL to the type of that DECL. */ 4522 const bool type_required; 4523 /* Whether this attribute requires a function (or method) type. If it does, 4524 it will be passed from a function pointer type to the target type, 4525 and from a function return type (which is not itself a function 4526 pointer type) to the function type. */ 4527 const bool function_type_required; 4528 /* Function to handle this attribute. NODE points to the node to which 4529 the attribute is to be applied. If a DECL, it should be modified in 4530 place; if a TYPE, a copy should be created. NAME is the name of the 4531 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST 4532 of the arguments (which may be NULL). FLAGS gives further information 4533 about the context of the attribute. Afterwards, the attributes will 4534 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate, 4535 unless *NO_ADD_ATTRS is set to true (which should be done on error, 4536 as well as in any other cases when the attributes should not be added 4537 to the DECL or TYPE). Depending on FLAGS, any attributes to be 4538 applied to another type or DECL later may be returned; 4539 otherwise the return value should be NULL_TREE. This pointer may be 4540 NULL if no special handling is required beyond the checks implied 4541 by the rest of this structure. */ 4542 tree (*const handler) (tree *node, tree name, tree args, 4543 int flags, bool *no_add_attrs); 4544 /* Specifies if attribute affects type's identity. */ 4545 const bool affects_type_identity; 4546 }; 4547 4548 /* Flags that may be passed in the third argument of decl_attributes, and 4549 to handler functions for attributes. */ 4550 enum attribute_flags 4551 { 4552 /* The type passed in is the type of a DECL, and any attributes that 4553 should be passed in again to be applied to the DECL rather than the 4554 type should be returned. */ 4555 ATTR_FLAG_DECL_NEXT = 1, 4556 /* The type passed in is a function return type, and any attributes that 4557 should be passed in again to be applied to the function type rather 4558 than the return type should be returned. */ 4559 ATTR_FLAG_FUNCTION_NEXT = 2, 4560 /* The type passed in is an array element type, and any attributes that 4561 should be passed in again to be applied to the array type rather 4562 than the element type should be returned. */ 4563 ATTR_FLAG_ARRAY_NEXT = 4, 4564 /* The type passed in is a structure, union or enumeration type being 4565 created, and should be modified in place. */ 4566 ATTR_FLAG_TYPE_IN_PLACE = 8, 4567 /* The attributes are being applied by default to a library function whose 4568 name indicates known behavior, and should be silently ignored if they 4569 are not in fact compatible with the function type. */ 4570 ATTR_FLAG_BUILT_IN = 16 4571 }; 4572 4573 /* Default versions of target-overridable functions. */ 4574 4575 extern tree merge_decl_attributes (tree, tree); 4576 extern tree merge_type_attributes (tree, tree); 4577 4578 /* This function is a private implementation detail of lookup_attribute() 4579 and you should never call it directly. */ 4580 extern tree private_lookup_attribute (const char *, size_t, tree); 4581 4582 /* Given an attribute name ATTR_NAME and a list of attributes LIST, 4583 return a pointer to the attribute's list element if the attribute 4584 is part of the list, or NULL_TREE if not found. If the attribute 4585 appears more than once, this only returns the first occurrence; the 4586 TREE_CHAIN of the return value should be passed back in if further 4587 occurrences are wanted. ATTR_NAME must be in the form 'text' (not 4588 '__text__'). */ 4589 4590 static inline tree 4591 lookup_attribute (const char *attr_name, tree list) 4592 { 4593 gcc_checking_assert (attr_name[0] != '_'); 4594 /* In most cases, list is NULL_TREE. */ 4595 if (list == NULL_TREE) 4596 return NULL_TREE; 4597 else 4598 /* Do the strlen() before calling the out-of-line implementation. 4599 In most cases attr_name is a string constant, and the compiler 4600 will optimize the strlen() away. */ 4601 return private_lookup_attribute (attr_name, strlen (attr_name), list); 4602 } 4603 4604 /* This function is a private implementation detail of 4605 is_attribute_p() and you should never call it directly. */ 4606 extern bool private_is_attribute_p (const char *, size_t, const_tree); 4607 4608 /* Given an identifier node IDENT and a string ATTR_NAME, return true 4609 if the identifier node is a valid attribute name for the string. 4610 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could 4611 be the identifier for 'text' or for '__text__'. */ 4612 4613 static inline bool 4614 is_attribute_p (const char *attr_name, const_tree ident) 4615 { 4616 gcc_checking_assert (attr_name[0] != '_'); 4617 /* Do the strlen() before calling the out-of-line implementation. 4618 In most cases attr_name is a string constant, and the compiler 4619 will optimize the strlen() away. */ 4620 return private_is_attribute_p (attr_name, strlen (attr_name), ident); 4621 } 4622 4623 /* Remove any instances of attribute ATTR_NAME in LIST and return the 4624 modified list. ATTR_NAME must be in the form 'text' (not 4625 '__text__'). */ 4626 4627 extern tree remove_attribute (const char *, tree); 4628 4629 /* Given two attributes lists, return a list of their union. */ 4630 4631 extern tree merge_attributes (tree, tree); 4632 4633 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES 4634 /* Given two Windows decl attributes lists, possibly including 4635 dllimport, return a list of their union . */ 4636 extern tree merge_dllimport_decl_attributes (tree, tree); 4637 4638 /* Handle a "dllimport" or "dllexport" attribute. */ 4639 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *); 4640 #endif 4641 4642 /* Check whether CAND is suitable to be returned from get_qualified_type 4643 (BASE, TYPE_QUALS). */ 4644 4645 extern bool check_qualified_type (const_tree, const_tree, int); 4646 4647 /* Return a version of the TYPE, qualified as indicated by the 4648 TYPE_QUALS, if one exists. If no qualified version exists yet, 4649 return NULL_TREE. */ 4650 4651 extern tree get_qualified_type (tree, int); 4652 4653 /* Like get_qualified_type, but creates the type if it does not 4654 exist. This function never returns NULL_TREE. */ 4655 4656 extern tree build_qualified_type (tree, int); 4657 4658 /* Create a variant of type T with alignment ALIGN. */ 4659 4660 extern tree build_aligned_type (tree, unsigned int); 4661 4662 /* Like build_qualified_type, but only deals with the `const' and 4663 `volatile' qualifiers. This interface is retained for backwards 4664 compatibility with the various front-ends; new code should use 4665 build_qualified_type instead. */ 4666 4667 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \ 4668 build_qualified_type ((TYPE), \ 4669 ((CONST_P) ? TYPE_QUAL_CONST : 0) \ 4670 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0)) 4671 4672 /* Make a copy of a type node. */ 4673 4674 extern tree build_distinct_type_copy (tree); 4675 extern tree build_variant_type_copy (tree); 4676 4677 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its 4678 fields. Optionally specify an alignment, and then lay it out. */ 4679 4680 extern void finish_builtin_struct (tree, const char *, 4681 tree, tree); 4682 4683 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT, 4684 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one 4685 node, does nothing except for the first time. */ 4686 4687 extern void layout_type (tree); 4688 4689 /* These functions allow a front-end to perform a manual layout of a 4690 RECORD_TYPE. (For instance, if the placement of subsequent fields 4691 depends on the placement of fields so far.) Begin by calling 4692 start_record_layout. Then, call place_field for each of the 4693 fields. Then, call finish_record_layout. See layout_type for the 4694 default way in which these functions are used. */ 4695 4696 typedef struct record_layout_info_s 4697 { 4698 /* The RECORD_TYPE that we are laying out. */ 4699 tree t; 4700 /* The offset into the record so far, in bytes, not including bits in 4701 BITPOS. */ 4702 tree offset; 4703 /* The last known alignment of SIZE. */ 4704 unsigned int offset_align; 4705 /* The bit position within the last OFFSET_ALIGN bits, in bits. */ 4706 tree bitpos; 4707 /* The alignment of the record so far, in bits. */ 4708 unsigned int record_align; 4709 /* The alignment of the record so far, ignoring #pragma pack and 4710 __attribute__ ((packed)), in bits. */ 4711 unsigned int unpacked_align; 4712 /* The previous field layed out. */ 4713 tree prev_field; 4714 /* The static variables (i.e., class variables, as opposed to 4715 instance variables) encountered in T. */ 4716 VEC(tree,gc) *pending_statics; 4717 /* Bits remaining in the current alignment group */ 4718 int remaining_in_alignment; 4719 /* True if we've seen a packed field that didn't have normal 4720 alignment anyway. */ 4721 int packed_maybe_necessary; 4722 } *record_layout_info; 4723 4724 extern record_layout_info start_record_layout (tree); 4725 extern tree bit_from_pos (tree, tree); 4726 extern tree byte_from_pos (tree, tree); 4727 extern void pos_from_bit (tree *, tree *, unsigned int, tree); 4728 extern void normalize_offset (tree *, tree *, unsigned int); 4729 extern tree rli_size_unit_so_far (record_layout_info); 4730 extern tree rli_size_so_far (record_layout_info); 4731 extern void normalize_rli (record_layout_info); 4732 extern void place_field (record_layout_info, tree); 4733 extern void compute_record_mode (tree); 4734 extern void finish_record_layout (record_layout_info, int); 4735 4736 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made), 4737 return a canonicalized ..._TYPE node, so that duplicates are not made. 4738 How the hash code is computed is up to the caller, as long as any two 4739 callers that could hash identical-looking type nodes agree. */ 4740 4741 extern tree type_hash_canon (unsigned int, tree); 4742 4743 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node, 4744 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE 4745 fields. Call this only once for any given decl node. 4746 4747 Second argument is the boundary that this field can be assumed to 4748 be starting at (in bits). Zero means it can be assumed aligned 4749 on any boundary that may be needed. */ 4750 4751 extern void layout_decl (tree, unsigned); 4752 4753 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of 4754 a previous call to layout_decl and calls it again. */ 4755 4756 extern void relayout_decl (tree); 4757 4758 /* Return the mode for data of a given size SIZE and mode class CLASS. 4759 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE. 4760 The value is BLKmode if no other mode is found. This is like 4761 mode_for_size, but is passed a tree. */ 4762 4763 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int); 4764 4765 /* Return an expr equal to X but certainly not valid as an lvalue. */ 4766 4767 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T) 4768 extern tree non_lvalue_loc (location_t, tree); 4769 4770 extern tree convert (tree, tree); 4771 extern unsigned int expr_align (const_tree); 4772 extern tree expr_first (tree); 4773 extern tree expr_last (tree); 4774 extern tree size_in_bytes (const_tree); 4775 extern HOST_WIDE_INT int_size_in_bytes (const_tree); 4776 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree); 4777 extern tree tree_expr_size (const_tree); 4778 extern tree bit_position (const_tree); 4779 extern HOST_WIDE_INT int_bit_position (const_tree); 4780 extern tree byte_position (const_tree); 4781 extern HOST_WIDE_INT int_byte_position (const_tree); 4782 4783 /* Define data structures, macros, and functions for handling sizes 4784 and the various types used to represent sizes. */ 4785 4786 enum size_type_kind 4787 { 4788 SIZETYPE, /* Normal representation of sizes in bytes. */ 4789 SSIZETYPE, /* Signed representation of sizes in bytes. */ 4790 BITSIZETYPE, /* Normal representation of sizes in bits. */ 4791 SBITSIZETYPE, /* Signed representation of sizes in bits. */ 4792 TYPE_KIND_LAST}; 4793 4794 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST]; 4795 4796 #define sizetype sizetype_tab[(int) SIZETYPE] 4797 #define bitsizetype sizetype_tab[(int) BITSIZETYPE] 4798 #define ssizetype sizetype_tab[(int) SSIZETYPE] 4799 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE] 4800 4801 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind); 4802 #define size_binop(CODE,T1,T2)\ 4803 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2) 4804 extern tree size_binop_loc (location_t, enum tree_code, tree, tree); 4805 #define size_diffop(T1,T2)\ 4806 size_diffop_loc (UNKNOWN_LOCATION, T1, T2) 4807 extern tree size_diffop_loc (location_t, tree, tree); 4808 4809 #define size_int(L) size_int_kind (L, SIZETYPE) 4810 #define ssize_int(L) size_int_kind (L, SSIZETYPE) 4811 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE) 4812 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE) 4813 4814 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N) 4815 extern tree round_up_loc (location_t, tree, int); 4816 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N) 4817 extern tree round_down_loc (location_t, tree, int); 4818 extern void finalize_size_functions (void); 4819 4820 /* Type for sizes of data-type. */ 4821 4822 #define BITS_PER_UNIT_LOG \ 4823 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \ 4824 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \ 4825 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256)) 4826 4827 /* If nonzero, an upper limit on alignment of structure fields, in bits, */ 4828 extern unsigned int maximum_field_alignment; 4829 4830 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y 4831 by making the last node in X point to Y. 4832 Returns X, except if X is 0 returns Y. */ 4833 4834 extern tree chainon (tree, tree); 4835 4836 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */ 4837 4838 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL); 4839 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO) 4840 4841 /* Return the last tree node in a chain. */ 4842 4843 extern tree tree_last (tree); 4844 4845 /* Reverse the order of elements in a chain, and return the new head. */ 4846 4847 extern tree nreverse (tree); 4848 4849 /* Returns the length of a chain of nodes 4850 (number of chain pointers to follow before reaching a null pointer). */ 4851 4852 extern int list_length (const_tree); 4853 4854 /* Returns the number of FIELD_DECLs in a type. */ 4855 4856 extern int fields_length (const_tree); 4857 4858 /* Returns the first FIELD_DECL in a type. */ 4859 4860 extern tree first_field (const_tree); 4861 4862 /* Given an initializer INIT, return TRUE if INIT is zero or some 4863 aggregate of zeros. Otherwise return FALSE. */ 4864 4865 extern bool initializer_zerop (const_tree); 4866 4867 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */ 4868 4869 extern VEC(tree,gc) *ctor_to_vec (tree); 4870 4871 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, 4872 HOST_WIDE_INT *, bool *); 4873 4874 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree); 4875 4876 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */ 4877 4878 extern int integer_zerop (const_tree); 4879 4880 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */ 4881 4882 extern int integer_onep (const_tree); 4883 4884 /* integer_all_onesp (tree x) is nonzero if X is an integer constant 4885 all of whose significant bits are 1. */ 4886 4887 extern int integer_all_onesp (const_tree); 4888 4889 /* integer_pow2p (tree x) is nonzero is X is an integer constant with 4890 exactly one bit 1. */ 4891 4892 extern int integer_pow2p (const_tree); 4893 4894 /* integer_nonzerop (tree x) is nonzero if X is an integer constant 4895 with a nonzero value. */ 4896 4897 extern int integer_nonzerop (const_tree); 4898 4899 extern bool cst_and_fits_in_hwi (const_tree); 4900 extern tree num_ending_zeros (const_tree); 4901 4902 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of 4903 value 0. */ 4904 4905 extern int fixed_zerop (const_tree); 4906 4907 /* staticp (tree x) is nonzero if X is a reference to data allocated 4908 at a fixed address in memory. Returns the outermost data. */ 4909 4910 extern tree staticp (tree); 4911 4912 /* save_expr (EXP) returns an expression equivalent to EXP 4913 but it can be used multiple times within context CTX 4914 and only evaluate EXP once. */ 4915 4916 extern tree save_expr (tree); 4917 4918 /* Look inside EXPR and into any simple arithmetic operations. Return 4919 the innermost non-arithmetic node. */ 4920 4921 extern tree skip_simple_arithmetic (tree); 4922 4923 /* Return which tree structure is used by T. */ 4924 4925 enum tree_node_structure_enum tree_node_structure (const_tree); 4926 4927 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a 4928 size or offset that depends on a field within a record. */ 4929 4930 extern bool contains_placeholder_p (const_tree); 4931 4932 /* This macro calls the above function but short-circuits the common 4933 case of a constant to save time. Also check for null. */ 4934 4935 #define CONTAINS_PLACEHOLDER_P(EXP) \ 4936 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP)) 4937 4938 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR 4939 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and 4940 field positions. */ 4941 4942 extern bool type_contains_placeholder_p (tree); 4943 4944 /* Given a tree EXP, find all occurences of references to fields 4945 in a PLACEHOLDER_EXPR and place them in vector REFS without 4946 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that 4947 we assume here that EXP contains only arithmetic expressions 4948 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their 4949 argument list. */ 4950 4951 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **); 4952 4953 /* This macro calls the above function but short-circuits the common 4954 case of a constant to save time and also checks for NULL. */ 4955 4956 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \ 4957 do { \ 4958 if((EXP) && !TREE_CONSTANT (EXP)) \ 4959 find_placeholder_in_expr (EXP, V); \ 4960 } while (0) 4961 4962 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, 4963 return a tree with all occurrences of references to F in a 4964 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and 4965 CONST_DECLs. Note that we assume here that EXP contains only 4966 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs 4967 occurring only in their argument list. */ 4968 4969 extern tree substitute_in_expr (tree, tree, tree); 4970 4971 /* This macro calls the above function but short-circuits the common 4972 case of a constant to save time and also checks for NULL. */ 4973 4974 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \ 4975 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R)) 4976 4977 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement 4978 for it within OBJ, a tree that is an object or a chain of references. */ 4979 4980 extern tree substitute_placeholder_in_expr (tree, tree); 4981 4982 /* This macro calls the above function but short-circuits the common 4983 case of a constant to save time and also checks for NULL. */ 4984 4985 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \ 4986 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \ 4987 : substitute_placeholder_in_expr (EXP, OBJ)) 4988 4989 /* variable_size (EXP) is like save_expr (EXP) except that it 4990 is for the special case of something that is part of a 4991 variable size for a data type. It makes special arrangements 4992 to compute the value at the right time when the data type 4993 belongs to a function parameter. */ 4994 4995 extern tree variable_size (tree); 4996 4997 /* stabilize_reference (EXP) returns a reference equivalent to EXP 4998 but it can be used multiple times 4999 and only evaluate the subexpressions once. */ 5000 5001 extern tree stabilize_reference (tree); 5002 5003 /* Subroutine of stabilize_reference; this is called for subtrees of 5004 references. Any expression with side-effects must be put in a SAVE_EXPR 5005 to ensure that it is only evaluated once. */ 5006 5007 extern tree stabilize_reference_1 (tree); 5008 5009 /* Return EXP, stripped of any conversions to wider types 5010 in such a way that the result of converting to type FOR_TYPE 5011 is the same as if EXP were converted to FOR_TYPE. 5012 If FOR_TYPE is 0, it signifies EXP's type. */ 5013 5014 extern tree get_unwidened (tree, tree); 5015 5016 /* Return OP or a simpler expression for a narrower value 5017 which can be sign-extended or zero-extended to give back OP. 5018 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended 5019 or 0 if the value should be sign-extended. */ 5020 5021 extern tree get_narrower (tree, int *); 5022 5023 /* Return true if T is an expression that get_inner_reference handles. */ 5024 5025 static inline bool 5026 handled_component_p (const_tree t) 5027 { 5028 switch (TREE_CODE (t)) 5029 { 5030 case BIT_FIELD_REF: 5031 case COMPONENT_REF: 5032 case ARRAY_REF: 5033 case ARRAY_RANGE_REF: 5034 case VIEW_CONVERT_EXPR: 5035 case REALPART_EXPR: 5036 case IMAGPART_EXPR: 5037 return true; 5038 5039 default: 5040 return false; 5041 } 5042 } 5043 5044 /* Given an expression EXP that is a handled_component_p, 5045 look for the ultimate containing object, which is returned and specify 5046 the access position and size. */ 5047 5048 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *, 5049 tree *, enum machine_mode *, int *, int *, 5050 bool); 5051 5052 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an 5053 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within 5054 EXP is marked as PACKED. */ 5055 5056 extern bool contains_packed_reference (const_tree exp); 5057 5058 /* Return a tree of sizetype representing the size, in bytes, of the element 5059 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5060 5061 extern tree array_ref_element_size (tree); 5062 5063 /* Return a tree representing the lower bound of the array mentioned in 5064 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5065 5066 extern tree array_ref_low_bound (tree); 5067 5068 /* Return a tree representing the upper bound of the array mentioned in 5069 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */ 5070 5071 extern tree array_ref_up_bound (tree); 5072 5073 /* Return a tree representing the offset, in bytes, of the field referenced 5074 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */ 5075 5076 extern tree component_ref_field_offset (tree); 5077 5078 /* Given a DECL or TYPE, return the scope in which it was declared, or 5079 NUL_TREE if there is no containing scope. */ 5080 5081 extern tree get_containing_scope (const_tree); 5082 5083 /* Return the FUNCTION_DECL which provides this _DECL with its context, 5084 or zero if none. */ 5085 extern tree decl_function_context (const_tree); 5086 5087 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides 5088 this _DECL with its context, or zero if none. */ 5089 extern tree decl_type_context (const_tree); 5090 5091 /* Return 1 if EXPR is the real constant zero. */ 5092 extern int real_zerop (const_tree); 5093 5094 /* Declare commonly used variables for tree structure. */ 5095 5096 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C. 5097 Zero means allow extended lvalues. */ 5098 5099 extern int pedantic_lvalues; 5100 5101 /* Points to the FUNCTION_DECL of the function whose body we are reading. */ 5102 5103 extern GTY(()) tree current_function_decl; 5104 5105 /* Nonzero means a FUNC_BEGIN label was emitted. */ 5106 extern GTY(()) const char * current_function_func_begin_label; 5107 5108 /* Iterator for going through the function arguments. */ 5109 typedef struct { 5110 tree next; /* TREE_LIST pointing to the next argument */ 5111 } function_args_iterator; 5112 5113 /* Initialize the iterator I with arguments from function FNDECL */ 5114 5115 static inline void 5116 function_args_iter_init (function_args_iterator *i, const_tree fntype) 5117 { 5118 i->next = TYPE_ARG_TYPES (fntype); 5119 } 5120 5121 /* Return a pointer that holds the next argument if there are more arguments to 5122 handle, otherwise return NULL. */ 5123 5124 static inline tree * 5125 function_args_iter_cond_ptr (function_args_iterator *i) 5126 { 5127 return (i->next) ? &TREE_VALUE (i->next) : NULL; 5128 } 5129 5130 /* Return the next argument if there are more arguments to handle, otherwise 5131 return NULL. */ 5132 5133 static inline tree 5134 function_args_iter_cond (function_args_iterator *i) 5135 { 5136 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE; 5137 } 5138 5139 /* Advance to the next argument. */ 5140 static inline void 5141 function_args_iter_next (function_args_iterator *i) 5142 { 5143 gcc_assert (i->next != NULL_TREE); 5144 i->next = TREE_CHAIN (i->next); 5145 } 5146 5147 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */ 5148 5149 static inline bool 5150 inlined_function_outer_scope_p (const_tree block) 5151 { 5152 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION; 5153 } 5154 5155 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set 5156 to point to the next tree element. ITER is an instance of 5157 function_args_iterator used to iterate the arguments. */ 5158 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \ 5159 for (function_args_iter_init (&(ITER), (FNTYPE)); \ 5160 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \ 5161 function_args_iter_next (&(ITER))) 5162 5163 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set 5164 to the next tree element. ITER is an instance of function_args_iterator 5165 used to iterate the arguments. */ 5166 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \ 5167 for (function_args_iter_init (&(ITER), (FNTYPE)); \ 5168 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \ 5169 function_args_iter_next (&(ITER))) 5170 5171 5172 5173 /* In tree.c */ 5174 extern unsigned crc32_string (unsigned, const char *); 5175 extern unsigned crc32_byte (unsigned, char); 5176 extern void clean_symbol_name (char *); 5177 extern tree get_file_function_name (const char *); 5178 extern tree get_callee_fndecl (const_tree); 5179 extern int type_num_arguments (const_tree); 5180 extern bool associative_tree_code (enum tree_code); 5181 extern bool commutative_tree_code (enum tree_code); 5182 extern bool commutative_ternary_tree_code (enum tree_code); 5183 extern tree upper_bound_in_type (tree, tree); 5184 extern tree lower_bound_in_type (tree, tree); 5185 extern int operand_equal_for_phi_arg_p (const_tree, const_tree); 5186 extern tree create_artificial_label (location_t); 5187 extern const char *get_name (tree); 5188 extern bool stdarg_p (const_tree); 5189 extern bool prototype_p (tree); 5190 extern bool is_typedef_decl (tree x); 5191 extern bool typedef_variant_p (tree); 5192 extern bool auto_var_in_fn_p (const_tree, const_tree); 5193 extern tree build_low_bits_mask (tree, unsigned); 5194 extern tree tree_strip_nop_conversions (tree); 5195 extern tree tree_strip_sign_nop_conversions (tree); 5196 extern const_tree strip_invariant_refs (const_tree); 5197 extern tree lhd_gcc_personality (void); 5198 extern void assign_assembler_name_if_neeeded (tree); 5199 extern void warn_deprecated_use (tree, tree); 5200 5201 5202 /* In cgraph.c */ 5203 extern void change_decl_assembler_name (tree, tree); 5204 5205 /* In gimplify.c */ 5206 extern tree unshare_expr (tree); 5207 5208 /* In stmt.c */ 5209 5210 extern void expand_expr_stmt (tree); 5211 extern int warn_if_unused_value (const_tree, location_t); 5212 extern void expand_label (tree); 5213 extern void expand_goto (tree); 5214 5215 extern rtx expand_stack_save (void); 5216 extern void expand_stack_restore (tree); 5217 extern void expand_return (tree); 5218 5219 /* In tree-eh.c */ 5220 extern void using_eh_for_cleanups (void); 5221 5222 /* Compare and hash for any structure which begins with a canonical 5223 pointer. Assumes all pointers are interchangeable, which is sort 5224 of already assumed by gcc elsewhere IIRC. */ 5225 5226 static inline int 5227 struct_ptr_eq (const void *a, const void *b) 5228 { 5229 const void * const * x = (const void * const *) a; 5230 const void * const * y = (const void * const *) b; 5231 return *x == *y; 5232 } 5233 5234 static inline hashval_t 5235 struct_ptr_hash (const void *a) 5236 { 5237 const void * const * x = (const void * const *) a; 5238 return (intptr_t)*x >> 4; 5239 } 5240 5241 /* In fold-const.c */ 5242 5243 /* Non-zero if we are folding constants inside an initializer; zero 5244 otherwise. */ 5245 extern int folding_initializer; 5246 5247 /* Convert between trees and native memory representation. */ 5248 extern int native_encode_expr (const_tree, unsigned char *, int); 5249 extern tree native_interpret_expr (tree, const unsigned char *, int); 5250 5251 /* Fold constants as much as possible in an expression. 5252 Returns the simplified expression. 5253 Acts only on the top level of the expression; 5254 if the argument itself cannot be simplified, its 5255 subexpressions are not changed. */ 5256 5257 extern tree fold (tree); 5258 #define fold_unary(CODE,T1,T2)\ 5259 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2) 5260 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree); 5261 #define fold_unary_ignore_overflow(CODE,T1,T2)\ 5262 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2) 5263 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree); 5264 #define fold_binary(CODE,T1,T2,T3)\ 5265 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3) 5266 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree); 5267 #define fold_ternary(CODE,T1,T2,T3,T4)\ 5268 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4) 5269 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree); 5270 #define fold_build1(c,t1,t2)\ 5271 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO) 5272 #define fold_build1_loc(l,c,t1,t2)\ 5273 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO) 5274 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree, 5275 tree MEM_STAT_DECL); 5276 #define fold_build2(c,t1,t2,t3)\ 5277 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO) 5278 #define fold_build2_loc(l,c,t1,t2,t3)\ 5279 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO) 5280 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree, 5281 tree MEM_STAT_DECL); 5282 #define fold_build3(c,t1,t2,t3,t4)\ 5283 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO) 5284 #define fold_build3_loc(l,c,t1,t2,t3,t4)\ 5285 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO) 5286 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree, 5287 tree MEM_STAT_DECL); 5288 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree); 5289 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree); 5290 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree); 5291 #define fold_build_call_array(T1,T2,N,T4)\ 5292 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4) 5293 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *); 5294 #define fold_build_call_array_initializer(T1,T2,N,T4)\ 5295 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4) 5296 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *); 5297 extern bool fold_convertible_p (const_tree, const_tree); 5298 #define fold_convert(T1,T2)\ 5299 fold_convert_loc(UNKNOWN_LOCATION, T1, T2) 5300 extern tree fold_convert_loc (location_t, tree, tree); 5301 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree); 5302 extern tree fold_ignored_result (tree); 5303 extern tree fold_abs_const (tree, tree); 5304 extern tree fold_indirect_ref_1 (location_t, tree, tree); 5305 extern void fold_defer_overflow_warnings (void); 5306 extern void fold_undefer_overflow_warnings (bool, const_gimple, int); 5307 extern void fold_undefer_and_ignore_overflow_warnings (void); 5308 extern bool fold_deferring_overflow_warnings_p (void); 5309 extern tree fold_fma (location_t, tree, tree, tree, tree); 5310 5311 enum operand_equal_flag 5312 { 5313 OEP_ONLY_CONST = 1, 5314 OEP_PURE_SAME = 2, 5315 OEP_CONSTANT_ADDRESS_OF = 4 5316 }; 5317 5318 extern int operand_equal_p (const_tree, const_tree, unsigned int); 5319 extern int multiple_of_p (tree, const_tree, const_tree); 5320 #define omit_one_operand(T1,T2,T3)\ 5321 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3) 5322 extern tree omit_one_operand_loc (location_t, tree, tree, tree); 5323 #define omit_two_operands(T1,T2,T3,T4)\ 5324 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4) 5325 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree); 5326 #define invert_truthvalue(T)\ 5327 invert_truthvalue_loc(UNKNOWN_LOCATION, T) 5328 extern tree invert_truthvalue_loc (location_t, tree); 5329 extern tree fold_truth_not_expr (location_t, tree); 5330 extern tree fold_unary_to_constant (enum tree_code, tree, tree); 5331 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); 5332 extern tree fold_read_from_constant_string (tree); 5333 extern tree int_const_binop (enum tree_code, const_tree, const_tree); 5334 #define build_fold_addr_expr(T)\ 5335 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T)) 5336 extern tree build_fold_addr_expr_loc (location_t, tree); 5337 #define build_fold_addr_expr_with_type(T,TYPE)\ 5338 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE) 5339 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree); 5340 extern tree fold_build_cleanup_point_expr (tree type, tree expr); 5341 extern tree fold_strip_sign_ops (tree); 5342 #define build_fold_indirect_ref(T)\ 5343 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T) 5344 extern tree build_fold_indirect_ref_loc (location_t, tree); 5345 #define fold_indirect_ref(T)\ 5346 fold_indirect_ref_loc (UNKNOWN_LOCATION, T) 5347 extern tree fold_indirect_ref_loc (location_t, tree); 5348 extern tree build_simple_mem_ref_loc (location_t, tree); 5349 #define build_simple_mem_ref(T)\ 5350 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T) 5351 extern double_int mem_ref_offset (const_tree); 5352 extern tree reference_alias_ptr_type (const_tree); 5353 extern tree build_invariant_address (tree, tree, HOST_WIDE_INT); 5354 extern tree constant_boolean_node (bool, tree); 5355 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree); 5356 5357 extern bool tree_swap_operands_p (const_tree, const_tree, bool); 5358 extern enum tree_code swap_tree_comparison (enum tree_code); 5359 5360 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *); 5361 extern enum tree_code invert_tree_comparison (enum tree_code, bool); 5362 5363 extern bool tree_expr_nonzero_p (tree); 5364 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *); 5365 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1, 5366 bool *); 5367 extern bool tree_single_nonzero_warnv_p (tree, bool *); 5368 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *); 5369 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree, 5370 bool *); 5371 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p); 5372 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p); 5373 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *); 5374 5375 extern bool tree_expr_nonzero_warnv_p (tree, bool *); 5376 5377 extern bool fold_real_zero_addition_p (const_tree, const_tree, int); 5378 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code, 5379 enum tree_code, tree, tree, tree); 5380 extern void debug_fold_checksum (const_tree); 5381 5382 /* Return nonzero if CODE is a tree code that represents a truth value. */ 5383 static inline bool 5384 truth_value_p (enum tree_code code) 5385 { 5386 return (TREE_CODE_CLASS (code) == tcc_comparison 5387 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR 5388 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR 5389 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR); 5390 } 5391 5392 /* Return whether TYPE is a type suitable for an offset for 5393 a POINTER_PLUS_EXPR. */ 5394 static inline bool 5395 ptrofftype_p (tree type) 5396 { 5397 return (INTEGRAL_TYPE_P (type) 5398 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype) 5399 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype)); 5400 } 5401 5402 /* Return OFF converted to a pointer offset type suitable as offset for 5403 POINTER_PLUS_EXPR. Use location LOC for this conversion. */ 5404 static inline tree 5405 convert_to_ptrofftype_loc (location_t loc, tree off) 5406 { 5407 return fold_convert_loc (loc, sizetype, off); 5408 } 5409 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t) 5410 5411 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ 5412 static inline tree 5413 fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off) 5414 { 5415 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr), 5416 ptr, fold_convert_loc (loc, sizetype, off)); 5417 } 5418 #define fold_build_pointer_plus(p,o) \ 5419 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o) 5420 5421 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ 5422 static inline tree 5423 fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off) 5424 { 5425 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr), 5426 ptr, size_int (off)); 5427 } 5428 #define fold_build_pointer_plus_hwi(p,o) \ 5429 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o) 5430 5431 /* In builtins.c */ 5432 extern bool avoid_folding_inline_builtin (tree); 5433 extern tree fold_call_expr (location_t, tree, bool); 5434 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree); 5435 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree); 5436 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree); 5437 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool, 5438 enum built_in_function); 5439 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool, 5440 enum built_in_function); 5441 extern tree fold_builtin_stxncpy_chk (location_t, tree, tree, tree, tree, tree, bool, 5442 enum built_in_function); 5443 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function); 5444 extern bool fold_builtin_next_arg (tree, bool); 5445 extern enum built_in_function builtin_mathfn_code (const_tree); 5446 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *); 5447 extern tree build_call_expr_loc_array (location_t, tree, int, tree *); 5448 extern tree build_call_expr_loc_vec (location_t, tree, VEC(tree,gc) *); 5449 extern tree build_call_expr_loc (location_t, tree, int, ...); 5450 extern tree build_call_expr (tree, int, ...); 5451 extern tree mathfn_built_in (tree, enum built_in_function fn); 5452 extern tree c_strlen (tree, int); 5453 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *); 5454 extern tree build_va_arg_indirect_ref (tree); 5455 extern tree build_string_literal (int, const char *); 5456 extern bool validate_arglist (const_tree, ...); 5457 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode); 5458 extern bool is_builtin_fn (tree); 5459 extern unsigned int get_object_alignment_1 (tree, unsigned HOST_WIDE_INT *); 5460 extern unsigned int get_object_alignment (tree); 5461 extern unsigned int get_object_or_type_alignment (tree); 5462 extern unsigned int get_pointer_alignment_1 (tree, unsigned HOST_WIDE_INT *); 5463 extern unsigned int get_pointer_alignment (tree); 5464 extern tree fold_call_stmt (gimple, bool); 5465 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function); 5466 extern tree make_range (tree, int *, tree *, tree *, bool *); 5467 extern tree make_range_step (location_t, enum tree_code, tree, tree, tree, 5468 tree *, tree *, int *, bool *); 5469 extern tree build_range_check (location_t, tree, tree, int, tree, tree); 5470 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int, 5471 tree, tree); 5472 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec); 5473 extern bool is_simple_builtin (tree); 5474 extern bool is_inexpensive_builtin (tree); 5475 5476 /* In convert.c */ 5477 extern tree strip_float_extensions (tree); 5478 5479 /* In tree.c */ 5480 extern int really_constant_p (const_tree); 5481 extern bool decl_address_invariant_p (const_tree); 5482 extern bool decl_address_ip_invariant_p (const_tree); 5483 extern bool int_fits_type_p (const_tree, const_tree); 5484 #ifndef GENERATOR_FILE 5485 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t); 5486 #endif 5487 extern bool variably_modified_type_p (tree, tree); 5488 extern int tree_log2 (const_tree); 5489 extern int tree_floor_log2 (const_tree); 5490 extern int simple_cst_equal (const_tree, const_tree); 5491 extern hashval_t iterative_hash_expr (const_tree, hashval_t); 5492 extern hashval_t iterative_hash_exprs_commutative (const_tree, 5493 const_tree, hashval_t); 5494 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); 5495 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t); 5496 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t); 5497 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT); 5498 extern int type_list_equal (const_tree, const_tree); 5499 extern int chain_member (const_tree, const_tree); 5500 extern tree type_hash_lookup (unsigned int, tree); 5501 extern void type_hash_add (unsigned int, tree); 5502 extern int simple_cst_list_equal (const_tree, const_tree); 5503 extern void dump_tree_statistics (void); 5504 extern void recompute_tree_invariant_for_addr_expr (tree); 5505 extern bool needs_to_live_in_memory (const_tree); 5506 extern tree reconstruct_complex_type (tree, tree); 5507 5508 extern int real_onep (const_tree); 5509 extern int real_twop (const_tree); 5510 extern int real_minus_onep (const_tree); 5511 extern void init_ttree (void); 5512 extern void build_common_tree_nodes (bool, bool); 5513 extern void build_common_builtin_nodes (void); 5514 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int); 5515 extern tree build_range_type (tree, tree, tree); 5516 extern tree build_nonshared_range_type (tree, tree, tree); 5517 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *); 5518 extern HOST_WIDE_INT int_cst_value (const_tree); 5519 extern HOST_WIDEST_INT widest_int_cst_value (const_tree); 5520 5521 extern tree *tree_block (tree); 5522 extern location_t *block_nonartificial_location (tree); 5523 extern location_t tree_nonartificial_location (tree); 5524 5525 extern tree block_ultimate_origin (const_tree); 5526 5527 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree); 5528 5529 /* In tree-nested.c */ 5530 extern tree build_addr (tree, tree); 5531 5532 /* In function.c */ 5533 extern void expand_main_function (void); 5534 extern void expand_function_end (void); 5535 extern void expand_function_start (tree); 5536 extern void stack_protect_prologue (void); 5537 extern void stack_protect_epilogue (void); 5538 extern void init_dummy_function_start (void); 5539 extern void expand_dummy_function_end (void); 5540 extern unsigned int init_function_for_compilation (void); 5541 extern void allocate_struct_function (tree, bool); 5542 extern void push_struct_function (tree fndecl); 5543 extern void init_function_start (tree); 5544 extern bool use_register_for_decl (const_tree); 5545 extern void generate_setjmp_warnings (void); 5546 extern void init_temp_slots (void); 5547 extern void free_temp_slots (void); 5548 extern void pop_temp_slots (void); 5549 extern void push_temp_slots (void); 5550 extern void preserve_temp_slots (rtx); 5551 extern int aggregate_value_p (const_tree, const_tree); 5552 extern void push_function_context (void); 5553 extern void pop_function_context (void); 5554 extern gimple_seq gimplify_parameters (void); 5555 5556 /* In print-rtl.c */ 5557 #ifdef BUFSIZ 5558 extern void print_rtl (FILE *, const_rtx); 5559 #endif 5560 5561 /* In print-tree.c */ 5562 extern void debug_tree (tree); 5563 extern void debug_vec_tree (VEC(tree,gc) *); 5564 #ifdef BUFSIZ 5565 extern void dump_addr (FILE*, const char *, const void *); 5566 extern void print_node (FILE *, const char *, tree, int); 5567 extern void print_vec_tree (FILE *, const char *, VEC(tree,gc) *, int); 5568 extern void print_node_brief (FILE *, const char *, const_tree, int); 5569 extern void indent_to (FILE *, int); 5570 #endif 5571 5572 /* In tree-inline.c: */ 5573 extern bool debug_find_tree (tree, tree); 5574 /* This is in tree-inline.c since the routine uses 5575 data structures from the inliner. */ 5576 extern tree unsave_expr_now (tree); 5577 extern tree build_duplicate_type (tree); 5578 5579 /* In calls.c */ 5580 5581 /* Nonzero if this is a call to a function whose return value depends 5582 solely on its arguments, has no side effects, and does not read 5583 global memory. This corresponds to TREE_READONLY for function 5584 decls. */ 5585 #define ECF_CONST (1 << 0) 5586 /* Nonzero if this is a call to "pure" function (like const function, 5587 but may read memory. This corresponds to DECL_PURE_P for function 5588 decls. */ 5589 #define ECF_PURE (1 << 1) 5590 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no 5591 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P 5592 for function decls.*/ 5593 #define ECF_LOOPING_CONST_OR_PURE (1 << 2) 5594 /* Nonzero if this call will never return. */ 5595 #define ECF_NORETURN (1 << 3) 5596 /* Nonzero if this is a call to malloc or a related function. */ 5597 #define ECF_MALLOC (1 << 4) 5598 /* Nonzero if it is plausible that this is a call to alloca. */ 5599 #define ECF_MAY_BE_ALLOCA (1 << 5) 5600 /* Nonzero if this is a call to a function that won't throw an exception. */ 5601 #define ECF_NOTHROW (1 << 6) 5602 /* Nonzero if this is a call to setjmp or a related function. */ 5603 #define ECF_RETURNS_TWICE (1 << 7) 5604 /* Nonzero if this call replaces the current stack frame. */ 5605 #define ECF_SIBCALL (1 << 8) 5606 /* Function does not read or write memory (but may have side effects, so 5607 it does not necessarily fit ECF_CONST). */ 5608 #define ECF_NOVOPS (1 << 9) 5609 /* The function does not lead to calls within current function unit. */ 5610 #define ECF_LEAF (1 << 10) 5611 /* Nonzero if this call does not affect transactions. */ 5612 #define ECF_TM_PURE (1 << 11) 5613 /* Nonzero if this call is into the transaction runtime library. */ 5614 #define ECF_TM_BUILTIN (1 << 12) 5615 5616 extern int flags_from_decl_or_type (const_tree); 5617 extern int call_expr_flags (const_tree); 5618 5619 /* Call argument flags. */ 5620 5621 /* Nonzero if the argument is not dereferenced recursively, thus only 5622 directly reachable memory is read or written. */ 5623 #define EAF_DIRECT (1 << 0) 5624 /* Nonzero if memory reached by the argument is not clobbered. */ 5625 #define EAF_NOCLOBBER (1 << 1) 5626 /* Nonzero if the argument does not escape. */ 5627 #define EAF_NOESCAPE (1 << 2) 5628 /* Nonzero if the argument is not used by the function. */ 5629 #define EAF_UNUSED (1 << 3) 5630 5631 /* Call return flags. */ 5632 5633 /* Mask for the argument number that is returned. Lower two bits of 5634 the return flags, encodes argument slots zero to three. */ 5635 #define ERF_RETURN_ARG_MASK (3) 5636 /* Nonzero if the return value is equal to the argument number 5637 flags & ERF_RETURN_ARG_MASK. */ 5638 #define ERF_RETURNS_ARG (1 << 2) 5639 /* Nonzero if the return value does not alias with anything. Functions 5640 with the malloc attribute have this set on their return value. */ 5641 #define ERF_NOALIAS (1 << 3) 5642 5643 extern int setjmp_call_p (const_tree); 5644 extern bool gimple_alloca_call_p (const_gimple); 5645 extern bool alloca_call_p (const_tree); 5646 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree); 5647 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree); 5648 5649 /* In attribs.c. */ 5650 5651 extern const struct attribute_spec *lookup_attribute_spec (const_tree); 5652 5653 extern void init_attributes (void); 5654 5655 /* Process the attributes listed in ATTRIBUTES and install them in *NODE, 5656 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL, 5657 it should be modified in place; if a TYPE, a copy should be created 5658 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further 5659 information, in the form of a bitwise OR of flags in enum attribute_flags 5660 from tree.h. Depending on these flags, some attributes may be 5661 returned to be applied at a later stage (for example, to apply 5662 a decl attribute to the declaration rather than to its type). */ 5663 extern tree decl_attributes (tree *, tree, int); 5664 5665 extern void apply_tm_attr (tree, tree); 5666 5667 /* In integrate.c */ 5668 extern void set_decl_abstract_flags (tree, int); 5669 extern void set_decl_origin_self (tree); 5670 5671 /* In stor-layout.c */ 5672 extern void set_min_and_max_values_for_integral_type (tree, int, bool); 5673 extern void fixup_signed_type (tree); 5674 extern void internal_reference_types (void); 5675 extern unsigned int update_alignment_for_field (record_layout_info, tree, 5676 unsigned int); 5677 /* varasm.c */ 5678 extern tree tree_output_constant_def (tree); 5679 extern void make_decl_rtl (tree); 5680 extern rtx make_decl_rtl_for_debug (tree); 5681 extern void make_decl_one_only (tree, tree); 5682 extern int supports_one_only (void); 5683 extern void resolve_unique_section (tree, int, int); 5684 extern void mark_referenced (tree); 5685 extern void mark_decl_referenced (tree); 5686 extern void notice_global_symbol (tree); 5687 extern void set_user_assembler_name (tree, const char *); 5688 extern void process_pending_assemble_externals (void); 5689 extern void finish_aliases_1 (void); 5690 extern void finish_aliases_2 (void); 5691 extern void remove_unreachable_alias_pairs (void); 5692 extern bool decl_replaceable_p (tree); 5693 extern bool decl_binds_to_current_def_p (tree); 5694 5695 /* Derived type for use by compute_visible_aliases and callers. A symbol 5696 alias set is a pointer set into which we enter IDENTIFIER_NODES bearing 5697 the canonicalised assembler-level symbol names corresponding to decls 5698 and their aliases. */ 5699 typedef struct pointer_set_t symbol_alias_set_t; 5700 5701 extern void symbol_alias_set_destroy (symbol_alias_set_t *); 5702 extern int symbol_alias_set_contains (const symbol_alias_set_t *, tree); 5703 extern symbol_alias_set_t * propagate_aliases_backward (bool (*) 5704 (tree, tree, void *), 5705 void *); 5706 5707 /* In stmt.c */ 5708 extern void expand_computed_goto (tree); 5709 extern bool parse_output_constraint (const char **, int, int, int, 5710 bool *, bool *, bool *); 5711 extern bool parse_input_constraint (const char **, int, int, int, int, 5712 const char * const *, bool *, bool *); 5713 extern void expand_asm_stmt (gimple); 5714 extern tree resolve_asm_operand_names (tree, tree, tree, tree); 5715 extern bool expand_switch_using_bit_tests_p (tree, tree, unsigned int, 5716 unsigned int); 5717 extern void expand_case (gimple); 5718 extern void expand_decl (tree); 5719 #ifdef HARD_CONST 5720 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */ 5721 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *); 5722 #endif 5723 5724 5725 /* In tree-inline.c */ 5726 5727 /* The type of a set of already-visited pointers. Functions for creating 5728 and manipulating it are declared in pointer-set.h */ 5729 struct pointer_set_t; 5730 5731 /* The type of a callback function for walking over tree structure. */ 5732 5733 typedef tree (*walk_tree_fn) (tree *, int *, void *); 5734 5735 /* The type of a callback function that represents a custom walk_tree. */ 5736 5737 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *), 5738 void *, struct pointer_set_t*); 5739 5740 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*, 5741 walk_tree_lh); 5742 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*, 5743 walk_tree_lh); 5744 #define walk_tree(a,b,c,d) \ 5745 walk_tree_1 (a, b, c, d, NULL) 5746 #define walk_tree_without_duplicates(a,b,c) \ 5747 walk_tree_without_duplicates_1 (a, b, c, NULL) 5748 5749 /* In emit-rtl.c */ 5750 /* Assign the RTX to declaration. */ 5751 5752 extern void set_decl_rtl (tree, rtx); 5753 extern void set_decl_incoming_rtl (tree, rtx, bool); 5754 5755 /* Enum and arrays used for tree allocation stats. 5756 Keep in sync with tree.c:tree_node_kind_names. */ 5757 typedef enum 5758 { 5759 d_kind, 5760 t_kind, 5761 b_kind, 5762 s_kind, 5763 r_kind, 5764 e_kind, 5765 c_kind, 5766 id_kind, 5767 vec_kind, 5768 binfo_kind, 5769 ssa_name_kind, 5770 constr_kind, 5771 x_kind, 5772 lang_decl, 5773 lang_type, 5774 omp_clause_kind, 5775 all_kinds 5776 } tree_node_kind; 5777 5778 extern int tree_node_counts[]; 5779 extern int tree_node_sizes[]; 5780 5781 /* True if we are in gimple form and the actions of the folders need to 5782 be restricted. False if we are not in gimple form and folding is not 5783 restricted to creating gimple expressions. */ 5784 extern bool in_gimple_form; 5785 5786 /* In gimple.c. */ 5787 extern tree get_base_address (tree t); 5788 extern void mark_addressable (tree); 5789 5790 /* In tree.c. */ 5791 5792 struct GTY(()) tree_map_base { 5793 tree from; 5794 }; 5795 5796 extern int tree_map_base_eq (const void *, const void *); 5797 extern unsigned int tree_map_base_hash (const void *); 5798 extern int tree_map_base_marked_p (const void *); 5799 extern bool list_equal_p (const_tree, const_tree); 5800 5801 /* Map from a tree to another tree. */ 5802 5803 struct GTY(()) tree_map { 5804 struct tree_map_base base; 5805 unsigned int hash; 5806 tree to; 5807 }; 5808 5809 #define tree_map_eq tree_map_base_eq 5810 extern unsigned int tree_map_hash (const void *); 5811 #define tree_map_marked_p tree_map_base_marked_p 5812 5813 /* Map from a decl tree to another tree. */ 5814 5815 struct GTY(()) tree_decl_map { 5816 struct tree_map_base base; 5817 tree to; 5818 }; 5819 5820 #define tree_decl_map_eq tree_map_base_eq 5821 extern unsigned int tree_decl_map_hash (const void *); 5822 #define tree_decl_map_marked_p tree_map_base_marked_p 5823 5824 /* Map from a tree to an int. */ 5825 5826 struct GTY(()) tree_int_map { 5827 struct tree_map_base base; 5828 unsigned int to; 5829 }; 5830 5831 #define tree_int_map_eq tree_map_base_eq 5832 #define tree_int_map_hash tree_map_base_hash 5833 #define tree_int_map_marked_p tree_map_base_marked_p 5834 5835 /* Map from a tree to initialization/finalization priorities. */ 5836 5837 struct GTY(()) tree_priority_map { 5838 struct tree_map_base base; 5839 priority_type init; 5840 priority_type fini; 5841 }; 5842 5843 #define tree_priority_map_eq tree_map_base_eq 5844 #define tree_priority_map_hash tree_map_base_hash 5845 #define tree_priority_map_marked_p tree_map_base_marked_p 5846 5847 /* Map from a decl tree to a tree vector. */ 5848 5849 struct GTY(()) tree_vec_map { 5850 struct tree_map_base base; 5851 VEC(tree,gc) *to; 5852 }; 5853 5854 #define tree_vec_map_eq tree_map_base_eq 5855 #define tree_vec_map_hash tree_decl_map_hash 5856 #define tree_vec_map_marked_p tree_map_base_marked_p 5857 5858 /* In tree-ssa.c */ 5859 5860 tree target_for_debug_bind (tree); 5861 5862 /* In tree-ssa-address.c. */ 5863 extern tree tree_mem_ref_addr (tree, tree); 5864 extern void copy_mem_ref_info (tree, tree); 5865 extern void copy_ref_info (tree, tree); 5866 5867 /* In tree-vrp.c */ 5868 extern bool ssa_name_nonnegative_p (const_tree); 5869 5870 /* In tree-object-size.c. */ 5871 extern void init_object_sizes (void); 5872 extern void fini_object_sizes (void); 5873 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int); 5874 5875 /* In expr.c. */ 5876 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree); 5877 extern tree build_personality_function (const char *); 5878 5879 /* In trans-mem.c. */ 5880 extern tree build_tm_abort_call (location_t, bool); 5881 extern bool is_tm_safe (const_tree); 5882 extern bool is_tm_pure (const_tree); 5883 extern bool is_tm_may_cancel_outer (tree); 5884 extern bool is_tm_ending_fndecl (tree); 5885 extern void record_tm_replacement (tree, tree); 5886 extern void tm_malloc_replacement (tree); 5887 5888 static inline bool 5889 is_tm_safe_or_pure (const_tree x) 5890 { 5891 return is_tm_safe (x) || is_tm_pure (x); 5892 } 5893 5894 /* In tree-inline.c. */ 5895 5896 void init_inline_once (void); 5897 5898 /* Compute the number of operands in an expression node NODE. For 5899 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself, 5900 otherwise it is looked up from the node's code. */ 5901 static inline int 5902 tree_operand_length (const_tree node) 5903 { 5904 if (VL_EXP_CLASS_P (node)) 5905 return VL_EXP_OPERAND_LENGTH (node); 5906 else 5907 return TREE_CODE_LENGTH (TREE_CODE (node)); 5908 } 5909 5910 /* Abstract iterators for CALL_EXPRs. These static inline definitions 5911 have to go towards the end of tree.h so that union tree_node is fully 5912 defined by this point. */ 5913 5914 /* Structure containing iterator state. */ 5915 typedef struct call_expr_arg_iterator_d { 5916 tree t; /* the call_expr */ 5917 int n; /* argument count */ 5918 int i; /* next argument index */ 5919 } call_expr_arg_iterator; 5920 5921 typedef struct const_call_expr_arg_iterator_d { 5922 const_tree t; /* the call_expr */ 5923 int n; /* argument count */ 5924 int i; /* next argument index */ 5925 } const_call_expr_arg_iterator; 5926 5927 /* Initialize the abstract argument list iterator object ITER with the 5928 arguments from CALL_EXPR node EXP. */ 5929 static inline void 5930 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter) 5931 { 5932 iter->t = exp; 5933 iter->n = call_expr_nargs (exp); 5934 iter->i = 0; 5935 } 5936 5937 static inline void 5938 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter) 5939 { 5940 iter->t = exp; 5941 iter->n = call_expr_nargs (exp); 5942 iter->i = 0; 5943 } 5944 5945 /* Return the next argument from abstract argument list iterator object ITER, 5946 and advance its state. Return NULL_TREE if there are no more arguments. */ 5947 static inline tree 5948 next_call_expr_arg (call_expr_arg_iterator *iter) 5949 { 5950 tree result; 5951 if (iter->i >= iter->n) 5952 return NULL_TREE; 5953 result = CALL_EXPR_ARG (iter->t, iter->i); 5954 iter->i++; 5955 return result; 5956 } 5957 5958 static inline const_tree 5959 next_const_call_expr_arg (const_call_expr_arg_iterator *iter) 5960 { 5961 const_tree result; 5962 if (iter->i >= iter->n) 5963 return NULL_TREE; 5964 result = CALL_EXPR_ARG (iter->t, iter->i); 5965 iter->i++; 5966 return result; 5967 } 5968 5969 /* Initialize the abstract argument list iterator object ITER, then advance 5970 past and return the first argument. Useful in for expressions, e.g. 5971 for (arg = first_call_expr_arg (exp, &iter); arg; 5972 arg = next_call_expr_arg (&iter)) */ 5973 static inline tree 5974 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter) 5975 { 5976 init_call_expr_arg_iterator (exp, iter); 5977 return next_call_expr_arg (iter); 5978 } 5979 5980 static inline const_tree 5981 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter) 5982 { 5983 init_const_call_expr_arg_iterator (exp, iter); 5984 return next_const_call_expr_arg (iter); 5985 } 5986 5987 /* Test whether there are more arguments in abstract argument list iterator 5988 ITER, without changing its state. */ 5989 static inline bool 5990 more_call_expr_args_p (const call_expr_arg_iterator *iter) 5991 { 5992 return (iter->i < iter->n); 5993 } 5994 5995 static inline bool 5996 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter) 5997 { 5998 return (iter->i < iter->n); 5999 } 6000 6001 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER 6002 (of type call_expr_arg_iterator) to hold the iteration state. */ 6003 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \ 6004 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \ 6005 (arg) = next_call_expr_arg (&(iter))) 6006 6007 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \ 6008 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \ 6009 (arg) = next_const_call_expr_arg (&(iter))) 6010 6011 /* Return true if tree node T is a language-specific node. */ 6012 static inline bool 6013 is_lang_specific (tree t) 6014 { 6015 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES; 6016 } 6017 6018 /* In gimple-low.c. */ 6019 extern bool block_may_fallthru (const_tree); 6020 6021 6022 /* Functional interface to the builtin functions. */ 6023 6024 /* The builtin_info structure holds the FUNCTION_DECL of the standard builtin 6025 function, and a flag that says if the function is available implicitly, or 6026 whether the user has to code explicit calls to __builtin_<xxx>. */ 6027 6028 typedef struct GTY(()) builtin_info_type_d { 6029 tree decl[(int)END_BUILTINS]; 6030 bool implicit_p[(int)END_BUILTINS]; 6031 } builtin_info_type; 6032 6033 extern GTY(()) builtin_info_type builtin_info; 6034 6035 /* Valid builtin number. */ 6036 #define BUILTIN_VALID_P(FNCODE) \ 6037 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1)) 6038 6039 /* Return the tree node for an explicit standard builtin function or NULL. */ 6040 static inline tree 6041 builtin_decl_explicit (enum built_in_function fncode) 6042 { 6043 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 6044 6045 return builtin_info.decl[(size_t)fncode]; 6046 } 6047 6048 /* Return the tree node for an implicit builtin function or NULL. */ 6049 static inline tree 6050 builtin_decl_implicit (enum built_in_function fncode) 6051 { 6052 size_t uns_fncode = (size_t)fncode; 6053 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 6054 6055 if (!builtin_info.implicit_p[uns_fncode]) 6056 return NULL_TREE; 6057 6058 return builtin_info.decl[uns_fncode]; 6059 } 6060 6061 /* Set explicit builtin function nodes and whether it is an implicit 6062 function. */ 6063 6064 static inline void 6065 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p) 6066 { 6067 size_t ufncode = (size_t)fncode; 6068 6069 gcc_checking_assert (BUILTIN_VALID_P (fncode) 6070 && (decl != NULL_TREE || !implicit_p)); 6071 6072 builtin_info.decl[ufncode] = decl; 6073 builtin_info.implicit_p[ufncode] = implicit_p; 6074 } 6075 6076 /* Set the implicit flag for a builtin function. */ 6077 6078 static inline void 6079 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p) 6080 { 6081 size_t uns_fncode = (size_t)fncode; 6082 6083 gcc_checking_assert (BUILTIN_VALID_P (fncode) 6084 && builtin_info.decl[uns_fncode] != NULL_TREE); 6085 6086 builtin_info.implicit_p[uns_fncode] = implicit_p; 6087 } 6088 6089 /* Return whether the standard builtin function can be used as an explicit 6090 function. */ 6091 6092 static inline bool 6093 builtin_decl_explicit_p (enum built_in_function fncode) 6094 { 6095 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 6096 return (builtin_info.decl[(size_t)fncode] != NULL_TREE); 6097 } 6098 6099 /* Return whether the standard builtin function can be used implicitly. */ 6100 6101 static inline bool 6102 builtin_decl_implicit_p (enum built_in_function fncode) 6103 { 6104 size_t uns_fncode = (size_t)fncode; 6105 6106 gcc_checking_assert (BUILTIN_VALID_P (fncode)); 6107 return (builtin_info.decl[uns_fncode] != NULL_TREE 6108 && builtin_info.implicit_p[uns_fncode]); 6109 } 6110 6111 #endif /* GCC_TREE_H */ 6112