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 a vector of booleans. */
474 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
475 (TREE_CODE (TYPE) == VECTOR_TYPE \
476 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
478 /* Nonzero if TYPE represents an integral type. Note that we do not
479 include COMPLEX types here. Keep these checks in ascending code
482 #define INTEGRAL_TYPE_P(TYPE) \
483 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
484 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
485 || TREE_CODE (TYPE) == INTEGER_TYPE)
487 /* Nonzero if TYPE represents an integral type, including complex
488 and vector integer types. */
490 #define ANY_INTEGRAL_TYPE_P(TYPE) \
491 (INTEGRAL_TYPE_P (TYPE) \
492 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
493 || VECTOR_TYPE_P (TYPE)) \
494 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
496 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
498 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
499 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
501 /* Nonzero if TYPE represents a saturating fixed-point type. */
503 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
504 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
506 /* Nonzero if TYPE represents a fixed-point type. */
508 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
510 /* Nonzero if TYPE represents a scalar floating-point type. */
512 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
514 /* Nonzero if TYPE represents a complex floating-point type. */
516 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
517 (TREE_CODE (TYPE) == COMPLEX_TYPE \
518 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
520 /* Nonzero if TYPE represents a vector integer type. */
522 #define VECTOR_INTEGER_TYPE_P(TYPE) \
523 (VECTOR_TYPE_P (TYPE) \
524 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
527 /* Nonzero if TYPE represents a vector floating-point type. */
529 #define VECTOR_FLOAT_TYPE_P(TYPE) \
530 (VECTOR_TYPE_P (TYPE) \
531 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
533 /* Nonzero if TYPE represents a floating-point type, including complex
534 and vector floating-point types. The vector and complex check does
535 not use the previous two macros to enable early folding. */
537 #define FLOAT_TYPE_P(TYPE) \
538 (SCALAR_FLOAT_TYPE_P (TYPE) \
539 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
540 || VECTOR_TYPE_P (TYPE)) \
541 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
543 /* Nonzero if TYPE represents a decimal floating-point type. */
544 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
545 (SCALAR_FLOAT_TYPE_P (TYPE) \
546 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
548 /* Nonzero if TYPE is a record or union type. */
549 #define RECORD_OR_UNION_TYPE_P(TYPE) \
550 (TREE_CODE (TYPE) == RECORD_TYPE \
551 || TREE_CODE (TYPE) == UNION_TYPE \
552 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
554 /* Nonzero if TYPE represents an aggregate (multi-component) type.
555 Keep these checks in ascending code order. */
557 #define AGGREGATE_TYPE_P(TYPE) \
558 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
560 /* Nonzero if TYPE represents a pointer or reference type.
561 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
562 ascending code order. */
564 #define POINTER_TYPE_P(TYPE) \
565 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
567 /* Nonzero if TYPE represents a pointer to function. */
568 #define FUNCTION_POINTER_TYPE_P(TYPE) \
569 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
571 /* Nonzero if this type is a complete type. */
572 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
574 /* Nonzero if this type is a pointer bounds type. */
575 #define POINTER_BOUNDS_TYPE_P(NODE) \
576 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
578 /* Nonzero if this node has a pointer bounds type. */
579 #define POINTER_BOUNDS_P(NODE) \
580 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
582 /* Nonzero if this type supposes bounds existence. */
583 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
585 /* Nonzero for objects with bounded type. */
586 #define BOUNDED_P(node) \
587 BOUNDED_TYPE_P (TREE_TYPE (node))
589 /* Nonzero if this type is the (possibly qualified) void type. */
590 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
592 /* Nonzero if this type is complete or is cv void. */
593 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
594 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
596 /* Nonzero if this type is complete or is an array with unspecified bound. */
597 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
598 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
600 #define FUNC_OR_METHOD_TYPE_P(NODE) \
601 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
603 /* Define many boolean fields that all tree nodes have. */
605 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
606 of this is needed. So it cannot be in a register.
607 In a FUNCTION_DECL it has no meaning.
608 In LABEL_DECL nodes, it means a goto for this label has been seen
609 from a place outside all binding contours that restore stack levels.
610 In an artificial SSA_NAME that points to a stack partition with at least
611 two variables, it means that at least one variable has TREE_ADDRESSABLE.
612 In ..._TYPE nodes, it means that objects of this type must be fully
613 addressable. This means that pieces of this object cannot go into
614 register parameters, for example. If this a function type, this
615 means that the value must be returned in memory.
616 In CONSTRUCTOR nodes, it means object constructed must be in memory.
617 In IDENTIFIER_NODEs, this means that some extern decl for this name
618 had its address taken. That matters for inline functions.
619 In a STMT_EXPR, it means we want the result of the enclosed expression. */
620 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
622 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
623 exit of a function. Calls for which this is true are candidates for tail
624 call optimizations. */
625 #define CALL_EXPR_TAILCALL(NODE) \
626 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
628 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
629 CASE_LOW operand has been processed. */
630 #define CASE_LOW_SEEN(NODE) \
631 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
633 #define PREDICT_EXPR_OUTCOME(NODE) \
634 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
635 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
636 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
637 #define PREDICT_EXPR_PREDICTOR(NODE) \
638 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
640 /* In a VAR_DECL, nonzero means allocate static storage.
641 In a FUNCTION_DECL, nonzero if function has been defined.
642 In a CONSTRUCTOR, nonzero means allocate static storage. */
643 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
645 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
646 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
648 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
649 should only be executed if an exception is thrown, not on normal exit
651 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
653 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
654 separate cleanup in honor_protect_cleanup_actions. */
655 #define TRY_CATCH_IS_CLEANUP(NODE) \
656 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
658 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
659 CASE_HIGH operand has been processed. */
660 #define CASE_HIGH_SEEN(NODE) \
661 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
663 /* Used to mark scoped enums. */
664 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
666 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
667 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
669 /* In an expr node (usually a conversion) this means the node was made
670 implicitly and should not lead to any sort of warning. In a decl node,
671 warnings concerning the decl should be suppressed. This is used at
672 least for used-before-set warnings, and it set after one warning is
674 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
676 /* Used to indicate that this TYPE represents a compiler-generated entity. */
677 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
679 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
680 this string as an argument. */
681 #define TREE_SYMBOL_REFERENCED(NODE) \
682 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
684 /* Nonzero in a pointer or reference type means the data pointed to
685 by this type can alias anything. */
686 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
687 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
689 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
690 there was an overflow in folding. */
692 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
694 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
696 #define TREE_OVERFLOW_P(EXPR) \
697 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
699 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
700 nonzero means name is to be accessible from outside this translation unit.
701 In an IDENTIFIER_NODE, nonzero means an external declaration
702 accessible from outside this translation unit was previously seen
703 for this name in an inner scope. */
704 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
706 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
707 of cached values, or is something else. */
708 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
710 /* In a SAVE_EXPR, indicates that the original expression has already
711 been substituted with a VAR_DECL that contains the value. */
712 #define SAVE_EXPR_RESOLVED_P(NODE) \
713 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
715 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
717 #define CALL_EXPR_VA_ARG_PACK(NODE) \
718 (CALL_EXPR_CHECK (NODE)->base.public_flag)
720 /* In any expression, decl, or constant, nonzero means it has side effects or
721 reevaluation of the whole expression could produce a different value.
722 This is set if any subexpression is a function call, a side effect or a
723 reference to a volatile variable. In a ..._DECL, this is set only if the
724 declaration said `volatile'. This will never be set for a constant. */
725 #define TREE_SIDE_EFFECTS(NODE) \
726 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
728 /* In a LABEL_DECL, nonzero means this label had its address taken
729 and therefore can never be deleted and is a jump target for
731 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
733 /* Nonzero means this expression is volatile in the C sense:
734 its address should be of type `volatile WHATEVER *'.
735 In other words, the declared item is volatile qualified.
736 This is used in _DECL nodes and _REF nodes.
737 On a FUNCTION_DECL node, this means the function does not
738 return normally. This is the same effect as setting
739 the attribute noreturn on the function in C.
741 In a ..._TYPE node, means this type is volatile-qualified.
742 But use TYPE_VOLATILE instead of this macro when the node is a type,
743 because eventually we may make that a different bit.
745 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
746 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
748 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
749 accessing the memory pointed to won't generate a trap. However,
750 this only applies to an object when used appropriately: it doesn't
751 mean that writing a READONLY mem won't trap.
753 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
754 (or slice of the array) always belongs to the range of the array.
755 I.e. that the access will not trap, provided that the access to
756 the base to the array will not trap. */
757 #define TREE_THIS_NOTRAP(NODE) \
758 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
759 ARRAY_RANGE_REF)->base.nothrow_flag)
761 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
762 nonzero means it may not be the lhs of an assignment.
763 Nonzero in a FUNCTION_DECL means this function should be treated
764 as "const" function (can only read its arguments). */
765 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
767 /* Value of expression is constant. Always on in all ..._CST nodes. May
768 also appear in an expression or decl where the value is constant. */
769 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
771 /* Nonzero if NODE, a type, has had its sizes gimplified. */
772 #define TYPE_SIZES_GIMPLIFIED(NODE) \
773 (TYPE_CHECK (NODE)->base.constant_flag)
775 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
776 #define DECL_UNSIGNED(NODE) \
777 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
779 /* In integral and pointer types, means an unsigned type. */
780 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
782 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
783 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
785 /* True if overflow wraps around for the given integral type. That
786 is, TYPE_MAX + 1 == TYPE_MIN. */
787 #define TYPE_OVERFLOW_WRAPS(TYPE) \
788 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
790 /* True if overflow is undefined for the given integral type. We may
791 optimize on the assumption that values in the type never overflow.
793 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
794 must issue a warning based on warn_strict_overflow. In some cases
795 it will be appropriate to issue the warning immediately, and in
796 other cases it will be appropriate to simply set a flag and let the
797 caller decide whether a warning is appropriate or not. */
798 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
799 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
800 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
802 /* True if overflow for the given integral type should issue a
804 #define TYPE_OVERFLOW_TRAPS(TYPE) \
805 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
807 /* True if an overflow is to be preserved for sanitization. */
808 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
809 (INTEGRAL_TYPE_P (TYPE) \
810 && !TYPE_OVERFLOW_WRAPS (TYPE) \
811 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
813 /* True if pointer types have undefined overflow. */
814 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
816 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
817 Nonzero in a FUNCTION_DECL means that the function has been compiled.
818 This is interesting in an inline function, since it might not need
819 to be compiled separately.
820 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
821 or TYPE_DECL if the debugging info for the type has been written.
822 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
823 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
825 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
827 /* Nonzero in a _DECL if the name is used in its scope.
828 Nonzero in an expr node means inhibit warning if value is unused.
829 In IDENTIFIER_NODEs, this means that some extern decl for this name
831 In a BLOCK, this means that the block contains variables that are used. */
832 #define TREE_USED(NODE) ((NODE)->base.used_flag)
834 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
835 throw an exception. In a CALL_EXPR, nonzero means the call cannot
836 throw. We can't easily check the node type here as the C++
837 frontend also uses this flag (for AGGR_INIT_EXPR). */
838 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
840 /* In a CALL_EXPR, means that it's safe to use the target of the call
841 expansion as the return slot for a call that returns in memory. */
842 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
843 (CALL_EXPR_CHECK (NODE)->base.private_flag)
845 /* Cilk keywords accessors. */
846 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
848 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
849 passed by invisible reference (and the TREE_TYPE is a pointer to the true
851 #define DECL_BY_REFERENCE(NODE) \
852 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
853 RESULT_DECL)->decl_common.decl_by_reference_flag)
855 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
857 #define DECL_READ_P(NODE) \
858 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
860 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
861 attempting to share the stack slot with some other variable. */
862 #define DECL_NONSHAREABLE(NODE) \
863 (TREE_CHECK2 (NODE, VAR_DECL, \
864 RESULT_DECL)->decl_common.decl_nonshareable_flag)
866 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
867 thunked-to function. */
868 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
870 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
871 it has been built for the declaration of a variable-sized object. */
872 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
873 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
875 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
876 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
878 /* In a type, nonzero means that all objects of the type are guaranteed by the
879 language or front-end to be properly aligned, so we can indicate that a MEM
880 of this type is aligned at least to the alignment of the type, even if it
881 doesn't appear that it is. We see this, for example, in object-oriented
882 languages where a tag field may show this is an object of a more-aligned
883 variant of the more generic type.
885 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
887 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
889 /* Used in classes in C++. */
890 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
891 /* Used in classes in C++. */
892 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
894 /* True if reference type NODE is a C++ rvalue reference. */
895 #define TYPE_REF_IS_RVALUE(NODE) \
896 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
898 /* Nonzero in a _DECL if the use of the name is defined as a
899 deprecated feature by __attribute__((deprecated)). */
900 #define TREE_DEPRECATED(NODE) \
901 ((NODE)->base.deprecated_flag)
903 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
904 uses are to be substituted for uses of the TREE_CHAINed identifier. */
905 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
906 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
908 /* In an aggregate type, indicates that the scalar fields of the type are
909 stored in reverse order from the target order. This effectively
910 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
911 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
912 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
914 /* In a non-aggregate type, indicates a saturating type. */
915 #define TYPE_SATURATING(NODE) \
916 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
918 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
919 of bits stored in reverse order from the target order. This effectively
920 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
922 The overall strategy is to preserve the invariant that every scalar in
923 memory is associated with a single storage order, i.e. all accesses to
924 this scalar are done with the same storage order. This invariant makes
925 it possible to factor out the storage order in most transformations, as
926 only the address and/or the value (in target order) matter for them.
927 But, of course, the storage order must be preserved when the accesses
928 themselves are rewritten or transformed. */
929 #define REF_REVERSE_STORAGE_ORDER(NODE) \
930 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
932 /* These flags are available for each language front end to use internally. */
933 #define TREE_LANG_FLAG_0(NODE) \
934 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
935 #define TREE_LANG_FLAG_1(NODE) \
936 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
937 #define TREE_LANG_FLAG_2(NODE) \
938 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
939 #define TREE_LANG_FLAG_3(NODE) \
940 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
941 #define TREE_LANG_FLAG_4(NODE) \
942 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
943 #define TREE_LANG_FLAG_5(NODE) \
944 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
945 #define TREE_LANG_FLAG_6(NODE) \
946 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
948 /* Define additional fields and accessors for nodes representing constants. */
950 #define TREE_INT_CST_NUNITS(NODE) \
951 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
952 #define TREE_INT_CST_EXT_NUNITS(NODE) \
953 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
954 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
955 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
956 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
957 #define TREE_INT_CST_LOW(NODE) \
958 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
960 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
961 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
963 #define TREE_FIXED_CST_PTR(NODE) \
964 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
965 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
967 /* In a STRING_CST */
968 /* In C terms, this is sizeof, not strlen. */
969 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
970 #define TREE_STRING_POINTER(NODE) \
971 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
973 /* In a COMPLEX_CST node. */
974 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
975 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
977 /* In a VECTOR_CST node. */
978 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
979 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
980 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
982 /* Define fields and accessors for some special-purpose tree nodes. */
984 #define IDENTIFIER_LENGTH(NODE) \
985 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
986 #define IDENTIFIER_POINTER(NODE) \
987 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
988 #define IDENTIFIER_HASH_VALUE(NODE) \
989 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
991 /* Translate a hash table identifier pointer to a tree_identifier
992 pointer, and vice versa. */
994 #define HT_IDENT_TO_GCC_IDENT(NODE) \
995 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
996 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
998 /* In a TREE_LIST node. */
999 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1000 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1002 /* In a TREE_VEC node. */
1003 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1004 #define TREE_VEC_END(NODE) \
1005 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1007 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1009 /* In a CONSTRUCTOR node. */
1010 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1011 #define CONSTRUCTOR_ELT(NODE,IDX) \
1012 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1013 #define CONSTRUCTOR_NELTS(NODE) \
1014 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1015 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1016 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1018 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1019 value of each element (stored within VAL). IX must be a scratch variable
1020 of unsigned integer type. */
1021 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1022 for (IX = 0; (IX >= vec_safe_length (V)) \
1024 : ((VAL = (*(V))[IX].value), \
1028 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1029 the value of each element (stored within VAL) and its index (stored
1030 within INDEX). IX must be a scratch variable of unsigned integer type. */
1031 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1032 for (IX = 0; (IX >= vec_safe_length (V)) \
1034 : (((void) (VAL = (*V)[IX].value)), \
1035 (INDEX = (*V)[IX].index), \
1039 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1040 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1042 constructor_elt _ce___ = {INDEX, VALUE}; \
1043 vec_safe_push ((V), _ce___); \
1046 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1047 constructor output purposes. */
1048 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1049 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1051 /* True if NODE is a clobber right hand side, an expression of indeterminate
1052 value that clobbers the LHS in a copy instruction. We use a volatile
1053 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1054 In particular the volatile flag causes us to not prematurely remove
1055 such clobber instructions. */
1056 #define TREE_CLOBBER_P(NODE) \
1057 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1059 /* Define fields and accessors for some nodes that represent expressions. */
1061 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1062 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1063 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1064 && integer_zerop (TREE_OPERAND (NODE, 0)))
1066 /* In ordinary expression nodes. */
1067 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1068 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1070 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1071 length. Its value includes the length operand itself; that is,
1072 the minimum valid length is 1.
1073 Note that we have to bypass the use of TREE_OPERAND to access
1074 that field to avoid infinite recursion in expanding the macros. */
1075 #define VL_EXP_OPERAND_LENGTH(NODE) \
1076 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1078 /* Nonzero if is_gimple_debug() may possibly hold. */
1079 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1081 /* In a LOOP_EXPR node. */
1082 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1084 /* The source location of this expression. Non-tree_exp nodes such as
1085 decls and constants can be shared among multiple locations, so
1087 #define EXPR_LOCATION(NODE) \
1088 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1089 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1090 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1091 != UNKNOWN_LOCATION)
1092 /* The location to be used in a diagnostic about this expression. Do not
1093 use this macro if the location will be assigned to other expressions. */
1094 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1095 ? (NODE)->exp.locus : (LOCUS))
1096 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1097 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1099 /* True if a tree is an expression or statement that can have a
1101 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1103 extern void protected_set_expr_location (tree
, location_t
);
1105 /* In a TARGET_EXPR node. */
1106 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1107 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1108 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1110 /* DECL_EXPR accessor. This gives access to the DECL associated with
1111 the given declaration statement. */
1112 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1114 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1116 /* COMPOUND_LITERAL_EXPR accessors. */
1117 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1118 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1119 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1120 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1122 /* SWITCH_EXPR accessors. These give access to the condition, body and
1123 original condition type (before any compiler conversions)
1124 of the switch statement, respectively. */
1125 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1126 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1127 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1129 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1130 of a case label, respectively. */
1131 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1132 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1133 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1134 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1136 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1137 corresponding MEM_REF operands. */
1138 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1139 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1140 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1141 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1142 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1144 #define MR_DEPENDENCE_CLIQUE(NODE) \
1145 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1146 #define MR_DEPENDENCE_BASE(NODE) \
1147 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1149 /* The operands of a BIND_EXPR. */
1150 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1151 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1152 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1154 /* GOTO_EXPR accessor. This gives access to the label associated with
1155 a goto statement. */
1156 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1158 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1159 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1160 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1162 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1163 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1164 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1165 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1166 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1167 /* Nonzero if we want to create an ASM_INPUT instead of an
1168 ASM_OPERAND with no operands. */
1169 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1170 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1172 /* COND_EXPR accessors. */
1173 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1174 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1175 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1177 /* Accessors for the chains of recurrences. */
1178 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1179 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1180 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1181 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1183 /* LABEL_EXPR accessor. This gives access to the label associated with
1184 the given label expression. */
1185 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1187 /* CATCH_EXPR accessors. */
1188 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1189 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1191 /* EH_FILTER_EXPR accessors. */
1192 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1193 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1195 /* OBJ_TYPE_REF accessors. */
1196 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1197 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1198 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1200 /* ASSERT_EXPR accessors. */
1201 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1202 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1204 /* CALL_EXPR accessors. */
1205 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1206 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1207 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1208 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1209 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1211 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1212 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1213 the argument count is zero when checking is enabled. Instead, do
1214 the pointer arithmetic to advance past the 3 fixed operands in a
1215 CALL_EXPR. That produces a valid pointer to just past the end of the
1216 operand array, even if it's not valid to dereference it. */
1217 #define CALL_EXPR_ARGP(NODE) \
1218 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1220 /* TM directives and accessors. */
1221 #define TRANSACTION_EXPR_BODY(NODE) \
1222 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1223 #define TRANSACTION_EXPR_OUTER(NODE) \
1224 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1225 #define TRANSACTION_EXPR_RELAXED(NODE) \
1226 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1228 /* OpenMP and OpenACC directive and clause accessors. */
1230 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1232 #define OMP_BODY(NODE) \
1233 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1234 #define OMP_CLAUSES(NODE) \
1235 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1237 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1238 #define OMP_STANDALONE_CLAUSES(NODE) \
1239 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1241 #define OACC_DATA_BODY(NODE) \
1242 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1243 #define OACC_DATA_CLAUSES(NODE) \
1244 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1246 #define OACC_HOST_DATA_BODY(NODE) \
1247 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1248 #define OACC_HOST_DATA_CLAUSES(NODE) \
1249 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1251 #define OACC_CACHE_CLAUSES(NODE) \
1252 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1254 #define OACC_DECLARE_CLAUSES(NODE) \
1255 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1257 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1258 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1260 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1261 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1263 #define OACC_UPDATE_CLAUSES(NODE) \
1264 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1266 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1267 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1269 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1270 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1272 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1273 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1274 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1276 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1277 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1278 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1279 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1280 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1281 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1282 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1283 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1285 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1286 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1288 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1290 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1291 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1293 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1295 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1297 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1298 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1300 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1301 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1302 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1304 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1305 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1307 #define OMP_TARGET_DATA_BODY(NODE) \
1308 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1309 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1310 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1312 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1313 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1315 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1316 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1318 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1319 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1321 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1322 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1324 #define OMP_CLAUSE_SIZE(NODE) \
1325 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1327 OMP_CLAUSE__CACHE_), 1)
1329 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1330 #define OMP_CLAUSE_DECL(NODE) \
1331 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1332 OMP_CLAUSE_PRIVATE, \
1333 OMP_CLAUSE__LOOPTEMP_), 0)
1334 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1335 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1336 != UNKNOWN_LOCATION)
1337 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1339 /* True on an OMP_SECTION statement that was the last lexical member.
1340 This status is meaningful in the implementation of lastprivate. */
1341 #define OMP_SECTION_LAST(NODE) \
1342 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1344 /* True on an OMP_PARALLEL statement if it represents an explicit
1345 combined parallel work-sharing constructs. */
1346 #define OMP_PARALLEL_COMBINED(NODE) \
1347 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1349 /* True on an OMP_TEAMS statement if it represents an explicit
1350 combined teams distribute constructs. */
1351 #define OMP_TEAMS_COMBINED(NODE) \
1352 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1354 /* True on an OMP_TARGET statement if it represents explicit
1355 combined target teams, target parallel or target simd constructs. */
1356 #define OMP_TARGET_COMBINED(NODE) \
1357 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1359 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1360 as opposed to relaxed. */
1361 #define OMP_ATOMIC_SEQ_CST(NODE) \
1362 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1363 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1365 /* True on a PRIVATE clause if its decl is kept around for debugging
1366 information only and its DECL_VALUE_EXPR is supposed to point
1367 to what it has been remapped to. */
1368 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1369 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1371 /* True on a PRIVATE clause if ctor needs access to outer region's
1373 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1374 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1376 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1377 (thus should be private on the outer taskloop and firstprivate on
1379 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1380 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1382 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1383 decl is present in the chain. */
1384 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1385 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1386 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1387 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1388 OMP_CLAUSE_LASTPRIVATE),\
1390 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1391 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1393 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1394 (thus should be lastprivate on the outer taskloop and firstprivate on
1396 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1397 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1399 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1400 decl is present in the chain (this can happen only for taskloop
1401 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1402 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1403 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1405 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1406 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1408 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1409 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1410 #define OMP_CLAUSE_IF_EXPR(NODE) \
1411 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1412 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1413 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1414 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1415 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1416 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1417 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1418 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1419 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1421 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1422 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1424 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1425 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1427 /* OpenACC clause expressions */
1428 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1429 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1430 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1431 OMP_CLAUSE_OPERAND ( \
1432 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1433 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1434 OMP_CLAUSE_OPERAND ( \
1435 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1436 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1437 OMP_CLAUSE_OPERAND ( \
1438 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1439 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1440 OMP_CLAUSE_OPERAND ( \
1441 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1442 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1443 OMP_CLAUSE_OPERAND ( \
1444 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1445 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1446 OMP_CLAUSE_OPERAND ( \
1447 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1448 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1449 OMP_CLAUSE_OPERAND ( \
1450 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1451 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1452 OMP_CLAUSE_OPERAND ( \
1453 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1454 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1455 OMP_CLAUSE_OPERAND ( \
1456 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1458 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1459 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1461 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1462 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1464 #define OMP_CLAUSE_MAP_KIND(NODE) \
1465 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1466 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1467 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1468 = (unsigned int) (MAP_KIND))
1470 /* Nonzero if this map clause is for array (rather than pointer) based array
1471 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1472 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1473 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1474 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1475 /* Nonzero if this is a mapped array section, that might need special
1476 treatment if OMP_CLAUSE_SIZE is zero. */
1477 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1478 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1480 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1481 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1483 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1484 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1485 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1486 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1487 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1488 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1490 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1491 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1493 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1494 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1495 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1496 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1497 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1498 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1499 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1500 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1501 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1502 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1503 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1504 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1505 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1506 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1508 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1509 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1510 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1511 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1513 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1514 are always initialized inside of the loop construct, false otherwise. */
1515 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1516 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1518 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1519 are declared inside of the simd construct. */
1520 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1521 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1523 /* True if a LINEAR clause has a stride that is variable. */
1524 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1525 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1527 /* True if a LINEAR clause is for an array or allocatable variable that
1528 needs special handling by the frontend. */
1529 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1530 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1532 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1533 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1535 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1536 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1538 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1539 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1541 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1542 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1544 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1545 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1547 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1548 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1550 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1551 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1552 OMP_CLAUSE_THREAD_LIMIT), 0)
1554 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1555 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1557 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1558 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1559 OMP_CLAUSE_DIST_SCHEDULE), 0)
1561 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1562 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1564 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1565 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1567 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1568 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1570 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1571 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1573 /* True if a SCHEDULE clause has the simd modifier on it. */
1574 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1575 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1577 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1578 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1580 #define OMP_CLAUSE_TILE_LIST(NODE) \
1581 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1583 /* SSA_NAME accessors. */
1585 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1586 if there is no name associated with it. */
1587 #define SSA_NAME_IDENTIFIER(NODE) \
1588 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1589 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1590 ? (NODE)->ssa_name.var \
1591 : DECL_NAME ((NODE)->ssa_name.var)) \
1594 /* Returns the variable being referenced. This can be NULL_TREE for
1595 temporaries not associated with any user variable.
1596 Once released, this is the only field that can be relied upon. */
1597 #define SSA_NAME_VAR(NODE) \
1598 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1599 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1600 ? NULL_TREE : (NODE)->ssa_name.var)
1602 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1603 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1605 /* Returns the statement which defines this SSA name. */
1606 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1608 /* Returns the SSA version number of this SSA name. Note that in
1609 tree SSA, version numbers are not per variable and may be recycled. */
1610 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1612 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1613 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1615 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1616 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1618 /* Nonzero if this SSA_NAME expression is currently on the free list of
1619 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1620 has no meaning for an SSA_NAME. */
1621 #define SSA_NAME_IN_FREE_LIST(NODE) \
1622 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1624 /* Nonzero if this SSA_NAME is the default definition for the
1625 underlying symbol. A default SSA name is created for symbol S if
1626 the very first reference to S in the function is a read operation.
1627 Default definitions are always created by an empty statement and
1628 belong to no basic block. */
1629 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1630 SSA_NAME_CHECK (NODE)->base.default_def_flag
1632 /* Attributes for SSA_NAMEs for pointer-type variables. */
1633 #define SSA_NAME_PTR_INFO(N) \
1634 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1636 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1637 #define SSA_NAME_ANTI_RANGE_P(N) \
1638 SSA_NAME_CHECK (N)->base.static_flag
1640 /* The type of range described by SSA_NAME_RANGE_INFO. */
1641 #define SSA_NAME_RANGE_TYPE(N) \
1642 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1644 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1645 #define SSA_NAME_RANGE_INFO(N) \
1646 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1648 /* Return the immediate_use information for an SSA_NAME. */
1649 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1651 #define OMP_CLAUSE_CODE(NODE) \
1652 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1654 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1655 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1657 #define OMP_CLAUSE_OPERAND(NODE, I) \
1658 OMP_CLAUSE_ELT_CHECK (NODE, I)
1660 /* In a BLOCK node. */
1661 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1662 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1663 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1664 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1665 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1666 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1667 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1668 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1669 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1670 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1671 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1672 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1674 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1675 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1677 /* An index number for this block. These values are not guaranteed to
1678 be unique across functions -- whether or not they are depends on
1679 the debugging output format in use. */
1680 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1682 /* If block reordering splits a lexical block into discontiguous
1683 address ranges, we'll make a copy of the original block.
1685 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1686 In that case, we have one source block that has been replicated
1687 (through inlining or unrolling) into many logical blocks, and that
1688 these logical blocks have different physical variables in them.
1690 In this case, we have one logical block split into several
1691 non-contiguous address ranges. Most debug formats can't actually
1692 represent this idea directly, so we fake it by creating multiple
1693 logical blocks with the same variables in them. However, for those
1694 that do support non-contiguous regions, these allow the original
1695 logical block to be reconstructed, along with the set of address
1698 One of the logical block fragments is arbitrarily chosen to be
1699 the ORIGIN. The other fragments will point to the origin via
1700 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1701 be null. The list of fragments will be chained through
1702 BLOCK_FRAGMENT_CHAIN from the origin. */
1704 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1705 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1707 /* For an inlined function, this gives the location where it was called
1708 from. This is only set in the top level block, which corresponds to the
1709 inlined function scope. This is used in the debug output routines. */
1711 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1713 /* This gives the location of the end of the block, useful to attach
1714 code implicitly generated for outgoing paths. */
1716 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1718 /* Define fields and accessors for nodes representing data types. */
1720 /* See tree.def for documentation of the use of these fields.
1721 Look at the documentation of the various ..._TYPE tree codes.
1723 Note that the type.values, type.minval, and type.maxval fields are
1724 overloaded and used for different macros in different kinds of types.
1725 Each macro must check to ensure the tree node is of the proper kind of
1726 type. Note also that some of the front-ends also overload these fields,
1727 so they must be checked as well. */
1729 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1730 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1731 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1732 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1733 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1734 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1735 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1736 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1737 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1738 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1740 #define TYPE_MODE(NODE) \
1741 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1742 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1743 #define SET_TYPE_MODE(NODE, MODE) \
1744 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1746 extern machine_mode
element_mode (const_tree t
);
1748 /* The "canonical" type for this type node, which is used by frontends to
1749 compare the type for equality with another type. If two types are
1750 equal (based on the semantics of the language), then they will have
1751 equivalent TYPE_CANONICAL entries.
1753 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1754 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1755 be used for comparison against other types. Instead, the type is
1756 said to require structural equality checks, described in
1757 TYPE_STRUCTURAL_EQUALITY_P.
1759 For unqualified aggregate and function types the middle-end relies on
1760 TYPE_CANONICAL to tell whether two variables can be assigned
1761 to each other without a conversion. The middle-end also makes sure
1762 to assign the same alias-sets to the type partition with equal
1763 TYPE_CANONICAL of their unqualified variants. */
1764 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1765 /* Indicates that the type node requires structural equality
1766 checks. The compiler will need to look at the composition of the
1767 type to determine whether it is equal to another type, rather than
1768 just comparing canonical type pointers. For instance, we would need
1769 to look at the return and parameter types of a FUNCTION_TYPE
1771 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1772 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1773 type node requires structural equality. */
1774 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1776 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1777 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1779 /* The (language-specific) typed-based alias set for this type.
1780 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1781 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1782 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1783 type can alias objects of any type. */
1784 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1786 /* Nonzero iff the typed-based alias set for this type has been
1788 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1789 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1791 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1793 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1795 /* The alignment necessary for objects of this type.
1796 The value is an int, measured in bits. */
1797 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1799 /* 1 if the alignment for this type was requested by "aligned" attribute,
1800 0 if it is the default for this type. */
1801 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1803 /* The alignment for NODE, in bytes. */
1804 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1806 /* If your language allows you to declare types, and you want debug info
1807 for them, then you need to generate corresponding TYPE_DECL nodes.
1808 These "stub" TYPE_DECL nodes have no name, and simply point at the
1809 type node. You then set the TYPE_STUB_DECL field of the type node
1810 to point back at the TYPE_DECL node. This allows the debug routines
1811 to know that the two nodes represent the same type, so that we only
1812 get one debug info record for them. */
1813 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1815 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1816 the type has BLKmode only because it lacks the alignment required for
1818 #define TYPE_NO_FORCE_BLK(NODE) \
1819 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1821 /* Nonzero in a type considered volatile as a whole. */
1822 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1824 /* Nonzero in a type considered atomic as a whole. */
1825 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1827 /* Means this type is const-qualified. */
1828 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1830 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1832 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1834 /* If nonzero, type's name shouldn't be emitted into debug info. */
1835 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1837 /* The address space the type is in. */
1838 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1840 /* Encode/decode the named memory support as part of the qualifier. If more
1841 than 8 qualifiers are added, these macros need to be adjusted. */
1842 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1843 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1845 /* Return all qualifiers except for the address space qualifiers. */
1846 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1848 /* Only keep the address space out of the qualifiers and discard the other
1850 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1852 /* The set of type qualifiers for this type. */
1853 #define TYPE_QUALS(NODE) \
1854 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1855 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1856 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1857 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1858 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1860 /* The same as TYPE_QUALS without the address space qualifications. */
1861 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1862 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1863 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1864 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1865 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1867 /* The same as TYPE_QUALS without the address space and atomic
1869 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1870 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1871 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1872 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1874 /* These flags are available for each language front end to use internally. */
1875 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1876 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1877 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1878 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1879 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1880 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1881 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1883 /* Used to keep track of visited nodes in tree traversals. This is set to
1884 0 by copy_node and make_node. */
1885 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1887 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1888 that distinguish string from array of char).
1889 If set in a INTEGER_TYPE, indicates a character type. */
1890 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1892 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1893 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1894 (((unsigned HOST_WIDE_INT) 1) \
1895 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1897 /* Set precision to n when we have 2^n sub-parts of the vector. */
1898 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1899 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1901 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1902 about missing conversions to other vector types of the same size. */
1903 #define TYPE_VECTOR_OPAQUE(NODE) \
1904 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1906 /* Indicates that objects of this type must be initialized by calling a
1907 function when they are created. */
1908 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1909 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1911 /* Indicates that a UNION_TYPE object should be passed the same way that
1912 the first union alternative would be passed, or that a RECORD_TYPE
1913 object should be passed the same way that the first (and only) member
1915 #define TYPE_TRANSPARENT_AGGR(NODE) \
1916 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1918 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1919 address of a component of the type. This is the counterpart of
1920 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1921 #define TYPE_NONALIASED_COMPONENT(NODE) \
1922 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1924 /* Indicated that objects of this type should be laid out in as
1925 compact a way as possible. */
1926 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1928 /* Used by type_contains_placeholder_p to avoid recomputation.
1929 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1930 this field directly. */
1931 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1932 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1934 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1935 #define TYPE_FINAL_P(NODE) \
1936 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1938 /* The debug output functions use the symtab union field to store
1939 information specific to the debugging format. The different debug
1940 output hooks store different types in the union field. These three
1941 macros are used to access different fields in the union. The debug
1942 hooks are responsible for consistently using only a specific
1945 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1946 hold the type's number in the generated stabs. */
1947 #define TYPE_SYMTAB_ADDRESS(NODE) \
1948 (TYPE_CHECK (NODE)->type_common.symtab.address)
1950 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1951 hold struct/union type tag names. */
1952 #define TYPE_SYMTAB_POINTER(NODE) \
1953 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1955 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1956 in dwarf2out.c to point to the DIE generated for the type. */
1957 #define TYPE_SYMTAB_DIE(NODE) \
1958 (TYPE_CHECK (NODE)->type_common.symtab.die)
1960 /* The garbage collector needs to know the interpretation of the
1961 symtab field. These constants represent the different types in the
1964 #define TYPE_SYMTAB_IS_ADDRESS (0)
1965 #define TYPE_SYMTAB_IS_POINTER (1)
1966 #define TYPE_SYMTAB_IS_DIE (2)
1968 #define TYPE_LANG_SPECIFIC(NODE) \
1969 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1971 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1972 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1973 #define TYPE_FIELDS(NODE) \
1974 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1975 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1976 #define TYPE_ARG_TYPES(NODE) \
1977 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1978 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1980 #define TYPE_METHODS(NODE) \
1981 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1982 #define TYPE_VFIELD(NODE) \
1983 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1984 #define TYPE_METHOD_BASETYPE(NODE) \
1985 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1986 #define TYPE_OFFSET_BASETYPE(NODE) \
1987 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1988 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1989 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1990 #define TYPE_NEXT_PTR_TO(NODE) \
1991 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1992 #define TYPE_NEXT_REF_TO(NODE) \
1993 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1994 #define TYPE_MIN_VALUE(NODE) \
1995 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1996 #define TYPE_MAX_VALUE(NODE) \
1997 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1999 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2000 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2002 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2003 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2005 /* For record and union types, information about this type, as a base type
2007 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2009 /* For non record and union types, used in a language-dependent way. */
2010 #define TYPE_LANG_SLOT_1(NODE) \
2011 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2013 /* Define accessor macros for information about type inheritance
2016 A "basetype" means a particular usage of a data type for inheritance
2017 in another type. Each such basetype usage has its own "binfo"
2018 object to describe it. The binfo object is a TREE_VEC node.
2020 Inheritance is represented by the binfo nodes allocated for a
2021 given type. For example, given types C and D, such that D is
2022 inherited by C, 3 binfo nodes will be allocated: one for describing
2023 the binfo properties of C, similarly one for D, and one for
2024 describing the binfo properties of D as a base type for C.
2025 Thus, given a pointer to class C, one can get a pointer to the binfo
2026 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2028 /* BINFO specific flags. */
2030 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2031 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2033 /* Flags for language dependent use. */
2034 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2035 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2036 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2037 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2038 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2039 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2040 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2042 /* The actual data type node being inherited in this basetype. */
2043 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2045 /* The offset where this basetype appears in its containing type.
2046 BINFO_OFFSET slot holds the offset (in bytes)
2047 from the base of the complete object to the base of the part of the
2048 object that is allocated on behalf of this `type'.
2049 This is always 0 except when there is multiple inheritance. */
2051 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2052 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2054 /* The virtual function table belonging to this basetype. Virtual
2055 function tables provide a mechanism for run-time method dispatching.
2056 The entries of a virtual function table are language-dependent. */
2058 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2060 /* The virtual functions in the virtual function table. This is
2061 a TREE_LIST that is used as an initial approximation for building
2062 a virtual function table for this basetype. */
2063 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2065 /* A vector of binfos for the direct basetypes inherited by this
2068 If this basetype describes type D as inherited in C, and if the
2069 basetypes of D are E and F, then this vector contains binfos for
2070 inheritance of E and F by C. */
2071 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2073 /* The number of basetypes for NODE. */
2074 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2076 /* Accessor macro to get to the Nth base binfo of this binfo. */
2077 #define BINFO_BASE_BINFO(NODE,N) \
2078 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2079 #define BINFO_BASE_ITERATE(NODE,N,B) \
2080 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2081 #define BINFO_BASE_APPEND(NODE,T) \
2082 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2084 /* For a BINFO record describing a virtual base class, i.e., one where
2085 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2086 base. The actual contents are language-dependent. In the C++
2087 front-end this field is an INTEGER_CST giving an offset into the
2088 vtable where the offset to the virtual base can be found. */
2089 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2091 /* Indicates the accesses this binfo has to its bases. The values are
2092 access_public_node, access_protected_node or access_private_node.
2093 If this array is not present, public access is implied. */
2094 #define BINFO_BASE_ACCESSES(NODE) \
2095 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2097 #define BINFO_BASE_ACCESS(NODE,N) \
2098 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2099 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2100 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2102 /* The index in the VTT where this subobject's sub-VTT can be found.
2103 NULL_TREE if there is no sub-VTT. */
2104 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2106 /* The index in the VTT where the vptr for this subobject can be
2107 found. NULL_TREE if there is no secondary vptr in the VTT. */
2108 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2110 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2111 inheriting this base for non-virtual bases. For virtual bases it
2112 points either to the binfo for which this is a primary binfo, or to
2113 the binfo of the most derived type. */
2114 #define BINFO_INHERITANCE_CHAIN(NODE) \
2115 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2118 /* Define fields and accessors for nodes representing declared names. */
2120 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2121 have an associated SSA name. */
2122 #define SSA_VAR_P(DECL) \
2123 (TREE_CODE (DECL) == VAR_DECL \
2124 || TREE_CODE (DECL) == PARM_DECL \
2125 || TREE_CODE (DECL) == RESULT_DECL \
2126 || TREE_CODE (DECL) == SSA_NAME)
2129 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2131 /* This is the name of the object as written by the user.
2132 It is an IDENTIFIER_NODE. */
2133 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2135 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2136 #define TYPE_IDENTIFIER(NODE) \
2137 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2138 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2140 /* Every ..._DECL node gets a unique number. */
2141 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2143 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2145 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2147 /* Every ..._DECL node gets a unique number that stays the same even
2148 when the decl is copied by the inliner once it is set. */
2149 #define DECL_PT_UID(NODE) \
2150 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2151 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2152 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2153 #define SET_DECL_PT_UID(NODE, UID) \
2154 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2155 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2156 be preserved when copyin the decl. */
2157 #define DECL_PT_UID_SET_P(NODE) \
2158 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2160 /* These two fields describe where in the source code the declaration
2161 was. If the declaration appears in several places (as for a C
2162 function that is declared first and then defined later), this
2163 information should refer to the definition. */
2164 #define DECL_SOURCE_LOCATION(NODE) \
2165 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2166 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2167 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2168 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2169 /* This accessor returns TRUE if the decl it operates on was created
2170 by a front-end or back-end rather than by user code. In this case
2171 builtin-ness is indicated by source location. */
2172 #define DECL_IS_BUILTIN(DECL) \
2173 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2175 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2176 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2177 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2178 nodes, this points to either the FUNCTION_DECL for the containing
2179 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2180 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2181 scope". In particular, for VAR_DECLs which are virtual table pointers
2182 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2184 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2185 #define DECL_FIELD_CONTEXT(NODE) \
2186 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2188 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2189 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2191 /* For any sort of a ..._DECL node, this points to the original (abstract)
2192 decl node which this decl is an inlined/cloned instance of, or else it
2193 is NULL indicating that this decl is not an instance of some other decl.
2195 The C front-end also uses this in a nested declaration of an inline
2196 function, to point back to the definition. */
2197 #define DECL_ABSTRACT_ORIGIN(NODE) \
2198 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2200 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2201 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2202 #define DECL_ORIGIN(NODE) \
2203 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2205 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2206 inline instance of some original (abstract) decl from an inline function;
2207 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2208 nodes can also have their abstract origin set to themselves. */
2209 #define DECL_FROM_INLINE(NODE) \
2210 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2211 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2213 /* In a DECL this is the field where attributes are stored. */
2214 #define DECL_ATTRIBUTES(NODE) \
2215 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2217 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2218 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2219 For a VAR_DECL, holds the initial value.
2220 For a PARM_DECL, used for DECL_ARG_TYPE--default
2221 values for parameters are encoded in the type of the function,
2222 not in the PARM_DECL slot.
2223 For a FIELD_DECL, this is used for enumeration values and the C
2224 frontend uses it for temporarily storing bitwidth of bitfields.
2226 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2227 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2229 /* Holds the size of the datum, in bits, as a tree expression.
2230 Need not be constant. */
2231 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2232 /* Likewise for the size in bytes. */
2233 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2234 /* Holds the alignment required for the datum, in bits. */
2235 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2236 /* The alignment of NODE, in bytes. */
2237 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2238 /* Set if the alignment of this DECL has been set by the user, for
2239 example with an 'aligned' attribute. */
2240 #define DECL_USER_ALIGN(NODE) \
2241 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2242 /* Holds the machine mode corresponding to the declaration of a variable or
2243 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2245 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2247 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2248 operation it is. Note, however, that this field is overloaded, with
2249 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2250 checked before any access to the former. */
2251 #define DECL_FUNCTION_CODE(NODE) \
2252 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2254 #define DECL_FUNCTION_PERSONALITY(NODE) \
2255 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2257 /* Nonzero for a given ..._DECL node means that the name of this node should
2258 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2259 the associated type should be ignored. For a FUNCTION_DECL, the body of
2260 the function should also be ignored. */
2261 #define DECL_IGNORED_P(NODE) \
2262 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2264 /* Nonzero for a given ..._DECL node means that this node represents an
2265 "abstract instance" of the given declaration (e.g. in the original
2266 declaration of an inline function). When generating symbolic debugging
2267 information, we mustn't try to generate any address information for nodes
2268 marked as "abstract instances" because we don't actually generate
2269 any code or allocate any data space for such instances. */
2270 #define DECL_ABSTRACT_P(NODE) \
2271 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2273 /* Language-specific decl information. */
2274 #define DECL_LANG_SPECIFIC(NODE) \
2275 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2277 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2278 do not allocate storage, and refer to a definition elsewhere. Note that
2279 this does not necessarily imply the entity represented by NODE
2280 has no program source-level definition in this translation unit. For
2281 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2282 DECL_EXTERNAL may be true simultaneously; that can be the case for
2283 a C99 "extern inline" function. */
2284 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2286 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2287 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2289 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2291 Also set in some languages for variables, etc., outside the normal
2292 lexical scope, such as class instance variables. */
2293 #define DECL_NONLOCAL(NODE) \
2294 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2296 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2297 Used in FIELD_DECLs for vtable pointers.
2298 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2299 #define DECL_VIRTUAL_P(NODE) \
2300 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2302 /* Used to indicate that this DECL represents a compiler-generated entity. */
2303 #define DECL_ARTIFICIAL(NODE) \
2304 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2306 /* Additional flags for language-specific uses. */
2307 #define DECL_LANG_FLAG_0(NODE) \
2308 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2309 #define DECL_LANG_FLAG_1(NODE) \
2310 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2311 #define DECL_LANG_FLAG_2(NODE) \
2312 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2313 #define DECL_LANG_FLAG_3(NODE) \
2314 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2315 #define DECL_LANG_FLAG_4(NODE) \
2316 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2317 #define DECL_LANG_FLAG_5(NODE) \
2318 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2319 #define DECL_LANG_FLAG_6(NODE) \
2320 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2321 #define DECL_LANG_FLAG_7(NODE) \
2322 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2323 #define DECL_LANG_FLAG_8(NODE) \
2324 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2326 /* Nonzero for a scope which is equal to file scope. */
2327 #define SCOPE_FILE_SCOPE_P(EXP) \
2328 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2329 /* Nonzero for a decl which is at file scope. */
2330 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2331 /* Nonzero for a type which is at file scope. */
2332 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2334 /* Nonzero for a decl that is decorated using attribute used.
2335 This indicates to compiler tools that this decl needs to be preserved. */
2336 #define DECL_PRESERVE_P(DECL) \
2337 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2339 /* For function local variables of COMPLEX and VECTOR types,
2340 indicates that the variable is not aliased, and that all
2341 modifications to the variable have been adjusted so that
2342 they are killing assignments. Thus the variable may now
2343 be treated as a GIMPLE register, and use real instead of
2344 virtual ops in SSA form. */
2345 #define DECL_GIMPLE_REG_P(DECL) \
2346 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2348 extern tree
decl_value_expr_lookup (tree
);
2349 extern void decl_value_expr_insert (tree
, tree
);
2351 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2352 if transformations have made this more complicated than evaluating the
2353 decl itself. This should only be used for debugging; once this field has
2354 been set, the decl itself may not legitimately appear in the function. */
2355 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2356 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2357 ->decl_common.decl_flag_2)
2358 #define DECL_VALUE_EXPR(NODE) \
2359 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2360 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2361 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2363 /* Holds the RTL expression for the value of a variable or function.
2364 This value can be evaluated lazily for functions, variables with
2365 static storage duration, and labels. */
2366 #define DECL_RTL(NODE) \
2367 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2368 ? (NODE)->decl_with_rtl.rtl \
2369 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2371 /* Set the DECL_RTL for NODE to RTL. */
2372 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2374 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2375 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2377 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2378 #define DECL_RTL_SET_P(NODE) \
2379 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2381 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2382 NODE1, it will not be set for NODE2; this is a lazy copy. */
2383 #define COPY_DECL_RTL(NODE1, NODE2) \
2384 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2385 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2387 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2388 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2390 #if (GCC_VERSION >= 2007)
2391 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2392 ({ tree const __d = (decl); \
2393 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2394 /* Dereference it so the compiler knows it can't be NULL even \
2395 without assertion checking. */ \
2396 &*DECL_RTL_IF_SET (__d); })
2398 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2401 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2402 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2404 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2405 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2406 of the structure. */
2407 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2409 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2410 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2411 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2412 natural alignment of the field's type). */
2413 #define DECL_FIELD_BIT_OFFSET(NODE) \
2414 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2416 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2417 if so, the type that was originally specified for it.
2418 TREE_TYPE may have been modified (in finish_struct). */
2419 #define DECL_BIT_FIELD_TYPE(NODE) \
2420 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2422 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2423 representative FIELD_DECL. */
2424 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2425 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2427 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2428 if nonzero, indicates that the field occupies the type. */
2429 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2431 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2432 DECL_FIELD_OFFSET which are known to be always zero.
2433 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2435 #define DECL_OFFSET_ALIGN(NODE) \
2436 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2438 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2439 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2440 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2442 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2443 which this FIELD_DECL is defined. This information is needed when
2444 writing debugging information about vfield and vbase decls for C++. */
2445 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2447 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2448 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2450 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2452 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2454 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2455 this component. This makes it possible for Type-Based Alias Analysis
2456 to disambiguate accesses to this field with indirect accesses using
2459 struct S { int i; } s;
2462 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2464 From the implementation's viewpoint, the alias set of the type of the
2465 field 'i' (int) will not be recorded as a subset of that of the type of
2466 's' (struct S) in record_component_aliases. The counterpart is that
2467 accesses to s.i must not be given the alias set of the type of 'i'
2468 (int) but instead directly that of the type of 's' (struct S). */
2469 #define DECL_NONADDRESSABLE_P(NODE) \
2470 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2472 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2473 dense, unique within any one function, and may be used to index arrays.
2474 If the value is -1, then no UID has been assigned. */
2475 #define LABEL_DECL_UID(NODE) \
2476 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2478 /* In a LABEL_DECL, the EH region number for which the label is the
2479 post_landing_pad. */
2480 #define EH_LANDING_PAD_NR(NODE) \
2481 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2483 /* For a PARM_DECL, records the data type used to pass the argument,
2484 which may be different from the type seen in the program. */
2485 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2487 /* For PARM_DECL, holds an RTL for the stack slot or register
2488 where the data was actually passed. */
2489 #define DECL_INCOMING_RTL(NODE) \
2490 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2492 /* Nonzero for a given ..._DECL node means that no warnings should be
2493 generated just because this node is unused. */
2494 #define DECL_IN_SYSTEM_HEADER(NODE) \
2495 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2497 /* Used to indicate that the linkage status of this DECL is not yet known,
2498 so it should not be output now. */
2499 #define DECL_DEFER_OUTPUT(NODE) \
2500 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2502 /* In a VAR_DECL that's static,
2503 nonzero if the space is in the text section. */
2504 #define DECL_IN_TEXT_SECTION(NODE) \
2505 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2507 /* In a VAR_DECL that's static,
2508 nonzero if it belongs to the global constant pool. */
2509 #define DECL_IN_CONSTANT_POOL(NODE) \
2510 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2512 /* Nonzero for a given ..._DECL node means that this node should be
2513 put in .common, if possible. If a DECL_INITIAL is given, and it
2514 is not error_mark_node, then the decl cannot be put in .common. */
2515 #define DECL_COMMON(NODE) \
2516 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2518 /* In a VAR_DECL, nonzero if the decl is a register variable with
2519 an explicit asm specification. */
2520 #define DECL_HARD_REGISTER(NODE) \
2521 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2523 /* Used to indicate that this DECL has weak linkage. */
2524 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2526 /* Used to indicate that the DECL is a dllimport. */
2527 #define DECL_DLLIMPORT_P(NODE) \
2528 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2530 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2531 not be put out unless it is needed in this translation unit.
2532 Entities like this are shared across translation units (like weak
2533 entities), but are guaranteed to be generated by any translation
2534 unit that needs them, and therefore need not be put out anywhere
2535 where they are not needed. DECL_COMDAT is just a hint to the
2536 back-end; it is up to front-ends which set this flag to ensure
2537 that there will never be any harm, other than bloat, in putting out
2538 something which is DECL_COMDAT. */
2539 #define DECL_COMDAT(NODE) \
2540 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2542 #define DECL_COMDAT_GROUP(NODE) \
2543 decl_comdat_group (NODE)
2545 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2546 multiple translation units should be merged. */
2547 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2548 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2550 /* The name of the object as the assembler will see it (but before any
2551 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2552 as DECL_NAME. It is an IDENTIFIER_NODE.
2554 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2555 One Definition Rule based type merging at LTO. It is computed only for
2556 LTO compilation and C++. */
2557 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2559 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2560 This is true of all DECL nodes except FIELD_DECL. */
2561 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2562 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2564 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2565 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2567 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2568 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2569 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2571 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2572 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2573 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2575 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2576 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2577 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2578 semantics of using this macro, are different than saying:
2580 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2582 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2584 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2585 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2586 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2587 DECL_ASSEMBLER_NAME (DECL1)) \
2590 /* Records the section name in a section attribute. Used to pass
2591 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2592 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2594 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2595 this variable in a BIND_EXPR. */
2596 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2597 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2599 /* Value of the decls's visibility attribute */
2600 #define DECL_VISIBILITY(NODE) \
2601 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2603 /* Nonzero means that the decl had its visibility specified rather than
2605 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2606 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2608 /* In a VAR_DECL, the model to use if the data should be allocated from
2609 thread-local storage. */
2610 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2612 /* In a VAR_DECL, nonzero if the data should be allocated from
2613 thread-local storage. */
2614 #define DECL_THREAD_LOCAL_P(NODE) \
2615 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2617 /* In a non-local VAR_DECL with static storage duration, true if the
2618 variable has an initialization priority. If false, the variable
2619 will be initialized at the DEFAULT_INIT_PRIORITY. */
2620 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2621 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2623 extern tree
decl_debug_expr_lookup (tree
);
2624 extern void decl_debug_expr_insert (tree
, tree
);
2626 /* For VAR_DECL, this is set to an expression that it was split from. */
2627 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2628 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2629 #define DECL_DEBUG_EXPR(NODE) \
2630 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2632 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2633 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2635 extern priority_type
decl_init_priority_lookup (tree
);
2636 extern priority_type
decl_fini_priority_lookup (tree
);
2637 extern void decl_init_priority_insert (tree
, priority_type
);
2638 extern void decl_fini_priority_insert (tree
, priority_type
);
2640 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2642 #define DECL_INIT_PRIORITY(NODE) \
2643 (decl_init_priority_lookup (NODE))
2644 /* Set the initialization priority for NODE to VAL. */
2645 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2646 (decl_init_priority_insert (NODE, VAL))
2648 /* For a FUNCTION_DECL the finalization priority of NODE. */
2649 #define DECL_FINI_PRIORITY(NODE) \
2650 (decl_fini_priority_lookup (NODE))
2651 /* Set the finalization priority for NODE to VAL. */
2652 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2653 (decl_fini_priority_insert (NODE, VAL))
2655 /* The initialization priority for entities for which no explicit
2656 initialization priority has been specified. */
2657 #define DEFAULT_INIT_PRIORITY 65535
2659 /* The maximum allowed initialization priority. */
2660 #define MAX_INIT_PRIORITY 65535
2662 /* The largest priority value reserved for use by system runtime
2664 #define MAX_RESERVED_INIT_PRIORITY 100
2666 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2667 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2668 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2670 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2671 #define DECL_NONLOCAL_FRAME(NODE) \
2672 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2674 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2675 #define DECL_NONALIASED(NODE) \
2676 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2678 /* This field is used to reference anything in decl.result and is meant only
2679 for use by the garbage collector. */
2680 #define DECL_RESULT_FLD(NODE) \
2681 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2683 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2684 Before the struct containing the FUNCTION_DECL is laid out,
2685 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2686 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2687 function. When the class is laid out, this pointer is changed
2688 to an INTEGER_CST node which is suitable for use as an index
2689 into the virtual function table. */
2690 #define DECL_VINDEX(NODE) \
2691 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2693 /* In FUNCTION_DECL, holds the decl for the return value. */
2694 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2696 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2697 #define DECL_UNINLINABLE(NODE) \
2698 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2700 /* In a FUNCTION_DECL, the saved representation of the body of the
2702 #define DECL_SAVED_TREE(NODE) \
2703 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2705 /* Nonzero in a FUNCTION_DECL means this function should be treated
2706 as if it were a malloc, meaning it returns a pointer that is
2708 #define DECL_IS_MALLOC(NODE) \
2709 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2711 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2712 C++ operator new, meaning that it returns a pointer for which we
2713 should not use type based aliasing. */
2714 #define DECL_IS_OPERATOR_NEW(NODE) \
2715 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2717 /* Nonzero in a FUNCTION_DECL means this function may return more
2719 #define DECL_IS_RETURNS_TWICE(NODE) \
2720 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2722 /* Nonzero in a FUNCTION_DECL means this function should be treated
2723 as "pure" function (like const function, but may read global memory). */
2724 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2726 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2727 the const or pure function may not terminate. When this is nonzero
2728 for a const or pure function, it can be dealt with by cse passes
2729 but cannot be removed by dce passes since you are not allowed to
2730 change an infinite looping program into one that terminates without
2732 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2733 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2735 /* Nonzero in a FUNCTION_DECL means this function should be treated
2736 as "novops" function (function that does not read global memory,
2737 but may have arbitrary side effects). */
2738 #define DECL_IS_NOVOPS(NODE) \
2739 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2741 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2742 at the beginning or end of execution. */
2743 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2744 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2746 #define DECL_STATIC_DESTRUCTOR(NODE) \
2747 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2749 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2750 be instrumented with calls to support routines. */
2751 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2752 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2754 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2755 disabled in this function. */
2756 #define DECL_NO_LIMIT_STACK(NODE) \
2757 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2759 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2760 #define DECL_STATIC_CHAIN(NODE) \
2761 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2763 /* Nonzero for a decl that cgraph has decided should be inlined into
2764 at least one call site. It is not meaningful to look at this
2765 directly; always use cgraph_function_possibly_inlined_p. */
2766 #define DECL_POSSIBLY_INLINED(DECL) \
2767 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2769 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2770 such as via the `inline' keyword in C/C++. This flag controls the linkage
2771 semantics of 'inline' */
2772 #define DECL_DECLARED_INLINE_P(NODE) \
2773 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2775 /* Nonzero in a FUNCTION_DECL means this function should not get
2776 -Winline warnings. */
2777 #define DECL_NO_INLINE_WARNING_P(NODE) \
2778 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2780 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2781 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2782 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2784 /* Nonzero if a FUNCTION_CODE is a TM load. */
2785 #define BUILTIN_TM_LOAD_P(FN) \
2786 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2788 /* Nonzero if a FUNCTION_CODE is a TM store. */
2789 #define BUILTIN_TM_STORE_P(FN) \
2790 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2792 #define CASE_BUILT_IN_TM_LOAD(FN) \
2793 case BUILT_IN_TM_LOAD_##FN: \
2794 case BUILT_IN_TM_LOAD_RAR_##FN: \
2795 case BUILT_IN_TM_LOAD_RAW_##FN: \
2796 case BUILT_IN_TM_LOAD_RFW_##FN
2798 #define CASE_BUILT_IN_TM_STORE(FN) \
2799 case BUILT_IN_TM_STORE_##FN: \
2800 case BUILT_IN_TM_STORE_WAR_##FN: \
2801 case BUILT_IN_TM_STORE_WAW_##FN
2803 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2804 disregarding size and cost heuristics. This is equivalent to using
2805 the always_inline attribute without the required diagnostics if the
2806 function cannot be inlined. */
2807 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2808 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2810 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2811 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2813 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2814 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2815 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2817 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2818 that describes the status of this function. */
2819 #define DECL_STRUCT_FUNCTION(NODE) \
2820 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2822 /* In a FUNCTION_DECL, nonzero means a built in function of a
2823 standard library or more generally a built in function that is
2824 recognized by optimizers and expanders.
2826 Note that it is different from the DECL_IS_BUILTIN accessor. For
2827 instance, user declared prototypes of C library functions are not
2828 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2829 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2831 /* For a builtin function, identify which part of the compiler defined it. */
2832 #define DECL_BUILT_IN_CLASS(NODE) \
2833 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2835 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2836 #define DECL_ARGUMENTS(NODE) \
2837 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2839 /* In FUNCTION_DECL, the function specific target options to use when compiling
2841 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2842 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2844 /* In FUNCTION_DECL, the function specific optimization options to use when
2845 compiling this function. */
2846 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2847 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2849 /* In FUNCTION_DECL, this is set if this function has other versions generated
2850 using "target" attributes. The default version is the one which does not
2851 have any "target" attribute set. */
2852 #define DECL_FUNCTION_VERSIONED(NODE)\
2853 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2855 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2856 Devirtualization machinery uses this knowledge for determing type of the
2857 object constructed. Also we assume that constructor address is not
2859 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2860 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2862 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2863 Devirtualization machinery uses this to track types in destruction. */
2864 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2865 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2867 /* In FUNCTION_DECL that represent an virtual method this is set when
2868 the method is final. */
2869 #define DECL_FINAL_P(NODE)\
2870 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2872 /* The source language of the translation-unit. */
2873 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2874 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2876 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2878 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2879 #define DECL_ORIGINAL_TYPE(NODE) \
2880 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2882 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2883 into stabs. Instead it will generate cross reference ('x') of names.
2884 This uses the same flag as DECL_EXTERNAL. */
2885 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2886 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2888 /* Getter of the imported declaration associated to the
2889 IMPORTED_DECL node. */
2890 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2891 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2893 /* Getter of the symbol declaration associated with the
2894 NAMELIST_DECL node. */
2895 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2896 (DECL_INITIAL (NODE))
2898 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2899 To reduce overhead, the nodes containing the statements are not trees.
2900 This avoids the overhead of tree_common on all linked list elements.
2902 Use the interface in tree-iterator.h to access this node. */
2904 #define STATEMENT_LIST_HEAD(NODE) \
2905 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2906 #define STATEMENT_LIST_TAIL(NODE) \
2907 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2909 #define TREE_OPTIMIZATION(NODE) \
2910 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2912 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2913 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2915 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2916 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2918 /* Return a tree node that encapsulates the optimization options in OPTS. */
2919 extern tree
build_optimization_node (struct gcc_options
*opts
);
2921 #define TREE_TARGET_OPTION(NODE) \
2922 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2924 #define TREE_TARGET_GLOBALS(NODE) \
2925 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2927 /* Return a tree node that encapsulates the target options in OPTS. */
2928 extern tree
build_target_option_node (struct gcc_options
*opts
);
2930 extern void prepare_target_option_nodes_for_pch (void);
2932 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2935 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2937 if (TREE_CODE (__t
) != __c
)
2938 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2943 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2946 if (TREE_CODE (__t
) == __c
)
2947 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2952 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2953 enum tree_code __c1
, enum tree_code __c2
)
2955 if (TREE_CODE (__t
) != __c1
2956 && TREE_CODE (__t
) != __c2
)
2957 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2962 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2963 enum tree_code __c1
, enum tree_code __c2
)
2965 if (TREE_CODE (__t
) == __c1
2966 || TREE_CODE (__t
) == __c2
)
2967 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2972 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2973 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2975 if (TREE_CODE (__t
) != __c1
2976 && TREE_CODE (__t
) != __c2
2977 && TREE_CODE (__t
) != __c3
)
2978 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2983 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2984 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2986 if (TREE_CODE (__t
) == __c1
2987 || TREE_CODE (__t
) == __c2
2988 || TREE_CODE (__t
) == __c3
)
2989 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2994 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2995 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2996 enum tree_code __c4
)
2998 if (TREE_CODE (__t
) != __c1
2999 && TREE_CODE (__t
) != __c2
3000 && TREE_CODE (__t
) != __c3
3001 && TREE_CODE (__t
) != __c4
)
3002 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3007 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3008 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3009 enum tree_code __c4
)
3011 if (TREE_CODE (__t
) == __c1
3012 || TREE_CODE (__t
) == __c2
3013 || TREE_CODE (__t
) == __c3
3014 || TREE_CODE (__t
) == __c4
)
3015 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3020 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3021 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3022 enum tree_code __c4
, enum tree_code __c5
)
3024 if (TREE_CODE (__t
) != __c1
3025 && TREE_CODE (__t
) != __c2
3026 && TREE_CODE (__t
) != __c3
3027 && TREE_CODE (__t
) != __c4
3028 && TREE_CODE (__t
) != __c5
)
3029 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3034 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3035 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3036 enum tree_code __c4
, enum tree_code __c5
)
3038 if (TREE_CODE (__t
) == __c1
3039 || TREE_CODE (__t
) == __c2
3040 || TREE_CODE (__t
) == __c3
3041 || TREE_CODE (__t
) == __c4
3042 || TREE_CODE (__t
) == __c5
)
3043 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3048 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3049 const char *__f
, int __l
, const char *__g
)
3051 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3052 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3057 tree_class_check (tree __t
, const enum tree_code_class __class
,
3058 const char *__f
, int __l
, const char *__g
)
3060 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3061 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3066 tree_range_check (tree __t
,
3067 enum tree_code __code1
, enum tree_code __code2
,
3068 const char *__f
, int __l
, const char *__g
)
3070 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3071 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3076 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3077 const char *__f
, int __l
, const char *__g
)
3079 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3080 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3081 if (__t
->omp_clause
.code
!= __code
)
3082 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3087 omp_clause_range_check (tree __t
,
3088 enum omp_clause_code __code1
,
3089 enum omp_clause_code __code2
,
3090 const char *__f
, int __l
, const char *__g
)
3092 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3093 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3094 if ((int) __t
->omp_clause
.code
< (int) __code1
3095 || (int) __t
->omp_clause
.code
> (int) __code2
)
3096 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3100 /* These checks have to be special cased. */
3103 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3105 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3106 if (!IS_EXPR_CODE_CLASS (__c
))
3107 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3111 /* These checks have to be special cased. */
3114 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3117 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3121 inline const HOST_WIDE_INT
*
3122 tree_int_cst_elt_check (const_tree __t
, int __i
,
3123 const char *__f
, int __l
, const char *__g
)
3125 if (TREE_CODE (__t
) != INTEGER_CST
)
3126 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3127 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3128 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3130 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3133 inline HOST_WIDE_INT
*
3134 tree_int_cst_elt_check (tree __t
, int __i
,
3135 const char *__f
, int __l
, const char *__g
)
3137 if (TREE_CODE (__t
) != INTEGER_CST
)
3138 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3139 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3140 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3142 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3145 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3147 # if GCC_VERSION >= 4006
3148 #pragma GCC diagnostic push
3149 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3153 tree_vec_elt_check (tree __t
, int __i
,
3154 const char *__f
, int __l
, const char *__g
)
3156 if (TREE_CODE (__t
) != TREE_VEC
)
3157 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3158 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3159 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3160 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3163 # if GCC_VERSION >= 4006
3164 #pragma GCC diagnostic pop
3168 omp_clause_elt_check (tree __t
, int __i
,
3169 const char *__f
, int __l
, const char *__g
)
3171 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3172 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3173 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3174 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3175 return &__t
->omp_clause
.ops
[__i
];
3178 /* These checks have to be special cased. */
3181 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3183 if (!ANY_INTEGRAL_TYPE_P (__t
))
3184 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3190 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3193 if (TREE_CODE (__t
) != __c
)
3194 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3199 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3202 if (TREE_CODE (__t
) == __c
)
3203 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3208 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3209 enum tree_code __c1
, enum tree_code __c2
)
3211 if (TREE_CODE (__t
) != __c1
3212 && TREE_CODE (__t
) != __c2
)
3213 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3218 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3219 enum tree_code __c1
, enum tree_code __c2
)
3221 if (TREE_CODE (__t
) == __c1
3222 || TREE_CODE (__t
) == __c2
)
3223 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3228 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3229 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3231 if (TREE_CODE (__t
) != __c1
3232 && TREE_CODE (__t
) != __c2
3233 && TREE_CODE (__t
) != __c3
)
3234 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3239 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3240 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3242 if (TREE_CODE (__t
) == __c1
3243 || TREE_CODE (__t
) == __c2
3244 || TREE_CODE (__t
) == __c3
)
3245 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3250 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3251 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3252 enum tree_code __c4
)
3254 if (TREE_CODE (__t
) != __c1
3255 && TREE_CODE (__t
) != __c2
3256 && TREE_CODE (__t
) != __c3
3257 && TREE_CODE (__t
) != __c4
)
3258 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3263 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3264 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3265 enum tree_code __c4
)
3267 if (TREE_CODE (__t
) == __c1
3268 || TREE_CODE (__t
) == __c2
3269 || TREE_CODE (__t
) == __c3
3270 || TREE_CODE (__t
) == __c4
)
3271 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3276 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3277 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3278 enum tree_code __c4
, enum tree_code __c5
)
3280 if (TREE_CODE (__t
) != __c1
3281 && TREE_CODE (__t
) != __c2
3282 && TREE_CODE (__t
) != __c3
3283 && TREE_CODE (__t
) != __c4
3284 && TREE_CODE (__t
) != __c5
)
3285 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3290 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3291 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3292 enum tree_code __c4
, enum tree_code __c5
)
3294 if (TREE_CODE (__t
) == __c1
3295 || TREE_CODE (__t
) == __c2
3296 || TREE_CODE (__t
) == __c3
3297 || TREE_CODE (__t
) == __c4
3298 || TREE_CODE (__t
) == __c5
)
3299 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3304 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3305 const char *__f
, int __l
, const char *__g
)
3307 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3308 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3313 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3314 const char *__f
, int __l
, const char *__g
)
3316 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3317 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3322 tree_range_check (const_tree __t
,
3323 enum tree_code __code1
, enum tree_code __code2
,
3324 const char *__f
, int __l
, const char *__g
)
3326 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3327 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3332 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3333 const char *__f
, int __l
, const char *__g
)
3335 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3336 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3337 if (__t
->omp_clause
.code
!= __code
)
3338 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3343 omp_clause_range_check (const_tree __t
,
3344 enum omp_clause_code __code1
,
3345 enum omp_clause_code __code2
,
3346 const char *__f
, int __l
, const char *__g
)
3348 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3349 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3350 if ((int) __t
->omp_clause
.code
< (int) __code1
3351 || (int) __t
->omp_clause
.code
> (int) __code2
)
3352 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3357 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3359 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3360 if (!IS_EXPR_CODE_CLASS (__c
))
3361 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3366 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3369 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3373 # if GCC_VERSION >= 4006
3374 #pragma GCC diagnostic push
3375 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3379 tree_vec_elt_check (const_tree __t
, int __i
,
3380 const char *__f
, int __l
, const char *__g
)
3382 if (TREE_CODE (__t
) != TREE_VEC
)
3383 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3384 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3385 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3386 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3387 //return &__t->vec.a[__i];
3390 # if GCC_VERSION >= 4006
3391 #pragma GCC diagnostic pop
3395 omp_clause_elt_check (const_tree __t
, int __i
,
3396 const char *__f
, int __l
, const char *__g
)
3398 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3399 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3400 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3401 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3402 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3406 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3409 if (!ANY_INTEGRAL_TYPE_P (__t
))
3410 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3417 /* Compute the number of operands in an expression node NODE. For
3418 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3419 otherwise it is looked up from the node's code. */
3421 tree_operand_length (const_tree node
)
3423 if (VL_EXP_CLASS_P (node
))
3424 return VL_EXP_OPERAND_LENGTH (node
);
3426 return TREE_CODE_LENGTH (TREE_CODE (node
));
3429 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3431 /* Special checks for TREE_OPERANDs. */
3433 tree_operand_check (tree __t
, int __i
,
3434 const char *__f
, int __l
, const char *__g
)
3436 const_tree __u
= EXPR_CHECK (__t
);
3437 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3438 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3439 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3443 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3444 const char *__f
, int __l
, const char *__g
)
3446 if (TREE_CODE (__t
) != __code
)
3447 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3448 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3449 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3450 return &__t
->exp
.operands
[__i
];
3454 tree_operand_check (const_tree __t
, int __i
,
3455 const char *__f
, int __l
, const char *__g
)
3457 const_tree __u
= EXPR_CHECK (__t
);
3458 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3459 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3460 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3464 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3465 const char *__f
, int __l
, const char *__g
)
3467 if (TREE_CODE (__t
) != __code
)
3468 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3469 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3470 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3471 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3476 #define error_mark_node global_trees[TI_ERROR_MARK]
3478 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3479 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3480 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3481 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3482 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3484 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3485 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3486 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3487 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3488 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3490 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3491 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3492 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3493 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3494 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3496 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3497 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3498 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3500 #define void_node global_trees[TI_VOID]
3502 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3503 #define integer_one_node global_trees[TI_INTEGER_ONE]
3504 #define integer_three_node global_trees[TI_INTEGER_THREE]
3505 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3506 #define size_zero_node global_trees[TI_SIZE_ZERO]
3507 #define size_one_node global_trees[TI_SIZE_ONE]
3508 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3509 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3510 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3512 /* Base access nodes. */
3513 #define access_public_node global_trees[TI_PUBLIC]
3514 #define access_protected_node global_trees[TI_PROTECTED]
3515 #define access_private_node global_trees[TI_PRIVATE]
3517 #define null_pointer_node global_trees[TI_NULL_POINTER]
3519 #define float_type_node global_trees[TI_FLOAT_TYPE]
3520 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3521 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3523 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3524 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3525 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3526 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3528 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3529 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3530 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3531 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3533 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3535 #define void_type_node global_trees[TI_VOID_TYPE]
3536 /* The C type `void *'. */
3537 #define ptr_type_node global_trees[TI_PTR_TYPE]
3538 /* The C type `const void *'. */
3539 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3540 /* The C type `size_t'. */
3541 #define size_type_node global_trees[TI_SIZE_TYPE]
3542 #define pid_type_node global_trees[TI_PID_TYPE]
3543 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3544 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3545 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3546 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3547 /* The C type `FILE *'. */
3548 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3549 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3551 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3552 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3553 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3555 /* The decimal floating point types. */
3556 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3557 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3558 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3559 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3560 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3561 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3563 /* The fixed-point types. */
3564 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3565 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3566 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3567 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3568 #define sat_unsigned_short_fract_type_node \
3569 global_trees[TI_SAT_USFRACT_TYPE]
3570 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3571 #define sat_unsigned_long_fract_type_node \
3572 global_trees[TI_SAT_ULFRACT_TYPE]
3573 #define sat_unsigned_long_long_fract_type_node \
3574 global_trees[TI_SAT_ULLFRACT_TYPE]
3575 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3576 #define fract_type_node global_trees[TI_FRACT_TYPE]
3577 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3578 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3579 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3580 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3581 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3582 #define unsigned_long_long_fract_type_node \
3583 global_trees[TI_ULLFRACT_TYPE]
3584 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3585 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3586 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3587 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3588 #define sat_unsigned_short_accum_type_node \
3589 global_trees[TI_SAT_USACCUM_TYPE]
3590 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3591 #define sat_unsigned_long_accum_type_node \
3592 global_trees[TI_SAT_ULACCUM_TYPE]
3593 #define sat_unsigned_long_long_accum_type_node \
3594 global_trees[TI_SAT_ULLACCUM_TYPE]
3595 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3596 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3597 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3598 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3599 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3600 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3601 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3602 #define unsigned_long_long_accum_type_node \
3603 global_trees[TI_ULLACCUM_TYPE]
3604 #define qq_type_node global_trees[TI_QQ_TYPE]
3605 #define hq_type_node global_trees[TI_HQ_TYPE]
3606 #define sq_type_node global_trees[TI_SQ_TYPE]
3607 #define dq_type_node global_trees[TI_DQ_TYPE]
3608 #define tq_type_node global_trees[TI_TQ_TYPE]
3609 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3610 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3611 #define usq_type_node global_trees[TI_USQ_TYPE]
3612 #define udq_type_node global_trees[TI_UDQ_TYPE]
3613 #define utq_type_node global_trees[TI_UTQ_TYPE]
3614 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3615 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3616 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3617 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3618 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3619 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3620 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3621 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3622 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3623 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3624 #define ha_type_node global_trees[TI_HA_TYPE]
3625 #define sa_type_node global_trees[TI_SA_TYPE]
3626 #define da_type_node global_trees[TI_DA_TYPE]
3627 #define ta_type_node global_trees[TI_TA_TYPE]
3628 #define uha_type_node global_trees[TI_UHA_TYPE]
3629 #define usa_type_node global_trees[TI_USA_TYPE]
3630 #define uda_type_node global_trees[TI_UDA_TYPE]
3631 #define uta_type_node global_trees[TI_UTA_TYPE]
3632 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3633 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3634 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3635 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3636 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3637 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3638 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3639 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3641 /* The node that should be placed at the end of a parameter list to
3642 indicate that the function does not take a variable number of
3643 arguments. The TREE_VALUE will be void_type_node and there will be
3644 no TREE_CHAIN. Language-independent code should not assume
3645 anything else about this node. */
3646 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3648 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3649 #define MAIN_NAME_P(NODE) \
3650 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3652 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3654 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3655 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3657 /* Default/current target options (TARGET_OPTION_NODE). */
3658 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3659 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3661 /* Default tree list option(), optimize() pragmas to be linked into the
3663 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3664 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3666 #define char_type_node integer_types[itk_char]
3667 #define signed_char_type_node integer_types[itk_signed_char]
3668 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3669 #define short_integer_type_node integer_types[itk_short]
3670 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3671 #define integer_type_node integer_types[itk_int]
3672 #define unsigned_type_node integer_types[itk_unsigned_int]
3673 #define long_integer_type_node integer_types[itk_long]
3674 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3675 #define long_long_integer_type_node integer_types[itk_long_long]
3676 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3678 /* True if NODE is an erroneous expression. */
3680 #define error_operand_p(NODE) \
3681 ((NODE) == error_mark_node \
3682 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3684 extern tree
decl_assembler_name (tree
);
3685 extern tree
decl_comdat_group (const_tree
);
3686 extern tree
decl_comdat_group_id (const_tree
);
3687 extern const char *decl_section_name (const_tree
);
3688 extern void set_decl_section_name (tree
, const char *);
3689 extern enum tls_model
decl_tls_model (const_tree
);
3690 extern void set_decl_tls_model (tree
, enum tls_model
);
3692 /* Compute the number of bytes occupied by 'node'. This routine only
3693 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3695 extern size_t tree_size (const_tree
);
3697 /* Compute the number of bytes occupied by a tree with code CODE.
3698 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3699 which are of variable length. */
3700 extern size_t tree_code_size (enum tree_code
);
3702 /* Allocate and return a new UID from the DECL_UID namespace. */
3703 extern int allocate_decl_uid (void);
3705 /* Lowest level primitive for allocating a node.
3706 The TREE_CODE is the only argument. Contents are initialized
3707 to zero except for a few of the common fields. */
3709 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3710 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3712 /* Make a copy of a node, with all the same contents. */
3714 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3715 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3717 /* Make a copy of a chain of TREE_LIST nodes. */
3719 extern tree
copy_list (tree
);
3721 /* Make a CASE_LABEL_EXPR. */
3723 extern tree
build_case_label (tree
, tree
, tree
);
3726 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3727 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3729 /* Make an INTEGER_CST. */
3731 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3732 #define make_int_cst(LEN, EXT_LEN) \
3733 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3735 /* Make a TREE_VEC. */
3737 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3738 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3740 /* Grow a TREE_VEC. */
3742 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3743 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3745 /* Construct various types of nodes. */
3747 extern tree
build_nt (enum tree_code
, ...);
3748 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3750 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3751 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3752 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3753 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3754 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3755 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3756 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3757 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3758 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3759 tree MEM_STAT_DECL
);
3760 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3761 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3762 tree MEM_STAT_DECL
);
3763 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3765 /* _loc versions of build[1-5]. */
3768 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3769 tree arg1 MEM_STAT_DECL
)
3771 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3772 if (CAN_HAVE_LOCATION_P (t
))
3773 SET_EXPR_LOCATION (t
, loc
);
3776 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3779 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3780 tree arg1 MEM_STAT_DECL
)
3782 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3783 if (CAN_HAVE_LOCATION_P (t
))
3784 SET_EXPR_LOCATION (t
, loc
);
3787 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3790 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3791 tree arg1
, tree arg2 MEM_STAT_DECL
)
3793 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3794 if (CAN_HAVE_LOCATION_P (t
))
3795 SET_EXPR_LOCATION (t
, loc
);
3798 #define build3_loc(l,c,t1,t2,t3,t4) \
3799 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3802 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3803 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3805 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3806 if (CAN_HAVE_LOCATION_P (t
))
3807 SET_EXPR_LOCATION (t
, loc
);
3810 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3811 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3814 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3815 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3817 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3818 arg4 PASS_MEM_STAT
);
3819 if (CAN_HAVE_LOCATION_P (t
))
3820 SET_EXPR_LOCATION (t
, loc
);
3823 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3824 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3826 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3827 #define build_var_debug_value(t1,t2) \
3828 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3830 /* Constructs double_int from tree CST. */
3832 extern tree
double_int_to_tree (tree
, double_int
);
3834 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3835 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3837 /* Create an INT_CST node with a CST value zero extended. */
3840 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3841 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3842 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3843 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3844 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3845 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3846 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3847 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3848 extern tree
build_vector_from_val (tree
, tree
);
3849 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3850 extern tree
build_constructor_single (tree
, tree
, tree
);
3851 extern tree
build_constructor_from_list (tree
, tree
);
3852 extern tree
build_constructor_va (tree
, int, ...);
3853 extern tree
build_real_from_int_cst (tree
, const_tree
);
3854 extern tree
build_complex (tree
, tree
, tree
);
3855 extern tree
build_complex_inf (tree
, bool);
3856 extern tree
build_each_one_cst (tree
);
3857 extern tree
build_one_cst (tree
);
3858 extern tree
build_minus_one_cst (tree
);
3859 extern tree
build_all_ones_cst (tree
);
3860 extern tree
build_zero_cst (tree
);
3861 extern tree
build_string (int, const char *);
3862 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3863 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3864 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3865 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3866 extern tree
build_decl_stat (location_t
, enum tree_code
,
3867 tree
, tree MEM_STAT_DECL
);
3868 extern tree
build_fn_decl (const char *, tree
);
3869 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3870 extern tree
build_translation_unit_decl (tree
);
3871 extern tree
build_block (tree
, tree
, tree
, tree
);
3872 extern tree
build_empty_stmt (location_t
);
3873 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3875 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3876 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3878 extern tree
build_call_nary (tree
, tree
, int, ...);
3879 extern tree
build_call_valist (tree
, tree
, int, va_list);
3880 #define build_call_array(T1,T2,N,T3)\
3881 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3882 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3883 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3884 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
3885 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
3886 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
3887 extern tree
build_call_expr (tree
, int, ...);
3888 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
3890 extern tree
build_string_literal (int, const char *);
3892 /* Construct various nodes representing data types. */
3894 extern tree
signed_or_unsigned_type_for (int, tree
);
3895 extern tree
signed_type_for (tree
);
3896 extern tree
unsigned_type_for (tree
);
3897 extern tree
truth_type_for (tree
);
3898 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
3899 extern tree
build_pointer_type (tree
);
3900 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
3901 extern tree
build_reference_type (tree
);
3902 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
3903 extern tree
build_vector_type (tree innertype
, int nunits
);
3904 extern tree
build_truth_vector_type (unsigned, unsigned);
3905 extern tree
build_same_sized_truth_vector_type (tree vectype
);
3906 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3907 extern tree
build_index_type (tree
);
3908 extern tree
build_array_type (tree
, tree
);
3909 extern tree
build_nonshared_array_type (tree
, tree
);
3910 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3911 extern tree
build_function_type (tree
, tree
);
3912 extern tree
build_function_type_list (tree
, ...);
3913 extern tree
build_varargs_function_type_list (tree
, ...);
3914 extern tree
build_function_type_array (tree
, int, tree
*);
3915 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3916 #define build_function_type_vec(RET, V) \
3917 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3918 #define build_varargs_function_type_vec(RET, V) \
3919 build_varargs_function_type_array (RET, vec_safe_length (V), \
3920 vec_safe_address (V))
3921 extern tree
build_method_type_directly (tree
, tree
, tree
);
3922 extern tree
build_method_type (tree
, tree
);
3923 extern tree
build_offset_type (tree
, tree
);
3924 extern tree
build_complex_type (tree
);
3925 extern tree
array_type_nelts (const_tree
);
3927 extern tree
value_member (tree
, tree
);
3928 extern tree
purpose_member (const_tree
, tree
);
3929 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3930 extern tree
chain_index (int, tree
);
3932 extern int attribute_list_equal (const_tree
, const_tree
);
3933 extern int attribute_list_contained (const_tree
, const_tree
);
3934 extern int tree_int_cst_equal (const_tree
, const_tree
);
3936 extern bool tree_fits_shwi_p (const_tree
)
3937 #ifndef ENABLE_TREE_CHECKING
3938 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
3941 extern bool tree_fits_uhwi_p (const_tree
)
3942 #ifndef ENABLE_TREE_CHECKING
3943 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
3946 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
3947 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
3948 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3949 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3950 tree_to_shwi (const_tree t
)
3952 gcc_assert (tree_fits_shwi_p (t
));
3953 return TREE_INT_CST_LOW (t
);
3956 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
3957 tree_to_uhwi (const_tree t
)
3959 gcc_assert (tree_fits_uhwi_p (t
));
3960 return TREE_INT_CST_LOW (t
);
3963 extern int tree_int_cst_sgn (const_tree
);
3964 extern int tree_int_cst_sign_bit (const_tree
);
3965 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
3966 extern tree
strip_array_types (tree
);
3967 extern tree
excess_precision_type (tree
);
3968 extern bool valid_constant_size_p (const_tree
);
3971 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3972 put the prototype here. Rtl.h does declare the prototype if
3973 tree.h had been included. */
3975 extern tree
make_tree (tree
, rtx
);
3977 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3980 Such modified types already made are recorded so that duplicates
3983 extern tree
build_type_attribute_variant (tree
, tree
);
3984 extern tree
build_decl_attribute_variant (tree
, tree
);
3985 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3987 extern bool attribute_value_equal (const_tree
, const_tree
);
3989 /* Return 0 if the attributes for two types are incompatible, 1 if they
3990 are compatible, and 2 if they are nearly compatible (which causes a
3991 warning to be generated). */
3992 extern int comp_type_attributes (const_tree
, const_tree
);
3994 /* Default versions of target-overridable functions. */
3995 extern tree
merge_decl_attributes (tree
, tree
);
3996 extern tree
merge_type_attributes (tree
, tree
);
3998 /* This function is a private implementation detail of lookup_attribute()
3999 and you should never call it directly. */
4000 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4002 /* This function is a private implementation detail
4003 of lookup_attribute_by_prefix() and you should never call it directly. */
4004 extern tree
private_lookup_attribute_by_prefix (const char *, size_t, tree
);
4006 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4007 return a pointer to the attribute's list element if the attribute
4008 is part of the list, or NULL_TREE if not found. If the attribute
4009 appears more than once, this only returns the first occurrence; the
4010 TREE_CHAIN of the return value should be passed back in if further
4011 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4015 lookup_attribute (const char *attr_name
, tree list
)
4017 gcc_checking_assert (attr_name
[0] != '_');
4018 /* In most cases, list is NULL_TREE. */
4019 if (list
== NULL_TREE
)
4022 /* Do the strlen() before calling the out-of-line implementation.
4023 In most cases attr_name is a string constant, and the compiler
4024 will optimize the strlen() away. */
4025 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4028 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4029 return a pointer to the attribute's list first element if the attribute
4030 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4034 lookup_attribute_by_prefix (const char *attr_name
, tree list
)
4036 gcc_checking_assert (attr_name
[0] != '_');
4037 /* In most cases, list is NULL_TREE. */
4038 if (list
== NULL_TREE
)
4041 return private_lookup_attribute_by_prefix (attr_name
, strlen (attr_name
),
4046 /* This function is a private implementation detail of
4047 is_attribute_p() and you should never call it directly. */
4048 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4050 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4051 if the identifier node is a valid attribute name for the string.
4052 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4053 be the identifier for 'text' or for '__text__'. */
4056 is_attribute_p (const char *attr_name
, const_tree ident
)
4058 gcc_checking_assert (attr_name
[0] != '_');
4059 /* Do the strlen() before calling the out-of-line implementation.
4060 In most cases attr_name is a string constant, and the compiler
4061 will optimize the strlen() away. */
4062 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4065 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4066 modified list. ATTR_NAME must be in the form 'text' (not
4069 extern tree
remove_attribute (const char *, tree
);
4071 /* Given two attributes lists, return a list of their union. */
4073 extern tree
merge_attributes (tree
, tree
);
4075 /* Given two Windows decl attributes lists, possibly including
4076 dllimport, return a list of their union . */
4077 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4079 /* Handle a "dllimport" or "dllexport" attribute. */
4080 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4082 /* Returns true iff unqualified CAND and BASE are equivalent. */
4084 extern bool check_base_type (const_tree cand
, const_tree base
);
4086 /* Check whether CAND is suitable to be returned from get_qualified_type
4087 (BASE, TYPE_QUALS). */
4089 extern bool check_qualified_type (const_tree
, const_tree
, int);
4091 /* Return a version of the TYPE, qualified as indicated by the
4092 TYPE_QUALS, if one exists. If no qualified version exists yet,
4093 return NULL_TREE. */
4095 extern tree
get_qualified_type (tree
, int);
4097 /* Like get_qualified_type, but creates the type if it does not
4098 exist. This function never returns NULL_TREE. */
4100 extern tree
build_qualified_type (tree
, int);
4102 /* Create a variant of type T with alignment ALIGN. */
4104 extern tree
build_aligned_type (tree
, unsigned int);
4106 /* Like build_qualified_type, but only deals with the `const' and
4107 `volatile' qualifiers. This interface is retained for backwards
4108 compatibility with the various front-ends; new code should use
4109 build_qualified_type instead. */
4111 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4112 build_qualified_type ((TYPE), \
4113 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4114 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4116 /* Make a copy of a type node. */
4118 extern tree
build_distinct_type_copy (tree
);
4119 extern tree
build_variant_type_copy (tree
);
4121 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4122 return a canonicalized ..._TYPE node, so that duplicates are not made.
4123 How the hash code is computed is up to the caller, as long as any two
4124 callers that could hash identical-looking type nodes agree. */
4126 extern tree
type_hash_canon (unsigned int, tree
);
4128 extern tree
convert (tree
, tree
);
4129 extern unsigned int expr_align (const_tree
);
4130 extern tree
size_in_bytes (const_tree
);
4131 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4132 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4133 extern tree
bit_position (const_tree
);
4134 extern tree
byte_position (const_tree
);
4135 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4137 #define sizetype sizetype_tab[(int) stk_sizetype]
4138 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4139 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4140 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4141 #define size_int(L) size_int_kind (L, stk_sizetype)
4142 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4143 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4144 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4146 /* Type for sizes of data-type. */
4148 #define BITS_PER_UNIT_LOG \
4149 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4150 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4151 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4153 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4154 by making the last node in X point to Y.
4155 Returns X, except if X is 0 returns Y. */
4157 extern tree
chainon (tree
, tree
);
4159 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4161 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4162 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4164 /* Return the last tree node in a chain. */
4166 extern tree
tree_last (tree
);
4168 /* Reverse the order of elements in a chain, and return the new head. */
4170 extern tree
nreverse (tree
);
4172 /* Returns the length of a chain of nodes
4173 (number of chain pointers to follow before reaching a null pointer). */
4175 extern int list_length (const_tree
);
4177 /* Returns the first FIELD_DECL in a type. */
4179 extern tree
first_field (const_tree
);
4181 /* Given an initializer INIT, return TRUE if INIT is zero or some
4182 aggregate of zeros. Otherwise return FALSE. */
4184 extern bool initializer_zerop (const_tree
);
4186 /* Given a vector VEC, return its first element if all elements are
4187 the same. Otherwise return NULL_TREE. */
4189 extern tree
uniform_vector_p (const_tree
);
4191 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4193 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4195 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4197 extern int zerop (const_tree
);
4199 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4201 extern int integer_zerop (const_tree
);
4203 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4205 extern int integer_onep (const_tree
);
4207 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4208 a vector or complex where each part is 1. */
4210 extern int integer_each_onep (const_tree
);
4212 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4213 all of whose significant bits are 1. */
4215 extern int integer_all_onesp (const_tree
);
4217 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4220 extern int integer_minus_onep (const_tree
);
4222 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4223 exactly one bit 1. */
4225 extern int integer_pow2p (const_tree
);
4227 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4228 with a nonzero value. */
4230 extern int integer_nonzerop (const_tree
);
4232 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4233 a vector where each element is an integer constant of value -1. */
4235 extern int integer_truep (const_tree
);
4237 extern bool cst_and_fits_in_hwi (const_tree
);
4238 extern tree
num_ending_zeros (const_tree
);
4240 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4243 extern int fixed_zerop (const_tree
);
4245 /* staticp (tree x) is nonzero if X is a reference to data allocated
4246 at a fixed address in memory. Returns the outermost data. */
4248 extern tree
staticp (tree
);
4250 /* save_expr (EXP) returns an expression equivalent to EXP
4251 but it can be used multiple times within context CTX
4252 and only evaluate EXP once. */
4254 extern tree
save_expr (tree
);
4256 /* Look inside EXPR into any simple arithmetic operations. Return the
4257 outermost non-arithmetic or non-invariant node. */
4259 extern tree
skip_simple_arithmetic (tree
);
4261 /* Look inside EXPR into simple arithmetic operations involving constants.
4262 Return the outermost non-arithmetic or non-constant node. */
4264 extern tree
skip_simple_constant_arithmetic (tree
);
4266 /* Return which tree structure is used by T. */
4268 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4270 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4271 size or offset that depends on a field within a record. */
4273 extern bool contains_placeholder_p (const_tree
);
4275 /* This macro calls the above function but short-circuits the common
4276 case of a constant to save time. Also check for null. */
4278 #define CONTAINS_PLACEHOLDER_P(EXP) \
4279 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4281 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4282 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4285 extern bool type_contains_placeholder_p (tree
);
4287 /* Given a tree EXP, find all occurrences of references to fields
4288 in a PLACEHOLDER_EXPR and place them in vector REFS without
4289 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4290 we assume here that EXP contains only arithmetic expressions
4291 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4294 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4296 /* This macro calls the above function but short-circuits the common
4297 case of a constant to save time and also checks for NULL. */
4299 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4301 if((EXP) && !TREE_CONSTANT (EXP)) \
4302 find_placeholder_in_expr (EXP, V); \
4305 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4306 return a tree with all occurrences of references to F in a
4307 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4308 CONST_DECLs. Note that we assume here that EXP contains only
4309 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4310 occurring only in their argument list. */
4312 extern tree
substitute_in_expr (tree
, tree
, tree
);
4314 /* This macro calls the above function but short-circuits the common
4315 case of a constant to save time and also checks for NULL. */
4317 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4318 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4320 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4321 for it within OBJ, a tree that is an object or a chain of references. */
4323 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4325 /* This macro calls the above function but short-circuits the common
4326 case of a constant to save time and also checks for NULL. */
4328 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4329 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4330 : substitute_placeholder_in_expr (EXP, OBJ))
4333 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4334 but it can be used multiple times
4335 and only evaluate the subexpressions once. */
4337 extern tree
stabilize_reference (tree
);
4339 /* Return EXP, stripped of any conversions to wider types
4340 in such a way that the result of converting to type FOR_TYPE
4341 is the same as if EXP were converted to FOR_TYPE.
4342 If FOR_TYPE is 0, it signifies EXP's type. */
4344 extern tree
get_unwidened (tree
, tree
);
4346 /* Return OP or a simpler expression for a narrower value
4347 which can be sign-extended or zero-extended to give back OP.
4348 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4349 or 0 if the value should be sign-extended. */
4351 extern tree
get_narrower (tree
, int *);
4353 /* Return true if T is an expression that get_inner_reference handles. */
4356 handled_component_p (const_tree t
)
4358 switch (TREE_CODE (t
))
4363 case ARRAY_RANGE_REF
:
4366 case VIEW_CONVERT_EXPR
:
4374 /* Return true T is a component with reverse storage order. */
4377 reverse_storage_order_for_component_p (tree t
)
4379 /* The storage order only applies to scalar components. */
4380 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4383 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4384 t
= TREE_OPERAND (t
, 0);
4386 switch (TREE_CODE (t
))
4390 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4391 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4392 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4393 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4397 return REF_REVERSE_STORAGE_ORDER (t
);
4399 case ARRAY_RANGE_REF
:
4400 case VIEW_CONVERT_EXPR
:
4408 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4409 that can modify the storage order of objects. Note that, even if the
4410 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4411 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4412 it can change the partition of the aggregate object into scalars. */
4415 storage_order_barrier_p (const_tree t
)
4417 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4420 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4421 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4424 tree op
= TREE_OPERAND (t
, 0);
4426 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4427 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4433 /* Given a DECL or TYPE, return the scope in which it was declared, or
4434 NUL_TREE if there is no containing scope. */
4436 extern tree
get_containing_scope (const_tree
);
4438 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4440 extern tree
decl_function_context (const_tree
);
4442 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4443 this _DECL with its context, or zero if none. */
4444 extern tree
decl_type_context (const_tree
);
4446 /* Return 1 if EXPR is the real constant zero. */
4447 extern int real_zerop (const_tree
);
4449 /* Initialize the iterator I with arguments from function FNDECL */
4452 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4454 i
->next
= TYPE_ARG_TYPES (fntype
);
4457 /* Return a pointer that holds the next argument if there are more arguments to
4458 handle, otherwise return NULL. */
4460 static inline tree
*
4461 function_args_iter_cond_ptr (function_args_iterator
*i
)
4463 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4466 /* Return the next argument if there are more arguments to handle, otherwise
4470 function_args_iter_cond (function_args_iterator
*i
)
4472 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4475 /* Advance to the next argument. */
4477 function_args_iter_next (function_args_iterator
*i
)
4479 gcc_assert (i
->next
!= NULL_TREE
);
4480 i
->next
= TREE_CHAIN (i
->next
);
4483 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4486 inlined_function_outer_scope_p (const_tree block
)
4488 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4491 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4492 to point to the next tree element. ITER is an instance of
4493 function_args_iterator used to iterate the arguments. */
4494 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4495 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4496 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4497 function_args_iter_next (&(ITER)))
4499 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4500 to the next tree element. ITER is an instance of function_args_iterator
4501 used to iterate the arguments. */
4502 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4503 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4504 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4505 function_args_iter_next (&(ITER)))
4508 extern unsigned crc32_string (unsigned, const char *);
4509 extern unsigned crc32_byte (unsigned, char);
4510 extern unsigned crc32_unsigned (unsigned, unsigned);
4511 extern void clean_symbol_name (char *);
4512 extern tree
get_file_function_name (const char *);
4513 extern tree
get_callee_fndecl (const_tree
);
4514 extern int type_num_arguments (const_tree
);
4515 extern bool associative_tree_code (enum tree_code
);
4516 extern bool commutative_tree_code (enum tree_code
);
4517 extern bool commutative_ternary_tree_code (enum tree_code
);
4518 extern bool operation_can_overflow (enum tree_code
);
4519 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
4520 extern tree
upper_bound_in_type (tree
, tree
);
4521 extern tree
lower_bound_in_type (tree
, tree
);
4522 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4523 extern tree
create_artificial_label (location_t
);
4524 extern const char *get_name (tree
);
4525 extern bool stdarg_p (const_tree
);
4526 extern bool prototype_p (const_tree
);
4527 extern bool is_typedef_decl (const_tree x
);
4528 extern bool typedef_variant_p (const_tree
);
4529 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4530 extern tree
build_low_bits_mask (tree
, unsigned);
4531 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4532 extern tree
tree_strip_nop_conversions (tree
);
4533 extern tree
tree_strip_sign_nop_conversions (tree
);
4534 extern const_tree
strip_invariant_refs (const_tree
);
4535 extern tree
lhd_gcc_personality (void);
4536 extern void assign_assembler_name_if_neeeded (tree
);
4537 extern void warn_deprecated_use (tree
, tree
);
4538 extern void cache_integer_cst (tree
);
4540 /* Return the memory model from a host integer. */
4541 static inline enum memmodel
4542 memmodel_from_int (unsigned HOST_WIDE_INT val
)
4544 return (enum memmodel
) (val
& MEMMODEL_MASK
);
4547 /* Return the base memory model from a host integer. */
4548 static inline enum memmodel
4549 memmodel_base (unsigned HOST_WIDE_INT val
)
4551 return (enum memmodel
) (val
& MEMMODEL_BASE_MASK
);
4554 /* Return TRUE if the memory model is RELAXED. */
4556 is_mm_relaxed (enum memmodel model
)
4558 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELAXED
;
4561 /* Return TRUE if the memory model is CONSUME. */
4563 is_mm_consume (enum memmodel model
)
4565 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_CONSUME
;
4568 /* Return TRUE if the memory model is ACQUIRE. */
4570 is_mm_acquire (enum memmodel model
)
4572 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQUIRE
;
4575 /* Return TRUE if the memory model is RELEASE. */
4577 is_mm_release (enum memmodel model
)
4579 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELEASE
;
4582 /* Return TRUE if the memory model is ACQ_REL. */
4584 is_mm_acq_rel (enum memmodel model
)
4586 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQ_REL
;
4589 /* Return TRUE if the memory model is SEQ_CST. */
4591 is_mm_seq_cst (enum memmodel model
)
4593 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_SEQ_CST
;
4596 /* Return TRUE if the memory model is a SYNC variant. */
4598 is_mm_sync (enum memmodel model
)
4600 return (model
& MEMMODEL_SYNC
);
4603 /* Compare and hash for any structure which begins with a canonical
4604 pointer. Assumes all pointers are interchangeable, which is sort
4605 of already assumed by gcc elsewhere IIRC. */
4608 struct_ptr_eq (const void *a
, const void *b
)
4610 const void * const * x
= (const void * const *) a
;
4611 const void * const * y
= (const void * const *) b
;
4615 static inline hashval_t
4616 struct_ptr_hash (const void *a
)
4618 const void * const * x
= (const void * const *) a
;
4619 return (intptr_t)*x
>> 4;
4622 /* Return nonzero if CODE is a tree code that represents a truth value. */
4624 truth_value_p (enum tree_code code
)
4626 return (TREE_CODE_CLASS (code
) == tcc_comparison
4627 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4628 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4629 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4632 /* Return whether TYPE is a type suitable for an offset for
4633 a POINTER_PLUS_EXPR. */
4635 ptrofftype_p (tree type
)
4637 return (INTEGRAL_TYPE_P (type
)
4638 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4639 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4642 extern tree
strip_float_extensions (tree
);
4643 extern int really_constant_p (const_tree
);
4644 extern bool decl_address_invariant_p (const_tree
);
4645 extern bool decl_address_ip_invariant_p (const_tree
);
4646 extern bool int_fits_type_p (const_tree
, const_tree
);
4647 #ifndef GENERATOR_FILE
4648 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4650 extern bool variably_modified_type_p (tree
, tree
);
4651 extern int tree_log2 (const_tree
);
4652 extern int tree_floor_log2 (const_tree
);
4653 extern unsigned int tree_ctz (const_tree
);
4654 extern int simple_cst_equal (const_tree
, const_tree
);
4659 extern void add_expr (const_tree
, hash
&);
4663 /* Compat version until all callers are converted. Return hash for
4665 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4667 inchash::hash
hstate (seed
);
4668 inchash::add_expr (tree
, hstate
);
4669 return hstate
.end ();
4672 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4673 extern int type_list_equal (const_tree
, const_tree
);
4674 extern int chain_member (const_tree
, const_tree
);
4675 extern void dump_tree_statistics (void);
4676 extern void recompute_tree_invariant_for_addr_expr (tree
);
4677 extern bool needs_to_live_in_memory (const_tree
);
4678 extern tree
reconstruct_complex_type (tree
, tree
);
4679 extern int real_onep (const_tree
);
4680 extern int real_minus_onep (const_tree
);
4681 extern void init_ttree (void);
4682 extern void build_common_tree_nodes (bool, bool);
4683 extern void build_common_builtin_nodes (void);
4684 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4685 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
4686 extern tree
build_range_type (tree
, tree
, tree
);
4687 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4688 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4689 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4690 extern tree
tree_block (tree
);
4691 extern void tree_set_block (tree
, tree
);
4692 extern location_t
*block_nonartificial_location (tree
);
4693 extern location_t
tree_nonartificial_location (tree
);
4694 extern tree
block_ultimate_origin (const_tree
);
4695 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4696 extern bool virtual_method_call_p (const_tree
);
4697 extern tree
obj_type_ref_class (const_tree ref
);
4698 extern bool types_same_for_odr (const_tree type1
, const_tree type2
,
4700 extern bool contains_bitfld_component_ref_p (const_tree
);
4701 extern bool block_may_fallthru (const_tree
);
4702 extern void using_eh_for_cleanups (void);
4703 extern bool using_eh_for_cleanups_p (void);
4704 extern const char *get_tree_code_name (enum tree_code
);
4705 extern void set_call_expr_flags (tree
, int);
4706 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
4708 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4710 #define walk_tree(a,b,c,d) \
4711 walk_tree_1 (a, b, c, d, NULL)
4712 #define walk_tree_without_duplicates(a,b,c) \
4713 walk_tree_without_duplicates_1 (a, b, c, NULL)
4715 extern tree
drop_tree_overflow (tree
);
4717 /* Given a memory reference expression T, return its base address.
4718 The base address of a memory reference expression is the main
4719 object being referenced. */
4720 extern tree
get_base_address (tree t
);
4722 /* Return a tree of sizetype representing the size, in bytes, of the element
4723 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4724 extern tree
array_ref_element_size (tree
);
4726 /* Return a tree representing the upper bound of the array mentioned in
4727 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4728 extern tree
array_ref_up_bound (tree
);
4730 /* Return a tree representing the lower bound of the array mentioned in
4731 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4732 extern tree
array_ref_low_bound (tree
);
4734 /* Returns true if REF is an array reference to an array at the end of
4735 a structure. If this is the case, the array may be allocated larger
4736 than its upper bound implies. */
4737 extern bool array_at_struct_end_p (tree
);
4739 /* Return a tree representing the offset, in bytes, of the field referenced
4740 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4741 extern tree
component_ref_field_offset (tree
);
4743 extern int tree_map_base_eq (const void *, const void *);
4744 extern unsigned int tree_map_base_hash (const void *);
4745 extern int tree_map_base_marked_p (const void *);
4746 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
4747 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
4748 bool trust_type_canonical
= true);
4749 extern bool type_with_interoperable_signedness (const_tree
);
4750 /* Return simplified tree code of type that is used for canonical type merging. */
4751 inline enum tree_code
4752 tree_code_for_canonical_type_merging (enum tree_code code
)
4754 /* By C standard, each enumerated type shall be compatible with char,
4755 a signed integer, or an unsigned integer. The choice of type is
4756 implementation defined (in our case it depends on -fshort-enum).
4758 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4759 type and compare only by their signedness and precision. */
4760 if (code
== ENUMERAL_TYPE
)
4761 return INTEGER_TYPE
;
4762 /* To allow inter-operability between languages having references and
4763 C, we consider reference types and pointers alike. Note that this is
4764 not strictly necessary for C-Fortran 2008 interoperability because
4765 Fortran define C_PTR type that needs to be compatible with C pointers
4766 and we handle this one as ptr_type_node. */
4767 if (code
== REFERENCE_TYPE
)
4768 return POINTER_TYPE
;
4772 #define tree_map_eq tree_map_base_eq
4773 extern unsigned int tree_map_hash (const void *);
4774 #define tree_map_marked_p tree_map_base_marked_p
4776 #define tree_decl_map_eq tree_map_base_eq
4777 extern unsigned int tree_decl_map_hash (const void *);
4778 #define tree_decl_map_marked_p tree_map_base_marked_p
4780 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
4782 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
4784 equal (tree_decl_map
*a
, tree_decl_map
*b
)
4786 return tree_decl_map_eq (a
, b
);
4790 keep_cache_entry (tree_decl_map
*&m
)
4792 return ggc_marked_p (m
->base
.from
);
4796 #define tree_int_map_eq tree_map_base_eq
4797 #define tree_int_map_hash tree_map_base_hash
4798 #define tree_int_map_marked_p tree_map_base_marked_p
4800 #define tree_vec_map_eq tree_map_base_eq
4801 #define tree_vec_map_hash tree_decl_map_hash
4802 #define tree_vec_map_marked_p tree_map_base_marked_p
4804 /* Initialize the abstract argument list iterator object ITER with the
4805 arguments from CALL_EXPR node EXP. */
4807 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4810 iter
->n
= call_expr_nargs (exp
);
4815 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4818 iter
->n
= call_expr_nargs (exp
);
4822 /* Return the next argument from abstract argument list iterator object ITER,
4823 and advance its state. Return NULL_TREE if there are no more arguments. */
4825 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4828 if (iter
->i
>= iter
->n
)
4830 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4835 static inline const_tree
4836 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4839 if (iter
->i
>= iter
->n
)
4841 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4846 /* Initialize the abstract argument list iterator object ITER, then advance
4847 past and return the first argument. Useful in for expressions, e.g.
4848 for (arg = first_call_expr_arg (exp, &iter); arg;
4849 arg = next_call_expr_arg (&iter)) */
4851 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4853 init_call_expr_arg_iterator (exp
, iter
);
4854 return next_call_expr_arg (iter
);
4857 static inline const_tree
4858 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4860 init_const_call_expr_arg_iterator (exp
, iter
);
4861 return next_const_call_expr_arg (iter
);
4864 /* Test whether there are more arguments in abstract argument list iterator
4865 ITER, without changing its state. */
4867 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4869 return (iter
->i
< iter
->n
);
4872 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4873 (of type call_expr_arg_iterator) to hold the iteration state. */
4874 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4875 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4876 (arg) = next_call_expr_arg (&(iter)))
4878 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4879 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4880 (arg) = next_const_call_expr_arg (&(iter)))
4882 /* Return true if tree node T is a language-specific node. */
4884 is_lang_specific (const_tree t
)
4886 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4889 /* Valid builtin number. */
4890 #define BUILTIN_VALID_P(FNCODE) \
4891 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4893 /* Return the tree node for an explicit standard builtin function or NULL. */
4895 builtin_decl_explicit (enum built_in_function fncode
)
4897 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4899 return builtin_info
[(size_t)fncode
].decl
;
4902 /* Return the tree node for an implicit builtin function or NULL. */
4904 builtin_decl_implicit (enum built_in_function fncode
)
4906 size_t uns_fncode
= (size_t)fncode
;
4907 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4909 if (!builtin_info
[uns_fncode
].implicit_p
)
4912 return builtin_info
[uns_fncode
].decl
;
4915 /* Set explicit builtin function nodes and whether it is an implicit
4919 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4921 size_t ufncode
= (size_t)fncode
;
4923 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4924 && (decl
!= NULL_TREE
|| !implicit_p
));
4926 builtin_info
[ufncode
].decl
= decl
;
4927 builtin_info
[ufncode
].implicit_p
= implicit_p
;
4928 builtin_info
[ufncode
].declared_p
= false;
4931 /* Set the implicit flag for a builtin function. */
4934 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4936 size_t uns_fncode
= (size_t)fncode
;
4938 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4939 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
4941 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
4944 /* Set the declared flag for a builtin function. */
4947 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
4949 size_t uns_fncode
= (size_t)fncode
;
4951 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4952 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
4954 builtin_info
[uns_fncode
].declared_p
= declared_p
;
4957 /* Return whether the standard builtin function can be used as an explicit
4961 builtin_decl_explicit_p (enum built_in_function fncode
)
4963 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4964 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
4967 /* Return whether the standard builtin function can be used implicitly. */
4970 builtin_decl_implicit_p (enum built_in_function fncode
)
4972 size_t uns_fncode
= (size_t)fncode
;
4974 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4975 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
4976 && builtin_info
[uns_fncode
].implicit_p
);
4979 /* Return whether the standard builtin function was declared. */
4982 builtin_decl_declared_p (enum built_in_function fncode
)
4984 size_t uns_fncode
= (size_t)fncode
;
4986 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4987 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
4988 && builtin_info
[uns_fncode
].declared_p
);
4991 /* Return true if T (assumed to be a DECL) is a global variable.
4992 A variable is considered global if its storage is not automatic. */
4995 is_global_var (const_tree t
)
4997 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5000 /* Return true if VAR may be aliased. A variable is considered as
5001 maybe aliased if it has its address taken by the local TU
5002 or possibly by another TU and might be modified through a pointer. */
5005 may_be_aliased (const_tree var
)
5007 return (TREE_CODE (var
) != CONST_DECL
5008 && (TREE_PUBLIC (var
)
5009 || DECL_EXTERNAL (var
)
5010 || TREE_ADDRESSABLE (var
))
5011 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5012 && ((TREE_READONLY (var
)
5013 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5014 || (TREE_CODE (var
) == VAR_DECL
5015 && DECL_NONALIASED (var
)))));
5018 /* Return pointer to optimization flags of FNDECL. */
5019 static inline struct cl_optimization
*
5020 opts_for_fn (const_tree fndecl
)
5022 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5023 if (fn_opts
== NULL_TREE
)
5024 fn_opts
= optimization_default_node
;
5025 return TREE_OPTIMIZATION (fn_opts
);
5028 /* Return pointer to target flags of FNDECL. */
5029 static inline cl_target_option
*
5030 target_opts_for_fn (const_tree fndecl
)
5032 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5033 if (fn_opts
== NULL_TREE
)
5034 fn_opts
= target_option_default_node
;
5035 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5038 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5039 the optimization level of function fndecl. */
5040 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5042 /* For anonymous aggregate types, we need some sort of name to
5043 hold on to. In practice, this should not appear, but it should
5044 not be harmful if it does. */
5045 extern const char *anon_aggrname_format();
5046 extern bool anon_aggrname_p (const_tree
);
5048 /* The tree and const_tree overload templates. */
5052 struct int_traits
<const_tree
>
5054 static const enum precision_type precision_type
= VAR_PRECISION
;
5055 static const bool host_dependent_precision
= false;
5056 static const bool is_sign_extended
= false;
5057 static unsigned int get_precision (const_tree
);
5058 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
5063 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
5072 extended_tree (const_tree
);
5074 unsigned int get_precision () const;
5075 const HOST_WIDE_INT
*get_val () const;
5076 unsigned int get_len () const;
5080 struct int_traits
<extended_tree
<N
> >
5082 static const enum precision_type precision_type
= CONST_PRECISION
;
5083 static const bool host_dependent_precision
= false;
5084 static const bool is_sign_extended
= true;
5085 static const unsigned int precision
= N
;
5088 generic_wide_int
<extended_tree
<WIDE_INT_MAX_PRECISION
> >
5089 to_widest (const_tree
);
5091 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
5095 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
5097 return TYPE_PRECISION (TREE_TYPE (tcst
));
5100 /* Convert the tree_cst X into a wide_int of PRECISION. */
5101 inline wi::storage_ref
5102 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
5103 unsigned int precision
, const_tree x
)
5105 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
5109 inline generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
> >
5110 wi::to_widest (const_tree t
)
5115 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
5116 wi::to_offset (const_tree t
)
5122 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5125 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5130 wi::extended_tree
<N
>::get_precision () const
5136 inline const HOST_WIDE_INT
*
5137 wi::extended_tree
<N
>::get_val () const
5139 return &TREE_INT_CST_ELT (m_t
, 0);
5144 wi::extended_tree
<N
>::get_len () const
5146 if (N
== ADDR_MAX_PRECISION
)
5147 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5148 else if (N
>= WIDE_INT_MAX_PRECISION
)
5149 return TREE_INT_CST_EXT_NUNITS (m_t
);
5151 /* This class is designed to be used for specific output precisions
5152 and needs to be as fast as possible, so there is no fallback for
5159 template <typename T
>
5160 bool fits_to_tree_p (const T
&x
, const_tree
);
5162 wide_int
min_value (const_tree
);
5163 wide_int
max_value (const_tree
);
5164 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5167 template <typename T
>
5169 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5171 if (TYPE_SIGN (type
) == UNSIGNED
)
5172 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5174 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5177 /* Produce the smallest number that is represented in TYPE. The precision
5178 and sign are taken from TYPE. */
5180 wi::min_value (const_tree type
)
5182 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5185 /* Produce the largest number that is represented in TYPE. The precision
5186 and sign are taken from TYPE. */
5188 wi::max_value (const_tree type
)
5190 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5193 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5194 extending both according to their respective TYPE_SIGNs. */
5197 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5199 return wi::lts_p (wi::to_widest (t1
), wi::to_widest (t2
));
5202 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5203 extending both according to their respective TYPE_SIGNs. */
5206 tree_int_cst_le (const_tree t1
, const_tree t2
)
5208 return wi::les_p (wi::to_widest (t1
), wi::to_widest (t2
));
5211 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5212 are both INTEGER_CSTs and their values are extended according to their
5213 respective TYPE_SIGNs. */
5216 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5218 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5221 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5222 but none of these files are allowed to be included from front ends.
5223 They should be split in two. One suitable for the FEs, the other suitable
5226 /* Assign the RTX to declaration. */
5227 extern void set_decl_rtl (tree
, rtx
);
5228 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5230 /* Given an expression EXP that is a handled_component_p,
5231 look for the ultimate containing object, which is returned and specify
5232 the access position and size. */
5233 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5234 tree
*, machine_mode
*, int *, int *,
5237 extern tree
build_personality_function (const char *);
5239 struct GTY(()) int_n_trees_t
{
5240 /* These parts are initialized at runtime */
5245 /* This is also in machmode.h */
5246 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5247 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5249 /* Like bit_position, but return as an integer. It must be representable in
5250 that way (since it could be a signed value, we don't have the
5251 option of returning -1 like int_size_in_byte can. */
5253 inline HOST_WIDE_INT
5254 int_bit_position (const_tree field
)
5256 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field
)), BITS_PER_UNIT_LOG
)
5257 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5260 /* Return true if it makes sense to consider alias set for a type T. */
5263 type_with_alias_set_p (const_tree t
)
5265 /* Function and method types are never accessed as memory locations. */
5266 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5269 if (COMPLETE_TYPE_P (t
))
5272 /* Incomplete types can not be accessed in general except for arrays
5273 where we can fetch its element despite we have no array bounds. */
5274 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5280 extern void gt_ggc_mx (tree
&);
5281 extern void gt_pch_nx (tree
&);
5282 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5284 extern bool nonnull_arg_p (const_tree
);
5286 #endif /* GCC_TREE_H */