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