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