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-2024 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 COMPLEX_CST node. */
1169#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1170#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1171
1172/* In a VECTOR_CST node. See generic.texi for details. */
1173#define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1174#define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1175
1176#define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1177 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1178#define VECTOR_CST_NPATTERNS(NODE) \
1179 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1180#define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1181 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1182#define VECTOR_CST_DUPLICATE_P(NODE) \
1183 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1184#define VECTOR_CST_STEPPED_P(NODE) \
1185 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1186#define VECTOR_CST_ENCODED_ELTS(NODE) \
1187 (VECTOR_CST_CHECK (NODE)->vector.elts)
1188#define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1189 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1190
1191/* Define fields and accessors for some special-purpose tree nodes. */
1192
1193/* Unlike STRING_CST, in C terms this is strlen, not sizeof. */
1194#define IDENTIFIER_LENGTH(NODE) \
1195 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1196#define IDENTIFIER_POINTER(NODE) \
1197 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1198#define IDENTIFIER_HASH_VALUE(NODE) \
1199 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1200
1201/* Translate a hash table identifier pointer to a tree_identifier
1202 pointer, and vice versa. */
1203
1204#define HT_IDENT_TO_GCC_IDENT(NODE) \
1205 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1206#define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1207
1208/* In a TREE_LIST node. */
1209#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1210#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1211
1212/* In a TREE_VEC node. */
1213#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1214#define TREE_VEC_BEGIN(NODE) (&TREE_VEC_CHECK (NODE)->vec.a[0])
1215#define TREE_VEC_END(NODE) \
1216 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->base.u.length]))
1217
1218#define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1219
1220/* In a CONSTRUCTOR node. */
1221#define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1222#define CONSTRUCTOR_ELT(NODE,IDX) \
1223 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1224#define CONSTRUCTOR_NELTS(NODE) \
1225 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1226#define CONSTRUCTOR_NO_CLEARING(NODE) \
1227 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1228
1229/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1230 value of each element (stored within VAL). IX must be a scratch variable
1231 of unsigned integer type. */
1232#define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1233 for (IX = 0; (IX >= vec_safe_length (V)) \
1234 ? false \
1235 : ((VAL = (*(V))[IX].value), \
1236 true); \
1237 (IX)++)
1238
1239/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1240 the value of each element (stored within VAL) and its index (stored
1241 within INDEX). IX must be a scratch variable of unsigned integer type. */
1242#define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1243 for (IX = 0; (IX >= vec_safe_length (V)) \
1244 ? false \
1245 : (((void) (VAL = (*V)[IX].value)), \
1246 (INDEX = (*V)[IX].index), \
1247 true); \
1248 (IX)++)
1249
1250/* Append a new constructor element to V, with the specified INDEX and VAL. */
1251#define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1252 do { \
1253 constructor_elt _ce___ = {INDEX, VALUE}; \
1254 vec_safe_push ((V), _ce___); \
1255 } while (0)
1256
1257/* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1258 constructor output purposes. */
1259#define CONSTRUCTOR_BITFIELD_P(NODE) \
1260 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) \
1261 && (DECL_MODE (NODE) != BLKmode \
1262 || TREE_CODE (TREE_TYPE (NODE)) == BITINT_TYPE))
1263
1264/* True if NODE is a clobber right hand side, an expression of indeterminate
1265 value that clobbers the LHS in a copy instruction. We use a volatile
1266 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1267 In particular the volatile flag causes us to not prematurely remove
1268 such clobber instructions. */
1269#define TREE_CLOBBER_P(NODE) \
1270 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1271
1272/* Return the clobber_kind of a CLOBBER CONSTRUCTOR. */
1273#define CLOBBER_KIND(NODE) \
1274 (CONSTRUCTOR_CHECK (NODE)->base.u.bits.address_space)
1275
1276/* Define fields and accessors for some nodes that represent expressions. */
1277
1278/* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1279#define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1280 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1281 && integer_zerop (TREE_OPERAND (NODE, 0)))
1282
1283/* In ordinary expression nodes. */
1284#define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1285#define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1286
1287/* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1288 length. Its value includes the length operand itself; that is,
1289 the minimum valid length is 1.
1290 Note that we have to bypass the use of TREE_OPERAND to access
1291 that field to avoid infinite recursion in expanding the macros. */
1292#define VL_EXP_OPERAND_LENGTH(NODE) \
1293 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1294
1295/* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1296#define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1297/* Nonzero if gimple_debug_bind_p() (and thus
1298 gimple_debug_source_bind_p()) may possibly hold. */
1299#define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1300/* Nonzero if is_gimple_debug() may possibly hold. */
1301#define MAY_HAVE_DEBUG_STMTS \
1302 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1303
1304/* In a LOOP_EXPR node. */
1305#define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1306
1307/* The source location of this expression. Non-tree_exp nodes such as
1308 decls and constants can be shared among multiple locations, so
1309 return nothing. */
1310#define EXPR_LOCATION(NODE) \
1311 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1312#define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1313#define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1314 != UNKNOWN_LOCATION)
1315/* The location to be used in a diagnostic about this expression. Do not
1316 use this macro if the location will be assigned to other expressions. */
1317#define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1318 ? (NODE)->exp.locus : (LOCUS))
1319#define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1320#define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1321
1322#define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1323#define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1324
1325#define EXPR_HAS_RANGE(NODE) \
1326 (CAN_HAVE_RANGE_P (NODE) \
1327 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1328 : false)
1329
1330/* True if a tree is an expression or statement that can have a
1331 location. */
1332#define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1333
1334inline source_range
1336{
1337 location_t loc = EXPR_LOCATION (expr);
1338 return get_range_from_loc (line_table, loc);
1339}
1340
1341extern void protected_set_expr_location (tree, location_t);
1342extern void protected_set_expr_location_if_unset (tree, location_t);
1343ATTRIBUTE_WARN_UNUSED_RESULT
1344extern tree protected_set_expr_location_unshare (tree, location_t);
1345
1347
1349
1350/* A class for suppressing the creation of location wrappers.
1351 Location wrappers will not be created during the lifetime
1352 of an instance of this class. */
1353
1360
1361/* COND_EXPR identificer/discriminator accessors. */
1362#define SET_EXPR_UID(t, v) EXPR_CHECK ((t))->exp.condition_uid = (v)
1363#define EXPR_COND_UID(t) EXPR_CHECK ((t))->exp.condition_uid
1364
1365/* In a TARGET_EXPR node. */
1366#define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1367#define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1368#define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1369/* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1370 on rhs of MODIFY_EXPR. */
1371#define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1372
1373/* DECL_EXPR accessor. This gives access to the DECL associated with
1374 the given declaration statement. */
1375#define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1376
1377#define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1378
1379/* COMPOUND_LITERAL_EXPR accessors. */
1380#define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1381 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1382#define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1383 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1384
1385/* SWITCH_EXPR accessors. These give access to the condition and body. */
1386#define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1387#define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1388/* True if there are case labels for all possible values of SWITCH_COND, either
1389 because there is a default: case label or because the case label ranges cover
1390 all values. */
1391#define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1392
1393/* CASE_LABEL_EXPR accessors. These give access to the high and low values
1394 of a case label, respectively. */
1395#define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1396#define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1397#define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1398#define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1399
1400/* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1401 corresponding MEM_REF operands. */
1402#define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1403#define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1404#define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1405#define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1406#define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1407
1408#define MR_DEPENDENCE_CLIQUE(NODE) \
1409 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1410#define MR_DEPENDENCE_BASE(NODE) \
1411 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1412
1413/* The operands of a BIND_EXPR. */
1414#define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1415#define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1416#define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1417
1418/* GOTO_EXPR accessor. This gives access to the label associated with
1419 a goto statement. */
1420#define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1421
1422/* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1423 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1424 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1425 statement. */
1426#define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1427#define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1428#define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1429#define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1430#define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1431/* Nonzero if we want to create an ASM_INPUT instead of an
1432 ASM_OPERAND with no operands. */
1433#define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1434#define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1435/* Nonzero if we want to consider this asm as minimum length and cost
1436 for inlining decisions. */
1437#define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1438
1439/* COND_EXPR accessors. */
1440#define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1441#define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1442#define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1443
1444/* Accessors for the chains of recurrences. */
1445#define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1446#define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1447#define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1448/* Nonzero if this chrec doesn't overflow (i.e., nonwrapping). */
1449#define CHREC_NOWRAP(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.nothrow_flag
1450
1451/* LABEL_EXPR accessor. This gives access to the label associated with
1452 the given label expression. */
1453#define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1454
1455/* CATCH_EXPR accessors. */
1456#define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1457#define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1458
1459/* EH_FILTER_EXPR accessors. */
1460#define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1461#define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1462
1463/* OBJ_TYPE_REF accessors. */
1464#define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1465#define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1466#define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1467
1468/* CALL_EXPR accessors. */
1469#define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1470#define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1471#define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1472#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1473#define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1474
1475/* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1476 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1477 the argument count is zero when checking is enabled. Instead, do
1478 the pointer arithmetic to advance past the 3 fixed operands in a
1479 CALL_EXPR. That produces a valid pointer to just past the end of the
1480 operand array, even if it's not valid to dereference it. */
1481#define CALL_EXPR_ARGP(NODE) \
1482 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1483
1484/* TM directives and accessors. */
1485#define TRANSACTION_EXPR_BODY(NODE) \
1486 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1487#define TRANSACTION_EXPR_OUTER(NODE) \
1488 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1489#define TRANSACTION_EXPR_RELAXED(NODE) \
1490 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1491
1492/* OpenMP and OpenACC directive and clause accessors. */
1493
1494/* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1495 as operand 1. */
1496#define OMP_BODY(NODE) \
1497 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1498#define OMP_CLAUSES(NODE) \
1499 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1500
1501/* Generic accessors for OMP nodes that keep clauses as operand 0. */
1502#define OMP_STANDALONE_CLAUSES(NODE) \
1503 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1504
1505#define OACC_DATA_BODY(NODE) \
1506 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1507#define OACC_DATA_CLAUSES(NODE) \
1508 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1509
1510#define OACC_HOST_DATA_BODY(NODE) \
1511 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1512#define OACC_HOST_DATA_CLAUSES(NODE) \
1513 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1514
1515#define OACC_CACHE_CLAUSES(NODE) \
1516 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1517
1518#define OACC_DECLARE_CLAUSES(NODE) \
1519 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1520
1521#define OACC_ENTER_DATA_CLAUSES(NODE) \
1522 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1523
1524#define OACC_EXIT_DATA_CLAUSES(NODE) \
1525 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1526
1527#define OACC_UPDATE_CLAUSES(NODE) \
1528 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1529
1530#define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1531#define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1532
1533#define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1534#define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1535
1536#define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1537#define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1538#define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1539
1540#define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1541#define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1542#define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1543#define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1544#define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1545#define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1546#define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1547#define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1548
1549#define OMP_LOOPXFORM_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_TILE, OMP_UNROLL)
1550#define OMP_LOOPXFORM_LOWERED(NODE) \
1551 (OMP_LOOPXFORM_CHECK (NODE)->base.public_flag)
1552
1553#define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1554#define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1555
1556#define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1557
1558#define OMP_STRUCTURED_BLOCK_BODY(NODE) \
1559 TREE_OPERAND (OMP_STRUCTURED_BLOCK_CHECK (NODE), 0)
1560
1561#define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1562#define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1563
1564#define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0)
1565#define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1)
1566
1567#define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1568
1569#define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0)
1570#define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1)
1571
1572#define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1573#define OMP_TASKGROUP_CLAUSES(NODE) \
1574 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1575
1576#define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1577#define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1578
1579#define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1580#define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1581#define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1582
1583#define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1584#define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1585
1586#define OMP_TARGET_DATA_BODY(NODE) \
1587 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1588#define OMP_TARGET_DATA_CLAUSES(NODE)\
1589 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1590
1591#define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1592#define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1593
1594#define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1595 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1596
1597#define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1598 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1599
1600#define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1601 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1602
1603#define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1604#define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1605
1606#define OMP_CLAUSE_SIZE(NODE) \
1607 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1608 OMP_CLAUSE_FROM, \
1609 OMP_CLAUSE__CACHE_), 1)
1610
1611#define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1612#define OMP_CLAUSE_DECL(NODE) \
1613 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1614 OMP_CLAUSE_PRIVATE, \
1615 OMP_CLAUSE__SCANTEMP_), 0)
1616#define OMP_CLAUSE_HAS_LOCATION(NODE) \
1617 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1618 != UNKNOWN_LOCATION)
1619#define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1620
1621/* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1622 is non-rectangular. */
1623#define OMP_FOR_NON_RECTANGULAR(NODE) \
1624 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1625
1626/* True on an OMP_SECTION statement that was the last lexical member.
1627 This status is meaningful in the implementation of lastprivate. */
1628#define OMP_SECTION_LAST(NODE) \
1629 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1630
1631/* True on an OMP_PARALLEL statement if it represents an explicit
1632 combined parallel work-sharing constructs. */
1633#define OMP_PARALLEL_COMBINED(NODE) \
1634 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1635
1636/* True on an OMP_TEAMS statement if it represents an explicit
1637 combined teams distribute constructs. */
1638#define OMP_TEAMS_COMBINED(NODE) \
1639 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1640
1641/* True on an OMP_TARGET statement if it represents explicit
1642 combined target teams, target parallel or target simd constructs. */
1643#define OMP_TARGET_COMBINED(NODE) \
1644 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1645
1646/* True on an OMP_MASTER statement if it represents an explicit
1647 combined master constructs. */
1648#define OMP_MASTER_COMBINED(NODE) \
1649 (OMP_MASTER_CHECK (NODE)->base.private_flag)
1650
1651/* True on an OMP_MASKED statement if it represents an explicit
1652 combined masked constructs. */
1653#define OMP_MASKED_COMBINED(NODE) \
1654 (OMP_MASKED_CHECK (NODE)->base.private_flag)
1655
1656/* Memory order for OMP_ATOMIC*. */
1657#define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1658 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1659 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1660
1661/* Weak clause on OMP_ATOMIC*. */
1662#define OMP_ATOMIC_WEAK(NODE) \
1663 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1664 OMP_ATOMIC_CAPTURE_NEW)->base.public_flag)
1665
1666/* True on a PRIVATE clause if its decl is kept around for debugging
1667 information only and its DECL_VALUE_EXPR is supposed to point
1668 to what it has been remapped to. */
1669#define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1670 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1671
1672/* True on a PRIVATE clause if ctor needs access to outer region's
1673 variable. */
1674#define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1675 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1676
1677/* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1678 (thus should be private on the outer taskloop and firstprivate on
1679 task). */
1680#define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1681 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1682
1683/* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1684#define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1685 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1686
1687/* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1688 to should be firstprivatized. */
1689#define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1690 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1691
1692/* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also
1693 set if target construct is the only one that accepts the clause. */
1694#define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \
1695 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1696
1697/* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1698 decl is present in the chain. */
1699#define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1700 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1701#define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1702 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1703 OMP_CLAUSE_LASTPRIVATE),\
1704 1)
1705#define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1706 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1707
1708/* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1709 loop construct (thus should be lastprivate on the outer taskloop and
1710 firstprivate on task for the taskloop construct and carefully handled
1711 for loop construct). */
1712#define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1713 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1714
1715/* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1716#define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1717 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1718
1719/* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1720 decl is present in the chain (this can happen only for taskloop
1721 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1722#define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1723 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1724
1725/* True on a SHARED clause if a scalar is not modified in the body and
1726 thus could be optimized as firstprivate. */
1727#define OMP_CLAUSE_SHARED_READONLY(NODE) \
1728 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1729
1730#define OMP_CLAUSE_IF_MODIFIER(NODE) \
1731 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1732
1733#define OMP_CLAUSE_FINAL_EXPR(NODE) \
1734 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1735#define OMP_CLAUSE_IF_EXPR(NODE) \
1736 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1737#define OMP_CLAUSE_SELF_EXPR(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SELF), 0)
1739#define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1740 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1741#define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1742 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1743#define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1744 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1745#define OMP_CLAUSE_HINT_EXPR(NODE) \
1746 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1747#define OMP_CLAUSE_FILTER_EXPR(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0)
1749#define OMP_CLAUSE_PARTIAL_EXPR(NODE) \
1750 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PARTIAL), 0)
1751#define OMP_CLAUSE_SIZES_LIST(NODE) \
1752 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIZES), 0)
1753
1754#define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1755 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1756
1757#define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1759
1760#define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \
1761 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE))
1762#define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \
1763 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS))
1764
1765/* OpenACC clause expressions */
1766#define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1767 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1768#define OMP_CLAUSE_GANG_EXPR(NODE) \
1769 OMP_CLAUSE_OPERAND ( \
1770 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1771#define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1772 OMP_CLAUSE_OPERAND ( \
1773 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1774#define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1775 OMP_CLAUSE_OPERAND ( \
1776 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1777#define OMP_CLAUSE_WAIT_EXPR(NODE) \
1778 OMP_CLAUSE_OPERAND ( \
1779 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1780#define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1781 OMP_CLAUSE_OPERAND ( \
1782 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1783#define OMP_CLAUSE_WORKER_EXPR(NODE) \
1784 OMP_CLAUSE_OPERAND ( \
1785 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1786#define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1787 OMP_CLAUSE_OPERAND ( \
1788 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1789#define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1790 OMP_CLAUSE_OPERAND ( \
1791 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1792#define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1793 OMP_CLAUSE_OPERAND ( \
1794 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1795
1796#define OMP_CLAUSE_DEPEND_KIND(NODE) \
1797 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1798
1799#define OMP_CLAUSE_DOACROSS_KIND(NODE) \
1800 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS)->omp_clause.subcode.doacross_kind)
1801
1802#define OMP_CLAUSE_DOACROSS_SINK_NEGATIVE(NODE) \
1803 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1804
1805/* True if DOACROSS clause is spelled as DEPEND. */
1806#define OMP_CLAUSE_DOACROSS_DEPEND(NODE) \
1807 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS))
1808
1809#define OMP_CLAUSE_MAP_KIND(NODE) \
1810 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1811#define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1812 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1813 = (unsigned int) (MAP_KIND))
1814
1815#define OMP_CLAUSE_MOTION_PRESENT(NODE) \
1816 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_FROM, OMP_CLAUSE_TO)->base.deprecated_flag)
1817
1818/* Nonzero if this map clause is for array (rather than pointer) based array
1819 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1820 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1821#define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1822 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1823/* Nonzero if this is a mapped array section, that might need special
1824 treatment if OMP_CLAUSE_SIZE is zero. */
1825#define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1826 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1827/* Nonzero if this map clause is for an OpenACC compute construct's reduction
1828 variable or OpenMP map clause mentioned also in in_reduction clause on the
1829 same construct. */
1830#define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1831 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1832/* Nonzero on map clauses added implicitly for reduction clauses on combined
1833 or composite constructs. They shall be removed if there is an explicit
1834 map clause. */
1835#define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1836 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1837/* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1838 due to being created through implicit data-mapping rules in the middle-end.
1839 NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1840#define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1841 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1842/* Nonzero for an attach/detach node whose decl was explicitly mapped on the
1843 same directive. */
1844#define OMP_CLAUSE_ATTACHMENT_MAPPING_ERASED(NODE) \
1845 TREE_STATIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1846/* Nonzero if this is a release/delete node which refers to a (Fortran) array
1847 descriptor. */
1848#define OMP_CLAUSE_RELEASE_DESCRIPTOR(NODE) \
1849 TREE_NOTHROW (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1850
1851/* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1852 lowering. */
1853#define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1854 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1855
1856/* Nonzero if OpenACC 'readonly' modifier set, used for 'copyin'. */
1857#define OMP_CLAUSE_MAP_READONLY(NODE) \
1858 TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1859
1860/* Same as above, for use in OpenACC cache directives. */
1861#define OMP_CLAUSE__CACHE__READONLY(NODE) \
1862 TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CACHE_))
1863
1864/* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1865 clause. */
1866#define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1867 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1868
1869#define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1870 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1871
1872#define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1873 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1874
1875#define OMP_CLAUSE_INDIRECT_EXPR(NODE) \
1876 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INDIRECT), 0)
1877
1878
1879/* True if there is a device clause with a device-modifier 'ancestor'. */
1880#define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
1881 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
1882
1883#define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1884 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1885#define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1886 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1887#define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1888 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1889
1890#define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1891 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1892
1893/* True on an OMP_CLAUSE_ORDERED if stand-alone ordered construct is nested
1894 inside of work-sharing loop the clause is on. */
1895#define OMP_CLAUSE_ORDERED_DOACROSS(NODE) \
1896 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED)->base.public_flag)
1897
1898/* True for unconstrained modifier on order(concurrent) clause. */
1899#define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
1900 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
1901/* True for reproducible modifier on order(concurrent) clause. */
1902#define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
1903 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
1904
1905#define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1906 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1907 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1908#define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1909 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1910 OMP_CLAUSE_IN_REDUCTION), 1)
1911#define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1912 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1913 OMP_CLAUSE_IN_REDUCTION), 2)
1914#define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1915 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1916#define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1917 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1918#define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1919 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1920 OMP_CLAUSE_IN_REDUCTION), 3)
1921#define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1922 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1923 OMP_CLAUSE_IN_REDUCTION), 4)
1924
1925/* True if a REDUCTION clause may reference the original list item (omp_orig)
1926 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1927#define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1928 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1929 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1930
1931/* True if a REDUCTION clause has task reduction-modifier. */
1932#define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1933 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1934
1935/* True if a REDUCTION clause has inscan reduction-modifier. */
1936#define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1937 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1938
1939/* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1940 are always initialized inside of the loop construct, false otherwise. */
1941#define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1942 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1943
1944/* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1945 are declared inside of the simd construct. */
1946#define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1947 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1948
1949/* True if a LINEAR clause has a stride that is variable. */
1950#define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1951 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1952
1953/* True for a LINEAR clause with old style modifier syntax
1954 linear(modifier(list)) or linear(modifier(list):step). */
1955#define OMP_CLAUSE_LINEAR_OLD_LINEAR_MODIFIER(NODE) \
1956 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.addressable_flag)
1957
1958/* True if a LINEAR clause is for an array or allocatable variable that
1959 needs special handling by the frontend. */
1960#define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1961 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1962
1963#define OMP_CLAUSE_LINEAR_STEP(NODE) \
1964 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1965
1966#define OMP_CLAUSE_LINEAR_STMT(NODE) \
1967 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1968
1969#define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1970 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1971
1972#define OMP_CLAUSE_LINEAR_KIND(NODE) \
1973 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1974
1975#define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1976 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1977
1978#define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1979 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1980
1981#define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
1982 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
1983
1984/* True if an ALLOCATE clause was present on a combined or composite
1985 construct and the code for splitting the clauses has already performed
1986 checking if the listed variable has explicit privatization on the
1987 construct. */
1988#define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1989 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1990
1991#define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
1992 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1993
1994#define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
1995 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
1996
1997#define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1998 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1999 OMP_CLAUSE_THREAD_LIMIT), 0)
2000
2001#define OMP_CLAUSE_DEVICE_ID(NODE) \
2002 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
2003
2004#define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
2005 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2006 OMP_CLAUSE_DIST_SCHEDULE), 0)
2007
2008#define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
2009 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
2010
2011#define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
2012 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
2013
2014#define OMP_CLAUSE__SIMDUID__DECL(NODE) \
2015 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
2016
2017#define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
2018 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
2019
2020/* True if a SCHEDULE clause has the simd modifier on it. */
2021#define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
2022 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
2023
2024#define OMP_CLAUSE_DEFAULT_KIND(NODE) \
2025 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
2026
2027#define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
2028 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
2029#define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
2030 ((enum omp_clause_defaultmap_kind) \
2031 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
2032#define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
2033 ((enum omp_clause_defaultmap_kind) \
2034 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
2035#define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
2036 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
2037 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
2038
2039#define OMP_CLAUSE_BIND_KIND(NODE) \
2040 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
2041
2042/* True if ENTER clause is spelled as TO. */
2043#define OMP_CLAUSE_ENTER_TO(NODE) \
2044 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ENTER)->base.public_flag)
2045
2046#define OMP_CLAUSE_TILE_LIST(NODE) \
2047 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
2048#define OMP_CLAUSE_TILE_ITERVAR(NODE) \
2049 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
2050#define OMP_CLAUSE_TILE_COUNT(NODE) \
2051 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
2052
2053/* _CONDTEMP_ holding temporary with iteration count. */
2054#define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
2055 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
2056
2057/* _SCANTEMP_ holding temporary with pointer to thread's local array;
2058 allocation. */
2059#define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
2060 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
2061
2062/* _SCANTEMP_ holding temporary with a control variable for deallocation;
2063 one boolean_type_node for test whether alloca was used, another one
2064 to pass to __builtin_stack_restore or free. */
2065#define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
2066 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
2067
2068/* SSA_NAME accessors. */
2069
2070/* Whether SSA_NAME NODE is a virtual operand. This simply caches the
2071 information in the underlying SSA_NAME_VAR for efficiency. */
2072#define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
2073 SSA_NAME_CHECK (NODE)->base.public_flag
2074
2075/* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
2076 if there is no name associated with it. */
2077#define SSA_NAME_IDENTIFIER(NODE) \
2078 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
2079 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2080 ? (NODE)->ssa_name.var \
2081 : DECL_NAME ((NODE)->ssa_name.var)) \
2082 : NULL_TREE)
2083
2084/* Returns the variable being referenced. This can be NULL_TREE for
2085 temporaries not associated with any user variable.
2086 Once released, this is the only field that can be relied upon. */
2087#define SSA_NAME_VAR(NODE) \
2088 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
2089 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2090 ? NULL_TREE : (NODE)->ssa_name.var)
2091
2092#define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
2093 do \
2094 { \
2095 tree var_ = (VAR); \
2096 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
2097 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
2098 = (var_ \
2099 && TREE_CODE (var_) == VAR_DECL \
2100 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
2101 } \
2102 while (0)
2103
2104/* Returns the statement which defines this SSA name. */
2105#define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
2106
2107/* Returns the SSA version number of this SSA name. Note that in
2108 tree SSA, version numbers are not per variable and may be recycled. */
2109#define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
2110
2111/* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
2112 never output, so we can safely use the ASM_WRITTEN_FLAG for this
2113 status bit. */
2114#define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
2115 SSA_NAME_CHECK (NODE)->base.asm_written_flag
2116
2117/* Nonzero if this SSA_NAME expression is currently on the free list of
2118 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
2119 has no meaning for an SSA_NAME. */
2120#define SSA_NAME_IN_FREE_LIST(NODE) \
2121 SSA_NAME_CHECK (NODE)->base.nothrow_flag
2122
2123/* Nonzero if this SSA_NAME is the default definition for the
2124 underlying symbol. A default SSA name is created for symbol S if
2125 the very first reference to S in the function is a read operation.
2126 Default definitions are always created by an empty statement and
2127 belong to no basic block. */
2128#define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2129 SSA_NAME_CHECK (NODE)->base.default_def_flag
2130
2131/* Nonzero if this SSA_NAME is known to point to memory that may not
2132 be written to. This is set for default defs of function parameters
2133 that have a corresponding r or R specification in the functions
2134 fn spec attribute. This is used by alias analysis. */
2135#define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
2136 SSA_NAME_CHECK (NODE)->base.deprecated_flag
2137
2138/* Attributes for SSA_NAMEs for pointer-type variables. */
2139#define SSA_NAME_PTR_INFO(N) \
2140 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
2141
2142/* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
2143#define SSA_NAME_RANGE_INFO(N) \
2144 SSA_NAME_CHECK (N)->ssa_name.info.range_info
2145
2146/* Return the immediate_use information for an SSA_NAME. */
2147#define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2148
2149#define OMP_CLAUSE_CODE(NODE) \
2150 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2151
2152#define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2153 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2154
2155#define OMP_CLAUSE_OPERAND(NODE, I) \
2156 OMP_CLAUSE_ELT_CHECK (NODE, I)
2157
2158/* In a BLOCK (scope) node:
2159 Variables declared in the scope NODE. */
2160#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2161#define BLOCK_NONLOCALIZED_VARS(NODE) \
2162 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2163#define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2164 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2165#define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2166/* A chain of BLOCKs (scopes) nested within the scope NODE. */
2167#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2168/* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2169 function scope. Inlined functions are chained by this so that given
2170 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2171 in which E has been made or into which E has been inlined. */
2172#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2173/* Points to the next scope at the same level of nesting as scope NODE. */
2174#define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2175/* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2176 inlined. In a scope immediately enclosing an inlined leaf expression,
2177 points to the outermost scope into which it has been inlined (thus
2178 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2179#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2180#define BLOCK_ORIGIN(NODE) \
2181 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2182#define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2183
2184/* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2185#define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2186
2187/* True if BLOCK appears in cold section. */
2188#define BLOCK_IN_COLD_SECTION_P(NODE) \
2189 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2190
2191/* An index number for this block. These values are not guaranteed to
2192 be unique across functions -- whether or not they are depends on
2193 the debugging output format in use. */
2194#define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2195
2196/* If block reordering splits a lexical block into discontiguous
2197 address ranges, we'll make a copy of the original block.
2198
2199 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2200 In that case, we have one source block that has been replicated
2201 (through inlining or unrolling) into many logical blocks, and that
2202 these logical blocks have different physical variables in them.
2203
2204 In this case, we have one logical block split into several
2205 non-contiguous address ranges. Most debug formats can't actually
2206 represent this idea directly, so we fake it by creating multiple
2207 logical blocks with the same variables in them. However, for those
2208 that do support non-contiguous regions, these allow the original
2209 logical block to be reconstructed, along with the set of address
2210 ranges.
2211
2212 One of the logical block fragments is arbitrarily chosen to be
2213 the ORIGIN. The other fragments will point to the origin via
2214 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2215 be null. The list of fragments will be chained through
2216 BLOCK_FRAGMENT_CHAIN from the origin. */
2217
2218#define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2219#define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2220
2221/* For an inlined function, this gives the location where it was called
2222 from. This is only set in the top level block, which corresponds to the
2223 inlined function scope. This is used in the debug output routines. */
2224
2225#define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2226
2227/* This gives the location of the end of the block, useful to attach
2228 code implicitly generated for outgoing paths. */
2229
2230#define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2231
2232/* Define fields and accessors for nodes representing data types. */
2233
2234/* See tree.def for documentation of the use of these fields.
2235 Look at the documentation of the various ..._TYPE tree codes.
2236
2237 Note that the type.values, type.minval, and type.maxval fields are
2238 overloaded and used for different macros in different kinds of types.
2239 Each macro must check to ensure the tree node is of the proper kind of
2240 type. Note also that some of the front-ends also overload these fields,
2241 so they must be checked as well. */
2242
2243#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2244/* Type size in bits as a tree expression. Need not be constant and may
2245 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2246 class subobject with its own virtual base classes (which are laid out
2247 separately). */
2248#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2249/* Likewise, type size in bytes. */
2250#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2251#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2252#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2253#define TYPE_PRECISION(NODE) \
2254 (TREE_NOT_CHECK (TYPE_CHECK (NODE), VECTOR_TYPE)->type_common.precision)
2255#define TYPE_PRECISION_RAW(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2256#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2257#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2258#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2259#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2260
2261#define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2262#define TYPE_MODE(NODE) \
2263 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2264 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2265#define SCALAR_TYPE_MODE(NODE) \
2266 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2267#define SCALAR_INT_TYPE_MODE(NODE) \
2268 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2269#define SCALAR_FLOAT_TYPE_MODE(NODE) \
2270 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2271#define SET_TYPE_MODE(NODE, MODE) \
2272 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2273
2274extern unsigned int element_precision (const_tree);
2275extern machine_mode element_mode (const_tree);
2276extern machine_mode vector_type_mode (const_tree);
2277extern unsigned int vector_element_bits (const_tree);
2279
2280/* The "canonical" type for this type node, which is used by frontends to
2281 compare the type for equality with another type. If two types are
2282 equal (based on the semantics of the language), then they will have
2283 equivalent TYPE_CANONICAL entries.
2284
2285 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2286 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2287 be used for comparison against other types. Instead, the type is
2288 said to require structural equality checks, described in
2289 TYPE_STRUCTURAL_EQUALITY_P.
2290
2291 For unqualified aggregate and function types the middle-end relies on
2292 TYPE_CANONICAL to tell whether two variables can be assigned
2293 to each other without a conversion. The middle-end also makes sure
2294 to assign the same alias-sets to the type partition with equal
2295 TYPE_CANONICAL of their unqualified variants. */
2296#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2297/* Indicates that the type node requires structural equality
2298 checks. The compiler will need to look at the composition of the
2299 type to determine whether it is equal to another type, rather than
2300 just comparing canonical type pointers. For instance, we would need
2301 to look at the return and parameter types of a FUNCTION_TYPE
2302 node. */
2303#define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2304/* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2305 type node requires structural equality. */
2306#define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2307
2308#define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2309#define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2310
2311/* The (language-specific) typed-based alias set for this type.
2312 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2313 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2314 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2315 type can alias objects of any type. */
2316#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2317
2318/* Nonzero iff the typed-based alias set for this type has been
2319 calculated. */
2320#define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2321 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2322
2323/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2324 to this type. */
2325#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2326
2327/* Raw access to the alignment field. */
2328#define TYPE_ALIGN_RAW(NODE) \
2329 (TYPE_CHECK (NODE)->type_common.align)
2330
2331/* The alignment necessary for objects of this type.
2332 The value is an int, measured in bits and must be a power of two.
2333 We support also an "alignment" of zero. */
2334#define TYPE_ALIGN(NODE) \
2335 (TYPE_ALIGN_RAW (NODE) \
2336 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2337
2338/* Specify that TYPE_ALIGN(NODE) is X. */
2339#define SET_TYPE_ALIGN(NODE, X) \
2340 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2341
2342/* 1 if the alignment for this type was requested by "aligned" attribute,
2343 0 if it is the default for this type. */
2344#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2345
2346/* The alignment for NODE, in bytes. */
2347#define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2348
2349/* The minimum alignment necessary for objects of this type without
2350 warning. The value is an int, measured in bits. */
2351#define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2352 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2353 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2354
2355/* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2356#define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2357 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2358
2359/* If your language allows you to declare types, and you want debug info
2360 for them, then you need to generate corresponding TYPE_DECL nodes.
2361 These "stub" TYPE_DECL nodes have no name, and simply point at the
2362 type node. You then set the TYPE_STUB_DECL field of the type node
2363 to point back at the TYPE_DECL node. This allows the debug routines
2364 to know that the two nodes represent the same type, so that we only
2365 get one debug info record for them. */
2366#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2367
2368/* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2369 the type has BLKmode only because it lacks the alignment required for
2370 its size. */
2371#define TYPE_NO_FORCE_BLK(NODE) \
2372 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2373
2374/* Nonzero in a type considered volatile as a whole. */
2375#define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2376
2377/* Nonzero in a type considered atomic as a whole. */
2378#define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2379
2380/* Means this type is const-qualified. */
2381#define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2382
2383/* If nonzero, this type is `restrict'-qualified, in the C sense of
2384 the term. */
2385#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2386
2387/* If nonzero, type's name shouldn't be emitted into debug info. */
2388#define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2389
2390/* The address space the type is in. */
2391#define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2392
2393/* Encode/decode the named memory support as part of the qualifier. If more
2394 than 8 qualifiers are added, these macros need to be adjusted. */
2395#define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2396#define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2397
2398/* Return all qualifiers except for the address space qualifiers. */
2399#define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2400
2401/* Only keep the address space out of the qualifiers and discard the other
2402 qualifiers. */
2403#define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2404
2405/* The set of type qualifiers for this type. */
2406#define TYPE_QUALS(NODE) \
2407 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2408 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2409 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2410 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2411 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2412
2413/* The same as TYPE_QUALS without the address space qualifications. */
2414#define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2415 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2416 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2417 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2418 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2419
2420/* The same as TYPE_QUALS without the address space and atomic
2421 qualifications. */
2422#define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2423 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2424 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2425 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2426
2427/* These flags are available for each language front end to use internally. */
2428#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2429#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2430#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2431#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2432#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2433#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2434#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2435#define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2436
2437/* Used to keep track of visited nodes in tree traversals. This is set to
2438 0 by copy_node and make_node. */
2439#define TREE_VISITED(NODE) ((NODE)->base.visited)
2440
2441/* If set in an ARRAY_TYPE, indicates a string type (for languages
2442 that distinguish string from array of char).
2443 If set in a INTEGER_TYPE, indicates a character type. */
2444#define TYPE_STRING_FLAG(NODE) \
2445 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2446
2447/* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2448 to the C++ one definition rule. This is used for LTO canonical type
2449 computation. */
2450#define TYPE_CXX_ODR_P(NODE) \
2451 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2452
2453/* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2454 about missing conversions to other vector types of the same size. */
2455#define TYPE_VECTOR_OPAQUE(NODE) \
2456 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2457
2458/* Indicates that objects of this type must be initialized by calling a
2459 function when they are created. */
2460#define TYPE_NEEDS_CONSTRUCTING(NODE) \
2461 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2462
2463/* Indicates that a UNION_TYPE object should be passed the same way that
2464 the first union alternative would be passed, or that a RECORD_TYPE
2465 object should be passed the same way that the first (and only) member
2466 would be passed. */
2467#define TYPE_TRANSPARENT_AGGR(NODE) \
2468 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2469
2470/* For an ARRAY_TYPE, indicates that it is not permitted to take the
2471 address of a component of the type. This is the counterpart of
2472 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2473#define TYPE_NONALIASED_COMPONENT(NODE) \
2474 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2475
2476/* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2477 whether the array is typeless storage or the type contains a member
2478 with this flag set. Such types are exempt from type-based alias
2479 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2480 the flag should be inherited from the element type, can change
2481 when type is finalized and because of that should not be used in
2482 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2483 the flag should not be changed after the array is created and should
2484 be used in type hashing. */
2485#define TYPE_TYPELESS_STORAGE(NODE) \
2486 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2487 ARRAY_TYPE)->type_common.typeless_storage)
2488
2489/* Indicated that objects of this type should be laid out in as
2490 compact a way as possible. */
2491#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2492
2493/* Used by type_contains_placeholder_p to avoid recomputation.
2494 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2495 this field directly. */
2496#define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2497 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2498
2499/* Nonzero if RECORD_TYPE represents a final derivation of class. */
2500#define TYPE_FINAL_P(NODE) \
2501 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2502
2503/* The debug output functions use the symtab union field to store
2504 information specific to the debugging format. The different debug
2505 output hooks store different types in the union field. These three
2506 macros are used to access different fields in the union. The debug
2507 hooks are responsible for consistently using only a specific
2508 macro. */
2509
2510/* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2511 hold the type's number in the generated stabs. */
2512#define TYPE_SYMTAB_ADDRESS(NODE) \
2513 (TYPE_CHECK (NODE)->type_common.symtab.address)
2514
2515/* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2516 in dwarf2out.cc to point to the DIE generated for the type. */
2517#define TYPE_SYMTAB_DIE(NODE) \
2518 (TYPE_CHECK (NODE)->type_common.symtab.die)
2519
2520/* The garbage collector needs to know the interpretation of the
2521 symtab field. These constants represent the different types in the
2522 union. */
2523
2524#define TYPE_SYMTAB_IS_ADDRESS (0)
2525#define TYPE_SYMTAB_IS_DIE (1)
2526
2527#define TYPE_LANG_SPECIFIC(NODE) \
2528 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2529
2530#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2531#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2532#define TYPE_FIELDS(NODE) \
2533 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2534#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2535#define TYPE_ARG_TYPES(NODE) \
2536 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2537#define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2538
2539#define TYPE_MIN_VALUE(NODE) \
2540 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2541#define TYPE_NEXT_PTR_TO(NODE) \
2542 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2543#define TYPE_NEXT_REF_TO(NODE) \
2544 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2545#define TYPE_VFIELD(NODE) \
2546 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2547#define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2548
2549#define TYPE_MAX_VALUE(NODE) \
2550 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2551#define TYPE_METHOD_BASETYPE(NODE) \
2552 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2553#define TYPE_OFFSET_BASETYPE(NODE) \
2554 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2555/* If non-NULL, this is an upper bound of the size (in bytes) of an
2556 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2557 allocated. */
2558#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2559 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2560#define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2561/* For record and union types, information about this type, as a base type
2562 for itself. */
2563#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2564
2565/* For types, used in a language-dependent way. */
2566#define TYPE_LANG_SLOT_1(NODE) \
2567 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2568
2569/* Define accessor macros for information about type inheritance
2570 and basetypes.
2571
2572 A "basetype" means a particular usage of a data type for inheritance
2573 in another type. Each such basetype usage has its own "binfo"
2574 object to describe it. The binfo object is a TREE_VEC node.
2575
2576 Inheritance is represented by the binfo nodes allocated for a
2577 given type. For example, given types C and D, such that D is
2578 inherited by C, 3 binfo nodes will be allocated: one for describing
2579 the binfo properties of C, similarly one for D, and one for
2580 describing the binfo properties of D as a base type for C.
2581 Thus, given a pointer to class C, one can get a pointer to the binfo
2582 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2583
2584/* BINFO specific flags. */
2585
2586/* Nonzero means that the derivation chain is via a `virtual' declaration. */
2587#define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2588
2589/* Flags for language dependent use. */
2590#define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2591#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2592#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2593#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2594#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2595#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2596#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2597
2598/* The actual data type node being inherited in this basetype. */
2599#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2600
2601/* The offset where this basetype appears in its containing type.
2602 BINFO_OFFSET slot holds the offset (in bytes)
2603 from the base of the complete object to the base of the part of the
2604 object that is allocated on behalf of this `type'.
2605 This is always 0 except when there is multiple inheritance. */
2606
2607#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2608#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2609
2610/* The virtual function table belonging to this basetype. Virtual
2611 function tables provide a mechanism for run-time method dispatching.
2612 The entries of a virtual function table are language-dependent. */
2613
2614#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2615
2616/* The virtual functions in the virtual function table. This is
2617 a TREE_LIST that is used as an initial approximation for building
2618 a virtual function table for this basetype. */
2619#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2620
2621/* A vector of binfos for the direct basetypes inherited by this
2622 basetype.
2623
2624 If this basetype describes type D as inherited in C, and if the
2625 basetypes of D are E and F, then this vector contains binfos for
2626 inheritance of E and F by C. */
2627#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2628
2629/* The number of basetypes for NODE. */
2630#define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2631
2632/* Accessor macro to get to the Nth base binfo of this binfo. */
2633#define BINFO_BASE_BINFO(NODE,N) \
2634 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2635#define BINFO_BASE_ITERATE(NODE,N,B) \
2636 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2637#define BINFO_BASE_APPEND(NODE,T) \
2638 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2639
2640/* For a BINFO record describing a virtual base class, i.e., one where
2641 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2642 base. The actual contents are language-dependent. In the C++
2643 front-end this field is an INTEGER_CST giving an offset into the
2644 vtable where the offset to the virtual base can be found. */
2645#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2646
2647/* Indicates the accesses this binfo has to its bases. The values are
2648 access_public_node, access_protected_node or access_private_node.
2649 If this array is not present, public access is implied. */
2650#define BINFO_BASE_ACCESSES(NODE) \
2651 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2652
2653#define BINFO_BASE_ACCESS(NODE,N) \
2654 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2655#define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2656 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2657
2658/* The index in the VTT where this subobject's sub-VTT can be found.
2659 NULL_TREE if there is no sub-VTT. */
2660#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2661
2662/* The index in the VTT where the vptr for this subobject can be
2663 found. NULL_TREE if there is no secondary vptr in the VTT. */
2664#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2665
2666/* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2667 inheriting this base for non-virtual bases. For virtual bases it
2668 points either to the binfo for which this is a primary binfo, or to
2669 the binfo of the most derived type. */
2670#define BINFO_INHERITANCE_CHAIN(NODE) \
2671 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2672
2673
2674/* Define fields and accessors for nodes representing declared names. */
2675
2676/* Nonzero if DECL represents an SSA name or a variable that can possibly
2677 have an associated SSA name. */
2678#define SSA_VAR_P(DECL) \
2679 (TREE_CODE (DECL) == VAR_DECL \
2680 || TREE_CODE (DECL) == PARM_DECL \
2681 || TREE_CODE (DECL) == RESULT_DECL \
2682 || TREE_CODE (DECL) == SSA_NAME)
2683
2684
2685#define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2686
2687/* This is the name of the object as written by the user.
2688 It is an IDENTIFIER_NODE. */
2689#define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2690
2691/* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2692#define TYPE_IDENTIFIER(NODE) \
2693 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2694 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2695
2696/* Every ..._DECL node gets a unique number. */
2697#define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2698
2699/* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2700 uses. */
2701#define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2702
2703/* Every ..._DECL node gets a unique number that stays the same even
2704 when the decl is copied by the inliner once it is set. */
2705#define DECL_PT_UID(NODE) \
2706 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2707 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2708/* Initialize the ..._DECL node pt-uid to the decls uid. */
2709#define SET_DECL_PT_UID(NODE, UID) \
2710 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2711/* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2712 be preserved when copyin the decl. */
2713#define DECL_PT_UID_SET_P(NODE) \
2714 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2715
2716/* These two fields describe where in the source code the declaration
2717 was. If the declaration appears in several places (as for a C
2718 function that is declared first and then defined later), this
2719 information should refer to the definition. */
2720#define DECL_SOURCE_LOCATION(NODE) \
2721 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2722#define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2723#define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2724#define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2725/* This decl was created by a front-end or back-end rather than by
2726 user code, and has not been explicitly declared by the user -- when
2727 that happens the source location is updated to the user's
2728 source. This includes decls with no location (!). */
2729#define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2730 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2731
2732/* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2733 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2734 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2735 nodes, this points to either the FUNCTION_DECL for the containing
2736 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2737 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2738 scope". In particular, for VAR_DECLs which are virtual table pointers
2739 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2740 they belong to. */
2741#define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2742#define DECL_FIELD_CONTEXT(NODE) \
2743 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2744
2745/* If nonzero, decl's name shouldn't be emitted into debug info. */
2746#define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2747
2748/* For any sort of a ..._DECL node, this points to the original (abstract)
2749 decl node which this decl is an inlined/cloned instance of, or else it
2750 is NULL indicating that this decl is not an instance of some other decl.
2751
2752 The C front-end also uses this in a nested declaration of an inline
2753 function, to point back to the definition. */
2754#define DECL_ABSTRACT_ORIGIN(NODE) \
2755 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2756
2757/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2758 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2759#define DECL_ORIGIN(NODE) \
2760 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2761
2762/* Nonzero for any sort of ..._DECL node means this decl node represents an
2763 inline instance of some original (abstract) decl from an inline function;
2764 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2765 nodes can also have their abstract origin set to themselves. */
2766#define DECL_FROM_INLINE(NODE) \
2767 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2768 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2769
2770/* In a DECL this is the field where attributes are stored. */
2771#define DECL_ATTRIBUTES(NODE) \
2772 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2773
2774/* For a FUNCTION_DECL, holds the tree of BINDINGs.
2775 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2776 For a VAR_DECL, holds the initial value.
2777 For a PARM_DECL, used for DECL_ARG_TYPE--default
2778 values for parameters are encoded in the type of the function,
2779 not in the PARM_DECL slot.
2780 For a FIELD_DECL, this is used for enumeration values and the C
2781 frontend uses it for temporarily storing bitwidth of bitfields.
2782
2783 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2784#define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2785
2786/* Holds the size of the datum, in bits, as a tree expression.
2787 Need not be constant and may be null. May be less than TYPE_SIZE
2788 for a C++ FIELD_DECL representing a base class subobject with its
2789 own virtual base classes (which are laid out separately). */
2790#define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2791/* Likewise for the size in bytes. */
2792#define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2793#define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2794/* Returns the alignment required for the datum, in bits. It must
2795 be a power of two, but an "alignment" of zero is supported
2796 (e.g. as "uninitialized" sentinel). */
2797#define DECL_ALIGN(NODE) \
2798 (DECL_ALIGN_RAW (NODE) \
2799 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2800/* Specify that DECL_ALIGN(NODE) is X. */
2801#define SET_DECL_ALIGN(NODE, X) \
2802 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2803
2804/* The minimum alignment necessary for the datum, in bits, without
2805 warning. */
2806#define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2807 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2808#define DECL_WARN_IF_NOT_ALIGN(NODE) \
2809 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2810 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2811
2812/* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2813#define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2814 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2815
2816/* The alignment of NODE, in bytes. */
2817#define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2818/* Set if the alignment of this DECL has been set by the user, for
2819 example with an 'aligned' attribute. */
2820#define DECL_USER_ALIGN(NODE) \
2821 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2822/* Holds the machine mode corresponding to the declaration of a variable or
2823 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2824 FIELD_DECL. */
2825#define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2826#define SET_DECL_MODE(NODE, MODE) \
2827 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2828
2829/* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2830 operation it is. This is only intended for low-level accesses;
2831 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2832 should be used instead. */
2833#define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2834 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2835
2836/* Test if FCODE is a function code for an alloca operation. */
2837#define ALLOCA_FUNCTION_CODE_P(FCODE) \
2838 ((FCODE) == BUILT_IN_ALLOCA \
2839 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2840 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2841
2842/* Generate case for an alloca operation. */
2843#define CASE_BUILT_IN_ALLOCA \
2844 case BUILT_IN_ALLOCA: \
2845 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2846 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2847
2848#define DECL_FUNCTION_PERSONALITY(NODE) \
2849 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2850
2851/* Nonzero for a given ..._DECL node means that the name of this node should
2852 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2853 the associated type should be ignored. For a FUNCTION_DECL, the body of
2854 the function should also be ignored. */
2855#define DECL_IGNORED_P(NODE) \
2856 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2857
2858/* Nonzero for a given ..._DECL node means that this node represents an
2859 "abstract instance" of the given declaration (e.g. in the original
2860 declaration of an inline function). When generating symbolic debugging
2861 information, we mustn't try to generate any address information for nodes
2862 marked as "abstract instances" because we don't actually generate
2863 any code or allocate any data space for such instances. */
2864#define DECL_ABSTRACT_P(NODE) \
2865 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2866
2867/* Language-specific decl information. */
2868#define DECL_LANG_SPECIFIC(NODE) \
2869 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2870
2871/* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2872 do not allocate storage, and refer to a definition elsewhere. Note that
2873 this does not necessarily imply the entity represented by NODE
2874 has no program source-level definition in this translation unit. For
2875 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2876 DECL_EXTERNAL may be true simultaneously; that can be the case for
2877 a C99 "extern inline" function. */
2878#define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2879
2880/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2881 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2882
2883 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2884
2885 Also set in some languages for variables, etc., outside the normal
2886 lexical scope, such as class instance variables. */
2887#define DECL_NONLOCAL(NODE) \
2888 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2889
2890/* Used in VAR_DECLs to indicate that the variable is a vtable.
2891 Used in FIELD_DECLs for vtable pointers.
2892 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2893#define DECL_VIRTUAL_P(NODE) \
2894 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2895
2896/* Used to indicate that this DECL represents a compiler-generated entity. */
2897#define DECL_ARTIFICIAL(NODE) \
2898 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2899
2900/* Additional flags for language-specific uses. */
2901#define DECL_LANG_FLAG_0(NODE) \
2902 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2903#define DECL_LANG_FLAG_1(NODE) \
2904 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2905#define DECL_LANG_FLAG_2(NODE) \
2906 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2907#define DECL_LANG_FLAG_3(NODE) \
2908 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2909#define DECL_LANG_FLAG_4(NODE) \
2910 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2911#define DECL_LANG_FLAG_5(NODE) \
2912 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2913#define DECL_LANG_FLAG_6(NODE) \
2914 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2915#define DECL_LANG_FLAG_7(NODE) \
2916 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2917#define DECL_LANG_FLAG_8(NODE) \
2918 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2919
2920/* Nonzero for a scope which is equal to file scope. */
2921#define SCOPE_FILE_SCOPE_P(EXP) \
2922 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2923/* Nonzero for a decl which is at file scope. */
2924#define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2925/* Nonzero for a type which is at file scope. */
2926#define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2927
2928/* Nonzero for a decl that is decorated using attribute used.
2929 This indicates to compiler tools that this decl needs to be preserved. */
2930#define DECL_PRESERVE_P(DECL) \
2931 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2932
2933/* Nonzero for a decl that is decorated with the "noinit" attribute.
2934 decls with this attribute are placed into the ".noinit" section, so they are
2935 not initialized by the target's startup code. */
2936#define DECL_NOINIT_P(DECL) \
2937 (DECL_P (DECL) \
2938 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2939
2940/* Nonzero for a decl that is decorated with the "persistent" attribute.
2941 decls with this attribute are placed into the ".persistent" section, so they
2942 are not initialized by the target's startup code. */
2943#define DECL_PERSISTENT_P(DECL) \
2944 (DECL_P (DECL) \
2945 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2946
2947/* For function local variables of COMPLEX and VECTOR types,
2948 indicates that the variable is not aliased, and that all
2949 modifications to the variable have been adjusted so that
2950 they are killing assignments. Thus the variable may now
2951 be treated as a GIMPLE register, and use real instead of
2952 virtual ops in SSA form. */
2953#define DECL_NOT_GIMPLE_REG_P(DECL) \
2954 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2955
2957extern void decl_value_expr_insert (tree, tree);
2958
2959/* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2960 if transformations have made this more complicated than evaluating the
2961 decl itself. */
2962#define DECL_HAS_VALUE_EXPR_P(NODE) \
2963 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2964 ->decl_common.decl_flag_2)
2965#define DECL_VALUE_EXPR(NODE) \
2966 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2967#define SET_DECL_VALUE_EXPR(NODE, VAL) \
2968 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2969
2970/* Holds the RTL expression for the value of a variable or function.
2971 This value can be evaluated lazily for functions, variables with
2972 static storage duration, and labels. */
2973#define DECL_RTL(NODE) \
2974 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2975 ? (NODE)->decl_with_rtl.rtl \
2976 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2977
2978/* Set the DECL_RTL for NODE to RTL. */
2979#define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2980
2981/* Returns nonzero if NODE is a tree node that can contain RTL. */
2982#define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2983
2984/* Returns nonzero if the DECL_RTL for NODE has already been set. */
2985#define DECL_RTL_SET_P(NODE) \
2986 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2987
2988/* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2989 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2990#define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2991 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2992 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2993
2994/* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2995#define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2996
2997#if (GCC_VERSION >= 2007)
2998#define DECL_RTL_KNOWN_SET(decl) __extension__ \
2999({ tree const __d = (decl); \
3000 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
3001 /* Dereference it so the compiler knows it can't be NULL even \
3002 without assertion checking. */ \
3003 &*DECL_RTL_IF_SET (__d); })
3004#else
3005#define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
3006#endif
3007
3008/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
3009#define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
3010
3011/* In a FIELD_DECL, this is the field position, counting in bytes, of the
3012 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
3013 of the structure. */
3014#define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
3015
3016/* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
3017 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
3018 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
3019 natural alignment of the field's type). */
3020#define DECL_FIELD_BIT_OFFSET(NODE) \
3021 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
3022
3023/* In a FIELD_DECL, this indicates whether the field was a bit-field and
3024 if so, the type that was originally specified for it.
3025 TREE_TYPE may have been modified (in finish_struct). */
3026#define DECL_BIT_FIELD_TYPE(NODE) \
3027 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3028
3029/* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
3030 representative FIELD_DECL. */
3031#define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
3032 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3033
3034/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3035 if nonzero, indicates that the field occupies the type. */
3036#define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3037
3038/* For FIELD_DECLs, off_align holds the number of low-order bits of
3039 DECL_FIELD_OFFSET which are known to be always zero.
3040 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3041 has. */
3042#define DECL_OFFSET_ALIGN(NODE) \
3043 (HOST_WIDE_INT_1U << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3044
3045/* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
3046#define SET_DECL_OFFSET_ALIGN(NODE, X) \
3047 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3048
3049/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3050 which this FIELD_DECL is defined. This information is needed when
3051 writing debugging information about vfield and vbase decls for C++. */
3052#define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3053
3054/* In a FIELD_DECL, indicates this field should be bit-packed. */
3055#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3056
3057/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3058 specially. */
3059#define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3060
3061/* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
3062 like passing/returning containing struct by value.
3063 Set for C++17 empty base artificial FIELD_DECLs as well as
3064 empty [[no_unique_address]] non-static data members. */
3065#define DECL_FIELD_ABI_IGNORED(NODE) \
3066 (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3067#define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
3068 do { \
3069 gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
3070 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3071 } while (0)
3072
3073/* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
3074 removed from the IL since PR42217 until PR101539 and by that changed
3075 the ABI on several targets. This flag is provided so that the backends
3076 can decide on the ABI with zero-width bitfields and emit -Wpsabi
3077 warnings. */
3078#define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
3079 (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3080#define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
3081 do { \
3082 gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
3083 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3084 } while (0)
3085
3086/* Used in a FIELD_DECL to indicate that we cannot form the address of
3087 this component. This makes it possible for Type-Based Alias Analysis
3088 to disambiguate accesses to this field with indirect accesses using
3089 the field's type:
3090
3091 struct S { int i; } s;
3092 int *p;
3093
3094 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3095
3096 From the implementation's viewpoint, the alias set of the type of the
3097 field 'i' (int) will not be recorded as a subset of that of the type of
3098 's' (struct S) in record_component_aliases. The counterpart is that
3099 accesses to s.i must not be given the alias set of the type of 'i'
3100 (int) but instead directly that of the type of 's' (struct S). */
3101#define DECL_NONADDRESSABLE_P(NODE) \
3102 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3103
3104/* Used in a FIELD_DECL to indicate that this field is padding. */
3105#define DECL_PADDING_P(NODE) \
3106 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3107
3108/* Used in a FIELD_DECL to indicate whether this field is not a flexible
3109 array member. This is only valid for the last array type field of a
3110 structure. */
3111#define DECL_NOT_FLEXARRAY(NODE) \
3112 (FIELD_DECL_CHECK (NODE)->decl_common.decl_not_flexarray)
3113
3114/* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3115 dense, unique within any one function, and may be used to index arrays.
3116 If the value is -1, then no UID has been assigned. */
3117#define LABEL_DECL_UID(NODE) \
3118 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3119
3120/* In a LABEL_DECL, the EH region number for which the label is the
3121 post_landing_pad. */
3122#define EH_LANDING_PAD_NR(NODE) \
3123 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3124
3125/* For a PARM_DECL, records the data type used to pass the argument,
3126 which may be different from the type seen in the program. */
3127#define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3128
3129/* For PARM_DECL, holds an RTL for the stack slot or register
3130 where the data was actually passed. */
3131#define DECL_INCOMING_RTL(NODE) \
3132 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3133
3134/* Nonzero for a given ..._DECL node means that no warnings should be
3135 generated just because this node is unused. */
3136#define DECL_IN_SYSTEM_HEADER(NODE) \
3137 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3138
3139/* Used to indicate that the linkage status of this DECL is not yet known,
3140 so it should not be output now. */
3141#define DECL_DEFER_OUTPUT(NODE) \
3142 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3143
3144/* In a VAR_DECL that's static,
3145 nonzero if the space is in the text section. */
3146#define DECL_IN_TEXT_SECTION(NODE) \
3147 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3148
3149/* In a VAR_DECL that's static,
3150 nonzero if it belongs to the global constant pool. */
3151#define DECL_IN_CONSTANT_POOL(NODE) \
3152 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3153
3154/* Nonzero for a given ..._DECL node means that this node should be
3155 put in .common, if possible. If a DECL_INITIAL is given, and it
3156 is not error_mark_node, then the decl cannot be put in .common. */
3157#define DECL_COMMON(NODE) \
3158 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3159
3160/* In a VAR_DECL, nonzero if the decl is a register variable with
3161 an explicit asm specification. */
3162#define DECL_HARD_REGISTER(NODE) \
3163 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3164
3165 /* Used to indicate that this DECL has weak linkage. */
3166#define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3167
3168/* Used to indicate that the DECL is a dllimport. */
3169#define DECL_DLLIMPORT_P(NODE) \
3170 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3171
3172/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3173 not be put out unless it is needed in this translation unit.
3174 Entities like this are shared across translation units (like weak
3175 entities), but are guaranteed to be generated by any translation
3176 unit that needs them, and therefore need not be put out anywhere
3177 where they are not needed. DECL_COMDAT is just a hint to the
3178 back-end; it is up to front-ends which set this flag to ensure
3179 that there will never be any harm, other than bloat, in putting out
3180 something which is DECL_COMDAT. */
3181#define DECL_COMDAT(NODE) \
3182 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3183
3184#define DECL_COMDAT_GROUP(NODE) \
3185 decl_comdat_group (NODE)
3186
3187/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3188 multiple translation units should be merged. */
3189#define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3190 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3191
3192/* The name of the object as the assembler will see it (but before any
3193 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3194 as DECL_NAME. It is an IDENTIFIER_NODE.
3195
3196 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3197 One Definition Rule based type merging at LTO. It is computed only for
3198 LTO compilation and C++. */
3199#define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3200
3201/* Raw accessor for DECL_ASSEMBLE_NAME. */
3202#define DECL_ASSEMBLER_NAME_RAW(NODE) \
3203 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3204
3205/* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3206 This is true of all DECL nodes except FIELD_DECL. */
3207#define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3208 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3209
3210/* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3211 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3212 yet. */
3213#define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3214 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3215
3216/* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3217#define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3218 overwrite_decl_assembler_name (NODE, NAME)
3219
3220/* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3221 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3222 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3223 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3224 other words, the semantics of using this macro, are different than
3225 saying:
3226
3227 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3228
3229 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3230
3231#define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3232 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3233
3234/* Records the section name in a section attribute. Used to pass
3235 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3236#define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3237
3238/* Nonzero in a decl means that the gimplifier has seen (or placed)
3239 this variable in a BIND_EXPR. */
3240#define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3241 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3242
3243/* Value of the decls's visibility attribute */
3244#define DECL_VISIBILITY(NODE) \
3245 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3246
3247/* Nonzero means that the decl (or an enclosing scope) had its
3248 visibility specified rather than being inferred. */
3249#define DECL_VISIBILITY_SPECIFIED(NODE) \
3250 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3251
3252/* In a VAR_DECL, the model to use if the data should be allocated from
3253 thread-local storage. */
3254#define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3255
3256/* In a VAR_DECL, nonzero if the data should be allocated from
3257 thread-local storage. */
3258#define DECL_THREAD_LOCAL_P(NODE) \
3259 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3260
3261/* In a non-local VAR_DECL with static storage duration, true if the
3262 variable has an initialization priority. If false, the variable
3263 will be initialized at the DEFAULT_INIT_PRIORITY. */
3264#define DECL_HAS_INIT_PRIORITY_P(NODE) \
3265 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3266
3268extern void decl_debug_expr_insert (tree, tree);
3269
3270/* For VAR_DECL, this is set to an expression that it was split from. */
3271#define DECL_HAS_DEBUG_EXPR_P(NODE) \
3272 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3273#define DECL_DEBUG_EXPR(NODE) \
3274 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3275
3276#define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3277 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3278
3283
3284/* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3285 NODE. */
3286#define DECL_INIT_PRIORITY(NODE) \
3287 (decl_init_priority_lookup (NODE))
3288/* Set the initialization priority for NODE to VAL. */
3289#define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3290 (decl_init_priority_insert (NODE, VAL))
3291
3292/* For a FUNCTION_DECL the finalization priority of NODE. */
3293#define DECL_FINI_PRIORITY(NODE) \
3294 (decl_fini_priority_lookup (NODE))
3295/* Set the finalization priority for NODE to VAL. */
3296#define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3297 (decl_fini_priority_insert (NODE, VAL))
3298
3299/* The initialization priority for entities for which no explicit
3300 initialization priority has been specified. */
3301#define DEFAULT_INIT_PRIORITY 65535
3302
3303/* The maximum allowed initialization priority. */
3304#define MAX_INIT_PRIORITY 65535
3305
3306/* The largest priority value reserved for use by system runtime
3307 libraries. */
3308#define MAX_RESERVED_INIT_PRIORITY 100
3309
3310/* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3311#define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3312 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3313
3314/* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3315#define DECL_NONLOCAL_FRAME(NODE) \
3316 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3317
3318/* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3319#define DECL_NONALIASED(NODE) \
3320 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3321
3322/* In a VAR_DECL, nonzero if this variable is not required to have a distinct
3323 address from other variables with the same constant value. In other words,
3324 consider -fmerge-all-constants to be on for this VAR_DECL. */
3325#define DECL_MERGEABLE(NODE) \
3326 (VAR_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3327
3328/* This field is used to reference anything in decl.result and is meant only
3329 for use by the garbage collector. */
3330#define DECL_RESULT_FLD(NODE) \
3331 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3332
3333/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3334 Before the struct containing the FUNCTION_DECL is laid out,
3335 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3336 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3337 function. When the class is laid out, this pointer is changed
3338 to an INTEGER_CST node which is suitable for use as an index
3339 into the virtual function table. */
3340#define DECL_VINDEX(NODE) \
3341 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3342
3343/* In FUNCTION_DECL, holds the decl for the return value. */
3344#define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3345
3346/* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3347#define DECL_UNINLINABLE(NODE) \
3348 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3349
3350/* In a FUNCTION_DECL, the saved representation of the body of the
3351 entire function. */
3352#define DECL_SAVED_TREE(NODE) \
3353 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3354
3355/* Nonzero in a FUNCTION_DECL means this function should be treated
3356 as if it were a malloc, meaning it returns a pointer that is
3357 not an alias. */
3358#define DECL_IS_MALLOC(NODE) \
3359 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3360
3361/* Macro for direct set and get of function_decl.decl_type. */
3362#define FUNCTION_DECL_DECL_TYPE(NODE) \
3363 (NODE->function_decl.decl_type)
3364
3365/* Set decl_type of a DECL. Set it to T when SET is true, or reset
3366 it to NONE. */
3367
3368inline void
3369set_function_decl_type (tree decl, function_decl_type t, bool set)
3370{
3371 if (set)
3372 {
3374 || FUNCTION_DECL_DECL_TYPE (decl) == t);
3376 }
3377 else if (FUNCTION_DECL_DECL_TYPE (decl) == t)
3379}
3380
3381/* Nonzero in a FUNCTION_DECL means this function is a replaceable
3382 function (like replaceable operators new or delete). */
3383#define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3384 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3385
3386/* Nonzero in a FUNCTION_DECL means this function should be treated as
3387 C++ operator new, meaning that it returns a pointer for which we
3388 should not use type based aliasing. */
3389#define DECL_IS_OPERATOR_NEW_P(NODE) \
3390 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_NEW)
3391
3392#define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3393 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3394
3395#define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3396 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3397
3398/* Nonzero in a FUNCTION_DECL means this function should be treated as
3399 C++ operator delete. */
3400#define DECL_IS_OPERATOR_DELETE_P(NODE) \
3401 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_DELETE)
3402
3403#define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3404 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3405
3406/* Nonzero in a FUNCTION_DECL means this function may return more
3407 than once. */
3408#define DECL_IS_RETURNS_TWICE(NODE) \
3409 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3410
3411/* Nonzero in a FUNCTION_DECL means this function should be treated
3412 as "pure" function (like const function, but may read global memory).
3413 Note that being pure or const for a function is orthogonal to being
3414 nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3415 cleared. */
3416#define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3417
3418/* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3419 the const or pure function may not terminate. When this is nonzero
3420 for a const or pure function, it can be dealt with by cse passes
3421 but cannot be removed by dce passes since you are not allowed to
3422 change an infinite looping program into one that terminates without
3423 error. */
3424#define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3425 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3426
3427/* Nonzero in a FUNCTION_DECL means this function should be treated
3428 as "novops" function (function that does not read global memory,
3429 but may have arbitrary side effects). */
3430#define DECL_IS_NOVOPS(NODE) \
3431 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3432
3433/* Used in FUNCTION_DECLs to indicate that they should be run automatically
3434 at the beginning or end of execution. */
3435#define DECL_STATIC_CONSTRUCTOR(NODE) \
3436 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3437
3438#define DECL_STATIC_DESTRUCTOR(NODE) \
3439(FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3440
3441/* Used in FUNCTION_DECLs to indicate that function entry and exit should
3442 be instrumented with calls to support routines. */
3443#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3444 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3445
3446/* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3447 disabled in this function. */
3448#define DECL_NO_LIMIT_STACK(NODE) \
3449 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3450
3451/* In a FUNCTION_DECL indicates that a static chain is needed. */
3452#define DECL_STATIC_CHAIN(NODE) \
3453 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3454
3455/* Nonzero for a decl that cgraph has decided should be inlined into
3456 at least one call site. It is not meaningful to look at this
3457 directly; always use cgraph_function_possibly_inlined_p. */
3458#define DECL_POSSIBLY_INLINED(DECL) \
3459 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3460
3461/* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3462 such as via the `inline' keyword in C/C++. This flag controls the linkage
3463 semantics of 'inline' */
3464#define DECL_DECLARED_INLINE_P(NODE) \
3465 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3466
3467/* Nonzero in a FUNCTION_DECL means this function should not get
3468 -Winline warnings. */
3469#define DECL_NO_INLINE_WARNING_P(NODE) \
3470 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3471
3472/* Nonzero if a FUNCTION_CODE is a TM load/store. */
3473#define BUILTIN_TM_LOAD_STORE_P(FN) \
3474 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3475
3476/* Nonzero if a FUNCTION_CODE is a TM load. */
3477#define BUILTIN_TM_LOAD_P(FN) \
3478 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3479
3480/* Nonzero if a FUNCTION_CODE is a TM store. */
3481#define BUILTIN_TM_STORE_P(FN) \
3482 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3483
3484#define CASE_BUILT_IN_TM_LOAD(FN) \
3485 case BUILT_IN_TM_LOAD_##FN: \
3486 case BUILT_IN_TM_LOAD_RAR_##FN: \
3487 case BUILT_IN_TM_LOAD_RAW_##FN: \
3488 case BUILT_IN_TM_LOAD_RFW_##FN
3489
3490#define CASE_BUILT_IN_TM_STORE(FN) \
3491 case BUILT_IN_TM_STORE_##FN: \
3492 case BUILT_IN_TM_STORE_WAR_##FN: \
3493 case BUILT_IN_TM_STORE_WAW_##FN
3494
3495/* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3496 disregarding size and cost heuristics. This is equivalent to using
3497 the always_inline attribute without the required diagnostics if the
3498 function cannot be inlined. */
3499#define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3500 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3501
3504
3505/* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3506#define DECL_HAS_DEBUG_ARGS_P(NODE) \
3507 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3508
3509/* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3510 that describes the status of this function. */
3511#define DECL_STRUCT_FUNCTION(NODE) \
3512 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3513
3514/* For a builtin function, identify which part of the compiler defined it. */
3515#define DECL_BUILT_IN_CLASS(NODE) \
3516 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3517
3518/* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3519#define DECL_ARGUMENTS(NODE) \
3520 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3521
3522/* In FUNCTION_DECL, the function specific target options to use when compiling
3523 this function. */
3524#define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3525 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3526
3527/* In FUNCTION_DECL, the function specific optimization options to use when
3528 compiling this function. */
3529#define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3530 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3531
3532/* In FUNCTION_DECL, this is set if this function has other versions generated
3533 to support different architecture feature sets, e.g. using "target" or
3534 "target_version" attributes. */
3535#define DECL_FUNCTION_VERSIONED(NODE)\
3536 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3537
3538/* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3539 Devirtualization machinery uses this knowledge for determing type of the
3540 object constructed. Also we assume that constructor address is not
3541 important. */
3542#define DECL_CXX_CONSTRUCTOR_P(NODE)\
3543 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3544
3545/* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3546 Devirtualization machinery uses this to track types in destruction. */
3547#define DECL_CXX_DESTRUCTOR_P(NODE)\
3548 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3549
3550/* In FUNCTION_DECL, this is set if this function is a lambda function. */
3551#define DECL_LAMBDA_FUNCTION_P(NODE) \
3552 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == LAMBDA_FUNCTION)
3553
3554#define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3555 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3556
3557/* In FUNCTION_DECL that represent an virtual method this is set when
3558 the method is final. */
3559#define DECL_FINAL_P(NODE)\
3560 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3561
3562/* The source language of the translation-unit. */
3563#define TRANSLATION_UNIT_LANGUAGE(NODE) \
3564 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3565
3566/* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3567
3568/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3569#define DECL_ORIGINAL_TYPE(NODE) \
3570 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3571
3572/* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3573 into stabs. Instead it will generate cross reference ('x') of names.
3574 This uses the same flag as DECL_EXTERNAL. */
3575#define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3576 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3577
3578/* Getter of the imported declaration associated to the
3579 IMPORTED_DECL node. */
3580#define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3581(DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3582
3583/* Getter of the symbol declaration associated with the
3584 NAMELIST_DECL node. */
3585#define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3586 (DECL_INITIAL (NODE))
3587
3588/* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3589 To reduce overhead, the nodes containing the statements are not trees.
3590 This avoids the overhead of tree_common on all linked list elements.
3591
3592 Use the interface in tree-iterator.h to access this node. */
3593
3594#define STATEMENT_LIST_HEAD(NODE) \
3595 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3596#define STATEMENT_LIST_TAIL(NODE) \
3597 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3598
3599#define TREE_OPTIMIZATION(NODE) \
3600 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3601
3602#define TREE_OPTIMIZATION_OPTABS(NODE) \
3603 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3604
3605#define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3606 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3607
3608/* Return a tree node that encapsulates the optimization options in OPTS
3609 and OPTS_SET. */
3610extern tree build_optimization_node (struct gcc_options *opts,
3611 struct gcc_options *opts_set);
3612
3613#define TREE_TARGET_OPTION(NODE) \
3614 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3615
3616#define TREE_TARGET_GLOBALS(NODE) \
3617 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3618
3619/* Return a tree node that encapsulates the target options in OPTS and
3620 OPTS_SET. */
3621extern tree build_target_option_node (struct gcc_options *opts,
3622 struct gcc_options *opts_set);
3623
3624extern void prepare_target_option_nodes_for_pch (void);
3625
3626#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3627
3628inline tree
3629tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3630{
3631 if (TREE_CODE (__t) != __c)
3632 tree_check_failed (__t, __f, __l, __g, __c, 0);
3633 return __t;
3634}
3635
3636inline tree
3637tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3638 enum tree_code __c)
3639{
3640 if (TREE_CODE (__t) == __c)
3641 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3642 return __t;
3643}
3644
3645inline tree
3646tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3647 enum tree_code __c1, enum tree_code __c2)
3648{
3649 if (TREE_CODE (__t) != __c1
3650 && TREE_CODE (__t) != __c2)
3651 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3652 return __t;
3653}
3654
3655inline tree
3656tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3657 enum tree_code __c1, enum tree_code __c2)
3658{
3659 if (TREE_CODE (__t) == __c1
3660 || TREE_CODE (__t) == __c2)
3661 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3662 return __t;
3663}
3664
3665inline tree
3666tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3667 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3668{
3669 if (TREE_CODE (__t) != __c1
3670 && TREE_CODE (__t) != __c2
3671 && TREE_CODE (__t) != __c3)
3672 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3673 return __t;
3674}
3675
3676inline tree
3677tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3678 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3679{
3680 if (TREE_CODE (__t) == __c1
3681 || TREE_CODE (__t) == __c2
3682 || TREE_CODE (__t) == __c3)
3683 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3684 return __t;
3685}
3686
3687inline tree
3688tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3689 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3690 enum tree_code __c4)
3691{
3692 if (TREE_CODE (__t) != __c1
3693 && TREE_CODE (__t) != __c2
3694 && TREE_CODE (__t) != __c3
3695 && TREE_CODE (__t) != __c4)
3696 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3697 return __t;
3698}
3699
3700inline tree
3701tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3702 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3703 enum tree_code __c4)
3704{
3705 if (TREE_CODE (__t) == __c1
3706 || TREE_CODE (__t) == __c2
3707 || TREE_CODE (__t) == __c3
3708 || TREE_CODE (__t) == __c4)
3709 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3710 return __t;
3711}
3712
3713inline tree
3714tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3715 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3716 enum tree_code __c4, enum tree_code __c5)
3717{
3718 if (TREE_CODE (__t) != __c1
3719 && TREE_CODE (__t) != __c2
3720 && TREE_CODE (__t) != __c3
3721 && TREE_CODE (__t) != __c4
3722 && TREE_CODE (__t) != __c5)
3723 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3724 return __t;
3725}
3726
3727inline tree
3728tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3729 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3730 enum tree_code __c4, enum tree_code __c5)
3731{
3732 if (TREE_CODE (__t) == __c1
3733 || TREE_CODE (__t) == __c2
3734 || TREE_CODE (__t) == __c3
3735 || TREE_CODE (__t) == __c4
3736 || TREE_CODE (__t) == __c5)
3737 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3738 return __t;
3739}
3740
3741inline tree
3742tree_check6 (tree __t, const char *__f, int __l, const char *__g,
3743 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3744 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3745{
3746 if (TREE_CODE (__t) != __c1
3747 && TREE_CODE (__t) != __c2
3748 && TREE_CODE (__t) != __c3
3749 && TREE_CODE (__t) != __c4
3750 && TREE_CODE (__t) != __c5
3751 && TREE_CODE (__t) != __c6)
3752 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
3753 0);
3754 return __t;
3755}
3756
3757inline tree
3758tree_not_check6 (tree __t, const char *__f, int __l, const char *__g,
3759 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3760 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3761{
3762 if (TREE_CODE (__t) == __c1
3763 || TREE_CODE (__t) == __c2
3764 || TREE_CODE (__t) == __c3
3765 || TREE_CODE (__t) == __c4
3766 || TREE_CODE (__t) == __c5
3767 || TREE_CODE (__t) == __c6)
3768 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
3769 __c6, 0);
3770 return __t;
3771}
3772
3773inline tree
3774contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3775 const char *__f, int __l, const char *__g)
3776{
3777 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3778 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3779 return __t;
3780}
3781
3782inline tree
3783tree_class_check (tree __t, const enum tree_code_class __class,
3784 const char *__f, int __l, const char *__g)
3785{
3786 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3787 tree_class_check_failed (__t, __class, __f, __l, __g);
3788 return __t;
3789}
3790
3791inline tree
3792tree_range_check (tree __t,
3793 enum tree_code __code1, enum tree_code __code2,
3794 const char *__f, int __l, const char *__g)
3795{
3796 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3797 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3798 return __t;
3799}
3800
3801inline tree
3802omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3803 const char *__f, int __l, const char *__g)
3804{
3805 if (TREE_CODE (__t) != OMP_CLAUSE)
3806 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3807 if (__t->omp_clause.code != __code)
3808 omp_clause_check_failed (__t, __f, __l, __g, __code);
3809 return __t;
3810}
3811
3812inline tree
3813omp_clause_range_check (tree __t,
3814 enum omp_clause_code __code1,
3815 enum omp_clause_code __code2,
3816 const char *__f, int __l, const char *__g)
3817{
3818 if (TREE_CODE (__t) != OMP_CLAUSE)
3819 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3820 if ((int) __t->omp_clause.code < (int) __code1
3821 || (int) __t->omp_clause.code > (int) __code2)
3822 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3823 return __t;
3824}
3825
3826/* These checks have to be special cased. */
3827
3828inline tree
3829expr_check (tree __t, const char *__f, int __l, const char *__g)
3830{
3831 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3832 if (!IS_EXPR_CODE_CLASS (__c))
3833 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3834 return __t;
3835}
3836
3837/* These checks have to be special cased. */
3838
3839inline tree
3840non_type_check (tree __t, const char *__f, int __l, const char *__g)
3841{
3842 if (TYPE_P (__t))
3843 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3844 return __t;
3845}
3846
3847inline const HOST_WIDE_INT *
3848tree_int_cst_elt_check (const_tree __t, int __i,
3849 const char *__f, int __l, const char *__g)
3850{
3851 if (TREE_CODE (__t) != INTEGER_CST)
3852 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3853 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3854 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3855 __f, __l, __g);
3856 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3857}
3858
3859inline HOST_WIDE_INT *
3860tree_int_cst_elt_check (tree __t, int __i,
3861 const char *__f, int __l, const char *__g)
3862{
3863 if (TREE_CODE (__t) != INTEGER_CST)
3864 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3865 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3866 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3867 __f, __l, __g);
3868 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3869}
3870
3871/* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3872
3873# if GCC_VERSION >= 4006
3874#pragma GCC diagnostic push
3875#pragma GCC diagnostic ignored "-Wstrict-overflow"
3876#endif
3877
3878inline tree *
3879tree_vec_elt_check (tree __t, int __i,
3880 const char *__f, int __l, const char *__g)
3881{
3882 if (TREE_CODE (__t) != TREE_VEC)
3883 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3884 if (__i < 0 || __i >= __t->base.u.length)
3885 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3886 return &CONST_CAST_TREE (__t)->vec.a[__i];
3887}
3888
3889# if GCC_VERSION >= 4006
3890#pragma GCC diagnostic pop
3891#endif
3892
3893inline tree *
3894omp_clause_elt_check (tree __t, int __i,
3895 const char *__f, int __l, const char *__g)
3896{
3897 if (TREE_CODE (__t) != OMP_CLAUSE)
3898 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3899 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3900 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3901 return &__t->omp_clause.ops[__i];
3902}
3903
3904/* These checks have to be special cased. */
3905
3906inline tree
3907any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3908{
3909 if (!ANY_INTEGRAL_TYPE_P (__t))
3910 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3911 INTEGER_TYPE, BITINT_TYPE, 0);
3912 return __t;
3913}
3914
3915inline const_tree
3916tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3917 tree_code __c)
3918{
3919 if (TREE_CODE (__t) != __c)
3920 tree_check_failed (__t, __f, __l, __g, __c, 0);
3921 return __t;
3922}
3923
3924inline const_tree
3925tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3926 enum tree_code __c)
3927{
3928 if (TREE_CODE (__t) == __c)
3929 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3930 return __t;
3931}
3932
3933inline const_tree
3934tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3935 enum tree_code __c1, enum tree_code __c2)
3936{
3937 if (TREE_CODE (__t) != __c1
3938 && TREE_CODE (__t) != __c2)
3939 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3940 return __t;
3941}
3942
3943inline const_tree
3944tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3945 enum tree_code __c1, enum tree_code __c2)
3946{
3947 if (TREE_CODE (__t) == __c1
3948 || TREE_CODE (__t) == __c2)
3949 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3950 return __t;
3951}
3952
3953inline const_tree
3954tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3955 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3956{
3957 if (TREE_CODE (__t) != __c1
3958 && TREE_CODE (__t) != __c2
3959 && TREE_CODE (__t) != __c3)
3960 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3961 return __t;
3962}
3963
3964inline const_tree
3965tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3966 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3967{
3968 if (TREE_CODE (__t) == __c1
3969 || TREE_CODE (__t) == __c2
3970 || TREE_CODE (__t) == __c3)
3971 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3972 return __t;
3973}
3974
3975inline const_tree
3976tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3977 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3978 enum tree_code __c4)
3979{
3980 if (TREE_CODE (__t) != __c1
3981 && TREE_CODE (__t) != __c2
3982 && TREE_CODE (__t) != __c3
3983 && TREE_CODE (__t) != __c4)
3984 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3985 return __t;
3986}
3987
3988inline const_tree
3989tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3990 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3991 enum tree_code __c4)
3992{
3993 if (TREE_CODE (__t) == __c1
3994 || TREE_CODE (__t) == __c2
3995 || TREE_CODE (__t) == __c3
3996 || TREE_CODE (__t) == __c4)
3997 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3998 return __t;
3999}
4000
4001inline const_tree
4002tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4003 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4004 enum tree_code __c4, enum tree_code __c5)
4005{
4006 if (TREE_CODE (__t) != __c1
4007 && TREE_CODE (__t) != __c2
4008 && TREE_CODE (__t) != __c3
4009 && TREE_CODE (__t) != __c4
4010 && TREE_CODE (__t) != __c5)
4011 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4012 return __t;
4013}
4014
4015inline const_tree
4016tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4017 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4018 enum tree_code __c4, enum tree_code __c5)
4019{
4020 if (TREE_CODE (__t) == __c1
4021 || TREE_CODE (__t) == __c2
4022 || TREE_CODE (__t) == __c3
4023 || TREE_CODE (__t) == __c4
4024 || TREE_CODE (__t) == __c5)
4025 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4026 return __t;
4027}
4028
4029inline const_tree
4030tree_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4031 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4032 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4033{
4034 if (TREE_CODE (__t) != __c1
4035 && TREE_CODE (__t) != __c2
4036 && TREE_CODE (__t) != __c3
4037 && TREE_CODE (__t) != __c4
4038 && TREE_CODE (__t) != __c5
4039 && TREE_CODE (__t) != __c6)
4040 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
4041 0);
4042 return __t;
4043}
4044
4045inline const_tree
4046tree_not_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4047 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4048 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4049{
4050 if (TREE_CODE (__t) == __c1
4051 || TREE_CODE (__t) == __c2
4052 || TREE_CODE (__t) == __c3
4053 || TREE_CODE (__t) == __c4
4054 || TREE_CODE (__t) == __c5
4055 || TREE_CODE (__t) == __c6)
4056 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
4057 __c6, 0);
4058 return __t;
4059}
4060
4061inline const_tree
4062contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
4063 const char *__f, int __l, const char *__g)
4064{
4065 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
4066 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
4067 return __t;
4068}
4069
4070inline const_tree
4071tree_class_check (const_tree __t, const enum tree_code_class __class,
4072 const char *__f, int __l, const char *__g)
4073{
4074 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
4075 tree_class_check_failed (__t, __class, __f, __l, __g);
4076 return __t;
4077}
4078
4079inline const_tree
4080tree_range_check (const_tree __t,
4081 enum tree_code __code1, enum tree_code __code2,
4082 const char *__f, int __l, const char *__g)
4083{
4084 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
4085 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4086 return __t;
4087}
4088
4089inline const_tree
4090omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
4091 const char *__f, int __l, const char *__g)
4092{
4093 if (TREE_CODE (__t) != OMP_CLAUSE)
4094 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4095 if (__t->omp_clause.code != __code)
4096 omp_clause_check_failed (__t, __f, __l, __g, __code);
4097 return __t;
4098}
4099
4100inline const_tree
4101omp_clause_range_check (const_tree __t,
4102 enum omp_clause_code __code1,
4103 enum omp_clause_code __code2,
4104 const char *__f, int __l, const char *__g)
4105{
4106 if (TREE_CODE (__t) != OMP_CLAUSE)
4107 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4108 if ((int) __t->omp_clause.code < (int) __code1
4109 || (int) __t->omp_clause.code > (int) __code2)
4110 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4111 return __t;
4112}
4113
4114inline const_tree
4115expr_check (const_tree __t, const char *__f, int __l, const char *__g)
4116{
4117 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
4118 if (!IS_EXPR_CODE_CLASS (__c))
4119 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
4120 return __t;
4121}
4122
4123inline const_tree
4124non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
4125{
4126 if (TYPE_P (__t))
4127 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
4128 return __t;
4129}
4130
4131# if GCC_VERSION >= 4006
4132#pragma GCC diagnostic push
4133#pragma GCC diagnostic ignored "-Wstrict-overflow"
4134#endif
4135
4136inline const_tree *
4137tree_vec_elt_check (const_tree __t, int __i,
4138 const char *__f, int __l, const char *__g)
4139{
4140 if (TREE_CODE (__t) != TREE_VEC)
4141 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
4142 if (__i < 0 || __i >= __t->base.u.length)
4143 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
4144 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
4145 //return &__t->vec.a[__i];
4146}
4147
4148# if GCC_VERSION >= 4006
4149#pragma GCC diagnostic pop
4150#endif
4151
4152inline const_tree *
4153omp_clause_elt_check (const_tree __t, int __i,
4154 const char *__f, int __l, const char *__g)
4155{
4156 if (TREE_CODE (__t) != OMP_CLAUSE)
4157 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4158 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
4159 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
4160 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
4161}
4162
4163inline const_tree
4164any_integral_type_check (const_tree __t, const char *__f, int __l,
4165 const char *__g)
4166{
4167 if (!ANY_INTEGRAL_TYPE_P (__t))
4168 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
4169 INTEGER_TYPE, BITINT_TYPE, 0);
4170 return __t;
4171}
4172
4173#endif
4174
4175/* Compute the number of operands in an expression node NODE. For
4176 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4177 otherwise it is looked up from the node's code. */
4178inline int
4180{
4181 if (VL_EXP_CLASS_P (node))
4182 return VL_EXP_OPERAND_LENGTH (node);
4183 else
4184 return TREE_CODE_LENGTH (TREE_CODE (node));
4185}
4186
4187#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4188
4189/* Special checks for TREE_OPERANDs. */
4190inline tree *
4191tree_operand_check (tree __t, int __i,
4192 const char *__f, int __l, const char *__g)
4193{
4194 const_tree __u = EXPR_CHECK (__t);
4195 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4196 tree_operand_check_failed (__i, __u, __f, __l, __g);
4197 return &CONST_CAST_TREE (__u)->exp.operands[__i];
4198}
4199
4200inline tree *
4201tree_operand_check_code (tree __t, enum tree_code __code, int __i,
4202 const char *__f, int __l, const char *__g)
4203{
4204 if (TREE_CODE (__t) != __code)
4205 tree_check_failed (__t, __f, __l, __g, __code, 0);
4206 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4207 tree_operand_check_failed (__i, __t, __f, __l, __g);
4208 return &__t->exp.operands[__i];
4209}
4210
4211inline const_tree *
4212tree_operand_check (const_tree __t, int __i,
4213 const char *__f, int __l, const char *__g)
4214{
4215 const_tree __u = EXPR_CHECK (__t);
4216 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4217 tree_operand_check_failed (__i, __u, __f, __l, __g);
4218 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
4219}
4220
4221inline const_tree *
4222tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
4223 const char *__f, int __l, const char *__g)
4224{
4225 if (TREE_CODE (__t) != __code)
4226 tree_check_failed (__t, __f, __l, __g, __code, 0);
4227 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4228 tree_operand_check_failed (__i, __t, __f, __l, __g);
4229 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
4230}
4231
4232#endif
4233
4234/* True iff an identifier matches a C string. */
4235
4236inline bool
4237id_equal (const_tree id, const char *str)
4238{
4239 return !strcmp (IDENTIFIER_POINTER (id), str);
4240}
4241
4242inline bool
4243id_equal (const char *str, const_tree id)
4244{
4245 return id_equal (id, str);
4246}
4247
4248/* Return the number of elements in the VECTOR_TYPE given by NODE. */
4249
4250inline poly_uint64
4252{
4254 unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision;
4255 if (NUM_POLY_INT_COEFFS == 2)
4256 {
4257 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4258 description of the encoding. */
4259 poly_uint64 res = 0;
4260 res.coeffs[0] = HOST_WIDE_INT_1U << (precision & 0xff);
4261 if (precision & 0x100)
4262 res.coeffs[1] = HOST_WIDE_INT_1U << (precision & 0xff);
4263 return res;
4264 }
4265 else
4266 return HOST_WIDE_INT_1U << precision;
4267}
4268
4269/* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4270 satisfy valid_vector_subparts_p. */
4271
4272inline void
4274{
4276 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4277 int index = exact_log2 (coeff0);
4278 gcc_assert (index >= 0);
4279 if (NUM_POLY_INT_COEFFS == 2)
4280 {
4281 /* We have two coefficients that are each in the range 1 << [0, 63],
4282 so supporting all combinations would require 6 bits per coefficient
4283 and 12 bits in total. Since the precision field is only 10 bits
4284 in size, we need to be more restrictive than that.
4285
4286 At present, coeff[1] is always either 0 (meaning that the number
4287 of units is constant) or equal to coeff[0] (meaning that the number
4288 of units is N + X * N for some target-dependent zero-based runtime
4289 parameter X). We can therefore encode coeff[1] in a single bit.
4290
4291 The most compact encoding would be to use mask 0x3f for coeff[0]
4292 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4293 get slightly more efficient code on some hosts if we instead
4294 treat the shift amount as an independent byte, so here we use
4295 0xff for coeff[0] and 0x100 for coeff[1]. */
4296 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4297 gcc_assert (coeff1 == 0 || coeff1 == coeff0);
4298 VECTOR_TYPE_CHECK (node)->type_common.precision
4299 = index + (coeff1 != 0 ? 0x100 : 0);
4300 }
4301 else
4302 VECTOR_TYPE_CHECK (node)->type_common.precision = index;
4303}
4304
4305/* Return true if we can construct vector types with the given number
4306 of subparts. */
4307
4308inline bool
4310{
4311 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4312 if (!pow2p_hwi (coeff0))
4313 return false;
4314 if (NUM_POLY_INT_COEFFS == 2)
4315 {
4316 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4317 if (coeff1 != 0 && coeff1 != coeff0)
4318 return false;
4319 }
4320 return true;
4321}
4322
4323/* Return the built-in function that DECL represents, given that it is known
4324 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4325inline built_in_function
4327{
4328 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4329 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_NORMAL);
4330 return (built_in_function) fndecl.function_code;
4331}
4332
4333/* Return the target-specific built-in function that DECL represents,
4334 given that it is known to be a FUNCTION_DECL with built-in class
4335 BUILT_IN_MD. */
4336inline int
4338{
4339 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4340 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_MD);
4341 return fndecl.function_code;
4342}
4343
4344/* Return the frontend-specific built-in function that DECL represents,
4345 given that it is known to be a FUNCTION_DECL with built-in class
4346 BUILT_IN_FRONTEND. */
4347inline int
4349{
4350 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4351 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_FRONTEND);
4352 return fndecl.function_code;
4353}
4354
4355/* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4356 class FCLASS. */
4357inline void
4359 unsigned int fcode)
4360{
4361 tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4362 fndecl.built_in_class = fclass;
4363 fndecl.function_code = fcode;
4364}
4365
4366/* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4367 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4368inline void
4370{
4371 tree_function_decl &newfndecl = FUNCTION_DECL_CHECK (newdecl)->function_decl;
4372 const tree_function_decl &oldfndecl
4373 = FUNCTION_DECL_CHECK (olddecl)->function_decl;
4374 newfndecl.built_in_class = oldfndecl.built_in_class;
4375 newfndecl.function_code = oldfndecl.function_code;
4376}
4377
4378/* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4379 wrapper added to express a location_t on behalf of the node's child
4380 (e.g. by maybe_wrap_with_location). */
4381
4382#define EXPR_LOCATION_WRAPPER_P(NODE) \
4383 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4384
4385/* Test if EXP is merely a wrapper node, added to express a location_t
4386 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4387
4388inline bool
4390{
4391 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4392 the flag EXPR_LOCATION_WRAPPER_P is set.
4393 It normally has the same type as its operand, but it can have a
4394 different one if the type of the operand has changed (e.g. when
4395 merging duplicate decls).
4396
4397 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4398 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4399 if ((TREE_CODE (exp) == NON_LVALUE_EXPR
4400 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4402 return true;
4403 return false;
4404}
4405
4406/* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4407
4408inline tree
4410{
4411 if (location_wrapper_p (exp))
4412 return TREE_OPERAND (exp, 0);
4413 else
4414 return exp;
4415}
4416
4417#define error_mark_node global_trees[TI_ERROR_MARK]
4418
4419#define intQI_type_node global_trees[TI_INTQI_TYPE]
4420#define intHI_type_node global_trees[TI_INTHI_TYPE]
4421#define intSI_type_node global_trees[TI_INTSI_TYPE]
4422#define intDI_type_node global_trees[TI_INTDI_TYPE]
4423#define intTI_type_node global_trees[TI_INTTI_TYPE]
4424
4425#define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4426#define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4427#define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4428#define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4429#define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4430
4431#define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4432#define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4433#define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4434#define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4435#define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4436
4437#define uint16_type_node global_trees[TI_UINT16_TYPE]
4438#define uint32_type_node global_trees[TI_UINT32_TYPE]
4439#define uint64_type_node global_trees[TI_UINT64_TYPE]
4440#define uint128_type_node global_trees[TI_UINT128_TYPE]
4441
4442#define void_node global_trees[TI_VOID]
4443
4444#define integer_zero_node global_trees[TI_INTEGER_ZERO]
4445#define integer_one_node global_trees[TI_INTEGER_ONE]
4446#define integer_three_node global_trees[TI_INTEGER_THREE]
4447#define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4448#define size_zero_node global_trees[TI_SIZE_ZERO]
4449#define size_one_node global_trees[TI_SIZE_ONE]
4450#define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4451#define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4452#define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4453
4454/* Base access nodes. */
4455#define access_public_node global_trees[TI_PUBLIC]
4456#define access_protected_node global_trees[TI_PROTECTED]
4457#define access_private_node global_trees[TI_PRIVATE]
4458
4459#define null_pointer_node global_trees[TI_NULL_POINTER]
4460
4461#define float_type_node global_trees[TI_FLOAT_TYPE]
4462#define double_type_node global_trees[TI_DOUBLE_TYPE]
4463#define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4464#define bfloat16_type_node global_trees[TI_BFLOAT16_TYPE]
4465
4466/* Nodes for particular _FloatN and _FloatNx types in sequence. */
4467#define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4468#define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4469#define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4470
4471/* Names for individual types (code should normally iterate over all
4472 such types; these are only for back-end use, or in contexts such as
4473 *.def where iteration is not possible). */
4474#define float16_type_node global_trees[TI_FLOAT16_TYPE]
4475#define float32_type_node global_trees[TI_FLOAT32_TYPE]
4476#define float64_type_node global_trees[TI_FLOAT64_TYPE]
4477#define float128_type_node global_trees[TI_FLOAT128_TYPE]
4478#define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4479#define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4480#define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4481
4482/* Type used by certain backends for __float128, which in C++ should be
4483 distinct type from _Float128 for backwards compatibility reasons. */
4484#define float128t_type_node global_trees[TI_FLOAT128T_TYPE]
4485
4486#define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4487#define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4488#define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4489#define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4490
4491#define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4492#define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4493#define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4494#define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4495
4496#define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4497
4498#define void_type_node global_trees[TI_VOID_TYPE]
4499/* The C type `void *'. */
4500#define ptr_type_node global_trees[TI_PTR_TYPE]
4501/* The C type `const void *'. */
4502#define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4503/* The C type `size_t'. */
4504#define size_type_node global_trees[TI_SIZE_TYPE]
4505#define pid_type_node global_trees[TI_PID_TYPE]
4506#define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4507#define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4508#define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4509#define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4510/* The C type `FILE *'. */
4511#define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4512/* The C type `const struct tm *'. */
4513#define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4514/* The C type `fenv_t *'. */
4515#define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4516#define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4517/* The C type `fexcept_t *'. */
4518#define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4519#define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4520#define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4521
4522#define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4523#define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4524#define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4525
4526/* The decimal floating point types. */
4527#define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4528#define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4529#define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4530
4531/* The fixed-point types. */
4532#define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4533#define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4534#define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4535#define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4536#define sat_unsigned_short_fract_type_node \
4537 global_trees[TI_SAT_USFRACT_TYPE]
4538#define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4539#define sat_unsigned_long_fract_type_node \
4540 global_trees[TI_SAT_ULFRACT_TYPE]
4541#define sat_unsigned_long_long_fract_type_node \
4542 global_trees[TI_SAT_ULLFRACT_TYPE]
4543#define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4544#define fract_type_node global_trees[TI_FRACT_TYPE]
4545#define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4546#define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4547#define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4548#define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4549#define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4550#define unsigned_long_long_fract_type_node \
4551 global_trees[TI_ULLFRACT_TYPE]
4552#define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4553#define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4554#define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4555#define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4556#define sat_unsigned_short_accum_type_node \
4557 global_trees[TI_SAT_USACCUM_TYPE]
4558#define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4559#define sat_unsigned_long_accum_type_node \
4560 global_trees[TI_SAT_ULACCUM_TYPE]
4561#define sat_unsigned_long_long_accum_type_node \
4562 global_trees[TI_SAT_ULLACCUM_TYPE]
4563#define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4564#define accum_type_node global_trees[TI_ACCUM_TYPE]
4565#define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4566#define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4567#define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4568#define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4569#define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4570#define unsigned_long_long_accum_type_node \
4571 global_trees[TI_ULLACCUM_TYPE]
4572#define qq_type_node global_trees[TI_QQ_TYPE]
4573#define hq_type_node global_trees[TI_HQ_TYPE]
4574#define sq_type_node global_trees[TI_SQ_TYPE]
4575#define dq_type_node global_trees[TI_DQ_TYPE]
4576#define tq_type_node global_trees[TI_TQ_TYPE]
4577#define uqq_type_node global_trees[TI_UQQ_TYPE]
4578#define uhq_type_node global_trees[TI_UHQ_TYPE]
4579#define usq_type_node global_trees[TI_USQ_TYPE]
4580#define udq_type_node global_trees[TI_UDQ_TYPE]
4581#define utq_type_node global_trees[TI_UTQ_TYPE]
4582#define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4583#define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4584#define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4585#define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4586#define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4587#define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4588#define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4589#define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4590#define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4591#define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4592#define ha_type_node global_trees[TI_HA_TYPE]
4593#define sa_type_node global_trees[TI_SA_TYPE]
4594#define da_type_node global_trees[TI_DA_TYPE]
4595#define ta_type_node global_trees[TI_TA_TYPE]
4596#define uha_type_node global_trees[TI_UHA_TYPE]
4597#define usa_type_node global_trees[TI_USA_TYPE]
4598#define uda_type_node global_trees[TI_UDA_TYPE]
4599#define uta_type_node global_trees[TI_UTA_TYPE]
4600#define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4601#define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4602#define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4603#define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4604#define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4605#define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4606#define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4607#define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4608
4609/* The node that should be placed at the end of a parameter list to
4610 indicate that the function does not take a variable number of
4611 arguments. The TREE_VALUE will be void_type_node and there will be
4612 no TREE_CHAIN. Language-independent code should not assume
4613 anything else about this node. */
4614#define void_list_node global_trees[TI_VOID_LIST_NODE]
4615
4616#define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4617#define MAIN_NAME_P(NODE) \
4618 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4619
4620/* Optimization options (OPTIMIZATION_NODE) to use for default and current
4621 functions. */
4622#define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4623#define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4624
4625/* Default/current target options (TARGET_OPTION_NODE). */
4626#define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4627#define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4628
4629/* Default tree list option(), optimize() pragmas to be linked into the
4630 attribute list. */
4631#define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4632#define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4633
4634/* SCEV analyzer global shared trees. */
4635#define chrec_not_analyzed_yet NULL_TREE
4636#define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4637#define chrec_known global_trees[TI_CHREC_KNOWN]
4638
4639#define char_type_node integer_types[itk_char]
4640#define signed_char_type_node integer_types[itk_signed_char]
4641#define unsigned_char_type_node integer_types[itk_unsigned_char]
4642#define short_integer_type_node integer_types[itk_short]
4643#define short_unsigned_type_node integer_types[itk_unsigned_short]
4644#define integer_type_node integer_types[itk_int]
4645#define unsigned_type_node integer_types[itk_unsigned_int]
4646#define long_integer_type_node integer_types[itk_long]
4647#define long_unsigned_type_node integer_types[itk_unsigned_long]
4648#define long_long_integer_type_node integer_types[itk_long_long]
4649#define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4650
4651/* True if T is an erroneous expression. */
4652
4653inline bool
4655{
4656 return (t == error_mark_node
4657 || (t && TREE_TYPE (t) == error_mark_node));
4658}
4659
4660/* Return the number of elements encoded directly in a VECTOR_CST. */
4661
4662inline unsigned int
4667
4669extern void overwrite_decl_assembler_name (tree decl, tree name);
4672extern const char *decl_section_name (const_tree);
4673extern void set_decl_section_name (tree, const char *);
4675extern enum tls_model decl_tls_model (const_tree);
4676extern void set_decl_tls_model (tree, enum tls_model);
4677
4678/* Compute the number of bytes occupied by 'node'. This routine only
4679 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4680
4681extern size_t tree_size (const_tree);
4682
4683/* Compute the number of bytes occupied by a tree with code CODE.
4684 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4685 which are of variable length. */
4686extern size_t tree_code_size (enum tree_code);
4687
4688/* Allocate and return a new UID from the DECL_UID namespace. */
4689extern int allocate_decl_uid (void);
4690
4691/* Lowest level primitive for allocating a node.
4692 The TREE_CODE is the only argument. Contents are initialized
4693 to zero except for a few of the common fields. */
4694
4696
4697/* Free tree node. */
4698
4699extern void free_node (tree);
4700
4701/* Make a copy of a node, with all the same contents. */
4702
4704
4705/* Make a copy of a chain of TREE_LIST nodes. */
4706
4707extern tree copy_list (tree);
4708
4709/* Make a CASE_LABEL_EXPR. */
4710
4712
4713/* Make a BINFO. */
4715
4716/* Make an INTEGER_CST. */
4717
4719
4720/* Make a TREE_VEC. */
4721
4723
4724/* Grow a TREE_VEC. */
4725
4727
4728/* Treat a TREE_VEC as a range of trees, e.g.
4729 for (tree e : tree_vec_range (v)) { ... } */
4730
4732{
4734public:
4736 tree *begin() { return TREE_VEC_BEGIN (v); }
4737 tree *end() { return TREE_VEC_END (v); }
4738};
4739
4740/* Construct various types of nodes. */
4741
4742extern tree build_nt (enum tree_code, ...);
4744
4753
4754/* _loc versions of build[1-5]. */
4755
4756inline tree
4757build1_loc (location_t loc, enum tree_code code, tree type,
4759{
4760 tree t = build1 (code, type, arg1 PASS_MEM_STAT);
4761 if (CAN_HAVE_LOCATION_P (t))
4762 SET_EXPR_LOCATION (t, loc);
4763 return t;
4764}
4765
4766inline tree
4767build2_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4769{
4770 tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT);
4771 if (CAN_HAVE_LOCATION_P (t))
4772 SET_EXPR_LOCATION (t, loc);
4773 return t;
4774}
4775
4776inline tree
4777build3_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4778 tree arg1, tree arg2 CXX_MEM_STAT_INFO)
4779{
4780 tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4781 if (CAN_HAVE_LOCATION_P (t))
4782 SET_EXPR_LOCATION (t, loc);
4783 return t;
4784}
4785
4786inline tree
4787build4_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4788 tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO)
4789{
4790 tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4791 if (CAN_HAVE_LOCATION_P (t))
4792 SET_EXPR_LOCATION (t, loc);
4793 return t;
4794}
4795
4796inline tree
4797build5_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4798 tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO)
4799{
4800 tree t = build5 (code, type, arg0, arg1, arg2, arg3,
4801 arg4 PASS_MEM_STAT);
4802 if (CAN_HAVE_LOCATION_P (t))
4803 SET_EXPR_LOCATION (t, loc);
4804 return t;
4805}
4806
4807/* Constructs double_int from tree CST. */
4808
4810
4811extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst);
4812extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool);
4813
4814/* Create an INT_CST node with a CST value zero extended. */
4815
4816/* static inline */
4820extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO);
4826extern tree build_vector_a_then_b (tree, unsigned int, tree, tree);
4827extern void recompute_constructor_flags (tree);
4828extern void verify_constructor_flags (tree);
4833extern tree build_constructor_va (tree, int, ...);
4837extern tree build_complex (tree, tree, tree);
4838extern tree build_complex_inf (tree, bool);
4840extern tree build_one_cst (tree);
4843extern tree build_zero_cst (tree);
4844extern tree build_replicated_int_cst (tree, unsigned, HOST_WIDE_INT);
4845extern tree sign_mask_for (tree);
4846extern tree build_string (unsigned, const char * = NULL);
4850extern tree build_decl (location_t, enum tree_code,
4853extern tree build_fn_decl (const char *, tree);
4855extern tree build_block (tree, tree, tree, tree);
4856extern tree build_empty_stmt (location_t);
4857extern tree build_omp_clause (location_t, enum omp_clause_code);
4858
4860
4861extern tree build_call_nary (tree, tree, int, ...);
4862extern tree build_call_valist (tree, tree, int, va_list);
4863#define build_call_array(T1,T2,N,T3)\
4864 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4865extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4866extern tree build_call_vec (tree, tree, const vec<tree, va_gc> *);
4867extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
4868extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
4869extern tree build_call_expr_loc (location_t, tree, int, ...);
4870extern tree build_call_expr (tree, int, ...);
4871extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
4872 tree, int, ...);
4874 tree, int, const tree *);
4875extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
4876 int, ...);
4877extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT);
4878extern tree build_string_literal (unsigned, const char * = NULL,
4880 unsigned HOST_WIDE_INT = HOST_WIDE_INT_M1U);
4881inline tree build_string_literal (const char *p)
4882{ return build_string_literal (strlen (p) + 1, p); }
4884{
4886 IDENTIFIER_POINTER (t));
4887}
4888
4889/* Construct various nodes representing data types. */
4890
4892extern tree signed_type_for (tree);
4893extern tree unsigned_type_for (tree);
4894extern bool is_truth_type_for (tree, tree);
4896extern tree truth_type_for (tree);
4897extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
4899extern tree build_reference_type_for_mode (tree, machine_mode, bool);
4901extern tree build_vector_type_for_mode (tree, machine_mode);
4905extern tree build_index_type (tree);
4906extern tree build_array_type_1 (tree, tree, bool, bool, bool);
4907extern tree build_array_type (tree, tree, bool = false);
4910extern tree build_function_type (tree, tree, bool = false);
4911extern tree build_function_type_list (tree, ...);
4913extern tree build_function_type_array (tree, int, tree *);
4915#define build_function_type_vec(RET, V) \
4916 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4917#define build_varargs_function_type_vec(RET, V) \
4918 build_varargs_function_type_array (RET, vec_safe_length (V), \
4919 vec_safe_address (V))
4923extern tree build_complex_type (tree, bool named = false);
4925
4926extern tree value_member (tree, tree);
4928extern bool vec_member (const_tree, vec<tree, va_gc> *);
4929extern tree chain_index (int, tree);
4930
4931/* Arguments may be null. */
4933
4934/* The following predicates are safe to call with a null argument. */
4935extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE;
4936extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE;
4937extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE;
4938extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE;
4939
4940extern HOST_WIDE_INT tree_to_shwi (const_tree)
4941 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4943 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4944extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree)
4945 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4947 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4948#if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4949extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4951{
4953 return TREE_INT_CST_LOW (t);
4954}
4955
4956extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
4958{
4960 return TREE_INT_CST_LOW (t);
4961}
4962#if NUM_POLY_INT_COEFFS == 1
4963extern inline __attribute__ ((__gnu_inline__)) poly_int64
4965{
4967 return TREE_INT_CST_LOW (t);
4968}
4969
4970extern inline __attribute__ ((__gnu_inline__)) poly_uint64
4972{
4974 return TREE_INT_CST_LOW (t);
4975}
4976#endif
4977#endif
4978extern int tree_int_cst_sgn (const_tree);
4980extern unsigned int tree_int_cst_min_precision (tree, signop);
4982
4983/* Recursively examines the array elements of TYPE, until a non-array
4984 element type is found. */
4985
4986inline tree
4988{
4989 while (TREE_CODE (type) == ARRAY_TYPE)
4990 type = TREE_TYPE (type);
4991
4992 return type;
4993}
4994
4995/* Desription of the reason why the argument of valid_constant_size_p
4996 is not a valid size. */
5004
5006extern tree max_object_size ();
5007
5008/* Return true if T holds a value that can be represented as a poly_int64
5009 without loss of precision. Store the value in *VALUE if so. */
5010
5011inline bool
5013{
5014 if (tree_fits_poly_int64_p (t))
5015 {
5016 *value = tree_to_poly_int64 (t);
5017 return true;
5018 }
5019 return false;
5020}
5021
5022/* Return true if T holds a value that can be represented as a poly_uint64
5023 without loss of precision. Store the value in *VALUE if so. */
5024
5025inline bool
5027{
5029 {
5030 *value = tree_to_poly_uint64 (t);
5031 return true;
5032 }
5033 return false;
5034}
5035
5036/* From expmed.cc. Since rtl.h is included after tree.h, we can't
5037 put the prototype here. Rtl.h does declare the prototype if
5038 tree.h had been included. */
5039
5040extern tree