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