gcc/tree.h

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