1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2014 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"
27 /* These includes are required here because they provide declarations
28 used by inline functions in this file.
30 FIXME - Move these users elsewhere? */
31 #include "fold-const.h"
33 /* Macros for initializing `tree_contains_struct'. */
34 #define MARK_TS_BASE(C) \
36 tree_contains_struct[C][TS_BASE] = 1; \
39 #define MARK_TS_TYPED(C) \
42 tree_contains_struct[C][TS_TYPED] = 1; \
45 #define MARK_TS_COMMON(C) \
48 tree_contains_struct[C][TS_COMMON] = 1; \
51 #define MARK_TS_TYPE_COMMON(C) \
54 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
57 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
59 MARK_TS_TYPE_COMMON (C); \
60 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
63 #define MARK_TS_DECL_MINIMAL(C) \
66 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
69 #define MARK_TS_DECL_COMMON(C) \
71 MARK_TS_DECL_MINIMAL (C); \
72 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
75 #define MARK_TS_DECL_WRTL(C) \
77 MARK_TS_DECL_COMMON (C); \
78 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
81 #define MARK_TS_DECL_WITH_VIS(C) \
83 MARK_TS_DECL_WRTL (C); \
84 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
87 #define MARK_TS_DECL_NON_COMMON(C) \
89 MARK_TS_DECL_WITH_VIS (C); \
90 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
94 /* Returns the string representing CLASS. */
96 #define TREE_CODE_CLASS_STRING(CLASS)\
97 tree_code_class_strings[(int) (CLASS)]
99 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
101 /* Nonzero if NODE represents an exceptional code. */
103 #define EXCEPTIONAL_CLASS_P(NODE)\
104 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
106 /* Nonzero if NODE represents a constant. */
108 #define CONSTANT_CLASS_P(NODE)\
109 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
111 /* Nonzero if NODE represents a type. */
113 #define TYPE_P(NODE)\
114 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
116 /* Nonzero if NODE represents a declaration. */
118 #define DECL_P(NODE)\
119 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
121 /* True if NODE designates a variable declaration. */
122 #define VAR_P(NODE) \
123 (TREE_CODE (NODE) == VAR_DECL)
125 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
127 #define VAR_OR_FUNCTION_DECL_P(DECL)\
128 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
130 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
131 ascending code order. */
133 #define INDIRECT_REF_P(NODE)\
134 (TREE_CODE (NODE) == INDIRECT_REF)
136 /* Nonzero if NODE represents a reference. */
138 #define REFERENCE_CLASS_P(NODE)\
139 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
141 /* Nonzero if NODE represents a comparison. */
143 #define COMPARISON_CLASS_P(NODE)\
144 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
146 /* Nonzero if NODE represents a unary arithmetic expression. */
148 #define UNARY_CLASS_P(NODE)\
149 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
151 /* Nonzero if NODE represents a binary arithmetic expression. */
153 #define BINARY_CLASS_P(NODE)\
154 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
156 /* Nonzero if NODE represents a statement expression. */
158 #define STATEMENT_CLASS_P(NODE)\
159 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
161 /* Nonzero if NODE represents a function call-like expression with a
162 variable-length operand vector. */
164 #define VL_EXP_CLASS_P(NODE)\
165 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
167 /* Nonzero if NODE represents any other expression. */
169 #define EXPRESSION_CLASS_P(NODE)\
170 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
172 /* Returns nonzero iff NODE represents a type or declaration. */
174 #define IS_TYPE_OR_DECL_P(NODE)\
175 (TYPE_P (NODE) || DECL_P (NODE))
177 /* Returns nonzero iff CLASS is the tree-code class of an
180 #define IS_EXPR_CODE_CLASS(CLASS)\
181 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
183 /* Returns nonzero iff NODE is an expression of some kind. */
185 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
187 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
190 /* Helper macros for math builtins. */
192 #define BUILTIN_EXP10_P(FN) \
193 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
194 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
196 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
197 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
198 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
200 #define BUILTIN_SQRT_P(FN) \
201 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
203 #define BUILTIN_CBRT_P(FN) \
204 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
206 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
208 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
209 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
210 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
212 #define NULL_TREE (tree) NULL
214 /* Define accessors for the fields that all tree nodes have
215 (though some fields are not used for all kinds of nodes). */
217 /* The tree-code says what kind of node it is.
218 Codes are defined in tree.def. */
219 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
220 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
222 /* When checking is enabled, errors will be generated if a tree node
223 is accessed incorrectly. The macros die with a fatal error. */
224 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
226 #define TREE_CHECK(T, CODE) \
227 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
229 #define TREE_NOT_CHECK(T, CODE) \
230 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
232 #define TREE_CHECK2(T, CODE1, CODE2) \
233 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
235 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
236 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
238 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
239 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
241 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
242 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
243 (CODE1), (CODE2), (CODE3)))
245 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
246 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
247 (CODE1), (CODE2), (CODE3), (CODE4)))
249 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
250 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
251 (CODE1), (CODE2), (CODE3), (CODE4)))
253 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
254 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
255 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
257 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
258 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
259 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
261 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
262 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
264 #define TREE_CLASS_CHECK(T, CLASS) \
265 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
267 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
268 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
270 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
271 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
273 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
274 (omp_clause_range_check ((T), (CODE1), (CODE2), \
275 __FILE__, __LINE__, __FUNCTION__))
277 /* These checks have to be special cased. */
278 #define EXPR_CHECK(T) \
279 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
281 /* These checks have to be special cased. */
282 #define NON_TYPE_CHECK(T) \
283 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
285 #define TREE_INT_CST_ELT_CHECK(T, I) \
286 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
288 #define TREE_VEC_ELT_CHECK(T, I) \
289 (*(CONST_CAST2 (tree *, typeof (T)*, \
290 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
292 #define OMP_CLAUSE_ELT_CHECK(T, I) \
293 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
295 /* Special checks for TREE_OPERANDs. */
296 #define TREE_OPERAND_CHECK(T, I) \
297 (*(CONST_CAST2 (tree*, typeof (T)*, \
298 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
300 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
301 (*(tree_operand_check_code ((T), (CODE), (I), \
302 __FILE__, __LINE__, __FUNCTION__)))
304 /* Nodes are chained together for many purposes.
305 Types are chained together to record them for being output to the debugger
306 (see the function `chain_type').
307 Decls in the same scope are chained together to record the contents
309 Statement nodes for successive statements used to be chained together.
310 Often lists of things are represented by TREE_LIST nodes that
311 are chained together. */
313 #define TREE_CHAIN(NODE) \
314 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
316 /* In all nodes that are expressions, this is the data type of the expression.
317 In POINTER_TYPE nodes, this is the type that the pointer points to.
318 In ARRAY_TYPE nodes, this is the type of the elements.
319 In VECTOR_TYPE nodes, this is the type of the elements. */
320 #define TREE_TYPE(NODE) \
321 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
323 extern void tree_contains_struct_check_failed (const_tree,
324 const enum tree_node_structure_enum,
325 const char *, int, const char *)
328 extern void tree_check_failed (const_tree, const char *, int, const char *,
329 ...) ATTRIBUTE_NORETURN;
330 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
331 ...) ATTRIBUTE_NORETURN;
332 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
333 const char *, int, const char *)
335 extern void tree_range_check_failed (const_tree, const char *, int,
336 const char *, enum tree_code,
339 extern void tree_not_class_check_failed (const_tree,
340 const enum tree_code_class,
341 const char *, int, const char *)
343 extern void tree_int_cst_elt_check_failed (int, int, const char *,
346 extern void tree_vec_elt_check_failed (int, int, const char *,
349 extern void phi_node_elt_check_failed (int, int, const char *,
352 extern void tree_operand_check_failed (int, const_tree,
353 const char *, int, const char *)
355 extern void omp_clause_check_failed (const_tree, const char *, int,
356 const char *, enum omp_clause_code)
358 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
361 extern void omp_clause_range_check_failed (const_tree, const char *, int,
362 const char *, enum omp_clause_code,
363 enum omp_clause_code)
366 #else /* not ENABLE_TREE_CHECKING, or not gcc */
368 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
369 #define TREE_CHECK(T, CODE) (T)
370 #define TREE_NOT_CHECK(T, CODE) (T)
371 #define TREE_CHECK2(T, CODE1, CODE2) (T)
372 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
373 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
374 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
375 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
376 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
377 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
378 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
379 #define TREE_CLASS_CHECK(T, CODE) (T)
380 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
381 #define EXPR_CHECK(T) (T)
382 #define NON_TYPE_CHECK(T) (T)
383 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
384 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
385 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
386 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
387 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
388 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
389 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
391 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
392 #define TREE_TYPE(NODE) ((NODE)->typed.type)
396 #define TREE_BLOCK(NODE) (tree_block (NODE))
397 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
399 #include "tree-check.h"
401 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
402 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
403 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
404 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
405 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
406 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
407 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
408 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
409 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
410 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
411 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
413 #define RECORD_OR_UNION_CHECK(T) \
414 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
415 #define NOT_RECORD_OR_UNION_CHECK(T) \
416 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
418 #define NUMERICAL_TYPE_CHECK(T) \
419 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
422 /* Here is how primitive or already-canonicalized types' hash codes
424 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
426 /* A simple hash function for an arbitrary tree node. This must not be
427 used in hash tables which are saved to a PCH. */
428 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
430 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
431 #define CONVERT_EXPR_CODE_P(CODE) \
432 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
434 /* Similarly, but accept an expressions instead of a tree code. */
435 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
437 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
439 #define CASE_CONVERT \
443 /* Given an expression as a tree, strip any conversion that generates
444 no instruction. Accepts both tree and const_tree arguments since
445 we are not modifying the tree itself. */
447 #define STRIP_NOPS(EXP) \
448 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
450 /* Like STRIP_NOPS, but don't let the signedness change either. */
452 #define STRIP_SIGN_NOPS(EXP) \
453 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
455 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
457 #define STRIP_TYPE_NOPS(EXP) \
458 while ((CONVERT_EXPR_P (EXP) \
459 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
460 && TREE_OPERAND (EXP, 0) != error_mark_node \
461 && (TREE_TYPE (EXP) \
462 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
463 (EXP) = TREE_OPERAND (EXP, 0)
465 /* Remove unnecessary type conversions according to
466 tree_ssa_useless_type_conversion. */
468 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
469 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
471 /* Nonzero if TYPE represents a vector type. */
473 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
475 /* Nonzero if TYPE represents an integral type. Note that we do not
476 include COMPLEX types here. Keep these checks in ascending code
479 #define INTEGRAL_TYPE_P(TYPE) \
480 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
481 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
482 || TREE_CODE (TYPE) == INTEGER_TYPE)
484 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
486 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
487 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
489 /* Nonzero if TYPE represents a saturating fixed-point type. */
491 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
492 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
494 /* Nonzero if TYPE represents a fixed-point type. */
496 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
498 /* Nonzero if TYPE represents a scalar floating-point type. */
500 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
502 /* Nonzero if TYPE represents a complex floating-point type. */
504 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
505 (TREE_CODE (TYPE) == COMPLEX_TYPE \
506 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
508 /* Nonzero if TYPE represents a vector integer type. */
510 #define VECTOR_INTEGER_TYPE_P(TYPE) \
511 (VECTOR_TYPE_P (TYPE) \
512 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
515 /* Nonzero if TYPE represents a vector floating-point type. */
517 #define VECTOR_FLOAT_TYPE_P(TYPE) \
518 (VECTOR_TYPE_P (TYPE) \
519 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
521 /* Nonzero if TYPE represents a floating-point type, including complex
522 and vector floating-point types. The vector and complex check does
523 not use the previous two macros to enable early folding. */
525 #define FLOAT_TYPE_P(TYPE) \
526 (SCALAR_FLOAT_TYPE_P (TYPE) \
527 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
528 || VECTOR_TYPE_P (TYPE)) \
529 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
531 /* Nonzero if TYPE represents a decimal floating-point type. */
532 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
533 (SCALAR_FLOAT_TYPE_P (TYPE) \
534 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
536 /* Nonzero if TYPE is a record or union type. */
537 #define RECORD_OR_UNION_TYPE_P(TYPE) \
538 (TREE_CODE (TYPE) == RECORD_TYPE \
539 || TREE_CODE (TYPE) == UNION_TYPE \
540 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
542 /* Nonzero if TYPE represents an aggregate (multi-component) type.
543 Keep these checks in ascending code order. */
545 #define AGGREGATE_TYPE_P(TYPE) \
546 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
548 /* Nonzero if TYPE represents a pointer or reference type.
549 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
550 ascending code order. */
552 #define POINTER_TYPE_P(TYPE) \
553 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
555 /* Nonzero if TYPE represents a pointer to function. */
556 #define FUNCTION_POINTER_TYPE_P(TYPE) \
557 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
559 /* Nonzero if this type is a complete type. */
560 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
562 /* Nonzero if this type is the (possibly qualified) void type. */
563 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
565 /* Nonzero if this type is complete or is cv void. */
566 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
567 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
569 /* Nonzero if this type is complete or is an array with unspecified bound. */
570 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
571 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
573 /* Define many boolean fields that all tree nodes have. */
575 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
576 of this is needed. So it cannot be in a register.
577 In a FUNCTION_DECL it has no meaning.
578 In LABEL_DECL nodes, it means a goto for this label has been seen
579 from a place outside all binding contours that restore stack levels.
580 In an artificial SSA_NAME that points to a stack partition with at least
581 two variables, it means that at least one variable has TREE_ADDRESSABLE.
582 In ..._TYPE nodes, it means that objects of this type must be fully
583 addressable. This means that pieces of this object cannot go into
584 register parameters, for example. If this a function type, this
585 means that the value must be returned in memory.
586 In CONSTRUCTOR nodes, it means object constructed must be in memory.
587 In IDENTIFIER_NODEs, this means that some extern decl for this name
588 had its address taken. That matters for inline functions.
589 In a STMT_EXPR, it means we want the result of the enclosed expression. */
590 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
592 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
593 exit of a function. Calls for which this is true are candidates for tail
594 call optimizations. */
595 #define CALL_EXPR_TAILCALL(NODE) \
596 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
598 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
599 CASE_LOW operand has been processed. */
600 #define CASE_LOW_SEEN(NODE) \
601 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
603 #define PREDICT_EXPR_OUTCOME(NODE) \
604 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
605 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
606 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
607 #define PREDICT_EXPR_PREDICTOR(NODE) \
608 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
610 /* In a VAR_DECL, nonzero means allocate static storage.
611 In a FUNCTION_DECL, nonzero if function has been defined.
612 In a CONSTRUCTOR, nonzero means allocate static storage. */
613 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
615 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
616 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
618 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
619 should only be executed if an exception is thrown, not on normal exit
621 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
623 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
624 separate cleanup in honor_protect_cleanup_actions. */
625 #define TRY_CATCH_IS_CLEANUP(NODE) \
626 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
628 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
629 CASE_HIGH operand has been processed. */
630 #define CASE_HIGH_SEEN(NODE) \
631 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
633 /* Used to mark scoped enums. */
634 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
636 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
637 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
639 /* In an expr node (usually a conversion) this means the node was made
640 implicitly and should not lead to any sort of warning. In a decl node,
641 warnings concerning the decl should be suppressed. This is used at
642 least for used-before-set warnings, and it set after one warning is
644 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
646 /* Used to indicate that this TYPE represents a compiler-generated entity. */
647 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
649 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
650 this string as an argument. */
651 #define TREE_SYMBOL_REFERENCED(NODE) \
652 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
654 /* Nonzero in a pointer or reference type means the data pointed to
655 by this type can alias anything. */
656 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
657 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
659 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
660 there was an overflow in folding. */
662 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
664 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
666 #define TREE_OVERFLOW_P(EXPR) \
667 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
669 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
670 nonzero means name is to be accessible from outside this translation unit.
671 In an IDENTIFIER_NODE, nonzero means an external declaration
672 accessible from outside this translation unit was previously seen
673 for this name in an inner scope. */
674 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
676 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
677 of cached values, or is something else. */
678 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
680 /* In a SAVE_EXPR, indicates that the original expression has already
681 been substituted with a VAR_DECL that contains the value. */
682 #define SAVE_EXPR_RESOLVED_P(NODE) \
683 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
685 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
687 #define CALL_EXPR_VA_ARG_PACK(NODE) \
688 (CALL_EXPR_CHECK (NODE)->base.public_flag)
690 /* In any expression, decl, or constant, nonzero means it has side effects or
691 reevaluation of the whole expression could produce a different value.
692 This is set if any subexpression is a function call, a side effect or a
693 reference to a volatile variable. In a ..._DECL, this is set only if the
694 declaration said `volatile'. This will never be set for a constant. */
695 #define TREE_SIDE_EFFECTS(NODE) \
696 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
698 /* In a LABEL_DECL, nonzero means this label had its address taken
699 and therefore can never be deleted and is a jump target for
701 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
703 /* Nonzero means this expression is volatile in the C sense:
704 its address should be of type `volatile WHATEVER *'.
705 In other words, the declared item is volatile qualified.
706 This is used in _DECL nodes and _REF nodes.
707 On a FUNCTION_DECL node, this means the function does not
708 return normally. This is the same effect as setting
709 the attribute noreturn on the function in C.
711 In a ..._TYPE node, means this type is volatile-qualified.
712 But use TYPE_VOLATILE instead of this macro when the node is a type,
713 because eventually we may make that a different bit.
715 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
716 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
718 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
719 accessing the memory pointed to won't generate a trap. However,
720 this only applies to an object when used appropriately: it doesn't
721 mean that writing a READONLY mem won't trap.
723 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
724 (or slice of the array) always belongs to the range of the array.
725 I.e. that the access will not trap, provided that the access to
726 the base to the array will not trap. */
727 #define TREE_THIS_NOTRAP(NODE) \
728 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
729 ARRAY_RANGE_REF)->base.nothrow_flag)
731 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
732 nonzero means it may not be the lhs of an assignment.
733 Nonzero in a FUNCTION_DECL means this function should be treated
734 as "const" function (can only read its arguments). */
735 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
737 /* Value of expression is constant. Always on in all ..._CST nodes. May
738 also appear in an expression or decl where the value is constant. */
739 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
741 /* Nonzero if NODE, a type, has had its sizes gimplified. */
742 #define TYPE_SIZES_GIMPLIFIED(NODE) \
743 (TYPE_CHECK (NODE)->base.constant_flag)
745 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
746 #define DECL_UNSIGNED(NODE) \
747 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
749 /* In integral and pointer types, means an unsigned type. */
750 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
752 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
753 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
755 /* True if overflow wraps around for the given integral type. That
756 is, TYPE_MAX + 1 == TYPE_MIN. */
757 #define TYPE_OVERFLOW_WRAPS(TYPE) \
758 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
760 /* True if overflow is undefined for the given integral type. We may
761 optimize on the assumption that values in the type never overflow.
763 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
764 must issue a warning based on warn_strict_overflow. In some cases
765 it will be appropriate to issue the warning immediately, and in
766 other cases it will be appropriate to simply set a flag and let the
767 caller decide whether a warning is appropriate or not. */
768 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
769 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
771 /* True if overflow for the given integral type should issue a
773 #define TYPE_OVERFLOW_TRAPS(TYPE) \
774 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
776 /* True if pointer types have undefined overflow. */
777 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
779 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
780 Nonzero in a FUNCTION_DECL means that the function has been compiled.
781 This is interesting in an inline function, since it might not need
782 to be compiled separately.
783 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
784 or TYPE_DECL if the debugging info for the type has been written.
785 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
786 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
788 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
790 /* Nonzero in a _DECL if the name is used in its scope.
791 Nonzero in an expr node means inhibit warning if value is unused.
792 In IDENTIFIER_NODEs, this means that some extern decl for this name
794 In a BLOCK, this means that the block contains variables that are used. */
795 #define TREE_USED(NODE) ((NODE)->base.used_flag)
797 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
798 throw an exception. In a CALL_EXPR, nonzero means the call cannot
799 throw. We can't easily check the node type here as the C++
800 frontend also uses this flag (for AGGR_INIT_EXPR). */
801 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
803 /* In a CALL_EXPR, means that it's safe to use the target of the call
804 expansion as the return slot for a call that returns in memory. */
805 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
806 (CALL_EXPR_CHECK (NODE)->base.private_flag)
808 /* Cilk keywords accessors. */
809 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
811 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
812 passed by invisible reference (and the TREE_TYPE is a pointer to the true
814 #define DECL_BY_REFERENCE(NODE) \
815 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
816 RESULT_DECL)->decl_common.decl_by_reference_flag)
818 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
820 #define DECL_READ_P(NODE) \
821 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
823 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
824 attempting to share the stack slot with some other variable. */
825 #define DECL_NONSHAREABLE(NODE) \
826 (TREE_CHECK2 (NODE, VAR_DECL, \
827 RESULT_DECL)->decl_common.decl_nonshareable_flag)
829 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
830 thunked-to function. */
831 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
833 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
834 it has been built for the declaration of a variable-sized object. */
835 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
836 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
838 /* In a type, nonzero means that all objects of the type are guaranteed by the
839 language or front-end to be properly aligned, so we can indicate that a MEM
840 of this type is aligned at least to the alignment of the type, even if it
841 doesn't appear that it is. We see this, for example, in object-oriented
842 languages where a tag field may show this is an object of a more-aligned
843 variant of the more generic type.
845 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
847 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
849 /* Used in classes in C++. */
850 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
851 /* Used in classes in C++. */
852 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
854 /* True if reference type NODE is a C++ rvalue reference. */
855 #define TYPE_REF_IS_RVALUE(NODE) \
856 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
858 /* Nonzero in a _DECL if the use of the name is defined as a
859 deprecated feature by __attribute__((deprecated)). */
860 #define TREE_DEPRECATED(NODE) \
861 ((NODE)->base.deprecated_flag)
863 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
864 uses are to be substituted for uses of the TREE_CHAINed identifier. */
865 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
866 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
868 /* In fixed-point types, means a saturating type. */
869 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
871 /* These flags are available for each language front end to use internally. */
872 #define TREE_LANG_FLAG_0(NODE) \
873 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
874 #define TREE_LANG_FLAG_1(NODE) \
875 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
876 #define TREE_LANG_FLAG_2(NODE) \
877 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
878 #define TREE_LANG_FLAG_3(NODE) \
879 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
880 #define TREE_LANG_FLAG_4(NODE) \
881 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
882 #define TREE_LANG_FLAG_5(NODE) \
883 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
884 #define TREE_LANG_FLAG_6(NODE) \
885 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
887 /* Define additional fields and accessors for nodes representing constants. */
889 #define TREE_INT_CST_NUNITS(NODE) \
890 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
891 #define TREE_INT_CST_EXT_NUNITS(NODE) \
892 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
893 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
894 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
895 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
896 #define TREE_INT_CST_LOW(NODE) \
897 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
899 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
900 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
902 #define TREE_FIXED_CST_PTR(NODE) \
903 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
904 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
906 /* In a STRING_CST */
907 /* In C terms, this is sizeof, not strlen. */
908 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
909 #define TREE_STRING_POINTER(NODE) \
910 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
912 /* In a COMPLEX_CST node. */
913 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
914 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
916 /* In a VECTOR_CST node. */
917 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
918 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
919 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
921 /* Define fields and accessors for some special-purpose tree nodes. */
923 #define IDENTIFIER_LENGTH(NODE) \
924 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
925 #define IDENTIFIER_POINTER(NODE) \
926 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
927 #define IDENTIFIER_HASH_VALUE(NODE) \
928 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
930 /* Translate a hash table identifier pointer to a tree_identifier
931 pointer, and vice versa. */
933 #define HT_IDENT_TO_GCC_IDENT(NODE) \
934 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
935 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
937 /* In a TREE_LIST node. */
938 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
939 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
941 /* In a TREE_VEC node. */
942 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
943 #define TREE_VEC_END(NODE) \
944 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
946 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
948 /* In a CONSTRUCTOR node. */
949 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
950 #define CONSTRUCTOR_ELT(NODE,IDX) \
951 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
952 #define CONSTRUCTOR_NELTS(NODE) \
953 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
954 #define CONSTRUCTOR_NO_CLEARING(NODE) \
955 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
957 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
958 value of each element (stored within VAL). IX must be a scratch variable
959 of unsigned integer type. */
960 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
961 for (IX = 0; (IX >= vec_safe_length (V)) \
963 : ((VAL = (*(V))[IX].value), \
967 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
968 the value of each element (stored within VAL) and its index (stored
969 within INDEX). IX must be a scratch variable of unsigned integer type. */
970 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
971 for (IX = 0; (IX >= vec_safe_length (V)) \
973 : (((void) (VAL = (*V)[IX].value)), \
974 (INDEX = (*V)[IX].index), \
978 /* Append a new constructor element to V, with the specified INDEX and VAL. */
979 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
981 constructor_elt _ce___ = {INDEX, VALUE}; \
982 vec_safe_push ((V), _ce___); \
985 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
986 constructor output purposes. */
987 #define CONSTRUCTOR_BITFIELD_P(NODE) \
988 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
990 /* True if NODE is a clobber right hand side, an expression of indeterminate
991 value that clobbers the LHS in a copy instruction. We use a volatile
992 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
993 In particular the volatile flag causes us to not prematurely remove
994 such clobber instructions. */
995 #define TREE_CLOBBER_P(NODE) \
996 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
998 /* Define fields and accessors for some nodes that represent expressions. */
1000 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1001 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1002 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1003 && integer_zerop (TREE_OPERAND (NODE, 0)))
1005 /* In ordinary expression nodes. */
1006 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1007 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1009 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1010 length. Its value includes the length operand itself; that is,
1011 the minimum valid length is 1.
1012 Note that we have to bypass the use of TREE_OPERAND to access
1013 that field to avoid infinite recursion in expanding the macros. */
1014 #define VL_EXP_OPERAND_LENGTH(NODE) \
1015 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1017 /* Nonzero if is_gimple_debug() may possibly hold. */
1018 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1020 /* In a LOOP_EXPR node. */
1021 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1023 /* The source location of this expression. Non-tree_exp nodes such as
1024 decls and constants can be shared among multiple locations, so
1026 #define EXPR_LOCATION(NODE) \
1027 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1028 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1029 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1030 != UNKNOWN_LOCATION)
1031 /* The location to be used in a diagnostic about this expression. Do not
1032 use this macro if the location will be assigned to other expressions. */
1033 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1034 ? (NODE)->exp.locus : (LOCUS))
1035 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1036 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1038 /* True if a tree is an expression or statement that can have a
1040 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1042 extern void protected_set_expr_location (tree, location_t);
1044 /* In a TARGET_EXPR node. */
1045 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1046 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1047 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1049 /* DECL_EXPR accessor. This gives access to the DECL associated with
1050 the given declaration statement. */
1051 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1053 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1055 /* COMPOUND_LITERAL_EXPR accessors. */
1056 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1057 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1058 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1059 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1061 /* SWITCH_EXPR accessors. These give access to the condition, body and
1062 original condition type (before any compiler conversions)
1063 of the switch statement, respectively. */
1064 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1065 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1066 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1068 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1069 of a case label, respectively. */
1070 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1071 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1072 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1073 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1075 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1076 corresponding MEM_REF operands. */
1077 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1078 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1079 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1080 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1081 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1083 /* The operands of a BIND_EXPR. */
1084 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1085 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1086 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1088 /* GOTO_EXPR accessor. This gives access to the label associated with
1089 a goto statement. */
1090 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1092 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1093 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1094 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1096 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1097 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1098 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1099 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1100 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1101 /* Nonzero if we want to create an ASM_INPUT instead of an
1102 ASM_OPERAND with no operands. */
1103 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1104 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1106 /* COND_EXPR accessors. */
1107 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1108 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1109 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1111 /* Accessors for the chains of recurrences. */
1112 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1113 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1114 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1115 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1117 /* LABEL_EXPR accessor. This gives access to the label associated with
1118 the given label expression. */
1119 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1121 /* CATCH_EXPR accessors. */
1122 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1123 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1125 /* EH_FILTER_EXPR accessors. */
1126 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1127 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1129 /* OBJ_TYPE_REF accessors. */
1130 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1131 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1132 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1134 /* ASSERT_EXPR accessors. */
1135 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1136 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1138 /* CALL_EXPR accessors. */
1139 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1140 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1141 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1142 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1143 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1145 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1146 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1147 the argument count is zero when checking is enabled. Instead, do
1148 the pointer arithmetic to advance past the 3 fixed operands in a
1149 CALL_EXPR. That produces a valid pointer to just past the end of the
1150 operand array, even if it's not valid to dereference it. */
1151 #define CALL_EXPR_ARGP(NODE) \
1152 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1154 /* TM directives and accessors. */
1155 #define TRANSACTION_EXPR_BODY(NODE) \
1156 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1157 #define TRANSACTION_EXPR_OUTER(NODE) \
1158 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1159 #define TRANSACTION_EXPR_RELAXED(NODE) \
1160 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1162 /* OpenMP directive and clause accessors. */
1164 #define OMP_BODY(NODE) \
1165 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1166 #define OMP_CLAUSES(NODE) \
1167 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1169 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1170 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1172 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1173 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1175 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1176 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1177 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1179 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1180 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1181 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1182 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1183 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1184 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1185 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1187 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1188 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1190 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1192 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1193 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1195 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1197 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1199 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1201 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1202 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1204 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1205 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1207 #define OMP_TARGET_DATA_BODY(NODE) \
1208 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1209 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1210 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1212 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1213 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1215 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1216 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1218 #define OMP_CLAUSE_SIZE(NODE) \
1219 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1223 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1224 #define OMP_CLAUSE_DECL(NODE) \
1225 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1226 OMP_CLAUSE_PRIVATE, \
1227 OMP_CLAUSE__LOOPTEMP_), 0)
1228 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1229 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1230 != UNKNOWN_LOCATION)
1231 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1233 /* True on an OMP_SECTION statement that was the last lexical member.
1234 This status is meaningful in the implementation of lastprivate. */
1235 #define OMP_SECTION_LAST(NODE) \
1236 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1238 /* True on an OMP_PARALLEL statement if it represents an explicit
1239 combined parallel work-sharing constructs. */
1240 #define OMP_PARALLEL_COMBINED(NODE) \
1241 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1243 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1244 as opposed to relaxed. */
1245 #define OMP_ATOMIC_SEQ_CST(NODE) \
1246 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1247 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1249 /* True on a PRIVATE clause if its decl is kept around for debugging
1250 information only and its DECL_VALUE_EXPR is supposed to point
1251 to what it has been remapped to. */
1252 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1253 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1255 /* True on a PRIVATE clause if ctor needs access to outer region's
1257 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1258 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1260 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1261 decl is present in the chain. */
1262 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1263 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1264 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1265 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1266 OMP_CLAUSE_LASTPRIVATE),\
1268 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1269 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1271 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1272 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1273 #define OMP_CLAUSE_IF_EXPR(NODE) \
1274 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1275 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1276 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1277 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1278 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1280 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1281 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1283 #define OMP_CLAUSE_MAP_KIND(NODE) \
1284 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1286 /* Nonzero if this map clause is for array (rather than pointer) based array
1287 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1288 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1289 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1290 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1292 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1293 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1295 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1296 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1297 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1298 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1299 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1300 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1302 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1303 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1304 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1305 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1306 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1307 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1308 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1309 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1310 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1311 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1312 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1313 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1315 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1316 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1317 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1318 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1320 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1321 are always initialized inside of the loop construct, false otherwise. */
1322 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1323 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1325 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1326 are declared inside of the simd construct. */
1327 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1328 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1330 /* True if a LINEAR clause has a stride that is variable. */
1331 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1332 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1334 /* True if a LINEAR clause is for an array or allocatable variable that
1335 needs special handling by the frontend. */
1336 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1337 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1339 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1340 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1342 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1343 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1345 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1346 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1348 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1349 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1351 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1352 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1354 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1355 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1356 OMP_CLAUSE_THREAD_LIMIT), 0)
1358 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1359 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1361 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1362 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1363 OMP_CLAUSE_DIST_SCHEDULE), 0)
1365 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1366 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1368 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1369 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1371 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1372 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1374 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1375 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1377 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1378 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1380 /* SSA_NAME accessors. */
1382 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1383 if there is no name associated with it. */
1384 #define SSA_NAME_IDENTIFIER(NODE) \
1385 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1386 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1387 ? (NODE)->ssa_name.var \
1388 : DECL_NAME ((NODE)->ssa_name.var)) \
1391 /* Returns the variable being referenced. This can be NULL_TREE for
1392 temporaries not associated with any user variable.
1393 Once released, this is the only field that can be relied upon. */
1394 #define SSA_NAME_VAR(NODE) \
1395 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1396 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1397 ? NULL_TREE : (NODE)->ssa_name.var)
1399 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1400 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1402 /* Returns the statement which defines this SSA name. */
1403 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1405 /* Returns the SSA version number of this SSA name. Note that in
1406 tree SSA, version numbers are not per variable and may be recycled. */
1407 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1409 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1410 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1412 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1413 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1415 /* Nonzero if this SSA_NAME expression is currently on the free list of
1416 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1417 has no meaning for an SSA_NAME. */
1418 #define SSA_NAME_IN_FREE_LIST(NODE) \
1419 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1421 /* Nonzero if this SSA_NAME is the default definition for the
1422 underlying symbol. A default SSA name is created for symbol S if
1423 the very first reference to S in the function is a read operation.
1424 Default definitions are always created by an empty statement and
1425 belong to no basic block. */
1426 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1427 SSA_NAME_CHECK (NODE)->base.default_def_flag
1429 /* Attributes for SSA_NAMEs for pointer-type variables. */
1430 #define SSA_NAME_PTR_INFO(N) \
1431 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1433 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1434 #define SSA_NAME_ANTI_RANGE_P(N) \
1435 SSA_NAME_CHECK (N)->base.static_flag
1437 /* The type of range described by SSA_NAME_RANGE_INFO. */
1438 #define SSA_NAME_RANGE_TYPE(N) \
1439 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1441 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1442 #define SSA_NAME_RANGE_INFO(N) \
1443 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1445 /* Return the immediate_use information for an SSA_NAME. */
1446 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1448 #define OMP_CLAUSE_CODE(NODE) \
1449 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1451 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1452 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1454 #define OMP_CLAUSE_OPERAND(NODE, I) \
1455 OMP_CLAUSE_ELT_CHECK (NODE, I)
1457 /* In a BLOCK node. */
1458 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1459 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1460 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1461 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1462 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1463 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1464 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1465 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1466 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1467 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1468 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1470 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1471 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1473 /* An index number for this block. These values are not guaranteed to
1474 be unique across functions -- whether or not they are depends on
1475 the debugging output format in use. */
1476 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1478 /* If block reordering splits a lexical block into discontiguous
1479 address ranges, we'll make a copy of the original block.
1481 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1482 In that case, we have one source block that has been replicated
1483 (through inlining or unrolling) into many logical blocks, and that
1484 these logical blocks have different physical variables in them.
1486 In this case, we have one logical block split into several
1487 non-contiguous address ranges. Most debug formats can't actually
1488 represent this idea directly, so we fake it by creating multiple
1489 logical blocks with the same variables in them. However, for those
1490 that do support non-contiguous regions, these allow the original
1491 logical block to be reconstructed, along with the set of address
1494 One of the logical block fragments is arbitrarily chosen to be
1495 the ORIGIN. The other fragments will point to the origin via
1496 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1497 be null. The list of fragments will be chained through
1498 BLOCK_FRAGMENT_CHAIN from the origin. */
1500 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1501 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1503 /* For an inlined function, this gives the location where it was called
1504 from. This is only set in the top level block, which corresponds to the
1505 inlined function scope. This is used in the debug output routines. */
1507 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1509 /* This gives the location of the end of the block, useful to attach
1510 code implicitly generated for outgoing paths. */
1512 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1514 /* Define fields and accessors for nodes representing data types. */
1516 /* See tree.def for documentation of the use of these fields.
1517 Look at the documentation of the various ..._TYPE tree codes.
1519 Note that the type.values, type.minval, and type.maxval fields are
1520 overloaded and used for different macros in different kinds of types.
1521 Each macro must check to ensure the tree node is of the proper kind of
1522 type. Note also that some of the front-ends also overload these fields,
1523 so they must be checked as well. */
1525 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1526 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1527 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1528 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1529 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1530 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1531 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1532 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1533 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1534 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1536 #define TYPE_MODE(NODE) \
1537 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1538 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1539 #define SET_TYPE_MODE(NODE, MODE) \
1540 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1542 /* The "canonical" type for this type node, which is used by frontends to
1543 compare the type for equality with another type. If two types are
1544 equal (based on the semantics of the language), then they will have
1545 equivalent TYPE_CANONICAL entries.
1547 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1548 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1549 be used for comparison against other types. Instead, the type is
1550 said to require structural equality checks, described in
1551 TYPE_STRUCTURAL_EQUALITY_P.
1553 For unqualified aggregate and function types the middle-end relies on
1554 TYPE_CANONICAL to tell whether two variables can be assigned
1555 to each other without a conversion. The middle-end also makes sure
1556 to assign the same alias-sets to the type partition with equal
1557 TYPE_CANONICAL of their unqualified variants. */
1558 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1559 /* Indicates that the type node requires structural equality
1560 checks. The compiler will need to look at the composition of the
1561 type to determine whether it is equal to another type, rather than
1562 just comparing canonical type pointers. For instance, we would need
1563 to look at the return and parameter types of a FUNCTION_TYPE
1565 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1566 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1567 type node requires structural equality. */
1568 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1570 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1571 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1573 /* The (language-specific) typed-based alias set for this type.
1574 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1575 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1576 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1577 type can alias objects of any type. */
1578 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1580 /* Nonzero iff the typed-based alias set for this type has been
1582 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1583 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1585 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1587 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1589 /* The alignment necessary for objects of this type.
1590 The value is an int, measured in bits. */
1591 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1593 /* 1 if the alignment for this type was requested by "aligned" attribute,
1594 0 if it is the default for this type. */
1595 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1597 /* The alignment for NODE, in bytes. */
1598 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1600 /* If your language allows you to declare types, and you want debug info
1601 for them, then you need to generate corresponding TYPE_DECL nodes.
1602 These "stub" TYPE_DECL nodes have no name, and simply point at the
1603 type node. You then set the TYPE_STUB_DECL field of the type node
1604 to point back at the TYPE_DECL node. This allows the debug routines
1605 to know that the two nodes represent the same type, so that we only
1606 get one debug info record for them. */
1607 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1609 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1610 the type has BLKmode only because it lacks the alignment required for
1612 #define TYPE_NO_FORCE_BLK(NODE) \
1613 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1615 /* Nonzero in a type considered volatile as a whole. */
1616 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1618 /* Nonzero in a type considered atomic as a whole. */
1619 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1621 /* Means this type is const-qualified. */
1622 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1624 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1626 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1628 /* If nonzero, type's name shouldn't be emitted into debug info. */
1629 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1631 /* The address space the type is in. */
1632 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1634 /* Encode/decode the named memory support as part of the qualifier. If more
1635 than 8 qualifiers are added, these macros need to be adjusted. */
1636 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1637 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1639 /* Return all qualifiers except for the address space qualifiers. */
1640 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1642 /* Only keep the address space out of the qualifiers and discard the other
1644 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1646 /* The set of type qualifiers for this type. */
1647 #define TYPE_QUALS(NODE) \
1648 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1649 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1650 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1651 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1652 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1654 /* The same as TYPE_QUALS without the address space qualifications. */
1655 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1656 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1657 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1658 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1659 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1661 /* The same as TYPE_QUALS without the address space and atomic
1663 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1664 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1665 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1666 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1668 /* These flags are available for each language front end to use internally. */
1669 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1670 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1671 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1672 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1673 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1674 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1675 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1677 /* Used to keep track of visited nodes in tree traversals. This is set to
1678 0 by copy_node and make_node. */
1679 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1681 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1682 that distinguish string from array of char).
1683 If set in a INTEGER_TYPE, indicates a character type. */
1684 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1686 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1687 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1688 (((unsigned HOST_WIDE_INT) 1) \
1689 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1691 /* Set precision to n when we have 2^n sub-parts of the vector. */
1692 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1693 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1695 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1696 about missing conversions to other vector types of the same size. */
1697 #define TYPE_VECTOR_OPAQUE(NODE) \
1698 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1700 /* Indicates that objects of this type must be initialized by calling a
1701 function when they are created. */
1702 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1703 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1705 /* Indicates that a UNION_TYPE object should be passed the same way that
1706 the first union alternative would be passed, or that a RECORD_TYPE
1707 object should be passed the same way that the first (and only) member
1709 #define TYPE_TRANSPARENT_AGGR(NODE) \
1710 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1712 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1713 address of a component of the type. This is the counterpart of
1714 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1715 #define TYPE_NONALIASED_COMPONENT(NODE) \
1716 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1718 /* Indicated that objects of this type should be laid out in as
1719 compact a way as possible. */
1720 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1722 /* Used by type_contains_placeholder_p to avoid recomputation.
1723 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1724 this field directly. */
1725 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1726 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1728 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1729 #define TYPE_FINAL_P(NODE) \
1730 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1732 /* The debug output functions use the symtab union field to store
1733 information specific to the debugging format. The different debug
1734 output hooks store different types in the union field. These three
1735 macros are used to access different fields in the union. The debug
1736 hooks are responsible for consistently using only a specific
1739 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1740 hold the type's number in the generated stabs. */
1741 #define TYPE_SYMTAB_ADDRESS(NODE) \
1742 (TYPE_CHECK (NODE)->type_common.symtab.address)
1744 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1745 hold struct/union type tag names. */
1746 #define TYPE_SYMTAB_POINTER(NODE) \
1747 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1749 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1750 in dwarf2out.c to point to the DIE generated for the type. */
1751 #define TYPE_SYMTAB_DIE(NODE) \
1752 (TYPE_CHECK (NODE)->type_common.symtab.die)
1754 /* The garbage collector needs to know the interpretation of the
1755 symtab field. These constants represent the different types in the
1758 #define TYPE_SYMTAB_IS_ADDRESS (0)
1759 #define TYPE_SYMTAB_IS_POINTER (1)
1760 #define TYPE_SYMTAB_IS_DIE (2)
1762 #define TYPE_LANG_SPECIFIC(NODE) \
1763 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1765 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1766 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1767 #define TYPE_FIELDS(NODE) \
1768 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1769 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1770 #define TYPE_ARG_TYPES(NODE) \
1771 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1772 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1774 #define TYPE_METHODS(NODE) \
1775 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1776 #define TYPE_VFIELD(NODE) \
1777 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1778 #define TYPE_METHOD_BASETYPE(NODE) \
1779 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1780 #define TYPE_OFFSET_BASETYPE(NODE) \
1781 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1782 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1783 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1784 #define TYPE_NEXT_PTR_TO(NODE) \
1785 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1786 #define TYPE_NEXT_REF_TO(NODE) \
1787 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1788 #define TYPE_MIN_VALUE(NODE) \
1789 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1790 #define TYPE_MAX_VALUE(NODE) \
1791 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1793 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1794 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1796 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1797 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1799 /* For record and union types, information about this type, as a base type
1801 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1803 /* For non record and union types, used in a language-dependent way. */
1804 #define TYPE_LANG_SLOT_1(NODE) \
1805 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1807 /* Define accessor macros for information about type inheritance
1810 A "basetype" means a particular usage of a data type for inheritance
1811 in another type. Each such basetype usage has its own "binfo"
1812 object to describe it. The binfo object is a TREE_VEC node.
1814 Inheritance is represented by the binfo nodes allocated for a
1815 given type. For example, given types C and D, such that D is
1816 inherited by C, 3 binfo nodes will be allocated: one for describing
1817 the binfo properties of C, similarly one for D, and one for
1818 describing the binfo properties of D as a base type for C.
1819 Thus, given a pointer to class C, one can get a pointer to the binfo
1820 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1822 /* BINFO specific flags. */
1824 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1825 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1827 /* Flags for language dependent use. */
1828 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1829 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1830 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1831 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1832 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1833 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1834 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1836 /* The actual data type node being inherited in this basetype. */
1837 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1839 /* The offset where this basetype appears in its containing type.
1840 BINFO_OFFSET slot holds the offset (in bytes)
1841 from the base of the complete object to the base of the part of the
1842 object that is allocated on behalf of this `type'.
1843 This is always 0 except when there is multiple inheritance. */
1845 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1846 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1848 /* The virtual function table belonging to this basetype. Virtual
1849 function tables provide a mechanism for run-time method dispatching.
1850 The entries of a virtual function table are language-dependent. */
1852 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1854 /* The virtual functions in the virtual function table. This is
1855 a TREE_LIST that is used as an initial approximation for building
1856 a virtual function table for this basetype. */
1857 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1859 /* A vector of binfos for the direct basetypes inherited by this
1862 If this basetype describes type D as inherited in C, and if the
1863 basetypes of D are E and F, then this vector contains binfos for
1864 inheritance of E and F by C. */
1865 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1867 /* The number of basetypes for NODE. */
1868 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1870 /* Accessor macro to get to the Nth base binfo of this binfo. */
1871 #define BINFO_BASE_BINFO(NODE,N) \
1872 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1873 #define BINFO_BASE_ITERATE(NODE,N,B) \
1874 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1875 #define BINFO_BASE_APPEND(NODE,T) \
1876 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1878 /* For a BINFO record describing a virtual base class, i.e., one where
1879 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1880 base. The actual contents are language-dependent. In the C++
1881 front-end this field is an INTEGER_CST giving an offset into the
1882 vtable where the offset to the virtual base can be found. */
1883 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1885 /* Indicates the accesses this binfo has to its bases. The values are
1886 access_public_node, access_protected_node or access_private_node.
1887 If this array is not present, public access is implied. */
1888 #define BINFO_BASE_ACCESSES(NODE) \
1889 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1891 #define BINFO_BASE_ACCESS(NODE,N) \
1892 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1893 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1894 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1896 /* The index in the VTT where this subobject's sub-VTT can be found.
1897 NULL_TREE if there is no sub-VTT. */
1898 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1900 /* The index in the VTT where the vptr for this subobject can be
1901 found. NULL_TREE if there is no secondary vptr in the VTT. */
1902 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1904 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1905 inheriting this base for non-virtual bases. For virtual bases it
1906 points either to the binfo for which this is a primary binfo, or to
1907 the binfo of the most derived type. */
1908 #define BINFO_INHERITANCE_CHAIN(NODE) \
1909 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1912 /* Define fields and accessors for nodes representing declared names. */
1914 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1915 have an associated SSA name. */
1916 #define SSA_VAR_P(DECL) \
1917 (TREE_CODE (DECL) == VAR_DECL \
1918 || TREE_CODE (DECL) == PARM_DECL \
1919 || TREE_CODE (DECL) == RESULT_DECL \
1920 || TREE_CODE (DECL) == SSA_NAME)
1923 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1925 /* This is the name of the object as written by the user.
1926 It is an IDENTIFIER_NODE. */
1927 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1929 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
1930 #define TYPE_IDENTIFIER(NODE) \
1931 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
1932 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
1934 /* Every ..._DECL node gets a unique number. */
1935 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1937 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1939 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1941 /* Every ..._DECL node gets a unique number that stays the same even
1942 when the decl is copied by the inliner once it is set. */
1943 #define DECL_PT_UID(NODE) \
1944 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1945 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1946 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1947 #define SET_DECL_PT_UID(NODE, UID) \
1948 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1949 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1950 be preserved when copyin the decl. */
1951 #define DECL_PT_UID_SET_P(NODE) \
1952 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1954 /* These two fields describe where in the source code the declaration
1955 was. If the declaration appears in several places (as for a C
1956 function that is declared first and then defined later), this
1957 information should refer to the definition. */
1958 #define DECL_SOURCE_LOCATION(NODE) \
1959 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1960 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1961 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1962 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1963 /* This accessor returns TRUE if the decl it operates on was created
1964 by a front-end or back-end rather than by user code. In this case
1965 builtin-ness is indicated by source location. */
1966 #define DECL_IS_BUILTIN(DECL) \
1967 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1969 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1970 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1971 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1972 nodes, this points to either the FUNCTION_DECL for the containing
1973 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1974 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1975 scope". In particular, for VAR_DECLs which are virtual table pointers
1976 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1978 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1979 #define DECL_FIELD_CONTEXT(NODE) \
1980 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1982 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1983 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1985 /* For any sort of a ..._DECL node, this points to the original (abstract)
1986 decl node which this decl is an inlined/cloned instance of, or else it
1987 is NULL indicating that this decl is not an instance of some other decl.
1989 The C front-end also uses this in a nested declaration of an inline
1990 function, to point back to the definition. */
1991 #define DECL_ABSTRACT_ORIGIN(NODE) \
1992 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1994 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1995 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1996 #define DECL_ORIGIN(NODE) \
1997 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1999 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2000 inline instance of some original (abstract) decl from an inline function;
2001 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2002 nodes can also have their abstract origin set to themselves. */
2003 #define DECL_FROM_INLINE(NODE) \
2004 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2005 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2007 /* In a DECL this is the field where attributes are stored. */
2008 #define DECL_ATTRIBUTES(NODE) \
2009 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2011 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2012 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2013 For a VAR_DECL, holds the initial value.
2014 For a PARM_DECL, used for DECL_ARG_TYPE--default
2015 values for parameters are encoded in the type of the function,
2016 not in the PARM_DECL slot.
2017 For a FIELD_DECL, this is used for enumeration values and the C
2018 frontend uses it for temporarily storing bitwidth of bitfields.
2020 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2021 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2023 /* Holds the size of the datum, in bits, as a tree expression.
2024 Need not be constant. */
2025 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2026 /* Likewise for the size in bytes. */
2027 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2028 /* Holds the alignment required for the datum, in bits. */
2029 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2030 /* The alignment of NODE, in bytes. */
2031 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2032 /* Set if the alignment of this DECL has been set by the user, for
2033 example with an 'aligned' attribute. */
2034 #define DECL_USER_ALIGN(NODE) \
2035 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2036 /* Holds the machine mode corresponding to the declaration of a variable or
2037 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2039 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2041 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2042 operation it is. Note, however, that this field is overloaded, with
2043 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2044 checked before any access to the former. */
2045 #define DECL_FUNCTION_CODE(NODE) \
2046 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2048 #define DECL_FUNCTION_PERSONALITY(NODE) \
2049 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2051 /* Nonzero for a given ..._DECL node means that the name of this node should
2052 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2053 the associated type should be ignored. For a FUNCTION_DECL, the body of
2054 the function should also be ignored. */
2055 #define DECL_IGNORED_P(NODE) \
2056 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2058 /* Nonzero for a given ..._DECL node means that this node represents an
2059 "abstract instance" of the given declaration (e.g. in the original
2060 declaration of an inline function). When generating symbolic debugging
2061 information, we mustn't try to generate any address information for nodes
2062 marked as "abstract instances" because we don't actually generate
2063 any code or allocate any data space for such instances. */
2064 #define DECL_ABSTRACT(NODE) \
2065 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2067 /* Language-specific decl information. */
2068 #define DECL_LANG_SPECIFIC(NODE) \
2069 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2071 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2072 do not allocate storage, and refer to a definition elsewhere. Note that
2073 this does not necessarily imply the entity represented by NODE
2074 has no program source-level definition in this translation unit. For
2075 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2076 DECL_EXTERNAL may be true simultaneously; that can be the case for
2077 a C99 "extern inline" function. */
2078 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2080 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2081 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2083 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2085 Also set in some languages for variables, etc., outside the normal
2086 lexical scope, such as class instance variables. */
2087 #define DECL_NONLOCAL(NODE) \
2088 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2090 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2091 Used in FIELD_DECLs for vtable pointers.
2092 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2093 #define DECL_VIRTUAL_P(NODE) \
2094 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2096 /* Used to indicate that this DECL represents a compiler-generated entity. */
2097 #define DECL_ARTIFICIAL(NODE) \
2098 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2100 /* Additional flags for language-specific uses. */
2101 #define DECL_LANG_FLAG_0(NODE) \
2102 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2103 #define DECL_LANG_FLAG_1(NODE) \
2104 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2105 #define DECL_LANG_FLAG_2(NODE) \
2106 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2107 #define DECL_LANG_FLAG_3(NODE) \
2108 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2109 #define DECL_LANG_FLAG_4(NODE) \
2110 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2111 #define DECL_LANG_FLAG_5(NODE) \
2112 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2113 #define DECL_LANG_FLAG_6(NODE) \
2114 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2115 #define DECL_LANG_FLAG_7(NODE) \
2116 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2117 #define DECL_LANG_FLAG_8(NODE) \
2118 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2120 /* Nonzero for a scope which is equal to file scope. */
2121 #define SCOPE_FILE_SCOPE_P(EXP) \
2122 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2123 /* Nonzero for a decl which is at file scope. */
2124 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2125 /* Nonzero for a type which is at file scope. */
2126 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2128 /* Nonzero for a decl that is decorated using attribute used.
2129 This indicates to compiler tools that this decl needs to be preserved. */
2130 #define DECL_PRESERVE_P(DECL) \
2131 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2133 /* For function local variables of COMPLEX and VECTOR types,
2134 indicates that the variable is not aliased, and that all
2135 modifications to the variable have been adjusted so that
2136 they are killing assignments. Thus the variable may now
2137 be treated as a GIMPLE register, and use real instead of
2138 virtual ops in SSA form. */
2139 #define DECL_GIMPLE_REG_P(DECL) \
2140 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2142 extern tree decl_value_expr_lookup (tree);
2143 extern void decl_value_expr_insert (tree, tree);
2145 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2146 if transformations have made this more complicated than evaluating the
2147 decl itself. This should only be used for debugging; once this field has
2148 been set, the decl itself may not legitimately appear in the function. */
2149 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2150 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2151 ->decl_common.decl_flag_2)
2152 #define DECL_VALUE_EXPR(NODE) \
2153 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2154 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2155 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2157 /* Holds the RTL expression for the value of a variable or function.
2158 This value can be evaluated lazily for functions, variables with
2159 static storage duration, and labels. */
2160 #define DECL_RTL(NODE) \
2161 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2162 ? (NODE)->decl_with_rtl.rtl \
2163 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2165 /* Set the DECL_RTL for NODE to RTL. */
2166 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2168 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2169 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2171 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2172 #define DECL_RTL_SET_P(NODE) \
2173 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2175 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2176 NODE1, it will not be set for NODE2; this is a lazy copy. */
2177 #define COPY_DECL_RTL(NODE1, NODE2) \
2178 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2179 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2181 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2182 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2184 #if (GCC_VERSION >= 2007)
2185 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2186 ({ tree const __d = (decl); \
2187 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2188 /* Dereference it so the compiler knows it can't be NULL even \
2189 without assertion checking. */ \
2190 &*DECL_RTL_IF_SET (__d); })
2192 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2195 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2196 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2198 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2199 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2200 of the structure. */
2201 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2203 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2204 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2205 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2206 natural alignment of the field's type). */
2207 #define DECL_FIELD_BIT_OFFSET(NODE) \
2208 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2210 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2211 if so, the type that was originally specified for it.
2212 TREE_TYPE may have been modified (in finish_struct). */
2213 #define DECL_BIT_FIELD_TYPE(NODE) \
2214 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2216 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2217 representative FIELD_DECL. */
2218 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2219 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2221 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2222 if nonzero, indicates that the field occupies the type. */
2223 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2225 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2226 DECL_FIELD_OFFSET which are known to be always zero.
2227 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2229 #define DECL_OFFSET_ALIGN(NODE) \
2230 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2232 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2233 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2234 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2236 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2237 which this FIELD_DECL is defined. This information is needed when
2238 writing debugging information about vfield and vbase decls for C++. */
2239 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2241 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2242 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2244 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2246 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2248 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2249 this component. This makes it possible for Type-Based Alias Analysis
2250 to disambiguate accesses to this field with indirect accesses using
2253 struct S { int i; } s;
2256 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2258 From the implementation's viewpoint, the alias set of the type of the
2259 field 'i' (int) will not be recorded as a subset of that of the type of
2260 's' (struct S) in record_component_aliases. The counterpart is that
2261 accesses to s.i must not be given the alias set of the type of 'i'
2262 (int) but instead directly that of the type of 's' (struct S). */
2263 #define DECL_NONADDRESSABLE_P(NODE) \
2264 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2266 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2267 dense, unique within any one function, and may be used to index arrays.
2268 If the value is -1, then no UID has been assigned. */
2269 #define LABEL_DECL_UID(NODE) \
2270 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2272 /* In a LABEL_DECL, the EH region number for which the label is the
2273 post_landing_pad. */
2274 #define EH_LANDING_PAD_NR(NODE) \
2275 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2277 /* For a PARM_DECL, records the data type used to pass the argument,
2278 which may be different from the type seen in the program. */
2279 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2281 /* For PARM_DECL, holds an RTL for the stack slot or register
2282 where the data was actually passed. */
2283 #define DECL_INCOMING_RTL(NODE) \
2284 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2286 /* Nonzero for a given ..._DECL node means that no warnings should be
2287 generated just because this node is unused. */
2288 #define DECL_IN_SYSTEM_HEADER(NODE) \
2289 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2291 /* Used to indicate that the linkage status of this DECL is not yet known,
2292 so it should not be output now. */
2293 #define DECL_DEFER_OUTPUT(NODE) \
2294 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2296 /* In a VAR_DECL that's static,
2297 nonzero if the space is in the text section. */
2298 #define DECL_IN_TEXT_SECTION(NODE) \
2299 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2301 /* In a VAR_DECL that's static,
2302 nonzero if it belongs to the global constant pool. */
2303 #define DECL_IN_CONSTANT_POOL(NODE) \
2304 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2306 /* Nonzero for a given ..._DECL node means that this node should be
2307 put in .common, if possible. If a DECL_INITIAL is given, and it
2308 is not error_mark_node, then the decl cannot be put in .common. */
2309 #define DECL_COMMON(NODE) \
2310 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2312 /* In a VAR_DECL, nonzero if the decl is a register variable with
2313 an explicit asm specification. */
2314 #define DECL_HARD_REGISTER(NODE) \
2315 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2317 /* Used to indicate that this DECL has weak linkage. */
2318 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2320 /* Used to indicate that the DECL is a dllimport. */
2321 #define DECL_DLLIMPORT_P(NODE) \
2322 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2324 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2325 not be put out unless it is needed in this translation unit.
2326 Entities like this are shared across translation units (like weak
2327 entities), but are guaranteed to be generated by any translation
2328 unit that needs them, and therefore need not be put out anywhere
2329 where they are not needed. DECL_COMDAT is just a hint to the
2330 back-end; it is up to front-ends which set this flag to ensure
2331 that there will never be any harm, other than bloat, in putting out
2332 something which is DECL_COMDAT. */
2333 #define DECL_COMDAT(NODE) \
2334 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2336 #define DECL_COMDAT_GROUP(NODE) \
2337 decl_comdat_group (NODE)
2339 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2340 multiple translation units should be merged. */
2341 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2342 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2344 /* The name of the object as the assembler will see it (but before any
2345 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2346 as DECL_NAME. It is an IDENTIFIER_NODE. */
2347 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2349 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2350 This is true of all DECL nodes except FIELD_DECL. */
2351 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2352 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2354 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2355 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2357 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2358 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2359 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2361 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2362 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2363 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2365 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2366 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2367 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2368 semantics of using this macro, are different than saying:
2370 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2372 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2374 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2375 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2376 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2377 DECL_ASSEMBLER_NAME (DECL1)) \
2380 /* Records the section name in a section attribute. Used to pass
2381 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2382 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2384 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2385 this variable in a BIND_EXPR. */
2386 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2387 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2389 /* Value of the decls's visibility attribute */
2390 #define DECL_VISIBILITY(NODE) \
2391 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2393 /* Nonzero means that the decl had its visibility specified rather than
2395 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2396 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2398 /* In a VAR_DECL, the model to use if the data should be allocated from
2399 thread-local storage. */
2400 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2402 /* In a VAR_DECL, nonzero if the data should be allocated from
2403 thread-local storage. */
2404 #define DECL_THREAD_LOCAL_P(NODE) \
2405 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2407 /* In a non-local VAR_DECL with static storage duration, true if the
2408 variable has an initialization priority. If false, the variable
2409 will be initialized at the DEFAULT_INIT_PRIORITY. */
2410 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2411 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2413 extern tree decl_debug_expr_lookup (tree);
2414 extern void decl_debug_expr_insert (tree, tree);
2416 /* For VAR_DECL, this is set to an expression that it was split from. */
2417 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2418 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2419 #define DECL_DEBUG_EXPR(NODE) \
2420 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2422 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2423 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2425 extern priority_type decl_init_priority_lookup (tree);
2426 extern priority_type decl_fini_priority_lookup (tree);
2427 extern void decl_init_priority_insert (tree, priority_type);
2428 extern void decl_fini_priority_insert (tree, priority_type);
2430 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2432 #define DECL_INIT_PRIORITY(NODE) \
2433 (decl_init_priority_lookup (NODE))
2434 /* Set the initialization priority for NODE to VAL. */
2435 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2436 (decl_init_priority_insert (NODE, VAL))
2438 /* For a FUNCTION_DECL the finalization priority of NODE. */
2439 #define DECL_FINI_PRIORITY(NODE) \
2440 (decl_fini_priority_lookup (NODE))
2441 /* Set the finalization priority for NODE to VAL. */
2442 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2443 (decl_fini_priority_insert (NODE, VAL))
2445 /* The initialization priority for entities for which no explicit
2446 initialization priority has been specified. */
2447 #define DEFAULT_INIT_PRIORITY 65535
2449 /* The maximum allowed initialization priority. */
2450 #define MAX_INIT_PRIORITY 65535
2452 /* The largest priority value reserved for use by system runtime
2454 #define MAX_RESERVED_INIT_PRIORITY 100
2456 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2457 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2458 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2460 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2461 #define DECL_NONLOCAL_FRAME(NODE) \
2462 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2464 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2465 #define DECL_NONALIASED(NODE) \
2466 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2468 /* This field is used to reference anything in decl.result and is meant only
2469 for use by the garbage collector. */
2470 #define DECL_RESULT_FLD(NODE) \
2471 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2473 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2474 Before the struct containing the FUNCTION_DECL is laid out,
2475 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2476 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2477 function. When the class is laid out, this pointer is changed
2478 to an INTEGER_CST node which is suitable for use as an index
2479 into the virtual function table. */
2480 #define DECL_VINDEX(NODE) \
2481 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2483 /* In FUNCTION_DECL, holds the decl for the return value. */
2484 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2486 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2487 #define DECL_UNINLINABLE(NODE) \
2488 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2490 /* In a FUNCTION_DECL, the saved representation of the body of the
2492 #define DECL_SAVED_TREE(NODE) \
2493 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2495 /* Nonzero in a FUNCTION_DECL means this function should be treated
2496 as if it were a malloc, meaning it returns a pointer that is
2498 #define DECL_IS_MALLOC(NODE) \
2499 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2501 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2502 C++ operator new, meaning that it returns a pointer for which we
2503 should not use type based aliasing. */
2504 #define DECL_IS_OPERATOR_NEW(NODE) \
2505 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2507 /* Nonzero in a FUNCTION_DECL means this function may return more
2509 #define DECL_IS_RETURNS_TWICE(NODE) \
2510 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2512 /* Nonzero in a FUNCTION_DECL means this function should be treated
2513 as "pure" function (like const function, but may read global memory). */
2514 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2516 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2517 the const or pure function may not terminate. When this is nonzero
2518 for a const or pure function, it can be dealt with by cse passes
2519 but cannot be removed by dce passes since you are not allowed to
2520 change an infinite looping program into one that terminates without
2522 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2523 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2525 /* Nonzero in a FUNCTION_DECL means this function should be treated
2526 as "novops" function (function that does not read global memory,
2527 but may have arbitrary side effects). */
2528 #define DECL_IS_NOVOPS(NODE) \
2529 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2531 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2532 at the beginning or end of execution. */
2533 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2534 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2536 #define DECL_STATIC_DESTRUCTOR(NODE) \
2537 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2539 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2540 be instrumented with calls to support routines. */
2541 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2542 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2544 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2545 disabled in this function. */
2546 #define DECL_NO_LIMIT_STACK(NODE) \
2547 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2549 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2550 #define DECL_STATIC_CHAIN(NODE) \
2551 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2553 /* Nonzero for a decl that cgraph has decided should be inlined into
2554 at least one call site. It is not meaningful to look at this
2555 directly; always use cgraph_function_possibly_inlined_p. */
2556 #define DECL_POSSIBLY_INLINED(DECL) \
2557 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2559 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2560 such as via the `inline' keyword in C/C++. This flag controls the linkage
2561 semantics of 'inline' */
2562 #define DECL_DECLARED_INLINE_P(NODE) \
2563 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2565 /* Nonzero in a FUNCTION_DECL means this function should not get
2566 -Winline warnings. */
2567 #define DECL_NO_INLINE_WARNING_P(NODE) \
2568 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2570 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2571 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2572 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2574 /* Nonzero if a FUNCTION_CODE is a TM load. */
2575 #define BUILTIN_TM_LOAD_P(FN) \
2576 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2578 /* Nonzero if a FUNCTION_CODE is a TM store. */
2579 #define BUILTIN_TM_STORE_P(FN) \
2580 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2582 #define CASE_BUILT_IN_TM_LOAD(FN) \
2583 case BUILT_IN_TM_LOAD_##FN: \
2584 case BUILT_IN_TM_LOAD_RAR_##FN: \
2585 case BUILT_IN_TM_LOAD_RAW_##FN: \
2586 case BUILT_IN_TM_LOAD_RFW_##FN
2588 #define CASE_BUILT_IN_TM_STORE(FN) \
2589 case BUILT_IN_TM_STORE_##FN: \
2590 case BUILT_IN_TM_STORE_WAR_##FN: \
2591 case BUILT_IN_TM_STORE_WAW_##FN
2593 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2594 disregarding size and cost heuristics. This is equivalent to using
2595 the always_inline attribute without the required diagnostics if the
2596 function cannot be inlined. */
2597 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2598 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2600 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2601 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2603 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2604 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2605 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2607 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2608 that describes the status of this function. */
2609 #define DECL_STRUCT_FUNCTION(NODE) \
2610 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2612 /* In a FUNCTION_DECL, nonzero means a built in function of a
2613 standard library or more generally a built in function that is
2614 recognized by optimizers and expanders.
2616 Note that it is different from the DECL_IS_BUILTIN accessor. For
2617 instance, user declared prototypes of C library functions are not
2618 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2619 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2621 /* For a builtin function, identify which part of the compiler defined it. */
2622 #define DECL_BUILT_IN_CLASS(NODE) \
2623 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2625 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2626 #define DECL_ARGUMENTS(NODE) \
2627 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2629 /* In FUNCTION_DECL, the function specific target options to use when compiling
2631 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2632 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2634 /* In FUNCTION_DECL, the function specific optimization options to use when
2635 compiling this function. */
2636 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2637 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2639 /* In FUNCTION_DECL, this is set if this function has other versions generated
2640 using "target" attributes. The default version is the one which does not
2641 have any "target" attribute set. */
2642 #define DECL_FUNCTION_VERSIONED(NODE)\
2643 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2645 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2646 Devirtualization machinery uses this knowledge for determing type of the
2647 object constructed. Also we assume that constructor address is not
2649 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2650 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2652 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2653 Devirtualization machinery uses this to track types in destruction. */
2654 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2655 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2657 /* In FUNCTION_DECL that represent an virtual method this is set when
2658 the method is final. */
2659 #define DECL_FINAL_P(NODE)\
2660 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2662 /* The source language of the translation-unit. */
2663 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2664 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2666 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2668 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2669 #define DECL_ORIGINAL_TYPE(NODE) \
2670 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2672 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2673 into stabs. Instead it will generate cross reference ('x') of names.
2674 This uses the same flag as DECL_EXTERNAL. */
2675 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2676 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2678 /* Getter of the imported declaration associated to the
2679 IMPORTED_DECL node. */
2680 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2681 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2683 /* Getter of the symbol declaration associated with the
2684 NAMELIST_DECL node. */
2685 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2686 (DECL_INITIAL (NODE))
2688 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2689 To reduce overhead, the nodes containing the statements are not trees.
2690 This avoids the overhead of tree_common on all linked list elements.
2692 Use the interface in tree-iterator.h to access this node. */
2694 #define STATEMENT_LIST_HEAD(NODE) \
2695 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2696 #define STATEMENT_LIST_TAIL(NODE) \
2697 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2699 #define TREE_OPTIMIZATION(NODE) \
2700 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2702 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2703 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2705 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2706 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2708 /* Return a tree node that encapsulates the optimization options in OPTS. */
2709 extern tree build_optimization_node (struct gcc_options *opts);
2711 #define TREE_TARGET_OPTION(NODE) \
2712 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2714 #define TREE_TARGET_GLOBALS(NODE) \
2715 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2717 /* Return a tree node that encapsulates the target options in OPTS. */
2718 extern tree build_target_option_node (struct gcc_options *opts);
2720 extern void prepare_target_option_nodes_for_pch (void);
2722 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2725 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
2727 if (TREE_CODE (__t) != __c)
2728 tree_check_failed (__t, __f, __l, __g, __c, 0);
2733 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
2736 if (TREE_CODE (__t) == __c)
2737 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
2742 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
2743 enum tree_code __c1, enum tree_code __c2)
2745 if (TREE_CODE (__t) != __c1
2746 && TREE_CODE (__t) != __c2)
2747 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2752 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
2753 enum tree_code __c1, enum tree_code __c2)
2755 if (TREE_CODE (__t) == __c1
2756 || TREE_CODE (__t) == __c2)
2757 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2762 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
2763 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2765 if (TREE_CODE (__t) != __c1
2766 && TREE_CODE (__t) != __c2
2767 && TREE_CODE (__t) != __c3)
2768 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2773 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
2774 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2776 if (TREE_CODE (__t) == __c1
2777 || TREE_CODE (__t) == __c2
2778 || TREE_CODE (__t) == __c3)
2779 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2784 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
2785 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2786 enum tree_code __c4)
2788 if (TREE_CODE (__t) != __c1
2789 && TREE_CODE (__t) != __c2
2790 && TREE_CODE (__t) != __c3
2791 && TREE_CODE (__t) != __c4)
2792 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2797 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
2798 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2799 enum tree_code __c4)
2801 if (TREE_CODE (__t) == __c1
2802 || TREE_CODE (__t) == __c2
2803 || TREE_CODE (__t) == __c3
2804 || TREE_CODE (__t) == __c4)
2805 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2810 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
2811 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2812 enum tree_code __c4, enum tree_code __c5)
2814 if (TREE_CODE (__t) != __c1
2815 && TREE_CODE (__t) != __c2
2816 && TREE_CODE (__t) != __c3
2817 && TREE_CODE (__t) != __c4
2818 && TREE_CODE (__t) != __c5)
2819 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2824 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
2825 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2826 enum tree_code __c4, enum tree_code __c5)
2828 if (TREE_CODE (__t) == __c1
2829 || TREE_CODE (__t) == __c2
2830 || TREE_CODE (__t) == __c3
2831 || TREE_CODE (__t) == __c4
2832 || TREE_CODE (__t) == __c5)
2833 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2838 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
2839 const char *__f, int __l, const char *__g)
2841 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
2842 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
2847 tree_class_check (tree __t, const enum tree_code_class __class,
2848 const char *__f, int __l, const char *__g)
2850 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
2851 tree_class_check_failed (__t, __class, __f, __l, __g);
2856 tree_range_check (tree __t,
2857 enum tree_code __code1, enum tree_code __code2,
2858 const char *__f, int __l, const char *__g)
2860 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
2861 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
2866 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
2867 const char *__f, int __l, const char *__g)
2869 if (TREE_CODE (__t) != OMP_CLAUSE)
2870 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2871 if (__t->omp_clause.code != __code)
2872 omp_clause_check_failed (__t, __f, __l, __g, __code);
2877 omp_clause_range_check (tree __t,
2878 enum omp_clause_code __code1,
2879 enum omp_clause_code __code2,
2880 const char *__f, int __l, const char *__g)
2882 if (TREE_CODE (__t) != OMP_CLAUSE)
2883 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2884 if ((int) __t->omp_clause.code < (int) __code1
2885 || (int) __t->omp_clause.code > (int) __code2)
2886 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
2890 /* These checks have to be special cased. */
2893 expr_check (tree __t, const char *__f, int __l, const char *__g)
2895 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
2896 if (!IS_EXPR_CODE_CLASS (__c))
2897 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
2901 /* These checks have to be special cased. */
2904 non_type_check (tree __t, const char *__f, int __l, const char *__g)
2907 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
2911 inline const HOST_WIDE_INT *
2912 tree_int_cst_elt_check (const_tree __t, int __i,
2913 const char *__f, int __l, const char *__g)
2915 if (TREE_CODE (__t) != INTEGER_CST)
2916 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
2917 if (__i < 0 || __i >= __t->base.u.int_length.extended)
2918 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
2920 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
2923 inline HOST_WIDE_INT *
2924 tree_int_cst_elt_check (tree __t, int __i,
2925 const char *__f, int __l, const char *__g)
2927 if (TREE_CODE (__t) != INTEGER_CST)
2928 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
2929 if (__i < 0 || __i >= __t->base.u.int_length.extended)
2930 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
2932 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
2936 tree_vec_elt_check (tree __t, int __i,
2937 const char *__f, int __l, const char *__g)
2939 if (TREE_CODE (__t) != TREE_VEC)
2940 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
2941 if (__i < 0 || __i >= __t->base.u.length)
2942 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
2943 return &CONST_CAST_TREE (__t)->vec.a[__i];
2947 omp_clause_elt_check (tree __t, int __i,
2948 const char *__f, int __l, const char *__g)
2950 if (TREE_CODE (__t) != OMP_CLAUSE)
2951 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2952 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
2953 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
2954 return &__t->omp_clause.ops[__i];
2958 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
2961 if (TREE_CODE (__t) != __c)
2962 tree_check_failed (__t, __f, __l, __g, __c, 0);
2967 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
2970 if (TREE_CODE (__t) == __c)
2971 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
2976 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
2977 enum tree_code __c1, enum tree_code __c2)
2979 if (TREE_CODE (__t) != __c1
2980 && TREE_CODE (__t) != __c2)
2981 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2986 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
2987 enum tree_code __c1, enum tree_code __c2)
2989 if (TREE_CODE (__t) == __c1
2990 || TREE_CODE (__t) == __c2)
2991 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2996 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
2997 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2999 if (TREE_CODE (__t) != __c1
3000 && TREE_CODE (__t) != __c2
3001 && TREE_CODE (__t) != __c3)
3002 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3007 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3008 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3010 if (TREE_CODE (__t) == __c1
3011 || TREE_CODE (__t) == __c2
3012 || TREE_CODE (__t) == __c3)
3013 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3018 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3019 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3020 enum tree_code __c4)
3022 if (TREE_CODE (__t) != __c1
3023 && TREE_CODE (__t) != __c2
3024 && TREE_CODE (__t) != __c3
3025 && TREE_CODE (__t) != __c4)
3026 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3031 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3032 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3033 enum tree_code __c4)
3035 if (TREE_CODE (__t) == __c1
3036 || TREE_CODE (__t) == __c2
3037 || TREE_CODE (__t) == __c3
3038 || TREE_CODE (__t) == __c4)
3039 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3044 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3045 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3046 enum tree_code __c4, enum tree_code __c5)
3048 if (TREE_CODE (__t) != __c1
3049 && TREE_CODE (__t) != __c2
3050 && TREE_CODE (__t) != __c3
3051 && TREE_CODE (__t) != __c4
3052 && TREE_CODE (__t) != __c5)
3053 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3058 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3059 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3060 enum tree_code __c4, enum tree_code __c5)
3062 if (TREE_CODE (__t) == __c1
3063 || TREE_CODE (__t) == __c2
3064 || TREE_CODE (__t) == __c3
3065 || TREE_CODE (__t) == __c4
3066 || TREE_CODE (__t) == __c5)
3067 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3072 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3073 const char *__f, int __l, const char *__g)
3075 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3076 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3081 tree_class_check (const_tree __t, const enum tree_code_class __class,
3082 const char *__f, int __l, const char *__g)
3084 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3085 tree_class_check_failed (__t, __class, __f, __l, __g);
3090 tree_range_check (const_tree __t,
3091 enum tree_code __code1, enum tree_code __code2,
3092 const char *__f, int __l, const char *__g)
3094 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3095 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3100 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3101 const char *__f, int __l, const char *__g)
3103 if (TREE_CODE (__t) != OMP_CLAUSE)
3104 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3105 if (__t->omp_clause.code != __code)
3106 omp_clause_check_failed (__t, __f, __l, __g, __code);
3111 omp_clause_range_check (const_tree __t,
3112 enum omp_clause_code __code1,
3113 enum omp_clause_code __code2,
3114 const char *__f, int __l, const char *__g)
3116 if (TREE_CODE (__t) != OMP_CLAUSE)
3117 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3118 if ((int) __t->omp_clause.code < (int) __code1
3119 || (int) __t->omp_clause.code > (int) __code2)
3120 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3125 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3127 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3128 if (!IS_EXPR_CODE_CLASS (__c))
3129 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3134 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3137 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3142 tree_vec_elt_check (const_tree __t, int __i,
3143 const char *__f, int __l, const char *__g)
3145 if (TREE_CODE (__t) != TREE_VEC)
3146 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3147 if (__i < 0 || __i >= __t->base.u.length)
3148 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3149 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3150 //return &__t->vec.a[__i];
3154 omp_clause_elt_check (const_tree __t, int __i,
3155 const char *__f, int __l, const char *__g)
3157 if (TREE_CODE (__t) != OMP_CLAUSE)
3158 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3159 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3160 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3161 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3166 /* Compute the number of operands in an expression node NODE. For
3167 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3168 otherwise it is looked up from the node's code. */
3170 tree_operand_length (const_tree node)
3172 if (VL_EXP_CLASS_P (node))
3173 return VL_EXP_OPERAND_LENGTH (node);
3175 return TREE_CODE_LENGTH (TREE_CODE (node));
3178 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3180 /* Special checks for TREE_OPERANDs. */
3182 tree_operand_check (tree __t, int __i,
3183 const char *__f, int __l, const char *__g)
3185 const_tree __u = EXPR_CHECK (__t);
3186 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3187 tree_operand_check_failed (__i, __u, __f, __l, __g);
3188 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3192 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3193 const char *__f, int __l, const char *__g)
3195 if (TREE_CODE (__t) != __code)
3196 tree_check_failed (__t, __f, __l, __g, __code, 0);
3197 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3198 tree_operand_check_failed (__i, __t, __f, __l, __g);
3199 return &__t->exp.operands[__i];
3203 tree_operand_check (const_tree __t, int __i,
3204 const char *__f, int __l, const char *__g)
3206 const_tree __u = EXPR_CHECK (__t);
3207 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3208 tree_operand_check_failed (__i, __u, __f, __l, __g);
3209 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3213 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3214 const char *__f, int __l, const char *__g)
3216 if (TREE_CODE (__t) != __code)
3217 tree_check_failed (__t, __f, __l, __g, __code, 0);
3218 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3219 tree_operand_check_failed (__i, __t, __f, __l, __g);
3220 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3225 #define error_mark_node global_trees[TI_ERROR_MARK]
3227 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3228 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3229 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3230 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3231 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3233 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3234 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3235 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3236 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3237 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3239 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3240 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3241 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3242 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3243 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3245 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3246 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3247 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3249 #define void_node global_trees[TI_VOID]
3251 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3252 #define integer_one_node global_trees[TI_INTEGER_ONE]
3253 #define integer_three_node global_trees[TI_INTEGER_THREE]
3254 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3255 #define size_zero_node global_trees[TI_SIZE_ZERO]
3256 #define size_one_node global_trees[TI_SIZE_ONE]
3257 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3258 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3259 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3261 /* Base access nodes. */
3262 #define access_public_node global_trees[TI_PUBLIC]
3263 #define access_protected_node global_trees[TI_PROTECTED]
3264 #define access_private_node global_trees[TI_PRIVATE]
3266 #define null_pointer_node global_trees[TI_NULL_POINTER]
3268 #define float_type_node global_trees[TI_FLOAT_TYPE]
3269 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3270 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3272 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3273 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3274 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3275 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3277 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3278 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3279 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3280 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3282 #define void_type_node global_trees[TI_VOID_TYPE]
3283 /* The C type `void *'. */
3284 #define ptr_type_node global_trees[TI_PTR_TYPE]
3285 /* The C type `const void *'. */
3286 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3287 /* The C type `size_t'. */
3288 #define size_type_node global_trees[TI_SIZE_TYPE]
3289 #define pid_type_node global_trees[TI_PID_TYPE]
3290 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3291 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3292 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3293 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3294 /* The C type `FILE *'. */
3295 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3296 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3298 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3299 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3300 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3302 /* The decimal floating point types. */
3303 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3304 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3305 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3306 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3307 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3308 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3310 /* The fixed-point types. */
3311 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3312 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3313 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3314 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3315 #define sat_unsigned_short_fract_type_node \
3316 global_trees[TI_SAT_USFRACT_TYPE]
3317 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3318 #define sat_unsigned_long_fract_type_node \
3319 global_trees[TI_SAT_ULFRACT_TYPE]
3320 #define sat_unsigned_long_long_fract_type_node \
3321 global_trees[TI_SAT_ULLFRACT_TYPE]
3322 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3323 #define fract_type_node global_trees[TI_FRACT_TYPE]
3324 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3325 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3326 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3327 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3328 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3329 #define unsigned_long_long_fract_type_node \
3330 global_trees[TI_ULLFRACT_TYPE]
3331 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3332 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3333 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3334 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3335 #define sat_unsigned_short_accum_type_node \
3336 global_trees[TI_SAT_USACCUM_TYPE]
3337 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3338 #define sat_unsigned_long_accum_type_node \
3339 global_trees[TI_SAT_ULACCUM_TYPE]
3340 #define sat_unsigned_long_long_accum_type_node \
3341 global_trees[TI_SAT_ULLACCUM_TYPE]
3342 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3343 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3344 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3345 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3346 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3347 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3348 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3349 #define unsigned_long_long_accum_type_node \
3350 global_trees[TI_ULLACCUM_TYPE]
3351 #define qq_type_node global_trees[TI_QQ_TYPE]
3352 #define hq_type_node global_trees[TI_HQ_TYPE]
3353 #define sq_type_node global_trees[TI_SQ_TYPE]
3354 #define dq_type_node global_trees[TI_DQ_TYPE]
3355 #define tq_type_node global_trees[TI_TQ_TYPE]
3356 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3357 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3358 #define usq_type_node global_trees[TI_USQ_TYPE]
3359 #define udq_type_node global_trees[TI_UDQ_TYPE]
3360 #define utq_type_node global_trees[TI_UTQ_TYPE]
3361 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3362 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3363 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3364 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3365 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3366 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3367 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3368 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3369 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3370 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3371 #define ha_type_node global_trees[TI_HA_TYPE]
3372 #define sa_type_node global_trees[TI_SA_TYPE]
3373 #define da_type_node global_trees[TI_DA_TYPE]
3374 #define ta_type_node global_trees[TI_TA_TYPE]
3375 #define uha_type_node global_trees[TI_UHA_TYPE]
3376 #define usa_type_node global_trees[TI_USA_TYPE]
3377 #define uda_type_node global_trees[TI_UDA_TYPE]
3378 #define uta_type_node global_trees[TI_UTA_TYPE]
3379 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3380 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3381 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3382 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3383 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3384 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3385 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3386 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3388 /* The node that should be placed at the end of a parameter list to
3389 indicate that the function does not take a variable number of
3390 arguments. The TREE_VALUE will be void_type_node and there will be
3391 no TREE_CHAIN. Language-independent code should not assume
3392 anything else about this node. */
3393 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3395 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3396 #define MAIN_NAME_P(NODE) \
3397 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3399 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3401 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3402 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3404 /* Default/current target options (TARGET_OPTION_NODE). */
3405 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3406 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3408 /* Default tree list option(), optimize() pragmas to be linked into the
3410 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3411 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3413 #define char_type_node integer_types[itk_char]
3414 #define signed_char_type_node integer_types[itk_signed_char]
3415 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3416 #define short_integer_type_node integer_types[itk_short]
3417 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3418 #define integer_type_node integer_types[itk_int]
3419 #define unsigned_type_node integer_types[itk_unsigned_int]
3420 #define long_integer_type_node integer_types[itk_long]
3421 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3422 #define long_long_integer_type_node integer_types[itk_long_long]
3423 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3424 #define int128_integer_type_node integer_types[itk_int128]
3425 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3427 /* True if NODE is an erroneous expression. */
3429 #define error_operand_p(NODE) \
3430 ((NODE) == error_mark_node \
3431 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3433 extern tree decl_assembler_name (tree);
3434 extern tree decl_comdat_group (const_tree);
3435 extern tree decl_comdat_group_id (const_tree);
3436 extern const char *decl_section_name (const_tree);
3437 extern void set_decl_section_name (tree, const char *);
3438 extern enum tls_model decl_tls_model (const_tree);
3439 extern void set_decl_tls_model (tree, enum tls_model);
3441 /* Compute the number of bytes occupied by 'node'. This routine only
3442 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3444 extern size_t tree_size (const_tree);
3446 /* Compute the number of bytes occupied by a tree with code CODE.
3447 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3448 which are of variable length. */
3449 extern size_t tree_code_size (enum tree_code);
3451 /* Allocate and return a new UID from the DECL_UID namespace. */
3452 extern int allocate_decl_uid (void);
3454 /* Lowest level primitive for allocating a node.
3455 The TREE_CODE is the only argument. Contents are initialized
3456 to zero except for a few of the common fields. */
3458 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3459 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3461 /* Make a copy of a node, with all the same contents. */
3463 extern tree copy_node_stat (tree MEM_STAT_DECL);
3464 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3466 /* Make a copy of a chain of TREE_LIST nodes. */
3468 extern tree copy_list (tree);
3470 /* Make a CASE_LABEL_EXPR. */
3472 extern tree build_case_label (tree, tree, tree);
3475 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3476 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3478 /* Make an INTEGER_CST. */
3480 extern tree make_int_cst_stat (int, int MEM_STAT_DECL);
3481 #define make_int_cst(LEN, EXT_LEN) \
3482 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3484 /* Make a TREE_VEC. */
3486 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3487 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3489 /* Grow a TREE_VEC. */
3491 extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3492 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3494 /* Construct various types of nodes. */
3496 extern tree build_nt (enum tree_code, ...);
3497 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3499 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3500 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3501 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3502 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3503 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3504 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3505 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3506 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3507 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3508 tree MEM_STAT_DECL);
3509 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3510 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3511 tree MEM_STAT_DECL);
3512 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3514 /* _loc versions of build[1-5]. */
3517 build1_stat_loc (location_t loc, enum tree_code code, tree type,
3518 tree arg1 MEM_STAT_DECL)
3520 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3521 if (CAN_HAVE_LOCATION_P (t))
3522 SET_EXPR_LOCATION (t, loc);
3525 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3528 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3529 tree arg1 MEM_STAT_DECL)
3531 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3532 if (CAN_HAVE_LOCATION_P (t))
3533 SET_EXPR_LOCATION (t, loc);
3536 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3539 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3540 tree arg1, tree arg2 MEM_STAT_DECL)
3542 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3543 if (CAN_HAVE_LOCATION_P (t))
3544 SET_EXPR_LOCATION (t, loc);
3547 #define build3_loc(l,c,t1,t2,t3,t4) \
3548 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3551 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3552 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3554 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3555 if (CAN_HAVE_LOCATION_P (t))
3556 SET_EXPR_LOCATION (t, loc);
3559 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3560 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3563 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3564 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3566 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3567 arg4 PASS_MEM_STAT);
3568 if (CAN_HAVE_LOCATION_P (t))
3569 SET_EXPR_LOCATION (t, loc);
3572 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3573 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3575 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3576 #define build_var_debug_value(t1,t2) \
3577 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3579 /* Constructs double_int from tree CST. */
3581 extern tree double_int_to_tree (tree, double_int);
3583 extern tree wide_int_to_tree (tree type, const wide_int_ref &cst);
3584 extern tree force_fit_type (tree, const wide_int_ref &, int, bool);
3586 /* Create an INT_CST node with a CST value zero extended. */
3589 extern tree build_int_cst (tree, HOST_WIDE_INT);
3590 extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst);
3591 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3592 extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3593 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3594 extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3595 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3596 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3597 extern tree build_vector_from_val (tree, tree);
3598 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3599 extern tree build_constructor_single (tree, tree, tree);
3600 extern tree build_constructor_from_list (tree, tree);
3601 extern tree build_constructor_va (tree, int, ...);
3602 extern tree build_real_from_int_cst (tree, const_tree);
3603 extern tree build_complex (tree, tree, tree);
3604 extern tree build_one_cst (tree);
3605 extern tree build_minus_one_cst (tree);
3606 extern tree build_all_ones_cst (tree);
3607 extern tree build_zero_cst (tree);
3608 extern tree build_string (int, const char *);
3609 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3610 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3611 extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3612 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3613 extern tree build_decl_stat (location_t, enum tree_code,
3614 tree, tree MEM_STAT_DECL);
3615 extern tree build_fn_decl (const char *, tree);
3616 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3617 extern tree build_translation_unit_decl (tree);
3618 extern tree build_block (tree, tree, tree, tree);
3619 extern tree build_empty_stmt (location_t);
3620 extern tree build_omp_clause (location_t, enum omp_clause_code);
3622 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3623 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3625 extern tree build_call_nary (tree, tree, int, ...);
3626 extern tree build_call_valist (tree, tree, int, va_list);
3627 #define build_call_array(T1,T2,N,T3)\
3628 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3629 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3630 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3631 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
3632 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
3633 extern tree build_call_expr_loc (location_t, tree, int, ...);
3634 extern tree build_call_expr (tree, int, ...);
3635 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3637 extern tree build_string_literal (int, const char *);
3639 /* Construct various nodes representing data types. */
3641 extern tree signed_or_unsigned_type_for (int, tree);
3642 extern tree signed_type_for (tree);
3643 extern tree unsigned_type_for (tree);
3644 extern tree truth_type_for (tree);
3645 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3646 extern tree build_pointer_type (tree);
3647 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3648 extern tree build_reference_type (tree);
3649 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3650 extern tree build_vector_type (tree innertype, int nunits);
3651 extern tree build_opaque_vector_type (tree innertype, int nunits);
3652 extern tree build_index_type (tree);
3653 extern tree build_array_type (tree, tree);
3654 extern tree build_nonshared_array_type (tree, tree);
3655 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
3656 extern tree build_function_type (tree, tree);
3657 extern tree build_function_type_list (tree, ...);
3658 extern tree build_varargs_function_type_list (tree, ...);
3659 extern tree build_function_type_array (tree, int, tree *);
3660 extern tree build_varargs_function_type_array (tree, int, tree *);
3661 #define build_function_type_vec(RET, V) \
3662 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3663 #define build_varargs_function_type_vec(RET, V) \
3664 build_varargs_function_type_array (RET, vec_safe_length (V), \
3665 vec_safe_address (V))
3666 extern tree build_method_type_directly (tree, tree, tree);
3667 extern tree build_method_type (tree, tree);
3668 extern tree build_offset_type (tree, tree);
3669 extern tree build_complex_type (tree);
3670 extern tree array_type_nelts (const_tree);
3672 extern tree value_member (tree, tree);
3673 extern tree purpose_member (const_tree, tree);
3674 extern bool vec_member (const_tree, vec<tree, va_gc> *);
3675 extern tree chain_index (int, tree);
3677 extern int attribute_list_equal (const_tree, const_tree);
3678 extern int attribute_list_contained (const_tree, const_tree);
3679 extern int tree_int_cst_equal (const_tree, const_tree);
3681 extern bool tree_fits_shwi_p (const_tree)
3682 #ifndef ENABLE_TREE_CHECKING
3683 ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */
3686 extern bool tree_fits_uhwi_p (const_tree)
3687 #ifndef ENABLE_TREE_CHECKING
3688 ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */
3691 extern HOST_WIDE_INT tree_to_shwi (const_tree);
3692 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
3693 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3694 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
3695 tree_to_shwi (const_tree t)
3697 gcc_assert (tree_fits_shwi_p (t));
3698 return TREE_INT_CST_LOW (t);
3701 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
3702 tree_to_uhwi (const_tree t)
3704 gcc_assert (tree_fits_uhwi_p (t));
3705 return TREE_INT_CST_LOW (t);
3708 extern int tree_int_cst_sgn (const_tree);
3709 extern int tree_int_cst_sign_bit (const_tree);
3710 extern unsigned int tree_int_cst_min_precision (tree, signop);
3711 extern tree strip_array_types (tree);
3712 extern tree excess_precision_type (tree);
3713 extern bool valid_constant_size_p (const_tree);
3716 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3717 put the prototype here. Rtl.h does declare the prototype if
3718 tree.h had been included. */
3720 extern tree make_tree (tree, rtx);
3722 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3725 Such modified types already made are recorded so that duplicates
3728 extern tree build_type_attribute_variant (tree, tree);
3729 extern tree build_decl_attribute_variant (tree, tree);
3730 extern tree build_type_attribute_qual_variant (tree, tree, int);
3732 /* Return 0 if the attributes for two types are incompatible, 1 if they
3733 are compatible, and 2 if they are nearly compatible (which causes a
3734 warning to be generated). */
3735 extern int comp_type_attributes (const_tree, const_tree);
3737 /* Default versions of target-overridable functions. */
3738 extern tree merge_decl_attributes (tree, tree);
3739 extern tree merge_type_attributes (tree, tree);
3741 /* This function is a private implementation detail of lookup_attribute()
3742 and you should never call it directly. */
3743 extern tree private_lookup_attribute (const char *, size_t, tree);
3745 /* This function is a private implementation detail
3746 of lookup_attribute_by_prefix() and you should never call it directly. */
3747 extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree);
3749 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3750 return a pointer to the attribute's list element if the attribute
3751 is part of the list, or NULL_TREE if not found. If the attribute
3752 appears more than once, this only returns the first occurrence; the
3753 TREE_CHAIN of the return value should be passed back in if further
3754 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3758 lookup_attribute (const char *attr_name, tree list)
3760 gcc_checking_assert (attr_name[0] != '_');
3761 /* In most cases, list is NULL_TREE. */
3762 if (list == NULL_TREE)
3765 /* Do the strlen() before calling the out-of-line implementation.
3766 In most cases attr_name is a string constant, and the compiler
3767 will optimize the strlen() away. */
3768 return private_lookup_attribute (attr_name, strlen (attr_name), list);
3771 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3772 return a pointer to the attribute's list first element if the attribute
3773 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
3777 lookup_attribute_by_prefix (const char *attr_name, tree list)
3779 gcc_checking_assert (attr_name[0] != '_');
3780 /* In most cases, list is NULL_TREE. */
3781 if (list == NULL_TREE)
3784 return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name),
3789 /* This function is a private implementation detail of
3790 is_attribute_p() and you should never call it directly. */
3791 extern bool private_is_attribute_p (const char *, size_t, const_tree);
3793 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3794 if the identifier node is a valid attribute name for the string.
3795 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3796 be the identifier for 'text' or for '__text__'. */
3799 is_attribute_p (const char *attr_name, const_tree ident)
3801 gcc_checking_assert (attr_name[0] != '_');
3802 /* Do the strlen() before calling the out-of-line implementation.
3803 In most cases attr_name is a string constant, and the compiler
3804 will optimize the strlen() away. */
3805 return private_is_attribute_p (attr_name, strlen (attr_name), ident);
3808 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3809 modified list. ATTR_NAME must be in the form 'text' (not
3812 extern tree remove_attribute (const char *, tree);
3814 /* Given two attributes lists, return a list of their union. */
3816 extern tree merge_attributes (tree, tree);
3818 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3819 /* Given two Windows decl attributes lists, possibly including
3820 dllimport, return a list of their union . */
3821 extern tree merge_dllimport_decl_attributes (tree, tree);
3823 /* Handle a "dllimport" or "dllexport" attribute. */
3824 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3827 /* Check whether CAND is suitable to be returned from get_qualified_type
3828 (BASE, TYPE_QUALS). */
3830 extern bool check_qualified_type (const_tree, const_tree, int);
3832 /* Return a version of the TYPE, qualified as indicated by the
3833 TYPE_QUALS, if one exists. If no qualified version exists yet,
3834 return NULL_TREE. */
3836 extern tree get_qualified_type (tree, int);
3838 /* Like get_qualified_type, but creates the type if it does not
3839 exist. This function never returns NULL_TREE. */
3841 extern tree build_qualified_type (tree, int);
3843 /* Create a variant of type T with alignment ALIGN. */
3845 extern tree build_aligned_type (tree, unsigned int);
3847 /* Like build_qualified_type, but only deals with the `const' and
3848 `volatile' qualifiers. This interface is retained for backwards
3849 compatibility with the various front-ends; new code should use
3850 build_qualified_type instead. */
3852 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3853 build_qualified_type ((TYPE), \
3854 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3855 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3857 /* Make a copy of a type node. */
3859 extern tree build_distinct_type_copy (tree);
3860 extern tree build_variant_type_copy (tree);
3862 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3863 return a canonicalized ..._TYPE node, so that duplicates are not made.
3864 How the hash code is computed is up to the caller, as long as any two
3865 callers that could hash identical-looking type nodes agree. */
3867 extern tree type_hash_canon (unsigned int, tree);
3869 extern tree convert (tree, tree);
3870 extern unsigned int expr_align (const_tree);
3871 extern tree size_in_bytes (const_tree);
3872 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
3873 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
3874 extern tree bit_position (const_tree);
3875 extern HOST_WIDE_INT int_bit_position (const_tree);
3876 extern tree byte_position (const_tree);
3877 extern HOST_WIDE_INT int_byte_position (const_tree);
3879 #define sizetype sizetype_tab[(int) stk_sizetype]
3880 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3881 #define ssizetype sizetype_tab[(int) stk_ssizetype]
3882 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3883 #define size_int(L) size_int_kind (L, stk_sizetype)
3884 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
3885 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3886 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3888 /* Type for sizes of data-type. */
3890 #define BITS_PER_UNIT_LOG \
3891 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3892 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3893 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3895 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3896 by making the last node in X point to Y.
3897 Returns X, except if X is 0 returns Y. */
3899 extern tree chainon (tree, tree);
3901 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3903 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
3904 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3906 /* Return the last tree node in a chain. */
3908 extern tree tree_last (tree);
3910 /* Reverse the order of elements in a chain, and return the new head. */
3912 extern tree nreverse (tree);
3914 /* Returns the length of a chain of nodes
3915 (number of chain pointers to follow before reaching a null pointer). */
3917 extern int list_length (const_tree);
3919 /* Returns the first FIELD_DECL in a type. */
3921 extern tree first_field (const_tree);
3923 /* Given an initializer INIT, return TRUE if INIT is zero or some
3924 aggregate of zeros. Otherwise return FALSE. */
3926 extern bool initializer_zerop (const_tree);
3928 /* Given a vector VEC, return its first element if all elements are
3929 the same. Otherwise return NULL_TREE. */
3931 extern tree uniform_vector_p (const_tree);
3933 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
3935 extern vec<tree, va_gc> *ctor_to_vec (tree);
3937 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3939 extern int integer_zerop (const_tree);
3941 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3943 extern int integer_onep (const_tree);
3945 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3946 all of whose significant bits are 1. */
3948 extern int integer_all_onesp (const_tree);
3950 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
3953 extern int integer_minus_onep (const_tree);
3955 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3956 exactly one bit 1. */
3958 extern int integer_pow2p (const_tree);
3960 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3961 with a nonzero value. */
3963 extern int integer_nonzerop (const_tree);
3965 extern bool cst_and_fits_in_hwi (const_tree);
3966 extern tree num_ending_zeros (const_tree);
3968 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
3971 extern int fixed_zerop (const_tree);
3973 /* staticp (tree x) is nonzero if X is a reference to data allocated
3974 at a fixed address in memory. Returns the outermost data. */
3976 extern tree staticp (tree);
3978 /* save_expr (EXP) returns an expression equivalent to EXP
3979 but it can be used multiple times within context CTX
3980 and only evaluate EXP once. */
3982 extern tree save_expr (tree);
3984 /* Look inside EXPR into any simple arithmetic operations. Return the
3985 outermost non-arithmetic or non-invariant node. */
3987 extern tree skip_simple_arithmetic (tree);
3989 /* Look inside EXPR into simple arithmetic operations involving constants.
3990 Return the outermost non-arithmetic or non-constant node. */
3992 extern tree skip_simple_constant_arithmetic (tree);
3994 /* Return which tree structure is used by T. */
3996 enum tree_node_structure_enum tree_node_structure (const_tree);
3998 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3999 size or offset that depends on a field within a record. */
4001 extern bool contains_placeholder_p (const_tree);
4003 /* This macro calls the above function but short-circuits the common
4004 case of a constant to save time. Also check for null. */
4006 #define CONTAINS_PLACEHOLDER_P(EXP) \
4007 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4009 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4010 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4013 extern bool type_contains_placeholder_p (tree);
4015 /* Given a tree EXP, find all occurrences of references to fields
4016 in a PLACEHOLDER_EXPR and place them in vector REFS without
4017 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4018 we assume here that EXP contains only arithmetic expressions
4019 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4022 extern void find_placeholder_in_expr (tree, vec<tree> *);
4024 /* This macro calls the above function but short-circuits the common
4025 case of a constant to save time and also checks for NULL. */
4027 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4029 if((EXP) && !TREE_CONSTANT (EXP)) \
4030 find_placeholder_in_expr (EXP, V); \
4033 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4034 return a tree with all occurrences of references to F in a
4035 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4036 CONST_DECLs. Note that we assume here that EXP contains only
4037 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4038 occurring only in their argument list. */
4040 extern tree substitute_in_expr (tree, tree, tree);
4042 /* This macro calls the above function but short-circuits the common
4043 case of a constant to save time and also checks for NULL. */
4045 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4046 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4048 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4049 for it within OBJ, a tree that is an object or a chain of references. */
4051 extern tree substitute_placeholder_in_expr (tree, tree);
4053 /* This macro calls the above function but short-circuits the common
4054 case of a constant to save time and also checks for NULL. */
4056 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4057 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4058 : substitute_placeholder_in_expr (EXP, OBJ))
4061 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4062 but it can be used multiple times
4063 and only evaluate the subexpressions once. */
4065 extern tree stabilize_reference (tree);
4067 /* Return EXP, stripped of any conversions to wider types
4068 in such a way that the result of converting to type FOR_TYPE
4069 is the same as if EXP were converted to FOR_TYPE.
4070 If FOR_TYPE is 0, it signifies EXP's type. */
4072 extern tree get_unwidened (tree, tree);
4074 /* Return OP or a simpler expression for a narrower value
4075 which can be sign-extended or zero-extended to give back OP.
4076 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4077 or 0 if the value should be sign-extended. */
4079 extern tree get_narrower (tree, int *);
4081 /* Return true if T is an expression that get_inner_reference handles. */
4084 handled_component_p (const_tree t)
4086 switch (TREE_CODE (t))
4091 case ARRAY_RANGE_REF:
4094 case VIEW_CONVERT_EXPR:
4102 /* Given a DECL or TYPE, return the scope in which it was declared, or
4103 NUL_TREE if there is no containing scope. */
4105 extern tree get_containing_scope (const_tree);
4107 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4109 extern tree decl_function_context (const_tree);
4111 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4112 this _DECL with its context, or zero if none. */
4113 extern tree decl_type_context (const_tree);
4115 /* Return 1 if EXPR is the real constant zero. */
4116 extern int real_zerop (const_tree);
4118 /* Initialize the iterator I with arguments from function FNDECL */
4121 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4123 i->next = TYPE_ARG_TYPES (fntype);
4126 /* Return a pointer that holds the next argument if there are more arguments to
4127 handle, otherwise return NULL. */
4129 static inline tree *
4130 function_args_iter_cond_ptr (function_args_iterator *i)
4132 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4135 /* Return the next argument if there are more arguments to handle, otherwise
4139 function_args_iter_cond (function_args_iterator *i)
4141 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4144 /* Advance to the next argument. */
4146 function_args_iter_next (function_args_iterator *i)
4148 gcc_assert (i->next != NULL_TREE);
4149 i->next = TREE_CHAIN (i->next);
4152 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4155 inlined_function_outer_scope_p (const_tree block)
4157 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4160 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4161 to point to the next tree element. ITER is an instance of
4162 function_args_iterator used to iterate the arguments. */
4163 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4164 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4165 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4166 function_args_iter_next (&(ITER)))
4168 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4169 to the next tree element. ITER is an instance of function_args_iterator
4170 used to iterate the arguments. */
4171 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4172 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4173 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4174 function_args_iter_next (&(ITER)))
4177 extern unsigned crc32_string (unsigned, const char *);
4178 extern unsigned crc32_byte (unsigned, char);
4179 extern unsigned crc32_unsigned (unsigned, unsigned);
4180 extern void clean_symbol_name (char *);
4181 extern tree get_file_function_name (const char *);
4182 extern tree get_callee_fndecl (const_tree);
4183 extern int type_num_arguments (const_tree);
4184 extern bool associative_tree_code (enum tree_code);
4185 extern bool commutative_tree_code (enum tree_code);
4186 extern bool commutative_ternary_tree_code (enum tree_code);
4187 extern tree upper_bound_in_type (tree, tree);
4188 extern tree lower_bound_in_type (tree, tree);
4189 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4190 extern tree create_artificial_label (location_t);
4191 extern const char *get_name (tree);
4192 extern bool stdarg_p (const_tree);
4193 extern bool prototype_p (tree);
4194 extern bool is_typedef_decl (tree x);
4195 extern bool typedef_variant_p (tree);
4196 extern bool auto_var_in_fn_p (const_tree, const_tree);
4197 extern tree build_low_bits_mask (tree, unsigned);
4198 extern tree tree_strip_nop_conversions (tree);
4199 extern tree tree_strip_sign_nop_conversions (tree);
4200 extern const_tree strip_invariant_refs (const_tree);
4201 extern tree lhd_gcc_personality (void);
4202 extern void assign_assembler_name_if_neeeded (tree);
4203 extern void warn_deprecated_use (tree, tree);
4204 extern void cache_integer_cst (tree);
4206 /* Compare and hash for any structure which begins with a canonical
4207 pointer. Assumes all pointers are interchangeable, which is sort
4208 of already assumed by gcc elsewhere IIRC. */
4211 struct_ptr_eq (const void *a, const void *b)
4213 const void * const * x = (const void * const *) a;
4214 const void * const * y = (const void * const *) b;
4218 static inline hashval_t
4219 struct_ptr_hash (const void *a)
4221 const void * const * x = (const void * const *) a;
4222 return (intptr_t)*x >> 4;
4225 /* Return nonzero if CODE is a tree code that represents a truth value. */
4227 truth_value_p (enum tree_code code)
4229 return (TREE_CODE_CLASS (code) == tcc_comparison
4230 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4231 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4232 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4235 /* Return whether TYPE is a type suitable for an offset for
4236 a POINTER_PLUS_EXPR. */
4238 ptrofftype_p (tree type)
4240 return (INTEGRAL_TYPE_P (type)
4241 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4242 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4245 /* Return OFF converted to a pointer offset type suitable as offset for
4246 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4248 convert_to_ptrofftype_loc (location_t loc, tree off)
4250 return fold_convert_loc (loc, sizetype, off);
4252 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4254 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4256 fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off)
4258 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4259 ptr, convert_to_ptrofftype_loc (loc, off));
4261 #define fold_build_pointer_plus(p,o) \
4262 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4264 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4266 fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off)
4268 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4269 ptr, size_int (off));
4271 #define fold_build_pointer_plus_hwi(p,o) \
4272 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4274 extern tree strip_float_extensions (tree);
4275 extern int really_constant_p (const_tree);
4276 extern bool decl_address_invariant_p (const_tree);
4277 extern bool decl_address_ip_invariant_p (const_tree);
4278 extern bool int_fits_type_p (const_tree, const_tree);
4279 #ifndef GENERATOR_FILE
4280 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4282 extern bool variably_modified_type_p (tree, tree);
4283 extern int tree_log2 (const_tree);
4284 extern int tree_floor_log2 (const_tree);
4285 extern unsigned int tree_ctz (const_tree);
4286 extern int simple_cst_equal (const_tree, const_tree);
4287 extern void iterative_hstate_expr (const_tree, inchash &);
4289 /* Compat version until all callers are converted. Return hash for
4291 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
4293 inchash hstate (seed);
4294 iterative_hstate_expr (tree, hstate);
4295 return hstate.end ();
4298 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4299 extern int type_list_equal (const_tree, const_tree);
4300 extern int chain_member (const_tree, const_tree);
4301 extern void dump_tree_statistics (void);
4302 extern void recompute_tree_invariant_for_addr_expr (tree);
4303 extern bool needs_to_live_in_memory (const_tree);
4304 extern tree reconstruct_complex_type (tree, tree);
4305 extern int real_onep (const_tree);
4306 extern int real_minus_onep (const_tree);
4307 extern void init_ttree (void);
4308 extern void build_common_tree_nodes (bool, bool);
4309 extern void build_common_builtin_nodes (void);
4310 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4311 extern tree build_range_type (tree, tree, tree);
4312 extern tree build_nonshared_range_type (tree, tree, tree);
4313 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4314 extern HOST_WIDE_INT int_cst_value (const_tree);
4315 extern tree tree_block (tree);
4316 extern void tree_set_block (tree, tree);
4317 extern location_t *block_nonartificial_location (tree);
4318 extern location_t tree_nonartificial_location (tree);
4319 extern tree block_ultimate_origin (const_tree);
4320 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4321 extern bool virtual_method_call_p (tree);
4322 extern tree obj_type_ref_class (tree ref);
4323 extern bool types_same_for_odr (const_tree type1, const_tree type2);
4324 extern bool contains_bitfld_component_ref_p (const_tree);
4325 extern bool type_in_anonymous_namespace_p (const_tree);
4326 extern bool block_may_fallthru (const_tree);
4327 extern void using_eh_for_cleanups (void);
4328 extern bool using_eh_for_cleanups_p (void);
4329 extern const char *get_tree_code_name (enum tree_code);
4330 extern void set_call_expr_flags (tree, int);
4331 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
4333 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4335 #define walk_tree(a,b,c,d) \
4336 walk_tree_1 (a, b, c, d, NULL)
4337 #define walk_tree_without_duplicates(a,b,c) \
4338 walk_tree_without_duplicates_1 (a, b, c, NULL)
4340 extern tree get_base_address (tree t);
4341 extern tree drop_tree_overflow (tree);
4342 extern int tree_map_base_eq (const void *, const void *);
4343 extern unsigned int tree_map_base_hash (const void *);
4344 extern int tree_map_base_marked_p (const void *);
4346 #define tree_map_eq tree_map_base_eq
4347 extern unsigned int tree_map_hash (const void *);
4348 #define tree_map_marked_p tree_map_base_marked_p
4350 #define tree_decl_map_eq tree_map_base_eq
4351 extern unsigned int tree_decl_map_hash (const void *);
4352 #define tree_decl_map_marked_p tree_map_base_marked_p
4354 #define tree_int_map_eq tree_map_base_eq
4355 #define tree_int_map_hash tree_map_base_hash
4356 #define tree_int_map_marked_p tree_map_base_marked_p
4358 #define tree_vec_map_eq tree_map_base_eq
4359 #define tree_vec_map_hash tree_decl_map_hash
4360 #define tree_vec_map_marked_p tree_map_base_marked_p
4362 /* Initialize the abstract argument list iterator object ITER with the
4363 arguments from CALL_EXPR node EXP. */
4365 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4368 iter->n = call_expr_nargs (exp);
4373 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4376 iter->n = call_expr_nargs (exp);
4380 /* Return the next argument from abstract argument list iterator object ITER,
4381 and advance its state. Return NULL_TREE if there are no more arguments. */
4383 next_call_expr_arg (call_expr_arg_iterator *iter)
4386 if (iter->i >= iter->n)
4388 result = CALL_EXPR_ARG (iter->t, iter->i);
4393 static inline const_tree
4394 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4397 if (iter->i >= iter->n)
4399 result = CALL_EXPR_ARG (iter->t, iter->i);
4404 /* Initialize the abstract argument list iterator object ITER, then advance
4405 past and return the first argument. Useful in for expressions, e.g.
4406 for (arg = first_call_expr_arg (exp, &iter); arg;
4407 arg = next_call_expr_arg (&iter)) */
4409 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4411 init_call_expr_arg_iterator (exp, iter);
4412 return next_call_expr_arg (iter);
4415 static inline const_tree
4416 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4418 init_const_call_expr_arg_iterator (exp, iter);
4419 return next_const_call_expr_arg (iter);
4422 /* Test whether there are more arguments in abstract argument list iterator
4423 ITER, without changing its state. */
4425 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4427 return (iter->i < iter->n);
4430 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4431 (of type call_expr_arg_iterator) to hold the iteration state. */
4432 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4433 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4434 (arg) = next_call_expr_arg (&(iter)))
4436 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4437 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4438 (arg) = next_const_call_expr_arg (&(iter)))
4440 /* Return true if tree node T is a language-specific node. */
4442 is_lang_specific (tree t)
4444 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4447 /* Valid builtin number. */
4448 #define BUILTIN_VALID_P(FNCODE) \
4449 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4451 /* Return the tree node for an explicit standard builtin function or NULL. */
4453 builtin_decl_explicit (enum built_in_function fncode)
4455 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4457 return builtin_info.decl[(size_t)fncode];
4460 /* Return the tree node for an implicit builtin function or NULL. */
4462 builtin_decl_implicit (enum built_in_function fncode)
4464 size_t uns_fncode = (size_t)fncode;
4465 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4467 if (!builtin_info.implicit_p[uns_fncode])
4470 return builtin_info.decl[uns_fncode];
4473 /* Set explicit builtin function nodes and whether it is an implicit
4477 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4479 size_t ufncode = (size_t)fncode;
4481 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4482 && (decl != NULL_TREE || !implicit_p));
4484 builtin_info.decl[ufncode] = decl;
4485 builtin_info.implicit_p[ufncode] = implicit_p;
4488 /* Set the implicit flag for a builtin function. */
4491 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
4493 size_t uns_fncode = (size_t)fncode;
4495 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4496 && builtin_info.decl[uns_fncode] != NULL_TREE);
4498 builtin_info.implicit_p[uns_fncode] = implicit_p;
4501 /* Return whether the standard builtin function can be used as an explicit
4505 builtin_decl_explicit_p (enum built_in_function fncode)
4507 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4508 return (builtin_info.decl[(size_t)fncode] != NULL_TREE);
4511 /* Return whether the standard builtin function can be used implicitly. */
4514 builtin_decl_implicit_p (enum built_in_function fncode)
4516 size_t uns_fncode = (size_t)fncode;
4518 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4519 return (builtin_info.decl[uns_fncode] != NULL_TREE
4520 && builtin_info.implicit_p[uns_fncode]);
4523 /* Return true if T (assumed to be a DECL) is a global variable.
4524 A variable is considered global if its storage is not automatic. */
4527 is_global_var (const_tree t)
4529 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
4532 /* Return true if VAR may be aliased. A variable is considered as
4533 maybe aliased if it has its address taken by the local TU
4534 or possibly by another TU and might be modified through a pointer. */
4537 may_be_aliased (const_tree var)
4539 return (TREE_CODE (var) != CONST_DECL
4540 && (TREE_PUBLIC (var)
4541 || DECL_EXTERNAL (var)
4542 || TREE_ADDRESSABLE (var))
4543 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
4544 && ((TREE_READONLY (var)
4545 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
4546 || (TREE_CODE (var) == VAR_DECL
4547 && DECL_NONALIASED (var)))));
4550 /* Return pointer to optimization flags of FNDECL. */
4551 static inline struct cl_optimization *
4552 opts_for_fn (const_tree fndecl)
4554 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
4555 if (fn_opts == NULL_TREE)
4556 fn_opts = optimization_default_node;
4557 return TREE_OPTIMIZATION (fn_opts);
4560 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
4561 the optimization level of function fndecl. */
4562 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
4564 /* For anonymous aggregate types, we need some sort of name to
4565 hold on to. In practice, this should not appear, but it should
4566 not be harmful if it does. */
4567 #ifndef NO_DOT_IN_LABEL
4568 #define ANON_AGGRNAME_FORMAT "._%d"
4569 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
4570 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4571 #else /* NO_DOT_IN_LABEL */
4572 #ifndef NO_DOLLAR_IN_LABEL
4573 #define ANON_AGGRNAME_FORMAT "$_%d"
4574 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
4575 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4576 #else /* NO_DOLLAR_IN_LABEL */
4577 #define ANON_AGGRNAME_PREFIX "__anon_"
4578 #define ANON_AGGRNAME_P(ID_NODE) \
4579 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
4580 sizeof (ANON_AGGRNAME_PREFIX) - 1))
4581 #define ANON_AGGRNAME_FORMAT "__anon_%d"
4582 #endif /* NO_DOLLAR_IN_LABEL */
4583 #endif /* NO_DOT_IN_LABEL */
4585 /* The tree and const_tree overload templates. */
4589 struct int_traits <const_tree>
4591 static const enum precision_type precision_type = VAR_PRECISION;
4592 static const bool host_dependent_precision = false;
4593 static const bool is_sign_extended = false;
4594 static unsigned int get_precision (const_tree);
4595 static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int,
4600 struct int_traits <tree> : public int_traits <const_tree> {};
4609 extended_tree (const_tree);
4611 unsigned int get_precision () const;
4612 const HOST_WIDE_INT *get_val () const;
4613 unsigned int get_len () const;
4617 struct int_traits <extended_tree <N> >
4619 static const enum precision_type precision_type = CONST_PRECISION;
4620 static const bool host_dependent_precision = false;
4621 static const bool is_sign_extended = true;
4622 static const unsigned int precision = N;
4625 generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> >
4626 to_widest (const_tree);
4628 generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree);
4632 wi::int_traits <const_tree>::get_precision (const_tree tcst)
4634 return TYPE_PRECISION (TREE_TYPE (tcst));
4637 /* Convert the tree_cst X into a wide_int of PRECISION. */
4638 inline wi::storage_ref
4639 wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
4640 unsigned int precision, const_tree x)
4642 return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
4646 inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> >
4647 wi::to_widest (const_tree t)
4652 inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> >
4653 wi::to_offset (const_tree t)
4659 inline wi::extended_tree <N>::extended_tree (const_tree t)
4662 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
4667 wi::extended_tree <N>::get_precision () const
4673 inline const HOST_WIDE_INT *
4674 wi::extended_tree <N>::get_val () const
4676 return &TREE_INT_CST_ELT (m_t, 0);
4681 wi::extended_tree <N>::get_len () const
4683 if (N == ADDR_MAX_PRECISION)
4684 return TREE_INT_CST_OFFSET_NUNITS (m_t);
4685 else if (N >= WIDE_INT_MAX_PRECISION)
4686 return TREE_INT_CST_EXT_NUNITS (m_t);
4688 /* This class is designed to be used for specific output precisions
4689 and needs to be as fast as possible, so there is no fallback for
4696 template <typename T>
4697 bool fits_to_tree_p (const T &x, const_tree);
4699 wide_int min_value (const_tree);
4700 wide_int max_value (const_tree);
4701 wide_int from_mpz (const_tree, mpz_t, bool);
4704 template <typename T>
4706 wi::fits_to_tree_p (const T &x, const_tree type)
4708 if (TYPE_SIGN (type) == UNSIGNED)
4709 return eq_p (x, zext (x, TYPE_PRECISION (type)));
4711 return eq_p (x, sext (x, TYPE_PRECISION (type)));
4714 /* Produce the smallest number that is represented in TYPE. The precision
4715 and sign are taken from TYPE. */
4717 wi::min_value (const_tree type)
4719 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
4722 /* Produce the largest number that is represented in TYPE. The precision
4723 and sign are taken from TYPE. */
4725 wi::max_value (const_tree type)
4727 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
4730 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
4731 extending both according to their respective TYPE_SIGNs. */
4734 tree_int_cst_lt (const_tree t1, const_tree t2)
4736 return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2));
4739 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
4740 extending both according to their respective TYPE_SIGNs. */
4743 tree_int_cst_le (const_tree t1, const_tree t2)
4745 return wi::les_p (wi::to_widest (t1), wi::to_widest (t2));
4748 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
4749 are both INTEGER_CSTs and their values are extended according to their
4750 respective TYPE_SIGNs. */
4753 tree_int_cst_compare (const_tree t1, const_tree t2)
4755 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
4758 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
4759 but none of these files are allowed to be included from front ends.
4760 They should be split in two. One suitable for the FEs, the other suitable
4763 /* Assign the RTX to declaration. */
4764 extern void set_decl_rtl (tree, rtx);
4765 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
4767 /* Return a tree representing the upper bound of the array mentioned in
4768 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4769 extern tree array_ref_up_bound (tree);
4771 extern tree build_personality_function (const char *);
4773 /* Given an expression EXP that is a handled_component_p,
4774 look for the ultimate containing object, which is returned and specify
4775 the access position and size. */
4776 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4777 tree *, enum machine_mode *, int *, int *,
4780 /* Return a tree representing the lower bound of the array mentioned in
4781 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4782 extern tree array_ref_low_bound (tree);
4784 #endif /* GCC_TREE_H */
projects / platform / upstream / gcc.git / blob