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 node has a pointer bounds type. */
550 #define POINTER_BOUNDS_P(NODE) \
551 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
553 /* Nonzero if this type supposes bounds existence. */
554 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
556 /* Nonzero for objects with bounded type. */
557 #define BOUNDED_P(node) \
558 BOUNDED_TYPE_P (TREE_TYPE (node))
560 /* Nonzero if this type is the (possibly qualified) void type. */
561 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
563 /* Nonzero if this type is complete or is cv void. */
564 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
565 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
567 /* Nonzero if this type is complete or is an array with unspecified bound. */
568 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
569 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
572 /* Define many boolean fields that all tree nodes have. */
574 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
575 of this is needed. So it cannot be in a register.
576 In a FUNCTION_DECL it has no meaning.
577 In LABEL_DECL nodes, it means a goto for this label has been seen
578 from a place outside all binding contours that restore stack levels.
579 In an artificial SSA_NAME that points to a stack partition with at least
580 two variables, it means that at least one variable has TREE_ADDRESSABLE.
581 In ..._TYPE nodes, it means that objects of this type must be fully
582 addressable. This means that pieces of this object cannot go into
583 register parameters, for example. If this a function type, this
584 means that the value must be returned in memory.
585 In CONSTRUCTOR nodes, it means object constructed must be in memory.
586 In IDENTIFIER_NODEs, this means that some extern decl for this name
587 had its address taken. That matters for inline functions.
588 In a STMT_EXPR, it means we want the result of the enclosed expression. */
589 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
591 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
592 exit of a function. Calls for which this is true are candidates for tail
593 call optimizations. */
594 #define CALL_EXPR_TAILCALL(NODE) \
595 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
597 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
598 CASE_LOW operand has been processed. */
599 #define CASE_LOW_SEEN(NODE) \
600 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
602 #define PREDICT_EXPR_OUTCOME(NODE) \
603 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
604 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
605 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
606 #define PREDICT_EXPR_PREDICTOR(NODE) \
607 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
609 /* In a VAR_DECL, nonzero means allocate static storage.
610 In a FUNCTION_DECL, nonzero if function has been defined.
611 In a CONSTRUCTOR, nonzero means allocate static storage. */
612 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
614 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
615 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
617 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
618 should only be executed if an exception is thrown, not on normal exit
620 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
622 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
623 separate cleanup in honor_protect_cleanup_actions. */
624 #define TRY_CATCH_IS_CLEANUP(NODE) \
625 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
627 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
628 CASE_HIGH operand has been processed. */
629 #define CASE_HIGH_SEEN(NODE) \
630 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
632 /* Used to mark scoped enums. */
633 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
635 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
636 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
638 /* In an expr node (usually a conversion) this means the node was made
639 implicitly and should not lead to any sort of warning. In a decl node,
640 warnings concerning the decl should be suppressed. This is used at
641 least for used-before-set warnings, and it set after one warning is
643 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
645 /* Used to indicate that this TYPE represents a compiler-generated entity. */
646 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
648 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
649 this string as an argument. */
650 #define TREE_SYMBOL_REFERENCED(NODE) \
651 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
653 /* Nonzero in a pointer or reference type means the data pointed to
654 by this type can alias anything. */
655 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
656 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
658 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
659 there was an overflow in folding. */
661 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
663 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
665 #define TREE_OVERFLOW_P(EXPR) \
666 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
668 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
669 nonzero means name is to be accessible from outside this translation unit.
670 In an IDENTIFIER_NODE, nonzero means an external declaration
671 accessible from outside this translation unit was previously seen
672 for this name in an inner scope. */
673 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
675 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
676 of cached values, or is something else. */
677 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
679 /* In a SAVE_EXPR, indicates that the original expression has already
680 been substituted with a VAR_DECL that contains the value. */
681 #define SAVE_EXPR_RESOLVED_P(NODE) \
682 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
684 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
686 #define CALL_EXPR_VA_ARG_PACK(NODE) \
687 (CALL_EXPR_CHECK (NODE)->base.public_flag)
689 /* In any expression, decl, or constant, nonzero means it has side effects or
690 reevaluation of the whole expression could produce a different value.
691 This is set if any subexpression is a function call, a side effect or a
692 reference to a volatile variable. In a ..._DECL, this is set only if the
693 declaration said `volatile'. This will never be set for a constant. */
694 #define TREE_SIDE_EFFECTS(NODE) \
695 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
697 /* In a LABEL_DECL, nonzero means this label had its address taken
698 and therefore can never be deleted and is a jump target for
700 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
702 /* Nonzero means this expression is volatile in the C sense:
703 its address should be of type `volatile WHATEVER *'.
704 In other words, the declared item is volatile qualified.
705 This is used in _DECL nodes and _REF nodes.
706 On a FUNCTION_DECL node, this means the function does not
707 return normally. This is the same effect as setting
708 the attribute noreturn on the function in C.
710 In a ..._TYPE node, means this type is volatile-qualified.
711 But use TYPE_VOLATILE instead of this macro when the node is a type,
712 because eventually we may make that a different bit.
714 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
715 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
717 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
718 accessing the memory pointed to won't generate a trap. However,
719 this only applies to an object when used appropriately: it doesn't
720 mean that writing a READONLY mem won't trap.
722 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
723 (or slice of the array) always belongs to the range of the array.
724 I.e. that the access will not trap, provided that the access to
725 the base to the array will not trap. */
726 #define TREE_THIS_NOTRAP(NODE) \
727 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
728 ARRAY_RANGE_REF)->base.nothrow_flag)
730 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
731 nonzero means it may not be the lhs of an assignment.
732 Nonzero in a FUNCTION_DECL means this function should be treated
733 as "const" function (can only read its arguments). */
734 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
736 /* Value of expression is constant. Always on in all ..._CST nodes. May
737 also appear in an expression or decl where the value is constant. */
738 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
740 /* Nonzero if NODE, a type, has had its sizes gimplified. */
741 #define TYPE_SIZES_GIMPLIFIED(NODE) \
742 (TYPE_CHECK (NODE)->base.constant_flag)
744 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
745 #define DECL_UNSIGNED(NODE) \
746 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
748 /* In integral and pointer types, means an unsigned type. */
749 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
751 /* True if overflow wraps around for the given integral type. That
752 is, TYPE_MAX + 1 == TYPE_MIN. */
753 #define TYPE_OVERFLOW_WRAPS(TYPE) \
754 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
756 /* True if overflow is undefined for the given integral type. We may
757 optimize on the assumption that values in the type never overflow.
759 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
760 must issue a warning based on warn_strict_overflow. In some cases
761 it will be appropriate to issue the warning immediately, and in
762 other cases it will be appropriate to simply set a flag and let the
763 caller decide whether a warning is appropriate or not. */
764 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
765 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
767 /* True if overflow for the given integral type should issue a
769 #define TYPE_OVERFLOW_TRAPS(TYPE) \
770 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
772 /* True if pointer types have undefined overflow. */
773 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
775 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
776 Nonzero in a FUNCTION_DECL means that the function has been compiled.
777 This is interesting in an inline function, since it might not need
778 to be compiled separately.
779 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
780 or TYPE_DECL if the debugging info for the type has been written.
781 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
782 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
784 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
786 /* Nonzero in a _DECL if the name is used in its scope.
787 Nonzero in an expr node means inhibit warning if value is unused.
788 In IDENTIFIER_NODEs, this means that some extern decl for this name
790 In a BLOCK, this means that the block contains variables that are used. */
791 #define TREE_USED(NODE) ((NODE)->base.used_flag)
793 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
794 throw an exception. In a CALL_EXPR, nonzero means the call cannot
795 throw. We can't easily check the node type here as the C++
796 frontend also uses this flag (for AGGR_INIT_EXPR). */
797 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
799 /* In a CALL_EXPR, means that it's safe to use the target of the call
800 expansion as the return slot for a call that returns in memory. */
801 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
802 (CALL_EXPR_CHECK (NODE)->base.private_flag)
804 /* Cilk keywords accessors. */
805 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
807 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
808 passed by invisible reference (and the TREE_TYPE is a pointer to the true
810 #define DECL_BY_REFERENCE(NODE) \
811 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
812 RESULT_DECL)->decl_common.decl_by_reference_flag)
814 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
816 #define DECL_READ_P(NODE) \
817 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
819 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
820 attempting to share the stack slot with some other variable. */
821 #define DECL_NONSHAREABLE(NODE) \
822 (TREE_CHECK2 (NODE, VAR_DECL, \
823 RESULT_DECL)->decl_common.decl_nonshareable_flag)
825 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
826 thunked-to function. */
827 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
829 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
830 it has been built for the declaration of a variable-sized object. */
831 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
832 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
834 /* In a type, nonzero means that all objects of the type are guaranteed by the
835 language or front-end to be properly aligned, so we can indicate that a MEM
836 of this type is aligned at least to the alignment of the type, even if it
837 doesn't appear that it is. We see this, for example, in object-oriented
838 languages where a tag field may show this is an object of a more-aligned
839 variant of the more generic type.
841 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
843 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
845 /* Used in classes in C++. */
846 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
847 /* Used in classes in C++. */
848 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
850 /* True if reference type NODE is a C++ rvalue reference. */
851 #define TYPE_REF_IS_RVALUE(NODE) \
852 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
854 /* Nonzero in a _DECL if the use of the name is defined as a
855 deprecated feature by __attribute__((deprecated)). */
856 #define TREE_DEPRECATED(NODE) \
857 ((NODE)->base.deprecated_flag)
859 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
860 uses are to be substituted for uses of the TREE_CHAINed identifier. */
861 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
862 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
864 /* In fixed-point types, means a saturating type. */
865 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
867 /* These flags are available for each language front end to use internally. */
868 #define TREE_LANG_FLAG_0(NODE) \
869 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
870 #define TREE_LANG_FLAG_1(NODE) \
871 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
872 #define TREE_LANG_FLAG_2(NODE) \
873 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
874 #define TREE_LANG_FLAG_3(NODE) \
875 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
876 #define TREE_LANG_FLAG_4(NODE) \
877 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
878 #define TREE_LANG_FLAG_5(NODE) \
879 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
880 #define TREE_LANG_FLAG_6(NODE) \
881 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
883 /* Define additional fields and accessors for nodes representing constants. */
885 /* In an INTEGER_CST node. These two together make a 2-word integer.
886 If the data type is signed, the value is sign-extended to 2 words
887 even though not all of them may really be in use.
888 In an unsigned constant shorter than 2 words, the extra bits are 0. */
889 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
890 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
891 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
893 #define INT_CST_LT(A, B) \
894 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
895 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
896 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
898 #define INT_CST_LT_UNSIGNED(A, B) \
899 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
900 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
901 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
902 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
903 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
905 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
906 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
908 #define TREE_FIXED_CST_PTR(NODE) \
909 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
910 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
912 /* In a STRING_CST */
913 /* In C terms, this is sizeof, not strlen. */
914 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
915 #define TREE_STRING_POINTER(NODE) \
916 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
918 /* In a COMPLEX_CST node. */
919 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
920 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
922 /* In a VECTOR_CST node. */
923 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
924 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
925 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
927 /* Define fields and accessors for some special-purpose tree nodes. */
929 #define IDENTIFIER_LENGTH(NODE) \
930 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
931 #define IDENTIFIER_POINTER(NODE) \
932 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
933 #define IDENTIFIER_HASH_VALUE(NODE) \
934 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
936 /* Translate a hash table identifier pointer to a tree_identifier
937 pointer, and vice versa. */
939 #define HT_IDENT_TO_GCC_IDENT(NODE) \
940 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
941 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
943 /* In a TREE_LIST node. */
944 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
945 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
947 /* In a TREE_VEC node. */
948 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
949 #define TREE_VEC_END(NODE) \
950 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
952 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
954 /* In a CONSTRUCTOR node. */
955 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
956 #define CONSTRUCTOR_ELT(NODE,IDX) \
957 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
958 #define CONSTRUCTOR_NELTS(NODE) \
959 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
960 #define CONSTRUCTOR_NO_CLEARING(NODE) \
961 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
963 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
964 value of each element (stored within VAL). IX must be a scratch variable
965 of unsigned integer type. */
966 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
967 for (IX = 0; (IX >= vec_safe_length (V)) \
969 : ((VAL = (*(V))[IX].value), \
973 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
974 the value of each element (stored within VAL) and its index (stored
975 within INDEX). IX must be a scratch variable of unsigned integer type. */
976 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
977 for (IX = 0; (IX >= vec_safe_length (V)) \
979 : (((void) (VAL = (*V)[IX].value)), \
980 (INDEX = (*V)[IX].index), \
984 /* Append a new constructor element to V, with the specified INDEX and VAL. */
985 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
987 constructor_elt _ce___ = {INDEX, VALUE}; \
988 vec_safe_push ((V), _ce___); \
991 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
992 constructor output purposes. */
993 #define CONSTRUCTOR_BITFIELD_P(NODE) \
994 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
996 /* True if NODE is a clobber right hand side, an expression of indeterminate
997 value that clobbers the LHS in a copy instruction. We use a volatile
998 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
999 In particular the volatile flag causes us to not prematurely remove
1000 such clobber instructions. */
1001 #define TREE_CLOBBER_P(NODE) \
1002 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1004 /* Define fields and accessors for some nodes that represent expressions. */
1006 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1007 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1008 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1009 && integer_zerop (TREE_OPERAND (NODE, 0)))
1011 /* In ordinary expression nodes. */
1012 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1013 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1015 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1016 length. Its value includes the length operand itself; that is,
1017 the minimum valid length is 1.
1018 Note that we have to bypass the use of TREE_OPERAND to access
1019 that field to avoid infinite recursion in expanding the macros. */
1020 #define VL_EXP_OPERAND_LENGTH(NODE) \
1021 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1023 /* Nonzero if is_gimple_debug() may possibly hold. */
1024 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1026 /* In a LOOP_EXPR node. */
1027 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1029 /* The source location of this expression. Non-tree_exp nodes such as
1030 decls and constants can be shared among multiple locations, so
1032 #define EXPR_LOCATION(NODE) \
1033 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1034 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1035 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1036 != UNKNOWN_LOCATION)
1037 /* The location to be used in a diagnostic about this expression. Do not
1038 use this macro if the location will be assigned to other expressions. */
1039 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \
1040 ? (NODE)->exp.locus : input_location)
1041 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1042 ? (NODE)->exp.locus : (LOCUS))
1043 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1044 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1046 /* True if a tree is an expression or statement that can have a
1048 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1050 extern void protected_set_expr_location (tree
, location_t
);
1052 /* In a TARGET_EXPR node. */
1053 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1054 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1055 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1057 /* DECL_EXPR accessor. This gives access to the DECL associated with
1058 the given declaration statement. */
1059 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1061 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1063 /* COMPOUND_LITERAL_EXPR accessors. */
1064 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1065 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1066 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1067 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1069 /* SWITCH_EXPR accessors. These give access to the condition, body and
1070 original condition type (before any compiler conversions)
1071 of the switch statement, respectively. */
1072 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1073 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1074 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1076 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1077 of a case label, respectively. */
1078 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1079 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1080 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1081 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1083 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1084 corresponding MEM_REF operands. */
1085 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1086 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1087 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1088 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1089 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1091 /* The operands of a BIND_EXPR. */
1092 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1093 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1094 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1096 /* GOTO_EXPR accessor. This gives access to the label associated with
1097 a goto statement. */
1098 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1100 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1101 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1102 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1104 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1105 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1106 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1107 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1108 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1109 /* Nonzero if we want to create an ASM_INPUT instead of an
1110 ASM_OPERAND with no operands. */
1111 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1112 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1114 /* COND_EXPR accessors. */
1115 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1116 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1117 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1119 /* Accessors for the chains of recurrences. */
1120 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1121 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1122 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1123 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1125 /* LABEL_EXPR accessor. This gives access to the label associated with
1126 the given label expression. */
1127 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1129 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1130 accessors for SSA operands. */
1132 /* CATCH_EXPR accessors. */
1133 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1134 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1136 /* EH_FILTER_EXPR accessors. */
1137 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1138 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1140 /* OBJ_TYPE_REF accessors. */
1141 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1142 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1143 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1145 /* ASSERT_EXPR accessors. */
1146 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1147 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1149 /* CALL_EXPR accessors.
1151 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1152 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1153 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1154 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1156 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1157 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1158 the argument count is zero when checking is enabled. Instead, do
1159 the pointer arithmetic to advance past the 3 fixed operands in a
1160 CALL_EXPR. That produces a valid pointer to just past the end of the
1161 operand array, even if it's not valid to dereference it. */
1162 #define CALL_EXPR_ARGP(NODE) \
1163 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1165 /* TM directives and accessors. */
1166 #define TRANSACTION_EXPR_BODY(NODE) \
1167 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1168 #define TRANSACTION_EXPR_OUTER(NODE) \
1169 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1170 #define TRANSACTION_EXPR_RELAXED(NODE) \
1171 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1173 /* OpenMP directive and clause accessors. */
1175 #define OMP_BODY(NODE) \
1176 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1177 #define OMP_CLAUSES(NODE) \
1178 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1180 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1181 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1183 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1184 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1186 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1187 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1188 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1190 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1191 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1192 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1193 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1194 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1195 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1196 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1198 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1199 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1201 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1203 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1204 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1206 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1208 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1210 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1212 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1213 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1215 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1216 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1218 #define OMP_TARGET_DATA_BODY(NODE) \
1219 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1220 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1221 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1223 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1224 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1226 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1227 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1229 #define OMP_CLAUSE_SIZE(NODE) \
1230 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1234 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1235 #define OMP_CLAUSE_DECL(NODE) \
1236 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1237 OMP_CLAUSE_PRIVATE, \
1238 OMP_CLAUSE__LOOPTEMP_), 0)
1239 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1240 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1241 != UNKNOWN_LOCATION)
1242 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1244 /* True on an OMP_SECTION statement that was the last lexical member.
1245 This status is meaningful in the implementation of lastprivate. */
1246 #define OMP_SECTION_LAST(NODE) \
1247 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1249 /* True on an OMP_PARALLEL statement if it represents an explicit
1250 combined parallel work-sharing constructs. */
1251 #define OMP_PARALLEL_COMBINED(NODE) \
1252 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1254 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1255 as opposed to relaxed. */
1256 #define OMP_ATOMIC_SEQ_CST(NODE) \
1257 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1258 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1260 /* True on a PRIVATE clause if its decl is kept around for debugging
1261 information only and its DECL_VALUE_EXPR is supposed to point
1262 to what it has been remapped to. */
1263 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1264 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1266 /* True on a PRIVATE clause if ctor needs access to outer region's
1268 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1269 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1271 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1272 decl is present in the chain. */
1273 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1274 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1275 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1276 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1277 OMP_CLAUSE_LASTPRIVATE),\
1279 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1280 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1282 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1283 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1284 #define OMP_CLAUSE_IF_EXPR(NODE) \
1285 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1286 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1287 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1288 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1289 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1291 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1292 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1294 #define OMP_CLAUSE_MAP_KIND(NODE) \
1295 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1297 /* Nonzero if this map clause is for array (rather than pointer) based array
1298 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1299 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1300 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1301 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1303 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1304 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1306 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1307 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1308 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1309 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1310 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1311 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1313 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1314 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1315 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1316 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1317 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1318 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1319 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1320 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1321 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1322 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1323 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1324 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1326 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1327 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1328 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1329 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1331 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1332 are always initialized inside of the loop construct, false otherwise. */
1333 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1334 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1336 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1337 are declared inside of the simd construct. */
1338 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1339 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1341 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1342 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1344 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1345 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1347 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1348 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1350 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1351 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1352 OMP_CLAUSE_THREAD_LIMIT), 0)
1354 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1355 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1357 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1358 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1359 OMP_CLAUSE_DIST_SCHEDULE), 0)
1361 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1362 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1364 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1365 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1367 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1368 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1370 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1371 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1373 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1374 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1376 /* SSA_NAME accessors. */
1378 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1379 if there is no name associated with it. */
1380 #define SSA_NAME_IDENTIFIER(NODE) \
1381 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1382 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1383 ? (NODE)->ssa_name.var \
1384 : DECL_NAME ((NODE)->ssa_name.var)) \
1387 /* Returns the variable being referenced. This can be NULL_TREE for
1388 temporaries not associated with any user variable.
1389 Once released, this is the only field that can be relied upon. */
1390 #define SSA_NAME_VAR(NODE) \
1391 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1392 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1393 ? NULL_TREE : (NODE)->ssa_name.var)
1395 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1396 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1398 /* Returns the statement which defines this SSA name. */
1399 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1401 /* Returns the SSA version number of this SSA name. Note that in
1402 tree SSA, version numbers are not per variable and may be recycled. */
1403 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1405 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1406 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1408 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1409 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1411 /* Nonzero if this SSA_NAME expression is currently on the free list of
1412 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1413 has no meaning for an SSA_NAME. */
1414 #define SSA_NAME_IN_FREE_LIST(NODE) \
1415 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1417 /* Nonzero if this SSA_NAME is the default definition for the
1418 underlying symbol. A default SSA name is created for symbol S if
1419 the very first reference to S in the function is a read operation.
1420 Default definitions are always created by an empty statement and
1421 belong to no basic block. */
1422 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1423 SSA_NAME_CHECK (NODE)->base.default_def_flag
1425 /* Attributes for SSA_NAMEs for pointer-type variables. */
1426 #define SSA_NAME_PTR_INFO(N) \
1427 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1429 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1430 #define SSA_NAME_RANGE_INFO(N) \
1431 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1433 /* Return the immediate_use information for an SSA_NAME. */
1434 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1436 #define OMP_CLAUSE_CODE(NODE) \
1437 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1439 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1440 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1442 #define OMP_CLAUSE_OPERAND(NODE, I) \
1443 OMP_CLAUSE_ELT_CHECK (NODE, I)
1445 /* In a BLOCK node. */
1446 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1447 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1448 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1449 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1450 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1451 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1452 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1453 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1454 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1455 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1456 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1458 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1459 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1461 /* An index number for this block. These values are not guaranteed to
1462 be unique across functions -- whether or not they are depends on
1463 the debugging output format in use. */
1464 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1466 /* If block reordering splits a lexical block into discontiguous
1467 address ranges, we'll make a copy of the original block.
1469 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1470 In that case, we have one source block that has been replicated
1471 (through inlining or unrolling) into many logical blocks, and that
1472 these logical blocks have different physical variables in them.
1474 In this case, we have one logical block split into several
1475 non-contiguous address ranges. Most debug formats can't actually
1476 represent this idea directly, so we fake it by creating multiple
1477 logical blocks with the same variables in them. However, for those
1478 that do support non-contiguous regions, these allow the original
1479 logical block to be reconstructed, along with the set of address
1482 One of the logical block fragments is arbitrarily chosen to be
1483 the ORIGIN. The other fragments will point to the origin via
1484 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1485 be null. The list of fragments will be chained through
1486 BLOCK_FRAGMENT_CHAIN from the origin. */
1488 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1489 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1491 /* For an inlined function, this gives the location where it was called
1492 from. This is only set in the top level block, which corresponds to the
1493 inlined function scope. This is used in the debug output routines. */
1495 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1497 /* Define fields and accessors for nodes representing data types. */
1499 /* See tree.def for documentation of the use of these fields.
1500 Look at the documentation of the various ..._TYPE tree codes.
1502 Note that the type.values, type.minval, and type.maxval fields are
1503 overloaded and used for different macros in different kinds of types.
1504 Each macro must check to ensure the tree node is of the proper kind of
1505 type. Note also that some of the front-ends also overload these fields,
1506 so they must be checked as well. */
1508 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1509 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1510 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1511 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1512 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1513 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1514 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1515 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1516 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1517 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1519 /* Vector types need to check target flags to determine type. */
1520 extern enum machine_mode
vector_type_mode (const_tree
);
1521 #define TYPE_MODE(NODE) \
1522 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1523 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1524 #define SET_TYPE_MODE(NODE, MODE) \
1525 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1527 /* The "canonical" type for this type node, which is used by frontends to
1528 compare the type for equality with another type. If two types are
1529 equal (based on the semantics of the language), then they will have
1530 equivalent TYPE_CANONICAL entries.
1532 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1533 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1534 be used for comparison against other types. Instead, the type is
1535 said to require structural equality checks, described in
1536 TYPE_STRUCTURAL_EQUALITY_P.
1538 For unqualified aggregate and function types the middle-end relies on
1539 TYPE_CANONICAL to tell whether two variables can be assigned
1540 to each other without a conversion. The middle-end also makes sure
1541 to assign the same alias-sets to the type partition with equal
1542 TYPE_CANONICAL of their unqualified variants. */
1543 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1544 /* Indicates that the type node requires structural equality
1545 checks. The compiler will need to look at the composition of the
1546 type to determine whether it is equal to another type, rather than
1547 just comparing canonical type pointers. For instance, we would need
1548 to look at the return and parameter types of a FUNCTION_TYPE
1550 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1551 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1552 type node requires structural equality. */
1553 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1555 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1556 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1558 /* The (language-specific) typed-based alias set for this type.
1559 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1560 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1561 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1562 type can alias objects of any type. */
1563 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1565 /* Nonzero iff the typed-based alias set for this type has been
1567 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1568 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1570 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1572 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1574 /* The alignment necessary for objects of this type.
1575 The value is an int, measured in bits. */
1576 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1578 /* 1 if the alignment for this type was requested by "aligned" attribute,
1579 0 if it is the default for this type. */
1580 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1582 /* The alignment for NODE, in bytes. */
1583 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1585 /* If your language allows you to declare types, and you want debug info
1586 for them, then you need to generate corresponding TYPE_DECL nodes.
1587 These "stub" TYPE_DECL nodes have no name, and simply point at the
1588 type node. You then set the TYPE_STUB_DECL field of the type node
1589 to point back at the TYPE_DECL node. This allows the debug routines
1590 to know that the two nodes represent the same type, so that we only
1591 get one debug info record for them. */
1592 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1594 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1595 the type has BLKmode only because it lacks the alignment required for
1597 #define TYPE_NO_FORCE_BLK(NODE) \
1598 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1600 /* Nonzero in a type considered volatile as a whole. */
1601 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1603 /* Nonzero in a type considered atomic as a whole. */
1604 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1606 /* Means this type is const-qualified. */
1607 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1609 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1611 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1613 /* If nonzero, type's name shouldn't be emitted into debug info. */
1614 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1616 /* The address space the type is in. */
1617 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1619 /* Encode/decode the named memory support as part of the qualifier. If more
1620 than 8 qualifiers are added, these macros need to be adjusted. */
1621 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1622 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1624 /* Return all qualifiers except for the address space qualifiers. */
1625 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1627 /* Only keep the address space out of the qualifiers and discard the other
1629 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1631 /* The set of type qualifiers for this type. */
1632 #define TYPE_QUALS(NODE) \
1633 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1634 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1635 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1636 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1637 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1639 /* The same as TYPE_QUALS without the address space qualifications. */
1640 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1641 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1642 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1643 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1644 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1646 /* The same as TYPE_QUALS without the address space and atomic
1648 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1649 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1650 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1651 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1653 /* These flags are available for each language front end to use internally. */
1654 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1655 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1656 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1657 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1658 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1659 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1660 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1662 /* Used to keep track of visited nodes in tree traversals. This is set to
1663 0 by copy_node and make_node. */
1664 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1666 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1667 that distinguish string from array of char).
1668 If set in a INTEGER_TYPE, indicates a character type. */
1669 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1671 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1672 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1673 (((unsigned HOST_WIDE_INT) 1) \
1674 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1676 /* Set precision to n when we have 2^n sub-parts of the vector. */
1677 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1678 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1680 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1681 about missing conversions to other vector types of the same size. */
1682 #define TYPE_VECTOR_OPAQUE(NODE) \
1683 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1685 /* Indicates that objects of this type must be initialized by calling a
1686 function when they are created. */
1687 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1688 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1690 /* Indicates that a UNION_TYPE object should be passed the same way that
1691 the first union alternative would be passed, or that a RECORD_TYPE
1692 object should be passed the same way that the first (and only) member
1694 #define TYPE_TRANSPARENT_AGGR(NODE) \
1695 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1697 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1698 address of a component of the type. This is the counterpart of
1699 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1700 #define TYPE_NONALIASED_COMPONENT(NODE) \
1701 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1703 /* Indicated that objects of this type should be laid out in as
1704 compact a way as possible. */
1705 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1707 /* Used by type_contains_placeholder_p to avoid recomputation.
1708 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1709 this field directly. */
1710 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1711 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1713 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1714 #define TYPE_FINAL_P(NODE) \
1715 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1717 /* The debug output functions use the symtab union field to store
1718 information specific to the debugging format. The different debug
1719 output hooks store different types in the union field. These three
1720 macros are used to access different fields in the union. The debug
1721 hooks are responsible for consistently using only a specific
1724 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1725 hold the type's number in the generated stabs. */
1726 #define TYPE_SYMTAB_ADDRESS(NODE) \
1727 (TYPE_CHECK (NODE)->type_common.symtab.address)
1729 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1730 hold struct/union type tag names. */
1731 #define TYPE_SYMTAB_POINTER(NODE) \
1732 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1734 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1735 in dwarf2out.c to point to the DIE generated for the type. */
1736 #define TYPE_SYMTAB_DIE(NODE) \
1737 (TYPE_CHECK (NODE)->type_common.symtab.die)
1739 /* The garbage collector needs to know the interpretation of the
1740 symtab field. These constants represent the different types in the
1743 #define TYPE_SYMTAB_IS_ADDRESS (0)
1744 #define TYPE_SYMTAB_IS_POINTER (1)
1745 #define TYPE_SYMTAB_IS_DIE (2)
1747 #define TYPE_LANG_SPECIFIC(NODE) \
1748 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1750 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1751 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1752 #define TYPE_FIELDS(NODE) \
1753 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1754 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1755 #define TYPE_ARG_TYPES(NODE) \
1756 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1757 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1759 #define TYPE_METHODS(NODE) \
1760 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1761 #define TYPE_VFIELD(NODE) \
1762 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1763 #define TYPE_METHOD_BASETYPE(NODE) \
1764 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1765 #define TYPE_OFFSET_BASETYPE(NODE) \
1766 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1767 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1768 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1769 #define TYPE_NEXT_PTR_TO(NODE) \
1770 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1771 #define TYPE_NEXT_REF_TO(NODE) \
1772 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1773 #define TYPE_MIN_VALUE(NODE) \
1774 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1775 #define TYPE_MAX_VALUE(NODE) \
1776 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1778 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1779 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1781 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1782 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1784 /* For record and union types, information about this type, as a base type
1786 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1788 /* For non record and union types, used in a language-dependent way. */
1789 #define TYPE_LANG_SLOT_1(NODE) \
1790 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1792 /* Define accessor macros for information about type inheritance
1795 A "basetype" means a particular usage of a data type for inheritance
1796 in another type. Each such basetype usage has its own "binfo"
1797 object to describe it. The binfo object is a TREE_VEC node.
1799 Inheritance is represented by the binfo nodes allocated for a
1800 given type. For example, given types C and D, such that D is
1801 inherited by C, 3 binfo nodes will be allocated: one for describing
1802 the binfo properties of C, similarly one for D, and one for
1803 describing the binfo properties of D as a base type for C.
1804 Thus, given a pointer to class C, one can get a pointer to the binfo
1805 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1807 /* BINFO specific flags. */
1809 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1810 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1812 /* Flags for language dependent use. */
1813 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1814 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1815 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1816 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1817 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1818 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1819 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1821 /* The actual data type node being inherited in this basetype. */
1822 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1824 /* The offset where this basetype appears in its containing type.
1825 BINFO_OFFSET slot holds the offset (in bytes)
1826 from the base of the complete object to the base of the part of the
1827 object that is allocated on behalf of this `type'.
1828 This is always 0 except when there is multiple inheritance. */
1830 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1831 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1833 /* The virtual function table belonging to this basetype. Virtual
1834 function tables provide a mechanism for run-time method dispatching.
1835 The entries of a virtual function table are language-dependent. */
1837 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1839 /* The virtual functions in the virtual function table. This is
1840 a TREE_LIST that is used as an initial approximation for building
1841 a virtual function table for this basetype. */
1842 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1844 /* A vector of binfos for the direct basetypes inherited by this
1847 If this basetype describes type D as inherited in C, and if the
1848 basetypes of D are E and F, then this vector contains binfos for
1849 inheritance of E and F by C. */
1850 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1852 /* The number of basetypes for NODE. */
1853 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1855 /* Accessor macro to get to the Nth base binfo of this binfo. */
1856 #define BINFO_BASE_BINFO(NODE,N) \
1857 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1858 #define BINFO_BASE_ITERATE(NODE,N,B) \
1859 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1860 #define BINFO_BASE_APPEND(NODE,T) \
1861 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1863 /* For a BINFO record describing a virtual base class, i.e., one where
1864 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1865 base. The actual contents are language-dependent. In the C++
1866 front-end this field is an INTEGER_CST giving an offset into the
1867 vtable where the offset to the virtual base can be found. */
1868 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1870 /* Indicates the accesses this binfo has to its bases. The values are
1871 access_public_node, access_protected_node or access_private_node.
1872 If this array is not present, public access is implied. */
1873 #define BINFO_BASE_ACCESSES(NODE) \
1874 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1876 #define BINFO_BASE_ACCESS(NODE,N) \
1877 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1878 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1879 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1881 /* The index in the VTT where this subobject's sub-VTT can be found.
1882 NULL_TREE if there is no sub-VTT. */
1883 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1885 /* The index in the VTT where the vptr for this subobject can be
1886 found. NULL_TREE if there is no secondary vptr in the VTT. */
1887 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1889 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1890 inheriting this base for non-virtual bases. For virtual bases it
1891 points either to the binfo for which this is a primary binfo, or to
1892 the binfo of the most derived type. */
1893 #define BINFO_INHERITANCE_CHAIN(NODE) \
1894 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1897 /* Define fields and accessors for nodes representing declared names. */
1899 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1900 have an associated SSA name. */
1901 #define SSA_VAR_P(DECL) \
1902 (TREE_CODE (DECL) == VAR_DECL \
1903 || TREE_CODE (DECL) == PARM_DECL \
1904 || TREE_CODE (DECL) == RESULT_DECL \
1905 || TREE_CODE (DECL) == SSA_NAME)
1908 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1910 /* This is the name of the object as written by the user.
1911 It is an IDENTIFIER_NODE. */
1912 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1914 /* Every ..._DECL node gets a unique number. */
1915 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1917 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1919 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1921 /* Every ..._DECL node gets a unique number that stays the same even
1922 when the decl is copied by the inliner once it is set. */
1923 #define DECL_PT_UID(NODE) \
1924 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1925 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1926 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1927 #define SET_DECL_PT_UID(NODE, UID) \
1928 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1929 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1930 be preserved when copyin the decl. */
1931 #define DECL_PT_UID_SET_P(NODE) \
1932 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1934 /* These two fields describe where in the source code the declaration
1935 was. If the declaration appears in several places (as for a C
1936 function that is declared first and then defined later), this
1937 information should refer to the definition. */
1938 #define DECL_SOURCE_LOCATION(NODE) \
1939 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1940 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1941 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1942 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1943 /* This accessor returns TRUE if the decl it operates on was created
1944 by a front-end or back-end rather than by user code. In this case
1945 builtin-ness is indicated by source location. */
1946 #define DECL_IS_BUILTIN(DECL) \
1947 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1949 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1950 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1951 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1952 nodes, this points to either the FUNCTION_DECL for the containing
1953 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1954 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1955 scope". In particular, for VAR_DECLs which are virtual table pointers
1956 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1958 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1959 #define DECL_FIELD_CONTEXT(NODE) \
1960 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1962 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1963 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1965 /* For any sort of a ..._DECL node, this points to the original (abstract)
1966 decl node which this decl is an inlined/cloned instance of, or else it
1967 is NULL indicating that this decl is not an instance of some other decl.
1969 The C front-end also uses this in a nested declaration of an inline
1970 function, to point back to the definition. */
1971 #define DECL_ABSTRACT_ORIGIN(NODE) \
1972 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1974 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1975 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1976 #define DECL_ORIGIN(NODE) \
1977 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1979 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1980 inline instance of some original (abstract) decl from an inline function;
1981 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1982 nodes can also have their abstract origin set to themselves. */
1983 #define DECL_FROM_INLINE(NODE) \
1984 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1985 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1987 /* In a DECL this is the field where attributes are stored. */
1988 #define DECL_ATTRIBUTES(NODE) \
1989 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
1991 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1992 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1993 For a VAR_DECL, holds the initial value.
1994 For a PARM_DECL, used for DECL_ARG_TYPE--default
1995 values for parameters are encoded in the type of the function,
1996 not in the PARM_DECL slot.
1997 For a FIELD_DECL, this is used for enumeration values and the C
1998 frontend uses it for temporarily storing bitwidth of bitfields.
2000 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2001 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2003 /* Holds the size of the datum, in bits, as a tree expression.
2004 Need not be constant. */
2005 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2006 /* Likewise for the size in bytes. */
2007 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2008 /* Holds the alignment required for the datum, in bits. */
2009 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2010 /* The alignment of NODE, in bytes. */
2011 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2012 /* Set if the alignment of this DECL has been set by the user, for
2013 example with an 'aligned' attribute. */
2014 #define DECL_USER_ALIGN(NODE) \
2015 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2016 /* Holds the machine mode corresponding to the declaration of a variable or
2017 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2019 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2021 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2022 operation it is. Note, however, that this field is overloaded, with
2023 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2024 checked before any access to the former. */
2025 #define DECL_FUNCTION_CODE(NODE) \
2026 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2028 #define DECL_FUNCTION_PERSONALITY(NODE) \
2029 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2031 /* Nonzero for a given ..._DECL node means that the name of this node should
2032 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2033 the associated type should be ignored. For a FUNCTION_DECL, the body of
2034 the function should also be ignored. */
2035 #define DECL_IGNORED_P(NODE) \
2036 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2038 /* Nonzero for a given ..._DECL node means that this node represents an
2039 "abstract instance" of the given declaration (e.g. in the original
2040 declaration of an inline function). When generating symbolic debugging
2041 information, we mustn't try to generate any address information for nodes
2042 marked as "abstract instances" because we don't actually generate
2043 any code or allocate any data space for such instances. */
2044 #define DECL_ABSTRACT(NODE) \
2045 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2047 /* Language-specific decl information. */
2048 #define DECL_LANG_SPECIFIC(NODE) \
2049 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2051 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2052 do not allocate storage, and refer to a definition elsewhere. Note that
2053 this does not necessarily imply the entity represented by NODE
2054 has no program source-level definition in this translation unit. For
2055 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2056 DECL_EXTERNAL may be true simultaneously; that can be the case for
2057 a C99 "extern inline" function. */
2058 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2060 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2061 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2063 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2065 Also set in some languages for variables, etc., outside the normal
2066 lexical scope, such as class instance variables. */
2067 #define DECL_NONLOCAL(NODE) \
2068 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2070 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2071 Used in FIELD_DECLs for vtable pointers.
2072 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2073 #define DECL_VIRTUAL_P(NODE) \
2074 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2076 /* Used to indicate that this DECL represents a compiler-generated entity. */
2077 #define DECL_ARTIFICIAL(NODE) \
2078 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2080 /* Additional flags for language-specific uses. */
2081 #define DECL_LANG_FLAG_0(NODE) \
2082 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2083 #define DECL_LANG_FLAG_1(NODE) \
2084 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2085 #define DECL_LANG_FLAG_2(NODE) \
2086 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2087 #define DECL_LANG_FLAG_3(NODE) \
2088 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2089 #define DECL_LANG_FLAG_4(NODE) \
2090 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2091 #define DECL_LANG_FLAG_5(NODE) \
2092 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2093 #define DECL_LANG_FLAG_6(NODE) \
2094 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2095 #define DECL_LANG_FLAG_7(NODE) \
2096 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2097 #define DECL_LANG_FLAG_8(NODE) \
2098 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2100 /* Nonzero for a scope which is equal to file scope. */
2101 #define SCOPE_FILE_SCOPE_P(EXP) \
2102 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2103 /* Nonzero for a decl which is at file scope. */
2104 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2105 /* Nonzero for a type which is at file scope. */
2106 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2108 /* Nonzero for a decl that is decorated using attribute used.
2109 This indicates to compiler tools that this decl needs to be preserved. */
2110 #define DECL_PRESERVE_P(DECL) \
2111 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2113 /* For function local variables of COMPLEX and VECTOR types,
2114 indicates that the variable is not aliased, and that all
2115 modifications to the variable have been adjusted so that
2116 they are killing assignments. Thus the variable may now
2117 be treated as a GIMPLE register, and use real instead of
2118 virtual ops in SSA form. */
2119 #define DECL_GIMPLE_REG_P(DECL) \
2120 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2122 extern tree
decl_value_expr_lookup (tree
);
2123 extern void decl_value_expr_insert (tree
, tree
);
2125 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2126 if transformations have made this more complicated than evaluating the
2127 decl itself. This should only be used for debugging; once this field has
2128 been set, the decl itself may not legitimately appear in the function. */
2129 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2130 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2131 ->decl_common.decl_flag_2)
2132 #define DECL_VALUE_EXPR(NODE) \
2133 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2134 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2135 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2137 /* Holds the RTL expression for the value of a variable or function.
2138 This value can be evaluated lazily for functions, variables with
2139 static storage duration, and labels. */
2140 #define DECL_RTL(NODE) \
2141 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2142 ? (NODE)->decl_with_rtl.rtl \
2143 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2145 /* Set the DECL_RTL for NODE to RTL. */
2146 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2148 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2149 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2151 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2152 #define DECL_RTL_SET_P(NODE) \
2153 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2155 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2156 NODE1, it will not be set for NODE2; this is a lazy copy. */
2157 #define COPY_DECL_RTL(NODE1, NODE2) \
2158 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2159 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2161 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2162 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2164 #if (GCC_VERSION >= 2007)
2165 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2166 ({ tree const __d = (decl); \
2167 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2168 /* Dereference it so the compiler knows it can't be NULL even \
2169 without assertion checking. */ \
2170 &*DECL_RTL_IF_SET (__d); })
2172 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2175 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2176 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2178 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2179 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2180 of the structure. */
2181 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2183 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2184 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2185 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2186 natural alignment of the field's type). */
2187 #define DECL_FIELD_BIT_OFFSET(NODE) \
2188 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2190 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2191 if so, the type that was originally specified for it.
2192 TREE_TYPE may have been modified (in finish_struct). */
2193 #define DECL_BIT_FIELD_TYPE(NODE) \
2194 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2196 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2197 representative FIELD_DECL. */
2198 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2199 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2201 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2202 if nonzero, indicates that the field occupies the type. */
2203 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2205 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2206 DECL_FIELD_OFFSET which are known to be always zero.
2207 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2209 #define DECL_OFFSET_ALIGN(NODE) \
2210 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2212 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2213 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2214 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2216 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2217 which this FIELD_DECL is defined. This information is needed when
2218 writing debugging information about vfield and vbase decls for C++. */
2219 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2221 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2222 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2224 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2226 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2228 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2229 this component. This makes it possible for Type-Based Alias Analysis
2230 to disambiguate accesses to this field with indirect accesses using
2233 struct S { int i; } s;
2236 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2238 From the implementation's viewpoint, the alias set of the type of the
2239 field 'i' (int) will not be recorded as a subset of that of the type of
2240 's' (struct S) in record_component_aliases. The counterpart is that
2241 accesses to s.i must not be given the alias set of the type of 'i'
2242 (int) but instead directly that of the type of 's' (struct S). */
2243 #define DECL_NONADDRESSABLE_P(NODE) \
2244 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2246 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2247 dense, unique within any one function, and may be used to index arrays.
2248 If the value is -1, then no UID has been assigned. */
2249 #define LABEL_DECL_UID(NODE) \
2250 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2252 /* In a LABEL_DECL, the EH region number for which the label is the
2253 post_landing_pad. */
2254 #define EH_LANDING_PAD_NR(NODE) \
2255 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2257 /* For a PARM_DECL, records the data type used to pass the argument,
2258 which may be different from the type seen in the program. */
2259 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2261 /* For PARM_DECL, holds an RTL for the stack slot or register
2262 where the data was actually passed. */
2263 #define DECL_INCOMING_RTL(NODE) \
2264 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2266 /* Nonzero for a given ..._DECL node means that no warnings should be
2267 generated just because this node is unused. */
2268 #define DECL_IN_SYSTEM_HEADER(NODE) \
2269 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2271 /* Used to indicate that the linkage status of this DECL is not yet known,
2272 so it should not be output now. */
2273 #define DECL_DEFER_OUTPUT(NODE) \
2274 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2276 /* In a VAR_DECL that's static,
2277 nonzero if the space is in the text section. */
2278 #define DECL_IN_TEXT_SECTION(NODE) \
2279 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2281 /* In a VAR_DECL that's static,
2282 nonzero if it belongs to the global constant pool. */
2283 #define DECL_IN_CONSTANT_POOL(NODE) \
2284 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2286 /* Nonzero for a given ..._DECL node means that this node should be
2287 put in .common, if possible. If a DECL_INITIAL is given, and it
2288 is not error_mark_node, then the decl cannot be put in .common. */
2289 #define DECL_COMMON(NODE) \
2290 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2292 /* In a VAR_DECL, nonzero if the decl is a register variable with
2293 an explicit asm specification. */
2294 #define DECL_HARD_REGISTER(NODE) \
2295 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2297 /* Used to indicate that this DECL has weak linkage. */
2298 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2300 /* Used to indicate that the DECL is a dllimport. */
2301 #define DECL_DLLIMPORT_P(NODE) \
2302 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2304 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2305 not be put out unless it is needed in this translation unit.
2306 Entities like this are shared across translation units (like weak
2307 entities), but are guaranteed to be generated by any translation
2308 unit that needs them, and therefore need not be put out anywhere
2309 where they are not needed. DECL_COMDAT is just a hint to the
2310 back-end; it is up to front-ends which set this flag to ensure
2311 that there will never be any harm, other than bloat, in putting out
2312 something which is DECL_COMDAT. */
2313 #define DECL_COMDAT(NODE) \
2314 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2316 #define DECL_COMDAT_GROUP(NODE) \
2317 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2319 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2320 multiple translation units should be merged. */
2321 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2323 /* The name of the object as the assembler will see it (but before any
2324 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2325 as DECL_NAME. It is an IDENTIFIER_NODE. */
2326 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2328 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2329 This is true of all DECL nodes except FIELD_DECL. */
2330 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2331 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2333 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2334 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2336 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2337 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2338 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2340 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2341 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2342 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2344 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2345 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2346 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2347 semantics of using this macro, are different than saying:
2349 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2351 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2353 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2354 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2355 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2356 DECL_ASSEMBLER_NAME (DECL1)) \
2359 /* Records the section name in a section attribute. Used to pass
2360 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2361 #define DECL_SECTION_NAME(NODE) \
2362 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2364 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2365 this variable in a BIND_EXPR. */
2366 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2367 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2369 /* Value of the decls's visibility attribute */
2370 #define DECL_VISIBILITY(NODE) \
2371 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2373 /* Nonzero means that the decl had its visibility specified rather than
2375 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2376 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2378 /* In a VAR_DECL, the model to use if the data should be allocated from
2379 thread-local storage. */
2380 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2382 /* In a VAR_DECL, nonzero if the data should be allocated from
2383 thread-local storage. */
2384 #define DECL_THREAD_LOCAL_P(NODE) \
2385 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2387 /* In a non-local VAR_DECL with static storage duration, true if the
2388 variable has an initialization priority. If false, the variable
2389 will be initialized at the DEFAULT_INIT_PRIORITY. */
2390 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2391 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2393 /* Specify whether the section name was set by user or by
2394 compiler via -ffunction-sections. */
2395 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2396 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2398 extern tree
decl_debug_expr_lookup (tree
);
2399 extern void decl_debug_expr_insert (tree
, tree
);
2401 /* For VAR_DECL, this is set to an expression that it was split from. */
2402 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2403 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2404 #define DECL_DEBUG_EXPR(NODE) \
2405 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2407 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2408 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2410 extern priority_type
decl_init_priority_lookup (tree
);
2411 extern priority_type
decl_fini_priority_lookup (tree
);
2412 extern void decl_init_priority_insert (tree
, priority_type
);
2413 extern void decl_fini_priority_insert (tree
, priority_type
);
2415 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2417 #define DECL_INIT_PRIORITY(NODE) \
2418 (decl_init_priority_lookup (NODE))
2419 /* Set the initialization priority for NODE to VAL. */
2420 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2421 (decl_init_priority_insert (NODE, VAL))
2423 /* For a FUNCTION_DECL the finalization priority of NODE. */
2424 #define DECL_FINI_PRIORITY(NODE) \
2425 (decl_fini_priority_lookup (NODE))
2426 /* Set the finalization priority for NODE to VAL. */
2427 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2428 (decl_fini_priority_insert (NODE, VAL))
2430 /* The initialization priority for entities for which no explicit
2431 initialization priority has been specified. */
2432 #define DEFAULT_INIT_PRIORITY 65535
2434 /* The maximum allowed initialization priority. */
2435 #define MAX_INIT_PRIORITY 65535
2437 /* The largest priority value reserved for use by system runtime
2439 #define MAX_RESERVED_INIT_PRIORITY 100
2441 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2442 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2443 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2445 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2446 #define DECL_NONLOCAL_FRAME(NODE) \
2447 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2449 /* This field is used to reference anything in decl.result and is meant only
2450 for use by the garbage collector. */
2451 #define DECL_RESULT_FLD(NODE) \
2452 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2454 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2455 Before the struct containing the FUNCTION_DECL is laid out,
2456 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2457 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2458 function. When the class is laid out, this pointer is changed
2459 to an INTEGER_CST node which is suitable for use as an index
2460 into the virtual function table.
2461 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2462 #define DECL_VINDEX(NODE) \
2463 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2465 /* In FUNCTION_DECL, holds the decl for the return value. */
2466 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2468 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2469 #define DECL_UNINLINABLE(NODE) \
2470 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2472 /* In a FUNCTION_DECL, the saved representation of the body of the
2474 #define DECL_SAVED_TREE(NODE) \
2475 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2477 /* Nonzero in a FUNCTION_DECL means this function should be treated
2478 as if it were a malloc, meaning it returns a pointer that is
2480 #define DECL_IS_MALLOC(NODE) \
2481 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2483 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2484 C++ operator new, meaning that it returns a pointer for which we
2485 should not use type based aliasing. */
2486 #define DECL_IS_OPERATOR_NEW(NODE) \
2487 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2489 /* Nonzero in a FUNCTION_DECL means this function may return more
2491 #define DECL_IS_RETURNS_TWICE(NODE) \
2492 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2494 /* Nonzero in a FUNCTION_DECL means this function should be treated
2495 as "pure" function (like const function, but may read global memory). */
2496 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2498 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2499 the const or pure function may not terminate. When this is nonzero
2500 for a const or pure function, it can be dealt with by cse passes
2501 but cannot be removed by dce passes since you are not allowed to
2502 change an infinite looping program into one that terminates without
2504 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2505 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2507 /* Nonzero in a FUNCTION_DECL means this function should be treated
2508 as "novops" function (function that does not read global memory,
2509 but may have arbitrary side effects). */
2510 #define DECL_IS_NOVOPS(NODE) \
2511 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2513 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2514 at the beginning or end of execution. */
2515 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2516 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2518 #define DECL_STATIC_DESTRUCTOR(NODE) \
2519 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2521 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2522 be instrumented with calls to support routines. */
2523 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2524 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2526 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2527 disabled in this function. */
2528 #define DECL_NO_LIMIT_STACK(NODE) \
2529 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2531 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2532 #define DECL_STATIC_CHAIN(NODE) \
2533 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2535 /* Nonzero for a decl that cgraph has decided should be inlined into
2536 at least one call site. It is not meaningful to look at this
2537 directly; always use cgraph_function_possibly_inlined_p. */
2538 #define DECL_POSSIBLY_INLINED(DECL) \
2539 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2541 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2542 such as via the `inline' keyword in C/C++. This flag controls the linkage
2543 semantics of 'inline' */
2544 #define DECL_DECLARED_INLINE_P(NODE) \
2545 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2547 /* Nonzero in a FUNCTION_DECL means this function should not get
2548 -Winline warnings. */
2549 #define DECL_NO_INLINE_WARNING_P(NODE) \
2550 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2552 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2553 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2554 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2556 /* Nonzero if a FUNCTION_CODE is a TM load. */
2557 #define BUILTIN_TM_LOAD_P(FN) \
2558 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2560 /* Nonzero if a FUNCTION_CODE is a TM store. */
2561 #define BUILTIN_TM_STORE_P(FN) \
2562 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2564 #define CASE_BUILT_IN_TM_LOAD(FN) \
2565 case BUILT_IN_TM_LOAD_##FN: \
2566 case BUILT_IN_TM_LOAD_RAR_##FN: \
2567 case BUILT_IN_TM_LOAD_RAW_##FN: \
2568 case BUILT_IN_TM_LOAD_RFW_##FN
2570 #define CASE_BUILT_IN_TM_STORE(FN) \
2571 case BUILT_IN_TM_STORE_##FN: \
2572 case BUILT_IN_TM_STORE_WAR_##FN: \
2573 case BUILT_IN_TM_STORE_WAW_##FN
2575 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2576 disregarding size and cost heuristics. This is equivalent to using
2577 the always_inline attribute without the required diagnostics if the
2578 function cannot be inlined. */
2579 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2580 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2582 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2583 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2585 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2586 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2587 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2589 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2590 that describes the status of this function. */
2591 #define DECL_STRUCT_FUNCTION(NODE) \
2592 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2594 /* In a FUNCTION_DECL, nonzero means a built in function of a
2595 standard library or more generally a built in function that is
2596 recognized by optimizers and expanders.
2598 Note that it is different from the DECL_IS_BUILTIN accessor. For
2599 instance, user declared prototypes of C library functions are not
2600 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2601 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2603 /* For a builtin function, identify which part of the compiler defined it. */
2604 #define DECL_BUILT_IN_CLASS(NODE) \
2605 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2607 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2608 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2610 #define DECL_ARGUMENTS(NODE) \
2611 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2612 #define DECL_ARGUMENT_FLD(NODE) \
2613 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2615 /* In FUNCTION_DECL, the function specific target options to use when compiling
2617 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2618 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2620 /* In FUNCTION_DECL, the function specific optimization options to use when
2621 compiling this function. */
2622 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2623 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2625 /* In FUNCTION_DECL, this is set if this function has other versions generated
2626 using "target" attributes. The default version is the one which does not
2627 have any "target" attribute set. */
2628 #define DECL_FUNCTION_VERSIONED(NODE)\
2629 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2631 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2632 Devirtualization machinery uses this knowledge for determing type of the
2633 object constructed. Also we assume that constructor address is not
2635 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2636 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2638 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2639 Devirtualization machinery uses this to track types in destruction. */
2640 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2641 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2643 /* In FUNCTION_DECL that represent an virtual method this is set when
2644 the method is final. */
2645 #define DECL_FINAL_P(NODE)\
2646 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2648 /* The source language of the translation-unit. */
2649 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2650 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2652 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2654 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2655 #define DECL_ORIGINAL_TYPE(NODE) \
2656 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2658 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2659 into stabs. Instead it will generate cross reference ('x') of names.
2660 This uses the same flag as DECL_EXTERNAL. */
2661 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2662 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2664 /* Getter of the imported declaration associated to the
2665 IMPORTED_DECL node. */
2666 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2667 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2669 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2670 To reduce overhead, the nodes containing the statements are not trees.
2671 This avoids the overhead of tree_common on all linked list elements.
2673 Use the interface in tree-iterator.h to access this node. */
2675 #define STATEMENT_LIST_HEAD(NODE) \
2676 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2677 #define STATEMENT_LIST_TAIL(NODE) \
2678 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2680 #define TREE_OPTIMIZATION(NODE) \
2681 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2683 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2684 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2686 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2687 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2689 /* Return a tree node that encapsulates the optimization options in OPTS. */
2690 extern tree
build_optimization_node (struct gcc_options
*opts
);
2692 extern void init_tree_optimization_optabs (tree
);
2694 #define TREE_TARGET_OPTION(NODE) \
2695 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2697 /* Return a tree node that encapsulates the target options in OPTS. */
2698 extern tree
build_target_option_node (struct gcc_options
*opts
);
2700 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2703 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2705 if (TREE_CODE (__t
) != __c
)
2706 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2711 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2714 if (TREE_CODE (__t
) == __c
)
2715 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2720 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2721 enum tree_code __c1
, enum tree_code __c2
)
2723 if (TREE_CODE (__t
) != __c1
2724 && TREE_CODE (__t
) != __c2
)
2725 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2730 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2731 enum tree_code __c1
, enum tree_code __c2
)
2733 if (TREE_CODE (__t
) == __c1
2734 || TREE_CODE (__t
) == __c2
)
2735 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2740 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2741 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2743 if (TREE_CODE (__t
) != __c1
2744 && TREE_CODE (__t
) != __c2
2745 && TREE_CODE (__t
) != __c3
)
2746 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2751 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2752 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2754 if (TREE_CODE (__t
) == __c1
2755 || TREE_CODE (__t
) == __c2
2756 || TREE_CODE (__t
) == __c3
)
2757 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2762 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2763 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2764 enum tree_code __c4
)
2766 if (TREE_CODE (__t
) != __c1
2767 && TREE_CODE (__t
) != __c2
2768 && TREE_CODE (__t
) != __c3
2769 && TREE_CODE (__t
) != __c4
)
2770 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2775 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2776 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2777 enum tree_code __c4
)
2779 if (TREE_CODE (__t
) == __c1
2780 || TREE_CODE (__t
) == __c2
2781 || TREE_CODE (__t
) == __c3
2782 || TREE_CODE (__t
) == __c4
)
2783 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2788 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2789 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2790 enum tree_code __c4
, enum tree_code __c5
)
2792 if (TREE_CODE (__t
) != __c1
2793 && TREE_CODE (__t
) != __c2
2794 && TREE_CODE (__t
) != __c3
2795 && TREE_CODE (__t
) != __c4
2796 && TREE_CODE (__t
) != __c5
)
2797 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2802 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2803 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2804 enum tree_code __c4
, enum tree_code __c5
)
2806 if (TREE_CODE (__t
) == __c1
2807 || TREE_CODE (__t
) == __c2
2808 || TREE_CODE (__t
) == __c3
2809 || TREE_CODE (__t
) == __c4
2810 || TREE_CODE (__t
) == __c5
)
2811 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2816 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2817 const char *__f
, int __l
, const char *__g
)
2819 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2820 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2825 tree_class_check (tree __t
, const enum tree_code_class __class
,
2826 const char *__f
, int __l
, const char *__g
)
2828 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2829 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2834 tree_range_check (tree __t
,
2835 enum tree_code __code1
, enum tree_code __code2
,
2836 const char *__f
, int __l
, const char *__g
)
2838 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2839 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2844 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2845 const char *__f
, int __l
, const char *__g
)
2847 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2848 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2849 if (__t
->omp_clause
.code
!= __code
)
2850 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2855 omp_clause_range_check (tree __t
,
2856 enum omp_clause_code __code1
,
2857 enum omp_clause_code __code2
,
2858 const char *__f
, int __l
, const char *__g
)
2860 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2861 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2862 if ((int) __t
->omp_clause
.code
< (int) __code1
2863 || (int) __t
->omp_clause
.code
> (int) __code2
)
2864 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2868 /* These checks have to be special cased. */
2871 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2873 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2874 if (!IS_EXPR_CODE_CLASS (__c
))
2875 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2879 /* These checks have to be special cased. */
2882 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2885 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2890 tree_vec_elt_check (tree __t
, int __i
,
2891 const char *__f
, int __l
, const char *__g
)
2893 if (TREE_CODE (__t
) != TREE_VEC
)
2894 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2895 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2896 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2897 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2901 omp_clause_elt_check (tree __t
, int __i
,
2902 const char *__f
, int __l
, const char *__g
)
2904 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2905 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2906 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2907 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2908 return &__t
->omp_clause
.ops
[__i
];
2912 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2915 if (TREE_CODE (__t
) != __c
)
2916 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2921 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2924 if (TREE_CODE (__t
) == __c
)
2925 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2930 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2931 enum tree_code __c1
, enum tree_code __c2
)
2933 if (TREE_CODE (__t
) != __c1
2934 && TREE_CODE (__t
) != __c2
)
2935 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2940 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2941 enum tree_code __c1
, enum tree_code __c2
)
2943 if (TREE_CODE (__t
) == __c1
2944 || TREE_CODE (__t
) == __c2
)
2945 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2950 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2951 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2953 if (TREE_CODE (__t
) != __c1
2954 && TREE_CODE (__t
) != __c2
2955 && TREE_CODE (__t
) != __c3
)
2956 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2961 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2962 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2964 if (TREE_CODE (__t
) == __c1
2965 || TREE_CODE (__t
) == __c2
2966 || TREE_CODE (__t
) == __c3
)
2967 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2972 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2973 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2974 enum tree_code __c4
)
2976 if (TREE_CODE (__t
) != __c1
2977 && TREE_CODE (__t
) != __c2
2978 && TREE_CODE (__t
) != __c3
2979 && TREE_CODE (__t
) != __c4
)
2980 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2985 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2986 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2987 enum tree_code __c4
)
2989 if (TREE_CODE (__t
) == __c1
2990 || TREE_CODE (__t
) == __c2
2991 || TREE_CODE (__t
) == __c3
2992 || TREE_CODE (__t
) == __c4
)
2993 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2998 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2999 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3000 enum tree_code __c4
, enum tree_code __c5
)
3002 if (TREE_CODE (__t
) != __c1
3003 && TREE_CODE (__t
) != __c2
3004 && TREE_CODE (__t
) != __c3
3005 && TREE_CODE (__t
) != __c4
3006 && TREE_CODE (__t
) != __c5
)
3007 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3012 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3013 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3014 enum tree_code __c4
, enum tree_code __c5
)
3016 if (TREE_CODE (__t
) == __c1
3017 || TREE_CODE (__t
) == __c2
3018 || TREE_CODE (__t
) == __c3
3019 || TREE_CODE (__t
) == __c4
3020 || TREE_CODE (__t
) == __c5
)
3021 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3026 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3027 const char *__f
, int __l
, const char *__g
)
3029 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3030 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3035 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3036 const char *__f
, int __l
, const char *__g
)
3038 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3039 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3044 tree_range_check (const_tree __t
,
3045 enum tree_code __code1
, enum tree_code __code2
,
3046 const char *__f
, int __l
, const char *__g
)
3048 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3049 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3054 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3055 const char *__f
, int __l
, const char *__g
)
3057 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3058 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3059 if (__t
->omp_clause
.code
!= __code
)
3060 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3065 omp_clause_range_check (const_tree __t
,
3066 enum omp_clause_code __code1
,
3067 enum omp_clause_code __code2
,
3068 const char *__f
, int __l
, const char *__g
)
3070 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3071 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3072 if ((int) __t
->omp_clause
.code
< (int) __code1
3073 || (int) __t
->omp_clause
.code
> (int) __code2
)
3074 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3079 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3081 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3082 if (!IS_EXPR_CODE_CLASS (__c
))
3083 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3088 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3091 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3096 tree_vec_elt_check (const_tree __t
, int __i
,
3097 const char *__f
, int __l
, const char *__g
)
3099 if (TREE_CODE (__t
) != TREE_VEC
)
3100 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3101 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3102 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3103 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3104 //return &__t->vec.a[__i];
3108 omp_clause_elt_check (const_tree __t
, int __i
,
3109 const char *__f
, int __l
, const char *__g
)
3111 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3112 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3113 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3114 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3115 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3120 /* Compute the number of operands in an expression node NODE. For
3121 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3122 otherwise it is looked up from the node's code. */
3124 tree_operand_length (const_tree node
)
3126 if (VL_EXP_CLASS_P (node
))
3127 return VL_EXP_OPERAND_LENGTH (node
);
3129 return TREE_CODE_LENGTH (TREE_CODE (node
));
3132 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3134 /* Special checks for TREE_OPERANDs. */
3136 tree_operand_check (tree __t
, int __i
,
3137 const char *__f
, int __l
, const char *__g
)
3139 const_tree __u
= EXPR_CHECK (__t
);
3140 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3141 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3142 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3146 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3147 const char *__f
, int __l
, const char *__g
)
3149 if (TREE_CODE (__t
) != __code
)
3150 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3151 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3152 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3153 return &__t
->exp
.operands
[__i
];
3157 tree_operand_check (const_tree __t
, int __i
,
3158 const char *__f
, int __l
, const char *__g
)
3160 const_tree __u
= EXPR_CHECK (__t
);
3161 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3162 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3163 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3167 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3168 const char *__f
, int __l
, const char *__g
)
3170 if (TREE_CODE (__t
) != __code
)
3171 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3172 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3173 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3174 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3179 #define error_mark_node global_trees[TI_ERROR_MARK]
3181 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3182 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3183 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3184 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3185 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3187 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3188 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3189 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3190 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3191 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3193 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3194 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3195 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3196 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3197 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3199 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3200 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3201 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3203 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3204 #define integer_one_node global_trees[TI_INTEGER_ONE]
3205 #define integer_three_node global_trees[TI_INTEGER_THREE]
3206 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3207 #define size_zero_node global_trees[TI_SIZE_ZERO]
3208 #define size_one_node global_trees[TI_SIZE_ONE]
3209 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3210 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3211 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3213 /* Base access nodes. */
3214 #define access_public_node global_trees[TI_PUBLIC]
3215 #define access_protected_node global_trees[TI_PROTECTED]
3216 #define access_private_node global_trees[TI_PRIVATE]
3218 #define null_pointer_node global_trees[TI_NULL_POINTER]
3220 #define float_type_node global_trees[TI_FLOAT_TYPE]
3221 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3222 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3224 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3225 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3226 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3227 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3229 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3230 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3231 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3232 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3234 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3236 #define void_type_node global_trees[TI_VOID_TYPE]
3237 /* The C type `void *'. */
3238 #define ptr_type_node global_trees[TI_PTR_TYPE]
3239 /* The C type `const void *'. */
3240 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3241 /* The C type `size_t'. */
3242 #define size_type_node global_trees[TI_SIZE_TYPE]
3243 #define pid_type_node global_trees[TI_PID_TYPE]
3244 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3245 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3246 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3247 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3248 /* The C type `FILE *'. */
3249 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3250 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3252 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3253 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3254 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3256 /* The decimal floating point types. */
3257 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3258 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3259 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3260 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3261 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3262 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3264 /* The fixed-point types. */
3265 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3266 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3267 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3268 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3269 #define sat_unsigned_short_fract_type_node \
3270 global_trees[TI_SAT_USFRACT_TYPE]
3271 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3272 #define sat_unsigned_long_fract_type_node \
3273 global_trees[TI_SAT_ULFRACT_TYPE]
3274 #define sat_unsigned_long_long_fract_type_node \
3275 global_trees[TI_SAT_ULLFRACT_TYPE]
3276 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3277 #define fract_type_node global_trees[TI_FRACT_TYPE]
3278 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3279 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3280 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3281 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3282 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3283 #define unsigned_long_long_fract_type_node \
3284 global_trees[TI_ULLFRACT_TYPE]
3285 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3286 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3287 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3288 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3289 #define sat_unsigned_short_accum_type_node \
3290 global_trees[TI_SAT_USACCUM_TYPE]
3291 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3292 #define sat_unsigned_long_accum_type_node \
3293 global_trees[TI_SAT_ULACCUM_TYPE]
3294 #define sat_unsigned_long_long_accum_type_node \
3295 global_trees[TI_SAT_ULLACCUM_TYPE]
3296 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3297 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3298 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3299 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3300 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3301 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3302 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3303 #define unsigned_long_long_accum_type_node \
3304 global_trees[TI_ULLACCUM_TYPE]
3305 #define qq_type_node global_trees[TI_QQ_TYPE]
3306 #define hq_type_node global_trees[TI_HQ_TYPE]
3307 #define sq_type_node global_trees[TI_SQ_TYPE]
3308 #define dq_type_node global_trees[TI_DQ_TYPE]
3309 #define tq_type_node global_trees[TI_TQ_TYPE]
3310 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3311 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3312 #define usq_type_node global_trees[TI_USQ_TYPE]
3313 #define udq_type_node global_trees[TI_UDQ_TYPE]
3314 #define utq_type_node global_trees[TI_UTQ_TYPE]
3315 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3316 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3317 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3318 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3319 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3320 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3321 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3322 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3323 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3324 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3325 #define ha_type_node global_trees[TI_HA_TYPE]
3326 #define sa_type_node global_trees[TI_SA_TYPE]
3327 #define da_type_node global_trees[TI_DA_TYPE]
3328 #define ta_type_node global_trees[TI_TA_TYPE]
3329 #define uha_type_node global_trees[TI_UHA_TYPE]
3330 #define usa_type_node global_trees[TI_USA_TYPE]
3331 #define uda_type_node global_trees[TI_UDA_TYPE]
3332 #define uta_type_node global_trees[TI_UTA_TYPE]
3333 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3334 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3335 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3336 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3337 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3338 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3339 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3340 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3342 /* The node that should be placed at the end of a parameter list to
3343 indicate that the function does not take a variable number of
3344 arguments. The TREE_VALUE will be void_type_node and there will be
3345 no TREE_CHAIN. Language-independent code should not assume
3346 anything else about this node. */
3347 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3349 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3350 #define MAIN_NAME_P(NODE) \
3351 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3353 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3355 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3356 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3358 /* Default/current target options (TARGET_OPTION_NODE). */
3359 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3360 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3362 /* Default tree list option(), optimize() pragmas to be linked into the
3364 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3365 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3367 #define char_type_node integer_types[itk_char]
3368 #define signed_char_type_node integer_types[itk_signed_char]
3369 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3370 #define short_integer_type_node integer_types[itk_short]
3371 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3372 #define integer_type_node integer_types[itk_int]
3373 #define unsigned_type_node integer_types[itk_unsigned_int]
3374 #define long_integer_type_node integer_types[itk_long]
3375 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3376 #define long_long_integer_type_node integer_types[itk_long_long]
3377 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3378 #define int128_integer_type_node integer_types[itk_int128]
3379 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3381 #define NULL_TREE (tree) NULL
3383 /* True if NODE is an erroneous expression. */
3385 #define error_operand_p(NODE) \
3386 ((NODE) == error_mark_node \
3387 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3389 extern tree
decl_assembler_name (tree
);
3391 /* Compute the number of bytes occupied by 'node'. This routine only
3392 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3394 extern size_t tree_size (const_tree
);
3396 /* Compute the number of bytes occupied by a tree with code CODE. This
3397 function cannot be used for TREE_VEC codes, which are of variable
3399 extern size_t tree_code_size (enum tree_code
);
3401 /* Allocate and return a new UID from the DECL_UID namespace. */
3402 extern int allocate_decl_uid (void);
3404 /* Lowest level primitive for allocating a node.
3405 The TREE_CODE is the only argument. Contents are initialized
3406 to zero except for a few of the common fields. */
3408 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3409 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3411 /* Make a copy of a node, with all the same contents. */
3413 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3414 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3416 /* Make a copy of a chain of TREE_LIST nodes. */
3418 extern tree
copy_list (tree
);
3420 /* Make a CASE_LABEL_EXPR. */
3422 extern tree
build_case_label (tree
, tree
, tree
);
3425 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3426 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3428 /* Make a TREE_VEC. */
3430 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3431 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3433 /* Grow a TREE_VEC. */
3435 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3436 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3438 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3439 The name is supplied as a char *. */
3441 extern tree
get_identifier (const char *);
3443 #if GCC_VERSION >= 3000
3444 #define get_identifier(str) \
3445 (__builtin_constant_p (str) \
3446 ? get_identifier_with_length ((str), strlen (str)) \
3447 : get_identifier (str))
3451 /* Identical to get_identifier, except that the length is assumed
3454 extern tree
get_identifier_with_length (const char *, size_t);
3456 /* If an identifier with the name TEXT (a null-terminated string) has
3457 previously been referred to, return that node; otherwise return
3460 extern tree
maybe_get_identifier (const char *);
3462 /* Construct various types of nodes. */
3464 extern tree
build_nt (enum tree_code
, ...);
3465 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3467 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3468 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3469 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3470 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3471 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3472 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3473 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3474 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3475 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3476 tree MEM_STAT_DECL
);
3477 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3478 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3479 tree MEM_STAT_DECL
);
3480 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3482 /* _loc versions of build[1-5]. */
3485 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3486 tree arg1 MEM_STAT_DECL
)
3488 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3489 if (CAN_HAVE_LOCATION_P (t
))
3490 SET_EXPR_LOCATION (t
, loc
);
3493 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3496 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3497 tree arg1 MEM_STAT_DECL
)
3499 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3500 if (CAN_HAVE_LOCATION_P (t
))
3501 SET_EXPR_LOCATION (t
, loc
);
3504 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3507 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3508 tree arg1
, tree arg2 MEM_STAT_DECL
)
3510 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3511 if (CAN_HAVE_LOCATION_P (t
))
3512 SET_EXPR_LOCATION (t
, loc
);
3515 #define build3_loc(l,c,t1,t2,t3,t4) \
3516 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3519 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3520 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3522 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3523 if (CAN_HAVE_LOCATION_P (t
))
3524 SET_EXPR_LOCATION (t
, loc
);
3527 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3528 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3531 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3532 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3534 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3535 arg4 PASS_MEM_STAT
);
3536 if (CAN_HAVE_LOCATION_P (t
))
3537 SET_EXPR_LOCATION (t
, loc
);
3540 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3541 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3543 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3544 #define build_var_debug_value(t1,t2) \
3545 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3547 /* Constructs double_int from tree CST. */
3549 static inline double_int
3550 tree_to_double_int (const_tree cst
)
3552 return TREE_INT_CST (cst
);
3555 extern tree
double_int_to_tree (tree
, double_int
);
3556 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
3557 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
3559 /* Create an INT_CST node with a CST value zero extended. */
3562 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
3564 return double_int_to_tree (type
, double_int::from_uhwi (cst
));
3567 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3568 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3569 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3570 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3571 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3572 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3573 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3574 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3575 extern tree
build_vector_from_val (tree
, tree
);
3576 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3577 extern tree
build_constructor_single (tree
, tree
, tree
);
3578 extern tree
build_constructor_from_list (tree
, tree
);
3579 extern tree
build_constructor_va (tree
, int, ...);
3580 extern tree
build_real_from_int_cst (tree
, const_tree
);
3581 extern tree
build_complex (tree
, tree
, tree
);
3582 extern tree
build_one_cst (tree
);
3583 extern tree
build_minus_one_cst (tree
);
3584 extern tree
build_all_ones_cst (tree
);
3585 extern tree
build_zero_cst (tree
);
3586 extern tree
build_string (int, const char *);
3587 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3588 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3589 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3590 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3591 extern tree
build_decl_stat (location_t
, enum tree_code
,
3592 tree
, tree MEM_STAT_DECL
);
3593 extern tree
build_fn_decl (const char *, tree
);
3594 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3595 extern tree
build_translation_unit_decl (tree
);
3596 extern tree
build_block (tree
, tree
, tree
, tree
);
3597 extern tree
build_empty_stmt (location_t
);
3598 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3600 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3601 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3603 extern tree
build_call_nary (tree
, tree
, int, ...);
3604 extern tree
build_call_valist (tree
, tree
, int, va_list);
3605 #define build_call_array(T1,T2,N,T3)\
3606 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3607 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3608 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3610 /* Construct various nodes representing data types. */
3612 extern tree
make_signed_type (int);
3613 extern tree
make_unsigned_type (int);
3614 extern tree
signed_or_unsigned_type_for (int, tree
);
3615 extern tree
signed_type_for (tree
);
3616 extern tree
unsigned_type_for (tree
);
3617 extern tree
truth_type_for (tree
);
3618 extern void initialize_sizetypes (void);
3619 extern void fixup_unsigned_type (tree
);
3620 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3621 extern tree
build_pointer_type (tree
);
3622 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3623 extern tree
build_reference_type (tree
);
3624 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3625 extern tree
build_vector_type (tree innertype
, int nunits
);
3626 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3627 extern tree
build_index_type (tree
);
3628 extern tree
build_array_type (tree
, tree
);
3629 extern tree
build_nonshared_array_type (tree
, tree
);
3630 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3631 extern tree
build_function_type (tree
, tree
);
3632 extern tree
build_function_type_list (tree
, ...);
3633 extern tree
build_varargs_function_type_list (tree
, ...);
3634 extern tree
build_function_type_array (tree
, int, tree
*);
3635 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3636 #define build_function_type_vec(RET, V) \
3637 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3638 #define build_varargs_function_type_vec(RET, V) \
3639 build_varargs_function_type_array (RET, vec_safe_length (V), \
3640 vec_safe_address (V))
3641 extern tree
build_method_type_directly (tree
, tree
, tree
);
3642 extern tree
build_method_type (tree
, tree
);
3643 extern tree
build_offset_type (tree
, tree
);
3644 extern tree
build_complex_type (tree
);
3645 extern tree
array_type_nelts (const_tree
);
3647 extern tree
value_member (tree
, tree
);
3648 extern tree
purpose_member (const_tree
, tree
);
3649 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3650 extern tree
chain_index (int, tree
);
3652 extern int attribute_list_equal (const_tree
, const_tree
);
3653 extern int attribute_list_contained (const_tree
, const_tree
);
3654 extern int tree_int_cst_equal (const_tree
, const_tree
);
3655 extern int tree_int_cst_lt (const_tree
, const_tree
);
3656 extern int tree_int_cst_compare (const_tree
, const_tree
);
3657 extern int host_integerp (const_tree
, int)
3658 #ifndef ENABLE_TREE_CHECKING
3659 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
3662 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
3663 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3664 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3665 tree_low_cst (const_tree t
, int pos
)
3667 gcc_assert (host_integerp (t
, pos
));
3668 return TREE_INT_CST_LOW (t
);
3671 extern int tree_int_cst_sgn (const_tree
);
3672 extern int tree_int_cst_sign_bit (const_tree
);
3673 extern unsigned int tree_int_cst_min_precision (tree
, bool);
3674 extern bool tree_expr_nonnegative_p (tree
);
3675 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3676 extern bool may_negate_without_overflow_p (const_tree
);
3677 extern tree
strip_array_types (tree
);
3678 extern tree
excess_precision_type (tree
);
3679 extern bool valid_constant_size_p (const_tree
);
3680 extern unsigned int element_precision (const_tree
);
3682 /* Construct various nodes representing fract or accum data types. */
3684 extern tree
make_fract_type (int, int, int);
3685 extern tree
make_accum_type (int, int, int);
3687 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3688 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3689 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3690 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3691 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3692 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3693 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3694 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3696 #define make_or_reuse_signed_fract_type(P) \
3697 make_or_reuse_fract_type (P, 0, 0)
3698 #define make_or_reuse_unsigned_fract_type(P) \
3699 make_or_reuse_fract_type (P, 1, 0)
3700 #define make_or_reuse_sat_signed_fract_type(P) \
3701 make_or_reuse_fract_type (P, 0, 1)
3702 #define make_or_reuse_sat_unsigned_fract_type(P) \
3703 make_or_reuse_fract_type (P, 1, 1)
3704 #define make_or_reuse_signed_accum_type(P) \
3705 make_or_reuse_accum_type (P, 0, 0)
3706 #define make_or_reuse_unsigned_accum_type(P) \
3707 make_or_reuse_accum_type (P, 1, 0)
3708 #define make_or_reuse_sat_signed_accum_type(P) \
3709 make_or_reuse_accum_type (P, 0, 1)
3710 #define make_or_reuse_sat_unsigned_accum_type(P) \
3711 make_or_reuse_accum_type (P, 1, 1)
3713 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3714 put the prototype here. Rtl.h does declare the prototype if
3715 tree.h had been included. */
3717 extern tree
make_tree (tree
, rtx
);
3719 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3722 Such modified types already made are recorded so that duplicates
3725 extern tree
build_type_attribute_variant (tree
, tree
);
3726 extern tree
build_decl_attribute_variant (tree
, tree
);
3727 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3729 /* Return 0 if the attributes for two types are incompatible, 1 if they
3730 are compatible, and 2 if they are nearly compatible (which causes a
3731 warning to be generated). */
3732 extern int comp_type_attributes (const_tree
, const_tree
);
3734 /* Default versions of target-overridable functions. */
3735 extern tree
merge_decl_attributes (tree
, tree
);
3736 extern tree
merge_type_attributes (tree
, tree
);
3738 /* This function is a private implementation detail of lookup_attribute()
3739 and you should never call it directly. */
3740 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3742 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3743 return a pointer to the attribute's list element if the attribute
3744 is part of the list, or NULL_TREE if not found. If the attribute
3745 appears more than once, this only returns the first occurrence; the
3746 TREE_CHAIN of the return value should be passed back in if further
3747 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3751 lookup_attribute (const char *attr_name
, tree list
)
3753 gcc_checking_assert (attr_name
[0] != '_');
3754 /* In most cases, list is NULL_TREE. */
3755 if (list
== NULL_TREE
)
3758 /* Do the strlen() before calling the out-of-line implementation.
3759 In most cases attr_name is a string constant, and the compiler
3760 will optimize the strlen() away. */
3761 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3764 /* This function is a private implementation detail of
3765 is_attribute_p() and you should never call it directly. */
3766 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3768 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3769 if the identifier node is a valid attribute name for the string.
3770 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3771 be the identifier for 'text' or for '__text__'. */
3774 is_attribute_p (const char *attr_name
, const_tree ident
)
3776 gcc_checking_assert (attr_name
[0] != '_');
3777 /* Do the strlen() before calling the out-of-line implementation.
3778 In most cases attr_name is a string constant, and the compiler
3779 will optimize the strlen() away. */
3780 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3783 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3784 modified list. ATTR_NAME must be in the form 'text' (not
3787 extern tree
remove_attribute (const char *, tree
);
3789 /* Given two attributes lists, return a list of their union. */
3791 extern tree
merge_attributes (tree
, tree
);
3793 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3794 /* Given two Windows decl attributes lists, possibly including
3795 dllimport, return a list of their union . */
3796 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3798 /* Handle a "dllimport" or "dllexport" attribute. */
3799 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3802 /* Check whether CAND is suitable to be returned from get_qualified_type
3803 (BASE, TYPE_QUALS). */
3805 extern bool check_qualified_type (const_tree
, const_tree
, int);
3807 /* Return a version of the TYPE, qualified as indicated by the
3808 TYPE_QUALS, if one exists. If no qualified version exists yet,
3809 return NULL_TREE. */
3811 extern tree
get_qualified_type (tree
, int);
3813 /* Like get_qualified_type, but creates the type if it does not
3814 exist. This function never returns NULL_TREE. */
3816 extern tree
build_qualified_type (tree
, int);
3818 /* Create a variant of type T with alignment ALIGN. */
3820 extern tree
build_aligned_type (tree
, unsigned int);
3822 /* Like build_qualified_type, but only deals with the `const' and
3823 `volatile' qualifiers. This interface is retained for backwards
3824 compatibility with the various front-ends; new code should use
3825 build_qualified_type instead. */
3827 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3828 build_qualified_type ((TYPE), \
3829 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3830 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3832 /* Make a copy of a type node. */
3834 extern tree
build_distinct_type_copy (tree
);
3835 extern tree
build_variant_type_copy (tree
);
3837 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3838 fields. Optionally specify an alignment, and then lay it out. */
3840 extern void finish_builtin_struct (tree
, const char *,
3843 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3844 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3845 node, does nothing except for the first time. */
3847 extern void layout_type (tree
);
3849 extern record_layout_info
start_record_layout (tree
);
3850 extern tree
bit_from_pos (tree
, tree
);
3851 extern tree
byte_from_pos (tree
, tree
);
3852 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
3853 extern void normalize_offset (tree
*, tree
*, unsigned int);
3854 extern tree
rli_size_unit_so_far (record_layout_info
);
3855 extern tree
rli_size_so_far (record_layout_info
);
3856 extern void normalize_rli (record_layout_info
);
3857 extern void place_field (record_layout_info
, tree
);
3858 extern void compute_record_mode (tree
);
3859 extern void finish_record_layout (record_layout_info
, int);
3861 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3862 return a canonicalized ..._TYPE node, so that duplicates are not made.
3863 How the hash code is computed is up to the caller, as long as any two
3864 callers that could hash identical-looking type nodes agree. */
3866 extern tree
type_hash_canon (unsigned int, tree
);
3868 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3869 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3870 fields. Call this only once for any given decl node.
3872 Second argument is the boundary that this field can be assumed to
3873 be starting at (in bits). Zero means it can be assumed aligned
3874 on any boundary that may be needed. */
3876 extern void layout_decl (tree
, unsigned);
3878 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3879 a previous call to layout_decl and calls it again. */
3881 extern void relayout_decl (tree
);
3883 /* Return the mode for data of a given size SIZE and mode class CLASS.
3884 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3885 The value is BLKmode if no other mode is found. This is like
3886 mode_for_size, but is passed a tree. */
3888 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
3890 /* Return an expr equal to X but certainly not valid as an lvalue. */
3892 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
3893 extern tree
non_lvalue_loc (location_t
, tree
);
3895 extern tree
convert (tree
, tree
);
3896 extern unsigned int expr_align (const_tree
);
3897 extern tree
expr_first (tree
);
3898 extern tree
expr_last (tree
);
3899 extern tree
size_in_bytes (const_tree
);
3900 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
3901 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
3902 extern tree
bit_position (const_tree
);
3903 extern HOST_WIDE_INT
int_bit_position (const_tree
);
3904 extern tree
byte_position (const_tree
);
3905 extern HOST_WIDE_INT
int_byte_position (const_tree
);
3907 #define sizetype sizetype_tab[(int) stk_sizetype]
3908 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3909 #define ssizetype sizetype_tab[(int) stk_ssizetype]
3910 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3912 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
3913 #define size_binop(CODE,T1,T2)\
3914 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
3915 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
3916 #define size_diffop(T1,T2)\
3917 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
3918 extern tree
size_diffop_loc (location_t
, tree
, tree
);
3920 #define size_int(L) size_int_kind (L, stk_sizetype)
3921 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
3922 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3923 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3925 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
3926 extern tree
round_up_loc (location_t
, tree
, int);
3927 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
3928 extern tree
round_down_loc (location_t
, tree
, int);
3929 extern void finalize_size_functions (void);
3931 /* Type for sizes of data-type. */
3933 #define BITS_PER_UNIT_LOG \
3934 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3935 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3936 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3938 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3939 by making the last node in X point to Y.
3940 Returns X, except if X is 0 returns Y. */
3942 extern tree
chainon (tree
, tree
);
3944 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3946 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
3947 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3949 /* Return the last tree node in a chain. */
3951 extern tree
tree_last (tree
);
3953 /* Reverse the order of elements in a chain, and return the new head. */
3955 extern tree
nreverse (tree
);
3957 /* Returns the length of a chain of nodes
3958 (number of chain pointers to follow before reaching a null pointer). */
3960 extern int list_length (const_tree
);
3962 /* Returns the first FIELD_DECL in a type. */
3964 extern tree
first_field (const_tree
);
3966 /* Given an initializer INIT, return TRUE if INIT is zero or some
3967 aggregate of zeros. Otherwise return FALSE. */
3969 extern bool initializer_zerop (const_tree
);
3971 /* Given a vector VEC, return its first element if all elements are
3972 the same. Otherwise return NULL_TREE. */
3974 extern tree
uniform_vector_p (const_tree
);
3976 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
3978 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
3980 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
3981 HOST_WIDE_INT
*, bool *);
3983 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
3985 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3987 extern int integer_zerop (const_tree
);
3989 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3991 extern int integer_onep (const_tree
);
3993 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3994 all of whose significant bits are 1. */
3996 extern int integer_all_onesp (const_tree
);
3998 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4001 extern int integer_minus_onep (const_tree
);
4003 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4004 exactly one bit 1. */
4006 extern int integer_pow2p (const_tree
);
4008 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4009 with a nonzero value. */
4011 extern int integer_nonzerop (const_tree
);
4013 extern bool cst_and_fits_in_hwi (const_tree
);
4014 extern tree
num_ending_zeros (const_tree
);
4016 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4019 extern int fixed_zerop (const_tree
);
4021 /* staticp (tree x) is nonzero if X is a reference to data allocated
4022 at a fixed address in memory. Returns the outermost data. */
4024 extern tree
staticp (tree
);
4026 /* save_expr (EXP) returns an expression equivalent to EXP
4027 but it can be used multiple times within context CTX
4028 and only evaluate EXP once. */
4030 extern tree
save_expr (tree
);
4032 /* Look inside EXPR into any simple arithmetic operations. Return the
4033 outermost non-arithmetic or non-invariant node. */
4035 extern tree
skip_simple_arithmetic (tree
);
4037 /* Look inside EXPR into simple arithmetic operations involving constants.
4038 Return the outermost non-arithmetic or non-constant node. */
4040 extern tree
skip_simple_constant_arithmetic (tree
);
4042 /* Return which tree structure is used by T. */
4044 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4046 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4047 size or offset that depends on a field within a record. */
4049 extern bool contains_placeholder_p (const_tree
);
4051 /* This macro calls the above function but short-circuits the common
4052 case of a constant to save time. Also check for null. */
4054 #define CONTAINS_PLACEHOLDER_P(EXP) \
4055 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4057 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4058 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4061 extern bool type_contains_placeholder_p (tree
);
4063 /* Given a tree EXP, find all occurrences of references to fields
4064 in a PLACEHOLDER_EXPR and place them in vector REFS without
4065 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4066 we assume here that EXP contains only arithmetic expressions
4067 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4070 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4072 /* This macro calls the above function but short-circuits the common
4073 case of a constant to save time and also checks for NULL. */
4075 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4077 if((EXP) && !TREE_CONSTANT (EXP)) \
4078 find_placeholder_in_expr (EXP, V); \
4081 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4082 return a tree with all occurrences of references to F in a
4083 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4084 CONST_DECLs. Note that we assume here that EXP contains only
4085 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4086 occurring only in their argument list. */
4088 extern tree
substitute_in_expr (tree
, tree
, tree
);
4090 /* This macro calls the above function but short-circuits the common
4091 case of a constant to save time and also checks for NULL. */
4093 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4094 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4096 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4097 for it within OBJ, a tree that is an object or a chain of references. */
4099 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4101 /* This macro calls the above function but short-circuits the common
4102 case of a constant to save time and also checks for NULL. */
4104 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4105 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4106 : substitute_placeholder_in_expr (EXP, OBJ))
4108 /* variable_size (EXP) is like save_expr (EXP) except that it
4109 is for the special case of something that is part of a
4110 variable size for a data type. It makes special arrangements
4111 to compute the value at the right time when the data type
4112 belongs to a function parameter. */
4114 extern tree
variable_size (tree
);
4116 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4117 but it can be used multiple times
4118 and only evaluate the subexpressions once. */
4120 extern tree
stabilize_reference (tree
);
4122 /* Return EXP, stripped of any conversions to wider types
4123 in such a way that the result of converting to type FOR_TYPE
4124 is the same as if EXP were converted to FOR_TYPE.
4125 If FOR_TYPE is 0, it signifies EXP's type. */
4127 extern tree
get_unwidened (tree
, tree
);
4129 /* Return OP or a simpler expression for a narrower value
4130 which can be sign-extended or zero-extended to give back OP.
4131 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4132 or 0 if the value should be sign-extended. */
4134 extern tree
get_narrower (tree
, int *);
4136 /* Return true if T is an expression that get_inner_reference handles. */
4139 handled_component_p (const_tree t
)
4141 switch (TREE_CODE (t
))
4146 case ARRAY_RANGE_REF
:
4149 case VIEW_CONVERT_EXPR
:
4157 /* Given an expression EXP that is a handled_component_p,
4158 look for the ultimate containing object, which is returned and specify
4159 the access position and size. */
4161 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4162 tree
*, enum machine_mode
*, int *, int *,
4165 /* Return a tree of sizetype representing the size, in bytes, of the element
4166 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4168 extern tree
array_ref_element_size (tree
);
4170 bool array_at_struct_end_p (tree
);
4172 /* Return a tree representing the lower bound of the array mentioned in
4173 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4175 extern tree
array_ref_low_bound (tree
);
4177 /* Return a tree representing the upper bound of the array mentioned in
4178 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4180 extern tree
array_ref_up_bound (tree
);
4182 /* Return a tree representing the offset, in bytes, of the field referenced
4183 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4185 extern tree
component_ref_field_offset (tree
);
4187 /* Given a DECL or TYPE, return the scope in which it was declared, or
4188 NUL_TREE if there is no containing scope. */
4190 extern tree
get_containing_scope (const_tree
);
4192 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4194 extern tree
decl_function_context (const_tree
);
4196 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4197 this _DECL with its context, or zero if none. */
4198 extern tree
decl_type_context (const_tree
);
4200 /* Return 1 if EXPR is the real constant zero. */
4201 extern int real_zerop (const_tree
);
4203 /* Initialize the iterator I with arguments from function FNDECL */
4206 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4208 i
->next
= TYPE_ARG_TYPES (fntype
);
4211 /* Return a pointer that holds the next argument if there are more arguments to
4212 handle, otherwise return NULL. */
4214 static inline tree
*
4215 function_args_iter_cond_ptr (function_args_iterator
*i
)
4217 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4220 /* Return the next argument if there are more arguments to handle, otherwise
4224 function_args_iter_cond (function_args_iterator
*i
)
4226 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4229 /* Advance to the next argument. */
4231 function_args_iter_next (function_args_iterator
*i
)
4233 gcc_assert (i
->next
!= NULL_TREE
);
4234 i
->next
= TREE_CHAIN (i
->next
);
4237 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4240 inlined_function_outer_scope_p (const_tree block
)
4242 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4245 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4246 to point to the next tree element. ITER is an instance of
4247 function_args_iterator used to iterate the arguments. */
4248 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4249 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4250 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4251 function_args_iter_next (&(ITER)))
4253 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4254 to the next tree element. ITER is an instance of function_args_iterator
4255 used to iterate the arguments. */
4256 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4257 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4258 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4259 function_args_iter_next (&(ITER)))
4264 extern unsigned crc32_string (unsigned, const char *);
4265 extern unsigned crc32_byte (unsigned, char);
4266 extern unsigned crc32_unsigned (unsigned, unsigned);
4267 extern void clean_symbol_name (char *);
4268 extern tree
get_file_function_name (const char *);
4269 extern tree
get_callee_fndecl (const_tree
);
4270 extern int type_num_arguments (const_tree
);
4271 extern bool associative_tree_code (enum tree_code
);
4272 extern bool commutative_tree_code (enum tree_code
);
4273 extern bool commutative_ternary_tree_code (enum tree_code
);
4274 extern tree
upper_bound_in_type (tree
, tree
);
4275 extern tree
lower_bound_in_type (tree
, tree
);
4276 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4277 extern tree
create_artificial_label (location_t
);
4278 extern const char *get_name (tree
);
4279 extern bool stdarg_p (const_tree
);
4280 extern bool prototype_p (tree
);
4281 extern bool is_typedef_decl (tree x
);
4282 extern bool typedef_variant_p (tree
);
4283 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4284 extern tree
build_low_bits_mask (tree
, unsigned);
4285 extern tree
tree_strip_nop_conversions (tree
);
4286 extern tree
tree_strip_sign_nop_conversions (tree
);
4287 extern const_tree
strip_invariant_refs (const_tree
);
4288 extern tree
lhd_gcc_personality (void);
4289 extern void assign_assembler_name_if_neeeded (tree
);
4290 extern void warn_deprecated_use (tree
, tree
);
4291 extern void cache_integer_cst (tree
);
4295 extern void change_decl_assembler_name (tree
, tree
);
4299 extern void expand_label (tree
);
4301 /* Compare and hash for any structure which begins with a canonical
4302 pointer. Assumes all pointers are interchangeable, which is sort
4303 of already assumed by gcc elsewhere IIRC. */
4306 struct_ptr_eq (const void *a
, const void *b
)
4308 const void * const * x
= (const void * const *) a
;
4309 const void * const * y
= (const void * const *) b
;
4313 static inline hashval_t
4314 struct_ptr_hash (const void *a
)
4316 const void * const * x
= (const void * const *) a
;
4317 return (intptr_t)*x
>> 4;
4320 /* In fold-const.c */
4322 /* Non-zero if we are folding constants inside an initializer; zero
4324 extern int folding_initializer
;
4326 /* Convert between trees and native memory representation. */
4327 extern int native_encode_expr (const_tree
, unsigned char *, int);
4328 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4330 /* Fold constants as much as possible in an expression.
4331 Returns the simplified expression.
4332 Acts only on the top level of the expression;
4333 if the argument itself cannot be simplified, its
4334 subexpressions are not changed. */
4336 extern tree
fold (tree
);
4337 #define fold_unary(CODE,T1,T2)\
4338 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4339 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
4340 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4341 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4342 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
4343 #define fold_binary(CODE,T1,T2,T3)\
4344 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4345 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4346 #define fold_ternary(CODE,T1,T2,T3,T4)\
4347 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4348 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4349 #define fold_build1(c,t1,t2)\
4350 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4351 #define fold_build1_loc(l,c,t1,t2)\
4352 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4353 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
4354 tree MEM_STAT_DECL
);
4355 #define fold_build2(c,t1,t2,t3)\
4356 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4357 #define fold_build2_loc(l,c,t1,t2,t3)\
4358 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4359 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
4360 tree MEM_STAT_DECL
);
4361 #define fold_build3(c,t1,t2,t3,t4)\
4362 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4363 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4364 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4365 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
4366 tree MEM_STAT_DECL
);
4367 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
4368 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4369 #define fold_build_call_array(T1,T2,N,T4)\
4370 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4371 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
4372 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4373 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4374 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
4375 extern bool fold_convertible_p (const_tree
, const_tree
);
4376 #define fold_convert(T1,T2)\
4377 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
4378 extern tree
fold_convert_loc (location_t
, tree
, tree
);
4379 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
4380 extern tree
fold_ignored_result (tree
);
4381 extern tree
fold_abs_const (tree
, tree
);
4382 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
4383 extern void fold_defer_overflow_warnings (void);
4384 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4385 extern void fold_undefer_and_ignore_overflow_warnings (void);
4386 extern bool fold_deferring_overflow_warnings_p (void);
4387 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
4388 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4389 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4390 #define omit_one_operand(T1,T2,T3)\
4391 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4392 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
4393 #define omit_two_operands(T1,T2,T3,T4)\
4394 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4395 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
4396 #define invert_truthvalue(T)\
4397 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
4398 extern tree
invert_truthvalue_loc (location_t
, tree
);
4399 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4400 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4401 extern tree
fold_read_from_constant_string (tree
);
4402 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
4403 #define build_fold_addr_expr(T)\
4404 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4405 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
4406 #define build_fold_addr_expr_with_type(T,TYPE)\
4407 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4408 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
4409 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4410 extern tree
fold_strip_sign_ops (tree
);
4411 #define build_fold_indirect_ref(T)\
4412 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4413 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
4414 #define fold_indirect_ref(T)\
4415 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4416 extern tree
fold_indirect_ref_loc (location_t
, tree
);
4417 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
4418 #define build_simple_mem_ref(T)\
4419 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4420 extern double_int
mem_ref_offset (const_tree
);
4421 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
4422 extern tree
constant_boolean_node (bool, tree
);
4423 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
4425 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4426 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4428 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4429 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4431 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4432 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4434 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4435 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4436 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4438 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4439 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4441 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4442 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
4443 enum tree_code
, tree
, tree
, tree
);
4444 extern void debug_fold_checksum (const_tree
);
4446 /* Return nonzero if CODE is a tree code that represents a truth value. */
4448 truth_value_p (enum tree_code code
)
4450 return (TREE_CODE_CLASS (code
) == tcc_comparison
4451 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4452 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4453 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4456 /* Return whether TYPE is a type suitable for an offset for
4457 a POINTER_PLUS_EXPR. */
4459 ptrofftype_p (tree type
)
4461 return (INTEGRAL_TYPE_P (type
)
4462 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4463 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4466 /* Return OFF converted to a pointer offset type suitable as offset for
4467 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4469 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4471 return fold_convert_loc (loc
, sizetype
, off
);
4473 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4475 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4477 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4479 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4480 ptr
, fold_convert_loc (loc
, sizetype
, off
));
4482 #define fold_build_pointer_plus(p,o) \
4483 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4485 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4487 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4489 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4490 ptr
, size_int (off
));
4492 #define fold_build_pointer_plus_hwi(p,o) \
4493 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4497 /* Non-zero if __builtin_constant_p should be folded right away. */
4498 extern bool force_folding_builtin_constant_p
;
4500 extern bool avoid_folding_inline_builtin (tree
);
4501 extern tree
fold_call_expr (location_t
, tree
, bool);
4502 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
4503 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
4504 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
4505 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
4506 enum built_in_function
);
4507 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4508 enum built_in_function
);
4509 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4510 enum built_in_function
);
4511 extern bool fold_builtin_next_arg (tree
, bool);
4512 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4513 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
4514 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4515 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4516 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4517 extern tree
build_call_expr (tree
, int, ...);
4518 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4519 extern tree
c_strlen (tree
, int);
4520 extern tree
build_string_literal (int, const char *);
4521 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4522 extern bool is_builtin_fn (tree
);
4523 extern bool get_object_alignment_1 (tree
, unsigned int *,
4524 unsigned HOST_WIDE_INT
*);
4525 extern unsigned int get_object_alignment (tree
);
4526 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
4527 unsigned HOST_WIDE_INT
*);
4528 extern unsigned int get_pointer_alignment (tree
);
4529 extern tree
fold_call_stmt (gimple
, bool);
4530 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4531 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
4532 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
4533 tree
*, tree
*, int *, bool *);
4534 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
4535 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
4537 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
4538 extern bool is_simple_builtin (tree
);
4539 extern bool is_inexpensive_builtin (tree
);
4542 extern tree
strip_float_extensions (tree
);
4545 extern int really_constant_p (const_tree
);
4546 extern bool decl_address_invariant_p (const_tree
);
4547 extern bool decl_address_ip_invariant_p (const_tree
);
4548 extern bool int_fits_type_p (const_tree
, const_tree
);
4549 #ifndef GENERATOR_FILE
4550 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4552 extern bool variably_modified_type_p (tree
, tree
);
4553 extern int tree_log2 (const_tree
);
4554 extern int tree_floor_log2 (const_tree
);
4555 extern unsigned int tree_ctz (const_tree
);
4556 extern int simple_cst_equal (const_tree
, const_tree
);
4557 extern hashval_t
iterative_hash_expr (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 void dump_tree_statistics (void);
4565 extern void recompute_tree_invariant_for_addr_expr (tree
);
4566 extern bool needs_to_live_in_memory (const_tree
);
4567 extern tree
reconstruct_complex_type (tree
, tree
);
4569 extern int real_onep (const_tree
);
4570 extern int real_minus_onep (const_tree
);
4571 extern void init_ttree (void);
4572 extern void build_common_tree_nodes (bool, bool);
4573 extern void build_common_builtin_nodes (void);
4574 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4575 extern tree
build_range_type (tree
, tree
, tree
);
4576 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4577 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4578 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4579 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4581 extern tree
tree_block (tree
);
4582 extern void tree_set_block (tree
, tree
);
4583 extern location_t
*block_nonartificial_location (tree
);
4584 extern location_t
tree_nonartificial_location (tree
);
4586 extern tree
block_ultimate_origin (const_tree
);
4588 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4589 extern bool virtual_method_call_p (tree
);
4590 extern tree
obj_type_ref_class (tree ref
);
4591 extern bool types_same_for_odr (tree type1
, tree type2
);
4592 extern bool contains_bitfld_component_ref_p (const_tree
);
4593 extern bool type_in_anonymous_namespace_p (tree
);
4594 extern bool block_may_fallthru (const_tree
);
4595 extern void using_eh_for_cleanups (void);
4596 extern bool using_eh_for_cleanups_p (void);
4598 extern const char *get_tree_code_name (enum tree_code
);
4600 /* In tree-nested.c */
4601 extern tree
build_addr (tree
, tree
);
4604 extern void expand_function_end (void);
4605 extern void expand_function_start (tree
);
4606 extern void stack_protect_epilogue (void);
4607 extern void init_dummy_function_start (void);
4608 extern void expand_dummy_function_end (void);
4609 extern void allocate_struct_function (tree
, bool);
4610 extern void push_struct_function (tree fndecl
);
4611 extern void init_function_start (tree
);
4612 extern bool use_register_for_decl (const_tree
);
4613 extern void generate_setjmp_warnings (void);
4614 extern void init_temp_slots (void);
4615 extern void free_temp_slots (void);
4616 extern void pop_temp_slots (void);
4617 extern void push_temp_slots (void);
4618 extern void preserve_temp_slots (rtx
);
4619 extern int aggregate_value_p (const_tree
, const_tree
);
4620 extern void push_function_context (void);
4621 extern void pop_function_context (void);
4622 extern gimple_seq
gimplify_parameters (void);
4624 /* In print-rtl.c */
4626 extern void print_rtl (FILE *, const_rtx
);
4629 /* In print-tree.c */
4630 extern void debug_tree (tree
);
4631 extern void debug_raw (const tree_node
&ref
);
4632 extern void debug_raw (const tree_node
*ptr
);
4633 extern void debug (const tree_node
&ref
);
4634 extern void debug (const tree_node
*ptr
);
4635 extern void debug_verbose (const tree_node
&ref
);
4636 extern void debug_verbose (const tree_node
*ptr
);
4637 extern void debug_head (const tree_node
&ref
);
4638 extern void debug_head (const tree_node
*ptr
);
4639 extern void debug_body (const tree_node
&ref
);
4640 extern void debug_body (const tree_node
*ptr
);
4641 extern void debug_vec_tree (vec
<tree
, va_gc
> *);
4642 extern void debug (vec
<tree
, va_gc
> &ref
);
4643 extern void debug (vec
<tree
, va_gc
> *ptr
);
4644 extern void debug_raw (vec
<tree
, va_gc
> &ref
);
4645 extern void debug_raw (vec
<tree
, va_gc
> *ptr
);
4647 extern void dump_addr (FILE*, const char *, const void *);
4648 extern void print_node (FILE *, const char *, tree
, int);
4649 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4650 extern void indent_to (FILE *, int);
4653 /* In tree-inline.c: */
4654 extern bool debug_find_tree (tree
, tree
);
4655 /* This is in tree-inline.c since the routine uses
4656 data structures from the inliner. */
4657 extern tree
build_duplicate_type (tree
);
4660 extern int flags_from_decl_or_type (const_tree
);
4661 extern int call_expr_flags (const_tree
);
4662 extern void set_call_expr_flags (tree
, int);
4664 extern int setjmp_call_p (const_tree
);
4665 extern bool gimple_alloca_call_p (const_gimple
);
4666 extern bool alloca_call_p (const_tree
);
4667 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4668 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4672 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
4673 extern void init_attributes (void);
4675 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4676 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4677 it should be modified in place; if a TYPE, a copy should be created
4678 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4679 information, in the form of a bitwise OR of flags in enum attribute_flags
4680 from tree.h. Depending on these flags, some attributes may be
4681 returned to be applied at a later stage (for example, to apply
4682 a decl attribute to the declaration rather than to its type). */
4683 extern tree
decl_attributes (tree
*, tree
, int);
4685 extern bool cxx11_attribute_p (const_tree
);
4687 extern tree
get_attribute_name (const_tree
);
4689 extern void apply_tm_attr (tree
, tree
);
4691 /* In stor-layout.c */
4692 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
4693 extern void fixup_signed_type (tree
);
4694 extern void internal_reference_types (void);
4695 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4698 extern tree
tree_output_constant_def (tree
);
4699 extern void make_decl_rtl (tree
);
4700 extern rtx
make_decl_rtl_for_debug (tree
);
4701 extern void make_decl_one_only (tree
, tree
);
4702 extern int supports_one_only (void);
4703 extern void resolve_unique_section (tree
, int, int);
4704 extern void mark_referenced (tree
);
4705 extern void mark_decl_referenced (tree
);
4706 extern void notice_global_symbol (tree
);
4707 extern void set_user_assembler_name (tree
, const char *);
4708 extern void process_pending_assemble_externals (void);
4709 extern bool decl_replaceable_p (tree
);
4710 extern bool decl_binds_to_current_def_p (tree
);
4711 extern enum tls_model
decl_default_tls_model (const_tree
);
4713 /* Declare DECL to be a weak symbol. */
4714 extern void declare_weak (tree
);
4715 /* Merge weak status. */
4716 extern void merge_weak (tree
, tree
);
4717 /* Make one symbol an alias for another. */
4718 extern void assemble_alias (tree
, tree
);
4720 /* Return nonzero if VALUE is a valid constant-valued expression
4721 for use in initializing a static variable; one that can be an
4722 element of a "constant" initializer.
4724 Return null_pointer_node if the value is absolute;
4725 if it is relocatable, return the variable that determines the relocation.
4726 We assume that VALUE has been folded as much as possible;
4727 therefore, we do not need to check for such things as
4728 arithmetic-combinations of integers. */
4729 extern tree
initializer_constant_valid_p (tree
, tree
);
4731 /* Return true if VALUE is a valid constant-valued expression
4732 for use in initializing a static bit-field; one that can be
4733 an element of a "constant" initializer. */
4734 extern bool initializer_constant_valid_for_bitfield_p (tree
);
4736 /* Whether a constructor CTOR is a valid static constant initializer if all
4737 its elements are. This used to be internal to initializer_constant_valid_p
4738 and has been exposed to let other functions like categorize_ctor_elements
4739 evaluate the property while walking a constructor for other purposes. */
4741 extern bool constructor_static_from_elts_p (const_tree
);
4744 extern bool parse_output_constraint (const char **, int, int, int,
4745 bool *, bool *, bool *);
4746 extern bool parse_input_constraint (const char **, int, int, int, int,
4747 const char * const *, bool *, bool *);
4748 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
4750 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4751 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
4755 /* In tree-inline.c */
4757 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
4759 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4761 #define walk_tree(a,b,c,d) \
4762 walk_tree_1 (a, b, c, d, NULL)
4763 #define walk_tree_without_duplicates(a,b,c) \
4764 walk_tree_without_duplicates_1 (a, b, c, NULL)
4767 /* Assign the RTX to declaration. */
4769 extern void set_decl_rtl (tree
, rtx
);
4770 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
4773 extern tree
get_base_address (tree t
);
4776 extern tree
drop_tree_overflow (tree
);
4777 extern int tree_map_base_eq (const void *, const void *);
4778 extern unsigned int tree_map_base_hash (const void *);
4779 extern int tree_map_base_marked_p (const void *);
4781 #define tree_map_eq tree_map_base_eq
4782 extern unsigned int tree_map_hash (const void *);
4783 #define tree_map_marked_p tree_map_base_marked_p
4785 #define tree_decl_map_eq tree_map_base_eq
4786 extern unsigned int tree_decl_map_hash (const void *);
4787 #define tree_decl_map_marked_p tree_map_base_marked_p
4789 #define tree_int_map_eq tree_map_base_eq
4790 #define tree_int_map_hash tree_map_base_hash
4791 #define tree_int_map_marked_p tree_map_base_marked_p
4793 #define tree_priority_map_eq tree_map_base_eq
4794 #define tree_priority_map_hash tree_map_base_hash
4795 #define tree_priority_map_marked_p tree_map_base_marked_p
4797 #define tree_vec_map_eq tree_map_base_eq
4798 #define tree_vec_map_hash tree_decl_map_hash
4799 #define tree_vec_map_marked_p tree_map_base_marked_p
4801 /* In tree-object-size.c. */
4802 extern void init_object_sizes (void);
4803 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
4807 /* Determine whether the LEN bytes can be moved by using several move
4808 instructions. Return nonzero if a call to move_by_pieces should
4810 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
4812 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
4813 extern tree
build_personality_function (const char *);
4815 /* In trans-mem.c. */
4816 extern tree
build_tm_abort_call (location_t
, bool);
4817 extern bool is_tm_safe (const_tree
);
4818 extern bool is_tm_pure (const_tree
);
4819 extern bool is_tm_may_cancel_outer (tree
);
4820 extern bool is_tm_ending_fndecl (tree
);
4821 extern void record_tm_replacement (tree
, tree
);
4822 extern void tm_malloc_replacement (tree
);
4824 /* In tree-inline.c. */
4826 void init_inline_once (void);
4828 /* Initialize the abstract argument list iterator object ITER with the
4829 arguments from CALL_EXPR node EXP. */
4831 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4834 iter
->n
= call_expr_nargs (exp
);
4839 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4842 iter
->n
= call_expr_nargs (exp
);
4846 /* Return the next argument from abstract argument list iterator object ITER,
4847 and advance its state. Return NULL_TREE if there are no more arguments. */
4849 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4852 if (iter
->i
>= iter
->n
)
4854 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4859 static inline const_tree
4860 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4863 if (iter
->i
>= iter
->n
)
4865 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4870 /* Initialize the abstract argument list iterator object ITER, then advance
4871 past and return the first argument. Useful in for expressions, e.g.
4872 for (arg = first_call_expr_arg (exp, &iter); arg;
4873 arg = next_call_expr_arg (&iter)) */
4875 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4877 init_call_expr_arg_iterator (exp
, iter
);
4878 return next_call_expr_arg (iter
);
4881 static inline const_tree
4882 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4884 init_const_call_expr_arg_iterator (exp
, iter
);
4885 return next_const_call_expr_arg (iter
);
4888 /* Test whether there are more arguments in abstract argument list iterator
4889 ITER, without changing its state. */
4891 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4893 return (iter
->i
< iter
->n
);
4896 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4897 (of type call_expr_arg_iterator) to hold the iteration state. */
4898 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4899 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4900 (arg) = next_call_expr_arg (&(iter)))
4902 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4903 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4904 (arg) = next_const_call_expr_arg (&(iter)))
4906 /* Return true if tree node T is a language-specific node. */
4908 is_lang_specific (tree t
)
4910 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4913 /* Valid builtin number. */
4914 #define BUILTIN_VALID_P(FNCODE) \
4915 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4917 /* Return the tree node for an explicit standard builtin function or NULL. */
4919 builtin_decl_explicit (enum built_in_function fncode
)
4921 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4923 return builtin_info
.decl
[(size_t)fncode
];
4926 /* Return the tree node for an implicit builtin function or NULL. */
4928 builtin_decl_implicit (enum built_in_function fncode
)
4930 size_t uns_fncode
= (size_t)fncode
;
4931 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4933 if (!builtin_info
.implicit_p
[uns_fncode
])
4936 return builtin_info
.decl
[uns_fncode
];
4939 /* Set explicit builtin function nodes and whether it is an implicit
4943 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4945 size_t ufncode
= (size_t)fncode
;
4947 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4948 && (decl
!= NULL_TREE
|| !implicit_p
));
4950 builtin_info
.decl
[ufncode
] = decl
;
4951 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
4954 /* Set the implicit flag for a builtin function. */
4957 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4959 size_t uns_fncode
= (size_t)fncode
;
4961 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4962 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
4964 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
4967 /* Return whether the standard builtin function can be used as an explicit
4971 builtin_decl_explicit_p (enum built_in_function fncode
)
4973 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4974 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
4977 /* Return whether the standard builtin function can be used implicitly. */
4980 builtin_decl_implicit_p (enum built_in_function fncode
)
4982 size_t uns_fncode
= (size_t)fncode
;
4984 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4985 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
4986 && builtin_info
.implicit_p
[uns_fncode
]);
4989 /* Return true if T (assumed to be a DECL) is a global variable.
4990 A variable is considered global if its storage is not automatic. */
4993 is_global_var (const_tree t
)
4995 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
4998 /* Return true if VAR may be aliased. A variable is considered as
4999 maybe aliased if it has its address taken by the local TU
5000 or possibly by another TU and might be modified through a pointer. */
5003 may_be_aliased (const_tree var
)
5005 return (TREE_CODE (var
) != CONST_DECL
5006 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5007 && TREE_READONLY (var
)
5008 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5009 && (TREE_PUBLIC (var
)
5010 || DECL_EXTERNAL (var
)
5011 || TREE_ADDRESSABLE (var
)));
5014 /* For anonymous aggregate types, we need some sort of name to
5015 hold on to. In practice, this should not appear, but it should
5016 not be harmful if it does. */
5017 #ifndef NO_DOT_IN_LABEL
5018 #define ANON_AGGRNAME_FORMAT "._%d"
5019 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
5020 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5021 #else /* NO_DOT_IN_LABEL */
5022 #ifndef NO_DOLLAR_IN_LABEL
5023 #define ANON_AGGRNAME_FORMAT "$_%d"
5024 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
5025 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5026 #else /* NO_DOLLAR_IN_LABEL */
5027 #define ANON_AGGRNAME_PREFIX "__anon_"
5028 #define ANON_AGGRNAME_P(ID_NODE) \
5029 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
5030 sizeof (ANON_AGGRNAME_PREFIX) - 1))
5031 #define ANON_AGGRNAME_FORMAT "__anon_%d"
5032 #endif /* NO_DOLLAR_IN_LABEL */
5033 #endif /* NO_DOT_IN_LABEL */
5036 #endif /* GCC_TREE_H */