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