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