1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2015 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"
25 /* Macros for initializing `tree_contains_struct'. */
26 #define MARK_TS_BASE(C) \
28 tree_contains_struct[C][TS_BASE] = 1; \
31 #define MARK_TS_TYPED(C) \
34 tree_contains_struct[C][TS_TYPED] = 1; \
37 #define MARK_TS_COMMON(C) \
40 tree_contains_struct[C][TS_COMMON] = 1; \
43 #define MARK_TS_TYPE_COMMON(C) \
46 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
49 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
51 MARK_TS_TYPE_COMMON (C); \
52 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
55 #define MARK_TS_DECL_MINIMAL(C) \
58 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
61 #define MARK_TS_DECL_COMMON(C) \
63 MARK_TS_DECL_MINIMAL (C); \
64 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
67 #define MARK_TS_DECL_WRTL(C) \
69 MARK_TS_DECL_COMMON (C); \
70 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
73 #define MARK_TS_DECL_WITH_VIS(C) \
75 MARK_TS_DECL_WRTL (C); \
76 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
79 #define MARK_TS_DECL_NON_COMMON(C) \
81 MARK_TS_DECL_WITH_VIS (C); \
82 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
86 /* Returns the string representing CLASS. */
88 #define TREE_CODE_CLASS_STRING(CLASS)\
89 tree_code_class_strings[(int) (CLASS)]
91 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
93 /* Nonzero if NODE represents an exceptional code. */
95 #define EXCEPTIONAL_CLASS_P(NODE)\
96 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
98 /* Nonzero if NODE represents a constant. */
100 #define CONSTANT_CLASS_P(NODE)\
101 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
103 /* Nonzero if NODE represents a type. */
105 #define TYPE_P(NODE)\
106 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
108 /* Nonzero if NODE represents a declaration. */
110 #define DECL_P(NODE)\
111 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
113 /* True if NODE designates a variable declaration. */
114 #define VAR_P(NODE) \
115 (TREE_CODE (NODE) == VAR_DECL)
117 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
119 #define VAR_OR_FUNCTION_DECL_P(DECL)\
120 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
122 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
123 ascending code order. */
125 #define INDIRECT_REF_P(NODE)\
126 (TREE_CODE (NODE) == INDIRECT_REF)
128 /* Nonzero if NODE represents a reference. */
130 #define REFERENCE_CLASS_P(NODE)\
131 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
133 /* Nonzero if NODE represents a comparison. */
135 #define COMPARISON_CLASS_P(NODE)\
136 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
138 /* Nonzero if NODE represents a unary arithmetic expression. */
140 #define UNARY_CLASS_P(NODE)\
141 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
143 /* Nonzero if NODE represents a binary arithmetic expression. */
145 #define BINARY_CLASS_P(NODE)\
146 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
148 /* Nonzero if NODE represents a statement expression. */
150 #define STATEMENT_CLASS_P(NODE)\
151 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
153 /* Nonzero if NODE represents a function call-like expression with a
154 variable-length operand vector. */
156 #define VL_EXP_CLASS_P(NODE)\
157 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
159 /* Nonzero if NODE represents any other expression. */
161 #define EXPRESSION_CLASS_P(NODE)\
162 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
164 /* Returns nonzero iff NODE represents a type or declaration. */
166 #define IS_TYPE_OR_DECL_P(NODE)\
167 (TYPE_P (NODE) || DECL_P (NODE))
169 /* Returns nonzero iff CLASS is the tree-code class of an
172 #define IS_EXPR_CODE_CLASS(CLASS)\
173 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
175 /* Returns nonzero iff NODE is an expression of some kind. */
177 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
179 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
182 /* Helper macros for math builtins. */
184 #define BUILTIN_EXP10_P(FN) \
185 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
186 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
188 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
189 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
190 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
192 #define BUILTIN_SQRT_P(FN) \
193 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
195 #define BUILTIN_CBRT_P(FN) \
196 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
198 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
200 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
201 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
202 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
204 #define NULL_TREE (tree) NULL
206 /* Define accessors for the fields that all tree nodes have
207 (though some fields are not used for all kinds of nodes). */
209 /* The tree-code says what kind of node it is.
210 Codes are defined in tree.def. */
211 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
212 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
214 /* When checking is enabled, errors will be generated if a tree node
215 is accessed incorrectly. The macros die with a fatal error. */
216 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
218 #define TREE_CHECK(T, CODE) \
219 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
221 #define TREE_NOT_CHECK(T, CODE) \
222 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
224 #define TREE_CHECK2(T, CODE1, CODE2) \
225 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
227 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
228 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
230 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
231 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
233 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
234 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
235 (CODE1), (CODE2), (CODE3)))
237 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
238 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
239 (CODE1), (CODE2), (CODE3), (CODE4)))
241 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
242 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
243 (CODE1), (CODE2), (CODE3), (CODE4)))
245 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
246 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
247 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
249 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
250 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
251 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
253 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
254 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
256 #define TREE_CLASS_CHECK(T, CLASS) \
257 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
259 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
260 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
262 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
263 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
265 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
266 (omp_clause_range_check ((T), (CODE1), (CODE2), \
267 __FILE__, __LINE__, __FUNCTION__))
269 /* These checks have to be special cased. */
270 #define EXPR_CHECK(T) \
271 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
273 /* These checks have to be special cased. */
274 #define NON_TYPE_CHECK(T) \
275 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
277 /* These checks have to be special cased. */
278 #define ANY_INTEGRAL_TYPE_CHECK(T) \
279 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
281 #define TREE_INT_CST_ELT_CHECK(T, I) \
282 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
284 #define TREE_VEC_ELT_CHECK(T, I) \
285 (*(CONST_CAST2 (tree *, typeof (T)*, \
286 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
288 #define OMP_CLAUSE_ELT_CHECK(T, I) \
289 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
291 /* Special checks for TREE_OPERANDs. */
292 #define TREE_OPERAND_CHECK(T, I) \
293 (*(CONST_CAST2 (tree*, typeof (T)*, \
294 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
296 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
297 (*(tree_operand_check_code ((T), (CODE), (I), \
298 __FILE__, __LINE__, __FUNCTION__)))
300 /* Nodes are chained together for many purposes.
301 Types are chained together to record them for being output to the debugger
302 (see the function `chain_type').
303 Decls in the same scope are chained together to record the contents
305 Statement nodes for successive statements used to be chained together.
306 Often lists of things are represented by TREE_LIST nodes that
307 are chained together. */
309 #define TREE_CHAIN(NODE) \
310 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
312 /* In all nodes that are expressions, this is the data type of the expression.
313 In POINTER_TYPE nodes, this is the type that the pointer points to.
314 In ARRAY_TYPE nodes, this is the type of the elements.
315 In VECTOR_TYPE nodes, this is the type of the elements. */
316 #define TREE_TYPE(NODE) \
317 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
319 extern void tree_contains_struct_check_failed (const_tree
,
320 const enum tree_node_structure_enum
,
321 const char *, int, const char *)
324 extern void tree_check_failed (const_tree
, const char *, int, const char *,
325 ...) ATTRIBUTE_NORETURN
;
326 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
327 ...) ATTRIBUTE_NORETURN
;
328 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
329 const char *, int, const char *)
331 extern void tree_range_check_failed (const_tree
, const char *, int,
332 const char *, enum tree_code
,
335 extern void tree_not_class_check_failed (const_tree
,
336 const enum tree_code_class
,
337 const char *, int, const char *)
339 extern void tree_int_cst_elt_check_failed (int, int, const char *,
342 extern void tree_vec_elt_check_failed (int, int, const char *,
345 extern void phi_node_elt_check_failed (int, int, const char *,
348 extern void tree_operand_check_failed (int, const_tree
,
349 const char *, int, const char *)
351 extern void omp_clause_check_failed (const_tree
, const char *, int,
352 const char *, enum omp_clause_code
)
354 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
357 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
358 const char *, enum omp_clause_code
,
359 enum omp_clause_code
)
362 #else /* not ENABLE_TREE_CHECKING, or not gcc */
364 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
365 #define TREE_CHECK(T, CODE) (T)
366 #define TREE_NOT_CHECK(T, CODE) (T)
367 #define TREE_CHECK2(T, CODE1, CODE2) (T)
368 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
369 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
370 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
371 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
372 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
373 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
374 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
375 #define TREE_CLASS_CHECK(T, CODE) (T)
376 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
377 #define EXPR_CHECK(T) (T)
378 #define NON_TYPE_CHECK(T) (T)
379 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
380 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
381 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
382 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
383 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
384 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
385 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
386 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
388 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
389 #define TREE_TYPE(NODE) ((NODE)->typed.type)
393 #define TREE_BLOCK(NODE) (tree_block (NODE))
394 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
396 #include "tree-check.h"
398 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
399 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
400 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
401 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
402 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
403 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
404 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
405 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
406 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
407 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
408 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
410 #define RECORD_OR_UNION_CHECK(T) \
411 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
412 #define NOT_RECORD_OR_UNION_CHECK(T) \
413 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
415 #define NUMERICAL_TYPE_CHECK(T) \
416 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
419 /* Here is how primitive or already-canonicalized types' hash codes
421 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
423 /* A simple hash function for an arbitrary tree node. This must not be
424 used in hash tables which are saved to a PCH. */
425 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
427 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
428 #define CONVERT_EXPR_CODE_P(CODE) \
429 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
431 /* Similarly, but accept an expression instead of a tree code. */
432 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
434 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
436 #define CASE_CONVERT \
440 /* Given an expression as a tree, strip any conversion that generates
441 no instruction. Accepts both tree and const_tree arguments since
442 we are not modifying the tree itself. */
444 #define STRIP_NOPS(EXP) \
445 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
447 /* Like STRIP_NOPS, but don't let the signedness change either. */
449 #define STRIP_SIGN_NOPS(EXP) \
450 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
452 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
454 #define STRIP_TYPE_NOPS(EXP) \
455 while ((CONVERT_EXPR_P (EXP) \
456 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
457 && TREE_OPERAND (EXP, 0) != error_mark_node \
458 && (TREE_TYPE (EXP) \
459 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
460 (EXP) = TREE_OPERAND (EXP, 0)
462 /* Remove unnecessary type conversions according to
463 tree_ssa_useless_type_conversion. */
465 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
466 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
468 /* Nonzero if TYPE represents a vector type. */
470 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
472 /* Nonzero if TYPE represents an integral type. Note that we do not
473 include COMPLEX types here. Keep these checks in ascending code
476 #define INTEGRAL_TYPE_P(TYPE) \
477 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
478 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
479 || TREE_CODE (TYPE) == INTEGER_TYPE)
481 /* Nonzero if TYPE represents an integral type, including complex
482 and vector integer types. */
484 #define ANY_INTEGRAL_TYPE_P(TYPE) \
485 (INTEGRAL_TYPE_P (TYPE) \
486 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
487 || VECTOR_TYPE_P (TYPE)) \
488 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
490 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
492 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
493 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
495 /* Nonzero if TYPE represents a saturating fixed-point type. */
497 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
498 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
500 /* Nonzero if TYPE represents a fixed-point type. */
502 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
504 /* Nonzero if TYPE represents a scalar floating-point type. */
506 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
508 /* Nonzero if TYPE represents a complex floating-point type. */
510 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
511 (TREE_CODE (TYPE) == COMPLEX_TYPE \
512 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
514 /* Nonzero if TYPE represents a vector integer type. */
516 #define VECTOR_INTEGER_TYPE_P(TYPE) \
517 (VECTOR_TYPE_P (TYPE) \
518 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
521 /* Nonzero if TYPE represents a vector floating-point type. */
523 #define VECTOR_FLOAT_TYPE_P(TYPE) \
524 (VECTOR_TYPE_P (TYPE) \
525 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
527 /* Nonzero if TYPE represents a floating-point type, including complex
528 and vector floating-point types. The vector and complex check does
529 not use the previous two macros to enable early folding. */
531 #define FLOAT_TYPE_P(TYPE) \
532 (SCALAR_FLOAT_TYPE_P (TYPE) \
533 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
534 || VECTOR_TYPE_P (TYPE)) \
535 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
537 /* Nonzero if TYPE represents a decimal floating-point type. */
538 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
539 (SCALAR_FLOAT_TYPE_P (TYPE) \
540 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
542 /* Nonzero if TYPE is a record or union type. */
543 #define RECORD_OR_UNION_TYPE_P(TYPE) \
544 (TREE_CODE (TYPE) == RECORD_TYPE \
545 || TREE_CODE (TYPE) == UNION_TYPE \
546 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
548 /* Nonzero if TYPE represents an aggregate (multi-component) type.
549 Keep these checks in ascending code order. */
551 #define AGGREGATE_TYPE_P(TYPE) \
552 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
554 /* Nonzero if TYPE represents a pointer or reference type.
555 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
556 ascending code order. */
558 #define POINTER_TYPE_P(TYPE) \
559 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
561 /* Nonzero if TYPE represents a pointer to function. */
562 #define FUNCTION_POINTER_TYPE_P(TYPE) \
563 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
565 /* Nonzero if this type is a complete type. */
566 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
568 /* Nonzero if this type is a pointer bounds type. */
569 #define POINTER_BOUNDS_TYPE_P(NODE) \
570 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
572 /* Nonzero if this node has a pointer bounds type. */
573 #define POINTER_BOUNDS_P(NODE) \
574 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
576 /* Nonzero if this type supposes bounds existence. */
577 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
579 /* Nonzero for objects with bounded type. */
580 #define BOUNDED_P(node) \
581 BOUNDED_TYPE_P (TREE_TYPE (node))
583 /* Nonzero if this type is the (possibly qualified) void type. */
584 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
586 /* Nonzero if this type is complete or is cv void. */
587 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
588 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
590 /* Nonzero if this type is complete or is an array with unspecified bound. */
591 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
592 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
594 /* Define many boolean fields that all tree nodes have. */
596 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
597 of this is needed. So it cannot be in a register.
598 In a FUNCTION_DECL it has no meaning.
599 In LABEL_DECL nodes, it means a goto for this label has been seen
600 from a place outside all binding contours that restore stack levels.
601 In an artificial SSA_NAME that points to a stack partition with at least
602 two variables, it means that at least one variable has TREE_ADDRESSABLE.
603 In ..._TYPE nodes, it means that objects of this type must be fully
604 addressable. This means that pieces of this object cannot go into
605 register parameters, for example. If this a function type, this
606 means that the value must be returned in memory.
607 In CONSTRUCTOR nodes, it means object constructed must be in memory.
608 In IDENTIFIER_NODEs, this means that some extern decl for this name
609 had its address taken. That matters for inline functions.
610 In a STMT_EXPR, it means we want the result of the enclosed expression. */
611 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
613 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
614 exit of a function. Calls for which this is true are candidates for tail
615 call optimizations. */
616 #define CALL_EXPR_TAILCALL(NODE) \
617 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
619 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
620 CASE_LOW operand has been processed. */
621 #define CASE_LOW_SEEN(NODE) \
622 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
624 #define PREDICT_EXPR_OUTCOME(NODE) \
625 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
626 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
627 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
628 #define PREDICT_EXPR_PREDICTOR(NODE) \
629 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
631 /* In a VAR_DECL, nonzero means allocate static storage.
632 In a FUNCTION_DECL, nonzero if function has been defined.
633 In a CONSTRUCTOR, nonzero means allocate static storage. */
634 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
636 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
637 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
639 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
640 should only be executed if an exception is thrown, not on normal exit
642 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
644 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
645 separate cleanup in honor_protect_cleanup_actions. */
646 #define TRY_CATCH_IS_CLEANUP(NODE) \
647 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
649 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
650 CASE_HIGH operand has been processed. */
651 #define CASE_HIGH_SEEN(NODE) \
652 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
654 /* Used to mark scoped enums. */
655 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
657 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
658 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
660 /* In an expr node (usually a conversion) this means the node was made
661 implicitly and should not lead to any sort of warning. In a decl node,
662 warnings concerning the decl should be suppressed. This is used at
663 least for used-before-set warnings, and it set after one warning is
665 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
667 /* Used to indicate that this TYPE represents a compiler-generated entity. */
668 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
670 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
671 this string as an argument. */
672 #define TREE_SYMBOL_REFERENCED(NODE) \
673 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
675 /* Nonzero in a pointer or reference type means the data pointed to
676 by this type can alias anything. */
677 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
678 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
680 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
681 there was an overflow in folding. */
683 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
685 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
687 #define TREE_OVERFLOW_P(EXPR) \
688 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
690 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
691 nonzero means name is to be accessible from outside this translation unit.
692 In an IDENTIFIER_NODE, nonzero means an external declaration
693 accessible from outside this translation unit was previously seen
694 for this name in an inner scope. */
695 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
697 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
698 of cached values, or is something else. */
699 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
701 /* In a SAVE_EXPR, indicates that the original expression has already
702 been substituted with a VAR_DECL that contains the value. */
703 #define SAVE_EXPR_RESOLVED_P(NODE) \
704 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
706 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
708 #define CALL_EXPR_VA_ARG_PACK(NODE) \
709 (CALL_EXPR_CHECK (NODE)->base.public_flag)
711 /* In any expression, decl, or constant, nonzero means it has side effects or
712 reevaluation of the whole expression could produce a different value.
713 This is set if any subexpression is a function call, a side effect or a
714 reference to a volatile variable. In a ..._DECL, this is set only if the
715 declaration said `volatile'. This will never be set for a constant. */
716 #define TREE_SIDE_EFFECTS(NODE) \
717 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
719 /* In a LABEL_DECL, nonzero means this label had its address taken
720 and therefore can never be deleted and is a jump target for
722 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
724 /* Nonzero means this expression is volatile in the C sense:
725 its address should be of type `volatile WHATEVER *'.
726 In other words, the declared item is volatile qualified.
727 This is used in _DECL nodes and _REF nodes.
728 On a FUNCTION_DECL node, this means the function does not
729 return normally. This is the same effect as setting
730 the attribute noreturn on the function in C.
732 In a ..._TYPE node, means this type is volatile-qualified.
733 But use TYPE_VOLATILE instead of this macro when the node is a type,
734 because eventually we may make that a different bit.
736 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
737 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
739 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
740 accessing the memory pointed to won't generate a trap. However,
741 this only applies to an object when used appropriately: it doesn't
742 mean that writing a READONLY mem won't trap.
744 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
745 (or slice of the array) always belongs to the range of the array.
746 I.e. that the access will not trap, provided that the access to
747 the base to the array will not trap. */
748 #define TREE_THIS_NOTRAP(NODE) \
749 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
750 ARRAY_RANGE_REF)->base.nothrow_flag)
752 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
753 nonzero means it may not be the lhs of an assignment.
754 Nonzero in a FUNCTION_DECL means this function should be treated
755 as "const" function (can only read its arguments). */
756 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
758 /* Value of expression is constant. Always on in all ..._CST nodes. May
759 also appear in an expression or decl where the value is constant. */
760 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
762 /* Nonzero if NODE, a type, has had its sizes gimplified. */
763 #define TYPE_SIZES_GIMPLIFIED(NODE) \
764 (TYPE_CHECK (NODE)->base.constant_flag)
766 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
767 #define DECL_UNSIGNED(NODE) \
768 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
770 /* In integral and pointer types, means an unsigned type. */
771 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
773 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
774 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
776 /* True if overflow wraps around for the given integral type. That
777 is, TYPE_MAX + 1 == TYPE_MIN. */
778 #define TYPE_OVERFLOW_WRAPS(TYPE) \
779 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
781 /* True if overflow is undefined for the given integral type. We may
782 optimize on the assumption that values in the type never overflow.
784 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
785 must issue a warning based on warn_strict_overflow. In some cases
786 it will be appropriate to issue the warning immediately, and in
787 other cases it will be appropriate to simply set a flag and let the
788 caller decide whether a warning is appropriate or not. */
789 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
790 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
791 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
793 /* True if overflow for the given integral type should issue a
795 #define TYPE_OVERFLOW_TRAPS(TYPE) \
796 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
798 /* True if an overflow is to be preserved for sanitization. */
799 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
800 (INTEGRAL_TYPE_P (TYPE) \
801 && !TYPE_OVERFLOW_WRAPS (TYPE) \
802 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
804 /* True if pointer types have undefined overflow. */
805 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
807 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
808 Nonzero in a FUNCTION_DECL means that the function has been compiled.
809 This is interesting in an inline function, since it might not need
810 to be compiled separately.
811 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
812 or TYPE_DECL if the debugging info for the type has been written.
813 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
814 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
816 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
818 /* Nonzero in a _DECL if the name is used in its scope.
819 Nonzero in an expr node means inhibit warning if value is unused.
820 In IDENTIFIER_NODEs, this means that some extern decl for this name
822 In a BLOCK, this means that the block contains variables that are used. */
823 #define TREE_USED(NODE) ((NODE)->base.used_flag)
825 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
826 throw an exception. In a CALL_EXPR, nonzero means the call cannot
827 throw. We can't easily check the node type here as the C++
828 frontend also uses this flag (for AGGR_INIT_EXPR). */
829 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
831 /* In a CALL_EXPR, means that it's safe to use the target of the call
832 expansion as the return slot for a call that returns in memory. */
833 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
834 (CALL_EXPR_CHECK (NODE)->base.private_flag)
836 /* Cilk keywords accessors. */
837 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
839 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
840 passed by invisible reference (and the TREE_TYPE is a pointer to the true
842 #define DECL_BY_REFERENCE(NODE) \
843 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
844 RESULT_DECL)->decl_common.decl_by_reference_flag)
846 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
848 #define DECL_READ_P(NODE) \
849 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
851 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
852 attempting to share the stack slot with some other variable. */
853 #define DECL_NONSHAREABLE(NODE) \
854 (TREE_CHECK2 (NODE, VAR_DECL, \
855 RESULT_DECL)->decl_common.decl_nonshareable_flag)
857 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
858 thunked-to function. */
859 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
861 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
862 it has been built for the declaration of a variable-sized object. */
863 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
864 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
866 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
867 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
869 /* In a type, nonzero means that all objects of the type are guaranteed by the
870 language or front-end to be properly aligned, so we can indicate that a MEM
871 of this type is aligned at least to the alignment of the type, even if it
872 doesn't appear that it is. We see this, for example, in object-oriented
873 languages where a tag field may show this is an object of a more-aligned
874 variant of the more generic type.
876 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
878 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
880 /* Used in classes in C++. */
881 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
882 /* Used in classes in C++. */
883 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
885 /* True if reference type NODE is a C++ rvalue reference. */
886 #define TYPE_REF_IS_RVALUE(NODE) \
887 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
889 /* Nonzero in a _DECL if the use of the name is defined as a
890 deprecated feature by __attribute__((deprecated)). */
891 #define TREE_DEPRECATED(NODE) \
892 ((NODE)->base.deprecated_flag)
894 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
895 uses are to be substituted for uses of the TREE_CHAINed identifier. */
896 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
897 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
899 /* In fixed-point types, means a saturating type. */
900 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
902 /* These flags are available for each language front end to use internally. */
903 #define TREE_LANG_FLAG_0(NODE) \
904 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
905 #define TREE_LANG_FLAG_1(NODE) \
906 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
907 #define TREE_LANG_FLAG_2(NODE) \
908 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
909 #define TREE_LANG_FLAG_3(NODE) \
910 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
911 #define TREE_LANG_FLAG_4(NODE) \
912 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
913 #define TREE_LANG_FLAG_5(NODE) \
914 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
915 #define TREE_LANG_FLAG_6(NODE) \
916 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
918 /* Define additional fields and accessors for nodes representing constants. */
920 #define TREE_INT_CST_NUNITS(NODE) \
921 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
922 #define TREE_INT_CST_EXT_NUNITS(NODE) \
923 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
924 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
925 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
926 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
927 #define TREE_INT_CST_LOW(NODE) \
928 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
930 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
931 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
933 #define TREE_FIXED_CST_PTR(NODE) \
934 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
935 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
937 /* In a STRING_CST */
938 /* In C terms, this is sizeof, not strlen. */
939 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
940 #define TREE_STRING_POINTER(NODE) \
941 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
943 /* In a COMPLEX_CST node. */
944 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
945 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
947 /* In a VECTOR_CST node. */
948 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
949 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
950 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
952 /* Define fields and accessors for some special-purpose tree nodes. */
954 #define IDENTIFIER_LENGTH(NODE) \
955 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
956 #define IDENTIFIER_POINTER(NODE) \
957 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
958 #define IDENTIFIER_HASH_VALUE(NODE) \
959 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
961 /* Translate a hash table identifier pointer to a tree_identifier
962 pointer, and vice versa. */
964 #define HT_IDENT_TO_GCC_IDENT(NODE) \
965 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
966 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
968 /* In a TREE_LIST node. */
969 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
970 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
972 /* In a TREE_VEC node. */
973 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
974 #define TREE_VEC_END(NODE) \
975 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
977 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
979 /* In a CONSTRUCTOR node. */
980 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
981 #define CONSTRUCTOR_ELT(NODE,IDX) \
982 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
983 #define CONSTRUCTOR_NELTS(NODE) \
984 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
985 #define CONSTRUCTOR_NO_CLEARING(NODE) \
986 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
988 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
989 value of each element (stored within VAL). IX must be a scratch variable
990 of unsigned integer type. */
991 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
992 for (IX = 0; (IX >= vec_safe_length (V)) \
994 : ((VAL = (*(V))[IX].value), \
998 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
999 the value of each element (stored within VAL) and its index (stored
1000 within INDEX). IX must be a scratch variable of unsigned integer type. */
1001 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1002 for (IX = 0; (IX >= vec_safe_length (V)) \
1004 : (((void) (VAL = (*V)[IX].value)), \
1005 (INDEX = (*V)[IX].index), \
1009 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1010 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1012 constructor_elt _ce___ = {INDEX, VALUE}; \
1013 vec_safe_push ((V), _ce___); \
1016 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1017 constructor output purposes. */
1018 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1019 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1021 /* True if NODE is a clobber right hand side, an expression of indeterminate
1022 value that clobbers the LHS in a copy instruction. We use a volatile
1023 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1024 In particular the volatile flag causes us to not prematurely remove
1025 such clobber instructions. */
1026 #define TREE_CLOBBER_P(NODE) \
1027 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1029 /* Define fields and accessors for some nodes that represent expressions. */
1031 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1032 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1033 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1034 && integer_zerop (TREE_OPERAND (NODE, 0)))
1036 /* In ordinary expression nodes. */
1037 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1038 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1040 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1041 length. Its value includes the length operand itself; that is,
1042 the minimum valid length is 1.
1043 Note that we have to bypass the use of TREE_OPERAND to access
1044 that field to avoid infinite recursion in expanding the macros. */
1045 #define VL_EXP_OPERAND_LENGTH(NODE) \
1046 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1048 /* Nonzero if is_gimple_debug() may possibly hold. */
1049 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1051 /* In a LOOP_EXPR node. */
1052 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1054 /* The source location of this expression. Non-tree_exp nodes such as
1055 decls and constants can be shared among multiple locations, so
1057 #define EXPR_LOCATION(NODE) \
1058 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1059 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1060 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1061 != UNKNOWN_LOCATION)
1062 /* The location to be used in a diagnostic about this expression. Do not
1063 use this macro if the location will be assigned to other expressions. */
1064 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1065 ? (NODE)->exp.locus : (LOCUS))
1066 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1067 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1069 /* True if a tree is an expression or statement that can have a
1071 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1073 extern void protected_set_expr_location (tree
, location_t
);
1075 /* In a TARGET_EXPR node. */
1076 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1077 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1078 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1080 /* DECL_EXPR accessor. This gives access to the DECL associated with
1081 the given declaration statement. */
1082 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1084 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1086 /* COMPOUND_LITERAL_EXPR accessors. */
1087 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1088 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1089 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1090 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1092 /* SWITCH_EXPR accessors. These give access to the condition, body and
1093 original condition type (before any compiler conversions)
1094 of the switch statement, respectively. */
1095 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1096 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1097 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1099 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1100 of a case label, respectively. */
1101 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1102 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1103 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1104 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1106 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1107 corresponding MEM_REF operands. */
1108 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1109 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1110 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1111 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1112 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1114 #define MR_DEPENDENCE_CLIQUE(NODE) \
1115 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1116 #define MR_DEPENDENCE_BASE(NODE) \
1117 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1119 /* The operands of a BIND_EXPR. */
1120 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1121 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1122 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1124 /* GOTO_EXPR accessor. This gives access to the label associated with
1125 a goto statement. */
1126 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1128 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1129 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1130 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1132 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1133 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1134 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1135 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1136 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1137 /* Nonzero if we want to create an ASM_INPUT instead of an
1138 ASM_OPERAND with no operands. */
1139 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1140 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1142 /* COND_EXPR accessors. */
1143 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1144 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1145 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1147 /* Accessors for the chains of recurrences. */
1148 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1149 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1150 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1151 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1153 /* LABEL_EXPR accessor. This gives access to the label associated with
1154 the given label expression. */
1155 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1157 /* CATCH_EXPR accessors. */
1158 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1159 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1161 /* EH_FILTER_EXPR accessors. */
1162 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1163 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1165 /* OBJ_TYPE_REF accessors. */
1166 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1167 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1168 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1170 /* ASSERT_EXPR accessors. */
1171 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1172 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1174 /* CALL_EXPR accessors. */
1175 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1176 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1177 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1178 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1179 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1181 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1182 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1183 the argument count is zero when checking is enabled. Instead, do
1184 the pointer arithmetic to advance past the 3 fixed operands in a
1185 CALL_EXPR. That produces a valid pointer to just past the end of the
1186 operand array, even if it's not valid to dereference it. */
1187 #define CALL_EXPR_ARGP(NODE) \
1188 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1190 /* TM directives and accessors. */
1191 #define TRANSACTION_EXPR_BODY(NODE) \
1192 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1193 #define TRANSACTION_EXPR_OUTER(NODE) \
1194 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1195 #define TRANSACTION_EXPR_RELAXED(NODE) \
1196 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1198 /* OpenMP and OpenACC directive and clause accessors. */
1200 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1202 #define OMP_BODY(NODE) \
1203 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_CRITICAL), 0)
1204 #define OMP_CLAUSES(NODE) \
1205 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1207 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1208 #define OMP_STANDALONE_CLAUSES(NODE) \
1209 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_UPDATE), 0)
1211 #define OACC_PARALLEL_BODY(NODE) \
1212 TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 0)
1213 #define OACC_PARALLEL_CLAUSES(NODE) \
1214 TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 1)
1216 #define OACC_KERNELS_BODY(NODE) \
1217 TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 0)
1218 #define OACC_KERNELS_CLAUSES(NODE) \
1219 TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 1)
1221 #define OACC_DATA_BODY(NODE) \
1222 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1223 #define OACC_DATA_CLAUSES(NODE) \
1224 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1226 #define OACC_HOST_DATA_BODY(NODE) \
1227 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1228 #define OACC_HOST_DATA_CLAUSES(NODE) \
1229 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1231 #define OACC_CACHE_CLAUSES(NODE) \
1232 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1234 #define OACC_DECLARE_CLAUSES(NODE) \
1235 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1237 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1238 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1240 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1241 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1243 #define OACC_UPDATE_CLAUSES(NODE) \
1244 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1246 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1247 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1249 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1250 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1252 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1253 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1254 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1256 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1257 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1258 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1259 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1260 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1261 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1262 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1264 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1265 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1267 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1269 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1270 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1272 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1274 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1276 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1278 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1279 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1281 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1282 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1284 #define OMP_TARGET_DATA_BODY(NODE) \
1285 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1286 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1287 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1289 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1290 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1292 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1293 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1295 #define OMP_CLAUSE_SIZE(NODE) \
1296 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1298 OMP_CLAUSE__CACHE_), 1)
1300 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1301 #define OMP_CLAUSE_DECL(NODE) \
1302 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1303 OMP_CLAUSE_PRIVATE, \
1304 OMP_CLAUSE__LOOPTEMP_), 0)
1305 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1306 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1307 != UNKNOWN_LOCATION)
1308 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1310 /* True on an OMP_SECTION statement that was the last lexical member.
1311 This status is meaningful in the implementation of lastprivate. */
1312 #define OMP_SECTION_LAST(NODE) \
1313 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1315 /* True on an OACC_KERNELS statement if is represents combined kernels loop
1317 #define OACC_KERNELS_COMBINED(NODE) \
1318 (OACC_KERNELS_CHECK (NODE)->base.private_flag)
1320 /* Like OACC_KERNELS_COMBINED, but for parallel loop directive. */
1321 #define OACC_PARALLEL_COMBINED(NODE) \
1322 (OACC_PARALLEL_CHECK (NODE)->base.private_flag)
1324 /* True on an OMP_PARALLEL statement if it represents an explicit
1325 combined parallel work-sharing constructs. */
1326 #define OMP_PARALLEL_COMBINED(NODE) \
1327 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1329 /* True on an OMP_TEAMS statement if it represents an explicit
1330 combined teams distribute constructs. */
1331 #define OMP_TEAMS_COMBINED(NODE) \
1332 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1334 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1335 as opposed to relaxed. */
1336 #define OMP_ATOMIC_SEQ_CST(NODE) \
1337 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1338 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1340 /* True on a PRIVATE clause if its decl is kept around for debugging
1341 information only and its DECL_VALUE_EXPR is supposed to point
1342 to what it has been remapped to. */
1343 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1344 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1346 /* True on a PRIVATE clause if ctor needs access to outer region's
1348 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1349 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1351 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1352 decl is present in the chain. */
1353 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1354 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1355 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1356 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1357 OMP_CLAUSE_LASTPRIVATE),\
1359 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1360 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1362 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1363 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1364 #define OMP_CLAUSE_IF_EXPR(NODE) \
1365 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1366 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1367 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1368 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1369 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1371 /* OpenACC clause expressions */
1372 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1373 OMP_CLAUSE_OPERAND ( \
1374 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1375 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1376 OMP_CLAUSE_OPERAND ( \
1377 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1378 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1379 OMP_CLAUSE_OPERAND ( \
1380 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1381 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1382 OMP_CLAUSE_OPERAND ( \
1383 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1384 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1385 OMP_CLAUSE_OPERAND ( \
1386 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1387 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1388 OMP_CLAUSE_OPERAND ( \
1389 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1390 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1391 OMP_CLAUSE_OPERAND ( \
1392 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1393 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1394 OMP_CLAUSE_OPERAND ( \
1395 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1396 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1397 OMP_CLAUSE_OPERAND ( \
1398 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1400 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1401 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1403 #define OMP_CLAUSE_MAP_KIND(NODE) \
1404 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1405 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1406 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1407 = (unsigned char) (MAP_KIND))
1409 /* Nonzero if this map clause is for array (rather than pointer) based array
1410 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1411 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1412 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1413 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1415 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1416 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1418 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1419 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1420 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1421 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1422 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1423 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1425 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1426 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1427 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1428 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1429 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1430 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1431 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1432 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1433 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1434 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1435 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1436 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1438 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1439 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1440 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1441 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1443 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1444 are always initialized inside of the loop construct, false otherwise. */
1445 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1446 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1448 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1449 are declared inside of the simd construct. */
1450 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1451 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1453 /* True if a LINEAR clause has a stride that is variable. */
1454 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1455 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1457 /* True if a LINEAR clause is for an array or allocatable variable that
1458 needs special handling by the frontend. */
1459 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1460 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1462 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1463 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1465 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1466 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1468 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1469 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1471 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1472 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1474 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1475 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1477 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1478 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1479 OMP_CLAUSE_THREAD_LIMIT), 0)
1481 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1482 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1484 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1485 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1486 OMP_CLAUSE_DIST_SCHEDULE), 0)
1488 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1489 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1491 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1492 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1494 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1495 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1497 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1498 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1500 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1501 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1503 /* SSA_NAME accessors. */
1505 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1506 if there is no name associated with it. */
1507 #define SSA_NAME_IDENTIFIER(NODE) \
1508 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1509 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1510 ? (NODE)->ssa_name.var \
1511 : DECL_NAME ((NODE)->ssa_name.var)) \
1514 /* Returns the variable being referenced. This can be NULL_TREE for
1515 temporaries not associated with any user variable.
1516 Once released, this is the only field that can be relied upon. */
1517 #define SSA_NAME_VAR(NODE) \
1518 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1519 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1520 ? NULL_TREE : (NODE)->ssa_name.var)
1522 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1523 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1525 /* Returns the statement which defines this SSA name. */
1526 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1528 /* Returns the SSA version number of this SSA name. Note that in
1529 tree SSA, version numbers are not per variable and may be recycled. */
1530 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1532 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1533 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1535 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1536 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1538 /* Nonzero if this SSA_NAME expression is currently on the free list of
1539 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1540 has no meaning for an SSA_NAME. */
1541 #define SSA_NAME_IN_FREE_LIST(NODE) \
1542 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1544 /* Nonzero if this SSA_NAME is the default definition for the
1545 underlying symbol. A default SSA name is created for symbol S if
1546 the very first reference to S in the function is a read operation.
1547 Default definitions are always created by an empty statement and
1548 belong to no basic block. */
1549 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1550 SSA_NAME_CHECK (NODE)->base.default_def_flag
1552 /* Attributes for SSA_NAMEs for pointer-type variables. */
1553 #define SSA_NAME_PTR_INFO(N) \
1554 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1556 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1557 #define SSA_NAME_ANTI_RANGE_P(N) \
1558 SSA_NAME_CHECK (N)->base.static_flag
1560 /* The type of range described by SSA_NAME_RANGE_INFO. */
1561 #define SSA_NAME_RANGE_TYPE(N) \
1562 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1564 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1565 #define SSA_NAME_RANGE_INFO(N) \
1566 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1568 /* Return the immediate_use information for an SSA_NAME. */
1569 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1571 #define OMP_CLAUSE_CODE(NODE) \
1572 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1574 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1575 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1577 #define OMP_CLAUSE_OPERAND(NODE, I) \
1578 OMP_CLAUSE_ELT_CHECK (NODE, I)
1580 /* In a BLOCK node. */
1581 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1582 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1583 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1584 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1585 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1586 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1587 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1588 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1589 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1590 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1591 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1592 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1594 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1595 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1597 /* An index number for this block. These values are not guaranteed to
1598 be unique across functions -- whether or not they are depends on
1599 the debugging output format in use. */
1600 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1602 /* If block reordering splits a lexical block into discontiguous
1603 address ranges, we'll make a copy of the original block.
1605 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1606 In that case, we have one source block that has been replicated
1607 (through inlining or unrolling) into many logical blocks, and that
1608 these logical blocks have different physical variables in them.
1610 In this case, we have one logical block split into several
1611 non-contiguous address ranges. Most debug formats can't actually
1612 represent this idea directly, so we fake it by creating multiple
1613 logical blocks with the same variables in them. However, for those
1614 that do support non-contiguous regions, these allow the original
1615 logical block to be reconstructed, along with the set of address
1618 One of the logical block fragments is arbitrarily chosen to be
1619 the ORIGIN. The other fragments will point to the origin via
1620 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1621 be null. The list of fragments will be chained through
1622 BLOCK_FRAGMENT_CHAIN from the origin. */
1624 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1625 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1627 /* For an inlined function, this gives the location where it was called
1628 from. This is only set in the top level block, which corresponds to the
1629 inlined function scope. This is used in the debug output routines. */
1631 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1633 /* This gives the location of the end of the block, useful to attach
1634 code implicitly generated for outgoing paths. */
1636 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1638 /* Define fields and accessors for nodes representing data types. */
1640 /* See tree.def for documentation of the use of these fields.
1641 Look at the documentation of the various ..._TYPE tree codes.
1643 Note that the type.values, type.minval, and type.maxval fields are
1644 overloaded and used for different macros in different kinds of types.
1645 Each macro must check to ensure the tree node is of the proper kind of
1646 type. Note also that some of the front-ends also overload these fields,
1647 so they must be checked as well. */
1649 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1650 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1651 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1652 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1653 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1654 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1655 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1656 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1657 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1658 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1660 #define TYPE_MODE(NODE) \
1661 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1662 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1663 #define SET_TYPE_MODE(NODE, MODE) \
1664 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1666 extern machine_mode
element_mode (const_tree t
);
1668 /* The "canonical" type for this type node, which is used by frontends to
1669 compare the type for equality with another type. If two types are
1670 equal (based on the semantics of the language), then they will have
1671 equivalent TYPE_CANONICAL entries.
1673 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1674 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1675 be used for comparison against other types. Instead, the type is
1676 said to require structural equality checks, described in
1677 TYPE_STRUCTURAL_EQUALITY_P.
1679 For unqualified aggregate and function types the middle-end relies on
1680 TYPE_CANONICAL to tell whether two variables can be assigned
1681 to each other without a conversion. The middle-end also makes sure
1682 to assign the same alias-sets to the type partition with equal
1683 TYPE_CANONICAL of their unqualified variants. */
1684 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1685 /* Indicates that the type node requires structural equality
1686 checks. The compiler will need to look at the composition of the
1687 type to determine whether it is equal to another type, rather than
1688 just comparing canonical type pointers. For instance, we would need
1689 to look at the return and parameter types of a FUNCTION_TYPE
1691 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1692 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1693 type node requires structural equality. */
1694 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1696 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1697 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1699 /* The (language-specific) typed-based alias set for this type.
1700 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1701 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1702 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1703 type can alias objects of any type. */
1704 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1706 /* Nonzero iff the typed-based alias set for this type has been
1708 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1709 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1711 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1713 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1715 /* The alignment necessary for objects of this type.
1716 The value is an int, measured in bits. */
1717 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1719 /* 1 if the alignment for this type was requested by "aligned" attribute,
1720 0 if it is the default for this type. */
1721 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1723 /* The alignment for NODE, in bytes. */
1724 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1726 /* If your language allows you to declare types, and you want debug info
1727 for them, then you need to generate corresponding TYPE_DECL nodes.
1728 These "stub" TYPE_DECL nodes have no name, and simply point at the
1729 type node. You then set the TYPE_STUB_DECL field of the type node
1730 to point back at the TYPE_DECL node. This allows the debug routines
1731 to know that the two nodes represent the same type, so that we only
1732 get one debug info record for them. */
1733 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1735 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1736 the type has BLKmode only because it lacks the alignment required for
1738 #define TYPE_NO_FORCE_BLK(NODE) \
1739 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1741 /* Nonzero in a type considered volatile as a whole. */
1742 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1744 /* Nonzero in a type considered atomic as a whole. */
1745 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1747 /* Means this type is const-qualified. */
1748 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1750 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1752 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1754 /* If nonzero, type's name shouldn't be emitted into debug info. */
1755 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1757 /* The address space the type is in. */
1758 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1760 /* Encode/decode the named memory support as part of the qualifier. If more
1761 than 8 qualifiers are added, these macros need to be adjusted. */
1762 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1763 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1765 /* Return all qualifiers except for the address space qualifiers. */
1766 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1768 /* Only keep the address space out of the qualifiers and discard the other
1770 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1772 /* The set of type qualifiers for this type. */
1773 #define TYPE_QUALS(NODE) \
1774 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1775 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1776 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1777 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1778 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1780 /* The same as TYPE_QUALS without the address space qualifications. */
1781 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1782 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1783 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1784 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1785 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1787 /* The same as TYPE_QUALS without the address space and atomic
1789 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1790 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1791 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1792 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1794 /* These flags are available for each language front end to use internally. */
1795 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1796 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1797 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1798 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1799 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1800 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1801 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1803 /* Used to keep track of visited nodes in tree traversals. This is set to
1804 0 by copy_node and make_node. */
1805 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1807 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1808 that distinguish string from array of char).
1809 If set in a INTEGER_TYPE, indicates a character type. */
1810 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1812 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1813 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1814 (((unsigned HOST_WIDE_INT) 1) \
1815 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1817 /* Set precision to n when we have 2^n sub-parts of the vector. */
1818 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1819 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1821 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1822 about missing conversions to other vector types of the same size. */
1823 #define TYPE_VECTOR_OPAQUE(NODE) \
1824 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1826 /* Indicates that objects of this type must be initialized by calling a
1827 function when they are created. */
1828 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1829 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1831 /* Indicates that a UNION_TYPE object should be passed the same way that
1832 the first union alternative would be passed, or that a RECORD_TYPE
1833 object should be passed the same way that the first (and only) member
1835 #define TYPE_TRANSPARENT_AGGR(NODE) \
1836 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1838 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1839 address of a component of the type. This is the counterpart of
1840 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1841 #define TYPE_NONALIASED_COMPONENT(NODE) \
1842 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1844 /* Indicated that objects of this type should be laid out in as
1845 compact a way as possible. */
1846 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1848 /* Used by type_contains_placeholder_p to avoid recomputation.
1849 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1850 this field directly. */
1851 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1852 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1854 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1855 #define TYPE_FINAL_P(NODE) \
1856 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1858 /* The debug output functions use the symtab union field to store
1859 information specific to the debugging format. The different debug
1860 output hooks store different types in the union field. These three
1861 macros are used to access different fields in the union. The debug
1862 hooks are responsible for consistently using only a specific
1865 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1866 hold the type's number in the generated stabs. */
1867 #define TYPE_SYMTAB_ADDRESS(NODE) \
1868 (TYPE_CHECK (NODE)->type_common.symtab.address)
1870 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1871 hold struct/union type tag names. */
1872 #define TYPE_SYMTAB_POINTER(NODE) \
1873 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1875 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1876 in dwarf2out.c to point to the DIE generated for the type. */
1877 #define TYPE_SYMTAB_DIE(NODE) \
1878 (TYPE_CHECK (NODE)->type_common.symtab.die)
1880 /* The garbage collector needs to know the interpretation of the
1881 symtab field. These constants represent the different types in the
1884 #define TYPE_SYMTAB_IS_ADDRESS (0)
1885 #define TYPE_SYMTAB_IS_POINTER (1)
1886 #define TYPE_SYMTAB_IS_DIE (2)
1888 #define TYPE_LANG_SPECIFIC(NODE) \
1889 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1891 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1892 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1893 #define TYPE_FIELDS(NODE) \
1894 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1895 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1896 #define TYPE_ARG_TYPES(NODE) \
1897 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1898 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1900 #define TYPE_METHODS(NODE) \
1901 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1902 #define TYPE_VFIELD(NODE) \
1903 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1904 #define TYPE_METHOD_BASETYPE(NODE) \
1905 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1906 #define TYPE_OFFSET_BASETYPE(NODE) \
1907 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1908 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1909 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1910 #define TYPE_NEXT_PTR_TO(NODE) \
1911 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1912 #define TYPE_NEXT_REF_TO(NODE) \
1913 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1914 #define TYPE_MIN_VALUE(NODE) \
1915 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1916 #define TYPE_MAX_VALUE(NODE) \
1917 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1919 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1920 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1922 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1923 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1925 /* For record and union types, information about this type, as a base type
1927 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1929 /* For non record and union types, used in a language-dependent way. */
1930 #define TYPE_LANG_SLOT_1(NODE) \
1931 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1933 /* Define accessor macros for information about type inheritance
1936 A "basetype" means a particular usage of a data type for inheritance
1937 in another type. Each such basetype usage has its own "binfo"
1938 object to describe it. The binfo object is a TREE_VEC node.
1940 Inheritance is represented by the binfo nodes allocated for a
1941 given type. For example, given types C and D, such that D is
1942 inherited by C, 3 binfo nodes will be allocated: one for describing
1943 the binfo properties of C, similarly one for D, and one for
1944 describing the binfo properties of D as a base type for C.
1945 Thus, given a pointer to class C, one can get a pointer to the binfo
1946 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1948 /* BINFO specific flags. */
1950 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1951 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1953 /* Flags for language dependent use. */
1954 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1955 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1956 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1957 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1958 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1959 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1960 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1962 /* The actual data type node being inherited in this basetype. */
1963 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1965 /* The offset where this basetype appears in its containing type.
1966 BINFO_OFFSET slot holds the offset (in bytes)
1967 from the base of the complete object to the base of the part of the
1968 object that is allocated on behalf of this `type'.
1969 This is always 0 except when there is multiple inheritance. */
1971 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1972 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1974 /* The virtual function table belonging to this basetype. Virtual
1975 function tables provide a mechanism for run-time method dispatching.
1976 The entries of a virtual function table are language-dependent. */
1978 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1980 /* The virtual functions in the virtual function table. This is
1981 a TREE_LIST that is used as an initial approximation for building
1982 a virtual function table for this basetype. */
1983 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1985 /* A vector of binfos for the direct basetypes inherited by this
1988 If this basetype describes type D as inherited in C, and if the
1989 basetypes of D are E and F, then this vector contains binfos for
1990 inheritance of E and F by C. */
1991 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1993 /* The number of basetypes for NODE. */
1994 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1996 /* Accessor macro to get to the Nth base binfo of this binfo. */
1997 #define BINFO_BASE_BINFO(NODE,N) \
1998 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1999 #define BINFO_BASE_ITERATE(NODE,N,B) \
2000 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2001 #define BINFO_BASE_APPEND(NODE,T) \
2002 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2004 /* For a BINFO record describing a virtual base class, i.e., one where
2005 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2006 base. The actual contents are language-dependent. In the C++
2007 front-end this field is an INTEGER_CST giving an offset into the
2008 vtable where the offset to the virtual base can be found. */
2009 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2011 /* Indicates the accesses this binfo has to its bases. The values are
2012 access_public_node, access_protected_node or access_private_node.
2013 If this array is not present, public access is implied. */
2014 #define BINFO_BASE_ACCESSES(NODE) \
2015 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2017 #define BINFO_BASE_ACCESS(NODE,N) \
2018 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2019 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2020 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2022 /* The index in the VTT where this subobject's sub-VTT can be found.
2023 NULL_TREE if there is no sub-VTT. */
2024 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2026 /* The index in the VTT where the vptr for this subobject can be
2027 found. NULL_TREE if there is no secondary vptr in the VTT. */
2028 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2030 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2031 inheriting this base for non-virtual bases. For virtual bases it
2032 points either to the binfo for which this is a primary binfo, or to
2033 the binfo of the most derived type. */
2034 #define BINFO_INHERITANCE_CHAIN(NODE) \
2035 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2038 /* Define fields and accessors for nodes representing declared names. */
2040 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2041 have an associated SSA name. */
2042 #define SSA_VAR_P(DECL) \
2043 (TREE_CODE (DECL) == VAR_DECL \
2044 || TREE_CODE (DECL) == PARM_DECL \
2045 || TREE_CODE (DECL) == RESULT_DECL \
2046 || TREE_CODE (DECL) == SSA_NAME)
2049 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2051 /* This is the name of the object as written by the user.
2052 It is an IDENTIFIER_NODE. */
2053 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2055 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2056 #define TYPE_IDENTIFIER(NODE) \
2057 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2058 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2060 /* Every ..._DECL node gets a unique number. */
2061 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2063 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2065 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2067 /* Every ..._DECL node gets a unique number that stays the same even
2068 when the decl is copied by the inliner once it is set. */
2069 #define DECL_PT_UID(NODE) \
2070 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2071 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2072 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2073 #define SET_DECL_PT_UID(NODE, UID) \
2074 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2075 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2076 be preserved when copyin the decl. */
2077 #define DECL_PT_UID_SET_P(NODE) \
2078 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2080 /* These two fields describe where in the source code the declaration
2081 was. If the declaration appears in several places (as for a C
2082 function that is declared first and then defined later), this
2083 information should refer to the definition. */
2084 #define DECL_SOURCE_LOCATION(NODE) \
2085 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2086 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2087 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2088 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2089 /* This accessor returns TRUE if the decl it operates on was created
2090 by a front-end or back-end rather than by user code. In this case
2091 builtin-ness is indicated by source location. */
2092 #define DECL_IS_BUILTIN(DECL) \
2093 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2095 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2096 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2097 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2098 nodes, this points to either the FUNCTION_DECL for the containing
2099 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2100 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2101 scope". In particular, for VAR_DECLs which are virtual table pointers
2102 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2104 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2105 #define DECL_FIELD_CONTEXT(NODE) \
2106 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2108 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2109 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2111 /* For any sort of a ..._DECL node, this points to the original (abstract)
2112 decl node which this decl is an inlined/cloned instance of, or else it
2113 is NULL indicating that this decl is not an instance of some other decl.
2115 The C front-end also uses this in a nested declaration of an inline
2116 function, to point back to the definition. */
2117 #define DECL_ABSTRACT_ORIGIN(NODE) \
2118 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2120 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2121 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2122 #define DECL_ORIGIN(NODE) \
2123 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2125 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2126 inline instance of some original (abstract) decl from an inline function;
2127 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2128 nodes can also have their abstract origin set to themselves. */
2129 #define DECL_FROM_INLINE(NODE) \
2130 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2131 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2133 /* In a DECL this is the field where attributes are stored. */
2134 #define DECL_ATTRIBUTES(NODE) \
2135 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2137 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2138 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2139 For a VAR_DECL, holds the initial value.
2140 For a PARM_DECL, used for DECL_ARG_TYPE--default
2141 values for parameters are encoded in the type of the function,
2142 not in the PARM_DECL slot.
2143 For a FIELD_DECL, this is used for enumeration values and the C
2144 frontend uses it for temporarily storing bitwidth of bitfields.
2146 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2147 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2149 /* Holds the size of the datum, in bits, as a tree expression.
2150 Need not be constant. */
2151 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2152 /* Likewise for the size in bytes. */
2153 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2154 /* Holds the alignment required for the datum, in bits. */
2155 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2156 /* The alignment of NODE, in bytes. */
2157 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2158 /* Set if the alignment of this DECL has been set by the user, for
2159 example with an 'aligned' attribute. */
2160 #define DECL_USER_ALIGN(NODE) \
2161 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2162 /* Holds the machine mode corresponding to the declaration of a variable or
2163 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2165 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2167 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2168 operation it is. Note, however, that this field is overloaded, with
2169 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2170 checked before any access to the former. */
2171 #define DECL_FUNCTION_CODE(NODE) \
2172 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2174 #define DECL_FUNCTION_PERSONALITY(NODE) \
2175 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2177 /* Nonzero for a given ..._DECL node means that the name of this node should
2178 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2179 the associated type should be ignored. For a FUNCTION_DECL, the body of
2180 the function should also be ignored. */
2181 #define DECL_IGNORED_P(NODE) \
2182 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2184 /* Nonzero for a given ..._DECL node means that this node represents an
2185 "abstract instance" of the given declaration (e.g. in the original
2186 declaration of an inline function). When generating symbolic debugging
2187 information, we mustn't try to generate any address information for nodes
2188 marked as "abstract instances" because we don't actually generate
2189 any code or allocate any data space for such instances. */
2190 #define DECL_ABSTRACT_P(NODE) \
2191 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2193 /* Language-specific decl information. */
2194 #define DECL_LANG_SPECIFIC(NODE) \
2195 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2197 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2198 do not allocate storage, and refer to a definition elsewhere. Note that
2199 this does not necessarily imply the entity represented by NODE
2200 has no program source-level definition in this translation unit. For
2201 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2202 DECL_EXTERNAL may be true simultaneously; that can be the case for
2203 a C99 "extern inline" function. */
2204 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2206 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2207 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2209 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2211 Also set in some languages for variables, etc., outside the normal
2212 lexical scope, such as class instance variables. */
2213 #define DECL_NONLOCAL(NODE) \
2214 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2216 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2217 Used in FIELD_DECLs for vtable pointers.
2218 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2219 #define DECL_VIRTUAL_P(NODE) \
2220 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2222 /* Used to indicate that this DECL represents a compiler-generated entity. */
2223 #define DECL_ARTIFICIAL(NODE) \
2224 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2226 /* Additional flags for language-specific uses. */
2227 #define DECL_LANG_FLAG_0(NODE) \
2228 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2229 #define DECL_LANG_FLAG_1(NODE) \
2230 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2231 #define DECL_LANG_FLAG_2(NODE) \
2232 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2233 #define DECL_LANG_FLAG_3(NODE) \
2234 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2235 #define DECL_LANG_FLAG_4(NODE) \
2236 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2237 #define DECL_LANG_FLAG_5(NODE) \
2238 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2239 #define DECL_LANG_FLAG_6(NODE) \
2240 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2241 #define DECL_LANG_FLAG_7(NODE) \
2242 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2243 #define DECL_LANG_FLAG_8(NODE) \
2244 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2246 /* Nonzero for a scope which is equal to file scope. */
2247 #define SCOPE_FILE_SCOPE_P(EXP) \
2248 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2249 /* Nonzero for a decl which is at file scope. */
2250 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2251 /* Nonzero for a type which is at file scope. */
2252 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2254 /* Nonzero for a decl that is decorated using attribute used.
2255 This indicates to compiler tools that this decl needs to be preserved. */
2256 #define DECL_PRESERVE_P(DECL) \
2257 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2259 /* For function local variables of COMPLEX and VECTOR types,
2260 indicates that the variable is not aliased, and that all
2261 modifications to the variable have been adjusted so that
2262 they are killing assignments. Thus the variable may now
2263 be treated as a GIMPLE register, and use real instead of
2264 virtual ops in SSA form. */
2265 #define DECL_GIMPLE_REG_P(DECL) \
2266 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2268 extern tree
decl_value_expr_lookup (tree
);
2269 extern void decl_value_expr_insert (tree
, tree
);
2271 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2272 if transformations have made this more complicated than evaluating the
2273 decl itself. This should only be used for debugging; once this field has
2274 been set, the decl itself may not legitimately appear in the function. */
2275 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2276 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2277 ->decl_common.decl_flag_2)
2278 #define DECL_VALUE_EXPR(NODE) \
2279 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2280 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2281 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2283 /* Holds the RTL expression for the value of a variable or function.
2284 This value can be evaluated lazily for functions, variables with
2285 static storage duration, and labels. */
2286 #define DECL_RTL(NODE) \
2287 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2288 ? (NODE)->decl_with_rtl.rtl \
2289 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2291 /* Set the DECL_RTL for NODE to RTL. */
2292 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2294 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2295 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2297 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2298 #define DECL_RTL_SET_P(NODE) \
2299 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2301 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2302 NODE1, it will not be set for NODE2; this is a lazy copy. */
2303 #define COPY_DECL_RTL(NODE1, NODE2) \
2304 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2305 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2307 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2308 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2310 #if (GCC_VERSION >= 2007)
2311 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2312 ({ tree const __d = (decl); \
2313 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2314 /* Dereference it so the compiler knows it can't be NULL even \
2315 without assertion checking. */ \
2316 &*DECL_RTL_IF_SET (__d); })
2318 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2321 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2322 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2324 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2325 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2326 of the structure. */
2327 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2329 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2330 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2331 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2332 natural alignment of the field's type). */
2333 #define DECL_FIELD_BIT_OFFSET(NODE) \
2334 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2336 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2337 if so, the type that was originally specified for it.
2338 TREE_TYPE may have been modified (in finish_struct). */
2339 #define DECL_BIT_FIELD_TYPE(NODE) \
2340 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2342 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2343 representative FIELD_DECL. */
2344 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2345 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2347 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2348 if nonzero, indicates that the field occupies the type. */
2349 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2351 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2352 DECL_FIELD_OFFSET which are known to be always zero.
2353 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2355 #define DECL_OFFSET_ALIGN(NODE) \
2356 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2358 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2359 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2360 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2362 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2363 which this FIELD_DECL is defined. This information is needed when
2364 writing debugging information about vfield and vbase decls for C++. */
2365 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2367 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2368 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2370 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2372 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2374 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2375 this component. This makes it possible for Type-Based Alias Analysis
2376 to disambiguate accesses to this field with indirect accesses using
2379 struct S { int i; } s;
2382 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2384 From the implementation's viewpoint, the alias set of the type of the
2385 field 'i' (int) will not be recorded as a subset of that of the type of
2386 's' (struct S) in record_component_aliases. The counterpart is that
2387 accesses to s.i must not be given the alias set of the type of 'i'
2388 (int) but instead directly that of the type of 's' (struct S). */
2389 #define DECL_NONADDRESSABLE_P(NODE) \
2390 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2392 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2393 dense, unique within any one function, and may be used to index arrays.
2394 If the value is -1, then no UID has been assigned. */
2395 #define LABEL_DECL_UID(NODE) \
2396 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2398 /* In a LABEL_DECL, the EH region number for which the label is the
2399 post_landing_pad. */
2400 #define EH_LANDING_PAD_NR(NODE) \
2401 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2403 /* For a PARM_DECL, records the data type used to pass the argument,
2404 which may be different from the type seen in the program. */
2405 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2407 /* For PARM_DECL, holds an RTL for the stack slot or register
2408 where the data was actually passed. */
2409 #define DECL_INCOMING_RTL(NODE) \
2410 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2412 /* Nonzero for a given ..._DECL node means that no warnings should be
2413 generated just because this node is unused. */
2414 #define DECL_IN_SYSTEM_HEADER(NODE) \
2415 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2417 /* Used to indicate that the linkage status of this DECL is not yet known,
2418 so it should not be output now. */
2419 #define DECL_DEFER_OUTPUT(NODE) \
2420 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2422 /* In a VAR_DECL that's static,
2423 nonzero if the space is in the text section. */
2424 #define DECL_IN_TEXT_SECTION(NODE) \
2425 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2427 /* In a VAR_DECL that's static,
2428 nonzero if it belongs to the global constant pool. */
2429 #define DECL_IN_CONSTANT_POOL(NODE) \
2430 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2432 /* Nonzero for a given ..._DECL node means that this node should be
2433 put in .common, if possible. If a DECL_INITIAL is given, and it
2434 is not error_mark_node, then the decl cannot be put in .common. */
2435 #define DECL_COMMON(NODE) \
2436 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2438 /* In a VAR_DECL, nonzero if the decl is a register variable with
2439 an explicit asm specification. */
2440 #define DECL_HARD_REGISTER(NODE) \
2441 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2443 /* Used to indicate that this DECL has weak linkage. */
2444 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2446 /* Used to indicate that the DECL is a dllimport. */
2447 #define DECL_DLLIMPORT_P(NODE) \
2448 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2450 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2451 not be put out unless it is needed in this translation unit.
2452 Entities like this are shared across translation units (like weak
2453 entities), but are guaranteed to be generated by any translation
2454 unit that needs them, and therefore need not be put out anywhere
2455 where they are not needed. DECL_COMDAT is just a hint to the
2456 back-end; it is up to front-ends which set this flag to ensure
2457 that there will never be any harm, other than bloat, in putting out
2458 something which is DECL_COMDAT. */
2459 #define DECL_COMDAT(NODE) \
2460 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2462 #define DECL_COMDAT_GROUP(NODE) \
2463 decl_comdat_group (NODE)
2465 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2466 multiple translation units should be merged. */
2467 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2468 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2470 /* The name of the object as the assembler will see it (but before any
2471 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2472 as DECL_NAME. It is an IDENTIFIER_NODE.
2474 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2475 One Definition Rule based type merging at LTO. It is computed only for
2476 LTO compilation and C++. */
2477 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2479 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2480 This is true of all DECL nodes except FIELD_DECL. */
2481 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2482 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2484 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2485 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2487 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2488 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2489 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2491 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2492 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2493 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2495 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2496 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2497 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2498 semantics of using this macro, are different than saying:
2500 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2502 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2504 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2505 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2506 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2507 DECL_ASSEMBLER_NAME (DECL1)) \
2510 /* Records the section name in a section attribute. Used to pass
2511 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2512 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2514 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2515 this variable in a BIND_EXPR. */
2516 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2517 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2519 /* Value of the decls's visibility attribute */
2520 #define DECL_VISIBILITY(NODE) \
2521 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2523 /* Nonzero means that the decl had its visibility specified rather than
2525 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2526 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2528 /* In a VAR_DECL, the model to use if the data should be allocated from
2529 thread-local storage. */
2530 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2532 /* In a VAR_DECL, nonzero if the data should be allocated from
2533 thread-local storage. */
2534 #define DECL_THREAD_LOCAL_P(NODE) \
2535 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2537 /* In a non-local VAR_DECL with static storage duration, true if the
2538 variable has an initialization priority. If false, the variable
2539 will be initialized at the DEFAULT_INIT_PRIORITY. */
2540 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2541 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2543 extern tree
decl_debug_expr_lookup (tree
);
2544 extern void decl_debug_expr_insert (tree
, tree
);
2546 /* For VAR_DECL, this is set to an expression that it was split from. */
2547 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2548 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2549 #define DECL_DEBUG_EXPR(NODE) \
2550 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2552 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2553 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2555 extern priority_type
decl_init_priority_lookup (tree
);
2556 extern priority_type
decl_fini_priority_lookup (tree
);
2557 extern void decl_init_priority_insert (tree
, priority_type
);
2558 extern void decl_fini_priority_insert (tree
, priority_type
);
2560 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2562 #define DECL_INIT_PRIORITY(NODE) \
2563 (decl_init_priority_lookup (NODE))
2564 /* Set the initialization priority for NODE to VAL. */
2565 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2566 (decl_init_priority_insert (NODE, VAL))
2568 /* For a FUNCTION_DECL the finalization priority of NODE. */
2569 #define DECL_FINI_PRIORITY(NODE) \
2570 (decl_fini_priority_lookup (NODE))
2571 /* Set the finalization priority for NODE to VAL. */
2572 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2573 (decl_fini_priority_insert (NODE, VAL))
2575 /* The initialization priority for entities for which no explicit
2576 initialization priority has been specified. */
2577 #define DEFAULT_INIT_PRIORITY 65535
2579 /* The maximum allowed initialization priority. */
2580 #define MAX_INIT_PRIORITY 65535
2582 /* The largest priority value reserved for use by system runtime
2584 #define MAX_RESERVED_INIT_PRIORITY 100
2586 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2587 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2588 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2590 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2591 #define DECL_NONLOCAL_FRAME(NODE) \
2592 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2594 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2595 #define DECL_NONALIASED(NODE) \
2596 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2598 /* This field is used to reference anything in decl.result and is meant only
2599 for use by the garbage collector. */
2600 #define DECL_RESULT_FLD(NODE) \
2601 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2603 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2604 Before the struct containing the FUNCTION_DECL is laid out,
2605 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2606 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2607 function. When the class is laid out, this pointer is changed
2608 to an INTEGER_CST node which is suitable for use as an index
2609 into the virtual function table. */
2610 #define DECL_VINDEX(NODE) \
2611 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2613 /* In FUNCTION_DECL, holds the decl for the return value. */
2614 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2616 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2617 #define DECL_UNINLINABLE(NODE) \
2618 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2620 /* In a FUNCTION_DECL, the saved representation of the body of the
2622 #define DECL_SAVED_TREE(NODE) \
2623 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2625 /* Nonzero in a FUNCTION_DECL means this function should be treated
2626 as if it were a malloc, meaning it returns a pointer that is
2628 #define DECL_IS_MALLOC(NODE) \
2629 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2631 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2632 C++ operator new, meaning that it returns a pointer for which we
2633 should not use type based aliasing. */
2634 #define DECL_IS_OPERATOR_NEW(NODE) \
2635 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2637 /* Nonzero in a FUNCTION_DECL means this function may return more
2639 #define DECL_IS_RETURNS_TWICE(NODE) \
2640 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2642 /* Nonzero in a FUNCTION_DECL means this function should be treated
2643 as "pure" function (like const function, but may read global memory). */
2644 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2646 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2647 the const or pure function may not terminate. When this is nonzero
2648 for a const or pure function, it can be dealt with by cse passes
2649 but cannot be removed by dce passes since you are not allowed to
2650 change an infinite looping program into one that terminates without
2652 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2653 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2655 /* Nonzero in a FUNCTION_DECL means this function should be treated
2656 as "novops" function (function that does not read global memory,
2657 but may have arbitrary side effects). */
2658 #define DECL_IS_NOVOPS(NODE) \
2659 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2661 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2662 at the beginning or end of execution. */
2663 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2664 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2666 #define DECL_STATIC_DESTRUCTOR(NODE) \
2667 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2669 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2670 be instrumented with calls to support routines. */
2671 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2672 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2674 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2675 disabled in this function. */
2676 #define DECL_NO_LIMIT_STACK(NODE) \
2677 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2679 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2680 #define DECL_STATIC_CHAIN(NODE) \
2681 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2683 /* Nonzero for a decl that cgraph has decided should be inlined into
2684 at least one call site. It is not meaningful to look at this
2685 directly; always use cgraph_function_possibly_inlined_p. */
2686 #define DECL_POSSIBLY_INLINED(DECL) \
2687 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2689 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2690 such as via the `inline' keyword in C/C++. This flag controls the linkage
2691 semantics of 'inline' */
2692 #define DECL_DECLARED_INLINE_P(NODE) \
2693 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2695 /* Nonzero in a FUNCTION_DECL means this function should not get
2696 -Winline warnings. */
2697 #define DECL_NO_INLINE_WARNING_P(NODE) \
2698 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2700 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2701 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2702 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2704 /* Nonzero if a FUNCTION_CODE is a TM load. */
2705 #define BUILTIN_TM_LOAD_P(FN) \
2706 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2708 /* Nonzero if a FUNCTION_CODE is a TM store. */
2709 #define BUILTIN_TM_STORE_P(FN) \
2710 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2712 #define CASE_BUILT_IN_TM_LOAD(FN) \
2713 case BUILT_IN_TM_LOAD_##FN: \
2714 case BUILT_IN_TM_LOAD_RAR_##FN: \
2715 case BUILT_IN_TM_LOAD_RAW_##FN: \
2716 case BUILT_IN_TM_LOAD_RFW_##FN
2718 #define CASE_BUILT_IN_TM_STORE(FN) \
2719 case BUILT_IN_TM_STORE_##FN: \
2720 case BUILT_IN_TM_STORE_WAR_##FN: \
2721 case BUILT_IN_TM_STORE_WAW_##FN
2723 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2724 disregarding size and cost heuristics. This is equivalent to using
2725 the always_inline attribute without the required diagnostics if the
2726 function cannot be inlined. */
2727 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2728 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2730 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2731 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2733 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2734 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2735 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2737 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2738 that describes the status of this function. */
2739 #define DECL_STRUCT_FUNCTION(NODE) \
2740 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2742 /* In a FUNCTION_DECL, nonzero means a built in function of a
2743 standard library or more generally a built in function that is
2744 recognized by optimizers and expanders.
2746 Note that it is different from the DECL_IS_BUILTIN accessor. For
2747 instance, user declared prototypes of C library functions are not
2748 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2749 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2751 /* For a builtin function, identify which part of the compiler defined it. */
2752 #define DECL_BUILT_IN_CLASS(NODE) \
2753 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2755 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2756 #define DECL_ARGUMENTS(NODE) \
2757 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2759 /* In FUNCTION_DECL, the function specific target options to use when compiling
2761 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2762 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2764 /* In FUNCTION_DECL, the function specific optimization options to use when
2765 compiling this function. */
2766 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2767 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2769 /* In FUNCTION_DECL, this is set if this function has other versions generated
2770 using "target" attributes. The default version is the one which does not
2771 have any "target" attribute set. */
2772 #define DECL_FUNCTION_VERSIONED(NODE)\
2773 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2775 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2776 Devirtualization machinery uses this knowledge for determing type of the
2777 object constructed. Also we assume that constructor address is not
2779 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2780 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2782 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2783 Devirtualization machinery uses this to track types in destruction. */
2784 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2785 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2787 /* In FUNCTION_DECL that represent an virtual method this is set when
2788 the method is final. */
2789 #define DECL_FINAL_P(NODE)\
2790 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2792 /* The source language of the translation-unit. */
2793 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2794 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2796 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2798 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2799 #define DECL_ORIGINAL_TYPE(NODE) \
2800 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2802 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2803 into stabs. Instead it will generate cross reference ('x') of names.
2804 This uses the same flag as DECL_EXTERNAL. */
2805 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2806 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2808 /* Getter of the imported declaration associated to the
2809 IMPORTED_DECL node. */
2810 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2811 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2813 /* Getter of the symbol declaration associated with the
2814 NAMELIST_DECL node. */
2815 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2816 (DECL_INITIAL (NODE))
2818 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2819 To reduce overhead, the nodes containing the statements are not trees.
2820 This avoids the overhead of tree_common on all linked list elements.
2822 Use the interface in tree-iterator.h to access this node. */
2824 #define STATEMENT_LIST_HEAD(NODE) \
2825 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2826 #define STATEMENT_LIST_TAIL(NODE) \
2827 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2829 #define TREE_OPTIMIZATION(NODE) \
2830 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2832 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2833 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2835 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2836 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2838 /* Return a tree node that encapsulates the optimization options in OPTS. */
2839 extern tree
build_optimization_node (struct gcc_options
*opts
);
2841 #define TREE_TARGET_OPTION(NODE) \
2842 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2844 #define TREE_TARGET_GLOBALS(NODE) \
2845 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2847 /* Return a tree node that encapsulates the target options in OPTS. */
2848 extern tree
build_target_option_node (struct gcc_options
*opts
);
2850 extern void prepare_target_option_nodes_for_pch (void);
2852 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2855 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2857 if (TREE_CODE (__t
) != __c
)
2858 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2863 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2866 if (TREE_CODE (__t
) == __c
)
2867 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2872 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2873 enum tree_code __c1
, enum tree_code __c2
)
2875 if (TREE_CODE (__t
) != __c1
2876 && TREE_CODE (__t
) != __c2
)
2877 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2882 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2883 enum tree_code __c1
, enum tree_code __c2
)
2885 if (TREE_CODE (__t
) == __c1
2886 || TREE_CODE (__t
) == __c2
)
2887 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2892 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2893 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2895 if (TREE_CODE (__t
) != __c1
2896 && TREE_CODE (__t
) != __c2
2897 && TREE_CODE (__t
) != __c3
)
2898 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2903 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2904 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2906 if (TREE_CODE (__t
) == __c1
2907 || TREE_CODE (__t
) == __c2
2908 || TREE_CODE (__t
) == __c3
)
2909 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2914 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2915 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2916 enum tree_code __c4
)
2918 if (TREE_CODE (__t
) != __c1
2919 && TREE_CODE (__t
) != __c2
2920 && TREE_CODE (__t
) != __c3
2921 && TREE_CODE (__t
) != __c4
)
2922 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2927 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2928 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2929 enum tree_code __c4
)
2931 if (TREE_CODE (__t
) == __c1
2932 || TREE_CODE (__t
) == __c2
2933 || TREE_CODE (__t
) == __c3
2934 || TREE_CODE (__t
) == __c4
)
2935 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2940 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2941 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2942 enum tree_code __c4
, enum tree_code __c5
)
2944 if (TREE_CODE (__t
) != __c1
2945 && TREE_CODE (__t
) != __c2
2946 && TREE_CODE (__t
) != __c3
2947 && TREE_CODE (__t
) != __c4
2948 && TREE_CODE (__t
) != __c5
)
2949 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2954 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2955 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2956 enum tree_code __c4
, enum tree_code __c5
)
2958 if (TREE_CODE (__t
) == __c1
2959 || TREE_CODE (__t
) == __c2
2960 || TREE_CODE (__t
) == __c3
2961 || TREE_CODE (__t
) == __c4
2962 || TREE_CODE (__t
) == __c5
)
2963 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2968 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2969 const char *__f
, int __l
, const char *__g
)
2971 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2972 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2977 tree_class_check (tree __t
, const enum tree_code_class __class
,
2978 const char *__f
, int __l
, const char *__g
)
2980 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2981 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2986 tree_range_check (tree __t
,
2987 enum tree_code __code1
, enum tree_code __code2
,
2988 const char *__f
, int __l
, const char *__g
)
2990 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2991 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2996 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2997 const char *__f
, int __l
, const char *__g
)
2999 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3000 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3001 if (__t
->omp_clause
.code
!= __code
)
3002 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3007 omp_clause_range_check (tree __t
,
3008 enum omp_clause_code __code1
,
3009 enum omp_clause_code __code2
,
3010 const char *__f
, int __l
, const char *__g
)
3012 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3013 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3014 if ((int) __t
->omp_clause
.code
< (int) __code1
3015 || (int) __t
->omp_clause
.code
> (int) __code2
)
3016 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3020 /* These checks have to be special cased. */
3023 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3025 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3026 if (!IS_EXPR_CODE_CLASS (__c
))
3027 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3031 /* These checks have to be special cased. */
3034 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3037 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3041 inline const HOST_WIDE_INT
*
3042 tree_int_cst_elt_check (const_tree __t
, int __i
,
3043 const char *__f
, int __l
, const char *__g
)
3045 if (TREE_CODE (__t
) != INTEGER_CST
)
3046 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3047 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3048 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3050 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3053 inline HOST_WIDE_INT
*
3054 tree_int_cst_elt_check (tree __t
, int __i
,
3055 const char *__f
, int __l
, const char *__g
)
3057 if (TREE_CODE (__t
) != INTEGER_CST
)
3058 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3059 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3060 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3062 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3065 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3067 # if GCC_VERSION >= 4006
3068 #pragma GCC diagnostic push
3069 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3073 tree_vec_elt_check (tree __t
, int __i
,
3074 const char *__f
, int __l
, const char *__g
)
3076 if (TREE_CODE (__t
) != TREE_VEC
)
3077 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3078 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3079 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3080 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3083 # if GCC_VERSION >= 4006
3084 #pragma GCC diagnostic pop
3088 omp_clause_elt_check (tree __t
, int __i
,
3089 const char *__f
, int __l
, const char *__g
)
3091 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3092 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3093 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3094 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3095 return &__t
->omp_clause
.ops
[__i
];
3098 /* These checks have to be special cased. */
3101 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3103 if (!ANY_INTEGRAL_TYPE_P (__t
))
3104 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3110 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3113 if (TREE_CODE (__t
) != __c
)
3114 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3119 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3122 if (TREE_CODE (__t
) == __c
)
3123 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3128 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3129 enum tree_code __c1
, enum tree_code __c2
)
3131 if (TREE_CODE (__t
) != __c1
3132 && TREE_CODE (__t
) != __c2
)
3133 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3138 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3139 enum tree_code __c1
, enum tree_code __c2
)
3141 if (TREE_CODE (__t
) == __c1
3142 || TREE_CODE (__t
) == __c2
)
3143 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3148 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3149 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3151 if (TREE_CODE (__t
) != __c1
3152 && TREE_CODE (__t
) != __c2
3153 && TREE_CODE (__t
) != __c3
)
3154 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3159 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3160 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3162 if (TREE_CODE (__t
) == __c1
3163 || TREE_CODE (__t
) == __c2
3164 || TREE_CODE (__t
) == __c3
)
3165 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3170 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3171 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3172 enum tree_code __c4
)
3174 if (TREE_CODE (__t
) != __c1
3175 && TREE_CODE (__t
) != __c2
3176 && TREE_CODE (__t
) != __c3
3177 && TREE_CODE (__t
) != __c4
)
3178 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3183 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3184 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3185 enum tree_code __c4
)
3187 if (TREE_CODE (__t
) == __c1
3188 || TREE_CODE (__t
) == __c2
3189 || TREE_CODE (__t
) == __c3
3190 || TREE_CODE (__t
) == __c4
)
3191 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3196 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3197 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3198 enum tree_code __c4
, enum tree_code __c5
)
3200 if (TREE_CODE (__t
) != __c1
3201 && TREE_CODE (__t
) != __c2
3202 && TREE_CODE (__t
) != __c3
3203 && TREE_CODE (__t
) != __c4
3204 && TREE_CODE (__t
) != __c5
)
3205 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3210 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3211 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3212 enum tree_code __c4
, enum tree_code __c5
)
3214 if (TREE_CODE (__t
) == __c1
3215 || TREE_CODE (__t
) == __c2
3216 || TREE_CODE (__t
) == __c3
3217 || TREE_CODE (__t
) == __c4
3218 || TREE_CODE (__t
) == __c5
)
3219 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3224 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3225 const char *__f
, int __l
, const char *__g
)
3227 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3228 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3233 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3234 const char *__f
, int __l
, const char *__g
)
3236 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3237 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3242 tree_range_check (const_tree __t
,
3243 enum tree_code __code1
, enum tree_code __code2
,
3244 const char *__f
, int __l
, const char *__g
)
3246 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3247 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3252 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3253 const char *__f
, int __l
, const char *__g
)
3255 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3256 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3257 if (__t
->omp_clause
.code
!= __code
)
3258 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3263 omp_clause_range_check (const_tree __t
,
3264 enum omp_clause_code __code1
,
3265 enum omp_clause_code __code2
,
3266 const char *__f
, int __l
, const char *__g
)
3268 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3269 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3270 if ((int) __t
->omp_clause
.code
< (int) __code1
3271 || (int) __t
->omp_clause
.code
> (int) __code2
)
3272 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3277 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3279 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3280 if (!IS_EXPR_CODE_CLASS (__c
))
3281 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3286 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3289 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3293 # if GCC_VERSION >= 4006
3294 #pragma GCC diagnostic push
3295 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3299 tree_vec_elt_check (const_tree __t
, int __i
,
3300 const char *__f
, int __l
, const char *__g
)
3302 if (TREE_CODE (__t
) != TREE_VEC
)
3303 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3304 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3305 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3306 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3307 //return &__t->vec.a[__i];
3310 # if GCC_VERSION >= 4006
3311 #pragma GCC diagnostic pop
3315 omp_clause_elt_check (const_tree __t
, int __i
,
3316 const char *__f
, int __l
, const char *__g
)
3318 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3319 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3320 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3321 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3322 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3326 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3329 if (!ANY_INTEGRAL_TYPE_P (__t
))
3330 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3337 /* Compute the number of operands in an expression node NODE. For
3338 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3339 otherwise it is looked up from the node's code. */
3341 tree_operand_length (const_tree node
)
3343 if (VL_EXP_CLASS_P (node
))
3344 return VL_EXP_OPERAND_LENGTH (node
);
3346 return TREE_CODE_LENGTH (TREE_CODE (node
));
3349 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3351 /* Special checks for TREE_OPERANDs. */
3353 tree_operand_check (tree __t
, int __i
,
3354 const char *__f
, int __l
, const char *__g
)
3356 const_tree __u
= EXPR_CHECK (__t
);
3357 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3358 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3359 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3363 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3364 const char *__f
, int __l
, const char *__g
)
3366 if (TREE_CODE (__t
) != __code
)
3367 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3368 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3369 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3370 return &__t
->exp
.operands
[__i
];
3374 tree_operand_check (const_tree __t
, int __i
,
3375 const char *__f
, int __l
, const char *__g
)
3377 const_tree __u
= EXPR_CHECK (__t
);
3378 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3379 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3380 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3384 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3385 const char *__f
, int __l
, const char *__g
)
3387 if (TREE_CODE (__t
) != __code
)
3388 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3389 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3390 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3391 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3396 #define error_mark_node global_trees[TI_ERROR_MARK]
3398 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3399 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3400 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3401 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3402 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3404 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3405 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3406 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3407 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3408 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3410 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3411 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3412 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3413 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3414 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3416 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3417 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3418 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3420 #define void_node global_trees[TI_VOID]
3422 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3423 #define integer_one_node global_trees[TI_INTEGER_ONE]
3424 #define integer_three_node global_trees[TI_INTEGER_THREE]
3425 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3426 #define size_zero_node global_trees[TI_SIZE_ZERO]
3427 #define size_one_node global_trees[TI_SIZE_ONE]
3428 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3429 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3430 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3432 /* Base access nodes. */
3433 #define access_public_node global_trees[TI_PUBLIC]
3434 #define access_protected_node global_trees[TI_PROTECTED]
3435 #define access_private_node global_trees[TI_PRIVATE]
3437 #define null_pointer_node global_trees[TI_NULL_POINTER]
3439 #define float_type_node global_trees[TI_FLOAT_TYPE]
3440 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3441 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3443 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3444 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3445 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3446 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3448 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3449 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3450 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3451 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3453 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3455 #define void_type_node global_trees[TI_VOID_TYPE]
3456 /* The C type `void *'. */
3457 #define ptr_type_node global_trees[TI_PTR_TYPE]
3458 /* The C type `const void *'. */
3459 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3460 /* The C type `size_t'. */
3461 #define size_type_node global_trees[TI_SIZE_TYPE]
3462 #define pid_type_node global_trees[TI_PID_TYPE]
3463 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3464 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3465 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3466 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3467 /* The C type `FILE *'. */
3468 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3469 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3471 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3472 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3473 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3475 /* The decimal floating point types. */
3476 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3477 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3478 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3479 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3480 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3481 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3483 /* The fixed-point types. */
3484 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3485 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3486 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3487 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3488 #define sat_unsigned_short_fract_type_node \
3489 global_trees[TI_SAT_USFRACT_TYPE]
3490 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3491 #define sat_unsigned_long_fract_type_node \
3492 global_trees[TI_SAT_ULFRACT_TYPE]
3493 #define sat_unsigned_long_long_fract_type_node \
3494 global_trees[TI_SAT_ULLFRACT_TYPE]
3495 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3496 #define fract_type_node global_trees[TI_FRACT_TYPE]
3497 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3498 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3499 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3500 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3501 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3502 #define unsigned_long_long_fract_type_node \
3503 global_trees[TI_ULLFRACT_TYPE]
3504 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3505 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3506 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3507 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3508 #define sat_unsigned_short_accum_type_node \
3509 global_trees[TI_SAT_USACCUM_TYPE]
3510 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3511 #define sat_unsigned_long_accum_type_node \
3512 global_trees[TI_SAT_ULACCUM_TYPE]
3513 #define sat_unsigned_long_long_accum_type_node \
3514 global_trees[TI_SAT_ULLACCUM_TYPE]
3515 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3516 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3517 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3518 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3519 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3520 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3521 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3522 #define unsigned_long_long_accum_type_node \
3523 global_trees[TI_ULLACCUM_TYPE]
3524 #define qq_type_node global_trees[TI_QQ_TYPE]
3525 #define hq_type_node global_trees[TI_HQ_TYPE]
3526 #define sq_type_node global_trees[TI_SQ_TYPE]
3527 #define dq_type_node global_trees[TI_DQ_TYPE]
3528 #define tq_type_node global_trees[TI_TQ_TYPE]
3529 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3530 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3531 #define usq_type_node global_trees[TI_USQ_TYPE]
3532 #define udq_type_node global_trees[TI_UDQ_TYPE]
3533 #define utq_type_node global_trees[TI_UTQ_TYPE]
3534 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3535 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3536 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3537 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3538 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3539 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3540 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3541 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3542 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3543 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3544 #define ha_type_node global_trees[TI_HA_TYPE]
3545 #define sa_type_node global_trees[TI_SA_TYPE]
3546 #define da_type_node global_trees[TI_DA_TYPE]
3547 #define ta_type_node global_trees[TI_TA_TYPE]
3548 #define uha_type_node global_trees[TI_UHA_TYPE]
3549 #define usa_type_node global_trees[TI_USA_TYPE]
3550 #define uda_type_node global_trees[TI_UDA_TYPE]
3551 #define uta_type_node global_trees[TI_UTA_TYPE]
3552 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3553 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3554 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3555 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3556 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3557 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3558 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3559 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3561 /* The node that should be placed at the end of a parameter list to
3562 indicate that the function does not take a variable number of
3563 arguments. The TREE_VALUE will be void_type_node and there will be
3564 no TREE_CHAIN. Language-independent code should not assume
3565 anything else about this node. */
3566 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3568 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3569 #define MAIN_NAME_P(NODE) \
3570 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3572 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3574 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3575 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3577 /* Default/current target options (TARGET_OPTION_NODE). */
3578 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3579 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3581 /* Default tree list option(), optimize() pragmas to be linked into the
3583 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3584 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3586 #define char_type_node integer_types[itk_char]
3587 #define signed_char_type_node integer_types[itk_signed_char]
3588 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3589 #define short_integer_type_node integer_types[itk_short]
3590 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3591 #define integer_type_node integer_types[itk_int]
3592 #define unsigned_type_node integer_types[itk_unsigned_int]
3593 #define long_integer_type_node integer_types[itk_long]
3594 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3595 #define long_long_integer_type_node integer_types[itk_long_long]
3596 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3598 /* True if NODE is an erroneous expression. */
3600 #define error_operand_p(NODE) \
3601 ((NODE) == error_mark_node \
3602 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3604 extern tree
decl_assembler_name (tree
);
3605 extern tree
decl_comdat_group (const_tree
);
3606 extern tree
decl_comdat_group_id (const_tree
);
3607 extern const char *decl_section_name (const_tree
);
3608 extern void set_decl_section_name (tree
, const char *);
3609 extern enum tls_model
decl_tls_model (const_tree
);
3610 extern void set_decl_tls_model (tree
, enum tls_model
);
3612 /* Compute the number of bytes occupied by 'node'. This routine only
3613 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3615 extern size_t tree_size (const_tree
);
3617 /* Compute the number of bytes occupied by a tree with code CODE.
3618 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3619 which are of variable length. */
3620 extern size_t tree_code_size (enum tree_code
);
3622 /* Allocate and return a new UID from the DECL_UID namespace. */
3623 extern int allocate_decl_uid (void);
3625 /* Lowest level primitive for allocating a node.
3626 The TREE_CODE is the only argument. Contents are initialized
3627 to zero except for a few of the common fields. */
3629 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3630 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3632 /* Make a copy of a node, with all the same contents. */
3634 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3635 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3637 /* Make a copy of a chain of TREE_LIST nodes. */
3639 extern tree
copy_list (tree
);
3641 /* Make a CASE_LABEL_EXPR. */
3643 extern tree
build_case_label (tree
, tree
, tree
);
3646 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3647 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3649 /* Make an INTEGER_CST. */
3651 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3652 #define make_int_cst(LEN, EXT_LEN) \
3653 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3655 /* Make a TREE_VEC. */
3657 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3658 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3660 /* Grow a TREE_VEC. */
3662 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3663 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3665 /* Construct various types of nodes. */
3667 extern tree
build_nt (enum tree_code
, ...);
3668 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3670 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3671 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3672 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3673 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3674 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3675 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3676 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3677 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3678 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3679 tree MEM_STAT_DECL
);
3680 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3681 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3682 tree MEM_STAT_DECL
);
3683 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3685 /* _loc versions of build[1-5]. */
3688 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3689 tree arg1 MEM_STAT_DECL
)
3691 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3692 if (CAN_HAVE_LOCATION_P (t
))
3693 SET_EXPR_LOCATION (t
, loc
);
3696 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3699 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3700 tree arg1 MEM_STAT_DECL
)
3702 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3703 if (CAN_HAVE_LOCATION_P (t
))
3704 SET_EXPR_LOCATION (t
, loc
);
3707 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3710 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3711 tree arg1
, tree arg2 MEM_STAT_DECL
)
3713 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3714 if (CAN_HAVE_LOCATION_P (t
))
3715 SET_EXPR_LOCATION (t
, loc
);
3718 #define build3_loc(l,c,t1,t2,t3,t4) \
3719 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3722 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3723 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3725 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3726 if (CAN_HAVE_LOCATION_P (t
))
3727 SET_EXPR_LOCATION (t
, loc
);
3730 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3731 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3734 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3735 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3737 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3738 arg4 PASS_MEM_STAT
);
3739 if (CAN_HAVE_LOCATION_P (t
))
3740 SET_EXPR_LOCATION (t
, loc
);
3743 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3744 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3746 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3747 #define build_var_debug_value(t1,t2) \
3748 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3750 /* Constructs double_int from tree CST. */
3752 extern tree
double_int_to_tree (tree
, double_int
);
3754 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3755 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3757 /* Create an INT_CST node with a CST value zero extended. */
3760 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3761 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3762 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3763 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3764 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3765 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3766 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3767 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3768 extern tree
build_vector_from_val (tree
, tree
);
3769 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3770 extern tree
build_constructor_single (tree
, tree
, tree
);
3771 extern tree
build_constructor_from_list (tree
, tree
);
3772 extern tree
build_constructor_va (tree
, int, ...);
3773 extern tree
build_real_from_int_cst (tree
, const_tree
);
3774 extern tree
build_complex (tree
, tree
, tree
);
3775 extern tree
build_one_cst (tree
);
3776 extern tree
build_minus_one_cst (tree
);
3777 extern tree
build_all_ones_cst (tree
);
3778 extern tree
build_zero_cst (tree
);
3779 extern tree
build_string (int, const char *);
3780 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3781 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3782 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3783 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3784 extern tree
build_decl_stat (location_t
, enum tree_code
,
3785 tree
, tree MEM_STAT_DECL
);
3786 extern tree
build_fn_decl (const char *, tree
);
3787 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3788 extern tree
build_translation_unit_decl (tree
);
3789 extern tree
build_block (tree
, tree
, tree
, tree
);
3790 extern tree
build_empty_stmt (location_t
);
3791 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3793 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3794 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3796 extern tree
build_call_nary (tree
, tree
, int, ...);
3797 extern tree
build_call_valist (tree
, tree
, int, va_list);
3798 #define build_call_array(T1,T2,N,T3)\
3799 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3800 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3801 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3802 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
3803 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
3804 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
3805 extern tree
build_call_expr (tree
, int, ...);
3806 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
3808 extern tree
build_string_literal (int, const char *);
3810 /* Construct various nodes representing data types. */
3812 extern tree
signed_or_unsigned_type_for (int, tree
);
3813 extern tree
signed_type_for (tree
);
3814 extern tree
unsigned_type_for (tree
);
3815 extern tree
truth_type_for (tree
);
3816 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
3817 extern tree
build_pointer_type (tree
);
3818 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
3819 extern tree
build_reference_type (tree
);
3820 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
3821 extern tree
build_vector_type (tree innertype
, int nunits
);
3822 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3823 extern tree
build_index_type (tree
);
3824 extern tree
build_array_type (tree
, tree
);
3825 extern tree
build_nonshared_array_type (tree
, tree
);
3826 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3827 extern tree
build_function_type (tree
, tree
);
3828 extern tree
build_function_type_list (tree
, ...);
3829 extern tree
build_varargs_function_type_list (tree
, ...);
3830 extern tree
build_function_type_array (tree
, int, tree
*);
3831 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3832 #define build_function_type_vec(RET, V) \
3833 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3834 #define build_varargs_function_type_vec(RET, V) \
3835 build_varargs_function_type_array (RET, vec_safe_length (V), \
3836 vec_safe_address (V))
3837 extern tree
build_method_type_directly (tree
, tree
, tree
);
3838 extern tree
build_method_type (tree
, tree
);
3839 extern tree
build_offset_type (tree
, tree
);
3840 extern tree
build_complex_type (tree
);
3841 extern tree
array_type_nelts (const_tree
);
3843 extern tree
value_member (tree
, tree
);
3844 extern tree
purpose_member (const_tree
, tree
);
3845 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3846 extern tree
chain_index (int, tree
);
3848 extern int attribute_list_equal (const_tree
, const_tree
);
3849 extern int attribute_list_contained (const_tree
, const_tree
);
3850 extern int tree_int_cst_equal (const_tree
, const_tree
);
3852 extern bool tree_fits_shwi_p (const_tree
)
3853 #ifndef ENABLE_TREE_CHECKING
3854 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
3857 extern bool tree_fits_uhwi_p (const_tree
)
3858 #ifndef ENABLE_TREE_CHECKING
3859 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
3862 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
3863 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
3864 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3865 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3866 tree_to_shwi (const_tree t
)
3868 gcc_assert (tree_fits_shwi_p (t
));
3869 return TREE_INT_CST_LOW (t
);
3872 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
3873 tree_to_uhwi (const_tree t
)
3875 gcc_assert (tree_fits_uhwi_p (t
));
3876 return TREE_INT_CST_LOW (t
);
3879 extern int tree_int_cst_sgn (const_tree
);
3880 extern int tree_int_cst_sign_bit (const_tree
);
3881 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
3882 extern tree
strip_array_types (tree
);
3883 extern tree
excess_precision_type (tree
);
3884 extern bool valid_constant_size_p (const_tree
);
3887 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3888 put the prototype here. Rtl.h does declare the prototype if
3889 tree.h had been included. */
3891 extern tree
make_tree (tree
, rtx
);
3893 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3896 Such modified types already made are recorded so that duplicates
3899 extern tree
build_type_attribute_variant (tree
, tree
);
3900 extern tree
build_decl_attribute_variant (tree
, tree
);
3901 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3903 extern bool attribute_value_equal (const_tree
, const_tree
);
3905 /* Return 0 if the attributes for two types are incompatible, 1 if they
3906 are compatible, and 2 if they are nearly compatible (which causes a
3907 warning to be generated). */
3908 extern int comp_type_attributes (const_tree
, const_tree
);
3910 /* Default versions of target-overridable functions. */
3911 extern tree
merge_decl_attributes (tree
, tree
);
3912 extern tree
merge_type_attributes (tree
, tree
);
3914 /* This function is a private implementation detail of lookup_attribute()
3915 and you should never call it directly. */
3916 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3918 /* This function is a private implementation detail
3919 of lookup_attribute_by_prefix() and you should never call it directly. */
3920 extern tree
private_lookup_attribute_by_prefix (const char *, size_t, tree
);
3922 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3923 return a pointer to the attribute's list element if the attribute
3924 is part of the list, or NULL_TREE if not found. If the attribute
3925 appears more than once, this only returns the first occurrence; the
3926 TREE_CHAIN of the return value should be passed back in if further
3927 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3931 lookup_attribute (const char *attr_name
, tree list
)
3933 gcc_checking_assert (attr_name
[0] != '_');
3934 /* In most cases, list is NULL_TREE. */
3935 if (list
== NULL_TREE
)
3938 /* Do the strlen() before calling the out-of-line implementation.
3939 In most cases attr_name is a string constant, and the compiler
3940 will optimize the strlen() away. */
3941 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3944 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3945 return a pointer to the attribute's list first element if the attribute
3946 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
3950 lookup_attribute_by_prefix (const char *attr_name
, tree list
)
3952 gcc_checking_assert (attr_name
[0] != '_');
3953 /* In most cases, list is NULL_TREE. */
3954 if (list
== NULL_TREE
)
3957 return private_lookup_attribute_by_prefix (attr_name
, strlen (attr_name
),
3962 /* This function is a private implementation detail of
3963 is_attribute_p() and you should never call it directly. */
3964 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3966 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3967 if the identifier node is a valid attribute name for the string.
3968 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3969 be the identifier for 'text' or for '__text__'. */
3972 is_attribute_p (const char *attr_name
, const_tree ident
)
3974 gcc_checking_assert (attr_name
[0] != '_');
3975 /* Do the strlen() before calling the out-of-line implementation.
3976 In most cases attr_name is a string constant, and the compiler
3977 will optimize the strlen() away. */
3978 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3981 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3982 modified list. ATTR_NAME must be in the form 'text' (not
3985 extern tree
remove_attribute (const char *, tree
);
3987 /* Given two attributes lists, return a list of their union. */
3989 extern tree
merge_attributes (tree
, tree
);
3991 /* Given two Windows decl attributes lists, possibly including
3992 dllimport, return a list of their union . */
3993 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3995 /* Handle a "dllimport" or "dllexport" attribute. */
3996 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3998 /* Returns true iff unqualified CAND and BASE are equivalent. */
4000 extern bool check_base_type (const_tree cand
, const_tree base
);
4002 /* Check whether CAND is suitable to be returned from get_qualified_type
4003 (BASE, TYPE_QUALS). */
4005 extern bool check_qualified_type (const_tree
, const_tree
, int);
4007 /* Return a version of the TYPE, qualified as indicated by the
4008 TYPE_QUALS, if one exists. If no qualified version exists yet,
4009 return NULL_TREE. */
4011 extern tree
get_qualified_type (tree
, int);
4013 /* Like get_qualified_type, but creates the type if it does not
4014 exist. This function never returns NULL_TREE. */
4016 extern tree
build_qualified_type (tree
, int);
4018 /* Create a variant of type T with alignment ALIGN. */
4020 extern tree
build_aligned_type (tree
, unsigned int);
4022 /* Like build_qualified_type, but only deals with the `const' and
4023 `volatile' qualifiers. This interface is retained for backwards
4024 compatibility with the various front-ends; new code should use
4025 build_qualified_type instead. */
4027 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4028 build_qualified_type ((TYPE), \
4029 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4030 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4032 /* Make a copy of a type node. */
4034 extern tree
build_distinct_type_copy (tree
);
4035 extern tree
build_variant_type_copy (tree
);
4037 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4038 return a canonicalized ..._TYPE node, so that duplicates are not made.
4039 How the hash code is computed is up to the caller, as long as any two
4040 callers that could hash identical-looking type nodes agree. */
4042 extern tree
type_hash_canon (unsigned int, tree
);
4044 extern tree
convert (tree
, tree
);
4045 extern unsigned int expr_align (const_tree
);
4046 extern tree
size_in_bytes (const_tree
);
4047 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4048 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4049 extern tree
bit_position (const_tree
);
4050 extern tree
byte_position (const_tree
);
4051 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4053 #define sizetype sizetype_tab[(int) stk_sizetype]
4054 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4055 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4056 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4057 #define size_int(L) size_int_kind (L, stk_sizetype)
4058 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4059 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4060 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4062 /* Type for sizes of data-type. */
4064 #define BITS_PER_UNIT_LOG \
4065 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4066 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4067 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4069 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4070 by making the last node in X point to Y.
4071 Returns X, except if X is 0 returns Y. */
4073 extern tree
chainon (tree
, tree
);
4075 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4077 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4078 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4080 /* Return the last tree node in a chain. */
4082 extern tree
tree_last (tree
);
4084 /* Reverse the order of elements in a chain, and return the new head. */
4086 extern tree
nreverse (tree
);
4088 /* Returns the length of a chain of nodes
4089 (number of chain pointers to follow before reaching a null pointer). */
4091 extern int list_length (const_tree
);
4093 /* Returns the first FIELD_DECL in a type. */
4095 extern tree
first_field (const_tree
);
4097 /* Given an initializer INIT, return TRUE if INIT is zero or some
4098 aggregate of zeros. Otherwise return FALSE. */
4100 extern bool initializer_zerop (const_tree
);
4102 /* Given a vector VEC, return its first element if all elements are
4103 the same. Otherwise return NULL_TREE. */
4105 extern tree
uniform_vector_p (const_tree
);
4107 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4109 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4111 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4113 extern int integer_zerop (const_tree
);
4115 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4117 extern int integer_onep (const_tree
);
4119 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4120 a vector or complex where each part is 1. */
4122 extern int integer_each_onep (const_tree
);
4124 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4125 all of whose significant bits are 1. */
4127 extern int integer_all_onesp (const_tree
);
4129 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4132 extern int integer_minus_onep (const_tree
);
4134 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4135 exactly one bit 1. */
4137 extern int integer_pow2p (const_tree
);
4139 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4140 with a nonzero value. */
4142 extern int integer_nonzerop (const_tree
);
4144 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4145 a vector where each element is an integer constant of value -1. */
4147 extern int integer_truep (const_tree
);
4149 extern bool cst_and_fits_in_hwi (const_tree
);
4150 extern tree
num_ending_zeros (const_tree
);
4152 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4155 extern int fixed_zerop (const_tree
);
4157 /* staticp (tree x) is nonzero if X is a reference to data allocated
4158 at a fixed address in memory. Returns the outermost data. */
4160 extern tree
staticp (tree
);
4162 /* save_expr (EXP) returns an expression equivalent to EXP
4163 but it can be used multiple times within context CTX
4164 and only evaluate EXP once. */
4166 extern tree
save_expr (tree
);
4168 /* Look inside EXPR into any simple arithmetic operations. Return the
4169 outermost non-arithmetic or non-invariant node. */
4171 extern tree
skip_simple_arithmetic (tree
);
4173 /* Look inside EXPR into simple arithmetic operations involving constants.
4174 Return the outermost non-arithmetic or non-constant node. */
4176 extern tree
skip_simple_constant_arithmetic (tree
);
4178 /* Return which tree structure is used by T. */
4180 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4182 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4183 size or offset that depends on a field within a record. */
4185 extern bool contains_placeholder_p (const_tree
);
4187 /* This macro calls the above function but short-circuits the common
4188 case of a constant to save time. Also check for null. */
4190 #define CONTAINS_PLACEHOLDER_P(EXP) \
4191 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4193 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4194 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4197 extern bool type_contains_placeholder_p (tree
);
4199 /* Given a tree EXP, find all occurrences of references to fields
4200 in a PLACEHOLDER_EXPR and place them in vector REFS without
4201 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4202 we assume here that EXP contains only arithmetic expressions
4203 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4206 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4208 /* This macro calls the above function but short-circuits the common
4209 case of a constant to save time and also checks for NULL. */
4211 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4213 if((EXP) && !TREE_CONSTANT (EXP)) \
4214 find_placeholder_in_expr (EXP, V); \
4217 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4218 return a tree with all occurrences of references to F in a
4219 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4220 CONST_DECLs. Note that we assume here that EXP contains only
4221 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4222 occurring only in their argument list. */
4224 extern tree
substitute_in_expr (tree
, tree
, tree
);
4226 /* This macro calls the above function but short-circuits the common
4227 case of a constant to save time and also checks for NULL. */
4229 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4230 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4232 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4233 for it within OBJ, a tree that is an object or a chain of references. */
4235 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4237 /* This macro calls the above function but short-circuits the common
4238 case of a constant to save time and also checks for NULL. */
4240 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4241 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4242 : substitute_placeholder_in_expr (EXP, OBJ))
4245 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4246 but it can be used multiple times
4247 and only evaluate the subexpressions once. */
4249 extern tree
stabilize_reference (tree
);
4251 /* Return EXP, stripped of any conversions to wider types
4252 in such a way that the result of converting to type FOR_TYPE
4253 is the same as if EXP were converted to FOR_TYPE.
4254 If FOR_TYPE is 0, it signifies EXP's type. */
4256 extern tree
get_unwidened (tree
, tree
);
4258 /* Return OP or a simpler expression for a narrower value
4259 which can be sign-extended or zero-extended to give back OP.
4260 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4261 or 0 if the value should be sign-extended. */
4263 extern tree
get_narrower (tree
, int *);
4265 /* Return true if T is an expression that get_inner_reference handles. */
4268 handled_component_p (const_tree t
)
4270 switch (TREE_CODE (t
))
4275 case ARRAY_RANGE_REF
:
4278 case VIEW_CONVERT_EXPR
:
4286 /* Given a DECL or TYPE, return the scope in which it was declared, or
4287 NUL_TREE if there is no containing scope. */
4289 extern tree
get_containing_scope (const_tree
);
4291 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4293 extern tree
decl_function_context (const_tree
);
4295 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4296 this _DECL with its context, or zero if none. */
4297 extern tree
decl_type_context (const_tree
);
4299 /* Return 1 if EXPR is the real constant zero. */
4300 extern int real_zerop (const_tree
);
4302 /* Initialize the iterator I with arguments from function FNDECL */
4305 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4307 i
->next
= TYPE_ARG_TYPES (fntype
);
4310 /* Return a pointer that holds the next argument if there are more arguments to
4311 handle, otherwise return NULL. */
4313 static inline tree
*
4314 function_args_iter_cond_ptr (function_args_iterator
*i
)
4316 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4319 /* Return the next argument if there are more arguments to handle, otherwise
4323 function_args_iter_cond (function_args_iterator
*i
)
4325 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4328 /* Advance to the next argument. */
4330 function_args_iter_next (function_args_iterator
*i
)
4332 gcc_assert (i
->next
!= NULL_TREE
);
4333 i
->next
= TREE_CHAIN (i
->next
);
4336 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4339 inlined_function_outer_scope_p (const_tree block
)
4341 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4344 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4345 to point to the next tree element. ITER is an instance of
4346 function_args_iterator used to iterate the arguments. */
4347 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4348 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4349 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4350 function_args_iter_next (&(ITER)))
4352 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4353 to the next tree element. ITER is an instance of function_args_iterator
4354 used to iterate the arguments. */
4355 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4356 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4357 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4358 function_args_iter_next (&(ITER)))
4361 extern unsigned crc32_string (unsigned, const char *);
4362 extern unsigned crc32_byte (unsigned, char);
4363 extern unsigned crc32_unsigned (unsigned, unsigned);
4364 extern void clean_symbol_name (char *);
4365 extern tree
get_file_function_name (const char *);
4366 extern tree
get_callee_fndecl (const_tree
);
4367 extern int type_num_arguments (const_tree
);
4368 extern bool associative_tree_code (enum tree_code
);
4369 extern bool commutative_tree_code (enum tree_code
);
4370 extern bool commutative_ternary_tree_code (enum tree_code
);
4371 extern tree
upper_bound_in_type (tree
, tree
);
4372 extern tree
lower_bound_in_type (tree
, tree
);
4373 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4374 extern tree
create_artificial_label (location_t
);
4375 extern const char *get_name (tree
);
4376 extern bool stdarg_p (const_tree
);
4377 extern bool prototype_p (const_tree
);
4378 extern bool is_typedef_decl (const_tree x
);
4379 extern bool typedef_variant_p (const_tree
);
4380 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4381 extern tree
build_low_bits_mask (tree
, unsigned);
4382 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4383 extern tree
tree_strip_nop_conversions (tree
);
4384 extern tree
tree_strip_sign_nop_conversions (tree
);
4385 extern const_tree
strip_invariant_refs (const_tree
);
4386 extern tree
lhd_gcc_personality (void);
4387 extern void assign_assembler_name_if_neeeded (tree
);
4388 extern void warn_deprecated_use (tree
, tree
);
4389 extern void cache_integer_cst (tree
);
4391 /* Return the memory model from a host integer. */
4392 static inline enum memmodel
4393 memmodel_from_int (unsigned HOST_WIDE_INT val
)
4395 return (enum memmodel
) (val
& MEMMODEL_MASK
);
4398 /* Return the base memory model from a host integer. */
4399 static inline enum memmodel
4400 memmodel_base (unsigned HOST_WIDE_INT val
)
4402 return (enum memmodel
) (val
& MEMMODEL_BASE_MASK
);
4405 /* Return TRUE if the memory model is RELAXED. */
4407 is_mm_relaxed (enum memmodel model
)
4409 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELAXED
;
4412 /* Return TRUE if the memory model is CONSUME. */
4414 is_mm_consume (enum memmodel model
)
4416 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_CONSUME
;
4419 /* Return TRUE if the memory model is ACQUIRE. */
4421 is_mm_acquire (enum memmodel model
)
4423 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQUIRE
;
4426 /* Return TRUE if the memory model is RELEASE. */
4428 is_mm_release (enum memmodel model
)
4430 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELEASE
;
4433 /* Return TRUE if the memory model is ACQ_REL. */
4435 is_mm_acq_rel (enum memmodel model
)
4437 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQ_REL
;
4440 /* Return TRUE if the memory model is SEQ_CST. */
4442 is_mm_seq_cst (enum memmodel model
)
4444 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_SEQ_CST
;
4447 /* Return TRUE if the memory model is a SYNC variant. */
4449 is_mm_sync (enum memmodel model
)
4451 return (model
& MEMMODEL_SYNC
);
4454 /* Compare and hash for any structure which begins with a canonical
4455 pointer. Assumes all pointers are interchangeable, which is sort
4456 of already assumed by gcc elsewhere IIRC. */
4459 struct_ptr_eq (const void *a
, const void *b
)
4461 const void * const * x
= (const void * const *) a
;
4462 const void * const * y
= (const void * const *) b
;
4466 static inline hashval_t
4467 struct_ptr_hash (const void *a
)
4469 const void * const * x
= (const void * const *) a
;
4470 return (intptr_t)*x
>> 4;
4473 /* Return nonzero if CODE is a tree code that represents a truth value. */
4475 truth_value_p (enum tree_code code
)
4477 return (TREE_CODE_CLASS (code
) == tcc_comparison
4478 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4479 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4480 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4483 /* Return whether TYPE is a type suitable for an offset for
4484 a POINTER_PLUS_EXPR. */
4486 ptrofftype_p (tree type
)
4488 return (INTEGRAL_TYPE_P (type
)
4489 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4490 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4493 extern tree
strip_float_extensions (tree
);
4494 extern int really_constant_p (const_tree
);
4495 extern bool decl_address_invariant_p (const_tree
);
4496 extern bool decl_address_ip_invariant_p (const_tree
);
4497 extern bool int_fits_type_p (const_tree
, const_tree
);
4498 #ifndef GENERATOR_FILE
4499 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4501 extern bool variably_modified_type_p (tree
, tree
);
4502 extern int tree_log2 (const_tree
);
4503 extern int tree_floor_log2 (const_tree
);
4504 extern unsigned int tree_ctz (const_tree
);
4505 extern int simple_cst_equal (const_tree
, const_tree
);
4510 extern void add_expr (const_tree
, hash
&);
4514 /* Compat version until all callers are converted. Return hash for
4516 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4518 inchash::hash
hstate (seed
);
4519 inchash::add_expr (tree
, hstate
);
4520 return hstate
.end ();
4523 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4524 extern int type_list_equal (const_tree
, const_tree
);
4525 extern int chain_member (const_tree
, const_tree
);
4526 extern void dump_tree_statistics (void);
4527 extern void recompute_tree_invariant_for_addr_expr (tree
);
4528 extern bool needs_to_live_in_memory (const_tree
);
4529 extern tree
reconstruct_complex_type (tree
, tree
);
4530 extern int real_onep (const_tree
);
4531 extern int real_minus_onep (const_tree
);
4532 extern void init_ttree (void);
4533 extern void build_common_tree_nodes (bool, bool);
4534 extern void build_common_builtin_nodes (void);
4535 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4536 extern tree
build_range_type (tree
, tree
, tree
);
4537 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4538 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4539 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4540 extern tree
tree_block (tree
);
4541 extern void tree_set_block (tree
, tree
);
4542 extern location_t
*block_nonartificial_location (tree
);
4543 extern location_t
tree_nonartificial_location (tree
);
4544 extern tree
block_ultimate_origin (const_tree
);
4545 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4546 extern bool virtual_method_call_p (const_tree
);
4547 extern tree
obj_type_ref_class (const_tree ref
);
4548 extern bool types_same_for_odr (const_tree type1
, const_tree type2
,
4550 extern bool contains_bitfld_component_ref_p (const_tree
);
4551 extern bool block_may_fallthru (const_tree
);
4552 extern void using_eh_for_cleanups (void);
4553 extern bool using_eh_for_cleanups_p (void);
4554 extern const char *get_tree_code_name (enum tree_code
);
4555 extern void set_call_expr_flags (tree
, int);
4556 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
4558 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4560 #define walk_tree(a,b,c,d) \
4561 walk_tree_1 (a, b, c, d, NULL)
4562 #define walk_tree_without_duplicates(a,b,c) \
4563 walk_tree_without_duplicates_1 (a, b, c, NULL)
4565 extern tree
drop_tree_overflow (tree
);
4567 /* Given a memory reference expression T, return its base address.
4568 The base address of a memory reference expression is the main
4569 object being referenced. */
4570 extern tree
get_base_address (tree t
);
4572 /* Return a tree of sizetype representing the size, in bytes, of the element
4573 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4574 extern tree
array_ref_element_size (tree
);
4576 /* Return a tree representing the upper bound of the array mentioned in
4577 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4578 extern tree
array_ref_up_bound (tree
);
4580 /* Return a tree representing the lower bound of the array mentioned in
4581 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4582 extern tree
array_ref_low_bound (tree
);
4584 /* Returns true if REF is an array reference to an array at the end of
4585 a structure. If this is the case, the array may be allocated larger
4586 than its upper bound implies. */
4587 extern bool array_at_struct_end_p (tree
);
4589 /* Return a tree representing the offset, in bytes, of the field referenced
4590 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4591 extern tree
component_ref_field_offset (tree
);
4593 extern int tree_map_base_eq (const void *, const void *);
4594 extern unsigned int tree_map_base_hash (const void *);
4595 extern int tree_map_base_marked_p (const void *);
4596 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
4597 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
4598 bool trust_type_canonical
= true);
4599 /* Return simplified tree code of type that is used for canonical type merging. */
4600 inline enum tree_code
4601 tree_code_for_canonical_type_merging (enum tree_code code
)
4603 /* By C standard, each enumerated type shall be compatible with char,
4604 a signed integer, or an unsigned integer. The choice of type is
4605 implementation defined (in our case it depends on -fshort-enum).
4607 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4608 type and compare only by their signedness and precision. */
4609 if (code
== ENUMERAL_TYPE
)
4610 return INTEGER_TYPE
;
4611 /* To allow inter-operability between languages having references and
4612 C, we consider reference types and pointers alike. Note that this is
4613 not strictly necessary for C-Fortran 2008 interoperability because
4614 Fortran define C_PTR type that needs to be compatible with C pointers
4615 and we handle this one as ptr_type_node. */
4616 if (code
== REFERENCE_TYPE
)
4617 return POINTER_TYPE
;
4621 #define tree_map_eq tree_map_base_eq
4622 extern unsigned int tree_map_hash (const void *);
4623 #define tree_map_marked_p tree_map_base_marked_p
4625 #define tree_decl_map_eq tree_map_base_eq
4626 extern unsigned int tree_decl_map_hash (const void *);
4627 #define tree_decl_map_marked_p tree_map_base_marked_p
4629 struct tree_decl_map_cache_hasher
: ggc_cache_hasher
<tree_decl_map
*>
4631 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
4633 equal (tree_decl_map
*a
, tree_decl_map
*b
)
4635 return tree_decl_map_eq (a
, b
);
4639 keep_cache_entry (tree_decl_map
*&m
)
4641 return ggc_marked_p (m
->base
.from
);
4645 #define tree_int_map_eq tree_map_base_eq
4646 #define tree_int_map_hash tree_map_base_hash
4647 #define tree_int_map_marked_p tree_map_base_marked_p
4649 #define tree_vec_map_eq tree_map_base_eq
4650 #define tree_vec_map_hash tree_decl_map_hash
4651 #define tree_vec_map_marked_p tree_map_base_marked_p
4653 /* Initialize the abstract argument list iterator object ITER with the
4654 arguments from CALL_EXPR node EXP. */
4656 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4659 iter
->n
= call_expr_nargs (exp
);
4664 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4667 iter
->n
= call_expr_nargs (exp
);
4671 /* Return the next argument from abstract argument list iterator object ITER,
4672 and advance its state. Return NULL_TREE if there are no more arguments. */
4674 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4677 if (iter
->i
>= iter
->n
)
4679 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4684 static inline const_tree
4685 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4688 if (iter
->i
>= iter
->n
)
4690 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4695 /* Initialize the abstract argument list iterator object ITER, then advance
4696 past and return the first argument. Useful in for expressions, e.g.
4697 for (arg = first_call_expr_arg (exp, &iter); arg;
4698 arg = next_call_expr_arg (&iter)) */
4700 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4702 init_call_expr_arg_iterator (exp
, iter
);
4703 return next_call_expr_arg (iter
);
4706 static inline const_tree
4707 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4709 init_const_call_expr_arg_iterator (exp
, iter
);
4710 return next_const_call_expr_arg (iter
);
4713 /* Test whether there are more arguments in abstract argument list iterator
4714 ITER, without changing its state. */
4716 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4718 return (iter
->i
< iter
->n
);
4721 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4722 (of type call_expr_arg_iterator) to hold the iteration state. */
4723 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4724 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4725 (arg) = next_call_expr_arg (&(iter)))
4727 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4728 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4729 (arg) = next_const_call_expr_arg (&(iter)))
4731 /* Return true if tree node T is a language-specific node. */
4733 is_lang_specific (const_tree t
)
4735 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4738 /* Valid builtin number. */
4739 #define BUILTIN_VALID_P(FNCODE) \
4740 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4742 /* Return the tree node for an explicit standard builtin function or NULL. */
4744 builtin_decl_explicit (enum built_in_function fncode
)
4746 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4748 return builtin_info
[(size_t)fncode
].decl
;
4751 /* Return the tree node for an implicit builtin function or NULL. */
4753 builtin_decl_implicit (enum built_in_function fncode
)
4755 size_t uns_fncode
= (size_t)fncode
;
4756 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4758 if (!builtin_info
[uns_fncode
].implicit_p
)
4761 return builtin_info
[uns_fncode
].decl
;
4764 /* Set explicit builtin function nodes and whether it is an implicit
4768 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4770 size_t ufncode
= (size_t)fncode
;
4772 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4773 && (decl
!= NULL_TREE
|| !implicit_p
));
4775 builtin_info
[ufncode
].decl
= decl
;
4776 builtin_info
[ufncode
].implicit_p
= implicit_p
;
4777 builtin_info
[ufncode
].declared_p
= false;
4780 /* Set the implicit flag for a builtin function. */
4783 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4785 size_t uns_fncode
= (size_t)fncode
;
4787 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4788 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
4790 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
4793 /* Set the declared flag for a builtin function. */
4796 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
4798 size_t uns_fncode
= (size_t)fncode
;
4800 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4801 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
4803 builtin_info
[uns_fncode
].declared_p
= declared_p
;
4806 /* Return whether the standard builtin function can be used as an explicit
4810 builtin_decl_explicit_p (enum built_in_function fncode
)
4812 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4813 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
4816 /* Return whether the standard builtin function can be used implicitly. */
4819 builtin_decl_implicit_p (enum built_in_function fncode
)
4821 size_t uns_fncode
= (size_t)fncode
;
4823 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4824 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
4825 && builtin_info
[uns_fncode
].implicit_p
);
4828 /* Return whether the standard builtin function was declared. */
4831 builtin_decl_declared_p (enum built_in_function fncode
)
4833 size_t uns_fncode
= (size_t)fncode
;
4835 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4836 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
4837 && builtin_info
[uns_fncode
].declared_p
);
4840 /* Return true if T (assumed to be a DECL) is a global variable.
4841 A variable is considered global if its storage is not automatic. */
4844 is_global_var (const_tree t
)
4846 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
4849 /* Return true if VAR may be aliased. A variable is considered as
4850 maybe aliased if it has its address taken by the local TU
4851 or possibly by another TU and might be modified through a pointer. */
4854 may_be_aliased (const_tree var
)
4856 return (TREE_CODE (var
) != CONST_DECL
4857 && (TREE_PUBLIC (var
)
4858 || DECL_EXTERNAL (var
)
4859 || TREE_ADDRESSABLE (var
))
4860 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
4861 && ((TREE_READONLY (var
)
4862 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
4863 || (TREE_CODE (var
) == VAR_DECL
4864 && DECL_NONALIASED (var
)))));
4867 /* Return pointer to optimization flags of FNDECL. */
4868 static inline struct cl_optimization
*
4869 opts_for_fn (const_tree fndecl
)
4871 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
4872 if (fn_opts
== NULL_TREE
)
4873 fn_opts
= optimization_default_node
;
4874 return TREE_OPTIMIZATION (fn_opts
);
4877 /* Return pointer to target flags of FNDECL. */
4878 static inline cl_target_option
*
4879 target_opts_for_fn (const_tree fndecl
)
4881 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
4882 if (fn_opts
== NULL_TREE
)
4883 fn_opts
= target_option_default_node
;
4884 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
4887 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
4888 the optimization level of function fndecl. */
4889 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
4891 /* For anonymous aggregate types, we need some sort of name to
4892 hold on to. In practice, this should not appear, but it should
4893 not be harmful if it does. */
4894 extern const char *anon_aggrname_format();
4895 extern bool anon_aggrname_p (const_tree
);
4897 /* The tree and const_tree overload templates. */
4901 struct int_traits
<const_tree
>
4903 static const enum precision_type precision_type
= VAR_PRECISION
;
4904 static const bool host_dependent_precision
= false;
4905 static const bool is_sign_extended
= false;
4906 static unsigned int get_precision (const_tree
);
4907 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
4912 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
4921 extended_tree (const_tree
);
4923 unsigned int get_precision () const;
4924 const HOST_WIDE_INT
*get_val () const;
4925 unsigned int get_len () const;
4929 struct int_traits
<extended_tree
<N
> >
4931 static const enum precision_type precision_type
= CONST_PRECISION
;
4932 static const bool host_dependent_precision
= false;
4933 static const bool is_sign_extended
= true;
4934 static const unsigned int precision
= N
;
4937 generic_wide_int
<extended_tree
<WIDE_INT_MAX_PRECISION
> >
4938 to_widest (const_tree
);
4940 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
4944 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
4946 return TYPE_PRECISION (TREE_TYPE (tcst
));
4949 /* Convert the tree_cst X into a wide_int of PRECISION. */
4950 inline wi::storage_ref
4951 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
4952 unsigned int precision
, const_tree x
)
4954 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
4958 inline generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
> >
4959 wi::to_widest (const_tree t
)
4964 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
4965 wi::to_offset (const_tree t
)
4971 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
4974 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
4979 wi::extended_tree
<N
>::get_precision () const
4985 inline const HOST_WIDE_INT
*
4986 wi::extended_tree
<N
>::get_val () const
4988 return &TREE_INT_CST_ELT (m_t
, 0);
4993 wi::extended_tree
<N
>::get_len () const
4995 if (N
== ADDR_MAX_PRECISION
)
4996 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
4997 else if (N
>= WIDE_INT_MAX_PRECISION
)
4998 return TREE_INT_CST_EXT_NUNITS (m_t
);
5000 /* This class is designed to be used for specific output precisions
5001 and needs to be as fast as possible, so there is no fallback for
5008 template <typename T
>
5009 bool fits_to_tree_p (const T
&x
, const_tree
);
5011 wide_int
min_value (const_tree
);
5012 wide_int
max_value (const_tree
);
5013 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5016 template <typename T
>
5018 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5020 if (TYPE_SIGN (type
) == UNSIGNED
)
5021 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5023 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5026 /* Produce the smallest number that is represented in TYPE. The precision
5027 and sign are taken from TYPE. */
5029 wi::min_value (const_tree type
)
5031 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5034 /* Produce the largest number that is represented in TYPE. The precision
5035 and sign are taken from TYPE. */
5037 wi::max_value (const_tree type
)
5039 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5042 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5043 extending both according to their respective TYPE_SIGNs. */
5046 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5048 return wi::lts_p (wi::to_widest (t1
), wi::to_widest (t2
));
5051 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5052 extending both according to their respective TYPE_SIGNs. */
5055 tree_int_cst_le (const_tree t1
, const_tree t2
)
5057 return wi::les_p (wi::to_widest (t1
), wi::to_widest (t2
));
5060 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5061 are both INTEGER_CSTs and their values are extended according to their
5062 respective TYPE_SIGNs. */
5065 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5067 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5070 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5071 but none of these files are allowed to be included from front ends.
5072 They should be split in two. One suitable for the FEs, the other suitable
5075 /* Assign the RTX to declaration. */
5076 extern void set_decl_rtl (tree
, rtx
);
5077 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5079 /* Given an expression EXP that is a handled_component_p,
5080 look for the ultimate containing object, which is returned and specify
5081 the access position and size. */
5082 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5083 tree
*, machine_mode
*, int *, int *,
5086 extern tree
build_personality_function (const char *);
5088 struct GTY(()) int_n_trees_t
{
5089 /* These parts are initialized at runtime */
5094 /* This is also in machmode.h */
5095 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5096 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5098 /* Like bit_position, but return as an integer. It must be representable in
5099 that way (since it could be a signed value, we don't have the
5100 option of returning -1 like int_size_in_byte can. */
5102 inline HOST_WIDE_INT
5103 int_bit_position (const_tree field
)
5105 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field
)), BITS_PER_UNIT_LOG
)
5106 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5109 /* Return true if it makes sense to consider alias set for a type T. */
5112 type_with_alias_set_p (const_tree t
)
5114 /* Function and method types are never accessed as memory locations. */
5115 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5118 if (COMPLETE_TYPE_P (t
))
5121 /* Incomplete types can not be accessed in general except for arrays
5122 where we can fetch its element despite we have no array bounds. */
5123 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5129 extern void gt_ggc_mx (tree
&);
5130 extern void gt_pch_nx (tree
&);
5131 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5133 #endif /* GCC_TREE_H */