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