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