1/* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2025 Free Software Foundation, Inc.
3
4This file is part of GCC.
5
6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
9version.
10
11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14for more details.
15
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3. If not see
18<http://www.gnu.org/licenses/>. */
19
20#ifndef GCC_TREE_H
21#define GCC_TREE_H
22
23#include "tree-core.h"
24#include "options.h"
25
26/* Convert a target-independent built-in function code to a combined_fn. */
27
28inline combined_fn
29as_combined_fn (built_in_function fn)
30{
31 return combined_fn (int (fn));
32}
33
34/* Convert an internal function code to a combined_fn. */
35
36inline combined_fn
37as_combined_fn (internal_fn fn)
38{
39 return combined_fn (int (fn) + int (END_BUILTINS));
40}
41
42/* Return true if CODE is a target-independent built-in function. */
43
44inline bool
45builtin_fn_p (combined_fn code)
46{
47 return int (code) < int (END_BUILTINS);
48}
49
50/* Return the target-independent built-in function represented by CODE.
51 Only valid if builtin_fn_p (CODE). */
52
53inline built_in_function
54as_builtin_fn (combined_fn code)
55{
56 gcc_checking_assert (builtin_fn_p (code));
57 return built_in_function (int (code));
58}
59
60/* Return true if CODE is an internal function. */
61
62inline bool
63internal_fn_p (combined_fn code)
64{
65 return int (code) >= int (END_BUILTINS);
66}
67
68/* Return the internal function represented by CODE. Only valid if
69 internal_fn_p (CODE). */
70
71inline internal_fn
72as_internal_fn (combined_fn code)
73{
74 gcc_checking_assert (internal_fn_p (code));
75 return internal_fn (int (code) - int (END_BUILTINS));
76}
77
78/* Helper to transparently allow tree codes and builtin function codes
79 exist in one storage entity. */
80class code_helper
81{
82public:
83 code_helper () {}
84 code_helper (tree_code code) : rep ((int) code) {}
85 code_helper (combined_fn fn) : rep (-(int) fn) {}
86 code_helper (internal_fn fn) : rep (-(int) as_combined_fn (fn)) {}
87 explicit operator tree_code () const { return (tree_code) rep; }
88 explicit operator combined_fn () const { return (combined_fn) -rep; }
89 explicit operator internal_fn () const;
90 explicit operator built_in_function () const;
91 bool is_tree_code () const { return rep > 0; }
92 bool is_fn_code () const { return rep < 0; }
93 bool is_internal_fn () const;
94 bool is_builtin_fn () const;
95 int get_rep () const { return rep; }
96 tree_code safe_as_tree_code () const;
97 combined_fn safe_as_fn_code () const;
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
112code_helper::safe_as_tree_code () const
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
122code_helper::safe_as_fn_code () const {
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 (code: combined_fn (*this));
129}
130
131inline code_helper::operator built_in_function () const
132{
133 return as_builtin_fn (code: combined_fn (*this));
134}
135
136inline bool
137code_helper::is_internal_fn () const
138{
139 return is_fn_code () && internal_fn_p (code: combined_fn (*this));
140}
141
142inline bool
143code_helper::is_builtin_fn () const
144{
145 return is_fn_code () && builtin_fn_p (code: combined_fn (*this));
146}
147
148/* Macros for initializing `tree_contains_struct'. */
149#define MARK_TS_BASE(C) \
150 (tree_contains_struct[C][TS_BASE] = true)
151
152#define MARK_TS_TYPED(C) \
153 (MARK_TS_BASE (C), \
154 tree_contains_struct[C][TS_TYPED] = true)
155
156#define MARK_TS_COMMON(C) \
157 (MARK_TS_TYPED (C), \
158 tree_contains_struct[C][TS_COMMON] = true)
159
160#define MARK_TS_TYPE_COMMON(C) \
161 (MARK_TS_COMMON (C), \
162 tree_contains_struct[C][TS_TYPE_COMMON] = true)
163
164#define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
165 (MARK_TS_TYPE_COMMON (C), \
166 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
167
168#define MARK_TS_TYPE_NON_COMMON(C) \
169 (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \
170 tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \
171
172#define MARK_TS_DECL_MINIMAL(C) \
173 (MARK_TS_COMMON (C), \
174 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
175
176#define MARK_TS_DECL_COMMON(C) \
177 (MARK_TS_DECL_MINIMAL (C), \
178 tree_contains_struct[C][TS_DECL_COMMON] = true)
179
180#define MARK_TS_DECL_WRTL(C) \
181 (MARK_TS_DECL_COMMON (C), \
182 tree_contains_struct[C][TS_DECL_WRTL] = true)
183
184#define MARK_TS_DECL_WITH_VIS(C) \
185 (MARK_TS_DECL_WRTL (C), \
186 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
187
188#define MARK_TS_DECL_NON_COMMON(C) \
189 (MARK_TS_DECL_WITH_VIS (C), \
190 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
191
192#define MARK_TS_EXP(C) \
193 (MARK_TS_TYPED (C), \
194 tree_contains_struct[C][TS_EXP] = true)
195
196/* Returns the string representing CLASS. */
197
198#define TREE_CODE_CLASS_STRING(CLASS)\
199 tree_code_class_strings[(int) (CLASS)]
200
201#if __cpp_inline_variables < 201606L
202#define TREE_CODE_CLASS(CODE) \
203 tree_code_type_tmpl <0>::tree_code_type[(int) (CODE)]
204#else
205#define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
206#endif
207
208/* Nonzero if NODE represents an exceptional code. */
209
210#define EXCEPTIONAL_CLASS_P(NODE)\
211 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
212
213/* Nonzero if NODE represents a constant. */
214
215#define CONSTANT_CLASS_P(NODE)\
216 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
217
218/* Nonzero if NODE represents a constant, or is a location wrapper
219 around such a node. */
220
221#define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
222 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
223
224/* Nonzero if NODE represents a type. */
225
226#define TYPE_P(NODE)\
227 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
228
229/* Nonzero if NODE represents a declaration. */
230
231#define DECL_P(NODE)\
232 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
233
234/* True if NODE designates a variable declaration. */
235#define VAR_P(NODE) \
236 (TREE_CODE (NODE) == VAR_DECL)
237
238/* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
239
240#define VAR_OR_FUNCTION_DECL_P(DECL)\
241 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
242
243/* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
244 ascending code order. */
245
246#define INDIRECT_REF_P(NODE)\
247 (TREE_CODE (NODE) == INDIRECT_REF)
248
249/* Nonzero if NODE represents a reference. */
250
251#define REFERENCE_CLASS_P(NODE)\
252 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
253
254/* Nonzero if NODE represents a comparison. */
255
256#define COMPARISON_CLASS_P(NODE)\
257 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
258
259/* Nonzero if NODE represents a unary arithmetic expression. */
260
261#define UNARY_CLASS_P(NODE)\
262 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
263
264/* Nonzero if NODE represents a binary arithmetic expression. */
265
266#define BINARY_CLASS_P(NODE)\
267 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
268
269/* Nonzero if NODE represents a statement expression. */
270
271#define STATEMENT_CLASS_P(NODE)\
272 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
273
274/* Nonzero if NODE represents a function call-like expression with a
275 variable-length operand vector. */
276
277#define VL_EXP_CLASS_P(NODE)\
278 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
279
280/* Nonzero if NODE represents any other expression. */
281
282#define EXPRESSION_CLASS_P(NODE)\
283 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
284
285/* Returns nonzero iff NODE represents a type or declaration. */
286
287#define IS_TYPE_OR_DECL_P(NODE)\
288 (TYPE_P (NODE) || DECL_P (NODE))
289
290/* Returns nonzero iff CLASS is the tree-code class of an
291 expression. */
292
293#define IS_EXPR_CODE_CLASS(CLASS)\
294 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
295
296/* Returns nonzero iff NODE is an expression of some kind. */
297
298#define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
299
300#if __cpp_inline_variables < 201606L
301#define TREE_CODE_LENGTH(CODE) \
302 tree_code_length_tmpl <0>::tree_code_length[(int) (CODE)]
303#else
304#define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
305#endif
306
307
308/* Helper macros for math builtins. */
309
310#define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
311#define CASE_FLT_FN_FLOATN_NX(FN) \
312 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
313 case FN##F32X: case FN##F64X: case FN##F128X
314#define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
315#define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
316
317#define NULL_TREE (tree) NULL
318
319/* Define accessors for the fields that all tree nodes have
320 (though some fields are not used for all kinds of nodes). */
321
322/* The tree-code says what kind of node it is.
323 Codes are defined in tree.def. */
324#define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
325#define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
326
327/* When checking is enabled, errors will be generated if a tree node
328 is accessed incorrectly. The macros die with a fatal error. */
329#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
330
331#define TREE_CHECK(T, CODE) \
332(tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
333
334#define TREE_NOT_CHECK(T, CODE) \
335(tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
336
337#define TREE_CHECK2(T, CODE1, CODE2) \
338(tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
339
340#define TREE_NOT_CHECK2(T, CODE1, CODE2) \
341(tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
342
343#define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
344(tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
345
346#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
347(tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
348 (CODE1), (CODE2), (CODE3)))
349
350#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
351(tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
352 (CODE1), (CODE2), (CODE3), (CODE4)))
353
354#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
355(tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
356 (CODE1), (CODE2), (CODE3), (CODE4)))
357
358#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
359(tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
360 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
361
362#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
363(tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
364 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
365
366#define TREE_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) \
367(tree_check6 ((T), __FILE__, __LINE__, __FUNCTION__, \
368 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), (CODE6)))
369
370#define TREE_NOT_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) \
371(tree_not_check6 ((T), __FILE__, __LINE__, __FUNCTION__, \
372 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), (CODE6)))
373
374#define CONTAINS_STRUCT_CHECK(T, STRUCT) \
375(contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
376
377#define TREE_CLASS_CHECK(T, CLASS) \
378(tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
379
380#define TREE_RANGE_CHECK(T, CODE1, CODE2) \
381(tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
382
383#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
384(omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
385
386#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
387(omp_clause_range_check ((T), (CODE1), (CODE2), \
388 __FILE__, __LINE__, __FUNCTION__))
389
390/* These checks have to be special cased. */
391#define EXPR_CHECK(T) \
392(expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
393
394/* These checks have to be special cased. */
395#define NON_TYPE_CHECK(T) \
396(non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
397
398/* These checks have to be special cased. */
399#define ANY_INTEGRAL_TYPE_CHECK(T) \
400(any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
401
402#define TREE_INT_CST_ELT_CHECK(T, I) \
403(*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
404
405#define TREE_VEC_ELT_CHECK(T, I) \
406(*(CONST_CAST2 (tree *, typeof (T)*, \
407 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
408
409#define OMP_CLAUSE_ELT_CHECK(T, I) \
410(*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
411
412/* Special checks for TREE_OPERANDs. */
413#define TREE_OPERAND_CHECK(T, I) \
414(*(CONST_CAST2 (tree*, typeof (T)*, \
415 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
416
417#define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
418(*(tree_operand_check_code ((T), (CODE), (I), \
419 __FILE__, __LINE__, __FUNCTION__)))
420
421/* Nodes are chained together for many purposes.
422 Types are chained together to record them for being output to the debugger
423 (see the function `chain_type').
424 Decls in the same scope are chained together to record the contents
425 of the scope.
426 Statement nodes for successive statements used to be chained together.
427 Often lists of things are represented by TREE_LIST nodes that
428 are chained together. */
429
430#define TREE_CHAIN(NODE) \
431(CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
432
433/* In all nodes that are expressions, this is the data type of the expression.
434 In POINTER_TYPE nodes, this is the type that the pointer points to.
435 In ARRAY_TYPE nodes, this is the type of the elements.
436 In VECTOR_TYPE nodes, this is the type of the elements. */
437#define TREE_TYPE(NODE) \
438(CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
439
440extern void tree_contains_struct_check_failed (const_tree,
441 const enum tree_node_structure_enum,
442 const char *, int, const char *)
443 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
444
445extern void tree_check_failed (const_tree, const char *, int, const char *,
446 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
447extern void tree_not_check_failed (const_tree, const char *, int, const char *,
448 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
449extern void tree_class_check_failed (const_tree, const enum tree_code_class,
450 const char *, int, const char *)
451 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
452extern void tree_range_check_failed (const_tree, const char *, int,
453 const char *, enum tree_code,
454 enum tree_code)
455 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
456extern void tree_not_class_check_failed (const_tree,
457 const enum tree_code_class,
458 const char *, int, const char *)
459 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
460extern void tree_int_cst_elt_check_failed (int, int, const char *,
461 int, const char *)
462 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
463extern void tree_vec_elt_check_failed (int, int, const char *,
464 int, const char *)
465 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
466extern void phi_node_elt_check_failed (int, int, const char *,
467 int, const char *)
468 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
469extern void tree_operand_check_failed (int, const_tree,
470 const char *, int, const char *)
471 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
472extern void omp_clause_check_failed (const_tree, const char *, int,
473 const char *, enum omp_clause_code)
474 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
475extern void omp_clause_operand_check_failed (int, const_tree, const char *,
476 int, const char *)
477 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
478extern void omp_clause_range_check_failed (const_tree, const char *, int,
479 const char *, enum omp_clause_code,
480 enum omp_clause_code)
481 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
482
483#else /* not ENABLE_TREE_CHECKING, or not gcc */
484
485#define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
486#define TREE_CHECK(T, CODE) (T)
487#define TREE_NOT_CHECK(T, CODE) (T)
488#define TREE_CHECK2(T, CODE1, CODE2) (T)
489#define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
490#define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
491#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
492#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
493#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
494#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
495#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
496#define TREE_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) (T)
497#define TREE_NOT_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) (T)
498#define TREE_CLASS_CHECK(T, CODE) (T)
499#define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
500#define EXPR_CHECK(T) (T)
501#define NON_TYPE_CHECK(T) (T)
502#define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
503#define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
504#define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
505#define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
506#define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
507#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
508#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
509#define ANY_INTEGRAL_TYPE_CHECK(T) (T)
510
511#define TREE_CHAIN(NODE) ((NODE)->common.chain)
512#define TREE_TYPE(NODE) ((NODE)->typed.type)
513
514#endif
515
516#define TREE_BLOCK(NODE) (tree_block (NODE))
517#define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
518
519#include "tree-check.h"
520
521#define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
522#define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
523#define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
524#define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
525#define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
526#define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
527#define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
528#define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
529#define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
530#define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
531#define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
532
533#define RECORD_OR_UNION_CHECK(T) \
534 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
535#define NOT_RECORD_OR_UNION_CHECK(T) \
536 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
537#define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
538 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
539
540#define NUMERICAL_TYPE_CHECK(T) \
541 TREE_CHECK6 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
542 FIXED_POINT_TYPE, BITINT_TYPE)
543
544/* Here is how primitive or already-canonicalized types' hash codes
545 are made. */
546#define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
547
548/* A simple hash function for an arbitrary tree node. This must not be
549 used in hash tables which are saved to a PCH. */
550#define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
551
552/* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
553#define CONVERT_EXPR_CODE_P(CODE) \
554 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
555
556/* Similarly, but accept an expression instead of a tree code. */
557#define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
558
559/* Generate case for NOP_EXPR, CONVERT_EXPR. */
560
561#define CASE_CONVERT \
562 case NOP_EXPR: \
563 case CONVERT_EXPR
564
565/* Given an expression as a tree, strip any conversion that generates
566 no instruction. Accepts both tree and const_tree arguments since
567 we are not modifying the tree itself. */
568
569#define STRIP_NOPS(EXP) \
570 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
571
572/* Like STRIP_NOPS, but don't let the signedness change either. */
573
574#define STRIP_SIGN_NOPS(EXP) \
575 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
576
577/* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
578
579#define STRIP_TYPE_NOPS(EXP) \
580 while ((CONVERT_EXPR_P (EXP) \
581 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
582 && TREE_OPERAND (EXP, 0) != error_mark_node \
583 && (TREE_TYPE (EXP) \
584 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
585 (EXP) = TREE_OPERAND (EXP, 0)
586
587/* Remove unnecessary type conversions according to
588 tree_ssa_useless_type_conversion. */
589
590#define STRIP_USELESS_TYPE_CONVERSION(EXP) \
591 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
592
593/* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
594 in use to provide a location_t. */
595
596#define STRIP_ANY_LOCATION_WRAPPER(EXP) \
597 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
598
599/* Nonzero if TYPE represents a vector type. */
600
601#define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
602
603/* Nonzero if TYPE represents a vector of booleans. */
604
605#define VECTOR_BOOLEAN_TYPE_P(TYPE) \
606 (TREE_CODE (TYPE) == VECTOR_TYPE \
607 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
608
609/* Nonzero if TYPE represents an integral type. Note that we do not
610 include COMPLEX types here. Keep these checks in ascending code
611 order. */
612
613#define INTEGRAL_TYPE_P(TYPE) \
614 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
615 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
616 || TREE_CODE (TYPE) == INTEGER_TYPE \
617 || TREE_CODE (TYPE) == BITINT_TYPE)
618
619/* Nonzero if TYPE represents an integral type, including complex
620 and vector integer types. */
621
622#define ANY_INTEGRAL_TYPE_P(TYPE) \
623 (INTEGRAL_TYPE_P (TYPE) \
624 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
625 || VECTOR_TYPE_P (TYPE)) \
626 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
627
628/* Nonzero if TYPE is bit-precise integer type. */
629
630#define BITINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == BITINT_TYPE)
631
632/* Nonzero if TYPE represents a non-saturating fixed-point type. */
633
634#define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
635 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
636
637/* Nonzero if TYPE represents a saturating fixed-point type. */
638
639#define SAT_FIXED_POINT_TYPE_P(TYPE) \
640 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
641
642/* Nonzero if TYPE represents a fixed-point type. */
643
644#define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
645
646/* Nonzero if TYPE represents a scalar floating-point type. */
647
648#define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
649
650/* Nonzero if TYPE represents a complex floating-point type. */
651
652#define COMPLEX_FLOAT_TYPE_P(TYPE) \
653 (TREE_CODE (TYPE) == COMPLEX_TYPE \
654 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
655
656/* Nonzero if TYPE represents a vector integer type. */
657
658#define VECTOR_INTEGER_TYPE_P(TYPE) \
659 (VECTOR_TYPE_P (TYPE) \
660 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
661
662
663/* Nonzero if TYPE represents a vector floating-point type. */
664
665#define VECTOR_FLOAT_TYPE_P(TYPE) \
666 (VECTOR_TYPE_P (TYPE) \
667 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
668
669/* Nonzero if TYPE represents a floating-point type, including complex
670 and vector floating-point types. The vector and complex check does
671 not use the previous two macros to enable early folding. */
672
673#define FLOAT_TYPE_P(TYPE) \
674 (SCALAR_FLOAT_TYPE_P (TYPE) \
675 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
676 || VECTOR_TYPE_P (TYPE)) \
677 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
678
679/* Nonzero if TYPE represents a decimal floating-point type. */
680#define DECIMAL_FLOAT_TYPE_P(TYPE) \
681 (SCALAR_FLOAT_TYPE_P (TYPE) \
682 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
683
684/* Nonzero if TYPE is a record or union type. */
685#define RECORD_OR_UNION_TYPE_P(TYPE) \
686 (TREE_CODE (TYPE) == RECORD_TYPE \
687 || TREE_CODE (TYPE) == UNION_TYPE \
688 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
689
690/* Nonzero if TYPE represents an aggregate (multi-component) type.
691 Keep these checks in ascending code order. */
692
693#define AGGREGATE_TYPE_P(TYPE) \
694 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
695
696/* Nonzero if TYPE represents a pointer or reference type.
697 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
698 ascending code order. */
699
700#define POINTER_TYPE_P(TYPE) \
701 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
702
703/* Nonzero if TYPE represents a pointer to function. */
704#define FUNCTION_POINTER_TYPE_P(TYPE) \
705 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
706
707/* Nonzero if this type is a complete type. */
708#define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
709
710/* Nonzero if this type is the (possibly qualified) void type. */
711#define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
712
713/* Nonzero if this type is complete or is cv void. */
714#define COMPLETE_OR_VOID_TYPE_P(NODE) \
715 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
716
717/* Nonzero if this type is complete or is an array with unspecified bound. */
718#define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
719 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
720
721#define FUNC_OR_METHOD_TYPE_P(NODE) \
722 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
723
724#define OPAQUE_TYPE_P(NODE) \
725 (TREE_CODE (NODE) == OPAQUE_TYPE)
726
727/* Define many boolean fields that all tree nodes have. */
728
729/* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
730 of this is needed. So it cannot be in a register.
731 In a FUNCTION_DECL it has no meaning.
732 In LABEL_DECL nodes, it means a goto for this label has been seen
733 from a place outside all binding contours that restore stack levels.
734 In an artificial SSA_NAME that points to a stack partition with at least
735 two variables, it means that at least one variable has TREE_ADDRESSABLE.
736 In ..._TYPE nodes, it means that objects of this type must be fully
737 addressable. This means that pieces of this object cannot go into
738 register parameters, for example. If this a function type, this
739 means that the value must be returned in memory.
740 In CONSTRUCTOR nodes, it means object constructed must be in memory.
741 In IDENTIFIER_NODEs, this means that some extern decl for this name
742 had its address taken. That matters for inline functions.
743 In a STMT_EXPR, it means we want the result of the enclosed expression. */
744#define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
745
746/* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
747 exit of a function. Calls for which this is true are candidates for tail
748 call optimizations. */
749#define CALL_EXPR_TAILCALL(NODE) \
750 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
751
752/* Set on a CALL_EXPR if the call has been marked as requiring tail call
753 optimization for correctness. */
754#define CALL_EXPR_MUST_TAIL_CALL(NODE) \
755 (CALL_EXPR_CHECK (NODE)->base.static_flag)
756
757/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
758 CASE_LOW operand has been processed. */
759#define CASE_LOW_SEEN(NODE) \
760 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
761
762#define PREDICT_EXPR_OUTCOME(NODE) \
763 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
764#define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
765 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
766#define PREDICT_EXPR_PREDICTOR(NODE) \
767 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
768
769/* In a VAR_DECL, nonzero means allocate static storage.
770 In a FUNCTION_DECL, nonzero if function has been defined.
771 In a CONSTRUCTOR, nonzero means allocate static storage. */
772#define TREE_STATIC(NODE) ((NODE)->base.static_flag)
773
774/* In an ADDR_EXPR, nonzero means do not use a trampoline. */
775#define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
776
777/* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
778 should only be executed if an exception is thrown, not on normal exit
779 of its scope. */
780#define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
781
782/* In a TRY_CATCH_EXPR, means that the handler should be considered a
783 separate cleanup in honor_protect_cleanup_actions. */
784#define TRY_CATCH_IS_CLEANUP(NODE) \
785 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
786
787/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
788 CASE_HIGH operand has been processed. */
789#define CASE_HIGH_SEEN(NODE) \
790 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
791
792/* Used to mark scoped enums. */
793#define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
794
795/* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
796#define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
797
798/* In an expr node (usually a conversion) this means the node was made
799 implicitly and should not lead to any sort of warning. In a decl node,
800 warnings concerning the decl should be suppressed. This is used at
801 least for used-before-set warnings, and it set after one warning is
802 emitted. */
803#define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
804
805/* Nonzero if we should warn about the change in empty class parameter
806 passing ABI in this TU. */
807#define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
808 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
809
810/* Nonzero if this type is "empty" according to the particular psABI. */
811#define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
812
813/* Used to indicate that this TYPE represents a compiler-generated entity. */
814#define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
815
816/* True if the type is indivisible at the source level, i.e. if its
817 component parts cannot be accessed directly. This is used to suppress
818 normal GNU extensions for target-specific vector types. */
819#define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
820
821/* True if this is a stdarg function with no named arguments (C23
822 (...) prototype, where arguments can be accessed with va_start and
823 va_arg), as opposed to an unprototyped function. */
824#define TYPE_NO_NAMED_ARGS_STDARG_P(NODE) \
825 (FUNC_OR_METHOD_CHECK (NODE)->type_common.no_named_args_stdarg_p)
826
827/* True if this RECORD_TYPE or UNION_TYPE includes a flexible array member
828 as the last field recursively. */
829#define TYPE_INCLUDES_FLEXARRAY(NODE) \
830 (RECORD_OR_UNION_CHECK (NODE)->type_common.no_named_args_stdarg_p)
831
832/* In an IDENTIFIER_NODE, this means that assemble_name was called with
833 this string as an argument. */
834#define TREE_SYMBOL_REFERENCED(NODE) \
835 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
836
837/* Nonzero in a pointer or reference type means the data pointed to
838 by this type can alias anything. */
839#define TYPE_REF_CAN_ALIAS_ALL(NODE) \
840 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
841
842/* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means
843 there was an overflow in folding. */
844
845#define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
846
847/* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
848
849#define TREE_OVERFLOW_P(EXPR) \
850 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
851
852/* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
853 nonzero means name is to be accessible from outside this translation unit.
854 In an IDENTIFIER_NODE, nonzero means an external declaration
855 accessible from outside this translation unit was previously seen
856 for this name in an inner scope. */
857#define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
858
859/* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
860 of cached values, or is something else. */
861#define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
862
863/* In a SAVE_EXPR, indicates that the original expression has already
864 been substituted with a VAR_DECL that contains the value. */
865#define SAVE_EXPR_RESOLVED_P(NODE) \
866 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
867
868/* Set on a CALL_EXPR if this stdarg call should be passed the argument
869 pack. */
870#define CALL_EXPR_VA_ARG_PACK(NODE) \
871 (CALL_EXPR_CHECK (NODE)->base.public_flag)
872
873/* In any expression, decl, or constant, nonzero means it has side effects or
874 reevaluation of the whole expression could produce a different value.
875 This is set if any subexpression is a function call, a side effect or a
876 reference to a volatile variable. In a ..._DECL, this is set only if the
877 declaration said `volatile'. This will never be set for a constant. */
878#define TREE_SIDE_EFFECTS(NODE) \
879 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
880
881/* In a LABEL_DECL, nonzero means this label had its address taken
882 and therefore can never be deleted and is a jump target for
883 computed gotos. */
884#define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
885
886/* Whether a case or a user-defined label is allowed to fall through to.
887 This is used to implement -Wimplicit-fallthrough. */
888#define FALLTHROUGH_LABEL_P(NODE) \
889 (LABEL_DECL_CHECK (NODE)->base.private_flag)
890
891/* Set on the artificial label created for break; stmt from a switch.
892 This is used to implement -Wimplicit-fallthrough. */
893#define SWITCH_BREAK_LABEL_P(NODE) \
894 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
895
896/* Set on label that is known not to be jumped to, it can be only
897 reached by falling through from previous statements.
898 This is used to implement -Wimplicit-fallthrough. */
899#define UNUSED_LABEL_P(NODE) \
900 (LABEL_DECL_CHECK (NODE)->base.default_def_flag)
901
902/* Nonzero means this expression is volatile in the C sense:
903 its address should be of type `volatile WHATEVER *'.
904 In other words, the declared item is volatile qualified.
905 This is used in _DECL nodes and _REF nodes.
906 On a FUNCTION_DECL node, this means the function does not
907 return normally. This is the same effect as setting
908 the attribute noreturn on the function in C.
909
910 In a ..._TYPE node, means this type is volatile-qualified.
911 But use TYPE_VOLATILE instead of this macro when the node is a type,
912 because eventually we may make that a different bit.
913
914 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
915#define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
916
917/* Nonzero means this node will not trap. In an INDIRECT_REF, means
918 accessing the memory pointed to won't generate a trap. However,
919 this only applies to an object when used appropriately: it doesn't
920 mean that writing a READONLY mem won't trap.
921
922 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
923 (or slice of the array) always belongs to the range of the array.
924 I.e. that the access will not trap, provided that the access to
925 the base to the array will not trap. */
926#define TREE_THIS_NOTRAP(NODE) \
927 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
928 ARRAY_RANGE_REF)->base.nothrow_flag)
929
930/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
931 nonzero means it may not be the lhs of an assignment.
932 Nonzero in a FUNCTION_DECL means this function should be treated
933 as "const" function (can only read its arguments). */
934#define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
935
936/* Value of expression is constant. Always on in all ..._CST nodes. May
937 also appear in an expression or decl where the value is constant. */
938#define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
939
940/* Nonzero if NODE, a type, has had its sizes gimplified. */
941#define TYPE_SIZES_GIMPLIFIED(NODE) \
942 (TYPE_CHECK (NODE)->base.constant_flag)
943
944/* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
945#define DECL_UNSIGNED(NODE) \
946 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
947
948/* In integral and pointer types, means an unsigned type. */
949#define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
950
951/* Same as TYPE_UNSIGNED but converted to SIGNOP. */
952#define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
953
954/* True if overflow wraps around for the given integral or pointer type. That
955 is, TYPE_MAX + 1 == TYPE_MIN. */
956#define TYPE_OVERFLOW_WRAPS(TYPE) \
957 (POINTER_TYPE_P (TYPE) \
958 ? flag_wrapv_pointer \
959 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
960 || flag_wrapv))
961
962/* True if overflow is undefined for the given integral or pointer type.
963 We may optimize on the assumption that values in the type never overflow.
964
965 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
966 must issue a warning based on warn_strict_overflow. In some cases
967 it will be appropriate to issue the warning immediately, and in
968 other cases it will be appropriate to simply set a flag and let the
969 caller decide whether a warning is appropriate or not. */
970#define TYPE_OVERFLOW_UNDEFINED(TYPE) \
971 (POINTER_TYPE_P (TYPE) \
972 ? !flag_wrapv_pointer \
973 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
974 && !flag_wrapv && !flag_trapv))
975
976/* True if overflow for the given integral type should issue a
977 trap. */
978#define TYPE_OVERFLOW_TRAPS(TYPE) \
979 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
980
981/* True if an overflow is to be preserved for sanitization. */
982#define TYPE_OVERFLOW_SANITIZED(TYPE) \
983 (INTEGRAL_TYPE_P (TYPE) \
984 && !TYPE_OVERFLOW_WRAPS (TYPE) \
985 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
986
987/* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
988 Nonzero in a FUNCTION_DECL means that the function has been compiled.
989 This is interesting in an inline function, since it might not need
990 to be compiled separately.
991 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
992 or TYPE_DECL if the debugging info for the type has been written.
993 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
994 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
995 PHI node. */
996#define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
997
998/* Nonzero in a _DECL if the name is used in its scope.
999 Nonzero in an expr node means inhibit warning if value is unused.
1000 In IDENTIFIER_NODEs, this means that some extern decl for this name
1001 was used.
1002 In a BLOCK, this means that the block contains variables that are used. */
1003#define TREE_USED(NODE) ((NODE)->base.used_flag)
1004
1005/* In a FUNCTION_DECL, nonzero means a call to the function cannot
1006 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1007 throw. We can't easily check the node type here as the C++
1008 frontend also uses this flag (for AGGR_INIT_EXPR). */
1009#define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1010
1011/* In a CALL_EXPR, means that it's safe to use the target of the call
1012 expansion as the return slot for a call that returns in memory. */
1013#define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1014 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1015
1016/* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1017 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1018 type). */
1019#define DECL_BY_REFERENCE(NODE) \
1020 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1021 RESULT_DECL)->decl_common.decl_by_reference_flag)
1022
1023/* In VAR_DECL and PARM_DECL, set when the decl has been used except for
1024 being set. */
1025#define DECL_READ_P(NODE) \
1026 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1027
1028/* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
1029 attempting to share the stack slot with some other variable. */
1030#define DECL_NONSHAREABLE(NODE) \
1031 (TREE_CHECK2 (NODE, VAR_DECL, \
1032 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1033
1034/* In a PARM_DECL, set for Fortran hidden string length arguments that some
1035 buggy callers don't pass to the callee. */
1036#define DECL_HIDDEN_STRING_LENGTH(NODE) \
1037 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
1038
1039/* In a CALL_EXPR, means that the call is the jump from a thunk to the
1040 thunked-to function. Be careful to avoid using this macro when one of the
1041 next two applies instead. */
1042#define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1043
1044/* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1045 it has been built for the declaration of a variable-sized object and, if the
1046 function being called is BUILT_IN_MEMCPY, means that it has been built for
1047 the assignment of a variable-sized object. */
1048#define CALL_ALLOCA_FOR_VAR_P(NODE) \
1049 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1050
1051/* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or
1052 DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete
1053 expressions. Not set for C++20 destroying delete operators. */
1054#define CALL_FROM_NEW_OR_DELETE_P(NODE) \
1055 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1056
1057/* Used in classes in C++. */
1058#define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1059/* Used in classes in C++. */
1060#define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1061
1062/* True if reference type NODE is a C++ rvalue reference. */
1063#define TYPE_REF_IS_RVALUE(NODE) \
1064 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1065
1066/* Nonzero in a _DECL if the use of the name is defined as a
1067 deprecated feature by __attribute__((deprecated)). */
1068#define TREE_DEPRECATED(NODE) \
1069 ((NODE)->base.deprecated_flag)
1070
1071/* Nonzero in a _DECL if the use of the name is defined as an
1072 unavailable feature by __attribute__((unavailable)). */
1073#define TREE_UNAVAILABLE(NODE) \
1074 ((NODE)->base.u.bits.unavailable_flag)
1075
1076/* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
1077 aggregate, (as created by anon_aggr_name_format). */
1078#define IDENTIFIER_ANON_P(NODE) \
1079 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
1080
1081/* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1082 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1083#define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1084 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1085
1086/* In an aggregate type, indicates that the scalar fields of the type are
1087 stored in reverse order from the target order. This effectively
1088 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
1089#define TYPE_REVERSE_STORAGE_ORDER(NODE) \
1090 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
1091
1092/* In a non-aggregate type, indicates a saturating type. */
1093#define TYPE_SATURATING(NODE) \
1094 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
1095
1096/* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
1097 of bits stored in reverse order from the target order. This effectively
1098 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
1099
1100 The overall strategy is to preserve the invariant that every scalar in
1101 memory is associated with a single storage order, i.e. all accesses to
1102 this scalar are done with the same storage order. This invariant makes
1103 it possible to factor out the storage order in most transformations, as
1104 only the address and/or the value (in target order) matter for them.
1105 But, of course, the storage order must be preserved when the accesses
1106 themselves are rewritten or transformed. */
1107#define REF_REVERSE_STORAGE_ORDER(NODE) \
1108 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
1109
1110 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
1111 represented by a descriptor instead of a trampoline. */
1112#define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
1113 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
1114
1115/* In a CALL_EXPR, indicates that this is an indirect call for which
1116 pointers to nested function are descriptors instead of trampolines. */
1117#define CALL_EXPR_BY_DESCRIPTOR(NODE) \
1118 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
1119
1120/* These flags are available for each language front end to use internally. */
1121#define TREE_LANG_FLAG_0(NODE) \
1122 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1123#define TREE_LANG_FLAG_1(NODE) \
1124 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1125#define TREE_LANG_FLAG_2(NODE) \
1126 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1127#define TREE_LANG_FLAG_3(NODE) \
1128 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1129#define TREE_LANG_FLAG_4(NODE) \
1130 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1131#define TREE_LANG_FLAG_5(NODE) \
1132 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1133#define TREE_LANG_FLAG_6(NODE) \
1134 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1135
1136/* Define additional fields and accessors for nodes representing constants. */
1137
1138#define TREE_INT_CST_NUNITS(NODE) \
1139 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1140#define TREE_INT_CST_EXT_NUNITS(NODE) \
1141 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1142#define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1143#define TREE_INT_CST_LOW(NODE) \
1144 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1145
1146/* Return true if NODE is a POLY_INT_CST. This is only ever true on
1147 targets with variable-sized modes. */
1148#define POLY_INT_CST_P(NODE) \
1149 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1150
1151/* In a POLY_INT_CST node. */
1152#define POLY_INT_CST_COEFF(NODE, I) \
1153 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1154
1155#define TREE_REAL_CST_PTR(NODE) (&REAL_CST_CHECK (NODE)->real_cst.value)
1156#define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1157
1158#define TREE_FIXED_CST_PTR(NODE) \
1159 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1160#define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1161
1162/* In a STRING_CST */
1163/* In C terms, this is sizeof, not strlen. */
1164#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1165#define TREE_STRING_POINTER(NODE) \
1166 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1167
1168/* In a RAW_DATA_CST */
1169#define RAW_DATA_LENGTH(NODE) \
1170 (RAW_DATA_CST_CHECK (NODE)->raw_data_cst.length)
1171#define RAW_DATA_POINTER(NODE) \
1172 (RAW_DATA_CST_CHECK (NODE)->raw_data_cst.str)
1173#define RAW_DATA_OWNER(NODE) \
1174 (RAW_DATA_CST_CHECK (NODE)->raw_data_cst.owner)
1175#define RAW_DATA_UCHAR_ELT(NODE, I) \
1176 (((const unsigned char *) RAW_DATA_POINTER (NODE))[I])
1177#define RAW_DATA_SCHAR_ELT(NODE, I) \
1178 (((const signed char *) RAW_DATA_POINTER (NODE))[I])
1179
1180/* In a COMPLEX_CST node. */
1181#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1182#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1183
1184/* In a VECTOR_CST node. See generic.texi for details. */
1185#define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1186#define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1187
1188#define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1189 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1190#define VECTOR_CST_NPATTERNS(NODE) \
1191 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1192#define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1193 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1194#define VECTOR_CST_DUPLICATE_P(NODE) \
1195 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1196#define VECTOR_CST_STEPPED_P(NODE) \
1197 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1198#define VECTOR_CST_ENCODED_ELTS(NODE) \
1199 (VECTOR_CST_CHECK (NODE)->vector.elts)
1200#define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1201 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1202
1203/* Define fields and accessors for some special-purpose tree nodes. */
1204
1205/* Unlike STRING_CST, in C terms this is strlen, not sizeof. */
1206#define IDENTIFIER_LENGTH(NODE) \
1207 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1208#define IDENTIFIER_POINTER(NODE) \
1209 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1210#define IDENTIFIER_HASH_VALUE(NODE) \
1211 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1212
1213/* Translate a hash table identifier pointer to a tree_identifier
1214 pointer, and vice versa. */
1215
1216#define HT_IDENT_TO_GCC_IDENT(NODE) \
1217 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1218#define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1219
1220/* In a TREE_LIST node. */
1221#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1222#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1223
1224/* In a TREE_VEC node. */
1225#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1226#define TREE_VEC_BEGIN(NODE) (&TREE_VEC_CHECK (NODE)->vec.a[0])
1227#define TREE_VEC_END(NODE) \
1228 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->base.u.length]))
1229
1230#define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1231
1232/* In a CONSTRUCTOR node. */
1233#define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1234#define CONSTRUCTOR_ELT(NODE,IDX) \
1235 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1236#define CONSTRUCTOR_NELTS(NODE) \
1237 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1238#define CONSTRUCTOR_NO_CLEARING(NODE) \
1239 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1240/* True if even padding bits should be zeroed during initialization. */
1241#define CONSTRUCTOR_ZERO_PADDING_BITS(NODE) \
1242 (CONSTRUCTOR_CHECK (NODE)->base.default_def_flag)
1243
1244/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1245 value of each element (stored within VAL). IX must be a scratch variable
1246 of unsigned integer type. */
1247#define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1248 for (IX = 0; (IX >= vec_safe_length (V)) \
1249 ? false \
1250 : ((VAL = (*(V))[IX].value), \
1251 true); \
1252 (IX)++)
1253
1254/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1255 the value of each element (stored within VAL) and its index (stored
1256 within INDEX). IX must be a scratch variable of unsigned integer type. */
1257#define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1258 for (IX = 0; (IX >= vec_safe_length (V)) \
1259 ? false \
1260 : (((void) (VAL = (*V)[IX].value)), \
1261 (INDEX = (*V)[IX].index), \
1262 true); \
1263 (IX)++)
1264
1265/* Append a new constructor element to V, with the specified INDEX and VAL. */
1266#define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1267 do { \
1268 constructor_elt _ce___ = {INDEX, VALUE}; \
1269 vec_safe_push ((V), _ce___); \
1270 } while (0)
1271
1272/* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1273 constructor output purposes. */
1274#define CONSTRUCTOR_BITFIELD_P(NODE) \
1275 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) \
1276 && (DECL_MODE (NODE) != BLKmode \
1277 || TREE_CODE (TREE_TYPE (NODE)) == BITINT_TYPE))
1278
1279/* True if NODE is a clobber right hand side, an expression of indeterminate
1280 value that clobbers the LHS in a copy instruction. We use a volatile
1281 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1282 In particular the volatile flag causes us to not prematurely remove
1283 such clobber instructions. */
1284#define TREE_CLOBBER_P(NODE) \
1285 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1286
1287/* Return the clobber_kind of a CLOBBER CONSTRUCTOR. */
1288#define CLOBBER_KIND(NODE) \
1289 (CONSTRUCTOR_CHECK (NODE)->base.u.bits.address_space)
1290
1291/* Define fields and accessors for some nodes that represent expressions. */
1292
1293/* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1294#define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1295 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1296 && integer_zerop (TREE_OPERAND (NODE, 0)))
1297
1298/* In ordinary expression nodes. */
1299#define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1300#define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1301
1302/* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1303 length. Its value includes the length operand itself; that is,
1304 the minimum valid length is 1.
1305 Note that we have to bypass the use of TREE_OPERAND to access
1306 that field to avoid infinite recursion in expanding the macros. */
1307#define VL_EXP_OPERAND_LENGTH(NODE) \
1308 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1309
1310/* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1311#define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1312/* Nonzero if gimple_debug_bind_p() (and thus
1313 gimple_debug_source_bind_p()) may possibly hold. */
1314#define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1315/* Nonzero if is_gimple_debug() may possibly hold. */
1316#define MAY_HAVE_DEBUG_STMTS \
1317 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1318
1319/* In a LOOP_EXPR node. */
1320#define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1321
1322/* The source location of this expression. Non-tree_exp nodes such as
1323 decls and constants can be shared among multiple locations, so
1324 return nothing. */
1325#define EXPR_LOCATION(NODE) \
1326 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1327#define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1328#define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1329 != UNKNOWN_LOCATION)
1330/* The location to be used in a diagnostic about this expression. Do not
1331 use this macro if the location will be assigned to other expressions. */
1332#define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1333 ? (NODE)->exp.locus : (LOCUS))
1334#define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1335#define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1336
1337#define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1338#define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1339
1340#define EXPR_HAS_RANGE(NODE) \
1341 (CAN_HAVE_RANGE_P (NODE) \
1342 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1343 : false)
1344
1345/* True if a tree is an expression or statement that can have a
1346 location. */
1347#define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1348
1349inline source_range
1350get_expr_source_range (tree expr)
1351{
1352 location_t loc = EXPR_LOCATION (expr);
1353 return get_range_from_loc (set: line_table, loc);
1354}
1355
1356extern void protected_set_expr_location (tree, location_t);
1357extern void protected_set_expr_location_if_unset (tree, location_t);
1358ATTRIBUTE_WARN_UNUSED_RESULT
1359extern tree protected_set_expr_location_unshare (tree, location_t);
1360
1361WARN_UNUSED_RESULT extern tree maybe_wrap_with_location (tree, location_t);
1362
1363extern int suppress_location_wrappers;
1364
1365/* A class for suppressing the creation of location wrappers.
1366 Location wrappers will not be created during the lifetime
1367 of an instance of this class. */
1368
1369class auto_suppress_location_wrappers
1370{
1371 public:
1372 auto_suppress_location_wrappers () { ++suppress_location_wrappers; }
1373 ~auto_suppress_location_wrappers () { --suppress_location_wrappers; }
1374};
1375
1376/* In a TARGET_EXPR node. */
1377#define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1378#define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1379#define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1380/* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1381 on rhs of MODIFY_EXPR. */
1382#define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1383
1384/* DECL_EXPR accessor. This gives access to the DECL associated with
1385 the given declaration statement. */
1386#define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1387
1388#define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1389
1390/* COMPOUND_LITERAL_EXPR accessors. */
1391#define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1392 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1393#define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1394 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1395
1396/* SWITCH_EXPR accessors. These give access to the condition and body. */
1397#define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1398#define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1399/* True if there are case labels for all possible values of SWITCH_COND, either
1400 because there is a default: case label or because the case label ranges cover
1401 all values. */
1402#define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1403
1404/* CASE_LABEL_EXPR accessors. These give access to the high and low values
1405 of a case label, respectively. */
1406#define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1407#define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1408#define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1409#define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1410
1411/* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1412 corresponding MEM_REF operands. */
1413#define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1414#define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1415#define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1416#define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1417#define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1418
1419#define MR_DEPENDENCE_CLIQUE(NODE) \
1420 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1421#define MR_DEPENDENCE_BASE(NODE) \
1422 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1423
1424/* The operands of a BIND_EXPR. */
1425#define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1426#define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1427#define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1428
1429/* GOTO_EXPR accessor. This gives access to the label associated with
1430 a goto statement. */
1431#define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1432
1433/* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1434 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1435 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1436 statement. */
1437#define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1438#define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1439#define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1440#define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1441#define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1442/* Nonzero if the asm is a basic asm, zero if it is an extended asm.
1443 Basic asms use a plain ASM_INPUT insn pattern whereas extended asms
1444 use an ASM_OPERANDS insn pattern. */
1445#define ASM_BASIC_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1446#define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1447/* Nonzero if we want to consider this asm as minimum length and cost
1448 for inlining decisions. */
1449#define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1450
1451/* COND_EXPR accessors. */
1452#define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1453#define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1454#define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1455
1456/* Accessors for the chains of recurrences. */
1457#define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1458#define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1459#define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1460/* Nonzero if this chrec doesn't overflow (i.e., nonwrapping). */
1461#define CHREC_NOWRAP(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.nothrow_flag
1462
1463/* LABEL_EXPR accessor. This gives access to the label associated with
1464 the given label expression. */
1465#define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1466
1467/* CATCH_EXPR accessors. */
1468#define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1469#define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1470
1471/* EH_FILTER_EXPR accessors. */
1472#define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1473#define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1474
1475/* OBJ_TYPE_REF accessors. */
1476#define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1477#define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1478#define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1479
1480/* CALL_EXPR accessors. */
1481#define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1482#define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1483#define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1484#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1485#define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1486
1487/* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1488 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1489 the argument count is zero when checking is enabled. Instead, do
1490 the pointer arithmetic to advance past the 3 fixed operands in a
1491 CALL_EXPR. That produces a valid pointer to just past the end of the
1492 operand array, even if it's not valid to dereference it. */
1493#define CALL_EXPR_ARGP(NODE) \
1494 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1495
1496/* TM directives and accessors. */
1497#define TRANSACTION_EXPR_BODY(NODE) \
1498 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1499#define TRANSACTION_EXPR_OUTER(NODE) \
1500 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1501#define TRANSACTION_EXPR_RELAXED(NODE) \
1502 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1503
1504/* OpenMP and OpenACC directive and clause accessors. */
1505
1506/* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1507 as operand 1. */
1508#define OMP_BODY(NODE) \
1509 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1510#define OMP_CLAUSES(NODE) \
1511 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1512
1513/* Generic accessors for OMP nodes that keep clauses as operand 0. */
1514#define OMP_STANDALONE_CLAUSES(NODE) \
1515 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1516
1517#define OACC_DATA_BODY(NODE) \
1518 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1519#define OACC_DATA_CLAUSES(NODE) \
1520 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1521
1522#define OACC_HOST_DATA_BODY(NODE) \
1523 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1524#define OACC_HOST_DATA_CLAUSES(NODE) \
1525 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1526
1527#define OACC_CACHE_CLAUSES(NODE) \
1528 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1529
1530#define OACC_DECLARE_CLAUSES(NODE) \
1531 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1532
1533#define OACC_ENTER_DATA_CLAUSES(NODE) \
1534 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1535
1536#define OACC_EXIT_DATA_CLAUSES(NODE) \
1537 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1538
1539#define OACC_UPDATE_CLAUSES(NODE) \
1540 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1541
1542#define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1543#define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1544
1545#define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1546#define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1547
1548#define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1549#define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1550#define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1551
1552#define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1553#define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1554#define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1555#define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1556#define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1557#define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1558#define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1559#define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1560
1561#define OMP_INTEROP_CLAUSES(NODE)\
1562 TREE_OPERAND (OMP_INTEROP_CHECK (NODE), 0)
1563
1564#define OMP_LOOPXFORM_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_TILE, OMP_UNROLL)
1565#define OMP_LOOPXFORM_LOWERED(NODE) \
1566 (OMP_LOOPXFORM_CHECK (NODE)->base.public_flag)
1567
1568#define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1569#define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1570
1571#define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1572
1573#define OMP_STRUCTURED_BLOCK_BODY(NODE) \
1574 TREE_OPERAND (OMP_STRUCTURED_BLOCK_CHECK (NODE), 0)
1575
1576#define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1577#define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1578
1579#define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0)
1580#define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1)
1581
1582#define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1583
1584#define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0)
1585#define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1)
1586
1587#define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1588#define OMP_TASKGROUP_CLAUSES(NODE) \
1589 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1590
1591#define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1592#define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1593
1594#define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1595#define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1596#define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1597
1598#define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1599#define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1600
1601#define OMP_TARGET_DATA_BODY(NODE) \
1602 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1603#define OMP_TARGET_DATA_CLAUSES(NODE)\
1604 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1605
1606#define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1607#define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1608
1609#define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1610 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1611
1612#define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1613 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1614
1615#define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1616 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1617
1618#define OMP_METADIRECTIVE_VARIANTS(NODE) \
1619 TREE_OPERAND (OMP_METADIRECTIVE_CHECK (NODE), 0)
1620
1621#define OMP_METADIRECTIVE_VARIANT_SELECTOR(v) \
1622 TREE_PURPOSE (v)
1623#define OMP_METADIRECTIVE_VARIANT_DIRECTIVE(v) \
1624 TREE_PURPOSE (TREE_VALUE (v))
1625#define OMP_METADIRECTIVE_VARIANT_BODY(v) \
1626 TREE_VALUE (TREE_VALUE (v))
1627
1628#define OMP_DECLARE_MAPPER_ID(NODE) \
1629 TREE_OPERAND (OMP_DECLARE_MAPPER_CHECK (NODE), 0)
1630#define OMP_DECLARE_MAPPER_DECL(NODE) \
1631 TREE_OPERAND (OMP_DECLARE_MAPPER_CHECK (NODE), 1)
1632#define OMP_DECLARE_MAPPER_CLAUSES(NODE) \
1633 TREE_OPERAND (OMP_DECLARE_MAPPER_CHECK (NODE), 2)
1634
1635#define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1636#define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1637
1638#define OMP_DISPATCH_BODY(NODE) TREE_OPERAND (OMP_DISPATCH_CHECK (NODE), 0)
1639#define OMP_DISPATCH_CLAUSES(NODE) TREE_OPERAND (OMP_DISPATCH_CHECK (NODE), 1)
1640
1641#define OMP_CLAUSE_SIZE(NODE) \
1642 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1643 OMP_CLAUSE_FROM, \
1644 OMP_CLAUSE__CACHE_), 1)
1645
1646#define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1647#define OMP_CLAUSE_DECL(NODE) \
1648 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1649 OMP_CLAUSE_PRIVATE, \
1650 OMP_CLAUSE__SCANTEMP_), 0)
1651#define OMP_CLAUSE_HAS_LOCATION(NODE) \
1652 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1653 != UNKNOWN_LOCATION)
1654#define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1655
1656/* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1657 is non-rectangular. */
1658#define OMP_FOR_NON_RECTANGULAR(NODE) \
1659 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1660
1661/* True on an OMP_SECTION statement that was the last lexical member.
1662 This status is meaningful in the implementation of lastprivate. */
1663#define OMP_SECTION_LAST(NODE) \
1664 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1665
1666/* True on an OMP_PARALLEL statement if it represents an explicit
1667 combined parallel work-sharing constructs. */
1668#define OMP_PARALLEL_COMBINED(NODE) \
1669 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1670
1671/* True on an OMP_TEAMS statement if it represents an explicit
1672 combined teams distribute constructs. */
1673#define OMP_TEAMS_COMBINED(NODE) \
1674 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1675
1676/* True on an OMP_TARGET statement if it represents explicit
1677 combined target teams, target parallel or target simd constructs. */
1678#define OMP_TARGET_COMBINED(NODE) \
1679 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1680
1681/* True on an OMP_MASTER statement if it represents an explicit
1682 combined master constructs. */
1683#define OMP_MASTER_COMBINED(NODE) \
1684 (OMP_MASTER_CHECK (NODE)->base.private_flag)
1685
1686/* True on an OMP_MASKED statement if it represents an explicit
1687 combined masked constructs. */
1688#define OMP_MASKED_COMBINED(NODE) \
1689 (OMP_MASKED_CHECK (NODE)->base.private_flag)
1690
1691/* Memory order for OMP_ATOMIC*. */
1692#define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1693 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1694 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1695
1696/* Weak clause on OMP_ATOMIC*. */
1697#define OMP_ATOMIC_WEAK(NODE) \
1698 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1699 OMP_ATOMIC_CAPTURE_NEW)->base.public_flag)
1700
1701/* True on a PRIVATE clause if its decl is kept around for debugging
1702 information only and its DECL_VALUE_EXPR is supposed to point
1703 to what it has been remapped to. */
1704#define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1705 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1706
1707/* True on a PRIVATE clause if ctor needs access to outer region's
1708 variable. */
1709#define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1710 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1711
1712/* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1713 (thus should be private on the outer taskloop and firstprivate on
1714 task). */
1715#define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1716 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1717
1718/* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1719#define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1720 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1721
1722/* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1723 to should be firstprivatized. */
1724#define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1725 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1726
1727/* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also
1728 set if target construct is the only one that accepts the clause. */
1729#define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \
1730 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1731
1732/* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1733 decl is present in the chain. */
1734#define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1735 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1736#define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1737 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1738 OMP_CLAUSE_LASTPRIVATE),\
1739 1)
1740#define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1741 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1742
1743/* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1744 loop construct (thus should be lastprivate on the outer taskloop and
1745 firstprivate on task for the taskloop construct and carefully handled
1746 for loop construct). */
1747#define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1748 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1749
1750/* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1751#define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1752 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1753
1754/* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1755 decl is present in the chain (this can happen only for taskloop
1756 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1757#define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1758 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1759
1760/* True on a SHARED clause if a scalar is not modified in the body and
1761 thus could be optimized as firstprivate. */
1762#define OMP_CLAUSE_SHARED_READONLY(NODE) \
1763 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1764
1765#define OMP_CLAUSE_IF_MODIFIER(NODE) \
1766 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1767
1768#define OMP_CLAUSE_FINAL_EXPR(NODE) \
1769 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1770#define OMP_CLAUSE_IF_EXPR(NODE) \
1771 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1772#define OMP_CLAUSE_SELF_EXPR(NODE) \
1773 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SELF), 0)
1774#define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1775 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1776#define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1777 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1778#define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1779 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1780#define OMP_CLAUSE_HINT_EXPR(NODE) \
1781 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1782#define OMP_CLAUSE_FILTER_EXPR(NODE) \
1783 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0)
1784#define OMP_CLAUSE_PARTIAL_EXPR(NODE) \
1785 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PARTIAL), 0)
1786#define OMP_CLAUSE_SIZES_LIST(NODE) \
1787 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIZES), 0)
1788#define OMP_CLAUSE_NOVARIANTS_EXPR(NODE) \
1789 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NOVARIANTS), 0)
1790#define OMP_CLAUSE_NOCONTEXT_EXPR(NODE) \
1791 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NOCONTEXT), 0)
1792
1793#define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1794 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1795
1796#define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1797 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1798
1799#define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \
1800 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE))
1801#define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \
1802 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS))
1803
1804/* OpenACC clause expressions */
1805#define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1806 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1807#define OMP_CLAUSE_GANG_EXPR(NODE) \
1808 OMP_CLAUSE_OPERAND ( \
1809 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1810#define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1811 OMP_CLAUSE_OPERAND ( \
1812 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1813#define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1814 OMP_CLAUSE_OPERAND ( \
1815 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1816#define OMP_CLAUSE_WAIT_EXPR(NODE) \
1817 OMP_CLAUSE_OPERAND ( \
1818 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1819#define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1820 OMP_CLAUSE_OPERAND ( \
1821 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1822#define OMP_CLAUSE_WORKER_EXPR(NODE) \
1823 OMP_CLAUSE_OPERAND ( \
1824 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1825#define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1826 OMP_CLAUSE_OPERAND ( \
1827 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1828#define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1829 OMP_CLAUSE_OPERAND ( \
1830 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1831#define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1832 OMP_CLAUSE_OPERAND ( \
1833 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1834
1835#define OMP_CLAUSE_DEPEND_KIND(NODE) \
1836 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1837
1838#define OMP_CLAUSE_DOACROSS_KIND(NODE) \
1839 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS)->omp_clause.subcode.doacross_kind)
1840
1841#define OMP_CLAUSE_DOACROSS_SINK_NEGATIVE(NODE) \
1842 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1843
1844/* True if DOACROSS clause is spelled as DEPEND. */
1845#define OMP_CLAUSE_DOACROSS_DEPEND(NODE) \
1846 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS))
1847
1848#define OMP_CLAUSE_MAP_KIND(NODE) \
1849 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1850#define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1851 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1852 = (unsigned int) (MAP_KIND))
1853
1854#define OMP_CLAUSE_MOTION_PRESENT(NODE) \
1855 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_FROM, OMP_CLAUSE_TO)->base.deprecated_flag)
1856
1857#define OMP_CLAUSE_INIT_TARGET(NODE) \
1858 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INIT)->base.public_flag)
1859#define OMP_CLAUSE_INIT_TARGETSYNC(NODE) \
1860 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INIT)->base.deprecated_flag)
1861#define OMP_CLAUSE_INIT_PREFER_TYPE(NODE) \
1862 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1863 OMP_CLAUSE_INIT, \
1864 OMP_CLAUSE_INIT), 1)
1865
1866/* Nonzero if this map clause is for array (rather than pointer) based array
1867 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1868 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1869#define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1870 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1871/* Nonzero if this is a mapped array section, that might need special
1872 treatment if OMP_CLAUSE_SIZE is zero. */
1873#define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1874 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1875/* Nonzero if this map clause is for an OpenACC compute construct's reduction
1876 variable or OpenMP map clause mentioned also in in_reduction clause on the
1877 same construct. */
1878#define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1879 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1880/* Nonzero on map clauses added implicitly for reduction clauses on combined
1881 or composite constructs. They shall be removed if there is an explicit
1882 map clause. */
1883#define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1884 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1885/* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1886 due to being created through implicit data-mapping rules in the middle-end.
1887 NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1888#define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1889 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1890/* Nonzero for an attach/detach node whose decl was explicitly mapped on the
1891 same directive. */
1892#define OMP_CLAUSE_ATTACHMENT_MAPPING_ERASED(NODE) \
1893 TREE_STATIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1894/* Nonzero if this is a release/delete node which refers to a (Fortran) array
1895 descriptor. */
1896#define OMP_CLAUSE_RELEASE_DESCRIPTOR(NODE) \
1897 TREE_NOTHROW (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1898
1899/* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1900 lowering. */
1901#define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1902 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1903
1904/* Nonzero if OpenACC 'readonly' modifier set, used for 'copyin'. */
1905#define OMP_CLAUSE_MAP_READONLY(NODE) \
1906 TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1907
1908/* Same as above, for use in OpenACC cache directives. */
1909#define OMP_CLAUSE__CACHE__READONLY(NODE) \
1910 TREE_READONLY (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CACHE_))
1911
1912/* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1913 clause. */
1914#define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1915 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1916
1917#define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1918 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1919
1920#define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1921 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1922
1923#define OMP_CLAUSE_INDIRECT_EXPR(NODE) \
1924 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INDIRECT), 0)
1925
1926
1927/* True if there is a device clause with a device-modifier 'ancestor'. */
1928#define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
1929 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
1930
1931#define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1932 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1933#define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1934 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1935#define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1936 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1937
1938#define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1939 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1940
1941/* True on an OMP_CLAUSE_ORDERED if stand-alone ordered construct is nested
1942 inside of work-sharing loop the clause is on. */
1943#define OMP_CLAUSE_ORDERED_DOACROSS(NODE) \
1944 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED)->base.public_flag)
1945
1946/* True for unconstrained modifier on order(concurrent) clause. */
1947#define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
1948 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
1949/* True for reproducible modifier on order(concurrent) clause. */
1950#define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
1951 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
1952
1953#define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1954 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1955 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1956#define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1957 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1958 OMP_CLAUSE_IN_REDUCTION), 1)
1959#define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1960 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1961 OMP_CLAUSE_IN_REDUCTION), 2)
1962#define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1963 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1964#define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1965 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1966#define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1967 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1968 OMP_CLAUSE_IN_REDUCTION), 3)
1969#define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1970 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1971 OMP_CLAUSE_IN_REDUCTION), 4)
1972
1973/* True if a REDUCTION clause may reference the original list item (omp_orig)
1974 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1975#define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1976 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1977 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1978
1979/* True if a REDUCTION clause has task reduction-modifier. */
1980#define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1981 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1982
1983/* True if a REDUCTION clause has inscan reduction-modifier. */
1984#define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1985 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1986
1987/* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1988 are always initialized inside of the loop construct, false otherwise. */
1989#define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1990 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1991
1992/* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1993 are declared inside of the simd construct. */
1994#define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1995 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1996
1997/* True if a LINEAR clause has a stride that is variable. */
1998#define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1999 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
2000
2001/* True for a LINEAR clause with old style modifier syntax
2002 linear(modifier(list)) or linear(modifier(list):step). */
2003#define OMP_CLAUSE_LINEAR_OLD_LINEAR_MODIFIER(NODE) \
2004 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.addressable_flag)
2005
2006/* True if a LINEAR clause is for an array or allocatable variable that
2007 needs special handling by the frontend. */
2008#define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
2009 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
2010
2011#define OMP_CLAUSE_LINEAR_STEP(NODE) \
2012 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
2013
2014#define OMP_CLAUSE_LINEAR_STMT(NODE) \
2015 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
2016
2017#define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
2018 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
2019
2020#define OMP_CLAUSE_LINEAR_KIND(NODE) \
2021 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
2022
2023#define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
2024 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
2025
2026#define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
2027 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
2028
2029#define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
2030 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
2031
2032/* True if an ALLOCATE clause was present on a combined or composite
2033 construct and the code for splitting the clauses has already performed
2034 checking if the listed variable has explicit privatization on the
2035 construct. */
2036#define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
2037 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
2038
2039#define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
2040 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
2041
2042#define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
2043 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
2044
2045#define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
2046 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2047 OMP_CLAUSE_THREAD_LIMIT), 0)
2048
2049#define OMP_CLAUSE_DEVICE_ID(NODE) \
2050 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
2051
2052#define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
2053 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2054 OMP_CLAUSE_DIST_SCHEDULE), 0)
2055
2056#define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
2057 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
2058
2059#define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
2060 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
2061
2062#define OMP_CLAUSE__SIMDUID__DECL(NODE) \
2063 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
2064
2065#define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
2066 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
2067
2068/* True if a SCHEDULE clause has the simd modifier on it. */
2069#define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
2070 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
2071
2072#define OMP_CLAUSE_DEFAULT_KIND(NODE) \
2073 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
2074
2075#define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
2076 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
2077#define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
2078 ((enum omp_clause_defaultmap_kind) \
2079 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
2080#define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
2081 ((enum omp_clause_defaultmap_kind) \
2082 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
2083#define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
2084 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
2085 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
2086
2087#define OMP_CLAUSE_BIND_KIND(NODE) \
2088 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
2089
2090/* True if ENTER clause is spelled as TO. */
2091#define OMP_CLAUSE_ENTER_TO(NODE) \
2092 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ENTER)->base.public_flag)
2093
2094#define OMP_CLAUSE_TILE_LIST(NODE) \
2095 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
2096#define OMP_CLAUSE_TILE_ITERVAR(NODE) \
2097 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
2098#define OMP_CLAUSE_TILE_COUNT(NODE) \
2099 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
2100
2101/* _CONDTEMP_ holding temporary with iteration count. */
2102#define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
2103 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
2104
2105/* _SCANTEMP_ holding temporary with pointer to thread's local array;
2106 allocation. */
2107#define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
2108 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
2109
2110/* _SCANTEMP_ holding temporary with a control variable for deallocation;
2111 one boolean_type_node for test whether alloca was used, another one
2112 to pass to __builtin_stack_restore or free. */
2113#define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
2114 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
2115
2116/* OpenMP OMP_NEXT_VARIANT accessors. */
2117#define OMP_NEXT_VARIANT_INDEX(NODE) \
2118 TREE_OPERAND (OMP_NEXT_VARIANT_CHECK (NODE), 0)
2119#define OMP_NEXT_VARIANT_STATE(NODE) \
2120 TREE_OPERAND (OMP_NEXT_VARIANT_CHECK (NODE), 1)
2121
2122/* OpenMP OMP_TARGET_DEVICE_MATCHES accessors. */
2123#define OMP_TARGET_DEVICE_MATCHES_SELECTOR(NODE) \
2124 TREE_OPERAND (OMP_TARGET_DEVICE_MATCHES_CHECK (NODE), 0)
2125#define OMP_TARGET_DEVICE_MATCHES_PROPERTIES(NODE) \
2126 TREE_OPERAND (OMP_TARGET_DEVICE_MATCHES_CHECK (NODE), 1)
2127
2128#define OMP_CLAUSE__MAPPER_BINDING__ID(NODE) \
2129 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2130 OMP_CLAUSE__MAPPER_BINDING_), 0)
2131
2132#define OMP_CLAUSE__MAPPER_BINDING__DECL(NODE) \
2133 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2134 OMP_CLAUSE__MAPPER_BINDING_), 1)
2135
2136#define OMP_CLAUSE__MAPPER_BINDING__MAPPER(NODE) \
2137 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
2138 OMP_CLAUSE__MAPPER_BINDING_), 2)
2139
2140/* SSA_NAME accessors. */
2141
2142/* Whether SSA_NAME NODE is a virtual operand. This simply caches the
2143 information in the underlying SSA_NAME_VAR for efficiency. */
2144#define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
2145 SSA_NAME_CHECK (NODE)->base.public_flag
2146
2147/* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
2148 if there is no name associated with it. */
2149#define SSA_NAME_IDENTIFIER(NODE) \
2150 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
2151 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2152 ? (NODE)->ssa_name.var \
2153 : DECL_NAME ((NODE)->ssa_name.var)) \
2154 : NULL_TREE)
2155
2156/* Returns the variable being referenced. This can be NULL_TREE for
2157 temporaries not associated with any user variable.
2158 Once released, this is the only field that can be relied upon. */
2159#define SSA_NAME_VAR(NODE) \
2160 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
2161 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2162 ? NULL_TREE : (NODE)->ssa_name.var)
2163
2164#define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
2165 do \
2166 { \
2167 tree var_ = (VAR); \
2168 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
2169 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
2170 = (var_ \
2171 && TREE_CODE (var_) == VAR_DECL \
2172 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
2173 } \
2174 while (0)
2175
2176/* Returns the statement which defines this SSA name. */
2177#define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
2178
2179/* Returns the SSA version number of this SSA name. Note that in
2180 tree SSA, version numbers are not per variable and may be recycled. */
2181#define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
2182
2183/* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
2184 never output, so we can safely use the ASM_WRITTEN_FLAG for this
2185 status bit. */
2186#define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
2187 SSA_NAME_CHECK (NODE)->base.asm_written_flag
2188
2189/* Nonzero if this SSA_NAME expression is currently on the free list of
2190 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
2191 has no meaning for an SSA_NAME. */
2192#define SSA_NAME_IN_FREE_LIST(NODE) \
2193 SSA_NAME_CHECK (NODE)->base.nothrow_flag
2194
2195/* Nonzero if this SSA_NAME is the default definition for the
2196 underlying symbol. A default SSA name is created for symbol S if
2197 the very first reference to S in the function is a read operation.
2198 Default definitions are always created by an empty statement and
2199 belong to no basic block. */
2200#define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2201 SSA_NAME_CHECK (NODE)->base.default_def_flag
2202
2203/* Nonzero if this SSA_NAME is known to point to memory that may not
2204 be written to. This is set for default defs of function parameters
2205 that have a corresponding r or R specification in the functions
2206 fn spec attribute. This is used by alias analysis. */
2207#define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
2208 SSA_NAME_CHECK (NODE)->base.deprecated_flag
2209
2210/* Attributes for SSA_NAMEs for pointer-type variables. */
2211#define SSA_NAME_PTR_INFO(N) \
2212 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
2213
2214/* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
2215#define SSA_NAME_RANGE_INFO(N) \
2216 SSA_NAME_CHECK (N)->ssa_name.info.range_info
2217
2218/* Return the immediate_use information for an SSA_NAME. */
2219#define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2220
2221#define OMP_CLAUSE_CODE(NODE) \
2222 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2223
2224#define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2225 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2226
2227#define OMP_CLAUSE_OPERAND(NODE, I) \
2228 OMP_CLAUSE_ELT_CHECK (NODE, I)
2229
2230/* In a BLOCK (scope) node:
2231 Variables declared in the scope NODE. */
2232#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2233#define BLOCK_NONLOCALIZED_VARS(NODE) \
2234 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2235#define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2236 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2237#define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2238/* A chain of BLOCKs (scopes) nested within the scope NODE. */
2239#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2240/* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2241 function scope. Inlined functions are chained by this so that given
2242 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2243 in which E has been made or into which E has been inlined. */
2244#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2245/* Points to the next scope at the same level of nesting as scope NODE. */
2246#define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2247/* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2248 inlined. In a scope immediately enclosing an inlined leaf expression,
2249 points to the outermost scope into which it has been inlined (thus
2250 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2251#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2252#define BLOCK_ORIGIN(NODE) \
2253 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2254#define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2255
2256/* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2257#define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2258
2259/* True if BLOCK appears in cold section. */
2260#define BLOCK_IN_COLD_SECTION_P(NODE) \
2261 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2262
2263/* An index number for this block. These values are not guaranteed to
2264 be unique across functions -- whether or not they are depends on
2265 the debugging output format in use. */
2266#define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2267
2268/* If block reordering splits a lexical block into discontiguous
2269 address ranges, we'll make a copy of the original block.
2270
2271 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2272 In that case, we have one source block that has been replicated
2273 (through inlining or unrolling) into many logical blocks, and that
2274 these logical blocks have different physical variables in them.
2275
2276 In this case, we have one logical block split into several
2277 non-contiguous address ranges. Most debug formats can't actually
2278 represent this idea directly, so we fake it by creating multiple
2279 logical blocks with the same variables in them. However, for those
2280 that do support non-contiguous regions, these allow the original
2281 logical block to be reconstructed, along with the set of address
2282 ranges.
2283
2284 One of the logical block fragments is arbitrarily chosen to be
2285 the ORIGIN. The other fragments will point to the origin via
2286 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2287 be null. The list of fragments will be chained through
2288 BLOCK_FRAGMENT_CHAIN from the origin. */
2289
2290#define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2291#define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2292
2293/* For an inlined function, this gives the location where it was called
2294 from. This is only set in the top level block, which corresponds to the
2295 inlined function scope. This is used in the debug output routines. */
2296
2297#define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2298
2299/* This gives the location of the end of the block, useful to attach
2300 code implicitly generated for outgoing paths. */
2301
2302#define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2303
2304/* Define fields and accessors for nodes representing data types. */
2305
2306/* See tree.def for documentation of the use of these fields.
2307 Look at the documentation of the various ..._TYPE tree codes.
2308
2309 Note that the type.values, type.minval, and type.maxval fields are
2310 overloaded and used for different macros in different kinds of types.
2311 Each macro must check to ensure the tree node is of the proper kind of
2312 type. Note also that some of the front-ends also overload these fields,
2313 so they must be checked as well. */
2314
2315#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2316/* Type size in bits as a tree expression. Need not be constant and may
2317 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2318 class subobject with its own virtual base classes (which are laid out
2319 separately). */
2320#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2321/* Likewise, type size in bytes. */
2322#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2323#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2324#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2325#define TYPE_PRECISION(NODE) \
2326 (TREE_NOT_CHECK (TYPE_CHECK (NODE), VECTOR_TYPE)->type_common.precision)
2327#define TYPE_PRECISION_RAW(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2328#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2329#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2330#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2331#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2332
2333#define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2334#define TYPE_MODE(NODE) \
2335 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2336 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2337#define SCALAR_TYPE_MODE(NODE) \
2338 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2339#define SCALAR_INT_TYPE_MODE(NODE) \
2340 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2341#define SCALAR_FLOAT_TYPE_MODE(NODE) \
2342 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2343#define SET_TYPE_MODE(NODE, MODE) \
2344 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2345
2346extern unsigned int element_precision (const_tree);
2347extern machine_mode element_mode (const_tree);
2348extern machine_mode vector_type_mode (const_tree);
2349extern unsigned int vector_element_bits (const_tree);
2350extern tree vector_element_bits_tree (const_tree);
2351
2352/* The "canonical" type for this type node, which is used by frontends to
2353 compare the type for equality with another type. If two types are
2354 equal (based on the semantics of the language), then they will have
2355 equivalent TYPE_CANONICAL entries.
2356
2357 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2358 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2359 be used for comparison against other types. Instead, the type is
2360 said to require structural equality checks, described in
2361 TYPE_STRUCTURAL_EQUALITY_P.
2362
2363 For unqualified aggregate and function types the middle-end relies on
2364 TYPE_CANONICAL to tell whether two variables can be assigned
2365 to each other without a conversion. The middle-end also makes sure
2366 to assign the same alias-sets to the type partition with equal
2367 TYPE_CANONICAL of their unqualified variants. */
2368#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2369/* Indicates that the type node requires structural equality
2370 checks. The compiler will need to look at the composition of the
2371 type to determine whether it is equal to another type, rather than
2372 just comparing canonical type pointers. For instance, we would need
2373 to look at the return and parameter types of a FUNCTION_TYPE
2374 node. */
2375#define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2376/* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2377 type node requires structural equality. */
2378#define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2379
2380#define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2381#define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2382
2383/* The (language-specific) typed-based alias set for this type.
2384 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2385 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2386 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2387 type can alias objects of any type. */
2388#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2389
2390/* Nonzero iff the typed-based alias set for this type has been
2391 calculated. */
2392#define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2393 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2394
2395/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2396 to this type. */
2397#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2398
2399/* Raw access to the alignment field. */
2400#define TYPE_ALIGN_RAW(NODE) \
2401 (TYPE_CHECK (NODE)->type_common.align)
2402
2403/* The alignment necessary for objects of this type.
2404 The value is an int, measured in bits and must be a power of two.
2405 We support also an "alignment" of zero. */
2406#define TYPE_ALIGN(NODE) \
2407 (TYPE_ALIGN_RAW (NODE) \
2408 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2409
2410/* Specify that TYPE_ALIGN(NODE) is X. */
2411#define SET_TYPE_ALIGN(NODE, X) \
2412 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2413
2414/* 1 if the alignment for this type was requested by "aligned" attribute,
2415 0 if it is the default for this type. */
2416#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2417
2418/* The alignment for NODE, in bytes. */
2419#define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2420
2421/* The minimum alignment necessary for objects of this type without
2422 warning. The value is an int, measured in bits. */
2423#define TYPE_WARN_IF_NOT_ALIGN_RAW(NODE) \
2424 (TYPE_CHECK (NODE)->type_common.warn_if_not_align)
2425#define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2426 (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) \
2427 ? ((unsigned)1) << (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2428
2429/* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2430#define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2431 (TYPE_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2432
2433/* If your language allows you to declare types, and you want debug info
2434 for them, then you need to generate corresponding TYPE_DECL nodes.
2435 These "stub" TYPE_DECL nodes have no name, and simply point at the
2436 type node. You then set the TYPE_STUB_DECL field of the type node
2437 to point back at the TYPE_DECL node. This allows the debug routines
2438 to know that the two nodes represent the same type, so that we only
2439 get one debug info record for them. */
2440#define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2441
2442/* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2443 the type has BLKmode only because it lacks the alignment required for
2444 its size. */
2445#define TYPE_NO_FORCE_BLK(NODE) \
2446 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2447
2448/* Nonzero in a type considered volatile as a whole. */
2449#define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2450
2451/* Nonzero in a type considered atomic as a whole. */
2452#define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2453
2454/* Means this type is const-qualified. */
2455#define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2456
2457/* If nonzero, this type is `restrict'-qualified, in the C sense of
2458 the term. */
2459#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2460
2461/* If nonzero, type's name shouldn't be emitted into debug info. */
2462#define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2463
2464/* The address space the type is in. */
2465#define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2466
2467/* Encode/decode the named memory support as part of the qualifier. If more
2468 than 8 qualifiers are added, these macros need to be adjusted. */
2469#define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2470#define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2471
2472/* Return all qualifiers except for the address space qualifiers. */
2473#define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2474
2475/* Only keep the address space out of the qualifiers and discard the other
2476 qualifiers. */
2477#define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2478
2479/* The set of type qualifiers for this type. */
2480#define TYPE_QUALS(NODE) \
2481 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2482 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2483 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2484 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2485 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2486
2487/* The same as TYPE_QUALS without the address space qualifications. */
2488#define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2489 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2490 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2491 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2492 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2493
2494/* The same as TYPE_QUALS without the address space and atomic
2495 qualifications. */
2496#define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2497 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2498 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2499 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2500
2501/* These flags are available for each language front end to use internally. */
2502#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2503#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2504#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2505#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2506#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2507#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2508#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2509#define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2510
2511/* Used to keep track of visited nodes in tree traversals. This is set to
2512 0 by copy_node and make_node. */
2513#define TREE_VISITED(NODE) ((NODE)->base.visited)
2514
2515/* If set in an ARRAY_TYPE, indicates a string type (for languages
2516 that distinguish string from array of char).
2517 If set in a INTEGER_TYPE, indicates a character type. */
2518#define TYPE_STRING_FLAG(NODE) \
2519 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2520
2521/* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2522 to the C++ one definition rule. This is used for LTO canonical type
2523 computation. */
2524#define TYPE_CXX_ODR_P(NODE) \
2525 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2526
2527/* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2528 about missing conversions to other vector types of the same size. */
2529#define TYPE_VECTOR_OPAQUE(NODE) \
2530 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2531
2532/* Indicates that objects of this type must be initialized by calling a
2533 function when they are created. */
2534#define TYPE_NEEDS_CONSTRUCTING(NODE) \
2535 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2536
2537/* Indicates that a UNION_TYPE object should be passed the same way that
2538 the first union alternative would be passed, or that a RECORD_TYPE
2539 object should be passed the same way that the first (and only) member
2540 would be passed. */
2541#define TYPE_TRANSPARENT_AGGR(NODE) \
2542 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2543
2544/* For an ARRAY_TYPE, indicates that it is not permitted to take the
2545 address of a component of the type. This is the counterpart of
2546 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2547#define TYPE_NONALIASED_COMPONENT(NODE) \
2548 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2549
2550/* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2551 whether the array is typeless storage or the type contains a member
2552 with this flag set. Such types are exempt from type-based alias
2553 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2554 the flag should be inherited from the element type, can change
2555 when type is finalized and because of that should not be used in
2556 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2557 the flag should not be changed after the array is created and should
2558 be used in type hashing. */
2559#define TYPE_TYPELESS_STORAGE(NODE) \
2560 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2561 ARRAY_TYPE)->type_common.typeless_storage)
2562
2563/* Indicated that objects of this type should be laid out in as
2564 compact a way as possible. */
2565#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2566
2567/* Used by type_contains_placeholder_p to avoid recomputation.
2568 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2569 this field directly. */
2570#define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2571 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2572
2573/* Nonzero if RECORD_TYPE represents a final derivation of class. */
2574#define TYPE_FINAL_P(NODE) \
2575 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2576
2577/* The debug output functions use the symtab union field to store
2578 information specific to the debugging format. The different debug
2579 output hooks store different types in the union field. These three
2580 macros are used to access different fields in the union. The debug
2581 hooks are responsible for consistently using only a specific
2582 macro. */
2583
2584/* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2585 hold the type's number in the generated stabs. */
2586#define TYPE_SYMTAB_ADDRESS(NODE) \
2587 (TYPE_CHECK (NODE)->type_common.symtab.address)
2588
2589/* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2590 in dwarf2out.cc to point to the DIE generated for the type. */
2591#define TYPE_SYMTAB_DIE(NODE) \
2592 (TYPE_CHECK (NODE)->type_common.symtab.die)
2593
2594/* The garbage collector needs to know the interpretation of the
2595 symtab field. These constants represent the different types in the
2596 union. */
2597
2598#define TYPE_SYMTAB_IS_ADDRESS (0)
2599#define TYPE_SYMTAB_IS_DIE (1)
2600
2601#define TYPE_LANG_SPECIFIC(NODE) \
2602 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2603
2604#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2605#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2606#define TYPE_FIELDS(NODE) \
2607 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2608#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2609#define TYPE_ARG_TYPES(NODE) \
2610 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2611#define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2612
2613#define TYPE_MIN_VALUE(NODE) \
2614 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2615#define TYPE_NEXT_PTR_TO(NODE) \
2616 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2617#define TYPE_NEXT_REF_TO(NODE) \
2618 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2619#define TYPE_VFIELD(NODE) \
2620 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2621#define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2622
2623#define TYPE_MAX_VALUE(NODE) \
2624 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2625#define TYPE_METHOD_BASETYPE(NODE) \
2626 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2627#define TYPE_OFFSET_BASETYPE(NODE) \
2628 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2629/* If non-NULL, this is an upper bound of the size (in bytes) of an
2630 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2631 allocated. */
2632#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2633 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2634#define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2635/* For record and union types, information about this type, as a base type
2636 for itself. */
2637#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2638
2639/* For types, used in a language-dependent way. */
2640#define TYPE_LANG_SLOT_1(NODE) \
2641 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2642
2643/* Define accessor macros for information about type inheritance
2644 and basetypes.
2645
2646 A "basetype" means a particular usage of a data type for inheritance
2647 in another type. Each such basetype usage has its own "binfo"
2648 object to describe it. The binfo object is a TREE_VEC node.
2649
2650 Inheritance is represented by the binfo nodes allocated for a
2651 given type. For example, given types C and D, such that D is
2652 inherited by C, 3 binfo nodes will be allocated: one for describing
2653 the binfo properties of C, similarly one for D, and one for
2654 describing the binfo properties of D as a base type for C.
2655 Thus, given a pointer to class C, one can get a pointer to the binfo
2656 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2657
2658/* BINFO specific flags. */
2659
2660/* Nonzero means that the derivation chain is via a `virtual' declaration. */
2661#define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2662
2663/* Flags for language dependent use. */
2664#define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2665#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2666#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2667#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2668#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2669#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2670#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2671
2672/* The actual data type node being inherited in this basetype. */
2673#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2674
2675/* The offset where this basetype appears in its containing type.
2676 BINFO_OFFSET slot holds the offset (in bytes)
2677 from the base of the complete object to the base of the part of the
2678 object that is allocated on behalf of this `type'.
2679 This is always 0 except when there is multiple inheritance. */
2680
2681#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2682#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2683
2684/* The virtual function table belonging to this basetype. Virtual
2685 function tables provide a mechanism for run-time method dispatching.
2686 The entries of a virtual function table are language-dependent. */
2687
2688#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2689
2690/* The virtual functions in the virtual function table. This is
2691 a TREE_LIST that is used as an initial approximation for building
2692 a virtual function table for this basetype. */
2693#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2694
2695/* A vector of binfos for the direct basetypes inherited by this
2696 basetype.
2697
2698 If this basetype describes type D as inherited in C, and if the
2699 basetypes of D are E and F, then this vector contains binfos for
2700 inheritance of E and F by C. */
2701#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2702
2703/* The number of basetypes for NODE. */
2704#define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2705
2706/* Accessor macro to get to the Nth base binfo of this binfo. */
2707#define BINFO_BASE_BINFO(NODE,N) \
2708 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2709#define BINFO_BASE_ITERATE(NODE,N,B) \
2710 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2711#define BINFO_BASE_APPEND(NODE,T) \
2712 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2713
2714/* For a BINFO record describing a virtual base class, i.e., one where
2715 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2716 base. The actual contents are language-dependent. In the C++
2717 front-end this field is an INTEGER_CST giving an offset into the
2718 vtable where the offset to the virtual base can be found. */
2719#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2720
2721/* Indicates the accesses this binfo has to its bases. The values are
2722 access_public_node, access_protected_node or access_private_node.
2723 If this array is not present, public access is implied. */
2724#define BINFO_BASE_ACCESSES(NODE) \
2725 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2726
2727#define BINFO_BASE_ACCESS(NODE,N) \
2728 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2729#define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2730 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2731
2732/* The index in the VTT where this subobject's sub-VTT can be found.
2733 NULL_TREE if there is no sub-VTT. */
2734#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2735
2736/* The index in the VTT where the vptr for this subobject can be
2737 found. NULL_TREE if there is no secondary vptr in the VTT. */
2738#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2739
2740/* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2741 inheriting this base for non-virtual bases. For virtual bases it
2742 points either to the binfo for which this is a primary binfo, or to
2743 the binfo of the most derived type. */
2744#define BINFO_INHERITANCE_CHAIN(NODE) \
2745 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2746
2747
2748/* Define fields and accessors for nodes representing declared names. */
2749
2750/* Nonzero if DECL represents an SSA name or a variable that can possibly
2751 have an associated SSA name. */
2752#define SSA_VAR_P(DECL) \
2753 (TREE_CODE (DECL) == VAR_DECL \
2754 || TREE_CODE (DECL) == PARM_DECL \
2755 || TREE_CODE (DECL) == RESULT_DECL \
2756 || TREE_CODE (DECL) == SSA_NAME)
2757
2758
2759#define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2760
2761/* This is the name of the object as written by the user.
2762 It is an IDENTIFIER_NODE. */
2763#define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2764
2765/* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2766#define TYPE_IDENTIFIER(NODE) \
2767 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2768 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2769
2770/* Every ..._DECL node gets a unique number. */
2771#define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2772
2773/* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2774 uses. */
2775#define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2776
2777/* Every ..._DECL node gets a unique number that stays the same even
2778 when the decl is copied by the inliner once it is set. */
2779#define DECL_PT_UID(NODE) \
2780 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2781 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2782/* Initialize the ..._DECL node pt-uid to the decls uid. */
2783#define SET_DECL_PT_UID(NODE, UID) \
2784 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2785/* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2786 be preserved when copyin the decl. */
2787#define DECL_PT_UID_SET_P(NODE) \
2788 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2789
2790/* These two fields describe where in the source code the declaration
2791 was. If the declaration appears in several places (as for a C
2792 function that is declared first and then defined later), this
2793 information should refer to the definition. */
2794#define DECL_SOURCE_LOCATION(NODE) \
2795 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2796#define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2797#define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2798#define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2799/* This decl was created by a front-end or back-end rather than by
2800 user code, and has not been explicitly declared by the user -- when
2801 that happens the source location is updated to the user's
2802 source. This includes decls with no location (!). */
2803#define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2804 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2805
2806/* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2807 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2808 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2809 nodes, this points to either the FUNCTION_DECL for the containing
2810 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2811 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2812 scope". In particular, for VAR_DECLs which are virtual table pointers
2813 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2814 they belong to. */
2815#define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2816#define DECL_FIELD_CONTEXT(NODE) \
2817 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2818
2819/* If nonzero, decl's name shouldn't be emitted into debug info. */
2820#define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2821
2822/* For any sort of a ..._DECL node, this points to the original (abstract)
2823 decl node which this decl is an inlined/cloned instance of, or else it
2824 is NULL indicating that this decl is not an instance of some other decl.
2825
2826 The C front-end also uses this in a nested declaration of an inline
2827 function, to point back to the definition. */
2828#define DECL_ABSTRACT_ORIGIN(NODE) \
2829 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2830
2831/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2832 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2833#define DECL_ORIGIN(NODE) \
2834 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2835
2836/* Nonzero for any sort of ..._DECL node means this decl node represents an
2837 inline instance of some original (abstract) decl from an inline function;
2838 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2839 nodes can also have their abstract origin set to themselves. */
2840#define DECL_FROM_INLINE(NODE) \
2841 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2842 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2843
2844/* In a DECL this is the field where attributes are stored. */
2845#define DECL_ATTRIBUTES(NODE) \
2846 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2847
2848/* For a FUNCTION_DECL, holds the tree of BINDINGs.
2849 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2850 For a VAR_DECL, holds the initial value.
2851 For a PARM_DECL, used for DECL_ARG_TYPE--default
2852 values for parameters are encoded in the type of the function,
2853 not in the PARM_DECL slot.
2854 For a FIELD_DECL, this is used for enumeration values and the C
2855 frontend uses it for temporarily storing bitwidth of bitfields.
2856
2857 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2858#define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2859
2860/* Holds the size of the datum, in bits, as a tree expression.
2861 Need not be constant and may be null. May be less than TYPE_SIZE
2862 for a C++ FIELD_DECL representing a base class subobject with its
2863 own virtual base classes (which are laid out separately). */
2864#define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2865/* Likewise for the size in bytes. */
2866#define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2867#define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2868/* Returns the alignment required for the datum, in bits. It must
2869 be a power of two, but an "alignment" of zero is supported
2870 (e.g. as "uninitialized" sentinel). */
2871#define DECL_ALIGN(NODE) \
2872 (DECL_ALIGN_RAW (NODE) \
2873 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2874/* Specify that DECL_ALIGN(NODE) is X. */
2875#define SET_DECL_ALIGN(NODE, X) \
2876 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2877
2878/* The minimum alignment necessary for the datum, in bits, without
2879 warning. */
2880#define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2881 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2882#define DECL_WARN_IF_NOT_ALIGN(NODE) \
2883 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2884 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2885
2886/* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2887#define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2888 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2889
2890/* The alignment of NODE, in bytes. */
2891#define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2892/* Set if the alignment of this DECL has been set by the user, for
2893 example with an 'aligned' attribute. */
2894#define DECL_USER_ALIGN(NODE) \
2895 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2896/* Holds the machine mode corresponding to the declaration of a variable or
2897 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2898 FIELD_DECL. */
2899#define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2900#define SET_DECL_MODE(NODE, MODE) \
2901 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2902
2903/* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2904 operation it is. This is only intended for low-level accesses;
2905 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2906 should be used instead. */
2907#define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2908 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2909
2910/* Test if FCODE is a function code for an alloca operation. */
2911#define ALLOCA_FUNCTION_CODE_P(FCODE) \
2912 ((FCODE) == BUILT_IN_ALLOCA \
2913 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2914 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2915
2916/* Generate case for an alloca operation. */
2917#define CASE_BUILT_IN_ALLOCA \
2918 case BUILT_IN_ALLOCA: \
2919 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2920 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2921
2922#define DECL_FUNCTION_PERSONALITY(NODE) \
2923 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2924
2925/* Nonzero for a given ..._DECL node means that the name of this node should
2926 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2927 the associated type should be ignored. For a FUNCTION_DECL, the body of
2928 the function should also be ignored. */
2929#define DECL_IGNORED_P(NODE) \
2930 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2931
2932/* Nonzero for a given ..._DECL node means that this node represents an
2933 "abstract instance" of the given declaration (e.g. in the original
2934 declaration of an inline function). When generating symbolic debugging
2935 information, we mustn't try to generate any address information for nodes
2936 marked as "abstract instances" because we don't actually generate
2937 any code or allocate any data space for such instances. */
2938#define DECL_ABSTRACT_P(NODE) \
2939 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2940
2941/* Language-specific decl information. */
2942#define DECL_LANG_SPECIFIC(NODE) \
2943 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2944
2945/* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2946 do not allocate storage, and refer to a definition elsewhere. Note that
2947 this does not necessarily imply the entity represented by NODE
2948 has no program source-level definition in this translation unit. For
2949 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2950 DECL_EXTERNAL may be true simultaneously; that can be the case for
2951 a C99 "extern inline" function. */
2952#define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2953
2954/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2955 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2956
2957 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2958
2959 Also set in some languages for variables, etc., outside the normal
2960 lexical scope, such as class instance variables. */
2961#define DECL_NONLOCAL(NODE) \
2962 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2963
2964/* Used in VAR_DECLs to indicate that the variable is a vtable.
2965 Used in FIELD_DECLs for vtable pointers.
2966 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2967#define DECL_VIRTUAL_P(NODE) \
2968 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2969
2970/* Used to indicate that this DECL represents a compiler-generated entity. */
2971#define DECL_ARTIFICIAL(NODE) \
2972 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2973
2974/* Additional flags for language-specific uses. */
2975#define DECL_LANG_FLAG_0(NODE) \
2976 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2977#define DECL_LANG_FLAG_1(NODE) \
2978 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2979#define DECL_LANG_FLAG_2(NODE) \
2980 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2981#define DECL_LANG_FLAG_3(NODE) \
2982 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2983#define DECL_LANG_FLAG_4(NODE) \
2984 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2985#define DECL_LANG_FLAG_5(NODE) \
2986 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2987#define DECL_LANG_FLAG_6(NODE) \
2988 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2989#define DECL_LANG_FLAG_7(NODE) \
2990 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2991#define DECL_LANG_FLAG_8(NODE) \
2992 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2993
2994/* Nonzero for a scope which is equal to file scope. */
2995#define SCOPE_FILE_SCOPE_P(EXP) \
2996 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2997/* Nonzero for a decl which is at file scope. */
2998#define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2999/* Nonzero for a type which is at file scope. */
3000#define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
3001
3002/* Nonzero for a decl that is decorated using attribute used.
3003 This indicates to compiler tools that this decl needs to be preserved. */
3004#define DECL_PRESERVE_P(DECL) \
3005 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
3006
3007/* Nonzero for a decl that is decorated with the "noinit" attribute.
3008 decls with this attribute are placed into the ".noinit" section, so they are
3009 not initialized by the target's startup code. */
3010#define DECL_NOINIT_P(DECL) \
3011 (DECL_P (DECL) \
3012 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
3013
3014/* Nonzero for a decl that is decorated with the "persistent" attribute.
3015 decls with this attribute are placed into the ".persistent" section, so they
3016 are not initialized by the target's startup code. */
3017#define DECL_PERSISTENT_P(DECL) \
3018 (DECL_P (DECL) \
3019 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
3020
3021/* For function local variables indicates that the variable
3022 should not be treated as a GIMPLE register. In particular
3023 this means that partial definitions can appear and the
3024 variable cannot be written into SSA form and instead uses
3025 virtual operands to represent the use-def dataflow. */
3026#define DECL_NOT_GIMPLE_REG_P(DECL) \
3027 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
3028
3029extern tree decl_value_expr_lookup (tree);
3030extern void decl_value_expr_insert (tree, tree);
3031
3032/* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
3033 if transformations have made this more complicated than evaluating the
3034 decl itself. */
3035#define DECL_HAS_VALUE_EXPR_P(NODE) \
3036 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
3037 ->decl_common.decl_flag_2)
3038#define DECL_VALUE_EXPR(NODE) \
3039 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
3040#define SET_DECL_VALUE_EXPR(NODE, VAL) \
3041 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
3042
3043/* Holds the RTL expression for the value of a variable or function.
3044 This value can be evaluated lazily for functions, variables with
3045 static storage duration, and labels. */
3046#define DECL_RTL(NODE) \
3047 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
3048 ? (NODE)->decl_with_rtl.rtl \
3049 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
3050
3051/* Set the DECL_RTL for NODE to RTL. */
3052#define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
3053
3054/* Returns nonzero if NODE is a tree node that can contain RTL. */
3055#define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
3056
3057/* Returns nonzero if the DECL_RTL for NODE has already been set. */
3058#define DECL_RTL_SET_P(NODE) \
3059 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
3060
3061/* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
3062 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
3063#define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
3064 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
3065 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
3066
3067/* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
3068#define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
3069
3070#if (GCC_VERSION >= 2007)
3071#define DECL_RTL_KNOWN_SET(decl) __extension__ \
3072({ tree const __d = (decl); \
3073 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
3074 /* Dereference it so the compiler knows it can't be NULL even \
3075 without assertion checking. */ \
3076 &*DECL_RTL_IF_SET (__d); })
3077#else
3078#define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
3079#endif
3080
3081/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
3082#define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
3083
3084/* In a FIELD_DECL, this is the field position, counting in bytes, of the
3085 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
3086 of the structure. */
3087#define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
3088
3089/* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
3090 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
3091 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
3092 natural alignment of the field's type). */
3093#define DECL_FIELD_BIT_OFFSET(NODE) \
3094 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
3095
3096/* In a FIELD_DECL, this indicates whether the field was a bit-field and
3097 if so, the type that was originally specified for it.
3098 TREE_TYPE may have been modified (in finish_struct). */
3099#define DECL_BIT_FIELD_TYPE(NODE) \
3100 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3101
3102/* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
3103 representative FIELD_DECL. */
3104#define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
3105 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3106
3107/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3108 if nonzero, indicates that the field occupies the type. */
3109#define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3110
3111/* For FIELD_DECLs, off_align holds the number of low-order bits of
3112 DECL_FIELD_OFFSET which are known to be always zero.
3113 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3114 has. */
3115#define DECL_OFFSET_ALIGN(NODE) \
3116 (HOST_WIDE_INT_1U << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3117
3118/* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
3119#define SET_DECL_OFFSET_ALIGN(NODE, X) \
3120 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3121
3122/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3123 which this FIELD_DECL is defined. This information is needed when
3124 writing debugging information about vfield and vbase decls for C++. */
3125#define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3126
3127/* In a FIELD_DECL, indicates this field should be bit-packed. */
3128#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3129
3130/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3131 specially. */
3132#define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3133
3134/* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
3135 like passing/returning containing struct by value.
3136 Set for C++17 empty base artificial FIELD_DECLs as well as
3137 empty [[no_unique_address]] non-static data members. */
3138#define DECL_FIELD_ABI_IGNORED(NODE) \
3139 (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3140#define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
3141 do { \
3142 gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
3143 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3144 } while (0)
3145
3146/* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
3147 removed from the IL since PR42217 until PR101539 and by that changed
3148 the ABI on several targets. This flag is provided so that the backends
3149 can decide on the ABI with zero-width bitfields and emit -Wpsabi
3150 warnings. */
3151#define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
3152 (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3153#define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
3154 do { \
3155 gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
3156 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3157 } while (0)
3158
3159/* Used in a FIELD_DECL to indicate that we cannot form the address of
3160 this component. This makes it possible for Type-Based Alias Analysis
3161 to disambiguate accesses to this field with indirect accesses using
3162 the field's type:
3163
3164 struct S { int i; } s;
3165 int *p;
3166
3167 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3168
3169 From the implementation's viewpoint, the alias set of the type of the
3170 field 'i' (int) will not be recorded as a subset of that of the type of
3171 's' (struct S) in record_component_aliases. The counterpart is that
3172 accesses to s.i must not be given the alias set of the type of 'i'
3173 (int) but instead directly that of the type of 's' (struct S). */
3174#define DECL_NONADDRESSABLE_P(NODE) \
3175 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3176
3177/* Used in a FIELD_DECL to indicate that this field is padding. */
3178#define DECL_PADDING_P(NODE) \
3179 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3180
3181/* Used in a FIELD_DECL to indicate whether this field is not a flexible
3182 array member. This is only valid for the last array type field of a
3183 structure. */
3184#define DECL_NOT_FLEXARRAY(NODE) \
3185 (FIELD_DECL_CHECK (NODE)->decl_common.decl_not_flexarray)
3186
3187/* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3188 dense, unique within any one function, and may be used to index arrays.
3189 If the value is -1, then no UID has been assigned. */
3190#define LABEL_DECL_UID(NODE) \
3191 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3192
3193/* In a LABEL_DECL, the EH region number for which the label is the
3194 post_landing_pad. */
3195#define EH_LANDING_PAD_NR(NODE) \
3196 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3197
3198/* For a PARM_DECL, records the data type used to pass the argument,
3199 which may be different from the type seen in the program. */
3200#define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3201
3202/* For PARM_DECL, holds an RTL for the stack slot or register
3203 where the data was actually passed. */
3204#define DECL_INCOMING_RTL(NODE) \
3205 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3206
3207/* Nonzero for a given ..._DECL node means that no warnings should be
3208 generated just because this node is unused. */
3209#define DECL_IN_SYSTEM_HEADER(NODE) \
3210 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3211
3212/* Used to indicate that the linkage status of this DECL is not yet known,
3213 so it should not be output now. */
3214#define DECL_DEFER_OUTPUT(NODE) \
3215 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3216
3217/* In a VAR_DECL that's static,
3218 nonzero if the space is in the text section. */
3219#define DECL_IN_TEXT_SECTION(NODE) \
3220 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3221
3222/* In a VAR_DECL that's static,
3223 nonzero if it belongs to the global constant pool. */
3224#define DECL_IN_CONSTANT_POOL(NODE) \
3225 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3226
3227/* Nonzero for a given ..._DECL node means that this node should be
3228 put in .common, if possible. If a DECL_INITIAL is given, and it
3229 is not error_mark_node, then the decl cannot be put in .common. */
3230#define DECL_COMMON(NODE) \
3231 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3232
3233/* In a VAR_DECL, nonzero if the decl is a register variable with
3234 an explicit asm specification. */
3235#define DECL_HARD_REGISTER(NODE) \
3236 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3237
3238 /* Used to indicate that this DECL has weak linkage. */
3239#define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3240
3241/* Used to indicate that the DECL is a dllimport. */
3242#define DECL_DLLIMPORT_P(NODE) \
3243 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3244
3245/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3246 not be put out unless it is needed in this translation unit.
3247 Entities like this are shared across translation units (like weak
3248 entities), but are guaranteed to be generated by any translation
3249 unit that needs them, and therefore need not be put out anywhere
3250 where they are not needed. DECL_COMDAT is just a hint to the
3251 back-end; it is up to front-ends which set this flag to ensure
3252 that there will never be any harm, other than bloat, in putting out
3253 something which is DECL_COMDAT. */
3254#define DECL_COMDAT(NODE) \
3255 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3256
3257#define DECL_COMDAT_GROUP(NODE) \
3258 decl_comdat_group (NODE)
3259
3260/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3261 multiple translation units should be merged. */
3262#define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3263 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3264
3265/* The name of the object as the assembler will see it (but before any
3266 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3267 as DECL_NAME. It is an IDENTIFIER_NODE.
3268
3269 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3270 One Definition Rule based type merging at LTO. It is computed only for
3271 LTO compilation and C++. */
3272#define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3273
3274/* Raw accessor for DECL_ASSEMBLE_NAME. */
3275#define DECL_ASSEMBLER_NAME_RAW(NODE) \
3276 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3277
3278/* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3279 This is true of all DECL nodes except FIELD_DECL. */
3280#define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3281 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3282
3283/* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3284 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3285 yet. */
3286#define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3287 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3288
3289/* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3290#define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3291 overwrite_decl_assembler_name (NODE, NAME)
3292
3293/* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3294 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3295 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3296 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3297 other words, the semantics of using this macro, are different than
3298 saying:
3299
3300 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3301
3302 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3303
3304#define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3305 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3306
3307/* Records the section name in a section attribute. Used to pass
3308 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3309#define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3310
3311/* Nonzero in a decl means that the gimplifier has seen (or placed)
3312 this variable in a BIND_EXPR. */
3313#define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3314 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3315
3316/* Value of the decls's visibility attribute */
3317#define DECL_VISIBILITY(NODE) \
3318 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3319
3320/* Nonzero means that the decl (or an enclosing scope) had its
3321 visibility specified rather than being inferred. */
3322#define DECL_VISIBILITY_SPECIFIED(NODE) \
3323 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3324
3325/* In a VAR_DECL, the model to use if the data should be allocated from
3326 thread-local storage. */
3327#define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3328
3329/* In a VAR_DECL, nonzero if the data should be allocated from
3330 thread-local storage. */
3331#define DECL_THREAD_LOCAL_P(NODE) \
3332 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3333
3334/* In a non-local VAR_DECL with static storage duration, true if the
3335 variable has an initialization priority. If false, the variable
3336 will be initialized at the DEFAULT_INIT_PRIORITY. */
3337#define DECL_HAS_INIT_PRIORITY_P(NODE) \
3338 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3339
3340extern tree decl_debug_expr_lookup (tree);
3341extern void decl_debug_expr_insert (tree, tree);
3342
3343/* For VAR_DECL, this is set to an expression that it was split from. */
3344#define DECL_HAS_DEBUG_EXPR_P(NODE) \
3345 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3346#define DECL_DEBUG_EXPR(NODE) \
3347 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3348
3349#define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3350 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3351
3352extern priority_type decl_init_priority_lookup (tree);
3353extern priority_type decl_fini_priority_lookup (tree);
3354extern void decl_init_priority_insert (tree, priority_type);
3355extern void decl_fini_priority_insert (tree, priority_type);
3356
3357/* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3358 NODE. */
3359#define DECL_INIT_PRIORITY(NODE) \
3360 (decl_init_priority_lookup (NODE))
3361/* Set the initialization priority for NODE to VAL. */
3362#define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3363 (decl_init_priority_insert (NODE, VAL))
3364
3365/* For a FUNCTION_DECL the finalization priority of NODE. */
3366#define DECL_FINI_PRIORITY(NODE) \
3367 (decl_fini_priority_lookup (NODE))
3368/* Set the finalization priority for NODE to VAL. */
3369#define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3370 (decl_fini_priority_insert (NODE, VAL))
3371
3372/* The initialization priority for entities for which no explicit
3373 initialization priority has been specified. */
3374#define DEFAULT_INIT_PRIORITY 65535
3375
3376/* The maximum allowed initialization priority. */
3377#define MAX_INIT_PRIORITY 65535
3378
3379/* The largest priority value reserved for use by system runtime
3380 libraries. */
3381#define MAX_RESERVED_INIT_PRIORITY 100
3382
3383/* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3384#define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3385 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3386
3387/* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3388#define DECL_NONLOCAL_FRAME(NODE) \
3389 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3390
3391/* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3392#define DECL_NONALIASED(NODE) \
3393 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3394
3395/* In a VAR_DECL, nonzero if this variable is not required to have a distinct
3396 address from other variables with the same constant value. In other words,
3397 consider -fmerge-all-constants to be on for this VAR_DECL. */
3398#define DECL_MERGEABLE(NODE) \
3399 (VAR_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3400
3401/* This field is used to reference anything in decl.result and is meant only
3402 for use by the garbage collector. */
3403#define DECL_RESULT_FLD(NODE) \
3404 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3405
3406/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3407 Before the struct containing the FUNCTION_DECL is laid out,
3408 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3409 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3410 function. When the class is laid out, this pointer is changed
3411 to an INTEGER_CST node which is suitable for use as an index
3412 into the virtual function table. */
3413#define DECL_VINDEX(NODE) \
3414 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3415
3416/* In FUNCTION_DECL, holds the decl for the return value. */
3417#define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3418
3419/* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3420#define DECL_UNINLINABLE(NODE) \
3421 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3422
3423/* In a FUNCTION_DECL, the saved representation of the body of the
3424 entire function. */
3425#define DECL_SAVED_TREE(NODE) \
3426 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3427
3428/* Nonzero in a FUNCTION_DECL means this function should be treated
3429 as if it were a malloc, meaning it returns a pointer that is
3430 not an alias. */
3431#define DECL_IS_MALLOC(NODE) \
3432 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3433
3434/* Macro for direct set and get of function_decl.decl_type. */
3435#define FUNCTION_DECL_DECL_TYPE(NODE) \
3436 (NODE->function_decl.decl_type)
3437
3438/* Set decl_type of a DECL. Set it to T when SET is true, or reset
3439 it to NONE. */
3440
3441inline void
3442set_function_decl_type (tree decl, function_decl_type t, bool set)
3443{
3444 if (set)
3445 {
3446 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl) == function_decl_type::NONE
3447 || FUNCTION_DECL_DECL_TYPE (decl) == t);
3448 FUNCTION_DECL_DECL_TYPE (decl) = t;
3449 }
3450 else if (FUNCTION_DECL_DECL_TYPE (decl) == t)
3451 FUNCTION_DECL_DECL_TYPE (decl) = function_decl_type::NONE;
3452}
3453
3454/* Nonzero in a FUNCTION_DECL means this function is a replaceable
3455 function (like replaceable operators new or delete). */
3456#define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3457 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3458
3459/* Nonzero in a FUNCTION_DECL means this function should be treated as
3460 C++ operator new, meaning that it returns a pointer for which we
3461 should not use type based aliasing. */
3462#define DECL_IS_OPERATOR_NEW_P(NODE) \
3463 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3464 == function_decl_type::OPERATOR_NEW)
3465
3466#define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3467 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3468
3469#define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3470 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3471 function_decl_type::OPERATOR_NEW, VAL)
3472
3473/* Nonzero in a FUNCTION_DECL means this function should be treated as
3474 C++ operator delete. */
3475#define DECL_IS_OPERATOR_DELETE_P(NODE) \
3476 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3477 == function_decl_type::OPERATOR_DELETE)
3478
3479#define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3480 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3481 function_decl_type::OPERATOR_DELETE, VAL)
3482
3483/* Nonzero in a FUNCTION_DECL means this function may return more
3484 than once. */
3485#define DECL_IS_RETURNS_TWICE(NODE) \
3486 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3487
3488/* Nonzero in a FUNCTION_DECL means this function should be treated
3489 as "pure" function (like const function, but may read global memory).
3490 Note that being pure or const for a function is orthogonal to being
3491 nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3492 cleared. */
3493#define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3494
3495/* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3496 the const or pure function may not terminate. When this is nonzero
3497 for a const or pure function, it can be dealt with by cse passes
3498 but cannot be removed by dce passes since you are not allowed to
3499 change an infinite looping program into one that terminates without
3500 error. */
3501#define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3502 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3503
3504/* Nonzero in a FUNCTION_DECL means this function should be treated
3505 as "novops" function (function that does not read global memory,
3506 but may have arbitrary side effects). */
3507#define DECL_IS_NOVOPS(NODE) \
3508 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3509
3510/* Used in FUNCTION_DECLs to indicate that they should be run automatically
3511 at the beginning or end of execution. */
3512#define DECL_STATIC_CONSTRUCTOR(NODE) \
3513 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3514
3515#define DECL_STATIC_DESTRUCTOR(NODE) \
3516(FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3517
3518/* Used in FUNCTION_DECLs to indicate that function entry and exit should
3519 be instrumented with calls to support routines. */
3520#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3521 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3522
3523/* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3524 disabled in this function. */
3525#define DECL_NO_LIMIT_STACK(NODE) \
3526 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3527
3528/* In a FUNCTION_DECL indicates that a static chain is needed. */
3529#define DECL_STATIC_CHAIN(NODE) \
3530 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3531
3532/* Nonzero for a decl that cgraph has decided should be inlined into
3533 at least one call site. It is not meaningful to look at this
3534 directly; always use cgraph_function_possibly_inlined_p. */
3535#define DECL_POSSIBLY_INLINED(DECL) \
3536 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3537
3538/* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3539 such as via the `inline' keyword in C/C++. This flag controls the linkage
3540 semantics of 'inline' */
3541#define DECL_DECLARED_INLINE_P(NODE) \
3542 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3543
3544/* Nonzero in a FUNCTION_DECL means this function should not get
3545 -Winline warnings. */
3546#define DECL_NO_INLINE_WARNING_P(NODE) \
3547 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3548
3549/* Nonzero if a FUNCTION_CODE is a TM load/store. */
3550#define BUILTIN_TM_LOAD_STORE_P(FN) \
3551 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3552
3553/* Nonzero if a FUNCTION_CODE is a TM load. */
3554#define BUILTIN_TM_LOAD_P(FN) \
3555 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3556
3557/* Nonzero if a FUNCTION_CODE is a TM store. */
3558#define BUILTIN_TM_STORE_P(FN) \
3559 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3560
3561#define CASE_BUILT_IN_TM_LOAD(FN) \
3562 case BUILT_IN_TM_LOAD_##FN: \
3563 case BUILT_IN_TM_LOAD_RAR_##FN: \
3564 case BUILT_IN_TM_LOAD_RAW_##FN: \
3565 case BUILT_IN_TM_LOAD_RFW_##FN
3566
3567#define CASE_BUILT_IN_TM_STORE(FN) \
3568 case BUILT_IN_TM_STORE_##FN: \
3569 case BUILT_IN_TM_STORE_WAR_##FN: \
3570 case BUILT_IN_TM_STORE_WAW_##FN
3571
3572/* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3573 disregarding size and cost heuristics. This is equivalent to using
3574 the always_inline attribute without the required diagnostics if the
3575 function cannot be inlined. */
3576#define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3577 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3578
3579extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
3580extern vec<tree, va_gc> **decl_debug_args_insert (tree);
3581
3582/* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3583#define DECL_HAS_DEBUG_ARGS_P(NODE) \
3584 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3585
3586/* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3587 that describes the status of this function. */
3588#define DECL_STRUCT_FUNCTION(NODE) \
3589 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3590
3591/* For a builtin function, identify which part of the compiler defined it. */
3592#define DECL_BUILT_IN_CLASS(NODE) \
3593 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3594
3595/* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3596#define DECL_ARGUMENTS(NODE) \
3597 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3598
3599/* In FUNCTION_DECL, the function specific target options to use when compiling
3600 this function. */
3601#define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3602 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3603
3604/* In FUNCTION_DECL, the function specific optimization options to use when
3605 compiling this function. */
3606#define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3607 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3608
3609/* In FUNCTION_DECL, this is set if this function has other versions generated
3610 to support different architecture feature sets, e.g. using "target" or
3611 "target_version" attributes. */
3612#define DECL_FUNCTION_VERSIONED(NODE)\
3613 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3614
3615/* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3616 Devirtualization machinery uses this knowledge for determing type of the
3617 object constructed. Also we assume that constructor address is not
3618 important. */
3619#define DECL_CXX_CONSTRUCTOR_P(NODE)\
3620 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3621
3622/* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3623 Devirtualization machinery uses this to track types in destruction. */
3624#define DECL_CXX_DESTRUCTOR_P(NODE)\
3625 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3626
3627/* In FUNCTION_DECL, this is set if this function is a lambda function. */
3628#define DECL_LAMBDA_FUNCTION_P(NODE) \
3629 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) \
3630 == function_decl_type::LAMBDA_FUNCTION)
3631
3632#define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3633 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), \
3634 function_decl_type::LAMBDA_FUNCTION, VAL)
3635
3636/* In FUNCTION_DECL that represent an virtual method this is set when
3637 the method is final. */
3638#define DECL_FINAL_P(NODE)\
3639 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3640
3641/* The source language of the translation-unit. */
3642#define TRANSLATION_UNIT_LANGUAGE(NODE) \
3643 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3644
3645/* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3646
3647/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3648#define DECL_ORIGINAL_TYPE(NODE) \
3649 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3650
3651/* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3652 into stabs. Instead it will generate cross reference ('x') of names.
3653 This uses the same flag as DECL_EXTERNAL. */
3654#define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3655 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3656
3657/* Getter of the imported declaration associated to the
3658 IMPORTED_DECL node. */
3659#define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3660(DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3661
3662/* Getter of the symbol declaration associated with the
3663 NAMELIST_DECL node. */
3664#define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3665 (DECL_INITIAL (NODE))
3666
3667/* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3668 To reduce overhead, the nodes containing the statements are not trees.
3669 This avoids the overhead of tree_common on all linked list elements.
3670
3671 Use the interface in tree-iterator.h to access this node. */
3672
3673#define STATEMENT_LIST_HEAD(NODE) \
3674 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3675#define STATEMENT_LIST_TAIL(NODE) \
3676 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3677
3678#define TREE_OPTIMIZATION(NODE) \
3679 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3680
3681#define TREE_OPTIMIZATION_OPTABS(NODE) \
3682 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3683
3684#define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3685 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3686
3687/* Return a tree node that encapsulates the optimization options in OPTS
3688 and OPTS_SET. */
3689extern tree build_optimization_node (struct gcc_options *opts,
3690 struct gcc_options *opts_set);
3691
3692#define TREE_TARGET_OPTION(NODE) \
3693 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3694
3695#define TREE_TARGET_GLOBALS(NODE) \
3696 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3697
3698/* Return a tree node that encapsulates the target options in OPTS and
3699 OPTS_SET. */
3700extern tree build_target_option_node (struct gcc_options *opts,
3701 struct gcc_options *opts_set);
3702
3703extern void prepare_target_option_nodes_for_pch (void);
3704
3705#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3706
3707inline tree
3708tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3709{
3710 if (TREE_CODE (__t) != __c)
3711 tree_check_failed (__t, __f, __l, __g, __c, 0);
3712 return __t;
3713}
3714
3715inline tree
3716tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3717 enum tree_code __c)
3718{
3719 if (TREE_CODE (__t) == __c)
3720 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3721 return __t;
3722}
3723
3724inline tree
3725tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3726 enum tree_code __c1, enum tree_code __c2)
3727{
3728 if (TREE_CODE (__t) != __c1
3729 && TREE_CODE (__t) != __c2)
3730 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3731 return __t;
3732}
3733
3734inline tree
3735tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3736 enum tree_code __c1, enum tree_code __c2)
3737{
3738 if (TREE_CODE (__t) == __c1
3739 || TREE_CODE (__t) == __c2)
3740 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3741 return __t;
3742}
3743
3744inline tree
3745tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3746 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3747{
3748 if (TREE_CODE (__t) != __c1
3749 && TREE_CODE (__t) != __c2
3750 && TREE_CODE (__t) != __c3)
3751 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3752 return __t;
3753}
3754
3755inline tree
3756tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3757 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3758{
3759 if (TREE_CODE (__t) == __c1
3760 || TREE_CODE (__t) == __c2
3761 || TREE_CODE (__t) == __c3)
3762 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3763 return __t;
3764}
3765
3766inline tree
3767tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3768 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3769 enum tree_code __c4)
3770{
3771 if (TREE_CODE (__t) != __c1
3772 && TREE_CODE (__t) != __c2
3773 && TREE_CODE (__t) != __c3
3774 && TREE_CODE (__t) != __c4)
3775 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3776 return __t;
3777}
3778
3779inline tree
3780tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3781 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3782 enum tree_code __c4)
3783{
3784 if (TREE_CODE (__t) == __c1
3785 || TREE_CODE (__t) == __c2
3786 || TREE_CODE (__t) == __c3
3787 || TREE_CODE (__t) == __c4)
3788 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3789 return __t;
3790}
3791
3792inline tree
3793tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3794 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3795 enum tree_code __c4, enum tree_code __c5)
3796{
3797 if (TREE_CODE (__t) != __c1
3798 && TREE_CODE (__t) != __c2
3799 && TREE_CODE (__t) != __c3
3800 && TREE_CODE (__t) != __c4
3801 && TREE_CODE (__t) != __c5)
3802 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3803 return __t;
3804}
3805
3806inline tree
3807tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3808 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3809 enum tree_code __c4, enum tree_code __c5)
3810{
3811 if (TREE_CODE (__t) == __c1
3812 || TREE_CODE (__t) == __c2
3813 || TREE_CODE (__t) == __c3
3814 || TREE_CODE (__t) == __c4
3815 || TREE_CODE (__t) == __c5)
3816 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3817 return __t;
3818}
3819
3820inline tree
3821tree_check6 (tree __t, const char *__f, int __l, const char *__g,
3822 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3823 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3824{
3825 if (TREE_CODE (__t) != __c1
3826 && TREE_CODE (__t) != __c2
3827 && TREE_CODE (__t) != __c3
3828 && TREE_CODE (__t) != __c4
3829 && TREE_CODE (__t) != __c5
3830 && TREE_CODE (__t) != __c6)
3831 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
3832 0);
3833 return __t;
3834}
3835
3836inline tree
3837tree_not_check6 (tree __t, const char *__f, int __l, const char *__g,
3838 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3839 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3840{
3841 if (TREE_CODE (__t) == __c1
3842 || TREE_CODE (__t) == __c2
3843 || TREE_CODE (__t) == __c3
3844 || TREE_CODE (__t) == __c4
3845 || TREE_CODE (__t) == __c5
3846 || TREE_CODE (__t) == __c6)
3847 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
3848 __c6, 0);
3849 return __t;
3850}
3851
3852inline tree
3853contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3854 const char *__f, int __l, const char *__g)
3855{
3856 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3857 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3858 return __t;
3859}
3860
3861inline tree
3862tree_class_check (tree __t, const enum tree_code_class __class,
3863 const char *__f, int __l, const char *__g)
3864{
3865 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3866 tree_class_check_failed (__t, __class, __f, __l, __g);
3867 return __t;
3868}
3869
3870inline tree
3871tree_range_check (tree __t,
3872 enum tree_code __code1, enum tree_code __code2,
3873 const char *__f, int __l, const char *__g)
3874{
3875 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3876 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3877 return __t;
3878}
3879
3880inline tree
3881omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3882 const char *__f, int __l, const char *__g)
3883{
3884 if (TREE_CODE (__t) != OMP_CLAUSE)
3885 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3886 if (__t->omp_clause.code != __code)
3887 omp_clause_check_failed (__t, __f, __l, __g, __code);
3888 return __t;
3889}
3890
3891inline tree
3892omp_clause_range_check (tree __t,
3893 enum omp_clause_code __code1,
3894 enum omp_clause_code __code2,
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 ((int) __t->omp_clause.code < (int) __code1
3900 || (int) __t->omp_clause.code > (int) __code2)
3901 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3902 return __t;
3903}
3904
3905/* These checks have to be special cased. */
3906
3907inline tree
3908expr_check (tree __t, const char *__f, int __l, const char *__g)
3909{
3910 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3911 if (!IS_EXPR_CODE_CLASS (__c))
3912 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3913 return __t;
3914}
3915
3916/* These checks have to be special cased. */
3917
3918inline tree
3919non_type_check (tree __t, const char *__f, int __l, const char *__g)
3920{
3921 if (TYPE_P (__t))
3922 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3923 return __t;
3924}
3925
3926inline const HOST_WIDE_INT *
3927tree_int_cst_elt_check (const_tree __t, int __i,
3928 const char *__f, int __l, const char *__g)
3929{
3930 if (TREE_CODE (__t) != INTEGER_CST)
3931 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3932 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3933 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3934 __f, __l, __g);
3935 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3936}
3937
3938inline HOST_WIDE_INT *
3939tree_int_cst_elt_check (tree __t, int __i,
3940 const char *__f, int __l, const char *__g)
3941{
3942 if (TREE_CODE (__t) != INTEGER_CST)
3943 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3944 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3945 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3946 __f, __l, __g);
3947 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3948}
3949
3950/* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3951
3952# if GCC_VERSION >= 4006
3953#pragma GCC diagnostic push
3954#pragma GCC diagnostic ignored "-Wstrict-overflow"
3955#endif
3956
3957inline tree *
3958tree_vec_elt_check (tree __t, int __i,
3959 const char *__f, int __l, const char *__g)
3960{
3961 if (TREE_CODE (__t) != TREE_VEC)
3962 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3963 if (__i < 0 || __i >= __t->base.u.length)
3964 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3965 return &CONST_CAST_TREE (__t)->vec.a[__i];
3966}
3967
3968# if GCC_VERSION >= 4006
3969#pragma GCC diagnostic pop
3970#endif
3971
3972inline tree *
3973omp_clause_elt_check (tree __t, int __i,
3974 const char *__f, int __l, const char *__g)
3975{
3976 if (TREE_CODE (__t) != OMP_CLAUSE)
3977 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3978 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3979 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3980 return &__t->omp_clause.ops[__i];
3981}
3982
3983/* These checks have to be special cased. */
3984
3985inline tree
3986any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3987{
3988 if (!ANY_INTEGRAL_TYPE_P (__t))
3989 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3990 INTEGER_TYPE, BITINT_TYPE, 0);
3991 return __t;
3992}
3993
3994inline const_tree
3995tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3996 tree_code __c)
3997{
3998 if (TREE_CODE (__t) != __c)
3999 tree_check_failed (__t, __f, __l, __g, __c, 0);
4000 return __t;
4001}
4002
4003inline const_tree
4004tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
4005 enum tree_code __c)
4006{
4007 if (TREE_CODE (__t) == __c)
4008 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
4009 return __t;
4010}
4011
4012inline const_tree
4013tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
4014 enum tree_code __c1, enum tree_code __c2)
4015{
4016 if (TREE_CODE (__t) != __c1
4017 && TREE_CODE (__t) != __c2)
4018 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
4019 return __t;
4020}
4021
4022inline const_tree
4023tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
4024 enum tree_code __c1, enum tree_code __c2)
4025{
4026 if (TREE_CODE (__t) == __c1
4027 || TREE_CODE (__t) == __c2)
4028 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
4029 return __t;
4030}
4031
4032inline const_tree
4033tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
4034 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
4035{
4036 if (TREE_CODE (__t) != __c1
4037 && TREE_CODE (__t) != __c2
4038 && TREE_CODE (__t) != __c3)
4039 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
4040 return __t;
4041}
4042
4043inline const_tree
4044tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
4045 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
4046{
4047 if (TREE_CODE (__t) == __c1
4048 || TREE_CODE (__t) == __c2
4049 || TREE_CODE (__t) == __c3)
4050 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
4051 return __t;
4052}
4053
4054inline const_tree
4055tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
4056 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4057 enum tree_code __c4)
4058{
4059 if (TREE_CODE (__t) != __c1
4060 && TREE_CODE (__t) != __c2
4061 && TREE_CODE (__t) != __c3
4062 && TREE_CODE (__t) != __c4)
4063 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
4064 return __t;
4065}
4066
4067inline const_tree
4068tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
4069 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4070 enum tree_code __c4)
4071{
4072 if (TREE_CODE (__t) == __c1
4073 || TREE_CODE (__t) == __c2
4074 || TREE_CODE (__t) == __c3
4075 || TREE_CODE (__t) == __c4)
4076 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
4077 return __t;
4078}
4079
4080inline const_tree
4081tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4082 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4083 enum tree_code __c4, enum tree_code __c5)
4084{
4085 if (TREE_CODE (__t) != __c1
4086 && TREE_CODE (__t) != __c2
4087 && TREE_CODE (__t) != __c3
4088 && TREE_CODE (__t) != __c4
4089 && TREE_CODE (__t) != __c5)
4090 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4091 return __t;
4092}
4093
4094inline const_tree
4095tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
4096 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4097 enum tree_code __c4, enum tree_code __c5)
4098{
4099 if (TREE_CODE (__t) == __c1
4100 || TREE_CODE (__t) == __c2
4101 || TREE_CODE (__t) == __c3
4102 || TREE_CODE (__t) == __c4
4103 || TREE_CODE (__t) == __c5)
4104 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
4105 return __t;
4106}
4107
4108inline const_tree
4109tree_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4110 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4111 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4112{
4113 if (TREE_CODE (__t) != __c1
4114 && TREE_CODE (__t) != __c2
4115 && TREE_CODE (__t) != __c3
4116 && TREE_CODE (__t) != __c4
4117 && TREE_CODE (__t) != __c5
4118 && TREE_CODE (__t) != __c6)
4119 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
4120 0);
4121 return __t;
4122}
4123
4124inline const_tree
4125tree_not_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4126 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4127 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4128{
4129 if (TREE_CODE (__t) == __c1
4130 || TREE_CODE (__t) == __c2
4131 || TREE_CODE (__t) == __c3
4132 || TREE_CODE (__t) == __c4
4133 || TREE_CODE (__t) == __c5
4134 || TREE_CODE (__t) == __c6)
4135 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
4136 __c6, 0);
4137 return __t;
4138}
4139
4140inline const_tree
4141contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
4142 const char *__f, int __l, const char *__g)
4143{
4144 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
4145 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
4146 return __t;
4147}
4148
4149inline const_tree
4150tree_class_check (const_tree __t, const enum tree_code_class __class,
4151 const char *__f, int __l, const char *__g)
4152{
4153 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
4154 tree_class_check_failed (__t, __class, __f, __l, __g);
4155 return __t;
4156}
4157
4158inline const_tree
4159tree_range_check (const_tree __t,
4160 enum tree_code __code1, enum tree_code __code2,
4161 const char *__f, int __l, const char *__g)
4162{
4163 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
4164 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4165 return __t;
4166}
4167
4168inline const_tree
4169omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
4170 const char *__f, int __l, const char *__g)
4171{
4172 if (TREE_CODE (__t) != OMP_CLAUSE)
4173 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4174 if (__t->omp_clause.code != __code)
4175 omp_clause_check_failed (__t, __f, __l, __g, __code);
4176 return __t;
4177}
4178
4179inline const_tree
4180omp_clause_range_check (const_tree __t,
4181 enum omp_clause_code __code1,
4182 enum omp_clause_code __code2,
4183 const char *__f, int __l, const char *__g)
4184{
4185 if (TREE_CODE (__t) != OMP_CLAUSE)
4186 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4187 if ((int) __t->omp_clause.code < (int) __code1
4188 || (int) __t->omp_clause.code > (int) __code2)
4189 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4190 return __t;
4191}
4192
4193inline const_tree
4194expr_check (const_tree __t, const char *__f, int __l, const char *__g)
4195{
4196 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
4197 if (!IS_EXPR_CODE_CLASS (__c))
4198 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
4199 return __t;
4200}
4201
4202inline const_tree
4203non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
4204{
4205 if (TYPE_P (__t))
4206 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
4207 return __t;
4208}
4209
4210# if GCC_VERSION >= 4006
4211#pragma GCC diagnostic push
4212#pragma GCC diagnostic ignored "-Wstrict-overflow"
4213#endif
4214
4215inline const_tree *
4216tree_vec_elt_check (const_tree __t, int __i,
4217 const char *__f, int __l, const char *__g)
4218{
4219 if (TREE_CODE (__t) != TREE_VEC)
4220 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
4221 if (__i < 0 || __i >= __t->base.u.length)
4222 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
4223 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
4224 //return &__t->vec.a[__i];
4225}
4226
4227# if GCC_VERSION >= 4006
4228#pragma GCC diagnostic pop
4229#endif
4230
4231inline const_tree *
4232omp_clause_elt_check (const_tree __t, int __i,
4233 const char *__f, int __l, const char *__g)
4234{
4235 if (TREE_CODE (__t) != OMP_CLAUSE)
4236 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4237 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
4238 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
4239 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
4240}
4241
4242inline const_tree
4243any_integral_type_check (const_tree __t, const char *__f, int __l,
4244 const char *__g)
4245{
4246 if (!ANY_INTEGRAL_TYPE_P (__t))
4247 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
4248 INTEGER_TYPE, BITINT_TYPE, 0);
4249 return __t;
4250}
4251
4252#endif
4253
4254/* Compute the number of operands in an expression node NODE. For
4255 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4256 otherwise it is looked up from the node's code. */
4257inline int
4258tree_operand_length (const_tree node)
4259{
4260 if (VL_EXP_CLASS_P (node))
4261 return VL_EXP_OPERAND_LENGTH (node);
4262 else
4263 return TREE_CODE_LENGTH (TREE_CODE (node));
4264}
4265
4266#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4267
4268/* Special checks for TREE_OPERANDs. */
4269inline tree *
4270tree_operand_check (tree __t, int __i,
4271 const char *__f, int __l, const char *__g)
4272{
4273 const_tree __u = EXPR_CHECK (__t);
4274 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4275 tree_operand_check_failed (__i, __u, __f, __l, __g);
4276 return &CONST_CAST_TREE (__u)->exp.operands[__i];
4277}
4278
4279inline tree *
4280tree_operand_check_code (tree __t, enum tree_code __code, int __i,
4281 const char *__f, int __l, const char *__g)
4282{
4283 if (TREE_CODE (__t) != __code)
4284 tree_check_failed (__t, __f, __l, __g, __code, 0);
4285 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4286 tree_operand_check_failed (__i, __t, __f, __l, __g);
4287 return &__t->exp.operands[__i];
4288}
4289
4290inline const_tree *
4291tree_operand_check (const_tree __t, int __i,
4292 const char *__f, int __l, const char *__g)
4293{
4294 const_tree __u = EXPR_CHECK (__t);
4295 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4296 tree_operand_check_failed (__i, __u, __f, __l, __g);
4297 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
4298}
4299
4300inline const_tree *
4301tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
4302 const char *__f, int __l, const char *__g)
4303{
4304 if (TREE_CODE (__t) != __code)
4305 tree_check_failed (__t, __f, __l, __g, __code, 0);
4306 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4307 tree_operand_check_failed (__i, __t, __f, __l, __g);
4308 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
4309}
4310
4311#endif
4312
4313/* True iff an identifier matches a C string. */
4314
4315inline bool
4316id_equal (const_tree id, const char *str)
4317{
4318 return !strcmp (IDENTIFIER_POINTER (id), s2: str);
4319}
4320
4321inline bool
4322id_equal (const char *str, const_tree id)
4323{
4324 return id_equal (id, str);
4325}
4326
4327/* Return the number of elements in the VECTOR_TYPE given by NODE. */
4328
4329inline poly_uint64
4330TYPE_VECTOR_SUBPARTS (const_tree node)
4331{
4332 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4333 unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision;
4334 if (NUM_POLY_INT_COEFFS == 2)
4335 {
4336 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4337 description of the encoding. */
4338 poly_uint64 res = 0;
4339 res.coeffs[0] = HOST_WIDE_INT_1U << (precision & 0xff);
4340 if (precision & 0x100)
4341 res.coeffs[1] = HOST_WIDE_INT_1U << (precision & 0xff);
4342 return res;
4343 }
4344 else
4345 return HOST_WIDE_INT_1U << precision;
4346}
4347
4348/* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4349 satisfy valid_vector_subparts_p. */
4350
4351inline void
4352SET_TYPE_VECTOR_SUBPARTS (tree node, poly_uint64 subparts)
4353{
4354 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4355 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4356 int index = exact_log2 (x: coeff0);
4357 gcc_assert (index >= 0);
4358 if (NUM_POLY_INT_COEFFS == 2)
4359 {
4360 /* We have two coefficients that are each in the range 1 << [0, 63],
4361 so supporting all combinations would require 6 bits per coefficient
4362 and 12 bits in total. Since the precision field is only 10 bits
4363 in size, we need to be more restrictive than that.
4364
4365 At present, coeff[1] is always either 0 (meaning that the number
4366 of units is constant) or equal to coeff[0] (meaning that the number
4367 of units is N + X * N for some target-dependent zero-based runtime
4368 parameter X). We can therefore encode coeff[1] in a single bit.
4369
4370 The most compact encoding would be to use mask 0x3f for coeff[0]
4371 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4372 get slightly more efficient code on some hosts if we instead
4373 treat the shift amount as an independent byte, so here we use
4374 0xff for coeff[0] and 0x100 for coeff[1]. */
4375 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4376 gcc_assert (coeff1 == 0 || coeff1 == coeff0);
4377 VECTOR_TYPE_CHECK (node)->type_common.precision
4378 = index + (coeff1 != 0 ? 0x100 : 0);
4379 }
4380 else
4381 VECTOR_TYPE_CHECK (node)->type_common.precision = index;
4382}
4383
4384/* Return true if we can construct vector types with the given number
4385 of subparts. */
4386
4387inline bool
4388valid_vector_subparts_p (poly_uint64 subparts)
4389{
4390 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4391 if (!pow2p_hwi (x: coeff0))
4392 return false;
4393 if (NUM_POLY_INT_COEFFS == 2)
4394 {
4395 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4396 if (coeff1 != 0 && coeff1 != coeff0)
4397 return false;
4398 }
4399 return true;
4400}
4401
4402/* Return the built-in function that DECL represents, given that it is known
4403 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4404inline built_in_function
4405DECL_FUNCTION_CODE (const_tree decl)
4406{
4407 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4408 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_NORMAL);
4409 return (built_in_function) fndecl.function_code;
4410}
4411
4412/* Return the target-specific built-in function that DECL represents,
4413 given that it is known to be a FUNCTION_DECL with built-in class
4414 BUILT_IN_MD. */
4415inline int
4416DECL_MD_FUNCTION_CODE (const_tree decl)
4417{
4418 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4419 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_MD);
4420 return fndecl.function_code;
4421}
4422
4423/* Return the frontend-specific built-in function that DECL represents,
4424 given that it is known to be a FUNCTION_DECL with built-in class
4425 BUILT_IN_FRONTEND. */
4426inline int
4427DECL_FE_FUNCTION_CODE (const_tree decl)
4428{
4429 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4430 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_FRONTEND);
4431 return fndecl.function_code;
4432}
4433
4434/* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4435 class FCLASS. */
4436inline void
4437set_decl_built_in_function (tree decl, built_in_class fclass,
4438 unsigned int fcode)
4439{
4440 tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4441 fndecl.built_in_class = fclass;
4442 fndecl.function_code = fcode;
4443}
4444
4445/* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4446 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4447inline void
4448copy_decl_built_in_function (tree newdecl, const_tree olddecl)
4449{
4450 tree_function_decl &newfndecl = FUNCTION_DECL_CHECK (newdecl)->function_decl;
4451 const tree_function_decl &oldfndecl
4452 = FUNCTION_DECL_CHECK (olddecl)->function_decl;
4453 newfndecl.built_in_class = oldfndecl.built_in_class;
4454 newfndecl.function_code = oldfndecl.function_code;
4455}
4456
4457/* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4458 wrapper added to express a location_t on behalf of the node's child
4459 (e.g. by maybe_wrap_with_location). */
4460
4461#define EXPR_LOCATION_WRAPPER_P(NODE) \
4462 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4463
4464/* Test if EXP is merely a wrapper node, added to express a location_t
4465 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4466
4467inline bool
4468location_wrapper_p (const_tree exp)
4469{
4470 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4471 the flag EXPR_LOCATION_WRAPPER_P is set.
4472 It normally has the same type as its operand, but it can have a
4473 different one if the type of the operand has changed (e.g. when
4474 merging duplicate decls).
4475
4476 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4477 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4478 if ((TREE_CODE (exp) == NON_LVALUE_EXPR
4479 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4480 && EXPR_LOCATION_WRAPPER_P (exp))
4481 return true;
4482 return false;
4483}
4484
4485/* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4486
4487inline tree
4488tree_strip_any_location_wrapper (tree exp)
4489{
4490 if (location_wrapper_p (exp))
4491 return TREE_OPERAND (exp, 0);
4492 else
4493 return exp;
4494}
4495
4496#define error_mark_node global_trees[TI_ERROR_MARK]
4497
4498#define intQI_type_node global_trees[TI_INTQI_TYPE]
4499#define intHI_type_node global_trees[TI_INTHI_TYPE]
4500#define intSI_type_node global_trees[TI_INTSI_TYPE]
4501#define intDI_type_node global_trees[TI_INTDI_TYPE]
4502#define intTI_type_node global_trees[TI_INTTI_TYPE]
4503
4504#define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4505#define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4506#define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4507#define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4508#define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4509
4510#define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4511#define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4512#define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4513#define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4514#define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4515
4516#define uint16_type_node global_trees[TI_UINT16_TYPE]
4517#define uint32_type_node global_trees[TI_UINT32_TYPE]
4518#define uint64_type_node global_trees[TI_UINT64_TYPE]
4519#define uint128_type_node global_trees[TI_UINT128_TYPE]
4520
4521#define void_node global_trees[TI_VOID]
4522
4523#define integer_zero_node global_trees[TI_INTEGER_ZERO]
4524#define integer_one_node global_trees[TI_INTEGER_ONE]
4525#define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4526#define size_zero_node global_trees[TI_SIZE_ZERO]
4527#define size_one_node global_trees[TI_SIZE_ONE]
4528#define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4529#define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4530#define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4531
4532/* Base access nodes. */
4533#define access_public_node global_trees[TI_PUBLIC]
4534#define access_protected_node global_trees[TI_PROTECTED]
4535#define access_private_node global_trees[TI_PRIVATE]
4536
4537#define null_pointer_node global_trees[TI_NULL_POINTER]
4538
4539#define float_type_node global_trees[TI_FLOAT_TYPE]
4540#define double_type_node global_trees[TI_DOUBLE_TYPE]
4541#define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4542#define bfloat16_type_node global_trees[TI_BFLOAT16_TYPE]
4543
4544/* Nodes for particular _FloatN and _FloatNx types in sequence. */
4545#define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4546#define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4547#define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4548
4549/* Names for individual types (code should normally iterate over all
4550 such types; these are only for back-end use, or in contexts such as
4551 *.def where iteration is not possible). */
4552#define float16_type_node global_trees[TI_FLOAT16_TYPE]
4553#define float32_type_node global_trees[TI_FLOAT32_TYPE]
4554#define float64_type_node global_trees[TI_FLOAT64_TYPE]
4555#define float128_type_node global_trees[TI_FLOAT128_TYPE]
4556#define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4557#define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4558#define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4559
4560/* Type used by certain backends for __float128, which in C++ should be
4561 distinct type from _Float128 for backwards compatibility reasons. */
4562#define float128t_type_node global_trees[TI_FLOAT128T_TYPE]
4563
4564#define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4565#define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4566#define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4567#define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4568
4569#define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4570#define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4571#define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4572#define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4573
4574#define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4575
4576#define void_type_node global_trees[TI_VOID_TYPE]
4577/* The C type `void *'. */
4578#define ptr_type_node global_trees[TI_PTR_TYPE]
4579/* The C type `const void *'. */
4580#define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4581/* The C type `size_t'. */
4582#define size_type_node global_trees[TI_SIZE_TYPE]
4583#define pid_type_node global_trees[TI_PID_TYPE]
4584#define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4585#define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4586#define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4587#define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4588/* The C type `FILE *'. */
4589#define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4590/* The C type `const struct tm *'. */
4591#define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4592/* The C type `fenv_t *'. */
4593#define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4594#define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4595/* The C type `fexcept_t *'. */
4596#define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4597#define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4598#define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4599
4600#define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4601#define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4602#define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4603
4604/* The decimal floating point types. */
4605#define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4606#define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4607#define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4608#define dfloat64x_type_node global_trees[TI_DFLOAT64X_TYPE]
4609
4610/* The fixed-point types. */
4611#define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4612#define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4613#define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4614#define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4615#define sat_unsigned_short_fract_type_node \
4616 global_trees[TI_SAT_USFRACT_TYPE]
4617#define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4618#define sat_unsigned_long_fract_type_node \
4619 global_trees[TI_SAT_ULFRACT_TYPE]
4620#define sat_unsigned_long_long_fract_type_node \
4621 global_trees[TI_SAT_ULLFRACT_TYPE]
4622#define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4623#define fract_type_node global_trees[TI_FRACT_TYPE]
4624#define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4625#define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4626#define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4627#define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4628#define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4629#define unsigned_long_long_fract_type_node \
4630 global_trees[TI_ULLFRACT_TYPE]
4631#define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4632#define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4633#define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4634#define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4635#define sat_unsigned_short_accum_type_node \
4636 global_trees[TI_SAT_USACCUM_TYPE]
4637#define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4638#define sat_unsigned_long_accum_type_node \
4639 global_trees[TI_SAT_ULACCUM_TYPE]
4640#define sat_unsigned_long_long_accum_type_node \
4641 global_trees[TI_SAT_ULLACCUM_TYPE]
4642#define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4643#define accum_type_node global_trees[TI_ACCUM_TYPE]
4644#define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4645#define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4646#define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4647#define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4648#define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4649#define unsigned_long_long_accum_type_node \
4650 global_trees[TI_ULLACCUM_TYPE]
4651#define qq_type_node global_trees[TI_QQ_TYPE]
4652#define hq_type_node global_trees[TI_HQ_TYPE]
4653#define sq_type_node global_trees[TI_SQ_TYPE]
4654#define dq_type_node global_trees[TI_DQ_TYPE]
4655#define tq_type_node global_trees[TI_TQ_TYPE]
4656#define uqq_type_node global_trees[TI_UQQ_TYPE]
4657#define uhq_type_node global_trees[TI_UHQ_TYPE]
4658#define usq_type_node global_trees[TI_USQ_TYPE]
4659#define udq_type_node global_trees[TI_UDQ_TYPE]
4660#define utq_type_node global_trees[TI_UTQ_TYPE]
4661#define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4662#define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4663#define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4664#define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4665#define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4666#define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4667#define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4668#define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4669#define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4670#define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4671#define ha_type_node global_trees[TI_HA_TYPE]
4672#define sa_type_node global_trees[TI_SA_TYPE]
4673#define da_type_node global_trees[TI_DA_TYPE]
4674#define ta_type_node global_trees[TI_TA_TYPE]
4675#define uha_type_node global_trees[TI_UHA_TYPE]
4676#define usa_type_node global_trees[TI_USA_TYPE]
4677#define uda_type_node global_trees[TI_UDA_TYPE]
4678#define uta_type_node global_trees[TI_UTA_TYPE]
4679#define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4680#define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4681#define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4682#define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4683#define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4684#define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4685#define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4686#define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4687
4688/* The node that should be placed at the end of a parameter list to
4689 indicate that the function does not take a variable number of
4690 arguments. The TREE_VALUE will be void_type_node and there will be
4691 no TREE_CHAIN. Language-independent code should not assume
4692 anything else about this node. */
4693#define void_list_node global_trees[TI_VOID_LIST_NODE]
4694
4695#define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4696#define MAIN_NAME_P(NODE) \
4697 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4698
4699/* Optimization options (OPTIMIZATION_NODE) to use for default and current
4700 functions. */
4701#define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4702#define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4703
4704/* Default/current target options (TARGET_OPTION_NODE). */
4705#define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4706#define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4707
4708/* Default tree list option(), optimize() pragmas to be linked into the
4709 attribute list. */
4710#define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4711#define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4712
4713/* SCEV analyzer global shared trees. */
4714#define chrec_not_analyzed_yet NULL_TREE
4715#define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4716#define chrec_known global_trees[TI_CHREC_KNOWN]
4717
4718#define char_type_node integer_types[itk_char]
4719#define signed_char_type_node integer_types[itk_signed_char]
4720#define unsigned_char_type_node integer_types[itk_unsigned_char]
4721#define short_integer_type_node integer_types[itk_short]
4722#define short_unsigned_type_node integer_types[itk_unsigned_short]
4723#define integer_type_node integer_types[itk_int]
4724#define unsigned_type_node integer_types[itk_unsigned_int]
4725#define long_integer_type_node integer_types[itk_long]
4726#define long_unsigned_type_node integer_types[itk_unsigned_long]
4727#define long_long_integer_type_node integer_types[itk_long_long]
4728#define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4729
4730/* True if T is an erroneous expression. */
4731
4732inline bool
4733error_operand_p (const_tree t)
4734{
4735 return (t == error_mark_node
4736 || (t && TREE_TYPE (t) == error_mark_node));
4737}
4738
4739/* Return the number of elements encoded directly in a VECTOR_CST. */
4740
4741inline unsigned int
4742vector_cst_encoded_nelts (const_tree t)
4743{
4744 return VECTOR_CST_NPATTERNS (t) * VECTOR_CST_NELTS_PER_PATTERN (t);
4745}
4746
4747extern tree decl_assembler_name (tree);
4748extern void overwrite_decl_assembler_name (tree decl, tree name);
4749extern tree decl_comdat_group (const_tree);
4750extern tree decl_comdat_group_id (const_tree);
4751extern const char *decl_section_name (const_tree);
4752extern void set_decl_section_name (tree, const char *);
4753extern void set_decl_section_name (tree, const_tree);
4754extern enum tls_model decl_tls_model (const_tree);
4755extern void set_decl_tls_model (tree, enum tls_model);
4756
4757/* Compute the number of bytes occupied by 'node'. This routine only
4758 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4759
4760extern size_t tree_size (const_tree);
4761
4762/* Compute the number of bytes occupied by a tree with code CODE.
4763 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4764 which are of variable length. */
4765extern size_t tree_code_size (enum tree_code);
4766
4767/* Allocate and return a new UID from the DECL_UID namespace. */
4768extern int allocate_decl_uid (void);
4769
4770/* Lowest level primitive for allocating a node.
4771 The TREE_CODE is the only argument. Contents are initialized
4772 to zero except for a few of the common fields. */
4773
4774extern tree make_node (enum tree_code CXX_MEM_STAT_INFO);
4775
4776/* Free tree node. */
4777
4778extern void free_node (tree);
4779
4780/* Make a copy of a node, with all the same contents. */
4781
4782extern tree copy_node (tree CXX_MEM_STAT_INFO);
4783
4784/* Make a copy of a chain of TREE_LIST nodes. */
4785
4786extern tree copy_list (tree);
4787
4788/* Make a CASE_LABEL_EXPR. */
4789
4790extern tree build_case_label (tree, tree, tree);
4791
4792/* Make a BINFO. */
4793extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO);
4794
4795/* Make an INTEGER_CST. */
4796
4797extern tree make_int_cst (int, int CXX_MEM_STAT_INFO);
4798
4799/* Make a TREE_VEC. */
4800
4801extern tree make_tree_vec (int CXX_MEM_STAT_INFO);
4802
4803/* Grow a TREE_VEC. */
4804
4805extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO);
4806
4807/* Treat a TREE_VEC as a range of trees, e.g.
4808 for (tree e : tree_vec_range (v)) { ... } */
4809
4810class tree_vec_range
4811{
4812 tree v;
4813public:
4814 tree_vec_range(tree v) : v(v) { }
4815 tree *begin() { return TREE_VEC_BEGIN (v); }
4816 tree *end() { return TREE_VEC_END (v); }
4817};
4818
4819/* Construct various types of nodes. */
4820
4821extern tree build_nt (enum tree_code, ...);
4822extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
4823
4824extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO);
4825extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO);
4826extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO);
4827extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO);
4828extern tree build4 (enum tree_code, tree, tree, tree, tree,
4829 tree CXX_MEM_STAT_INFO);
4830extern tree build5 (enum tree_code, tree, tree, tree, tree, tree,
4831 tree CXX_MEM_STAT_INFO);
4832
4833/* _loc versions of build[1-5]. */
4834
4835inline tree
4836build1_loc (location_t loc, enum tree_code code, tree type,
4837 tree arg1 CXX_MEM_STAT_INFO)
4838{
4839 tree t = build1 (code, type, arg1 PASS_MEM_STAT);
4840 if (CAN_HAVE_LOCATION_P (t))
4841 SET_EXPR_LOCATION (t, loc);
4842 return t;
4843}
4844
4845inline tree
4846build2_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4847 tree arg1 CXX_MEM_STAT_INFO)
4848{
4849 tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT);
4850 if (CAN_HAVE_LOCATION_P (t))
4851 SET_EXPR_LOCATION (t, loc);
4852 return t;
4853}
4854
4855inline tree
4856build3_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4857 tree arg1, tree arg2 CXX_MEM_STAT_INFO)
4858{
4859 tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4860 if (CAN_HAVE_LOCATION_P (t))
4861 SET_EXPR_LOCATION (t, loc);
4862 return t;
4863}
4864
4865inline tree
4866build4_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4867 tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO)
4868{
4869 tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4870 if (CAN_HAVE_LOCATION_P (t))
4871 SET_EXPR_LOCATION (t, loc);
4872 return t;
4873}
4874
4875inline tree
4876build5_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4877 tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO)
4878{
4879 tree t = build5 (code, type, arg0, arg1, arg2, arg3,
4880 arg4 PASS_MEM_STAT);
4881 if (CAN_HAVE_LOCATION_P (t))
4882 SET_EXPR_LOCATION (t, loc);
4883 return t;
4884}
4885
4886/* Constructs double_int from tree CST. */
4887
4888extern tree double_int_to_tree (tree, double_int);
4889
4890extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst);
4891extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool);
4892
4893/* Create an INT_CST node with a CST value zero extended. */
4894
4895/* static inline */
4896extern tree build_int_cst (tree, poly_int64);
4897extern tree build_int_cstu (tree type, poly_uint64);
4898extern tree build_int_cst_type (tree, poly_int64);
4899extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO);
4900extern tree build_vector_from_ctor (tree, const vec<constructor_elt, va_gc> *);
4901extern tree build_vector_from_val (tree, tree);
4902extern tree build_uniform_cst (tree, tree);
4903extern tree build_vec_series (tree, tree, tree);
4904extern tree build_index_vector (tree, poly_uint64, poly_uint64);
4905extern tree build_vector_a_then_b (tree, unsigned int, tree, tree);
4906extern void recompute_constructor_flags (tree);
4907extern void verify_constructor_flags (tree);
4908extern tree build_constructor (tree, vec<constructor_elt, va_gc> * CXX_MEM_STAT_INFO);
4909extern tree build_constructor_single (tree, tree, tree);
4910extern tree build_constructor_from_list (tree, tree);
4911extern tree build_constructor_from_vec (tree, const vec<tree, va_gc> *);
4912extern tree build_constructor_va (tree, int, ...);
4913extern tree build_clobber (tree, enum clobber_kind = CLOBBER_UNDEF);
4914extern tree build_real_from_int_cst (tree, const_tree);
4915extern tree build_real_from_wide (tree, const wide_int_ref &, signop);
4916extern tree build_complex (tree, tree, tree);
4917extern tree build_complex_inf (tree, bool);
4918extern tree build_each_one_cst (tree);
4919extern tree build_one_cst (tree);
4920extern tree build_minus_one_cst (tree);
4921extern tree build_all_ones_cst (tree);
4922extern tree build_zero_cst (tree);
4923extern tree build_replicated_int_cst (tree, unsigned, HOST_WIDE_INT);
4924extern tree sign_mask_for (tree);
4925extern tree build_string (unsigned, const char * = NULL);
4926extern tree build_poly_int_cst (tree, const poly_wide_int_ref &);
4927extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO);
4928extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO);
4929extern tree build_decl (location_t, enum tree_code,
4930 tree, tree CXX_MEM_STAT_INFO);
4931extern tree build_debug_expr_decl (tree type);
4932extern tree build_fn_decl (const char *, tree);
4933extern tree build_translation_unit_decl (tree);
4934extern tree build_block (tree, tree, tree, tree);
4935extern tree build_empty_stmt (location_t);
4936extern tree build_omp_clause (location_t, enum omp_clause_code);
4937
4938extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO);
4939
4940extern tree build_call_nary (tree, tree, int, ...);
4941extern tree build_call_valist (tree, tree, int, va_list);
4942#define build_call_array(T1,T2,N,T3)\
4943 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4944extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4945extern tree build_call_vec (tree, tree, const vec<tree, va_gc> *);
4946extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
4947extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
4948extern tree build_call_expr_loc (location_t, tree, int, ...);
4949extern tree build_call_expr (tree, int, ...);
4950extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
4951 tree, int, ...);
4952extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn,
4953 tree, int, const tree *);
4954extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
4955 int, ...);
4956extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT);
4957extern tree build_string_literal (unsigned, const char * = NULL,
4958 tree = char_type_node,
4959 unsigned HOST_WIDE_INT = HOST_WIDE_INT_M1U);
4960inline tree build_string_literal (const char *p)
4961{ return build_string_literal (strlen (s: p) + 1, p); }
4962inline tree build_string_literal (tree t)
4963{
4964 return build_string_literal (IDENTIFIER_LENGTH (t) + 1,
4965 IDENTIFIER_POINTER (t));
4966}
4967
4968/* Construct various nodes representing data types. */
4969
4970extern tree signed_or_unsigned_type_for (int, tree);
4971extern tree signed_type_for (tree);
4972extern tree unsigned_type_for (tree);
4973extern bool is_truth_type_for (tree, tree);
4974extern bool tree_zero_one_valued_p (tree);
4975extern tree truth_type_for (tree);
4976extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
4977extern tree build_pointer_type (tree);
4978extern tree build_reference_type_for_mode (tree, machine_mode, bool);
4979extern tree build_reference_type (tree);
4980extern tree build_vector_type_for_mode (tree, machine_mode);
4981extern tree build_vector_type (tree, poly_int64);
4982extern tree build_truth_vector_type_for_mode (poly_uint64, machine_mode);
4983extern tree build_opaque_vector_type (tree, poly_int64);
4984extern tree build_index_type (tree);
4985extern tree build_array_type_1 (tree, tree, bool, bool, bool);
4986extern tree build_array_type (tree, tree, bool = false);
4987extern tree build_nonshared_array_type (tree, tree);
4988extern tree build_array_type_nelts (tree, poly_uint64);
4989extern tree build_function_type (tree, tree, bool = false);
4990extern tree build_function_type_list (tree, ...);
4991extern tree build_varargs_function_type_list (tree, ...);
4992extern tree build_function_type_array (tree, int, tree *);
4993extern tree build_varargs_function_type_array (tree, int, tree *);
4994#define build_function_type_vec(RET, V) \
4995 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4996#define build_varargs_function_type_vec(RET, V) \
4997 build_varargs_function_type_array (RET, vec_safe_length (V), \
4998 vec_safe_address (V))
4999extern tree build_method_type_directly (tree, tree, tree);
5000extern tree build_method_type (tree, tree);
5001extern tree build_offset_type (tree, tree);
5002extern tree build_complex_type (tree, bool named = false);
5003extern tree array_type_nelts_minus_one (const_tree);
5004extern tree array_type_nelts_top (tree);
5005
5006extern tree value_member (tree, tree);
5007extern tree purpose_member (const_tree, tree);
5008extern bool vec_member (const_tree, vec<tree, va_gc> *);
5009extern tree chain_index (int, tree);
5010
5011/* Arguments may be null. */
5012extern bool tree_int_cst_equal (const_tree, const_tree);
5013
5014/* The following predicates are safe to call with a null argument. */
5015extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE;
5016extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE;
5017extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE;
5018extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE;
5019
5020extern HOST_WIDE_INT tree_to_shwi (const_tree)
5021 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5022extern poly_int64 tree_to_poly_int64 (const_tree)
5023 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5024extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree)
5025 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5026extern poly_uint64 tree_to_poly_uint64 (const_tree)
5027 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
5028#if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
5029extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
5030tree_to_shwi (const_tree t)
5031{
5032 gcc_assert (tree_fits_shwi_p (t));
5033 return TREE_INT_CST_LOW (t);
5034}
5035
5036extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
5037tree_to_uhwi (const_tree t)
5038{
5039 gcc_assert (tree_fits_uhwi_p (t));
5040 return TREE_INT_CST_LOW (t);
5041}
5042#if NUM_POLY_INT_COEFFS == 1
5043extern inline __attribute__ ((__gnu_inline__)) poly_int64
5044tree_to_poly_int64 (const_tree t)
5045{
5046 gcc_assert (tree_fits_poly_int64_p (t));
5047 return TREE_INT_CST_LOW (t);
5048}
5049
5050extern inline __attribute__ ((__gnu_inline__)) poly_uint64
5051tree_to_poly_uint64 (const_tree t)
5052{
5053 gcc_assert (tree_fits_poly_uint64_p (t));
5054 return TREE_INT_CST_LOW (t);
5055}
5056#endif
5057#endif
5058extern int tree_int_cst_sgn (const_tree);
5059extern int tree_int_cst_sign_bit (const_tree);
5060extern unsigned int tree_int_cst_min_precision (tree, signop);
5061extern tree excess_precision_type (tree);
5062
5063/* Recursively examines the array elements of TYPE, until a non-array
5064 element type is found. */
5065
5066inline tree
5067strip_array_types (tree type)
5068{
5069 while (TREE_CODE (type) == ARRAY_TYPE)
5070 type = TREE_TYPE (type);
5071
5072 return type;
5073}
5074
5075/* Recursively traverse down pointer type layers to pointee type. */
5076
5077inline const_tree
5078strip_pointer_types (const_tree type)
5079{
5080 while (POINTER_TYPE_P (type))
5081 type = TREE_TYPE (type);
5082
5083 return type;
5084}
5085
5086/* Desription of the reason why the argument of valid_constant_size_p
5087 is not a valid size. */
5088enum cst_size_error {
5089 cst_size_ok,
5090 cst_size_not_constant,
5091 cst_size_negative,
5092 cst_size_too_big,
5093 cst_size_overflow
5094};
5095
5096extern bool valid_constant_size_p (const_tree, cst_size_error * = NULL);
5097extern tree max_object_size ();
5098
5099/* Return true if T holds a value that can be represented as a poly_int64
5100 without loss of precision. Store the value in *VALUE if so. */
5101
5102inline bool
5103poly_int_tree_p (const_tree t, poly_int64 *value)
5104{
5105 if (tree_fits_poly_int64_p (t))
5106 {
5107 *value = tree_to_poly_int64 (t);
5108 return true;
5109 }
5110 return false;
5111}
5112
5113/* Return true if T holds a value that can be represented as a poly_uint64
5114 without loss of precision. Store the value in *VALUE if so. */
5115
5116inline bool
5117poly_int_tree_p (const_tree t, poly_uint64 *value)
5118{
5119 if (tree_fits_poly_uint64_p (t))
5120 {
5121 *value = tree_to_poly_uint64 (t);
5122 return true;
5123 }
5124 return false;
5125}
5126
5127/* From expmed.cc. Since rtl.h is included after tree.h, we can't
5128 put the prototype here. Rtl.h does declare the prototype if
5129 tree.h had been included. */
5130
5131extern tree make_tree (tree, rtx);
5132
5133/* Returns true iff CAND and BASE have equivalent language-specific
5134 qualifiers. */
5135
5136extern bool check_lang_type (const_tree cand, const_tree base);
5137
5138/* Returns true iff unqualified CAND and BASE are equivalent. */
5139
5140extern bool check_base_type (const_tree cand, const_tree base);
5141
5142/* Check whether CAND is suitable to be returned from get_qualified_type
5143 (BASE, TYPE_QUALS). */
5144
5145extern bool check_qualified_type (const_tree, const_tree, int);
5146
5147/* Return a version of the TYPE, qualified as indicated by the
5148 TYPE_QUALS, if one exists. If no qualified version exists yet,
5149 return NULL_TREE. */
5150
5151extern tree get_qualified_type (tree, int);
5152
5153/* Like get_qualified_type, but creates the type if it does not
5154 exist. This function never returns NULL_TREE. */
5155
5156extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO);
5157
5158/* Create a variant of type T with alignment ALIGN. */
5159
5160extern tree build_aligned_type (tree, unsigned int);
5161
5162/* Like build_qualified_type, but only deals with the `const' and
5163 `volatile' qualifiers. This interface is retained for backwards
5164 compatibility with the various front-ends; new code should use
5165 build_qualified_type instead. */
5166
5167#define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
5168 build_qualified_type ((TYPE), \
5169 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
5170 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
5171
5172/* Make a copy of a type node. */
5173
5174extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO);
5175extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO);
5176
5177/* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
5178 return a canonicalized ..._TYPE node, so that duplicates are not made.
5179 How the hash code is computed is up to the caller, as long as any two
5180 callers that could hash identical-looking type nodes agree. */
5181
5182extern hashval_t type_hash_canon_hash (tree);
5183extern tree type_hash_canon (unsigned int, tree);
5184
5185extern tree convert (tree, tree);
5186extern tree size_in_bytes_loc (location_t, const_tree);
5187inline tree
5188size_in_bytes (const_tree t)
5189{
5190 return size_in_bytes_loc (input_location, t);
5191}
5192
5193extern HOST_WIDE_INT int_size_in_bytes (const_tree);
5194extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
5195extern tree bit_position (const_tree);
5196extern tree byte_position (const_tree);
5197extern HOST_WIDE_INT int_byte_position (const_tree);
5198
5199/* Type for sizes of data-type. */
5200
5201#define sizetype sizetype_tab[(int) stk_sizetype]
5202#define bitsizetype sizetype_tab[(int) stk_bitsizetype]
5203#define ssizetype sizetype_tab[(int) stk_ssizetype]
5204#define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
5205#define size_int(L) size_int_kind (L, stk_sizetype)
5206#define ssize_int(L) size_int_kind (L, stk_ssizetype)
5207#define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
5208#define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
5209
5210/* Log2 of BITS_PER_UNIT. */
5211
5212#if BITS_PER_UNIT == 8
5213#define LOG2_BITS_PER_UNIT 3
5214#elif BITS_PER_UNIT == 16
5215#define LOG2_BITS_PER_UNIT 4
5216#else
5217#error Unknown BITS_PER_UNIT
5218#endif
5219
5220/* Concatenate two lists (chains of TREE_LIST nodes) X and Y
5221 by making the last node in X point to Y.
5222 Returns X, except if X is 0 returns Y. */
5223
5224extern tree chainon (tree, tree);
5225
5226/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
5227
5228extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO);
5229
5230/* Return the last tree node in a chain. */
5231
5232extern tree tree_last (tree);
5233
5234/* Reverse the order of elements in a chain, and return the new head. */
5235
5236extern tree nreverse (tree);
5237
5238/* Returns the length of a chain of nodes
5239 (number of chain pointers to follow before reaching a null pointer). */
5240
5241extern int list_length (const_tree);
5242
5243/* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
5244
5245extern tree first_field (const_tree) ATTRIBUTE_NONNULL (1);
5246extern tree last_field (const_tree) ATTRIBUTE_NONNULL (1);
5247
5248/* Given an initializer INIT, return TRUE if INIT is zero or some
5249 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
5250 null, set *NONZERO if and only if INIT is known not to be all
5251 zeros. The combination of return value of false and *NONZERO
5252 false implies that INIT may but need not be all zeros. Other
5253 combinations indicate definitive answers. */
5254
5255extern bool initializer_zerop (const_tree, bool * = NULL);
5256extern bool initializer_each_zero_or_onep (const_tree);
5257
5258extern tree vector_cst_elt (const_tree, unsigned int);
5259
5260/* Given a vector VEC, return its first element if all elements are
5261 the same. Otherwise return NULL_TREE. */
5262
5263extern tree uniform_vector_p (const_tree);
5264
5265/* If the argument is INTEGER_CST, return it. If the argument is vector
5266 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
5267 return NULL_TREE. */
5268
5269extern tree uniform_integer_cst_p (tree);
5270
5271extern int single_nonzero_element (const_tree);
5272
5273/* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
5274
5275extern vec<tree, va_gc> *ctor_to_vec (tree);
5276
5277/* zerop (tree x) is nonzero if X is a constant of value 0. */
5278
5279extern bool zerop (const_tree);
5280
5281/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
5282
5283extern bool integer_zerop (const_tree);
5284
5285/* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
5286
5287extern bool integer_onep (const_tree);
5288
5289/* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
5290 a vector or complex where each part is 1. */
5291
5292extern bool integer_each_onep (const_tree);
5293
5294/* integer_all_onesp (tree x) is nonzero if X is an integer constant
5295 all of whose significant bits are 1. */
5296
5297extern bool integer_all_onesp (const_tree);
5298
5299/* integer_minus_onep (tree x) is nonzero if X is an integer constant of
5300 value -1. */
5301
5302extern bool integer_minus_onep (const_tree);
5303
5304/* integer_pow2p (tree x) is nonzero is X is an integer constant with
5305 exactly one bit 1. */
5306
5307extern bool integer_pow2p (const_tree);
5308
5309/* Checks to see if T is a constant or a constant vector and if each element E
5310 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
5311
5312extern tree bitmask_inv_cst_vector_p (tree);
5313
5314/* integer_nonzerop (tree x) is nonzero if X is an integer constant
5315 with a nonzero value. */
5316
5317extern bool integer_nonzerop (const_tree);
5318
5319/* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
5320 a vector where each element is an integer constant of value -1. */
5321
5322extern bool integer_truep (const_tree);
5323
5324extern bool cst_and_fits_in_hwi (const_tree);
5325extern tree num_ending_zeros (const_tree);
5326
5327/* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
5328 value 0. */
5329
5330extern bool fixed_zerop (const_tree);
5331
5332/* staticp (tree x) is nonzero if X is a reference to data allocated
5333 at a fixed address in memory. Returns the outermost data. */
5334
5335extern tree staticp (tree);
5336
5337/* save_expr (EXP) returns an expression equivalent to EXP
5338 but it can be used multiple times within context CTX
5339 and only evaluate EXP once. */
5340
5341extern tree save_expr (tree);
5342
5343/* Return true if T is function-invariant. */
5344
5345extern bool tree_invariant_p (tree);
5346
5347/* Look inside EXPR into any simple arithmetic operations. Return the
5348 outermost non-arithmetic or non-invariant node. */
5349
5350extern tree skip_simple_arithmetic (tree);
5351
5352/* Look inside EXPR into simple arithmetic operations involving constants.
5353 Return the outermost non-arithmetic or non-constant node. */
5354
5355extern tree skip_simple_constant_arithmetic (tree);
5356
5357/* Return which tree structure is used by T. */
5358
5359enum tree_node_structure_enum tree_node_structure (const_tree);
5360
5361/* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
5362 size or offset that depends on a field within a record. */
5363
5364extern bool contains_placeholder_p (const_tree);
5365
5366/* This macro calls the above function but short-circuits the common
5367 case of a constant to save time. Also check for null. */
5368
5369#define CONTAINS_PLACEHOLDER_P(EXP) \
5370 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5371
5372/* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5373 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5374 field positions. */
5375
5376extern bool type_contains_placeholder_p (tree);
5377
5378/* Given a tree EXP, find all occurrences of references to fields
5379 in a PLACEHOLDER_EXPR and place them in vector REFS without
5380 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5381 we assume here that EXP contains only arithmetic expressions
5382 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5383 argument list. */
5384
5385extern void find_placeholder_in_expr (tree, vec<tree> *);
5386
5387/* This macro calls the above function but short-circuits the common
5388 case of a constant to save time and also checks for NULL. */
5389
5390#define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5391do { \
5392 if((EXP) && !TREE_CONSTANT (EXP)) \
5393 find_placeholder_in_expr (EXP, V); \
5394} while (0)
5395
5396/* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5397 return a tree with all occurrences of references to F in a
5398 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5399 CONST_DECLs. Note that we assume here that EXP contains only
5400 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5401 occurring only in their argument list. */
5402
5403extern tree substitute_in_expr (tree, tree, tree);
5404
5405/* This macro calls the above function but short-circuits the common
5406 case of a constant to save time and also checks for NULL. */
5407
5408#define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5409 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5410
5411/* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5412 for it within OBJ, a tree that is an object or a chain of references. */
5413
5414extern tree substitute_placeholder_in_expr (tree, tree);
5415
5416/* This macro calls the above function but short-circuits the common
5417 case of a constant to save time and also checks for NULL. */
5418
5419#define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5420 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5421 : substitute_placeholder_in_expr (EXP, OBJ))
5422
5423
5424/* stabilize_reference (EXP) returns a reference equivalent to EXP
5425 but it can be used multiple times
5426 and only evaluate the subexpressions once. */
5427
5428extern tree stabilize_reference (tree);
5429
5430/* Return EXP, stripped of any conversions to wider types
5431 in such a way that the result of converting to type FOR_TYPE
5432 is the same as if EXP were converted to FOR_TYPE.
5433 If FOR_TYPE is 0, it signifies EXP's type. */
5434
5435extern tree get_unwidened (tree, tree);
5436
5437/* Return OP or a simpler expression for a narrower value
5438 which can be sign-extended or zero-extended to give back OP.
5439 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5440 or 0 if the value should be sign-extended. */
5441
5442extern tree get_narrower (tree, int *);
5443
5444/* Return true if T is an expression that get_inner_reference handles. */
5445
5446inline bool
5447handled_component_p (const_tree t)
5448{
5449 switch (TREE_CODE (t))
5450 {
5451 case COMPONENT_REF:
5452 case BIT_FIELD_REF:
5453 case ARRAY_REF:
5454 case ARRAY_RANGE_REF:
5455 case REALPART_EXPR:
5456 case IMAGPART_EXPR:
5457 case VIEW_CONVERT_EXPR:
5458 return true;
5459
5460 default:
5461 return false;
5462 }
5463}
5464
5465/* Return true T is a component with reverse storage order. */
5466
5467inline bool
5468reverse_storage_order_for_component_p (tree t)
5469{
5470 /* The storage order only applies to scalar components. */
5471 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5472 || POINTER_TYPE_P (TREE_TYPE (t))
5473 || VECTOR_TYPE_P (TREE_TYPE (t)))
5474 return false;
5475
5476 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
5477 t = TREE_OPERAND (t, 0);
5478
5479 switch (TREE_CODE (t))
5480 {
5481 case ARRAY_REF:
5482 case COMPONENT_REF:
5483 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
5484 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5485 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
5486 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
5487
5488 case BIT_FIELD_REF:
5489 case MEM_REF:
5490 return REF_REVERSE_STORAGE_ORDER (t);
5491
5492 case ARRAY_RANGE_REF:
5493 case VIEW_CONVERT_EXPR:
5494 default:
5495 return false;
5496 }
5497}
5498
5499/* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5500 that can modify the storage order of objects. Note that, even if the
5501 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5502 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5503 it can change the partition of the aggregate object into scalars. */
5504
5505inline bool
5506storage_order_barrier_p (const_tree t)
5507{
5508 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
5509 return false;
5510
5511 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5512 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
5513 return true;
5514
5515 tree op = TREE_OPERAND (t, 0);
5516
5517 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
5518 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
5519 return true;
5520
5521 return reverse_storage_order_for_component_p (t: op);
5522}
5523
5524/* Given a DECL or TYPE, return the scope in which it was declared, or
5525 NUL_TREE if there is no containing scope. */
5526
5527extern tree get_containing_scope (const_tree);
5528
5529/* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5530
5531extern const_tree get_ultimate_context (const_tree);
5532
5533/* Return the FUNCTION_DECL which provides this _DECL with its context,
5534 or zero if none. */
5535extern tree decl_function_context (const_tree);
5536
5537/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5538 this _DECL with its context, or zero if none. */
5539extern tree decl_type_context (const_tree);
5540
5541/* Return true if EXPR is the real constant zero. */
5542extern bool real_zerop (const_tree);
5543
5544/* Initialize the iterator I with arguments from function FNDECL */
5545
5546inline void
5547function_args_iter_init (function_args_iterator *i, const_tree fntype)
5548{
5549 i->next = TYPE_ARG_TYPES (fntype);
5550}
5551
5552/* Return a pointer that holds the next argument if there are more arguments to
5553 handle, otherwise return NULL. */
5554
5555inline tree *
5556function_args_iter_cond_ptr (function_args_iterator *i)
5557{
5558 return (i->next) ? &TREE_VALUE (i->next) : NULL;
5559}
5560
5561/* Return the next argument if there are more arguments to handle, otherwise
5562 return NULL. */
5563
5564inline tree
5565function_args_iter_cond (function_args_iterator *i)
5566{
5567 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
5568}
5569
5570/* Advance to the next argument. */
5571inline void
5572function_args_iter_next (function_args_iterator *i)
5573{
5574 gcc_assert (i->next != NULL_TREE);
5575 i->next = TREE_CHAIN (i->next);
5576}
5577
5578/* Returns true if a BLOCK has a source location.
5579 BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5580 so the function returns true for all but the innermost and outermost
5581 blocks into which an expression has been inlined. */
5582
5583inline bool
5584inlined_function_outer_scope_p (const_tree block)
5585{
5586 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
5587}
5588
5589/* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5590 to point to the next tree element. ITER is an instance of
5591 function_args_iterator used to iterate the arguments. */
5592#define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5593 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5594 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5595 function_args_iter_next (&(ITER)))
5596
5597/* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5598 to the next tree element. ITER is an instance of function_args_iterator
5599 used to iterate the arguments. */
5600#define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5601 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5602 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5603 function_args_iter_next (&(ITER)))
5604
5605/* In tree.cc */
5606extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5607extern unsigned crc32_string (unsigned, const char *);
5608inline unsigned
5609crc32_unsigned (unsigned chksum, unsigned value)
5610{
5611 return crc32_unsigned_n (chksum, value, 4);
5612}
5613inline unsigned
5614crc32_byte (unsigned chksum, char byte)
5615{
5616 return crc32_unsigned_n (chksum, byte, 1);
5617}
5618extern void clean_symbol_name (char *);
5619extern tree get_file_function_name (const char *);
5620extern tree get_callee_fndecl (const_tree);
5621extern combined_fn get_call_combined_fn (const_tree);
5622extern int type_num_arguments (const_tree);
5623extern tree type_argument_type (const_tree, unsigned) ATTRIBUTE_NONNULL (1);
5624extern bool associative_tree_code (enum tree_code);
5625extern bool commutative_tree_code (enum tree_code);
5626extern bool commutative_ternary_tree_code (enum tree_code);
5627extern bool operation_can_overflow (enum tree_code);
5628extern bool operation_no_trapping_overflow (tree, enum tree_code);
5629extern tree upper_bound_in_type (tree, tree);
5630extern tree lower_bound_in_type (tree, tree);
5631extern bool operand_equal_for_phi_arg_p (const_tree, const_tree);
5632extern tree create_artificial_label (location_t);
5633extern const char *get_name (tree);
5634extern bool stdarg_p (const_tree);
5635extern bool prototype_p (const_tree);
5636extern bool auto_var_p (const_tree);
5637extern bool auto_var_in_fn_p (const_tree, const_tree);
5638extern tree build_low_bits_mask (tree, unsigned);
5639extern bool tree_nop_conversion_p (const_tree, const_tree);
5640extern tree tree_strip_nop_conversions (tree);
5641extern tree tree_strip_sign_nop_conversions (tree);
5642extern const_tree strip_invariant_refs (const_tree);
5643extern tree strip_zero_offset_components (tree);
5644extern tree lhd_gcc_personality (void);
5645extern void assign_assembler_name_if_needed (tree);
5646extern bool warn_deprecated_use (tree, tree);
5647extern void error_unavailable_use (tree, tree);
5648extern tree cache_integer_cst (tree, bool might_duplicate = false);
5649extern const char *combined_fn_name (combined_fn);
5650
5651/* Returns true if X is a typedef decl. */
5652
5653inline bool
5654is_typedef_decl (const_tree x)
5655{
5656 return (x && TREE_CODE (x) == TYPE_DECL
5657 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
5658}
5659
5660/* Returns true iff TYPE is a type variant created for a typedef. */
5661
5662inline bool
5663typedef_variant_p (const_tree type)
5664{
5665 return is_typedef_decl (TYPE_NAME (type));
5666}
5667
5668/* Compare and hash for any structure which begins with a canonical
5669 pointer. Assumes all pointers are interchangeable, which is sort
5670 of already assumed by gcc elsewhere IIRC. */
5671
5672inline int
5673struct_ptr_eq (const void *a, const void *b)
5674{
5675 const void * const * x = (const void * const *) a;
5676 const void * const * y = (const void * const *) b;
5677 return *x == *y;
5678}
5679
5680inline hashval_t
5681struct_ptr_hash (const void *a)
5682{
5683 const void * const * x = (const void * const *) a;
5684 return (intptr_t)*x >> 4;
5685}
5686
5687/* Return true if CODE can be treated as a truncating division.
5688
5689 EXACT_DIV_EXPR can be treated as a truncating division in which the
5690 remainder is known to be zero. However, if trunc_div_p gates the
5691 generation of new IL, the conservative choice for that new IL is
5692 TRUNC_DIV_EXPR rather than CODE. Using CODE (EXACT_DIV_EXPR) would
5693 only be correct if the transformation preserves exactness. */
5694inline bool
5695trunc_or_exact_div_p (tree_code code)
5696{
5697 return code == TRUNC_DIV_EXPR || code == EXACT_DIV_EXPR;
5698}
5699
5700/* Return nonzero if CODE is a tree code that represents a truth value. */
5701inline bool
5702truth_value_p (enum tree_code code)
5703{
5704 return (TREE_CODE_CLASS (code) == tcc_comparison
5705 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5706 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5707 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5708}
5709
5710/* Return whether TYPE is a type suitable for an offset for
5711 a POINTER_PLUS_EXPR. */
5712inline bool
5713ptrofftype_p (tree type)
5714{
5715 return (INTEGRAL_TYPE_P (type)
5716 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
5717 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
5718}
5719
5720/* Return true if the argument is a complete type or an array
5721 of unknown bound (whose type is incomplete but) whose elements
5722 have complete type. */
5723inline bool
5724complete_or_array_type_p (const_tree type)
5725{
5726 return COMPLETE_TYPE_P (type)
5727 || (TREE_CODE (type) == ARRAY_TYPE
5728 && COMPLETE_TYPE_P (TREE_TYPE (type)));
5729}
5730
5731/* Return true if the value of T could be represented as a poly_widest_int. */
5732
5733inline bool
5734poly_int_tree_p (const_tree t)
5735{
5736 return (TREE_CODE (t) == INTEGER_CST || POLY_INT_CST_P (t));
5737}
5738
5739/* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5740 to be a poly_uint64. (This is always true at the gimple level.) */
5741
5742inline poly_uint64
5743bit_field_size (const_tree t)
5744{
5745 return tree_to_poly_uint64 (TREE_OPERAND (t, 1));
5746}
5747
5748/* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5749 known to be a poly_uint64. (This is always true at the gimple level.) */
5750
5751inline poly_uint64
5752bit_field_offset (const_tree t)
5753{
5754 return tree_to_poly_uint64 (TREE_OPERAND (t, 2));
5755}
5756
5757extern tree strip_float_extensions (tree);
5758extern bool really_constant_p (const_tree);
5759extern bool ptrdiff_tree_p (const_tree, poly_int64 *);
5760extern bool decl_address_invariant_p (const_tree);
5761extern bool decl_address_ip_invariant_p (const_tree);
5762extern bool int_fits_type_p (const_tree, const_tree)
5763 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE;
5764#ifndef GENERATOR_FILE
5765extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5766#endif
5767extern bool variably_modified_type_p (tree, tree);
5768extern int tree_log2 (const_tree);
5769extern int tree_floor_log2 (const_tree);
5770extern unsigned int tree_ctz (const_tree);
5771extern int simple_cst_equal (const_tree, const_tree);
5772
5773namespace inchash
5774{
5775
5776extern void add_expr (const_tree, hash &, unsigned int = 0);
5777
5778}
5779
5780/* Compat version until all callers are converted. Return hash for
5781 TREE with SEED. */
5782inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
5783{
5784 inchash::hash hstate (seed);
5785 inchash::add_expr (tree, hstate);
5786 return hstate.end ();
5787}
5788
5789extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5790extern bool type_list_equal (const_tree, const_tree);
5791extern bool chain_member (const_tree, const_tree);
5792extern void dump_tree_statistics (void);
5793extern void recompute_tree_invariant_for_addr_expr (tree);
5794extern bool needs_to_live_in_memory (const_tree);
5795extern tree reconstruct_complex_type (tree, tree);
5796extern bool real_onep (const_tree);
5797extern bool real_minus_onep (const_tree);
5798extern bool real_maybe_zerop (const_tree);
5799extern void init_ttree (void);
5800extern void build_common_tree_nodes (bool);
5801extern void build_common_builtin_nodes (void);
5802extern void tree_cc_finalize (void);
5803extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5804extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
5805extern tree build_bitint_type (unsigned HOST_WIDE_INT, int);
5806extern tree build_range_type (tree, tree, tree);
5807extern tree build_nonshared_range_type (tree, tree, tree);
5808extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5809extern HOST_WIDE_INT int_cst_value (const_tree);
5810extern tree tree_block (tree);
5811extern void tree_set_block (tree, tree);
5812extern location_t *block_nonartificial_location (tree);
5813extern location_t tree_nonartificial_location (tree);
5814extern location_t tree_inlined_location (tree, bool = true);
5815extern tree block_ultimate_origin (const_tree);
5816extern tree get_binfo_at_offset (tree, poly_int64, tree);
5817extern bool virtual_method_call_p (const_tree, bool = false);
5818extern tree obj_type_ref_class (const_tree ref, bool = false);
5819extern bool types_same_for_odr (const_tree type1, const_tree type2);
5820extern bool contains_bitfld_component_ref_p (const_tree);
5821extern bool block_may_fallthru (const_tree);
5822extern void using_eh_for_cleanups (void);
5823extern bool using_eh_for_cleanups_p (void);
5824extern const char *get_tree_code_name (enum tree_code);
5825extern void set_call_expr_flags (tree, int);
5826extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
5827 walk_tree_lh);
5828extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5829 walk_tree_lh);
5830#define walk_tree(a,b,c,d) \
5831 walk_tree_1 (a, b, c, d, NULL)
5832#define walk_tree_without_duplicates(a,b,c) \
5833 walk_tree_without_duplicates_1 (a, b, c, NULL)
5834
5835extern tree drop_tree_overflow (tree);
5836
5837/* Given a memory reference expression T, return its base address.
5838 The base address of a memory reference expression is the main
5839 object being referenced. */
5840extern tree get_base_address (tree t);
5841
5842/* Return a tree of sizetype representing the size, in bytes, of the element
5843 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5844extern tree array_ref_element_size (tree);
5845
5846/* Return a typenode for the "standard" C type with a given name. */
5847extern tree get_typenode_from_name (const char *);
5848
5849/* Return a tree representing the upper bound of the array mentioned in
5850 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5851extern tree array_ref_up_bound (tree);
5852
5853/* Return a tree representing the lower bound of the array mentioned in
5854 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5855extern tree array_ref_low_bound (tree);
5856
5857/* Returns true if REF is an array reference, a component reference,
5858 or a memory reference to an array whose actual size might be larger
5859 than its upper bound implies. */
5860extern bool array_ref_flexible_size_p (tree, bool * = NULL);
5861
5862/* Return a tree representing the offset, in bytes, of the field referenced
5863 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5864extern tree component_ref_field_offset (tree);
5865
5866/* Describes a "special" array member for a COMPONENT_REF. */
5867enum struct special_array_member
5868 {
5869 none, /* Not a special array member. */
5870 int_0, /* Interior array member with zero elements. */
5871 trail_0, /* Trailing array member with zero elements. */
5872 trail_1, /* Trailing array member with one element. */
5873 trail_n, /* Trailing array member with two or more elements. */
5874 int_n /* Interior array member with one or more elements. */
5875 };
5876
5877/* Determines the special array member type for a COMPONENT_REF. */
5878extern special_array_member component_ref_sam_type (tree);
5879
5880/* Return the size of the member referenced by the COMPONENT_REF, using
5881 its initializer expression if necessary in order to determine the size
5882 of an initialized flexible array member. The size might be zero for
5883 an object with an uninitialized flexible array member or null if it
5884 cannot be determined. */
5885extern tree component_ref_size (tree, special_array_member * = NULL);
5886
5887/* Return true if the given node is a call to a .ACCESS_WITH_SIZE
5888 function. */
5889extern bool is_access_with_size_p (const_tree);
5890
5891/* Get the corresponding reference from the call to a .ACCESS_WITH_SIZE,
5892 * i.e. the first argument of this call. Return NULL_TREE otherwise. */
5893extern tree get_ref_from_access_with_size (tree);
5894
5895extern int tree_map_base_eq (const void *, const void *);
5896extern unsigned int tree_map_base_hash (const void *);
5897extern bool tree_map_base_marked_p (const void *);
5898extern void DEBUG_FUNCTION verify_type (const_tree t);
5899extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
5900 bool trust_type_canonical = true);
5901extern bool type_with_interoperable_signedness (const_tree);
5902extern bitmap get_nonnull_args (const_tree);
5903extern int get_range_pos_neg (tree, gimple * = NULL);
5904
5905/* Return true for a valid pair of new and delete operators. */
5906extern bool valid_new_delete_pair_p (tree, tree, bool * = NULL);
5907
5908/* Return simplified tree code of type that is used for canonical type
5909 merging. */
5910inline enum tree_code
5911tree_code_for_canonical_type_merging (enum tree_code code)
5912{
5913 /* By C standard, each enumerated type shall be compatible with char,
5914 a signed integer, or an unsigned integer. The choice of type is
5915 implementation defined (in our case it depends on -fshort-enum).
5916
5917 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5918 type and compare only by their signedness and precision. */
5919 if (code == ENUMERAL_TYPE)
5920 return INTEGER_TYPE;
5921 /* To allow inter-operability between languages having references and
5922 C, we consider reference types and pointers alike. Note that this is
5923 not strictly necessary for C-Fortran 2008 interoperability because
5924 Fortran define C_PTR type that needs to be compatible with C pointers
5925 and we handle this one as ptr_type_node. */
5926 if (code == REFERENCE_TYPE)
5927 return POINTER_TYPE;
5928 return code;
5929}
5930
5931/* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5932 We don't define the types for pointers, arrays and vectors. The reason is
5933 that pointers are handled specially: ptr_type_node accesses conflict with
5934 accesses to all other pointers. This is done by alias.cc.
5935 Because alias sets of arrays and vectors are the same as types of their
5936 elements, we can't compute canonical type either. Otherwise we could go
5937 form void *[10] to int *[10] (because they are equivalent for canonical type
5938 machinery) and get wrong TBAA. */
5939
5940inline bool
5941canonical_type_used_p (const_tree t)
5942{
5943 return !(POINTER_TYPE_P (t)
5944 || TREE_CODE (t) == ARRAY_TYPE
5945 || TREE_CODE (t) == VECTOR_TYPE);
5946}
5947
5948/* Kinds of access to pass-by-reference arguments to functions. */
5949enum access_mode
5950{
5951 access_none = 0,
5952 access_read_only = 1,
5953 access_write_only = 2,
5954 access_read_write = access_read_only | access_write_only,
5955 access_deferred = 4
5956};
5957
5958#define tree_map_eq tree_map_base_eq
5959extern unsigned int tree_map_hash (const void *);
5960#define tree_map_marked_p tree_map_base_marked_p
5961
5962#define tree_decl_map_eq tree_map_base_eq
5963extern unsigned int tree_decl_map_hash (const void *);
5964#define tree_decl_map_marked_p tree_map_base_marked_p
5965
5966struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
5967{
5968 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
5969 static bool
5970 equal (tree_decl_map *a, tree_decl_map *b)
5971 {
5972 return tree_decl_map_eq (a, b);
5973 }
5974
5975 static int
5976 keep_cache_entry (tree_decl_map *&m)
5977 {
5978 return ggc_marked_p (m->base.from);
5979 }
5980};
5981
5982#define tree_int_map_eq tree_map_base_eq
5983#define tree_int_map_hash tree_map_base_hash
5984#define tree_int_map_marked_p tree_map_base_marked_p
5985
5986#define tree_vec_map_eq tree_map_base_eq
5987#define tree_vec_map_hash tree_decl_map_hash
5988#define tree_vec_map_marked_p tree_map_base_marked_p
5989
5990struct tree_vec_map_cache_hasher : ggc_cache_ptr_hash<tree_vec_map>
5991{
5992 static hashval_t hash (tree_vec_map *m) { return DECL_UID (m->base.from); }
5993
5994 static bool
5995 equal (tree_vec_map *a, tree_vec_map *b)
5996 {
5997 return a->base.from == b->base.from;
5998 }
5999
6000 static int
6001 keep_cache_entry (tree_vec_map *&m)
6002 {
6003 return ggc_marked_p (m->base.from);
6004 }
6005};
6006
6007/* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
6008 is a better hash than the pointer value and gives a predictable traversal
6009 order. Additionally it can be used across PCH save/restore. */
6010struct tree_decl_hash : ggc_ptr_hash <tree_node>
6011{
6012 static inline hashval_t hash (tree);
6013};
6014
6015inline hashval_t
6016tree_decl_hash::hash (tree t)
6017{
6018 return DECL_UID (t);
6019}
6020
6021/* Similarly for types. Uses TYPE_UID as hash function. */
6022struct tree_type_hash : ggc_ptr_hash <tree_node>
6023{
6024 static inline hashval_t hash (tree);
6025};
6026
6027inline hashval_t
6028tree_type_hash::hash (tree t)
6029{
6030 return TYPE_UID (t);
6031}
6032
6033/* Hash for SSA_NAMEs in the same function. Pointer equality is enough
6034 here, but the SSA_NAME_VERSION is a better hash than the pointer
6035 value and gives a predictable traversal order. */
6036struct tree_ssa_name_hash : ggc_ptr_hash <tree_node>
6037{
6038 static inline hashval_t hash (tree);
6039};
6040
6041inline hashval_t
6042tree_ssa_name_hash::hash (tree t)
6043{
6044 return SSA_NAME_VERSION (t);
6045}
6046
6047/* Hasher for general trees, based on their TREE_HASH. */
6048struct tree_hash : ggc_ptr_hash <tree_node>
6049{
6050 static hashval_t hash (tree);
6051};
6052
6053inline hashval_t
6054tree_hash::hash (tree t)
6055{
6056 return TREE_HASH (t);
6057}
6058
6059/* A hash_map of two trees for use with GTY((cache)). Garbage collection for
6060 such a map will not mark keys, and will mark values if the key is already
6061 marked. */
6062struct tree_cache_traits
6063 : simple_cache_map_traits<default_hash_traits<tree>, tree> { };
6064typedef hash_map<tree,tree,tree_cache_traits> tree_cache_map;
6065
6066/* Similarly, but use DECL_UID as hash function rather than pointer hashing.
6067 This is for hash_maps from decls to trees that need to work across PCH. */
6068struct decl_tree_cache_traits
6069 : simple_cache_map_traits<tree_decl_hash, tree> { };
6070typedef hash_map<tree,tree,decl_tree_cache_traits> decl_tree_cache_map;
6071
6072/* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
6073 This is for hash_maps from types to trees that need to work across PCH. */
6074struct type_tree_cache_traits
6075 : simple_cache_map_traits<tree_type_hash, tree> { };
6076typedef hash_map<tree,tree,type_tree_cache_traits> type_tree_cache_map;
6077
6078/* Similarly to decl_tree_cache_map, but without caching. */
6079struct decl_tree_traits
6080 : simple_hashmap_traits<tree_decl_hash, tree> { };
6081typedef hash_map<tree,tree,decl_tree_traits> decl_tree_map;
6082
6083/* Initialize the abstract argument list iterator object ITER with the
6084 arguments from CALL_EXPR node EXP. */
6085inline void
6086init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
6087{
6088 iter->t = exp;
6089 iter->n = call_expr_nargs (exp);
6090 iter->i = 0;
6091}
6092
6093inline void
6094init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
6095{
6096 iter->t = exp;
6097 iter->n = call_expr_nargs (exp);
6098 iter->i = 0;
6099}
6100
6101/* Return the next argument from abstract argument list iterator object ITER,
6102 and advance its state. Return NULL_TREE if there are no more arguments. */
6103inline tree
6104next_call_expr_arg (call_expr_arg_iterator *iter)
6105{
6106 tree result;
6107 if (iter->i >= iter->n)
6108 return NULL_TREE;
6109 result = CALL_EXPR_ARG (iter->t, iter->i);
6110 iter->i++;
6111 return result;
6112}
6113
6114inline const_tree
6115next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
6116{
6117 const_tree result;
6118 if (iter->i >= iter->n)
6119 return NULL_TREE;
6120 result = CALL_EXPR_ARG (iter->t, iter->i);
6121 iter->i++;
6122 return result;
6123}
6124
6125/* Initialize the abstract argument list iterator object ITER, then advance
6126 past and return the first argument. Useful in for expressions, e.g.
6127 for (arg = first_call_expr_arg (exp, &iter); arg;
6128 arg = next_call_expr_arg (&iter)) */
6129inline tree
6130first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
6131{
6132 init_call_expr_arg_iterator (exp, iter);
6133 return next_call_expr_arg (iter);
6134}
6135
6136inline const_tree
6137first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
6138{
6139 init_const_call_expr_arg_iterator (exp, iter);
6140 return next_const_call_expr_arg (iter);
6141}
6142
6143/* Test whether there are more arguments in abstract argument list iterator
6144 ITER, without changing its state. */
6145inline bool
6146more_call_expr_args_p (const call_expr_arg_iterator *iter)
6147{
6148 return (iter->i < iter->n);
6149}
6150
6151/* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6152 (of type call_expr_arg_iterator) to hold the iteration state. */
6153#define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6154 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6155 (arg) = next_call_expr_arg (&(iter)))
6156
6157#define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6158 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6159 (arg) = next_const_call_expr_arg (&(iter)))
6160
6161/* Return true if tree node T is a language-specific node. */
6162inline bool
6163is_lang_specific (const_tree t)
6164{
6165 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
6166}
6167
6168/* Valid builtin number. */
6169#define BUILTIN_VALID_P(FNCODE) \
6170 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6171
6172/* Obtain a pointer to the identifier string holding the asm name for
6173 BUILTIN, a BUILT_IN code. This is handy if the target
6174 mangles/overrides the function name that implements the
6175 builtin. */
6176#define BUILTIN_ASM_NAME_PTR(BUILTIN) \
6177 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
6178
6179/* Return the tree node for an explicit standard builtin function or NULL. */
6180inline tree
6181builtin_decl_explicit (enum built_in_function fncode)
6182{
6183 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6184
6185 return builtin_info[(size_t)fncode].decl;
6186}
6187
6188/* Return the tree node for an implicit builtin function or NULL. */
6189inline tree
6190builtin_decl_implicit (enum built_in_function fncode)
6191{
6192 size_t uns_fncode = (size_t)fncode;
6193 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6194
6195 if (!builtin_info[uns_fncode].implicit_p)
6196 return NULL_TREE;
6197
6198 return builtin_info[uns_fncode].decl;
6199}
6200
6201/* For BUILTIN_UNREACHABLE, use one of these or
6202 gimple_build_builtin_unreachable instead of one of the above. */
6203extern tree builtin_decl_unreachable ();
6204extern tree build_builtin_unreachable (location_t);
6205
6206/* Set explicit builtin function nodes and whether it is an implicit
6207 function. */
6208
6209inline void
6210set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
6211{
6212 size_t ufncode = (size_t)fncode;
6213
6214 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6215 && (decl != NULL_TREE || !implicit_p));
6216
6217 builtin_info[ufncode].decl = decl;
6218 builtin_info[ufncode].implicit_p = implicit_p;
6219 builtin_info[ufncode].declared_p = false;
6220}
6221
6222/* Set the implicit flag for a builtin function. */
6223
6224inline void
6225set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
6226{
6227 size_t uns_fncode = (size_t)fncode;
6228
6229 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6230 && builtin_info[uns_fncode].decl != NULL_TREE);
6231
6232 builtin_info[uns_fncode].implicit_p = implicit_p;
6233}
6234
6235/* Set the declared flag for a builtin function. */
6236
6237inline void
6238set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
6239{
6240 size_t uns_fncode = (size_t)fncode;
6241
6242 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6243 && builtin_info[uns_fncode].decl != NULL_TREE);
6244
6245 builtin_info[uns_fncode].declared_p = declared_p;
6246}
6247
6248/* Return whether the standard builtin function can be used as an explicit
6249 function. */
6250
6251inline bool
6252builtin_decl_explicit_p (enum built_in_function fncode)
6253{
6254 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6255 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
6256}
6257
6258/* Return whether the standard builtin function can be used implicitly. */
6259
6260inline bool
6261builtin_decl_implicit_p (enum built_in_function fncode)
6262{
6263 size_t uns_fncode = (size_t)fncode;
6264
6265 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6266 return (builtin_info[uns_fncode].decl != NULL_TREE
6267 && builtin_info[uns_fncode].implicit_p);
6268}
6269
6270/* Return whether the standard builtin function was declared. */
6271
6272inline bool
6273builtin_decl_declared_p (enum built_in_function fncode)
6274{
6275 size_t uns_fncode = (size_t)fncode;
6276
6277 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6278 return (builtin_info[uns_fncode].decl != NULL_TREE
6279 && builtin_info[uns_fncode].declared_p);
6280}
6281
6282/* Determine if the function identified by FNDECL is one that
6283 makes sense to match by name, for those places where we detect
6284 "magic" functions by name.
6285
6286 Return true if FNDECL has a name and is an extern fndecl at file scope.
6287 FNDECL must be a non-NULL decl.
6288
6289 Avoid using this, as it's generally better to use attributes rather
6290 than to check for functions by name. */
6291
6292inline bool
6293maybe_special_function_p (const_tree fndecl)
6294{
6295 tree name_decl = DECL_NAME (fndecl);
6296 if (name_decl
6297 /* Exclude functions not at the file scope, or not `extern',
6298 since they are not the magic functions we would otherwise
6299 think they are. */
6300 && (DECL_CONTEXT (fndecl) == NULL_TREE
6301 || TREE_CODE (DECL_CONTEXT (fndecl)) == TRANSLATION_UNIT_DECL)
6302 && TREE_PUBLIC (fndecl))
6303 return true;
6304 return false;
6305}
6306
6307/* Return true if T (assumed to be a DECL) is a global variable.
6308 A variable is considered global if its storage is not automatic. */
6309
6310inline bool
6311is_global_var (const_tree t)
6312{
6313 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
6314}
6315
6316/* Return true if VAR may be aliased. A variable is considered as
6317 maybe aliased if it has its address taken by the local TU
6318 or possibly by another TU and might be modified through a pointer. */
6319
6320inline bool
6321may_be_aliased (const_tree var)
6322{
6323 return (TREE_CODE (var) != CONST_DECL
6324 && (TREE_PUBLIC (var)
6325 || DECL_EXTERNAL (var)
6326 || TREE_ADDRESSABLE (var))
6327 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
6328 && (TREE_READONLY (var)
6329 || (TREE_CODE (var) == VAR_DECL
6330 && DECL_NONALIASED (var)))));
6331}
6332
6333/* Return pointer to optimization flags of FNDECL. */
6334inline struct cl_optimization *
6335opts_for_fn (const_tree fndecl)
6336{
6337 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
6338 if (fn_opts == NULL_TREE)
6339 fn_opts = optimization_default_node;
6340 return TREE_OPTIMIZATION (fn_opts);
6341}
6342
6343/* Return pointer to target flags of FNDECL. */
6344inline cl_target_option *
6345target_opts_for_fn (const_tree fndecl)
6346{
6347 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
6348 if (fn_opts == NULL_TREE)
6349 fn_opts = target_option_default_node;
6350 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
6351}
6352
6353/* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
6354 the optimization level of function fndecl. */
6355#define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
6356
6357/* For anonymous aggregate types, we need some sort of name to
6358 hold on to. In practice, this should not appear, but it should
6359 not be harmful if it does. Identifiers returned will be
6360 IDENTIFIER_ANON_P. */
6361extern tree make_anon_name ();
6362
6363/* The tree and const_tree overload templates. */
6364namespace wi
6365{
6366 class unextended_tree
6367 {
6368 private:
6369 const_tree m_t;
6370
6371 public:
6372 unextended_tree () {}
6373 unextended_tree (const_tree t) : m_t (t) {}
6374
6375 unsigned int get_precision () const;
6376 const HOST_WIDE_INT *get_val () const;
6377 unsigned int get_len () const;
6378 const_tree get_tree () const { return m_t; }
6379 };
6380
6381 template <>
6382 struct int_traits <unextended_tree>
6383 {
6384 static const enum precision_type precision_type = VAR_PRECISION;
6385 static const bool host_dependent_precision = false;
6386 static const bool is_sign_extended = false;
6387 static const bool needs_write_val_arg = false;
6388 };
6389
6390 template <int N>
6391 class extended_tree
6392 {
6393 private:
6394 const_tree m_t;
6395
6396 public:
6397 extended_tree () {}
6398 extended_tree (const_tree);
6399
6400 unsigned int get_precision () const;
6401 const HOST_WIDE_INT *get_val () const;
6402 unsigned int get_len () const;
6403 const_tree get_tree () const { return m_t; }
6404 };
6405
6406 template <int N>
6407 struct int_traits <extended_tree <N> >
6408 {
6409 static const enum precision_type precision_type
6410 = N == ADDR_MAX_PRECISION ? INL_CONST_PRECISION : CONST_PRECISION;
6411 static const bool host_dependent_precision = false;
6412 static const bool is_sign_extended = true;
6413 static const bool needs_write_val_arg = false;
6414 static const unsigned int precision = N;
6415 };
6416
6417 typedef extended_tree <WIDEST_INT_MAX_PRECISION> widest_extended_tree;
6418 typedef extended_tree <ADDR_MAX_PRECISION> offset_extended_tree;
6419
6420 typedef const generic_wide_int <widest_extended_tree> tree_to_widest_ref;
6421 typedef const generic_wide_int <offset_extended_tree> tree_to_offset_ref;
6422 typedef const generic_wide_int<wide_int_ref_storage<false, false> >
6423 tree_to_wide_ref;
6424
6425 tree_to_widest_ref to_widest (const_tree);
6426 tree_to_offset_ref to_offset (const_tree);
6427 tree_to_wide_ref to_wide (const_tree);
6428 wide_int to_wide (const_tree, unsigned int);
6429
6430 typedef const poly_int <NUM_POLY_INT_COEFFS,
6431 generic_wide_int <widest_extended_tree> >
6432 tree_to_poly_widest_ref;
6433 typedef const poly_int <NUM_POLY_INT_COEFFS,
6434 generic_wide_int <offset_extended_tree> >
6435 tree_to_poly_offset_ref;
6436 typedef const poly_int <NUM_POLY_INT_COEFFS,
6437 generic_wide_int <unextended_tree> >
6438 tree_to_poly_wide_ref;
6439
6440 tree_to_poly_widest_ref to_poly_widest (const_tree);
6441 tree_to_poly_offset_ref to_poly_offset (const_tree);
6442 tree_to_poly_wide_ref to_poly_wide (const_tree);
6443
6444 template <int N>
6445 struct ints_for <generic_wide_int <extended_tree <N> >, INL_CONST_PRECISION>
6446 {
6447 typedef generic_wide_int <extended_tree <N> > extended;
6448 static extended zero (const extended &);
6449 };
6450
6451 template <int N>
6452 struct ints_for <generic_wide_int <extended_tree <N> >, CONST_PRECISION>
6453 {
6454 typedef generic_wide_int <extended_tree <N> > extended;
6455 static extended zero (const extended &);
6456 };
6457
6458 template <>
6459 struct ints_for <generic_wide_int <unextended_tree>, VAR_PRECISION>
6460 {
6461 typedef generic_wide_int <unextended_tree> unextended;
6462 static unextended zero (const unextended &);
6463 };
6464}
6465
6466/* Used to convert a tree to a widest2_int like this:
6467 widest2_int foo = widest2_int_cst (some_tree). */
6468typedef generic_wide_int <wi::extended_tree <WIDEST_INT_MAX_PRECISION * 2> >
6469 widest2_int_cst;
6470
6471/* Refer to INTEGER_CST T as though it were a widest_int.
6472
6473 This function gives T's actual numerical value, influenced by the
6474 signedness of its type. For example, a signed byte with just the
6475 top bit set would be -128 while an unsigned byte with the same
6476 bit pattern would be 128.
6477
6478 This is the right choice when operating on groups of INTEGER_CSTs
6479 that might have different signedness or precision. It is also the
6480 right choice in code that specifically needs an approximation of
6481 infinite-precision arithmetic instead of normal modulo arithmetic.
6482
6483 The approximation of infinite precision is good enough for realistic
6484 numbers of additions and subtractions of INTEGER_CSTs (where
6485 "realistic" includes any number less than 1 << 31) but it cannot
6486 represent the result of multiplying the two largest supported
6487 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
6488 of multiplying two arbitrary INTEGER_CSTs and checking that the
6489 result is representable as a widest_int.
6490
6491 Note that any overflow checking done on these values is relative to
6492 the range of widest_int rather than the range of a TREE_TYPE.
6493
6494 Calling this function should have no overhead in release builds,
6495 so it is OK to call it several times for the same tree. If it is
6496 useful for readability reasons to reduce the number of calls,
6497 it is more efficient to use:
6498
6499 wi::tree_to_widest_ref wt = wi::to_widest (t);
6500
6501 instead of:
6502
6503 widest_int wt = wi::to_widest (t). */
6504
6505inline wi::tree_to_widest_ref
6506wi::to_widest (const_tree t)
6507{
6508 return t;
6509}
6510
6511/* Refer to INTEGER_CST T as though it were an offset_int.
6512
6513 This function is an optimisation of wi::to_widest for cases
6514 in which T is known to be a bit or byte count in the range
6515 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
6516 the target's address size in bits.
6517
6518 This is the right choice when operating on bit or byte counts as
6519 untyped numbers rather than M-bit values. The wi::to_widest comments
6520 about addition, subtraction and multiplication apply here: sequences
6521 of 1 << 31 additions and subtractions do not induce overflow, but
6522 multiplying the largest sizes might. Again,
6523
6524 wi::tree_to_offset_ref wt = wi::to_offset (t);
6525
6526 is more efficient than:
6527
6528 offset_int wt = wi::to_offset (t). */
6529
6530inline wi::tree_to_offset_ref
6531wi::to_offset (const_tree t)
6532{
6533 return t;
6534}
6535
6536/* Refer to INTEGER_CST T as though it were a wide_int.
6537
6538 In contrast to the approximation of infinite-precision numbers given
6539 by wi::to_widest and wi::to_offset, this function treats T as a
6540 signless collection of N bits, where N is the precision of T's type.
6541 As with machine registers, signedness is determined by the operation
6542 rather than the operands; for example, there is a distinction between
6543 signed and unsigned division.
6544
6545 This is the right choice when operating on values with the same type
6546 using normal modulo arithmetic. The overflow-checking forms of things
6547 like wi::add check whether the result can be represented in T's type.
6548
6549 Calling this function should have no overhead in release builds,
6550 so it is OK to call it several times for the same tree. If it is
6551 useful for readability reasons to reduce the number of calls,
6552 it is more efficient to use:
6553
6554 wi::tree_to_wide_ref wt = wi::to_wide (t);
6555
6556 instead of:
6557
6558 wide_int wt = wi::to_wide (t). */
6559
6560inline wi::tree_to_wide_ref
6561wi::to_wide (const_tree t)
6562{
6563 return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t),
6564 TYPE_PRECISION (TREE_TYPE (t)));
6565}
6566
6567/* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6568 truncating as necessary. When extending, use sign extension if T's
6569 type is signed and zero extension if T's type is unsigned. */
6570
6571inline wide_int
6572wi::to_wide (const_tree t, unsigned int prec)
6573{
6574 return wide_int::from (x: wi::to_wide (t), precision: prec, TYPE_SIGN (TREE_TYPE (t)));
6575}
6576
6577template <int N>
6578inline wi::extended_tree <N>::extended_tree (const_tree t)
6579 : m_t (t)
6580{
6581 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
6582}
6583
6584template <int N>
6585inline unsigned int
6586wi::extended_tree <N>::get_precision () const
6587{
6588 return N;
6589}
6590
6591template <int N>
6592inline const HOST_WIDE_INT *
6593wi::extended_tree <N>::get_val () const
6594{
6595 return &TREE_INT_CST_ELT (m_t, 0);
6596}
6597
6598template <int N>
6599inline unsigned int
6600wi::extended_tree <N>::get_len () const
6601{
6602 if (N == ADDR_MAX_PRECISION)
6603 {
6604 /* to_offset can only be applied to trees that are offset_int-sized
6605 or smaller. EXT_LEN is correct if it fits, otherwise the constant
6606 must be exactly the precision of offset_int and so LEN is correct. */
6607 unsigned int ext_len = TREE_INT_CST_EXT_NUNITS (m_t);
6608 if (ext_len <= OFFSET_INT_ELTS)
6609 return ext_len;
6610 return TREE_INT_CST_NUNITS (m_t);
6611 }
6612 else if (N >= WIDEST_INT_MAX_PRECISION)
6613 return TREE_INT_CST_EXT_NUNITS (m_t);
6614 else
6615 /* This class is designed to be used for specific output precisions
6616 and needs to be as fast as possible, so there is no fallback for
6617 other casees. */
6618 gcc_unreachable ();
6619}
6620
6621inline unsigned int
6622wi::unextended_tree::get_precision () const
6623{
6624 return TYPE_PRECISION (TREE_TYPE (m_t));
6625}
6626
6627inline const HOST_WIDE_INT *
6628wi::unextended_tree::get_val () const
6629{
6630 return &TREE_INT_CST_ELT (m_t, 0);
6631}
6632
6633inline unsigned int
6634wi::unextended_tree::get_len () const
6635{
6636 return TREE_INT_CST_NUNITS (m_t);
6637}
6638
6639/* Return the value of a POLY_INT_CST in its native precision. */
6640
6641inline wi::tree_to_poly_wide_ref
6642poly_int_cst_value (const_tree x)
6643{
6644 poly_int <NUM_POLY_INT_COEFFS, generic_wide_int <wi::unextended_tree> > res;
6645 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6646 res.coeffs[i] = POLY_INT_CST_COEFF (x, i);
6647 return res;
6648}
6649
6650/* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6651 poly_widest_int. See wi::to_widest for more details. */
6652
6653inline wi::tree_to_poly_widest_ref
6654wi::to_poly_widest (const_tree t)
6655{
6656 if (POLY_INT_CST_P (t))
6657 {
6658 poly_int <NUM_POLY_INT_COEFFS,
6659 generic_wide_int <widest_extended_tree> > res;
6660 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6661 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6662 return res;
6663 }
6664 return t;
6665}
6666
6667/* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6668 poly_offset_int. See wi::to_offset for more details. */
6669
6670inline wi::tree_to_poly_offset_ref
6671wi::to_poly_offset (const_tree t)
6672{
6673 if (POLY_INT_CST_P (t))
6674 {
6675 poly_int <NUM_POLY_INT_COEFFS,
6676 generic_wide_int <offset_extended_tree> > res;
6677 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6678 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6679 return res;
6680 }
6681 return t;
6682}
6683
6684/* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6685 poly_wide_int. See wi::to_wide for more details. */
6686
6687inline wi::tree_to_poly_wide_ref
6688wi::to_poly_wide (const_tree t)
6689{
6690 if (POLY_INT_CST_P (t))
6691 return poly_int_cst_value (x: t);
6692 return t;
6693}
6694
6695template <int N>
6696inline generic_wide_int <wi::extended_tree <N> >
6697wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6698 wi::INL_CONST_PRECISION>::zero (const extended &x)
6699{
6700 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6701}
6702
6703template <int N>
6704inline generic_wide_int <wi::extended_tree <N> >
6705wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6706 wi::CONST_PRECISION>::zero (const extended &x)
6707{
6708 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6709}
6710
6711inline generic_wide_int <wi::unextended_tree>
6712wi::ints_for <generic_wide_int <wi::unextended_tree>,
6713 wi::VAR_PRECISION>::zero (const unextended &x)
6714{
6715 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6716}
6717
6718namespace wi
6719{
6720 template <typename T>
6721 bool fits_to_boolean_p (const T &x, const_tree);
6722
6723 template <typename T>
6724 bool fits_to_tree_p (const T &x, const_tree);
6725
6726 wide_int min_value (const_tree);
6727 wide_int max_value (const_tree);
6728#ifndef GENERATOR_FILE
6729 wide_int from_mpz (const_tree, mpz_t, bool);
6730#endif
6731}
6732
6733template <typename T>
6734bool
6735wi::fits_to_boolean_p (const T &x, const_tree type)
6736{
6737 typedef typename poly_int_traits<T>::int_type int_type;
6738 return (known_eq (x, int_type (0))
6739 || known_eq (x, int_type (TYPE_UNSIGNED (type) ? 1 : -1)));
6740}
6741
6742template <typename T>
6743bool
6744wi::fits_to_tree_p (const T &x, const_tree type)
6745{
6746 /* Non-standard boolean types can have arbitrary precision but various
6747 transformations assume that they can only take values 0 and +/-1. */
6748 if (TREE_CODE (type) == BOOLEAN_TYPE)
6749 return fits_to_boolean_p (x, type);
6750
6751 if (TYPE_UNSIGNED (type))
6752 return known_eq (x, zext (x, TYPE_PRECISION (type)));
6753 else
6754 return known_eq (x, sext (x, TYPE_PRECISION (type)));
6755}
6756
6757/* Produce the smallest number that is represented in TYPE. The precision
6758 and sign are taken from TYPE. */
6759inline wide_int
6760wi::min_value (const_tree type)
6761{
6762 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6763}
6764
6765/* Produce the largest number that is represented in TYPE. The precision
6766 and sign are taken from TYPE. */
6767inline wide_int
6768wi::max_value (const_tree type)
6769{
6770 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6771}
6772
6773/* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6774 extending both according to their respective TYPE_SIGNs. */
6775
6776inline bool
6777tree_int_cst_lt (const_tree t1, const_tree t2)
6778{
6779 return wi::to_widest (t: t1) < wi::to_widest (t: t2);
6780}
6781
6782/* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6783 extending both according to their respective TYPE_SIGNs. */
6784
6785inline bool
6786tree_int_cst_le (const_tree t1, const_tree t2)
6787{
6788 return wi::to_widest (t: t1) <= wi::to_widest (t: t2);
6789}
6790
6791/* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6792 are both INTEGER_CSTs and their values are extended according to their
6793 respective TYPE_SIGNs. */
6794
6795inline int
6796tree_int_cst_compare (const_tree t1, const_tree t2)
6797{
6798 return wi::cmps (x: wi::to_widest (t: t1), y: wi::to_widest (t: t2));
6799}
6800
6801/* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6802 but none of these files are allowed to be included from front ends.
6803 They should be split in two. One suitable for the FEs, the other suitable
6804 for the BE. */
6805
6806/* Assign the RTX to declaration. */
6807extern void set_decl_rtl (tree, rtx);
6808extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
6809
6810/* Given an expression EXP that is a handled_component_p,
6811 look for the ultimate containing object, which is returned and specify
6812 the access position and size. */
6813extern tree get_inner_reference (tree, poly_int64 *, poly_int64 *,
6814 tree *, machine_mode *, int *, int *, int *);
6815
6816extern tree build_personality_function (const char *);
6817
6818struct GTY(()) int_n_trees_t {
6819 /* These parts are initialized at runtime */
6820 tree signed_type;
6821 tree unsigned_type;
6822};
6823
6824/* This is also in machmode.h */
6825extern bool int_n_enabled_p[NUM_INT_N_ENTS];
6826extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
6827
6828/* Like bit_position, but return as an integer. It must be representable in
6829 that way (since it could be a signed value, we don't have the
6830 option of returning -1 like int_size_in_byte can. */
6831
6832inline HOST_WIDE_INT
6833int_bit_position (const_tree field)
6834{
6835 return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT)
6836 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
6837}
6838
6839/* Return true if it makes sense to consider alias set for a type T. */
6840
6841inline bool
6842type_with_alias_set_p (const_tree t)
6843{
6844 /* Function and method types are never accessed as memory locations. */
6845 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
6846 return false;
6847
6848 if (COMPLETE_TYPE_P (t))
6849 return true;
6850
6851 /* Incomplete types cannot be accessed in general except for arrays
6852 where we can fetch its element despite we have no array bounds. */
6853 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
6854 return true;
6855
6856 return false;
6857}
6858
6859extern location_t set_block (location_t loc, tree block);
6860
6861extern void gt_ggc_mx (tree &);
6862extern void gt_pch_nx (tree &);
6863extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
6864extern void gt_ggc_mx (tree_raw_data *);
6865extern void gt_pch_nx (tree_raw_data *);
6866extern void gt_pch_nx (tree_raw_data *, gt_pointer_operator, void *);
6867
6868extern bool nonnull_arg_p (const_tree);
6869extern bool is_empty_type (const_tree);
6870extern bool default_is_empty_record (const_tree);
6871extern bool flexible_array_type_p (const_tree);
6872extern HOST_WIDE_INT arg_int_size_in_bytes (const_tree);
6873extern tree arg_size_in_bytes (const_tree);
6874extern bool expr_type_first_operand_type_p (tree_code);
6875
6876extern location_t
6877set_source_range (tree expr, location_t start, location_t finish);
6878
6879extern location_t
6880set_source_range (tree expr, source_range src_range);
6881
6882/* Return true if it makes sense to promote/demote from_type to to_type. */
6883inline bool
6884desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
6885{
6886 unsigned int to_type_precision = TYPE_PRECISION (to_type);
6887
6888 /* OK to promote if to_type is no bigger than word_mode. */
6889 if (to_type_precision <= GET_MODE_PRECISION (mode: word_mode))
6890 return true;
6891
6892 /* Otherwise, allow only if narrowing or same precision conversions. */
6893 return to_type_precision <= TYPE_PRECISION (from_type);
6894}
6895
6896/* Pointer type used to declare builtins before we have seen its real
6897 declaration. */
6898class builtin_structptr_type
6899{
6900public:
6901 tree& node;
6902 tree& base;
6903 const char *str;
6904};
6905extern const builtin_structptr_type builtin_structptr_types[6];
6906
6907/* Return true if type T has the same precision as its underlying mode. */
6908
6909inline bool
6910type_has_mode_precision_p (const_tree t)
6911{
6912 return known_eq (TYPE_PRECISION (t), GET_MODE_PRECISION (TYPE_MODE (t)));
6913}
6914
6915/* Helper functions for fndecl_built_in_p. */
6916
6917inline bool
6918built_in_function_equal_p (built_in_function name0, built_in_function name1)
6919{
6920 return name0 == name1;
6921}
6922
6923/* Recursive case for two or more names. */
6924
6925template <typename... F>
6926inline bool
6927built_in_function_equal_p (built_in_function name0, built_in_function name1,
6928 built_in_function name2, F... names)
6929{
6930 return name0 == name1 || built_in_function_equal_p (name0, name2, names...);
6931}
6932
6933/* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6934
6935 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6936 accessor, as this is impervious to user declaration. */
6937
6938inline bool
6939fndecl_built_in_p (const_tree node)
6940{
6941 return DECL_BUILT_IN_CLASS (node) != NOT_BUILT_IN;
6942}
6943
6944/* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6945 of class KLASS. */
6946
6947inline bool
6948fndecl_built_in_p (const_tree node, built_in_class klass)
6949{
6950 return fndecl_built_in_p (node) && DECL_BUILT_IN_CLASS (node) == klass;
6951}
6952
6953/* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6954 of class KLASS with name equal to NAME. */
6955
6956inline bool
6957fndecl_built_in_p (const_tree node, unsigned int name, built_in_class klass)
6958{
6959 return (fndecl_built_in_p (node, klass)
6960 && DECL_UNCHECKED_FUNCTION_CODE (node) == name);
6961}
6962
6963/* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6964 of BUILT_IN_NORMAL class with name equal to NAME1 (or other mentioned
6965 NAMES). */
6966
6967template <typename... F>
6968inline bool
6969fndecl_built_in_p (const_tree node, built_in_function name1, F... names)
6970{
6971 return (fndecl_built_in_p (node, klass: BUILT_IN_NORMAL)
6972 && built_in_function_equal_p (DECL_FUNCTION_CODE (decl: node),
6973 name1, names...));
6974}
6975
6976/* A struct for encapsulating location information about an operator
6977 and the operation built from it.
6978
6979 m_operator_loc is the location of the operator
6980 m_combined_loc is the location of the compound expression.
6981
6982 For example, given "a && b" the, operator location is:
6983 a && b
6984 ^~
6985 and the combined location is:
6986 a && b
6987 ~~^~~~
6988 Capturing this information allows for class binary_op_rich_location
6989 to provide detailed information about e.g. type mismatches in binary
6990 operations where enough location information is available:
6991
6992 arg_0 op arg_1
6993 ~~~~~ ^~ ~~~~~
6994 | |
6995 | arg1 type
6996 arg0 type
6997
6998 falling back to just showing the combined location:
6999
7000 arg_0 op arg_1
7001 ~~~~~~^~~~~~~~
7002
7003 where it is not. */
7004
7005class op_location_t
7006{
7007public:
7008 location_t m_operator_loc;
7009 location_t m_combined_loc;
7010
7011 /* 1-argument ctor, for constructing from a combined location. */
7012 op_location_t (location_t combined_loc)
7013 : m_operator_loc (UNKNOWN_LOCATION), m_combined_loc (combined_loc)
7014 {}
7015
7016 /* 2-argument ctor, for distinguishing between the operator's location
7017 and the combined location. */
7018 op_location_t (location_t operator_loc, location_t combined_loc)
7019 : m_operator_loc (operator_loc), m_combined_loc (combined_loc)
7020 {}
7021
7022 /* Implicitly convert back to a location_t, using the combined location. */
7023 operator location_t () const { return m_combined_loc; }
7024};
7025
7026/* Code that doesn't refer to any warning. Has no effect on suppression
7027 functions. */
7028constexpr opt_code no_warning = opt_code ();
7029/* Wildcard code that refers to all warnings. */
7030constexpr opt_code all_warnings = N_OPTS;
7031
7032/* Return the disposition for a warning (or all warnings by default)
7033 at a location. */
7034extern bool warning_suppressed_at (location_t, opt_code = all_warnings);
7035/* Set the disposition for a warning (or all warnings by default)
7036 at a location to disabled by default. */
7037extern bool suppress_warning_at (location_t, opt_code = all_warnings,
7038 bool = true);
7039/* Overwrite warning disposition bitmap for a location with given spec. */
7040extern void put_warning_spec_at (location_t loc, unsigned);
7041/* Copy warning disposition from one location to another. */
7042extern void copy_warning (location_t, location_t);
7043
7044/* Return the disposition for a warning (or all warnings by default)
7045 for an expression. */
7046extern bool warning_suppressed_p (const_tree, opt_code = all_warnings);
7047/* Set the disposition for a warning (or all warnings by default)
7048 at a location to disabled by default. */
7049extern void suppress_warning (tree, opt_code = all_warnings, bool = true)
7050 ATTRIBUTE_NONNULL (1);
7051/* Copy warning disposition from one expression to another. */
7052extern void copy_warning (tree, const_tree);
7053
7054/* Whether the tree might have a warning spec. */
7055extern bool has_warning_spec (const_tree);
7056/* Retrieve warning spec bitmap for tree streaming. */
7057extern unsigned get_warning_spec (const_tree);
7058/* Overwrite warning spec bitmap for a tree with given spec. */
7059extern void put_warning_spec (tree, unsigned);
7060
7061/* Return the zero-based number corresponding to the argument being
7062 deallocated if FNDECL is a deallocation function or an out-of-bounds
7063 value if it isn't. */
7064extern unsigned fndecl_dealloc_argno (tree);
7065
7066/* If an expression refers to a character array or pointer declared
7067 attribute nonstring, return a decl for that array or pointer and
7068 if nonnull, set the second argument to the referenced enclosing
7069 object or pointer. Otherwise return null. */
7070extern tree get_attr_nonstring_decl (tree, tree * = NULL);
7071
7072extern int get_target_clone_attr_len (tree);
7073
7074#endif /* GCC_TREE_H */
7075

Provided by KDAB

Privacy Policy
Learn to use CMake with our Intro Training
Find out more

source code of gcc/tree.h