1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
28 /* These includes are required here because they provide declarations
29 used by inline functions in this file.
31 FIXME - Move these users elsewhere? */
32 #include "fold-const.h"
34 /* Macros for initializing `tree_contains_struct'. */
35 #define MARK_TS_BASE(C) \
37 tree_contains_struct[C][TS_BASE] = 1; \
40 #define MARK_TS_TYPED(C) \
43 tree_contains_struct[C][TS_TYPED] = 1; \
46 #define MARK_TS_COMMON(C) \
49 tree_contains_struct[C][TS_COMMON] = 1; \
52 #define MARK_TS_TYPE_COMMON(C) \
55 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
58 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
60 MARK_TS_TYPE_COMMON (C); \
61 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
64 #define MARK_TS_DECL_MINIMAL(C) \
67 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
70 #define MARK_TS_DECL_COMMON(C) \
72 MARK_TS_DECL_MINIMAL (C); \
73 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
76 #define MARK_TS_DECL_WRTL(C) \
78 MARK_TS_DECL_COMMON (C); \
79 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
82 #define MARK_TS_DECL_WITH_VIS(C) \
84 MARK_TS_DECL_WRTL (C); \
85 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
88 #define MARK_TS_DECL_NON_COMMON(C) \
90 MARK_TS_DECL_WITH_VIS (C); \
91 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
95 /* Returns the string representing CLASS. */
97 #define TREE_CODE_CLASS_STRING(CLASS)\
98 tree_code_class_strings[(int) (CLASS)]
100 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
102 /* Nonzero if NODE represents an exceptional code. */
104 #define EXCEPTIONAL_CLASS_P(NODE)\
105 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
107 /* Nonzero if NODE represents a constant. */
109 #define CONSTANT_CLASS_P(NODE)\
110 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
112 /* Nonzero if NODE represents a type. */
114 #define TYPE_P(NODE)\
115 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
117 /* Nonzero if NODE represents a declaration. */
119 #define DECL_P(NODE)\
120 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
122 /* True if NODE designates a variable declaration. */
123 #define VAR_P(NODE) \
124 (TREE_CODE (NODE) == VAR_DECL)
126 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
128 #define VAR_OR_FUNCTION_DECL_P(DECL)\
129 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
131 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
132 ascending code order. */
134 #define INDIRECT_REF_P(NODE)\
135 (TREE_CODE (NODE) == INDIRECT_REF)
137 /* Nonzero if NODE represents a reference. */
139 #define REFERENCE_CLASS_P(NODE)\
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
142 /* Nonzero if NODE represents a comparison. */
144 #define COMPARISON_CLASS_P(NODE)\
145 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
147 /* Nonzero if NODE represents a unary arithmetic expression. */
149 #define UNARY_CLASS_P(NODE)\
150 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
152 /* Nonzero if NODE represents a binary arithmetic expression. */
154 #define BINARY_CLASS_P(NODE)\
155 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
157 /* Nonzero if NODE represents a statement expression. */
159 #define STATEMENT_CLASS_P(NODE)\
160 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
162 /* Nonzero if NODE represents a function call-like expression with a
163 variable-length operand vector. */
165 #define VL_EXP_CLASS_P(NODE)\
166 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
168 /* Nonzero if NODE represents any other expression. */
170 #define EXPRESSION_CLASS_P(NODE)\
171 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
173 /* Returns nonzero iff NODE represents a type or declaration. */
175 #define IS_TYPE_OR_DECL_P(NODE)\
176 (TYPE_P (NODE) || DECL_P (NODE))
178 /* Returns nonzero iff CLASS is the tree-code class of an
181 #define IS_EXPR_CODE_CLASS(CLASS)\
182 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
184 /* Returns nonzero iff NODE is an expression of some kind. */
186 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
188 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
191 /* Helper macros for math builtins. */
193 #define BUILTIN_EXP10_P(FN) \
194 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
195 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
197 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
198 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
199 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
201 #define BUILTIN_SQRT_P(FN) \
202 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
204 #define BUILTIN_CBRT_P(FN) \
205 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
207 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
209 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
210 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
211 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
213 #define NULL_TREE (tree) NULL
215 /* Define accessors for the fields that all tree nodes have
216 (though some fields are not used for all kinds of nodes). */
218 /* The tree-code says what kind of node it is.
219 Codes are defined in tree.def. */
220 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
221 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
223 /* When checking is enabled, errors will be generated if a tree node
224 is accessed incorrectly. The macros die with a fatal error. */
225 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
227 #define TREE_CHECK(T, CODE) \
228 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
230 #define TREE_NOT_CHECK(T, CODE) \
231 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
233 #define TREE_CHECK2(T, CODE1, CODE2) \
234 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
236 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
237 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
239 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
240 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
242 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
243 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
244 (CODE1), (CODE2), (CODE3)))
246 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
247 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
248 (CODE1), (CODE2), (CODE3), (CODE4)))
250 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
251 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
252 (CODE1), (CODE2), (CODE3), (CODE4)))
254 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
255 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
256 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
258 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
259 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
260 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
262 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
263 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
265 #define TREE_CLASS_CHECK(T, CLASS) \
266 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
268 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
269 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
271 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
272 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
274 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
275 (omp_clause_range_check ((T), (CODE1), (CODE2), \
276 __FILE__, __LINE__, __FUNCTION__))
278 /* These checks have to be special cased. */
279 #define EXPR_CHECK(T) \
280 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
282 /* These checks have to be special cased. */
283 #define NON_TYPE_CHECK(T) \
284 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
286 #define TREE_INT_CST_ELT_CHECK(T, I) \
287 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
289 #define TREE_VEC_ELT_CHECK(T, I) \
290 (*(CONST_CAST2 (tree *, typeof (T)*, \
291 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
293 #define OMP_CLAUSE_ELT_CHECK(T, I) \
294 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
296 /* Special checks for TREE_OPERANDs. */
297 #define TREE_OPERAND_CHECK(T, I) \
298 (*(CONST_CAST2 (tree*, typeof (T)*, \
299 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
301 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
302 (*(tree_operand_check_code ((T), (CODE), (I), \
303 __FILE__, __LINE__, __FUNCTION__)))
305 /* Nodes are chained together for many purposes.
306 Types are chained together to record them for being output to the debugger
307 (see the function `chain_type').
308 Decls in the same scope are chained together to record the contents
310 Statement nodes for successive statements used to be chained together.
311 Often lists of things are represented by TREE_LIST nodes that
312 are chained together. */
314 #define TREE_CHAIN(NODE) \
315 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
317 /* In all nodes that are expressions, this is the data type of the expression.
318 In POINTER_TYPE nodes, this is the type that the pointer points to.
319 In ARRAY_TYPE nodes, this is the type of the elements.
320 In VECTOR_TYPE nodes, this is the type of the elements. */
321 #define TREE_TYPE(NODE) \
322 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
324 extern void tree_contains_struct_check_failed (const_tree
,
325 const enum tree_node_structure_enum
,
326 const char *, int, const char *)
329 extern void tree_check_failed (const_tree
, const char *, int, const char *,
330 ...) ATTRIBUTE_NORETURN
;
331 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
332 ...) ATTRIBUTE_NORETURN
;
333 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
334 const char *, int, const char *)
336 extern void tree_range_check_failed (const_tree
, const char *, int,
337 const char *, enum tree_code
,
340 extern void tree_not_class_check_failed (const_tree
,
341 const enum tree_code_class
,
342 const char *, int, const char *)
344 extern void tree_int_cst_elt_check_failed (int, int, const char *,
347 extern void tree_vec_elt_check_failed (int, int, const char *,
350 extern void phi_node_elt_check_failed (int, int, const char *,
353 extern void tree_operand_check_failed (int, const_tree
,
354 const char *, int, const char *)
356 extern void omp_clause_check_failed (const_tree
, const char *, int,
357 const char *, enum omp_clause_code
)
359 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
362 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
363 const char *, enum omp_clause_code
,
364 enum omp_clause_code
)
367 #else /* not ENABLE_TREE_CHECKING, or not gcc */
369 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
370 #define TREE_CHECK(T, CODE) (T)
371 #define TREE_NOT_CHECK(T, CODE) (T)
372 #define TREE_CHECK2(T, CODE1, CODE2) (T)
373 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
374 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
375 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
376 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
377 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
378 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
379 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
380 #define TREE_CLASS_CHECK(T, CODE) (T)
381 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
382 #define EXPR_CHECK(T) (T)
383 #define NON_TYPE_CHECK(T) (T)
384 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
385 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
386 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
387 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
388 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
389 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
390 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
392 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
393 #define TREE_TYPE(NODE) ((NODE)->typed.type)
397 #define TREE_BLOCK(NODE) (tree_block (NODE))
398 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
400 #include "tree-check.h"
402 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
403 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
404 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
405 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
406 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
407 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
408 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
409 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
410 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
411 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
412 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
414 #define RECORD_OR_UNION_CHECK(T) \
415 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
416 #define NOT_RECORD_OR_UNION_CHECK(T) \
417 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
419 #define NUMERICAL_TYPE_CHECK(T) \
420 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
423 /* Here is how primitive or already-canonicalized types' hash codes
425 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
427 /* A simple hash function for an arbitrary tree node. This must not be
428 used in hash tables which are saved to a PCH. */
429 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
431 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
432 #define CONVERT_EXPR_CODE_P(CODE) \
433 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
435 /* Similarly, but accept an expressions instead of a tree code. */
436 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
438 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
440 #define CASE_CONVERT \
444 /* Given an expression as a tree, strip any conversion that generates
445 no instruction. Accepts both tree and const_tree arguments since
446 we are not modifying the tree itself. */
448 #define STRIP_NOPS(EXP) \
449 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
451 /* Like STRIP_NOPS, but don't let the signedness change either. */
453 #define STRIP_SIGN_NOPS(EXP) \
454 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
456 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
458 #define STRIP_TYPE_NOPS(EXP) \
459 while ((CONVERT_EXPR_P (EXP) \
460 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
461 && TREE_OPERAND (EXP, 0) != error_mark_node \
462 && (TREE_TYPE (EXP) \
463 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
464 (EXP) = TREE_OPERAND (EXP, 0)
466 /* Remove unnecessary type conversions according to
467 tree_ssa_useless_type_conversion. */
469 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
470 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
472 /* Nonzero if TYPE represents a vector type. */
474 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
476 /* Nonzero if TYPE represents an integral type. Note that we do not
477 include COMPLEX types here. Keep these checks in ascending code
480 #define INTEGRAL_TYPE_P(TYPE) \
481 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
482 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
483 || TREE_CODE (TYPE) == INTEGER_TYPE)
485 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
487 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
488 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
490 /* Nonzero if TYPE represents a saturating fixed-point type. */
492 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
493 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
495 /* Nonzero if TYPE represents a fixed-point type. */
497 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
499 /* Nonzero if TYPE represents a scalar floating-point type. */
501 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
503 /* Nonzero if TYPE represents a complex floating-point type. */
505 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
506 (TREE_CODE (TYPE) == COMPLEX_TYPE \
507 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
509 /* Nonzero if TYPE represents a vector integer type. */
511 #define VECTOR_INTEGER_TYPE_P(TYPE) \
512 (VECTOR_TYPE_P (TYPE) \
513 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
516 /* Nonzero if TYPE represents a vector floating-point type. */
518 #define VECTOR_FLOAT_TYPE_P(TYPE) \
519 (VECTOR_TYPE_P (TYPE) \
520 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
522 /* Nonzero if TYPE represents a floating-point type, including complex
523 and vector floating-point types. The vector and complex check does
524 not use the previous two macros to enable early folding. */
526 #define FLOAT_TYPE_P(TYPE) \
527 (SCALAR_FLOAT_TYPE_P (TYPE) \
528 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
529 || VECTOR_TYPE_P (TYPE)) \
530 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
532 /* Nonzero if TYPE represents a decimal floating-point type. */
533 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
534 (SCALAR_FLOAT_TYPE_P (TYPE) \
535 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
537 /* Nonzero if TYPE is a record or union type. */
538 #define RECORD_OR_UNION_TYPE_P(TYPE) \
539 (TREE_CODE (TYPE) == RECORD_TYPE \
540 || TREE_CODE (TYPE) == UNION_TYPE \
541 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
543 /* Nonzero if TYPE represents an aggregate (multi-component) type.
544 Keep these checks in ascending code order. */
546 #define AGGREGATE_TYPE_P(TYPE) \
547 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
549 /* Nonzero if TYPE represents a pointer or reference type.
550 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
551 ascending code order. */
553 #define POINTER_TYPE_P(TYPE) \
554 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
556 /* Nonzero if TYPE represents a pointer to function. */
557 #define FUNCTION_POINTER_TYPE_P(TYPE) \
558 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
560 /* Nonzero if this type is a complete type. */
561 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
563 /* Nonzero if this type is the (possibly qualified) void type. */
564 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
566 /* Nonzero if this type is complete or is cv void. */
567 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
568 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
570 /* Nonzero if this type is complete or is an array with unspecified bound. */
571 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
572 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
574 /* Define many boolean fields that all tree nodes have. */
576 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
577 of this is needed. So it cannot be in a register.
578 In a FUNCTION_DECL it has no meaning.
579 In LABEL_DECL nodes, it means a goto for this label has been seen
580 from a place outside all binding contours that restore stack levels.
581 In an artificial SSA_NAME that points to a stack partition with at least
582 two variables, it means that at least one variable has TREE_ADDRESSABLE.
583 In ..._TYPE nodes, it means that objects of this type must be fully
584 addressable. This means that pieces of this object cannot go into
585 register parameters, for example. If this a function type, this
586 means that the value must be returned in memory.
587 In CONSTRUCTOR nodes, it means object constructed must be in memory.
588 In IDENTIFIER_NODEs, this means that some extern decl for this name
589 had its address taken. That matters for inline functions.
590 In a STMT_EXPR, it means we want the result of the enclosed expression. */
591 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
593 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
594 exit of a function. Calls for which this is true are candidates for tail
595 call optimizations. */
596 #define CALL_EXPR_TAILCALL(NODE) \
597 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
599 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
600 CASE_LOW operand has been processed. */
601 #define CASE_LOW_SEEN(NODE) \
602 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
604 #define PREDICT_EXPR_OUTCOME(NODE) \
605 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
606 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
607 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
608 #define PREDICT_EXPR_PREDICTOR(NODE) \
609 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
611 /* In a VAR_DECL, nonzero means allocate static storage.
612 In a FUNCTION_DECL, nonzero if function has been defined.
613 In a CONSTRUCTOR, nonzero means allocate static storage. */
614 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
616 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
617 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
619 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
620 should only be executed if an exception is thrown, not on normal exit
622 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
624 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
625 separate cleanup in honor_protect_cleanup_actions. */
626 #define TRY_CATCH_IS_CLEANUP(NODE) \
627 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
629 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
630 CASE_HIGH operand has been processed. */
631 #define CASE_HIGH_SEEN(NODE) \
632 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
634 /* Used to mark scoped enums. */
635 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
637 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
638 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
640 /* In an expr node (usually a conversion) this means the node was made
641 implicitly and should not lead to any sort of warning. In a decl node,
642 warnings concerning the decl should be suppressed. This is used at
643 least for used-before-set warnings, and it set after one warning is
645 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
647 /* Used to indicate that this TYPE represents a compiler-generated entity. */
648 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
650 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
651 this string as an argument. */
652 #define TREE_SYMBOL_REFERENCED(NODE) \
653 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
655 /* Nonzero in a pointer or reference type means the data pointed to
656 by this type can alias anything. */
657 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
658 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
660 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
661 there was an overflow in folding. */
663 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
665 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
667 #define TREE_OVERFLOW_P(EXPR) \
668 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
670 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
671 nonzero means name is to be accessible from outside this translation unit.
672 In an IDENTIFIER_NODE, nonzero means an external declaration
673 accessible from outside this translation unit was previously seen
674 for this name in an inner scope. */
675 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
677 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
678 of cached values, or is something else. */
679 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
681 /* In a SAVE_EXPR, indicates that the original expression has already
682 been substituted with a VAR_DECL that contains the value. */
683 #define SAVE_EXPR_RESOLVED_P(NODE) \
684 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
686 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
688 #define CALL_EXPR_VA_ARG_PACK(NODE) \
689 (CALL_EXPR_CHECK (NODE)->base.public_flag)
691 /* In any expression, decl, or constant, nonzero means it has side effects or
692 reevaluation of the whole expression could produce a different value.
693 This is set if any subexpression is a function call, a side effect or a
694 reference to a volatile variable. In a ..._DECL, this is set only if the
695 declaration said `volatile'. This will never be set for a constant. */
696 #define TREE_SIDE_EFFECTS(NODE) \
697 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
699 /* In a LABEL_DECL, nonzero means this label had its address taken
700 and therefore can never be deleted and is a jump target for
702 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
704 /* Nonzero means this expression is volatile in the C sense:
705 its address should be of type `volatile WHATEVER *'.
706 In other words, the declared item is volatile qualified.
707 This is used in _DECL nodes and _REF nodes.
708 On a FUNCTION_DECL node, this means the function does not
709 return normally. This is the same effect as setting
710 the attribute noreturn on the function in C.
712 In a ..._TYPE node, means this type is volatile-qualified.
713 But use TYPE_VOLATILE instead of this macro when the node is a type,
714 because eventually we may make that a different bit.
716 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
717 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
719 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
720 accessing the memory pointed to won't generate a trap. However,
721 this only applies to an object when used appropriately: it doesn't
722 mean that writing a READONLY mem won't trap.
724 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
725 (or slice of the array) always belongs to the range of the array.
726 I.e. that the access will not trap, provided that the access to
727 the base to the array will not trap. */
728 #define TREE_THIS_NOTRAP(NODE) \
729 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
730 ARRAY_RANGE_REF)->base.nothrow_flag)
732 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
733 nonzero means it may not be the lhs of an assignment.
734 Nonzero in a FUNCTION_DECL means this function should be treated
735 as "const" function (can only read its arguments). */
736 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
738 /* Value of expression is constant. Always on in all ..._CST nodes. May
739 also appear in an expression or decl where the value is constant. */
740 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
742 /* Nonzero if NODE, a type, has had its sizes gimplified. */
743 #define TYPE_SIZES_GIMPLIFIED(NODE) \
744 (TYPE_CHECK (NODE)->base.constant_flag)
746 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
747 #define DECL_UNSIGNED(NODE) \
748 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
750 /* In integral and pointer types, means an unsigned type. */
751 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
753 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
754 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
756 /* True if overflow wraps around for the given integral type. That
757 is, TYPE_MAX + 1 == TYPE_MIN. */
758 #define TYPE_OVERFLOW_WRAPS(TYPE) \
759 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
761 /* True if overflow is undefined for the given integral type. We may
762 optimize on the assumption that values in the type never overflow.
764 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
765 must issue a warning based on warn_strict_overflow. In some cases
766 it will be appropriate to issue the warning immediately, and in
767 other cases it will be appropriate to simply set a flag and let the
768 caller decide whether a warning is appropriate or not. */
769 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
770 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
772 /* True if overflow for the given integral type should issue a
774 #define TYPE_OVERFLOW_TRAPS(TYPE) \
775 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
777 /* True if pointer types have undefined overflow. */
778 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
780 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
781 Nonzero in a FUNCTION_DECL means that the function has been compiled.
782 This is interesting in an inline function, since it might not need
783 to be compiled separately.
784 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
785 or TYPE_DECL if the debugging info for the type has been written.
786 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
787 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
789 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
791 /* Nonzero in a _DECL if the name is used in its scope.
792 Nonzero in an expr node means inhibit warning if value is unused.
793 In IDENTIFIER_NODEs, this means that some extern decl for this name
795 In a BLOCK, this means that the block contains variables that are used. */
796 #define TREE_USED(NODE) ((NODE)->base.used_flag)
798 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
799 throw an exception. In a CALL_EXPR, nonzero means the call cannot
800 throw. We can't easily check the node type here as the C++
801 frontend also uses this flag (for AGGR_INIT_EXPR). */
802 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
804 /* In a CALL_EXPR, means that it's safe to use the target of the call
805 expansion as the return slot for a call that returns in memory. */
806 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
807 (CALL_EXPR_CHECK (NODE)->base.private_flag)
809 /* Cilk keywords accessors. */
810 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
812 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
813 passed by invisible reference (and the TREE_TYPE is a pointer to the true
815 #define DECL_BY_REFERENCE(NODE) \
816 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
817 RESULT_DECL)->decl_common.decl_by_reference_flag)
819 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
821 #define DECL_READ_P(NODE) \
822 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
824 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
825 attempting to share the stack slot with some other variable. */
826 #define DECL_NONSHAREABLE(NODE) \
827 (TREE_CHECK2 (NODE, VAR_DECL, \
828 RESULT_DECL)->decl_common.decl_nonshareable_flag)
830 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
831 thunked-to function. */
832 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
834 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
835 it has been built for the declaration of a variable-sized object. */
836 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
837 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
839 /* In a type, nonzero means that all objects of the type are guaranteed by the
840 language or front-end to be properly aligned, so we can indicate that a MEM
841 of this type is aligned at least to the alignment of the type, even if it
842 doesn't appear that it is. We see this, for example, in object-oriented
843 languages where a tag field may show this is an object of a more-aligned
844 variant of the more generic type.
846 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
848 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
850 /* Used in classes in C++. */
851 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
852 /* Used in classes in C++. */
853 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
855 /* True if reference type NODE is a C++ rvalue reference. */
856 #define TYPE_REF_IS_RVALUE(NODE) \
857 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
859 /* Nonzero in a _DECL if the use of the name is defined as a
860 deprecated feature by __attribute__((deprecated)). */
861 #define TREE_DEPRECATED(NODE) \
862 ((NODE)->base.deprecated_flag)
864 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
865 uses are to be substituted for uses of the TREE_CHAINed identifier. */
866 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
867 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
869 /* In fixed-point types, means a saturating type. */
870 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
872 /* These flags are available for each language front end to use internally. */
873 #define TREE_LANG_FLAG_0(NODE) \
874 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
875 #define TREE_LANG_FLAG_1(NODE) \
876 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
877 #define TREE_LANG_FLAG_2(NODE) \
878 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
879 #define TREE_LANG_FLAG_3(NODE) \
880 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
881 #define TREE_LANG_FLAG_4(NODE) \
882 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
883 #define TREE_LANG_FLAG_5(NODE) \
884 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
885 #define TREE_LANG_FLAG_6(NODE) \
886 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
888 /* Define additional fields and accessors for nodes representing constants. */
890 #define TREE_INT_CST_NUNITS(NODE) \
891 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
892 #define TREE_INT_CST_EXT_NUNITS(NODE) \
893 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
894 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
895 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
896 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
897 #define TREE_INT_CST_LOW(NODE) \
898 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
900 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
901 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
903 #define TREE_FIXED_CST_PTR(NODE) \
904 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
905 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
907 /* In a STRING_CST */
908 /* In C terms, this is sizeof, not strlen. */
909 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
910 #define TREE_STRING_POINTER(NODE) \
911 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
913 /* In a COMPLEX_CST node. */
914 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
915 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
917 /* In a VECTOR_CST node. */
918 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
919 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
920 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
922 /* Define fields and accessors for some special-purpose tree nodes. */
924 #define IDENTIFIER_LENGTH(NODE) \
925 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
926 #define IDENTIFIER_POINTER(NODE) \
927 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
928 #define IDENTIFIER_HASH_VALUE(NODE) \
929 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
931 /* Translate a hash table identifier pointer to a tree_identifier
932 pointer, and vice versa. */
934 #define HT_IDENT_TO_GCC_IDENT(NODE) \
935 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
936 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
938 /* In a TREE_LIST node. */
939 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
940 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
942 /* In a TREE_VEC node. */
943 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
944 #define TREE_VEC_END(NODE) \
945 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
947 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
949 /* In a CONSTRUCTOR node. */
950 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
951 #define CONSTRUCTOR_ELT(NODE,IDX) \
952 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
953 #define CONSTRUCTOR_NELTS(NODE) \
954 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
955 #define CONSTRUCTOR_NO_CLEARING(NODE) \
956 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
958 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
959 value of each element (stored within VAL). IX must be a scratch variable
960 of unsigned integer type. */
961 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
962 for (IX = 0; (IX >= vec_safe_length (V)) \
964 : ((VAL = (*(V))[IX].value), \
968 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
969 the value of each element (stored within VAL) and its index (stored
970 within INDEX). IX must be a scratch variable of unsigned integer type. */
971 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
972 for (IX = 0; (IX >= vec_safe_length (V)) \
974 : (((void) (VAL = (*V)[IX].value)), \
975 (INDEX = (*V)[IX].index), \
979 /* Append a new constructor element to V, with the specified INDEX and VAL. */
980 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
982 constructor_elt _ce___ = {INDEX, VALUE}; \
983 vec_safe_push ((V), _ce___); \
986 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
987 constructor output purposes. */
988 #define CONSTRUCTOR_BITFIELD_P(NODE) \
989 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
991 /* True if NODE is a clobber right hand side, an expression of indeterminate
992 value that clobbers the LHS in a copy instruction. We use a volatile
993 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
994 In particular the volatile flag causes us to not prematurely remove
995 such clobber instructions. */
996 #define TREE_CLOBBER_P(NODE) \
997 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
999 /* Define fields and accessors for some nodes that represent expressions. */
1001 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1002 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1003 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1004 && integer_zerop (TREE_OPERAND (NODE, 0)))
1006 /* In ordinary expression nodes. */
1007 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1008 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1010 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1011 length. Its value includes the length operand itself; that is,
1012 the minimum valid length is 1.
1013 Note that we have to bypass the use of TREE_OPERAND to access
1014 that field to avoid infinite recursion in expanding the macros. */
1015 #define VL_EXP_OPERAND_LENGTH(NODE) \
1016 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1018 /* Nonzero if is_gimple_debug() may possibly hold. */
1019 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1021 /* In a LOOP_EXPR node. */
1022 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1024 /* The source location of this expression. Non-tree_exp nodes such as
1025 decls and constants can be shared among multiple locations, so
1027 #define EXPR_LOCATION(NODE) \
1028 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1029 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1030 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1031 != UNKNOWN_LOCATION)
1032 /* The location to be used in a diagnostic about this expression. Do not
1033 use this macro if the location will be assigned to other expressions. */
1034 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1035 ? (NODE)->exp.locus : (LOCUS))
1036 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1037 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1039 /* True if a tree is an expression or statement that can have a
1041 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1043 extern void protected_set_expr_location (tree
, location_t
);
1045 /* In a TARGET_EXPR node. */
1046 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1047 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1048 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1050 /* DECL_EXPR accessor. This gives access to the DECL associated with
1051 the given declaration statement. */
1052 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1054 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1056 /* COMPOUND_LITERAL_EXPR accessors. */
1057 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1058 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1059 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1060 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1062 /* SWITCH_EXPR accessors. These give access to the condition, body and
1063 original condition type (before any compiler conversions)
1064 of the switch statement, respectively. */
1065 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1066 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1067 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1069 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1070 of a case label, respectively. */
1071 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1072 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1073 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1074 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1076 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1077 corresponding MEM_REF operands. */
1078 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1079 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1080 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1081 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1082 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1084 /* The operands of a BIND_EXPR. */
1085 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1086 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1087 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1089 /* GOTO_EXPR accessor. This gives access to the label associated with
1090 a goto statement. */
1091 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1093 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1094 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1095 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1097 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1098 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1099 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1100 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1101 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1102 /* Nonzero if we want to create an ASM_INPUT instead of an
1103 ASM_OPERAND with no operands. */
1104 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1105 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1107 /* COND_EXPR accessors. */
1108 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1109 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1110 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1112 /* Accessors for the chains of recurrences. */
1113 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1114 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1115 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1116 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1118 /* LABEL_EXPR accessor. This gives access to the label associated with
1119 the given label expression. */
1120 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1122 /* CATCH_EXPR accessors. */
1123 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1124 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1126 /* EH_FILTER_EXPR accessors. */
1127 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1128 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1130 /* OBJ_TYPE_REF accessors. */
1131 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1132 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1133 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1135 /* ASSERT_EXPR accessors. */
1136 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1137 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1139 /* CALL_EXPR accessors. */
1140 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1141 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1142 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1143 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1144 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1146 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1147 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1148 the argument count is zero when checking is enabled. Instead, do
1149 the pointer arithmetic to advance past the 3 fixed operands in a
1150 CALL_EXPR. That produces a valid pointer to just past the end of the
1151 operand array, even if it's not valid to dereference it. */
1152 #define CALL_EXPR_ARGP(NODE) \
1153 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1155 /* TM directives and accessors. */
1156 #define TRANSACTION_EXPR_BODY(NODE) \
1157 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1158 #define TRANSACTION_EXPR_OUTER(NODE) \
1159 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1160 #define TRANSACTION_EXPR_RELAXED(NODE) \
1161 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1163 /* OpenMP directive and clause accessors. */
1165 #define OMP_BODY(NODE) \
1166 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1167 #define OMP_CLAUSES(NODE) \
1168 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1170 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1171 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1173 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1174 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1176 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1177 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1178 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1180 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1181 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1182 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1183 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1184 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1185 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1186 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1188 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1189 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1191 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1193 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1194 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1196 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1198 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1200 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1202 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1203 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1205 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1206 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1208 #define OMP_TARGET_DATA_BODY(NODE) \
1209 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1210 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1211 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1213 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1214 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1216 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1217 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1219 #define OMP_CLAUSE_SIZE(NODE) \
1220 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1224 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1225 #define OMP_CLAUSE_DECL(NODE) \
1226 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1227 OMP_CLAUSE_PRIVATE, \
1228 OMP_CLAUSE__LOOPTEMP_), 0)
1229 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1230 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1231 != UNKNOWN_LOCATION)
1232 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1234 /* True on an OMP_SECTION statement that was the last lexical member.
1235 This status is meaningful in the implementation of lastprivate. */
1236 #define OMP_SECTION_LAST(NODE) \
1237 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1239 /* True on an OMP_PARALLEL statement if it represents an explicit
1240 combined parallel work-sharing constructs. */
1241 #define OMP_PARALLEL_COMBINED(NODE) \
1242 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1244 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1245 as opposed to relaxed. */
1246 #define OMP_ATOMIC_SEQ_CST(NODE) \
1247 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1248 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1250 /* True on a PRIVATE clause if its decl is kept around for debugging
1251 information only and its DECL_VALUE_EXPR is supposed to point
1252 to what it has been remapped to. */
1253 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1254 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1256 /* True on a PRIVATE clause if ctor needs access to outer region's
1258 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1259 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1261 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1262 decl is present in the chain. */
1263 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1264 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1265 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1266 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1267 OMP_CLAUSE_LASTPRIVATE),\
1269 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1270 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1272 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1273 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1274 #define OMP_CLAUSE_IF_EXPR(NODE) \
1275 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1276 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1277 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1278 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1279 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1281 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1282 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1284 #define OMP_CLAUSE_MAP_KIND(NODE) \
1285 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1287 /* Nonzero if this map clause is for array (rather than pointer) based array
1288 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1289 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1290 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1291 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1293 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1294 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1296 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1297 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1298 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1299 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1300 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1301 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1303 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1304 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1305 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1306 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1307 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1308 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1309 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1310 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1311 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1312 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1313 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1314 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1316 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1317 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1318 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1319 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1321 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1322 are always initialized inside of the loop construct, false otherwise. */
1323 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1324 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1326 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1327 are declared inside of the simd construct. */
1328 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1329 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1331 /* True if a LINEAR clause has a stride that is variable. */
1332 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1333 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1335 /* True if a LINEAR clause is for an array or allocatable variable that
1336 needs special handling by the frontend. */
1337 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1338 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1340 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1341 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1343 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1344 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1346 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1347 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1349 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1350 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1352 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1353 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1355 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1356 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1357 OMP_CLAUSE_THREAD_LIMIT), 0)
1359 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1360 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1362 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1363 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1364 OMP_CLAUSE_DIST_SCHEDULE), 0)
1366 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1367 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1369 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1370 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1372 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1373 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1375 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1376 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1378 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1379 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1381 /* SSA_NAME accessors. */
1383 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1384 if there is no name associated with it. */
1385 #define SSA_NAME_IDENTIFIER(NODE) \
1386 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1387 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1388 ? (NODE)->ssa_name.var \
1389 : DECL_NAME ((NODE)->ssa_name.var)) \
1392 /* Returns the variable being referenced. This can be NULL_TREE for
1393 temporaries not associated with any user variable.
1394 Once released, this is the only field that can be relied upon. */
1395 #define SSA_NAME_VAR(NODE) \
1396 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1397 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1398 ? NULL_TREE : (NODE)->ssa_name.var)
1400 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1401 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1403 /* Returns the statement which defines this SSA name. */
1404 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1406 /* Returns the SSA version number of this SSA name. Note that in
1407 tree SSA, version numbers are not per variable and may be recycled. */
1408 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1410 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1411 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1413 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1414 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1416 /* Nonzero if this SSA_NAME expression is currently on the free list of
1417 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1418 has no meaning for an SSA_NAME. */
1419 #define SSA_NAME_IN_FREE_LIST(NODE) \
1420 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1422 /* Nonzero if this SSA_NAME is the default definition for the
1423 underlying symbol. A default SSA name is created for symbol S if
1424 the very first reference to S in the function is a read operation.
1425 Default definitions are always created by an empty statement and
1426 belong to no basic block. */
1427 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1428 SSA_NAME_CHECK (NODE)->base.default_def_flag
1430 /* Attributes for SSA_NAMEs for pointer-type variables. */
1431 #define SSA_NAME_PTR_INFO(N) \
1432 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1434 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1435 #define SSA_NAME_ANTI_RANGE_P(N) \
1436 SSA_NAME_CHECK (N)->base.static_flag
1438 /* The type of range described by SSA_NAME_RANGE_INFO. */
1439 #define SSA_NAME_RANGE_TYPE(N) \
1440 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1442 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1443 #define SSA_NAME_RANGE_INFO(N) \
1444 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1446 /* Return the immediate_use information for an SSA_NAME. */
1447 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1449 #define OMP_CLAUSE_CODE(NODE) \
1450 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1452 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1453 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1455 #define OMP_CLAUSE_OPERAND(NODE, I) \
1456 OMP_CLAUSE_ELT_CHECK (NODE, I)
1458 /* In a BLOCK node. */
1459 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1460 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1461 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1462 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1463 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1464 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1465 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1466 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1467 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1468 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1469 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1471 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1472 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1474 /* An index number for this block. These values are not guaranteed to
1475 be unique across functions -- whether or not they are depends on
1476 the debugging output format in use. */
1477 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1479 /* If block reordering splits a lexical block into discontiguous
1480 address ranges, we'll make a copy of the original block.
1482 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1483 In that case, we have one source block that has been replicated
1484 (through inlining or unrolling) into many logical blocks, and that
1485 these logical blocks have different physical variables in them.
1487 In this case, we have one logical block split into several
1488 non-contiguous address ranges. Most debug formats can't actually
1489 represent this idea directly, so we fake it by creating multiple
1490 logical blocks with the same variables in them. However, for those
1491 that do support non-contiguous regions, these allow the original
1492 logical block to be reconstructed, along with the set of address
1495 One of the logical block fragments is arbitrarily chosen to be
1496 the ORIGIN. The other fragments will point to the origin via
1497 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1498 be null. The list of fragments will be chained through
1499 BLOCK_FRAGMENT_CHAIN from the origin. */
1501 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1502 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1504 /* For an inlined function, this gives the location where it was called
1505 from. This is only set in the top level block, which corresponds to the
1506 inlined function scope. This is used in the debug output routines. */
1508 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1510 /* This gives the location of the end of the block, useful to attach
1511 code implicitly generated for outgoing paths. */
1513 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1515 /* Define fields and accessors for nodes representing data types. */
1517 /* See tree.def for documentation of the use of these fields.
1518 Look at the documentation of the various ..._TYPE tree codes.
1520 Note that the type.values, type.minval, and type.maxval fields are
1521 overloaded and used for different macros in different kinds of types.
1522 Each macro must check to ensure the tree node is of the proper kind of
1523 type. Note also that some of the front-ends also overload these fields,
1524 so they must be checked as well. */
1526 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1527 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1528 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1529 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1530 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1531 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1532 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1533 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1534 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1535 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1537 #define TYPE_MODE(NODE) \
1538 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1539 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1540 #define SET_TYPE_MODE(NODE, MODE) \
1541 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1543 /* The "canonical" type for this type node, which is used by frontends to
1544 compare the type for equality with another type. If two types are
1545 equal (based on the semantics of the language), then they will have
1546 equivalent TYPE_CANONICAL entries.
1548 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1549 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1550 be used for comparison against other types. Instead, the type is
1551 said to require structural equality checks, described in
1552 TYPE_STRUCTURAL_EQUALITY_P.
1554 For unqualified aggregate and function types the middle-end relies on
1555 TYPE_CANONICAL to tell whether two variables can be assigned
1556 to each other without a conversion. The middle-end also makes sure
1557 to assign the same alias-sets to the type partition with equal
1558 TYPE_CANONICAL of their unqualified variants. */
1559 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1560 /* Indicates that the type node requires structural equality
1561 checks. The compiler will need to look at the composition of the
1562 type to determine whether it is equal to another type, rather than
1563 just comparing canonical type pointers. For instance, we would need
1564 to look at the return and parameter types of a FUNCTION_TYPE
1566 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1567 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1568 type node requires structural equality. */
1569 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1571 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1572 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1574 /* The (language-specific) typed-based alias set for this type.
1575 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1576 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1577 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1578 type can alias objects of any type. */
1579 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1581 /* Nonzero iff the typed-based alias set for this type has been
1583 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1584 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1586 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1588 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1590 /* The alignment necessary for objects of this type.
1591 The value is an int, measured in bits. */
1592 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1594 /* 1 if the alignment for this type was requested by "aligned" attribute,
1595 0 if it is the default for this type. */
1596 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1598 /* The alignment for NODE, in bytes. */
1599 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1601 /* If your language allows you to declare types, and you want debug info
1602 for them, then you need to generate corresponding TYPE_DECL nodes.
1603 These "stub" TYPE_DECL nodes have no name, and simply point at the
1604 type node. You then set the TYPE_STUB_DECL field of the type node
1605 to point back at the TYPE_DECL node. This allows the debug routines
1606 to know that the two nodes represent the same type, so that we only
1607 get one debug info record for them. */
1608 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1610 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1611 the type has BLKmode only because it lacks the alignment required for
1613 #define TYPE_NO_FORCE_BLK(NODE) \
1614 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1616 /* Nonzero in a type considered volatile as a whole. */
1617 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1619 /* Nonzero in a type considered atomic as a whole. */
1620 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1622 /* Means this type is const-qualified. */
1623 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1625 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1627 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1629 /* If nonzero, type's name shouldn't be emitted into debug info. */
1630 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1632 /* The address space the type is in. */
1633 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1635 /* Encode/decode the named memory support as part of the qualifier. If more
1636 than 8 qualifiers are added, these macros need to be adjusted. */
1637 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1638 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1640 /* Return all qualifiers except for the address space qualifiers. */
1641 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1643 /* Only keep the address space out of the qualifiers and discard the other
1645 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1647 /* The set of type qualifiers for this type. */
1648 #define TYPE_QUALS(NODE) \
1649 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1650 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1651 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1652 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1653 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1655 /* The same as TYPE_QUALS without the address space qualifications. */
1656 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1657 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1658 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1659 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1660 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1662 /* The same as TYPE_QUALS without the address space and atomic
1664 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1665 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1666 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1667 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1669 /* These flags are available for each language front end to use internally. */
1670 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1671 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1672 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1673 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1674 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1675 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1676 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1678 /* Used to keep track of visited nodes in tree traversals. This is set to
1679 0 by copy_node and make_node. */
1680 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1682 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1683 that distinguish string from array of char).
1684 If set in a INTEGER_TYPE, indicates a character type. */
1685 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1687 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1688 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1689 (((unsigned HOST_WIDE_INT) 1) \
1690 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1692 /* Set precision to n when we have 2^n sub-parts of the vector. */
1693 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1694 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1696 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1697 about missing conversions to other vector types of the same size. */
1698 #define TYPE_VECTOR_OPAQUE(NODE) \
1699 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1701 /* Indicates that objects of this type must be initialized by calling a
1702 function when they are created. */
1703 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1704 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1706 /* Indicates that a UNION_TYPE object should be passed the same way that
1707 the first union alternative would be passed, or that a RECORD_TYPE
1708 object should be passed the same way that the first (and only) member
1710 #define TYPE_TRANSPARENT_AGGR(NODE) \
1711 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1713 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1714 address of a component of the type. This is the counterpart of
1715 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1716 #define TYPE_NONALIASED_COMPONENT(NODE) \
1717 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1719 /* Indicated that objects of this type should be laid out in as
1720 compact a way as possible. */
1721 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1723 /* Used by type_contains_placeholder_p to avoid recomputation.
1724 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1725 this field directly. */
1726 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1727 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1729 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1730 #define TYPE_FINAL_P(NODE) \
1731 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1733 /* The debug output functions use the symtab union field to store
1734 information specific to the debugging format. The different debug
1735 output hooks store different types in the union field. These three
1736 macros are used to access different fields in the union. The debug
1737 hooks are responsible for consistently using only a specific
1740 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1741 hold the type's number in the generated stabs. */
1742 #define TYPE_SYMTAB_ADDRESS(NODE) \
1743 (TYPE_CHECK (NODE)->type_common.symtab.address)
1745 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1746 hold struct/union type tag names. */
1747 #define TYPE_SYMTAB_POINTER(NODE) \
1748 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1750 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1751 in dwarf2out.c to point to the DIE generated for the type. */
1752 #define TYPE_SYMTAB_DIE(NODE) \
1753 (TYPE_CHECK (NODE)->type_common.symtab.die)
1755 /* The garbage collector needs to know the interpretation of the
1756 symtab field. These constants represent the different types in the
1759 #define TYPE_SYMTAB_IS_ADDRESS (0)
1760 #define TYPE_SYMTAB_IS_POINTER (1)
1761 #define TYPE_SYMTAB_IS_DIE (2)
1763 #define TYPE_LANG_SPECIFIC(NODE) \
1764 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1766 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1767 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1768 #define TYPE_FIELDS(NODE) \
1769 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1770 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1771 #define TYPE_ARG_TYPES(NODE) \
1772 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1773 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1775 #define TYPE_METHODS(NODE) \
1776 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1777 #define TYPE_VFIELD(NODE) \
1778 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1779 #define TYPE_METHOD_BASETYPE(NODE) \
1780 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1781 #define TYPE_OFFSET_BASETYPE(NODE) \
1782 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1783 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1784 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1785 #define TYPE_NEXT_PTR_TO(NODE) \
1786 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1787 #define TYPE_NEXT_REF_TO(NODE) \
1788 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1789 #define TYPE_MIN_VALUE(NODE) \
1790 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1791 #define TYPE_MAX_VALUE(NODE) \
1792 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1794 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1795 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1797 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1798 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1800 /* For record and union types, information about this type, as a base type
1802 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1804 /* For non record and union types, used in a language-dependent way. */
1805 #define TYPE_LANG_SLOT_1(NODE) \
1806 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1808 /* Define accessor macros for information about type inheritance
1811 A "basetype" means a particular usage of a data type for inheritance
1812 in another type. Each such basetype usage has its own "binfo"
1813 object to describe it. The binfo object is a TREE_VEC node.
1815 Inheritance is represented by the binfo nodes allocated for a
1816 given type. For example, given types C and D, such that D is
1817 inherited by C, 3 binfo nodes will be allocated: one for describing
1818 the binfo properties of C, similarly one for D, and one for
1819 describing the binfo properties of D as a base type for C.
1820 Thus, given a pointer to class C, one can get a pointer to the binfo
1821 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1823 /* BINFO specific flags. */
1825 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1826 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1828 /* Flags for language dependent use. */
1829 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1830 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1831 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1832 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1833 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1834 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1835 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1837 /* The actual data type node being inherited in this basetype. */
1838 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1840 /* The offset where this basetype appears in its containing type.
1841 BINFO_OFFSET slot holds the offset (in bytes)
1842 from the base of the complete object to the base of the part of the
1843 object that is allocated on behalf of this `type'.
1844 This is always 0 except when there is multiple inheritance. */
1846 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1847 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1849 /* The virtual function table belonging to this basetype. Virtual
1850 function tables provide a mechanism for run-time method dispatching.
1851 The entries of a virtual function table are language-dependent. */
1853 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1855 /* The virtual functions in the virtual function table. This is
1856 a TREE_LIST that is used as an initial approximation for building
1857 a virtual function table for this basetype. */
1858 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1860 /* A vector of binfos for the direct basetypes inherited by this
1863 If this basetype describes type D as inherited in C, and if the
1864 basetypes of D are E and F, then this vector contains binfos for
1865 inheritance of E and F by C. */
1866 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1868 /* The number of basetypes for NODE. */
1869 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1871 /* Accessor macro to get to the Nth base binfo of this binfo. */
1872 #define BINFO_BASE_BINFO(NODE,N) \
1873 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1874 #define BINFO_BASE_ITERATE(NODE,N,B) \
1875 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1876 #define BINFO_BASE_APPEND(NODE,T) \
1877 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1879 /* For a BINFO record describing a virtual base class, i.e., one where
1880 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1881 base. The actual contents are language-dependent. In the C++
1882 front-end this field is an INTEGER_CST giving an offset into the
1883 vtable where the offset to the virtual base can be found. */
1884 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1886 /* Indicates the accesses this binfo has to its bases. The values are
1887 access_public_node, access_protected_node or access_private_node.
1888 If this array is not present, public access is implied. */
1889 #define BINFO_BASE_ACCESSES(NODE) \
1890 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1892 #define BINFO_BASE_ACCESS(NODE,N) \
1893 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1894 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1895 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1897 /* The index in the VTT where this subobject's sub-VTT can be found.
1898 NULL_TREE if there is no sub-VTT. */
1899 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1901 /* The index in the VTT where the vptr for this subobject can be
1902 found. NULL_TREE if there is no secondary vptr in the VTT. */
1903 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1905 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1906 inheriting this base for non-virtual bases. For virtual bases it
1907 points either to the binfo for which this is a primary binfo, or to
1908 the binfo of the most derived type. */
1909 #define BINFO_INHERITANCE_CHAIN(NODE) \
1910 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1913 /* Define fields and accessors for nodes representing declared names. */
1915 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1916 have an associated SSA name. */
1917 #define SSA_VAR_P(DECL) \
1918 (TREE_CODE (DECL) == VAR_DECL \
1919 || TREE_CODE (DECL) == PARM_DECL \
1920 || TREE_CODE (DECL) == RESULT_DECL \
1921 || TREE_CODE (DECL) == SSA_NAME)
1924 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1926 /* This is the name of the object as written by the user.
1927 It is an IDENTIFIER_NODE. */
1928 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1930 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
1931 #define TYPE_IDENTIFIER(NODE) \
1932 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
1933 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
1935 /* Every ..._DECL node gets a unique number. */
1936 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1938 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1940 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1942 /* Every ..._DECL node gets a unique number that stays the same even
1943 when the decl is copied by the inliner once it is set. */
1944 #define DECL_PT_UID(NODE) \
1945 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1946 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1947 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1948 #define SET_DECL_PT_UID(NODE, UID) \
1949 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1950 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1951 be preserved when copyin the decl. */
1952 #define DECL_PT_UID_SET_P(NODE) \
1953 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1955 /* These two fields describe where in the source code the declaration
1956 was. If the declaration appears in several places (as for a C
1957 function that is declared first and then defined later), this
1958 information should refer to the definition. */
1959 #define DECL_SOURCE_LOCATION(NODE) \
1960 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1961 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1962 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1963 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1964 /* This accessor returns TRUE if the decl it operates on was created
1965 by a front-end or back-end rather than by user code. In this case
1966 builtin-ness is indicated by source location. */
1967 #define DECL_IS_BUILTIN(DECL) \
1968 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1970 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1971 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1972 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1973 nodes, this points to either the FUNCTION_DECL for the containing
1974 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1975 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1976 scope". In particular, for VAR_DECLs which are virtual table pointers
1977 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1979 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1980 #define DECL_FIELD_CONTEXT(NODE) \
1981 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1983 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1984 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1986 /* For any sort of a ..._DECL node, this points to the original (abstract)
1987 decl node which this decl is an inlined/cloned instance of, or else it
1988 is NULL indicating that this decl is not an instance of some other decl.
1990 The C front-end also uses this in a nested declaration of an inline
1991 function, to point back to the definition. */
1992 #define DECL_ABSTRACT_ORIGIN(NODE) \
1993 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1995 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1996 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1997 #define DECL_ORIGIN(NODE) \
1998 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2000 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2001 inline instance of some original (abstract) decl from an inline function;
2002 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2003 nodes can also have their abstract origin set to themselves. */
2004 #define DECL_FROM_INLINE(NODE) \
2005 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2006 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2008 /* In a DECL this is the field where attributes are stored. */
2009 #define DECL_ATTRIBUTES(NODE) \
2010 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2012 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2013 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2014 For a VAR_DECL, holds the initial value.
2015 For a PARM_DECL, used for DECL_ARG_TYPE--default
2016 values for parameters are encoded in the type of the function,
2017 not in the PARM_DECL slot.
2018 For a FIELD_DECL, this is used for enumeration values and the C
2019 frontend uses it for temporarily storing bitwidth of bitfields.
2021 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2022 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2024 /* Holds the size of the datum, in bits, as a tree expression.
2025 Need not be constant. */
2026 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2027 /* Likewise for the size in bytes. */
2028 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2029 /* Holds the alignment required for the datum, in bits. */
2030 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2031 /* The alignment of NODE, in bytes. */
2032 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2033 /* Set if the alignment of this DECL has been set by the user, for
2034 example with an 'aligned' attribute. */
2035 #define DECL_USER_ALIGN(NODE) \
2036 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2037 /* Holds the machine mode corresponding to the declaration of a variable or
2038 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2040 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2042 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2043 operation it is. Note, however, that this field is overloaded, with
2044 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2045 checked before any access to the former. */
2046 #define DECL_FUNCTION_CODE(NODE) \
2047 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2049 #define DECL_FUNCTION_PERSONALITY(NODE) \
2050 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2052 /* Nonzero for a given ..._DECL node means that the name of this node should
2053 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2054 the associated type should be ignored. For a FUNCTION_DECL, the body of
2055 the function should also be ignored. */
2056 #define DECL_IGNORED_P(NODE) \
2057 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2059 /* Nonzero for a given ..._DECL node means that this node represents an
2060 "abstract instance" of the given declaration (e.g. in the original
2061 declaration of an inline function). When generating symbolic debugging
2062 information, we mustn't try to generate any address information for nodes
2063 marked as "abstract instances" because we don't actually generate
2064 any code or allocate any data space for such instances. */
2065 #define DECL_ABSTRACT(NODE) \
2066 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2068 /* Language-specific decl information. */
2069 #define DECL_LANG_SPECIFIC(NODE) \
2070 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2072 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2073 do not allocate storage, and refer to a definition elsewhere. Note that
2074 this does not necessarily imply the entity represented by NODE
2075 has no program source-level definition in this translation unit. For
2076 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2077 DECL_EXTERNAL may be true simultaneously; that can be the case for
2078 a C99 "extern inline" function. */
2079 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2081 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2082 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2084 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2086 Also set in some languages for variables, etc., outside the normal
2087 lexical scope, such as class instance variables. */
2088 #define DECL_NONLOCAL(NODE) \
2089 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2091 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2092 Used in FIELD_DECLs for vtable pointers.
2093 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2094 #define DECL_VIRTUAL_P(NODE) \
2095 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2097 /* Used to indicate that this DECL represents a compiler-generated entity. */
2098 #define DECL_ARTIFICIAL(NODE) \
2099 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2101 /* Additional flags for language-specific uses. */
2102 #define DECL_LANG_FLAG_0(NODE) \
2103 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2104 #define DECL_LANG_FLAG_1(NODE) \
2105 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2106 #define DECL_LANG_FLAG_2(NODE) \
2107 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2108 #define DECL_LANG_FLAG_3(NODE) \
2109 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2110 #define DECL_LANG_FLAG_4(NODE) \
2111 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2112 #define DECL_LANG_FLAG_5(NODE) \
2113 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2114 #define DECL_LANG_FLAG_6(NODE) \
2115 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2116 #define DECL_LANG_FLAG_7(NODE) \
2117 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2118 #define DECL_LANG_FLAG_8(NODE) \
2119 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2121 /* Nonzero for a scope which is equal to file scope. */
2122 #define SCOPE_FILE_SCOPE_P(EXP) \
2123 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2124 /* Nonzero for a decl which is at file scope. */
2125 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2126 /* Nonzero for a type which is at file scope. */
2127 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2129 /* Nonzero for a decl that is decorated using attribute used.
2130 This indicates to compiler tools that this decl needs to be preserved. */
2131 #define DECL_PRESERVE_P(DECL) \
2132 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2134 /* For function local variables of COMPLEX and VECTOR types,
2135 indicates that the variable is not aliased, and that all
2136 modifications to the variable have been adjusted so that
2137 they are killing assignments. Thus the variable may now
2138 be treated as a GIMPLE register, and use real instead of
2139 virtual ops in SSA form. */
2140 #define DECL_GIMPLE_REG_P(DECL) \
2141 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2143 extern tree
decl_value_expr_lookup (tree
);
2144 extern void decl_value_expr_insert (tree
, tree
);
2146 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2147 if transformations have made this more complicated than evaluating the
2148 decl itself. This should only be used for debugging; once this field has
2149 been set, the decl itself may not legitimately appear in the function. */
2150 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2151 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2152 ->decl_common.decl_flag_2)
2153 #define DECL_VALUE_EXPR(NODE) \
2154 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2155 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2156 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2158 /* Holds the RTL expression for the value of a variable or function.
2159 This value can be evaluated lazily for functions, variables with
2160 static storage duration, and labels. */
2161 #define DECL_RTL(NODE) \
2162 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2163 ? (NODE)->decl_with_rtl.rtl \
2164 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2166 /* Set the DECL_RTL for NODE to RTL. */
2167 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2169 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2170 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2172 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2173 #define DECL_RTL_SET_P(NODE) \
2174 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2176 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2177 NODE1, it will not be set for NODE2; this is a lazy copy. */
2178 #define COPY_DECL_RTL(NODE1, NODE2) \
2179 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2180 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2182 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2183 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2185 #if (GCC_VERSION >= 2007)
2186 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2187 ({ tree const __d = (decl); \
2188 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2189 /* Dereference it so the compiler knows it can't be NULL even \
2190 without assertion checking. */ \
2191 &*DECL_RTL_IF_SET (__d); })
2193 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2196 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2197 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2199 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2200 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2201 of the structure. */
2202 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2204 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2205 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2206 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2207 natural alignment of the field's type). */
2208 #define DECL_FIELD_BIT_OFFSET(NODE) \
2209 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2211 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2212 if so, the type that was originally specified for it.
2213 TREE_TYPE may have been modified (in finish_struct). */
2214 #define DECL_BIT_FIELD_TYPE(NODE) \
2215 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2217 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2218 representative FIELD_DECL. */
2219 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2220 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2222 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2223 if nonzero, indicates that the field occupies the type. */
2224 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2226 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2227 DECL_FIELD_OFFSET which are known to be always zero.
2228 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2230 #define DECL_OFFSET_ALIGN(NODE) \
2231 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2233 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2234 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2235 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2237 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2238 which this FIELD_DECL is defined. This information is needed when
2239 writing debugging information about vfield and vbase decls for C++. */
2240 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2242 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2243 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2245 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2247 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2249 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2250 this component. This makes it possible for Type-Based Alias Analysis
2251 to disambiguate accesses to this field with indirect accesses using
2254 struct S { int i; } s;
2257 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2259 From the implementation's viewpoint, the alias set of the type of the
2260 field 'i' (int) will not be recorded as a subset of that of the type of
2261 's' (struct S) in record_component_aliases. The counterpart is that
2262 accesses to s.i must not be given the alias set of the type of 'i'
2263 (int) but instead directly that of the type of 's' (struct S). */
2264 #define DECL_NONADDRESSABLE_P(NODE) \
2265 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2267 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2268 dense, unique within any one function, and may be used to index arrays.
2269 If the value is -1, then no UID has been assigned. */
2270 #define LABEL_DECL_UID(NODE) \
2271 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2273 /* In a LABEL_DECL, the EH region number for which the label is the
2274 post_landing_pad. */
2275 #define EH_LANDING_PAD_NR(NODE) \
2276 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2278 /* For a PARM_DECL, records the data type used to pass the argument,
2279 which may be different from the type seen in the program. */
2280 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2282 /* For PARM_DECL, holds an RTL for the stack slot or register
2283 where the data was actually passed. */
2284 #define DECL_INCOMING_RTL(NODE) \
2285 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2287 /* Nonzero for a given ..._DECL node means that no warnings should be
2288 generated just because this node is unused. */
2289 #define DECL_IN_SYSTEM_HEADER(NODE) \
2290 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2292 /* Used to indicate that the linkage status of this DECL is not yet known,
2293 so it should not be output now. */
2294 #define DECL_DEFER_OUTPUT(NODE) \
2295 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2297 /* In a VAR_DECL that's static,
2298 nonzero if the space is in the text section. */
2299 #define DECL_IN_TEXT_SECTION(NODE) \
2300 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2302 /* In a VAR_DECL that's static,
2303 nonzero if it belongs to the global constant pool. */
2304 #define DECL_IN_CONSTANT_POOL(NODE) \
2305 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2307 /* Nonzero for a given ..._DECL node means that this node should be
2308 put in .common, if possible. If a DECL_INITIAL is given, and it
2309 is not error_mark_node, then the decl cannot be put in .common. */
2310 #define DECL_COMMON(NODE) \
2311 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2313 /* In a VAR_DECL, nonzero if the decl is a register variable with
2314 an explicit asm specification. */
2315 #define DECL_HARD_REGISTER(NODE) \
2316 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2318 /* Used to indicate that this DECL has weak linkage. */
2319 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2321 /* Used to indicate that the DECL is a dllimport. */
2322 #define DECL_DLLIMPORT_P(NODE) \
2323 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2325 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2326 not be put out unless it is needed in this translation unit.
2327 Entities like this are shared across translation units (like weak
2328 entities), but are guaranteed to be generated by any translation
2329 unit that needs them, and therefore need not be put out anywhere
2330 where they are not needed. DECL_COMDAT is just a hint to the
2331 back-end; it is up to front-ends which set this flag to ensure
2332 that there will never be any harm, other than bloat, in putting out
2333 something which is DECL_COMDAT. */
2334 #define DECL_COMDAT(NODE) \
2335 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2337 #define DECL_COMDAT_GROUP(NODE) \
2338 decl_comdat_group (NODE)
2340 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2341 multiple translation units should be merged. */
2342 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2343 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2345 /* The name of the object as the assembler will see it (but before any
2346 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2347 as DECL_NAME. It is an IDENTIFIER_NODE.
2349 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2350 One Definition Rule based type merging at LTO. It is computed only for
2351 LTO compilation and C++. */
2352 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2354 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2355 This is true of all DECL nodes except FIELD_DECL. */
2356 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2357 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2359 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2360 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2362 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2363 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2364 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2366 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2367 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2368 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2370 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2371 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2372 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2373 semantics of using this macro, are different than saying:
2375 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2377 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2379 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2380 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2381 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2382 DECL_ASSEMBLER_NAME (DECL1)) \
2385 /* Records the section name in a section attribute. Used to pass
2386 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2387 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2389 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2390 this variable in a BIND_EXPR. */
2391 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2392 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2394 /* Value of the decls's visibility attribute */
2395 #define DECL_VISIBILITY(NODE) \
2396 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2398 /* Nonzero means that the decl had its visibility specified rather than
2400 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2401 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2403 /* In a VAR_DECL, the model to use if the data should be allocated from
2404 thread-local storage. */
2405 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2407 /* In a VAR_DECL, nonzero if the data should be allocated from
2408 thread-local storage. */
2409 #define DECL_THREAD_LOCAL_P(NODE) \
2410 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2412 /* In a non-local VAR_DECL with static storage duration, true if the
2413 variable has an initialization priority. If false, the variable
2414 will be initialized at the DEFAULT_INIT_PRIORITY. */
2415 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2416 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2418 extern tree
decl_debug_expr_lookup (tree
);
2419 extern void decl_debug_expr_insert (tree
, tree
);
2421 /* For VAR_DECL, this is set to an expression that it was split from. */
2422 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2423 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2424 #define DECL_DEBUG_EXPR(NODE) \
2425 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2427 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2428 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2430 extern priority_type
decl_init_priority_lookup (tree
);
2431 extern priority_type
decl_fini_priority_lookup (tree
);
2432 extern void decl_init_priority_insert (tree
, priority_type
);
2433 extern void decl_fini_priority_insert (tree
, priority_type
);
2435 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2437 #define DECL_INIT_PRIORITY(NODE) \
2438 (decl_init_priority_lookup (NODE))
2439 /* Set the initialization priority for NODE to VAL. */
2440 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2441 (decl_init_priority_insert (NODE, VAL))
2443 /* For a FUNCTION_DECL the finalization priority of NODE. */
2444 #define DECL_FINI_PRIORITY(NODE) \
2445 (decl_fini_priority_lookup (NODE))
2446 /* Set the finalization priority for NODE to VAL. */
2447 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2448 (decl_fini_priority_insert (NODE, VAL))
2450 /* The initialization priority for entities for which no explicit
2451 initialization priority has been specified. */
2452 #define DEFAULT_INIT_PRIORITY 65535
2454 /* The maximum allowed initialization priority. */
2455 #define MAX_INIT_PRIORITY 65535
2457 /* The largest priority value reserved for use by system runtime
2459 #define MAX_RESERVED_INIT_PRIORITY 100
2461 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2462 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2463 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2465 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2466 #define DECL_NONLOCAL_FRAME(NODE) \
2467 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2469 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2470 #define DECL_NONALIASED(NODE) \
2471 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2473 /* This field is used to reference anything in decl.result and is meant only
2474 for use by the garbage collector. */
2475 #define DECL_RESULT_FLD(NODE) \
2476 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2478 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2479 Before the struct containing the FUNCTION_DECL is laid out,
2480 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2481 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2482 function. When the class is laid out, this pointer is changed
2483 to an INTEGER_CST node which is suitable for use as an index
2484 into the virtual function table. */
2485 #define DECL_VINDEX(NODE) \
2486 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2488 /* In FUNCTION_DECL, holds the decl for the return value. */
2489 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2491 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2492 #define DECL_UNINLINABLE(NODE) \
2493 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2495 /* In a FUNCTION_DECL, the saved representation of the body of the
2497 #define DECL_SAVED_TREE(NODE) \
2498 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2500 /* Nonzero in a FUNCTION_DECL means this function should be treated
2501 as if it were a malloc, meaning it returns a pointer that is
2503 #define DECL_IS_MALLOC(NODE) \
2504 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2506 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2507 C++ operator new, meaning that it returns a pointer for which we
2508 should not use type based aliasing. */
2509 #define DECL_IS_OPERATOR_NEW(NODE) \
2510 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2512 /* Nonzero in a FUNCTION_DECL means this function may return more
2514 #define DECL_IS_RETURNS_TWICE(NODE) \
2515 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2517 /* Nonzero in a FUNCTION_DECL means this function should be treated
2518 as "pure" function (like const function, but may read global memory). */
2519 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2521 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2522 the const or pure function may not terminate. When this is nonzero
2523 for a const or pure function, it can be dealt with by cse passes
2524 but cannot be removed by dce passes since you are not allowed to
2525 change an infinite looping program into one that terminates without
2527 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2528 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2530 /* Nonzero in a FUNCTION_DECL means this function should be treated
2531 as "novops" function (function that does not read global memory,
2532 but may have arbitrary side effects). */
2533 #define DECL_IS_NOVOPS(NODE) \
2534 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2536 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2537 at the beginning or end of execution. */
2538 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2539 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2541 #define DECL_STATIC_DESTRUCTOR(NODE) \
2542 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2544 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2545 be instrumented with calls to support routines. */
2546 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2547 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2549 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2550 disabled in this function. */
2551 #define DECL_NO_LIMIT_STACK(NODE) \
2552 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2554 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2555 #define DECL_STATIC_CHAIN(NODE) \
2556 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2558 /* Nonzero for a decl that cgraph has decided should be inlined into
2559 at least one call site. It is not meaningful to look at this
2560 directly; always use cgraph_function_possibly_inlined_p. */
2561 #define DECL_POSSIBLY_INLINED(DECL) \
2562 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2564 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2565 such as via the `inline' keyword in C/C++. This flag controls the linkage
2566 semantics of 'inline' */
2567 #define DECL_DECLARED_INLINE_P(NODE) \
2568 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2570 /* Nonzero in a FUNCTION_DECL means this function should not get
2571 -Winline warnings. */
2572 #define DECL_NO_INLINE_WARNING_P(NODE) \
2573 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2575 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2576 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2577 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2579 /* Nonzero if a FUNCTION_CODE is a TM load. */
2580 #define BUILTIN_TM_LOAD_P(FN) \
2581 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2583 /* Nonzero if a FUNCTION_CODE is a TM store. */
2584 #define BUILTIN_TM_STORE_P(FN) \
2585 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2587 #define CASE_BUILT_IN_TM_LOAD(FN) \
2588 case BUILT_IN_TM_LOAD_##FN: \
2589 case BUILT_IN_TM_LOAD_RAR_##FN: \
2590 case BUILT_IN_TM_LOAD_RAW_##FN: \
2591 case BUILT_IN_TM_LOAD_RFW_##FN
2593 #define CASE_BUILT_IN_TM_STORE(FN) \
2594 case BUILT_IN_TM_STORE_##FN: \
2595 case BUILT_IN_TM_STORE_WAR_##FN: \
2596 case BUILT_IN_TM_STORE_WAW_##FN
2598 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2599 disregarding size and cost heuristics. This is equivalent to using
2600 the always_inline attribute without the required diagnostics if the
2601 function cannot be inlined. */
2602 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2603 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2605 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2606 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2608 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2609 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2610 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2612 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2613 that describes the status of this function. */
2614 #define DECL_STRUCT_FUNCTION(NODE) \
2615 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2617 /* In a FUNCTION_DECL, nonzero means a built in function of a
2618 standard library or more generally a built in function that is
2619 recognized by optimizers and expanders.
2621 Note that it is different from the DECL_IS_BUILTIN accessor. For
2622 instance, user declared prototypes of C library functions are not
2623 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2624 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2626 /* For a builtin function, identify which part of the compiler defined it. */
2627 #define DECL_BUILT_IN_CLASS(NODE) \
2628 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2630 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2631 #define DECL_ARGUMENTS(NODE) \
2632 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2634 /* In FUNCTION_DECL, the function specific target options to use when compiling
2636 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2637 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2639 /* In FUNCTION_DECL, the function specific optimization options to use when
2640 compiling this function. */
2641 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2642 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2644 /* In FUNCTION_DECL, this is set if this function has other versions generated
2645 using "target" attributes. The default version is the one which does not
2646 have any "target" attribute set. */
2647 #define DECL_FUNCTION_VERSIONED(NODE)\
2648 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2650 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2651 Devirtualization machinery uses this knowledge for determing type of the
2652 object constructed. Also we assume that constructor address is not
2654 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2655 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2657 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2658 Devirtualization machinery uses this to track types in destruction. */
2659 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2660 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2662 /* In FUNCTION_DECL that represent an virtual method this is set when
2663 the method is final. */
2664 #define DECL_FINAL_P(NODE)\
2665 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2667 /* The source language of the translation-unit. */
2668 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2669 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2671 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2673 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2674 #define DECL_ORIGINAL_TYPE(NODE) \
2675 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2677 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2678 into stabs. Instead it will generate cross reference ('x') of names.
2679 This uses the same flag as DECL_EXTERNAL. */
2680 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2681 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2683 /* Getter of the imported declaration associated to the
2684 IMPORTED_DECL node. */
2685 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2686 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2688 /* Getter of the symbol declaration associated with the
2689 NAMELIST_DECL node. */
2690 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2691 (DECL_INITIAL (NODE))
2693 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2694 To reduce overhead, the nodes containing the statements are not trees.
2695 This avoids the overhead of tree_common on all linked list elements.
2697 Use the interface in tree-iterator.h to access this node. */
2699 #define STATEMENT_LIST_HEAD(NODE) \
2700 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2701 #define STATEMENT_LIST_TAIL(NODE) \
2702 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2704 #define TREE_OPTIMIZATION(NODE) \
2705 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2707 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2708 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2710 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2711 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2713 /* Return a tree node that encapsulates the optimization options in OPTS. */
2714 extern tree
build_optimization_node (struct gcc_options
*opts
);
2716 #define TREE_TARGET_OPTION(NODE) \
2717 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2719 #define TREE_TARGET_GLOBALS(NODE) \
2720 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2722 /* Return a tree node that encapsulates the target options in OPTS. */
2723 extern tree
build_target_option_node (struct gcc_options
*opts
);
2725 extern void prepare_target_option_nodes_for_pch (void);
2727 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2730 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2732 if (TREE_CODE (__t
) != __c
)
2733 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2738 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2741 if (TREE_CODE (__t
) == __c
)
2742 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2747 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2748 enum tree_code __c1
, enum tree_code __c2
)
2750 if (TREE_CODE (__t
) != __c1
2751 && TREE_CODE (__t
) != __c2
)
2752 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2757 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2758 enum tree_code __c1
, enum tree_code __c2
)
2760 if (TREE_CODE (__t
) == __c1
2761 || TREE_CODE (__t
) == __c2
)
2762 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2767 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2768 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2770 if (TREE_CODE (__t
) != __c1
2771 && TREE_CODE (__t
) != __c2
2772 && TREE_CODE (__t
) != __c3
)
2773 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2778 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2779 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2781 if (TREE_CODE (__t
) == __c1
2782 || TREE_CODE (__t
) == __c2
2783 || TREE_CODE (__t
) == __c3
)
2784 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2789 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2790 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2791 enum tree_code __c4
)
2793 if (TREE_CODE (__t
) != __c1
2794 && TREE_CODE (__t
) != __c2
2795 && TREE_CODE (__t
) != __c3
2796 && TREE_CODE (__t
) != __c4
)
2797 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2802 tree_not_check4 (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
)
2806 if (TREE_CODE (__t
) == __c1
2807 || TREE_CODE (__t
) == __c2
2808 || TREE_CODE (__t
) == __c3
2809 || TREE_CODE (__t
) == __c4
)
2810 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2815 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2816 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2817 enum tree_code __c4
, enum tree_code __c5
)
2819 if (TREE_CODE (__t
) != __c1
2820 && TREE_CODE (__t
) != __c2
2821 && TREE_CODE (__t
) != __c3
2822 && TREE_CODE (__t
) != __c4
2823 && TREE_CODE (__t
) != __c5
)
2824 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2829 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2830 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2831 enum tree_code __c4
, enum tree_code __c5
)
2833 if (TREE_CODE (__t
) == __c1
2834 || TREE_CODE (__t
) == __c2
2835 || TREE_CODE (__t
) == __c3
2836 || TREE_CODE (__t
) == __c4
2837 || TREE_CODE (__t
) == __c5
)
2838 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2843 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2844 const char *__f
, int __l
, const char *__g
)
2846 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2847 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2852 tree_class_check (tree __t
, const enum tree_code_class __class
,
2853 const char *__f
, int __l
, const char *__g
)
2855 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2856 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2861 tree_range_check (tree __t
,
2862 enum tree_code __code1
, enum tree_code __code2
,
2863 const char *__f
, int __l
, const char *__g
)
2865 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2866 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2871 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2872 const char *__f
, int __l
, const char *__g
)
2874 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2875 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2876 if (__t
->omp_clause
.code
!= __code
)
2877 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2882 omp_clause_range_check (tree __t
,
2883 enum omp_clause_code __code1
,
2884 enum omp_clause_code __code2
,
2885 const char *__f
, int __l
, const char *__g
)
2887 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2888 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2889 if ((int) __t
->omp_clause
.code
< (int) __code1
2890 || (int) __t
->omp_clause
.code
> (int) __code2
)
2891 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2895 /* These checks have to be special cased. */
2898 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2900 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2901 if (!IS_EXPR_CODE_CLASS (__c
))
2902 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2906 /* These checks have to be special cased. */
2909 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2912 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2916 inline const HOST_WIDE_INT
*
2917 tree_int_cst_elt_check (const_tree __t
, int __i
,
2918 const char *__f
, int __l
, const char *__g
)
2920 if (TREE_CODE (__t
) != INTEGER_CST
)
2921 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2922 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2923 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2925 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2928 inline HOST_WIDE_INT
*
2929 tree_int_cst_elt_check (tree __t
, int __i
,
2930 const char *__f
, int __l
, const char *__g
)
2932 if (TREE_CODE (__t
) != INTEGER_CST
)
2933 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2934 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2935 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2937 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2941 tree_vec_elt_check (tree __t
, int __i
,
2942 const char *__f
, int __l
, const char *__g
)
2944 if (TREE_CODE (__t
) != TREE_VEC
)
2945 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2946 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2947 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2948 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2952 omp_clause_elt_check (tree __t
, int __i
,
2953 const char *__f
, int __l
, const char *__g
)
2955 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2956 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2957 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2958 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2959 return &__t
->omp_clause
.ops
[__i
];
2963 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2966 if (TREE_CODE (__t
) != __c
)
2967 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2972 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2975 if (TREE_CODE (__t
) == __c
)
2976 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2981 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2982 enum tree_code __c1
, enum tree_code __c2
)
2984 if (TREE_CODE (__t
) != __c1
2985 && TREE_CODE (__t
) != __c2
)
2986 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2991 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2992 enum tree_code __c1
, enum tree_code __c2
)
2994 if (TREE_CODE (__t
) == __c1
2995 || TREE_CODE (__t
) == __c2
)
2996 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3001 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3002 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3004 if (TREE_CODE (__t
) != __c1
3005 && TREE_CODE (__t
) != __c2
3006 && TREE_CODE (__t
) != __c3
)
3007 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3012 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3013 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3015 if (TREE_CODE (__t
) == __c1
3016 || TREE_CODE (__t
) == __c2
3017 || TREE_CODE (__t
) == __c3
)
3018 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3023 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3024 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3025 enum tree_code __c4
)
3027 if (TREE_CODE (__t
) != __c1
3028 && TREE_CODE (__t
) != __c2
3029 && TREE_CODE (__t
) != __c3
3030 && TREE_CODE (__t
) != __c4
)
3031 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3036 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3037 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3038 enum tree_code __c4
)
3040 if (TREE_CODE (__t
) == __c1
3041 || TREE_CODE (__t
) == __c2
3042 || TREE_CODE (__t
) == __c3
3043 || TREE_CODE (__t
) == __c4
)
3044 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3049 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3050 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3051 enum tree_code __c4
, enum tree_code __c5
)
3053 if (TREE_CODE (__t
) != __c1
3054 && TREE_CODE (__t
) != __c2
3055 && TREE_CODE (__t
) != __c3
3056 && TREE_CODE (__t
) != __c4
3057 && TREE_CODE (__t
) != __c5
)
3058 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3063 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3064 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3065 enum tree_code __c4
, enum tree_code __c5
)
3067 if (TREE_CODE (__t
) == __c1
3068 || TREE_CODE (__t
) == __c2
3069 || TREE_CODE (__t
) == __c3
3070 || TREE_CODE (__t
) == __c4
3071 || TREE_CODE (__t
) == __c5
)
3072 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3077 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3078 const char *__f
, int __l
, const char *__g
)
3080 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3081 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3086 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3087 const char *__f
, int __l
, const char *__g
)
3089 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3090 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3095 tree_range_check (const_tree __t
,
3096 enum tree_code __code1
, enum tree_code __code2
,
3097 const char *__f
, int __l
, const char *__g
)
3099 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3100 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3105 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3106 const char *__f
, int __l
, const char *__g
)
3108 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3109 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3110 if (__t
->omp_clause
.code
!= __code
)
3111 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3116 omp_clause_range_check (const_tree __t
,
3117 enum omp_clause_code __code1
,
3118 enum omp_clause_code __code2
,
3119 const char *__f
, int __l
, const char *__g
)
3121 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3122 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3123 if ((int) __t
->omp_clause
.code
< (int) __code1
3124 || (int) __t
->omp_clause
.code
> (int) __code2
)
3125 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3130 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3132 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3133 if (!IS_EXPR_CODE_CLASS (__c
))
3134 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3139 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3142 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3147 tree_vec_elt_check (const_tree __t
, int __i
,
3148 const char *__f
, int __l
, const char *__g
)
3150 if (TREE_CODE (__t
) != TREE_VEC
)
3151 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3152 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3153 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3154 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3155 //return &__t->vec.a[__i];
3159 omp_clause_elt_check (const_tree __t
, int __i
,
3160 const char *__f
, int __l
, const char *__g
)
3162 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3163 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3164 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3165 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3166 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3171 /* Compute the number of operands in an expression node NODE. For
3172 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3173 otherwise it is looked up from the node's code. */
3175 tree_operand_length (const_tree node
)
3177 if (VL_EXP_CLASS_P (node
))
3178 return VL_EXP_OPERAND_LENGTH (node
);
3180 return TREE_CODE_LENGTH (TREE_CODE (node
));
3183 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3185 /* Special checks for TREE_OPERANDs. */
3187 tree_operand_check (tree __t
, int __i
,
3188 const char *__f
, int __l
, const char *__g
)
3190 const_tree __u
= EXPR_CHECK (__t
);
3191 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3192 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3193 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3197 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3198 const char *__f
, int __l
, const char *__g
)
3200 if (TREE_CODE (__t
) != __code
)
3201 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3202 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3203 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3204 return &__t
->exp
.operands
[__i
];
3208 tree_operand_check (const_tree __t
, int __i
,
3209 const char *__f
, int __l
, const char *__g
)
3211 const_tree __u
= EXPR_CHECK (__t
);
3212 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3213 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3214 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3218 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3219 const char *__f
, int __l
, const char *__g
)
3221 if (TREE_CODE (__t
) != __code
)
3222 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3223 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3224 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3225 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3230 #define error_mark_node global_trees[TI_ERROR_MARK]
3232 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3233 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3234 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3235 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3236 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3238 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3239 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3240 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3241 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3242 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3244 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3245 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3246 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3247 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3248 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3250 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3251 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3252 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3254 #define void_node global_trees[TI_VOID]
3256 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3257 #define integer_one_node global_trees[TI_INTEGER_ONE]
3258 #define integer_three_node global_trees[TI_INTEGER_THREE]
3259 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3260 #define size_zero_node global_trees[TI_SIZE_ZERO]
3261 #define size_one_node global_trees[TI_SIZE_ONE]
3262 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3263 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3264 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3266 /* Base access nodes. */
3267 #define access_public_node global_trees[TI_PUBLIC]
3268 #define access_protected_node global_trees[TI_PROTECTED]
3269 #define access_private_node global_trees[TI_PRIVATE]
3271 #define null_pointer_node global_trees[TI_NULL_POINTER]
3273 #define float_type_node global_trees[TI_FLOAT_TYPE]
3274 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3275 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3277 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3278 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3279 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3280 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3282 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3283 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3284 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3285 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3287 #define void_type_node global_trees[TI_VOID_TYPE]
3288 /* The C type `void *'. */
3289 #define ptr_type_node global_trees[TI_PTR_TYPE]
3290 /* The C type `const void *'. */
3291 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3292 /* The C type `size_t'. */
3293 #define size_type_node global_trees[TI_SIZE_TYPE]
3294 #define pid_type_node global_trees[TI_PID_TYPE]
3295 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3296 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3297 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3298 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3299 /* The C type `FILE *'. */
3300 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3301 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3303 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3304 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3305 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3307 /* The decimal floating point types. */
3308 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3309 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3310 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3311 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3312 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3313 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3315 /* The fixed-point types. */
3316 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3317 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3318 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3319 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3320 #define sat_unsigned_short_fract_type_node \
3321 global_trees[TI_SAT_USFRACT_TYPE]
3322 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3323 #define sat_unsigned_long_fract_type_node \
3324 global_trees[TI_SAT_ULFRACT_TYPE]
3325 #define sat_unsigned_long_long_fract_type_node \
3326 global_trees[TI_SAT_ULLFRACT_TYPE]
3327 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3328 #define fract_type_node global_trees[TI_FRACT_TYPE]
3329 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3330 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3331 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3332 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3333 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3334 #define unsigned_long_long_fract_type_node \
3335 global_trees[TI_ULLFRACT_TYPE]
3336 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3337 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3338 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3339 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3340 #define sat_unsigned_short_accum_type_node \
3341 global_trees[TI_SAT_USACCUM_TYPE]
3342 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3343 #define sat_unsigned_long_accum_type_node \
3344 global_trees[TI_SAT_ULACCUM_TYPE]
3345 #define sat_unsigned_long_long_accum_type_node \
3346 global_trees[TI_SAT_ULLACCUM_TYPE]
3347 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3348 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3349 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3350 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3351 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3352 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3353 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3354 #define unsigned_long_long_accum_type_node \
3355 global_trees[TI_ULLACCUM_TYPE]
3356 #define qq_type_node global_trees[TI_QQ_TYPE]
3357 #define hq_type_node global_trees[TI_HQ_TYPE]
3358 #define sq_type_node global_trees[TI_SQ_TYPE]
3359 #define dq_type_node global_trees[TI_DQ_TYPE]
3360 #define tq_type_node global_trees[TI_TQ_TYPE]
3361 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3362 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3363 #define usq_type_node global_trees[TI_USQ_TYPE]
3364 #define udq_type_node global_trees[TI_UDQ_TYPE]
3365 #define utq_type_node global_trees[TI_UTQ_TYPE]
3366 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3367 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3368 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3369 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3370 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3371 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3372 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3373 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3374 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3375 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3376 #define ha_type_node global_trees[TI_HA_TYPE]
3377 #define sa_type_node global_trees[TI_SA_TYPE]
3378 #define da_type_node global_trees[TI_DA_TYPE]
3379 #define ta_type_node global_trees[TI_TA_TYPE]
3380 #define uha_type_node global_trees[TI_UHA_TYPE]
3381 #define usa_type_node global_trees[TI_USA_TYPE]
3382 #define uda_type_node global_trees[TI_UDA_TYPE]
3383 #define uta_type_node global_trees[TI_UTA_TYPE]
3384 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3385 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3386 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3387 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3388 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3389 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3390 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3391 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3393 /* The node that should be placed at the end of a parameter list to
3394 indicate that the function does not take a variable number of
3395 arguments. The TREE_VALUE will be void_type_node and there will be
3396 no TREE_CHAIN. Language-independent code should not assume
3397 anything else about this node. */
3398 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3400 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3401 #define MAIN_NAME_P(NODE) \
3402 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3404 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3406 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3407 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3409 /* Default/current target options (TARGET_OPTION_NODE). */
3410 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3411 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3413 /* Default tree list option(), optimize() pragmas to be linked into the
3415 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3416 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3418 #define char_type_node integer_types[itk_char]
3419 #define signed_char_type_node integer_types[itk_signed_char]
3420 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3421 #define short_integer_type_node integer_types[itk_short]
3422 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3423 #define integer_type_node integer_types[itk_int]
3424 #define unsigned_type_node integer_types[itk_unsigned_int]
3425 #define long_integer_type_node integer_types[itk_long]
3426 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3427 #define long_long_integer_type_node integer_types[itk_long_long]
3428 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3429 #define int128_integer_type_node integer_types[itk_int128]
3430 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3432 /* True if NODE is an erroneous expression. */
3434 #define error_operand_p(NODE) \
3435 ((NODE) == error_mark_node \
3436 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3438 extern tree
decl_assembler_name (tree
);
3439 extern tree
decl_comdat_group (const_tree
);
3440 extern tree
decl_comdat_group_id (const_tree
);
3441 extern const char *decl_section_name (const_tree
);
3442 extern void set_decl_section_name (tree
, const char *);
3443 extern enum tls_model
decl_tls_model (const_tree
);
3444 extern void set_decl_tls_model (tree
, enum tls_model
);
3446 /* Compute the number of bytes occupied by 'node'. This routine only
3447 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3449 extern size_t tree_size (const_tree
);
3451 /* Compute the number of bytes occupied by a tree with code CODE.
3452 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3453 which are of variable length. */
3454 extern size_t tree_code_size (enum tree_code
);
3456 /* Allocate and return a new UID from the DECL_UID namespace. */
3457 extern int allocate_decl_uid (void);
3459 /* Lowest level primitive for allocating a node.
3460 The TREE_CODE is the only argument. Contents are initialized
3461 to zero except for a few of the common fields. */
3463 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3464 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3466 /* Make a copy of a node, with all the same contents. */
3468 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3469 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3471 /* Make a copy of a chain of TREE_LIST nodes. */
3473 extern tree
copy_list (tree
);
3475 /* Make a CASE_LABEL_EXPR. */
3477 extern tree
build_case_label (tree
, tree
, tree
);
3480 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3481 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3483 /* Make an INTEGER_CST. */
3485 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3486 #define make_int_cst(LEN, EXT_LEN) \
3487 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3489 /* Make a TREE_VEC. */
3491 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3492 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3494 /* Grow a TREE_VEC. */
3496 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3497 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3499 /* Construct various types of nodes. */
3501 extern tree
build_nt (enum tree_code
, ...);
3502 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3504 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3505 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3506 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3507 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3508 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3509 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3510 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3511 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3512 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3513 tree MEM_STAT_DECL
);
3514 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3515 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3516 tree MEM_STAT_DECL
);
3517 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3519 /* _loc versions of build[1-5]. */
3522 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3523 tree arg1 MEM_STAT_DECL
)
3525 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3526 if (CAN_HAVE_LOCATION_P (t
))
3527 SET_EXPR_LOCATION (t
, loc
);
3530 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3533 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3534 tree arg1 MEM_STAT_DECL
)
3536 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3537 if (CAN_HAVE_LOCATION_P (t
))
3538 SET_EXPR_LOCATION (t
, loc
);
3541 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3544 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3545 tree arg1
, tree arg2 MEM_STAT_DECL
)
3547 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3548 if (CAN_HAVE_LOCATION_P (t
))
3549 SET_EXPR_LOCATION (t
, loc
);
3552 #define build3_loc(l,c,t1,t2,t3,t4) \
3553 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3556 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3557 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3559 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3560 if (CAN_HAVE_LOCATION_P (t
))
3561 SET_EXPR_LOCATION (t
, loc
);
3564 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3565 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3568 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3569 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3571 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3572 arg4 PASS_MEM_STAT
);
3573 if (CAN_HAVE_LOCATION_P (t
))
3574 SET_EXPR_LOCATION (t
, loc
);
3577 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3578 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3580 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3581 #define build_var_debug_value(t1,t2) \
3582 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3584 /* Constructs double_int from tree CST. */
3586 extern tree
double_int_to_tree (tree
, double_int
);
3588 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3589 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3591 /* Create an INT_CST node with a CST value zero extended. */
3594 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3595 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3596 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3597 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3598 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3599 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3600 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3601 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3602 extern tree
build_vector_from_val (tree
, tree
);
3603 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3604 extern tree
build_constructor_single (tree
, tree
, tree
);
3605 extern tree
build_constructor_from_list (tree
, tree
);
3606 extern tree
build_constructor_va (tree
, int, ...);
3607 extern tree
build_real_from_int_cst (tree
, const_tree
);
3608 extern tree
build_complex (tree
, tree
, tree
);
3609 extern tree
build_one_cst (tree
);
3610 extern tree
build_minus_one_cst (tree
);
3611 extern tree
build_all_ones_cst (tree
);
3612 extern tree
build_zero_cst (tree
);
3613 extern tree
build_string (int, const char *);
3614 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3615 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3616 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3617 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3618 extern tree
build_decl_stat (location_t
, enum tree_code
,
3619 tree
, tree MEM_STAT_DECL
);
3620 extern tree
build_fn_decl (const char *, tree
);
3621 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3622 extern tree
build_translation_unit_decl (tree
);
3623 extern tree
build_block (tree
, tree
, tree
, tree
);
3624 extern tree
build_empty_stmt (location_t
);
3625 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3627 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3628 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3630 extern tree
build_call_nary (tree
, tree
, int, ...);
3631 extern tree
build_call_valist (tree
, tree
, int, va_list);
3632 #define build_call_array(T1,T2,N,T3)\
3633 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3634 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3635 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3636 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
3637 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
3638 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
3639 extern tree
build_call_expr (tree
, int, ...);
3640 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
3642 extern tree
build_string_literal (int, const char *);
3644 /* Construct various nodes representing data types. */
3646 extern tree
signed_or_unsigned_type_for (int, tree
);
3647 extern tree
signed_type_for (tree
);
3648 extern tree
unsigned_type_for (tree
);
3649 extern tree
truth_type_for (tree
);
3650 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3651 extern tree
build_pointer_type (tree
);
3652 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3653 extern tree
build_reference_type (tree
);
3654 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3655 extern tree
build_vector_type (tree innertype
, int nunits
);
3656 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3657 extern tree
build_index_type (tree
);
3658 extern tree
build_array_type (tree
, tree
);
3659 extern tree
build_nonshared_array_type (tree
, tree
);
3660 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3661 extern tree
build_function_type (tree
, tree
);
3662 extern tree
build_function_type_list (tree
, ...);
3663 extern tree
build_varargs_function_type_list (tree
, ...);
3664 extern tree
build_function_type_array (tree
, int, tree
*);
3665 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3666 #define build_function_type_vec(RET, V) \
3667 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3668 #define build_varargs_function_type_vec(RET, V) \
3669 build_varargs_function_type_array (RET, vec_safe_length (V), \
3670 vec_safe_address (V))
3671 extern tree
build_method_type_directly (tree
, tree
, tree
);
3672 extern tree
build_method_type (tree
, tree
);
3673 extern tree
build_offset_type (tree
, tree
);
3674 extern tree
build_complex_type (tree
);
3675 extern tree
array_type_nelts (const_tree
);
3677 extern tree
value_member (tree
, tree
);
3678 extern tree
purpose_member (const_tree
, tree
);
3679 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3680 extern tree
chain_index (int, tree
);
3682 extern int attribute_list_equal (const_tree
, const_tree
);
3683 extern int attribute_list_contained (const_tree
, const_tree
);
3684 extern int tree_int_cst_equal (const_tree
, const_tree
);
3686 extern bool tree_fits_shwi_p (const_tree
)
3687 #ifndef ENABLE_TREE_CHECKING
3688 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
3691 extern bool tree_fits_uhwi_p (const_tree
)
3692 #ifndef ENABLE_TREE_CHECKING
3693 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
3696 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
3697 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
3698 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3699 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3700 tree_to_shwi (const_tree t
)
3702 gcc_assert (tree_fits_shwi_p (t
));
3703 return TREE_INT_CST_LOW (t
);
3706 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
3707 tree_to_uhwi (const_tree t
)
3709 gcc_assert (tree_fits_uhwi_p (t
));
3710 return TREE_INT_CST_LOW (t
);
3713 extern int tree_int_cst_sgn (const_tree
);
3714 extern int tree_int_cst_sign_bit (const_tree
);
3715 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
3716 extern tree
strip_array_types (tree
);
3717 extern tree
excess_precision_type (tree
);
3718 extern bool valid_constant_size_p (const_tree
);
3721 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3722 put the prototype here. Rtl.h does declare the prototype if
3723 tree.h had been included. */
3725 extern tree
make_tree (tree
, rtx
);
3727 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3730 Such modified types already made are recorded so that duplicates
3733 extern tree
build_type_attribute_variant (tree
, tree
);
3734 extern tree
build_decl_attribute_variant (tree
, tree
);
3735 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3737 /* Return 0 if the attributes for two types are incompatible, 1 if they
3738 are compatible, and 2 if they are nearly compatible (which causes a
3739 warning to be generated). */
3740 extern int comp_type_attributes (const_tree
, const_tree
);
3742 /* Default versions of target-overridable functions. */
3743 extern tree
merge_decl_attributes (tree
, tree
);
3744 extern tree
merge_type_attributes (tree
, tree
);
3746 /* This function is a private implementation detail of lookup_attribute()
3747 and you should never call it directly. */
3748 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3750 /* This function is a private implementation detail
3751 of lookup_attribute_by_prefix() and you should never call it directly. */
3752 extern tree
private_lookup_attribute_by_prefix (const char *, size_t, tree
);
3754 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3755 return a pointer to the attribute's list element if the attribute
3756 is part of the list, or NULL_TREE if not found. If the attribute
3757 appears more than once, this only returns the first occurrence; the
3758 TREE_CHAIN of the return value should be passed back in if further
3759 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3763 lookup_attribute (const char *attr_name
, tree list
)
3765 gcc_checking_assert (attr_name
[0] != '_');
3766 /* In most cases, list is NULL_TREE. */
3767 if (list
== NULL_TREE
)
3770 /* Do the strlen() before calling the out-of-line implementation.
3771 In most cases attr_name is a string constant, and the compiler
3772 will optimize the strlen() away. */
3773 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3776 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3777 return a pointer to the attribute's list first element if the attribute
3778 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
3782 lookup_attribute_by_prefix (const char *attr_name
, tree list
)
3784 gcc_checking_assert (attr_name
[0] != '_');
3785 /* In most cases, list is NULL_TREE. */
3786 if (list
== NULL_TREE
)
3789 return private_lookup_attribute_by_prefix (attr_name
, strlen (attr_name
),
3794 /* This function is a private implementation detail of
3795 is_attribute_p() and you should never call it directly. */
3796 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3798 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3799 if the identifier node is a valid attribute name for the string.
3800 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3801 be the identifier for 'text' or for '__text__'. */
3804 is_attribute_p (const char *attr_name
, const_tree ident
)
3806 gcc_checking_assert (attr_name
[0] != '_');
3807 /* Do the strlen() before calling the out-of-line implementation.
3808 In most cases attr_name is a string constant, and the compiler
3809 will optimize the strlen() away. */
3810 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3813 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3814 modified list. ATTR_NAME must be in the form 'text' (not
3817 extern tree
remove_attribute (const char *, tree
);
3819 /* Given two attributes lists, return a list of their union. */
3821 extern tree
merge_attributes (tree
, tree
);
3823 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3824 /* Given two Windows decl attributes lists, possibly including
3825 dllimport, return a list of their union . */
3826 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3828 /* Handle a "dllimport" or "dllexport" attribute. */
3829 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3832 /* Check whether CAND is suitable to be returned from get_qualified_type
3833 (BASE, TYPE_QUALS). */
3835 extern bool check_qualified_type (const_tree
, const_tree
, int);
3837 /* Return a version of the TYPE, qualified as indicated by the
3838 TYPE_QUALS, if one exists. If no qualified version exists yet,
3839 return NULL_TREE. */
3841 extern tree
get_qualified_type (tree
, int);
3843 /* Like get_qualified_type, but creates the type if it does not
3844 exist. This function never returns NULL_TREE. */
3846 extern tree
build_qualified_type (tree
, int);
3848 /* Create a variant of type T with alignment ALIGN. */
3850 extern tree
build_aligned_type (tree
, unsigned int);
3852 /* Like build_qualified_type, but only deals with the `const' and
3853 `volatile' qualifiers. This interface is retained for backwards
3854 compatibility with the various front-ends; new code should use
3855 build_qualified_type instead. */
3857 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3858 build_qualified_type ((TYPE), \
3859 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3860 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3862 /* Make a copy of a type node. */
3864 extern tree
build_distinct_type_copy (tree
);
3865 extern tree
build_variant_type_copy (tree
);
3867 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3868 return a canonicalized ..._TYPE node, so that duplicates are not made.
3869 How the hash code is computed is up to the caller, as long as any two
3870 callers that could hash identical-looking type nodes agree. */
3872 extern tree
type_hash_canon (unsigned int, tree
);
3874 extern tree
convert (tree
, tree
);
3875 extern unsigned int expr_align (const_tree
);
3876 extern tree
size_in_bytes (const_tree
);
3877 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
3878 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
3879 extern tree
bit_position (const_tree
);
3880 extern tree
byte_position (const_tree
);
3881 extern HOST_WIDE_INT
int_byte_position (const_tree
);
3883 #define sizetype sizetype_tab[(int) stk_sizetype]
3884 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3885 #define ssizetype sizetype_tab[(int) stk_ssizetype]
3886 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3887 #define size_int(L) size_int_kind (L, stk_sizetype)
3888 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
3889 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3890 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3892 /* Type for sizes of data-type. */
3894 #define BITS_PER_UNIT_LOG \
3895 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3896 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3897 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3899 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3900 by making the last node in X point to Y.
3901 Returns X, except if X is 0 returns Y. */
3903 extern tree
chainon (tree
, tree
);
3905 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3907 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
3908 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3910 /* Return the last tree node in a chain. */
3912 extern tree
tree_last (tree
);
3914 /* Reverse the order of elements in a chain, and return the new head. */
3916 extern tree
nreverse (tree
);
3918 /* Returns the length of a chain of nodes
3919 (number of chain pointers to follow before reaching a null pointer). */
3921 extern int list_length (const_tree
);
3923 /* Returns the first FIELD_DECL in a type. */
3925 extern tree
first_field (const_tree
);
3927 /* Given an initializer INIT, return TRUE if INIT is zero or some
3928 aggregate of zeros. Otherwise return FALSE. */
3930 extern bool initializer_zerop (const_tree
);
3932 /* Given a vector VEC, return its first element if all elements are
3933 the same. Otherwise return NULL_TREE. */
3935 extern tree
uniform_vector_p (const_tree
);
3937 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
3939 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
3941 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3943 extern int integer_zerop (const_tree
);
3945 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3947 extern int integer_onep (const_tree
);
3949 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
3950 a vector or complex where each part is 1. */
3952 extern int integer_each_onep (const_tree
);
3954 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3955 all of whose significant bits are 1. */
3957 extern int integer_all_onesp (const_tree
);
3959 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
3962 extern int integer_minus_onep (const_tree
);
3964 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3965 exactly one bit 1. */
3967 extern int integer_pow2p (const_tree
);
3969 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3970 with a nonzero value. */
3972 extern int integer_nonzerop (const_tree
);
3974 extern bool cst_and_fits_in_hwi (const_tree
);
3975 extern tree
num_ending_zeros (const_tree
);
3977 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
3980 extern int fixed_zerop (const_tree
);
3982 /* staticp (tree x) is nonzero if X is a reference to data allocated
3983 at a fixed address in memory. Returns the outermost data. */
3985 extern tree
staticp (tree
);
3987 /* save_expr (EXP) returns an expression equivalent to EXP
3988 but it can be used multiple times within context CTX
3989 and only evaluate EXP once. */
3991 extern tree
save_expr (tree
);
3993 /* Look inside EXPR into any simple arithmetic operations. Return the
3994 outermost non-arithmetic or non-invariant node. */
3996 extern tree
skip_simple_arithmetic (tree
);
3998 /* Look inside EXPR into simple arithmetic operations involving constants.
3999 Return the outermost non-arithmetic or non-constant node. */
4001 extern tree
skip_simple_constant_arithmetic (tree
);
4003 /* Return which tree structure is used by T. */
4005 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4007 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4008 size or offset that depends on a field within a record. */
4010 extern bool contains_placeholder_p (const_tree
);
4012 /* This macro calls the above function but short-circuits the common
4013 case of a constant to save time. Also check for null. */
4015 #define CONTAINS_PLACEHOLDER_P(EXP) \
4016 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4018 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4019 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4022 extern bool type_contains_placeholder_p (tree
);
4024 /* Given a tree EXP, find all occurrences of references to fields
4025 in a PLACEHOLDER_EXPR and place them in vector REFS without
4026 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4027 we assume here that EXP contains only arithmetic expressions
4028 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4031 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4033 /* This macro calls the above function but short-circuits the common
4034 case of a constant to save time and also checks for NULL. */
4036 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4038 if((EXP) && !TREE_CONSTANT (EXP)) \
4039 find_placeholder_in_expr (EXP, V); \
4042 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4043 return a tree with all occurrences of references to F in a
4044 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4045 CONST_DECLs. Note that we assume here that EXP contains only
4046 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4047 occurring only in their argument list. */
4049 extern tree
substitute_in_expr (tree
, tree
, tree
);
4051 /* This macro calls the above function but short-circuits the common
4052 case of a constant to save time and also checks for NULL. */
4054 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4055 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4057 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4058 for it within OBJ, a tree that is an object or a chain of references. */
4060 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4062 /* This macro calls the above function but short-circuits the common
4063 case of a constant to save time and also checks for NULL. */
4065 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4066 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4067 : substitute_placeholder_in_expr (EXP, OBJ))
4070 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4071 but it can be used multiple times
4072 and only evaluate the subexpressions once. */
4074 extern tree
stabilize_reference (tree
);
4076 /* Return EXP, stripped of any conversions to wider types
4077 in such a way that the result of converting to type FOR_TYPE
4078 is the same as if EXP were converted to FOR_TYPE.
4079 If FOR_TYPE is 0, it signifies EXP's type. */
4081 extern tree
get_unwidened (tree
, tree
);
4083 /* Return OP or a simpler expression for a narrower value
4084 which can be sign-extended or zero-extended to give back OP.
4085 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4086 or 0 if the value should be sign-extended. */
4088 extern tree
get_narrower (tree
, int *);
4090 /* Return true if T is an expression that get_inner_reference handles. */
4093 handled_component_p (const_tree t
)
4095 switch (TREE_CODE (t
))
4100 case ARRAY_RANGE_REF
:
4103 case VIEW_CONVERT_EXPR
:
4111 /* Given a DECL or TYPE, return the scope in which it was declared, or
4112 NUL_TREE if there is no containing scope. */
4114 extern tree
get_containing_scope (const_tree
);
4116 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4118 extern tree
decl_function_context (const_tree
);
4120 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4121 this _DECL with its context, or zero if none. */
4122 extern tree
decl_type_context (const_tree
);
4124 /* Return 1 if EXPR is the real constant zero. */
4125 extern int real_zerop (const_tree
);
4127 /* Initialize the iterator I with arguments from function FNDECL */
4130 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4132 i
->next
= TYPE_ARG_TYPES (fntype
);
4135 /* Return a pointer that holds the next argument if there are more arguments to
4136 handle, otherwise return NULL. */
4138 static inline tree
*
4139 function_args_iter_cond_ptr (function_args_iterator
*i
)
4141 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4144 /* Return the next argument if there are more arguments to handle, otherwise
4148 function_args_iter_cond (function_args_iterator
*i
)
4150 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4153 /* Advance to the next argument. */
4155 function_args_iter_next (function_args_iterator
*i
)
4157 gcc_assert (i
->next
!= NULL_TREE
);
4158 i
->next
= TREE_CHAIN (i
->next
);
4161 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4164 inlined_function_outer_scope_p (const_tree block
)
4166 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4169 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4170 to point to the next tree element. ITER is an instance of
4171 function_args_iterator used to iterate the arguments. */
4172 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4173 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4174 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4175 function_args_iter_next (&(ITER)))
4177 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4178 to the next tree element. ITER is an instance of function_args_iterator
4179 used to iterate the arguments. */
4180 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4181 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4182 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4183 function_args_iter_next (&(ITER)))
4186 extern unsigned crc32_string (unsigned, const char *);
4187 extern unsigned crc32_byte (unsigned, char);
4188 extern unsigned crc32_unsigned (unsigned, unsigned);
4189 extern void clean_symbol_name (char *);
4190 extern tree
get_file_function_name (const char *);
4191 extern tree
get_callee_fndecl (const_tree
);
4192 extern int type_num_arguments (const_tree
);
4193 extern bool associative_tree_code (enum tree_code
);
4194 extern bool commutative_tree_code (enum tree_code
);
4195 extern bool commutative_ternary_tree_code (enum tree_code
);
4196 extern tree
upper_bound_in_type (tree
, tree
);
4197 extern tree
lower_bound_in_type (tree
, tree
);
4198 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4199 extern tree
create_artificial_label (location_t
);
4200 extern const char *get_name (tree
);
4201 extern bool stdarg_p (const_tree
);
4202 extern bool prototype_p (tree
);
4203 extern bool is_typedef_decl (tree x
);
4204 extern bool typedef_variant_p (tree
);
4205 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4206 extern tree
build_low_bits_mask (tree
, unsigned);
4207 extern tree
tree_strip_nop_conversions (tree
);
4208 extern tree
tree_strip_sign_nop_conversions (tree
);
4209 extern const_tree
strip_invariant_refs (const_tree
);
4210 extern tree
lhd_gcc_personality (void);
4211 extern void assign_assembler_name_if_neeeded (tree
);
4212 extern void warn_deprecated_use (tree
, tree
);
4213 extern void cache_integer_cst (tree
);
4215 /* Compare and hash for any structure which begins with a canonical
4216 pointer. Assumes all pointers are interchangeable, which is sort
4217 of already assumed by gcc elsewhere IIRC. */
4220 struct_ptr_eq (const void *a
, const void *b
)
4222 const void * const * x
= (const void * const *) a
;
4223 const void * const * y
= (const void * const *) b
;
4227 static inline hashval_t
4228 struct_ptr_hash (const void *a
)
4230 const void * const * x
= (const void * const *) a
;
4231 return (intptr_t)*x
>> 4;
4234 /* Return nonzero if CODE is a tree code that represents a truth value. */
4236 truth_value_p (enum tree_code code
)
4238 return (TREE_CODE_CLASS (code
) == tcc_comparison
4239 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4240 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4241 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4244 /* Return whether TYPE is a type suitable for an offset for
4245 a POINTER_PLUS_EXPR. */
4247 ptrofftype_p (tree type
)
4249 return (INTEGRAL_TYPE_P (type
)
4250 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4251 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4254 /* Return OFF converted to a pointer offset type suitable as offset for
4255 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4257 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4259 return fold_convert_loc (loc
, sizetype
, off
);
4261 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4263 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4265 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4267 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4268 ptr
, convert_to_ptrofftype_loc (loc
, off
));
4270 #define fold_build_pointer_plus(p,o) \
4271 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4273 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4275 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4277 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4278 ptr
, size_int (off
));
4280 #define fold_build_pointer_plus_hwi(p,o) \
4281 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4283 extern tree
strip_float_extensions (tree
);
4284 extern int really_constant_p (const_tree
);
4285 extern bool decl_address_invariant_p (const_tree
);
4286 extern bool decl_address_ip_invariant_p (const_tree
);
4287 extern bool int_fits_type_p (const_tree
, const_tree
);
4288 #ifndef GENERATOR_FILE
4289 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4291 extern bool variably_modified_type_p (tree
, tree
);
4292 extern int tree_log2 (const_tree
);
4293 extern int tree_floor_log2 (const_tree
);
4294 extern unsigned int tree_ctz (const_tree
);
4295 extern int simple_cst_equal (const_tree
, const_tree
);
4300 extern void add_expr (const_tree
, hash
&);
4304 /* Compat version until all callers are converted. Return hash for
4306 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4308 inchash::hash
hstate (seed
);
4309 inchash::add_expr (tree
, hstate
);
4310 return hstate
.end ();
4313 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4314 extern int type_list_equal (const_tree
, const_tree
);
4315 extern int chain_member (const_tree
, const_tree
);
4316 extern void dump_tree_statistics (void);
4317 extern void recompute_tree_invariant_for_addr_expr (tree
);
4318 extern bool needs_to_live_in_memory (const_tree
);
4319 extern tree
reconstruct_complex_type (tree
, tree
);
4320 extern int real_onep (const_tree
);
4321 extern int real_minus_onep (const_tree
);
4322 extern void init_ttree (void);
4323 extern void build_common_tree_nodes (bool, bool);
4324 extern void build_common_builtin_nodes (void);
4325 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4326 extern tree
build_range_type (tree
, tree
, tree
);
4327 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4328 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4329 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4330 extern tree
tree_block (tree
);
4331 extern void tree_set_block (tree
, tree
);
4332 extern location_t
*block_nonartificial_location (tree
);
4333 extern location_t
tree_nonartificial_location (tree
);
4334 extern tree
block_ultimate_origin (const_tree
);
4335 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4336 extern bool virtual_method_call_p (tree
);
4337 extern tree
obj_type_ref_class (tree ref
);
4338 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
4339 extern bool contains_bitfld_component_ref_p (const_tree
);
4340 extern bool type_in_anonymous_namespace_p (const_tree
);
4341 extern bool block_may_fallthru (const_tree
);
4342 extern void using_eh_for_cleanups (void);
4343 extern bool using_eh_for_cleanups_p (void);
4344 extern const char *get_tree_code_name (enum tree_code
);
4345 extern void set_call_expr_flags (tree
, int);
4346 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
4348 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4350 #define walk_tree(a,b,c,d) \
4351 walk_tree_1 (a, b, c, d, NULL)
4352 #define walk_tree_without_duplicates(a,b,c) \
4353 walk_tree_without_duplicates_1 (a, b, c, NULL)
4355 extern tree
get_base_address (tree t
);
4356 extern tree
drop_tree_overflow (tree
);
4357 extern int tree_map_base_eq (const void *, const void *);
4358 extern unsigned int tree_map_base_hash (const void *);
4359 extern int tree_map_base_marked_p (const void *);
4361 #define tree_map_eq tree_map_base_eq
4362 extern unsigned int tree_map_hash (const void *);
4363 #define tree_map_marked_p tree_map_base_marked_p
4365 #define tree_decl_map_eq tree_map_base_eq
4366 extern unsigned int tree_decl_map_hash (const void *);
4367 #define tree_decl_map_marked_p tree_map_base_marked_p
4369 #define tree_int_map_eq tree_map_base_eq
4370 #define tree_int_map_hash tree_map_base_hash
4371 #define tree_int_map_marked_p tree_map_base_marked_p
4373 #define tree_vec_map_eq tree_map_base_eq
4374 #define tree_vec_map_hash tree_decl_map_hash
4375 #define tree_vec_map_marked_p tree_map_base_marked_p
4377 /* Initialize the abstract argument list iterator object ITER with the
4378 arguments from CALL_EXPR node EXP. */
4380 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4383 iter
->n
= call_expr_nargs (exp
);
4388 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4391 iter
->n
= call_expr_nargs (exp
);
4395 /* Return the next argument from abstract argument list iterator object ITER,
4396 and advance its state. Return NULL_TREE if there are no more arguments. */
4398 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4401 if (iter
->i
>= iter
->n
)
4403 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4408 static inline const_tree
4409 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4412 if (iter
->i
>= iter
->n
)
4414 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4419 /* Initialize the abstract argument list iterator object ITER, then advance
4420 past and return the first argument. Useful in for expressions, e.g.
4421 for (arg = first_call_expr_arg (exp, &iter); arg;
4422 arg = next_call_expr_arg (&iter)) */
4424 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4426 init_call_expr_arg_iterator (exp
, iter
);
4427 return next_call_expr_arg (iter
);
4430 static inline const_tree
4431 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4433 init_const_call_expr_arg_iterator (exp
, iter
);
4434 return next_const_call_expr_arg (iter
);
4437 /* Test whether there are more arguments in abstract argument list iterator
4438 ITER, without changing its state. */
4440 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4442 return (iter
->i
< iter
->n
);
4445 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4446 (of type call_expr_arg_iterator) to hold the iteration state. */
4447 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4448 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4449 (arg) = next_call_expr_arg (&(iter)))
4451 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4452 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4453 (arg) = next_const_call_expr_arg (&(iter)))
4455 /* Return true if tree node T is a language-specific node. */
4457 is_lang_specific (tree t
)
4459 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4462 /* Valid builtin number. */
4463 #define BUILTIN_VALID_P(FNCODE) \
4464 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4466 /* Return the tree node for an explicit standard builtin function or NULL. */
4468 builtin_decl_explicit (enum built_in_function fncode
)
4470 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4472 return builtin_info
.decl
[(size_t)fncode
];
4475 /* Return the tree node for an implicit builtin function or NULL. */
4477 builtin_decl_implicit (enum built_in_function fncode
)
4479 size_t uns_fncode
= (size_t)fncode
;
4480 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4482 if (!builtin_info
.implicit_p
[uns_fncode
])
4485 return builtin_info
.decl
[uns_fncode
];
4488 /* Set explicit builtin function nodes and whether it is an implicit
4492 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4494 size_t ufncode
= (size_t)fncode
;
4496 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4497 && (decl
!= NULL_TREE
|| !implicit_p
));
4499 builtin_info
.decl
[ufncode
] = decl
;
4500 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
4503 /* Set the implicit flag for a builtin function. */
4506 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4508 size_t uns_fncode
= (size_t)fncode
;
4510 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4511 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
4513 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
4516 /* Return whether the standard builtin function can be used as an explicit
4520 builtin_decl_explicit_p (enum built_in_function fncode
)
4522 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4523 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
4526 /* Return whether the standard builtin function can be used implicitly. */
4529 builtin_decl_implicit_p (enum built_in_function fncode
)
4531 size_t uns_fncode
= (size_t)fncode
;
4533 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4534 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
4535 && builtin_info
.implicit_p
[uns_fncode
]);
4538 /* Return true if T (assumed to be a DECL) is a global variable.
4539 A variable is considered global if its storage is not automatic. */
4542 is_global_var (const_tree t
)
4544 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
4547 /* Return true if VAR may be aliased. A variable is considered as
4548 maybe aliased if it has its address taken by the local TU
4549 or possibly by another TU and might be modified through a pointer. */
4552 may_be_aliased (const_tree var
)
4554 return (TREE_CODE (var
) != CONST_DECL
4555 && (TREE_PUBLIC (var
)
4556 || DECL_EXTERNAL (var
)
4557 || TREE_ADDRESSABLE (var
))
4558 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
4559 && ((TREE_READONLY (var
)
4560 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
4561 || (TREE_CODE (var
) == VAR_DECL
4562 && DECL_NONALIASED (var
)))));
4565 /* Return pointer to optimization flags of FNDECL. */
4566 static inline struct cl_optimization
*
4567 opts_for_fn (const_tree fndecl
)
4569 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
4570 if (fn_opts
== NULL_TREE
)
4571 fn_opts
= optimization_default_node
;
4572 return TREE_OPTIMIZATION (fn_opts
);
4575 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
4576 the optimization level of function fndecl. */
4577 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
4579 /* For anonymous aggregate types, we need some sort of name to
4580 hold on to. In practice, this should not appear, but it should
4581 not be harmful if it does. */
4582 #ifndef NO_DOT_IN_LABEL
4583 #define ANON_AGGRNAME_FORMAT "._%d"
4584 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
4585 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4586 #else /* NO_DOT_IN_LABEL */
4587 #ifndef NO_DOLLAR_IN_LABEL
4588 #define ANON_AGGRNAME_FORMAT "$_%d"
4589 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
4590 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4591 #else /* NO_DOLLAR_IN_LABEL */
4592 #define ANON_AGGRNAME_PREFIX "__anon_"
4593 #define ANON_AGGRNAME_P(ID_NODE) \
4594 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
4595 sizeof (ANON_AGGRNAME_PREFIX) - 1))
4596 #define ANON_AGGRNAME_FORMAT "__anon_%d"
4597 #endif /* NO_DOLLAR_IN_LABEL */
4598 #endif /* NO_DOT_IN_LABEL */
4600 /* The tree and const_tree overload templates. */
4604 struct int_traits
<const_tree
>
4606 static const enum precision_type precision_type
= VAR_PRECISION
;
4607 static const bool host_dependent_precision
= false;
4608 static const bool is_sign_extended
= false;
4609 static unsigned int get_precision (const_tree
);
4610 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
4615 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
4624 extended_tree (const_tree
);
4626 unsigned int get_precision () const;
4627 const HOST_WIDE_INT
*get_val () const;
4628 unsigned int get_len () const;
4632 struct int_traits
<extended_tree
<N
> >
4634 static const enum precision_type precision_type
= CONST_PRECISION
;
4635 static const bool host_dependent_precision
= false;
4636 static const bool is_sign_extended
= true;
4637 static const unsigned int precision
= N
;
4640 generic_wide_int
<extended_tree
<WIDE_INT_MAX_PRECISION
> >
4641 to_widest (const_tree
);
4643 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
4647 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
4649 return TYPE_PRECISION (TREE_TYPE (tcst
));
4652 /* Convert the tree_cst X into a wide_int of PRECISION. */
4653 inline wi::storage_ref
4654 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
4655 unsigned int precision
, const_tree x
)
4657 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
4661 inline generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
> >
4662 wi::to_widest (const_tree t
)
4667 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
4668 wi::to_offset (const_tree t
)
4674 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
4677 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
4682 wi::extended_tree
<N
>::get_precision () const
4688 inline const HOST_WIDE_INT
*
4689 wi::extended_tree
<N
>::get_val () const
4691 return &TREE_INT_CST_ELT (m_t
, 0);
4696 wi::extended_tree
<N
>::get_len () const
4698 if (N
== ADDR_MAX_PRECISION
)
4699 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
4700 else if (N
>= WIDE_INT_MAX_PRECISION
)
4701 return TREE_INT_CST_EXT_NUNITS (m_t
);
4703 /* This class is designed to be used for specific output precisions
4704 and needs to be as fast as possible, so there is no fallback for
4711 template <typename T
>
4712 bool fits_to_tree_p (const T
&x
, const_tree
);
4714 wide_int
min_value (const_tree
);
4715 wide_int
max_value (const_tree
);
4716 wide_int
from_mpz (const_tree
, mpz_t
, bool);
4719 template <typename T
>
4721 wi::fits_to_tree_p (const T
&x
, const_tree type
)
4723 if (TYPE_SIGN (type
) == UNSIGNED
)
4724 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
4726 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
4729 /* Produce the smallest number that is represented in TYPE. The precision
4730 and sign are taken from TYPE. */
4732 wi::min_value (const_tree type
)
4734 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
4737 /* Produce the largest number that is represented in TYPE. The precision
4738 and sign are taken from TYPE. */
4740 wi::max_value (const_tree type
)
4742 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
4745 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
4746 extending both according to their respective TYPE_SIGNs. */
4749 tree_int_cst_lt (const_tree t1
, const_tree t2
)
4751 return wi::lts_p (wi::to_widest (t1
), wi::to_widest (t2
));
4754 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
4755 extending both according to their respective TYPE_SIGNs. */
4758 tree_int_cst_le (const_tree t1
, const_tree t2
)
4760 return wi::les_p (wi::to_widest (t1
), wi::to_widest (t2
));
4763 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
4764 are both INTEGER_CSTs and their values are extended according to their
4765 respective TYPE_SIGNs. */
4768 tree_int_cst_compare (const_tree t1
, const_tree t2
)
4770 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
4773 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
4774 but none of these files are allowed to be included from front ends.
4775 They should be split in two. One suitable for the FEs, the other suitable
4778 /* Assign the RTX to declaration. */
4779 extern void set_decl_rtl (tree
, rtx
);
4780 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4782 /* Return a tree representing the upper bound of the array mentioned in
4783 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4784 extern tree
array_ref_up_bound (tree
);
4786 extern tree
build_personality_function (const char *);
4788 /* Given an expression EXP that is a handled_component_p,
4789 look for the ultimate containing object, which is returned and specify
4790 the access position and size. */
4791 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4792 tree
*, enum machine_mode
*, int *, int *,
4795 /* Return a tree representing the lower bound of the array mentioned in
4796 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4797 extern tree
array_ref_low_bound (tree
);
4799 /* Like bit_position, but return as an integer. It must be representable in
4800 that way (since it could be a signed value, we don't have the
4801 option of returning -1 like int_size_in_byte can. */
4803 inline HOST_WIDE_INT
4804 int_bit_position (const_tree field
)
4806 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field
)), BITS_PER_UNIT_LOG
)
4807 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
4809 #endif /* GCC_TREE_H */