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