1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
25 /* These includes are required here because they provide declarations
26 used by inline functions in this file.
28 FIXME - Move these users elsewhere? */
29 #include "fold-const.h"
31 /* Macros for initializing `tree_contains_struct'. */
32 #define MARK_TS_BASE(C) \
34 tree_contains_struct[C][TS_BASE] = 1; \
37 #define MARK_TS_TYPED(C) \
40 tree_contains_struct[C][TS_TYPED] = 1; \
43 #define MARK_TS_COMMON(C) \
46 tree_contains_struct[C][TS_COMMON] = 1; \
49 #define MARK_TS_TYPE_COMMON(C) \
52 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
55 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
57 MARK_TS_TYPE_COMMON (C); \
58 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
61 #define MARK_TS_DECL_MINIMAL(C) \
64 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
67 #define MARK_TS_DECL_COMMON(C) \
69 MARK_TS_DECL_MINIMAL (C); \
70 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
73 #define MARK_TS_DECL_WRTL(C) \
75 MARK_TS_DECL_COMMON (C); \
76 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
79 #define MARK_TS_DECL_WITH_VIS(C) \
81 MARK_TS_DECL_WRTL (C); \
82 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
85 #define MARK_TS_DECL_NON_COMMON(C) \
87 MARK_TS_DECL_WITH_VIS (C); \
88 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
92 /* Returns the string representing CLASS. */
94 #define TREE_CODE_CLASS_STRING(CLASS)\
95 tree_code_class_strings[(int) (CLASS)]
97 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
99 /* Nonzero if NODE represents an exceptional code. */
101 #define EXCEPTIONAL_CLASS_P(NODE)\
102 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
104 /* Nonzero if NODE represents a constant. */
106 #define CONSTANT_CLASS_P(NODE)\
107 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
109 /* Nonzero if NODE represents a type. */
111 #define TYPE_P(NODE)\
112 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
114 /* Nonzero if NODE represents a declaration. */
116 #define DECL_P(NODE)\
117 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
119 /* True if NODE designates a variable declaration. */
120 #define VAR_P(NODE) \
121 (TREE_CODE (NODE) == VAR_DECL)
123 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
125 #define VAR_OR_FUNCTION_DECL_P(DECL)\
126 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
128 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
129 ascending code order. */
131 #define INDIRECT_REF_P(NODE)\
132 (TREE_CODE (NODE) == INDIRECT_REF)
134 /* Nonzero if NODE represents a reference. */
136 #define REFERENCE_CLASS_P(NODE)\
137 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
139 /* Nonzero if NODE represents a comparison. */
141 #define COMPARISON_CLASS_P(NODE)\
142 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
144 /* Nonzero if NODE represents a unary arithmetic expression. */
146 #define UNARY_CLASS_P(NODE)\
147 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
149 /* Nonzero if NODE represents a binary arithmetic expression. */
151 #define BINARY_CLASS_P(NODE)\
152 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
154 /* Nonzero if NODE represents a statement expression. */
156 #define STATEMENT_CLASS_P(NODE)\
157 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
159 /* Nonzero if NODE represents a function call-like expression with a
160 variable-length operand vector. */
162 #define VL_EXP_CLASS_P(NODE)\
163 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
165 /* Nonzero if NODE represents any other expression. */
167 #define EXPRESSION_CLASS_P(NODE)\
168 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
170 /* Returns nonzero iff NODE represents a type or declaration. */
172 #define IS_TYPE_OR_DECL_P(NODE)\
173 (TYPE_P (NODE) || DECL_P (NODE))
175 /* Returns nonzero iff CLASS is the tree-code class of an
178 #define IS_EXPR_CODE_CLASS(CLASS)\
179 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
181 /* Returns nonzero iff NODE is an expression of some kind. */
183 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
185 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
188 /* Helper macros for math builtins. */
190 #define BUILTIN_EXP10_P(FN) \
191 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
192 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
194 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
195 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
196 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
198 #define BUILTIN_SQRT_P(FN) \
199 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
201 #define BUILTIN_CBRT_P(FN) \
202 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
204 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
206 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
207 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
208 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
210 /* Define accessors for the fields that all tree nodes have
211 (though some fields are not used for all kinds of nodes). */
213 /* The tree-code says what kind of node it is.
214 Codes are defined in tree.def. */
215 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
216 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
218 /* When checking is enabled, errors will be generated if a tree node
219 is accessed incorrectly. The macros die with a fatal error. */
220 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
222 #define TREE_CHECK(T, CODE) \
223 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
225 #define TREE_NOT_CHECK(T, CODE) \
226 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
228 #define TREE_CHECK2(T, CODE1, CODE2) \
229 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
231 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
232 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
234 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
235 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
237 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
238 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
239 (CODE1), (CODE2), (CODE3)))
241 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
242 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
243 (CODE1), (CODE2), (CODE3), (CODE4)))
245 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
246 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
247 (CODE1), (CODE2), (CODE3), (CODE4)))
249 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
250 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
251 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
253 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
254 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
255 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
257 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
258 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
260 #define TREE_CLASS_CHECK(T, CLASS) \
261 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
263 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
264 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
266 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
267 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
269 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
270 (omp_clause_range_check ((T), (CODE1), (CODE2), \
271 __FILE__, __LINE__, __FUNCTION__))
273 /* These checks have to be special cased. */
274 #define EXPR_CHECK(T) \
275 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
277 /* These checks have to be special cased. */
278 #define NON_TYPE_CHECK(T) \
279 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
281 #define TREE_VEC_ELT_CHECK(T, I) \
282 (*(CONST_CAST2 (tree *, typeof (T)*, \
283 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
285 #define OMP_CLAUSE_ELT_CHECK(T, I) \
286 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
288 /* Special checks for TREE_OPERANDs. */
289 #define TREE_OPERAND_CHECK(T, I) \
290 (*(CONST_CAST2 (tree*, typeof (T)*, \
291 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
293 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
294 (*(tree_operand_check_code ((T), (CODE), (I), \
295 __FILE__, __LINE__, __FUNCTION__)))
297 /* Nodes are chained together for many purposes.
298 Types are chained together to record them for being output to the debugger
299 (see the function `chain_type').
300 Decls in the same scope are chained together to record the contents
302 Statement nodes for successive statements used to be chained together.
303 Often lists of things are represented by TREE_LIST nodes that
304 are chained together. */
306 #define TREE_CHAIN(NODE) \
307 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
309 /* In all nodes that are expressions, this is the data type of the expression.
310 In POINTER_TYPE nodes, this is the type that the pointer points to.
311 In ARRAY_TYPE nodes, this is the type of the elements.
312 In VECTOR_TYPE nodes, this is the type of the elements. */
313 #define TREE_TYPE(NODE) \
314 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
316 extern void tree_contains_struct_check_failed (const_tree
,
317 const enum tree_node_structure_enum
,
318 const char *, int, const char *)
321 extern void tree_check_failed (const_tree
, const char *, int, const char *,
322 ...) ATTRIBUTE_NORETURN
;
323 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
324 ...) ATTRIBUTE_NORETURN
;
325 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
326 const char *, int, const char *)
328 extern void tree_range_check_failed (const_tree
, const char *, int,
329 const char *, enum tree_code
,
332 extern void tree_not_class_check_failed (const_tree
,
333 const enum tree_code_class
,
334 const char *, int, const char *)
336 extern void tree_vec_elt_check_failed (int, int, const char *,
339 extern void phi_node_elt_check_failed (int, int, const char *,
342 extern void tree_operand_check_failed (int, const_tree
,
343 const char *, int, const char *)
345 extern void omp_clause_check_failed (const_tree
, const char *, int,
346 const char *, enum omp_clause_code
)
348 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
351 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
352 const char *, enum omp_clause_code
,
353 enum omp_clause_code
)
356 #else /* not ENABLE_TREE_CHECKING, or not gcc */
358 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
359 #define TREE_CHECK(T, CODE) (T)
360 #define TREE_NOT_CHECK(T, CODE) (T)
361 #define TREE_CHECK2(T, CODE1, CODE2) (T)
362 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
363 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
364 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
365 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
366 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
367 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
368 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
369 #define TREE_CLASS_CHECK(T, CODE) (T)
370 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
371 #define EXPR_CHECK(T) (T)
372 #define NON_TYPE_CHECK(T) (T)
373 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
374 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
375 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
376 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
377 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
378 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
380 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
381 #define TREE_TYPE(NODE) ((NODE)->typed.type)
385 #define TREE_BLOCK(NODE) (tree_block (NODE))
386 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
388 #include "tree-check.h"
390 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
391 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
392 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
393 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
394 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
395 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
396 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
397 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
398 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
399 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
400 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
402 #define RECORD_OR_UNION_CHECK(T) \
403 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
404 #define NOT_RECORD_OR_UNION_CHECK(T) \
405 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
407 #define NUMERICAL_TYPE_CHECK(T) \
408 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
411 /* Here is how primitive or already-canonicalized types' hash codes
413 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
415 /* A simple hash function for an arbitrary tree node. This must not be
416 used in hash tables which are saved to a PCH. */
417 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
419 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
420 #define CONVERT_EXPR_CODE_P(CODE) \
421 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
423 /* Similarly, but accept an expressions instead of a tree code. */
424 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
426 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
428 #define CASE_CONVERT \
432 /* Given an expression as a tree, strip any conversion that generates
433 no instruction. Accepts both tree and const_tree arguments since
434 we are not modifying the tree itself. */
436 #define STRIP_NOPS(EXP) \
437 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
439 /* Like STRIP_NOPS, but don't let the signedness change either. */
441 #define STRIP_SIGN_NOPS(EXP) \
442 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
444 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
446 #define STRIP_TYPE_NOPS(EXP) \
447 while ((CONVERT_EXPR_P (EXP) \
448 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
449 && TREE_OPERAND (EXP, 0) != error_mark_node \
450 && (TREE_TYPE (EXP) \
451 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
452 (EXP) = TREE_OPERAND (EXP, 0)
454 /* Remove unnecessary type conversions according to
455 tree_ssa_useless_type_conversion. */
457 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
458 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
460 /* Nonzero if TYPE represents a vector type. */
462 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
464 /* Nonzero if TYPE represents an integral type. Note that we do not
465 include COMPLEX types here. Keep these checks in ascending code
468 #define INTEGRAL_TYPE_P(TYPE) \
469 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
470 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
471 || TREE_CODE (TYPE) == INTEGER_TYPE)
473 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
475 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
476 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
478 /* Nonzero if TYPE represents a saturating fixed-point type. */
480 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
481 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
483 /* Nonzero if TYPE represents a fixed-point type. */
485 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
487 /* Nonzero if TYPE represents a scalar floating-point type. */
489 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
491 /* Nonzero if TYPE represents a complex floating-point type. */
493 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
494 (TREE_CODE (TYPE) == COMPLEX_TYPE \
495 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
497 /* Nonzero if TYPE represents a vector integer type. */
499 #define VECTOR_INTEGER_TYPE_P(TYPE) \
500 (VECTOR_TYPE_P (TYPE) \
501 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
504 /* Nonzero if TYPE represents a vector floating-point type. */
506 #define VECTOR_FLOAT_TYPE_P(TYPE) \
507 (VECTOR_TYPE_P (TYPE) \
508 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
510 /* Nonzero if TYPE represents a floating-point type, including complex
511 and vector floating-point types. The vector and complex check does
512 not use the previous two macros to enable early folding. */
514 #define FLOAT_TYPE_P(TYPE) \
515 (SCALAR_FLOAT_TYPE_P (TYPE) \
516 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
517 || VECTOR_TYPE_P (TYPE)) \
518 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
520 /* Nonzero if TYPE represents a decimal floating-point type. */
521 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
522 (SCALAR_FLOAT_TYPE_P (TYPE) \
523 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
525 /* Nonzero if TYPE is a record or union type. */
526 #define RECORD_OR_UNION_TYPE_P(TYPE) \
527 (TREE_CODE (TYPE) == RECORD_TYPE \
528 || TREE_CODE (TYPE) == UNION_TYPE \
529 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
531 /* Nonzero if TYPE represents an aggregate (multi-component) type.
532 Keep these checks in ascending code order. */
534 #define AGGREGATE_TYPE_P(TYPE) \
535 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
537 /* Nonzero if TYPE represents a pointer or reference type.
538 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
539 ascending code order. */
541 #define POINTER_TYPE_P(TYPE) \
542 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
544 /* Nonzero if TYPE represents a pointer to function. */
545 #define FUNCTION_POINTER_TYPE_P(TYPE) \
546 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
548 /* Nonzero if this type is a complete type. */
549 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
551 /* Nonzero if this type is a pointer bounds type. */
552 #define POINTER_BOUNDS_TYPE_P(NODE) \
553 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
555 /* Nonzero if this node has a pointer bounds type. */
556 #define POINTER_BOUNDS_P(NODE) \
557 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
559 /* Nonzero if this type supposes bounds existence. */
560 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
562 /* Nonzero for objects with bounded type. */
563 #define BOUNDED_P(node) \
564 BOUNDED_TYPE_P (TREE_TYPE (node))
566 /* Nonzero if this type is the (possibly qualified) void type. */
567 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
569 /* Nonzero if this type is complete or is cv void. */
570 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
571 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
573 /* Nonzero if this type is complete or is an array with unspecified bound. */
574 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
575 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
577 /* Define many boolean fields that all tree nodes have. */
579 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
580 of this is needed. So it cannot be in a register.
581 In a FUNCTION_DECL it has no meaning.
582 In LABEL_DECL nodes, it means a goto for this label has been seen
583 from a place outside all binding contours that restore stack levels.
584 In an artificial SSA_NAME that points to a stack partition with at least
585 two variables, it means that at least one variable has TREE_ADDRESSABLE.
586 In ..._TYPE nodes, it means that objects of this type must be fully
587 addressable. This means that pieces of this object cannot go into
588 register parameters, for example. If this a function type, this
589 means that the value must be returned in memory.
590 In CONSTRUCTOR nodes, it means object constructed must be in memory.
591 In IDENTIFIER_NODEs, this means that some extern decl for this name
592 had its address taken. That matters for inline functions.
593 In a STMT_EXPR, it means we want the result of the enclosed expression. */
594 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
596 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
597 exit of a function. Calls for which this is true are candidates for tail
598 call optimizations. */
599 #define CALL_EXPR_TAILCALL(NODE) \
600 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
602 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
603 CASE_LOW operand has been processed. */
604 #define CASE_LOW_SEEN(NODE) \
605 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
607 #define PREDICT_EXPR_OUTCOME(NODE) \
608 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
609 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
610 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
611 #define PREDICT_EXPR_PREDICTOR(NODE) \
612 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
614 /* In a VAR_DECL, nonzero means allocate static storage.
615 In a FUNCTION_DECL, nonzero if function has been defined.
616 In a CONSTRUCTOR, nonzero means allocate static storage. */
617 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
619 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
620 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
622 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
623 should only be executed if an exception is thrown, not on normal exit
625 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
627 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
628 separate cleanup in honor_protect_cleanup_actions. */
629 #define TRY_CATCH_IS_CLEANUP(NODE) \
630 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
632 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
633 CASE_HIGH operand has been processed. */
634 #define CASE_HIGH_SEEN(NODE) \
635 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
637 /* Used to mark scoped enums. */
638 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
640 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
641 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
643 /* In an expr node (usually a conversion) this means the node was made
644 implicitly and should not lead to any sort of warning. In a decl node,
645 warnings concerning the decl should be suppressed. This is used at
646 least for used-before-set warnings, and it set after one warning is
648 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
650 /* Used to indicate that this TYPE represents a compiler-generated entity. */
651 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
653 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
654 this string as an argument. */
655 #define TREE_SYMBOL_REFERENCED(NODE) \
656 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
658 /* Nonzero in a pointer or reference type means the data pointed to
659 by this type can alias anything. */
660 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
661 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
663 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
664 there was an overflow in folding. */
666 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
668 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
670 #define TREE_OVERFLOW_P(EXPR) \
671 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
673 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
674 nonzero means name is to be accessible from outside this translation unit.
675 In an IDENTIFIER_NODE, nonzero means an external declaration
676 accessible from outside this translation unit was previously seen
677 for this name in an inner scope. */
678 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
680 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
681 of cached values, or is something else. */
682 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
684 /* In a SAVE_EXPR, indicates that the original expression has already
685 been substituted with a VAR_DECL that contains the value. */
686 #define SAVE_EXPR_RESOLVED_P(NODE) \
687 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
689 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
691 #define CALL_EXPR_VA_ARG_PACK(NODE) \
692 (CALL_EXPR_CHECK (NODE)->base.public_flag)
694 /* In any expression, decl, or constant, nonzero means it has side effects or
695 reevaluation of the whole expression could produce a different value.
696 This is set if any subexpression is a function call, a side effect or a
697 reference to a volatile variable. In a ..._DECL, this is set only if the
698 declaration said `volatile'. This will never be set for a constant. */
699 #define TREE_SIDE_EFFECTS(NODE) \
700 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
702 /* In a LABEL_DECL, nonzero means this label had its address taken
703 and therefore can never be deleted and is a jump target for
705 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
707 /* Nonzero means this expression is volatile in the C sense:
708 its address should be of type `volatile WHATEVER *'.
709 In other words, the declared item is volatile qualified.
710 This is used in _DECL nodes and _REF nodes.
711 On a FUNCTION_DECL node, this means the function does not
712 return normally. This is the same effect as setting
713 the attribute noreturn on the function in C.
715 In a ..._TYPE node, means this type is volatile-qualified.
716 But use TYPE_VOLATILE instead of this macro when the node is a type,
717 because eventually we may make that a different bit.
719 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
720 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
722 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
723 accessing the memory pointed to won't generate a trap. However,
724 this only applies to an object when used appropriately: it doesn't
725 mean that writing a READONLY mem won't trap.
727 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
728 (or slice of the array) always belongs to the range of the array.
729 I.e. that the access will not trap, provided that the access to
730 the base to the array will not trap. */
731 #define TREE_THIS_NOTRAP(NODE) \
732 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
733 ARRAY_RANGE_REF)->base.nothrow_flag)
735 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
736 nonzero means it may not be the lhs of an assignment.
737 Nonzero in a FUNCTION_DECL means this function should be treated
738 as "const" function (can only read its arguments). */
739 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
741 /* Value of expression is constant. Always on in all ..._CST nodes. May
742 also appear in an expression or decl where the value is constant. */
743 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
745 /* Nonzero if NODE, a type, has had its sizes gimplified. */
746 #define TYPE_SIZES_GIMPLIFIED(NODE) \
747 (TYPE_CHECK (NODE)->base.constant_flag)
749 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
750 #define DECL_UNSIGNED(NODE) \
751 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
753 /* In integral and pointer types, means an unsigned type. */
754 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
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 CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
840 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
842 /* In a type, nonzero means that all objects of the type are guaranteed by the
843 language or front-end to be properly aligned, so we can indicate that a MEM
844 of this type is aligned at least to the alignment of the type, even if it
845 doesn't appear that it is. We see this, for example, in object-oriented
846 languages where a tag field may show this is an object of a more-aligned
847 variant of the more generic type.
849 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
851 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
853 /* Used in classes in C++. */
854 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
855 /* Used in classes in C++. */
856 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
858 /* True if reference type NODE is a C++ rvalue reference. */
859 #define TYPE_REF_IS_RVALUE(NODE) \
860 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
862 /* Nonzero in a _DECL if the use of the name is defined as a
863 deprecated feature by __attribute__((deprecated)). */
864 #define TREE_DEPRECATED(NODE) \
865 ((NODE)->base.deprecated_flag)
867 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
868 uses are to be substituted for uses of the TREE_CHAINed identifier. */
869 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
870 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
872 /* In fixed-point types, means a saturating type. */
873 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
875 /* These flags are available for each language front end to use internally. */
876 #define TREE_LANG_FLAG_0(NODE) \
877 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
878 #define TREE_LANG_FLAG_1(NODE) \
879 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
880 #define TREE_LANG_FLAG_2(NODE) \
881 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
882 #define TREE_LANG_FLAG_3(NODE) \
883 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
884 #define TREE_LANG_FLAG_4(NODE) \
885 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
886 #define TREE_LANG_FLAG_5(NODE) \
887 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
888 #define TREE_LANG_FLAG_6(NODE) \
889 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
891 /* Define additional fields and accessors for nodes representing constants. */
893 /* In an INTEGER_CST node. These two together make a 2-word integer.
894 If the data type is signed, the value is sign-extended to 2 words
895 even though not all of them may really be in use.
896 In an unsigned constant shorter than 2 words, the extra bits are 0. */
897 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
898 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
899 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
901 #define INT_CST_LT(A, B) \
902 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
903 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
904 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
906 #define INT_CST_LT_UNSIGNED(A, B) \
907 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
908 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
909 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
910 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
911 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
913 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
914 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
916 #define TREE_FIXED_CST_PTR(NODE) \
917 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
918 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
920 /* In a STRING_CST */
921 /* In C terms, this is sizeof, not strlen. */
922 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
923 #define TREE_STRING_POINTER(NODE) \
924 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
926 /* In a COMPLEX_CST node. */
927 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
928 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
930 /* In a VECTOR_CST node. */
931 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
932 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
933 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
935 /* Define fields and accessors for some special-purpose tree nodes. */
937 #define IDENTIFIER_LENGTH(NODE) \
938 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
939 #define IDENTIFIER_POINTER(NODE) \
940 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
941 #define IDENTIFIER_HASH_VALUE(NODE) \
942 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
944 /* Translate a hash table identifier pointer to a tree_identifier
945 pointer, and vice versa. */
947 #define HT_IDENT_TO_GCC_IDENT(NODE) \
948 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
949 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
951 /* In a TREE_LIST node. */
952 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
953 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
955 /* In a TREE_VEC node. */
956 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
957 #define TREE_VEC_END(NODE) \
958 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
960 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
962 /* In a CONSTRUCTOR node. */
963 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
964 #define CONSTRUCTOR_ELT(NODE,IDX) \
965 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
966 #define CONSTRUCTOR_NELTS(NODE) \
967 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
968 #define CONSTRUCTOR_NO_CLEARING(NODE) \
969 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
971 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
972 value of each element (stored within VAL). IX must be a scratch variable
973 of unsigned integer type. */
974 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
975 for (IX = 0; (IX >= vec_safe_length (V)) \
977 : ((VAL = (*(V))[IX].value), \
981 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
982 the value of each element (stored within VAL) and its index (stored
983 within INDEX). IX must be a scratch variable of unsigned integer type. */
984 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
985 for (IX = 0; (IX >= vec_safe_length (V)) \
987 : (((void) (VAL = (*V)[IX].value)), \
988 (INDEX = (*V)[IX].index), \
992 /* Append a new constructor element to V, with the specified INDEX and VAL. */
993 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
995 constructor_elt _ce___ = {INDEX, VALUE}; \
996 vec_safe_push ((V), _ce___); \
999 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1000 constructor output purposes. */
1001 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1002 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1004 /* True if NODE is a clobber right hand side, an expression of indeterminate
1005 value that clobbers the LHS in a copy instruction. We use a volatile
1006 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1007 In particular the volatile flag causes us to not prematurely remove
1008 such clobber instructions. */
1009 #define TREE_CLOBBER_P(NODE) \
1010 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1012 /* Define fields and accessors for some nodes that represent expressions. */
1014 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1015 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1016 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1017 && integer_zerop (TREE_OPERAND (NODE, 0)))
1019 /* In ordinary expression nodes. */
1020 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1021 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1023 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1024 length. Its value includes the length operand itself; that is,
1025 the minimum valid length is 1.
1026 Note that we have to bypass the use of TREE_OPERAND to access
1027 that field to avoid infinite recursion in expanding the macros. */
1028 #define VL_EXP_OPERAND_LENGTH(NODE) \
1029 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1031 /* Nonzero if is_gimple_debug() may possibly hold. */
1032 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1034 /* In a LOOP_EXPR node. */
1035 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1037 /* The source location of this expression. Non-tree_exp nodes such as
1038 decls and constants can be shared among multiple locations, so
1040 #define EXPR_LOCATION(NODE) \
1041 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1042 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1043 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1044 != UNKNOWN_LOCATION)
1045 /* The location to be used in a diagnostic about this expression. Do not
1046 use this macro if the location will be assigned to other expressions. */
1047 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1048 ? (NODE)->exp.locus : (LOCUS))
1049 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1050 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1052 /* True if a tree is an expression or statement that can have a
1054 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1056 extern void protected_set_expr_location (tree
, location_t
);
1058 /* In a TARGET_EXPR node. */
1059 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1060 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1061 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1063 /* DECL_EXPR accessor. This gives access to the DECL associated with
1064 the given declaration statement. */
1065 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1067 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1069 /* COMPOUND_LITERAL_EXPR accessors. */
1070 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1071 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1072 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1073 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1075 /* SWITCH_EXPR accessors. These give access to the condition, body and
1076 original condition type (before any compiler conversions)
1077 of the switch statement, respectively. */
1078 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1079 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1080 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1082 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1083 of a case label, respectively. */
1084 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1085 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1086 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1087 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1089 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1090 corresponding MEM_REF operands. */
1091 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1092 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1093 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1094 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1095 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1097 /* The operands of a BIND_EXPR. */
1098 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1099 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1100 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1102 /* GOTO_EXPR accessor. This gives access to the label associated with
1103 a goto statement. */
1104 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1106 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1107 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1108 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1110 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1111 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1112 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1113 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1114 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1115 /* Nonzero if we want to create an ASM_INPUT instead of an
1116 ASM_OPERAND with no operands. */
1117 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1118 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1120 /* COND_EXPR accessors. */
1121 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1122 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1123 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1125 /* Accessors for the chains of recurrences. */
1126 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1127 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1128 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1129 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1131 /* LABEL_EXPR accessor. This gives access to the label associated with
1132 the given label expression. */
1133 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1135 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1136 accessors for SSA operands. */
1138 /* CATCH_EXPR accessors. */
1139 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1140 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1142 /* EH_FILTER_EXPR accessors. */
1143 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1144 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1146 /* OBJ_TYPE_REF accessors. */
1147 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1148 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1149 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1151 /* ASSERT_EXPR accessors. */
1152 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1153 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1155 /* CALL_EXPR accessors.
1157 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1158 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1159 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1160 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1162 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1163 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1164 the argument count is zero when checking is enabled. Instead, do
1165 the pointer arithmetic to advance past the 3 fixed operands in a
1166 CALL_EXPR. That produces a valid pointer to just past the end of the
1167 operand array, even if it's not valid to dereference it. */
1168 #define CALL_EXPR_ARGP(NODE) \
1169 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1171 /* TM directives and accessors. */
1172 #define TRANSACTION_EXPR_BODY(NODE) \
1173 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1174 #define TRANSACTION_EXPR_OUTER(NODE) \
1175 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1176 #define TRANSACTION_EXPR_RELAXED(NODE) \
1177 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1179 /* OpenMP directive and clause accessors. */
1181 #define OMP_BODY(NODE) \
1182 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1183 #define OMP_CLAUSES(NODE) \
1184 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1186 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1187 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1189 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1190 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1192 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1193 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1194 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1196 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1197 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1198 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1199 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1200 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1201 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1202 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1204 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1205 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1207 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1209 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1210 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1212 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1214 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1216 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1218 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1219 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1221 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1222 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1224 #define OMP_TARGET_DATA_BODY(NODE) \
1225 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1226 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1227 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1229 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1230 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1232 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1233 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1235 #define OMP_CLAUSE_SIZE(NODE) \
1236 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1240 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1241 #define OMP_CLAUSE_DECL(NODE) \
1242 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1243 OMP_CLAUSE_PRIVATE, \
1244 OMP_CLAUSE__LOOPTEMP_), 0)
1245 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1246 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1247 != UNKNOWN_LOCATION)
1248 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1250 /* True on an OMP_SECTION statement that was the last lexical member.
1251 This status is meaningful in the implementation of lastprivate. */
1252 #define OMP_SECTION_LAST(NODE) \
1253 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1255 /* True on an OMP_PARALLEL statement if it represents an explicit
1256 combined parallel work-sharing constructs. */
1257 #define OMP_PARALLEL_COMBINED(NODE) \
1258 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1260 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1261 as opposed to relaxed. */
1262 #define OMP_ATOMIC_SEQ_CST(NODE) \
1263 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1264 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1266 /* True on a PRIVATE clause if its decl is kept around for debugging
1267 information only and its DECL_VALUE_EXPR is supposed to point
1268 to what it has been remapped to. */
1269 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1270 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1272 /* True on a PRIVATE clause if ctor needs access to outer region's
1274 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1275 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1277 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1278 decl is present in the chain. */
1279 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1280 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1281 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1282 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1283 OMP_CLAUSE_LASTPRIVATE),\
1285 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1286 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1288 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1289 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1290 #define OMP_CLAUSE_IF_EXPR(NODE) \
1291 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1292 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1293 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1294 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1295 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1297 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1298 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1300 #define OMP_CLAUSE_MAP_KIND(NODE) \
1301 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1303 /* Nonzero if this map clause is for array (rather than pointer) based array
1304 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1305 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1306 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1307 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1309 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1310 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1312 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1313 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1314 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1315 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1316 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1317 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1319 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1320 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1321 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1322 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1323 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1324 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1325 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1326 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1327 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1328 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1329 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1330 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1332 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1333 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1334 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1335 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1337 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1338 are always initialized inside of the loop construct, false otherwise. */
1339 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1340 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1342 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1343 are declared inside of the simd construct. */
1344 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1345 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1347 /* True if a LINEAR clause has a stride that is variable. */
1348 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1349 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1351 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1352 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1354 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1355 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1357 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1358 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1360 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1361 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1362 OMP_CLAUSE_THREAD_LIMIT), 0)
1364 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1365 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1367 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1368 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1369 OMP_CLAUSE_DIST_SCHEDULE), 0)
1371 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1372 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1374 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1375 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1377 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1378 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1380 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1381 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1383 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1384 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1386 /* SSA_NAME accessors. */
1388 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1389 if there is no name associated with it. */
1390 #define SSA_NAME_IDENTIFIER(NODE) \
1391 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1392 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1393 ? (NODE)->ssa_name.var \
1394 : DECL_NAME ((NODE)->ssa_name.var)) \
1397 /* Returns the variable being referenced. This can be NULL_TREE for
1398 temporaries not associated with any user variable.
1399 Once released, this is the only field that can be relied upon. */
1400 #define SSA_NAME_VAR(NODE) \
1401 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1402 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1403 ? NULL_TREE : (NODE)->ssa_name.var)
1405 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1406 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1408 /* Returns the statement which defines this SSA name. */
1409 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1411 /* Returns the SSA version number of this SSA name. Note that in
1412 tree SSA, version numbers are not per variable and may be recycled. */
1413 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1415 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1416 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1418 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1419 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1421 /* Nonzero if this SSA_NAME expression is currently on the free list of
1422 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1423 has no meaning for an SSA_NAME. */
1424 #define SSA_NAME_IN_FREE_LIST(NODE) \
1425 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1427 /* Nonzero if this SSA_NAME is the default definition for the
1428 underlying symbol. A default SSA name is created for symbol S if
1429 the very first reference to S in the function is a read operation.
1430 Default definitions are always created by an empty statement and
1431 belong to no basic block. */
1432 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1433 SSA_NAME_CHECK (NODE)->base.default_def_flag
1435 /* Attributes for SSA_NAMEs for pointer-type variables. */
1436 #define SSA_NAME_PTR_INFO(N) \
1437 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1439 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1440 #define SSA_NAME_ANTI_RANGE_P(N) \
1441 SSA_NAME_CHECK (N)->base.static_flag
1443 /* The type of range described by SSA_NAME_RANGE_INFO. */
1444 #define SSA_NAME_RANGE_TYPE(N) \
1445 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1447 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1448 #define SSA_NAME_RANGE_INFO(N) \
1449 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1451 /* Return the immediate_use information for an SSA_NAME. */
1452 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1454 #define OMP_CLAUSE_CODE(NODE) \
1455 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1457 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1458 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1460 #define OMP_CLAUSE_OPERAND(NODE, I) \
1461 OMP_CLAUSE_ELT_CHECK (NODE, I)
1463 /* In a BLOCK node. */
1464 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1465 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1466 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1467 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1468 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1469 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1470 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1471 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1472 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1473 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1474 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1476 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1477 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1479 /* An index number for this block. These values are not guaranteed to
1480 be unique across functions -- whether or not they are depends on
1481 the debugging output format in use. */
1482 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1484 /* If block reordering splits a lexical block into discontiguous
1485 address ranges, we'll make a copy of the original block.
1487 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1488 In that case, we have one source block that has been replicated
1489 (through inlining or unrolling) into many logical blocks, and that
1490 these logical blocks have different physical variables in them.
1492 In this case, we have one logical block split into several
1493 non-contiguous address ranges. Most debug formats can't actually
1494 represent this idea directly, so we fake it by creating multiple
1495 logical blocks with the same variables in them. However, for those
1496 that do support non-contiguous regions, these allow the original
1497 logical block to be reconstructed, along with the set of address
1500 One of the logical block fragments is arbitrarily chosen to be
1501 the ORIGIN. The other fragments will point to the origin via
1502 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1503 be null. The list of fragments will be chained through
1504 BLOCK_FRAGMENT_CHAIN from the origin. */
1506 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1507 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1509 /* For an inlined function, this gives the location where it was called
1510 from. This is only set in the top level block, which corresponds to the
1511 inlined function scope. This is used in the debug output routines. */
1513 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.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 /* Every ..._DECL node gets a unique number. */
1931 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1933 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1935 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1937 /* Every ..._DECL node gets a unique number that stays the same even
1938 when the decl is copied by the inliner once it is set. */
1939 #define DECL_PT_UID(NODE) \
1940 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1941 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1942 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1943 #define SET_DECL_PT_UID(NODE, UID) \
1944 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1945 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1946 be preserved when copyin the decl. */
1947 #define DECL_PT_UID_SET_P(NODE) \
1948 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1950 /* These two fields describe where in the source code the declaration
1951 was. If the declaration appears in several places (as for a C
1952 function that is declared first and then defined later), this
1953 information should refer to the definition. */
1954 #define DECL_SOURCE_LOCATION(NODE) \
1955 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1956 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1957 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1958 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1959 /* This accessor returns TRUE if the decl it operates on was created
1960 by a front-end or back-end rather than by user code. In this case
1961 builtin-ness is indicated by source location. */
1962 #define DECL_IS_BUILTIN(DECL) \
1963 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1965 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1966 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1967 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1968 nodes, this points to either the FUNCTION_DECL for the containing
1969 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1970 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1971 scope". In particular, for VAR_DECLs which are virtual table pointers
1972 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1974 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1975 #define DECL_FIELD_CONTEXT(NODE) \
1976 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1978 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1979 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1981 /* For any sort of a ..._DECL node, this points to the original (abstract)
1982 decl node which this decl is an inlined/cloned instance of, or else it
1983 is NULL indicating that this decl is not an instance of some other decl.
1985 The C front-end also uses this in a nested declaration of an inline
1986 function, to point back to the definition. */
1987 #define DECL_ABSTRACT_ORIGIN(NODE) \
1988 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1990 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1991 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1992 #define DECL_ORIGIN(NODE) \
1993 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1995 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1996 inline instance of some original (abstract) decl from an inline function;
1997 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1998 nodes can also have their abstract origin set to themselves. */
1999 #define DECL_FROM_INLINE(NODE) \
2000 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2001 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2003 /* In a DECL this is the field where attributes are stored. */
2004 #define DECL_ATTRIBUTES(NODE) \
2005 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2007 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2008 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2009 For a VAR_DECL, holds the initial value.
2010 For a PARM_DECL, used for DECL_ARG_TYPE--default
2011 values for parameters are encoded in the type of the function,
2012 not in the PARM_DECL slot.
2013 For a FIELD_DECL, this is used for enumeration values and the C
2014 frontend uses it for temporarily storing bitwidth of bitfields.
2016 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2017 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2019 /* Holds the size of the datum, in bits, as a tree expression.
2020 Need not be constant. */
2021 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2022 /* Likewise for the size in bytes. */
2023 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2024 /* Holds the alignment required for the datum, in bits. */
2025 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2026 /* The alignment of NODE, in bytes. */
2027 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2028 /* Set if the alignment of this DECL has been set by the user, for
2029 example with an 'aligned' attribute. */
2030 #define DECL_USER_ALIGN(NODE) \
2031 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2032 /* Holds the machine mode corresponding to the declaration of a variable or
2033 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2035 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2037 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2038 operation it is. Note, however, that this field is overloaded, with
2039 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2040 checked before any access to the former. */
2041 #define DECL_FUNCTION_CODE(NODE) \
2042 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2044 #define DECL_FUNCTION_PERSONALITY(NODE) \
2045 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2047 /* Nonzero for a given ..._DECL node means that the name of this node should
2048 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2049 the associated type should be ignored. For a FUNCTION_DECL, the body of
2050 the function should also be ignored. */
2051 #define DECL_IGNORED_P(NODE) \
2052 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2054 /* Nonzero for a given ..._DECL node means that this node represents an
2055 "abstract instance" of the given declaration (e.g. in the original
2056 declaration of an inline function). When generating symbolic debugging
2057 information, we mustn't try to generate any address information for nodes
2058 marked as "abstract instances" because we don't actually generate
2059 any code or allocate any data space for such instances. */
2060 #define DECL_ABSTRACT(NODE) \
2061 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2063 /* Language-specific decl information. */
2064 #define DECL_LANG_SPECIFIC(NODE) \
2065 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2067 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2068 do not allocate storage, and refer to a definition elsewhere. Note that
2069 this does not necessarily imply the entity represented by NODE
2070 has no program source-level definition in this translation unit. For
2071 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2072 DECL_EXTERNAL may be true simultaneously; that can be the case for
2073 a C99 "extern inline" function. */
2074 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2076 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2077 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2079 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2081 Also set in some languages for variables, etc., outside the normal
2082 lexical scope, such as class instance variables. */
2083 #define DECL_NONLOCAL(NODE) \
2084 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2086 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2087 Used in FIELD_DECLs for vtable pointers.
2088 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2089 #define DECL_VIRTUAL_P(NODE) \
2090 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2092 /* Used to indicate that this DECL represents a compiler-generated entity. */
2093 #define DECL_ARTIFICIAL(NODE) \
2094 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2096 /* Additional flags for language-specific uses. */
2097 #define DECL_LANG_FLAG_0(NODE) \
2098 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2099 #define DECL_LANG_FLAG_1(NODE) \
2100 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2101 #define DECL_LANG_FLAG_2(NODE) \
2102 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2103 #define DECL_LANG_FLAG_3(NODE) \
2104 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2105 #define DECL_LANG_FLAG_4(NODE) \
2106 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2107 #define DECL_LANG_FLAG_5(NODE) \
2108 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2109 #define DECL_LANG_FLAG_6(NODE) \
2110 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2111 #define DECL_LANG_FLAG_7(NODE) \
2112 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2113 #define DECL_LANG_FLAG_8(NODE) \
2114 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2116 /* Nonzero for a scope which is equal to file scope. */
2117 #define SCOPE_FILE_SCOPE_P(EXP) \
2118 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2119 /* Nonzero for a decl which is at file scope. */
2120 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2121 /* Nonzero for a type which is at file scope. */
2122 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2124 /* Nonzero for a decl that is decorated using attribute used.
2125 This indicates to compiler tools that this decl needs to be preserved. */
2126 #define DECL_PRESERVE_P(DECL) \
2127 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2129 /* For function local variables of COMPLEX and VECTOR types,
2130 indicates that the variable is not aliased, and that all
2131 modifications to the variable have been adjusted so that
2132 they are killing assignments. Thus the variable may now
2133 be treated as a GIMPLE register, and use real instead of
2134 virtual ops in SSA form. */
2135 #define DECL_GIMPLE_REG_P(DECL) \
2136 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2138 extern tree
decl_value_expr_lookup (tree
);
2139 extern void decl_value_expr_insert (tree
, tree
);
2141 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2142 if transformations have made this more complicated than evaluating the
2143 decl itself. This should only be used for debugging; once this field has
2144 been set, the decl itself may not legitimately appear in the function. */
2145 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2146 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2147 ->decl_common.decl_flag_2)
2148 #define DECL_VALUE_EXPR(NODE) \
2149 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2150 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2151 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2153 /* Holds the RTL expression for the value of a variable or function.
2154 This value can be evaluated lazily for functions, variables with
2155 static storage duration, and labels. */
2156 #define DECL_RTL(NODE) \
2157 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2158 ? (NODE)->decl_with_rtl.rtl \
2159 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2161 /* Set the DECL_RTL for NODE to RTL. */
2162 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2164 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2165 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2167 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2168 #define DECL_RTL_SET_P(NODE) \
2169 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2171 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2172 NODE1, it will not be set for NODE2; this is a lazy copy. */
2173 #define COPY_DECL_RTL(NODE1, NODE2) \
2174 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2175 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2177 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2178 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2180 #if (GCC_VERSION >= 2007)
2181 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2182 ({ tree const __d = (decl); \
2183 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2184 /* Dereference it so the compiler knows it can't be NULL even \
2185 without assertion checking. */ \
2186 &*DECL_RTL_IF_SET (__d); })
2188 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2191 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2192 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2194 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2195 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2196 of the structure. */
2197 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2199 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2200 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2201 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2202 natural alignment of the field's type). */
2203 #define DECL_FIELD_BIT_OFFSET(NODE) \
2204 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2206 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2207 if so, the type that was originally specified for it.
2208 TREE_TYPE may have been modified (in finish_struct). */
2209 #define DECL_BIT_FIELD_TYPE(NODE) \
2210 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2212 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2213 representative FIELD_DECL. */
2214 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2215 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2217 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2218 if nonzero, indicates that the field occupies the type. */
2219 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2221 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2222 DECL_FIELD_OFFSET which are known to be always zero.
2223 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2225 #define DECL_OFFSET_ALIGN(NODE) \
2226 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2228 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2229 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2230 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2232 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2233 which this FIELD_DECL is defined. This information is needed when
2234 writing debugging information about vfield and vbase decls for C++. */
2235 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2237 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2238 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2240 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2242 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2244 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2245 this component. This makes it possible for Type-Based Alias Analysis
2246 to disambiguate accesses to this field with indirect accesses using
2249 struct S { int i; } s;
2252 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2254 From the implementation's viewpoint, the alias set of the type of the
2255 field 'i' (int) will not be recorded as a subset of that of the type of
2256 's' (struct S) in record_component_aliases. The counterpart is that
2257 accesses to s.i must not be given the alias set of the type of 'i'
2258 (int) but instead directly that of the type of 's' (struct S). */
2259 #define DECL_NONADDRESSABLE_P(NODE) \
2260 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2262 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2263 dense, unique within any one function, and may be used to index arrays.
2264 If the value is -1, then no UID has been assigned. */
2265 #define LABEL_DECL_UID(NODE) \
2266 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2268 /* In a LABEL_DECL, the EH region number for which the label is the
2269 post_landing_pad. */
2270 #define EH_LANDING_PAD_NR(NODE) \
2271 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2273 /* For a PARM_DECL, records the data type used to pass the argument,
2274 which may be different from the type seen in the program. */
2275 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2277 /* For PARM_DECL, holds an RTL for the stack slot or register
2278 where the data was actually passed. */
2279 #define DECL_INCOMING_RTL(NODE) \
2280 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2282 /* Nonzero for a given ..._DECL node means that no warnings should be
2283 generated just because this node is unused. */
2284 #define DECL_IN_SYSTEM_HEADER(NODE) \
2285 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2287 /* Used to indicate that the linkage status of this DECL is not yet known,
2288 so it should not be output now. */
2289 #define DECL_DEFER_OUTPUT(NODE) \
2290 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2292 /* In a VAR_DECL that's static,
2293 nonzero if the space is in the text section. */
2294 #define DECL_IN_TEXT_SECTION(NODE) \
2295 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2297 /* In a VAR_DECL that's static,
2298 nonzero if it belongs to the global constant pool. */
2299 #define DECL_IN_CONSTANT_POOL(NODE) \
2300 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2302 /* Nonzero for a given ..._DECL node means that this node should be
2303 put in .common, if possible. If a DECL_INITIAL is given, and it
2304 is not error_mark_node, then the decl cannot be put in .common. */
2305 #define DECL_COMMON(NODE) \
2306 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2308 /* In a VAR_DECL, nonzero if the decl is a register variable with
2309 an explicit asm specification. */
2310 #define DECL_HARD_REGISTER(NODE) \
2311 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2313 /* Used to indicate that this DECL has weak linkage. */
2314 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2316 /* Used to indicate that the DECL is a dllimport. */
2317 #define DECL_DLLIMPORT_P(NODE) \
2318 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2320 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2321 not be put out unless it is needed in this translation unit.
2322 Entities like this are shared across translation units (like weak
2323 entities), but are guaranteed to be generated by any translation
2324 unit that needs them, and therefore need not be put out anywhere
2325 where they are not needed. DECL_COMDAT is just a hint to the
2326 back-end; it is up to front-ends which set this flag to ensure
2327 that there will never be any harm, other than bloat, in putting out
2328 something which is DECL_COMDAT. */
2329 #define DECL_COMDAT(NODE) \
2330 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2332 #define DECL_COMDAT_GROUP(NODE) \
2333 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2335 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2336 multiple translation units should be merged. */
2337 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2339 /* The name of the object as the assembler will see it (but before any
2340 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2341 as DECL_NAME. It is an IDENTIFIER_NODE. */
2342 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2344 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2345 This is true of all DECL nodes except FIELD_DECL. */
2346 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2347 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2349 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2350 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2352 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2353 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2354 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2356 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2357 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2358 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2360 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2361 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2362 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2363 semantics of using this macro, are different than saying:
2365 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2367 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2369 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2370 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2371 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2372 DECL_ASSEMBLER_NAME (DECL1)) \
2375 /* Records the section name in a section attribute. Used to pass
2376 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2377 #define DECL_SECTION_NAME(NODE) \
2378 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2380 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2381 this variable in a BIND_EXPR. */
2382 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2383 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2385 /* Value of the decls's visibility attribute */
2386 #define DECL_VISIBILITY(NODE) \
2387 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2389 /* Nonzero means that the decl had its visibility specified rather than
2391 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2392 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2394 /* In a VAR_DECL, the model to use if the data should be allocated from
2395 thread-local storage. */
2396 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2398 /* In a VAR_DECL, nonzero if the data should be allocated from
2399 thread-local storage. */
2400 #define DECL_THREAD_LOCAL_P(NODE) \
2401 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2403 /* In a non-local VAR_DECL with static storage duration, true if the
2404 variable has an initialization priority. If false, the variable
2405 will be initialized at the DEFAULT_INIT_PRIORITY. */
2406 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2407 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2409 /* Specify whether the section name was set by user or by
2410 compiler via -ffunction-sections. */
2411 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2412 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2414 extern tree
decl_debug_expr_lookup (tree
);
2415 extern void decl_debug_expr_insert (tree
, tree
);
2417 /* For VAR_DECL, this is set to an expression that it was split from. */
2418 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2419 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2420 #define DECL_DEBUG_EXPR(NODE) \
2421 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2423 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2424 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2426 extern priority_type
decl_init_priority_lookup (tree
);
2427 extern priority_type
decl_fini_priority_lookup (tree
);
2428 extern void decl_init_priority_insert (tree
, priority_type
);
2429 extern void decl_fini_priority_insert (tree
, priority_type
);
2431 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2433 #define DECL_INIT_PRIORITY(NODE) \
2434 (decl_init_priority_lookup (NODE))
2435 /* Set the initialization priority for NODE to VAL. */
2436 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2437 (decl_init_priority_insert (NODE, VAL))
2439 /* For a FUNCTION_DECL the finalization priority of NODE. */
2440 #define DECL_FINI_PRIORITY(NODE) \
2441 (decl_fini_priority_lookup (NODE))
2442 /* Set the finalization priority for NODE to VAL. */
2443 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2444 (decl_fini_priority_insert (NODE, VAL))
2446 /* The initialization priority for entities for which no explicit
2447 initialization priority has been specified. */
2448 #define DEFAULT_INIT_PRIORITY 65535
2450 /* The maximum allowed initialization priority. */
2451 #define MAX_INIT_PRIORITY 65535
2453 /* The largest priority value reserved for use by system runtime
2455 #define MAX_RESERVED_INIT_PRIORITY 100
2457 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2458 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2459 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2461 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2462 #define DECL_NONLOCAL_FRAME(NODE) \
2463 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2465 /* This field is used to reference anything in decl.result and is meant only
2466 for use by the garbage collector. */
2467 #define DECL_RESULT_FLD(NODE) \
2468 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2470 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2471 Before the struct containing the FUNCTION_DECL is laid out,
2472 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2473 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2474 function. When the class is laid out, this pointer is changed
2475 to an INTEGER_CST node which is suitable for use as an index
2476 into the virtual function table.
2477 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2478 #define DECL_VINDEX(NODE) \
2479 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2481 /* In FUNCTION_DECL, holds the decl for the return value. */
2482 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2484 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2485 #define DECL_UNINLINABLE(NODE) \
2486 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2488 /* In a FUNCTION_DECL, the saved representation of the body of the
2490 #define DECL_SAVED_TREE(NODE) \
2491 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2493 /* Nonzero in a FUNCTION_DECL means this function should be treated
2494 as if it were a malloc, meaning it returns a pointer that is
2496 #define DECL_IS_MALLOC(NODE) \
2497 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2499 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2500 C++ operator new, meaning that it returns a pointer for which we
2501 should not use type based aliasing. */
2502 #define DECL_IS_OPERATOR_NEW(NODE) \
2503 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2505 /* Nonzero in a FUNCTION_DECL means this function may return more
2507 #define DECL_IS_RETURNS_TWICE(NODE) \
2508 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2510 /* Nonzero in a FUNCTION_DECL means this function should be treated
2511 as "pure" function (like const function, but may read global memory). */
2512 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2514 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2515 the const or pure function may not terminate. When this is nonzero
2516 for a const or pure function, it can be dealt with by cse passes
2517 but cannot be removed by dce passes since you are not allowed to
2518 change an infinite looping program into one that terminates without
2520 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2521 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2523 /* Nonzero in a FUNCTION_DECL means this function should be treated
2524 as "novops" function (function that does not read global memory,
2525 but may have arbitrary side effects). */
2526 #define DECL_IS_NOVOPS(NODE) \
2527 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2529 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2530 at the beginning or end of execution. */
2531 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2532 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2534 #define DECL_STATIC_DESTRUCTOR(NODE) \
2535 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2537 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2538 be instrumented with calls to support routines. */
2539 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2540 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2542 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2543 disabled in this function. */
2544 #define DECL_NO_LIMIT_STACK(NODE) \
2545 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2547 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2548 #define DECL_STATIC_CHAIN(NODE) \
2549 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2551 /* Nonzero for a decl that cgraph has decided should be inlined into
2552 at least one call site. It is not meaningful to look at this
2553 directly; always use cgraph_function_possibly_inlined_p. */
2554 #define DECL_POSSIBLY_INLINED(DECL) \
2555 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2557 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2558 such as via the `inline' keyword in C/C++. This flag controls the linkage
2559 semantics of 'inline' */
2560 #define DECL_DECLARED_INLINE_P(NODE) \
2561 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2563 /* Nonzero in a FUNCTION_DECL means this function should not get
2564 -Winline warnings. */
2565 #define DECL_NO_INLINE_WARNING_P(NODE) \
2566 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2568 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2569 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2570 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2572 /* Nonzero if a FUNCTION_CODE is a TM load. */
2573 #define BUILTIN_TM_LOAD_P(FN) \
2574 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2576 /* Nonzero if a FUNCTION_CODE is a TM store. */
2577 #define BUILTIN_TM_STORE_P(FN) \
2578 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2580 #define CASE_BUILT_IN_TM_LOAD(FN) \
2581 case BUILT_IN_TM_LOAD_##FN: \
2582 case BUILT_IN_TM_LOAD_RAR_##FN: \
2583 case BUILT_IN_TM_LOAD_RAW_##FN: \
2584 case BUILT_IN_TM_LOAD_RFW_##FN
2586 #define CASE_BUILT_IN_TM_STORE(FN) \
2587 case BUILT_IN_TM_STORE_##FN: \
2588 case BUILT_IN_TM_STORE_WAR_##FN: \
2589 case BUILT_IN_TM_STORE_WAW_##FN
2591 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2592 disregarding size and cost heuristics. This is equivalent to using
2593 the always_inline attribute without the required diagnostics if the
2594 function cannot be inlined. */
2595 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2596 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2598 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2599 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2601 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2602 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2603 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2605 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2606 that describes the status of this function. */
2607 #define DECL_STRUCT_FUNCTION(NODE) \
2608 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2610 /* In a FUNCTION_DECL, nonzero means a built in function of a
2611 standard library or more generally a built in function that is
2612 recognized by optimizers and expanders.
2614 Note that it is different from the DECL_IS_BUILTIN accessor. For
2615 instance, user declared prototypes of C library functions are not
2616 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2617 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2619 /* For a builtin function, identify which part of the compiler defined it. */
2620 #define DECL_BUILT_IN_CLASS(NODE) \
2621 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2623 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2624 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2626 #define DECL_ARGUMENTS(NODE) \
2627 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2628 #define DECL_ARGUMENT_FLD(NODE) \
2629 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2631 /* In FUNCTION_DECL, the function specific target options to use when compiling
2633 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2634 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2636 /* In FUNCTION_DECL, the function specific optimization options to use when
2637 compiling this function. */
2638 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2639 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2641 /* In FUNCTION_DECL, this is set if this function has other versions generated
2642 using "target" attributes. The default version is the one which does not
2643 have any "target" attribute set. */
2644 #define DECL_FUNCTION_VERSIONED(NODE)\
2645 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2647 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2648 Devirtualization machinery uses this knowledge for determing type of the
2649 object constructed. Also we assume that constructor address is not
2651 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2652 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2654 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2655 Devirtualization machinery uses this to track types in destruction. */
2656 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2657 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2659 /* In FUNCTION_DECL that represent an virtual method this is set when
2660 the method is final. */
2661 #define DECL_FINAL_P(NODE)\
2662 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2664 /* The source language of the translation-unit. */
2665 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2666 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2668 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2670 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2671 #define DECL_ORIGINAL_TYPE(NODE) \
2672 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2674 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2675 into stabs. Instead it will generate cross reference ('x') of names.
2676 This uses the same flag as DECL_EXTERNAL. */
2677 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2678 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2680 /* Getter of the imported declaration associated to the
2681 IMPORTED_DECL node. */
2682 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2683 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2685 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2686 To reduce overhead, the nodes containing the statements are not trees.
2687 This avoids the overhead of tree_common on all linked list elements.
2689 Use the interface in tree-iterator.h to access this node. */
2691 #define STATEMENT_LIST_HEAD(NODE) \
2692 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2693 #define STATEMENT_LIST_TAIL(NODE) \
2694 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2696 #define TREE_OPTIMIZATION(NODE) \
2697 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2699 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2700 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2702 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2703 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2705 /* Return a tree node that encapsulates the optimization options in OPTS. */
2706 extern tree
build_optimization_node (struct gcc_options
*opts
);
2708 #define TREE_TARGET_OPTION(NODE) \
2709 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2711 /* Return a tree node that encapsulates the target options in OPTS. */
2712 extern tree
build_target_option_node (struct gcc_options
*opts
);
2714 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2717 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2719 if (TREE_CODE (__t
) != __c
)
2720 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2725 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2728 if (TREE_CODE (__t
) == __c
)
2729 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2734 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2735 enum tree_code __c1
, enum tree_code __c2
)
2737 if (TREE_CODE (__t
) != __c1
2738 && TREE_CODE (__t
) != __c2
)
2739 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2744 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2745 enum tree_code __c1
, enum tree_code __c2
)
2747 if (TREE_CODE (__t
) == __c1
2748 || TREE_CODE (__t
) == __c2
)
2749 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2754 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2755 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2757 if (TREE_CODE (__t
) != __c1
2758 && TREE_CODE (__t
) != __c2
2759 && TREE_CODE (__t
) != __c3
)
2760 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2765 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2766 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2768 if (TREE_CODE (__t
) == __c1
2769 || TREE_CODE (__t
) == __c2
2770 || TREE_CODE (__t
) == __c3
)
2771 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2776 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2777 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2778 enum tree_code __c4
)
2780 if (TREE_CODE (__t
) != __c1
2781 && TREE_CODE (__t
) != __c2
2782 && TREE_CODE (__t
) != __c3
2783 && TREE_CODE (__t
) != __c4
)
2784 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2789 tree_not_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_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2802 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2803 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2804 enum tree_code __c4
, enum tree_code __c5
)
2806 if (TREE_CODE (__t
) != __c1
2807 && TREE_CODE (__t
) != __c2
2808 && TREE_CODE (__t
) != __c3
2809 && TREE_CODE (__t
) != __c4
2810 && TREE_CODE (__t
) != __c5
)
2811 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2816 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2817 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2818 enum tree_code __c4
, enum tree_code __c5
)
2820 if (TREE_CODE (__t
) == __c1
2821 || TREE_CODE (__t
) == __c2
2822 || TREE_CODE (__t
) == __c3
2823 || TREE_CODE (__t
) == __c4
2824 || TREE_CODE (__t
) == __c5
)
2825 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2830 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2831 const char *__f
, int __l
, const char *__g
)
2833 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2834 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2839 tree_class_check (tree __t
, const enum tree_code_class __class
,
2840 const char *__f
, int __l
, const char *__g
)
2842 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2843 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2848 tree_range_check (tree __t
,
2849 enum tree_code __code1
, enum tree_code __code2
,
2850 const char *__f
, int __l
, const char *__g
)
2852 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2853 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2858 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2859 const char *__f
, int __l
, const char *__g
)
2861 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2862 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2863 if (__t
->omp_clause
.code
!= __code
)
2864 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2869 omp_clause_range_check (tree __t
,
2870 enum omp_clause_code __code1
,
2871 enum omp_clause_code __code2
,
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 ((int) __t
->omp_clause
.code
< (int) __code1
2877 || (int) __t
->omp_clause
.code
> (int) __code2
)
2878 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2882 /* These checks have to be special cased. */
2885 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2887 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2888 if (!IS_EXPR_CODE_CLASS (__c
))
2889 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2893 /* These checks have to be special cased. */
2896 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2899 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2904 tree_vec_elt_check (tree __t
, int __i
,
2905 const char *__f
, int __l
, const char *__g
)
2907 if (TREE_CODE (__t
) != TREE_VEC
)
2908 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2909 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2910 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2911 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2915 omp_clause_elt_check (tree __t
, int __i
,
2916 const char *__f
, int __l
, const char *__g
)
2918 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2919 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2920 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2921 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2922 return &__t
->omp_clause
.ops
[__i
];
2926 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2929 if (TREE_CODE (__t
) != __c
)
2930 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2935 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2938 if (TREE_CODE (__t
) == __c
)
2939 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2944 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2945 enum tree_code __c1
, enum tree_code __c2
)
2947 if (TREE_CODE (__t
) != __c1
2948 && TREE_CODE (__t
) != __c2
)
2949 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2954 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2955 enum tree_code __c1
, enum tree_code __c2
)
2957 if (TREE_CODE (__t
) == __c1
2958 || TREE_CODE (__t
) == __c2
)
2959 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2964 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2965 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2967 if (TREE_CODE (__t
) != __c1
2968 && TREE_CODE (__t
) != __c2
2969 && TREE_CODE (__t
) != __c3
)
2970 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2975 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2976 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2978 if (TREE_CODE (__t
) == __c1
2979 || TREE_CODE (__t
) == __c2
2980 || TREE_CODE (__t
) == __c3
)
2981 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2986 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2987 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2988 enum tree_code __c4
)
2990 if (TREE_CODE (__t
) != __c1
2991 && TREE_CODE (__t
) != __c2
2992 && TREE_CODE (__t
) != __c3
2993 && TREE_CODE (__t
) != __c4
)
2994 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2999 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3000 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3001 enum tree_code __c4
)
3003 if (TREE_CODE (__t
) == __c1
3004 || TREE_CODE (__t
) == __c2
3005 || TREE_CODE (__t
) == __c3
3006 || TREE_CODE (__t
) == __c4
)
3007 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3012 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3013 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3014 enum tree_code __c4
, enum tree_code __c5
)
3016 if (TREE_CODE (__t
) != __c1
3017 && TREE_CODE (__t
) != __c2
3018 && TREE_CODE (__t
) != __c3
3019 && TREE_CODE (__t
) != __c4
3020 && TREE_CODE (__t
) != __c5
)
3021 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3026 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3027 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3028 enum tree_code __c4
, enum tree_code __c5
)
3030 if (TREE_CODE (__t
) == __c1
3031 || TREE_CODE (__t
) == __c2
3032 || TREE_CODE (__t
) == __c3
3033 || TREE_CODE (__t
) == __c4
3034 || TREE_CODE (__t
) == __c5
)
3035 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3040 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3041 const char *__f
, int __l
, const char *__g
)
3043 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3044 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3049 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3050 const char *__f
, int __l
, const char *__g
)
3052 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3053 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3058 tree_range_check (const_tree __t
,
3059 enum tree_code __code1
, enum tree_code __code2
,
3060 const char *__f
, int __l
, const char *__g
)
3062 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3063 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3068 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3069 const char *__f
, int __l
, const char *__g
)
3071 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3072 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3073 if (__t
->omp_clause
.code
!= __code
)
3074 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3079 omp_clause_range_check (const_tree __t
,
3080 enum omp_clause_code __code1
,
3081 enum omp_clause_code __code2
,
3082 const char *__f
, int __l
, const char *__g
)
3084 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3085 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3086 if ((int) __t
->omp_clause
.code
< (int) __code1
3087 || (int) __t
->omp_clause
.code
> (int) __code2
)
3088 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3093 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3095 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3096 if (!IS_EXPR_CODE_CLASS (__c
))
3097 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3102 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3105 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3110 tree_vec_elt_check (const_tree __t
, int __i
,
3111 const char *__f
, int __l
, const char *__g
)
3113 if (TREE_CODE (__t
) != TREE_VEC
)
3114 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3115 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3116 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3117 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3118 //return &__t->vec.a[__i];
3122 omp_clause_elt_check (const_tree __t
, int __i
,
3123 const char *__f
, int __l
, const char *__g
)
3125 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3126 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3127 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3128 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3129 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3134 /* Compute the number of operands in an expression node NODE. For
3135 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3136 otherwise it is looked up from the node's code. */
3138 tree_operand_length (const_tree node
)
3140 if (VL_EXP_CLASS_P (node
))
3141 return VL_EXP_OPERAND_LENGTH (node
);
3143 return TREE_CODE_LENGTH (TREE_CODE (node
));
3146 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3148 /* Special checks for TREE_OPERANDs. */
3150 tree_operand_check (tree __t
, int __i
,
3151 const char *__f
, int __l
, const char *__g
)
3153 const_tree __u
= EXPR_CHECK (__t
);
3154 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3155 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3156 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3160 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3161 const char *__f
, int __l
, const char *__g
)
3163 if (TREE_CODE (__t
) != __code
)
3164 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3165 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3166 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3167 return &__t
->exp
.operands
[__i
];
3171 tree_operand_check (const_tree __t
, int __i
,
3172 const char *__f
, int __l
, const char *__g
)
3174 const_tree __u
= EXPR_CHECK (__t
);
3175 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3176 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3177 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3181 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3182 const char *__f
, int __l
, const char *__g
)
3184 if (TREE_CODE (__t
) != __code
)
3185 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3186 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3187 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3188 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3193 #define error_mark_node global_trees[TI_ERROR_MARK]
3195 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3196 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3197 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3198 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3199 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3201 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3202 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3203 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3204 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3205 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3207 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3208 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3209 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3210 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3211 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3213 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3214 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3215 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3217 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3218 #define integer_one_node global_trees[TI_INTEGER_ONE]
3219 #define integer_three_node global_trees[TI_INTEGER_THREE]
3220 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3221 #define size_zero_node global_trees[TI_SIZE_ZERO]
3222 #define size_one_node global_trees[TI_SIZE_ONE]
3223 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3224 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3225 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3227 /* Base access nodes. */
3228 #define access_public_node global_trees[TI_PUBLIC]
3229 #define access_protected_node global_trees[TI_PROTECTED]
3230 #define access_private_node global_trees[TI_PRIVATE]
3232 #define null_pointer_node global_trees[TI_NULL_POINTER]
3234 #define float_type_node global_trees[TI_FLOAT_TYPE]
3235 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3236 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3238 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3239 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3240 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3241 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3243 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3244 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3245 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3246 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3248 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3250 #define void_type_node global_trees[TI_VOID_TYPE]
3251 /* The C type `void *'. */
3252 #define ptr_type_node global_trees[TI_PTR_TYPE]
3253 /* The C type `const void *'. */
3254 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3255 /* The C type `size_t'. */
3256 #define size_type_node global_trees[TI_SIZE_TYPE]
3257 #define pid_type_node global_trees[TI_PID_TYPE]
3258 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3259 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3260 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3261 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3262 /* The C type `FILE *'. */
3263 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3264 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3266 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3267 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3268 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3270 /* The decimal floating point types. */
3271 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3272 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3273 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3274 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3275 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3276 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3278 /* The fixed-point types. */
3279 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3280 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3281 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3282 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3283 #define sat_unsigned_short_fract_type_node \
3284 global_trees[TI_SAT_USFRACT_TYPE]
3285 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3286 #define sat_unsigned_long_fract_type_node \
3287 global_trees[TI_SAT_ULFRACT_TYPE]
3288 #define sat_unsigned_long_long_fract_type_node \
3289 global_trees[TI_SAT_ULLFRACT_TYPE]
3290 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3291 #define fract_type_node global_trees[TI_FRACT_TYPE]
3292 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3293 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3294 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3295 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3296 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3297 #define unsigned_long_long_fract_type_node \
3298 global_trees[TI_ULLFRACT_TYPE]
3299 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3300 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3301 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3302 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3303 #define sat_unsigned_short_accum_type_node \
3304 global_trees[TI_SAT_USACCUM_TYPE]
3305 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3306 #define sat_unsigned_long_accum_type_node \
3307 global_trees[TI_SAT_ULACCUM_TYPE]
3308 #define sat_unsigned_long_long_accum_type_node \
3309 global_trees[TI_SAT_ULLACCUM_TYPE]
3310 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3311 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3312 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3313 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3314 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3315 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3316 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3317 #define unsigned_long_long_accum_type_node \
3318 global_trees[TI_ULLACCUM_TYPE]
3319 #define qq_type_node global_trees[TI_QQ_TYPE]
3320 #define hq_type_node global_trees[TI_HQ_TYPE]
3321 #define sq_type_node global_trees[TI_SQ_TYPE]
3322 #define dq_type_node global_trees[TI_DQ_TYPE]
3323 #define tq_type_node global_trees[TI_TQ_TYPE]
3324 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3325 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3326 #define usq_type_node global_trees[TI_USQ_TYPE]
3327 #define udq_type_node global_trees[TI_UDQ_TYPE]
3328 #define utq_type_node global_trees[TI_UTQ_TYPE]
3329 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3330 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3331 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3332 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3333 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3334 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3335 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3336 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3337 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3338 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3339 #define ha_type_node global_trees[TI_HA_TYPE]
3340 #define sa_type_node global_trees[TI_SA_TYPE]
3341 #define da_type_node global_trees[TI_DA_TYPE]
3342 #define ta_type_node global_trees[TI_TA_TYPE]
3343 #define uha_type_node global_trees[TI_UHA_TYPE]
3344 #define usa_type_node global_trees[TI_USA_TYPE]
3345 #define uda_type_node global_trees[TI_UDA_TYPE]
3346 #define uta_type_node global_trees[TI_UTA_TYPE]
3347 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3348 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3349 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3350 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3351 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3352 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3353 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3354 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3356 /* The node that should be placed at the end of a parameter list to
3357 indicate that the function does not take a variable number of
3358 arguments. The TREE_VALUE will be void_type_node and there will be
3359 no TREE_CHAIN. Language-independent code should not assume
3360 anything else about this node. */
3361 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3363 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3364 #define MAIN_NAME_P(NODE) \
3365 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3367 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3369 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3370 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3372 /* Default/current target options (TARGET_OPTION_NODE). */
3373 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3374 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3376 /* Default tree list option(), optimize() pragmas to be linked into the
3378 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3379 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3381 #define char_type_node integer_types[itk_char]
3382 #define signed_char_type_node integer_types[itk_signed_char]
3383 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3384 #define short_integer_type_node integer_types[itk_short]
3385 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3386 #define integer_type_node integer_types[itk_int]
3387 #define unsigned_type_node integer_types[itk_unsigned_int]
3388 #define long_integer_type_node integer_types[itk_long]
3389 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3390 #define long_long_integer_type_node integer_types[itk_long_long]
3391 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3392 #define int128_integer_type_node integer_types[itk_int128]
3393 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3395 #define NULL_TREE (tree) NULL
3397 /* True if NODE is an erroneous expression. */
3399 #define error_operand_p(NODE) \
3400 ((NODE) == error_mark_node \
3401 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3403 extern tree
decl_assembler_name (tree
);
3405 /* Compute the number of bytes occupied by 'node'. This routine only
3406 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3408 extern size_t tree_size (const_tree
);
3410 /* Compute the number of bytes occupied by a tree with code CODE. This
3411 function cannot be used for TREE_VEC codes, which are of variable
3413 extern size_t tree_code_size (enum tree_code
);
3415 /* Allocate and return a new UID from the DECL_UID namespace. */
3416 extern int allocate_decl_uid (void);
3418 /* Lowest level primitive for allocating a node.
3419 The TREE_CODE is the only argument. Contents are initialized
3420 to zero except for a few of the common fields. */
3422 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3423 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3425 /* Make a copy of a node, with all the same contents. */
3427 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3428 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3430 /* Make a copy of a chain of TREE_LIST nodes. */
3432 extern tree
copy_list (tree
);
3434 /* Make a CASE_LABEL_EXPR. */
3436 extern tree
build_case_label (tree
, tree
, tree
);
3439 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3440 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3442 /* Make a TREE_VEC. */
3444 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3445 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3447 /* Grow a TREE_VEC. */
3449 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3450 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3452 /* Construct various types of nodes. */
3454 extern tree
build_nt (enum tree_code
, ...);
3455 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3457 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3458 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3459 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3460 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3461 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3462 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3463 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3464 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3465 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3466 tree MEM_STAT_DECL
);
3467 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3468 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3469 tree MEM_STAT_DECL
);
3470 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3472 /* _loc versions of build[1-5]. */
3475 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3476 tree arg1 MEM_STAT_DECL
)
3478 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3479 if (CAN_HAVE_LOCATION_P (t
))
3480 SET_EXPR_LOCATION (t
, loc
);
3483 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3486 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3487 tree arg1 MEM_STAT_DECL
)
3489 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3490 if (CAN_HAVE_LOCATION_P (t
))
3491 SET_EXPR_LOCATION (t
, loc
);
3494 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3497 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3498 tree arg1
, tree arg2 MEM_STAT_DECL
)
3500 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3501 if (CAN_HAVE_LOCATION_P (t
))
3502 SET_EXPR_LOCATION (t
, loc
);
3505 #define build3_loc(l,c,t1,t2,t3,t4) \
3506 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3509 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3510 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3512 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3513 if (CAN_HAVE_LOCATION_P (t
))
3514 SET_EXPR_LOCATION (t
, loc
);
3517 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3518 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3521 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3522 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3524 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3525 arg4 PASS_MEM_STAT
);
3526 if (CAN_HAVE_LOCATION_P (t
))
3527 SET_EXPR_LOCATION (t
, loc
);
3530 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3531 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3533 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3534 #define build_var_debug_value(t1,t2) \
3535 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3537 /* Constructs double_int from tree CST. */
3539 static inline double_int
3540 tree_to_double_int (const_tree cst
)
3542 return TREE_INT_CST (cst
);
3545 extern tree
double_int_to_tree (tree
, double_int
);
3546 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
3547 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
3549 /* Create an INT_CST node with a CST value zero extended. */
3552 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
3554 return double_int_to_tree (type
, double_int::from_uhwi (cst
));
3557 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3558 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3559 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3560 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3561 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3562 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3563 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3564 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3565 extern tree
build_vector_from_val (tree
, tree
);
3566 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3567 extern tree
build_constructor_single (tree
, tree
, tree
);
3568 extern tree
build_constructor_from_list (tree
, tree
);
3569 extern tree
build_constructor_va (tree
, int, ...);
3570 extern tree
build_real_from_int_cst (tree
, const_tree
);
3571 extern tree
build_complex (tree
, tree
, tree
);
3572 extern tree
build_one_cst (tree
);
3573 extern tree
build_minus_one_cst (tree
);
3574 extern tree
build_all_ones_cst (tree
);
3575 extern tree
build_zero_cst (tree
);
3576 extern tree
build_string (int, const char *);
3577 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3578 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3579 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3580 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3581 extern tree
build_decl_stat (location_t
, enum tree_code
,
3582 tree
, tree MEM_STAT_DECL
);
3583 extern tree
build_fn_decl (const char *, tree
);
3584 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3585 extern tree
build_translation_unit_decl (tree
);
3586 extern tree
build_block (tree
, tree
, tree
, tree
);
3587 extern tree
build_empty_stmt (location_t
);
3588 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3590 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3591 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3593 extern tree
build_call_nary (tree
, tree
, int, ...);
3594 extern tree
build_call_valist (tree
, tree
, int, va_list);
3595 #define build_call_array(T1,T2,N,T3)\
3596 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3597 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3598 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3600 /* Construct various nodes representing data types. */
3602 extern tree
signed_or_unsigned_type_for (int, tree
);
3603 extern tree
signed_type_for (tree
);
3604 extern tree
unsigned_type_for (tree
);
3605 extern tree
truth_type_for (tree
);
3606 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3607 extern tree
build_pointer_type (tree
);
3608 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3609 extern tree
build_reference_type (tree
);
3610 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3611 extern tree
build_vector_type (tree innertype
, int nunits
);
3612 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3613 extern tree
build_index_type (tree
);
3614 extern tree
build_array_type (tree
, tree
);
3615 extern tree
build_nonshared_array_type (tree
, tree
);
3616 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3617 extern tree
build_function_type (tree
, tree
);
3618 extern tree
build_function_type_list (tree
, ...);
3619 extern tree
build_varargs_function_type_list (tree
, ...);
3620 extern tree
build_function_type_array (tree
, int, tree
*);
3621 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3622 #define build_function_type_vec(RET, V) \
3623 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3624 #define build_varargs_function_type_vec(RET, V) \
3625 build_varargs_function_type_array (RET, vec_safe_length (V), \
3626 vec_safe_address (V))
3627 extern tree
build_method_type_directly (tree
, tree
, tree
);
3628 extern tree
build_method_type (tree
, tree
);
3629 extern tree
build_offset_type (tree
, tree
);
3630 extern tree
build_complex_type (tree
);
3631 extern tree
array_type_nelts (const_tree
);
3633 extern tree
value_member (tree
, tree
);
3634 extern tree
purpose_member (const_tree
, tree
);
3635 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3636 extern tree
chain_index (int, tree
);
3638 extern int attribute_list_equal (const_tree
, const_tree
);
3639 extern int attribute_list_contained (const_tree
, const_tree
);
3640 extern int tree_int_cst_equal (const_tree
, const_tree
);
3641 extern int tree_int_cst_lt (const_tree
, const_tree
);
3642 extern int tree_int_cst_compare (const_tree
, const_tree
);
3643 extern bool tree_fits_shwi_p (const_tree
)
3644 #ifndef ENABLE_TREE_CHECKING
3645 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
3648 extern bool tree_fits_uhwi_p (const_tree
)
3649 #ifndef ENABLE_TREE_CHECKING
3650 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
3653 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
3654 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
3655 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3656 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
3657 tree_to_shwi (const_tree t
)
3659 gcc_assert (tree_fits_shwi_p (t
));
3660 return TREE_INT_CST_LOW (t
);
3663 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
3664 tree_to_uhwi (const_tree t
)
3666 gcc_assert (tree_fits_uhwi_p (t
));
3667 return TREE_INT_CST_LOW (t
);
3670 extern int tree_int_cst_sgn (const_tree
);
3671 extern int tree_int_cst_sign_bit (const_tree
);
3672 extern unsigned int tree_int_cst_min_precision (tree
, bool);
3673 extern tree
strip_array_types (tree
);
3674 extern tree
excess_precision_type (tree
);
3675 extern bool valid_constant_size_p (const_tree
);
3678 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3679 put the prototype here. Rtl.h does declare the prototype if
3680 tree.h had been included. */
3682 extern tree
make_tree (tree
, rtx
);
3684 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3687 Such modified types already made are recorded so that duplicates
3690 extern tree
build_type_attribute_variant (tree
, tree
);
3691 extern tree
build_decl_attribute_variant (tree
, tree
);
3692 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3694 /* Return 0 if the attributes for two types are incompatible, 1 if they
3695 are compatible, and 2 if they are nearly compatible (which causes a
3696 warning to be generated). */
3697 extern int comp_type_attributes (const_tree
, const_tree
);
3699 /* Default versions of target-overridable functions. */
3700 extern tree
merge_decl_attributes (tree
, tree
);
3701 extern tree
merge_type_attributes (tree
, tree
);
3703 /* This function is a private implementation detail of lookup_attribute()
3704 and you should never call it directly. */
3705 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3707 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3708 return a pointer to the attribute's list element if the attribute
3709 is part of the list, or NULL_TREE if not found. If the attribute
3710 appears more than once, this only returns the first occurrence; the
3711 TREE_CHAIN of the return value should be passed back in if further
3712 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3716 lookup_attribute (const char *attr_name
, tree list
)
3718 gcc_checking_assert (attr_name
[0] != '_');
3719 /* In most cases, list is NULL_TREE. */
3720 if (list
== NULL_TREE
)
3723 /* Do the strlen() before calling the out-of-line implementation.
3724 In most cases attr_name is a string constant, and the compiler
3725 will optimize the strlen() away. */
3726 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3729 /* This function is a private implementation detail of
3730 is_attribute_p() and you should never call it directly. */
3731 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3733 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3734 if the identifier node is a valid attribute name for the string.
3735 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3736 be the identifier for 'text' or for '__text__'. */
3739 is_attribute_p (const char *attr_name
, const_tree ident
)
3741 gcc_checking_assert (attr_name
[0] != '_');
3742 /* Do the strlen() before calling the out-of-line implementation.
3743 In most cases attr_name is a string constant, and the compiler
3744 will optimize the strlen() away. */
3745 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3748 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3749 modified list. ATTR_NAME must be in the form 'text' (not
3752 extern tree
remove_attribute (const char *, tree
);
3754 /* Given two attributes lists, return a list of their union. */
3756 extern tree
merge_attributes (tree
, tree
);
3758 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3759 /* Given two Windows decl attributes lists, possibly including
3760 dllimport, return a list of their union . */
3761 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3763 /* Handle a "dllimport" or "dllexport" attribute. */
3764 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3767 /* Check whether CAND is suitable to be returned from get_qualified_type
3768 (BASE, TYPE_QUALS). */
3770 extern bool check_qualified_type (const_tree
, const_tree
, int);
3772 /* Return a version of the TYPE, qualified as indicated by the
3773 TYPE_QUALS, if one exists. If no qualified version exists yet,
3774 return NULL_TREE. */
3776 extern tree
get_qualified_type (tree
, int);
3778 /* Like get_qualified_type, but creates the type if it does not
3779 exist. This function never returns NULL_TREE. */
3781 extern tree
build_qualified_type (tree
, int);
3783 /* Create a variant of type T with alignment ALIGN. */
3785 extern tree
build_aligned_type (tree
, unsigned int);
3787 /* Like build_qualified_type, but only deals with the `const' and
3788 `volatile' qualifiers. This interface is retained for backwards
3789 compatibility with the various front-ends; new code should use
3790 build_qualified_type instead. */
3792 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3793 build_qualified_type ((TYPE), \
3794 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3795 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3797 /* Make a copy of a type node. */
3799 extern tree
build_distinct_type_copy (tree
);
3800 extern tree
build_variant_type_copy (tree
);
3802 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3803 return a canonicalized ..._TYPE node, so that duplicates are not made.
3804 How the hash code is computed is up to the caller, as long as any two
3805 callers that could hash identical-looking type nodes agree. */
3807 extern tree
type_hash_canon (unsigned int, tree
);
3809 extern tree
convert (tree
, tree
);
3810 extern unsigned int expr_align (const_tree
);
3811 extern tree
size_in_bytes (const_tree
);
3812 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
3813 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
3814 extern tree
bit_position (const_tree
);
3815 extern HOST_WIDE_INT
int_bit_position (const_tree
);
3816 extern tree
byte_position (const_tree
);
3817 extern HOST_WIDE_INT
int_byte_position (const_tree
);
3819 #define sizetype sizetype_tab[(int) stk_sizetype]
3820 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
3821 #define ssizetype sizetype_tab[(int) stk_ssizetype]
3822 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
3823 #define size_int(L) size_int_kind (L, stk_sizetype)
3824 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
3825 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
3826 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
3828 /* Type for sizes of data-type. */
3830 #define BITS_PER_UNIT_LOG \
3831 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3832 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3833 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3835 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3836 by making the last node in X point to Y.
3837 Returns X, except if X is 0 returns Y. */
3839 extern tree
chainon (tree
, tree
);
3841 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3843 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
3844 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3846 /* Return the last tree node in a chain. */
3848 extern tree
tree_last (tree
);
3850 /* Reverse the order of elements in a chain, and return the new head. */
3852 extern tree
nreverse (tree
);
3854 /* Returns the length of a chain of nodes
3855 (number of chain pointers to follow before reaching a null pointer). */
3857 extern int list_length (const_tree
);
3859 /* Returns the first FIELD_DECL in a type. */
3861 extern tree
first_field (const_tree
);
3863 /* Given an initializer INIT, return TRUE if INIT is zero or some
3864 aggregate of zeros. Otherwise return FALSE. */
3866 extern bool initializer_zerop (const_tree
);
3868 /* Given a vector VEC, return its first element if all elements are
3869 the same. Otherwise return NULL_TREE. */
3871 extern tree
uniform_vector_p (const_tree
);
3873 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
3875 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
3877 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3879 extern int integer_zerop (const_tree
);
3881 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3883 extern int integer_onep (const_tree
);
3885 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3886 all of whose significant bits are 1. */
3888 extern int integer_all_onesp (const_tree
);
3890 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
3893 extern int integer_minus_onep (const_tree
);
3895 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3896 exactly one bit 1. */
3898 extern int integer_pow2p (const_tree
);
3900 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3901 with a nonzero value. */
3903 extern int integer_nonzerop (const_tree
);
3905 extern bool cst_and_fits_in_hwi (const_tree
);
3906 extern tree
num_ending_zeros (const_tree
);
3908 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
3911 extern int fixed_zerop (const_tree
);
3913 /* staticp (tree x) is nonzero if X is a reference to data allocated
3914 at a fixed address in memory. Returns the outermost data. */
3916 extern tree
staticp (tree
);
3918 /* save_expr (EXP) returns an expression equivalent to EXP
3919 but it can be used multiple times within context CTX
3920 and only evaluate EXP once. */
3922 extern tree
save_expr (tree
);
3924 /* Look inside EXPR into any simple arithmetic operations. Return the
3925 outermost non-arithmetic or non-invariant node. */
3927 extern tree
skip_simple_arithmetic (tree
);
3929 /* Look inside EXPR into simple arithmetic operations involving constants.
3930 Return the outermost non-arithmetic or non-constant node. */
3932 extern tree
skip_simple_constant_arithmetic (tree
);
3934 /* Return which tree structure is used by T. */
3936 enum tree_node_structure_enum
tree_node_structure (const_tree
);
3938 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3939 size or offset that depends on a field within a record. */
3941 extern bool contains_placeholder_p (const_tree
);
3943 /* This macro calls the above function but short-circuits the common
3944 case of a constant to save time. Also check for null. */
3946 #define CONTAINS_PLACEHOLDER_P(EXP) \
3947 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3949 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3950 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3953 extern bool type_contains_placeholder_p (tree
);
3955 /* Given a tree EXP, find all occurrences of references to fields
3956 in a PLACEHOLDER_EXPR and place them in vector REFS without
3957 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3958 we assume here that EXP contains only arithmetic expressions
3959 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3962 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
3964 /* This macro calls the above function but short-circuits the common
3965 case of a constant to save time and also checks for NULL. */
3967 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
3969 if((EXP) && !TREE_CONSTANT (EXP)) \
3970 find_placeholder_in_expr (EXP, V); \
3973 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3974 return a tree with all occurrences of references to F in a
3975 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3976 CONST_DECLs. Note that we assume here that EXP contains only
3977 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3978 occurring only in their argument list. */
3980 extern tree
substitute_in_expr (tree
, tree
, tree
);
3982 /* This macro calls the above function but short-circuits the common
3983 case of a constant to save time and also checks for NULL. */
3985 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3986 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3988 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3989 for it within OBJ, a tree that is an object or a chain of references. */
3991 extern tree
substitute_placeholder_in_expr (tree
, tree
);
3993 /* This macro calls the above function but short-circuits the common
3994 case of a constant to save time and also checks for NULL. */
3996 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3997 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3998 : substitute_placeholder_in_expr (EXP, OBJ))
4001 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4002 but it can be used multiple times
4003 and only evaluate the subexpressions once. */
4005 extern tree
stabilize_reference (tree
);
4007 /* Return EXP, stripped of any conversions to wider types
4008 in such a way that the result of converting to type FOR_TYPE
4009 is the same as if EXP were converted to FOR_TYPE.
4010 If FOR_TYPE is 0, it signifies EXP's type. */
4012 extern tree
get_unwidened (tree
, tree
);
4014 /* Return OP or a simpler expression for a narrower value
4015 which can be sign-extended or zero-extended to give back OP.
4016 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4017 or 0 if the value should be sign-extended. */
4019 extern tree
get_narrower (tree
, int *);
4021 /* Return true if T is an expression that get_inner_reference handles. */
4024 handled_component_p (const_tree t
)
4026 switch (TREE_CODE (t
))
4031 case ARRAY_RANGE_REF
:
4034 case VIEW_CONVERT_EXPR
:
4042 /* Given a DECL or TYPE, return the scope in which it was declared, or
4043 NUL_TREE if there is no containing scope. */
4045 extern tree
get_containing_scope (const_tree
);
4047 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4049 extern tree
decl_function_context (const_tree
);
4051 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4052 this _DECL with its context, or zero if none. */
4053 extern tree
decl_type_context (const_tree
);
4055 /* Return 1 if EXPR is the real constant zero. */
4056 extern int real_zerop (const_tree
);
4058 /* Initialize the iterator I with arguments from function FNDECL */
4061 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4063 i
->next
= TYPE_ARG_TYPES (fntype
);
4066 /* Return a pointer that holds the next argument if there are more arguments to
4067 handle, otherwise return NULL. */
4069 static inline tree
*
4070 function_args_iter_cond_ptr (function_args_iterator
*i
)
4072 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4075 /* Return the next argument if there are more arguments to handle, otherwise
4079 function_args_iter_cond (function_args_iterator
*i
)
4081 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4084 /* Advance to the next argument. */
4086 function_args_iter_next (function_args_iterator
*i
)
4088 gcc_assert (i
->next
!= NULL_TREE
);
4089 i
->next
= TREE_CHAIN (i
->next
);
4092 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4095 inlined_function_outer_scope_p (const_tree block
)
4097 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4100 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4101 to point to the next tree element. ITER is an instance of
4102 function_args_iterator used to iterate the arguments. */
4103 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4104 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4105 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4106 function_args_iter_next (&(ITER)))
4108 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4109 to the next tree element. ITER is an instance of function_args_iterator
4110 used to iterate the arguments. */
4111 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4112 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4113 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4114 function_args_iter_next (&(ITER)))
4117 extern unsigned crc32_string (unsigned, const char *);
4118 extern unsigned crc32_byte (unsigned, char);
4119 extern unsigned crc32_unsigned (unsigned, unsigned);
4120 extern void clean_symbol_name (char *);
4121 extern tree
get_file_function_name (const char *);
4122 extern tree
get_callee_fndecl (const_tree
);
4123 extern int type_num_arguments (const_tree
);
4124 extern bool associative_tree_code (enum tree_code
);
4125 extern bool commutative_tree_code (enum tree_code
);
4126 extern bool commutative_ternary_tree_code (enum tree_code
);
4127 extern tree
upper_bound_in_type (tree
, tree
);
4128 extern tree
lower_bound_in_type (tree
, tree
);
4129 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4130 extern tree
create_artificial_label (location_t
);
4131 extern const char *get_name (tree
);
4132 extern bool stdarg_p (const_tree
);
4133 extern bool prototype_p (tree
);
4134 extern bool is_typedef_decl (tree x
);
4135 extern bool typedef_variant_p (tree
);
4136 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4137 extern tree
build_low_bits_mask (tree
, unsigned);
4138 extern tree
tree_strip_nop_conversions (tree
);
4139 extern tree
tree_strip_sign_nop_conversions (tree
);
4140 extern const_tree
strip_invariant_refs (const_tree
);
4141 extern tree
lhd_gcc_personality (void);
4142 extern void assign_assembler_name_if_neeeded (tree
);
4143 extern void warn_deprecated_use (tree
, tree
);
4144 extern void cache_integer_cst (tree
);
4146 /* Compare and hash for any structure which begins with a canonical
4147 pointer. Assumes all pointers are interchangeable, which is sort
4148 of already assumed by gcc elsewhere IIRC. */
4151 struct_ptr_eq (const void *a
, const void *b
)
4153 const void * const * x
= (const void * const *) a
;
4154 const void * const * y
= (const void * const *) b
;
4158 static inline hashval_t
4159 struct_ptr_hash (const void *a
)
4161 const void * const * x
= (const void * const *) a
;
4162 return (intptr_t)*x
>> 4;
4165 /* Return nonzero if CODE is a tree code that represents a truth value. */
4167 truth_value_p (enum tree_code code
)
4169 return (TREE_CODE_CLASS (code
) == tcc_comparison
4170 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4171 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4172 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4175 /* Return whether TYPE is a type suitable for an offset for
4176 a POINTER_PLUS_EXPR. */
4178 ptrofftype_p (tree type
)
4180 return (INTEGRAL_TYPE_P (type
)
4181 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4182 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4185 /* Return OFF converted to a pointer offset type suitable as offset for
4186 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4188 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4190 return fold_convert_loc (loc
, sizetype
, off
);
4192 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4194 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4196 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4198 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4199 ptr
, fold_convert_loc (loc
, sizetype
, off
));
4201 #define fold_build_pointer_plus(p,o) \
4202 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4204 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4206 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4208 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4209 ptr
, size_int (off
));
4211 #define fold_build_pointer_plus_hwi(p,o) \
4212 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4214 extern tree
strip_float_extensions (tree
);
4215 extern int really_constant_p (const_tree
);
4216 extern bool decl_address_invariant_p (const_tree
);
4217 extern bool decl_address_ip_invariant_p (const_tree
);
4218 extern bool int_fits_type_p (const_tree
, const_tree
);
4219 #ifndef GENERATOR_FILE
4220 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4222 extern bool variably_modified_type_p (tree
, tree
);
4223 extern int tree_log2 (const_tree
);
4224 extern int tree_floor_log2 (const_tree
);
4225 extern unsigned int tree_ctz (const_tree
);
4226 extern int simple_cst_equal (const_tree
, const_tree
);
4227 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4228 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4229 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4230 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4231 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4232 extern int type_list_equal (const_tree
, const_tree
);
4233 extern int chain_member (const_tree
, const_tree
);
4234 extern void dump_tree_statistics (void);
4235 extern void recompute_tree_invariant_for_addr_expr (tree
);
4236 extern bool needs_to_live_in_memory (const_tree
);
4237 extern tree
reconstruct_complex_type (tree
, tree
);
4238 extern int real_onep (const_tree
);
4239 extern int real_minus_onep (const_tree
);
4240 extern void init_ttree (void);
4241 extern void build_common_tree_nodes (bool, bool);
4242 extern void build_common_builtin_nodes (void);
4243 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4244 extern tree
build_range_type (tree
, tree
, tree
);
4245 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4246 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4247 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4248 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4249 extern tree
tree_block (tree
);
4250 extern void tree_set_block (tree
, tree
);
4251 extern location_t
*block_nonartificial_location (tree
);
4252 extern location_t
tree_nonartificial_location (tree
);
4253 extern tree
block_ultimate_origin (const_tree
);
4254 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4255 extern bool virtual_method_call_p (tree
);
4256 extern tree
obj_type_ref_class (tree ref
);
4257 extern bool types_same_for_odr (tree type1
, tree type2
);
4258 extern bool contains_bitfld_component_ref_p (const_tree
);
4259 extern bool type_in_anonymous_namespace_p (tree
);
4260 extern bool block_may_fallthru (const_tree
);
4261 extern void using_eh_for_cleanups (void);
4262 extern bool using_eh_for_cleanups_p (void);
4263 extern const char *get_tree_code_name (enum tree_code
);
4264 extern void set_call_expr_flags (tree
, int);
4265 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
4267 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4269 #define walk_tree(a,b,c,d) \
4270 walk_tree_1 (a, b, c, d, NULL)
4271 #define walk_tree_without_duplicates(a,b,c) \
4272 walk_tree_without_duplicates_1 (a, b, c, NULL)
4274 extern tree
get_base_address (tree t
);
4275 extern tree
drop_tree_overflow (tree
);
4276 extern int tree_map_base_eq (const void *, const void *);
4277 extern unsigned int tree_map_base_hash (const void *);
4278 extern int tree_map_base_marked_p (const void *);
4280 #define tree_map_eq tree_map_base_eq
4281 extern unsigned int tree_map_hash (const void *);
4282 #define tree_map_marked_p tree_map_base_marked_p
4284 #define tree_decl_map_eq tree_map_base_eq
4285 extern unsigned int tree_decl_map_hash (const void *);
4286 #define tree_decl_map_marked_p tree_map_base_marked_p
4288 #define tree_int_map_eq tree_map_base_eq
4289 #define tree_int_map_hash tree_map_base_hash
4290 #define tree_int_map_marked_p tree_map_base_marked_p
4292 #define tree_priority_map_eq tree_map_base_eq
4293 #define tree_priority_map_hash tree_map_base_hash
4294 #define tree_priority_map_marked_p tree_map_base_marked_p
4296 #define tree_vec_map_eq tree_map_base_eq
4297 #define tree_vec_map_hash tree_decl_map_hash
4298 #define tree_vec_map_marked_p tree_map_base_marked_p
4300 /* Initialize the abstract argument list iterator object ITER with the
4301 arguments from CALL_EXPR node EXP. */
4303 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4306 iter
->n
= call_expr_nargs (exp
);
4311 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4314 iter
->n
= call_expr_nargs (exp
);
4318 /* Return the next argument from abstract argument list iterator object ITER,
4319 and advance its state. Return NULL_TREE if there are no more arguments. */
4321 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4324 if (iter
->i
>= iter
->n
)
4326 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4331 static inline const_tree
4332 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4335 if (iter
->i
>= iter
->n
)
4337 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4342 /* Initialize the abstract argument list iterator object ITER, then advance
4343 past and return the first argument. Useful in for expressions, e.g.
4344 for (arg = first_call_expr_arg (exp, &iter); arg;
4345 arg = next_call_expr_arg (&iter)) */
4347 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4349 init_call_expr_arg_iterator (exp
, iter
);
4350 return next_call_expr_arg (iter
);
4353 static inline const_tree
4354 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4356 init_const_call_expr_arg_iterator (exp
, iter
);
4357 return next_const_call_expr_arg (iter
);
4360 /* Test whether there are more arguments in abstract argument list iterator
4361 ITER, without changing its state. */
4363 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4365 return (iter
->i
< iter
->n
);
4368 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4369 (of type call_expr_arg_iterator) to hold the iteration state. */
4370 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4371 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4372 (arg) = next_call_expr_arg (&(iter)))
4374 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4375 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4376 (arg) = next_const_call_expr_arg (&(iter)))
4378 /* Return true if tree node T is a language-specific node. */
4380 is_lang_specific (tree t
)
4382 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
4385 /* Valid builtin number. */
4386 #define BUILTIN_VALID_P(FNCODE) \
4387 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4389 /* Return the tree node for an explicit standard builtin function or NULL. */
4391 builtin_decl_explicit (enum built_in_function fncode
)
4393 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4395 return builtin_info
.decl
[(size_t)fncode
];
4398 /* Return the tree node for an implicit builtin function or NULL. */
4400 builtin_decl_implicit (enum built_in_function fncode
)
4402 size_t uns_fncode
= (size_t)fncode
;
4403 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4405 if (!builtin_info
.implicit_p
[uns_fncode
])
4408 return builtin_info
.decl
[uns_fncode
];
4411 /* Set explicit builtin function nodes and whether it is an implicit
4415 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
4417 size_t ufncode
= (size_t)fncode
;
4419 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4420 && (decl
!= NULL_TREE
|| !implicit_p
));
4422 builtin_info
.decl
[ufncode
] = decl
;
4423 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
4426 /* Set the implicit flag for a builtin function. */
4429 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
4431 size_t uns_fncode
= (size_t)fncode
;
4433 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
4434 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
4436 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
4439 /* Return whether the standard builtin function can be used as an explicit
4443 builtin_decl_explicit_p (enum built_in_function fncode
)
4445 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4446 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
4449 /* Return whether the standard builtin function can be used implicitly. */
4452 builtin_decl_implicit_p (enum built_in_function fncode
)
4454 size_t uns_fncode
= (size_t)fncode
;
4456 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
4457 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
4458 && builtin_info
.implicit_p
[uns_fncode
]);
4461 /* Return true if T (assumed to be a DECL) is a global variable.
4462 A variable is considered global if its storage is not automatic. */
4465 is_global_var (const_tree t
)
4467 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
4470 /* Return true if VAR may be aliased. A variable is considered as
4471 maybe aliased if it has its address taken by the local TU
4472 or possibly by another TU and might be modified through a pointer. */
4475 may_be_aliased (const_tree var
)
4477 return (TREE_CODE (var
) != CONST_DECL
4478 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
4479 && TREE_READONLY (var
)
4480 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
4481 && (TREE_PUBLIC (var
)
4482 || DECL_EXTERNAL (var
)
4483 || TREE_ADDRESSABLE (var
)));
4486 /* For anonymous aggregate types, we need some sort of name to
4487 hold on to. In practice, this should not appear, but it should
4488 not be harmful if it does. */
4489 #ifndef NO_DOT_IN_LABEL
4490 #define ANON_AGGRNAME_FORMAT "._%d"
4491 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
4492 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4493 #else /* NO_DOT_IN_LABEL */
4494 #ifndef NO_DOLLAR_IN_LABEL
4495 #define ANON_AGGRNAME_FORMAT "$_%d"
4496 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
4497 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4498 #else /* NO_DOLLAR_IN_LABEL */
4499 #define ANON_AGGRNAME_PREFIX "__anon_"
4500 #define ANON_AGGRNAME_P(ID_NODE) \
4501 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
4502 sizeof (ANON_AGGRNAME_PREFIX) - 1))
4503 #define ANON_AGGRNAME_FORMAT "__anon_%d"
4504 #endif /* NO_DOLLAR_IN_LABEL */
4505 #endif /* NO_DOT_IN_LABEL */
4507 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
4508 but none of these files are allowed to be included from front ends.
4509 They should be split in two. One suitable for the FEs, the other suitable
4512 /* Assign the RTX to declaration. */
4513 extern void set_decl_rtl (tree
, rtx
);
4514 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4516 /* Return a tree representing the upper bound of the array mentioned in
4517 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4518 extern tree
array_ref_up_bound (tree
);
4520 extern tree
build_personality_function (const char *);
4522 /* Given an expression EXP that is a handled_component_p,
4523 look for the ultimate containing object, which is returned and specify
4524 the access position and size. */
4525 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4526 tree
*, enum machine_mode
*, int *, int *,
4529 /* Return a tree representing the lower bound of the array mentioned in
4530 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4531 extern tree
array_ref_low_bound (tree
);
4533 /* In builtins.c. */
4535 /* Non-zero if __builtin_constant_p should be folded right away. */
4536 extern bool force_folding_builtin_constant_p
;
4538 extern bool avoid_folding_inline_builtin (tree
);
4539 extern tree
fold_call_expr (location_t
, tree
, bool);
4540 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
4541 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
4542 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
4543 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
4544 enum built_in_function
);
4545 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4546 enum built_in_function
);
4547 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4548 enum built_in_function
);
4549 extern bool fold_builtin_next_arg (tree
, bool);
4550 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4551 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
4552 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4553 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4554 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4555 extern tree
build_call_expr (tree
, int, ...);
4556 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4557 extern tree
c_strlen (tree
, int);
4558 extern tree
build_string_literal (int, const char *);
4559 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4560 extern bool is_builtin_fn (tree
);
4561 extern bool get_object_alignment_1 (tree
, unsigned int *,
4562 unsigned HOST_WIDE_INT
*);
4563 extern unsigned int get_object_alignment (tree
);
4564 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
4565 unsigned HOST_WIDE_INT
*);
4566 extern unsigned int get_pointer_alignment (tree
);
4567 extern tree
fold_call_stmt (gimple
, bool);
4568 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4569 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
4570 extern bool is_simple_builtin (tree
);
4571 extern bool is_inexpensive_builtin (tree
);
4573 #endif /* GCC_TREE_H */