1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2022 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
26 /* Convert a target-independent built-in function code to a combined_fn. */
29 as_combined_fn (built_in_function fn
)
31 return combined_fn (int (fn
));
34 /* Convert an internal function code to a combined_fn. */
37 as_combined_fn (internal_fn fn
)
39 return combined_fn (int (fn
) + int (END_BUILTINS
));
42 /* Return true if CODE is a target-independent built-in function. */
45 builtin_fn_p (combined_fn code
)
47 return int (code
) < int (END_BUILTINS
);
50 /* Return the target-independent built-in function represented by CODE.
51 Only valid if builtin_fn_p (CODE). */
53 inline built_in_function
54 as_builtin_fn (combined_fn code
)
56 gcc_checking_assert (builtin_fn_p (code
));
57 return built_in_function (int (code
));
60 /* Return true if CODE is an internal function. */
63 internal_fn_p (combined_fn code
)
65 return int (code
) >= int (END_BUILTINS
);
68 /* Return the internal function represented by CODE. Only valid if
69 internal_fn_p (CODE). */
72 as_internal_fn (combined_fn code
)
74 gcc_checking_assert (internal_fn_p (code
));
75 return internal_fn (int (code
) - int (END_BUILTINS
));
78 /* Macros for initializing `tree_contains_struct'. */
79 #define MARK_TS_BASE(C) \
80 (tree_contains_struct[C][TS_BASE] = true)
82 #define MARK_TS_TYPED(C) \
84 tree_contains_struct[C][TS_TYPED] = true)
86 #define MARK_TS_COMMON(C) \
88 tree_contains_struct[C][TS_COMMON] = true)
90 #define MARK_TS_TYPE_COMMON(C) \
91 (MARK_TS_COMMON (C), \
92 tree_contains_struct[C][TS_TYPE_COMMON] = true)
94 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
95 (MARK_TS_TYPE_COMMON (C), \
96 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
98 #define MARK_TS_TYPE_NON_COMMON(C) \
99 (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \
100 tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \
102 #define MARK_TS_DECL_MINIMAL(C) \
103 (MARK_TS_COMMON (C), \
104 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
106 #define MARK_TS_DECL_COMMON(C) \
107 (MARK_TS_DECL_MINIMAL (C), \
108 tree_contains_struct[C][TS_DECL_COMMON] = true)
110 #define MARK_TS_DECL_WRTL(C) \
111 (MARK_TS_DECL_COMMON (C), \
112 tree_contains_struct[C][TS_DECL_WRTL] = true)
114 #define MARK_TS_DECL_WITH_VIS(C) \
115 (MARK_TS_DECL_WRTL (C), \
116 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
118 #define MARK_TS_DECL_NON_COMMON(C) \
119 (MARK_TS_DECL_WITH_VIS (C), \
120 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
122 #define MARK_TS_EXP(C) \
123 (MARK_TS_TYPED (C), \
124 tree_contains_struct[C][TS_EXP] = true)
126 /* Returns the string representing CLASS. */
128 #define TREE_CODE_CLASS_STRING(CLASS)\
129 tree_code_class_strings[(int) (CLASS)]
131 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
133 /* Nonzero if NODE represents an exceptional code. */
135 #define EXCEPTIONAL_CLASS_P(NODE)\
136 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
138 /* Nonzero if NODE represents a constant. */
140 #define CONSTANT_CLASS_P(NODE)\
141 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
143 /* Nonzero if NODE represents a constant, or is a location wrapper
144 around such a node. */
146 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
147 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
149 /* Nonzero if NODE represents a type. */
151 #define TYPE_P(NODE)\
152 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
154 /* Nonzero if NODE represents a declaration. */
156 #define DECL_P(NODE)\
157 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
159 /* True if NODE designates a variable declaration. */
160 #define VAR_P(NODE) \
161 (TREE_CODE (NODE) == VAR_DECL)
163 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
165 #define VAR_OR_FUNCTION_DECL_P(DECL)\
166 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
168 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
169 ascending code order. */
171 #define INDIRECT_REF_P(NODE)\
172 (TREE_CODE (NODE) == INDIRECT_REF)
174 /* Nonzero if NODE represents a reference. */
176 #define REFERENCE_CLASS_P(NODE)\
177 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
179 /* Nonzero if NODE represents a comparison. */
181 #define COMPARISON_CLASS_P(NODE)\
182 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
184 /* Nonzero if NODE represents a unary arithmetic expression. */
186 #define UNARY_CLASS_P(NODE)\
187 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
189 /* Nonzero if NODE represents a binary arithmetic expression. */
191 #define BINARY_CLASS_P(NODE)\
192 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
194 /* Nonzero if NODE represents a statement expression. */
196 #define STATEMENT_CLASS_P(NODE)\
197 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
199 /* Nonzero if NODE represents a function call-like expression with a
200 variable-length operand vector. */
202 #define VL_EXP_CLASS_P(NODE)\
203 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
205 /* Nonzero if NODE represents any other expression. */
207 #define EXPRESSION_CLASS_P(NODE)\
208 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
210 /* Returns nonzero iff NODE represents a type or declaration. */
212 #define IS_TYPE_OR_DECL_P(NODE)\
213 (TYPE_P (NODE) || DECL_P (NODE))
215 /* Returns nonzero iff CLASS is the tree-code class of an
218 #define IS_EXPR_CODE_CLASS(CLASS)\
219 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
221 /* Returns nonzero iff NODE is an expression of some kind. */
223 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
225 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
228 /* Helper macros for math builtins. */
230 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
231 #define CASE_FLT_FN_FLOATN_NX(FN) \
232 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
233 case FN##F32X: case FN##F64X: case FN##F128X
234 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
235 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
237 #define NULL_TREE (tree) NULL
239 /* Define accessors for the fields that all tree nodes have
240 (though some fields are not used for all kinds of nodes). */
242 /* The tree-code says what kind of node it is.
243 Codes are defined in tree.def. */
244 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
245 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
247 /* When checking is enabled, errors will be generated if a tree node
248 is accessed incorrectly. The macros die with a fatal error. */
249 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
251 #define TREE_CHECK(T, CODE) \
252 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
254 #define TREE_NOT_CHECK(T, CODE) \
255 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
257 #define TREE_CHECK2(T, CODE1, CODE2) \
258 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
260 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
261 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
263 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
264 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
266 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
267 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
268 (CODE1), (CODE2), (CODE3)))
270 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
271 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
272 (CODE1), (CODE2), (CODE3), (CODE4)))
274 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
275 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
276 (CODE1), (CODE2), (CODE3), (CODE4)))
278 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
279 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
280 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
282 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
283 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
284 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
286 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
287 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
289 #define TREE_CLASS_CHECK(T, CLASS) \
290 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
292 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
293 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
295 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
296 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
298 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
299 (omp_clause_range_check ((T), (CODE1), (CODE2), \
300 __FILE__, __LINE__, __FUNCTION__))
302 /* These checks have to be special cased. */
303 #define EXPR_CHECK(T) \
304 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
306 /* These checks have to be special cased. */
307 #define NON_TYPE_CHECK(T) \
308 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
310 /* These checks have to be special cased. */
311 #define ANY_INTEGRAL_TYPE_CHECK(T) \
312 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
314 #define TREE_INT_CST_ELT_CHECK(T, I) \
315 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
317 #define TREE_VEC_ELT_CHECK(T, I) \
318 (*(CONST_CAST2 (tree *, typeof (T)*, \
319 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
321 #define OMP_CLAUSE_ELT_CHECK(T, I) \
322 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
324 /* Special checks for TREE_OPERANDs. */
325 #define TREE_OPERAND_CHECK(T, I) \
326 (*(CONST_CAST2 (tree*, typeof (T)*, \
327 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
329 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
330 (*(tree_operand_check_code ((T), (CODE), (I), \
331 __FILE__, __LINE__, __FUNCTION__)))
333 /* Nodes are chained together for many purposes.
334 Types are chained together to record them for being output to the debugger
335 (see the function `chain_type').
336 Decls in the same scope are chained together to record the contents
338 Statement nodes for successive statements used to be chained together.
339 Often lists of things are represented by TREE_LIST nodes that
340 are chained together. */
342 #define TREE_CHAIN(NODE) \
343 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
345 /* In all nodes that are expressions, this is the data type of the expression.
346 In POINTER_TYPE nodes, this is the type that the pointer points to.
347 In ARRAY_TYPE nodes, this is the type of the elements.
348 In VECTOR_TYPE nodes, this is the type of the elements. */
349 #define TREE_TYPE(NODE) \
350 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
352 extern void tree_contains_struct_check_failed (const_tree
,
353 const enum tree_node_structure_enum
,
354 const char *, int, const char *)
355 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
357 extern void tree_check_failed (const_tree
, const char *, int, const char *,
358 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
359 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
360 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
361 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
362 const char *, int, const char *)
363 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
364 extern void tree_range_check_failed (const_tree
, const char *, int,
365 const char *, enum tree_code
,
367 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
368 extern void tree_not_class_check_failed (const_tree
,
369 const enum tree_code_class
,
370 const char *, int, const char *)
371 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
372 extern void tree_int_cst_elt_check_failed (int, int, const char *,
374 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
375 extern void tree_vec_elt_check_failed (int, int, const char *,
377 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
378 extern void phi_node_elt_check_failed (int, int, const char *,
380 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
381 extern void tree_operand_check_failed (int, const_tree
,
382 const char *, int, const char *)
383 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
384 extern void omp_clause_check_failed (const_tree
, const char *, int,
385 const char *, enum omp_clause_code
)
386 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
387 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
389 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
390 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
391 const char *, enum omp_clause_code
,
392 enum omp_clause_code
)
393 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
395 #else /* not ENABLE_TREE_CHECKING, or not gcc */
397 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
398 #define TREE_CHECK(T, CODE) (T)
399 #define TREE_NOT_CHECK(T, CODE) (T)
400 #define TREE_CHECK2(T, CODE1, CODE2) (T)
401 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
402 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
403 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
404 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
405 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
406 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
407 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
408 #define TREE_CLASS_CHECK(T, CODE) (T)
409 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
410 #define EXPR_CHECK(T) (T)
411 #define NON_TYPE_CHECK(T) (T)
412 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
413 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
414 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
415 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
416 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
417 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
418 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
419 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
421 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
422 #define TREE_TYPE(NODE) ((NODE)->typed.type)
426 #define TREE_BLOCK(NODE) (tree_block (NODE))
427 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
429 #include "tree-check.h"
431 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
432 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
433 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
434 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
435 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
436 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
437 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
438 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
439 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
440 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
441 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
443 #define RECORD_OR_UNION_CHECK(T) \
444 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
445 #define NOT_RECORD_OR_UNION_CHECK(T) \
446 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
447 #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
448 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
450 #define NUMERICAL_TYPE_CHECK(T) \
451 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
454 /* Here is how primitive or already-canonicalized types' hash codes
456 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
458 /* A simple hash function for an arbitrary tree node. This must not be
459 used in hash tables which are saved to a PCH. */
460 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
462 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
463 #define CONVERT_EXPR_CODE_P(CODE) \
464 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
466 /* Similarly, but accept an expression instead of a tree code. */
467 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
469 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
471 #define CASE_CONVERT \
475 /* Given an expression as a tree, strip any conversion that generates
476 no instruction. Accepts both tree and const_tree arguments since
477 we are not modifying the tree itself. */
479 #define STRIP_NOPS(EXP) \
480 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
482 /* Like STRIP_NOPS, but don't let the signedness change either. */
484 #define STRIP_SIGN_NOPS(EXP) \
485 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
487 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
489 #define STRIP_TYPE_NOPS(EXP) \
490 while ((CONVERT_EXPR_P (EXP) \
491 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
492 && TREE_OPERAND (EXP, 0) != error_mark_node \
493 && (TREE_TYPE (EXP) \
494 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
495 (EXP) = TREE_OPERAND (EXP, 0)
497 /* Remove unnecessary type conversions according to
498 tree_ssa_useless_type_conversion. */
500 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
501 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
503 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
504 in use to provide a location_t. */
506 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
507 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
509 /* Nonzero if TYPE represents a vector type. */
511 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
513 /* Nonzero if TYPE represents a vector of booleans. */
515 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
516 (TREE_CODE (TYPE) == VECTOR_TYPE \
517 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
519 /* Nonzero if TYPE represents an integral type. Note that we do not
520 include COMPLEX types here. Keep these checks in ascending code
523 #define INTEGRAL_TYPE_P(TYPE) \
524 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
525 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
526 || TREE_CODE (TYPE) == INTEGER_TYPE)
528 /* Nonzero if TYPE represents an integral type, including complex
529 and vector integer types. */
531 #define ANY_INTEGRAL_TYPE_P(TYPE) \
532 (INTEGRAL_TYPE_P (TYPE) \
533 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
534 || VECTOR_TYPE_P (TYPE)) \
535 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
537 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
539 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
540 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
542 /* Nonzero if TYPE represents a saturating fixed-point type. */
544 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
545 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
547 /* Nonzero if TYPE represents a fixed-point type. */
549 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
551 /* Nonzero if TYPE represents a scalar floating-point type. */
553 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
555 /* Nonzero if TYPE represents a complex floating-point type. */
557 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
558 (TREE_CODE (TYPE) == COMPLEX_TYPE \
559 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
561 /* Nonzero if TYPE represents a vector integer type. */
563 #define VECTOR_INTEGER_TYPE_P(TYPE) \
564 (VECTOR_TYPE_P (TYPE) \
565 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
568 /* Nonzero if TYPE represents a vector floating-point type. */
570 #define VECTOR_FLOAT_TYPE_P(TYPE) \
571 (VECTOR_TYPE_P (TYPE) \
572 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
574 /* Nonzero if TYPE represents a floating-point type, including complex
575 and vector floating-point types. The vector and complex check does
576 not use the previous two macros to enable early folding. */
578 #define FLOAT_TYPE_P(TYPE) \
579 (SCALAR_FLOAT_TYPE_P (TYPE) \
580 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
581 || VECTOR_TYPE_P (TYPE)) \
582 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
584 /* Nonzero if TYPE represents a decimal floating-point type. */
585 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
586 (SCALAR_FLOAT_TYPE_P (TYPE) \
587 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
589 /* Nonzero if TYPE is a record or union type. */
590 #define RECORD_OR_UNION_TYPE_P(TYPE) \
591 (TREE_CODE (TYPE) == RECORD_TYPE \
592 || TREE_CODE (TYPE) == UNION_TYPE \
593 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
595 /* Nonzero if TYPE represents an aggregate (multi-component) type.
596 Keep these checks in ascending code order. */
598 #define AGGREGATE_TYPE_P(TYPE) \
599 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
601 /* Nonzero if TYPE represents a pointer or reference type.
602 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
603 ascending code order. */
605 #define POINTER_TYPE_P(TYPE) \
606 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
608 /* Nonzero if TYPE represents a pointer to function. */
609 #define FUNCTION_POINTER_TYPE_P(TYPE) \
610 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
612 /* Nonzero if this type is a complete type. */
613 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
615 /* Nonzero if this type is the (possibly qualified) void type. */
616 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
618 /* Nonzero if this type is complete or is cv void. */
619 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
620 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
622 /* Nonzero if this type is complete or is an array with unspecified bound. */
623 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
624 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
626 #define FUNC_OR_METHOD_TYPE_P(NODE) \
627 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
629 #define OPAQUE_TYPE_P(NODE) \
630 (TREE_CODE (NODE) == OPAQUE_TYPE)
632 /* Define many boolean fields that all tree nodes have. */
634 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
635 of this is needed. So it cannot be in a register.
636 In a FUNCTION_DECL it has no meaning.
637 In LABEL_DECL nodes, it means a goto for this label has been seen
638 from a place outside all binding contours that restore stack levels.
639 In an artificial SSA_NAME that points to a stack partition with at least
640 two variables, it means that at least one variable has TREE_ADDRESSABLE.
641 In ..._TYPE nodes, it means that objects of this type must be fully
642 addressable. This means that pieces of this object cannot go into
643 register parameters, for example. If this a function type, this
644 means that the value must be returned in memory.
645 In CONSTRUCTOR nodes, it means object constructed must be in memory.
646 In IDENTIFIER_NODEs, this means that some extern decl for this name
647 had its address taken. That matters for inline functions.
648 In a STMT_EXPR, it means we want the result of the enclosed expression. */
649 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
651 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
652 exit of a function. Calls for which this is true are candidates for tail
653 call optimizations. */
654 #define CALL_EXPR_TAILCALL(NODE) \
655 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
657 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
658 optimization for correctness. */
659 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
660 (CALL_EXPR_CHECK (NODE)->base.static_flag)
662 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
663 CASE_LOW operand has been processed. */
664 #define CASE_LOW_SEEN(NODE) \
665 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
667 #define PREDICT_EXPR_OUTCOME(NODE) \
668 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
669 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
670 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
671 #define PREDICT_EXPR_PREDICTOR(NODE) \
672 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
674 /* In a VAR_DECL, nonzero means allocate static storage.
675 In a FUNCTION_DECL, nonzero if function has been defined.
676 In a CONSTRUCTOR, nonzero means allocate static storage. */
677 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
679 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
680 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
682 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
683 should only be executed if an exception is thrown, not on normal exit
685 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
687 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
688 separate cleanup in honor_protect_cleanup_actions. */
689 #define TRY_CATCH_IS_CLEANUP(NODE) \
690 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
692 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
693 CASE_HIGH operand has been processed. */
694 #define CASE_HIGH_SEEN(NODE) \
695 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
697 /* Used to mark scoped enums. */
698 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
700 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
701 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
703 /* In an expr node (usually a conversion) this means the node was made
704 implicitly and should not lead to any sort of warning. In a decl node,
705 warnings concerning the decl should be suppressed. This is used at
706 least for used-before-set warnings, and it set after one warning is
708 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
710 /* Nonzero if we should warn about the change in empty class parameter
711 passing ABI in this TU. */
712 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
713 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
715 /* Nonzero if this type is "empty" according to the particular psABI. */
716 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
718 /* Used to indicate that this TYPE represents a compiler-generated entity. */
719 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
721 /* True if the type is indivisible at the source level, i.e. if its
722 component parts cannot be accessed directly. This is used to suppress
723 normal GNU extensions for target-specific vector types. */
724 #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
726 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
727 this string as an argument. */
728 #define TREE_SYMBOL_REFERENCED(NODE) \
729 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
731 /* Nonzero in a pointer or reference type means the data pointed to
732 by this type can alias anything. */
733 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
734 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
736 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
737 there was an overflow in folding. */
739 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
741 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
743 #define TREE_OVERFLOW_P(EXPR) \
744 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
746 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
747 nonzero means name is to be accessible from outside this translation unit.
748 In an IDENTIFIER_NODE, nonzero means an external declaration
749 accessible from outside this translation unit was previously seen
750 for this name in an inner scope. */
751 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
753 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
754 of cached values, or is something else. */
755 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
757 /* In a SAVE_EXPR, indicates that the original expression has already
758 been substituted with a VAR_DECL that contains the value. */
759 #define SAVE_EXPR_RESOLVED_P(NODE) \
760 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
762 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
764 #define CALL_EXPR_VA_ARG_PACK(NODE) \
765 (CALL_EXPR_CHECK (NODE)->base.public_flag)
767 /* In any expression, decl, or constant, nonzero means it has side effects or
768 reevaluation of the whole expression could produce a different value.
769 This is set if any subexpression is a function call, a side effect or a
770 reference to a volatile variable. In a ..._DECL, this is set only if the
771 declaration said `volatile'. This will never be set for a constant. */
772 #define TREE_SIDE_EFFECTS(NODE) \
773 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
775 /* In a LABEL_DECL, nonzero means this label had its address taken
776 and therefore can never be deleted and is a jump target for
778 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
780 /* Whether a case or a user-defined label is allowed to fall through to.
781 This is used to implement -Wimplicit-fallthrough. */
782 #define FALLTHROUGH_LABEL_P(NODE) \
783 (LABEL_DECL_CHECK (NODE)->base.private_flag)
785 /* Set on the artificial label created for break; stmt from a switch.
786 This is used to implement -Wimplicit-fallthrough. */
787 #define SWITCH_BREAK_LABEL_P(NODE) \
788 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
790 /* Set on label that is known not to be jumped to, it can be only
791 reached by falling through from previous statements.
792 This is used to implement -Wimplicit-fallthrough. */
793 #define UNUSED_LABEL_P(NODE) \
794 (LABEL_DECL_CHECK (NODE)->base.default_def_flag)
796 /* Nonzero means this expression is volatile in the C sense:
797 its address should be of type `volatile WHATEVER *'.
798 In other words, the declared item is volatile qualified.
799 This is used in _DECL nodes and _REF nodes.
800 On a FUNCTION_DECL node, this means the function does not
801 return normally. This is the same effect as setting
802 the attribute noreturn on the function in C.
804 In a ..._TYPE node, means this type is volatile-qualified.
805 But use TYPE_VOLATILE instead of this macro when the node is a type,
806 because eventually we may make that a different bit.
808 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
809 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
811 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
812 accessing the memory pointed to won't generate a trap. However,
813 this only applies to an object when used appropriately: it doesn't
814 mean that writing a READONLY mem won't trap.
816 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
817 (or slice of the array) always belongs to the range of the array.
818 I.e. that the access will not trap, provided that the access to
819 the base to the array will not trap. */
820 #define TREE_THIS_NOTRAP(NODE) \
821 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
822 ARRAY_RANGE_REF)->base.nothrow_flag)
824 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
825 nonzero means it may not be the lhs of an assignment.
826 Nonzero in a FUNCTION_DECL means this function should be treated
827 as "const" function (can only read its arguments). */
828 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
830 /* Value of expression is constant. Always on in all ..._CST nodes. May
831 also appear in an expression or decl where the value is constant. */
832 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
834 /* Nonzero if NODE, a type, has had its sizes gimplified. */
835 #define TYPE_SIZES_GIMPLIFIED(NODE) \
836 (TYPE_CHECK (NODE)->base.constant_flag)
838 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
839 #define DECL_UNSIGNED(NODE) \
840 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
842 /* In integral and pointer types, means an unsigned type. */
843 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
845 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
846 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
848 /* True if overflow wraps around for the given integral or pointer type. That
849 is, TYPE_MAX + 1 == TYPE_MIN. */
850 #define TYPE_OVERFLOW_WRAPS(TYPE) \
851 (POINTER_TYPE_P (TYPE) \
852 ? flag_wrapv_pointer \
853 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
856 /* True if overflow is undefined for the given integral or pointer type.
857 We may optimize on the assumption that values in the type never overflow.
859 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
860 must issue a warning based on warn_strict_overflow. In some cases
861 it will be appropriate to issue the warning immediately, and in
862 other cases it will be appropriate to simply set a flag and let the
863 caller decide whether a warning is appropriate or not. */
864 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
865 (POINTER_TYPE_P (TYPE) \
866 ? !flag_wrapv_pointer \
867 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
868 && !flag_wrapv && !flag_trapv))
870 /* True if overflow for the given integral type should issue a
872 #define TYPE_OVERFLOW_TRAPS(TYPE) \
873 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
875 /* True if an overflow is to be preserved for sanitization. */
876 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
877 (INTEGRAL_TYPE_P (TYPE) \
878 && !TYPE_OVERFLOW_WRAPS (TYPE) \
879 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
881 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
882 Nonzero in a FUNCTION_DECL means that the function has been compiled.
883 This is interesting in an inline function, since it might not need
884 to be compiled separately.
885 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
886 or TYPE_DECL if the debugging info for the type has been written.
887 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
888 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
890 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
892 /* Nonzero in a _DECL if the name is used in its scope.
893 Nonzero in an expr node means inhibit warning if value is unused.
894 In IDENTIFIER_NODEs, this means that some extern decl for this name
896 In a BLOCK, this means that the block contains variables that are used. */
897 #define TREE_USED(NODE) ((NODE)->base.used_flag)
899 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
900 throw an exception. In a CALL_EXPR, nonzero means the call cannot
901 throw. We can't easily check the node type here as the C++
902 frontend also uses this flag (for AGGR_INIT_EXPR). */
903 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
905 /* In a CALL_EXPR, means that it's safe to use the target of the call
906 expansion as the return slot for a call that returns in memory. */
907 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
908 (CALL_EXPR_CHECK (NODE)->base.private_flag)
910 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
911 passed by invisible reference (and the TREE_TYPE is a pointer to the true
913 #define DECL_BY_REFERENCE(NODE) \
914 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
915 RESULT_DECL)->decl_common.decl_by_reference_flag)
917 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
919 #define DECL_READ_P(NODE) \
920 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
922 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
923 attempting to share the stack slot with some other variable. */
924 #define DECL_NONSHAREABLE(NODE) \
925 (TREE_CHECK2 (NODE, VAR_DECL, \
926 RESULT_DECL)->decl_common.decl_nonshareable_flag)
928 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
929 buggy callers don't pass to the callee. */
930 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
931 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
933 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
934 thunked-to function. Be careful to avoid using this macro when one of the
935 next two applies instead. */
936 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
938 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
939 it has been built for the declaration of a variable-sized object and, if the
940 function being called is BUILT_IN_MEMCPY, means that it has been built for
941 the assignment of a variable-sized object. */
942 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
943 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
945 /* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or
946 DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete
947 expressions. Not set for C++20 destroying delete operators. */
948 #define CALL_FROM_NEW_OR_DELETE_P(NODE) \
949 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
951 /* Used in classes in C++. */
952 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
953 /* Used in classes in C++. */
954 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
956 /* True if reference type NODE is a C++ rvalue reference. */
957 #define TYPE_REF_IS_RVALUE(NODE) \
958 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
960 /* Nonzero in a _DECL if the use of the name is defined as a
961 deprecated feature by __attribute__((deprecated)). */
962 #define TREE_DEPRECATED(NODE) \
963 ((NODE)->base.deprecated_flag)
965 /* Nonzero in a _DECL if the use of the name is defined as an
966 unavailable feature by __attribute__((unavailable)). */
967 #define TREE_UNAVAILABLE(NODE) \
968 ((NODE)->base.u.bits.unavailable_flag)
970 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
971 aggregate, (as created by anon_aggr_name_format). */
972 #define IDENTIFIER_ANON_P(NODE) \
973 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
975 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
976 uses are to be substituted for uses of the TREE_CHAINed identifier. */
977 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
978 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
980 /* In an aggregate type, indicates that the scalar fields of the type are
981 stored in reverse order from the target order. This effectively
982 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
983 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
984 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
986 /* In a non-aggregate type, indicates a saturating type. */
987 #define TYPE_SATURATING(NODE) \
988 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
990 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
991 of bits stored in reverse order from the target order. This effectively
992 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
994 The overall strategy is to preserve the invariant that every scalar in
995 memory is associated with a single storage order, i.e. all accesses to
996 this scalar are done with the same storage order. This invariant makes
997 it possible to factor out the storage order in most transformations, as
998 only the address and/or the value (in target order) matter for them.
999 But, of course, the storage order must be preserved when the accesses
1000 themselves are rewritten or transformed. */
1001 #define REF_REVERSE_STORAGE_ORDER(NODE) \
1002 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
1004 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
1005 represented by a descriptor instead of a trampoline. */
1006 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
1007 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
1009 /* In a CALL_EXPR, indicates that this is an indirect call for which
1010 pointers to nested function are descriptors instead of trampolines. */
1011 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
1012 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
1014 /* These flags are available for each language front end to use internally. */
1015 #define TREE_LANG_FLAG_0(NODE) \
1016 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1017 #define TREE_LANG_FLAG_1(NODE) \
1018 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1019 #define TREE_LANG_FLAG_2(NODE) \
1020 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1021 #define TREE_LANG_FLAG_3(NODE) \
1022 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1023 #define TREE_LANG_FLAG_4(NODE) \
1024 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1025 #define TREE_LANG_FLAG_5(NODE) \
1026 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1027 #define TREE_LANG_FLAG_6(NODE) \
1028 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1030 /* Define additional fields and accessors for nodes representing constants. */
1032 #define TREE_INT_CST_NUNITS(NODE) \
1033 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1034 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1035 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1036 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1037 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1038 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1039 #define TREE_INT_CST_LOW(NODE) \
1040 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1042 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1043 targets with variable-sized modes. */
1044 #define POLY_INT_CST_P(NODE) \
1045 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1047 /* In a POLY_INT_CST node. */
1048 #define POLY_INT_CST_COEFF(NODE, I) \
1049 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1051 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1052 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1054 #define TREE_FIXED_CST_PTR(NODE) \
1055 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1056 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1058 /* In a STRING_CST */
1059 /* In C terms, this is sizeof, not strlen. */
1060 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1061 #define TREE_STRING_POINTER(NODE) \
1062 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1064 /* In a COMPLEX_CST node. */
1065 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1066 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1068 /* In a VECTOR_CST node. See generic.texi for details. */
1069 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1070 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1072 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1073 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1074 #define VECTOR_CST_NPATTERNS(NODE) \
1075 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1076 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1077 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1078 #define VECTOR_CST_DUPLICATE_P(NODE) \
1079 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1080 #define VECTOR_CST_STEPPED_P(NODE) \
1081 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1082 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1083 (VECTOR_CST_CHECK (NODE)->vector.elts)
1084 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1085 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1087 /* Define fields and accessors for some special-purpose tree nodes. */
1089 /* As with STRING_CST, in C terms this is sizeof, not strlen. */
1090 #define IDENTIFIER_LENGTH(NODE) \
1091 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1092 #define IDENTIFIER_POINTER(NODE) \
1093 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1094 #define IDENTIFIER_HASH_VALUE(NODE) \
1095 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1097 /* Translate a hash table identifier pointer to a tree_identifier
1098 pointer, and vice versa. */
1100 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1101 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1102 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1104 /* In a TREE_LIST node. */
1105 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1106 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1108 /* In a TREE_VEC node. */
1109 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1110 #define TREE_VEC_END(NODE) \
1111 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1113 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1115 /* In a CONSTRUCTOR node. */
1116 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1117 #define CONSTRUCTOR_ELT(NODE,IDX) \
1118 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1119 #define CONSTRUCTOR_NELTS(NODE) \
1120 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1121 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1122 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1124 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1125 value of each element (stored within VAL). IX must be a scratch variable
1126 of unsigned integer type. */
1127 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1128 for (IX = 0; (IX >= vec_safe_length (V)) \
1130 : ((VAL = (*(V))[IX].value), \
1134 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1135 the value of each element (stored within VAL) and its index (stored
1136 within INDEX). IX must be a scratch variable of unsigned integer type. */
1137 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1138 for (IX = 0; (IX >= vec_safe_length (V)) \
1140 : (((void) (VAL = (*V)[IX].value)), \
1141 (INDEX = (*V)[IX].index), \
1145 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1146 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1148 constructor_elt _ce___ = {INDEX, VALUE}; \
1149 vec_safe_push ((V), _ce___); \
1152 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1153 constructor output purposes. */
1154 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1155 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1157 /* True if NODE is a clobber right hand side, an expression of indeterminate
1158 value that clobbers the LHS in a copy instruction. We use a volatile
1159 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1160 In particular the volatile flag causes us to not prematurely remove
1161 such clobber instructions. */
1162 #define TREE_CLOBBER_P(NODE) \
1163 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1165 /* Return the clobber_kind of a CLOBBER CONSTRUCTOR. */
1166 #define CLOBBER_KIND(NODE) \
1167 (CONSTRUCTOR_CHECK (NODE)->base.u.bits.address_space)
1169 /* Define fields and accessors for some nodes that represent expressions. */
1171 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1172 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1173 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1174 && integer_zerop (TREE_OPERAND (NODE, 0)))
1176 /* In ordinary expression nodes. */
1177 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1178 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1180 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1181 length. Its value includes the length operand itself; that is,
1182 the minimum valid length is 1.
1183 Note that we have to bypass the use of TREE_OPERAND to access
1184 that field to avoid infinite recursion in expanding the macros. */
1185 #define VL_EXP_OPERAND_LENGTH(NODE) \
1186 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1188 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1189 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1190 /* Nonzero if gimple_debug_bind_p() (and thus
1191 gimple_debug_source_bind_p()) may possibly hold. */
1192 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1193 /* Nonzero if is_gimple_debug() may possibly hold. */
1194 #define MAY_HAVE_DEBUG_STMTS \
1195 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1197 /* In a LOOP_EXPR node. */
1198 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1200 /* The source location of this expression. Non-tree_exp nodes such as
1201 decls and constants can be shared among multiple locations, so
1203 #define EXPR_LOCATION(NODE) \
1204 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1205 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1206 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1207 != UNKNOWN_LOCATION)
1208 /* The location to be used in a diagnostic about this expression. Do not
1209 use this macro if the location will be assigned to other expressions. */
1210 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1211 ? (NODE)->exp.locus : (LOCUS))
1212 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1213 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1215 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1216 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1218 #define EXPR_HAS_RANGE(NODE) \
1219 (CAN_HAVE_RANGE_P (NODE) \
1220 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1223 /* True if a tree is an expression or statement that can have a
1225 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1227 static inline source_range
1228 get_expr_source_range (tree expr
)
1230 location_t loc
= EXPR_LOCATION (expr
);
1231 return get_range_from_loc (line_table
, loc
);
1234 extern void protected_set_expr_location (tree
, location_t
);
1235 extern void protected_set_expr_location_if_unset (tree
, location_t
);
1237 WARN_UNUSED_RESULT
extern tree
maybe_wrap_with_location (tree
, location_t
);
1239 extern int suppress_location_wrappers
;
1241 /* A class for suppressing the creation of location wrappers.
1242 Location wrappers will not be created during the lifetime
1243 of an instance of this class. */
1245 class auto_suppress_location_wrappers
1248 auto_suppress_location_wrappers () { ++suppress_location_wrappers
; }
1249 ~auto_suppress_location_wrappers () { --suppress_location_wrappers
; }
1252 /* In a TARGET_EXPR node. */
1253 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1254 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1255 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1256 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1257 on rhs of MODIFY_EXPR. */
1258 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1260 /* DECL_EXPR accessor. This gives access to the DECL associated with
1261 the given declaration statement. */
1262 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1264 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1266 /* COMPOUND_LITERAL_EXPR accessors. */
1267 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1268 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1269 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1270 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1272 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1273 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1274 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1275 /* True if there are case labels for all possible values of SWITCH_COND, either
1276 because there is a default: case label or because the case label ranges cover
1278 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1280 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1281 of a case label, respectively. */
1282 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1283 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1284 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1285 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1287 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1288 corresponding MEM_REF operands. */
1289 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1290 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1291 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1292 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1293 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1295 #define MR_DEPENDENCE_CLIQUE(NODE) \
1296 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1297 #define MR_DEPENDENCE_BASE(NODE) \
1298 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1300 /* The operands of a BIND_EXPR. */
1301 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1302 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1303 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1305 /* GOTO_EXPR accessor. This gives access to the label associated with
1306 a goto statement. */
1307 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1309 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1310 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1311 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1313 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1314 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1315 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1316 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1317 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1318 /* Nonzero if we want to create an ASM_INPUT instead of an
1319 ASM_OPERAND with no operands. */
1320 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1321 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1322 /* Nonzero if we want to consider this asm as minimum length and cost
1323 for inlining decisions. */
1324 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1326 /* COND_EXPR accessors. */
1327 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1328 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1329 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1331 /* Accessors for the chains of recurrences. */
1332 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1333 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1334 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1336 /* LABEL_EXPR accessor. This gives access to the label associated with
1337 the given label expression. */
1338 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1340 /* CATCH_EXPR accessors. */
1341 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1342 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1344 /* EH_FILTER_EXPR accessors. */
1345 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1346 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1348 /* OBJ_TYPE_REF accessors. */
1349 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1350 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1351 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1353 /* ASSERT_EXPR accessors. */
1354 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1355 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1357 /* CALL_EXPR accessors. */
1358 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1359 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1360 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1361 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1362 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1364 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1365 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1366 the argument count is zero when checking is enabled. Instead, do
1367 the pointer arithmetic to advance past the 3 fixed operands in a
1368 CALL_EXPR. That produces a valid pointer to just past the end of the
1369 operand array, even if it's not valid to dereference it. */
1370 #define CALL_EXPR_ARGP(NODE) \
1371 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1373 /* TM directives and accessors. */
1374 #define TRANSACTION_EXPR_BODY(NODE) \
1375 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1376 #define TRANSACTION_EXPR_OUTER(NODE) \
1377 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1378 #define TRANSACTION_EXPR_RELAXED(NODE) \
1379 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1381 /* OpenMP and OpenACC directive and clause accessors. */
1383 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1385 #define OMP_BODY(NODE) \
1386 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1387 #define OMP_CLAUSES(NODE) \
1388 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1390 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1391 #define OMP_STANDALONE_CLAUSES(NODE) \
1392 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1394 #define OACC_DATA_BODY(NODE) \
1395 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1396 #define OACC_DATA_CLAUSES(NODE) \
1397 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1399 #define OACC_HOST_DATA_BODY(NODE) \
1400 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1401 #define OACC_HOST_DATA_CLAUSES(NODE) \
1402 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1404 #define OACC_CACHE_CLAUSES(NODE) \
1405 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1407 #define OACC_DECLARE_CLAUSES(NODE) \
1408 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1410 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1411 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1413 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1414 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1416 #define OACC_UPDATE_CLAUSES(NODE) \
1417 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1419 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1420 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1422 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1423 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1425 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1426 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1427 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1429 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1430 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1431 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1432 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1433 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1434 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1435 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1436 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1438 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1439 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1441 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1443 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1444 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1446 #define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0)
1447 #define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1)
1449 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1451 #define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0)
1452 #define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1)
1454 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1455 #define OMP_TASKGROUP_CLAUSES(NODE) \
1456 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1458 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1459 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1461 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1462 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1463 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1465 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1466 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1468 #define OMP_TARGET_DATA_BODY(NODE) \
1469 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1470 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1471 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1473 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1474 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1476 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1477 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1479 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1480 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1482 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1483 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1485 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1486 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1488 #define OMP_CLAUSE_SIZE(NODE) \
1489 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1491 OMP_CLAUSE__CACHE_), 1)
1493 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1494 #define OMP_CLAUSE_DECL(NODE) \
1495 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1496 OMP_CLAUSE_PRIVATE, \
1497 OMP_CLAUSE__SCANTEMP_), 0)
1498 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1499 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1500 != UNKNOWN_LOCATION)
1501 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1503 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1504 is non-rectangular. */
1505 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1506 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1508 /* True on an OMP_SECTION statement that was the last lexical member.
1509 This status is meaningful in the implementation of lastprivate. */
1510 #define OMP_SECTION_LAST(NODE) \
1511 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1513 /* True on an OMP_PARALLEL statement if it represents an explicit
1514 combined parallel work-sharing constructs. */
1515 #define OMP_PARALLEL_COMBINED(NODE) \
1516 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1518 /* True on an OMP_TEAMS statement if it represents an explicit
1519 combined teams distribute constructs. */
1520 #define OMP_TEAMS_COMBINED(NODE) \
1521 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1523 /* True on an OMP_TARGET statement if it represents explicit
1524 combined target teams, target parallel or target simd constructs. */
1525 #define OMP_TARGET_COMBINED(NODE) \
1526 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1528 /* True on an OMP_MASTER statement if it represents an explicit
1529 combined master constructs. */
1530 #define OMP_MASTER_COMBINED(NODE) \
1531 (OMP_MASTER_CHECK (NODE)->base.private_flag)
1533 /* True on an OMP_MASKED statement if it represents an explicit
1534 combined masked constructs. */
1535 #define OMP_MASKED_COMBINED(NODE) \
1536 (OMP_MASKED_CHECK (NODE)->base.private_flag)
1538 /* Memory order for OMP_ATOMIC*. */
1539 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1540 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1541 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1543 /* Weak clause on OMP_ATOMIC*. */
1544 #define OMP_ATOMIC_WEAK(NODE) \
1545 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1546 OMP_ATOMIC_CAPTURE_NEW)->base.public_flag)
1548 /* True on a PRIVATE clause if its decl is kept around for debugging
1549 information only and its DECL_VALUE_EXPR is supposed to point
1550 to what it has been remapped to. */
1551 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1552 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1554 /* True on a PRIVATE clause if ctor needs access to outer region's
1556 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1557 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1559 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1560 (thus should be private on the outer taskloop and firstprivate on
1562 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1563 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1565 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1566 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1567 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1569 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1570 to should be firstprivatized. */
1571 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1572 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1574 /* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also
1575 set if target construct is the only one that accepts the clause. */
1576 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \
1577 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1579 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1580 decl is present in the chain. */
1581 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1582 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1583 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1584 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1585 OMP_CLAUSE_LASTPRIVATE),\
1587 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1588 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1590 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1591 loop construct (thus should be lastprivate on the outer taskloop and
1592 firstprivate on task for the taskloop construct and carefully handled
1593 for loop construct). */
1594 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1595 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1597 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1598 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1599 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1601 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1602 decl is present in the chain (this can happen only for taskloop
1603 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1604 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1605 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1607 /* True on a SHARED clause if a scalar is not modified in the body and
1608 thus could be optimized as firstprivate. */
1609 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1610 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1612 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1613 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1615 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1616 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1617 #define OMP_CLAUSE_IF_EXPR(NODE) \
1618 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1619 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1620 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1621 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1622 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1623 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1624 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1625 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1626 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1627 #define OMP_CLAUSE_FILTER_EXPR(NODE) \
1628 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0)
1630 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1631 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1633 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1634 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1636 #define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \
1637 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE))
1638 #define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \
1639 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS))
1641 /* OpenACC clause expressions */
1642 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1643 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1644 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1645 OMP_CLAUSE_OPERAND ( \
1646 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1647 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1648 OMP_CLAUSE_OPERAND ( \
1649 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1650 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1651 OMP_CLAUSE_OPERAND ( \
1652 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1653 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1654 OMP_CLAUSE_OPERAND ( \
1655 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1656 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1657 OMP_CLAUSE_OPERAND ( \
1658 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1659 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1660 OMP_CLAUSE_OPERAND ( \
1661 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1662 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1663 OMP_CLAUSE_OPERAND ( \
1664 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1665 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1666 OMP_CLAUSE_OPERAND ( \
1667 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1668 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1669 OMP_CLAUSE_OPERAND ( \
1670 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1672 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1673 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1675 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1676 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1678 #define OMP_CLAUSE_MAP_KIND(NODE) \
1679 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1680 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1681 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1682 = (unsigned int) (MAP_KIND))
1684 /* Nonzero if this map clause is for array (rather than pointer) based array
1685 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1686 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1687 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1688 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1689 /* Nonzero if this is a mapped array section, that might need special
1690 treatment if OMP_CLAUSE_SIZE is zero. */
1691 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1692 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1693 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1694 variable or OpenMP map clause mentioned also in in_reduction clause on the
1696 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1697 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1698 /* Nonzero on map clauses added implicitly for reduction clauses on combined
1699 or composite constructs. They shall be removed if there is an explicit
1701 #define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1702 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1703 /* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1704 due to being created through implicit data-mapping rules in the middle-end.
1705 NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1706 #define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1707 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1709 /* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1711 #define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1712 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1714 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1716 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1717 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1719 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1720 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1722 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1723 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1725 /* True if there is a device clause with a device-modifier 'ancestor'. */
1726 #define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
1727 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
1729 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1730 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1731 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1732 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1733 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1734 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1736 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1737 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1739 /* True for unconstrained modifier on order(concurrent) clause. */
1740 #define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
1741 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
1742 /* True for reproducible modifier on order(concurrent) clause. */
1743 #define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
1744 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
1746 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1747 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1748 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1749 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1750 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1751 OMP_CLAUSE_IN_REDUCTION), 1)
1752 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1753 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1754 OMP_CLAUSE_IN_REDUCTION), 2)
1755 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1756 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1757 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1758 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1759 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1760 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1761 OMP_CLAUSE_IN_REDUCTION), 3)
1762 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1763 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1764 OMP_CLAUSE_IN_REDUCTION), 4)
1766 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1767 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1768 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1769 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1770 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1772 /* True if a REDUCTION clause has task reduction-modifier. */
1773 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1774 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1776 /* True if a REDUCTION clause has inscan reduction-modifier. */
1777 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1778 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1780 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1781 are always initialized inside of the loop construct, false otherwise. */
1782 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1783 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1785 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1786 are declared inside of the simd construct. */
1787 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1788 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1790 /* True if a LINEAR clause has a stride that is variable. */
1791 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1792 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1794 /* True if a LINEAR clause is for an array or allocatable variable that
1795 needs special handling by the frontend. */
1796 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1797 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1799 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1802 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1803 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1805 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1806 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1808 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1809 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1811 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1812 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1814 #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1815 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1817 #define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
1818 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
1820 /* True if an ALLOCATE clause was present on a combined or composite
1821 construct and the code for splitting the clauses has already performed
1822 checking if the listed variable has explicit privatization on the
1824 #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1825 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1827 #define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
1828 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1830 #define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
1831 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
1833 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1834 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1835 OMP_CLAUSE_THREAD_LIMIT), 0)
1837 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1838 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1840 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1841 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1842 OMP_CLAUSE_DIST_SCHEDULE), 0)
1844 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1845 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1847 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1848 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1850 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1851 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1853 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1854 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1856 /* True if a SCHEDULE clause has the simd modifier on it. */
1857 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1858 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1860 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1861 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1863 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1864 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1865 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1866 ((enum omp_clause_defaultmap_kind) \
1867 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1868 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1869 ((enum omp_clause_defaultmap_kind) \
1870 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1871 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1872 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1873 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1875 #define OMP_CLAUSE_BIND_KIND(NODE) \
1876 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
1878 #define OMP_CLAUSE_TILE_LIST(NODE) \
1879 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1880 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1881 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1882 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1883 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1885 /* _CONDTEMP_ holding temporary with iteration count. */
1886 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
1887 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
1889 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
1891 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
1892 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
1894 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
1895 one boolean_type_node for test whether alloca was used, another one
1896 to pass to __builtin_stack_restore or free. */
1897 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
1898 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
1900 /* SSA_NAME accessors. */
1902 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1903 information in the underlying SSA_NAME_VAR for efficiency. */
1904 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1905 SSA_NAME_CHECK (NODE)->base.public_flag
1907 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1908 if there is no name associated with it. */
1909 #define SSA_NAME_IDENTIFIER(NODE) \
1910 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1911 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1912 ? (NODE)->ssa_name.var \
1913 : DECL_NAME ((NODE)->ssa_name.var)) \
1916 /* Returns the variable being referenced. This can be NULL_TREE for
1917 temporaries not associated with any user variable.
1918 Once released, this is the only field that can be relied upon. */
1919 #define SSA_NAME_VAR(NODE) \
1920 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1921 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1922 ? NULL_TREE : (NODE)->ssa_name.var)
1924 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1927 tree var_ = (VAR); \
1928 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1929 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1931 && TREE_CODE (var_) == VAR_DECL \
1932 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1936 /* Returns the statement which defines this SSA name. */
1937 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1939 /* Returns the SSA version number of this SSA name. Note that in
1940 tree SSA, version numbers are not per variable and may be recycled. */
1941 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1943 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1944 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1946 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1947 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1949 /* Nonzero if this SSA_NAME expression is currently on the free list of
1950 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1951 has no meaning for an SSA_NAME. */
1952 #define SSA_NAME_IN_FREE_LIST(NODE) \
1953 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1955 /* Nonzero if this SSA_NAME is the default definition for the
1956 underlying symbol. A default SSA name is created for symbol S if
1957 the very first reference to S in the function is a read operation.
1958 Default definitions are always created by an empty statement and
1959 belong to no basic block. */
1960 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1961 SSA_NAME_CHECK (NODE)->base.default_def_flag
1963 /* Nonzero if this SSA_NAME is known to point to memory that may not
1964 be written to. This is set for default defs of function parameters
1965 that have a corresponding r or R specification in the functions
1966 fn spec attribute. This is used by alias analysis. */
1967 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1968 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1970 /* Attributes for SSA_NAMEs for pointer-type variables. */
1971 #define SSA_NAME_PTR_INFO(N) \
1972 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1974 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1975 #define SSA_NAME_ANTI_RANGE_P(N) \
1976 SSA_NAME_CHECK (N)->base.static_flag
1978 /* The type of range described by SSA_NAME_RANGE_INFO. */
1979 #define SSA_NAME_RANGE_TYPE(N) \
1980 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1982 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1983 #define SSA_NAME_RANGE_INFO(N) \
1984 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1986 /* Return the immediate_use information for an SSA_NAME. */
1987 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1989 #define OMP_CLAUSE_CODE(NODE) \
1990 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1992 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1993 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1995 #define OMP_CLAUSE_OPERAND(NODE, I) \
1996 OMP_CLAUSE_ELT_CHECK (NODE, I)
1998 /* In a BLOCK (scope) node:
1999 Variables declared in the scope NODE. */
2000 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2001 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2002 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2003 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2004 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2005 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2006 /* A chain of BLOCKs (scopes) nested within the scope NODE. */
2007 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2008 /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2009 function scope. Inlined functions are chained by this so that given
2010 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2011 in which E has been made or into which E has been inlined. */
2012 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2013 /* Points to the next scope at the same level of nesting as scope NODE. */
2014 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2015 /* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2016 inlined. In a scope immediately enclosing an inlined leaf expression,
2017 points to the outermost scope into which it has been inlined (thus
2018 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2019 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2020 #define BLOCK_ORIGIN(NODE) \
2021 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2022 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2024 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2025 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2027 /* True if BLOCK appears in cold section. */
2028 #define BLOCK_IN_COLD_SECTION_P(NODE) \
2029 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2031 /* An index number for this block. These values are not guaranteed to
2032 be unique across functions -- whether or not they are depends on
2033 the debugging output format in use. */
2034 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2036 /* If block reordering splits a lexical block into discontiguous
2037 address ranges, we'll make a copy of the original block.
2039 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2040 In that case, we have one source block that has been replicated
2041 (through inlining or unrolling) into many logical blocks, and that
2042 these logical blocks have different physical variables in them.
2044 In this case, we have one logical block split into several
2045 non-contiguous address ranges. Most debug formats can't actually
2046 represent this idea directly, so we fake it by creating multiple
2047 logical blocks with the same variables in them. However, for those
2048 that do support non-contiguous regions, these allow the original
2049 logical block to be reconstructed, along with the set of address
2052 One of the logical block fragments is arbitrarily chosen to be
2053 the ORIGIN. The other fragments will point to the origin via
2054 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2055 be null. The list of fragments will be chained through
2056 BLOCK_FRAGMENT_CHAIN from the origin. */
2058 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2059 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2061 /* For an inlined function, this gives the location where it was called
2062 from. This is only set in the top level block, which corresponds to the
2063 inlined function scope. This is used in the debug output routines. */
2065 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2067 /* This gives the location of the end of the block, useful to attach
2068 code implicitly generated for outgoing paths. */
2070 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2072 /* Define fields and accessors for nodes representing data types. */
2074 /* See tree.def for documentation of the use of these fields.
2075 Look at the documentation of the various ..._TYPE tree codes.
2077 Note that the type.values, type.minval, and type.maxval fields are
2078 overloaded and used for different macros in different kinds of types.
2079 Each macro must check to ensure the tree node is of the proper kind of
2080 type. Note also that some of the front-ends also overload these fields,
2081 so they must be checked as well. */
2083 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2084 /* Type size in bits as a tree expression. Need not be constant and may
2085 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2086 class subobject with its own virtual base classes (which are laid out
2088 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2089 /* Likewise, type size in bytes. */
2090 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2091 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2092 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2093 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2094 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2095 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2096 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2097 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2099 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2100 #define TYPE_MODE(NODE) \
2101 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2102 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2103 #define SCALAR_TYPE_MODE(NODE) \
2104 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2105 #define SCALAR_INT_TYPE_MODE(NODE) \
2106 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2107 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2108 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2109 #define SET_TYPE_MODE(NODE, MODE) \
2110 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2112 extern machine_mode
element_mode (const_tree
);
2113 extern machine_mode
vector_type_mode (const_tree
);
2114 extern unsigned int vector_element_bits (const_tree
);
2115 extern tree
vector_element_bits_tree (const_tree
);
2117 /* The "canonical" type for this type node, which is used by frontends to
2118 compare the type for equality with another type. If two types are
2119 equal (based on the semantics of the language), then they will have
2120 equivalent TYPE_CANONICAL entries.
2122 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2123 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2124 be used for comparison against other types. Instead, the type is
2125 said to require structural equality checks, described in
2126 TYPE_STRUCTURAL_EQUALITY_P.
2128 For unqualified aggregate and function types the middle-end relies on
2129 TYPE_CANONICAL to tell whether two variables can be assigned
2130 to each other without a conversion. The middle-end also makes sure
2131 to assign the same alias-sets to the type partition with equal
2132 TYPE_CANONICAL of their unqualified variants. */
2133 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2134 /* Indicates that the type node requires structural equality
2135 checks. The compiler will need to look at the composition of the
2136 type to determine whether it is equal to another type, rather than
2137 just comparing canonical type pointers. For instance, we would need
2138 to look at the return and parameter types of a FUNCTION_TYPE
2140 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2141 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2142 type node requires structural equality. */
2143 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2145 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2146 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2148 /* The (language-specific) typed-based alias set for this type.
2149 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2150 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2151 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2152 type can alias objects of any type. */
2153 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2155 /* Nonzero iff the typed-based alias set for this type has been
2157 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2158 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2160 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2162 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2164 /* Raw access to the alignment field. */
2165 #define TYPE_ALIGN_RAW(NODE) \
2166 (TYPE_CHECK (NODE)->type_common.align)
2168 /* The alignment necessary for objects of this type.
2169 The value is an int, measured in bits and must be a power of two.
2170 We support also an "alignment" of zero. */
2171 #define TYPE_ALIGN(NODE) \
2172 (TYPE_ALIGN_RAW (NODE) \
2173 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2175 /* Specify that TYPE_ALIGN(NODE) is X. */
2176 #define SET_TYPE_ALIGN(NODE, X) \
2177 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2179 /* 1 if the alignment for this type was requested by "aligned" attribute,
2180 0 if it is the default for this type. */
2181 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2183 /* The alignment for NODE, in bytes. */
2184 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2186 /* The minimum alignment necessary for objects of this type without
2187 warning. The value is an int, measured in bits. */
2188 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2189 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2190 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2192 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2193 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2194 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2196 /* If your language allows you to declare types, and you want debug info
2197 for them, then you need to generate corresponding TYPE_DECL nodes.
2198 These "stub" TYPE_DECL nodes have no name, and simply point at the
2199 type node. You then set the TYPE_STUB_DECL field of the type node
2200 to point back at the TYPE_DECL node. This allows the debug routines
2201 to know that the two nodes represent the same type, so that we only
2202 get one debug info record for them. */
2203 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2205 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2206 the type has BLKmode only because it lacks the alignment required for
2208 #define TYPE_NO_FORCE_BLK(NODE) \
2209 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2211 /* Nonzero in a type considered volatile as a whole. */
2212 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2214 /* Nonzero in a type considered atomic as a whole. */
2215 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2217 /* Means this type is const-qualified. */
2218 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2220 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2222 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2224 /* If nonzero, type's name shouldn't be emitted into debug info. */
2225 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2227 /* The address space the type is in. */
2228 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2230 /* Encode/decode the named memory support as part of the qualifier. If more
2231 than 8 qualifiers are added, these macros need to be adjusted. */
2232 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2233 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2235 /* Return all qualifiers except for the address space qualifiers. */
2236 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2238 /* Only keep the address space out of the qualifiers and discard the other
2240 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2242 /* The set of type qualifiers for this type. */
2243 #define TYPE_QUALS(NODE) \
2244 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2245 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2246 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2247 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2248 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2250 /* The same as TYPE_QUALS without the address space qualifications. */
2251 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2252 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2253 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2254 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2255 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2257 /* The same as TYPE_QUALS without the address space and atomic
2259 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2260 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2261 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2262 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2264 /* These flags are available for each language front end to use internally. */
2265 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2266 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2267 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2268 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2269 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2270 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2271 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2272 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2274 /* Used to keep track of visited nodes in tree traversals. This is set to
2275 0 by copy_node and make_node. */
2276 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2278 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2279 that distinguish string from array of char).
2280 If set in a INTEGER_TYPE, indicates a character type. */
2281 #define TYPE_STRING_FLAG(NODE) \
2282 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2284 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2285 to the C++ one definition rule. This is used for LTO canonical type
2287 #define TYPE_CXX_ODR_P(NODE) \
2288 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2290 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2291 about missing conversions to other vector types of the same size. */
2292 #define TYPE_VECTOR_OPAQUE(NODE) \
2293 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2295 /* Indicates that objects of this type must be initialized by calling a
2296 function when they are created. */
2297 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2298 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2300 /* Indicates that a UNION_TYPE object should be passed the same way that
2301 the first union alternative would be passed, or that a RECORD_TYPE
2302 object should be passed the same way that the first (and only) member
2304 #define TYPE_TRANSPARENT_AGGR(NODE) \
2305 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2307 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2308 address of a component of the type. This is the counterpart of
2309 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2310 #define TYPE_NONALIASED_COMPONENT(NODE) \
2311 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2313 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2314 whether the array is typeless storage or the type contains a member
2315 with this flag set. Such types are exempt from type-based alias
2316 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2317 the flag should be inherited from the element type, can change
2318 when type is finalized and because of that should not be used in
2319 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2320 the flag should not be changed after the array is created and should
2321 be used in type hashing. */
2322 #define TYPE_TYPELESS_STORAGE(NODE) \
2323 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2324 ARRAY_TYPE)->type_common.typeless_storage)
2326 /* Indicated that objects of this type should be laid out in as
2327 compact a way as possible. */
2328 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2330 /* Used by type_contains_placeholder_p to avoid recomputation.
2331 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2332 this field directly. */
2333 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2334 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2336 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2337 #define TYPE_FINAL_P(NODE) \
2338 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2340 /* The debug output functions use the symtab union field to store
2341 information specific to the debugging format. The different debug
2342 output hooks store different types in the union field. These three
2343 macros are used to access different fields in the union. The debug
2344 hooks are responsible for consistently using only a specific
2347 /* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2348 hold the type's number in the generated stabs. */
2349 #define TYPE_SYMTAB_ADDRESS(NODE) \
2350 (TYPE_CHECK (NODE)->type_common.symtab.address)
2352 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2353 in dwarf2out.cc to point to the DIE generated for the type. */
2354 #define TYPE_SYMTAB_DIE(NODE) \
2355 (TYPE_CHECK (NODE)->type_common.symtab.die)
2357 /* The garbage collector needs to know the interpretation of the
2358 symtab field. These constants represent the different types in the
2361 #define TYPE_SYMTAB_IS_ADDRESS (0)
2362 #define TYPE_SYMTAB_IS_DIE (1)
2364 #define TYPE_LANG_SPECIFIC(NODE) \
2365 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2367 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2368 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2369 #define TYPE_FIELDS(NODE) \
2370 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2371 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2372 #define TYPE_ARG_TYPES(NODE) \
2373 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2374 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2376 #define TYPE_MIN_VALUE(NODE) \
2377 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2378 #define TYPE_NEXT_PTR_TO(NODE) \
2379 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2380 #define TYPE_NEXT_REF_TO(NODE) \
2381 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2382 #define TYPE_VFIELD(NODE) \
2383 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2384 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2386 #define TYPE_MAX_VALUE(NODE) \
2387 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2388 #define TYPE_METHOD_BASETYPE(NODE) \
2389 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2390 #define TYPE_OFFSET_BASETYPE(NODE) \
2391 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2392 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2393 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2395 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2396 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2397 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2398 /* For record and union types, information about this type, as a base type
2400 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2402 /* For types, used in a language-dependent way. */
2403 #define TYPE_LANG_SLOT_1(NODE) \
2404 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2406 /* Define accessor macros for information about type inheritance
2409 A "basetype" means a particular usage of a data type for inheritance
2410 in another type. Each such basetype usage has its own "binfo"
2411 object to describe it. The binfo object is a TREE_VEC node.
2413 Inheritance is represented by the binfo nodes allocated for a
2414 given type. For example, given types C and D, such that D is
2415 inherited by C, 3 binfo nodes will be allocated: one for describing
2416 the binfo properties of C, similarly one for D, and one for
2417 describing the binfo properties of D as a base type for C.
2418 Thus, given a pointer to class C, one can get a pointer to the binfo
2419 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2421 /* BINFO specific flags. */
2423 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2424 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2426 /* Flags for language dependent use. */
2427 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2428 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2429 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2430 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2431 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2432 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2433 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2435 /* The actual data type node being inherited in this basetype. */
2436 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2438 /* The offset where this basetype appears in its containing type.
2439 BINFO_OFFSET slot holds the offset (in bytes)
2440 from the base of the complete object to the base of the part of the
2441 object that is allocated on behalf of this `type'.
2442 This is always 0 except when there is multiple inheritance. */
2444 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2445 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2447 /* The virtual function table belonging to this basetype. Virtual
2448 function tables provide a mechanism for run-time method dispatching.
2449 The entries of a virtual function table are language-dependent. */
2451 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2453 /* The virtual functions in the virtual function table. This is
2454 a TREE_LIST that is used as an initial approximation for building
2455 a virtual function table for this basetype. */
2456 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2458 /* A vector of binfos for the direct basetypes inherited by this
2461 If this basetype describes type D as inherited in C, and if the
2462 basetypes of D are E and F, then this vector contains binfos for
2463 inheritance of E and F by C. */
2464 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2466 /* The number of basetypes for NODE. */
2467 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2469 /* Accessor macro to get to the Nth base binfo of this binfo. */
2470 #define BINFO_BASE_BINFO(NODE,N) \
2471 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2472 #define BINFO_BASE_ITERATE(NODE,N,B) \
2473 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2474 #define BINFO_BASE_APPEND(NODE,T) \
2475 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2477 /* For a BINFO record describing a virtual base class, i.e., one where
2478 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2479 base. The actual contents are language-dependent. In the C++
2480 front-end this field is an INTEGER_CST giving an offset into the
2481 vtable where the offset to the virtual base can be found. */
2482 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2484 /* Indicates the accesses this binfo has to its bases. The values are
2485 access_public_node, access_protected_node or access_private_node.
2486 If this array is not present, public access is implied. */
2487 #define BINFO_BASE_ACCESSES(NODE) \
2488 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2490 #define BINFO_BASE_ACCESS(NODE,N) \
2491 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2492 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2493 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2495 /* The index in the VTT where this subobject's sub-VTT can be found.
2496 NULL_TREE if there is no sub-VTT. */
2497 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2499 /* The index in the VTT where the vptr for this subobject can be
2500 found. NULL_TREE if there is no secondary vptr in the VTT. */
2501 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2503 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2504 inheriting this base for non-virtual bases. For virtual bases it
2505 points either to the binfo for which this is a primary binfo, or to
2506 the binfo of the most derived type. */
2507 #define BINFO_INHERITANCE_CHAIN(NODE) \
2508 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2511 /* Define fields and accessors for nodes representing declared names. */
2513 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2514 have an associated SSA name. */
2515 #define SSA_VAR_P(DECL) \
2516 (TREE_CODE (DECL) == VAR_DECL \
2517 || TREE_CODE (DECL) == PARM_DECL \
2518 || TREE_CODE (DECL) == RESULT_DECL \
2519 || TREE_CODE (DECL) == SSA_NAME)
2522 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2524 /* This is the name of the object as written by the user.
2525 It is an IDENTIFIER_NODE. */
2526 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2528 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2529 #define TYPE_IDENTIFIER(NODE) \
2530 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2531 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2533 /* Every ..._DECL node gets a unique number. */
2534 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2536 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2538 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2540 /* Every ..._DECL node gets a unique number that stays the same even
2541 when the decl is copied by the inliner once it is set. */
2542 #define DECL_PT_UID(NODE) \
2543 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2544 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2545 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2546 #define SET_DECL_PT_UID(NODE, UID) \
2547 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2548 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2549 be preserved when copyin the decl. */
2550 #define DECL_PT_UID_SET_P(NODE) \
2551 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2553 /* These two fields describe where in the source code the declaration
2554 was. If the declaration appears in several places (as for a C
2555 function that is declared first and then defined later), this
2556 information should refer to the definition. */
2557 #define DECL_SOURCE_LOCATION(NODE) \
2558 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2559 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2560 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2561 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2562 /* This decl was created by a front-end or back-end rather than by
2563 user code, and has not been explicitly declared by the user -- when
2564 that happens the source location is updated to the user's
2565 source. This includes decls with no location (!). */
2566 #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2567 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2569 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2570 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2571 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2572 nodes, this points to either the FUNCTION_DECL for the containing
2573 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2574 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2575 scope". In particular, for VAR_DECLs which are virtual table pointers
2576 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2578 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2579 #define DECL_FIELD_CONTEXT(NODE) \
2580 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2582 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2583 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2585 /* For any sort of a ..._DECL node, this points to the original (abstract)
2586 decl node which this decl is an inlined/cloned instance of, or else it
2587 is NULL indicating that this decl is not an instance of some other decl.
2589 The C front-end also uses this in a nested declaration of an inline
2590 function, to point back to the definition. */
2591 #define DECL_ABSTRACT_ORIGIN(NODE) \
2592 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2594 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2595 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2596 #define DECL_ORIGIN(NODE) \
2597 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2599 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2600 inline instance of some original (abstract) decl from an inline function;
2601 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2602 nodes can also have their abstract origin set to themselves. */
2603 #define DECL_FROM_INLINE(NODE) \
2604 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2605 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2607 /* In a DECL this is the field where attributes are stored. */
2608 #define DECL_ATTRIBUTES(NODE) \
2609 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2611 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2612 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2613 For a VAR_DECL, holds the initial value.
2614 For a PARM_DECL, used for DECL_ARG_TYPE--default
2615 values for parameters are encoded in the type of the function,
2616 not in the PARM_DECL slot.
2617 For a FIELD_DECL, this is used for enumeration values and the C
2618 frontend uses it for temporarily storing bitwidth of bitfields.
2620 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2621 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2623 /* Holds the size of the datum, in bits, as a tree expression.
2624 Need not be constant and may be null. May be less than TYPE_SIZE
2625 for a C++ FIELD_DECL representing a base class subobject with its
2626 own virtual base classes (which are laid out separately). */
2627 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2628 /* Likewise for the size in bytes. */
2629 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2630 #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2631 /* Returns the alignment required for the datum, in bits. It must
2632 be a power of two, but an "alignment" of zero is supported
2633 (e.g. as "uninitialized" sentinel). */
2634 #define DECL_ALIGN(NODE) \
2635 (DECL_ALIGN_RAW (NODE) \
2636 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2637 /* Specify that DECL_ALIGN(NODE) is X. */
2638 #define SET_DECL_ALIGN(NODE, X) \
2639 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2641 /* The minimum alignment necessary for the datum, in bits, without
2643 #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2644 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2645 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2646 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2647 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2649 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2650 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2651 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2653 /* The alignment of NODE, in bytes. */
2654 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2655 /* Set if the alignment of this DECL has been set by the user, for
2656 example with an 'aligned' attribute. */
2657 #define DECL_USER_ALIGN(NODE) \
2658 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2659 /* Holds the machine mode corresponding to the declaration of a variable or
2660 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2662 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2663 #define SET_DECL_MODE(NODE, MODE) \
2664 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2666 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2667 operation it is. This is only intended for low-level accesses;
2668 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2669 should be used instead. */
2670 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2671 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2673 /* Test if FCODE is a function code for an alloca operation. */
2674 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2675 ((FCODE) == BUILT_IN_ALLOCA \
2676 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2677 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2679 /* Generate case for an alloca operation. */
2680 #define CASE_BUILT_IN_ALLOCA \
2681 case BUILT_IN_ALLOCA: \
2682 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2683 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2685 #define DECL_FUNCTION_PERSONALITY(NODE) \
2686 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2688 /* Nonzero for a given ..._DECL node means that the name of this node should
2689 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2690 the associated type should be ignored. For a FUNCTION_DECL, the body of
2691 the function should also be ignored. */
2692 #define DECL_IGNORED_P(NODE) \
2693 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2695 /* Nonzero for a given ..._DECL node means that this node represents an
2696 "abstract instance" of the given declaration (e.g. in the original
2697 declaration of an inline function). When generating symbolic debugging
2698 information, we mustn't try to generate any address information for nodes
2699 marked as "abstract instances" because we don't actually generate
2700 any code or allocate any data space for such instances. */
2701 #define DECL_ABSTRACT_P(NODE) \
2702 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2704 /* Language-specific decl information. */
2705 #define DECL_LANG_SPECIFIC(NODE) \
2706 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2708 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2709 do not allocate storage, and refer to a definition elsewhere. Note that
2710 this does not necessarily imply the entity represented by NODE
2711 has no program source-level definition in this translation unit. For
2712 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2713 DECL_EXTERNAL may be true simultaneously; that can be the case for
2714 a C99 "extern inline" function. */
2715 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2717 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2718 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2720 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2722 Also set in some languages for variables, etc., outside the normal
2723 lexical scope, such as class instance variables. */
2724 #define DECL_NONLOCAL(NODE) \
2725 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2727 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2728 Used in FIELD_DECLs for vtable pointers.
2729 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2730 #define DECL_VIRTUAL_P(NODE) \
2731 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2733 /* Used to indicate that this DECL represents a compiler-generated entity. */
2734 #define DECL_ARTIFICIAL(NODE) \
2735 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2737 /* Additional flags for language-specific uses. */
2738 #define DECL_LANG_FLAG_0(NODE) \
2739 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2740 #define DECL_LANG_FLAG_1(NODE) \
2741 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2742 #define DECL_LANG_FLAG_2(NODE) \
2743 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2744 #define DECL_LANG_FLAG_3(NODE) \
2745 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2746 #define DECL_LANG_FLAG_4(NODE) \
2747 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2748 #define DECL_LANG_FLAG_5(NODE) \
2749 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2750 #define DECL_LANG_FLAG_6(NODE) \
2751 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2752 #define DECL_LANG_FLAG_7(NODE) \
2753 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2754 #define DECL_LANG_FLAG_8(NODE) \
2755 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2757 /* Nonzero for a scope which is equal to file scope. */
2758 #define SCOPE_FILE_SCOPE_P(EXP) \
2759 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2760 /* Nonzero for a decl which is at file scope. */
2761 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2762 /* Nonzero for a type which is at file scope. */
2763 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2765 /* Nonzero for a decl that is decorated using attribute used.
2766 This indicates to compiler tools that this decl needs to be preserved. */
2767 #define DECL_PRESERVE_P(DECL) \
2768 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2770 /* Nonzero for a decl that is decorated with the "noinit" attribute.
2771 decls with this attribute are placed into the ".noinit" section, so they are
2772 not initialized by the target's startup code. */
2773 #define DECL_NOINIT_P(DECL) \
2775 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2777 /* Nonzero for a decl that is decorated with the "persistent" attribute.
2778 decls with this attribute are placed into the ".persistent" section, so they
2779 are not initialized by the target's startup code. */
2780 #define DECL_PERSISTENT_P(DECL) \
2782 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2784 /* For function local variables of COMPLEX and VECTOR types,
2785 indicates that the variable is not aliased, and that all
2786 modifications to the variable have been adjusted so that
2787 they are killing assignments. Thus the variable may now
2788 be treated as a GIMPLE register, and use real instead of
2789 virtual ops in SSA form. */
2790 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2791 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2793 extern tree
decl_value_expr_lookup (tree
);
2794 extern void decl_value_expr_insert (tree
, tree
);
2796 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2797 if transformations have made this more complicated than evaluating the
2799 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2800 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2801 ->decl_common.decl_flag_2)
2802 #define DECL_VALUE_EXPR(NODE) \
2803 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2804 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2805 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2807 /* Holds the RTL expression for the value of a variable or function.
2808 This value can be evaluated lazily for functions, variables with
2809 static storage duration, and labels. */
2810 #define DECL_RTL(NODE) \
2811 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2812 ? (NODE)->decl_with_rtl.rtl \
2813 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2815 /* Set the DECL_RTL for NODE to RTL. */
2816 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2818 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2819 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2821 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2822 #define DECL_RTL_SET_P(NODE) \
2823 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2825 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2826 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2827 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2828 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2829 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2831 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2832 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2834 #if (GCC_VERSION >= 2007)
2835 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2836 ({ tree const __d = (decl); \
2837 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2838 /* Dereference it so the compiler knows it can't be NULL even \
2839 without assertion checking. */ \
2840 &*DECL_RTL_IF_SET (__d); })
2842 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2845 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2846 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2848 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2849 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2850 of the structure. */
2851 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2853 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2854 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2855 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2856 natural alignment of the field's type). */
2857 #define DECL_FIELD_BIT_OFFSET(NODE) \
2858 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2860 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2861 if so, the type that was originally specified for it.
2862 TREE_TYPE may have been modified (in finish_struct). */
2863 #define DECL_BIT_FIELD_TYPE(NODE) \
2864 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2866 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2867 representative FIELD_DECL. */
2868 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2869 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2871 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2872 if nonzero, indicates that the field occupies the type. */
2873 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2875 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2876 DECL_FIELD_OFFSET which are known to be always zero.
2877 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2879 #define DECL_OFFSET_ALIGN(NODE) \
2880 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2882 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2883 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2884 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2886 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2887 which this FIELD_DECL is defined. This information is needed when
2888 writing debugging information about vfield and vbase decls for C++. */
2889 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2891 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2892 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2894 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2896 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2898 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
2899 like passing/returning containing struct by value.
2900 Set for C++17 empty base artificial FIELD_DECLs as well as
2901 empty [[no_unique_address]] non-static data members. */
2902 #define DECL_FIELD_ABI_IGNORED(NODE) \
2903 (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
2904 #define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
2906 gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
2907 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
2910 /* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
2911 removed from the IL since PR42217 until PR101539 and by that changed
2912 the ABI on several targets. This flag is provided so that the backends
2913 can decide on the ABI with zero-width bitfields and emit -Wpsabi
2915 #define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
2916 (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
2917 #define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
2919 gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
2920 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
2923 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2924 this component. This makes it possible for Type-Based Alias Analysis
2925 to disambiguate accesses to this field with indirect accesses using
2928 struct S { int i; } s;
2931 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2933 From the implementation's viewpoint, the alias set of the type of the
2934 field 'i' (int) will not be recorded as a subset of that of the type of
2935 's' (struct S) in record_component_aliases. The counterpart is that
2936 accesses to s.i must not be given the alias set of the type of 'i'
2937 (int) but instead directly that of the type of 's' (struct S). */
2938 #define DECL_NONADDRESSABLE_P(NODE) \
2939 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2941 /* Used in a FIELD_DECL to indicate that this field is padding. */
2942 #define DECL_PADDING_P(NODE) \
2943 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2945 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2946 dense, unique within any one function, and may be used to index arrays.
2947 If the value is -1, then no UID has been assigned. */
2948 #define LABEL_DECL_UID(NODE) \
2949 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2951 /* In a LABEL_DECL, the EH region number for which the label is the
2952 post_landing_pad. */
2953 #define EH_LANDING_PAD_NR(NODE) \
2954 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2956 /* For a PARM_DECL, records the data type used to pass the argument,
2957 which may be different from the type seen in the program. */
2958 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2960 /* For PARM_DECL, holds an RTL for the stack slot or register
2961 where the data was actually passed. */
2962 #define DECL_INCOMING_RTL(NODE) \
2963 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2965 /* Nonzero for a given ..._DECL node means that no warnings should be
2966 generated just because this node is unused. */
2967 #define DECL_IN_SYSTEM_HEADER(NODE) \
2968 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2970 /* Used to indicate that the linkage status of this DECL is not yet known,
2971 so it should not be output now. */
2972 #define DECL_DEFER_OUTPUT(NODE) \
2973 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2975 /* In a VAR_DECL that's static,
2976 nonzero if the space is in the text section. */
2977 #define DECL_IN_TEXT_SECTION(NODE) \
2978 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2980 /* In a VAR_DECL that's static,
2981 nonzero if it belongs to the global constant pool. */
2982 #define DECL_IN_CONSTANT_POOL(NODE) \
2983 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2985 /* Nonzero for a given ..._DECL node means that this node should be
2986 put in .common, if possible. If a DECL_INITIAL is given, and it
2987 is not error_mark_node, then the decl cannot be put in .common. */
2988 #define DECL_COMMON(NODE) \
2989 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2991 /* In a VAR_DECL, nonzero if the decl is a register variable with
2992 an explicit asm specification. */
2993 #define DECL_HARD_REGISTER(NODE) \
2994 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2996 /* Used to indicate that this DECL has weak linkage. */
2997 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2999 /* Used to indicate that the DECL is a dllimport. */
3000 #define DECL_DLLIMPORT_P(NODE) \
3001 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3003 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3004 not be put out unless it is needed in this translation unit.
3005 Entities like this are shared across translation units (like weak
3006 entities), but are guaranteed to be generated by any translation
3007 unit that needs them, and therefore need not be put out anywhere
3008 where they are not needed. DECL_COMDAT is just a hint to the
3009 back-end; it is up to front-ends which set this flag to ensure
3010 that there will never be any harm, other than bloat, in putting out
3011 something which is DECL_COMDAT. */
3012 #define DECL_COMDAT(NODE) \
3013 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3015 #define DECL_COMDAT_GROUP(NODE) \
3016 decl_comdat_group (NODE)
3018 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3019 multiple translation units should be merged. */
3020 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3021 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3023 /* The name of the object as the assembler will see it (but before any
3024 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3025 as DECL_NAME. It is an IDENTIFIER_NODE.
3027 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3028 One Definition Rule based type merging at LTO. It is computed only for
3029 LTO compilation and C++. */
3030 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3032 /* Raw accessor for DECL_ASSEMBLE_NAME. */
3033 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
3034 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3036 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3037 This is true of all DECL nodes except FIELD_DECL. */
3038 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3039 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3041 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3042 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3044 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3045 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3047 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3048 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3049 overwrite_decl_assembler_name (NODE, NAME)
3051 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3052 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3053 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3054 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3055 other words, the semantics of using this macro, are different than
3058 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3060 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3062 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3063 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3065 /* Records the section name in a section attribute. Used to pass
3066 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3067 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3069 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3070 this variable in a BIND_EXPR. */
3071 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3072 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3074 /* Value of the decls's visibility attribute */
3075 #define DECL_VISIBILITY(NODE) \
3076 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3078 /* Nonzero means that the decl (or an enclosing scope) had its
3079 visibility specified rather than being inferred. */
3080 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3081 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3083 /* In a VAR_DECL, the model to use if the data should be allocated from
3084 thread-local storage. */
3085 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3087 /* In a VAR_DECL, nonzero if the data should be allocated from
3088 thread-local storage. */
3089 #define DECL_THREAD_LOCAL_P(NODE) \
3090 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3092 /* In a non-local VAR_DECL with static storage duration, true if the
3093 variable has an initialization priority. If false, the variable
3094 will be initialized at the DEFAULT_INIT_PRIORITY. */
3095 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3096 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3098 extern tree
decl_debug_expr_lookup (tree
);
3099 extern void decl_debug_expr_insert (tree
, tree
);
3101 /* For VAR_DECL, this is set to an expression that it was split from. */
3102 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
3103 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3104 #define DECL_DEBUG_EXPR(NODE) \
3105 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3107 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3108 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3110 extern priority_type
decl_init_priority_lookup (tree
);
3111 extern priority_type
decl_fini_priority_lookup (tree
);
3112 extern void decl_init_priority_insert (tree
, priority_type
);
3113 extern void decl_fini_priority_insert (tree
, priority_type
);
3115 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3117 #define DECL_INIT_PRIORITY(NODE) \
3118 (decl_init_priority_lookup (NODE))
3119 /* Set the initialization priority for NODE to VAL. */
3120 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3121 (decl_init_priority_insert (NODE, VAL))
3123 /* For a FUNCTION_DECL the finalization priority of NODE. */
3124 #define DECL_FINI_PRIORITY(NODE) \
3125 (decl_fini_priority_lookup (NODE))
3126 /* Set the finalization priority for NODE to VAL. */
3127 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3128 (decl_fini_priority_insert (NODE, VAL))
3130 /* The initialization priority for entities for which no explicit
3131 initialization priority has been specified. */
3132 #define DEFAULT_INIT_PRIORITY 65535
3134 /* The maximum allowed initialization priority. */
3135 #define MAX_INIT_PRIORITY 65535
3137 /* The largest priority value reserved for use by system runtime
3139 #define MAX_RESERVED_INIT_PRIORITY 100
3141 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3142 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3143 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3145 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3146 #define DECL_NONLOCAL_FRAME(NODE) \
3147 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3149 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3150 #define DECL_NONALIASED(NODE) \
3151 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3153 /* This field is used to reference anything in decl.result and is meant only
3154 for use by the garbage collector. */
3155 #define DECL_RESULT_FLD(NODE) \
3156 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3158 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3159 Before the struct containing the FUNCTION_DECL is laid out,
3160 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3161 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3162 function. When the class is laid out, this pointer is changed
3163 to an INTEGER_CST node which is suitable for use as an index
3164 into the virtual function table. */
3165 #define DECL_VINDEX(NODE) \
3166 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3168 /* In FUNCTION_DECL, holds the decl for the return value. */
3169 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3171 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3172 #define DECL_UNINLINABLE(NODE) \
3173 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3175 /* In a FUNCTION_DECL, the saved representation of the body of the
3177 #define DECL_SAVED_TREE(NODE) \
3178 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3180 /* Nonzero in a FUNCTION_DECL means this function should be treated
3181 as if it were a malloc, meaning it returns a pointer that is
3183 #define DECL_IS_MALLOC(NODE) \
3184 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3186 /* Macro for direct set and get of function_decl.decl_type. */
3187 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3188 (NODE->function_decl.decl_type)
3190 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3194 set_function_decl_type (tree decl
, function_decl_type t
, bool set
)
3198 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl
) == NONE
3199 || FUNCTION_DECL_DECL_TYPE (decl
) == t
);
3200 FUNCTION_DECL_DECL_TYPE (decl
) = t
;
3202 else if (FUNCTION_DECL_DECL_TYPE (decl
) == t
)
3203 FUNCTION_DECL_DECL_TYPE (decl
) = NONE
;
3206 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3207 function (like replaceable operators new or delete). */
3208 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3209 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3211 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3212 C++ operator new, meaning that it returns a pointer for which we
3213 should not use type based aliasing. */
3214 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3215 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_NEW)
3217 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3218 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3220 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3221 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3223 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3224 C++ operator delete. */
3225 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3226 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_DELETE)
3228 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3229 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3231 /* Nonzero in a FUNCTION_DECL means this function may return more
3233 #define DECL_IS_RETURNS_TWICE(NODE) \
3234 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3236 /* Nonzero in a FUNCTION_DECL means this function should be treated
3237 as "pure" function (like const function, but may read global memory).
3238 Note that being pure or const for a function is orthogonal to being
3239 nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3241 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3243 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3244 the const or pure function may not terminate. When this is nonzero
3245 for a const or pure function, it can be dealt with by cse passes
3246 but cannot be removed by dce passes since you are not allowed to
3247 change an infinite looping program into one that terminates without
3249 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3250 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3252 /* Nonzero in a FUNCTION_DECL means this function should be treated
3253 as "novops" function (function that does not read global memory,
3254 but may have arbitrary side effects). */
3255 #define DECL_IS_NOVOPS(NODE) \
3256 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3258 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3259 at the beginning or end of execution. */
3260 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3261 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3263 #define DECL_STATIC_DESTRUCTOR(NODE) \
3264 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3266 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3267 be instrumented with calls to support routines. */
3268 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3269 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3271 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3272 disabled in this function. */
3273 #define DECL_NO_LIMIT_STACK(NODE) \
3274 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3276 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3277 #define DECL_STATIC_CHAIN(NODE) \
3278 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3280 /* Nonzero for a decl that cgraph has decided should be inlined into
3281 at least one call site. It is not meaningful to look at this
3282 directly; always use cgraph_function_possibly_inlined_p. */
3283 #define DECL_POSSIBLY_INLINED(DECL) \
3284 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3286 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3287 such as via the `inline' keyword in C/C++. This flag controls the linkage
3288 semantics of 'inline' */
3289 #define DECL_DECLARED_INLINE_P(NODE) \
3290 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3292 /* Nonzero in a FUNCTION_DECL means this function should not get
3293 -Winline warnings. */
3294 #define DECL_NO_INLINE_WARNING_P(NODE) \
3295 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3297 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3298 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3299 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3301 /* Nonzero if a FUNCTION_CODE is a TM load. */
3302 #define BUILTIN_TM_LOAD_P(FN) \
3303 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3305 /* Nonzero if a FUNCTION_CODE is a TM store. */
3306 #define BUILTIN_TM_STORE_P(FN) \
3307 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3309 #define CASE_BUILT_IN_TM_LOAD(FN) \
3310 case BUILT_IN_TM_LOAD_##FN: \
3311 case BUILT_IN_TM_LOAD_RAR_##FN: \
3312 case BUILT_IN_TM_LOAD_RAW_##FN: \
3313 case BUILT_IN_TM_LOAD_RFW_##FN
3315 #define CASE_BUILT_IN_TM_STORE(FN) \
3316 case BUILT_IN_TM_STORE_##FN: \
3317 case BUILT_IN_TM_STORE_WAR_##FN: \
3318 case BUILT_IN_TM_STORE_WAW_##FN
3320 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3321 disregarding size and cost heuristics. This is equivalent to using
3322 the always_inline attribute without the required diagnostics if the
3323 function cannot be inlined. */
3324 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3325 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3327 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3328 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3330 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3331 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3332 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3334 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3335 that describes the status of this function. */
3336 #define DECL_STRUCT_FUNCTION(NODE) \
3337 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3339 /* For a builtin function, identify which part of the compiler defined it. */
3340 #define DECL_BUILT_IN_CLASS(NODE) \
3341 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3343 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3344 #define DECL_ARGUMENTS(NODE) \
3345 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3347 /* In FUNCTION_DECL, the function specific target options to use when compiling
3349 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3350 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3352 /* In FUNCTION_DECL, the function specific optimization options to use when
3353 compiling this function. */
3354 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3355 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3357 /* In FUNCTION_DECL, this is set if this function has other versions generated
3358 using "target" attributes. The default version is the one which does not
3359 have any "target" attribute set. */
3360 #define DECL_FUNCTION_VERSIONED(NODE)\
3361 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3363 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3364 Devirtualization machinery uses this knowledge for determing type of the
3365 object constructed. Also we assume that constructor address is not
3367 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3368 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3370 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3371 Devirtualization machinery uses this to track types in destruction. */
3372 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3373 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3375 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3376 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3377 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == LAMBDA_FUNCTION)
3379 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3380 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3382 /* In FUNCTION_DECL that represent an virtual method this is set when
3383 the method is final. */
3384 #define DECL_FINAL_P(NODE)\
3385 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3387 /* The source language of the translation-unit. */
3388 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3389 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3391 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3393 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3394 #define DECL_ORIGINAL_TYPE(NODE) \
3395 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3397 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3398 into stabs. Instead it will generate cross reference ('x') of names.
3399 This uses the same flag as DECL_EXTERNAL. */
3400 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3401 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3403 /* Getter of the imported declaration associated to the
3404 IMPORTED_DECL node. */
3405 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3406 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3408 /* Getter of the symbol declaration associated with the
3409 NAMELIST_DECL node. */
3410 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3411 (DECL_INITIAL (NODE))
3413 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3414 To reduce overhead, the nodes containing the statements are not trees.
3415 This avoids the overhead of tree_common on all linked list elements.
3417 Use the interface in tree-iterator.h to access this node. */
3419 #define STATEMENT_LIST_HEAD(NODE) \
3420 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3421 #define STATEMENT_LIST_TAIL(NODE) \
3422 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3424 #define TREE_OPTIMIZATION(NODE) \
3425 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3427 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3428 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3430 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3431 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3433 /* Return a tree node that encapsulates the optimization options in OPTS
3435 extern tree
build_optimization_node (struct gcc_options
*opts
,
3436 struct gcc_options
*opts_set
);
3438 #define TREE_TARGET_OPTION(NODE) \
3439 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3441 #define TREE_TARGET_GLOBALS(NODE) \
3442 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3444 /* Return a tree node that encapsulates the target options in OPTS and
3446 extern tree
build_target_option_node (struct gcc_options
*opts
,
3447 struct gcc_options
*opts_set
);
3449 extern void prepare_target_option_nodes_for_pch (void);
3451 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3454 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3456 if (TREE_CODE (__t
) != __c
)
3457 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3462 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3465 if (TREE_CODE (__t
) == __c
)
3466 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3471 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3472 enum tree_code __c1
, enum tree_code __c2
)
3474 if (TREE_CODE (__t
) != __c1
3475 && TREE_CODE (__t
) != __c2
)
3476 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3481 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3482 enum tree_code __c1
, enum tree_code __c2
)
3484 if (TREE_CODE (__t
) == __c1
3485 || TREE_CODE (__t
) == __c2
)
3486 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3491 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3492 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3494 if (TREE_CODE (__t
) != __c1
3495 && TREE_CODE (__t
) != __c2
3496 && TREE_CODE (__t
) != __c3
)
3497 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3502 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3503 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3505 if (TREE_CODE (__t
) == __c1
3506 || TREE_CODE (__t
) == __c2
3507 || TREE_CODE (__t
) == __c3
)
3508 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3513 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3514 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3515 enum tree_code __c4
)
3517 if (TREE_CODE (__t
) != __c1
3518 && TREE_CODE (__t
) != __c2
3519 && TREE_CODE (__t
) != __c3
3520 && TREE_CODE (__t
) != __c4
)
3521 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3526 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3527 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3528 enum tree_code __c4
)
3530 if (TREE_CODE (__t
) == __c1
3531 || TREE_CODE (__t
) == __c2
3532 || TREE_CODE (__t
) == __c3
3533 || TREE_CODE (__t
) == __c4
)
3534 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3539 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3540 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3541 enum tree_code __c4
, enum tree_code __c5
)
3543 if (TREE_CODE (__t
) != __c1
3544 && TREE_CODE (__t
) != __c2
3545 && TREE_CODE (__t
) != __c3
3546 && TREE_CODE (__t
) != __c4
3547 && TREE_CODE (__t
) != __c5
)
3548 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3553 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3554 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3555 enum tree_code __c4
, enum tree_code __c5
)
3557 if (TREE_CODE (__t
) == __c1
3558 || TREE_CODE (__t
) == __c2
3559 || TREE_CODE (__t
) == __c3
3560 || TREE_CODE (__t
) == __c4
3561 || TREE_CODE (__t
) == __c5
)
3562 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3567 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3568 const char *__f
, int __l
, const char *__g
)
3570 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3571 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3576 tree_class_check (tree __t
, const enum tree_code_class __class
,
3577 const char *__f
, int __l
, const char *__g
)
3579 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3580 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3585 tree_range_check (tree __t
,
3586 enum tree_code __code1
, enum tree_code __code2
,
3587 const char *__f
, int __l
, const char *__g
)
3589 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3590 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3595 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3596 const char *__f
, int __l
, const char *__g
)
3598 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3599 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3600 if (__t
->omp_clause
.code
!= __code
)
3601 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3606 omp_clause_range_check (tree __t
,
3607 enum omp_clause_code __code1
,
3608 enum omp_clause_code __code2
,
3609 const char *__f
, int __l
, const char *__g
)
3611 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3612 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3613 if ((int) __t
->omp_clause
.code
< (int) __code1
3614 || (int) __t
->omp_clause
.code
> (int) __code2
)
3615 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3619 /* These checks have to be special cased. */
3622 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3624 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3625 if (!IS_EXPR_CODE_CLASS (__c
))
3626 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3630 /* These checks have to be special cased. */
3633 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3636 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3640 inline const HOST_WIDE_INT
*
3641 tree_int_cst_elt_check (const_tree __t
, int __i
,
3642 const char *__f
, int __l
, const char *__g
)
3644 if (TREE_CODE (__t
) != INTEGER_CST
)
3645 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3646 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3647 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3649 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3652 inline HOST_WIDE_INT
*
3653 tree_int_cst_elt_check (tree __t
, int __i
,
3654 const char *__f
, int __l
, const char *__g
)
3656 if (TREE_CODE (__t
) != INTEGER_CST
)
3657 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3658 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3659 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3661 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3664 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3666 # if GCC_VERSION >= 4006
3667 #pragma GCC diagnostic push
3668 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3672 tree_vec_elt_check (tree __t
, int __i
,
3673 const char *__f
, int __l
, const char *__g
)
3675 if (TREE_CODE (__t
) != TREE_VEC
)
3676 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3677 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3678 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3679 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3682 # if GCC_VERSION >= 4006
3683 #pragma GCC diagnostic pop
3687 omp_clause_elt_check (tree __t
, int __i
,
3688 const char *__f
, int __l
, const char *__g
)
3690 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3691 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3692 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3693 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3694 return &__t
->omp_clause
.ops
[__i
];
3697 /* These checks have to be special cased. */
3700 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3702 if (!ANY_INTEGRAL_TYPE_P (__t
))
3703 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3709 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3712 if (TREE_CODE (__t
) != __c
)
3713 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3718 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3721 if (TREE_CODE (__t
) == __c
)
3722 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3727 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3728 enum tree_code __c1
, enum tree_code __c2
)
3730 if (TREE_CODE (__t
) != __c1
3731 && TREE_CODE (__t
) != __c2
)
3732 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3737 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3738 enum tree_code __c1
, enum tree_code __c2
)
3740 if (TREE_CODE (__t
) == __c1
3741 || TREE_CODE (__t
) == __c2
)
3742 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3747 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3748 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3750 if (TREE_CODE (__t
) != __c1
3751 && TREE_CODE (__t
) != __c2
3752 && TREE_CODE (__t
) != __c3
)
3753 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3758 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3759 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3761 if (TREE_CODE (__t
) == __c1
3762 || TREE_CODE (__t
) == __c2
3763 || TREE_CODE (__t
) == __c3
)
3764 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3769 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3770 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3771 enum tree_code __c4
)
3773 if (TREE_CODE (__t
) != __c1
3774 && TREE_CODE (__t
) != __c2
3775 && TREE_CODE (__t
) != __c3
3776 && TREE_CODE (__t
) != __c4
)
3777 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3782 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3783 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3784 enum tree_code __c4
)
3786 if (TREE_CODE (__t
) == __c1
3787 || TREE_CODE (__t
) == __c2
3788 || TREE_CODE (__t
) == __c3
3789 || TREE_CODE (__t
) == __c4
)
3790 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3795 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3796 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3797 enum tree_code __c4
, enum tree_code __c5
)
3799 if (TREE_CODE (__t
) != __c1
3800 && TREE_CODE (__t
) != __c2
3801 && TREE_CODE (__t
) != __c3
3802 && TREE_CODE (__t
) != __c4
3803 && TREE_CODE (__t
) != __c5
)
3804 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3809 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3810 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3811 enum tree_code __c4
, enum tree_code __c5
)
3813 if (TREE_CODE (__t
) == __c1
3814 || TREE_CODE (__t
) == __c2
3815 || TREE_CODE (__t
) == __c3
3816 || TREE_CODE (__t
) == __c4
3817 || TREE_CODE (__t
) == __c5
)
3818 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3823 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3824 const char *__f
, int __l
, const char *__g
)
3826 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3827 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3832 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3833 const char *__f
, int __l
, const char *__g
)
3835 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3836 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3841 tree_range_check (const_tree __t
,
3842 enum tree_code __code1
, enum tree_code __code2
,
3843 const char *__f
, int __l
, const char *__g
)
3845 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3846 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3851 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3852 const char *__f
, int __l
, const char *__g
)
3854 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3855 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3856 if (__t
->omp_clause
.code
!= __code
)
3857 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3862 omp_clause_range_check (const_tree __t
,
3863 enum omp_clause_code __code1
,
3864 enum omp_clause_code __code2
,
3865 const char *__f
, int __l
, const char *__g
)
3867 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3868 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3869 if ((int) __t
->omp_clause
.code
< (int) __code1
3870 || (int) __t
->omp_clause
.code
> (int) __code2
)
3871 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3876 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3878 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3879 if (!IS_EXPR_CODE_CLASS (__c
))
3880 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3885 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3888 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3892 # if GCC_VERSION >= 4006
3893 #pragma GCC diagnostic push
3894 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3898 tree_vec_elt_check (const_tree __t
, int __i
,
3899 const char *__f
, int __l
, const char *__g
)
3901 if (TREE_CODE (__t
) != TREE_VEC
)
3902 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3903 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3904 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3905 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3906 //return &__t->vec.a[__i];
3909 # if GCC_VERSION >= 4006
3910 #pragma GCC diagnostic pop
3914 omp_clause_elt_check (const_tree __t
, int __i
,
3915 const char *__f
, int __l
, const char *__g
)
3917 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3918 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3919 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3920 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3921 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3925 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3928 if (!ANY_INTEGRAL_TYPE_P (__t
))
3929 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3936 /* Compute the number of operands in an expression node NODE. For
3937 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3938 otherwise it is looked up from the node's code. */
3940 tree_operand_length (const_tree node
)
3942 if (VL_EXP_CLASS_P (node
))
3943 return VL_EXP_OPERAND_LENGTH (node
);
3945 return TREE_CODE_LENGTH (TREE_CODE (node
));
3948 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3950 /* Special checks for TREE_OPERANDs. */
3952 tree_operand_check (tree __t
, int __i
,
3953 const char *__f
, int __l
, const char *__g
)
3955 const_tree __u
= EXPR_CHECK (__t
);
3956 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3957 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3958 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3962 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3963 const char *__f
, int __l
, const char *__g
)
3965 if (TREE_CODE (__t
) != __code
)
3966 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3967 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3968 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3969 return &__t
->exp
.operands
[__i
];
3973 tree_operand_check (const_tree __t
, int __i
,
3974 const char *__f
, int __l
, const char *__g
)
3976 const_tree __u
= EXPR_CHECK (__t
);
3977 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3978 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3979 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3983 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3984 const char *__f
, int __l
, const char *__g
)
3986 if (TREE_CODE (__t
) != __code
)
3987 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3988 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3989 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3990 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3995 /* True iff an identifier matches a C string. */
3998 id_equal (const_tree id
, const char *str
)
4000 return !strcmp (IDENTIFIER_POINTER (id
), str
);
4004 id_equal (const char *str
, const_tree id
)
4006 return id_equal (id
, str
);
4009 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
4012 TYPE_VECTOR_SUBPARTS (const_tree node
)
4014 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
4015 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
4016 if (NUM_POLY_INT_COEFFS
== 2)
4018 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4019 description of the encoding. */
4020 poly_uint64 res
= 0;
4021 res
.coeffs
[0] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
4022 if (precision
& 0x100)
4023 res
.coeffs
[1] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
4027 return HOST_WIDE_INT_1U
<< precision
;
4030 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4031 satisfy valid_vector_subparts_p. */
4034 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
4036 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
4037 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
4038 int index
= exact_log2 (coeff0
);
4039 gcc_assert (index
>= 0);
4040 if (NUM_POLY_INT_COEFFS
== 2)
4042 /* We have two coefficients that are each in the range 1 << [0, 63],
4043 so supporting all combinations would require 6 bits per coefficient
4044 and 12 bits in total. Since the precision field is only 10 bits
4045 in size, we need to be more restrictive than that.
4047 At present, coeff[1] is always either 0 (meaning that the number
4048 of units is constant) or equal to coeff[0] (meaning that the number
4049 of units is N + X * N for some target-dependent zero-based runtime
4050 parameter X). We can therefore encode coeff[1] in a single bit.
4052 The most compact encoding would be to use mask 0x3f for coeff[0]
4053 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4054 get slightly more efficient code on some hosts if we instead
4055 treat the shift amount as an independent byte, so here we use
4056 0xff for coeff[0] and 0x100 for coeff[1]. */
4057 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
4058 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
4059 VECTOR_TYPE_CHECK (node
)->type_common
.precision
4060 = index
+ (coeff1
!= 0 ? 0x100 : 0);
4063 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
4066 /* Return true if we can construct vector types with the given number
4070 valid_vector_subparts_p (poly_uint64 subparts
)
4072 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
4073 if (!pow2p_hwi (coeff0
))
4075 if (NUM_POLY_INT_COEFFS
== 2)
4077 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
4078 if (coeff1
!= 0 && coeff1
!= coeff0
)
4084 /* Return the built-in function that DECL represents, given that it is known
4085 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4086 inline built_in_function
4087 DECL_FUNCTION_CODE (const_tree decl
)
4089 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4090 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_NORMAL
);
4091 return (built_in_function
) fndecl
.function_code
;
4094 /* Return the target-specific built-in function that DECL represents,
4095 given that it is known to be a FUNCTION_DECL with built-in class
4098 DECL_MD_FUNCTION_CODE (const_tree decl
)
4100 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4101 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_MD
);
4102 return fndecl
.function_code
;
4105 /* Return the frontend-specific built-in function that DECL represents,
4106 given that it is known to be a FUNCTION_DECL with built-in class
4107 BUILT_IN_FRONTEND. */
4109 DECL_FE_FUNCTION_CODE (const_tree decl
)
4111 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4112 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_FRONTEND
);
4113 return fndecl
.function_code
;
4116 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4119 set_decl_built_in_function (tree decl
, built_in_class fclass
,
4122 tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4123 fndecl
.built_in_class
= fclass
;
4124 fndecl
.function_code
= fcode
;
4127 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4128 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4130 copy_decl_built_in_function (tree newdecl
, const_tree olddecl
)
4132 tree_function_decl
&newfndecl
= FUNCTION_DECL_CHECK (newdecl
)->function_decl
;
4133 const tree_function_decl
&oldfndecl
4134 = FUNCTION_DECL_CHECK (olddecl
)->function_decl
;
4135 newfndecl
.built_in_class
= oldfndecl
.built_in_class
;
4136 newfndecl
.function_code
= oldfndecl
.function_code
;
4139 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4140 wrapper added to express a location_t on behalf of the node's child
4141 (e.g. by maybe_wrap_with_location). */
4143 #define EXPR_LOCATION_WRAPPER_P(NODE) \
4144 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4146 /* Test if EXP is merely a wrapper node, added to express a location_t
4147 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4150 location_wrapper_p (const_tree exp
)
4152 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4153 the flag EXPR_LOCATION_WRAPPER_P is set.
4154 It normally has the same type as its operand, but it can have a
4155 different one if the type of the operand has changed (e.g. when
4156 merging duplicate decls).
4158 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4159 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4160 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
4161 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4162 && EXPR_LOCATION_WRAPPER_P (exp
))
4167 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4170 tree_strip_any_location_wrapper (tree exp
)
4172 if (location_wrapper_p (exp
))
4173 return TREE_OPERAND (exp
, 0);
4178 #define error_mark_node global_trees[TI_ERROR_MARK]
4180 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4181 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4182 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4183 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4184 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4186 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4187 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4188 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4189 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4190 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4192 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4193 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4194 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4195 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4196 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4198 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4199 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4200 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4201 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4203 #define void_node global_trees[TI_VOID]
4205 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4206 #define integer_one_node global_trees[TI_INTEGER_ONE]
4207 #define integer_three_node global_trees[TI_INTEGER_THREE]
4208 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4209 #define size_zero_node global_trees[TI_SIZE_ZERO]
4210 #define size_one_node global_trees[TI_SIZE_ONE]
4211 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4212 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4213 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4215 /* Base access nodes. */
4216 #define access_public_node global_trees[TI_PUBLIC]
4217 #define access_protected_node global_trees[TI_PROTECTED]
4218 #define access_private_node global_trees[TI_PRIVATE]
4220 #define null_pointer_node global_trees[TI_NULL_POINTER]
4222 #define float_type_node global_trees[TI_FLOAT_TYPE]
4223 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4224 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4226 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4227 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4228 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4229 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4231 /* Names for individual types (code should normally iterate over all
4232 such types; these are only for back-end use, or in contexts such as
4233 *.def where iteration is not possible). */
4234 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4235 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4236 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4237 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4238 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4239 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4240 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4242 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4243 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4244 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4245 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4247 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4248 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4249 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4250 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4252 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4254 #define void_type_node global_trees[TI_VOID_TYPE]
4255 /* The C type `void *'. */
4256 #define ptr_type_node global_trees[TI_PTR_TYPE]
4257 /* The C type `const void *'. */
4258 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4259 /* The C type `size_t'. */
4260 #define size_type_node global_trees[TI_SIZE_TYPE]
4261 #define pid_type_node global_trees[TI_PID_TYPE]
4262 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4263 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4264 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4265 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4266 /* The C type `FILE *'. */
4267 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4268 /* The C type `const struct tm *'. */
4269 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4270 /* The C type `fenv_t *'. */
4271 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4272 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4273 /* The C type `fexcept_t *'. */
4274 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4275 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4276 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4278 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4279 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4280 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4282 /* The decimal floating point types. */
4283 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4284 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4285 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4287 /* The fixed-point types. */
4288 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4289 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4290 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4291 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4292 #define sat_unsigned_short_fract_type_node \
4293 global_trees[TI_SAT_USFRACT_TYPE]
4294 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4295 #define sat_unsigned_long_fract_type_node \
4296 global_trees[TI_SAT_ULFRACT_TYPE]
4297 #define sat_unsigned_long_long_fract_type_node \
4298 global_trees[TI_SAT_ULLFRACT_TYPE]
4299 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4300 #define fract_type_node global_trees[TI_FRACT_TYPE]
4301 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4302 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4303 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4304 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4305 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4306 #define unsigned_long_long_fract_type_node \
4307 global_trees[TI_ULLFRACT_TYPE]
4308 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4309 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4310 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4311 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4312 #define sat_unsigned_short_accum_type_node \
4313 global_trees[TI_SAT_USACCUM_TYPE]
4314 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4315 #define sat_unsigned_long_accum_type_node \
4316 global_trees[TI_SAT_ULACCUM_TYPE]
4317 #define sat_unsigned_long_long_accum_type_node \
4318 global_trees[TI_SAT_ULLACCUM_TYPE]
4319 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4320 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4321 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4322 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4323 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4324 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4325 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4326 #define unsigned_long_long_accum_type_node \
4327 global_trees[TI_ULLACCUM_TYPE]
4328 #define qq_type_node global_trees[TI_QQ_TYPE]
4329 #define hq_type_node global_trees[TI_HQ_TYPE]
4330 #define sq_type_node global_trees[TI_SQ_TYPE]
4331 #define dq_type_node global_trees[TI_DQ_TYPE]
4332 #define tq_type_node global_trees[TI_TQ_TYPE]
4333 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4334 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4335 #define usq_type_node global_trees[TI_USQ_TYPE]
4336 #define udq_type_node global_trees[TI_UDQ_TYPE]
4337 #define utq_type_node global_trees[TI_UTQ_TYPE]
4338 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4339 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4340 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4341 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4342 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4343 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4344 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4345 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4346 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4347 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4348 #define ha_type_node global_trees[TI_HA_TYPE]
4349 #define sa_type_node global_trees[TI_SA_TYPE]
4350 #define da_type_node global_trees[TI_DA_TYPE]
4351 #define ta_type_node global_trees[TI_TA_TYPE]
4352 #define uha_type_node global_trees[TI_UHA_TYPE]
4353 #define usa_type_node global_trees[TI_USA_TYPE]
4354 #define uda_type_node global_trees[TI_UDA_TYPE]
4355 #define uta_type_node global_trees[TI_UTA_TYPE]
4356 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4357 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4358 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4359 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4360 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4361 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4362 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4363 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4365 /* The node that should be placed at the end of a parameter list to
4366 indicate that the function does not take a variable number of
4367 arguments. The TREE_VALUE will be void_type_node and there will be
4368 no TREE_CHAIN. Language-independent code should not assume
4369 anything else about this node. */
4370 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4372 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4373 #define MAIN_NAME_P(NODE) \
4374 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4376 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4378 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4379 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4381 /* Default/current target options (TARGET_OPTION_NODE). */
4382 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4383 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4385 /* Default tree list option(), optimize() pragmas to be linked into the
4387 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4388 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4390 /* SCEV analyzer global shared trees. */
4391 #define chrec_not_analyzed_yet NULL_TREE
4392 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4393 #define chrec_known global_trees[TI_CHREC_KNOWN]
4395 #define char_type_node integer_types[itk_char]
4396 #define signed_char_type_node integer_types[itk_signed_char]
4397 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4398 #define short_integer_type_node integer_types[itk_short]
4399 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4400 #define integer_type_node integer_types[itk_int]
4401 #define unsigned_type_node integer_types[itk_unsigned_int]
4402 #define long_integer_type_node integer_types[itk_long]
4403 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4404 #define long_long_integer_type_node integer_types[itk_long_long]
4405 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4407 /* True if T is an erroneous expression. */
4410 error_operand_p (const_tree t
)
4412 return (t
== error_mark_node
4413 || (t
&& TREE_TYPE (t
) == error_mark_node
));
4416 /* Return the number of elements encoded directly in a VECTOR_CST. */
4419 vector_cst_encoded_nelts (const_tree t
)
4421 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4424 extern tree
decl_assembler_name (tree
);
4425 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4426 extern tree
decl_comdat_group (const_tree
);
4427 extern tree
decl_comdat_group_id (const_tree
);
4428 extern const char *decl_section_name (const_tree
);
4429 extern void set_decl_section_name (tree
, const char *);
4430 extern void set_decl_section_name (tree
, const_tree
);
4431 extern enum tls_model
decl_tls_model (const_tree
);
4432 extern void set_decl_tls_model (tree
, enum tls_model
);
4434 /* Compute the number of bytes occupied by 'node'. This routine only
4435 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4437 extern size_t tree_size (const_tree
);
4439 /* Compute the number of bytes occupied by a tree with code CODE.
4440 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4441 which are of variable length. */
4442 extern size_t tree_code_size (enum tree_code
);
4444 /* Allocate and return a new UID from the DECL_UID namespace. */
4445 extern int allocate_decl_uid (void);
4447 /* Lowest level primitive for allocating a node.
4448 The TREE_CODE is the only argument. Contents are initialized
4449 to zero except for a few of the common fields. */
4451 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4453 /* Free tree node. */
4455 extern void free_node (tree
);
4457 /* Make a copy of a node, with all the same contents. */
4459 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4461 /* Make a copy of a chain of TREE_LIST nodes. */
4463 extern tree
copy_list (tree
);
4465 /* Make a CASE_LABEL_EXPR. */
4467 extern tree
build_case_label (tree
, tree
, tree
);
4470 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4472 /* Make an INTEGER_CST. */
4474 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4476 /* Make a TREE_VEC. */
4478 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4480 /* Grow a TREE_VEC. */
4482 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4484 /* Construct various types of nodes. */
4486 extern tree
build_nt (enum tree_code
, ...);
4487 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4489 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4490 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4491 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4492 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4493 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4494 tree CXX_MEM_STAT_INFO
);
4495 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4496 tree CXX_MEM_STAT_INFO
);
4498 /* _loc versions of build[1-5]. */
4501 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4502 tree arg1 CXX_MEM_STAT_INFO
)
4504 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4505 if (CAN_HAVE_LOCATION_P (t
))
4506 SET_EXPR_LOCATION (t
, loc
);
4511 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4512 tree arg1 CXX_MEM_STAT_INFO
)
4514 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4515 if (CAN_HAVE_LOCATION_P (t
))
4516 SET_EXPR_LOCATION (t
, loc
);
4521 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4522 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4524 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4525 if (CAN_HAVE_LOCATION_P (t
))
4526 SET_EXPR_LOCATION (t
, loc
);
4531 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4532 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4534 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4535 if (CAN_HAVE_LOCATION_P (t
))
4536 SET_EXPR_LOCATION (t
, loc
);
4541 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4542 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4544 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4545 arg4 PASS_MEM_STAT
);
4546 if (CAN_HAVE_LOCATION_P (t
))
4547 SET_EXPR_LOCATION (t
, loc
);
4551 /* Constructs double_int from tree CST. */
4553 extern tree
double_int_to_tree (tree
, double_int
);
4555 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4556 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4558 /* Create an INT_CST node with a CST value zero extended. */
4561 extern tree
build_int_cst (tree
, poly_int64
);
4562 extern tree
build_int_cstu (tree type
, poly_uint64
);
4563 extern tree
build_int_cst_type (tree
, poly_int64
);
4564 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4565 extern tree
build_vector_from_ctor (tree
, const vec
<constructor_elt
, va_gc
> *);
4566 extern tree
build_vector_from_val (tree
, tree
);
4567 extern tree
build_uniform_cst (tree
, tree
);
4568 extern tree
build_vec_series (tree
, tree
, tree
);
4569 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4570 extern tree
build_vector_a_then_b (tree
, unsigned int, tree
, tree
);
4571 extern void recompute_constructor_flags (tree
);
4572 extern void verify_constructor_flags (tree
);
4573 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> * CXX_MEM_STAT_INFO
);
4574 extern tree
build_constructor_single (tree
, tree
, tree
);
4575 extern tree
build_constructor_from_list (tree
, tree
);
4576 extern tree
build_constructor_from_vec (tree
, const vec
<tree
, va_gc
> *);
4577 extern tree
build_constructor_va (tree
, int, ...);
4578 extern tree
build_clobber (tree
, enum clobber_kind
= CLOBBER_UNDEF
);
4579 extern tree
build_real_from_int_cst (tree
, const_tree
);
4580 extern tree
build_real_from_wide (tree
, const wide_int_ref
&, signop
);
4581 extern tree
build_complex (tree
, tree
, tree
);
4582 extern tree
build_complex_inf (tree
, bool);
4583 extern tree
build_each_one_cst (tree
);
4584 extern tree
build_one_cst (tree
);
4585 extern tree
build_minus_one_cst (tree
);
4586 extern tree
build_all_ones_cst (tree
);
4587 extern tree
build_zero_cst (tree
);
4588 extern tree
build_string (unsigned, const char * = NULL
);
4589 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4590 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4591 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4592 extern tree
build_decl (location_t
, enum tree_code
,
4593 tree
, tree CXX_MEM_STAT_INFO
);
4594 extern tree
build_debug_expr_decl (tree type
);
4595 extern tree
build_fn_decl (const char *, tree
);
4596 extern tree
build_translation_unit_decl (tree
);
4597 extern tree
build_block (tree
, tree
, tree
, tree
);
4598 extern tree
build_empty_stmt (location_t
);
4599 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4601 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4603 extern tree
build_call_nary (tree
, tree
, int, ...);
4604 extern tree
build_call_valist (tree
, tree
, int, va_list);
4605 #define build_call_array(T1,T2,N,T3)\
4606 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4607 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4608 extern tree
build_call_vec (tree
, tree
, const vec
<tree
, va_gc
> *);
4609 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4610 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4611 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4612 extern tree
build_call_expr (tree
, int, ...);
4613 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4615 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4616 tree
, int, const tree
*);
4617 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4619 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4620 extern tree
build_string_literal (unsigned, const char * = NULL
,
4621 tree
= char_type_node
,
4622 unsigned HOST_WIDE_INT
= HOST_WIDE_INT_M1U
);
4624 /* Construct various nodes representing data types. */
4626 extern tree
signed_or_unsigned_type_for (int, tree
);
4627 extern tree
signed_type_for (tree
);
4628 extern tree
unsigned_type_for (tree
);
4629 extern bool is_truth_type_for (tree
, tree
);
4630 extern tree
truth_type_for (tree
);
4631 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4632 extern tree
build_pointer_type (tree
);
4633 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4634 extern tree
build_reference_type (tree
);
4635 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4636 extern tree
build_vector_type (tree
, poly_int64
);
4637 extern tree
build_truth_vector_type_for_mode (poly_uint64
, machine_mode
);
4638 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4639 extern tree
build_index_type (tree
);
4640 extern tree
build_array_type_1 (tree
, tree
, bool, bool, bool);
4641 extern tree
build_array_type (tree
, tree
, bool = false);
4642 extern tree
build_nonshared_array_type (tree
, tree
);
4643 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4644 extern tree
build_function_type (tree
, tree
);
4645 extern tree
build_function_type_list (tree
, ...);
4646 extern tree
build_varargs_function_type_list (tree
, ...);
4647 extern tree
build_function_type_array (tree
, int, tree
*);
4648 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4649 #define build_function_type_vec(RET, V) \
4650 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4651 #define build_varargs_function_type_vec(RET, V) \
4652 build_varargs_function_type_array (RET, vec_safe_length (V), \
4653 vec_safe_address (V))
4654 extern tree
build_method_type_directly (tree
, tree
, tree
);
4655 extern tree
build_method_type (tree
, tree
);
4656 extern tree
build_offset_type (tree
, tree
);
4657 extern tree
build_complex_type (tree
, bool named
= false);
4658 extern tree
array_type_nelts (const_tree
);
4660 extern tree
value_member (tree
, tree
);
4661 extern tree
purpose_member (const_tree
, tree
);
4662 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4663 extern tree
chain_index (int, tree
);
4665 /* Arguments may be null. */
4666 extern int tree_int_cst_equal (const_tree
, const_tree
);
4668 /* The following predicates are safe to call with a null argument. */
4669 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4670 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4671 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4672 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4674 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4675 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4676 extern poly_int64
tree_to_poly_int64 (const_tree
)
4677 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4678 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4679 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4680 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4681 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4682 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4683 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4684 tree_to_shwi (const_tree t
)
4686 gcc_assert (tree_fits_shwi_p (t
));
4687 return TREE_INT_CST_LOW (t
);
4690 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4691 tree_to_uhwi (const_tree t
)
4693 gcc_assert (tree_fits_uhwi_p (t
));
4694 return TREE_INT_CST_LOW (t
);
4696 #if NUM_POLY_INT_COEFFS == 1
4697 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4698 tree_to_poly_int64 (const_tree t
)
4700 gcc_assert (tree_fits_poly_int64_p (t
));
4701 return TREE_INT_CST_LOW (t
);
4704 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4705 tree_to_poly_uint64 (const_tree t
)
4707 gcc_assert (tree_fits_poly_uint64_p (t
));
4708 return TREE_INT_CST_LOW (t
);
4712 extern int tree_int_cst_sgn (const_tree
);
4713 extern int tree_int_cst_sign_bit (const_tree
);
4714 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4715 extern tree
strip_array_types (tree
);
4716 extern tree
excess_precision_type (tree
);
4718 /* Desription of the reason why the argument of valid_constant_size_p
4719 is not a valid size. */
4720 enum cst_size_error
{
4722 cst_size_not_constant
,
4728 extern bool valid_constant_size_p (const_tree
, cst_size_error
* = NULL
);
4729 extern tree
max_object_size ();
4731 /* Return true if T holds a value that can be represented as a poly_int64
4732 without loss of precision. Store the value in *VALUE if so. */
4735 poly_int_tree_p (const_tree t
, poly_int64_pod
*value
)
4737 if (tree_fits_poly_int64_p (t
))
4739 *value
= tree_to_poly_int64 (t
);
4745 /* Return true if T holds a value that can be represented as a poly_uint64
4746 without loss of precision. Store the value in *VALUE if so. */
4749 poly_int_tree_p (const_tree t
, poly_uint64_pod
*value
)
4751 if (tree_fits_poly_uint64_p (t
))
4753 *value
= tree_to_poly_uint64 (t
);
4759 /* From expmed.cc. Since rtl.h is included after tree.h, we can't
4760 put the prototype here. Rtl.h does declare the prototype if
4761 tree.h had been included. */
4763 extern tree
make_tree (tree
, rtx
);
4765 /* Returns true iff CAND and BASE have equivalent language-specific
4768 extern bool check_lang_type (const_tree cand
, const_tree base
);
4770 /* Returns true iff unqualified CAND and BASE are equivalent. */
4772 extern bool check_base_type (const_tree cand
, const_tree base
);
4774 /* Check whether CAND is suitable to be returned from get_qualified_type
4775 (BASE, TYPE_QUALS). */
4777 extern bool check_qualified_type (const_tree
, const_tree
, int);
4779 /* Return a version of the TYPE, qualified as indicated by the
4780 TYPE_QUALS, if one exists. If no qualified version exists yet,
4781 return NULL_TREE. */
4783 extern tree
get_qualified_type (tree
, int);
4785 /* Like get_qualified_type, but creates the type if it does not
4786 exist. This function never returns NULL_TREE. */
4788 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
4790 /* Create a variant of type T with alignment ALIGN. */
4792 extern tree
build_aligned_type (tree
, unsigned int);
4794 /* Like build_qualified_type, but only deals with the `const' and
4795 `volatile' qualifiers. This interface is retained for backwards
4796 compatibility with the various front-ends; new code should use
4797 build_qualified_type instead. */
4799 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4800 build_qualified_type ((TYPE), \
4801 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4802 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4804 /* Make a copy of a type node. */
4806 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
4807 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
4809 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4810 return a canonicalized ..._TYPE node, so that duplicates are not made.
4811 How the hash code is computed is up to the caller, as long as any two
4812 callers that could hash identical-looking type nodes agree. */
4814 extern hashval_t
type_hash_canon_hash (tree
);
4815 extern tree
type_hash_canon (unsigned int, tree
);
4817 extern tree
convert (tree
, tree
);
4818 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4820 size_in_bytes (const_tree t
)
4822 return size_in_bytes_loc (input_location
, t
);
4825 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4826 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4827 extern tree
bit_position (const_tree
);
4828 extern tree
byte_position (const_tree
);
4829 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4831 /* Type for sizes of data-type. */
4833 #define sizetype sizetype_tab[(int) stk_sizetype]
4834 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4835 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4836 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4837 #define size_int(L) size_int_kind (L, stk_sizetype)
4838 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4839 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4840 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4842 /* Log2 of BITS_PER_UNIT. */
4844 #if BITS_PER_UNIT == 8
4845 #define LOG2_BITS_PER_UNIT 3
4846 #elif BITS_PER_UNIT == 16
4847 #define LOG2_BITS_PER_UNIT 4
4849 #error Unknown BITS_PER_UNIT
4852 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4853 by making the last node in X point to Y.
4854 Returns X, except if X is 0 returns Y. */
4856 extern tree
chainon (tree
, tree
);
4858 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4860 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
4862 /* Return the last tree node in a chain. */
4864 extern tree
tree_last (tree
);
4866 /* Reverse the order of elements in a chain, and return the new head. */
4868 extern tree
nreverse (tree
);
4870 /* Returns the length of a chain of nodes
4871 (number of chain pointers to follow before reaching a null pointer). */
4873 extern int list_length (const_tree
);
4875 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
4877 extern tree
first_field (const_tree
) ATTRIBUTE_NONNULL (1);
4878 extern tree
last_field (const_tree
) ATTRIBUTE_NONNULL (1);
4880 /* Given an initializer INIT, return TRUE if INIT is zero or some
4881 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4882 null, set *NONZERO if and only if INIT is known not to be all
4883 zeros. The combination of return value of false and *NONZERO
4884 false implies that INIT may but need not be all zeros. Other
4885 combinations indicate definitive answers. */
4887 extern bool initializer_zerop (const_tree
, bool * = NULL
);
4888 extern bool initializer_each_zero_or_onep (const_tree
);
4890 extern tree
vector_cst_elt (const_tree
, unsigned int);
4892 /* Given a vector VEC, return its first element if all elements are
4893 the same. Otherwise return NULL_TREE. */
4895 extern tree
uniform_vector_p (const_tree
);
4897 /* If the argument is INTEGER_CST, return it. If the argument is vector
4898 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4899 return NULL_TREE. */
4901 extern tree
uniform_integer_cst_p (tree
);
4903 extern int single_nonzero_element (const_tree
);
4905 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4907 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4909 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4911 extern bool zerop (const_tree
);
4913 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4915 extern bool integer_zerop (const_tree
);
4917 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4919 extern bool integer_onep (const_tree
);
4921 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4922 a vector or complex where each part is 1. */
4924 extern bool integer_each_onep (const_tree
);
4926 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4927 all of whose significant bits are 1. */
4929 extern bool integer_all_onesp (const_tree
);
4931 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4934 extern bool integer_minus_onep (const_tree
);
4936 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4937 exactly one bit 1. */
4939 extern bool integer_pow2p (const_tree
);
4941 /* Checks to see if T is a constant or a constant vector and if each element E
4942 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
4944 extern tree
bitmask_inv_cst_vector_p (tree
);
4946 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4947 with a nonzero value. */
4949 extern bool integer_nonzerop (const_tree
);
4951 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4952 a vector where each element is an integer constant of value -1. */
4954 extern bool integer_truep (const_tree
);
4956 extern bool cst_and_fits_in_hwi (const_tree
);
4957 extern tree
num_ending_zeros (const_tree
);
4959 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4962 extern bool fixed_zerop (const_tree
);
4964 /* staticp (tree x) is nonzero if X is a reference to data allocated
4965 at a fixed address in memory. Returns the outermost data. */
4967 extern tree
staticp (tree
);
4969 /* save_expr (EXP) returns an expression equivalent to EXP
4970 but it can be used multiple times within context CTX
4971 and only evaluate EXP once. */
4973 extern tree
save_expr (tree
);
4975 /* Return true if T is function-invariant. */
4977 extern bool tree_invariant_p (tree
);
4979 /* Look inside EXPR into any simple arithmetic operations. Return the
4980 outermost non-arithmetic or non-invariant node. */
4982 extern tree
skip_simple_arithmetic (tree
);
4984 /* Look inside EXPR into simple arithmetic operations involving constants.
4985 Return the outermost non-arithmetic or non-constant node. */
4987 extern tree
skip_simple_constant_arithmetic (tree
);
4989 /* Return which tree structure is used by T. */
4991 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4993 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4994 size or offset that depends on a field within a record. */
4996 extern bool contains_placeholder_p (const_tree
);
4998 /* This macro calls the above function but short-circuits the common
4999 case of a constant to save time. Also check for null. */
5001 #define CONTAINS_PLACEHOLDER_P(EXP) \
5002 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5004 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5005 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5008 extern bool type_contains_placeholder_p (tree
);
5010 /* Given a tree EXP, find all occurrences of references to fields
5011 in a PLACEHOLDER_EXPR and place them in vector REFS without
5012 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5013 we assume here that EXP contains only arithmetic expressions
5014 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5017 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
5019 /* This macro calls the above function but short-circuits the common
5020 case of a constant to save time and also checks for NULL. */
5022 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5024 if((EXP) && !TREE_CONSTANT (EXP)) \
5025 find_placeholder_in_expr (EXP, V); \
5028 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5029 return a tree with all occurrences of references to F in a
5030 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5031 CONST_DECLs. Note that we assume here that EXP contains only
5032 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5033 occurring only in their argument list. */
5035 extern tree
substitute_in_expr (tree
, tree
, tree
);
5037 /* This macro calls the above function but short-circuits the common
5038 case of a constant to save time and also checks for NULL. */
5040 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5041 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5043 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5044 for it within OBJ, a tree that is an object or a chain of references. */
5046 extern tree
substitute_placeholder_in_expr (tree
, tree
);
5048 /* This macro calls the above function but short-circuits the common
5049 case of a constant to save time and also checks for NULL. */
5051 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5052 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5053 : substitute_placeholder_in_expr (EXP, OBJ))
5056 /* stabilize_reference (EXP) returns a reference equivalent to EXP
5057 but it can be used multiple times
5058 and only evaluate the subexpressions once. */
5060 extern tree
stabilize_reference (tree
);
5062 /* Return EXP, stripped of any conversions to wider types
5063 in such a way that the result of converting to type FOR_TYPE
5064 is the same as if EXP were converted to FOR_TYPE.
5065 If FOR_TYPE is 0, it signifies EXP's type. */
5067 extern tree
get_unwidened (tree
, tree
);
5069 /* Return OP or a simpler expression for a narrower value
5070 which can be sign-extended or zero-extended to give back OP.
5071 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5072 or 0 if the value should be sign-extended. */
5074 extern tree
get_narrower (tree
, int *);
5076 /* Return true if T is an expression that get_inner_reference handles. */
5079 handled_component_p (const_tree t
)
5081 switch (TREE_CODE (t
))
5086 case ARRAY_RANGE_REF
:
5089 case VIEW_CONVERT_EXPR
:
5097 /* Return true T is a component with reverse storage order. */
5100 reverse_storage_order_for_component_p (tree t
)
5102 /* The storage order only applies to scalar components. */
5103 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
5104 || POINTER_TYPE_P (TREE_TYPE (t
))
5105 || VECTOR_TYPE_P (TREE_TYPE (t
)))
5108 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
5109 t
= TREE_OPERAND (t
, 0);
5111 switch (TREE_CODE (t
))
5115 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
5116 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5117 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
5118 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
5122 return REF_REVERSE_STORAGE_ORDER (t
);
5124 case ARRAY_RANGE_REF
:
5125 case VIEW_CONVERT_EXPR
:
5131 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5132 that can modify the storage order of objects. Note that, even if the
5133 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5134 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5135 it can change the partition of the aggregate object into scalars. */
5138 storage_order_barrier_p (const_tree t
)
5140 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
5143 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
5144 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
5147 tree op
= TREE_OPERAND (t
, 0);
5149 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
5150 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
5156 /* Given a DECL or TYPE, return the scope in which it was declared, or
5157 NUL_TREE if there is no containing scope. */
5159 extern tree
get_containing_scope (const_tree
);
5161 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5163 extern const_tree
get_ultimate_context (const_tree
);
5165 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5167 extern tree
decl_function_context (const_tree
);
5169 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5170 this _DECL with its context, or zero if none. */
5171 extern tree
decl_type_context (const_tree
);
5173 /* Return true if EXPR is the real constant zero. */
5174 extern bool real_zerop (const_tree
);
5176 /* Initialize the iterator I with arguments from function FNDECL */
5179 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5181 i
->next
= TYPE_ARG_TYPES (fntype
);
5184 /* Return a pointer that holds the next argument if there are more arguments to
5185 handle, otherwise return NULL. */
5187 static inline tree
*
5188 function_args_iter_cond_ptr (function_args_iterator
*i
)
5190 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5193 /* Return the next argument if there are more arguments to handle, otherwise
5197 function_args_iter_cond (function_args_iterator
*i
)
5199 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5202 /* Advance to the next argument. */
5204 function_args_iter_next (function_args_iterator
*i
)
5206 gcc_assert (i
->next
!= NULL_TREE
);
5207 i
->next
= TREE_CHAIN (i
->next
);
5210 /* Returns true if a BLOCK has a source location.
5211 BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5212 so the function returns true for all but the innermost and outermost
5213 blocks into which an expression has been inlined. */
5216 inlined_function_outer_scope_p (const_tree block
)
5218 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
5221 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5222 to point to the next tree element. ITER is an instance of
5223 function_args_iterator used to iterate the arguments. */
5224 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5225 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5226 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5227 function_args_iter_next (&(ITER)))
5229 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5230 to the next tree element. ITER is an instance of function_args_iterator
5231 used to iterate the arguments. */
5232 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5233 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5234 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5235 function_args_iter_next (&(ITER)))
5238 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5239 extern unsigned crc32_string (unsigned, const char *);
5241 crc32_unsigned (unsigned chksum
, unsigned value
)
5243 return crc32_unsigned_n (chksum
, value
, 4);
5246 crc32_byte (unsigned chksum
, char byte
)
5248 return crc32_unsigned_n (chksum
, byte
, 1);
5250 extern void clean_symbol_name (char *);
5251 extern tree
get_file_function_name (const char *);
5252 extern tree
get_callee_fndecl (const_tree
);
5253 extern combined_fn
get_call_combined_fn (const_tree
);
5254 extern int type_num_arguments (const_tree
);
5255 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
5256 extern bool associative_tree_code (enum tree_code
);
5257 extern bool commutative_tree_code (enum tree_code
);
5258 extern bool commutative_ternary_tree_code (enum tree_code
);
5259 extern bool operation_can_overflow (enum tree_code
);
5260 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
5261 extern tree
upper_bound_in_type (tree
, tree
);
5262 extern tree
lower_bound_in_type (tree
, tree
);
5263 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5264 extern tree
create_artificial_label (location_t
);
5265 extern const char *get_name (tree
);
5266 extern bool stdarg_p (const_tree
);
5267 extern bool prototype_p (const_tree
);
5268 extern bool is_typedef_decl (const_tree x
);
5269 extern bool typedef_variant_p (const_tree
);
5270 extern bool auto_var_p (const_tree
);
5271 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5272 extern tree
build_low_bits_mask (tree
, unsigned);
5273 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
5274 extern tree
tree_strip_nop_conversions (tree
);
5275 extern tree
tree_strip_sign_nop_conversions (tree
);
5276 extern const_tree
strip_invariant_refs (const_tree
);
5277 extern tree
lhd_gcc_personality (void);
5278 extern void assign_assembler_name_if_needed (tree
);
5279 extern bool warn_deprecated_use (tree
, tree
);
5280 extern void error_unavailable_use (tree
, tree
);
5281 extern tree
cache_integer_cst (tree
, bool might_duplicate
= false);
5282 extern const char *combined_fn_name (combined_fn
);
5284 /* Compare and hash for any structure which begins with a canonical
5285 pointer. Assumes all pointers are interchangeable, which is sort
5286 of already assumed by gcc elsewhere IIRC. */
5289 struct_ptr_eq (const void *a
, const void *b
)
5291 const void * const * x
= (const void * const *) a
;
5292 const void * const * y
= (const void * const *) b
;
5296 static inline hashval_t
5297 struct_ptr_hash (const void *a
)
5299 const void * const * x
= (const void * const *) a
;
5300 return (intptr_t)*x
>> 4;
5303 /* Return nonzero if CODE is a tree code that represents a truth value. */
5305 truth_value_p (enum tree_code code
)
5307 return (TREE_CODE_CLASS (code
) == tcc_comparison
5308 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5309 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5310 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5313 /* Return whether TYPE is a type suitable for an offset for
5314 a POINTER_PLUS_EXPR. */
5316 ptrofftype_p (tree type
)
5318 return (INTEGRAL_TYPE_P (type
)
5319 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5320 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5323 /* Return true if the argument is a complete type or an array
5324 of unknown bound (whose type is incomplete but) whose elements
5325 have complete type. */
5327 complete_or_array_type_p (const_tree type
)
5329 return COMPLETE_TYPE_P (type
)
5330 || (TREE_CODE (type
) == ARRAY_TYPE
5331 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
5334 /* Return true if the value of T could be represented as a poly_widest_int. */
5337 poly_int_tree_p (const_tree t
)
5339 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
5342 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5343 to be a poly_uint64. (This is always true at the gimple level.) */
5346 bit_field_size (const_tree t
)
5348 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
5351 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5352 known to be a poly_uint64. (This is always true at the gimple level.) */
5355 bit_field_offset (const_tree t
)
5357 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
5360 extern tree
strip_float_extensions (tree
);
5361 extern bool really_constant_p (const_tree
);
5362 extern bool ptrdiff_tree_p (const_tree
, poly_int64_pod
*);
5363 extern bool decl_address_invariant_p (const_tree
);
5364 extern bool decl_address_ip_invariant_p (const_tree
);
5365 extern bool int_fits_type_p (const_tree
, const_tree
)
5366 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
5367 #ifndef GENERATOR_FILE
5368 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5370 extern bool variably_modified_type_p (tree
, tree
);
5371 extern int tree_log2 (const_tree
);
5372 extern int tree_floor_log2 (const_tree
);
5373 extern unsigned int tree_ctz (const_tree
);
5374 extern int simple_cst_equal (const_tree
, const_tree
);
5379 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
5383 /* Compat version until all callers are converted. Return hash for
5385 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
5387 inchash::hash
hstate (seed
);
5388 inchash::add_expr (tree
, hstate
);
5389 return hstate
.end ();
5392 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5393 extern bool type_list_equal (const_tree
, const_tree
);
5394 extern bool chain_member (const_tree
, const_tree
);
5395 extern void dump_tree_statistics (void);
5396 extern void recompute_tree_invariant_for_addr_expr (tree
);
5397 extern bool needs_to_live_in_memory (const_tree
);
5398 extern tree
reconstruct_complex_type (tree
, tree
);
5399 extern bool real_onep (const_tree
);
5400 extern bool real_minus_onep (const_tree
);
5401 extern bool real_maybe_zerop (const_tree
);
5402 extern void init_ttree (void);
5403 extern void build_common_tree_nodes (bool);
5404 extern void build_common_builtin_nodes (void);
5405 extern void tree_cc_finalize (void);
5406 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5407 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
5408 extern tree
build_range_type (tree
, tree
, tree
);
5409 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5410 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5411 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5412 extern tree
tree_block (tree
);
5413 extern void tree_set_block (tree
, tree
);
5414 extern location_t
*block_nonartificial_location (tree
);
5415 extern location_t
tree_nonartificial_location (tree
);
5416 extern location_t
tree_inlined_location (tree
, bool = true);
5417 extern tree
block_ultimate_origin (const_tree
);
5418 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5419 extern bool virtual_method_call_p (const_tree
, bool = false);
5420 extern tree
obj_type_ref_class (const_tree ref
, bool = false);
5421 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5422 extern bool contains_bitfld_component_ref_p (const_tree
);
5423 extern bool block_may_fallthru (const_tree
);
5424 extern void using_eh_for_cleanups (void);
5425 extern bool using_eh_for_cleanups_p (void);
5426 extern const char *get_tree_code_name (enum tree_code
);
5427 extern void set_call_expr_flags (tree
, int);
5428 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5430 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5432 #define walk_tree(a,b,c,d) \
5433 walk_tree_1 (a, b, c, d, NULL)
5434 #define walk_tree_without_duplicates(a,b,c) \
5435 walk_tree_without_duplicates_1 (a, b, c, NULL)
5437 extern tree
drop_tree_overflow (tree
);
5439 /* Given a memory reference expression T, return its base address.
5440 The base address of a memory reference expression is the main
5441 object being referenced. */
5442 extern tree
get_base_address (tree t
);
5444 /* Return a tree of sizetype representing the size, in bytes, of the element
5445 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5446 extern tree
array_ref_element_size (tree
);
5448 /* Return a typenode for the "standard" C type with a given name. */
5449 extern tree
get_typenode_from_name (const char *);
5451 /* Return a tree representing the upper bound of the array mentioned in
5452 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5453 extern tree
array_ref_up_bound (tree
);
5455 /* Return a tree representing the lower bound of the array mentioned in
5456 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5457 extern tree
array_ref_low_bound (tree
);
5459 /* Returns true if REF is an array reference or a component reference
5460 to an array at the end of a structure. If this is the case, the array
5461 may be allocated larger than its upper bound implies. */
5462 extern bool array_at_struct_end_p (tree
);
5464 /* Return a tree representing the offset, in bytes, of the field referenced
5465 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5466 extern tree
component_ref_field_offset (tree
);
5468 /* Describes a "special" array member due to which component_ref_size
5470 enum struct special_array_member
5472 none
, /* Not a special array member. */
5473 int_0
, /* Interior array member with size zero. */
5474 trail_0
, /* Trailing array member with size zero. */
5475 trail_1
/* Trailing array member with one element. */
5478 /* Return the size of the member referenced by the COMPONENT_REF, using
5479 its initializer expression if necessary in order to determine the size
5480 of an initialized flexible array member. The size might be zero for
5481 an object with an uninitialized flexible array member or null if it
5482 cannot be determined. */
5483 extern tree
component_ref_size (tree
, special_array_member
* = NULL
);
5485 extern int tree_map_base_eq (const void *, const void *);
5486 extern unsigned int tree_map_base_hash (const void *);
5487 extern int tree_map_base_marked_p (const void *);
5488 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5489 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5490 bool trust_type_canonical
= true);
5491 extern bool type_with_interoperable_signedness (const_tree
);
5492 extern bitmap
get_nonnull_args (const_tree
);
5493 extern int get_range_pos_neg (tree
);
5495 /* Return true for a valid pair of new and delete operators. */
5496 extern bool valid_new_delete_pair_p (tree
, tree
, bool * = NULL
);
5498 /* Return simplified tree code of type that is used for canonical type
5500 inline enum tree_code
5501 tree_code_for_canonical_type_merging (enum tree_code code
)
5503 /* By C standard, each enumerated type shall be compatible with char,
5504 a signed integer, or an unsigned integer. The choice of type is
5505 implementation defined (in our case it depends on -fshort-enum).
5507 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5508 type and compare only by their signedness and precision. */
5509 if (code
== ENUMERAL_TYPE
)
5510 return INTEGER_TYPE
;
5511 /* To allow inter-operability between languages having references and
5512 C, we consider reference types and pointers alike. Note that this is
5513 not strictly necessary for C-Fortran 2008 interoperability because
5514 Fortran define C_PTR type that needs to be compatible with C pointers
5515 and we handle this one as ptr_type_node. */
5516 if (code
== REFERENCE_TYPE
)
5517 return POINTER_TYPE
;
5521 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5522 We don't define the types for pointers, arrays and vectors. The reason is
5523 that pointers are handled specially: ptr_type_node accesses conflict with
5524 accesses to all other pointers. This is done by alias.cc.
5525 Because alias sets of arrays and vectors are the same as types of their
5526 elements, we can't compute canonical type either. Otherwise we could go
5527 form void *[10] to int *[10] (because they are equivalent for canonical type
5528 machinery) and get wrong TBAA. */
5531 canonical_type_used_p (const_tree t
)
5533 return !(POINTER_TYPE_P (t
)
5534 || TREE_CODE (t
) == ARRAY_TYPE
5535 || TREE_CODE (t
) == VECTOR_TYPE
);
5538 /* Kinds of access to pass-by-reference arguments to functions. */
5542 access_read_only
= 1,
5543 access_write_only
= 2,
5544 access_read_write
= access_read_only
| access_write_only
,
5548 #define tree_map_eq tree_map_base_eq
5549 extern unsigned int tree_map_hash (const void *);
5550 #define tree_map_marked_p tree_map_base_marked_p
5552 #define tree_decl_map_eq tree_map_base_eq
5553 extern unsigned int tree_decl_map_hash (const void *);
5554 #define tree_decl_map_marked_p tree_map_base_marked_p
5556 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5558 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5560 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5562 return tree_decl_map_eq (a
, b
);
5566 keep_cache_entry (tree_decl_map
*&m
)
5568 return ggc_marked_p (m
->base
.from
);
5572 #define tree_int_map_eq tree_map_base_eq
5573 #define tree_int_map_hash tree_map_base_hash
5574 #define tree_int_map_marked_p tree_map_base_marked_p
5576 #define tree_vec_map_eq tree_map_base_eq
5577 #define tree_vec_map_hash tree_decl_map_hash
5578 #define tree_vec_map_marked_p tree_map_base_marked_p
5580 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
5582 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
5585 equal (tree_vec_map
*a
, tree_vec_map
*b
)
5587 return a
->base
.from
== b
->base
.from
;
5591 keep_cache_entry (tree_vec_map
*&m
)
5593 return ggc_marked_p (m
->base
.from
);
5597 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5598 is a better hash than the pointer value and gives a predictable traversal
5599 order. Additionally it can be used across PCH save/restore. */
5600 struct tree_decl_hash
: ggc_ptr_hash
<tree_node
>
5602 static inline hashval_t
hash (tree
);
5606 tree_decl_hash::hash (tree t
)
5608 return DECL_UID (t
);
5611 /* Similarly for types. Uses TYPE_UID as hash function. */
5612 struct tree_type_hash
: ggc_ptr_hash
<tree_node
>
5614 static inline hashval_t
hash (tree
);
5618 tree_type_hash::hash (tree t
)
5620 return TYPE_UID (t
);
5623 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5624 here, but the SSA_NAME_VERSION is a better hash than the pointer
5625 value and gives a predictable traversal order. */
5626 struct tree_ssa_name_hash
: ggc_ptr_hash
<tree_node
>
5628 static inline hashval_t
hash (tree
);
5632 tree_ssa_name_hash::hash (tree t
)
5634 return SSA_NAME_VERSION (t
);
5637 /* Hasher for general trees, based on their TREE_HASH. */
5638 struct tree_hash
: ggc_ptr_hash
<tree_node
>
5640 static hashval_t
hash (tree
);
5644 tree_hash::hash (tree t
)
5646 return TREE_HASH (t
);
5649 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5650 such a map will not mark keys, and will mark values if the key is already
5652 struct tree_cache_traits
5653 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5654 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5656 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5657 This is for hash_maps from decls to trees that need to work across PCH. */
5658 struct decl_tree_cache_traits
5659 : simple_cache_map_traits
<tree_decl_hash
, tree
> { };
5660 typedef hash_map
<tree
,tree
,decl_tree_cache_traits
> decl_tree_cache_map
;
5662 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5663 This is for hash_maps from types to trees that need to work across PCH. */
5664 struct type_tree_cache_traits
5665 : simple_cache_map_traits
<tree_type_hash
, tree
> { };
5666 typedef hash_map
<tree
,tree
,type_tree_cache_traits
> type_tree_cache_map
;
5668 /* Similarly to decl_tree_cache_map, but without caching. */
5669 struct decl_tree_traits
5670 : simple_hashmap_traits
<tree_decl_hash
, tree
> { };
5671 typedef hash_map
<tree
,tree
,decl_tree_traits
> decl_tree_map
;
5673 /* Initialize the abstract argument list iterator object ITER with the
5674 arguments from CALL_EXPR node EXP. */
5676 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5679 iter
->n
= call_expr_nargs (exp
);
5684 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5687 iter
->n
= call_expr_nargs (exp
);
5691 /* Return the next argument from abstract argument list iterator object ITER,
5692 and advance its state. Return NULL_TREE if there are no more arguments. */
5694 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5697 if (iter
->i
>= iter
->n
)
5699 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5704 static inline const_tree
5705 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5708 if (iter
->i
>= iter
->n
)
5710 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5715 /* Initialize the abstract argument list iterator object ITER, then advance
5716 past and return the first argument. Useful in for expressions, e.g.
5717 for (arg = first_call_expr_arg (exp, &iter); arg;
5718 arg = next_call_expr_arg (&iter)) */
5720 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5722 init_call_expr_arg_iterator (exp
, iter
);
5723 return next_call_expr_arg (iter
);
5726 static inline const_tree
5727 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5729 init_const_call_expr_arg_iterator (exp
, iter
);
5730 return next_const_call_expr_arg (iter
);
5733 /* Test whether there are more arguments in abstract argument list iterator
5734 ITER, without changing its state. */
5736 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5738 return (iter
->i
< iter
->n
);
5741 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5742 (of type call_expr_arg_iterator) to hold the iteration state. */
5743 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5744 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5745 (arg) = next_call_expr_arg (&(iter)))
5747 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5748 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5749 (arg) = next_const_call_expr_arg (&(iter)))
5751 /* Return true if tree node T is a language-specific node. */
5753 is_lang_specific (const_tree t
)
5755 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5758 /* Valid builtin number. */
5759 #define BUILTIN_VALID_P(FNCODE) \
5760 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5762 /* Obtain a pointer to the identifier string holding the asm name for
5763 BUILTIN, a BUILT_IN code. This is handy if the target
5764 mangles/overrides the function name that implements the
5766 #define BUILTIN_ASM_NAME_PTR(BUILTIN) \
5767 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
5769 /* Return the tree node for an explicit standard builtin function or NULL. */
5771 builtin_decl_explicit (enum built_in_function fncode
)
5773 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5775 return builtin_info
[(size_t)fncode
].decl
;
5778 /* Return the tree node for an implicit builtin function or NULL. */
5780 builtin_decl_implicit (enum built_in_function fncode
)
5782 size_t uns_fncode
= (size_t)fncode
;
5783 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5785 if (!builtin_info
[uns_fncode
].implicit_p
)
5788 return builtin_info
[uns_fncode
].decl
;
5791 /* Set explicit builtin function nodes and whether it is an implicit
5795 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5797 size_t ufncode
= (size_t)fncode
;
5799 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5800 && (decl
!= NULL_TREE
|| !implicit_p
));
5802 builtin_info
[ufncode
].decl
= decl
;
5803 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5804 builtin_info
[ufncode
].declared_p
= false;
5807 /* Set the implicit flag for a builtin function. */
5810 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5812 size_t uns_fncode
= (size_t)fncode
;
5814 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5815 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5817 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5820 /* Set the declared flag for a builtin function. */
5823 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5825 size_t uns_fncode
= (size_t)fncode
;
5827 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5828 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5830 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5833 /* Return whether the standard builtin function can be used as an explicit
5837 builtin_decl_explicit_p (enum built_in_function fncode
)
5839 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5840 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5843 /* Return whether the standard builtin function can be used implicitly. */
5846 builtin_decl_implicit_p (enum built_in_function fncode
)
5848 size_t uns_fncode
= (size_t)fncode
;
5850 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5851 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5852 && builtin_info
[uns_fncode
].implicit_p
);
5855 /* Return whether the standard builtin function was declared. */
5858 builtin_decl_declared_p (enum built_in_function fncode
)
5860 size_t uns_fncode
= (size_t)fncode
;
5862 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5863 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5864 && builtin_info
[uns_fncode
].declared_p
);
5867 /* Determine if the function identified by FNDECL is one that
5868 makes sense to match by name, for those places where we detect
5869 "magic" functions by name.
5871 Return true if FNDECL has a name and is an extern fndecl at file scope.
5872 FNDECL must be a non-NULL decl.
5874 Avoid using this, as it's generally better to use attributes rather
5875 than to check for functions by name. */
5878 maybe_special_function_p (const_tree fndecl
)
5880 tree name_decl
= DECL_NAME (fndecl
);
5882 /* Exclude functions not at the file scope, or not `extern',
5883 since they are not the magic functions we would otherwise
5885 && (DECL_CONTEXT (fndecl
) == NULL_TREE
5886 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
5887 && TREE_PUBLIC (fndecl
))
5892 /* Return true if T (assumed to be a DECL) is a global variable.
5893 A variable is considered global if its storage is not automatic. */
5896 is_global_var (const_tree t
)
5898 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5901 /* Return true if VAR may be aliased. A variable is considered as
5902 maybe aliased if it has its address taken by the local TU
5903 or possibly by another TU and might be modified through a pointer. */
5906 may_be_aliased (const_tree var
)
5908 return (TREE_CODE (var
) != CONST_DECL
5909 && (TREE_PUBLIC (var
)
5910 || DECL_EXTERNAL (var
)
5911 || TREE_ADDRESSABLE (var
))
5912 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5913 && (TREE_READONLY (var
)
5914 || (TREE_CODE (var
) == VAR_DECL
5915 && DECL_NONALIASED (var
)))));
5918 /* Return pointer to optimization flags of FNDECL. */
5919 static inline struct cl_optimization
*
5920 opts_for_fn (const_tree fndecl
)
5922 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5923 if (fn_opts
== NULL_TREE
)
5924 fn_opts
= optimization_default_node
;
5925 return TREE_OPTIMIZATION (fn_opts
);
5928 /* Return pointer to target flags of FNDECL. */
5929 static inline cl_target_option
*
5930 target_opts_for_fn (const_tree fndecl
)
5932 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5933 if (fn_opts
== NULL_TREE
)
5934 fn_opts
= target_option_default_node
;
5935 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5938 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5939 the optimization level of function fndecl. */
5940 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5942 /* For anonymous aggregate types, we need some sort of name to
5943 hold on to. In practice, this should not appear, but it should
5944 not be harmful if it does. Identifiers returned will be
5945 IDENTIFIER_ANON_P. */
5946 extern tree
make_anon_name ();
5948 /* The tree and const_tree overload templates. */
5951 class unextended_tree
5957 unextended_tree () {}
5958 unextended_tree (const_tree t
) : m_t (t
) {}
5960 unsigned int get_precision () const;
5961 const HOST_WIDE_INT
*get_val () const;
5962 unsigned int get_len () const;
5963 const_tree
get_tree () const { return m_t
; }
5967 struct int_traits
<unextended_tree
>
5969 static const enum precision_type precision_type
= VAR_PRECISION
;
5970 static const bool host_dependent_precision
= false;
5971 static const bool is_sign_extended
= false;
5982 extended_tree (const_tree
);
5984 unsigned int get_precision () const;
5985 const HOST_WIDE_INT
*get_val () const;
5986 unsigned int get_len () const;
5987 const_tree
get_tree () const { return m_t
; }
5991 struct int_traits
<extended_tree
<N
> >
5993 static const enum precision_type precision_type
= CONST_PRECISION
;
5994 static const bool host_dependent_precision
= false;
5995 static const bool is_sign_extended
= true;
5996 static const unsigned int precision
= N
;
5999 typedef extended_tree
<WIDE_INT_MAX_PRECISION
> widest_extended_tree
;
6000 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
6002 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
6003 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
6004 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
6007 tree_to_widest_ref
to_widest (const_tree
);
6008 tree_to_offset_ref
to_offset (const_tree
);
6009 tree_to_wide_ref
to_wide (const_tree
);
6010 wide_int
to_wide (const_tree
, unsigned int);
6012 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6013 generic_wide_int
<widest_extended_tree
> >
6014 tree_to_poly_widest_ref
;
6015 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6016 generic_wide_int
<offset_extended_tree
> >
6017 tree_to_poly_offset_ref
;
6018 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6019 generic_wide_int
<unextended_tree
> >
6020 tree_to_poly_wide_ref
;
6022 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
6023 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
6024 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
6027 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
6029 typedef generic_wide_int
<extended_tree
<N
> > extended
;
6030 static extended
zero (const extended
&);
6034 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
6036 typedef generic_wide_int
<unextended_tree
> unextended
;
6037 static unextended
zero (const unextended
&);
6041 /* Used to convert a tree to a widest2_int like this:
6042 widest2_int foo = widest2_int_cst (some_tree). */
6043 typedef generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
* 2> >
6046 /* Refer to INTEGER_CST T as though it were a widest_int.
6048 This function gives T's actual numerical value, influenced by the
6049 signedness of its type. For example, a signed byte with just the
6050 top bit set would be -128 while an unsigned byte with the same
6051 bit pattern would be 128.
6053 This is the right choice when operating on groups of INTEGER_CSTs
6054 that might have different signedness or precision. It is also the
6055 right choice in code that specifically needs an approximation of
6056 infinite-precision arithmetic instead of normal modulo arithmetic.
6058 The approximation of infinite precision is good enough for realistic
6059 numbers of additions and subtractions of INTEGER_CSTs (where
6060 "realistic" includes any number less than 1 << 31) but it cannot
6061 represent the result of multiplying the two largest supported
6062 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
6063 of multiplying two arbitrary INTEGER_CSTs and checking that the
6064 result is representable as a widest_int.
6066 Note that any overflow checking done on these values is relative to
6067 the range of widest_int rather than the range of a TREE_TYPE.
6069 Calling this function should have no overhead in release builds,
6070 so it is OK to call it several times for the same tree. If it is
6071 useful for readability reasons to reduce the number of calls,
6072 it is more efficient to use:
6074 wi::tree_to_widest_ref wt = wi::to_widest (t);
6078 widest_int wt = wi::to_widest (t). */
6080 inline wi::tree_to_widest_ref
6081 wi::to_widest (const_tree t
)
6086 /* Refer to INTEGER_CST T as though it were an offset_int.
6088 This function is an optimisation of wi::to_widest for cases
6089 in which T is known to be a bit or byte count in the range
6090 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
6091 the target's address size in bits.
6093 This is the right choice when operating on bit or byte counts as
6094 untyped numbers rather than M-bit values. The wi::to_widest comments
6095 about addition, subtraction and multiplication apply here: sequences
6096 of 1 << 31 additions and subtractions do not induce overflow, but
6097 multiplying the largest sizes might. Again,
6099 wi::tree_to_offset_ref wt = wi::to_offset (t);
6101 is more efficient than:
6103 offset_int wt = wi::to_offset (t). */
6105 inline wi::tree_to_offset_ref
6106 wi::to_offset (const_tree t
)
6111 /* Refer to INTEGER_CST T as though it were a wide_int.
6113 In contrast to the approximation of infinite-precision numbers given
6114 by wi::to_widest and wi::to_offset, this function treats T as a
6115 signless collection of N bits, where N is the precision of T's type.
6116 As with machine registers, signedness is determined by the operation
6117 rather than the operands; for example, there is a distinction between
6118 signed and unsigned division.
6120 This is the right choice when operating on values with the same type
6121 using normal modulo arithmetic. The overflow-checking forms of things
6122 like wi::add check whether the result can be represented in T's type.
6124 Calling this function should have no overhead in release builds,
6125 so it is OK to call it several times for the same tree. If it is
6126 useful for readability reasons to reduce the number of calls,
6127 it is more efficient to use:
6129 wi::tree_to_wide_ref wt = wi::to_wide (t);
6133 wide_int wt = wi::to_wide (t). */
6135 inline wi::tree_to_wide_ref
6136 wi::to_wide (const_tree t
)
6138 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
6139 TYPE_PRECISION (TREE_TYPE (t
)));
6142 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6143 truncating as necessary. When extending, use sign extension if T's
6144 type is signed and zero extension if T's type is unsigned. */
6147 wi::to_wide (const_tree t
, unsigned int prec
)
6149 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
6153 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
6156 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
6161 wi::extended_tree
<N
>::get_precision () const
6167 inline const HOST_WIDE_INT
*
6168 wi::extended_tree
<N
>::get_val () const
6170 return &TREE_INT_CST_ELT (m_t
, 0);
6175 wi::extended_tree
<N
>::get_len () const
6177 if (N
== ADDR_MAX_PRECISION
)
6178 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
6179 else if (N
>= WIDE_INT_MAX_PRECISION
)
6180 return TREE_INT_CST_EXT_NUNITS (m_t
);
6182 /* This class is designed to be used for specific output precisions
6183 and needs to be as fast as possible, so there is no fallback for
6189 wi::unextended_tree::get_precision () const
6191 return TYPE_PRECISION (TREE_TYPE (m_t
));
6194 inline const HOST_WIDE_INT
*
6195 wi::unextended_tree::get_val () const
6197 return &TREE_INT_CST_ELT (m_t
, 0);
6201 wi::unextended_tree::get_len () const
6203 return TREE_INT_CST_NUNITS (m_t
);
6206 /* Return the value of a POLY_INT_CST in its native precision. */
6208 inline wi::tree_to_poly_wide_ref
6209 poly_int_cst_value (const_tree x
)
6211 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
6212 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6213 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
6217 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6218 poly_widest_int. See wi::to_widest for more details. */
6220 inline wi::tree_to_poly_widest_ref
6221 wi::to_poly_widest (const_tree t
)
6223 if (POLY_INT_CST_P (t
))
6225 poly_int
<NUM_POLY_INT_COEFFS
,
6226 generic_wide_int
<widest_extended_tree
> > res
;
6227 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6228 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6234 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6235 poly_offset_int. See wi::to_offset for more details. */
6237 inline wi::tree_to_poly_offset_ref
6238 wi::to_poly_offset (const_tree t
)
6240 if (POLY_INT_CST_P (t
))
6242 poly_int
<NUM_POLY_INT_COEFFS
,
6243 generic_wide_int
<offset_extended_tree
> > res
;
6244 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6245 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6251 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6252 poly_wide_int. See wi::to_wide for more details. */
6254 inline wi::tree_to_poly_wide_ref
6255 wi::to_poly_wide (const_tree t
)
6257 if (POLY_INT_CST_P (t
))
6258 return poly_int_cst_value (t
);
6263 inline generic_wide_int
<wi::extended_tree
<N
> >
6264 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
6265 wi::CONST_PRECISION
>::zero (const extended
&x
)
6267 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6270 inline generic_wide_int
<wi::unextended_tree
>
6271 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
6272 wi::VAR_PRECISION
>::zero (const unextended
&x
)
6274 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6279 template <typename T
>
6280 bool fits_to_boolean_p (const T
&x
, const_tree
);
6282 template <typename T
>
6283 bool fits_to_tree_p (const T
&x
, const_tree
);
6285 wide_int
min_value (const_tree
);
6286 wide_int
max_value (const_tree
);
6287 wide_int
from_mpz (const_tree
, mpz_t
, bool);
6290 template <typename T
>
6292 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
6294 typedef typename poly_int_traits
<T
>::int_type int_type
;
6295 return (known_eq (x
, int_type (0))
6296 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
6299 template <typename T
>
6301 wi::fits_to_tree_p (const T
&x
, const_tree type
)
6303 /* Non-standard boolean types can have arbitrary precision but various
6304 transformations assume that they can only take values 0 and +/-1. */
6305 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
6306 return fits_to_boolean_p (x
, type
);
6308 if (TYPE_UNSIGNED (type
))
6309 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
6311 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
6314 /* Produce the smallest number that is represented in TYPE. The precision
6315 and sign are taken from TYPE. */
6317 wi::min_value (const_tree type
)
6319 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6322 /* Produce the largest number that is represented in TYPE. The precision
6323 and sign are taken from TYPE. */
6325 wi::max_value (const_tree type
)
6327 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6330 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6331 extending both according to their respective TYPE_SIGNs. */
6334 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6336 return wi::to_widest (t1
) < wi::to_widest (t2
);
6339 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6340 extending both according to their respective TYPE_SIGNs. */
6343 tree_int_cst_le (const_tree t1
, const_tree t2
)
6345 return wi::to_widest (t1
) <= wi::to_widest (t2
);
6348 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6349 are both INTEGER_CSTs and their values are extended according to their
6350 respective TYPE_SIGNs. */
6353 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6355 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
6358 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6359 but none of these files are allowed to be included from front ends.
6360 They should be split in two. One suitable for the FEs, the other suitable
6363 /* Assign the RTX to declaration. */
6364 extern void set_decl_rtl (tree
, rtx
);
6365 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
6367 /* Given an expression EXP that is a handled_component_p,
6368 look for the ultimate containing object, which is returned and specify
6369 the access position and size. */
6370 extern tree
get_inner_reference (tree
, poly_int64_pod
*, poly_int64_pod
*,
6371 tree
*, machine_mode
*, int *, int *, int *);
6373 extern tree
build_personality_function (const char *);
6375 struct GTY(()) int_n_trees_t
{
6376 /* These parts are initialized at runtime */
6381 /* This is also in machmode.h */
6382 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
6383 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
6385 /* Like bit_position, but return as an integer. It must be representable in
6386 that way (since it could be a signed value, we don't have the
6387 option of returning -1 like int_size_in_byte can. */
6389 inline HOST_WIDE_INT
6390 int_bit_position (const_tree field
)
6392 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
6393 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
6396 /* Return true if it makes sense to consider alias set for a type T. */
6399 type_with_alias_set_p (const_tree t
)
6401 /* Function and method types are never accessed as memory locations. */
6402 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
6405 if (COMPLETE_TYPE_P (t
))
6408 /* Incomplete types cannot be accessed in general except for arrays
6409 where we can fetch its element despite we have no array bounds. */
6410 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
6416 extern location_t
set_block (location_t loc
, tree block
);
6418 extern void gt_ggc_mx (tree
&);
6419 extern void gt_pch_nx (tree
&);
6420 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
6422 extern bool nonnull_arg_p (const_tree
);
6423 extern bool is_empty_type (const_tree
);
6424 extern bool default_is_empty_record (const_tree
);
6425 extern bool flexible_array_type_p (const_tree
);
6426 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
6427 extern tree
arg_size_in_bytes (const_tree
);
6428 extern bool expr_type_first_operand_type_p (tree_code
);
6431 set_source_range (tree expr
, location_t start
, location_t finish
);
6434 set_source_range (tree expr
, source_range src_range
);
6436 /* Return true if it makes sense to promote/demote from_type to to_type. */
6438 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
6440 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
6442 /* OK to promote if to_type is no bigger than word_mode. */
6443 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
6446 /* Otherwise, allow only if narrowing or same precision conversions. */
6447 return to_type_precision
<= TYPE_PRECISION (from_type
);
6450 /* Pointer type used to declare builtins before we have seen its real
6452 class builtin_structptr_type
6459 extern const builtin_structptr_type builtin_structptr_types
[6];
6461 /* Return true if type T has the same precision as its underlying mode. */
6464 type_has_mode_precision_p (const_tree t
)
6466 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
6469 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6471 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6472 accessor, as this is impervious to user declaration. */
6475 fndecl_built_in_p (const_tree node
)
6477 return DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
;
6480 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6484 fndecl_built_in_p (const_tree node
, built_in_class klass
)
6486 return fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
;
6489 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6490 of class KLASS with name equal to NAME. */
6493 fndecl_built_in_p (const_tree node
, unsigned int name
, built_in_class klass
)
6495 return (fndecl_built_in_p (node
, klass
)
6496 && DECL_UNCHECKED_FUNCTION_CODE (node
) == name
);
6499 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6500 of BUILT_IN_NORMAL class with name equal to NAME. */
6503 fndecl_built_in_p (const_tree node
, built_in_function name
)
6505 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
6506 && DECL_FUNCTION_CODE (node
) == name
);
6509 /* A struct for encapsulating location information about an operator
6510 and the operation built from it.
6512 m_operator_loc is the location of the operator
6513 m_combined_loc is the location of the compound expression.
6515 For example, given "a && b" the, operator location is:
6518 and the combined location is:
6521 Capturing this information allows for class binary_op_rich_location
6522 to provide detailed information about e.g. type mismatches in binary
6523 operations where enough location information is available:
6531 falling back to just showing the combined location:
6541 location_t m_operator_loc
;
6542 location_t m_combined_loc
;
6544 /* 1-argument ctor, for constructing from a combined location. */
6545 op_location_t (location_t combined_loc
)
6546 : m_operator_loc (UNKNOWN_LOCATION
), m_combined_loc (combined_loc
)
6549 /* 2-argument ctor, for distinguishing between the operator's location
6550 and the combined location. */
6551 op_location_t (location_t operator_loc
, location_t combined_loc
)
6552 : m_operator_loc (operator_loc
), m_combined_loc (combined_loc
)
6555 /* Implicitly convert back to a location_t, using the combined location. */
6556 operator location_t () const { return m_combined_loc
; }
6559 /* Code that doesn't refer to any warning. Has no effect on suppression
6561 constexpr opt_code no_warning
= opt_code ();
6562 /* Wildcard code that refers to all warnings. */
6563 constexpr opt_code all_warnings
= N_OPTS
;
6565 /* Return the disposition for a warning (or all warnings by default)
6567 extern bool warning_suppressed_at (location_t
, opt_code
= all_warnings
);
6568 /* Set the disposition for a warning (or all warnings by default)
6569 at a location to disabled by default. */
6570 extern bool suppress_warning_at (location_t
, opt_code
= all_warnings
,
6572 /* Copy warning disposition from one location to another. */
6573 extern void copy_warning (location_t
, location_t
);
6575 /* Return the disposition for a warning (or all warnings by default)
6576 for an expression. */
6577 extern bool warning_suppressed_p (const_tree
, opt_code
= all_warnings
);
6578 /* Set the disposition for a warning (or all warnings by default)
6579 at a location to disabled by default. */
6580 extern void suppress_warning (tree
, opt_code
= all_warnings
, bool = true)
6581 ATTRIBUTE_NONNULL (1);
6582 /* Copy warning disposition from one expression to another. */
6583 extern void copy_warning (tree
, const_tree
);
6585 /* Return the zero-based number corresponding to the argument being
6586 deallocated if FNDECL is a deallocation function or an out-of-bounds
6587 value if it isn't. */
6588 extern unsigned fndecl_dealloc_argno (tree
);
6590 /* If an expression refers to a character array or pointer declared
6591 attribute nonstring, return a decl for that array or pointer and
6592 if nonnull, set the second argument to the referenced enclosing
6593 object or pointer. Otherwise return null. */
6594 extern tree
get_attr_nonstring_decl (tree
, tree
* = NULL
);
6596 extern int get_target_clone_attr_len (tree
);
6598 #endif /* GCC_TREE_H */