1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
25 /* Macros for initializing `tree_contains_struct'. */
26 #define MARK_TS_BASE(C) \
28 tree_contains_struct[C][TS_BASE] = 1; \
31 #define MARK_TS_TYPED(C) \
34 tree_contains_struct[C][TS_TYPED] = 1; \
37 #define MARK_TS_COMMON(C) \
40 tree_contains_struct[C][TS_COMMON] = 1; \
43 #define MARK_TS_TYPE_COMMON(C) \
46 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
49 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
51 MARK_TS_TYPE_COMMON (C); \
52 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
55 #define MARK_TS_DECL_MINIMAL(C) \
58 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
61 #define MARK_TS_DECL_COMMON(C) \
63 MARK_TS_DECL_MINIMAL (C); \
64 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
67 #define MARK_TS_DECL_WRTL(C) \
69 MARK_TS_DECL_COMMON (C); \
70 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
73 #define MARK_TS_DECL_WITH_VIS(C) \
75 MARK_TS_DECL_WRTL (C); \
76 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
79 #define MARK_TS_DECL_NON_COMMON(C) \
81 MARK_TS_DECL_WITH_VIS (C); \
82 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
86 /* Returns the string representing CLASS. */
88 #define TREE_CODE_CLASS_STRING(CLASS)\
89 tree_code_class_strings[(int) (CLASS)]
91 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
93 /* Nonzero if NODE represents an exceptional code. */
95 #define EXCEPTIONAL_CLASS_P(NODE)\
96 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
98 /* Nonzero if NODE represents a constant. */
100 #define CONSTANT_CLASS_P(NODE)\
101 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
103 /* Nonzero if NODE represents a type. */
105 #define TYPE_P(NODE)\
106 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
108 /* Nonzero if NODE represents a declaration. */
110 #define DECL_P(NODE)\
111 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
113 /* True if NODE designates a variable declaration. */
114 #define VAR_P(NODE) \
115 (TREE_CODE (NODE) == VAR_DECL)
117 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
119 #define VAR_OR_FUNCTION_DECL_P(DECL)\
120 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
122 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
123 ascending code order. */
125 #define INDIRECT_REF_P(NODE)\
126 (TREE_CODE (NODE) == INDIRECT_REF)
128 /* Nonzero if NODE represents a reference. */
130 #define REFERENCE_CLASS_P(NODE)\
131 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
133 /* Nonzero if NODE represents a comparison. */
135 #define COMPARISON_CLASS_P(NODE)\
136 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
138 /* Nonzero if NODE represents a unary arithmetic expression. */
140 #define UNARY_CLASS_P(NODE)\
141 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
143 /* Nonzero if NODE represents a binary arithmetic expression. */
145 #define BINARY_CLASS_P(NODE)\
146 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
148 /* Nonzero if NODE represents a statement expression. */
150 #define STATEMENT_CLASS_P(NODE)\
151 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
153 /* Nonzero if NODE represents a function call-like expression with a
154 variable-length operand vector. */
156 #define VL_EXP_CLASS_P(NODE)\
157 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
159 /* Nonzero if NODE represents any other expression. */
161 #define EXPRESSION_CLASS_P(NODE)\
162 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
164 /* Returns nonzero iff NODE represents a type or declaration. */
166 #define IS_TYPE_OR_DECL_P(NODE)\
167 (TYPE_P (NODE) || DECL_P (NODE))
169 /* Returns nonzero iff CLASS is the tree-code class of an
172 #define IS_EXPR_CODE_CLASS(CLASS)\
173 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
175 /* Returns nonzero iff NODE is an expression of some kind. */
177 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
179 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
182 /* Helper macros for math builtins. */
184 #define BUILTIN_EXP10_P(FN) \
185 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
186 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
188 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
189 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
190 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
192 #define BUILTIN_SQRT_P(FN) \
193 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
195 #define BUILTIN_CBRT_P(FN) \
196 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
198 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
200 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
201 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
202 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
204 /* Define accessors for the fields that all tree nodes have
205 (though some fields are not used for all kinds of nodes). */
207 /* The tree-code says what kind of node it is.
208 Codes are defined in tree.def. */
209 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
210 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
212 /* When checking is enabled, errors will be generated if a tree node
213 is accessed incorrectly. The macros die with a fatal error. */
214 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
216 #define TREE_CHECK(T, CODE) \
217 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
219 #define TREE_NOT_CHECK(T, CODE) \
220 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
222 #define TREE_CHECK2(T, CODE1, CODE2) \
223 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
225 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
226 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
228 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
229 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
231 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
232 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
233 (CODE1), (CODE2), (CODE3)))
235 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
236 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
237 (CODE1), (CODE2), (CODE3), (CODE4)))
239 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
240 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
241 (CODE1), (CODE2), (CODE3), (CODE4)))
243 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
244 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
245 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
247 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
248 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
249 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
251 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
252 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
254 #define TREE_CLASS_CHECK(T, CLASS) \
255 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
257 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
258 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
260 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
261 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
263 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
264 (omp_clause_range_check ((T), (CODE1), (CODE2), \
265 __FILE__, __LINE__, __FUNCTION__))
267 /* These checks have to be special cased. */
268 #define EXPR_CHECK(T) \
269 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
271 /* These checks have to be special cased. */
272 #define NON_TYPE_CHECK(T) \
273 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
275 #define TREE_VEC_ELT_CHECK(T, I) \
276 (*(CONST_CAST2 (tree *, typeof (T)*, \
277 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
279 #define OMP_CLAUSE_ELT_CHECK(T, I) \
280 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
282 /* Special checks for TREE_OPERANDs. */
283 #define TREE_OPERAND_CHECK(T, I) \
284 (*(CONST_CAST2 (tree*, typeof (T)*, \
285 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
287 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
288 (*(tree_operand_check_code ((T), (CODE), (I), \
289 __FILE__, __LINE__, __FUNCTION__)))
291 /* Nodes are chained together for many purposes.
292 Types are chained together to record them for being output to the debugger
293 (see the function `chain_type').
294 Decls in the same scope are chained together to record the contents
296 Statement nodes for successive statements used to be chained together.
297 Often lists of things are represented by TREE_LIST nodes that
298 are chained together. */
300 #define TREE_CHAIN(NODE) \
301 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
303 /* In all nodes that are expressions, this is the data type of the expression.
304 In POINTER_TYPE nodes, this is the type that the pointer points to.
305 In ARRAY_TYPE nodes, this is the type of the elements.
306 In VECTOR_TYPE nodes, this is the type of the elements. */
307 #define TREE_TYPE(NODE) \
308 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
310 extern void tree_contains_struct_check_failed (const_tree
,
311 const enum tree_node_structure_enum
,
312 const char *, int, const char *)
315 extern void tree_check_failed (const_tree
, const char *, int, const char *,
316 ...) ATTRIBUTE_NORETURN
;
317 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
318 ...) ATTRIBUTE_NORETURN
;
319 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
320 const char *, int, const char *)
322 extern void tree_range_check_failed (const_tree
, const char *, int,
323 const char *, enum tree_code
,
326 extern void tree_not_class_check_failed (const_tree
,
327 const enum tree_code_class
,
328 const char *, int, const char *)
330 extern void tree_vec_elt_check_failed (int, int, const char *,
333 extern void phi_node_elt_check_failed (int, int, const char *,
336 extern void tree_operand_check_failed (int, const_tree
,
337 const char *, int, const char *)
339 extern void omp_clause_check_failed (const_tree
, const char *, int,
340 const char *, enum omp_clause_code
)
342 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
345 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
346 const char *, enum omp_clause_code
,
347 enum omp_clause_code
)
350 #else /* not ENABLE_TREE_CHECKING, or not gcc */
352 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
353 #define TREE_CHECK(T, CODE) (T)
354 #define TREE_NOT_CHECK(T, CODE) (T)
355 #define TREE_CHECK2(T, CODE1, CODE2) (T)
356 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
357 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
358 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
359 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
360 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
361 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
362 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
363 #define TREE_CLASS_CHECK(T, CODE) (T)
364 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
365 #define EXPR_CHECK(T) (T)
366 #define NON_TYPE_CHECK(T) (T)
367 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
368 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
369 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
370 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
371 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
372 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
374 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
375 #define TREE_TYPE(NODE) ((NODE)->typed.type)
379 #define TREE_BLOCK(NODE) (tree_block (NODE))
380 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
382 #include "tree-check.h"
384 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
385 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
386 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
387 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
388 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
389 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
390 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
391 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
392 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
393 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
394 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
396 #define RECORD_OR_UNION_CHECK(T) \
397 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
398 #define NOT_RECORD_OR_UNION_CHECK(T) \
399 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
401 #define NUMERICAL_TYPE_CHECK(T) \
402 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
405 /* Here is how primitive or already-canonicalized types' hash codes
407 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
409 /* A simple hash function for an arbitrary tree node. This must not be
410 used in hash tables which are saved to a PCH. */
411 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
413 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
414 #define CONVERT_EXPR_CODE_P(CODE) \
415 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
417 /* Similarly, but accept an expressions instead of a tree code. */
418 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
420 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
422 #define CASE_CONVERT \
426 /* Given an expression as a tree, strip any conversion that generates
427 no instruction. Accepts both tree and const_tree arguments since
428 we are not modifying the tree itself. */
430 #define STRIP_NOPS(EXP) \
431 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
433 /* Like STRIP_NOPS, but don't let the signedness change either. */
435 #define STRIP_SIGN_NOPS(EXP) \
436 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
438 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
440 #define STRIP_TYPE_NOPS(EXP) \
441 while ((CONVERT_EXPR_P (EXP) \
442 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
443 && TREE_OPERAND (EXP, 0) != error_mark_node \
444 && (TREE_TYPE (EXP) \
445 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
446 (EXP) = TREE_OPERAND (EXP, 0)
448 /* Remove unnecessary type conversions according to
449 tree_ssa_useless_type_conversion. */
451 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
452 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
454 /* Nonzero if TYPE represents a vector type. */
456 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
458 /* Nonzero if TYPE represents an integral type. Note that we do not
459 include COMPLEX types here. Keep these checks in ascending code
462 #define INTEGRAL_TYPE_P(TYPE) \
463 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
464 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
465 || TREE_CODE (TYPE) == INTEGER_TYPE)
467 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
469 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
470 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
472 /* Nonzero if TYPE represents a saturating fixed-point type. */
474 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
475 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
477 /* Nonzero if TYPE represents a fixed-point type. */
479 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
481 /* Nonzero if TYPE represents a scalar floating-point type. */
483 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
485 /* Nonzero if TYPE represents a complex floating-point type. */
487 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
488 (TREE_CODE (TYPE) == COMPLEX_TYPE \
489 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
491 /* Nonzero if TYPE represents a vector integer type. */
493 #define VECTOR_INTEGER_TYPE_P(TYPE) \
494 (VECTOR_TYPE_P (TYPE) \
495 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
498 /* Nonzero if TYPE represents a vector floating-point type. */
500 #define VECTOR_FLOAT_TYPE_P(TYPE) \
501 (VECTOR_TYPE_P (TYPE) \
502 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
504 /* Nonzero if TYPE represents a floating-point type, including complex
505 and vector floating-point types. The vector and complex check does
506 not use the previous two macros to enable early folding. */
508 #define FLOAT_TYPE_P(TYPE) \
509 (SCALAR_FLOAT_TYPE_P (TYPE) \
510 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
511 || VECTOR_TYPE_P (TYPE)) \
512 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
514 /* Nonzero if TYPE represents a decimal floating-point type. */
515 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
516 (SCALAR_FLOAT_TYPE_P (TYPE) \
517 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
519 /* Nonzero if TYPE is a record or union type. */
520 #define RECORD_OR_UNION_TYPE_P(TYPE) \
521 (TREE_CODE (TYPE) == RECORD_TYPE \
522 || TREE_CODE (TYPE) == UNION_TYPE \
523 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
525 /* Nonzero if TYPE represents an aggregate (multi-component) type.
526 Keep these checks in ascending code order. */
528 #define AGGREGATE_TYPE_P(TYPE) \
529 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
531 /* Nonzero if TYPE represents a pointer or reference type.
532 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
533 ascending code order. */
535 #define POINTER_TYPE_P(TYPE) \
536 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
538 /* Nonzero if TYPE represents a pointer to function. */
539 #define FUNCTION_POINTER_TYPE_P(TYPE) \
540 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
542 /* Nonzero if this type is a complete type. */
543 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
545 /* Nonzero if this type is a pointer bounds type. */
546 #define POINTER_BOUNDS_TYPE_P(NODE) \
547 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
549 /* Nonzero if this type is the (possibly qualified) void type. */
550 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
552 /* Nonzero if this type is complete or is cv void. */
553 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
554 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
556 /* Nonzero if this type is complete or is an array with unspecified bound. */
557 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
558 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
561 /* Define many boolean fields that all tree nodes have. */
563 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
564 of this is needed. So it cannot be in a register.
565 In a FUNCTION_DECL it has no meaning.
566 In LABEL_DECL nodes, it means a goto for this label has been seen
567 from a place outside all binding contours that restore stack levels.
568 In an artificial SSA_NAME that points to a stack partition with at least
569 two variables, it means that at least one variable has TREE_ADDRESSABLE.
570 In ..._TYPE nodes, it means that objects of this type must be fully
571 addressable. This means that pieces of this object cannot go into
572 register parameters, for example. If this a function type, this
573 means that the value must be returned in memory.
574 In CONSTRUCTOR nodes, it means object constructed must be in memory.
575 In IDENTIFIER_NODEs, this means that some extern decl for this name
576 had its address taken. That matters for inline functions.
577 In a STMT_EXPR, it means we want the result of the enclosed expression. */
578 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
580 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
581 exit of a function. Calls for which this is true are candidates for tail
582 call optimizations. */
583 #define CALL_EXPR_TAILCALL(NODE) \
584 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
586 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
587 CASE_LOW operand has been processed. */
588 #define CASE_LOW_SEEN(NODE) \
589 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
591 #define PREDICT_EXPR_OUTCOME(NODE) \
592 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
593 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
594 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
595 #define PREDICT_EXPR_PREDICTOR(NODE) \
596 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
598 /* In a VAR_DECL, nonzero means allocate static storage.
599 In a FUNCTION_DECL, nonzero if function has been defined.
600 In a CONSTRUCTOR, nonzero means allocate static storage. */
601 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
603 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
604 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
606 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
607 should only be executed if an exception is thrown, not on normal exit
609 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
611 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
612 separate cleanup in honor_protect_cleanup_actions. */
613 #define TRY_CATCH_IS_CLEANUP(NODE) \
614 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
616 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
617 CASE_HIGH operand has been processed. */
618 #define CASE_HIGH_SEEN(NODE) \
619 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
621 /* Used to mark scoped enums. */
622 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
624 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
625 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
627 /* In an expr node (usually a conversion) this means the node was made
628 implicitly and should not lead to any sort of warning. In a decl node,
629 warnings concerning the decl should be suppressed. This is used at
630 least for used-before-set warnings, and it set after one warning is
632 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
634 /* Used to indicate that this TYPE represents a compiler-generated entity. */
635 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
637 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
638 this string as an argument. */
639 #define TREE_SYMBOL_REFERENCED(NODE) \
640 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
642 /* Nonzero in a pointer or reference type means the data pointed to
643 by this type can alias anything. */
644 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
645 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
647 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
648 there was an overflow in folding. */
650 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
652 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
654 #define TREE_OVERFLOW_P(EXPR) \
655 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
657 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
658 nonzero means name is to be accessible from outside this translation unit.
659 In an IDENTIFIER_NODE, nonzero means an external declaration
660 accessible from outside this translation unit was previously seen
661 for this name in an inner scope. */
662 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
664 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
665 of cached values, or is something else. */
666 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
668 /* In a SAVE_EXPR, indicates that the original expression has already
669 been substituted with a VAR_DECL that contains the value. */
670 #define SAVE_EXPR_RESOLVED_P(NODE) \
671 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
673 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
675 #define CALL_EXPR_VA_ARG_PACK(NODE) \
676 (CALL_EXPR_CHECK (NODE)->base.public_flag)
678 /* In any expression, decl, or constant, nonzero means it has side effects or
679 reevaluation of the whole expression could produce a different value.
680 This is set if any subexpression is a function call, a side effect or a
681 reference to a volatile variable. In a ..._DECL, this is set only if the
682 declaration said `volatile'. This will never be set for a constant. */
683 #define TREE_SIDE_EFFECTS(NODE) \
684 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
686 /* In a LABEL_DECL, nonzero means this label had its address taken
687 and therefore can never be deleted and is a jump target for
689 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
691 /* Nonzero means this expression is volatile in the C sense:
692 its address should be of type `volatile WHATEVER *'.
693 In other words, the declared item is volatile qualified.
694 This is used in _DECL nodes and _REF nodes.
695 On a FUNCTION_DECL node, this means the function does not
696 return normally. This is the same effect as setting
697 the attribute noreturn on the function in C.
699 In a ..._TYPE node, means this type is volatile-qualified.
700 But use TYPE_VOLATILE instead of this macro when the node is a type,
701 because eventually we may make that a different bit.
703 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
704 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
706 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
707 accessing the memory pointed to won't generate a trap. However,
708 this only applies to an object when used appropriately: it doesn't
709 mean that writing a READONLY mem won't trap.
711 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
712 (or slice of the array) always belongs to the range of the array.
713 I.e. that the access will not trap, provided that the access to
714 the base to the array will not trap. */
715 #define TREE_THIS_NOTRAP(NODE) \
716 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
717 ARRAY_RANGE_REF)->base.nothrow_flag)
719 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
720 nonzero means it may not be the lhs of an assignment.
721 Nonzero in a FUNCTION_DECL means this function should be treated
722 as "const" function (can only read its arguments). */
723 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
725 /* Value of expression is constant. Always on in all ..._CST nodes. May
726 also appear in an expression or decl where the value is constant. */
727 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
729 /* Nonzero if NODE, a type, has had its sizes gimplified. */
730 #define TYPE_SIZES_GIMPLIFIED(NODE) \
731 (TYPE_CHECK (NODE)->base.constant_flag)
733 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
734 #define DECL_UNSIGNED(NODE) \
735 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
737 /* In integral and pointer types, means an unsigned type. */
738 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
740 /* True if overflow wraps around for the given integral type. That
741 is, TYPE_MAX + 1 == TYPE_MIN. */
742 #define TYPE_OVERFLOW_WRAPS(TYPE) \
743 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
745 /* True if overflow is undefined for the given integral type. We may
746 optimize on the assumption that values in the type never overflow.
748 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
749 must issue a warning based on warn_strict_overflow. In some cases
750 it will be appropriate to issue the warning immediately, and in
751 other cases it will be appropriate to simply set a flag and let the
752 caller decide whether a warning is appropriate or not. */
753 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
754 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
756 /* True if overflow for the given integral type should issue a
758 #define TYPE_OVERFLOW_TRAPS(TYPE) \
759 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
761 /* True if pointer types have undefined overflow. */
762 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
764 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
765 Nonzero in a FUNCTION_DECL means that the function has been compiled.
766 This is interesting in an inline function, since it might not need
767 to be compiled separately.
768 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
769 or TYPE_DECL if the debugging info for the type has been written.
770 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
771 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
773 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
775 /* Nonzero in a _DECL if the name is used in its scope.
776 Nonzero in an expr node means inhibit warning if value is unused.
777 In IDENTIFIER_NODEs, this means that some extern decl for this name
779 In a BLOCK, this means that the block contains variables that are used. */
780 #define TREE_USED(NODE) ((NODE)->base.used_flag)
782 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
783 throw an exception. In a CALL_EXPR, nonzero means the call cannot
784 throw. We can't easily check the node type here as the C++
785 frontend also uses this flag (for AGGR_INIT_EXPR). */
786 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
788 /* In a CALL_EXPR, means that it's safe to use the target of the call
789 expansion as the return slot for a call that returns in memory. */
790 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
791 (CALL_EXPR_CHECK (NODE)->base.private_flag)
793 /* Cilk keywords accessors. */
794 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
796 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
797 passed by invisible reference (and the TREE_TYPE is a pointer to the true
799 #define DECL_BY_REFERENCE(NODE) \
800 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
801 RESULT_DECL)->decl_common.decl_by_reference_flag)
803 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
805 #define DECL_READ_P(NODE) \
806 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
808 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
809 attempting to share the stack slot with some other variable. */
810 #define DECL_NONSHAREABLE(NODE) \
811 (TREE_CHECK2 (NODE, VAR_DECL, \
812 RESULT_DECL)->decl_common.decl_nonshareable_flag)
814 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
815 thunked-to function. */
816 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
818 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
819 it has been built for the declaration of a variable-sized object. */
820 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
821 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
823 /* In a type, nonzero means that all objects of the type are guaranteed by the
824 language or front-end to be properly aligned, so we can indicate that a MEM
825 of this type is aligned at least to the alignment of the type, even if it
826 doesn't appear that it is. We see this, for example, in object-oriented
827 languages where a tag field may show this is an object of a more-aligned
828 variant of the more generic type.
830 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
832 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
834 /* Used in classes in C++. */
835 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
836 /* Used in classes in C++. */
837 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
839 /* True if reference type NODE is a C++ rvalue reference. */
840 #define TYPE_REF_IS_RVALUE(NODE) \
841 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
843 /* Nonzero in a _DECL if the use of the name is defined as a
844 deprecated feature by __attribute__((deprecated)). */
845 #define TREE_DEPRECATED(NODE) \
846 ((NODE)->base.deprecated_flag)
848 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
849 uses are to be substituted for uses of the TREE_CHAINed identifier. */
850 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
851 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
853 /* In fixed-point types, means a saturating type. */
854 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
856 /* These flags are available for each language front end to use internally. */
857 #define TREE_LANG_FLAG_0(NODE) \
858 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
859 #define TREE_LANG_FLAG_1(NODE) \
860 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
861 #define TREE_LANG_FLAG_2(NODE) \
862 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
863 #define TREE_LANG_FLAG_3(NODE) \
864 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
865 #define TREE_LANG_FLAG_4(NODE) \
866 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
867 #define TREE_LANG_FLAG_5(NODE) \
868 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
869 #define TREE_LANG_FLAG_6(NODE) \
870 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
872 /* Define additional fields and accessors for nodes representing constants. */
874 /* In an INTEGER_CST node. These two together make a 2-word integer.
875 If the data type is signed, the value is sign-extended to 2 words
876 even though not all of them may really be in use.
877 In an unsigned constant shorter than 2 words, the extra bits are 0. */
878 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
879 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
880 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
882 #define INT_CST_LT(A, B) \
883 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
884 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
885 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
887 #define INT_CST_LT_UNSIGNED(A, B) \
888 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
889 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
890 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
891 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
892 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
894 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
895 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
897 #define TREE_FIXED_CST_PTR(NODE) \
898 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
899 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
901 /* In a STRING_CST */
902 /* In C terms, this is sizeof, not strlen. */
903 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
904 #define TREE_STRING_POINTER(NODE) \
905 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
907 /* In a COMPLEX_CST node. */
908 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
909 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
911 /* In a VECTOR_CST node. */
912 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
913 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
914 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
916 /* Define fields and accessors for some special-purpose tree nodes. */
918 #define IDENTIFIER_LENGTH(NODE) \
919 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
920 #define IDENTIFIER_POINTER(NODE) \
921 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
922 #define IDENTIFIER_HASH_VALUE(NODE) \
923 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
925 /* Translate a hash table identifier pointer to a tree_identifier
926 pointer, and vice versa. */
928 #define HT_IDENT_TO_GCC_IDENT(NODE) \
929 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
930 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
932 /* In a TREE_LIST node. */
933 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
934 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
936 /* In a TREE_VEC node. */
937 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
938 #define TREE_VEC_END(NODE) \
939 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
941 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
943 /* In a CONSTRUCTOR node. */
944 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
945 #define CONSTRUCTOR_ELT(NODE,IDX) \
946 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
947 #define CONSTRUCTOR_NELTS(NODE) \
948 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
950 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
951 value of each element (stored within VAL). IX must be a scratch variable
952 of unsigned integer type. */
953 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
954 for (IX = 0; (IX >= vec_safe_length (V)) \
956 : ((VAL = (*(V))[IX].value), \
960 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
961 the value of each element (stored within VAL) and its index (stored
962 within INDEX). IX must be a scratch variable of unsigned integer type. */
963 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
964 for (IX = 0; (IX >= vec_safe_length (V)) \
966 : (((void) (VAL = (*V)[IX].value)), \
967 (INDEX = (*V)[IX].index), \
971 /* Append a new constructor element to V, with the specified INDEX and VAL. */
972 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
974 constructor_elt _ce___ = {INDEX, VALUE}; \
975 vec_safe_push ((V), _ce___); \
978 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
979 constructor output purposes. */
980 #define CONSTRUCTOR_BITFIELD_P(NODE) \
981 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
983 /* True if NODE is a clobber right hand side, an expression of indeterminate
984 value that clobbers the LHS in a copy instruction. We use a volatile
985 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
986 In particular the volatile flag causes us to not prematurely remove
987 such clobber instructions. */
988 #define TREE_CLOBBER_P(NODE) \
989 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
991 /* Define fields and accessors for some nodes that represent expressions. */
993 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
994 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
995 && VOID_TYPE_P (TREE_TYPE (NODE)) \
996 && integer_zerop (TREE_OPERAND (NODE, 0)))
998 /* In ordinary expression nodes. */
999 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1000 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1002 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1003 length. Its value includes the length operand itself; that is,
1004 the minimum valid length is 1.
1005 Note that we have to bypass the use of TREE_OPERAND to access
1006 that field to avoid infinite recursion in expanding the macros. */
1007 #define VL_EXP_OPERAND_LENGTH(NODE) \
1008 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1010 /* Nonzero if is_gimple_debug() may possibly hold. */
1011 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1013 /* In a LOOP_EXPR node. */
1014 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1016 /* The source location of this expression. Non-tree_exp nodes such as
1017 decls and constants can be shared among multiple locations, so
1019 #define EXPR_LOCATION(NODE) \
1020 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1021 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1022 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1023 != UNKNOWN_LOCATION)
1024 /* The location to be used in a diagnostic about this expression. Do not
1025 use this macro if the location will be assigned to other expressions. */
1026 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \
1027 ? (NODE)->exp.locus : input_location)
1028 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1029 ? (NODE)->exp.locus : (LOCUS))
1030 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1031 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1033 /* True if a tree is an expression or statement that can have a
1035 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1037 extern void protected_set_expr_location (tree
, location_t
);
1039 /* In a TARGET_EXPR node. */
1040 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1041 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1042 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1044 /* DECL_EXPR accessor. This gives access to the DECL associated with
1045 the given declaration statement. */
1046 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1048 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1050 /* COMPOUND_LITERAL_EXPR accessors. */
1051 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1052 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1053 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1054 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1056 /* SWITCH_EXPR accessors. These give access to the condition, body and
1057 original condition type (before any compiler conversions)
1058 of the switch statement, respectively. */
1059 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1060 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1061 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1063 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1064 of a case label, respectively. */
1065 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1066 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1067 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1068 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1070 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1071 corresponding MEM_REF operands. */
1072 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1073 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1074 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1075 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1076 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1078 /* The operands of a BIND_EXPR. */
1079 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1080 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1081 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1083 /* GOTO_EXPR accessor. This gives access to the label associated with
1084 a goto statement. */
1085 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1087 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1088 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1089 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1091 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1092 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1093 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1094 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1095 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1096 /* Nonzero if we want to create an ASM_INPUT instead of an
1097 ASM_OPERAND with no operands. */
1098 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1099 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1101 /* COND_EXPR accessors. */
1102 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1103 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1104 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1106 /* Accessors for the chains of recurrences. */
1107 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1108 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1109 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1110 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1112 /* LABEL_EXPR accessor. This gives access to the label associated with
1113 the given label expression. */
1114 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1116 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1117 accessors for SSA operands. */
1119 /* CATCH_EXPR accessors. */
1120 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1121 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1123 /* EH_FILTER_EXPR accessors. */
1124 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1125 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1127 /* OBJ_TYPE_REF accessors. */
1128 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1129 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1130 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1132 /* ASSERT_EXPR accessors. */
1133 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1134 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1136 /* CALL_EXPR accessors.
1138 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1139 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1140 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1141 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1143 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1144 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1145 the argument count is zero when checking is enabled. Instead, do
1146 the pointer arithmetic to advance past the 3 fixed operands in a
1147 CALL_EXPR. That produces a valid pointer to just past the end of the
1148 operand array, even if it's not valid to dereference it. */
1149 #define CALL_EXPR_ARGP(NODE) \
1150 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1152 /* TM directives and accessors. */
1153 #define TRANSACTION_EXPR_BODY(NODE) \
1154 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1155 #define TRANSACTION_EXPR_OUTER(NODE) \
1156 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1157 #define TRANSACTION_EXPR_RELAXED(NODE) \
1158 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1160 /* OpenMP directive and clause accessors. */
1162 #define OMP_BODY(NODE) \
1163 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1164 #define OMP_CLAUSES(NODE) \
1165 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1167 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1168 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1170 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1171 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1173 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1174 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1175 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1177 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1178 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1179 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1180 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1181 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1182 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1183 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1185 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1186 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1188 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1190 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1191 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1193 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1195 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1197 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1199 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1200 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1202 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1203 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1205 #define OMP_TARGET_DATA_BODY(NODE) \
1206 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1207 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1208 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1210 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1211 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1213 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1214 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1216 #define OMP_CLAUSE_SIZE(NODE) \
1217 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1221 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1222 #define OMP_CLAUSE_DECL(NODE) \
1223 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1224 OMP_CLAUSE_PRIVATE, \
1225 OMP_CLAUSE__LOOPTEMP_), 0)
1226 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1227 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1228 != UNKNOWN_LOCATION)
1229 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1231 /* True on an OMP_SECTION statement that was the last lexical member.
1232 This status is meaningful in the implementation of lastprivate. */
1233 #define OMP_SECTION_LAST(NODE) \
1234 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1236 /* True on an OMP_PARALLEL statement if it represents an explicit
1237 combined parallel work-sharing constructs. */
1238 #define OMP_PARALLEL_COMBINED(NODE) \
1239 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1241 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1242 as opposed to relaxed. */
1243 #define OMP_ATOMIC_SEQ_CST(NODE) \
1244 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1245 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1247 /* True on a PRIVATE clause if its decl is kept around for debugging
1248 information only and its DECL_VALUE_EXPR is supposed to point
1249 to what it has been remapped to. */
1250 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1251 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1253 /* True on a PRIVATE clause if ctor needs access to outer region's
1255 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1256 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1258 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1259 decl is present in the chain. */
1260 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1261 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1262 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1263 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1264 OMP_CLAUSE_LASTPRIVATE),\
1266 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1267 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1269 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1270 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1271 #define OMP_CLAUSE_IF_EXPR(NODE) \
1272 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1273 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1274 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1275 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1276 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1278 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1279 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1281 #define OMP_CLAUSE_MAP_KIND(NODE) \
1282 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1284 /* Nonzero if this map clause is for array (rather than pointer) based array
1285 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1286 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1287 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1288 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1290 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1291 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1293 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1294 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1295 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1296 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1297 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1298 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1300 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1301 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1302 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1303 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1304 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1305 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1306 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1307 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1308 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1309 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1310 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1311 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1313 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1314 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1315 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1316 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1318 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1319 are always initialized inside of the loop construct, false otherwise. */
1320 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1321 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1323 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1324 are declared inside of the simd construct. */
1325 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1326 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1328 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1329 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1331 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1332 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1334 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1335 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1337 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1338 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1339 OMP_CLAUSE_THREAD_LIMIT), 0)
1341 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1342 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1344 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1345 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1346 OMP_CLAUSE_DIST_SCHEDULE), 0)
1348 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1349 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1351 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1352 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1354 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1355 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1357 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1358 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1360 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1361 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1363 /* SSA_NAME accessors. */
1365 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1366 if there is no name associated with it. */
1367 #define SSA_NAME_IDENTIFIER(NODE) \
1368 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1369 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1370 ? (NODE)->ssa_name.var \
1371 : DECL_NAME ((NODE)->ssa_name.var)) \
1374 /* Returns the variable being referenced. This can be NULL_TREE for
1375 temporaries not associated with any user variable.
1376 Once released, this is the only field that can be relied upon. */
1377 #define SSA_NAME_VAR(NODE) \
1378 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1379 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1380 ? NULL_TREE : (NODE)->ssa_name.var)
1382 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1383 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1385 /* Returns the statement which defines this SSA name. */
1386 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1388 /* Returns the SSA version number of this SSA name. Note that in
1389 tree SSA, version numbers are not per variable and may be recycled. */
1390 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1392 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1393 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1395 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1396 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1398 /* Nonzero if this SSA_NAME expression is currently on the free list of
1399 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1400 has no meaning for an SSA_NAME. */
1401 #define SSA_NAME_IN_FREE_LIST(NODE) \
1402 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1404 /* Nonzero if this SSA_NAME is the default definition for the
1405 underlying symbol. A default SSA name is created for symbol S if
1406 the very first reference to S in the function is a read operation.
1407 Default definitions are always created by an empty statement and
1408 belong to no basic block. */
1409 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1410 SSA_NAME_CHECK (NODE)->base.default_def_flag
1412 /* Attributes for SSA_NAMEs for pointer-type variables. */
1413 #define SSA_NAME_PTR_INFO(N) \
1414 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1416 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1417 #define SSA_NAME_RANGE_INFO(N) \
1418 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1420 /* Return the immediate_use information for an SSA_NAME. */
1421 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1423 #define OMP_CLAUSE_CODE(NODE) \
1424 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1426 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1427 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1429 #define OMP_CLAUSE_OPERAND(NODE, I) \
1430 OMP_CLAUSE_ELT_CHECK (NODE, I)
1432 /* In a BLOCK node. */
1433 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1434 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1435 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1436 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1437 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1438 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1439 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1440 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1441 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1442 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1443 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1445 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1446 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1448 /* An index number for this block. These values are not guaranteed to
1449 be unique across functions -- whether or not they are depends on
1450 the debugging output format in use. */
1451 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1453 /* If block reordering splits a lexical block into discontiguous
1454 address ranges, we'll make a copy of the original block.
1456 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1457 In that case, we have one source block that has been replicated
1458 (through inlining or unrolling) into many logical blocks, and that
1459 these logical blocks have different physical variables in them.
1461 In this case, we have one logical block split into several
1462 non-contiguous address ranges. Most debug formats can't actually
1463 represent this idea directly, so we fake it by creating multiple
1464 logical blocks with the same variables in them. However, for those
1465 that do support non-contiguous regions, these allow the original
1466 logical block to be reconstructed, along with the set of address
1469 One of the logical block fragments is arbitrarily chosen to be
1470 the ORIGIN. The other fragments will point to the origin via
1471 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1472 be null. The list of fragments will be chained through
1473 BLOCK_FRAGMENT_CHAIN from the origin. */
1475 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1476 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1478 /* For an inlined function, this gives the location where it was called
1479 from. This is only set in the top level block, which corresponds to the
1480 inlined function scope. This is used in the debug output routines. */
1482 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1484 /* Define fields and accessors for nodes representing data types. */
1486 /* See tree.def for documentation of the use of these fields.
1487 Look at the documentation of the various ..._TYPE tree codes.
1489 Note that the type.values, type.minval, and type.maxval fields are
1490 overloaded and used for different macros in different kinds of types.
1491 Each macro must check to ensure the tree node is of the proper kind of
1492 type. Note also that some of the front-ends also overload these fields,
1493 so they must be checked as well. */
1495 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1496 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1497 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1498 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1499 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1500 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1501 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1502 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1503 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1504 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1506 /* Vector types need to check target flags to determine type. */
1507 extern enum machine_mode
vector_type_mode (const_tree
);
1508 #define TYPE_MODE(NODE) \
1509 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1510 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1511 #define SET_TYPE_MODE(NODE, MODE) \
1512 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1514 /* The "canonical" type for this type node, which is used by frontends to
1515 compare the type for equality with another type. If two types are
1516 equal (based on the semantics of the language), then they will have
1517 equivalent TYPE_CANONICAL entries.
1519 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1520 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1521 be used for comparison against other types. Instead, the type is
1522 said to require structural equality checks, described in
1523 TYPE_STRUCTURAL_EQUALITY_P.
1525 For unqualified aggregate and function types the middle-end relies on
1526 TYPE_CANONICAL to tell whether two variables can be assigned
1527 to each other without a conversion. The middle-end also makes sure
1528 to assign the same alias-sets to the type partition with equal
1529 TYPE_CANONICAL of their unqualified variants. */
1530 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1531 /* Indicates that the type node requires structural equality
1532 checks. The compiler will need to look at the composition of the
1533 type to determine whether it is equal to another type, rather than
1534 just comparing canonical type pointers. For instance, we would need
1535 to look at the return and parameter types of a FUNCTION_TYPE
1537 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1538 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1539 type node requires structural equality. */
1540 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1542 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1543 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1545 /* The (language-specific) typed-based alias set for this type.
1546 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1547 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1548 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1549 type can alias objects of any type. */
1550 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1552 /* Nonzero iff the typed-based alias set for this type has been
1554 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1555 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1557 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1559 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1561 /* The alignment necessary for objects of this type.
1562 The value is an int, measured in bits. */
1563 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1565 /* 1 if the alignment for this type was requested by "aligned" attribute,
1566 0 if it is the default for this type. */
1567 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1569 /* The alignment for NODE, in bytes. */
1570 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1572 /* If your language allows you to declare types, and you want debug info
1573 for them, then you need to generate corresponding TYPE_DECL nodes.
1574 These "stub" TYPE_DECL nodes have no name, and simply point at the
1575 type node. You then set the TYPE_STUB_DECL field of the type node
1576 to point back at the TYPE_DECL node. This allows the debug routines
1577 to know that the two nodes represent the same type, so that we only
1578 get one debug info record for them. */
1579 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1581 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1582 the type has BLKmode only because it lacks the alignment required for
1584 #define TYPE_NO_FORCE_BLK(NODE) \
1585 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1587 /* Nonzero in a type considered volatile as a whole. */
1588 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1590 /* Means this type is const-qualified. */
1591 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1593 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1595 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1597 /* If nonzero, type's name shouldn't be emitted into debug info. */
1598 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1600 /* The address space the type is in. */
1601 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1603 /* Encode/decode the named memory support as part of the qualifier. If more
1604 than 8 qualifiers are added, these macros need to be adjusted. */
1605 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1606 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1608 /* Return all qualifiers except for the address space qualifiers. */
1609 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1611 /* Only keep the address space out of the qualifiers and discard the other
1613 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1615 /* The set of type qualifiers for this type. */
1616 #define TYPE_QUALS(NODE) \
1617 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1618 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1619 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1620 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1622 /* The same as TYPE_QUALS without the address space qualifications. */
1623 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1624 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1625 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1626 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1628 /* These flags are available for each language front end to use internally. */
1629 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1630 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1631 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1632 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1633 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1634 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1635 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1637 /* Used to keep track of visited nodes in tree traversals. This is set to
1638 0 by copy_node and make_node. */
1639 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1641 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1642 that distinguish string from array of char).
1643 If set in a INTEGER_TYPE, indicates a character type. */
1644 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1646 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1647 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1648 (((unsigned HOST_WIDE_INT) 1) \
1649 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1651 /* Set precision to n when we have 2^n sub-parts of the vector. */
1652 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1653 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1655 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1656 about missing conversions to other vector types of the same size. */
1657 #define TYPE_VECTOR_OPAQUE(NODE) \
1658 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1660 /* Indicates that objects of this type must be initialized by calling a
1661 function when they are created. */
1662 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1663 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1665 /* Indicates that a UNION_TYPE object should be passed the same way that
1666 the first union alternative would be passed, or that a RECORD_TYPE
1667 object should be passed the same way that the first (and only) member
1669 #define TYPE_TRANSPARENT_AGGR(NODE) \
1670 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1672 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1673 address of a component of the type. This is the counterpart of
1674 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1675 #define TYPE_NONALIASED_COMPONENT(NODE) \
1676 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1678 /* Indicated that objects of this type should be laid out in as
1679 compact a way as possible. */
1680 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1682 /* Used by type_contains_placeholder_p to avoid recomputation.
1683 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1684 this field directly. */
1685 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1686 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1688 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1689 #define TYPE_FINAL_P(NODE) \
1690 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1692 /* The debug output functions use the symtab union field to store
1693 information specific to the debugging format. The different debug
1694 output hooks store different types in the union field. These three
1695 macros are used to access different fields in the union. The debug
1696 hooks are responsible for consistently using only a specific
1699 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1700 hold the type's number in the generated stabs. */
1701 #define TYPE_SYMTAB_ADDRESS(NODE) \
1702 (TYPE_CHECK (NODE)->type_common.symtab.address)
1704 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1705 hold struct/union type tag names. */
1706 #define TYPE_SYMTAB_POINTER(NODE) \
1707 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1709 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1710 in dwarf2out.c to point to the DIE generated for the type. */
1711 #define TYPE_SYMTAB_DIE(NODE) \
1712 (TYPE_CHECK (NODE)->type_common.symtab.die)
1714 /* The garbage collector needs to know the interpretation of the
1715 symtab field. These constants represent the different types in the
1718 #define TYPE_SYMTAB_IS_ADDRESS (0)
1719 #define TYPE_SYMTAB_IS_POINTER (1)
1720 #define TYPE_SYMTAB_IS_DIE (2)
1722 #define TYPE_LANG_SPECIFIC(NODE) \
1723 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1725 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1726 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1727 #define TYPE_FIELDS(NODE) \
1728 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1729 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1730 #define TYPE_ARG_TYPES(NODE) \
1731 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1732 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1734 #define TYPE_METHODS(NODE) \
1735 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1736 #define TYPE_VFIELD(NODE) \
1737 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1738 #define TYPE_METHOD_BASETYPE(NODE) \
1739 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1740 #define TYPE_OFFSET_BASETYPE(NODE) \
1741 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1742 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1743 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1744 #define TYPE_NEXT_PTR_TO(NODE) \
1745 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1746 #define TYPE_NEXT_REF_TO(NODE) \
1747 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1748 #define TYPE_MIN_VALUE(NODE) \
1749 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1750 #define TYPE_MAX_VALUE(NODE) \
1751 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1753 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1754 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1756 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1757 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1759 /* For record and union types, information about this type, as a base type
1761 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1763 /* For non record and union types, used in a language-dependent way. */
1764 #define TYPE_LANG_SLOT_1(NODE) \
1765 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1767 /* Define accessor macros for information about type inheritance
1770 A "basetype" means a particular usage of a data type for inheritance
1771 in another type. Each such basetype usage has its own "binfo"
1772 object to describe it. The binfo object is a TREE_VEC node.
1774 Inheritance is represented by the binfo nodes allocated for a
1775 given type. For example, given types C and D, such that D is
1776 inherited by C, 3 binfo nodes will be allocated: one for describing
1777 the binfo properties of C, similarly one for D, and one for
1778 describing the binfo properties of D as a base type for C.
1779 Thus, given a pointer to class C, one can get a pointer to the binfo
1780 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1782 /* BINFO specific flags. */
1784 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1785 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1787 /* Flags for language dependent use. */
1788 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1789 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1790 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1791 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1792 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1793 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1794 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1796 /* The actual data type node being inherited in this basetype. */
1797 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1799 /* The offset where this basetype appears in its containing type.
1800 BINFO_OFFSET slot holds the offset (in bytes)
1801 from the base of the complete object to the base of the part of the
1802 object that is allocated on behalf of this `type'.
1803 This is always 0 except when there is multiple inheritance. */
1805 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1806 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1808 /* The virtual function table belonging to this basetype. Virtual
1809 function tables provide a mechanism for run-time method dispatching.
1810 The entries of a virtual function table are language-dependent. */
1812 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1814 /* The virtual functions in the virtual function table. This is
1815 a TREE_LIST that is used as an initial approximation for building
1816 a virtual function table for this basetype. */
1817 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1819 /* A vector of binfos for the direct basetypes inherited by this
1822 If this basetype describes type D as inherited in C, and if the
1823 basetypes of D are E and F, then this vector contains binfos for
1824 inheritance of E and F by C. */
1825 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1827 /* The number of basetypes for NODE. */
1828 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1830 /* Accessor macro to get to the Nth base binfo of this binfo. */
1831 #define BINFO_BASE_BINFO(NODE,N) \
1832 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1833 #define BINFO_BASE_ITERATE(NODE,N,B) \
1834 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1835 #define BINFO_BASE_APPEND(NODE,T) \
1836 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1838 /* For a BINFO record describing a virtual base class, i.e., one where
1839 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1840 base. The actual contents are language-dependent. In the C++
1841 front-end this field is an INTEGER_CST giving an offset into the
1842 vtable where the offset to the virtual base can be found. */
1843 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1845 /* Indicates the accesses this binfo has to its bases. The values are
1846 access_public_node, access_protected_node or access_private_node.
1847 If this array is not present, public access is implied. */
1848 #define BINFO_BASE_ACCESSES(NODE) \
1849 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1851 #define BINFO_BASE_ACCESS(NODE,N) \
1852 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1853 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1854 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1856 /* The index in the VTT where this subobject's sub-VTT can be found.
1857 NULL_TREE if there is no sub-VTT. */
1858 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1860 /* The index in the VTT where the vptr for this subobject can be
1861 found. NULL_TREE if there is no secondary vptr in the VTT. */
1862 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1864 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1865 inheriting this base for non-virtual bases. For virtual bases it
1866 points either to the binfo for which this is a primary binfo, or to
1867 the binfo of the most derived type. */
1868 #define BINFO_INHERITANCE_CHAIN(NODE) \
1869 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1872 /* Define fields and accessors for nodes representing declared names. */
1874 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1875 have an associated SSA name. */
1876 #define SSA_VAR_P(DECL) \
1877 (TREE_CODE (DECL) == VAR_DECL \
1878 || TREE_CODE (DECL) == PARM_DECL \
1879 || TREE_CODE (DECL) == RESULT_DECL \
1880 || TREE_CODE (DECL) == SSA_NAME)
1883 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1885 /* This is the name of the object as written by the user.
1886 It is an IDENTIFIER_NODE. */
1887 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1889 /* Every ..._DECL node gets a unique number. */
1890 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1892 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1894 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1896 /* Every ..._DECL node gets a unique number that stays the same even
1897 when the decl is copied by the inliner once it is set. */
1898 #define DECL_PT_UID(NODE) \
1899 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1900 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1901 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1902 #define SET_DECL_PT_UID(NODE, UID) \
1903 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1904 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1905 be preserved when copyin the decl. */
1906 #define DECL_PT_UID_SET_P(NODE) \
1907 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1909 /* These two fields describe where in the source code the declaration
1910 was. If the declaration appears in several places (as for a C
1911 function that is declared first and then defined later), this
1912 information should refer to the definition. */
1913 #define DECL_SOURCE_LOCATION(NODE) \
1914 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1915 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1916 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1917 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1918 /* This accessor returns TRUE if the decl it operates on was created
1919 by a front-end or back-end rather than by user code. In this case
1920 builtin-ness is indicated by source location. */
1921 #define DECL_IS_BUILTIN(DECL) \
1922 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1924 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1925 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1926 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1927 nodes, this points to either the FUNCTION_DECL for the containing
1928 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1929 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1930 scope". In particular, for VAR_DECLs which are virtual table pointers
1931 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1933 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1934 #define DECL_FIELD_CONTEXT(NODE) \
1935 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1937 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1938 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1940 /* For any sort of a ..._DECL node, this points to the original (abstract)
1941 decl node which this decl is an inlined/cloned instance of, or else it
1942 is NULL indicating that this decl is not an instance of some other decl.
1944 The C front-end also uses this in a nested declaration of an inline
1945 function, to point back to the definition. */
1946 #define DECL_ABSTRACT_ORIGIN(NODE) \
1947 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1949 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1950 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1951 #define DECL_ORIGIN(NODE) \
1952 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1954 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1955 inline instance of some original (abstract) decl from an inline function;
1956 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1957 nodes can also have their abstract origin set to themselves. */
1958 #define DECL_FROM_INLINE(NODE) \
1959 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1960 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1962 /* In a DECL this is the field where attributes are stored. */
1963 #define DECL_ATTRIBUTES(NODE) \
1964 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
1966 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1967 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1968 For a VAR_DECL, holds the initial value.
1969 For a PARM_DECL, used for DECL_ARG_TYPE--default
1970 values for parameters are encoded in the type of the function,
1971 not in the PARM_DECL slot.
1972 For a FIELD_DECL, this is used for enumeration values and the C
1973 frontend uses it for temporarily storing bitwidth of bitfields.
1975 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1976 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
1978 /* Holds the size of the datum, in bits, as a tree expression.
1979 Need not be constant. */
1980 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
1981 /* Likewise for the size in bytes. */
1982 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
1983 /* Holds the alignment required for the datum, in bits. */
1984 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
1985 /* The alignment of NODE, in bytes. */
1986 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1987 /* Set if the alignment of this DECL has been set by the user, for
1988 example with an 'aligned' attribute. */
1989 #define DECL_USER_ALIGN(NODE) \
1990 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
1991 /* Holds the machine mode corresponding to the declaration of a variable or
1992 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1994 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
1996 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
1997 operation it is. Note, however, that this field is overloaded, with
1998 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
1999 checked before any access to the former. */
2000 #define DECL_FUNCTION_CODE(NODE) \
2001 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2003 #define DECL_FUNCTION_PERSONALITY(NODE) \
2004 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2006 /* Nonzero for a given ..._DECL node means that the name of this node should
2007 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2008 the associated type should be ignored. For a FUNCTION_DECL, the body of
2009 the function should also be ignored. */
2010 #define DECL_IGNORED_P(NODE) \
2011 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2013 /* Nonzero for a given ..._DECL node means that this node represents an
2014 "abstract instance" of the given declaration (e.g. in the original
2015 declaration of an inline function). When generating symbolic debugging
2016 information, we mustn't try to generate any address information for nodes
2017 marked as "abstract instances" because we don't actually generate
2018 any code or allocate any data space for such instances. */
2019 #define DECL_ABSTRACT(NODE) \
2020 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2022 /* Language-specific decl information. */
2023 #define DECL_LANG_SPECIFIC(NODE) \
2024 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2026 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2027 do not allocate storage, and refer to a definition elsewhere. Note that
2028 this does not necessarily imply the entity represented by NODE
2029 has no program source-level definition in this translation unit. For
2030 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2031 DECL_EXTERNAL may be true simultaneously; that can be the case for
2032 a C99 "extern inline" function. */
2033 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2035 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2036 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2038 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2040 Also set in some languages for variables, etc., outside the normal
2041 lexical scope, such as class instance variables. */
2042 #define DECL_NONLOCAL(NODE) \
2043 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2045 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2046 Used in FIELD_DECLs for vtable pointers.
2047 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2048 #define DECL_VIRTUAL_P(NODE) \
2049 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2051 /* Used to indicate that this DECL represents a compiler-generated entity. */
2052 #define DECL_ARTIFICIAL(NODE) \
2053 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2055 /* Additional flags for language-specific uses. */
2056 #define DECL_LANG_FLAG_0(NODE) \
2057 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2058 #define DECL_LANG_FLAG_1(NODE) \
2059 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2060 #define DECL_LANG_FLAG_2(NODE) \
2061 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2062 #define DECL_LANG_FLAG_3(NODE) \
2063 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2064 #define DECL_LANG_FLAG_4(NODE) \
2065 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2066 #define DECL_LANG_FLAG_5(NODE) \
2067 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2068 #define DECL_LANG_FLAG_6(NODE) \
2069 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2070 #define DECL_LANG_FLAG_7(NODE) \
2071 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2072 #define DECL_LANG_FLAG_8(NODE) \
2073 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2075 /* Nonzero for a scope which is equal to file scope. */
2076 #define SCOPE_FILE_SCOPE_P(EXP) \
2077 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2078 /* Nonzero for a decl which is at file scope. */
2079 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2080 /* Nonzero for a type which is at file scope. */
2081 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2083 /* Nonzero for a decl that is decorated using attribute used.
2084 This indicates to compiler tools that this decl needs to be preserved. */
2085 #define DECL_PRESERVE_P(DECL) \
2086 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2088 /* For function local variables of COMPLEX and VECTOR types,
2089 indicates that the variable is not aliased, and that all
2090 modifications to the variable have been adjusted so that
2091 they are killing assignments. Thus the variable may now
2092 be treated as a GIMPLE register, and use real instead of
2093 virtual ops in SSA form. */
2094 #define DECL_GIMPLE_REG_P(DECL) \
2095 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2097 extern tree
decl_value_expr_lookup (tree
);
2098 extern void decl_value_expr_insert (tree
, tree
);
2100 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2101 if transformations have made this more complicated than evaluating the
2102 decl itself. This should only be used for debugging; once this field has
2103 been set, the decl itself may not legitimately appear in the function. */
2104 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2105 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2106 ->decl_common.decl_flag_2)
2107 #define DECL_VALUE_EXPR(NODE) \
2108 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2109 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2110 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2112 /* Holds the RTL expression for the value of a variable or function.
2113 This value can be evaluated lazily for functions, variables with
2114 static storage duration, and labels. */
2115 #define DECL_RTL(NODE) \
2116 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2117 ? (NODE)->decl_with_rtl.rtl \
2118 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2120 /* Set the DECL_RTL for NODE to RTL. */
2121 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2123 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2124 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2126 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2127 #define DECL_RTL_SET_P(NODE) \
2128 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2130 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2131 NODE1, it will not be set for NODE2; this is a lazy copy. */
2132 #define COPY_DECL_RTL(NODE1, NODE2) \
2133 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2134 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2136 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2137 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2139 #if (GCC_VERSION >= 2007)
2140 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2141 ({ tree const __d = (decl); \
2142 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2143 /* Dereference it so the compiler knows it can't be NULL even \
2144 without assertion checking. */ \
2145 &*DECL_RTL_IF_SET (__d); })
2147 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2150 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2151 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2153 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2154 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2155 of the structure. */
2156 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2158 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2159 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2160 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2161 natural alignment of the field's type). */
2162 #define DECL_FIELD_BIT_OFFSET(NODE) \
2163 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2165 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2166 if so, the type that was originally specified for it.
2167 TREE_TYPE may have been modified (in finish_struct). */
2168 #define DECL_BIT_FIELD_TYPE(NODE) \
2169 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2171 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2172 representative FIELD_DECL. */
2173 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2174 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2176 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2177 if nonzero, indicates that the field occupies the type. */
2178 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2180 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2181 DECL_FIELD_OFFSET which are known to be always zero.
2182 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2184 #define DECL_OFFSET_ALIGN(NODE) \
2185 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2187 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2188 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2189 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2191 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2192 which this FIELD_DECL is defined. This information is needed when
2193 writing debugging information about vfield and vbase decls for C++. */
2194 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2196 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2197 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2199 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2201 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2203 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2204 this component. This makes it possible for Type-Based Alias Analysis
2205 to disambiguate accesses to this field with indirect accesses using
2208 struct S { int i; } s;
2211 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2213 From the implementation's viewpoint, the alias set of the type of the
2214 field 'i' (int) will not be recorded as a subset of that of the type of
2215 's' (struct S) in record_component_aliases. The counterpart is that
2216 accesses to s.i must not be given the alias set of the type of 'i'
2217 (int) but instead directly that of the type of 's' (struct S). */
2218 #define DECL_NONADDRESSABLE_P(NODE) \
2219 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2221 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2222 dense, unique within any one function, and may be used to index arrays.
2223 If the value is -1, then no UID has been assigned. */
2224 #define LABEL_DECL_UID(NODE) \
2225 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2227 /* In a LABEL_DECL, the EH region number for which the label is the
2228 post_landing_pad. */
2229 #define EH_LANDING_PAD_NR(NODE) \
2230 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2232 /* For a PARM_DECL, records the data type used to pass the argument,
2233 which may be different from the type seen in the program. */
2234 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2236 /* For PARM_DECL, holds an RTL for the stack slot or register
2237 where the data was actually passed. */
2238 #define DECL_INCOMING_RTL(NODE) \
2239 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2241 /* Nonzero for a given ..._DECL node means that no warnings should be
2242 generated just because this node is unused. */
2243 #define DECL_IN_SYSTEM_HEADER(NODE) \
2244 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2246 /* Used to indicate that the linkage status of this DECL is not yet known,
2247 so it should not be output now. */
2248 #define DECL_DEFER_OUTPUT(NODE) \
2249 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2251 /* In a VAR_DECL that's static,
2252 nonzero if the space is in the text section. */
2253 #define DECL_IN_TEXT_SECTION(NODE) \
2254 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2256 /* In a VAR_DECL that's static,
2257 nonzero if it belongs to the global constant pool. */
2258 #define DECL_IN_CONSTANT_POOL(NODE) \
2259 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2261 /* Nonzero for a given ..._DECL node means that this node should be
2262 put in .common, if possible. If a DECL_INITIAL is given, and it
2263 is not error_mark_node, then the decl cannot be put in .common. */
2264 #define DECL_COMMON(NODE) \
2265 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2267 /* In a VAR_DECL, nonzero if the decl is a register variable with
2268 an explicit asm specification. */
2269 #define DECL_HARD_REGISTER(NODE) \
2270 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2272 /* Used to indicate that this DECL has weak linkage. */
2273 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2275 /* Used to indicate that the DECL is a dllimport. */
2276 #define DECL_DLLIMPORT_P(NODE) \
2277 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2279 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2280 not be put out unless it is needed in this translation unit.
2281 Entities like this are shared across translation units (like weak
2282 entities), but are guaranteed to be generated by any translation
2283 unit that needs them, and therefore need not be put out anywhere
2284 where they are not needed. DECL_COMDAT is just a hint to the
2285 back-end; it is up to front-ends which set this flag to ensure
2286 that there will never be any harm, other than bloat, in putting out
2287 something which is DECL_COMDAT. */
2288 #define DECL_COMDAT(NODE) \
2289 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2291 #define DECL_COMDAT_GROUP(NODE) \
2292 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2294 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2295 multiple translation units should be merged. */
2296 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2298 /* The name of the object as the assembler will see it (but before any
2299 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2300 as DECL_NAME. It is an IDENTIFIER_NODE. */
2301 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2303 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2304 This is true of all DECL nodes except FIELD_DECL. */
2305 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2306 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2308 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2309 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2311 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2312 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2313 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2315 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2316 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2317 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2319 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2320 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2321 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2322 semantics of using this macro, are different than saying:
2324 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2326 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2328 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2329 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2330 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2331 DECL_ASSEMBLER_NAME (DECL1)) \
2334 /* Records the section name in a section attribute. Used to pass
2335 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2336 #define DECL_SECTION_NAME(NODE) \
2337 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2339 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2340 this variable in a BIND_EXPR. */
2341 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2342 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2344 /* Value of the decls's visibility attribute */
2345 #define DECL_VISIBILITY(NODE) \
2346 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2348 /* Nonzero means that the decl had its visibility specified rather than
2350 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2351 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2353 /* In a VAR_DECL, the model to use if the data should be allocated from
2354 thread-local storage. */
2355 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2357 /* In a VAR_DECL, nonzero if the data should be allocated from
2358 thread-local storage. */
2359 #define DECL_THREAD_LOCAL_P(NODE) \
2360 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2362 /* In a non-local VAR_DECL with static storage duration, true if the
2363 variable has an initialization priority. If false, the variable
2364 will be initialized at the DEFAULT_INIT_PRIORITY. */
2365 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2366 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2368 /* Specify whether the section name was set by user or by
2369 compiler via -ffunction-sections. */
2370 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2371 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2373 extern tree
decl_debug_expr_lookup (tree
);
2374 extern void decl_debug_expr_insert (tree
, tree
);
2376 /* For VAR_DECL, this is set to an expression that it was split from. */
2377 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2378 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2379 #define DECL_DEBUG_EXPR(NODE) \
2380 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2382 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2383 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2385 extern priority_type
decl_init_priority_lookup (tree
);
2386 extern priority_type
decl_fini_priority_lookup (tree
);
2387 extern void decl_init_priority_insert (tree
, priority_type
);
2388 extern void decl_fini_priority_insert (tree
, priority_type
);
2390 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2392 #define DECL_INIT_PRIORITY(NODE) \
2393 (decl_init_priority_lookup (NODE))
2394 /* Set the initialization priority for NODE to VAL. */
2395 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2396 (decl_init_priority_insert (NODE, VAL))
2398 /* For a FUNCTION_DECL the finalization priority of NODE. */
2399 #define DECL_FINI_PRIORITY(NODE) \
2400 (decl_fini_priority_lookup (NODE))
2401 /* Set the finalization priority for NODE to VAL. */
2402 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2403 (decl_fini_priority_insert (NODE, VAL))
2405 /* The initialization priority for entities for which no explicit
2406 initialization priority has been specified. */
2407 #define DEFAULT_INIT_PRIORITY 65535
2409 /* The maximum allowed initialization priority. */
2410 #define MAX_INIT_PRIORITY 65535
2412 /* The largest priority value reserved for use by system runtime
2414 #define MAX_RESERVED_INIT_PRIORITY 100
2416 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2417 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2418 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2420 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2421 #define DECL_NONLOCAL_FRAME(NODE) \
2422 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2424 /* This field is used to reference anything in decl.result and is meant only
2425 for use by the garbage collector. */
2426 #define DECL_RESULT_FLD(NODE) \
2427 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2429 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2430 Before the struct containing the FUNCTION_DECL is laid out,
2431 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2432 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2433 function. When the class is laid out, this pointer is changed
2434 to an INTEGER_CST node which is suitable for use as an index
2435 into the virtual function table.
2436 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2437 #define DECL_VINDEX(NODE) \
2438 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2440 /* In FUNCTION_DECL, holds the decl for the return value. */
2441 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2443 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2444 #define DECL_UNINLINABLE(NODE) \
2445 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2447 /* In a FUNCTION_DECL, the saved representation of the body of the
2449 #define DECL_SAVED_TREE(NODE) \
2450 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2452 /* Nonzero in a FUNCTION_DECL means this function should be treated
2453 as if it were a malloc, meaning it returns a pointer that is
2455 #define DECL_IS_MALLOC(NODE) \
2456 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2458 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2459 C++ operator new, meaning that it returns a pointer for which we
2460 should not use type based aliasing. */
2461 #define DECL_IS_OPERATOR_NEW(NODE) \
2462 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2464 /* Nonzero in a FUNCTION_DECL means this function may return more
2466 #define DECL_IS_RETURNS_TWICE(NODE) \
2467 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2469 /* Nonzero in a FUNCTION_DECL means this function should be treated
2470 as "pure" function (like const function, but may read global memory). */
2471 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2473 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2474 the const or pure function may not terminate. When this is nonzero
2475 for a const or pure function, it can be dealt with by cse passes
2476 but cannot be removed by dce passes since you are not allowed to
2477 change an infinite looping program into one that terminates without
2479 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2480 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2482 /* Nonzero in a FUNCTION_DECL means this function should be treated
2483 as "novops" function (function that does not read global memory,
2484 but may have arbitrary side effects). */
2485 #define DECL_IS_NOVOPS(NODE) \
2486 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2488 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2489 at the beginning or end of execution. */
2490 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2491 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2493 #define DECL_STATIC_DESTRUCTOR(NODE) \
2494 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2496 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2497 be instrumented with calls to support routines. */
2498 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2499 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2501 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2502 disabled in this function. */
2503 #define DECL_NO_LIMIT_STACK(NODE) \
2504 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2506 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2507 #define DECL_STATIC_CHAIN(NODE) \
2508 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2510 /* Nonzero for a decl that cgraph has decided should be inlined into
2511 at least one call site. It is not meaningful to look at this
2512 directly; always use cgraph_function_possibly_inlined_p. */
2513 #define DECL_POSSIBLY_INLINED(DECL) \
2514 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2516 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2517 such as via the `inline' keyword in C/C++. This flag controls the linkage
2518 semantics of 'inline' */
2519 #define DECL_DECLARED_INLINE_P(NODE) \
2520 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2522 /* Nonzero in a FUNCTION_DECL means this function should not get
2523 -Winline warnings. */
2524 #define DECL_NO_INLINE_WARNING_P(NODE) \
2525 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2527 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2528 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2529 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2531 /* Nonzero if a FUNCTION_CODE is a TM load. */
2532 #define BUILTIN_TM_LOAD_P(FN) \
2533 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2535 /* Nonzero if a FUNCTION_CODE is a TM store. */
2536 #define BUILTIN_TM_STORE_P(FN) \
2537 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2539 #define CASE_BUILT_IN_TM_LOAD(FN) \
2540 case BUILT_IN_TM_LOAD_##FN: \
2541 case BUILT_IN_TM_LOAD_RAR_##FN: \
2542 case BUILT_IN_TM_LOAD_RAW_##FN: \
2543 case BUILT_IN_TM_LOAD_RFW_##FN
2545 #define CASE_BUILT_IN_TM_STORE(FN) \
2546 case BUILT_IN_TM_STORE_##FN: \
2547 case BUILT_IN_TM_STORE_WAR_##FN: \
2548 case BUILT_IN_TM_STORE_WAW_##FN
2550 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2551 disregarding size and cost heuristics. This is equivalent to using
2552 the always_inline attribute without the required diagnostics if the
2553 function cannot be inlined. */
2554 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2555 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2557 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2558 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2560 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2561 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2562 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2564 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2565 that describes the status of this function. */
2566 #define DECL_STRUCT_FUNCTION(NODE) \
2567 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2569 /* In a FUNCTION_DECL, nonzero means a built in function of a
2570 standard library or more generally a built in function that is
2571 recognized by optimizers and expanders.
2573 Note that it is different from the DECL_IS_BUILTIN accessor. For
2574 instance, user declared prototypes of C library functions are not
2575 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2576 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2578 /* For a builtin function, identify which part of the compiler defined it. */
2579 #define DECL_BUILT_IN_CLASS(NODE) \
2580 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2582 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2583 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2585 #define DECL_ARGUMENTS(NODE) \
2586 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2587 #define DECL_ARGUMENT_FLD(NODE) \
2588 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2590 /* In FUNCTION_DECL, the function specific target options to use when compiling
2592 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2593 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2595 /* In FUNCTION_DECL, the function specific optimization options to use when
2596 compiling this function. */
2597 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2598 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2600 /* In FUNCTION_DECL, this is set if this function has other versions generated
2601 using "target" attributes. The default version is the one which does not
2602 have any "target" attribute set. */
2603 #define DECL_FUNCTION_VERSIONED(NODE)\
2604 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2606 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2607 Devirtualization machinery uses this knowledge for determing type of the
2608 object constructed. Also we assume that constructor address is not
2610 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2611 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2613 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2614 Devirtualization machinery uses this to track types in destruction. */
2615 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2616 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2618 /* In FUNCTION_DECL that represent an virtual method this is set when
2619 the method is final. */
2620 #define DECL_FINAL_P(NODE)\
2621 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2623 /* The source language of the translation-unit. */
2624 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2625 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2627 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2629 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2630 #define DECL_ORIGINAL_TYPE(NODE) \
2631 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2633 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2634 into stabs. Instead it will generate cross reference ('x') of names.
2635 This uses the same flag as DECL_EXTERNAL. */
2636 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2637 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2639 /* Getter of the imported declaration associated to the
2640 IMPORTED_DECL node. */
2641 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2642 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2644 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2645 To reduce overhead, the nodes containing the statements are not trees.
2646 This avoids the overhead of tree_common on all linked list elements.
2648 Use the interface in tree-iterator.h to access this node. */
2650 #define STATEMENT_LIST_HEAD(NODE) \
2651 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2652 #define STATEMENT_LIST_TAIL(NODE) \
2653 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2655 #define TREE_OPTIMIZATION(NODE) \
2656 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2658 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2659 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2661 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2662 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2664 /* Return a tree node that encapsulates the optimization options in OPTS. */
2665 extern tree
build_optimization_node (struct gcc_options
*opts
);
2667 extern void init_tree_optimization_optabs (tree
);
2669 #define TREE_TARGET_OPTION(NODE) \
2670 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2672 /* Return a tree node that encapsulates the target options in OPTS. */
2673 extern tree
build_target_option_node (struct gcc_options
*opts
);
2675 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2678 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2680 if (TREE_CODE (__t
) != __c
)
2681 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2686 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2689 if (TREE_CODE (__t
) == __c
)
2690 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2695 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2696 enum tree_code __c1
, enum tree_code __c2
)
2698 if (TREE_CODE (__t
) != __c1
2699 && TREE_CODE (__t
) != __c2
)
2700 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2705 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2706 enum tree_code __c1
, enum tree_code __c2
)
2708 if (TREE_CODE (__t
) == __c1
2709 || TREE_CODE (__t
) == __c2
)
2710 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2715 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2716 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2718 if (TREE_CODE (__t
) != __c1
2719 && TREE_CODE (__t
) != __c2
2720 && TREE_CODE (__t
) != __c3
)
2721 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2726 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2727 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2729 if (TREE_CODE (__t
) == __c1
2730 || TREE_CODE (__t
) == __c2
2731 || TREE_CODE (__t
) == __c3
)
2732 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2737 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2738 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2739 enum tree_code __c4
)
2741 if (TREE_CODE (__t
) != __c1
2742 && TREE_CODE (__t
) != __c2
2743 && TREE_CODE (__t
) != __c3
2744 && TREE_CODE (__t
) != __c4
)
2745 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2750 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2751 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2752 enum tree_code __c4
)
2754 if (TREE_CODE (__t
) == __c1
2755 || TREE_CODE (__t
) == __c2
2756 || TREE_CODE (__t
) == __c3
2757 || TREE_CODE (__t
) == __c4
)
2758 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2763 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2764 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2765 enum tree_code __c4
, enum tree_code __c5
)
2767 if (TREE_CODE (__t
) != __c1
2768 && TREE_CODE (__t
) != __c2
2769 && TREE_CODE (__t
) != __c3
2770 && TREE_CODE (__t
) != __c4
2771 && TREE_CODE (__t
) != __c5
)
2772 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2777 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2778 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2779 enum tree_code __c4
, enum tree_code __c5
)
2781 if (TREE_CODE (__t
) == __c1
2782 || TREE_CODE (__t
) == __c2
2783 || TREE_CODE (__t
) == __c3
2784 || TREE_CODE (__t
) == __c4
2785 || TREE_CODE (__t
) == __c5
)
2786 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2791 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2792 const char *__f
, int __l
, const char *__g
)
2794 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2795 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2800 tree_class_check (tree __t
, const enum tree_code_class __class
,
2801 const char *__f
, int __l
, const char *__g
)
2803 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2804 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2809 tree_range_check (tree __t
,
2810 enum tree_code __code1
, enum tree_code __code2
,
2811 const char *__f
, int __l
, const char *__g
)
2813 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2814 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2819 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2820 const char *__f
, int __l
, const char *__g
)
2822 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2823 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2824 if (__t
->omp_clause
.code
!= __code
)
2825 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2830 omp_clause_range_check (tree __t
,
2831 enum omp_clause_code __code1
,
2832 enum omp_clause_code __code2
,
2833 const char *__f
, int __l
, const char *__g
)
2835 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2836 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2837 if ((int) __t
->omp_clause
.code
< (int) __code1
2838 || (int) __t
->omp_clause
.code
> (int) __code2
)
2839 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2843 /* These checks have to be special cased. */
2846 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2848 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2849 if (!IS_EXPR_CODE_CLASS (__c
))
2850 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2854 /* These checks have to be special cased. */
2857 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2860 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2865 tree_vec_elt_check (tree __t
, int __i
,
2866 const char *__f
, int __l
, const char *__g
)
2868 if (TREE_CODE (__t
) != TREE_VEC
)
2869 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2870 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2871 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2872 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2876 omp_clause_elt_check (tree __t
, int __i
,
2877 const char *__f
, int __l
, const char *__g
)
2879 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2880 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2881 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2882 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2883 return &__t
->omp_clause
.ops
[__i
];
2887 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2890 if (TREE_CODE (__t
) != __c
)
2891 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2896 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2899 if (TREE_CODE (__t
) == __c
)
2900 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2905 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2906 enum tree_code __c1
, enum tree_code __c2
)
2908 if (TREE_CODE (__t
) != __c1
2909 && TREE_CODE (__t
) != __c2
)
2910 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2915 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2916 enum tree_code __c1
, enum tree_code __c2
)
2918 if (TREE_CODE (__t
) == __c1
2919 || TREE_CODE (__t
) == __c2
)
2920 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2925 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2926 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2928 if (TREE_CODE (__t
) != __c1
2929 && TREE_CODE (__t
) != __c2
2930 && TREE_CODE (__t
) != __c3
)
2931 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2936 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2937 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2939 if (TREE_CODE (__t
) == __c1
2940 || TREE_CODE (__t
) == __c2
2941 || TREE_CODE (__t
) == __c3
)
2942 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2947 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2948 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2949 enum tree_code __c4
)
2951 if (TREE_CODE (__t
) != __c1
2952 && TREE_CODE (__t
) != __c2
2953 && TREE_CODE (__t
) != __c3
2954 && TREE_CODE (__t
) != __c4
)
2955 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2960 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2961 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2962 enum tree_code __c4
)
2964 if (TREE_CODE (__t
) == __c1
2965 || TREE_CODE (__t
) == __c2
2966 || TREE_CODE (__t
) == __c3
2967 || TREE_CODE (__t
) == __c4
)
2968 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2973 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2974 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2975 enum tree_code __c4
, enum tree_code __c5
)
2977 if (TREE_CODE (__t
) != __c1
2978 && TREE_CODE (__t
) != __c2
2979 && TREE_CODE (__t
) != __c3
2980 && TREE_CODE (__t
) != __c4
2981 && TREE_CODE (__t
) != __c5
)
2982 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2987 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2988 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2989 enum tree_code __c4
, enum tree_code __c5
)
2991 if (TREE_CODE (__t
) == __c1
2992 || TREE_CODE (__t
) == __c2
2993 || TREE_CODE (__t
) == __c3
2994 || TREE_CODE (__t
) == __c4
2995 || TREE_CODE (__t
) == __c5
)
2996 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3001 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3002 const char *__f
, int __l
, const char *__g
)
3004 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3005 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3010 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3011 const char *__f
, int __l
, const char *__g
)
3013 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3014 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3019 tree_range_check (const_tree __t
,
3020 enum tree_code __code1
, enum tree_code __code2
,
3021 const char *__f
, int __l
, const char *__g
)
3023 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3024 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3029 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3030 const char *__f
, int __l
, const char *__g
)
3032 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3033 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3034 if (__t
->omp_clause
.code
!= __code
)
3035 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3040 omp_clause_range_check (const_tree __t
,
3041 enum omp_clause_code __code1
,
3042 enum omp_clause_code __code2
,
3043 const char *__f
, int __l
, const char *__g
)
3045 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3046 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3047 if ((int) __t
->omp_clause
.code
< (int) __code1
3048 || (int) __t
->omp_clause
.code
> (int) __code2
)
3049 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3054 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3056 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3057 if (!IS_EXPR_CODE_CLASS (__c
))
3058 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3063 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3066 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3071 tree_vec_elt_check (const_tree __t
, int __i
,
3072 const char *__f
, int __l
, const char *__g
)
3074 if (TREE_CODE (__t
) != TREE_VEC
)
3075 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3076 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3077 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3078 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3079 //return &__t->vec.a[__i];
3083 omp_clause_elt_check (const_tree __t
, int __i
,
3084 const char *__f
, int __l
, const char *__g
)
3086 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3087 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3088 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3089 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3090 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3095 /* Compute the number of operands in an expression node NODE. For
3096 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3097 otherwise it is looked up from the node's code. */
3099 tree_operand_length (const_tree node
)
3101 if (VL_EXP_CLASS_P (node
))
3102 return VL_EXP_OPERAND_LENGTH (node
);
3104 return TREE_CODE_LENGTH (TREE_CODE (node
));
3107 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3109 /* Special checks for TREE_OPERANDs. */
3111 tree_operand_check (tree __t
, int __i
,
3112 const char *__f
, int __l
, const char *__g
)
3114 const_tree __u
= EXPR_CHECK (__t
);
3115 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3116 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3117 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3121 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3122 const char *__f
, int __l
, const char *__g
)
3124 if (TREE_CODE (__t
) != __code
)
3125 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3126 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3127 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3128 return &__t
->exp
.operands
[__i
];
3132 tree_operand_check (const_tree __t
, int __i
,
3133 const char *__f
, int __l
, const char *__g
)
3135 const_tree __u
= EXPR_CHECK (__t
);
3136 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3137 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3138 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3142 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3143 const char *__f
, int __l
, const char *__g
)
3145 if (TREE_CODE (__t
) != __code
)
3146 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3147 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3148 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3149 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3154 #define error_mark_node global_trees[TI_ERROR_MARK]
3156 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3157 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3158 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3159 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3160 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3162 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3163 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3164 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3165 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3166 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3168 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3169 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3170 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3172 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3173 #define integer_one_node global_trees[TI_INTEGER_ONE]
3174 #define integer_three_node global_trees[TI_INTEGER_THREE]
3175 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3176 #define size_zero_node global_trees[TI_SIZE_ZERO]
3177 #define size_one_node global_trees[TI_SIZE_ONE]
3178 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3179 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3180 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3182 /* Base access nodes. */
3183 #define access_public_node global_trees[TI_PUBLIC]
3184 #define access_protected_node global_trees[TI_PROTECTED]
3185 #define access_private_node global_trees[TI_PRIVATE]
3187 #define null_pointer_node global_trees[TI_NULL_POINTER]
3189 #define float_type_node global_trees[TI_FLOAT_TYPE]
3190 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3191 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3193 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3194 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3195 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3196 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3198 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3199 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3200 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3201 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3203 #define void_type_node global_trees[TI_VOID_TYPE]
3204 /* The C type `void *'. */
3205 #define ptr_type_node global_trees[TI_PTR_TYPE]
3206 /* The C type `const void *'. */
3207 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3208 /* The C type `size_t'. */
3209 #define size_type_node global_trees[TI_SIZE_TYPE]
3210 #define pid_type_node global_trees[TI_PID_TYPE]
3211 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3212 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3213 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3214 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3215 /* The C type `FILE *'. */
3216 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3217 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3219 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3220 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3221 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3223 /* The decimal floating point types. */
3224 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3225 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3226 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3227 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3228 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3229 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3231 /* The fixed-point types. */
3232 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3233 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3234 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3235 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3236 #define sat_unsigned_short_fract_type_node \
3237 global_trees[TI_SAT_USFRACT_TYPE]
3238 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3239 #define sat_unsigned_long_fract_type_node \
3240 global_trees[TI_SAT_ULFRACT_TYPE]
3241 #define sat_unsigned_long_long_fract_type_node \
3242 global_trees[TI_SAT_ULLFRACT_TYPE]
3243 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3244 #define fract_type_node global_trees[TI_FRACT_TYPE]
3245 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3246 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3247 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3248 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3249 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3250 #define unsigned_long_long_fract_type_node \
3251 global_trees[TI_ULLFRACT_TYPE]
3252 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3253 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3254 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3255 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3256 #define sat_unsigned_short_accum_type_node \
3257 global_trees[TI_SAT_USACCUM_TYPE]
3258 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3259 #define sat_unsigned_long_accum_type_node \
3260 global_trees[TI_SAT_ULACCUM_TYPE]
3261 #define sat_unsigned_long_long_accum_type_node \
3262 global_trees[TI_SAT_ULLACCUM_TYPE]
3263 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3264 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3265 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3266 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3267 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3268 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3269 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3270 #define unsigned_long_long_accum_type_node \
3271 global_trees[TI_ULLACCUM_TYPE]
3272 #define qq_type_node global_trees[TI_QQ_TYPE]
3273 #define hq_type_node global_trees[TI_HQ_TYPE]
3274 #define sq_type_node global_trees[TI_SQ_TYPE]
3275 #define dq_type_node global_trees[TI_DQ_TYPE]
3276 #define tq_type_node global_trees[TI_TQ_TYPE]
3277 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3278 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3279 #define usq_type_node global_trees[TI_USQ_TYPE]
3280 #define udq_type_node global_trees[TI_UDQ_TYPE]
3281 #define utq_type_node global_trees[TI_UTQ_TYPE]
3282 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3283 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3284 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3285 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3286 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3287 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3288 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3289 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3290 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3291 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3292 #define ha_type_node global_trees[TI_HA_TYPE]
3293 #define sa_type_node global_trees[TI_SA_TYPE]
3294 #define da_type_node global_trees[TI_DA_TYPE]
3295 #define ta_type_node global_trees[TI_TA_TYPE]
3296 #define uha_type_node global_trees[TI_UHA_TYPE]
3297 #define usa_type_node global_trees[TI_USA_TYPE]
3298 #define uda_type_node global_trees[TI_UDA_TYPE]
3299 #define uta_type_node global_trees[TI_UTA_TYPE]
3300 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3301 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3302 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3303 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3304 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3305 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3306 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3307 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3309 /* The node that should be placed at the end of a parameter list to
3310 indicate that the function does not take a variable number of
3311 arguments. The TREE_VALUE will be void_type_node and there will be
3312 no TREE_CHAIN. Language-independent code should not assume
3313 anything else about this node. */
3314 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3316 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3317 #define MAIN_NAME_P(NODE) \
3318 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3320 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3322 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3323 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3325 /* Default/current target options (TARGET_OPTION_NODE). */
3326 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3327 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3329 /* Default tree list option(), optimize() pragmas to be linked into the
3331 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3332 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3334 #define char_type_node integer_types[itk_char]
3335 #define signed_char_type_node integer_types[itk_signed_char]
3336 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3337 #define short_integer_type_node integer_types[itk_short]
3338 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3339 #define integer_type_node integer_types[itk_int]
3340 #define unsigned_type_node integer_types[itk_unsigned_int]
3341 #define long_integer_type_node integer_types[itk_long]
3342 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3343 #define long_long_integer_type_node integer_types[itk_long_long]
3344 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3345 #define int128_integer_type_node integer_types[itk_int128]
3346 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3348 #define NULL_TREE (tree) NULL
3350 /* True if NODE is an erroneous expression. */
3352 #define error_operand_p(NODE) \
3353 ((NODE) == error_mark_node \
3354 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3356 extern tree
decl_assembler_name (tree
);
3357 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3358 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3360 /* Compute the number of bytes occupied by 'node'. This routine only
3361 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3363 extern size_t tree_size (const_tree
);
3365 /* Compute the number of bytes occupied by a tree with code CODE. This
3366 function cannot be used for TREE_VEC codes, which are of variable
3368 extern size_t tree_code_size (enum tree_code
);
3370 /* Allocate and return a new UID from the DECL_UID namespace. */
3371 extern int allocate_decl_uid (void);
3373 /* Lowest level primitive for allocating a node.
3374 The TREE_CODE is the only argument. Contents are initialized
3375 to zero except for a few of the common fields. */
3377 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3378 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3380 /* Make a copy of a node, with all the same contents. */
3382 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3383 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3385 /* Make a copy of a chain of TREE_LIST nodes. */
3387 extern tree
copy_list (tree
);
3389 /* Make a CASE_LABEL_EXPR. */
3391 extern tree
build_case_label (tree
, tree
, tree
);
3394 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3395 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3397 /* Make a TREE_VEC. */
3399 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3400 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3402 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3403 The name is supplied as a char *. */
3405 extern tree
get_identifier (const char *);
3407 #if GCC_VERSION >= 3000
3408 #define get_identifier(str) \
3409 (__builtin_constant_p (str) \
3410 ? get_identifier_with_length ((str), strlen (str)) \
3411 : get_identifier (str))
3415 /* Identical to get_identifier, except that the length is assumed
3418 extern tree
get_identifier_with_length (const char *, size_t);
3420 /* If an identifier with the name TEXT (a null-terminated string) has
3421 previously been referred to, return that node; otherwise return
3424 extern tree
maybe_get_identifier (const char *);
3426 /* Construct various types of nodes. */
3428 extern tree
build_nt (enum tree_code
, ...);
3429 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3431 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3432 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3433 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3434 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3435 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3436 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3437 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3438 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3439 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3440 tree MEM_STAT_DECL
);
3441 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3442 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3443 tree MEM_STAT_DECL
);
3444 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3446 /* _loc versions of build[1-5]. */
3449 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3450 tree arg1 MEM_STAT_DECL
)
3452 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3453 if (CAN_HAVE_LOCATION_P (t
))
3454 SET_EXPR_LOCATION (t
, loc
);
3457 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3460 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3461 tree arg1 MEM_STAT_DECL
)
3463 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3464 if (CAN_HAVE_LOCATION_P (t
))
3465 SET_EXPR_LOCATION (t
, loc
);
3468 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3471 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3472 tree arg1
, tree arg2 MEM_STAT_DECL
)
3474 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3475 if (CAN_HAVE_LOCATION_P (t
))
3476 SET_EXPR_LOCATION (t
, loc
);
3479 #define build3_loc(l,c,t1,t2,t3,t4) \
3480 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3483 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3484 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3486 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3487 if (CAN_HAVE_LOCATION_P (t
))
3488 SET_EXPR_LOCATION (t
, loc
);
3491 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3492 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3495 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3496 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3498 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3499 arg4 PASS_MEM_STAT
);
3500 if (CAN_HAVE_LOCATION_P (t
))
3501 SET_EXPR_LOCATION (t
, loc
);
3504 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3505 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3507 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3508 #define build_var_debug_value(t1,t2) \
3509 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3511 /* Constructs double_int from tree CST. */
3513 static inline double_int
3514 tree_to_double_int (const_tree cst
)
3516 return TREE_INT_CST (cst
);
3519 extern tree
double_int_to_tree (tree
, double_int
);
3520 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
3521 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
3523 /* Create an INT_CST node with a CST value zero extended. */
3526 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
3528 return double_int_to_tree (type
, double_int::from_uhwi (cst
));
3531 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3532 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3533 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3534 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3535 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3536 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3537 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3538 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3539 extern tree
build_vector_from_val (tree
, tree
);
3540 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3541 extern tree
build_constructor_single (tree
, tree
, tree
);
3542 extern tree
build_constructor_from_list (tree
, tree
);
3543 extern tree
build_constructor_va (tree
, int, ...);
3544 extern tree
build_real_from_int_cst (tree
, const_tree
);
3545 extern tree
build_complex (tree
, tree
, tree
);
3546 extern tree
build_one_cst (tree
);
3547 extern tree
build_minus_one_cst (tree
);
3548 extern tree
build_all_ones_cst (tree
);
3549 extern tree
build_zero_cst (tree
);
3550 extern tree
build_string (int, const char *);
3551 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3552 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3553 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3554 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3555 extern tree
build_decl_stat (location_t
, enum tree_code
,
3556 tree
, tree MEM_STAT_DECL
);
3557 extern tree
build_fn_decl (const char *, tree
);
3558 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3559 extern tree
build_translation_unit_decl (tree
);
3560 extern tree
build_block (tree
, tree
, tree
, tree
);
3561 extern tree
build_empty_stmt (location_t
);
3562 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3564 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3565 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3567 extern tree
build_call_nary (tree
, tree
, int, ...);
3568 extern tree
build_call_valist (tree
, tree
, int, va_list);
3569 #define build_call_array(T1,T2,N,T3)\
3570 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3571 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3572 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3574 /* Construct various nodes representing data types. */
3576 extern tree
make_signed_type (int);
3577 extern tree
make_unsigned_type (int);
3578 extern tree
signed_or_unsigned_type_for (int, tree
);
3579 extern tree
signed_type_for (tree
);
3580 extern tree
unsigned_type_for (tree
);
3581 extern tree
truth_type_for (tree
);
3582 extern void initialize_sizetypes (void);
3583 extern void fixup_unsigned_type (tree
);
3584 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3585 extern tree
build_pointer_type (tree
);
3586 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3587 extern tree
build_reference_type (tree
);
3588 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3589 extern tree
build_vector_type (tree innertype
, int nunits
);
3590 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3591 extern tree
build_type_no_quals (tree
);
3592 extern tree
build_index_type (tree
);
3593 extern tree
build_array_type (tree
, tree
);
3594 extern tree
build_nonshared_array_type (tree
, tree
);
3595 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3596 extern tree
build_function_type (tree
, tree
);
3597 extern tree
build_function_type_list (tree
, ...);
3598 extern tree
build_function_decl_skip_args (tree
, bitmap
, bool);
3599 extern tree
build_varargs_function_type_list (tree
, ...);
3600 extern tree
build_function_type_array (tree
, int, tree
*);
3601 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3602 #define build_function_type_vec(RET, V) \
3603 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3604 #define build_varargs_function_type_vec(RET, V) \
3605 build_varargs_function_type_array (RET, vec_safe_length (V), \
3606 vec_safe_address (V))
3607 extern tree
build_method_type_directly (tree
, tree
, tree
);
3608 extern tree
build_method_type (tree
, tree
);
3609 extern tree
build_offset_type (tree
, tree
);
3610 extern tree
build_complex_type (tree
);
3611 extern tree
array_type_nelts (const_tree
);
3612 extern bool in_array_bounds_p (tree
);
3613 extern bool range_in_array_bounds_p (tree
);
3615 extern tree
value_member (tree
, tree
);
3616 extern tree
purpose_member (const_tree
, tree
);
3617 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3618 extern tree
chain_index (int, tree
);
3620 extern int attribute_list_equal (const_tree
, const_tree
);
3621 extern int attribute_list_contained (const_tree
, const_tree
);
3622 extern int tree_int_cst_equal (const_tree
, const_tree
);
3623 extern int tree_int_cst_lt (const_tree
, const_tree
);
3624 extern int tree_int_cst_compare (const_tree
, const_tree
);
3625 extern int host_integerp (const_tree
, int)
3626 #ifndef ENABLE_TREE_CHECKING
3627 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
3630 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
3631 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3632 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3633 tree_low_cst (const_tree t
, int pos
)
3635 gcc_assert (host_integerp (t
, pos
));
3636 return TREE_INT_CST_LOW (t
);
3639 extern HOST_WIDE_INT
size_low_cst (const_tree
);
3640 extern int tree_int_cst_sgn (const_tree
);
3641 extern int tree_int_cst_sign_bit (const_tree
);
3642 extern unsigned int tree_int_cst_min_precision (tree
, bool);
3643 extern bool tree_expr_nonnegative_p (tree
);
3644 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3645 extern bool may_negate_without_overflow_p (const_tree
);
3646 extern tree
strip_array_types (tree
);
3647 extern tree
excess_precision_type (tree
);
3648 extern bool valid_constant_size_p (const_tree
);
3649 extern unsigned int element_precision (const_tree
);
3651 /* Construct various nodes representing fract or accum data types. */
3653 extern tree
make_fract_type (int, int, int);
3654 extern tree
make_accum_type (int, int, int);
3656 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3657 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3658 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3659 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3660 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3661 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3662 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3663 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3665 #define make_or_reuse_signed_fract_type(P) \
3666 make_or_reuse_fract_type (P, 0, 0)
3667 #define make_or_reuse_unsigned_fract_type(P) \
3668 make_or_reuse_fract_type (P, 1, 0)
3669 #define make_or_reuse_sat_signed_fract_type(P) \
3670 make_or_reuse_fract_type (P, 0, 1)
3671 #define make_or_reuse_sat_unsigned_fract_type(P) \
3672 make_or_reuse_fract_type (P, 1, 1)
3673 #define make_or_reuse_signed_accum_type(P) \
3674 make_or_reuse_accum_type (P, 0, 0)
3675 #define make_or_reuse_unsigned_accum_type(P) \
3676 make_or_reuse_accum_type (P, 1, 0)
3677 #define make_or_reuse_sat_signed_accum_type(P) \
3678 make_or_reuse_accum_type (P, 0, 1)
3679 #define make_or_reuse_sat_unsigned_accum_type(P) \
3680 make_or_reuse_accum_type (P, 1, 1)
3682 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3683 put the prototype here. Rtl.h does declare the prototype if
3684 tree.h had been included. */
3686 extern tree
make_tree (tree
, rtx
);
3688 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3691 Such modified types already made are recorded so that duplicates
3694 extern tree
build_type_attribute_variant (tree
, tree
);
3695 extern tree
build_decl_attribute_variant (tree
, tree
);
3696 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3698 /* Remove redundant "omp declare simd" attributes from fndecl. */
3699 extern void omp_remove_redundant_declare_simd_attrs (tree
);
3701 /* Return 0 if the attributes for two types are incompatible, 1 if they
3702 are compatible, and 2 if they are nearly compatible (which causes a
3703 warning to be generated). */
3704 extern int comp_type_attributes (const_tree
, const_tree
);
3706 /* Default versions of target-overridable functions. */
3707 extern tree
merge_decl_attributes (tree
, tree
);
3708 extern tree
merge_type_attributes (tree
, tree
);
3710 /* This function is a private implementation detail of lookup_attribute()
3711 and you should never call it directly. */
3712 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3714 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3715 return a pointer to the attribute's list element if the attribute
3716 is part of the list, or NULL_TREE if not found. If the attribute
3717 appears more than once, this only returns the first occurrence; the
3718 TREE_CHAIN of the return value should be passed back in if further
3719 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3723 lookup_attribute (const char *attr_name
, tree list
)
3725 gcc_checking_assert (attr_name
[0] != '_');
3726 /* In most cases, list is NULL_TREE. */
3727 if (list
== NULL_TREE
)
3730 /* Do the strlen() before calling the out-of-line implementation.
3731 In most cases attr_name is a string constant, and the compiler
3732 will optimize the strlen() away. */
3733 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3736 /* This function is a private implementation detail of
3737 is_attribute_p() and you should never call it directly. */
3738 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3740 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3741 if the identifier node is a valid attribute name for the string.
3742 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3743 be the identifier for 'text' or for '__text__'. */
3746 is_attribute_p (const char *attr_name
, const_tree ident
)
3748 gcc_checking_assert (attr_name
[0] != '_');
3749 /* Do the strlen() before calling the out-of-line implementation.
3750 In most cases attr_name is a string constant, and the compiler
3751 will optimize the strlen() away. */
3752 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3755 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3756 modified list. ATTR_NAME must be in the form 'text' (not
3759 extern tree
remove_attribute (const char *, tree
);
3761 /* Given two attributes lists, return a list of their union. */
3763 extern tree
merge_attributes (tree
, tree
);
3765 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3766 /* Given two Windows decl attributes lists, possibly including
3767 dllimport, return a list of their union . */
3768 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3770 /* Handle a "dllimport" or "dllexport" attribute. */
3771 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3774 /* Check whether CAND is suitable to be returned from get_qualified_type
3775 (BASE, TYPE_QUALS). */
3777 extern bool check_qualified_type (const_tree
, const_tree
, int);
3779 /* Return a version of the TYPE, qualified as indicated by the
3780 TYPE_QUALS, if one exists. If no qualified version exists yet,
3781 return NULL_TREE. */
3783 extern tree
get_qualified_type (tree
, int);
3785 /* Like get_qualified_type, but creates the type if it does not
3786 exist. This function never returns NULL_TREE. */
3788 extern tree
build_qualified_type (tree
, int);
3790 /* Create a variant of type T with alignment ALIGN. */
3792 extern tree
build_aligned_type (tree
, unsigned int);
3794 /* Like build_qualified_type, but only deals with the `const' and
3795 `volatile' qualifiers. This interface is retained for backwards
3796 compatibility with the various front-ends; new code should use
3797 build_qualified_type instead. */
3799 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3800 build_qualified_type ((TYPE), \
3801 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3802 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3804 /* Make a copy of a type node. */
3806 extern tree
build_distinct_type_copy (tree
);
3807 extern tree
build_variant_type_copy (tree
);
3809 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3810 fields. Optionally specify an alignment, and then lay it out. */
3812 extern void finish_builtin_struct (tree
, const char *,
3815 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3816 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3817 node, does nothing except for the first time. */
3819 extern void layout_type (tree
);
3821 extern record_layout_info
start_record_layout (tree
);
3822 extern tree
bit_from_pos (tree
, tree
);
3823 extern tree
byte_from_pos (tree
, tree
);
3824 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
3825 extern void normalize_offset (tree
*, tree
*, unsigned int);
3826 extern tree
rli_size_unit_so_far (record_layout_info
);
3827 extern tree
rli_size_so_far (record_layout_info
);
3828 extern void normalize_rli (record_layout_info
);
3829 extern void place_field (record_layout_info
, tree
);
3830 extern void compute_record_mode (tree
);
3831 extern void finish_record_layout (record_layout_info
, int);
3833 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3834 return a canonicalized ..._TYPE node, so that duplicates are not made.
3835 How the hash code is computed is up to the caller, as long as any two
3836 callers that could hash identical-looking type nodes agree. */
3838 extern tree
type_hash_canon (unsigned int, tree
);
3840 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3841 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3842 fields. Call this only once for any given decl node.
3844 Second argument is the boundary that this field can be assumed to
3845 be starting at (in bits). Zero means it can be assumed aligned
3846 on any boundary that may be needed. */
3848 extern void layout_decl (tree
, unsigned);
3850 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3851 a previous call to layout_decl and calls it again. */
3853 extern void relayout_decl (tree
);
3855 /* Return the mode for data of a given size SIZE and mode class CLASS.
3856 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3857 The value is BLKmode if no other mode is found. This is like
3858 mode_for_size, but is passed a tree. */
3860 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
3862 /* Return an expr equal to X but certainly not valid as an lvalue. */
3864 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
3865 extern tree
non_lvalue_loc (location_t
, tree
);
3867 extern tree
convert (tree
, tree
);
3868 extern unsigned int expr_align (const_tree
);
3869 extern tree
expr_first (tree
);
3870 extern tree
expr_last (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
tree_expr_size (const_tree
);
3875 extern tree
bit_position (const_tree
);
3876 extern HOST_WIDE_INT
int_bit_position (const_tree
);
3877 extern tree
byte_position (const_tree
);
3878 extern HOST_WIDE_INT
int_byte_position (const_tree
);
3880 #define sizetype sizetype_tab[(int) stk_sizetype]
3881 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3882 #define ssizetype sizetype_tab[(int) stk_ssizetype]
3883 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3885 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
3886 #define size_binop(CODE,T1,T2)\
3887 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
3888 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
3889 #define size_diffop(T1,T2)\
3890 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
3891 extern tree
size_diffop_loc (location_t
, tree
, tree
);
3893 #define size_int(L) size_int_kind (L, stk_sizetype)
3894 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
3895 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3896 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3898 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
3899 extern tree
round_up_loc (location_t
, tree
, int);
3900 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
3901 extern tree
round_down_loc (location_t
, tree
, int);
3902 extern void finalize_size_functions (void);
3904 /* Type for sizes of data-type. */
3906 #define BITS_PER_UNIT_LOG \
3907 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3908 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3909 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3911 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3912 by making the last node in X point to Y.
3913 Returns X, except if X is 0 returns Y. */
3915 extern tree
chainon (tree
, tree
);
3917 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3919 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
3920 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3922 /* Return the last tree node in a chain. */
3924 extern tree
tree_last (tree
);
3926 /* Reverse the order of elements in a chain, and return the new head. */
3928 extern tree
nreverse (tree
);
3930 /* Returns the length of a chain of nodes
3931 (number of chain pointers to follow before reaching a null pointer). */
3933 extern int list_length (const_tree
);
3935 /* Returns the number of FIELD_DECLs in a type. */
3937 extern int fields_length (const_tree
);
3939 /* Returns the first FIELD_DECL in a type. */
3941 extern tree
first_field (const_tree
);
3943 /* Given an initializer INIT, return TRUE if INIT is zero or some
3944 aggregate of zeros. Otherwise return FALSE. */
3946 extern bool initializer_zerop (const_tree
);
3948 /* Given a vector VEC, return its first element if all elements are
3949 the same. Otherwise return NULL_TREE. */
3951 extern tree
uniform_vector_p (const_tree
);
3953 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
3955 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
3957 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
3958 HOST_WIDE_INT
*, bool *);
3960 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
3962 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3964 extern int integer_zerop (const_tree
);
3966 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3968 extern int integer_onep (const_tree
);
3970 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3971 all of whose significant bits are 1. */
3973 extern int integer_all_onesp (const_tree
);
3975 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
3978 extern int integer_minus_onep (const_tree
);
3980 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3981 exactly one bit 1. */
3983 extern int integer_pow2p (const_tree
);
3985 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3986 with a nonzero value. */
3988 extern int integer_nonzerop (const_tree
);
3990 extern bool cst_and_fits_in_hwi (const_tree
);
3991 extern tree
num_ending_zeros (const_tree
);
3993 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
3996 extern int fixed_zerop (const_tree
);
3998 /* staticp (tree x) is nonzero if X is a reference to data allocated
3999 at a fixed address in memory. Returns the outermost data. */
4001 extern tree
staticp (tree
);
4003 /* save_expr (EXP) returns an expression equivalent to EXP
4004 but it can be used multiple times within context CTX
4005 and only evaluate EXP once. */
4007 extern tree
save_expr (tree
);
4009 /* Look inside EXPR into any simple arithmetic operations. Return the
4010 outermost non-arithmetic or non-invariant node. */
4012 extern tree
skip_simple_arithmetic (tree
);
4014 /* Look inside EXPR into simple arithmetic operations involving constants.
4015 Return the outermost non-arithmetic or non-constant node. */
4017 extern tree
skip_simple_constant_arithmetic (tree
);
4019 /* Return which tree structure is used by T. */
4021 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4023 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4024 size or offset that depends on a field within a record. */
4026 extern bool contains_placeholder_p (const_tree
);
4028 /* This macro calls the above function but short-circuits the common
4029 case of a constant to save time. Also check for null. */
4031 #define CONTAINS_PLACEHOLDER_P(EXP) \
4032 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4034 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4035 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4038 extern bool type_contains_placeholder_p (tree
);
4040 /* Given a tree EXP, find all occurrences of references to fields
4041 in a PLACEHOLDER_EXPR and place them in vector REFS without
4042 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4043 we assume here that EXP contains only arithmetic expressions
4044 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4047 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4049 /* This macro calls the above function but short-circuits the common
4050 case of a constant to save time and also checks for NULL. */
4052 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4054 if((EXP) && !TREE_CONSTANT (EXP)) \
4055 find_placeholder_in_expr (EXP, V); \
4058 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4059 return a tree with all occurrences of references to F in a
4060 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4061 CONST_DECLs. Note that we assume here that EXP contains only
4062 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4063 occurring only in their argument list. */
4065 extern tree
substitute_in_expr (tree
, tree
, tree
);
4067 /* This macro calls the above function but short-circuits the common
4068 case of a constant to save time and also checks for NULL. */
4070 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4071 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4073 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4074 for it within OBJ, a tree that is an object or a chain of references. */
4076 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4078 /* This macro calls the above function but short-circuits the common
4079 case of a constant to save time and also checks for NULL. */
4081 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4082 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4083 : substitute_placeholder_in_expr (EXP, OBJ))
4085 /* variable_size (EXP) is like save_expr (EXP) except that it
4086 is for the special case of something that is part of a
4087 variable size for a data type. It makes special arrangements
4088 to compute the value at the right time when the data type
4089 belongs to a function parameter. */
4091 extern tree
variable_size (tree
);
4093 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4094 but it can be used multiple times
4095 and only evaluate the subexpressions once. */
4097 extern tree
stabilize_reference (tree
);
4099 /* Subroutine of stabilize_reference; this is called for subtrees of
4100 references. Any expression with side-effects must be put in a SAVE_EXPR
4101 to ensure that it is only evaluated once. */
4103 extern tree
stabilize_reference_1 (tree
);
4105 /* Return EXP, stripped of any conversions to wider types
4106 in such a way that the result of converting to type FOR_TYPE
4107 is the same as if EXP were converted to FOR_TYPE.
4108 If FOR_TYPE is 0, it signifies EXP's type. */
4110 extern tree
get_unwidened (tree
, tree
);
4112 /* Return OP or a simpler expression for a narrower value
4113 which can be sign-extended or zero-extended to give back OP.
4114 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4115 or 0 if the value should be sign-extended. */
4117 extern tree
get_narrower (tree
, int *);
4119 /* Return true if T is an expression that get_inner_reference handles. */
4122 handled_component_p (const_tree t
)
4124 switch (TREE_CODE (t
))
4129 case ARRAY_RANGE_REF
:
4132 case VIEW_CONVERT_EXPR
:
4140 /* Given an expression EXP that is a handled_component_p,
4141 look for the ultimate containing object, which is returned and specify
4142 the access position and size. */
4144 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4145 tree
*, enum machine_mode
*, int *, int *,
4148 /* Return a tree of sizetype representing the size, in bytes, of the element
4149 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4151 extern tree
array_ref_element_size (tree
);
4153 bool array_at_struct_end_p (tree
);
4155 /* Return a tree representing the lower bound of the array mentioned in
4156 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4158 extern tree
array_ref_low_bound (tree
);
4160 /* Return a tree representing the upper bound of the array mentioned in
4161 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4163 extern tree
array_ref_up_bound (tree
);
4165 /* Return a tree representing the offset, in bytes, of the field referenced
4166 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4168 extern tree
component_ref_field_offset (tree
);
4170 /* Given a DECL or TYPE, return the scope in which it was declared, or
4171 NUL_TREE if there is no containing scope. */
4173 extern tree
get_containing_scope (const_tree
);
4175 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4177 extern tree
decl_function_context (const_tree
);
4179 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4180 this _DECL with its context, or zero if none. */
4181 extern tree
decl_type_context (const_tree
);
4183 /* Return 1 if EXPR is the real constant zero. */
4184 extern int real_zerop (const_tree
);
4186 /* Initialize the iterator I with arguments from function FNDECL */
4189 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4191 i
->next
= TYPE_ARG_TYPES (fntype
);
4194 /* Return a pointer that holds the next argument if there are more arguments to
4195 handle, otherwise return NULL. */
4197 static inline tree
*
4198 function_args_iter_cond_ptr (function_args_iterator
*i
)
4200 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4203 /* Return the next argument if there are more arguments to handle, otherwise
4207 function_args_iter_cond (function_args_iterator
*i
)
4209 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4212 /* Advance to the next argument. */
4214 function_args_iter_next (function_args_iterator
*i
)
4216 gcc_assert (i
->next
!= NULL_TREE
);
4217 i
->next
= TREE_CHAIN (i
->next
);
4220 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4223 inlined_function_outer_scope_p (const_tree block
)
4225 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4228 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4229 to point to the next tree element. ITER is an instance of
4230 function_args_iterator used to iterate the arguments. */
4231 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4232 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4233 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4234 function_args_iter_next (&(ITER)))
4236 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4237 to the next tree element. ITER is an instance of function_args_iterator
4238 used to iterate the arguments. */
4239 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4240 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4241 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4242 function_args_iter_next (&(ITER)))
4247 extern unsigned crc32_string (unsigned, const char *);
4248 extern unsigned crc32_byte (unsigned, char);
4249 extern unsigned crc32_unsigned (unsigned, unsigned);
4250 extern void clean_symbol_name (char *);
4251 extern tree
get_file_function_name (const char *);
4252 extern tree
get_callee_fndecl (const_tree
);
4253 extern int type_num_arguments (const_tree
);
4254 extern bool associative_tree_code (enum tree_code
);
4255 extern bool commutative_tree_code (enum tree_code
);
4256 extern bool commutative_ternary_tree_code (enum tree_code
);
4257 extern tree
upper_bound_in_type (tree
, tree
);
4258 extern tree
lower_bound_in_type (tree
, tree
);
4259 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4260 extern tree
create_artificial_label (location_t
);
4261 extern const char *get_name (tree
);
4262 extern bool stdarg_p (const_tree
);
4263 extern bool prototype_p (tree
);
4264 extern bool is_typedef_decl (tree x
);
4265 extern bool typedef_variant_p (tree
);
4266 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4267 extern tree
build_low_bits_mask (tree
, unsigned);
4268 extern tree
tree_strip_nop_conversions (tree
);
4269 extern tree
tree_strip_sign_nop_conversions (tree
);
4270 extern const_tree
strip_invariant_refs (const_tree
);
4271 extern tree
lhd_gcc_personality (void);
4272 extern void assign_assembler_name_if_neeeded (tree
);
4273 extern void warn_deprecated_use (tree
, tree
);
4274 extern void cache_integer_cst (tree
);
4278 extern void change_decl_assembler_name (tree
, tree
);
4281 extern tree
unshare_expr (tree
);
4282 extern tree
unshare_expr_without_location (tree
);
4286 extern void expand_label (tree
);
4287 extern void expand_goto (tree
);
4289 extern rtx
expand_stack_save (void);
4290 extern void expand_stack_restore (tree
);
4291 extern void expand_return (tree
);
4293 /* Compare and hash for any structure which begins with a canonical
4294 pointer. Assumes all pointers are interchangeable, which is sort
4295 of already assumed by gcc elsewhere IIRC. */
4298 struct_ptr_eq (const void *a
, const void *b
)
4300 const void * const * x
= (const void * const *) a
;
4301 const void * const * y
= (const void * const *) b
;
4305 static inline hashval_t
4306 struct_ptr_hash (const void *a
)
4308 const void * const * x
= (const void * const *) a
;
4309 return (intptr_t)*x
>> 4;
4312 /* In fold-const.c */
4314 /* Non-zero if we are folding constants inside an initializer; zero
4316 extern int folding_initializer
;
4318 /* Convert between trees and native memory representation. */
4319 extern int native_encode_expr (const_tree
, unsigned char *, int);
4320 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4322 /* Fold constants as much as possible in an expression.
4323 Returns the simplified expression.
4324 Acts only on the top level of the expression;
4325 if the argument itself cannot be simplified, its
4326 subexpressions are not changed. */
4328 extern tree
fold (tree
);
4329 #define fold_unary(CODE,T1,T2)\
4330 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4331 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
4332 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4333 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4334 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
4335 #define fold_binary(CODE,T1,T2,T3)\
4336 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4337 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4338 #define fold_ternary(CODE,T1,T2,T3,T4)\
4339 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4340 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4341 #define fold_build1(c,t1,t2)\
4342 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4343 #define fold_build1_loc(l,c,t1,t2)\
4344 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4345 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
4346 tree MEM_STAT_DECL
);
4347 #define fold_build2(c,t1,t2,t3)\
4348 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4349 #define fold_build2_loc(l,c,t1,t2,t3)\
4350 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4351 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
4352 tree MEM_STAT_DECL
);
4353 #define fold_build3(c,t1,t2,t3,t4)\
4354 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4355 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4356 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4357 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
4358 tree MEM_STAT_DECL
);
4359 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
4360 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4361 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4362 #define fold_build_call_array(T1,T2,N,T4)\
4363 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4364 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
4365 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4366 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4367 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
4368 extern bool fold_convertible_p (const_tree
, const_tree
);
4369 #define fold_convert(T1,T2)\
4370 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
4371 extern tree
fold_convert_loc (location_t
, tree
, tree
);
4372 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
4373 extern tree
fold_ignored_result (tree
);
4374 extern tree
fold_abs_const (tree
, tree
);
4375 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
4376 extern void fold_defer_overflow_warnings (void);
4377 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4378 extern void fold_undefer_and_ignore_overflow_warnings (void);
4379 extern bool fold_deferring_overflow_warnings_p (void);
4380 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
4381 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4382 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4383 #define omit_one_operand(T1,T2,T3)\
4384 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4385 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
4386 #define omit_two_operands(T1,T2,T3,T4)\
4387 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4388 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
4389 #define invert_truthvalue(T)\
4390 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
4391 extern tree
invert_truthvalue_loc (location_t
, tree
);
4392 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4393 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4394 extern tree
fold_read_from_constant_string (tree
);
4395 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
4396 #define build_fold_addr_expr(T)\
4397 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4398 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
4399 #define build_fold_addr_expr_with_type(T,TYPE)\
4400 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4401 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
4402 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4403 extern tree
fold_strip_sign_ops (tree
);
4404 #define build_fold_indirect_ref(T)\
4405 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4406 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
4407 #define fold_indirect_ref(T)\
4408 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4409 extern tree
fold_indirect_ref_loc (location_t
, tree
);
4410 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
4411 #define build_simple_mem_ref(T)\
4412 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4413 extern double_int
mem_ref_offset (const_tree
);
4414 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
4415 extern tree
constant_boolean_node (bool, tree
);
4416 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
4418 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4419 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4421 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4422 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4424 extern bool tree_expr_nonzero_p (tree
);
4425 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4426 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4428 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4429 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4430 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4432 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4433 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4434 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4436 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4438 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4439 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
4440 enum tree_code
, tree
, tree
, tree
);
4441 extern void debug_fold_checksum (const_tree
);
4443 /* Return nonzero if CODE is a tree code that represents a truth value. */
4445 truth_value_p (enum tree_code code
)
4447 return (TREE_CODE_CLASS (code
) == tcc_comparison
4448 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4449 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4450 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4453 /* Return whether TYPE is a type suitable for an offset for
4454 a POINTER_PLUS_EXPR. */
4456 ptrofftype_p (tree type
)
4458 return (INTEGRAL_TYPE_P (type
)
4459 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4460 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4463 /* Return OFF converted to a pointer offset type suitable as offset for
4464 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4466 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4468 return fold_convert_loc (loc
, sizetype
, off
);
4470 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4472 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4474 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4476 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4477 ptr
, fold_convert_loc (loc
, sizetype
, off
));
4479 #define fold_build_pointer_plus(p,o) \
4480 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4482 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4484 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4486 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4487 ptr
, size_int (off
));
4489 #define fold_build_pointer_plus_hwi(p,o) \
4490 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4494 /* Non-zero if __builtin_constant_p should be folded right away. */
4495 extern bool force_folding_builtin_constant_p
;
4497 extern bool avoid_folding_inline_builtin (tree
);
4498 extern tree
fold_call_expr (location_t
, tree
, bool);
4499 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
4500 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
4501 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
4502 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
4503 enum built_in_function
);
4504 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4505 enum built_in_function
);
4506 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4507 enum built_in_function
);
4508 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
4509 extern bool fold_builtin_next_arg (tree
, bool);
4510 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4511 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
4512 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4513 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4514 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4515 extern tree
build_call_expr (tree
, int, ...);
4516 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4517 extern tree
c_strlen (tree
, int);
4518 extern tree
build_string_literal (int, const char *);
4519 extern bool validate_arglist (const_tree
, ...);
4520 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4521 extern bool is_builtin_fn (tree
);
4522 extern bool get_object_alignment_1 (tree
, unsigned int *,
4523 unsigned HOST_WIDE_INT
*);
4524 extern unsigned int get_object_alignment (tree
);
4525 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
4526 unsigned HOST_WIDE_INT
*);
4527 extern unsigned int get_pointer_alignment (tree
);
4528 extern tree
fold_call_stmt (gimple
, bool);
4529 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4530 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
4531 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
4532 tree
*, tree
*, int *, bool *);
4533 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
4534 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
4536 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
4537 extern bool is_simple_builtin (tree
);
4538 extern bool is_inexpensive_builtin (tree
);
4541 extern tree
strip_float_extensions (tree
);
4544 extern int really_constant_p (const_tree
);
4545 extern bool decl_address_invariant_p (const_tree
);
4546 extern bool decl_address_ip_invariant_p (const_tree
);
4547 extern bool int_fits_type_p (const_tree
, const_tree
);
4548 #ifndef GENERATOR_FILE
4549 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4551 extern bool variably_modified_type_p (tree
, tree
);
4552 extern int tree_log2 (const_tree
);
4553 extern int tree_floor_log2 (const_tree
);
4554 extern int simple_cst_equal (const_tree
, const_tree
);
4555 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4556 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4557 const_tree
, hashval_t
);
4558 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4559 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4560 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4561 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4562 extern int type_list_equal (const_tree
, const_tree
);
4563 extern int chain_member (const_tree
, const_tree
);
4564 extern int simple_cst_list_equal (const_tree
, const_tree
);
4565 extern void dump_tree_statistics (void);
4566 extern void recompute_tree_invariant_for_addr_expr (tree
);
4567 extern bool needs_to_live_in_memory (const_tree
);
4568 extern tree
reconstruct_complex_type (tree
, tree
);
4570 extern int real_onep (const_tree
);
4571 extern int real_twop (const_tree
);
4572 extern int real_minus_onep (const_tree
);
4573 extern void init_ttree (void);
4574 extern void build_common_tree_nodes (bool, bool);
4575 extern void build_common_builtin_nodes (void);
4576 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4577 extern tree
build_range_type (tree
, tree
, tree
);
4578 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4579 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4580 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4581 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4583 extern tree
tree_block (tree
);
4584 extern void tree_set_block (tree
, tree
);
4585 extern location_t
*block_nonartificial_location (tree
);
4586 extern location_t
tree_nonartificial_location (tree
);
4588 extern tree
block_ultimate_origin (const_tree
);
4590 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4591 extern bool virtual_method_call_p (tree
);
4592 extern tree
obj_type_ref_class (tree ref
);
4593 extern bool types_same_for_odr (tree type1
, tree type2
);
4594 extern bool contains_bitfld_component_ref_p (const_tree
);
4595 extern bool type_in_anonymous_namespace_p (tree
);
4596 extern bool block_may_fallthru (const_tree
);
4597 extern void using_eh_for_cleanups (void);
4598 extern bool using_eh_for_cleanups_p (void);
4600 extern const char *get_tree_code_name (enum tree_code
);
4602 /* In tree-nested.c */
4603 extern tree
build_addr (tree
, tree
);
4606 extern void expand_main_function (void);
4607 extern void expand_function_end (void);
4608 extern void expand_function_start (tree
);
4609 extern void stack_protect_prologue (void);
4610 extern void stack_protect_epilogue (void);
4611 extern void init_dummy_function_start (void);
4612 extern void expand_dummy_function_end (void);
4613 extern void allocate_struct_function (tree
, bool);
4614 extern void push_struct_function (tree fndecl
);
4615 extern void init_function_start (tree
);
4616 extern bool use_register_for_decl (const_tree
);
4617 extern void generate_setjmp_warnings (void);
4618 extern void init_temp_slots (void);
4619 extern void free_temp_slots (void);
4620 extern void pop_temp_slots (void);
4621 extern void push_temp_slots (void);
4622 extern void preserve_temp_slots (rtx
);
4623 extern int aggregate_value_p (const_tree
, const_tree
);
4624 extern void push_function_context (void);
4625 extern void pop_function_context (void);
4626 extern gimple_seq
gimplify_parameters (void);
4628 /* In print-rtl.c */
4630 extern void print_rtl (FILE *, const_rtx
);
4633 /* In print-tree.c */
4634 extern void debug_tree (tree
);
4635 extern void debug_raw (const tree_node
&ref
);
4636 extern void debug_raw (const tree_node
*ptr
);
4637 extern void debug (const tree_node
&ref
);
4638 extern void debug (const tree_node
*ptr
);
4639 extern void debug_verbose (const tree_node
&ref
);
4640 extern void debug_verbose (const tree_node
*ptr
);
4641 extern void debug_head (const tree_node
&ref
);
4642 extern void debug_head (const tree_node
*ptr
);
4643 extern void debug_body (const tree_node
&ref
);
4644 extern void debug_body (const tree_node
*ptr
);
4645 extern void debug_vec_tree (vec
<tree
, va_gc
> *);
4646 extern void debug (vec
<tree
, va_gc
> &ref
);
4647 extern void debug (vec
<tree
, va_gc
> *ptr
);
4648 extern void debug_raw (vec
<tree
, va_gc
> &ref
);
4649 extern void debug_raw (vec
<tree
, va_gc
> *ptr
);
4651 extern void dump_addr (FILE*, const char *, const void *);
4652 extern void print_node (FILE *, const char *, tree
, int);
4653 extern void print_vec_tree (FILE *, const char *, vec
<tree
, va_gc
> *, int);
4654 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4655 extern void indent_to (FILE *, int);
4658 /* In tree-inline.c: */
4659 extern bool debug_find_tree (tree
, tree
);
4660 /* This is in tree-inline.c since the routine uses
4661 data structures from the inliner. */
4662 extern tree
build_duplicate_type (tree
);
4665 extern int flags_from_decl_or_type (const_tree
);
4666 extern int call_expr_flags (const_tree
);
4667 extern void set_call_expr_flags (tree
, int);
4669 extern int setjmp_call_p (const_tree
);
4670 extern bool gimple_alloca_call_p (const_gimple
);
4671 extern bool alloca_call_p (const_tree
);
4672 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4673 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4677 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
4678 extern const struct attribute_spec
*lookup_scoped_attribute_spec (const_tree
,
4681 extern void init_attributes (void);
4683 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4684 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4685 it should be modified in place; if a TYPE, a copy should be created
4686 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4687 information, in the form of a bitwise OR of flags in enum attribute_flags
4688 from tree.h. Depending on these flags, some attributes may be
4689 returned to be applied at a later stage (for example, to apply
4690 a decl attribute to the declaration rather than to its type). */
4691 extern tree
decl_attributes (tree
*, tree
, int);
4693 extern bool cxx11_attribute_p (const_tree
);
4695 extern tree
get_attribute_name (const_tree
);
4697 extern tree
get_attribute_namespace (const_tree
);
4699 extern void apply_tm_attr (tree
, tree
);
4701 /* In stor-layout.c */
4702 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
4703 extern void fixup_signed_type (tree
);
4704 extern void internal_reference_types (void);
4705 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4708 extern tree
tree_output_constant_def (tree
);
4709 extern void make_decl_rtl (tree
);
4710 extern rtx
make_decl_rtl_for_debug (tree
);
4711 extern void make_decl_one_only (tree
, tree
);
4712 extern int supports_one_only (void);
4713 extern void resolve_unique_section (tree
, int, int);
4714 extern void mark_referenced (tree
);
4715 extern void mark_decl_referenced (tree
);
4716 extern void notice_global_symbol (tree
);
4717 extern void set_user_assembler_name (tree
, const char *);
4718 extern void process_pending_assemble_externals (void);
4719 extern bool decl_replaceable_p (tree
);
4720 extern bool decl_binds_to_current_def_p (tree
);
4721 extern enum tls_model
decl_default_tls_model (const_tree
);
4723 /* Declare DECL to be a weak symbol. */
4724 extern void declare_weak (tree
);
4725 /* Merge weak status. */
4726 extern void merge_weak (tree
, tree
);
4727 /* Make one symbol an alias for another. */
4728 extern void assemble_alias (tree
, tree
);
4730 /* Return nonzero if VALUE is a valid constant-valued expression
4731 for use in initializing a static variable; one that can be an
4732 element of a "constant" initializer.
4734 Return null_pointer_node if the value is absolute;
4735 if it is relocatable, return the variable that determines the relocation.
4736 We assume that VALUE has been folded as much as possible;
4737 therefore, we do not need to check for such things as
4738 arithmetic-combinations of integers. */
4739 extern tree
initializer_constant_valid_p (tree
, tree
);
4741 /* Return true if VALUE is a valid constant-valued expression
4742 for use in initializing a static bit-field; one that can be
4743 an element of a "constant" initializer. */
4744 extern bool initializer_constant_valid_for_bitfield_p (tree
);
4746 /* Whether a constructor CTOR is a valid static constant initializer if all
4747 its elements are. This used to be internal to initializer_constant_valid_p
4748 and has been exposed to let other functions like categorize_ctor_elements
4749 evaluate the property while walking a constructor for other purposes. */
4751 extern bool constructor_static_from_elts_p (const_tree
);
4754 extern void expand_computed_goto (tree
);
4755 extern bool parse_output_constraint (const char **, int, int, int,
4756 bool *, bool *, bool *);
4757 extern bool parse_input_constraint (const char **, int, int, int, int,
4758 const char * const *, bool *, bool *);
4759 extern void expand_asm_stmt (gimple
);
4760 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
4762 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4763 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
4767 /* In tree-inline.c */
4769 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
4771 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4773 #define walk_tree(a,b,c,d) \
4774 walk_tree_1 (a, b, c, d, NULL)
4775 #define walk_tree_without_duplicates(a,b,c) \
4776 walk_tree_without_duplicates_1 (a, b, c, NULL)
4779 /* Assign the RTX to declaration. */
4781 extern void set_decl_rtl (tree
, rtx
);
4782 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
4785 extern tree
get_base_address (tree t
);
4786 extern void mark_addressable (tree
);
4789 extern int tree_map_base_eq (const void *, const void *);
4790 extern unsigned int tree_map_base_hash (const void *);
4791 extern int tree_map_base_marked_p (const void *);
4792 extern bool list_equal_p (const_tree
, const_tree
);
4794 #define tree_map_eq tree_map_base_eq
4795 extern unsigned int tree_map_hash (const void *);
4796 #define tree_map_marked_p tree_map_base_marked_p
4798 #define tree_decl_map_eq tree_map_base_eq
4799 extern unsigned int tree_decl_map_hash (const void *);
4800 #define tree_decl_map_marked_p tree_map_base_marked_p
4802 #define tree_int_map_eq tree_map_base_eq
4803 #define tree_int_map_hash tree_map_base_hash
4804 #define tree_int_map_marked_p tree_map_base_marked_p
4806 #define tree_priority_map_eq tree_map_base_eq
4807 #define tree_priority_map_hash tree_map_base_hash
4808 #define tree_priority_map_marked_p tree_map_base_marked_p
4810 #define tree_vec_map_eq tree_map_base_eq
4811 #define tree_vec_map_hash tree_decl_map_hash
4812 #define tree_vec_map_marked_p tree_map_base_marked_p
4815 extern bool ssa_name_nonnegative_p (const_tree
);
4817 /* In tree-object-size.c. */
4818 extern void init_object_sizes (void);
4819 extern void fini_object_sizes (void);
4820 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
4824 /* Determine whether the LEN bytes can be moved by using several move
4825 instructions. Return nonzero if a call to move_by_pieces should
4827 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
4829 /* Is it an ADDR_EXPR of a DECL that's not in memory? */
4830 extern bool addr_expr_of_non_mem_decl_p (tree
);
4832 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
4833 extern tree
build_personality_function (const char *);
4835 /* In trans-mem.c. */
4836 extern tree
build_tm_abort_call (location_t
, bool);
4837 extern bool is_tm_safe (const_tree
);
4838 extern bool is_tm_pure (const_tree
);
4839 extern bool is_tm_may_cancel_outer (tree
);
4840 extern bool is_tm_ending_fndecl (tree
);
4841 extern void record_tm_replacement (tree
, tree
);
4842 extern void tm_malloc_replacement (tree
);
4845 is_tm_safe_or_pure (const_tree x
)
4847 return is_tm_safe (x
) || is_tm_pure (x
);
4850 /* In tree-inline.c. */
4852 void init_inline_once (void);
4854 /* Initialize the abstract argument list iterator object ITER with the
4855 arguments from CALL_EXPR node EXP. */
4857 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4860 iter
->n
= call_expr_nargs (exp
);
4865 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4868 iter
->n
= call_expr_nargs (exp
);
4872 /* Return the next argument from abstract argument list iterator object ITER,
4873 and advance its state. Return NULL_TREE if there are no more arguments. */
4875 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4878 if (iter
->i
>= iter
->n
)
4880 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4885 static inline const_tree
4886 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4889 if (iter
->i
>= iter
->n
)
4891 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4896 /* Initialize the abstract argument list iterator object ITER, then advance
4897 past and return the first argument. Useful in for expressions, e.g.
4898 for (arg = first_call_expr_arg (exp, &iter); arg;
4899 arg = next_call_expr_arg (&iter)) */
4901 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4903 init_call_expr_arg_iterator (exp
, iter
);
4904 return next_call_expr_arg (iter
);
4907 static inline const_tree
4908 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4910 init_const_call_expr_arg_iterator (exp
, iter
);
4911 return next_const_call_expr_arg (iter
);
4914 /* Test whether there are more arguments in abstract argument list iterator
4915 ITER, without changing its state. */
4917 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4919 return (iter
->i
< iter
->n
);
4923 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
4925 return (iter
->i
< iter
->n
);
4928 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4929 (of type call_expr_arg_iterator) to hold the iteration state. */
4930 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4931 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4932 (arg) = next_call_expr_arg (&(iter)))
4934 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4935 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4936 (arg) = next_const_call_expr_arg (&(iter)))
4938 /* Return true if tree node T is a language-specific node. */
4940 is_lang_specific (tree t
)
4942 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4945 /* In vtable-verify.c. */
4946 extern void save_vtable_map_decl (tree
);
4948 /* Valid builtin number. */
4949 #define BUILTIN_VALID_P(FNCODE) \
4950 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4952 /* Return the tree node for an explicit standard builtin function or NULL. */
4954 builtin_decl_explicit (enum built_in_function fncode
)
4956 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4958 return builtin_info
.decl
[(size_t)fncode
];
4961 /* Return the tree node for an implicit builtin function or NULL. */
4963 builtin_decl_implicit (enum built_in_function fncode
)
4965 size_t uns_fncode
= (size_t)fncode
;
4966 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4968 if (!builtin_info
.implicit_p
[uns_fncode
])
4971 return builtin_info
.decl
[uns_fncode
];
4974 /* Set explicit builtin function nodes and whether it is an implicit
4978 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4980 size_t ufncode
= (size_t)fncode
;
4982 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4983 && (decl
!= NULL_TREE
|| !implicit_p
));
4985 builtin_info
.decl
[ufncode
] = decl
;
4986 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
4989 /* Set the implicit flag for a builtin function. */
4992 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4994 size_t uns_fncode
= (size_t)fncode
;
4996 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4997 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
4999 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
5002 /* Return whether the standard builtin function can be used as an explicit
5006 builtin_decl_explicit_p (enum built_in_function fncode
)
5008 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5009 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
5012 /* Return whether the standard builtin function can be used implicitly. */
5015 builtin_decl_implicit_p (enum built_in_function fncode
)
5017 size_t uns_fncode
= (size_t)fncode
;
5019 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5020 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
5021 && builtin_info
.implicit_p
[uns_fncode
]);
5024 /* Return true if T (assumed to be a DECL) is a global variable.
5025 A variable is considered global if its storage is not automatic. */
5028 is_global_var (const_tree t
)
5030 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5033 /* Return true if VAR may be aliased. A variable is considered as
5034 maybe aliased if it has its address taken by the local TU
5035 or possibly by another TU and might be modified through a pointer. */
5038 may_be_aliased (const_tree var
)
5040 return (TREE_CODE (var
) != CONST_DECL
5041 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5042 && TREE_READONLY (var
)
5043 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5044 && (TREE_PUBLIC (var
)
5045 || DECL_EXTERNAL (var
)
5046 || TREE_ADDRESSABLE (var
)));
5049 /* For anonymous aggregate types, we need some sort of name to
5050 hold on to. In practice, this should not appear, but it should
5051 not be harmful if it does. */
5052 #ifndef NO_DOT_IN_LABEL
5053 #define ANON_AGGRNAME_FORMAT "._%d"
5054 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
5055 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5056 #else /* NO_DOT_IN_LABEL */
5057 #ifndef NO_DOLLAR_IN_LABEL
5058 #define ANON_AGGRNAME_FORMAT "$_%d"
5059 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
5060 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5061 #else /* NO_DOLLAR_IN_LABEL */
5062 #define ANON_AGGRNAME_PREFIX "__anon_"
5063 #define ANON_AGGRNAME_P(ID_NODE) \
5064 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
5065 sizeof (ANON_AGGRNAME_PREFIX) - 1))
5066 #define ANON_AGGRNAME_FORMAT "__anon_%d"
5067 #endif /* NO_DOLLAR_IN_LABEL */
5068 #endif /* NO_DOT_IN_LABEL */
5071 #endif /* GCC_TREE_H */