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