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