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