gcc/tree.h

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