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