source: arduino-1-6-7/trunk/fuentes/arduino-ide-amd64/hardware/tools/avr/lib/gcc/avr/4.9.2/plugin/include/tree.h @ 4837

Last change on this file since 4837 was 4837, checked in by daduve, 2 years ago

Adding new version

File size: 184.4 KB
Line 
1/* Definitions for the ubiquitous 'tree' type for GNU compilers.
2   Copyright (C) 1989-2014 Free Software Foundation, Inc.
3
4This file is part of GCC.
5
6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
9version.
10
11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14for more details.
15
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3.  If not see
18<http://www.gnu.org/licenses/>.  */
19
20#ifndef GCC_TREE_H
21#define GCC_TREE_H
22
23#include "tree-core.h"
24
25/* These includes are required here because they provide declarations
26   used by inline functions in this file.
27
28   FIXME - Move these users elsewhere? */
29#include "fold-const.h"
30
31/* Macros for initializing `tree_contains_struct'.  */
32#define MARK_TS_BASE(C)                                 \
33  do {                                                  \
34    tree_contains_struct[C][TS_BASE] = 1;               \
35  } while (0)
36
37#define MARK_TS_TYPED(C)                                \
38  do {                                                  \
39    MARK_TS_BASE (C);                                   \
40    tree_contains_struct[C][TS_TYPED] = 1;              \
41  } while (0)
42
43#define MARK_TS_COMMON(C)                               \
44  do {                                                  \
45    MARK_TS_TYPED (C);                                  \
46    tree_contains_struct[C][TS_COMMON] = 1;             \
47  } while (0)
48
49#define MARK_TS_TYPE_COMMON(C)                          \
50  do {                                                  \
51    MARK_TS_COMMON (C);                                 \
52    tree_contains_struct[C][TS_TYPE_COMMON] = 1;        \
53  } while (0)
54
55#define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C)              \
56  do {                                                  \
57    MARK_TS_TYPE_COMMON (C);                            \
58    tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1;    \
59  } while (0)
60
61#define MARK_TS_DECL_MINIMAL(C)                         \
62  do {                                                  \
63    MARK_TS_COMMON (C);                                 \
64    tree_contains_struct[C][TS_DECL_MINIMAL] = 1;       \
65  } while (0)
66
67#define MARK_TS_DECL_COMMON(C)                          \
68  do {                                                  \
69    MARK_TS_DECL_MINIMAL (C);                           \
70    tree_contains_struct[C][TS_DECL_COMMON] = 1;        \
71  } while (0)
72
73#define MARK_TS_DECL_WRTL(C)                            \
74  do {                                                  \
75    MARK_TS_DECL_COMMON (C);                            \
76    tree_contains_struct[C][TS_DECL_WRTL] = 1;          \
77  } while (0)
78
79#define MARK_TS_DECL_WITH_VIS(C)                        \
80  do {                                                  \
81    MARK_TS_DECL_WRTL (C);                              \
82    tree_contains_struct[C][TS_DECL_WITH_VIS] = 1;      \
83  } while (0)
84
85#define MARK_TS_DECL_NON_COMMON(C)                      \
86  do {                                                  \
87    MARK_TS_DECL_WITH_VIS (C);                          \
88    tree_contains_struct[C][TS_DECL_NON_COMMON] = 1;    \
89  } while (0)
90
91
92/* Returns the string representing CLASS.  */
93
94#define TREE_CODE_CLASS_STRING(CLASS)\
95        tree_code_class_strings[(int) (CLASS)]
96
97#define TREE_CODE_CLASS(CODE)   tree_code_type[(int) (CODE)]
98
99/* Nonzero if NODE represents an exceptional code.  */
100
101#define EXCEPTIONAL_CLASS_P(NODE)\
102        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
103
104/* Nonzero if NODE represents a constant.  */
105
106#define CONSTANT_CLASS_P(NODE)\
107        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
108
109/* Nonzero if NODE represents a type.  */
110
111#define TYPE_P(NODE)\
112        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
113
114/* Nonzero if NODE represents a declaration.  */
115
116#define DECL_P(NODE)\
117        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
118
119/* True if NODE designates a variable declaration.  */
120#define VAR_P(NODE) \
121  (TREE_CODE (NODE) == VAR_DECL)
122
123/* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL.  */
124
125#define VAR_OR_FUNCTION_DECL_P(DECL)\
126  (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
127
128/* Nonzero if NODE represents a INDIRECT_REF.  Keep these checks in
129   ascending code order.  */
130
131#define INDIRECT_REF_P(NODE)\
132  (TREE_CODE (NODE) == INDIRECT_REF)
133
134/* Nonzero if NODE represents a reference.  */
135
136#define REFERENCE_CLASS_P(NODE)\
137        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
138
139/* Nonzero if NODE represents a comparison.  */
140
141#define COMPARISON_CLASS_P(NODE)\
142        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
143
144/* Nonzero if NODE represents a unary arithmetic expression.  */
145
146#define UNARY_CLASS_P(NODE)\
147        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
148
149/* Nonzero if NODE represents a binary arithmetic expression.  */
150
151#define BINARY_CLASS_P(NODE)\
152        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
153
154/* Nonzero if NODE represents a statement expression.  */
155
156#define STATEMENT_CLASS_P(NODE)\
157        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
158
159/* Nonzero if NODE represents a function call-like expression with a
160   variable-length operand vector.  */
161
162#define VL_EXP_CLASS_P(NODE)\
163        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
164
165/* Nonzero if NODE represents any other expression.  */
166
167#define EXPRESSION_CLASS_P(NODE)\
168        (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
169
170/* Returns nonzero iff NODE represents a type or declaration.  */
171
172#define IS_TYPE_OR_DECL_P(NODE)\
173        (TYPE_P (NODE) || DECL_P (NODE))
174
175/* Returns nonzero iff CLASS is the tree-code class of an
176   expression.  */
177
178#define IS_EXPR_CODE_CLASS(CLASS)\
179        ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
180
181/* Returns nonzero iff NODE is an expression of some kind.  */
182
183#define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
184
185#define TREE_CODE_LENGTH(CODE)  tree_code_length[(int) (CODE)]
186
187
188/* Helper macros for math builtins.  */
189
190#define BUILTIN_EXP10_P(FN) \
191 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
192  || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
193
194#define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
195  || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
196  || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
197
198#define BUILTIN_SQRT_P(FN) \
199 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
200
201#define BUILTIN_CBRT_P(FN) \
202 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
203
204#define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
205
206#define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
207#define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
208#define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
209
210/* Define accessors for the fields that all tree nodes have
211   (though some fields are not used for all kinds of nodes).  */
212
213/* The tree-code says what kind of node it is.
214   Codes are defined in tree.def.  */
215#define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
216#define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
217
218/* When checking is enabled, errors will be generated if a tree node
219   is accessed incorrectly. The macros die with a fatal error.  */
220#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
221
222#define TREE_CHECK(T, CODE) \
223(tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
224
225#define TREE_NOT_CHECK(T, CODE) \
226(tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
227
228#define TREE_CHECK2(T, CODE1, CODE2) \
229(tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
230
231#define TREE_NOT_CHECK2(T, CODE1, CODE2) \
232(tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
233
234#define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
235(tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
236
237#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
238(tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
239                               (CODE1), (CODE2), (CODE3)))
240
241#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
242(tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
243                           (CODE1), (CODE2), (CODE3), (CODE4)))
244
245#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
246(tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
247                               (CODE1), (CODE2), (CODE3), (CODE4)))
248
249#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
250(tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
251                           (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
252
253#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
254(tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
255                               (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
256
257#define CONTAINS_STRUCT_CHECK(T, STRUCT) \
258(contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
259
260#define TREE_CLASS_CHECK(T, CLASS) \
261(tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
262
263#define TREE_RANGE_CHECK(T, CODE1, CODE2) \
264(tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
265
266#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
267(omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
268
269#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
270(omp_clause_range_check ((T), (CODE1), (CODE2), \
271                                      __FILE__, __LINE__, __FUNCTION__))
272
273/* These checks have to be special cased.  */
274#define EXPR_CHECK(T) \
275(expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
276
277/* These checks have to be special cased.  */
278#define NON_TYPE_CHECK(T) \
279(non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
280
281#define TREE_VEC_ELT_CHECK(T, I) \
282(*(CONST_CAST2 (tree *, typeof (T)*, \
283     tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
284
285#define OMP_CLAUSE_ELT_CHECK(T, I) \
286(*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
287
288/* Special checks for TREE_OPERANDs.  */
289#define TREE_OPERAND_CHECK(T, I) \
290(*(CONST_CAST2 (tree*, typeof (T)*, \
291     tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
292
293#define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
294(*(tree_operand_check_code ((T), (CODE), (I), \
295                                         __FILE__, __LINE__, __FUNCTION__)))
296
297/* Nodes are chained together for many purposes.
298   Types are chained together to record them for being output to the debugger
299   (see the function `chain_type').
300   Decls in the same scope are chained together to record the contents
301   of the scope.
302   Statement nodes for successive statements used to be chained together.
303   Often lists of things are represented by TREE_LIST nodes that
304   are chained together.  */
305
306#define TREE_CHAIN(NODE) \
307(CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
308
309/* In all nodes that are expressions, this is the data type of the expression.
310   In POINTER_TYPE nodes, this is the type that the pointer points to.
311   In ARRAY_TYPE nodes, this is the type of the elements.
312   In VECTOR_TYPE nodes, this is the type of the elements.  */
313#define TREE_TYPE(NODE) \
314(CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
315
316extern void tree_contains_struct_check_failed (const_tree,
317                                               const enum tree_node_structure_enum,
318                                               const char *, int, const char *)
319  ATTRIBUTE_NORETURN;
320
321extern void tree_check_failed (const_tree, const char *, int, const char *,
322                               ...) ATTRIBUTE_NORETURN;
323extern void tree_not_check_failed (const_tree, const char *, int, const char *,
324                                   ...) ATTRIBUTE_NORETURN;
325extern void tree_class_check_failed (const_tree, const enum tree_code_class,
326                                     const char *, int, const char *)
327    ATTRIBUTE_NORETURN;
328extern void tree_range_check_failed (const_tree, const char *, int,
329                                     const char *, enum tree_code,
330                                     enum tree_code)
331    ATTRIBUTE_NORETURN;
332extern void tree_not_class_check_failed (const_tree,
333                                         const enum tree_code_class,
334                                         const char *, int, const char *)
335    ATTRIBUTE_NORETURN;
336extern void tree_vec_elt_check_failed (int, int, const char *,
337                                       int, const char *)
338    ATTRIBUTE_NORETURN;
339extern void phi_node_elt_check_failed (int, int, const char *,
340                                       int, const char *)
341    ATTRIBUTE_NORETURN;
342extern void tree_operand_check_failed (int, const_tree,
343                                       const char *, int, const char *)
344    ATTRIBUTE_NORETURN;
345extern void omp_clause_check_failed (const_tree, const char *, int,
346                                     const char *, enum omp_clause_code)
347    ATTRIBUTE_NORETURN;
348extern void omp_clause_operand_check_failed (int, const_tree, const char *,
349                                             int, const char *)
350    ATTRIBUTE_NORETURN;
351extern void omp_clause_range_check_failed (const_tree, const char *, int,
352                               const char *, enum omp_clause_code,
353                               enum omp_clause_code)
354    ATTRIBUTE_NORETURN;
355
356#else /* not ENABLE_TREE_CHECKING, or not gcc */
357
358#define CONTAINS_STRUCT_CHECK(T, ENUM)          (T)
359#define TREE_CHECK(T, CODE)                     (T)
360#define TREE_NOT_CHECK(T, CODE)                 (T)
361#define TREE_CHECK2(T, CODE1, CODE2)            (T)
362#define TREE_NOT_CHECK2(T, CODE1, CODE2)        (T)
363#define TREE_CHECK3(T, CODE1, CODE2, CODE3)     (T)
364#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
365#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
366#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
367#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
368#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
369#define TREE_CLASS_CHECK(T, CODE)               (T)
370#define TREE_RANGE_CHECK(T, CODE1, CODE2)       (T)
371#define EXPR_CHECK(T)                           (T)
372#define NON_TYPE_CHECK(T)                       (T)
373#define TREE_VEC_ELT_CHECK(T, I)                ((T)->vec.a[I])
374#define TREE_OPERAND_CHECK(T, I)                ((T)->exp.operands[I])
375#define TREE_OPERAND_CHECK_CODE(T, CODE, I)     ((T)->exp.operands[I])
376#define OMP_CLAUSE_ELT_CHECK(T, i)              ((T)->omp_clause.ops[i])
377#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
378#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE)       (T)
379
380#define TREE_CHAIN(NODE) ((NODE)->common.chain)
381#define TREE_TYPE(NODE) ((NODE)->typed.type)
382
383#endif
384
385#define TREE_BLOCK(NODE)                (tree_block (NODE))
386#define TREE_SET_BLOCK(T, B)            (tree_set_block ((T), (B)))
387
388#include "tree-check.h"
389
390#define TYPE_CHECK(T)           TREE_CLASS_CHECK (T, tcc_type)
391#define DECL_MINIMAL_CHECK(T)   CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
392#define DECL_COMMON_CHECK(T)    CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
393#define DECL_WRTL_CHECK(T)      CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
394#define DECL_WITH_VIS_CHECK(T)  CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
395#define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
396#define CST_CHECK(T)            TREE_CLASS_CHECK (T, tcc_constant)
397#define STMT_CHECK(T)           TREE_CLASS_CHECK (T, tcc_statement)
398#define VL_EXP_CHECK(T)         TREE_CLASS_CHECK (T, tcc_vl_exp)
399#define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
400#define PTR_OR_REF_CHECK(T)     TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
401
402#define RECORD_OR_UNION_CHECK(T)        \
403  TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
404#define NOT_RECORD_OR_UNION_CHECK(T) \
405  TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
406
407#define NUMERICAL_TYPE_CHECK(T)                                 \
408  TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
409               FIXED_POINT_TYPE)
410
411/* Here is how primitive or already-canonicalized types' hash codes
412   are made.  */
413#define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
414
415/* A simple hash function for an arbitrary tree node.  This must not be
416   used in hash tables which are saved to a PCH.  */
417#define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
418
419/* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR).  */
420#define CONVERT_EXPR_CODE_P(CODE)                               \
421  ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
422
423/* Similarly, but accept an expressions instead of a tree code.  */
424#define CONVERT_EXPR_P(EXP)     CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
425
426/* Generate case for NOP_EXPR, CONVERT_EXPR.  */
427
428#define CASE_CONVERT                                            \
429  case NOP_EXPR:                                                \
430  case CONVERT_EXPR
431
432/* Given an expression as a tree, strip any conversion that generates
433   no instruction.  Accepts both tree and const_tree arguments since
434   we are not modifying the tree itself.  */
435
436#define STRIP_NOPS(EXP) \
437  (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
438
439/* Like STRIP_NOPS, but don't let the signedness change either.  */
440
441#define STRIP_SIGN_NOPS(EXP) \
442  (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
443
444/* Like STRIP_NOPS, but don't alter the TREE_TYPE either.  */
445
446#define STRIP_TYPE_NOPS(EXP) \
447  while ((CONVERT_EXPR_P (EXP)                                  \
448          || TREE_CODE (EXP) == NON_LVALUE_EXPR)                \
449         && TREE_OPERAND (EXP, 0) != error_mark_node            \
450         && (TREE_TYPE (EXP)                                    \
451             == TREE_TYPE (TREE_OPERAND (EXP, 0))))             \
452    (EXP) = TREE_OPERAND (EXP, 0)
453
454/* Remove unnecessary type conversions according to
455   tree_ssa_useless_type_conversion.  */
456
457#define STRIP_USELESS_TYPE_CONVERSION(EXP) \
458  (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
459
460/* Nonzero if TYPE represents a vector type.  */
461
462#define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
463
464/* Nonzero if TYPE represents an integral type.  Note that we do not
465   include COMPLEX types here.  Keep these checks in ascending code
466   order.  */
467
468#define INTEGRAL_TYPE_P(TYPE)  \
469  (TREE_CODE (TYPE) == ENUMERAL_TYPE  \
470   || TREE_CODE (TYPE) == BOOLEAN_TYPE \
471   || TREE_CODE (TYPE) == INTEGER_TYPE)
472
473/* Nonzero if TYPE represents a non-saturating fixed-point type.  */
474
475#define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
476  (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
477
478/* Nonzero if TYPE represents a saturating fixed-point type.  */
479
480#define SAT_FIXED_POINT_TYPE_P(TYPE) \
481  (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
482
483/* Nonzero if TYPE represents a fixed-point type.  */
484
485#define FIXED_POINT_TYPE_P(TYPE)        (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
486
487/* Nonzero if TYPE represents a scalar floating-point type.  */
488
489#define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
490
491/* Nonzero if TYPE represents a complex floating-point type.  */
492
493#define COMPLEX_FLOAT_TYPE_P(TYPE)      \
494  (TREE_CODE (TYPE) == COMPLEX_TYPE     \
495   && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
496
497/* Nonzero if TYPE represents a vector integer type.  */
498               
499#define VECTOR_INTEGER_TYPE_P(TYPE)                     \
500  (VECTOR_TYPE_P (TYPE)                                 \
501   && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
502
503
504/* Nonzero if TYPE represents a vector floating-point type.  */
505
506#define VECTOR_FLOAT_TYPE_P(TYPE)       \
507  (VECTOR_TYPE_P (TYPE)                 \
508   && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
509
510/* Nonzero if TYPE represents a floating-point type, including complex
511   and vector floating-point types.  The vector and complex check does
512   not use the previous two macros to enable early folding.  */
513
514#define FLOAT_TYPE_P(TYPE)                      \
515  (SCALAR_FLOAT_TYPE_P (TYPE)                   \
516   || ((TREE_CODE (TYPE) == COMPLEX_TYPE        \
517        || VECTOR_TYPE_P (TYPE))                \
518       && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
519
520/* Nonzero if TYPE represents a decimal floating-point type.  */
521#define DECIMAL_FLOAT_TYPE_P(TYPE)              \
522  (SCALAR_FLOAT_TYPE_P (TYPE)                   \
523   && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
524
525/* Nonzero if TYPE is a record or union type.  */
526#define RECORD_OR_UNION_TYPE_P(TYPE)            \
527  (TREE_CODE (TYPE) == RECORD_TYPE              \
528   || TREE_CODE (TYPE) == UNION_TYPE            \
529   || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
530
531/* Nonzero if TYPE represents an aggregate (multi-component) type.
532   Keep these checks in ascending code order.  */
533
534#define AGGREGATE_TYPE_P(TYPE) \
535  (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
536
537/* Nonzero if TYPE represents a pointer or reference type.
538   (It should be renamed to INDIRECT_TYPE_P.)  Keep these checks in
539   ascending code order.  */
540
541#define POINTER_TYPE_P(TYPE) \
542  (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
543
544/* Nonzero if TYPE represents a pointer to function.  */
545#define FUNCTION_POINTER_TYPE_P(TYPE) \
546  (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
547
548/* Nonzero if this type is a complete type.  */
549#define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
550
551/* Nonzero if this type is the (possibly qualified) void type.  */
552#define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
553
554/* Nonzero if this type is complete or is cv void.  */
555#define COMPLETE_OR_VOID_TYPE_P(NODE) \
556  (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
557
558/* Nonzero if this type is complete or is an array with unspecified bound.  */
559#define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
560  (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
561
562/* Define many boolean fields that all tree nodes have.  */
563
564/* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
565   of this is needed.  So it cannot be in a register.
566   In a FUNCTION_DECL it has no meaning.
567   In LABEL_DECL nodes, it means a goto for this label has been seen
568   from a place outside all binding contours that restore stack levels.
569   In an artificial SSA_NAME that points to a stack partition with at least
570   two variables, it means that at least one variable has TREE_ADDRESSABLE.
571   In ..._TYPE nodes, it means that objects of this type must be fully
572   addressable.  This means that pieces of this object cannot go into
573   register parameters, for example.  If this a function type, this
574   means that the value must be returned in memory.
575   In CONSTRUCTOR nodes, it means object constructed must be in memory.
576   In IDENTIFIER_NODEs, this means that some extern decl for this name
577   had its address taken.  That matters for inline functions.
578   In a STMT_EXPR, it means we want the result of the enclosed expression.  */
579#define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
580
581/* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
582   exit of a function.  Calls for which this is true are candidates for tail
583   call optimizations.  */
584#define CALL_EXPR_TAILCALL(NODE) \
585  (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
586
587/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
588   CASE_LOW operand has been processed.  */
589#define CASE_LOW_SEEN(NODE) \
590  (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
591
592#define PREDICT_EXPR_OUTCOME(NODE) \
593  ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
594#define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
595  (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
596#define PREDICT_EXPR_PREDICTOR(NODE) \
597  ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
598
599/* In a VAR_DECL, nonzero means allocate static storage.
600   In a FUNCTION_DECL, nonzero if function has been defined.
601   In a CONSTRUCTOR, nonzero means allocate static storage.  */
602#define TREE_STATIC(NODE) ((NODE)->base.static_flag)
603
604/* In an ADDR_EXPR, nonzero means do not use a trampoline.  */
605#define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
606
607/* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
608   should only be executed if an exception is thrown, not on normal exit
609   of its scope.  */
610#define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
611
612/* In a TRY_CATCH_EXPR, means that the handler should be considered a
613   separate cleanup in honor_protect_cleanup_actions.  */
614#define TRY_CATCH_IS_CLEANUP(NODE) \
615  (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
616
617/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
618   CASE_HIGH operand has been processed.  */
619#define CASE_HIGH_SEEN(NODE) \
620  (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
621
622/* Used to mark scoped enums.  */
623#define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
624
625/* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
626#define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
627
628/* In an expr node (usually a conversion) this means the node was made
629   implicitly and should not lead to any sort of warning.  In a decl node,
630   warnings concerning the decl should be suppressed.  This is used at
631   least for used-before-set warnings, and it set after one warning is
632   emitted.  */
633#define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
634
635/* Used to indicate that this TYPE represents a compiler-generated entity.  */
636#define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
637
638/* In an IDENTIFIER_NODE, this means that assemble_name was called with
639   this string as an argument.  */
640#define TREE_SYMBOL_REFERENCED(NODE) \
641  (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
642
643/* Nonzero in a pointer or reference type means the data pointed to
644   by this type can alias anything.  */
645#define TYPE_REF_CAN_ALIAS_ALL(NODE) \
646  (PTR_OR_REF_CHECK (NODE)->base.static_flag)
647
648/* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
649   there was an overflow in folding.  */
650
651#define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
652
653/* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P.  */
654
655#define TREE_OVERFLOW_P(EXPR) \
656 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
657
658/* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
659   nonzero means name is to be accessible from outside this translation unit.
660   In an IDENTIFIER_NODE, nonzero means an external declaration
661   accessible from outside this translation unit was previously seen
662   for this name in an inner scope.  */
663#define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
664
665/* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
666   of cached values, or is something else.  */
667#define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
668
669/* In a SAVE_EXPR, indicates that the original expression has already
670   been substituted with a VAR_DECL that contains the value.  */
671#define SAVE_EXPR_RESOLVED_P(NODE) \
672  (SAVE_EXPR_CHECK (NODE)->base.public_flag)
673
674/* Set on a CALL_EXPR if this stdarg call should be passed the argument
675   pack.  */
676#define CALL_EXPR_VA_ARG_PACK(NODE) \
677  (CALL_EXPR_CHECK (NODE)->base.public_flag)
678
679/* In any expression, decl, or constant, nonzero means it has side effects or
680   reevaluation of the whole expression could produce a different value.
681   This is set if any subexpression is a function call, a side effect or a
682   reference to a volatile variable.  In a ..._DECL, this is set only if the
683   declaration said `volatile'.  This will never be set for a constant.  */
684#define TREE_SIDE_EFFECTS(NODE) \
685  (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
686
687/* In a LABEL_DECL, nonzero means this label had its address taken
688   and therefore can never be deleted and is a jump target for
689   computed gotos.  */
690#define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
691
692/* Nonzero means this expression is volatile in the C sense:
693   its address should be of type `volatile WHATEVER *'.
694   In other words, the declared item is volatile qualified.
695   This is used in _DECL nodes and _REF nodes.
696   On a FUNCTION_DECL node, this means the function does not
697   return normally.  This is the same effect as setting
698   the attribute noreturn on the function in C.
699
700   In a ..._TYPE node, means this type is volatile-qualified.
701   But use TYPE_VOLATILE instead of this macro when the node is a type,
702   because eventually we may make that a different bit.
703
704   If this bit is set in an expression, so is TREE_SIDE_EFFECTS.  */
705#define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
706
707/* Nonzero means this node will not trap.  In an INDIRECT_REF, means
708   accessing the memory pointed to won't generate a trap.  However,
709   this only applies to an object when used appropriately: it doesn't
710   mean that writing a READONLY mem won't trap.
711
712   In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
713   (or slice of the array) always belongs to the range of the array.
714   I.e. that the access will not trap, provided that the access to
715   the base to the array will not trap.  */
716#define TREE_THIS_NOTRAP(NODE) \
717  (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
718                ARRAY_RANGE_REF)->base.nothrow_flag)
719
720/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
721   nonzero means it may not be the lhs of an assignment.
722   Nonzero in a FUNCTION_DECL means this function should be treated
723   as "const" function (can only read its arguments).  */
724#define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
725
726/* Value of expression is constant.  Always on in all ..._CST nodes.  May
727   also appear in an expression or decl where the value is constant.  */
728#define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
729
730/* Nonzero if NODE, a type, has had its sizes gimplified.  */
731#define TYPE_SIZES_GIMPLIFIED(NODE) \
732  (TYPE_CHECK (NODE)->base.constant_flag)
733
734/* In a decl (most significantly a FIELD_DECL), means an unsigned field.  */
735#define DECL_UNSIGNED(NODE) \
736  (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
737
738/* In integral and pointer types, means an unsigned type.  */
739#define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
740
741/* True if overflow wraps around for the given integral type.  That
742   is, TYPE_MAX + 1 == TYPE_MIN.  */
743#define TYPE_OVERFLOW_WRAPS(TYPE) \
744  (TYPE_UNSIGNED (TYPE) || flag_wrapv)
745
746/* True if overflow is undefined for the given integral type.  We may
747   optimize on the assumption that values in the type never overflow.
748
749   IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
750   must issue a warning based on warn_strict_overflow.  In some cases
751   it will be appropriate to issue the warning immediately, and in
752   other cases it will be appropriate to simply set a flag and let the
753   caller decide whether a warning is appropriate or not.  */
754#define TYPE_OVERFLOW_UNDEFINED(TYPE) \
755  (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
756
757/* True if overflow for the given integral type should issue a
758   trap.  */
759#define TYPE_OVERFLOW_TRAPS(TYPE) \
760  (!TYPE_UNSIGNED (TYPE) && flag_trapv)
761
762/* True if pointer types have undefined overflow.  */
763#define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
764
765/* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
766   Nonzero in a FUNCTION_DECL means that the function has been compiled.
767   This is interesting in an inline function, since it might not need
768   to be compiled separately.
769   Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
770   or TYPE_DECL if the debugging info for the type has been written.
771   In a BLOCK node, nonzero if reorder_blocks has already seen this block.
772   In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
773   PHI node.  */
774#define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
775
776/* Nonzero in a _DECL if the name is used in its scope.
777   Nonzero in an expr node means inhibit warning if value is unused.
778   In IDENTIFIER_NODEs, this means that some extern decl for this name
779   was used.
780   In a BLOCK, this means that the block contains variables that are used.  */
781#define TREE_USED(NODE) ((NODE)->base.used_flag)
782
783/* In a FUNCTION_DECL, nonzero means a call to the function cannot
784   throw an exception.  In a CALL_EXPR, nonzero means the call cannot
785   throw.  We can't easily check the node type here as the C++
786   frontend also uses this flag (for AGGR_INIT_EXPR).  */
787#define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
788
789/* In a CALL_EXPR, means that it's safe to use the target of the call
790   expansion as the return slot for a call that returns in memory.  */
791#define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
792  (CALL_EXPR_CHECK (NODE)->base.private_flag)
793
794/* Cilk keywords accessors.  */
795#define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
796
797/* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
798   passed by invisible reference (and the TREE_TYPE is a pointer to the true
799   type).  */
800#define DECL_BY_REFERENCE(NODE) \
801  (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
802                RESULT_DECL)->decl_common.decl_by_reference_flag)
803
804/* In VAR_DECL and PARM_DECL, set when the decl has been used except for
805   being set.  */
806#define DECL_READ_P(NODE) \
807  (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
808
809/* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
810   attempting to share the stack slot with some other variable.  */
811#define DECL_NONSHAREABLE(NODE) \
812  (TREE_CHECK2 (NODE, VAR_DECL, \
813                RESULT_DECL)->decl_common.decl_nonshareable_flag)
814
815/* In a CALL_EXPR, means that the call is the jump from a thunk to the
816   thunked-to function.  */
817#define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
818
819/* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
820   it has been built for the declaration of a variable-sized object.  */
821#define CALL_ALLOCA_FOR_VAR_P(NODE) \
822  (CALL_EXPR_CHECK (NODE)->base.protected_flag)
823
824/* In a type, nonzero means that all objects of the type are guaranteed by the
825   language or front-end to be properly aligned, so we can indicate that a MEM
826   of this type is aligned at least to the alignment of the type, even if it
827   doesn't appear that it is.  We see this, for example, in object-oriented
828   languages where a tag field may show this is an object of a more-aligned
829   variant of the more generic type.
830
831   In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
832   freelist.  */
833#define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
834
835/* Used in classes in C++.  */
836#define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
837/* Used in classes in C++. */
838#define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
839
840/* True if reference type NODE is a C++ rvalue reference.  */
841#define TYPE_REF_IS_RVALUE(NODE) \
842  (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
843
844/* Nonzero in a _DECL if the use of the name is defined as a
845   deprecated feature by __attribute__((deprecated)).  */
846#define TREE_DEPRECATED(NODE) \
847  ((NODE)->base.deprecated_flag)
848
849/* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
850   uses are to be substituted for uses of the TREE_CHAINed identifier.  */
851#define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
852  (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
853
854/* In fixed-point types, means a saturating type.  */
855#define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
856
857/* These flags are available for each language front end to use internally.  */
858#define TREE_LANG_FLAG_0(NODE) \
859  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
860#define TREE_LANG_FLAG_1(NODE) \
861  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
862#define TREE_LANG_FLAG_2(NODE) \
863  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
864#define TREE_LANG_FLAG_3(NODE) \
865  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
866#define TREE_LANG_FLAG_4(NODE) \
867  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
868#define TREE_LANG_FLAG_5(NODE) \
869  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
870#define TREE_LANG_FLAG_6(NODE) \
871  (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
872
873/* Define additional fields and accessors for nodes representing constants.  */
874
875/* In an INTEGER_CST node.  These two together make a 2-word integer.
876   If the data type is signed, the value is sign-extended to 2 words
877   even though not all of them may really be in use.
878   In an unsigned constant shorter than 2 words, the extra bits are 0.  */
879#define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
880#define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
881#define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
882
883#define INT_CST_LT(A, B)                                \
884  (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B)        \
885   || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B)   \
886       && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
887
888#define INT_CST_LT_UNSIGNED(A, B)                               \
889  (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A)              \
890    < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B))           \
891   || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A)          \
892        == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B))      \
893       && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
894
895#define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
896#define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
897
898#define TREE_FIXED_CST_PTR(NODE) \
899  (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
900#define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
901
902/* In a STRING_CST */
903/* In C terms, this is sizeof, not strlen.  */
904#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
905#define TREE_STRING_POINTER(NODE) \
906  ((const char *)(STRING_CST_CHECK (NODE)->string.str))
907
908/* In a COMPLEX_CST node.  */
909#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
910#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
911
912/* In a VECTOR_CST node.  */
913#define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
914#define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
915#define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
916
917/* Define fields and accessors for some special-purpose tree nodes.  */
918
919#define IDENTIFIER_LENGTH(NODE) \
920  (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
921#define IDENTIFIER_POINTER(NODE) \
922  ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
923#define IDENTIFIER_HASH_VALUE(NODE) \
924  (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
925
926/* Translate a hash table identifier pointer to a tree_identifier
927   pointer, and vice versa.  */
928
929#define HT_IDENT_TO_GCC_IDENT(NODE) \
930  ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
931#define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
932
933/* In a TREE_LIST node.  */
934#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
935#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
936
937/* In a TREE_VEC node.  */
938#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
939#define TREE_VEC_END(NODE) \
940  ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
941
942#define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
943
944/* In a CONSTRUCTOR node.  */
945#define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
946#define CONSTRUCTOR_ELT(NODE,IDX) \
947  (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
948#define CONSTRUCTOR_NELTS(NODE) \
949  (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
950#define CONSTRUCTOR_NO_CLEARING(NODE) \
951  (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
952
953/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
954   value of each element (stored within VAL). IX must be a scratch variable
955   of unsigned integer type.  */
956#define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
957  for (IX = 0; (IX >= vec_safe_length (V)) \
958               ? false \
959               : ((VAL = (*(V))[IX].value), \
960               true); \
961       (IX)++)
962
963/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
964   the value of each element (stored within VAL) and its index (stored
965   within INDEX). IX must be a scratch variable of unsigned integer type.  */
966#define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
967  for (IX = 0; (IX >= vec_safe_length (V)) \
968               ? false \
969               : (((void) (VAL = (*V)[IX].value)), \
970                  (INDEX = (*V)[IX].index), \
971                  true); \
972       (IX)++)
973
974/* Append a new constructor element to V, with the specified INDEX and VAL.  */
975#define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
976  do { \
977    constructor_elt _ce___ = {INDEX, VALUE}; \
978    vec_safe_push ((V), _ce___); \
979  } while (0)
980
981/* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
982   constructor output purposes.  */
983#define CONSTRUCTOR_BITFIELD_P(NODE) \
984  (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
985
986/* True if NODE is a clobber right hand side, an expression of indeterminate
987   value that clobbers the LHS in a copy instruction.  We use a volatile
988   empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
989   In particular the volatile flag causes us to not prematurely remove
990   such clobber instructions.  */
991#define TREE_CLOBBER_P(NODE) \
992  (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
993
994/* Define fields and accessors for some nodes that represent expressions.  */
995
996/* Nonzero if NODE is an empty statement (NOP_EXPR <0>).  */
997#define IS_EMPTY_STMT(NODE)     (TREE_CODE (NODE) == NOP_EXPR \
998                                 && VOID_TYPE_P (TREE_TYPE (NODE)) \
999                                 && integer_zerop (TREE_OPERAND (NODE, 0)))
1000
1001/* In ordinary expression nodes.  */
1002#define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1003#define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1004
1005/* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1006   length.  Its value includes the length operand itself; that is,
1007   the minimum valid length is 1.
1008   Note that we have to bypass the use of TREE_OPERAND to access
1009   that field to avoid infinite recursion in expanding the macros.  */
1010#define VL_EXP_OPERAND_LENGTH(NODE) \
1011  ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1012
1013/* Nonzero if is_gimple_debug() may possibly hold.  */
1014#define MAY_HAVE_DEBUG_STMTS    (flag_var_tracking_assignments)
1015
1016/* In a LOOP_EXPR node.  */
1017#define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1018
1019/* The source location of this expression.  Non-tree_exp nodes such as
1020   decls and constants can be shared among multiple locations, so
1021   return nothing.  */
1022#define EXPR_LOCATION(NODE) \
1023  (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1024#define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1025#define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE))  \
1026  != UNKNOWN_LOCATION)
1027/* The location to be used in a diagnostic about this expression.  Do not
1028   use this macro if the location will be assigned to other expressions.  */
1029#define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1030                                      ? (NODE)->exp.locus : (LOCUS))
1031#define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1032#define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1033
1034/* True if a tree is an expression or statement that can have a
1035   location.  */
1036#define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1037
1038extern void protected_set_expr_location (tree, location_t);
1039
1040/* In a TARGET_EXPR node.  */
1041#define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1042#define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1043#define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1044
1045/* DECL_EXPR accessor. This gives access to the DECL associated with
1046   the given declaration statement.  */
1047#define DECL_EXPR_DECL(NODE)    TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1048
1049#define EXIT_EXPR_COND(NODE)         TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1050
1051/* COMPOUND_LITERAL_EXPR accessors.  */
1052#define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE)           \
1053  TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1054#define COMPOUND_LITERAL_EXPR_DECL(NODE)                        \
1055  DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1056
1057/* SWITCH_EXPR accessors. These give access to the condition, body and
1058   original condition type (before any compiler conversions)
1059   of the switch statement, respectively.  */
1060#define SWITCH_COND(NODE)       TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1061#define SWITCH_BODY(NODE)       TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1062#define SWITCH_LABELS(NODE)     TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1063
1064/* CASE_LABEL_EXPR accessors. These give access to the high and low values
1065   of a case label, respectively.  */
1066#define CASE_LOW(NODE)                  TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1067#define CASE_HIGH(NODE)                 TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1068#define CASE_LABEL(NODE)                TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1069#define CASE_CHAIN(NODE)                TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1070
1071/* The operands of a TARGET_MEM_REF.  Operands 0 and 1 have to match
1072   corresponding MEM_REF operands.  */
1073#define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1074#define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1075#define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1076#define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1077#define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1078
1079/* The operands of a BIND_EXPR.  */
1080#define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1081#define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1082#define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1083
1084/* GOTO_EXPR accessor. This gives access to the label associated with
1085   a goto statement.  */
1086#define GOTO_DESTINATION(NODE)  TREE_OPERAND ((NODE), 0)
1087
1088/* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1089   instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1090   ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1091   statement.  */
1092#define ASM_STRING(NODE)        TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1093#define ASM_OUTPUTS(NODE)       TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1094#define ASM_INPUTS(NODE)        TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1095#define ASM_CLOBBERS(NODE)      TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1096#define ASM_LABELS(NODE)        TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1097/* Nonzero if we want to create an ASM_INPUT instead of an
1098   ASM_OPERAND with no operands.  */
1099#define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1100#define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1101
1102/* COND_EXPR accessors.  */
1103#define COND_EXPR_COND(NODE)    (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1104#define COND_EXPR_THEN(NODE)    (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1105#define COND_EXPR_ELSE(NODE)    (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1106
1107/* Accessors for the chains of recurrences.  */
1108#define CHREC_VAR(NODE)           TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1109#define CHREC_LEFT(NODE)          TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1110#define CHREC_RIGHT(NODE)         TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1111#define CHREC_VARIABLE(NODE)      TREE_INT_CST_LOW (CHREC_VAR (NODE))
1112
1113/* LABEL_EXPR accessor. This gives access to the label associated with
1114   the given label expression.  */
1115#define LABEL_EXPR_LABEL(NODE)  TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1116
1117/* CATCH_EXPR accessors.  */
1118#define CATCH_TYPES(NODE)       TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1119#define CATCH_BODY(NODE)        TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1120
1121/* EH_FILTER_EXPR accessors.  */
1122#define EH_FILTER_TYPES(NODE)   TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1123#define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1124
1125/* OBJ_TYPE_REF accessors.  */
1126#define OBJ_TYPE_REF_EXPR(NODE)   TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1127#define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1128#define OBJ_TYPE_REF_TOKEN(NODE)  TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1129
1130/* ASSERT_EXPR accessors.  */
1131#define ASSERT_EXPR_VAR(NODE)   TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1132#define ASSERT_EXPR_COND(NODE)  TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1133
1134/* CALL_EXPR accessors.
1135 */
1136#define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1137#define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1138#define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1139#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1140
1141/* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1142   We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1143   the argument count is zero when checking is enabled.  Instead, do
1144   the pointer arithmetic to advance past the 3 fixed operands in a
1145   CALL_EXPR.  That produces a valid pointer to just past the end of the
1146   operand array, even if it's not valid to dereference it.  */
1147#define CALL_EXPR_ARGP(NODE) \
1148  (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1149
1150/* TM directives and accessors.  */
1151#define TRANSACTION_EXPR_BODY(NODE) \
1152  TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1153#define TRANSACTION_EXPR_OUTER(NODE) \
1154  (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1155#define TRANSACTION_EXPR_RELAXED(NODE) \
1156  (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1157
1158/* OpenMP directive and clause accessors.  */
1159
1160#define OMP_BODY(NODE) \
1161  TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1162#define OMP_CLAUSES(NODE) \
1163  TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1164
1165#define OMP_PARALLEL_BODY(NODE)    TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1166#define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1167
1168#define OMP_TASK_BODY(NODE)        TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1169#define OMP_TASK_CLAUSES(NODE)     TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1170
1171#define OMP_TASKREG_CHECK(NODE)   TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1172#define OMP_TASKREG_BODY(NODE)    TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1173#define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1174
1175#define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1176#define OMP_FOR_BODY(NODE)         TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1177#define OMP_FOR_CLAUSES(NODE)      TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1178#define OMP_FOR_INIT(NODE)         TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1179#define OMP_FOR_COND(NODE)         TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1180#define OMP_FOR_INCR(NODE)         TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1181#define OMP_FOR_PRE_BODY(NODE)     TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1182
1183#define OMP_SECTIONS_BODY(NODE)    TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1184#define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1185
1186#define OMP_SECTION_BODY(NODE)     TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1187
1188#define OMP_SINGLE_BODY(NODE)      TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1189#define OMP_SINGLE_CLAUSES(NODE)   TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1190
1191#define OMP_MASTER_BODY(NODE)      TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1192
1193#define OMP_TASKGROUP_BODY(NODE)   TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1194
1195#define OMP_ORDERED_BODY(NODE)     TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1196
1197#define OMP_CRITICAL_BODY(NODE)    TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1198#define OMP_CRITICAL_NAME(NODE)    TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1199
1200#define OMP_TEAMS_BODY(NODE)       TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1201#define OMP_TEAMS_CLAUSES(NODE)    TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1202
1203#define OMP_TARGET_DATA_BODY(NODE) \
1204  TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1205#define OMP_TARGET_DATA_CLAUSES(NODE)\
1206  TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1207
1208#define OMP_TARGET_BODY(NODE)      TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1209#define OMP_TARGET_CLAUSES(NODE)   TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1210
1211#define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1212  TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1213
1214#define OMP_CLAUSE_SIZE(NODE)                                           \
1215  OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE),  \
1216                                              OMP_CLAUSE_FROM,          \
1217                                              OMP_CLAUSE_MAP), 1)
1218
1219#define OMP_CLAUSE_CHAIN(NODE)     TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1220#define OMP_CLAUSE_DECL(NODE)                                           \
1221  OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE),  \
1222                                              OMP_CLAUSE_PRIVATE,       \
1223                                              OMP_CLAUSE__LOOPTEMP_), 0)
1224#define OMP_CLAUSE_HAS_LOCATION(NODE) \
1225  (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus)         \
1226  != UNKNOWN_LOCATION)
1227#define OMP_CLAUSE_LOCATION(NODE)  (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1228
1229/* True on an OMP_SECTION statement that was the last lexical member.
1230   This status is meaningful in the implementation of lastprivate.  */
1231#define OMP_SECTION_LAST(NODE) \
1232  (OMP_SECTION_CHECK (NODE)->base.private_flag)
1233
1234/* True on an OMP_PARALLEL statement if it represents an explicit
1235   combined parallel work-sharing constructs.  */
1236#define OMP_PARALLEL_COMBINED(NODE) \
1237  (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1238
1239/* True if OMP_ATOMIC* is supposed to be sequentially consistent
1240   as opposed to relaxed.  */
1241#define OMP_ATOMIC_SEQ_CST(NODE) \
1242  (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1243                     OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1244
1245/* True on a PRIVATE clause if its decl is kept around for debugging
1246   information only and its DECL_VALUE_EXPR is supposed to point
1247   to what it has been remapped to.  */
1248#define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1249  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1250
1251/* True on a PRIVATE clause if ctor needs access to outer region's
1252   variable.  */
1253#define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1254  TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1255
1256/* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1257   decl is present in the chain.  */
1258#define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1259  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1260#define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1261  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE,                   \
1262                                                OMP_CLAUSE_LASTPRIVATE),\
1263                      1)
1264#define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1265  (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1266
1267#define OMP_CLAUSE_FINAL_EXPR(NODE) \
1268  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1269#define OMP_CLAUSE_IF_EXPR(NODE) \
1270  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1271#define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1272  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1273#define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1274  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1275
1276#define OMP_CLAUSE_DEPEND_KIND(NODE) \
1277  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1278
1279#define OMP_CLAUSE_MAP_KIND(NODE) \
1280  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1281
1282/* Nonzero if this map clause is for array (rather than pointer) based array
1283   section with zero bias.  Both the non-decl OMP_CLAUSE_MAP and
1284   correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag.  */
1285#define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1286  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1287
1288#define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1289  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1290
1291#define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1292  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1293#define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1294  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1295#define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1296  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1297
1298#define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1299  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1300#define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1301  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1302#define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1303  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1304#define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1305  (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1306#define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1307  (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1308#define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1309  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1310
1311/* True if a REDUCTION clause may reference the original list item (omp_orig)
1312   in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT.  */
1313#define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1314  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1315
1316/* True if a LINEAR clause doesn't need copy in.  True for iterator vars which
1317   are always initialized inside of the loop construct, false otherwise.  */
1318#define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1319  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1320
1321/* True if a LINEAR clause doesn't need copy out.  True for iterator vars which
1322   are declared inside of the simd construct.  */
1323#define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1324  TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1325
1326/* True if a LINEAR clause has a stride that is variable.  */
1327#define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1328  TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1329
1330/* True if a LINEAR clause is for an array or allocatable variable that
1331   needs special handling by the frontend.  */
1332#define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1333  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1334
1335#define OMP_CLAUSE_LINEAR_STEP(NODE) \
1336  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1337
1338#define OMP_CLAUSE_LINEAR_STMT(NODE) \
1339  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1340
1341#define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1342  (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1343
1344#define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1345  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1346
1347#define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1348  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1349
1350#define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1351  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1352                                                OMP_CLAUSE_THREAD_LIMIT), 0)
1353
1354#define OMP_CLAUSE_DEVICE_ID(NODE) \
1355  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1356
1357#define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1358  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1359                                                OMP_CLAUSE_DIST_SCHEDULE), 0)
1360
1361#define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1362  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1363
1364#define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1365  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1366
1367#define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1368  OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1369
1370#define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1371  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1372
1373#define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1374  (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1375
1376/* SSA_NAME accessors.  */
1377
1378/* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1379   if there is no name associated with it.  */
1380#define SSA_NAME_IDENTIFIER(NODE)                               \
1381  (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE             \
1382   ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE       \
1383      ? (NODE)->ssa_name.var                                    \
1384      : DECL_NAME ((NODE)->ssa_name.var))                       \
1385   : NULL_TREE)
1386
1387/* Returns the variable being referenced.  This can be NULL_TREE for
1388   temporaries not associated with any user variable.
1389   Once released, this is the only field that can be relied upon.  */
1390#define SSA_NAME_VAR(NODE)                                      \
1391  (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE             \
1392   || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE       \
1393   ? NULL_TREE : (NODE)->ssa_name.var)
1394
1395#define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1396  do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1397
1398/* Returns the statement which defines this SSA name.  */
1399#define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1400
1401/* Returns the SSA version number of this SSA name.  Note that in
1402   tree SSA, version numbers are not per variable and may be recycled.  */
1403#define SSA_NAME_VERSION(NODE)  SSA_NAME_CHECK (NODE)->base.u.version
1404
1405/* Nonzero if this SSA name occurs in an abnormal PHI.  SSA_NAMES are
1406   never output, so we can safely use the ASM_WRITTEN_FLAG for this
1407   status bit.  */
1408#define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1409    SSA_NAME_CHECK (NODE)->base.asm_written_flag
1410
1411/* Nonzero if this SSA_NAME expression is currently on the free list of
1412   SSA_NAMES.  Using NOTHROW_FLAG seems reasonably safe since throwing
1413   has no meaning for an SSA_NAME.  */
1414#define SSA_NAME_IN_FREE_LIST(NODE) \
1415    SSA_NAME_CHECK (NODE)->base.nothrow_flag
1416
1417/* Nonzero if this SSA_NAME is the default definition for the
1418   underlying symbol.  A default SSA name is created for symbol S if
1419   the very first reference to S in the function is a read operation.
1420   Default definitions are always created by an empty statement and
1421   belong to no basic block.  */
1422#define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1423    SSA_NAME_CHECK (NODE)->base.default_def_flag
1424
1425/* Attributes for SSA_NAMEs for pointer-type variables.  */
1426#define SSA_NAME_PTR_INFO(N) \
1427   SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1428
1429/* True if SSA_NAME_RANGE_INFO describes an anti-range.  */
1430#define SSA_NAME_ANTI_RANGE_P(N) \
1431    SSA_NAME_CHECK (N)->base.static_flag
1432
1433/* The type of range described by SSA_NAME_RANGE_INFO.  */
1434#define SSA_NAME_RANGE_TYPE(N) \
1435    (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1436
1437/* Value range info attributes for SSA_NAMEs of non pointer-type variables.  */
1438#define SSA_NAME_RANGE_INFO(N) \
1439    SSA_NAME_CHECK (N)->ssa_name.info.range_info
1440
1441/* Return the immediate_use information for an SSA_NAME. */
1442#define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1443
1444#define OMP_CLAUSE_CODE(NODE)                                   \
1445        (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1446
1447#define OMP_CLAUSE_SET_CODE(NODE, CODE)                         \
1448        ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1449
1450#define OMP_CLAUSE_OPERAND(NODE, I)                             \
1451        OMP_CLAUSE_ELT_CHECK (NODE, I)
1452
1453/* In a BLOCK node.  */
1454#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1455#define BLOCK_NONLOCALIZED_VARS(NODE) \
1456  (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1457#define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1458  vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1459#define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1460#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1461#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1462#define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1463#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1464#define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1465
1466/* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT.  */
1467#define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1468
1469/* An index number for this block.  These values are not guaranteed to
1470   be unique across functions -- whether or not they are depends on
1471   the debugging output format in use.  */
1472#define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1473
1474/* If block reordering splits a lexical block into discontiguous
1475   address ranges, we'll make a copy of the original block.
1476
1477   Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1478   In that case, we have one source block that has been replicated
1479   (through inlining or unrolling) into many logical blocks, and that
1480   these logical blocks have different physical variables in them.
1481
1482   In this case, we have one logical block split into several
1483   non-contiguous address ranges.  Most debug formats can't actually
1484   represent this idea directly, so we fake it by creating multiple
1485   logical blocks with the same variables in them.  However, for those
1486   that do support non-contiguous regions, these allow the original
1487   logical block to be reconstructed, along with the set of address
1488   ranges.
1489
1490   One of the logical block fragments is arbitrarily chosen to be
1491   the ORIGIN.  The other fragments will point to the origin via
1492   BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1493   be null.  The list of fragments will be chained through
1494   BLOCK_FRAGMENT_CHAIN from the origin.  */
1495
1496#define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1497#define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1498
1499/* For an inlined function, this gives the location where it was called
1500   from.  This is only set in the top level block, which corresponds to the
1501   inlined function scope.  This is used in the debug output routines.  */
1502
1503#define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1504
1505/* Define fields and accessors for nodes representing data types.  */
1506
1507/* See tree.def for documentation of the use of these fields.
1508   Look at the documentation of the various ..._TYPE tree codes.
1509
1510   Note that the type.values, type.minval, and type.maxval fields are
1511   overloaded and used for different macros in different kinds of types.
1512   Each macro must check to ensure the tree node is of the proper kind of
1513   type.  Note also that some of the front-ends also overload these fields,
1514   so they must be checked as well.  */
1515
1516#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1517#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1518#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1519#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1520#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1521#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1522#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1523#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1524#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1525#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1526
1527#define TYPE_MODE(NODE) \
1528  (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1529   ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1530#define SET_TYPE_MODE(NODE, MODE) \
1531  (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1532
1533/* The "canonical" type for this type node, which is used by frontends to
1534   compare the type for equality with another type.  If two types are
1535   equal (based on the semantics of the language), then they will have
1536   equivalent TYPE_CANONICAL entries.
1537
1538   As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1539   TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1540   be used for comparison against other types.  Instead, the type is
1541   said to require structural equality checks, described in
1542   TYPE_STRUCTURAL_EQUALITY_P.
1543
1544   For unqualified aggregate and function types the middle-end relies on
1545   TYPE_CANONICAL to tell whether two variables can be assigned
1546   to each other without a conversion.  The middle-end also makes sure
1547   to assign the same alias-sets to the type partition with equal
1548   TYPE_CANONICAL of their unqualified variants.  */
1549#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1550/* Indicates that the type node requires structural equality
1551   checks.  The compiler will need to look at the composition of the
1552   type to determine whether it is equal to another type, rather than
1553   just comparing canonical type pointers.  For instance, we would need
1554   to look at the return and parameter types of a FUNCTION_TYPE
1555   node.  */
1556#define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1557/* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1558   type node requires structural equality.  */
1559#define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1560
1561#define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1562#define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1563
1564/* The (language-specific) typed-based alias set for this type.
1565   Objects whose TYPE_ALIAS_SETs are different cannot alias each
1566   other.  If the TYPE_ALIAS_SET is -1, no alias set has yet been
1567   assigned to this type.  If the TYPE_ALIAS_SET is 0, objects of this
1568   type can alias objects of any type.  */
1569#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1570
1571/* Nonzero iff the typed-based alias set for this type has been
1572   calculated.  */
1573#define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1574  (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1575
1576/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1577   to this type.  */
1578#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1579
1580/* The alignment necessary for objects of this type.
1581   The value is an int, measured in bits.  */
1582#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1583
1584/* 1 if the alignment for this type was requested by "aligned" attribute,
1585   0 if it is the default for this type.  */
1586#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1587
1588/* The alignment for NODE, in bytes.  */
1589#define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1590
1591/* If your language allows you to declare types, and you want debug info
1592   for them, then you need to generate corresponding TYPE_DECL nodes.
1593   These "stub" TYPE_DECL nodes have no name, and simply point at the
1594   type node.  You then set the TYPE_STUB_DECL field of the type node
1595   to point back at the TYPE_DECL node.  This allows the debug routines
1596   to know that the two nodes represent the same type, so that we only
1597   get one debug info record for them.  */
1598#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1599
1600/* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1601   the type has BLKmode only because it lacks the alignment required for
1602   its size.  */
1603#define TYPE_NO_FORCE_BLK(NODE) \
1604  (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1605
1606/* Nonzero in a type considered volatile as a whole.  */
1607#define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1608
1609/* Nonzero in a type considered atomic as a whole.  */
1610#define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1611
1612/* Means this type is const-qualified.  */
1613#define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1614
1615/* If nonzero, this type is `restrict'-qualified, in the C sense of
1616   the term.  */
1617#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1618
1619/* If nonzero, type's name shouldn't be emitted into debug info.  */
1620#define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1621
1622/* The address space the type is in.  */
1623#define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1624
1625/* Encode/decode the named memory support as part of the qualifier.  If more
1626   than 8 qualifiers are added, these macros need to be adjusted.  */
1627#define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1628#define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1629
1630/* Return all qualifiers except for the address space qualifiers.  */
1631#define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1632
1633/* Only keep the address space out of the qualifiers and discard the other
1634   qualifiers.  */
1635#define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1636
1637/* The set of type qualifiers for this type.  */
1638#define TYPE_QUALS(NODE)                                        \
1639  ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST)              \
1640          | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE)         \
1641          | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC)             \
1642          | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)         \
1643          | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1644
1645/* The same as TYPE_QUALS without the address space qualifications.  */
1646#define TYPE_QUALS_NO_ADDR_SPACE(NODE)                          \
1647  ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST)              \
1648          | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE)         \
1649          | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC)             \
1650          | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1651
1652/* The same as TYPE_QUALS without the address space and atomic
1653   qualifications.  */
1654#define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE)                \
1655  ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST)              \
1656          | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE)         \
1657          | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1658
1659/* These flags are available for each language front end to use internally.  */
1660#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1661#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1662#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1663#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1664#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1665#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1666#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1667
1668/* Used to keep track of visited nodes in tree traversals.  This is set to
1669   0 by copy_node and make_node.  */
1670#define TREE_VISITED(NODE) ((NODE)->base.visited)
1671
1672/* If set in an ARRAY_TYPE, indicates a string type (for languages
1673   that distinguish string from array of char).
1674   If set in a INTEGER_TYPE, indicates a character type.  */
1675#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1676
1677/* For a VECTOR_TYPE, this is the number of sub-parts of the vector.  */
1678#define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1679  (((unsigned HOST_WIDE_INT) 1) \
1680   << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1681
1682/* Set precision to n when we have 2^n sub-parts of the vector.  */
1683#define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1684  (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1685
1686/* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1687   about missing conversions to other vector types of the same size.  */
1688#define TYPE_VECTOR_OPAQUE(NODE) \
1689  (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1690
1691/* Indicates that objects of this type must be initialized by calling a
1692   function when they are created.  */
1693#define TYPE_NEEDS_CONSTRUCTING(NODE) \
1694  (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1695
1696/* Indicates that a UNION_TYPE object should be passed the same way that
1697   the first union alternative would be passed, or that a RECORD_TYPE
1698   object should be passed the same way that the first (and only) member
1699   would be passed.  */
1700#define TYPE_TRANSPARENT_AGGR(NODE) \
1701  (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1702
1703/* For an ARRAY_TYPE, indicates that it is not permitted to take the
1704   address of a component of the type.  This is the counterpart of
1705   DECL_NONADDRESSABLE_P for arrays, see the definition of this flag.  */
1706#define TYPE_NONALIASED_COMPONENT(NODE) \
1707  (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1708
1709/* Indicated that objects of this type should be laid out in as
1710   compact a way as possible.  */
1711#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1712
1713/* Used by type_contains_placeholder_p to avoid recomputation.
1714   Values are: 0 (unknown), 1 (false), 2 (true).  Never access
1715   this field directly.  */
1716#define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1717  (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1718
1719/* Nonzero if RECORD_TYPE represents a final derivation of class.  */
1720#define TYPE_FINAL_P(NODE) \
1721  (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1722
1723/* The debug output functions use the symtab union field to store
1724   information specific to the debugging format.  The different debug
1725   output hooks store different types in the union field.  These three
1726   macros are used to access different fields in the union.  The debug
1727   hooks are responsible for consistently using only a specific
1728   macro.  */
1729
1730/* Symtab field as an integer.  Used by stabs generator in dbxout.c to
1731   hold the type's number in the generated stabs.  */
1732#define TYPE_SYMTAB_ADDRESS(NODE) \
1733  (TYPE_CHECK (NODE)->type_common.symtab.address)
1734
1735/* Symtab field as a string.  Used by COFF generator in sdbout.c to
1736   hold struct/union type tag names.  */
1737#define TYPE_SYMTAB_POINTER(NODE) \
1738  (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1739
1740/* Symtab field as a pointer to a DWARF DIE.  Used by DWARF generator
1741   in dwarf2out.c to point to the DIE generated for the type.  */
1742#define TYPE_SYMTAB_DIE(NODE) \
1743  (TYPE_CHECK (NODE)->type_common.symtab.die)
1744
1745/* The garbage collector needs to know the interpretation of the
1746   symtab field.  These constants represent the different types in the
1747   union.  */
1748
1749#define TYPE_SYMTAB_IS_ADDRESS (0)
1750#define TYPE_SYMTAB_IS_POINTER (1)
1751#define TYPE_SYMTAB_IS_DIE (2)
1752
1753#define TYPE_LANG_SPECIFIC(NODE) \
1754  (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1755
1756#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1757#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1758#define TYPE_FIELDS(NODE) \
1759  (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1760#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1761#define TYPE_ARG_TYPES(NODE) \
1762  (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1763#define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1764
1765#define TYPE_METHODS(NODE) \
1766  (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1767#define TYPE_VFIELD(NODE) \
1768  (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1769#define TYPE_METHOD_BASETYPE(NODE) \
1770  (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1771#define TYPE_OFFSET_BASETYPE(NODE) \
1772  (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1773#define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1774#define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1775#define TYPE_NEXT_PTR_TO(NODE) \
1776  (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1777#define TYPE_NEXT_REF_TO(NODE) \
1778  (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1779#define TYPE_MIN_VALUE(NODE) \
1780  (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1781#define TYPE_MAX_VALUE(NODE) \
1782  (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1783
1784/* If non-NULL, this is an upper bound of the size (in bytes) of an
1785   object of the given ARRAY_TYPE_NON_COMMON.  This allows temporaries to be
1786   allocated.  */
1787#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1788  (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1789
1790/* For record and union types, information about this type, as a base type
1791   for itself.  */
1792#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1793
1794/* For non record and union types, used in a language-dependent way.  */
1795#define TYPE_LANG_SLOT_1(NODE) \
1796  (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1797
1798/* Define accessor macros for information about type inheritance
1799   and basetypes.
1800
1801   A "basetype" means a particular usage of a data type for inheritance
1802   in another type.  Each such basetype usage has its own "binfo"
1803   object to describe it.  The binfo object is a TREE_VEC node.
1804
1805   Inheritance is represented by the binfo nodes allocated for a
1806   given type.  For example, given types C and D, such that D is
1807   inherited by C, 3 binfo nodes will be allocated: one for describing
1808   the binfo properties of C, similarly one for D, and one for
1809   describing the binfo properties of D as a base type for C.
1810   Thus, given a pointer to class C, one can get a pointer to the binfo
1811   of D acting as a basetype for C by looking at C's binfo's basetypes.  */
1812
1813/* BINFO specific flags.  */
1814
1815/* Nonzero means that the derivation chain is via a `virtual' declaration.  */
1816#define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1817
1818/* Flags for language dependent use.  */
1819#define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1820#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1821#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1822#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1823#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1824#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1825#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1826
1827/* The actual data type node being inherited in this basetype.  */
1828#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1829
1830/* The offset where this basetype appears in its containing type.
1831   BINFO_OFFSET slot holds the offset (in bytes)
1832   from the base of the complete object to the base of the part of the
1833   object that is allocated on behalf of this `type'.
1834   This is always 0 except when there is multiple inheritance.  */
1835
1836#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1837#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1838
1839/* The virtual function table belonging to this basetype.  Virtual
1840   function tables provide a mechanism for run-time method dispatching.
1841   The entries of a virtual function table are language-dependent.  */
1842
1843#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1844
1845/* The virtual functions in the virtual function table.  This is
1846   a TREE_LIST that is used as an initial approximation for building
1847   a virtual function table for this basetype.  */
1848#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1849
1850/* A vector of binfos for the direct basetypes inherited by this
1851   basetype.
1852
1853   If this basetype describes type D as inherited in C, and if the
1854   basetypes of D are E and F, then this vector contains binfos for
1855   inheritance of E and F by C.  */
1856#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1857
1858/* The number of basetypes for NODE.  */
1859#define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1860
1861/* Accessor macro to get to the Nth base binfo of this binfo.  */
1862#define BINFO_BASE_BINFO(NODE,N) \
1863 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1864#define BINFO_BASE_ITERATE(NODE,N,B) \
1865 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1866#define BINFO_BASE_APPEND(NODE,T) \
1867 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1868
1869/* For a BINFO record describing a virtual base class, i.e., one where
1870   TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1871   base.  The actual contents are language-dependent.  In the C++
1872   front-end this field is an INTEGER_CST giving an offset into the
1873   vtable where the offset to the virtual base can be found.  */
1874#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1875
1876/* Indicates the accesses this binfo has to its bases. The values are
1877   access_public_node, access_protected_node or access_private_node.
1878   If this array is not present, public access is implied.  */
1879#define BINFO_BASE_ACCESSES(NODE) \
1880  (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1881
1882#define BINFO_BASE_ACCESS(NODE,N) \
1883  (*BINFO_BASE_ACCESSES (NODE))[(N)]
1884#define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1885  BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1886
1887/* The index in the VTT where this subobject's sub-VTT can be found.
1888   NULL_TREE if there is no sub-VTT.  */
1889#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1890
1891/* The index in the VTT where the vptr for this subobject can be
1892   found.  NULL_TREE if there is no secondary vptr in the VTT.  */
1893#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1894
1895/* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1896   inheriting this base for non-virtual bases. For virtual bases it
1897   points either to the binfo for which this is a primary binfo, or to
1898   the binfo of the most derived type.  */
1899#define BINFO_INHERITANCE_CHAIN(NODE) \
1900        (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1901
1902
1903/* Define fields and accessors for nodes representing declared names.  */
1904
1905/* Nonzero if DECL represents an SSA name or a variable that can possibly
1906   have an associated SSA name.  */
1907#define SSA_VAR_P(DECL)                                                 \
1908        (TREE_CODE (DECL) == VAR_DECL                                   \
1909         || TREE_CODE (DECL) == PARM_DECL                               \
1910         || TREE_CODE (DECL) == RESULT_DECL                             \
1911         || TREE_CODE (DECL) == SSA_NAME)
1912
1913
1914#define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1915
1916/* This is the name of the object as written by the user.
1917   It is an IDENTIFIER_NODE.  */
1918#define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1919
1920/* Every ..._DECL node gets a unique number.  */
1921#define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1922
1923/* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1924   uses.  */
1925#define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1926
1927/* Every ..._DECL node gets a unique number that stays the same even
1928   when the decl is copied by the inliner once it is set.  */
1929#define DECL_PT_UID(NODE) \
1930  (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1931   ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1932/* Initialize the ..._DECL node pt-uid to the decls uid.  */
1933#define SET_DECL_PT_UID(NODE, UID) \
1934  (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1935/* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1936   be preserved when copyin the decl.  */
1937#define DECL_PT_UID_SET_P(NODE) \
1938  (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1939
1940/* These two fields describe where in the source code the declaration
1941   was.  If the declaration appears in several places (as for a C
1942   function that is declared first and then defined later), this
1943   information should refer to the definition.  */
1944#define DECL_SOURCE_LOCATION(NODE) \
1945  (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1946#define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1947#define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1948#define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1949/* This accessor returns TRUE if the decl it operates on was created
1950   by a front-end or back-end rather than by user code.  In this case
1951   builtin-ness is indicated by source location.  */
1952#define DECL_IS_BUILTIN(DECL) \
1953  (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1954
1955/*  For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1956    QUAL_UNION_TYPE node that the field is a member of.  For VAR_DECL,
1957    PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1958    nodes, this points to either the FUNCTION_DECL for the containing
1959    function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1960    NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1961    scope".  In particular, for VAR_DECLs which are virtual table pointers
1962    (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1963    they belong to.  */
1964#define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1965#define DECL_FIELD_CONTEXT(NODE) \
1966  (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1967
1968/* If nonzero, decl's name shouldn't be emitted into debug info.  */
1969#define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1970
1971/* For any sort of a ..._DECL node, this points to the original (abstract)
1972   decl node which this decl is an inlined/cloned instance of, or else it
1973   is NULL indicating that this decl is not an instance of some other decl.
1974
1975   The C front-end also uses this in a nested declaration of an inline
1976   function, to point back to the definition.  */
1977#define DECL_ABSTRACT_ORIGIN(NODE) \
1978  (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1979
1980/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1981   origin.  This is useful when setting the DECL_ABSTRACT_ORIGIN.  */
1982#define DECL_ORIGIN(NODE) \
1983  (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1984
1985/* Nonzero for any sort of ..._DECL node means this decl node represents an
1986   inline instance of some original (abstract) decl from an inline function;
1987   suppress any warnings about shadowing some other variable.  FUNCTION_DECL
1988   nodes can also have their abstract origin set to themselves.  */
1989#define DECL_FROM_INLINE(NODE) \
1990  (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1991   && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1992
1993/* In a DECL this is the field where attributes are stored.  */
1994#define DECL_ATTRIBUTES(NODE) \
1995  (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
1996
1997/* For a FUNCTION_DECL, holds the tree of BINDINGs.
1998   For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1999   For a VAR_DECL, holds the initial value.
2000   For a PARM_DECL, used for DECL_ARG_TYPE--default
2001   values for parameters are encoded in the type of the function,
2002   not in the PARM_DECL slot.
2003   For a FIELD_DECL, this is used for enumeration values and the C
2004   frontend uses it for temporarily storing bitwidth of bitfields.
2005
2006   ??? Need to figure out some way to check this isn't a PARM_DECL.  */
2007#define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2008
2009/* Holds the size of the datum, in bits, as a tree expression.
2010   Need not be constant.  */
2011#define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2012/* Likewise for the size in bytes.  */
2013#define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2014/* Holds the alignment required for the datum, in bits.  */
2015#define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2016/* The alignment of NODE, in bytes.  */
2017#define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2018/* Set if the alignment of this DECL has been set by the user, for
2019   example with an 'aligned' attribute.  */
2020#define DECL_USER_ALIGN(NODE) \
2021  (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2022/* Holds the machine mode corresponding to the declaration of a variable or
2023   field.  Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2024   FIELD_DECL.  */
2025#define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2026
2027/* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2028   operation it is.  Note, however, that this field is overloaded, with
2029   DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2030   checked before any access to the former.  */
2031#define DECL_FUNCTION_CODE(NODE) \
2032  (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2033
2034#define DECL_FUNCTION_PERSONALITY(NODE) \
2035  (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2036
2037/* Nonzero for a given ..._DECL node means that the name of this node should
2038   be ignored for symbolic debug purposes.  For a TYPE_DECL, this means that
2039   the associated type should be ignored.  For a FUNCTION_DECL, the body of
2040   the function should also be ignored.  */
2041#define DECL_IGNORED_P(NODE) \
2042  (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2043
2044/* Nonzero for a given ..._DECL node means that this node represents an
2045   "abstract instance" of the given declaration (e.g. in the original
2046   declaration of an inline function).  When generating symbolic debugging
2047   information, we mustn't try to generate any address information for nodes
2048   marked as "abstract instances" because we don't actually generate
2049   any code or allocate any data space for such instances.  */
2050#define DECL_ABSTRACT(NODE) \
2051  (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2052
2053/* Language-specific decl information.  */
2054#define DECL_LANG_SPECIFIC(NODE) \
2055  (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2056
2057/* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2058   do not allocate storage, and refer to a definition elsewhere.  Note that
2059   this does not necessarily imply the entity represented by NODE
2060   has no program source-level definition in this translation unit.  For
2061   example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2062   DECL_EXTERNAL may be true simultaneously; that can be the case for
2063   a C99 "extern inline" function.  */
2064#define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2065
2066/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2067   For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2068
2069   For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2070
2071   Also set in some languages for variables, etc., outside the normal
2072   lexical scope, such as class instance variables.  */
2073#define DECL_NONLOCAL(NODE) \
2074  (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2075
2076/* Used in VAR_DECLs to indicate that the variable is a vtable.
2077   Used in FIELD_DECLs for vtable pointers.
2078   Used in FUNCTION_DECLs to indicate that the function is virtual.  */
2079#define DECL_VIRTUAL_P(NODE) \
2080  (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2081
2082/* Used to indicate that this DECL represents a compiler-generated entity.  */
2083#define DECL_ARTIFICIAL(NODE) \
2084  (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2085
2086/* Additional flags for language-specific uses.  */
2087#define DECL_LANG_FLAG_0(NODE) \
2088  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2089#define DECL_LANG_FLAG_1(NODE) \
2090  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2091#define DECL_LANG_FLAG_2(NODE) \
2092  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2093#define DECL_LANG_FLAG_3(NODE) \
2094  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2095#define DECL_LANG_FLAG_4(NODE) \
2096  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2097#define DECL_LANG_FLAG_5(NODE) \
2098  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2099#define DECL_LANG_FLAG_6(NODE) \
2100  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2101#define DECL_LANG_FLAG_7(NODE) \
2102  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2103#define DECL_LANG_FLAG_8(NODE) \
2104  (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2105
2106/* Nonzero for a scope which is equal to file scope.  */
2107#define SCOPE_FILE_SCOPE_P(EXP) \
2108  (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2109/* Nonzero for a decl which is at file scope.  */
2110#define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2111/* Nonzero for a type which is at file scope.  */
2112#define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2113
2114/* Nonzero for a decl that is decorated using attribute used.
2115   This indicates to compiler tools that this decl needs to be preserved.  */
2116#define DECL_PRESERVE_P(DECL) \
2117  DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2118
2119/* For function local variables of COMPLEX and VECTOR types,
2120   indicates that the variable is not aliased, and that all
2121   modifications to the variable have been adjusted so that
2122   they are killing assignments.  Thus the variable may now
2123   be treated as a GIMPLE register, and use real instead of
2124   virtual ops in SSA form.  */
2125#define DECL_GIMPLE_REG_P(DECL) \
2126  DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2127
2128extern tree decl_value_expr_lookup (tree);
2129extern void decl_value_expr_insert (tree, tree);
2130
2131/* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2132   if transformations have made this more complicated than evaluating the
2133   decl itself.  This should only be used for debugging; once this field has
2134   been set, the decl itself may not legitimately appear in the function.  */
2135#define DECL_HAS_VALUE_EXPR_P(NODE) \
2136  (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2137   ->decl_common.decl_flag_2)
2138#define DECL_VALUE_EXPR(NODE) \
2139  (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2140#define SET_DECL_VALUE_EXPR(NODE, VAL) \
2141  (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2142
2143/* Holds the RTL expression for the value of a variable or function.
2144   This value can be evaluated lazily for functions, variables with
2145   static storage duration, and labels.  */
2146#define DECL_RTL(NODE)                                  \
2147  (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl            \
2148   ? (NODE)->decl_with_rtl.rtl                                  \
2149   : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2150
2151/* Set the DECL_RTL for NODE to RTL.  */
2152#define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2153
2154/* Returns nonzero if NODE is a tree node that can contain RTL.  */
2155#define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2156
2157/* Returns nonzero if the DECL_RTL for NODE has already been set.  */
2158#define DECL_RTL_SET_P(NODE) \
2159  (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2160
2161/* Copy the RTL from NODE1 to NODE2.  If the RTL was not set for
2162   NODE1, it will not be set for NODE2; this is a lazy copy.  */
2163#define COPY_DECL_RTL(NODE1, NODE2) \
2164  (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2165   = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2166
2167/* The DECL_RTL for NODE, if it is set, or NULL, if it is not set.  */
2168#define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2169
2170#if (GCC_VERSION >= 2007)
2171#define DECL_RTL_KNOWN_SET(decl) __extension__                          \
2172({  tree const __d = (decl);                                            \
2173    gcc_checking_assert (DECL_RTL_SET_P (__d));                         \
2174    /* Dereference it so the compiler knows it can't be NULL even       \
2175       without assertion checking.  */                                  \
2176    &*DECL_RTL_IF_SET (__d); })
2177#else
2178#define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2179#endif
2180
2181/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'.  */
2182#define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2183
2184/* In a FIELD_DECL, this is the field position, counting in bytes, of the
2185   DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2186   of the structure.  */
2187#define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2188
2189/* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2190   field from DECL_FIELD_OFFSET.  This field may be nonzero even for fields
2191   that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2192   natural alignment of the field's type).  */
2193#define DECL_FIELD_BIT_OFFSET(NODE) \
2194  (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2195
2196/* In a FIELD_DECL, this indicates whether the field was a bit-field and
2197   if so, the type that was originally specified for it.
2198   TREE_TYPE may have been modified (in finish_struct).  */
2199#define DECL_BIT_FIELD_TYPE(NODE) \
2200  (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2201
2202/* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2203   representative FIELD_DECL.  */
2204#define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2205  (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2206
2207/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2208   if nonzero, indicates that the field occupies the type.  */
2209#define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2210
2211/* For FIELD_DECLs, off_align holds the number of low-order bits of
2212   DECL_FIELD_OFFSET which are known to be always zero.
2213   DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2214   has.  */
2215#define DECL_OFFSET_ALIGN(NODE) \
2216  (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2217
2218/* Specify that DECL_ALIGN(NODE) is a multiple of X.  */
2219#define SET_DECL_OFFSET_ALIGN(NODE, X) \
2220  (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2221
2222/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2223   which this FIELD_DECL is defined.  This information is needed when
2224   writing debugging information about vfield and vbase decls for C++.  */
2225#define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2226
2227/* In a FIELD_DECL, indicates this field should be bit-packed.  */
2228#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2229
2230/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2231   specially.  */
2232#define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2233
2234/* Used in a FIELD_DECL to indicate that we cannot form the address of
2235   this component.  This makes it possible for Type-Based Alias Analysis
2236   to disambiguate accesses to this field with indirect accesses using
2237   the field's type:
2238
2239     struct S { int i; } s;
2240     int *p;
2241
2242   If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2243
2244   From the implementation's viewpoint, the alias set of the type of the
2245   field 'i' (int) will not be recorded as a subset of that of the type of
2246   's' (struct S) in record_component_aliases.  The counterpart is that
2247   accesses to s.i must not be given the alias set of the type of 'i'
2248   (int) but instead directly that of the type of 's' (struct S).  */
2249#define DECL_NONADDRESSABLE_P(NODE) \
2250  (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2251
2252/* A numeric unique identifier for a LABEL_DECL.  The UID allocation is
2253   dense, unique within any one function, and may be used to index arrays.
2254   If the value is -1, then no UID has been assigned.  */
2255#define LABEL_DECL_UID(NODE) \
2256  (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2257
2258/* In a LABEL_DECL, the EH region number for which the label is the
2259   post_landing_pad.  */
2260#define EH_LANDING_PAD_NR(NODE) \
2261  (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2262
2263/* For a PARM_DECL, records the data type used to pass the argument,
2264   which may be different from the type seen in the program.  */
2265#define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2266
2267/* For PARM_DECL, holds an RTL for the stack slot or register
2268   where the data was actually passed.  */
2269#define DECL_INCOMING_RTL(NODE) \
2270  (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2271
2272/* Nonzero for a given ..._DECL node means that no warnings should be
2273   generated just because this node is unused.  */
2274#define DECL_IN_SYSTEM_HEADER(NODE) \
2275  (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2276
2277/* Used to indicate that the linkage status of this DECL is not yet known,
2278   so it should not be output now.  */
2279#define DECL_DEFER_OUTPUT(NODE) \
2280  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2281
2282/* In a VAR_DECL that's static,
2283   nonzero if the space is in the text section.  */
2284#define DECL_IN_TEXT_SECTION(NODE) \
2285  (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2286
2287/* In a VAR_DECL that's static,
2288   nonzero if it belongs to the global constant pool.  */
2289#define DECL_IN_CONSTANT_POOL(NODE) \
2290  (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2291
2292/* Nonzero for a given ..._DECL node means that this node should be
2293   put in .common, if possible.  If a DECL_INITIAL is given, and it
2294   is not error_mark_node, then the decl cannot be put in .common.  */
2295#define DECL_COMMON(NODE) \
2296  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2297
2298/* In a VAR_DECL, nonzero if the decl is a register variable with
2299   an explicit asm specification.  */
2300#define DECL_HARD_REGISTER(NODE)  \
2301  (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2302
2303  /* Used to indicate that this DECL has weak linkage.  */
2304#define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2305
2306/* Used to indicate that the DECL is a dllimport.  */
2307#define DECL_DLLIMPORT_P(NODE) \
2308  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2309
2310/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2311   not be put out unless it is needed in this translation unit.
2312   Entities like this are shared across translation units (like weak
2313   entities), but are guaranteed to be generated by any translation
2314   unit that needs them, and therefore need not be put out anywhere
2315   where they are not needed.  DECL_COMDAT is just a hint to the
2316   back-end; it is up to front-ends which set this flag to ensure
2317   that there will never be any harm, other than bloat, in putting out
2318   something which is DECL_COMDAT.  */
2319#define DECL_COMDAT(NODE) \
2320  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2321
2322#define DECL_COMDAT_GROUP(NODE) \
2323  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2324
2325/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2326   multiple translation units should be merged.  */
2327#define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2328
2329/* The name of the object as the assembler will see it (but before any
2330   translations made by ASM_OUTPUT_LABELREF).  Often this is the same
2331   as DECL_NAME.  It is an IDENTIFIER_NODE.  */
2332#define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2333
2334/* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2335   This is true of all DECL nodes except FIELD_DECL.  */
2336#define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2337  (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2338
2339/* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set.  If zero,
2340   the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2341   yet.  */
2342#define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2343  (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2344   && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2345
2346/* Set the DECL_ASSEMBLER_NAME for NODE to NAME.  */
2347#define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2348  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2349
2350/* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2.  Note that if DECL1's
2351   DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2352   the DECL_ASSEMBLER_NAME of either DECL to be set.  In other words, the
2353   semantics of using this macro, are different than saying:
2354
2355     SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2356
2357   which will try to set the DECL_ASSEMBLER_NAME for DECL1.  */
2358
2359#define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2)                          \
2360  (DECL_ASSEMBLER_NAME_SET_P (DECL1)                                    \
2361   ? (void) SET_DECL_ASSEMBLER_NAME (DECL2,                             \
2362                                     DECL_ASSEMBLER_NAME (DECL1))       \
2363   : (void) 0)
2364
2365/* Records the section name in a section attribute.  Used to pass
2366   the name from decl_attributes to make_function_rtl and make_decl_rtl.  */
2367#define DECL_SECTION_NAME(NODE) \
2368  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2369
2370/* Nonzero in a decl means that the gimplifier has seen (or placed)
2371   this variable in a BIND_EXPR.  */
2372#define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2373  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2374
2375/* Value of the decls's visibility attribute */
2376#define DECL_VISIBILITY(NODE) \
2377  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2378
2379/* Nonzero means that the decl had its visibility specified rather than
2380   being inferred.  */
2381#define DECL_VISIBILITY_SPECIFIED(NODE) \
2382  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2383
2384/* In a VAR_DECL, the model to use if the data should be allocated from
2385   thread-local storage.  */
2386#define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2387
2388/* In a VAR_DECL, nonzero if the data should be allocated from
2389   thread-local storage.  */
2390#define DECL_THREAD_LOCAL_P(NODE) \
2391  (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2392
2393/* In a non-local VAR_DECL with static storage duration, true if the
2394   variable has an initialization priority.  If false, the variable
2395   will be initialized at the DEFAULT_INIT_PRIORITY.  */
2396#define DECL_HAS_INIT_PRIORITY_P(NODE) \
2397  (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2398
2399/* Specify whether the section name was set by user or by
2400   compiler via -ffunction-sections.  */
2401#define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2402  (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2403
2404extern tree decl_debug_expr_lookup (tree);
2405extern void decl_debug_expr_insert (tree, tree);
2406
2407/* For VAR_DECL, this is set to an expression that it was split from.  */
2408#define DECL_HAS_DEBUG_EXPR_P(NODE) \
2409  (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2410#define DECL_DEBUG_EXPR(NODE) \
2411  (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2412
2413#define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2414  (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2415
2416extern priority_type decl_init_priority_lookup (tree);
2417extern priority_type decl_fini_priority_lookup (tree);
2418extern void decl_init_priority_insert (tree, priority_type);
2419extern void decl_fini_priority_insert (tree, priority_type);
2420
2421/* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2422   NODE.  */
2423#define DECL_INIT_PRIORITY(NODE) \
2424  (decl_init_priority_lookup (NODE))
2425/* Set the initialization priority for NODE to VAL.  */
2426#define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2427  (decl_init_priority_insert (NODE, VAL))
2428
2429/* For a FUNCTION_DECL the finalization priority of NODE.  */
2430#define DECL_FINI_PRIORITY(NODE) \
2431  (decl_fini_priority_lookup (NODE))
2432/* Set the finalization priority for NODE to VAL.  */
2433#define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2434  (decl_fini_priority_insert (NODE, VAL))
2435
2436/* The initialization priority for entities for which no explicit
2437   initialization priority has been specified.  */
2438#define DEFAULT_INIT_PRIORITY 65535
2439
2440/* The maximum allowed initialization priority.  */
2441#define MAX_INIT_PRIORITY 65535
2442
2443/* The largest priority value reserved for use by system runtime
2444   libraries.  */
2445#define MAX_RESERVED_INIT_PRIORITY 100
2446
2447/* In a VAR_DECL, nonzero if this is a global variable for VOPs.  */
2448#define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2449  (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2450
2451/* In a VAR_DECL, nonzero if this is a non-local frame structure.  */
2452#define DECL_NONLOCAL_FRAME(NODE)  \
2453  (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2454
2455/* In a VAR_DECL, nonzero if this variable is not aliased by any pointer.  */
2456#define DECL_NONALIASED(NODE) \
2457  (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2458
2459/* This field is used to reference anything in decl.result and is meant only
2460   for use by the garbage collector.  */
2461#define DECL_RESULT_FLD(NODE) \
2462  (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2463
2464/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2465   Before the struct containing the FUNCTION_DECL is laid out,
2466   DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2467   is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2468   function.  When the class is laid out, this pointer is changed
2469   to an INTEGER_CST node which is suitable for use as an index
2470   into the virtual function table.
2471   C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK.  */
2472#define DECL_VINDEX(NODE) \
2473  (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2474
2475/* In FUNCTION_DECL, holds the decl for the return value.  */
2476#define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2477
2478/* In a FUNCTION_DECL, nonzero if the function cannot be inlined.  */
2479#define DECL_UNINLINABLE(NODE) \
2480  (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2481
2482/* In a FUNCTION_DECL, the saved representation of the body of the
2483   entire function.  */
2484#define DECL_SAVED_TREE(NODE) \
2485  (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2486
2487/* Nonzero in a FUNCTION_DECL means this function should be treated
2488   as if it were a malloc, meaning it returns a pointer that is
2489   not an alias.  */
2490#define DECL_IS_MALLOC(NODE) \
2491  (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2492
2493/* Nonzero in a FUNCTION_DECL means this function should be treated as
2494   C++ operator new, meaning that it returns a pointer for which we
2495   should not use type based aliasing.  */
2496#define DECL_IS_OPERATOR_NEW(NODE) \
2497  (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2498
2499/* Nonzero in a FUNCTION_DECL means this function may return more
2500   than once.  */
2501#define DECL_IS_RETURNS_TWICE(NODE) \
2502  (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2503
2504/* Nonzero in a FUNCTION_DECL means this function should be treated
2505   as "pure" function (like const function, but may read global memory).  */
2506#define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2507
2508/* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2509   the const or pure function may not terminate.  When this is nonzero
2510   for a const or pure function, it can be dealt with by cse passes
2511   but cannot be removed by dce passes since you are not allowed to
2512   change an infinite looping program into one that terminates without
2513   error.  */
2514#define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2515  (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2516
2517/* Nonzero in a FUNCTION_DECL means this function should be treated
2518   as "novops" function (function that does not read global memory,
2519   but may have arbitrary side effects).  */
2520#define DECL_IS_NOVOPS(NODE) \
2521  (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2522
2523/* Used in FUNCTION_DECLs to indicate that they should be run automatically
2524   at the beginning or end of execution.  */
2525#define DECL_STATIC_CONSTRUCTOR(NODE) \
2526  (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2527
2528#define DECL_STATIC_DESTRUCTOR(NODE) \
2529(FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2530
2531/* Used in FUNCTION_DECLs to indicate that function entry and exit should
2532   be instrumented with calls to support routines.  */
2533#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2534  (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2535
2536/* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2537   disabled in this function.  */
2538#define DECL_NO_LIMIT_STACK(NODE) \
2539  (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2540
2541/* In a FUNCTION_DECL indicates that a static chain is needed.  */
2542#define DECL_STATIC_CHAIN(NODE) \
2543  (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2544
2545/* Nonzero for a decl that cgraph has decided should be inlined into
2546   at least one call site.  It is not meaningful to look at this
2547   directly; always use cgraph_function_possibly_inlined_p.  */
2548#define DECL_POSSIBLY_INLINED(DECL) \
2549  FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2550
2551/* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2552   such as via the `inline' keyword in C/C++.  This flag controls the linkage
2553   semantics of 'inline'  */
2554#define DECL_DECLARED_INLINE_P(NODE) \
2555  (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2556
2557/* Nonzero in a FUNCTION_DECL means this function should not get
2558   -Winline warnings.  */
2559#define DECL_NO_INLINE_WARNING_P(NODE) \
2560  (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2561
2562/* Nonzero if a FUNCTION_CODE is a TM load/store.  */
2563#define BUILTIN_TM_LOAD_STORE_P(FN) \
2564  ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2565
2566/* Nonzero if a FUNCTION_CODE is a TM load.  */
2567#define BUILTIN_TM_LOAD_P(FN) \
2568  ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2569
2570/* Nonzero if a FUNCTION_CODE is a TM store.  */
2571#define BUILTIN_TM_STORE_P(FN) \
2572  ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2573
2574#define CASE_BUILT_IN_TM_LOAD(FN)       \
2575  case BUILT_IN_TM_LOAD_##FN:           \
2576  case BUILT_IN_TM_LOAD_RAR_##FN:       \
2577  case BUILT_IN_TM_LOAD_RAW_##FN:       \
2578  case BUILT_IN_TM_LOAD_RFW_##FN
2579
2580#define CASE_BUILT_IN_TM_STORE(FN)      \
2581  case BUILT_IN_TM_STORE_##FN:          \
2582  case BUILT_IN_TM_STORE_WAR_##FN:      \
2583  case BUILT_IN_TM_STORE_WAW_##FN
2584
2585/* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2586   disregarding size and cost heuristics.  This is equivalent to using
2587   the always_inline attribute without the required diagnostics if the
2588   function cannot be inlined.  */
2589#define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2590  (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2591
2592extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2593extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2594
2595/* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it.  */
2596#define DECL_HAS_DEBUG_ARGS_P(NODE) \
2597  (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2598
2599/* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2600   that describes the status of this function.  */
2601#define DECL_STRUCT_FUNCTION(NODE) \
2602  (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2603
2604/* In a FUNCTION_DECL, nonzero means a built in function of a
2605   standard library or more generally a built in function that is
2606   recognized by optimizers and expanders.
2607
2608   Note that it is different from the DECL_IS_BUILTIN accessor.  For
2609   instance, user declared prototypes of C library functions are not
2610   DECL_IS_BUILTIN but may be DECL_BUILT_IN.  */
2611#define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2612
2613/* For a builtin function, identify which part of the compiler defined it.  */
2614#define DECL_BUILT_IN_CLASS(NODE) \
2615   (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2616
2617/* In FUNCTION_DECL, a chain of ..._DECL nodes.
2618   VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2619   uses.  */
2620#define DECL_ARGUMENTS(NODE) \
2621  (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2622#define DECL_ARGUMENT_FLD(NODE) \
2623  (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2624
2625/* In FUNCTION_DECL, the function specific target options to use when compiling
2626   this function.  */
2627#define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2628   (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2629
2630/* In FUNCTION_DECL, the function specific optimization options to use when
2631   compiling this function.  */
2632#define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2633   (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2634
2635/* In FUNCTION_DECL, this is set if this function has other versions generated
2636   using "target" attributes.  The default version is the one which does not
2637   have any "target" attribute set. */
2638#define DECL_FUNCTION_VERSIONED(NODE)\
2639   (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2640
2641/* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2642   Devirtualization machinery uses this knowledge for determing type of the
2643   object constructed.  Also we assume that constructor address is not
2644   important.  */
2645#define DECL_CXX_CONSTRUCTOR_P(NODE)\
2646   (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2647
2648/* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2649   Devirtualization machinery uses this to track types in destruction.  */
2650#define DECL_CXX_DESTRUCTOR_P(NODE)\
2651   (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2652
2653/* In FUNCTION_DECL that represent an virtual method this is set when
2654   the method is final.  */
2655#define DECL_FINAL_P(NODE)\
2656   (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2657
2658/* The source language of the translation-unit.  */
2659#define TRANSLATION_UNIT_LANGUAGE(NODE) \
2660  (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2661
2662/* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL.  */
2663
2664/* For a TYPE_DECL, holds the "original" type.  (TREE_TYPE has the copy.) */
2665#define DECL_ORIGINAL_TYPE(NODE) \
2666  (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2667
2668/* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2669   into stabs.  Instead it will generate cross reference ('x') of names.
2670   This uses the same flag as DECL_EXTERNAL.  */
2671#define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2672  (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2673
2674/* Getter of the imported declaration associated to the
2675   IMPORTED_DECL node.  */
2676#define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2677(DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2678
2679/* Getter of the symbol declaration associated with the
2680   NAMELIST_DECL node.  */
2681#define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2682  (DECL_INITIAL (NODE))
2683
2684/* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2685   To reduce overhead, the nodes containing the statements are not trees.
2686   This avoids the overhead of tree_common on all linked list elements.
2687
2688   Use the interface in tree-iterator.h to access this node.  */
2689
2690#define STATEMENT_LIST_HEAD(NODE) \
2691  (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2692#define STATEMENT_LIST_TAIL(NODE) \
2693  (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2694
2695#define TREE_OPTIMIZATION(NODE) \
2696  (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2697
2698#define TREE_OPTIMIZATION_OPTABS(NODE) \
2699  (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2700
2701#define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2702  (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2703
2704/* Return a tree node that encapsulates the optimization options in OPTS.  */
2705extern tree build_optimization_node (struct gcc_options *opts);
2706
2707#define TREE_TARGET_OPTION(NODE) \
2708  (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2709
2710#define TREE_TARGET_GLOBALS(NODE) \
2711  (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2712
2713/* Return a tree node that encapsulates the target options in OPTS.  */
2714extern tree build_target_option_node (struct gcc_options *opts);
2715
2716extern void prepare_target_option_nodes_for_pch (void);
2717
2718#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2719
2720inline tree
2721tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
2722{
2723  if (TREE_CODE (__t) != __c)
2724    tree_check_failed (__t, __f, __l, __g, __c, 0);
2725  return __t;
2726}
2727
2728inline tree
2729tree_not_check (tree __t, const char *__f, int __l, const char *__g,
2730                enum tree_code __c)
2731{
2732  if (TREE_CODE (__t) == __c)
2733    tree_not_check_failed (__t, __f, __l, __g, __c, 0);
2734  return __t;
2735}
2736
2737inline tree
2738tree_check2 (tree __t, const char *__f, int __l, const char *__g,
2739             enum tree_code __c1, enum tree_code __c2)
2740{
2741  if (TREE_CODE (__t) != __c1
2742      && TREE_CODE (__t) != __c2)
2743    tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2744  return __t;
2745}
2746
2747inline tree
2748tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
2749                 enum tree_code __c1, enum tree_code __c2)
2750{
2751  if (TREE_CODE (__t) == __c1
2752      || TREE_CODE (__t) == __c2)
2753    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2754  return __t;
2755}
2756
2757inline tree
2758tree_check3 (tree __t, const char *__f, int __l, const char *__g,
2759             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2760{
2761  if (TREE_CODE (__t) != __c1
2762      && TREE_CODE (__t) != __c2
2763      && TREE_CODE (__t) != __c3)
2764    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2765  return __t;
2766}
2767
2768inline tree
2769tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
2770                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2771{
2772  if (TREE_CODE (__t) == __c1
2773      || TREE_CODE (__t) == __c2
2774      || TREE_CODE (__t) == __c3)
2775    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2776  return __t;
2777}
2778
2779inline tree
2780tree_check4 (tree __t, const char *__f, int __l, const char *__g,
2781             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2782             enum tree_code __c4)
2783{
2784  if (TREE_CODE (__t) != __c1
2785      && TREE_CODE (__t) != __c2
2786      && TREE_CODE (__t) != __c3
2787      && TREE_CODE (__t) != __c4)
2788    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2789  return __t;
2790}
2791
2792inline tree
2793tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
2794                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2795                 enum tree_code __c4)
2796{
2797  if (TREE_CODE (__t) == __c1
2798      || TREE_CODE (__t) == __c2
2799      || TREE_CODE (__t) == __c3
2800      || TREE_CODE (__t) == __c4)
2801    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2802  return __t;
2803}
2804
2805inline tree
2806tree_check5 (tree __t, const char *__f, int __l, const char *__g,
2807             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2808             enum tree_code __c4, enum tree_code __c5)
2809{
2810  if (TREE_CODE (__t) != __c1
2811      && TREE_CODE (__t) != __c2
2812      && TREE_CODE (__t) != __c3
2813      && TREE_CODE (__t) != __c4
2814      && TREE_CODE (__t) != __c5)
2815    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2816  return __t;
2817}
2818
2819inline tree
2820tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
2821                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2822                 enum tree_code __c4, enum tree_code __c5)
2823{
2824  if (TREE_CODE (__t) == __c1
2825      || TREE_CODE (__t) == __c2
2826      || TREE_CODE (__t) == __c3
2827      || TREE_CODE (__t) == __c4
2828      || TREE_CODE (__t) == __c5)
2829    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2830  return __t;
2831}
2832
2833inline tree
2834contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
2835                       const char *__f, int __l, const char *__g)
2836{
2837  if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
2838      tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
2839  return __t;
2840}
2841
2842inline tree
2843tree_class_check (tree __t, const enum tree_code_class __class,
2844                  const char *__f, int __l, const char *__g)
2845{
2846  if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
2847    tree_class_check_failed (__t, __class, __f, __l, __g);
2848  return __t;
2849}
2850
2851inline tree
2852tree_range_check (tree __t,
2853                  enum tree_code __code1, enum tree_code __code2,
2854                  const char *__f, int __l, const char *__g)
2855{
2856  if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
2857    tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
2858  return __t;
2859}
2860
2861inline tree
2862omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
2863                          const char *__f, int __l, const char *__g)
2864{
2865  if (TREE_CODE (__t) != OMP_CLAUSE)
2866    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2867  if (__t->omp_clause.code != __code)
2868    omp_clause_check_failed (__t, __f, __l, __g, __code);
2869  return __t;
2870}
2871
2872inline tree
2873omp_clause_range_check (tree __t,
2874                        enum omp_clause_code __code1,
2875                        enum omp_clause_code __code2,
2876                        const char *__f, int __l, const char *__g)
2877{
2878  if (TREE_CODE (__t) != OMP_CLAUSE)
2879    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2880  if ((int) __t->omp_clause.code < (int) __code1
2881      || (int) __t->omp_clause.code > (int) __code2)
2882    omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
2883  return __t;
2884}
2885
2886/* These checks have to be special cased.  */
2887
2888inline tree
2889expr_check (tree __t, const char *__f, int __l, const char *__g)
2890{
2891  char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
2892  if (!IS_EXPR_CODE_CLASS (__c))
2893    tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
2894  return __t;
2895}
2896
2897/* These checks have to be special cased.  */
2898
2899inline tree
2900non_type_check (tree __t, const char *__f, int __l, const char *__g)
2901{
2902  if (TYPE_P (__t))
2903    tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
2904  return __t;
2905}
2906
2907inline tree *
2908tree_vec_elt_check (tree __t, int __i,
2909                    const char *__f, int __l, const char *__g)
2910{
2911  if (TREE_CODE (__t) != TREE_VEC)
2912    tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
2913  if (__i < 0 || __i >= __t->base.u.length)
2914    tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
2915  return &CONST_CAST_TREE (__t)->vec.a[__i];
2916}
2917
2918inline tree *
2919omp_clause_elt_check (tree __t, int __i,
2920                      const char *__f, int __l, const char *__g)
2921{
2922  if (TREE_CODE (__t) != OMP_CLAUSE)
2923    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2924  if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
2925    omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
2926  return &__t->omp_clause.ops[__i];
2927}
2928
2929inline const_tree
2930tree_check (const_tree __t, const char *__f, int __l, const char *__g,
2931            tree_code __c)
2932{
2933  if (TREE_CODE (__t) != __c)
2934    tree_check_failed (__t, __f, __l, __g, __c, 0);
2935  return __t;
2936}
2937
2938inline const_tree
2939tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
2940                enum tree_code __c)
2941{
2942  if (TREE_CODE (__t) == __c)
2943    tree_not_check_failed (__t, __f, __l, __g, __c, 0);
2944  return __t;
2945}
2946
2947inline const_tree
2948tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
2949             enum tree_code __c1, enum tree_code __c2)
2950{
2951  if (TREE_CODE (__t) != __c1
2952      && TREE_CODE (__t) != __c2)
2953    tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2954  return __t;
2955}
2956
2957inline const_tree
2958tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
2959                 enum tree_code __c1, enum tree_code __c2)
2960{
2961  if (TREE_CODE (__t) == __c1
2962      || TREE_CODE (__t) == __c2)
2963    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2964  return __t;
2965}
2966
2967inline const_tree
2968tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
2969             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2970{
2971  if (TREE_CODE (__t) != __c1
2972      && TREE_CODE (__t) != __c2
2973      && TREE_CODE (__t) != __c3)
2974    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2975  return __t;
2976}
2977
2978inline const_tree
2979tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
2980                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2981{
2982  if (TREE_CODE (__t) == __c1
2983      || TREE_CODE (__t) == __c2
2984      || TREE_CODE (__t) == __c3)
2985    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2986  return __t;
2987}
2988
2989inline const_tree
2990tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
2991             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2992             enum tree_code __c4)
2993{
2994  if (TREE_CODE (__t) != __c1
2995      && TREE_CODE (__t) != __c2
2996      && TREE_CODE (__t) != __c3
2997      && TREE_CODE (__t) != __c4)
2998    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2999  return __t;
3000}
3001
3002inline const_tree
3003tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3004                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3005                 enum tree_code __c4)
3006{
3007  if (TREE_CODE (__t) == __c1
3008      || TREE_CODE (__t) == __c2
3009      || TREE_CODE (__t) == __c3
3010      || TREE_CODE (__t) == __c4)
3011    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3012  return __t;
3013}
3014
3015inline const_tree
3016tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3017             enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3018             enum tree_code __c4, enum tree_code __c5)
3019{
3020  if (TREE_CODE (__t) != __c1
3021      && TREE_CODE (__t) != __c2
3022      && TREE_CODE (__t) != __c3
3023      && TREE_CODE (__t) != __c4
3024      && TREE_CODE (__t) != __c5)
3025    tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3026  return __t;
3027}
3028
3029inline const_tree
3030tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3031                 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3032                 enum tree_code __c4, enum tree_code __c5)
3033{
3034  if (TREE_CODE (__t) == __c1
3035      || TREE_CODE (__t) == __c2
3036      || TREE_CODE (__t) == __c3
3037      || TREE_CODE (__t) == __c4
3038      || TREE_CODE (__t) == __c5)
3039    tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3040  return __t;
3041}
3042
3043inline const_tree
3044contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3045                       const char *__f, int __l, const char *__g)
3046{
3047  if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3048      tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3049  return __t;
3050}
3051
3052inline const_tree
3053tree_class_check (const_tree __t, const enum tree_code_class __class,
3054                  const char *__f, int __l, const char *__g)
3055{
3056  if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3057    tree_class_check_failed (__t, __class, __f, __l, __g);
3058  return __t;
3059}
3060
3061inline const_tree
3062tree_range_check (const_tree __t,
3063                  enum tree_code __code1, enum tree_code __code2,
3064                  const char *__f, int __l, const char *__g)
3065{
3066  if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3067    tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3068  return __t;
3069}
3070
3071inline const_tree
3072omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3073                          const char *__f, int __l, const char *__g)
3074{
3075  if (TREE_CODE (__t) != OMP_CLAUSE)
3076    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3077  if (__t->omp_clause.code != __code)
3078    omp_clause_check_failed (__t, __f, __l, __g, __code);
3079  return __t;
3080}
3081
3082inline const_tree
3083omp_clause_range_check (const_tree __t,
3084                        enum omp_clause_code __code1,
3085                        enum omp_clause_code __code2,
3086                        const char *__f, int __l, const char *__g)
3087{
3088  if (TREE_CODE (__t) != OMP_CLAUSE)
3089    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3090  if ((int) __t->omp_clause.code < (int) __code1
3091      || (int) __t->omp_clause.code > (int) __code2)
3092    omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3093  return __t;
3094}
3095
3096inline const_tree
3097expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3098{
3099  char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3100  if (!IS_EXPR_CODE_CLASS (__c))
3101    tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3102  return __t;
3103}
3104
3105inline const_tree
3106non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3107{
3108  if (TYPE_P (__t))
3109    tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3110  return __t;
3111}
3112
3113inline const_tree *
3114tree_vec_elt_check (const_tree __t, int __i,
3115                    const char *__f, int __l, const char *__g)
3116{
3117  if (TREE_CODE (__t) != TREE_VEC)
3118    tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3119  if (__i < 0 || __i >= __t->base.u.length)
3120    tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3121  return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3122  //return &__t->vec.a[__i];
3123}
3124
3125inline const_tree *
3126omp_clause_elt_check (const_tree __t, int __i,
3127                      const char *__f, int __l, const char *__g)
3128{
3129  if (TREE_CODE (__t) != OMP_CLAUSE)
3130    tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3131  if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3132    omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3133  return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3134}
3135
3136#endif
3137
3138/* Compute the number of operands in an expression node NODE.  For
3139   tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3140   otherwise it is looked up from the node's code.  */
3141static inline int
3142tree_operand_length (const_tree node)
3143{
3144  if (VL_EXP_CLASS_P (node))
3145    return VL_EXP_OPERAND_LENGTH (node);
3146  else
3147    return TREE_CODE_LENGTH (TREE_CODE (node));
3148}
3149
3150#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3151
3152/* Special checks for TREE_OPERANDs.  */
3153inline tree *
3154tree_operand_check (tree __t, int __i,
3155                    const char *__f, int __l, const char *__g)
3156{
3157  const_tree __u = EXPR_CHECK (__t);
3158  if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3159    tree_operand_check_failed (__i, __u, __f, __l, __g);
3160  return &CONST_CAST_TREE (__u)->exp.operands[__i];
3161}
3162
3163inline tree *
3164tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3165                         const char *__f, int __l, const char *__g)
3166{
3167  if (TREE_CODE (__t) != __code)
3168    tree_check_failed (__t, __f, __l, __g, __code, 0);
3169  if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3170    tree_operand_check_failed (__i, __t, __f, __l, __g);
3171  return &__t->exp.operands[__i];
3172}
3173
3174inline const_tree *
3175tree_operand_check (const_tree __t, int __i,
3176                    const char *__f, int __l, const char *__g)
3177{
3178  const_tree __u = EXPR_CHECK (__t);
3179  if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3180    tree_operand_check_failed (__i, __u, __f, __l, __g);
3181  return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3182}
3183
3184inline const_tree *
3185tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3186                         const char *__f, int __l, const char *__g)
3187{
3188  if (TREE_CODE (__t) != __code)
3189    tree_check_failed (__t, __f, __l, __g, __code, 0);
3190  if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3191    tree_operand_check_failed (__i, __t, __f, __l, __g);
3192  return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3193}
3194
3195#endif
3196
3197#define error_mark_node                 global_trees[TI_ERROR_MARK]
3198
3199#define intQI_type_node                 global_trees[TI_INTQI_TYPE]
3200#define intHI_type_node                 global_trees[TI_INTHI_TYPE]
3201#define intSI_type_node                 global_trees[TI_INTSI_TYPE]
3202#define intDI_type_node                 global_trees[TI_INTDI_TYPE]
3203#define intTI_type_node                 global_trees[TI_INTTI_TYPE]
3204
3205#define unsigned_intQI_type_node        global_trees[TI_UINTQI_TYPE]
3206#define unsigned_intHI_type_node        global_trees[TI_UINTHI_TYPE]
3207#define unsigned_intSI_type_node        global_trees[TI_UINTSI_TYPE]
3208#define unsigned_intDI_type_node        global_trees[TI_UINTDI_TYPE]
3209#define unsigned_intTI_type_node        global_trees[TI_UINTTI_TYPE]
3210
3211#define atomicQI_type_node      global_trees[TI_ATOMICQI_TYPE]
3212#define atomicHI_type_node      global_trees[TI_ATOMICHI_TYPE]
3213#define atomicSI_type_node      global_trees[TI_ATOMICSI_TYPE]
3214#define atomicDI_type_node      global_trees[TI_ATOMICDI_TYPE]
3215#define atomicTI_type_node      global_trees[TI_ATOMICTI_TYPE]
3216
3217#define uint16_type_node                global_trees[TI_UINT16_TYPE]
3218#define uint32_type_node                global_trees[TI_UINT32_TYPE]
3219#define uint64_type_node                global_trees[TI_UINT64_TYPE]
3220
3221#define integer_zero_node               global_trees[TI_INTEGER_ZERO]
3222#define integer_one_node                global_trees[TI_INTEGER_ONE]
3223#define integer_three_node              global_trees[TI_INTEGER_THREE]
3224#define integer_minus_one_node          global_trees[TI_INTEGER_MINUS_ONE]
3225#define size_zero_node                  global_trees[TI_SIZE_ZERO]
3226#define size_one_node                   global_trees[TI_SIZE_ONE]
3227#define bitsize_zero_node               global_trees[TI_BITSIZE_ZERO]
3228#define bitsize_one_node                global_trees[TI_BITSIZE_ONE]
3229#define bitsize_unit_node               global_trees[TI_BITSIZE_UNIT]
3230
3231/* Base access nodes.  */
3232#define access_public_node              global_trees[TI_PUBLIC]
3233#define access_protected_node           global_trees[TI_PROTECTED]
3234#define access_private_node             global_trees[TI_PRIVATE]
3235
3236#define null_pointer_node               global_trees[TI_NULL_POINTER]
3237
3238#define float_type_node                 global_trees[TI_FLOAT_TYPE]
3239#define double_type_node                global_trees[TI_DOUBLE_TYPE]
3240#define long_double_type_node           global_trees[TI_LONG_DOUBLE_TYPE]
3241
3242#define float_ptr_type_node             global_trees[TI_FLOAT_PTR_TYPE]
3243#define double_ptr_type_node            global_trees[TI_DOUBLE_PTR_TYPE]
3244#define long_double_ptr_type_node       global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3245#define integer_ptr_type_node           global_trees[TI_INTEGER_PTR_TYPE]
3246
3247#define complex_integer_type_node       global_trees[TI_COMPLEX_INTEGER_TYPE]
3248#define complex_float_type_node         global_trees[TI_COMPLEX_FLOAT_TYPE]
3249#define complex_double_type_node        global_trees[TI_COMPLEX_DOUBLE_TYPE]
3250#define complex_long_double_type_node   global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3251
3252#define void_type_node                  global_trees[TI_VOID_TYPE]
3253/* The C type `void *'.  */
3254#define ptr_type_node                   global_trees[TI_PTR_TYPE]
3255/* The C type `const void *'.  */
3256#define const_ptr_type_node             global_trees[TI_CONST_PTR_TYPE]
3257/* The C type `size_t'.  */
3258#define size_type_node                  global_trees[TI_SIZE_TYPE]
3259#define pid_type_node                   global_trees[TI_PID_TYPE]
3260#define ptrdiff_type_node               global_trees[TI_PTRDIFF_TYPE]
3261#define va_list_type_node               global_trees[TI_VA_LIST_TYPE]
3262#define va_list_gpr_counter_field       global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3263#define va_list_fpr_counter_field       global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3264/* The C type `FILE *'.  */
3265#define fileptr_type_node               global_trees[TI_FILEPTR_TYPE]
3266#define pointer_sized_int_node          global_trees[TI_POINTER_SIZED_TYPE]
3267
3268#define boolean_type_node               global_trees[TI_BOOLEAN_TYPE]
3269#define boolean_false_node              global_trees[TI_BOOLEAN_FALSE]
3270#define boolean_true_node               global_trees[TI_BOOLEAN_TRUE]
3271
3272/* The decimal floating point types. */
3273#define dfloat32_type_node              global_trees[TI_DFLOAT32_TYPE]
3274#define dfloat64_type_node              global_trees[TI_DFLOAT64_TYPE]
3275#define dfloat128_type_node             global_trees[TI_DFLOAT128_TYPE]
3276#define dfloat32_ptr_type_node          global_trees[TI_DFLOAT32_PTR_TYPE]
3277#define dfloat64_ptr_type_node          global_trees[TI_DFLOAT64_PTR_TYPE]
3278#define dfloat128_ptr_type_node         global_trees[TI_DFLOAT128_PTR_TYPE]
3279
3280/* The fixed-point types.  */
3281#define sat_short_fract_type_node       global_trees[TI_SAT_SFRACT_TYPE]
3282#define sat_fract_type_node             global_trees[TI_SAT_FRACT_TYPE]
3283#define sat_long_fract_type_node        global_trees[TI_SAT_LFRACT_TYPE]
3284#define sat_long_long_fract_type_node   global_trees[TI_SAT_LLFRACT_TYPE]
3285#define sat_unsigned_short_fract_type_node \
3286                                        global_trees[TI_SAT_USFRACT_TYPE]
3287#define sat_unsigned_fract_type_node    global_trees[TI_SAT_UFRACT_TYPE]
3288#define sat_unsigned_long_fract_type_node \
3289                                        global_trees[TI_SAT_ULFRACT_TYPE]
3290#define sat_unsigned_long_long_fract_type_node \
3291                                        global_trees[TI_SAT_ULLFRACT_TYPE]
3292#define short_fract_type_node           global_trees[TI_SFRACT_TYPE]
3293#define fract_type_node                 global_trees[TI_FRACT_TYPE]
3294#define long_fract_type_node            global_trees[TI_LFRACT_TYPE]
3295#define long_long_fract_type_node       global_trees[TI_LLFRACT_TYPE]
3296#define unsigned_short_fract_type_node  global_trees[TI_USFRACT_TYPE]
3297#define unsigned_fract_type_node        global_trees[TI_UFRACT_TYPE]
3298#define unsigned_long_fract_type_node   global_trees[TI_ULFRACT_TYPE]
3299#define unsigned_long_long_fract_type_node \
3300                                        global_trees[TI_ULLFRACT_TYPE]
3301#define sat_short_accum_type_node       global_trees[TI_SAT_SACCUM_TYPE]
3302#define sat_accum_type_node             global_trees[TI_SAT_ACCUM_TYPE]
3303#define sat_long_accum_type_node        global_trees[TI_SAT_LACCUM_TYPE]
3304#define sat_long_long_accum_type_node   global_trees[TI_SAT_LLACCUM_TYPE]
3305#define sat_unsigned_short_accum_type_node \
3306                                        global_trees[TI_SAT_USACCUM_TYPE]
3307#define sat_unsigned_accum_type_node    global_trees[TI_SAT_UACCUM_TYPE]
3308#define sat_unsigned_long_accum_type_node \
3309                                        global_trees[TI_SAT_ULACCUM_TYPE]
3310#define sat_unsigned_long_long_accum_type_node \
3311                                        global_trees[TI_SAT_ULLACCUM_TYPE]
3312#define short_accum_type_node           global_trees[TI_SACCUM_TYPE]
3313#define accum_type_node                 global_trees[TI_ACCUM_TYPE]
3314#define long_accum_type_node            global_trees[TI_LACCUM_TYPE]
3315#define long_long_accum_type_node       global_trees[TI_LLACCUM_TYPE]
3316#define unsigned_short_accum_type_node  global_trees[TI_USACCUM_TYPE]
3317#define unsigned_accum_type_node        global_trees[TI_UACCUM_TYPE]
3318#define unsigned_long_accum_type_node   global_trees[TI_ULACCUM_TYPE]
3319#define unsigned_long_long_accum_type_node \
3320                                        global_trees[TI_ULLACCUM_TYPE]
3321#define qq_type_node                    global_trees[TI_QQ_TYPE]
3322#define hq_type_node                    global_trees[TI_HQ_TYPE]
3323#define sq_type_node                    global_trees[TI_SQ_TYPE]
3324#define dq_type_node                    global_trees[TI_DQ_TYPE]
3325#define tq_type_node                    global_trees[TI_TQ_TYPE]
3326#define uqq_type_node                   global_trees[TI_UQQ_TYPE]
3327#define uhq_type_node                   global_trees[TI_UHQ_TYPE]
3328#define usq_type_node                   global_trees[TI_USQ_TYPE]
3329#define udq_type_node                   global_trees[TI_UDQ_TYPE]
3330#define utq_type_node                   global_trees[TI_UTQ_TYPE]
3331#define sat_qq_type_node                global_trees[TI_SAT_QQ_TYPE]
3332#define sat_hq_type_node                global_trees[TI_SAT_HQ_TYPE]
3333#define sat_sq_type_node                global_trees[TI_SAT_SQ_TYPE]
3334#define sat_dq_type_node                global_trees[TI_SAT_DQ_TYPE]
3335#define sat_tq_type_node                global_trees[TI_SAT_TQ_TYPE]
3336#define sat_uqq_type_node               global_trees[TI_SAT_UQQ_TYPE]
3337#define sat_uhq_type_node               global_trees[TI_SAT_UHQ_TYPE]
3338#define sat_usq_type_node               global_trees[TI_SAT_USQ_TYPE]
3339#define sat_udq_type_node               global_trees[TI_SAT_UDQ_TYPE]
3340#define sat_utq_type_node               global_trees[TI_SAT_UTQ_TYPE]
3341#define ha_type_node                    global_trees[TI_HA_TYPE]
3342#define sa_type_node                    global_trees[TI_SA_TYPE]
3343#define da_type_node                    global_trees[TI_DA_TYPE]
3344#define ta_type_node                    global_trees[TI_TA_TYPE]
3345#define uha_type_node                   global_trees[TI_UHA_TYPE]
3346#define usa_type_node                   global_trees[TI_USA_TYPE]
3347#define uda_type_node                   global_trees[TI_UDA_TYPE]
3348#define uta_type_node                   global_trees[TI_UTA_TYPE]
3349#define sat_ha_type_node                global_trees[TI_SAT_HA_TYPE]
3350#define sat_sa_type_node                global_trees[TI_SAT_SA_TYPE]
3351#define sat_da_type_node                global_trees[TI_SAT_DA_TYPE]
3352#define sat_ta_type_node                global_trees[TI_SAT_TA_TYPE]
3353#define sat_uha_type_node               global_trees[TI_SAT_UHA_TYPE]
3354#define sat_usa_type_node               global_trees[TI_SAT_USA_TYPE]
3355#define sat_uda_type_node               global_trees[TI_SAT_UDA_TYPE]
3356#define sat_uta_type_node               global_trees[TI_SAT_UTA_TYPE]
3357
3358/* The node that should be placed at the end of a parameter list to
3359   indicate that the function does not take a variable number of
3360   arguments.  The TREE_VALUE will be void_type_node and there will be
3361   no TREE_CHAIN.  Language-independent code should not assume
3362   anything else about this node.  */
3363#define void_list_node                  global_trees[TI_VOID_LIST_NODE]
3364
3365#define main_identifier_node            global_trees[TI_MAIN_IDENTIFIER]
3366#define MAIN_NAME_P(NODE) \
3367  (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3368
3369/* Optimization options (OPTIMIZATION_NODE) to use for default and current
3370   functions.  */
3371#define optimization_default_node       global_trees[TI_OPTIMIZATION_DEFAULT]
3372#define optimization_current_node       global_trees[TI_OPTIMIZATION_CURRENT]
3373
3374/* Default/current target options (TARGET_OPTION_NODE).  */
3375#define target_option_default_node      global_trees[TI_TARGET_OPTION_DEFAULT]
3376#define target_option_current_node      global_trees[TI_TARGET_OPTION_CURRENT]
3377
3378/* Default tree list option(), optimize() pragmas to be linked into the
3379   attribute list.  */
3380#define current_target_pragma           global_trees[TI_CURRENT_TARGET_PRAGMA]
3381#define current_optimize_pragma         global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3382
3383#define char_type_node                  integer_types[itk_char]
3384#define signed_char_type_node           integer_types[itk_signed_char]
3385#define unsigned_char_type_node         integer_types[itk_unsigned_char]
3386#define short_integer_type_node         integer_types[itk_short]
3387#define short_unsigned_type_node        integer_types[itk_unsigned_short]
3388#define integer_type_node               integer_types[itk_int]
3389#define unsigned_type_node              integer_types[itk_unsigned_int]
3390#define long_integer_type_node          integer_types[itk_long]
3391#define long_unsigned_type_node         integer_types[itk_unsigned_long]
3392#define long_long_integer_type_node     integer_types[itk_long_long]
3393#define long_long_unsigned_type_node    integer_types[itk_unsigned_long_long]
3394#define int128_integer_type_node        integer_types[itk_int128]
3395#define int128_unsigned_type_node       integer_types[itk_unsigned_int128]
3396
3397#define NULL_TREE (tree) NULL
3398
3399/* True if NODE is an erroneous expression.  */
3400
3401#define error_operand_p(NODE)                                   \
3402  ((NODE) == error_mark_node                                    \
3403   || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3404
3405extern tree decl_assembler_name (tree);
3406
3407/* Compute the number of bytes occupied by 'node'.  This routine only
3408   looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH.  */
3409
3410extern size_t tree_size (const_tree);
3411
3412/* Compute the number of bytes occupied by a tree with code CODE.  This
3413   function cannot be used for TREE_VEC codes, which are of variable
3414   length.  */
3415extern size_t tree_code_size (enum tree_code);
3416
3417/* Allocate and return a new UID from the DECL_UID namespace.  */
3418extern int allocate_decl_uid (void);
3419
3420/* Lowest level primitive for allocating a node.
3421   The TREE_CODE is the only argument.  Contents are initialized
3422   to zero except for a few of the common fields.  */
3423
3424extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3425#define make_node(t) make_node_stat (t MEM_STAT_INFO)
3426
3427/* Make a copy of a node, with all the same contents.  */
3428
3429extern tree copy_node_stat (tree MEM_STAT_DECL);
3430#define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3431
3432/* Make a copy of a chain of TREE_LIST nodes.  */
3433
3434extern tree copy_list (tree);
3435
3436/* Make a CASE_LABEL_EXPR.  */
3437
3438extern tree build_case_label (tree, tree, tree);
3439
3440/* Make a BINFO.  */
3441extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3442#define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3443
3444/* Make a TREE_VEC.  */
3445
3446extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3447#define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3448
3449/* Grow a TREE_VEC.  */
3450
3451extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3452#define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3453
3454/* Construct various types of nodes.  */
3455
3456extern tree build_nt (enum tree_code, ...);
3457extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3458
3459extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3460#define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3461extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3462#define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3463extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3464#define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3465extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3466#define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3467extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3468                         tree MEM_STAT_DECL);
3469#define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3470extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3471                         tree MEM_STAT_DECL);
3472#define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3473
3474/* _loc versions of build[1-5].  */
3475
3476static inline tree
3477build1_stat_loc (location_t loc, enum tree_code code, tree type,
3478                 tree arg1 MEM_STAT_DECL)
3479{
3480  tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3481  if (CAN_HAVE_LOCATION_P (t))
3482    SET_EXPR_LOCATION (t, loc);
3483  return t;
3484}
3485#define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3486
3487static inline tree
3488build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3489                 tree arg1 MEM_STAT_DECL)
3490{
3491  tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3492  if (CAN_HAVE_LOCATION_P (t))
3493    SET_EXPR_LOCATION (t, loc);
3494  return t;
3495}
3496#define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3497
3498static inline tree
3499build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3500                 tree arg1, tree arg2 MEM_STAT_DECL)
3501{
3502  tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3503  if (CAN_HAVE_LOCATION_P (t))
3504    SET_EXPR_LOCATION (t, loc);
3505  return t;
3506}
3507#define build3_loc(l,c,t1,t2,t3,t4) \
3508  build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3509
3510static inline tree
3511build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3512                 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3513{
3514  tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3515  if (CAN_HAVE_LOCATION_P (t))
3516    SET_EXPR_LOCATION (t, loc);
3517  return t;
3518}
3519#define build4_loc(l,c,t1,t2,t3,t4,t5) \
3520  build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3521
3522static inline tree
3523build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3524                 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3525{
3526  tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3527                        arg4 PASS_MEM_STAT);
3528  if (CAN_HAVE_LOCATION_P (t))
3529    SET_EXPR_LOCATION (t, loc);
3530  return t;
3531}
3532#define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3533  build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3534
3535extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3536#define build_var_debug_value(t1,t2) \
3537  build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3538
3539/* Constructs double_int from tree CST.  */
3540
3541static inline double_int
3542tree_to_double_int (const_tree cst)
3543{
3544  return TREE_INT_CST (cst);
3545}
3546
3547extern tree double_int_to_tree (tree, double_int);
3548extern bool double_int_fits_to_tree_p (const_tree, double_int);
3549extern tree force_fit_type_double (tree, double_int, int, bool);
3550
3551/* Create an INT_CST node with a CST value zero extended.  */
3552
3553static inline tree
3554build_int_cstu (tree type, unsigned HOST_WIDE_INT cst)
3555{
3556  return double_int_to_tree (type, double_int::from_uhwi (cst));
3557}
3558
3559extern tree build_int_cst (tree, HOST_WIDE_INT);
3560extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3561extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3562extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3563#define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3564extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3565#define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3566extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3567extern tree build_vector_from_val (tree, tree);
3568extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3569extern tree build_constructor_single (tree, tree, tree);
3570extern tree build_constructor_from_list (tree, tree);
3571extern tree build_constructor_va (tree, int, ...);
3572extern tree build_real_from_int_cst (tree, const_tree);
3573extern tree build_complex (tree, tree, tree);
3574extern tree build_one_cst (tree);
3575extern tree build_minus_one_cst (tree);
3576extern tree build_all_ones_cst (tree);
3577extern tree build_zero_cst (tree);
3578extern tree build_string (int, const char *);
3579extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3580#define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3581extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3582#define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3583extern tree build_decl_stat (location_t, enum tree_code,
3584                             tree, tree MEM_STAT_DECL);
3585extern tree build_fn_decl (const char *, tree);
3586#define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3587extern tree build_translation_unit_decl (tree);
3588extern tree build_block (tree, tree, tree, tree);
3589extern tree build_empty_stmt (location_t);
3590extern tree build_omp_clause (location_t, enum omp_clause_code);
3591
3592extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3593#define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3594
3595extern tree build_call_nary (tree, tree, int, ...);
3596extern tree build_call_valist (tree, tree, int, va_list);
3597#define build_call_array(T1,T2,N,T3)\
3598   build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3599extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3600extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3601
3602/* Construct various nodes representing data types.  */
3603
3604extern tree signed_or_unsigned_type_for (int, tree);
3605extern tree signed_type_for (tree);
3606extern tree unsigned_type_for (tree);
3607extern tree truth_type_for (tree);
3608extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3609extern tree build_pointer_type (tree);
3610extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3611extern tree build_reference_type (tree);
3612extern tree build_vector_type_for_mode (tree, enum machine_mode);
3613extern tree build_vector_type (tree innertype, int nunits);
3614extern tree build_opaque_vector_type (tree innertype, int nunits);
3615extern tree build_index_type (tree);
3616extern tree build_array_type (tree, tree);
3617extern tree build_nonshared_array_type (tree, tree);
3618extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
3619extern tree build_function_type (tree, tree);
3620extern tree build_function_type_list (tree, ...);
3621extern tree build_varargs_function_type_list (tree, ...);
3622extern tree build_function_type_array (tree, int, tree *);
3623extern tree build_varargs_function_type_array (tree, int, tree *);
3624#define build_function_type_vec(RET, V) \
3625  build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3626#define build_varargs_function_type_vec(RET, V) \
3627  build_varargs_function_type_array (RET, vec_safe_length (V), \
3628                                     vec_safe_address (V))
3629extern tree build_method_type_directly (tree, tree, tree);
3630extern tree build_method_type (tree, tree);
3631extern tree build_offset_type (tree, tree);
3632extern tree build_complex_type (tree);
3633extern tree array_type_nelts (const_tree);
3634
3635extern tree value_member (tree, tree);
3636extern tree purpose_member (const_tree, tree);
3637extern bool vec_member (const_tree, vec<tree, va_gc> *);
3638extern tree chain_index (int, tree);
3639
3640extern int attribute_list_equal (const_tree, const_tree);
3641extern int attribute_list_contained (const_tree, const_tree);
3642extern int tree_int_cst_equal (const_tree, const_tree);
3643extern int tree_int_cst_lt (const_tree, const_tree);
3644extern int tree_int_cst_compare (const_tree, const_tree);
3645extern bool tree_fits_shwi_p (const_tree)
3646#ifndef ENABLE_TREE_CHECKING
3647  ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled.  */
3648#endif
3649  ;
3650extern bool tree_fits_uhwi_p (const_tree)
3651#ifndef ENABLE_TREE_CHECKING
3652  ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled.  */
3653#endif
3654  ;
3655extern HOST_WIDE_INT tree_to_shwi (const_tree);
3656extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
3657#if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3658extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
3659tree_to_shwi (const_tree t)
3660{
3661  gcc_assert (tree_fits_shwi_p (t));
3662  return TREE_INT_CST_LOW (t);
3663}
3664
3665extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
3666tree_to_uhwi (const_tree t)
3667{
3668  gcc_assert (tree_fits_uhwi_p (t));
3669  return TREE_INT_CST_LOW (t);
3670}
3671#endif
3672extern int tree_int_cst_sgn (const_tree);
3673extern int tree_int_cst_sign_bit (const_tree);
3674extern unsigned int tree_int_cst_min_precision (tree, bool);
3675extern tree strip_array_types (tree);
3676extern tree excess_precision_type (tree);
3677extern bool valid_constant_size_p (const_tree);
3678
3679
3680/* From expmed.c.  Since rtl.h is included after tree.h, we can't
3681   put the prototype here.  Rtl.h does declare the prototype if
3682   tree.h had been included.  */
3683
3684extern tree make_tree (tree, rtx);
3685
3686/* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3687   is ATTRIBUTE.
3688
3689   Such modified types already made are recorded so that duplicates
3690   are not made.  */
3691
3692extern tree build_type_attribute_variant (tree, tree);
3693extern tree build_decl_attribute_variant (tree, tree);
3694extern tree build_type_attribute_qual_variant (tree, tree, int);
3695
3696/* Return 0 if the attributes for two types are incompatible, 1 if they
3697   are compatible, and 2 if they are nearly compatible (which causes a
3698   warning to be generated).  */
3699extern int comp_type_attributes (const_tree, const_tree);
3700
3701/* Default versions of target-overridable functions.  */
3702extern tree merge_decl_attributes (tree, tree);
3703extern tree merge_type_attributes (tree, tree);
3704
3705/* This function is a private implementation detail of lookup_attribute()
3706   and you should never call it directly.  */
3707extern tree private_lookup_attribute (const char *, size_t, tree);
3708
3709/* Given an attribute name ATTR_NAME and a list of attributes LIST,
3710   return a pointer to the attribute's list element if the attribute
3711   is part of the list, or NULL_TREE if not found.  If the attribute
3712   appears more than once, this only returns the first occurrence; the
3713   TREE_CHAIN of the return value should be passed back in if further
3714   occurrences are wanted.  ATTR_NAME must be in the form 'text' (not
3715   '__text__').  */
3716
3717static inline tree
3718lookup_attribute (const char *attr_name, tree list)
3719{
3720  gcc_checking_assert (attr_name[0] != '_'); 
3721  /* In most cases, list is NULL_TREE.  */
3722  if (list == NULL_TREE)
3723    return NULL_TREE;
3724  else
3725    /* Do the strlen() before calling the out-of-line implementation.
3726       In most cases attr_name is a string constant, and the compiler
3727       will optimize the strlen() away.  */
3728    return private_lookup_attribute (attr_name, strlen (attr_name), list);
3729}
3730
3731/* This function is a private implementation detail of
3732   is_attribute_p() and you should never call it directly.  */
3733extern bool private_is_attribute_p (const char *, size_t, const_tree);
3734
3735/* Given an identifier node IDENT and a string ATTR_NAME, return true
3736   if the identifier node is a valid attribute name for the string.
3737   ATTR_NAME must be in the form 'text' (not '__text__').  IDENT could
3738   be the identifier for 'text' or for '__text__'.  */
3739
3740static inline bool
3741is_attribute_p (const char *attr_name, const_tree ident)
3742{
3743  gcc_checking_assert (attr_name[0] != '_');
3744  /* Do the strlen() before calling the out-of-line implementation.
3745     In most cases attr_name is a string constant, and the compiler
3746     will optimize the strlen() away.  */
3747  return private_is_attribute_p (attr_name, strlen (attr_name), ident);
3748}
3749
3750/* Remove any instances of attribute ATTR_NAME in LIST and return the
3751   modified list.  ATTR_NAME must be in the form 'text' (not
3752   '__text__').  */
3753
3754extern tree remove_attribute (const char *, tree);
3755
3756/* Given two attributes lists, return a list of their union.  */
3757
3758extern tree merge_attributes (tree, tree);
3759
3760#if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3761/* Given two Windows decl attributes lists, possibly including
3762   dllimport, return a list of their union .  */
3763extern tree merge_dllimport_decl_attributes (tree, tree);
3764
3765/* Handle a "dllimport" or "dllexport" attribute.  */
3766extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3767#endif
3768
3769/* Check whether CAND is suitable to be returned from get_qualified_type
3770   (BASE, TYPE_QUALS).  */
3771
3772extern bool check_qualified_type (const_tree, const_tree, int);
3773
3774/* Return a version of the TYPE, qualified as indicated by the
3775   TYPE_QUALS, if one exists.  If no qualified version exists yet,
3776   return NULL_TREE.  */
3777
3778extern tree get_qualified_type (tree, int);
3779
3780/* Like get_qualified_type, but creates the type if it does not
3781   exist.  This function never returns NULL_TREE.  */
3782
3783extern tree build_qualified_type (tree, int);
3784
3785/* Create a variant of type T with alignment ALIGN.  */
3786
3787extern tree build_aligned_type (tree, unsigned int);
3788
3789/* Like build_qualified_type, but only deals with the `const' and
3790   `volatile' qualifiers.  This interface is retained for backwards
3791   compatibility with the various front-ends; new code should use
3792   build_qualified_type instead.  */
3793
3794#define build_type_variant(TYPE, CONST_P, VOLATILE_P)                   \
3795  build_qualified_type ((TYPE),                                         \
3796                        ((CONST_P) ? TYPE_QUAL_CONST : 0)               \
3797                        | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3798
3799/* Make a copy of a type node.  */
3800
3801extern tree build_distinct_type_copy (tree);
3802extern tree build_variant_type_copy (tree);
3803
3804/* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3805   return a canonicalized ..._TYPE node, so that duplicates are not made.
3806   How the hash code is computed is up to the caller, as long as any two
3807   callers that could hash identical-looking type nodes agree.  */
3808
3809extern tree type_hash_canon (unsigned int, tree);
3810
3811extern tree convert (tree, tree);
3812extern unsigned int expr_align (const_tree);
3813extern tree size_in_bytes (const_tree);
3814extern HOST_WIDE_INT int_size_in_bytes (const_tree);
3815extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
3816extern tree bit_position (const_tree);
3817extern HOST_WIDE_INT int_bit_position (const_tree);
3818extern tree byte_position (const_tree);
3819extern HOST_WIDE_INT int_byte_position (const_tree);
3820
3821#define sizetype sizetype_tab[(int) stk_sizetype]
3822#define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3823#define ssizetype sizetype_tab[(int) stk_ssizetype]
3824#define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3825#define size_int(L) size_int_kind (L, stk_sizetype)
3826#define ssize_int(L) size_int_kind (L, stk_ssizetype)
3827#define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3828#define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3829
3830/* Type for sizes of data-type.  */
3831
3832#define BITS_PER_UNIT_LOG \
3833  ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3834   + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3835   + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3836
3837/* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3838   by making the last node in X point to Y.
3839   Returns X, except if X is 0 returns Y.  */
3840
3841extern tree chainon (tree, tree);
3842
3843/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN.  */
3844
3845extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3846#define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3847
3848/* Return the last tree node in a chain.  */
3849
3850extern tree tree_last (tree);
3851
3852/* Reverse the order of elements in a chain, and return the new head.  */
3853
3854extern tree nreverse (tree);
3855
3856/* Returns the length of a chain of nodes
3857   (number of chain pointers to follow before reaching a null pointer).  */
3858
3859extern int list_length (const_tree);
3860
3861/* Returns the first FIELD_DECL in a type.  */
3862
3863extern tree first_field (const_tree);
3864
3865/* Given an initializer INIT, return TRUE if INIT is zero or some
3866   aggregate of zeros.  Otherwise return FALSE.  */
3867
3868extern bool initializer_zerop (const_tree);
3869
3870/* Given a vector VEC, return its first element if all elements are
3871   the same.  Otherwise return NULL_TREE.  */
3872
3873extern tree uniform_vector_p (const_tree);
3874
3875/* Given a CONSTRUCTOR CTOR, return the element values as a vector.  */
3876
3877extern vec<tree, va_gc> *ctor_to_vec (tree);
3878
3879/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0.  */
3880
3881extern int integer_zerop (const_tree);
3882
3883/* integer_onep (tree x) is nonzero if X is an integer constant of value 1.  */
3884
3885extern int integer_onep (const_tree);
3886
3887/* integer_all_onesp (tree x) is nonzero if X is an integer constant
3888   all of whose significant bits are 1.  */
3889
3890extern int integer_all_onesp (const_tree);
3891
3892/* integer_minus_onep (tree x) is nonzero if X is an integer constant of
3893   value -1.  */
3894
3895extern int integer_minus_onep (const_tree);
3896
3897/* integer_pow2p (tree x) is nonzero is X is an integer constant with
3898   exactly one bit 1.  */
3899
3900extern int integer_pow2p (const_tree);
3901
3902/* integer_nonzerop (tree x) is nonzero if X is an integer constant
3903   with a nonzero value.  */
3904
3905extern int integer_nonzerop (const_tree);
3906
3907extern bool cst_and_fits_in_hwi (const_tree);
3908extern tree num_ending_zeros (const_tree);
3909
3910/* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
3911   value 0.  */
3912
3913extern int fixed_zerop (const_tree);
3914
3915/* staticp (tree x) is nonzero if X is a reference to data allocated
3916   at a fixed address in memory.  Returns the outermost data.  */
3917
3918extern tree staticp (tree);
3919
3920/* save_expr (EXP) returns an expression equivalent to EXP
3921   but it can be used multiple times within context CTX
3922   and only evaluate EXP once.  */
3923
3924extern tree save_expr (tree);
3925
3926/* Look inside EXPR into any simple arithmetic operations.  Return the
3927   outermost non-arithmetic or non-invariant node.  */
3928
3929extern tree skip_simple_arithmetic (tree);
3930
3931/* Look inside EXPR into simple arithmetic operations involving constants.
3932   Return the outermost non-arithmetic or non-constant node.  */
3933
3934extern tree skip_simple_constant_arithmetic (tree);
3935
3936/* Return which tree structure is used by T.  */
3937
3938enum tree_node_structure_enum tree_node_structure (const_tree);
3939
3940/* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3941   size or offset that depends on a field within a record.  */
3942
3943extern bool contains_placeholder_p (const_tree);
3944
3945/* This macro calls the above function but short-circuits the common
3946   case of a constant to save time.  Also check for null.  */
3947
3948#define CONTAINS_PLACEHOLDER_P(EXP) \
3949  ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3950
3951/* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3952   directly.  This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3953   field positions.  */
3954
3955extern bool type_contains_placeholder_p (tree);
3956
3957/* Given a tree EXP, find all occurrences of references to fields
3958   in a PLACEHOLDER_EXPR and place them in vector REFS without
3959   duplicates.  Also record VAR_DECLs and CONST_DECLs.  Note that
3960   we assume here that EXP contains only arithmetic expressions
3961   or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3962   argument list.  */
3963
3964extern void find_placeholder_in_expr (tree, vec<tree> *);
3965
3966/* This macro calls the above function but short-circuits the common
3967   case of a constant to save time and also checks for NULL.  */
3968
3969#define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
3970do {                                     \
3971  if((EXP) && !TREE_CONSTANT (EXP))      \
3972    find_placeholder_in_expr (EXP, V);   \
3973} while (0)
3974
3975/* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3976   return a tree with all occurrences of references to F in a
3977   PLACEHOLDER_EXPR replaced by R.  Also handle VAR_DECLs and
3978   CONST_DECLs.  Note that we assume here that EXP contains only
3979   arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3980   occurring only in their argument list.  */
3981
3982extern tree substitute_in_expr (tree, tree, tree);
3983
3984/* This macro calls the above function but short-circuits the common
3985   case of a constant to save time and also checks for NULL.  */
3986
3987#define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3988  ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3989
3990/* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3991   for it within OBJ, a tree that is an object or a chain of references.  */
3992
3993extern tree substitute_placeholder_in_expr (tree, tree);
3994
3995/* This macro calls the above function but short-circuits the common
3996   case of a constant to save time and also checks for NULL.  */
3997
3998#define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3999  ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP)    \
4000   : substitute_placeholder_in_expr (EXP, OBJ))
4001
4002
4003/* stabilize_reference (EXP) returns a reference equivalent to EXP
4004   but it can be used multiple times
4005   and only evaluate the subexpressions once.  */
4006
4007extern tree stabilize_reference (tree);
4008
4009/* Return EXP, stripped of any conversions to wider types
4010   in such a way that the result of converting to type FOR_TYPE
4011   is the same as if EXP were converted to FOR_TYPE.
4012   If FOR_TYPE is 0, it signifies EXP's type.  */
4013
4014extern tree get_unwidened (tree, tree);
4015
4016/* Return OP or a simpler expression for a narrower value
4017   which can be sign-extended or zero-extended to give back OP.
4018   Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4019   or 0 if the value should be sign-extended.  */
4020
4021extern tree get_narrower (tree, int *);
4022
4023/* Return true if T is an expression that get_inner_reference handles.  */
4024
4025static inline bool
4026handled_component_p (const_tree t)
4027{
4028  switch (TREE_CODE (t))
4029    {
4030    case COMPONENT_REF:
4031    case BIT_FIELD_REF:
4032    case ARRAY_REF:
4033    case ARRAY_RANGE_REF:
4034    case REALPART_EXPR:
4035    case IMAGPART_EXPR:
4036    case VIEW_CONVERT_EXPR:
4037      return true;
4038
4039    default:
4040      return false;
4041    }
4042}
4043
4044/* Given a DECL or TYPE, return the scope in which it was declared, or
4045   NUL_TREE if there is no containing scope.  */
4046
4047extern tree get_containing_scope (const_tree);
4048
4049/* Return the FUNCTION_DECL which provides this _DECL with its context,
4050   or zero if none.  */
4051extern tree decl_function_context (const_tree);
4052
4053/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4054   this _DECL with its context, or zero if none.  */
4055extern tree decl_type_context (const_tree);
4056
4057/* Return 1 if EXPR is the real constant zero.  */
4058extern int real_zerop (const_tree);
4059
4060/* Initialize the iterator I with arguments from function FNDECL  */
4061
4062static inline void
4063function_args_iter_init (function_args_iterator *i, const_tree fntype)
4064{
4065  i->next = TYPE_ARG_TYPES (fntype);
4066}
4067
4068/* Return a pointer that holds the next argument if there are more arguments to
4069   handle, otherwise return NULL.  */
4070
4071static inline tree *
4072function_args_iter_cond_ptr (function_args_iterator *i)
4073{
4074  return (i->next) ? &TREE_VALUE (i->next) : NULL;
4075}
4076
4077/* Return the next argument if there are more arguments to handle, otherwise
4078   return NULL.  */
4079
4080static inline tree
4081function_args_iter_cond (function_args_iterator *i)
4082{
4083  return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4084}
4085
4086/* Advance to the next argument.  */
4087static inline void
4088function_args_iter_next (function_args_iterator *i)
4089{
4090  gcc_assert (i->next != NULL_TREE);
4091  i->next = TREE_CHAIN (i->next);
4092}
4093
4094/* We set BLOCK_SOURCE_LOCATION only to inlined function entry points.  */
4095
4096static inline bool
4097inlined_function_outer_scope_p (const_tree block)
4098{
4099 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4100}
4101
4102/* Loop over all function arguments of FNTYPE.  In each iteration, PTR is set
4103   to point to the next tree element.  ITER is an instance of
4104   function_args_iterator used to iterate the arguments.  */
4105#define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER)                    \
4106  for (function_args_iter_init (&(ITER), (FNTYPE));                     \
4107       (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL;           \
4108       function_args_iter_next (&(ITER)))
4109
4110/* Loop over all function arguments of FNTYPE.  In each iteration, TREE is set
4111   to the next tree element.  ITER is an instance of function_args_iterator
4112   used to iterate the arguments.  */
4113#define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER)                       \
4114  for (function_args_iter_init (&(ITER), (FNTYPE));                     \
4115       (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE;         \
4116       function_args_iter_next (&(ITER)))
4117
4118/* In tree.c */
4119extern unsigned crc32_string (unsigned, const char *);
4120extern unsigned crc32_byte (unsigned, char);
4121extern unsigned crc32_unsigned (unsigned, unsigned);
4122extern void clean_symbol_name (char *);
4123extern tree get_file_function_name (const char *);
4124extern tree get_callee_fndecl (const_tree);
4125extern int type_num_arguments (const_tree);
4126extern bool associative_tree_code (enum tree_code);
4127extern bool commutative_tree_code (enum tree_code);
4128extern bool commutative_ternary_tree_code (enum tree_code);
4129extern tree upper_bound_in_type (tree, tree);
4130extern tree lower_bound_in_type (tree, tree);
4131extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4132extern tree create_artificial_label (location_t);
4133extern const char *get_name (tree);
4134extern bool stdarg_p (const_tree);
4135extern bool prototype_p (tree);
4136extern bool is_typedef_decl (tree x);
4137extern bool typedef_variant_p (tree);
4138extern bool auto_var_in_fn_p (const_tree, const_tree);
4139extern tree build_low_bits_mask (tree, unsigned);
4140extern tree tree_strip_nop_conversions (tree);
4141extern tree tree_strip_sign_nop_conversions (tree);
4142extern const_tree strip_invariant_refs (const_tree);
4143extern tree lhd_gcc_personality (void);
4144extern void assign_assembler_name_if_neeeded (tree);
4145extern void warn_deprecated_use (tree, tree);
4146extern void cache_integer_cst (tree);
4147
4148/* Compare and hash for any structure which begins with a canonical
4149   pointer.  Assumes all pointers are interchangeable, which is sort
4150   of already assumed by gcc elsewhere IIRC.  */
4151
4152static inline int
4153struct_ptr_eq (const void *a, const void *b)
4154{
4155  const void * const * x = (const void * const *) a;
4156  const void * const * y = (const void * const *) b;
4157  return *x == *y;
4158}
4159
4160static inline hashval_t
4161struct_ptr_hash (const void *a)
4162{
4163  const void * const * x = (const void * const *) a;
4164  return (intptr_t)*x >> 4;
4165}
4166
4167/* Return nonzero if CODE is a tree code that represents a truth value.  */
4168static inline bool
4169truth_value_p (enum tree_code code)
4170{
4171  return (TREE_CODE_CLASS (code) == tcc_comparison
4172          || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4173          || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4174          || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4175}
4176
4177/* Return whether TYPE is a type suitable for an offset for
4178   a POINTER_PLUS_EXPR.  */
4179static inline bool
4180ptrofftype_p (tree type)
4181{
4182  return (INTEGRAL_TYPE_P (type)
4183          && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4184          && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4185}
4186
4187/* Return OFF converted to a pointer offset type suitable as offset for
4188   POINTER_PLUS_EXPR.  Use location LOC for this conversion.  */
4189static inline tree
4190convert_to_ptrofftype_loc (location_t loc, tree off)
4191{
4192  return fold_convert_loc (loc, sizetype, off);
4193}
4194#define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4195
4196/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF.  */
4197static inline tree
4198fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off)
4199{
4200  return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4201                          ptr, fold_convert_loc (loc, sizetype, off));
4202}
4203#define fold_build_pointer_plus(p,o) \
4204        fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4205
4206/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF.  */
4207static inline tree
4208fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off)
4209{
4210  return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4211                          ptr, size_int (off));
4212}
4213#define fold_build_pointer_plus_hwi(p,o) \
4214        fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4215
4216extern tree strip_float_extensions (tree);
4217extern int really_constant_p (const_tree);
4218extern bool decl_address_invariant_p (const_tree);
4219extern bool decl_address_ip_invariant_p (const_tree);
4220extern bool int_fits_type_p (const_tree, const_tree);
4221#ifndef GENERATOR_FILE
4222extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4223#endif
4224extern bool variably_modified_type_p (tree, tree);
4225extern int tree_log2 (const_tree);
4226extern int tree_floor_log2 (const_tree);
4227extern unsigned int tree_ctz (const_tree);
4228extern int simple_cst_equal (const_tree, const_tree);
4229extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4230extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4231extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
4232extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4233extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4234extern int type_list_equal (const_tree, const_tree);
4235extern int chain_member (const_tree, const_tree);
4236extern void dump_tree_statistics (void);
4237extern void recompute_tree_invariant_for_addr_expr (tree);
4238extern bool needs_to_live_in_memory (const_tree);
4239extern tree reconstruct_complex_type (tree, tree);
4240extern int real_onep (const_tree);
4241extern int real_minus_onep (const_tree);
4242extern void init_ttree (void);
4243extern void build_common_tree_nodes (bool, bool);
4244extern void build_common_builtin_nodes (void);
4245extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4246extern tree build_range_type (tree, tree, tree);
4247extern tree build_nonshared_range_type (tree, tree, tree);
4248extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4249extern HOST_WIDE_INT int_cst_value (const_tree);
4250extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
4251extern tree tree_block (tree);
4252extern void tree_set_block (tree, tree);
4253extern location_t *block_nonartificial_location (tree);
4254extern location_t tree_nonartificial_location (tree);
4255extern tree block_ultimate_origin (const_tree);
4256extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4257extern bool virtual_method_call_p (tree);
4258extern tree obj_type_ref_class (tree ref);
4259extern bool types_same_for_odr (tree type1, tree type2);
4260extern bool contains_bitfld_component_ref_p (const_tree);
4261extern bool type_in_anonymous_namespace_p (tree);
4262extern bool block_may_fallthru (const_tree);
4263extern void using_eh_for_cleanups (void);
4264extern bool using_eh_for_cleanups_p (void);
4265extern const char *get_tree_code_name (enum tree_code);
4266extern void set_call_expr_flags (tree, int);
4267extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
4268                         walk_tree_lh);
4269extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4270                                            walk_tree_lh);
4271#define walk_tree(a,b,c,d) \
4272        walk_tree_1 (a, b, c, d, NULL)
4273#define walk_tree_without_duplicates(a,b,c) \
4274        walk_tree_without_duplicates_1 (a, b, c, NULL)
4275
4276extern tree get_base_address (tree t);
4277extern tree drop_tree_overflow (tree);
4278extern int tree_map_base_eq (const void *, const void *);
4279extern unsigned int tree_map_base_hash (const void *);
4280extern int tree_map_base_marked_p (const void *);
4281
4282#define tree_map_eq tree_map_base_eq
4283extern unsigned int tree_map_hash (const void *);
4284#define tree_map_marked_p tree_map_base_marked_p
4285
4286#define tree_decl_map_eq tree_map_base_eq
4287extern unsigned int tree_decl_map_hash (const void *);
4288#define tree_decl_map_marked_p tree_map_base_marked_p
4289
4290#define tree_int_map_eq tree_map_base_eq
4291#define tree_int_map_hash tree_map_base_hash
4292#define tree_int_map_marked_p tree_map_base_marked_p
4293
4294#define tree_priority_map_eq tree_map_base_eq
4295#define tree_priority_map_hash tree_map_base_hash
4296#define tree_priority_map_marked_p tree_map_base_marked_p
4297
4298#define tree_vec_map_eq tree_map_base_eq
4299#define tree_vec_map_hash tree_decl_map_hash
4300#define tree_vec_map_marked_p tree_map_base_marked_p
4301
4302/* Initialize the abstract argument list iterator object ITER with the
4303   arguments from CALL_EXPR node EXP.  */
4304static inline void
4305init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4306{
4307  iter->t = exp;
4308  iter->n = call_expr_nargs (exp);
4309  iter->i = 0;
4310}
4311
4312static inline void
4313init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4314{
4315  iter->t = exp;
4316  iter->n = call_expr_nargs (exp);
4317  iter->i = 0;
4318}
4319
4320/* Return the next argument from abstract argument list iterator object ITER,
4321   and advance its state.  Return NULL_TREE if there are no more arguments.  */
4322static inline tree
4323next_call_expr_arg (call_expr_arg_iterator *iter)
4324{
4325  tree result;
4326  if (iter->i >= iter->n)
4327    return NULL_TREE;
4328  result = CALL_EXPR_ARG (iter->t, iter->i);
4329  iter->i++;
4330  return result;
4331}
4332
4333static inline const_tree
4334next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4335{
4336  const_tree result;
4337  if (iter->i >= iter->n)
4338    return NULL_TREE;
4339  result = CALL_EXPR_ARG (iter->t, iter->i);
4340  iter->i++;
4341  return result;
4342}
4343
4344/* Initialize the abstract argument list iterator object ITER, then advance
4345   past and return the first argument.  Useful in for expressions, e.g.
4346     for (arg = first_call_expr_arg (exp, &iter); arg;
4347          arg = next_call_expr_arg (&iter))   */
4348static inline tree
4349first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4350{
4351  init_call_expr_arg_iterator (exp, iter);
4352  return next_call_expr_arg (iter);
4353}
4354
4355static inline const_tree
4356first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4357{
4358  init_const_call_expr_arg_iterator (exp, iter);
4359  return next_const_call_expr_arg (iter);
4360}
4361
4362/* Test whether there are more arguments in abstract argument list iterator
4363   ITER, without changing its state.  */
4364static inline bool
4365more_call_expr_args_p (const call_expr_arg_iterator *iter)
4366{
4367  return (iter->i < iter->n);
4368}
4369
4370/* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4371   (of type call_expr_arg_iterator) to hold the iteration state.  */
4372#define FOR_EACH_CALL_EXPR_ARG(arg, iter, call)                 \
4373  for ((arg) = first_call_expr_arg ((call), &(iter)); (arg);    \
4374       (arg) = next_call_expr_arg (&(iter)))
4375
4376#define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call)                   \
4377  for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg);      \
4378       (arg) = next_const_call_expr_arg (&(iter)))
4379
4380/* Return true if tree node T is a language-specific node.  */
4381static inline bool
4382is_lang_specific (tree t)
4383{
4384  return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4385}
4386
4387/* Valid builtin number.  */
4388#define BUILTIN_VALID_P(FNCODE) \
4389  (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4390
4391/* Return the tree node for an explicit standard builtin function or NULL.  */
4392static inline tree
4393builtin_decl_explicit (enum built_in_function fncode)
4394{
4395  gcc_checking_assert (BUILTIN_VALID_P (fncode));
4396
4397  return builtin_info.decl[(size_t)fncode];
4398}
4399
4400/* Return the tree node for an implicit builtin function or NULL.  */
4401static inline tree
4402builtin_decl_implicit (enum built_in_function fncode)
4403{
4404  size_t uns_fncode = (size_t)fncode;
4405  gcc_checking_assert (BUILTIN_VALID_P (fncode));
4406
4407  if (!builtin_info.implicit_p[uns_fncode])
4408    return NULL_TREE;
4409
4410  return builtin_info.decl[uns_fncode];
4411}
4412
4413/* Set explicit builtin function nodes and whether it is an implicit
4414   function.  */
4415
4416static inline void
4417set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4418{
4419  size_t ufncode = (size_t)fncode;
4420
4421  gcc_checking_assert (BUILTIN_VALID_P (fncode)
4422                       && (decl != NULL_TREE || !implicit_p));
4423
4424  builtin_info.decl[ufncode] = decl;
4425  builtin_info.implicit_p[ufncode] = implicit_p;
4426}
4427
4428/* Set the implicit flag for a builtin function.  */
4429
4430static inline void
4431set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
4432{
4433  size_t uns_fncode = (size_t)fncode;
4434
4435  gcc_checking_assert (BUILTIN_VALID_P (fncode)
4436                       && builtin_info.decl[uns_fncode] != NULL_TREE);
4437
4438  builtin_info.implicit_p[uns_fncode] = implicit_p;
4439}
4440
4441/* Return whether the standard builtin function can be used as an explicit
4442   function.  */
4443
4444static inline bool
4445builtin_decl_explicit_p (enum built_in_function fncode)
4446{
4447  gcc_checking_assert (BUILTIN_VALID_P (fncode));
4448  return (builtin_info.decl[(size_t)fncode] != NULL_TREE);
4449}
4450
4451/* Return whether the standard builtin function can be used implicitly.  */
4452
4453static inline bool
4454builtin_decl_implicit_p (enum built_in_function fncode)
4455{
4456  size_t uns_fncode = (size_t)fncode;
4457
4458  gcc_checking_assert (BUILTIN_VALID_P (fncode));
4459  return (builtin_info.decl[uns_fncode] != NULL_TREE
4460          && builtin_info.implicit_p[uns_fncode]);
4461}
4462
4463/* Return true if T (assumed to be a DECL) is a global variable.
4464   A variable is considered global if its storage is not automatic.  */
4465
4466static inline bool
4467is_global_var (const_tree t)
4468{
4469  return (TREE_STATIC (t) || DECL_EXTERNAL (t));
4470}
4471
4472/* Return true if VAR may be aliased.  A variable is considered as
4473   maybe aliased if it has its address taken by the local TU
4474   or possibly by another TU and might be modified through a pointer.  */
4475
4476static inline bool
4477may_be_aliased (const_tree var)
4478{
4479  return (TREE_CODE (var) != CONST_DECL
4480          && (TREE_PUBLIC (var)
4481              || DECL_EXTERNAL (var)
4482              || TREE_ADDRESSABLE (var))
4483          && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
4484               && ((TREE_READONLY (var)
4485                    && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
4486                   || (TREE_CODE (var) == VAR_DECL
4487                       && DECL_NONALIASED (var)))));
4488}
4489
4490/* Return pointer to optimization flags of FNDECL.  */
4491static inline struct cl_optimization *
4492opts_for_fn (const_tree fndecl)
4493{
4494  tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
4495  if (fn_opts == NULL_TREE)
4496    fn_opts = optimization_default_node;
4497  return TREE_OPTIMIZATION (fn_opts);
4498}
4499
4500/* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
4501   the optimization level of function fndecl.  */
4502#define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
4503
4504/* For anonymous aggregate types, we need some sort of name to
4505   hold on to.  In practice, this should not appear, but it should
4506   not be harmful if it does.  */
4507#ifndef NO_DOT_IN_LABEL
4508#define ANON_AGGRNAME_FORMAT "._%d"
4509#define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
4510                                  && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4511#else /* NO_DOT_IN_LABEL */
4512#ifndef NO_DOLLAR_IN_LABEL
4513#define ANON_AGGRNAME_FORMAT "$_%d"
4514#define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
4515                                  && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4516#else /* NO_DOLLAR_IN_LABEL */
4517#define ANON_AGGRNAME_PREFIX "__anon_"
4518#define ANON_AGGRNAME_P(ID_NODE) \
4519  (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
4520             sizeof (ANON_AGGRNAME_PREFIX) - 1))
4521#define ANON_AGGRNAME_FORMAT "__anon_%d"
4522#endif  /* NO_DOLLAR_IN_LABEL */
4523#endif  /* NO_DOT_IN_LABEL */
4524
4525/* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
4526   but none of these files are allowed to be included from front ends.
4527   They should be split in two. One suitable for the FEs, the other suitable
4528   for the BE.  */
4529
4530/* Assign the RTX to declaration.  */
4531extern void set_decl_rtl (tree, rtx);
4532extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
4533
4534/* Return a tree representing the upper bound of the array mentioned in
4535   EXP, an ARRAY_REF or an ARRAY_RANGE_REF.  */
4536extern tree array_ref_up_bound (tree);
4537
4538extern tree build_personality_function (const char *);
4539
4540/* Given an expression EXP that is a handled_component_p,
4541   look for the ultimate containing object, which is returned and specify
4542   the access position and size.  */
4543extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4544                                 tree *, enum machine_mode *, int *, int *,
4545                                 bool);
4546
4547/* Return a tree representing the lower bound of the array mentioned in
4548   EXP, an ARRAY_REF or an ARRAY_RANGE_REF.  */
4549extern tree array_ref_low_bound (tree);
4550
4551/* In builtins.c.  */
4552
4553/* Non-zero if __builtin_constant_p should be folded right away.  */
4554extern bool force_folding_builtin_constant_p;
4555
4556extern bool avoid_folding_inline_builtin (tree);
4557extern tree fold_call_expr (location_t, tree, bool);
4558extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4559extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4560extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4561extern tree fold_builtin_strcat (location_t, tree, tree, tree);
4562extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4563                                     enum built_in_function);
4564extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4565                                     enum built_in_function);
4566extern tree fold_builtin_stxncpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4567                                      enum built_in_function);
4568extern tree fold_builtin_expect (location_t, tree, tree, tree);
4569extern bool fold_builtin_next_arg (tree, bool);
4570extern enum built_in_function builtin_mathfn_code (const_tree);
4571extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4572extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
4573extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
4574extern tree build_call_expr_loc (location_t, tree, int, ...);
4575extern tree build_call_expr (tree, int, ...);
4576extern tree mathfn_built_in (tree, enum built_in_function fn);
4577extern tree c_strlen (tree, int);
4578extern tree build_string_literal (int, const char *);
4579extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4580extern bool is_builtin_fn (tree);
4581extern bool get_object_alignment_1 (tree, unsigned int *,
4582                                    unsigned HOST_WIDE_INT *);
4583extern unsigned int get_object_alignment (tree);
4584extern bool get_pointer_alignment_1 (tree, unsigned int *,
4585                                     unsigned HOST_WIDE_INT *);
4586extern unsigned int get_pointer_alignment (tree);
4587extern tree fold_call_stmt (gimple, bool);
4588extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
4589extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
4590extern bool is_simple_builtin (tree);
4591extern bool is_inexpensive_builtin (tree);
4592
4593#endif  /* GCC_TREE_H  */
Note: See TracBrowser for help on using the repository browser.