1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2016 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 /* Convert a target-independent built-in function code to a combined_fn. */
28 as_combined_fn (built_in_function fn
)
30 return combined_fn (int (fn
));
33 /* Convert an internal function code to a combined_fn. */
36 as_combined_fn (internal_fn fn
)
38 return combined_fn (int (fn
) + int (END_BUILTINS
));
41 /* Return true if CODE is a target-independent built-in function. */
44 builtin_fn_p (combined_fn code
)
46 return int (code
) < int (END_BUILTINS
);
49 /* Return the target-independent built-in function represented by CODE.
50 Only valid if builtin_fn_p (CODE). */
52 inline built_in_function
53 as_builtin_fn (combined_fn code
)
55 gcc_checking_assert (builtin_fn_p (code
));
56 return built_in_function (int (code
));
59 /* Return true if CODE is an internal function. */
62 internal_fn_p (combined_fn code
)
64 return int (code
) >= int (END_BUILTINS
);
67 /* Return the internal function represented by CODE. Only valid if
68 internal_fn_p (CODE). */
71 as_internal_fn (combined_fn code
)
73 gcc_checking_assert (internal_fn_p (code
));
74 return internal_fn (int (code
) - int (END_BUILTINS
));
77 /* Macros for initializing `tree_contains_struct'. */
78 #define MARK_TS_BASE(C) \
80 tree_contains_struct[C][TS_BASE] = 1; \
83 #define MARK_TS_TYPED(C) \
86 tree_contains_struct[C][TS_TYPED] = 1; \
89 #define MARK_TS_COMMON(C) \
92 tree_contains_struct[C][TS_COMMON] = 1; \
95 #define MARK_TS_TYPE_COMMON(C) \
98 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
101 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
103 MARK_TS_TYPE_COMMON (C); \
104 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
107 #define MARK_TS_DECL_MINIMAL(C) \
109 MARK_TS_COMMON (C); \
110 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
113 #define MARK_TS_DECL_COMMON(C) \
115 MARK_TS_DECL_MINIMAL (C); \
116 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
119 #define MARK_TS_DECL_WRTL(C) \
121 MARK_TS_DECL_COMMON (C); \
122 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
125 #define MARK_TS_DECL_WITH_VIS(C) \
127 MARK_TS_DECL_WRTL (C); \
128 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
131 #define MARK_TS_DECL_NON_COMMON(C) \
133 MARK_TS_DECL_WITH_VIS (C); \
134 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
138 /* Returns the string representing CLASS. */
140 #define TREE_CODE_CLASS_STRING(CLASS)\
141 tree_code_class_strings[(int) (CLASS)]
143 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
145 /* Nonzero if NODE represents an exceptional code. */
147 #define EXCEPTIONAL_CLASS_P(NODE)\
148 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
150 /* Nonzero if NODE represents a constant. */
152 #define CONSTANT_CLASS_P(NODE)\
153 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
155 /* Nonzero if NODE represents a type. */
157 #define TYPE_P(NODE)\
158 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
160 /* Nonzero if NODE represents a declaration. */
162 #define DECL_P(NODE)\
163 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
165 /* True if NODE designates a variable declaration. */
166 #define VAR_P(NODE) \
167 (TREE_CODE (NODE) == VAR_DECL)
169 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
171 #define VAR_OR_FUNCTION_DECL_P(DECL)\
172 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
174 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
175 ascending code order. */
177 #define INDIRECT_REF_P(NODE)\
178 (TREE_CODE (NODE) == INDIRECT_REF)
180 /* Nonzero if NODE represents a reference. */
182 #define REFERENCE_CLASS_P(NODE)\
183 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
185 /* Nonzero if NODE represents a comparison. */
187 #define COMPARISON_CLASS_P(NODE)\
188 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
190 /* Nonzero if NODE represents a unary arithmetic expression. */
192 #define UNARY_CLASS_P(NODE)\
193 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
195 /* Nonzero if NODE represents a binary arithmetic expression. */
197 #define BINARY_CLASS_P(NODE)\
198 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
200 /* Nonzero if NODE represents a statement expression. */
202 #define STATEMENT_CLASS_P(NODE)\
203 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
205 /* Nonzero if NODE represents a function call-like expression with a
206 variable-length operand vector. */
208 #define VL_EXP_CLASS_P(NODE)\
209 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
211 /* Nonzero if NODE represents any other expression. */
213 #define EXPRESSION_CLASS_P(NODE)\
214 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
216 /* Returns nonzero iff NODE represents a type or declaration. */
218 #define IS_TYPE_OR_DECL_P(NODE)\
219 (TYPE_P (NODE) || DECL_P (NODE))
221 /* Returns nonzero iff CLASS is the tree-code class of an
224 #define IS_EXPR_CODE_CLASS(CLASS)\
225 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
227 /* Returns nonzero iff NODE is an expression of some kind. */
229 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
231 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
234 /* Helper macros for math builtins. */
236 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
237 #define CASE_FLT_FN_FLOATN_NX(FN) \
238 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
239 case FN##F32X: case FN##F64X: case FN##F128X
240 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
241 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
243 #define NULL_TREE (tree) NULL
245 /* Define accessors for the fields that all tree nodes have
246 (though some fields are not used for all kinds of nodes). */
248 /* The tree-code says what kind of node it is.
249 Codes are defined in tree.def. */
250 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
251 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
253 /* When checking is enabled, errors will be generated if a tree node
254 is accessed incorrectly. The macros die with a fatal error. */
255 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
257 #define TREE_CHECK(T, CODE) \
258 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
260 #define TREE_NOT_CHECK(T, CODE) \
261 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
263 #define TREE_CHECK2(T, CODE1, CODE2) \
264 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
266 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
267 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
269 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
270 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
272 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
273 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
274 (CODE1), (CODE2), (CODE3)))
276 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
277 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
278 (CODE1), (CODE2), (CODE3), (CODE4)))
280 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
281 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
282 (CODE1), (CODE2), (CODE3), (CODE4)))
284 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
285 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
286 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
288 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
289 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
290 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
292 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
293 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
295 #define TREE_CLASS_CHECK(T, CLASS) \
296 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
298 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
299 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
301 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
302 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
304 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
305 (omp_clause_range_check ((T), (CODE1), (CODE2), \
306 __FILE__, __LINE__, __FUNCTION__))
308 /* These checks have to be special cased. */
309 #define EXPR_CHECK(T) \
310 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
312 /* These checks have to be special cased. */
313 #define NON_TYPE_CHECK(T) \
314 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
316 /* These checks have to be special cased. */
317 #define ANY_INTEGRAL_TYPE_CHECK(T) \
318 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
320 #define TREE_INT_CST_ELT_CHECK(T, I) \
321 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
323 #define TREE_VEC_ELT_CHECK(T, I) \
324 (*(CONST_CAST2 (tree *, typeof (T)*, \
325 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
327 #define OMP_CLAUSE_ELT_CHECK(T, I) \
328 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
330 /* Special checks for TREE_OPERANDs. */
331 #define TREE_OPERAND_CHECK(T, I) \
332 (*(CONST_CAST2 (tree*, typeof (T)*, \
333 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
335 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
336 (*(tree_operand_check_code ((T), (CODE), (I), \
337 __FILE__, __LINE__, __FUNCTION__)))
339 /* Nodes are chained together for many purposes.
340 Types are chained together to record them for being output to the debugger
341 (see the function `chain_type').
342 Decls in the same scope are chained together to record the contents
344 Statement nodes for successive statements used to be chained together.
345 Often lists of things are represented by TREE_LIST nodes that
346 are chained together. */
348 #define TREE_CHAIN(NODE) \
349 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
351 /* In all nodes that are expressions, this is the data type of the expression.
352 In POINTER_TYPE nodes, this is the type that the pointer points to.
353 In ARRAY_TYPE nodes, this is the type of the elements.
354 In VECTOR_TYPE nodes, this is the type of the elements. */
355 #define TREE_TYPE(NODE) \
356 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
358 extern void tree_contains_struct_check_failed (const_tree
,
359 const enum tree_node_structure_enum
,
360 const char *, int, const char *)
363 extern void tree_check_failed (const_tree
, const char *, int, const char *,
364 ...) ATTRIBUTE_NORETURN
;
365 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
366 ...) ATTRIBUTE_NORETURN
;
367 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
368 const char *, int, const char *)
370 extern void tree_range_check_failed (const_tree
, const char *, int,
371 const char *, enum tree_code
,
374 extern void tree_not_class_check_failed (const_tree
,
375 const enum tree_code_class
,
376 const char *, int, const char *)
378 extern void tree_int_cst_elt_check_failed (int, int, const char *,
381 extern void tree_vec_elt_check_failed (int, int, const char *,
384 extern void phi_node_elt_check_failed (int, int, const char *,
387 extern void tree_operand_check_failed (int, const_tree
,
388 const char *, int, const char *)
390 extern void omp_clause_check_failed (const_tree
, const char *, int,
391 const char *, enum omp_clause_code
)
393 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
396 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
397 const char *, enum omp_clause_code
,
398 enum omp_clause_code
)
401 #else /* not ENABLE_TREE_CHECKING, or not gcc */
403 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
404 #define TREE_CHECK(T, CODE) (T)
405 #define TREE_NOT_CHECK(T, CODE) (T)
406 #define TREE_CHECK2(T, CODE1, CODE2) (T)
407 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
408 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
409 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
410 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
411 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
412 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
413 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
414 #define TREE_CLASS_CHECK(T, CODE) (T)
415 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
416 #define EXPR_CHECK(T) (T)
417 #define NON_TYPE_CHECK(T) (T)
418 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
419 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
420 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
421 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
422 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
423 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
424 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
425 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
427 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
428 #define TREE_TYPE(NODE) ((NODE)->typed.type)
432 #define TREE_BLOCK(NODE) (tree_block (NODE))
433 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
435 #include "tree-check.h"
437 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
438 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
439 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
440 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
441 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
442 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
443 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
444 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
445 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
446 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
447 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
449 #define RECORD_OR_UNION_CHECK(T) \
450 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
451 #define NOT_RECORD_OR_UNION_CHECK(T) \
452 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
454 #define NUMERICAL_TYPE_CHECK(T) \
455 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
458 /* Here is how primitive or already-canonicalized types' hash codes
460 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
462 /* A simple hash function for an arbitrary tree node. This must not be
463 used in hash tables which are saved to a PCH. */
464 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
466 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
467 #define CONVERT_EXPR_CODE_P(CODE) \
468 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
470 /* Similarly, but accept an expression instead of a tree code. */
471 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
473 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
475 #define CASE_CONVERT \
479 /* Given an expression as a tree, strip any conversion that generates
480 no instruction. Accepts both tree and const_tree arguments since
481 we are not modifying the tree itself. */
483 #define STRIP_NOPS(EXP) \
484 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
486 /* Like STRIP_NOPS, but don't let the signedness change either. */
488 #define STRIP_SIGN_NOPS(EXP) \
489 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
491 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
493 #define STRIP_TYPE_NOPS(EXP) \
494 while ((CONVERT_EXPR_P (EXP) \
495 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
496 && TREE_OPERAND (EXP, 0) != error_mark_node \
497 && (TREE_TYPE (EXP) \
498 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
499 (EXP) = TREE_OPERAND (EXP, 0)
501 /* Remove unnecessary type conversions according to
502 tree_ssa_useless_type_conversion. */
504 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
505 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
507 /* Nonzero if TYPE represents a vector type. */
509 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
511 /* Nonzero if TYPE represents a vector of booleans. */
513 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
514 (TREE_CODE (TYPE) == VECTOR_TYPE \
515 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
517 /* Nonzero if TYPE represents an integral type. Note that we do not
518 include COMPLEX types here. Keep these checks in ascending code
521 #define INTEGRAL_TYPE_P(TYPE) \
522 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
523 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
524 || TREE_CODE (TYPE) == INTEGER_TYPE)
526 /* Nonzero if TYPE represents an integral type, including complex
527 and vector integer types. */
529 #define ANY_INTEGRAL_TYPE_P(TYPE) \
530 (INTEGRAL_TYPE_P (TYPE) \
531 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
532 || VECTOR_TYPE_P (TYPE)) \
533 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
535 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
537 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
538 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
540 /* Nonzero if TYPE represents a saturating fixed-point type. */
542 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
543 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
545 /* Nonzero if TYPE represents a fixed-point type. */
547 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
549 /* Nonzero if TYPE represents a scalar floating-point type. */
551 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
553 /* Nonzero if TYPE represents a complex floating-point type. */
555 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
556 (TREE_CODE (TYPE) == COMPLEX_TYPE \
557 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
559 /* Nonzero if TYPE represents a vector integer type. */
561 #define VECTOR_INTEGER_TYPE_P(TYPE) \
562 (VECTOR_TYPE_P (TYPE) \
563 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
566 /* Nonzero if TYPE represents a vector floating-point type. */
568 #define VECTOR_FLOAT_TYPE_P(TYPE) \
569 (VECTOR_TYPE_P (TYPE) \
570 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
572 /* Nonzero if TYPE represents a floating-point type, including complex
573 and vector floating-point types. The vector and complex check does
574 not use the previous two macros to enable early folding. */
576 #define FLOAT_TYPE_P(TYPE) \
577 (SCALAR_FLOAT_TYPE_P (TYPE) \
578 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
579 || VECTOR_TYPE_P (TYPE)) \
580 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
582 /* Nonzero if TYPE represents a decimal floating-point type. */
583 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
584 (SCALAR_FLOAT_TYPE_P (TYPE) \
585 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
587 /* Nonzero if TYPE is a record or union type. */
588 #define RECORD_OR_UNION_TYPE_P(TYPE) \
589 (TREE_CODE (TYPE) == RECORD_TYPE \
590 || TREE_CODE (TYPE) == UNION_TYPE \
591 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
593 /* Nonzero if TYPE represents an aggregate (multi-component) type.
594 Keep these checks in ascending code order. */
596 #define AGGREGATE_TYPE_P(TYPE) \
597 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
599 /* Nonzero if TYPE represents a pointer or reference type.
600 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
601 ascending code order. */
603 #define POINTER_TYPE_P(TYPE) \
604 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
606 /* Nonzero if TYPE represents a pointer to function. */
607 #define FUNCTION_POINTER_TYPE_P(TYPE) \
608 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
610 /* Nonzero if this type is a complete type. */
611 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
613 /* Nonzero if this type is a pointer bounds type. */
614 #define POINTER_BOUNDS_TYPE_P(NODE) \
615 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
617 /* Nonzero if this node has a pointer bounds type. */
618 #define POINTER_BOUNDS_P(NODE) \
619 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
621 /* Nonzero if this type supposes bounds existence. */
622 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
624 /* Nonzero for objects with bounded type. */
625 #define BOUNDED_P(node) \
626 BOUNDED_TYPE_P (TREE_TYPE (node))
628 /* Nonzero if this type is the (possibly qualified) void type. */
629 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
631 /* Nonzero if this type is complete or is cv void. */
632 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
633 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
635 /* Nonzero if this type is complete or is an array with unspecified bound. */
636 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
637 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
639 #define FUNC_OR_METHOD_TYPE_P(NODE) \
640 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
642 /* Define many boolean fields that all tree nodes have. */
644 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
645 of this is needed. So it cannot be in a register.
646 In a FUNCTION_DECL it has no meaning.
647 In LABEL_DECL nodes, it means a goto for this label has been seen
648 from a place outside all binding contours that restore stack levels.
649 In an artificial SSA_NAME that points to a stack partition with at least
650 two variables, it means that at least one variable has TREE_ADDRESSABLE.
651 In ..._TYPE nodes, it means that objects of this type must be fully
652 addressable. This means that pieces of this object cannot go into
653 register parameters, for example. If this a function type, this
654 means that the value must be returned in memory.
655 In CONSTRUCTOR nodes, it means object constructed must be in memory.
656 In IDENTIFIER_NODEs, this means that some extern decl for this name
657 had its address taken. That matters for inline functions.
658 In a STMT_EXPR, it means we want the result of the enclosed expression. */
659 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
661 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
662 exit of a function. Calls for which this is true are candidates for tail
663 call optimizations. */
664 #define CALL_EXPR_TAILCALL(NODE) \
665 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
667 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
668 optimization for correctness. */
669 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
670 (CALL_EXPR_CHECK (NODE)->base.static_flag)
672 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
673 CASE_LOW operand has been processed. */
674 #define CASE_LOW_SEEN(NODE) \
675 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
677 #define PREDICT_EXPR_OUTCOME(NODE) \
678 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
679 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
680 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
681 #define PREDICT_EXPR_PREDICTOR(NODE) \
682 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
684 /* In a VAR_DECL, nonzero means allocate static storage.
685 In a FUNCTION_DECL, nonzero if function has been defined.
686 In a CONSTRUCTOR, nonzero means allocate static storage. */
687 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
689 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
690 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
692 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
693 should only be executed if an exception is thrown, not on normal exit
695 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
697 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
698 separate cleanup in honor_protect_cleanup_actions. */
699 #define TRY_CATCH_IS_CLEANUP(NODE) \
700 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
702 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
703 CASE_HIGH operand has been processed. */
704 #define CASE_HIGH_SEEN(NODE) \
705 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
707 /* Used to mark scoped enums. */
708 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
710 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
711 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
713 /* In an expr node (usually a conversion) this means the node was made
714 implicitly and should not lead to any sort of warning. In a decl node,
715 warnings concerning the decl should be suppressed. This is used at
716 least for used-before-set warnings, and it set after one warning is
718 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
720 /* Used to indicate that this TYPE represents a compiler-generated entity. */
721 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
723 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
724 this string as an argument. */
725 #define TREE_SYMBOL_REFERENCED(NODE) \
726 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
728 /* Nonzero in a pointer or reference type means the data pointed to
729 by this type can alias anything. */
730 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
731 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
733 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
734 there was an overflow in folding. */
736 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
738 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
740 #define TREE_OVERFLOW_P(EXPR) \
741 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
743 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
744 nonzero means name is to be accessible from outside this translation unit.
745 In an IDENTIFIER_NODE, nonzero means an external declaration
746 accessible from outside this translation unit was previously seen
747 for this name in an inner scope. */
748 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
750 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
751 of cached values, or is something else. */
752 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
754 /* In a SAVE_EXPR, indicates that the original expression has already
755 been substituted with a VAR_DECL that contains the value. */
756 #define SAVE_EXPR_RESOLVED_P(NODE) \
757 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
759 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
761 #define CALL_EXPR_VA_ARG_PACK(NODE) \
762 (CALL_EXPR_CHECK (NODE)->base.public_flag)
764 /* In any expression, decl, or constant, nonzero means it has side effects or
765 reevaluation of the whole expression could produce a different value.
766 This is set if any subexpression is a function call, a side effect or a
767 reference to a volatile variable. In a ..._DECL, this is set only if the
768 declaration said `volatile'. This will never be set for a constant. */
769 #define TREE_SIDE_EFFECTS(NODE) \
770 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
772 /* In a LABEL_DECL, nonzero means this label had its address taken
773 and therefore can never be deleted and is a jump target for
775 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
777 /* Whether a case or a user-defined label is allowed to fall through to.
778 This is used to implement -Wimplicit-fallthrough. */
779 #define FALLTHROUGH_LABEL_P(NODE) \
780 (LABEL_DECL_CHECK (NODE)->base.private_flag)
782 /* Nonzero means this expression is volatile in the C sense:
783 its address should be of type `volatile WHATEVER *'.
784 In other words, the declared item is volatile qualified.
785 This is used in _DECL nodes and _REF nodes.
786 On a FUNCTION_DECL node, this means the function does not
787 return normally. This is the same effect as setting
788 the attribute noreturn on the function in C.
790 In a ..._TYPE node, means this type is volatile-qualified.
791 But use TYPE_VOLATILE instead of this macro when the node is a type,
792 because eventually we may make that a different bit.
794 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
795 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
797 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
798 accessing the memory pointed to won't generate a trap. However,
799 this only applies to an object when used appropriately: it doesn't
800 mean that writing a READONLY mem won't trap.
802 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
803 (or slice of the array) always belongs to the range of the array.
804 I.e. that the access will not trap, provided that the access to
805 the base to the array will not trap. */
806 #define TREE_THIS_NOTRAP(NODE) \
807 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
808 ARRAY_RANGE_REF)->base.nothrow_flag)
810 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
811 nonzero means it may not be the lhs of an assignment.
812 Nonzero in a FUNCTION_DECL means this function should be treated
813 as "const" function (can only read its arguments). */
814 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
816 /* Value of expression is constant. Always on in all ..._CST nodes. May
817 also appear in an expression or decl where the value is constant. */
818 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
820 /* Nonzero if NODE, a type, has had its sizes gimplified. */
821 #define TYPE_SIZES_GIMPLIFIED(NODE) \
822 (TYPE_CHECK (NODE)->base.constant_flag)
824 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
825 #define DECL_UNSIGNED(NODE) \
826 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
828 /* In integral and pointer types, means an unsigned type. */
829 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
831 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
832 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
834 /* True if overflow wraps around for the given integral type. That
835 is, TYPE_MAX + 1 == TYPE_MIN. */
836 #define TYPE_OVERFLOW_WRAPS(TYPE) \
837 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
839 /* True if overflow is undefined for the given integral type. We may
840 optimize on the assumption that values in the type never overflow.
842 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
843 must issue a warning based on warn_strict_overflow. In some cases
844 it will be appropriate to issue the warning immediately, and in
845 other cases it will be appropriate to simply set a flag and let the
846 caller decide whether a warning is appropriate or not. */
847 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
848 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
849 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
851 /* True if overflow for the given integral type should issue a
853 #define TYPE_OVERFLOW_TRAPS(TYPE) \
854 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
856 /* True if an overflow is to be preserved for sanitization. */
857 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
858 (INTEGRAL_TYPE_P (TYPE) \
859 && !TYPE_OVERFLOW_WRAPS (TYPE) \
860 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
862 /* True if pointer types have undefined overflow. */
863 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
865 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
866 Nonzero in a FUNCTION_DECL means that the function has been compiled.
867 This is interesting in an inline function, since it might not need
868 to be compiled separately.
869 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
870 or TYPE_DECL if the debugging info for the type has been written.
871 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
872 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
874 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
876 /* Nonzero in a _DECL if the name is used in its scope.
877 Nonzero in an expr node means inhibit warning if value is unused.
878 In IDENTIFIER_NODEs, this means that some extern decl for this name
880 In a BLOCK, this means that the block contains variables that are used. */
881 #define TREE_USED(NODE) ((NODE)->base.used_flag)
883 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
884 throw an exception. In a CALL_EXPR, nonzero means the call cannot
885 throw. We can't easily check the node type here as the C++
886 frontend also uses this flag (for AGGR_INIT_EXPR). */
887 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
889 /* In a CALL_EXPR, means that it's safe to use the target of the call
890 expansion as the return slot for a call that returns in memory. */
891 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
892 (CALL_EXPR_CHECK (NODE)->base.private_flag)
894 /* Cilk keywords accessors. */
895 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
897 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
898 passed by invisible reference (and the TREE_TYPE is a pointer to the true
900 #define DECL_BY_REFERENCE(NODE) \
901 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
902 RESULT_DECL)->decl_common.decl_by_reference_flag)
904 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
906 #define DECL_READ_P(NODE) \
907 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
909 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
910 attempting to share the stack slot with some other variable. */
911 #define DECL_NONSHAREABLE(NODE) \
912 (TREE_CHECK2 (NODE, VAR_DECL, \
913 RESULT_DECL)->decl_common.decl_nonshareable_flag)
915 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
916 thunked-to function. */
917 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
919 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
920 it has been built for the declaration of a variable-sized object. */
921 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
922 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
924 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
925 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
927 /* Used in classes in C++. */
928 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
929 /* Used in classes in C++. */
930 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
932 /* True if reference type NODE is a C++ rvalue reference. */
933 #define TYPE_REF_IS_RVALUE(NODE) \
934 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
936 /* Nonzero in a _DECL if the use of the name is defined as a
937 deprecated feature by __attribute__((deprecated)). */
938 #define TREE_DEPRECATED(NODE) \
939 ((NODE)->base.deprecated_flag)
941 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
942 uses are to be substituted for uses of the TREE_CHAINed identifier. */
943 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
944 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
946 /* In an aggregate type, indicates that the scalar fields of the type are
947 stored in reverse order from the target order. This effectively
948 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
949 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
950 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
952 /* In a non-aggregate type, indicates a saturating type. */
953 #define TYPE_SATURATING(NODE) \
954 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
956 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
957 of bits stored in reverse order from the target order. This effectively
958 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
960 The overall strategy is to preserve the invariant that every scalar in
961 memory is associated with a single storage order, i.e. all accesses to
962 this scalar are done with the same storage order. This invariant makes
963 it possible to factor out the storage order in most transformations, as
964 only the address and/or the value (in target order) matter for them.
965 But, of course, the storage order must be preserved when the accesses
966 themselves are rewritten or transformed. */
967 #define REF_REVERSE_STORAGE_ORDER(NODE) \
968 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
970 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
971 represented by a descriptor instead of a trampoline. */
972 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
973 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
975 /* In a CALL_EXPR, indicates that this is an indirect call for which
976 pointers to nested function are descriptors instead of trampolines. */
977 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
978 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
980 /* These flags are available for each language front end to use internally. */
981 #define TREE_LANG_FLAG_0(NODE) \
982 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
983 #define TREE_LANG_FLAG_1(NODE) \
984 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
985 #define TREE_LANG_FLAG_2(NODE) \
986 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
987 #define TREE_LANG_FLAG_3(NODE) \
988 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
989 #define TREE_LANG_FLAG_4(NODE) \
990 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
991 #define TREE_LANG_FLAG_5(NODE) \
992 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
993 #define TREE_LANG_FLAG_6(NODE) \
994 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
996 /* Define additional fields and accessors for nodes representing constants. */
998 #define TREE_INT_CST_NUNITS(NODE) \
999 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1000 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1001 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1002 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1003 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1004 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1005 #define TREE_INT_CST_LOW(NODE) \
1006 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1008 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1009 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1011 #define TREE_FIXED_CST_PTR(NODE) \
1012 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1013 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1015 /* In a STRING_CST */
1016 /* In C terms, this is sizeof, not strlen. */
1017 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1018 #define TREE_STRING_POINTER(NODE) \
1019 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1021 /* In a COMPLEX_CST node. */
1022 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1023 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1025 /* In a VECTOR_CST node. */
1026 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1027 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1028 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1030 /* Define fields and accessors for some special-purpose tree nodes. */
1032 #define IDENTIFIER_LENGTH(NODE) \
1033 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1034 #define IDENTIFIER_POINTER(NODE) \
1035 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1036 #define IDENTIFIER_HASH_VALUE(NODE) \
1037 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1039 /* Translate a hash table identifier pointer to a tree_identifier
1040 pointer, and vice versa. */
1042 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1043 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1044 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1046 /* In a TREE_LIST node. */
1047 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1048 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1050 /* In a TREE_VEC node. */
1051 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1052 #define TREE_VEC_END(NODE) \
1053 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1055 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1057 /* In a CONSTRUCTOR node. */
1058 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1059 #define CONSTRUCTOR_ELT(NODE,IDX) \
1060 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1061 #define CONSTRUCTOR_NELTS(NODE) \
1062 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1063 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1064 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1066 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1067 value of each element (stored within VAL). IX must be a scratch variable
1068 of unsigned integer type. */
1069 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1070 for (IX = 0; (IX >= vec_safe_length (V)) \
1072 : ((VAL = (*(V))[IX].value), \
1076 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1077 the value of each element (stored within VAL) and its index (stored
1078 within INDEX). IX must be a scratch variable of unsigned integer type. */
1079 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1080 for (IX = 0; (IX >= vec_safe_length (V)) \
1082 : (((void) (VAL = (*V)[IX].value)), \
1083 (INDEX = (*V)[IX].index), \
1087 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1088 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1090 constructor_elt _ce___ = {INDEX, VALUE}; \
1091 vec_safe_push ((V), _ce___); \
1094 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1095 constructor output purposes. */
1096 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1097 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1099 /* True if NODE is a clobber right hand side, an expression of indeterminate
1100 value that clobbers the LHS in a copy instruction. We use a volatile
1101 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1102 In particular the volatile flag causes us to not prematurely remove
1103 such clobber instructions. */
1104 #define TREE_CLOBBER_P(NODE) \
1105 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1107 /* Define fields and accessors for some nodes that represent expressions. */
1109 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1110 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1111 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1112 && integer_zerop (TREE_OPERAND (NODE, 0)))
1114 /* In ordinary expression nodes. */
1115 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1116 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1118 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1119 length. Its value includes the length operand itself; that is,
1120 the minimum valid length is 1.
1121 Note that we have to bypass the use of TREE_OPERAND to access
1122 that field to avoid infinite recursion in expanding the macros. */
1123 #define VL_EXP_OPERAND_LENGTH(NODE) \
1124 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1126 /* Nonzero if is_gimple_debug() may possibly hold. */
1127 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1129 /* In a LOOP_EXPR node. */
1130 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1132 /* The source location of this expression. Non-tree_exp nodes such as
1133 decls and constants can be shared among multiple locations, so
1135 #define EXPR_LOCATION(NODE) \
1136 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1137 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1138 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1139 != UNKNOWN_LOCATION)
1140 /* The location to be used in a diagnostic about this expression. Do not
1141 use this macro if the location will be assigned to other expressions. */
1142 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1143 ? (NODE)->exp.locus : (LOCUS))
1144 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1145 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1147 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1148 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1150 #define EXPR_HAS_RANGE(NODE) \
1151 (CAN_HAVE_RANGE_P (NODE) \
1152 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1155 /* True if a tree is an expression or statement that can have a
1157 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1159 static inline source_range
1160 get_expr_source_range (tree expr
)
1162 location_t loc
= EXPR_LOCATION (expr
);
1163 return get_range_from_loc (line_table
, loc
);
1166 extern void protected_set_expr_location (tree
, location_t
);
1168 /* In a TARGET_EXPR node. */
1169 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1170 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1171 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1173 /* DECL_EXPR accessor. This gives access to the DECL associated with
1174 the given declaration statement. */
1175 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1177 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1179 /* COMPOUND_LITERAL_EXPR accessors. */
1180 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1181 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1182 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1183 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1185 /* SWITCH_EXPR accessors. These give access to the condition, body and
1186 original condition type (before any compiler conversions)
1187 of the switch statement, respectively. */
1188 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1189 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1190 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1192 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1193 of a case label, respectively. */
1194 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1195 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1196 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1197 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1199 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1200 corresponding MEM_REF operands. */
1201 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1202 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1203 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1204 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1205 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1207 #define MR_DEPENDENCE_CLIQUE(NODE) \
1208 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1209 #define MR_DEPENDENCE_BASE(NODE) \
1210 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1212 /* The operands of a BIND_EXPR. */
1213 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1214 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1215 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1217 /* GOTO_EXPR accessor. This gives access to the label associated with
1218 a goto statement. */
1219 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1221 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1222 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1223 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1225 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1226 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1227 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1228 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1229 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1230 /* Nonzero if we want to create an ASM_INPUT instead of an
1231 ASM_OPERAND with no operands. */
1232 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1233 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1235 /* COND_EXPR accessors. */
1236 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1237 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1238 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1240 /* Accessors for the chains of recurrences. */
1241 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1242 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1243 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1244 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1246 /* LABEL_EXPR accessor. This gives access to the label associated with
1247 the given label expression. */
1248 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1250 /* CATCH_EXPR accessors. */
1251 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1252 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1254 /* EH_FILTER_EXPR accessors. */
1255 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1256 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1258 /* OBJ_TYPE_REF accessors. */
1259 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1260 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1261 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1263 /* ASSERT_EXPR accessors. */
1264 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1265 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1267 /* CALL_EXPR accessors. */
1268 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1269 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1270 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1271 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1272 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1274 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1275 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1276 the argument count is zero when checking is enabled. Instead, do
1277 the pointer arithmetic to advance past the 3 fixed operands in a
1278 CALL_EXPR. That produces a valid pointer to just past the end of the
1279 operand array, even if it's not valid to dereference it. */
1280 #define CALL_EXPR_ARGP(NODE) \
1281 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1283 /* TM directives and accessors. */
1284 #define TRANSACTION_EXPR_BODY(NODE) \
1285 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1286 #define TRANSACTION_EXPR_OUTER(NODE) \
1287 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1288 #define TRANSACTION_EXPR_RELAXED(NODE) \
1289 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1291 /* OpenMP and OpenACC directive and clause accessors. */
1293 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1295 #define OMP_BODY(NODE) \
1296 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1297 #define OMP_CLAUSES(NODE) \
1298 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1300 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1301 #define OMP_STANDALONE_CLAUSES(NODE) \
1302 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1304 #define OACC_DATA_BODY(NODE) \
1305 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1306 #define OACC_DATA_CLAUSES(NODE) \
1307 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1309 #define OACC_HOST_DATA_BODY(NODE) \
1310 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1311 #define OACC_HOST_DATA_CLAUSES(NODE) \
1312 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1314 #define OACC_CACHE_CLAUSES(NODE) \
1315 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1317 #define OACC_DECLARE_CLAUSES(NODE) \
1318 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1320 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1321 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1323 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1324 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1326 #define OACC_UPDATE_CLAUSES(NODE) \
1327 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1329 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1330 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1332 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1333 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1335 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1336 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1337 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1339 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1340 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1341 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1342 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1343 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1344 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1345 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1346 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1348 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1349 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1351 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1353 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1354 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1356 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1358 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1360 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1361 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1363 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1364 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1365 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1367 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1368 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1370 #define OMP_TARGET_DATA_BODY(NODE) \
1371 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1372 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1373 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1375 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1376 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1378 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1379 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1381 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1382 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1384 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1385 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1387 #define OMP_CLAUSE_SIZE(NODE) \
1388 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1390 OMP_CLAUSE__CACHE_), 1)
1392 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1393 #define OMP_CLAUSE_DECL(NODE) \
1394 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1395 OMP_CLAUSE_PRIVATE, \
1396 OMP_CLAUSE__LOOPTEMP_), 0)
1397 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1398 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1399 != UNKNOWN_LOCATION)
1400 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1402 /* True on an OMP_SECTION statement that was the last lexical member.
1403 This status is meaningful in the implementation of lastprivate. */
1404 #define OMP_SECTION_LAST(NODE) \
1405 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1407 /* True on an OMP_PARALLEL statement if it represents an explicit
1408 combined parallel work-sharing constructs. */
1409 #define OMP_PARALLEL_COMBINED(NODE) \
1410 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1412 /* True on an OMP_TEAMS statement if it represents an explicit
1413 combined teams distribute constructs. */
1414 #define OMP_TEAMS_COMBINED(NODE) \
1415 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1417 /* True on an OMP_TARGET statement if it represents explicit
1418 combined target teams, target parallel or target simd constructs. */
1419 #define OMP_TARGET_COMBINED(NODE) \
1420 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1422 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1423 as opposed to relaxed. */
1424 #define OMP_ATOMIC_SEQ_CST(NODE) \
1425 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1426 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1428 /* True on a PRIVATE clause if its decl is kept around for debugging
1429 information only and its DECL_VALUE_EXPR is supposed to point
1430 to what it has been remapped to. */
1431 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1432 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1434 /* True on a PRIVATE clause if ctor needs access to outer region's
1436 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1437 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1439 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1440 (thus should be private on the outer taskloop and firstprivate on
1442 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1443 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1445 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1446 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1447 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1449 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1450 decl is present in the chain. */
1451 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1452 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1453 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1454 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1455 OMP_CLAUSE_LASTPRIVATE),\
1457 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1458 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1460 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1461 (thus should be lastprivate on the outer taskloop and firstprivate on
1463 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1464 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1466 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1467 decl is present in the chain (this can happen only for taskloop
1468 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1469 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1470 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1472 /* True on a SHARED clause if a scalar is not modified in the body and
1473 thus could be optimized as firstprivate. */
1474 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1475 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1477 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1478 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1480 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1481 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1482 #define OMP_CLAUSE_IF_EXPR(NODE) \
1483 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1484 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1485 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1486 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1487 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1488 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1489 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1490 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1491 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1493 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1494 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1496 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1497 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1499 /* OpenACC clause expressions */
1500 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1501 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1502 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1503 OMP_CLAUSE_OPERAND ( \
1504 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1505 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1506 OMP_CLAUSE_OPERAND ( \
1507 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1508 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1509 OMP_CLAUSE_OPERAND ( \
1510 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1511 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1512 OMP_CLAUSE_OPERAND ( \
1513 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1514 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1515 OMP_CLAUSE_OPERAND ( \
1516 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1517 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1518 OMP_CLAUSE_OPERAND ( \
1519 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1520 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1521 OMP_CLAUSE_OPERAND ( \
1522 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1523 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1524 OMP_CLAUSE_OPERAND ( \
1525 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1526 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1527 OMP_CLAUSE_OPERAND ( \
1528 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1530 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1531 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1533 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1534 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1536 #define OMP_CLAUSE_MAP_KIND(NODE) \
1537 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1538 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1539 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1540 = (unsigned int) (MAP_KIND))
1542 /* Nonzero if this map clause is for array (rather than pointer) based array
1543 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1544 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1545 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1546 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1547 /* Nonzero if this is a mapped array section, that might need special
1548 treatment if OMP_CLAUSE_SIZE is zero. */
1549 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1550 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1551 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1552 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1553 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1555 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1556 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1558 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1559 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1560 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1561 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1562 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1563 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1565 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1566 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1568 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1569 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1570 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1571 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1572 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1573 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1574 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1575 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1576 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1577 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1578 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1579 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1580 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1581 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1583 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1584 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1585 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1586 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1588 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1589 are always initialized inside of the loop construct, false otherwise. */
1590 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1591 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1593 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1594 are declared inside of the simd construct. */
1595 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1596 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1598 /* True if a LINEAR clause has a stride that is variable. */
1599 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1600 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1602 /* True if a LINEAR clause is for an array or allocatable variable that
1603 needs special handling by the frontend. */
1604 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1605 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1607 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1608 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1610 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1611 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1613 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1614 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1616 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1617 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1619 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1620 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1622 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1623 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1625 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1626 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1627 OMP_CLAUSE_THREAD_LIMIT), 0)
1629 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1630 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1632 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1633 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1634 OMP_CLAUSE_DIST_SCHEDULE), 0)
1636 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1637 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1639 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1640 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1642 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1643 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1645 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1646 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1648 /* True if a SCHEDULE clause has the simd modifier on it. */
1649 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1650 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1652 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1653 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1655 #define OMP_CLAUSE_TILE_LIST(NODE) \
1656 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1658 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1659 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1660 ->omp_clause.subcode.dimension)
1661 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1662 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1663 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1664 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1666 /* SSA_NAME accessors. */
1668 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1669 if there is no name associated with it. */
1670 #define SSA_NAME_IDENTIFIER(NODE) \
1671 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1672 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1673 ? (NODE)->ssa_name.var \
1674 : DECL_NAME ((NODE)->ssa_name.var)) \
1677 /* Returns the variable being referenced. This can be NULL_TREE for
1678 temporaries not associated with any user variable.
1679 Once released, this is the only field that can be relied upon. */
1680 #define SSA_NAME_VAR(NODE) \
1681 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1682 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1683 ? NULL_TREE : (NODE)->ssa_name.var)
1685 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1686 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1688 /* Returns the statement which defines this SSA name. */
1689 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1691 /* Returns the SSA version number of this SSA name. Note that in
1692 tree SSA, version numbers are not per variable and may be recycled. */
1693 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1695 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1696 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1698 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1699 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1701 /* Nonzero if this SSA_NAME expression is currently on the free list of
1702 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1703 has no meaning for an SSA_NAME. */
1704 #define SSA_NAME_IN_FREE_LIST(NODE) \
1705 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1707 /* Nonzero if this SSA_NAME is the default definition for the
1708 underlying symbol. A default SSA name is created for symbol S if
1709 the very first reference to S in the function is a read operation.
1710 Default definitions are always created by an empty statement and
1711 belong to no basic block. */
1712 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1713 SSA_NAME_CHECK (NODE)->base.default_def_flag
1715 /* Attributes for SSA_NAMEs for pointer-type variables. */
1716 #define SSA_NAME_PTR_INFO(N) \
1717 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1719 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1720 #define SSA_NAME_ANTI_RANGE_P(N) \
1721 SSA_NAME_CHECK (N)->base.static_flag
1723 /* The type of range described by SSA_NAME_RANGE_INFO. */
1724 #define SSA_NAME_RANGE_TYPE(N) \
1725 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1727 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1728 #define SSA_NAME_RANGE_INFO(N) \
1729 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1731 /* Return the immediate_use information for an SSA_NAME. */
1732 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1734 #define OMP_CLAUSE_CODE(NODE) \
1735 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1737 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1738 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1740 #define OMP_CLAUSE_OPERAND(NODE, I) \
1741 OMP_CLAUSE_ELT_CHECK (NODE, I)
1743 /* In a BLOCK node. */
1744 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1745 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1746 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1747 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1748 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1749 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1750 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1751 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1752 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1753 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1754 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1755 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1757 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1758 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1760 /* An index number for this block. These values are not guaranteed to
1761 be unique across functions -- whether or not they are depends on
1762 the debugging output format in use. */
1763 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1765 /* If block reordering splits a lexical block into discontiguous
1766 address ranges, we'll make a copy of the original block.
1768 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1769 In that case, we have one source block that has been replicated
1770 (through inlining or unrolling) into many logical blocks, and that
1771 these logical blocks have different physical variables in them.
1773 In this case, we have one logical block split into several
1774 non-contiguous address ranges. Most debug formats can't actually
1775 represent this idea directly, so we fake it by creating multiple
1776 logical blocks with the same variables in them. However, for those
1777 that do support non-contiguous regions, these allow the original
1778 logical block to be reconstructed, along with the set of address
1781 One of the logical block fragments is arbitrarily chosen to be
1782 the ORIGIN. The other fragments will point to the origin via
1783 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1784 be null. The list of fragments will be chained through
1785 BLOCK_FRAGMENT_CHAIN from the origin. */
1787 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1788 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1790 /* For an inlined function, this gives the location where it was called
1791 from. This is only set in the top level block, which corresponds to the
1792 inlined function scope. This is used in the debug output routines. */
1794 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1796 /* This gives the location of the end of the block, useful to attach
1797 code implicitly generated for outgoing paths. */
1799 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1801 /* Define fields and accessors for nodes representing data types. */
1803 /* See tree.def for documentation of the use of these fields.
1804 Look at the documentation of the various ..._TYPE tree codes.
1806 Note that the type.values, type.minval, and type.maxval fields are
1807 overloaded and used for different macros in different kinds of types.
1808 Each macro must check to ensure the tree node is of the proper kind of
1809 type. Note also that some of the front-ends also overload these fields,
1810 so they must be checked as well. */
1812 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1813 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1814 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1815 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1816 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1817 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1818 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1819 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1820 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1821 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1823 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1824 #define TYPE_MODE(NODE) \
1825 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1826 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1827 #define SET_TYPE_MODE(NODE, MODE) \
1828 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1830 extern machine_mode
element_mode (const_tree t
);
1832 /* The "canonical" type for this type node, which is used by frontends to
1833 compare the type for equality with another type. If two types are
1834 equal (based on the semantics of the language), then they will have
1835 equivalent TYPE_CANONICAL entries.
1837 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1838 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1839 be used for comparison against other types. Instead, the type is
1840 said to require structural equality checks, described in
1841 TYPE_STRUCTURAL_EQUALITY_P.
1843 For unqualified aggregate and function types the middle-end relies on
1844 TYPE_CANONICAL to tell whether two variables can be assigned
1845 to each other without a conversion. The middle-end also makes sure
1846 to assign the same alias-sets to the type partition with equal
1847 TYPE_CANONICAL of their unqualified variants. */
1848 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1849 /* Indicates that the type node requires structural equality
1850 checks. The compiler will need to look at the composition of the
1851 type to determine whether it is equal to another type, rather than
1852 just comparing canonical type pointers. For instance, we would need
1853 to look at the return and parameter types of a FUNCTION_TYPE
1855 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1856 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1857 type node requires structural equality. */
1858 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1860 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1861 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1863 /* The (language-specific) typed-based alias set for this type.
1864 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1865 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1866 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1867 type can alias objects of any type. */
1868 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1870 /* Nonzero iff the typed-based alias set for this type has been
1872 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1873 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1875 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1877 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1879 /* The alignment necessary for objects of this type.
1880 The value is an int, measured in bits and must be a power of two.
1881 We support also an "alignment" of zero. */
1882 #define TYPE_ALIGN(NODE) \
1883 (TYPE_CHECK (NODE)->type_common.align \
1884 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
1886 /* Specify that TYPE_ALIGN(NODE) is X. */
1887 #define SET_TYPE_ALIGN(NODE, X) \
1888 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
1890 /* 1 if the alignment for this type was requested by "aligned" attribute,
1891 0 if it is the default for this type. */
1892 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1894 /* The alignment for NODE, in bytes. */
1895 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1897 /* If your language allows you to declare types, and you want debug info
1898 for them, then you need to generate corresponding TYPE_DECL nodes.
1899 These "stub" TYPE_DECL nodes have no name, and simply point at the
1900 type node. You then set the TYPE_STUB_DECL field of the type node
1901 to point back at the TYPE_DECL node. This allows the debug routines
1902 to know that the two nodes represent the same type, so that we only
1903 get one debug info record for them. */
1904 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1906 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1907 the type has BLKmode only because it lacks the alignment required for
1909 #define TYPE_NO_FORCE_BLK(NODE) \
1910 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1912 /* Nonzero in a type considered volatile as a whole. */
1913 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1915 /* Nonzero in a type considered atomic as a whole. */
1916 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1918 /* Means this type is const-qualified. */
1919 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1921 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1923 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1925 /* If nonzero, type's name shouldn't be emitted into debug info. */
1926 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1928 /* The address space the type is in. */
1929 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1931 /* Encode/decode the named memory support as part of the qualifier. If more
1932 than 8 qualifiers are added, these macros need to be adjusted. */
1933 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1934 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1936 /* Return all qualifiers except for the address space qualifiers. */
1937 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1939 /* Only keep the address space out of the qualifiers and discard the other
1941 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1943 /* The set of type qualifiers for this type. */
1944 #define TYPE_QUALS(NODE) \
1945 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1946 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1947 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1948 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1949 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1951 /* The same as TYPE_QUALS without the address space qualifications. */
1952 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1953 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1954 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1955 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1956 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1958 /* The same as TYPE_QUALS without the address space and atomic
1960 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1961 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1962 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1963 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1965 /* These flags are available for each language front end to use internally. */
1966 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1967 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1968 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1969 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1970 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1971 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1972 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1973 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
1975 /* Used to keep track of visited nodes in tree traversals. This is set to
1976 0 by copy_node and make_node. */
1977 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1979 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1980 that distinguish string from array of char).
1981 If set in a INTEGER_TYPE, indicates a character type. */
1982 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1984 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1985 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1987 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1989 /* Set precision to n when we have 2^n sub-parts of the vector. */
1990 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1991 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1993 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1994 about missing conversions to other vector types of the same size. */
1995 #define TYPE_VECTOR_OPAQUE(NODE) \
1996 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1998 /* Indicates that objects of this type must be initialized by calling a
1999 function when they are created. */
2000 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2001 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2003 /* Indicates that a UNION_TYPE object should be passed the same way that
2004 the first union alternative would be passed, or that a RECORD_TYPE
2005 object should be passed the same way that the first (and only) member
2007 #define TYPE_TRANSPARENT_AGGR(NODE) \
2008 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2010 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2011 address of a component of the type. This is the counterpart of
2012 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2013 #define TYPE_NONALIASED_COMPONENT(NODE) \
2014 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2016 /* Indicated that objects of this type should be laid out in as
2017 compact a way as possible. */
2018 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2020 /* Used by type_contains_placeholder_p to avoid recomputation.
2021 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2022 this field directly. */
2023 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2024 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2026 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2027 #define TYPE_FINAL_P(NODE) \
2028 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2030 /* The debug output functions use the symtab union field to store
2031 information specific to the debugging format. The different debug
2032 output hooks store different types in the union field. These three
2033 macros are used to access different fields in the union. The debug
2034 hooks are responsible for consistently using only a specific
2037 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2038 hold the type's number in the generated stabs. */
2039 #define TYPE_SYMTAB_ADDRESS(NODE) \
2040 (TYPE_CHECK (NODE)->type_common.symtab.address)
2042 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2043 hold struct/union type tag names. */
2044 #define TYPE_SYMTAB_POINTER(NODE) \
2045 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2047 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2048 in dwarf2out.c to point to the DIE generated for the type. */
2049 #define TYPE_SYMTAB_DIE(NODE) \
2050 (TYPE_CHECK (NODE)->type_common.symtab.die)
2052 /* The garbage collector needs to know the interpretation of the
2053 symtab field. These constants represent the different types in the
2056 #define TYPE_SYMTAB_IS_ADDRESS (0)
2057 #define TYPE_SYMTAB_IS_POINTER (1)
2058 #define TYPE_SYMTAB_IS_DIE (2)
2060 #define TYPE_LANG_SPECIFIC(NODE) \
2061 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2063 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2064 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2065 #define TYPE_FIELDS(NODE) \
2066 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2067 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2068 #define TYPE_ARG_TYPES(NODE) \
2069 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2070 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2072 #define TYPE_METHODS(NODE) \
2073 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2074 #define TYPE_VFIELD(NODE) \
2075 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2076 #define TYPE_METHOD_BASETYPE(NODE) \
2077 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2078 #define TYPE_OFFSET_BASETYPE(NODE) \
2079 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2080 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2081 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2082 #define TYPE_NEXT_PTR_TO(NODE) \
2083 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2084 #define TYPE_NEXT_REF_TO(NODE) \
2085 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2086 #define TYPE_MIN_VALUE(NODE) \
2087 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2088 #define TYPE_MAX_VALUE(NODE) \
2089 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2091 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2092 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2094 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2095 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2097 /* For record and union types, information about this type, as a base type
2099 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2101 /* For non record and union types, used in a language-dependent way. */
2102 #define TYPE_LANG_SLOT_1(NODE) \
2103 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2105 /* Define accessor macros for information about type inheritance
2108 A "basetype" means a particular usage of a data type for inheritance
2109 in another type. Each such basetype usage has its own "binfo"
2110 object to describe it. The binfo object is a TREE_VEC node.
2112 Inheritance is represented by the binfo nodes allocated for a
2113 given type. For example, given types C and D, such that D is
2114 inherited by C, 3 binfo nodes will be allocated: one for describing
2115 the binfo properties of C, similarly one for D, and one for
2116 describing the binfo properties of D as a base type for C.
2117 Thus, given a pointer to class C, one can get a pointer to the binfo
2118 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2120 /* BINFO specific flags. */
2122 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2123 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2125 /* Flags for language dependent use. */
2126 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2127 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2128 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2129 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2130 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2131 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2132 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2134 /* The actual data type node being inherited in this basetype. */
2135 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2137 /* The offset where this basetype appears in its containing type.
2138 BINFO_OFFSET slot holds the offset (in bytes)
2139 from the base of the complete object to the base of the part of the
2140 object that is allocated on behalf of this `type'.
2141 This is always 0 except when there is multiple inheritance. */
2143 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2144 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2146 /* The virtual function table belonging to this basetype. Virtual
2147 function tables provide a mechanism for run-time method dispatching.
2148 The entries of a virtual function table are language-dependent. */
2150 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2152 /* The virtual functions in the virtual function table. This is
2153 a TREE_LIST that is used as an initial approximation for building
2154 a virtual function table for this basetype. */
2155 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2157 /* A vector of binfos for the direct basetypes inherited by this
2160 If this basetype describes type D as inherited in C, and if the
2161 basetypes of D are E and F, then this vector contains binfos for
2162 inheritance of E and F by C. */
2163 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2165 /* The number of basetypes for NODE. */
2166 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2168 /* Accessor macro to get to the Nth base binfo of this binfo. */
2169 #define BINFO_BASE_BINFO(NODE,N) \
2170 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2171 #define BINFO_BASE_ITERATE(NODE,N,B) \
2172 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2173 #define BINFO_BASE_APPEND(NODE,T) \
2174 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2176 /* For a BINFO record describing a virtual base class, i.e., one where
2177 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2178 base. The actual contents are language-dependent. In the C++
2179 front-end this field is an INTEGER_CST giving an offset into the
2180 vtable where the offset to the virtual base can be found. */
2181 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2183 /* Indicates the accesses this binfo has to its bases. The values are
2184 access_public_node, access_protected_node or access_private_node.
2185 If this array is not present, public access is implied. */
2186 #define BINFO_BASE_ACCESSES(NODE) \
2187 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2189 #define BINFO_BASE_ACCESS(NODE,N) \
2190 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2191 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2192 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2194 /* The index in the VTT where this subobject's sub-VTT can be found.
2195 NULL_TREE if there is no sub-VTT. */
2196 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2198 /* The index in the VTT where the vptr for this subobject can be
2199 found. NULL_TREE if there is no secondary vptr in the VTT. */
2200 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2202 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2203 inheriting this base for non-virtual bases. For virtual bases it
2204 points either to the binfo for which this is a primary binfo, or to
2205 the binfo of the most derived type. */
2206 #define BINFO_INHERITANCE_CHAIN(NODE) \
2207 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2210 /* Define fields and accessors for nodes representing declared names. */
2212 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2213 have an associated SSA name. */
2214 #define SSA_VAR_P(DECL) \
2215 (TREE_CODE (DECL) == VAR_DECL \
2216 || TREE_CODE (DECL) == PARM_DECL \
2217 || TREE_CODE (DECL) == RESULT_DECL \
2218 || TREE_CODE (DECL) == SSA_NAME)
2221 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2223 /* This is the name of the object as written by the user.
2224 It is an IDENTIFIER_NODE. */
2225 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2227 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2228 #define TYPE_IDENTIFIER(NODE) \
2229 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2230 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2232 /* Every ..._DECL node gets a unique number. */
2233 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2235 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2237 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2239 /* Every ..._DECL node gets a unique number that stays the same even
2240 when the decl is copied by the inliner once it is set. */
2241 #define DECL_PT_UID(NODE) \
2242 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2243 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2244 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2245 #define SET_DECL_PT_UID(NODE, UID) \
2246 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2247 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2248 be preserved when copyin the decl. */
2249 #define DECL_PT_UID_SET_P(NODE) \
2250 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2252 /* These two fields describe where in the source code the declaration
2253 was. If the declaration appears in several places (as for a C
2254 function that is declared first and then defined later), this
2255 information should refer to the definition. */
2256 #define DECL_SOURCE_LOCATION(NODE) \
2257 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2258 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2259 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2260 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2261 /* This accessor returns TRUE if the decl it operates on was created
2262 by a front-end or back-end rather than by user code. In this case
2263 builtin-ness is indicated by source location. */
2264 #define DECL_IS_BUILTIN(DECL) \
2265 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2267 #define DECL_LOCATION_RANGE(NODE) \
2268 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE)))
2270 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2271 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2272 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2273 nodes, this points to either the FUNCTION_DECL for the containing
2274 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2275 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2276 scope". In particular, for VAR_DECLs which are virtual table pointers
2277 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2279 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2280 #define DECL_FIELD_CONTEXT(NODE) \
2281 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2283 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2284 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2286 /* For any sort of a ..._DECL node, this points to the original (abstract)
2287 decl node which this decl is an inlined/cloned instance of, or else it
2288 is NULL indicating that this decl is not an instance of some other decl.
2290 The C front-end also uses this in a nested declaration of an inline
2291 function, to point back to the definition. */
2292 #define DECL_ABSTRACT_ORIGIN(NODE) \
2293 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2295 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2296 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2297 #define DECL_ORIGIN(NODE) \
2298 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2300 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2301 inline instance of some original (abstract) decl from an inline function;
2302 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2303 nodes can also have their abstract origin set to themselves. */
2304 #define DECL_FROM_INLINE(NODE) \
2305 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2306 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2308 /* In a DECL this is the field where attributes are stored. */
2309 #define DECL_ATTRIBUTES(NODE) \
2310 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2312 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2313 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2314 For a VAR_DECL, holds the initial value.
2315 For a PARM_DECL, used for DECL_ARG_TYPE--default
2316 values for parameters are encoded in the type of the function,
2317 not in the PARM_DECL slot.
2318 For a FIELD_DECL, this is used for enumeration values and the C
2319 frontend uses it for temporarily storing bitwidth of bitfields.
2321 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2322 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2324 /* Holds the size of the datum, in bits, as a tree expression.
2325 Need not be constant. */
2326 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2327 /* Likewise for the size in bytes. */
2328 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2329 /* Returns the alignment required for the datum, in bits. It must
2330 be a power of two, but an "alignment" of zero is supported
2331 (e.g. as "uninitialized" sentinel). */
2332 #define DECL_ALIGN(NODE) \
2333 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2334 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2335 /* Specify that DECL_ALIGN(NODE) is X. */
2336 #define SET_DECL_ALIGN(NODE, X) \
2337 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2339 /* The alignment of NODE, in bytes. */
2340 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2341 /* Set if the alignment of this DECL has been set by the user, for
2342 example with an 'aligned' attribute. */
2343 #define DECL_USER_ALIGN(NODE) \
2344 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2345 /* Holds the machine mode corresponding to the declaration of a variable or
2346 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2348 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2350 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2351 operation it is. Note, however, that this field is overloaded, with
2352 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2353 checked before any access to the former. */
2354 #define DECL_FUNCTION_CODE(NODE) \
2355 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2357 #define DECL_FUNCTION_PERSONALITY(NODE) \
2358 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2360 /* Nonzero for a given ..._DECL node means that the name of this node should
2361 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2362 the associated type should be ignored. For a FUNCTION_DECL, the body of
2363 the function should also be ignored. */
2364 #define DECL_IGNORED_P(NODE) \
2365 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2367 /* Nonzero for a given ..._DECL node means that this node represents an
2368 "abstract instance" of the given declaration (e.g. in the original
2369 declaration of an inline function). When generating symbolic debugging
2370 information, we mustn't try to generate any address information for nodes
2371 marked as "abstract instances" because we don't actually generate
2372 any code or allocate any data space for such instances. */
2373 #define DECL_ABSTRACT_P(NODE) \
2374 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2376 /* Language-specific decl information. */
2377 #define DECL_LANG_SPECIFIC(NODE) \
2378 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2380 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2381 do not allocate storage, and refer to a definition elsewhere. Note that
2382 this does not necessarily imply the entity represented by NODE
2383 has no program source-level definition in this translation unit. For
2384 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2385 DECL_EXTERNAL may be true simultaneously; that can be the case for
2386 a C99 "extern inline" function. */
2387 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2389 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2390 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2392 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2394 Also set in some languages for variables, etc., outside the normal
2395 lexical scope, such as class instance variables. */
2396 #define DECL_NONLOCAL(NODE) \
2397 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2399 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2400 Used in FIELD_DECLs for vtable pointers.
2401 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2402 #define DECL_VIRTUAL_P(NODE) \
2403 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2405 /* Used to indicate that this DECL represents a compiler-generated entity. */
2406 #define DECL_ARTIFICIAL(NODE) \
2407 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2409 /* Additional flags for language-specific uses. */
2410 #define DECL_LANG_FLAG_0(NODE) \
2411 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2412 #define DECL_LANG_FLAG_1(NODE) \
2413 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2414 #define DECL_LANG_FLAG_2(NODE) \
2415 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2416 #define DECL_LANG_FLAG_3(NODE) \
2417 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2418 #define DECL_LANG_FLAG_4(NODE) \
2419 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2420 #define DECL_LANG_FLAG_5(NODE) \
2421 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2422 #define DECL_LANG_FLAG_6(NODE) \
2423 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2424 #define DECL_LANG_FLAG_7(NODE) \
2425 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2426 #define DECL_LANG_FLAG_8(NODE) \
2427 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2429 /* Nonzero for a scope which is equal to file scope. */
2430 #define SCOPE_FILE_SCOPE_P(EXP) \
2431 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2432 /* Nonzero for a decl which is at file scope. */
2433 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2434 /* Nonzero for a type which is at file scope. */
2435 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2437 /* Nonzero for a decl that is decorated using attribute used.
2438 This indicates to compiler tools that this decl needs to be preserved. */
2439 #define DECL_PRESERVE_P(DECL) \
2440 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2442 /* For function local variables of COMPLEX and VECTOR types,
2443 indicates that the variable is not aliased, and that all
2444 modifications to the variable have been adjusted so that
2445 they are killing assignments. Thus the variable may now
2446 be treated as a GIMPLE register, and use real instead of
2447 virtual ops in SSA form. */
2448 #define DECL_GIMPLE_REG_P(DECL) \
2449 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2451 extern tree
decl_value_expr_lookup (tree
);
2452 extern void decl_value_expr_insert (tree
, tree
);
2454 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2455 if transformations have made this more complicated than evaluating the
2456 decl itself. This should only be used for debugging; once this field has
2457 been set, the decl itself may not legitimately appear in the function. */
2458 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2459 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2460 ->decl_common.decl_flag_2)
2461 #define DECL_VALUE_EXPR(NODE) \
2462 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2463 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2464 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2466 /* Holds the RTL expression for the value of a variable or function.
2467 This value can be evaluated lazily for functions, variables with
2468 static storage duration, and labels. */
2469 #define DECL_RTL(NODE) \
2470 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2471 ? (NODE)->decl_with_rtl.rtl \
2472 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2474 /* Set the DECL_RTL for NODE to RTL. */
2475 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2477 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2478 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2480 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2481 #define DECL_RTL_SET_P(NODE) \
2482 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2484 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2485 NODE1, it will not be set for NODE2; this is a lazy copy. */
2486 #define COPY_DECL_RTL(NODE1, NODE2) \
2487 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2488 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2490 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2491 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2493 #if (GCC_VERSION >= 2007)
2494 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2495 ({ tree const __d = (decl); \
2496 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2497 /* Dereference it so the compiler knows it can't be NULL even \
2498 without assertion checking. */ \
2499 &*DECL_RTL_IF_SET (__d); })
2501 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2504 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2505 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2507 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2508 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2509 of the structure. */
2510 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2512 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2513 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2514 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2515 natural alignment of the field's type). */
2516 #define DECL_FIELD_BIT_OFFSET(NODE) \
2517 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2519 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2520 if so, the type that was originally specified for it.
2521 TREE_TYPE may have been modified (in finish_struct). */
2522 #define DECL_BIT_FIELD_TYPE(NODE) \
2523 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2525 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2526 representative FIELD_DECL. */
2527 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2528 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2530 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2531 if nonzero, indicates that the field occupies the type. */
2532 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2534 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2535 DECL_FIELD_OFFSET which are known to be always zero.
2536 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2538 #define DECL_OFFSET_ALIGN(NODE) \
2539 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2541 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2542 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2543 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2545 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2546 which this FIELD_DECL is defined. This information is needed when
2547 writing debugging information about vfield and vbase decls for C++. */
2548 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2550 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2551 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2553 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2555 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2557 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2558 this component. This makes it possible for Type-Based Alias Analysis
2559 to disambiguate accesses to this field with indirect accesses using
2562 struct S { int i; } s;
2565 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2567 From the implementation's viewpoint, the alias set of the type of the
2568 field 'i' (int) will not be recorded as a subset of that of the type of
2569 's' (struct S) in record_component_aliases. The counterpart is that
2570 accesses to s.i must not be given the alias set of the type of 'i'
2571 (int) but instead directly that of the type of 's' (struct S). */
2572 #define DECL_NONADDRESSABLE_P(NODE) \
2573 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2575 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2576 dense, unique within any one function, and may be used to index arrays.
2577 If the value is -1, then no UID has been assigned. */
2578 #define LABEL_DECL_UID(NODE) \
2579 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2581 /* In a LABEL_DECL, the EH region number for which the label is the
2582 post_landing_pad. */
2583 #define EH_LANDING_PAD_NR(NODE) \
2584 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2586 /* For a PARM_DECL, records the data type used to pass the argument,
2587 which may be different from the type seen in the program. */
2588 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2590 /* For PARM_DECL, holds an RTL for the stack slot or register
2591 where the data was actually passed. */
2592 #define DECL_INCOMING_RTL(NODE) \
2593 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2595 /* Nonzero for a given ..._DECL node means that no warnings should be
2596 generated just because this node is unused. */
2597 #define DECL_IN_SYSTEM_HEADER(NODE) \
2598 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2600 /* Used to indicate that the linkage status of this DECL is not yet known,
2601 so it should not be output now. */
2602 #define DECL_DEFER_OUTPUT(NODE) \
2603 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2605 /* In a VAR_DECL that's static,
2606 nonzero if the space is in the text section. */
2607 #define DECL_IN_TEXT_SECTION(NODE) \
2608 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2610 /* In a VAR_DECL that's static,
2611 nonzero if it belongs to the global constant pool. */
2612 #define DECL_IN_CONSTANT_POOL(NODE) \
2613 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2615 /* Nonzero for a given ..._DECL node means that this node should be
2616 put in .common, if possible. If a DECL_INITIAL is given, and it
2617 is not error_mark_node, then the decl cannot be put in .common. */
2618 #define DECL_COMMON(NODE) \
2619 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2621 /* In a VAR_DECL, nonzero if the decl is a register variable with
2622 an explicit asm specification. */
2623 #define DECL_HARD_REGISTER(NODE) \
2624 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2626 /* Used to indicate that this DECL has weak linkage. */
2627 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2629 /* Used to indicate that the DECL is a dllimport. */
2630 #define DECL_DLLIMPORT_P(NODE) \
2631 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2633 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2634 not be put out unless it is needed in this translation unit.
2635 Entities like this are shared across translation units (like weak
2636 entities), but are guaranteed to be generated by any translation
2637 unit that needs them, and therefore need not be put out anywhere
2638 where they are not needed. DECL_COMDAT is just a hint to the
2639 back-end; it is up to front-ends which set this flag to ensure
2640 that there will never be any harm, other than bloat, in putting out
2641 something which is DECL_COMDAT. */
2642 #define DECL_COMDAT(NODE) \
2643 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2645 #define DECL_COMDAT_GROUP(NODE) \
2646 decl_comdat_group (NODE)
2648 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2649 multiple translation units should be merged. */
2650 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2651 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2653 /* The name of the object as the assembler will see it (but before any
2654 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2655 as DECL_NAME. It is an IDENTIFIER_NODE.
2657 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2658 One Definition Rule based type merging at LTO. It is computed only for
2659 LTO compilation and C++. */
2660 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2662 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2663 This is true of all DECL nodes except FIELD_DECL. */
2664 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2665 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2667 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2668 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2670 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2671 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2672 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2674 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2675 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2676 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2678 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2679 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2680 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2681 semantics of using this macro, are different than saying:
2683 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2685 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2687 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2688 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2689 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2690 DECL_ASSEMBLER_NAME (DECL1)) \
2693 /* Records the section name in a section attribute. Used to pass
2694 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2695 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2697 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2698 this variable in a BIND_EXPR. */
2699 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2700 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2702 /* Value of the decls's visibility attribute */
2703 #define DECL_VISIBILITY(NODE) \
2704 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2706 /* Nonzero means that the decl had its visibility specified rather than
2708 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2709 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2711 /* In a VAR_DECL, the model to use if the data should be allocated from
2712 thread-local storage. */
2713 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2715 /* In a VAR_DECL, nonzero if the data should be allocated from
2716 thread-local storage. */
2717 #define DECL_THREAD_LOCAL_P(NODE) \
2718 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2720 /* In a non-local VAR_DECL with static storage duration, true if the
2721 variable has an initialization priority. If false, the variable
2722 will be initialized at the DEFAULT_INIT_PRIORITY. */
2723 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2724 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2726 extern tree
decl_debug_expr_lookup (tree
);
2727 extern void decl_debug_expr_insert (tree
, tree
);
2729 /* For VAR_DECL, this is set to an expression that it was split from. */
2730 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2731 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2732 #define DECL_DEBUG_EXPR(NODE) \
2733 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2735 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2736 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2738 extern priority_type
decl_init_priority_lookup (tree
);
2739 extern priority_type
decl_fini_priority_lookup (tree
);
2740 extern void decl_init_priority_insert (tree
, priority_type
);
2741 extern void decl_fini_priority_insert (tree
, priority_type
);
2743 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2745 #define DECL_INIT_PRIORITY(NODE) \
2746 (decl_init_priority_lookup (NODE))
2747 /* Set the initialization priority for NODE to VAL. */
2748 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2749 (decl_init_priority_insert (NODE, VAL))
2751 /* For a FUNCTION_DECL the finalization priority of NODE. */
2752 #define DECL_FINI_PRIORITY(NODE) \
2753 (decl_fini_priority_lookup (NODE))
2754 /* Set the finalization priority for NODE to VAL. */
2755 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2756 (decl_fini_priority_insert (NODE, VAL))
2758 /* The initialization priority for entities for which no explicit
2759 initialization priority has been specified. */
2760 #define DEFAULT_INIT_PRIORITY 65535
2762 /* The maximum allowed initialization priority. */
2763 #define MAX_INIT_PRIORITY 65535
2765 /* The largest priority value reserved for use by system runtime
2767 #define MAX_RESERVED_INIT_PRIORITY 100
2769 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2770 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2771 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2773 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2774 #define DECL_NONLOCAL_FRAME(NODE) \
2775 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2777 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2778 #define DECL_NONALIASED(NODE) \
2779 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2781 /* This field is used to reference anything in decl.result and is meant only
2782 for use by the garbage collector. */
2783 #define DECL_RESULT_FLD(NODE) \
2784 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2786 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2787 Before the struct containing the FUNCTION_DECL is laid out,
2788 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2789 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2790 function. When the class is laid out, this pointer is changed
2791 to an INTEGER_CST node which is suitable for use as an index
2792 into the virtual function table. */
2793 #define DECL_VINDEX(NODE) \
2794 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2796 /* In FUNCTION_DECL, holds the decl for the return value. */
2797 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2799 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2800 #define DECL_UNINLINABLE(NODE) \
2801 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2803 /* In a FUNCTION_DECL, the saved representation of the body of the
2805 #define DECL_SAVED_TREE(NODE) \
2806 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2808 /* Nonzero in a FUNCTION_DECL means this function should be treated
2809 as if it were a malloc, meaning it returns a pointer that is
2811 #define DECL_IS_MALLOC(NODE) \
2812 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2814 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2815 C++ operator new, meaning that it returns a pointer for which we
2816 should not use type based aliasing. */
2817 #define DECL_IS_OPERATOR_NEW(NODE) \
2818 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2820 /* Nonzero in a FUNCTION_DECL means this function may return more
2822 #define DECL_IS_RETURNS_TWICE(NODE) \
2823 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2825 /* Nonzero in a FUNCTION_DECL means this function should be treated
2826 as "pure" function (like const function, but may read global memory). */
2827 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2829 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2830 the const or pure function may not terminate. When this is nonzero
2831 for a const or pure function, it can be dealt with by cse passes
2832 but cannot be removed by dce passes since you are not allowed to
2833 change an infinite looping program into one that terminates without
2835 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2836 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2838 /* Nonzero in a FUNCTION_DECL means this function should be treated
2839 as "novops" function (function that does not read global memory,
2840 but may have arbitrary side effects). */
2841 #define DECL_IS_NOVOPS(NODE) \
2842 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2844 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2845 at the beginning or end of execution. */
2846 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2847 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2849 #define DECL_STATIC_DESTRUCTOR(NODE) \
2850 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2852 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2853 be instrumented with calls to support routines. */
2854 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2855 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2857 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2858 disabled in this function. */
2859 #define DECL_NO_LIMIT_STACK(NODE) \
2860 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2862 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2863 #define DECL_STATIC_CHAIN(NODE) \
2864 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2866 /* Nonzero for a decl that cgraph has decided should be inlined into
2867 at least one call site. It is not meaningful to look at this
2868 directly; always use cgraph_function_possibly_inlined_p. */
2869 #define DECL_POSSIBLY_INLINED(DECL) \
2870 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2872 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2873 such as via the `inline' keyword in C/C++. This flag controls the linkage
2874 semantics of 'inline' */
2875 #define DECL_DECLARED_INLINE_P(NODE) \
2876 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2878 /* Nonzero in a FUNCTION_DECL means this function should not get
2879 -Winline warnings. */
2880 #define DECL_NO_INLINE_WARNING_P(NODE) \
2881 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2883 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2884 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2885 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2887 /* Nonzero if a FUNCTION_CODE is a TM load. */
2888 #define BUILTIN_TM_LOAD_P(FN) \
2889 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2891 /* Nonzero if a FUNCTION_CODE is a TM store. */
2892 #define BUILTIN_TM_STORE_P(FN) \
2893 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2895 #define CASE_BUILT_IN_TM_LOAD(FN) \
2896 case BUILT_IN_TM_LOAD_##FN: \
2897 case BUILT_IN_TM_LOAD_RAR_##FN: \
2898 case BUILT_IN_TM_LOAD_RAW_##FN: \
2899 case BUILT_IN_TM_LOAD_RFW_##FN
2901 #define CASE_BUILT_IN_TM_STORE(FN) \
2902 case BUILT_IN_TM_STORE_##FN: \
2903 case BUILT_IN_TM_STORE_WAR_##FN: \
2904 case BUILT_IN_TM_STORE_WAW_##FN
2906 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2907 disregarding size and cost heuristics. This is equivalent to using
2908 the always_inline attribute without the required diagnostics if the
2909 function cannot be inlined. */
2910 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2911 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2913 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2914 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2916 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2917 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2918 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2920 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2921 that describes the status of this function. */
2922 #define DECL_STRUCT_FUNCTION(NODE) \
2923 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2925 /* In a FUNCTION_DECL, nonzero means a built in function of a
2926 standard library or more generally a built in function that is
2927 recognized by optimizers and expanders.
2929 Note that it is different from the DECL_IS_BUILTIN accessor. For
2930 instance, user declared prototypes of C library functions are not
2931 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2932 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2934 /* For a builtin function, identify which part of the compiler defined it. */
2935 #define DECL_BUILT_IN_CLASS(NODE) \
2936 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2938 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2939 #define DECL_ARGUMENTS(NODE) \
2940 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2942 /* In FUNCTION_DECL, the function specific target options to use when compiling
2944 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2945 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2947 /* In FUNCTION_DECL, the function specific optimization options to use when
2948 compiling this function. */
2949 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2950 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2952 /* In FUNCTION_DECL, this is set if this function has other versions generated
2953 using "target" attributes. The default version is the one which does not
2954 have any "target" attribute set. */
2955 #define DECL_FUNCTION_VERSIONED(NODE)\
2956 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2958 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2959 Devirtualization machinery uses this knowledge for determing type of the
2960 object constructed. Also we assume that constructor address is not
2962 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2963 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2965 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2966 Devirtualization machinery uses this to track types in destruction. */
2967 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2968 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2970 /* In FUNCTION_DECL that represent an virtual method this is set when
2971 the method is final. */
2972 #define DECL_FINAL_P(NODE)\
2973 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2975 /* The source language of the translation-unit. */
2976 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2977 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2979 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2981 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2982 #define DECL_ORIGINAL_TYPE(NODE) \
2983 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2985 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2986 into stabs. Instead it will generate cross reference ('x') of names.
2987 This uses the same flag as DECL_EXTERNAL. */
2988 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2989 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2991 /* Getter of the imported declaration associated to the
2992 IMPORTED_DECL node. */
2993 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2994 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2996 /* Getter of the symbol declaration associated with the
2997 NAMELIST_DECL node. */
2998 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2999 (DECL_INITIAL (NODE))
3001 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3002 To reduce overhead, the nodes containing the statements are not trees.
3003 This avoids the overhead of tree_common on all linked list elements.
3005 Use the interface in tree-iterator.h to access this node. */
3007 #define STATEMENT_LIST_HEAD(NODE) \
3008 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3009 #define STATEMENT_LIST_TAIL(NODE) \
3010 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3012 #define TREE_OPTIMIZATION(NODE) \
3013 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3015 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3016 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3018 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3019 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3021 /* Return a tree node that encapsulates the optimization options in OPTS. */
3022 extern tree
build_optimization_node (struct gcc_options
*opts
);
3024 #define TREE_TARGET_OPTION(NODE) \
3025 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3027 #define TREE_TARGET_GLOBALS(NODE) \
3028 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3030 /* Return a tree node that encapsulates the target options in OPTS. */
3031 extern tree
build_target_option_node (struct gcc_options
*opts
);
3033 extern void prepare_target_option_nodes_for_pch (void);
3035 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3038 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3040 if (TREE_CODE (__t
) != __c
)
3041 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3046 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3049 if (TREE_CODE (__t
) == __c
)
3050 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3055 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3056 enum tree_code __c1
, enum tree_code __c2
)
3058 if (TREE_CODE (__t
) != __c1
3059 && TREE_CODE (__t
) != __c2
)
3060 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3065 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3066 enum tree_code __c1
, enum tree_code __c2
)
3068 if (TREE_CODE (__t
) == __c1
3069 || TREE_CODE (__t
) == __c2
)
3070 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3075 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3076 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3078 if (TREE_CODE (__t
) != __c1
3079 && TREE_CODE (__t
) != __c2
3080 && TREE_CODE (__t
) != __c3
)
3081 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3086 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3087 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3089 if (TREE_CODE (__t
) == __c1
3090 || TREE_CODE (__t
) == __c2
3091 || TREE_CODE (__t
) == __c3
)
3092 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3097 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3098 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3099 enum tree_code __c4
)
3101 if (TREE_CODE (__t
) != __c1
3102 && TREE_CODE (__t
) != __c2
3103 && TREE_CODE (__t
) != __c3
3104 && TREE_CODE (__t
) != __c4
)
3105 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3110 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3111 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3112 enum tree_code __c4
)
3114 if (TREE_CODE (__t
) == __c1
3115 || TREE_CODE (__t
) == __c2
3116 || TREE_CODE (__t
) == __c3
3117 || TREE_CODE (__t
) == __c4
)
3118 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3123 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3124 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3125 enum tree_code __c4
, enum tree_code __c5
)
3127 if (TREE_CODE (__t
) != __c1
3128 && TREE_CODE (__t
) != __c2
3129 && TREE_CODE (__t
) != __c3
3130 && TREE_CODE (__t
) != __c4
3131 && TREE_CODE (__t
) != __c5
)
3132 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3137 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3138 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3139 enum tree_code __c4
, enum tree_code __c5
)
3141 if (TREE_CODE (__t
) == __c1
3142 || TREE_CODE (__t
) == __c2
3143 || TREE_CODE (__t
) == __c3
3144 || TREE_CODE (__t
) == __c4
3145 || TREE_CODE (__t
) == __c5
)
3146 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3151 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3152 const char *__f
, int __l
, const char *__g
)
3154 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3155 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3160 tree_class_check (tree __t
, const enum tree_code_class __class
,
3161 const char *__f
, int __l
, const char *__g
)
3163 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3164 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3169 tree_range_check (tree __t
,
3170 enum tree_code __code1
, enum tree_code __code2
,
3171 const char *__f
, int __l
, const char *__g
)
3173 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3174 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3179 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3180 const char *__f
, int __l
, const char *__g
)
3182 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3183 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3184 if (__t
->omp_clause
.code
!= __code
)
3185 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3190 omp_clause_range_check (tree __t
,
3191 enum omp_clause_code __code1
,
3192 enum omp_clause_code __code2
,
3193 const char *__f
, int __l
, const char *__g
)
3195 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3196 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3197 if ((int) __t
->omp_clause
.code
< (int) __code1
3198 || (int) __t
->omp_clause
.code
> (int) __code2
)
3199 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3203 /* These checks have to be special cased. */
3206 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3208 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3209 if (!IS_EXPR_CODE_CLASS (__c
))
3210 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3214 /* These checks have to be special cased. */
3217 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3220 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3224 inline const HOST_WIDE_INT
*
3225 tree_int_cst_elt_check (const_tree __t
, int __i
,
3226 const char *__f
, int __l
, const char *__g
)
3228 if (TREE_CODE (__t
) != INTEGER_CST
)
3229 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3230 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3231 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3233 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3236 inline HOST_WIDE_INT
*
3237 tree_int_cst_elt_check (tree __t
, int __i
,
3238 const char *__f
, int __l
, const char *__g
)
3240 if (TREE_CODE (__t
) != INTEGER_CST
)
3241 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3242 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3243 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3245 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3248 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3250 # if GCC_VERSION >= 4006
3251 #pragma GCC diagnostic push
3252 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3256 tree_vec_elt_check (tree __t
, int __i
,
3257 const char *__f
, int __l
, const char *__g
)
3259 if (TREE_CODE (__t
) != TREE_VEC
)
3260 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3261 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3262 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3263 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3266 # if GCC_VERSION >= 4006
3267 #pragma GCC diagnostic pop
3271 omp_clause_elt_check (tree __t
, int __i
,
3272 const char *__f
, int __l
, const char *__g
)
3274 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3275 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3276 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3277 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3278 return &__t
->omp_clause
.ops
[__i
];
3281 /* These checks have to be special cased. */
3284 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3286 if (!ANY_INTEGRAL_TYPE_P (__t
))
3287 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3293 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3296 if (TREE_CODE (__t
) != __c
)
3297 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3302 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3305 if (TREE_CODE (__t
) == __c
)
3306 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3311 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3312 enum tree_code __c1
, enum tree_code __c2
)
3314 if (TREE_CODE (__t
) != __c1
3315 && TREE_CODE (__t
) != __c2
)
3316 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3321 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3322 enum tree_code __c1
, enum tree_code __c2
)
3324 if (TREE_CODE (__t
) == __c1
3325 || TREE_CODE (__t
) == __c2
)
3326 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3331 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3332 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3334 if (TREE_CODE (__t
) != __c1
3335 && TREE_CODE (__t
) != __c2
3336 && TREE_CODE (__t
) != __c3
)
3337 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3342 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3343 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3345 if (TREE_CODE (__t
) == __c1
3346 || TREE_CODE (__t
) == __c2
3347 || TREE_CODE (__t
) == __c3
)
3348 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3353 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3354 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3355 enum tree_code __c4
)
3357 if (TREE_CODE (__t
) != __c1
3358 && TREE_CODE (__t
) != __c2
3359 && TREE_CODE (__t
) != __c3
3360 && TREE_CODE (__t
) != __c4
)
3361 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3366 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3367 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3368 enum tree_code __c4
)
3370 if (TREE_CODE (__t
) == __c1
3371 || TREE_CODE (__t
) == __c2
3372 || TREE_CODE (__t
) == __c3
3373 || TREE_CODE (__t
) == __c4
)
3374 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3379 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3380 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3381 enum tree_code __c4
, enum tree_code __c5
)
3383 if (TREE_CODE (__t
) != __c1
3384 && TREE_CODE (__t
) != __c2
3385 && TREE_CODE (__t
) != __c3
3386 && TREE_CODE (__t
) != __c4
3387 && TREE_CODE (__t
) != __c5
)
3388 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3393 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3394 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3395 enum tree_code __c4
, enum tree_code __c5
)
3397 if (TREE_CODE (__t
) == __c1
3398 || TREE_CODE (__t
) == __c2
3399 || TREE_CODE (__t
) == __c3
3400 || TREE_CODE (__t
) == __c4
3401 || TREE_CODE (__t
) == __c5
)
3402 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3407 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3408 const char *__f
, int __l
, const char *__g
)
3410 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3411 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3416 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3417 const char *__f
, int __l
, const char *__g
)
3419 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3420 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3425 tree_range_check (const_tree __t
,
3426 enum tree_code __code1
, enum tree_code __code2
,
3427 const char *__f
, int __l
, const char *__g
)
3429 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3430 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3435 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3436 const char *__f
, int __l
, const char *__g
)
3438 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3439 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3440 if (__t
->omp_clause
.code
!= __code
)
3441 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3446 omp_clause_range_check (const_tree __t
,
3447 enum omp_clause_code __code1
,
3448 enum omp_clause_code __code2
,
3449 const char *__f
, int __l
, const char *__g
)
3451 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3452 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3453 if ((int) __t
->omp_clause
.code
< (int) __code1
3454 || (int) __t
->omp_clause
.code
> (int) __code2
)
3455 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3460 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3462 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3463 if (!IS_EXPR_CODE_CLASS (__c
))
3464 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3469 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3472 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3476 # if GCC_VERSION >= 4006
3477 #pragma GCC diagnostic push
3478 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3482 tree_vec_elt_check (const_tree __t
, int __i
,
3483 const char *__f
, int __l
, const char *__g
)
3485 if (TREE_CODE (__t
) != TREE_VEC
)
3486 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3487 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3488 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3489 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3490 //return &__t->vec.a[__i];
3493 # if GCC_VERSION >= 4006
3494 #pragma GCC diagnostic pop
3498 omp_clause_elt_check (const_tree __t
, int __i
,
3499 const char *__f
, int __l
, const char *__g
)
3501 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3502 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3503 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3504 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3505 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3509 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3512 if (!ANY_INTEGRAL_TYPE_P (__t
))
3513 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3520 /* Compute the number of operands in an expression node NODE. For
3521 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3522 otherwise it is looked up from the node's code. */
3524 tree_operand_length (const_tree node
)
3526 if (VL_EXP_CLASS_P (node
))
3527 return VL_EXP_OPERAND_LENGTH (node
);
3529 return TREE_CODE_LENGTH (TREE_CODE (node
));
3532 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3534 /* Special checks for TREE_OPERANDs. */
3536 tree_operand_check (tree __t
, int __i
,
3537 const char *__f
, int __l
, const char *__g
)
3539 const_tree __u
= EXPR_CHECK (__t
);
3540 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3541 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3542 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3546 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3547 const char *__f
, int __l
, const char *__g
)
3549 if (TREE_CODE (__t
) != __code
)
3550 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3551 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3552 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3553 return &__t
->exp
.operands
[__i
];
3557 tree_operand_check (const_tree __t
, int __i
,
3558 const char *__f
, int __l
, const char *__g
)
3560 const_tree __u
= EXPR_CHECK (__t
);
3561 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3562 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3563 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3567 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3568 const char *__f
, int __l
, const char *__g
)
3570 if (TREE_CODE (__t
) != __code
)
3571 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3572 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3573 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3574 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3579 #define error_mark_node global_trees[TI_ERROR_MARK]
3581 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3582 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3583 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3584 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3585 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3587 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3588 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3589 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3590 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3591 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3593 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3594 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3595 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3596 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3597 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3599 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3600 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3601 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3603 #define void_node global_trees[TI_VOID]
3605 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3606 #define integer_one_node global_trees[TI_INTEGER_ONE]
3607 #define integer_three_node global_trees[TI_INTEGER_THREE]
3608 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3609 #define size_zero_node global_trees[TI_SIZE_ZERO]
3610 #define size_one_node global_trees[TI_SIZE_ONE]
3611 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3612 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3613 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3615 /* Base access nodes. */
3616 #define access_public_node global_trees[TI_PUBLIC]
3617 #define access_protected_node global_trees[TI_PROTECTED]
3618 #define access_private_node global_trees[TI_PRIVATE]
3620 #define null_pointer_node global_trees[TI_NULL_POINTER]
3622 #define float_type_node global_trees[TI_FLOAT_TYPE]
3623 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3624 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3626 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
3627 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
3628 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
3629 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
3631 /* Names for individual types (code should normally iterate over all
3632 such types; these are only for back-end use, or in contexts such as
3633 *.def where iteration is not possible). */
3634 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
3635 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
3636 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
3637 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
3638 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
3639 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
3640 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
3642 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3643 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3644 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3645 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3647 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3648 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3649 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3650 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3652 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
3654 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3656 #define void_type_node global_trees[TI_VOID_TYPE]
3657 /* The C type `void *'. */
3658 #define ptr_type_node global_trees[TI_PTR_TYPE]
3659 /* The C type `const void *'. */
3660 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3661 /* The C type `size_t'. */
3662 #define size_type_node global_trees[TI_SIZE_TYPE]
3663 #define pid_type_node global_trees[TI_PID_TYPE]
3664 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3665 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3666 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3667 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3668 /* The C type `FILE *'. */
3669 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3670 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3672 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3673 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3674 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3676 /* The decimal floating point types. */
3677 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3678 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3679 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3680 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3681 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3682 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3684 /* The fixed-point types. */
3685 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3686 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3687 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3688 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3689 #define sat_unsigned_short_fract_type_node \
3690 global_trees[TI_SAT_USFRACT_TYPE]
3691 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3692 #define sat_unsigned_long_fract_type_node \
3693 global_trees[TI_SAT_ULFRACT_TYPE]
3694 #define sat_unsigned_long_long_fract_type_node \
3695 global_trees[TI_SAT_ULLFRACT_TYPE]
3696 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3697 #define fract_type_node global_trees[TI_FRACT_TYPE]
3698 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3699 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3700 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3701 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3702 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3703 #define unsigned_long_long_fract_type_node \
3704 global_trees[TI_ULLFRACT_TYPE]
3705 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3706 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3707 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3708 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3709 #define sat_unsigned_short_accum_type_node \
3710 global_trees[TI_SAT_USACCUM_TYPE]
3711 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3712 #define sat_unsigned_long_accum_type_node \
3713 global_trees[TI_SAT_ULACCUM_TYPE]
3714 #define sat_unsigned_long_long_accum_type_node \
3715 global_trees[TI_SAT_ULLACCUM_TYPE]
3716 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3717 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3718 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3719 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3720 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3721 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3722 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3723 #define unsigned_long_long_accum_type_node \
3724 global_trees[TI_ULLACCUM_TYPE]
3725 #define qq_type_node global_trees[TI_QQ_TYPE]
3726 #define hq_type_node global_trees[TI_HQ_TYPE]
3727 #define sq_type_node global_trees[TI_SQ_TYPE]
3728 #define dq_type_node global_trees[TI_DQ_TYPE]
3729 #define tq_type_node global_trees[TI_TQ_TYPE]
3730 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3731 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3732 #define usq_type_node global_trees[TI_USQ_TYPE]
3733 #define udq_type_node global_trees[TI_UDQ_TYPE]
3734 #define utq_type_node global_trees[TI_UTQ_TYPE]
3735 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3736 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3737 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3738 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3739 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3740 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3741 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3742 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3743 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3744 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3745 #define ha_type_node global_trees[TI_HA_TYPE]
3746 #define sa_type_node global_trees[TI_SA_TYPE]
3747 #define da_type_node global_trees[TI_DA_TYPE]
3748 #define ta_type_node global_trees[TI_TA_TYPE]
3749 #define uha_type_node global_trees[TI_UHA_TYPE]
3750 #define usa_type_node global_trees[TI_USA_TYPE]
3751 #define uda_type_node global_trees[TI_UDA_TYPE]
3752 #define uta_type_node global_trees[TI_UTA_TYPE]
3753 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3754 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3755 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3756 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3757 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3758 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3759 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3760 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3762 /* The node that should be placed at the end of a parameter list to
3763 indicate that the function does not take a variable number of
3764 arguments. The TREE_VALUE will be void_type_node and there will be
3765 no TREE_CHAIN. Language-independent code should not assume
3766 anything else about this node. */
3767 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3769 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3770 #define MAIN_NAME_P(NODE) \
3771 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3773 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3775 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3776 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3778 /* Default/current target options (TARGET_OPTION_NODE). */
3779 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3780 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3782 /* Default tree list option(), optimize() pragmas to be linked into the
3784 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3785 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3787 #define char_type_node integer_types[itk_char]
3788 #define signed_char_type_node integer_types[itk_signed_char]
3789 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3790 #define short_integer_type_node integer_types[itk_short]
3791 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3792 #define integer_type_node integer_types[itk_int]
3793 #define unsigned_type_node integer_types[itk_unsigned_int]
3794 #define long_integer_type_node integer_types[itk_long]
3795 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3796 #define long_long_integer_type_node integer_types[itk_long_long]
3797 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3799 /* True if NODE is an erroneous expression. */
3801 #define error_operand_p(NODE) \
3802 ((NODE) == error_mark_node \
3803 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3805 extern tree
decl_assembler_name (tree
);
3806 extern tree
decl_comdat_group (const_tree
);
3807 extern tree
decl_comdat_group_id (const_tree
);
3808 extern const char *decl_section_name (const_tree
);
3809 extern void set_decl_section_name (tree
, const char *);
3810 extern enum tls_model
decl_tls_model (const_tree
);
3811 extern void set_decl_tls_model (tree
, enum tls_model
);
3813 /* Compute the number of bytes occupied by 'node'. This routine only
3814 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3816 extern size_t tree_size (const_tree
);
3818 /* Compute the number of bytes occupied by a tree with code CODE.
3819 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3820 which are of variable length. */
3821 extern size_t tree_code_size (enum tree_code
);
3823 /* Allocate and return a new UID from the DECL_UID namespace. */
3824 extern int allocate_decl_uid (void);
3826 /* Lowest level primitive for allocating a node.
3827 The TREE_CODE is the only argument. Contents are initialized
3828 to zero except for a few of the common fields. */
3830 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3831 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3833 /* Free tree node. */
3835 extern void free_node (tree
);
3837 /* Make a copy of a node, with all the same contents. */
3839 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3840 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3842 /* Make a copy of a chain of TREE_LIST nodes. */
3844 extern tree
copy_list (tree
);
3846 /* Make a CASE_LABEL_EXPR. */
3848 extern tree
build_case_label (tree
, tree
, tree
);
3851 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3852 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3854 /* Make an INTEGER_CST. */
3856 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3857 #define make_int_cst(LEN, EXT_LEN) \
3858 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3860 /* Make a TREE_VEC. */
3862 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3863 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3865 /* Grow a TREE_VEC. */
3867 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3868 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3870 /* Construct various types of nodes. */
3872 extern tree
build_nt (enum tree_code
, ...);
3873 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3875 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3876 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3877 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3878 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3879 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3880 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3881 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3882 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3883 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3884 tree MEM_STAT_DECL
);
3885 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3886 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3887 tree MEM_STAT_DECL
);
3888 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3890 /* _loc versions of build[1-5]. */
3893 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3894 tree arg1 MEM_STAT_DECL
)
3896 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3897 if (CAN_HAVE_LOCATION_P (t
))
3898 SET_EXPR_LOCATION (t
, loc
);
3901 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3904 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3905 tree arg1 MEM_STAT_DECL
)
3907 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3908 if (CAN_HAVE_LOCATION_P (t
))
3909 SET_EXPR_LOCATION (t
, loc
);
3912 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3915 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3916 tree arg1
, tree arg2 MEM_STAT_DECL
)
3918 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3919 if (CAN_HAVE_LOCATION_P (t
))
3920 SET_EXPR_LOCATION (t
, loc
);
3923 #define build3_loc(l,c,t1,t2,t3,t4) \
3924 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3927 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3928 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3930 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3931 if (CAN_HAVE_LOCATION_P (t
))
3932 SET_EXPR_LOCATION (t
, loc
);
3935 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3936 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3939 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3940 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3942 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3943 arg4 PASS_MEM_STAT
);
3944 if (CAN_HAVE_LOCATION_P (t
))
3945 SET_EXPR_LOCATION (t
, loc
);
3948 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3949 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3951 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3952 #define build_var_debug_value(t1,t2) \
3953 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3955 /* Constructs double_int from tree CST. */
3957 extern tree
double_int_to_tree (tree
, double_int
);
3959 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3960 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3962 /* Create an INT_CST node with a CST value zero extended. */
3965 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3966 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3967 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3968 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3969 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3970 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3971 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3972 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3973 extern tree
build_vector_from_val (tree
, tree
);
3974 extern void recompute_constructor_flags (tree
);
3975 extern void verify_constructor_flags (tree
);
3976 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3977 extern tree
build_constructor_single (tree
, tree
, tree
);
3978 extern tree
build_constructor_from_list (tree
, tree
);
3979 extern tree
build_constructor_va (tree
, int, ...);
3980 extern tree
build_real_from_int_cst (tree
, const_tree
);
3981 extern tree
build_complex (tree
, tree
, tree
);
3982 extern tree
build_complex_inf (tree
, bool);
3983 extern tree
build_each_one_cst (tree
);
3984 extern tree
build_one_cst (tree
);
3985 extern tree
build_minus_one_cst (tree
);
3986 extern tree
build_all_ones_cst (tree
);
3987 extern tree
build_zero_cst (tree
);
3988 extern tree
build_string (int, const char *);
3989 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3990 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3991 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3992 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3993 extern tree
build_decl_stat (location_t
, enum tree_code
,
3994 tree
, tree MEM_STAT_DECL
);
3995 extern tree
build_fn_decl (const char *, tree
);
3996 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3997 extern tree
build_translation_unit_decl (tree
);
3998 extern tree
build_block (tree
, tree
, tree
, tree
);
3999 extern tree
build_empty_stmt (location_t
);
4000 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4002 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4003 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
4005 extern tree
build_call_nary (tree
, tree
, int, ...);
4006 extern tree
build_call_valist (tree
, tree
, int, va_list);
4007 #define build_call_array(T1,T2,N,T3)\
4008 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4009 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4010 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
4011 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4012 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4013 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4014 extern tree
build_call_expr (tree
, int, ...);
4015 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4017 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4018 tree
, int, const tree
*);
4019 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4021 extern tree
build_string_literal (int, const char *);
4023 /* Construct various nodes representing data types. */
4025 extern tree
signed_or_unsigned_type_for (int, tree
);
4026 extern tree
signed_type_for (tree
);
4027 extern tree
unsigned_type_for (tree
);
4028 extern tree
truth_type_for (tree
);
4029 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4030 extern tree
build_pointer_type (tree
);
4031 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4032 extern tree
build_reference_type (tree
);
4033 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4034 extern tree
build_vector_type (tree innertype
, int nunits
);
4035 extern tree
build_truth_vector_type (unsigned, unsigned);
4036 extern tree
build_same_sized_truth_vector_type (tree vectype
);
4037 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4038 extern tree
build_index_type (tree
);
4039 extern tree
build_array_type (tree
, tree
);
4040 extern tree
build_nonshared_array_type (tree
, tree
);
4041 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4042 extern tree
build_function_type (tree
, tree
);
4043 extern tree
build_function_type_list (tree
, ...);
4044 extern tree
build_varargs_function_type_list (tree
, ...);
4045 extern tree
build_function_type_array (tree
, int, tree
*);
4046 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4047 #define build_function_type_vec(RET, V) \
4048 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4049 #define build_varargs_function_type_vec(RET, V) \
4050 build_varargs_function_type_array (RET, vec_safe_length (V), \
4051 vec_safe_address (V))
4052 extern tree
build_method_type_directly (tree
, tree
, tree
);
4053 extern tree
build_method_type (tree
, tree
);
4054 extern tree
build_offset_type (tree
, tree
);
4055 extern tree
build_complex_type (tree
, bool named
= false);
4056 extern tree
array_type_nelts (const_tree
);
4058 extern tree
value_member (tree
, tree
);
4059 extern tree
purpose_member (const_tree
, tree
);
4060 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4061 extern tree
chain_index (int, tree
);
4063 extern int attribute_list_equal (const_tree
, const_tree
);
4064 extern int attribute_list_contained (const_tree
, const_tree
);
4065 extern int tree_int_cst_equal (const_tree
, const_tree
);
4067 extern bool tree_fits_shwi_p (const_tree
)
4068 #ifndef ENABLE_TREE_CHECKING
4069 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
4072 extern bool tree_fits_uhwi_p (const_tree
)
4073 #ifndef ENABLE_TREE_CHECKING
4074 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
4077 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
4078 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
4079 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4080 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4081 tree_to_shwi (const_tree t
)
4083 gcc_assert (tree_fits_shwi_p (t
));
4084 return TREE_INT_CST_LOW (t
);
4087 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4088 tree_to_uhwi (const_tree t
)
4090 gcc_assert (tree_fits_uhwi_p (t
));
4091 return TREE_INT_CST_LOW (t
);
4094 extern int tree_int_cst_sgn (const_tree
);
4095 extern int tree_int_cst_sign_bit (const_tree
);
4096 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4097 extern tree
strip_array_types (tree
);
4098 extern tree
excess_precision_type (tree
);
4099 extern bool valid_constant_size_p (const_tree
);
4102 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4103 put the prototype here. Rtl.h does declare the prototype if
4104 tree.h had been included. */
4106 extern tree
make_tree (tree
, rtx
);
4108 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4111 Such modified types already made are recorded so that duplicates
4114 extern tree
build_type_attribute_variant (tree
, tree
);
4115 extern tree
build_decl_attribute_variant (tree
, tree
);
4116 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4118 extern bool attribute_value_equal (const_tree
, const_tree
);
4120 /* Return 0 if the attributes for two types are incompatible, 1 if they
4121 are compatible, and 2 if they are nearly compatible (which causes a
4122 warning to be generated). */
4123 extern int comp_type_attributes (const_tree
, const_tree
);
4125 /* Default versions of target-overridable functions. */
4126 extern tree
merge_decl_attributes (tree
, tree
);
4127 extern tree
merge_type_attributes (tree
, tree
);
4129 /* This function is a private implementation detail of lookup_attribute()
4130 and you should never call it directly. */
4131 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4133 /* This function is a private implementation detail
4134 of lookup_attribute_by_prefix() and you should never call it directly. */
4135 extern tree
private_lookup_attribute_by_prefix (const char *, size_t, tree
);
4137 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4138 return a pointer to the attribute's list element if the attribute
4139 is part of the list, or NULL_TREE if not found. If the attribute
4140 appears more than once, this only returns the first occurrence; the
4141 TREE_CHAIN of the return value should be passed back in if further
4142 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4146 lookup_attribute (const char *attr_name
, tree list
)
4148 gcc_checking_assert (attr_name
[0] != '_');
4149 /* In most cases, list is NULL_TREE. */
4150 if (list
== NULL_TREE
)
4153 /* Do the strlen() before calling the out-of-line implementation.
4154 In most cases attr_name is a string constant, and the compiler
4155 will optimize the strlen() away. */
4156 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4159 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4160 return a pointer to the attribute's list first element if the attribute
4161 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4165 lookup_attribute_by_prefix (const char *attr_name
, tree list
)
4167 gcc_checking_assert (attr_name
[0] != '_');
4168 /* In most cases, list is NULL_TREE. */
4169 if (list
== NULL_TREE
)
4172 return private_lookup_attribute_by_prefix (attr_name
, strlen (attr_name
),
4177 /* This function is a private implementation detail of
4178 is_attribute_p() and you should never call it directly. */
4179 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4181 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4182 if the identifier node is a valid attribute name for the string.
4183 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4184 be the identifier for 'text' or for '__text__'. */
4187 is_attribute_p (const char *attr_name
, const_tree ident
)
4189 gcc_checking_assert (attr_name
[0] != '_');
4190 /* Do the strlen() before calling the out-of-line implementation.
4191 In most cases attr_name is a string constant, and the compiler
4192 will optimize the strlen() away. */
4193 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4196 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4197 modified list. ATTR_NAME must be in the form 'text' (not
4200 extern tree
remove_attribute (const char *, tree
);
4202 /* Given two attributes lists, return a list of their union. */
4204 extern tree
merge_attributes (tree
, tree
);
4206 /* Given two Windows decl attributes lists, possibly including
4207 dllimport, return a list of their union . */
4208 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4210 /* Handle a "dllimport" or "dllexport" attribute. */
4211 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4213 /* Returns true iff unqualified CAND and BASE are equivalent. */
4215 extern bool check_base_type (const_tree cand
, const_tree base
);
4217 /* Check whether CAND is suitable to be returned from get_qualified_type
4218 (BASE, TYPE_QUALS). */
4220 extern bool check_qualified_type (const_tree
, const_tree
, int);
4222 /* Return a version of the TYPE, qualified as indicated by the
4223 TYPE_QUALS, if one exists. If no qualified version exists yet,
4224 return NULL_TREE. */
4226 extern tree
get_qualified_type (tree
, int);
4228 /* Like get_qualified_type, but creates the type if it does not
4229 exist. This function never returns NULL_TREE. */
4231 extern tree
build_qualified_type (tree
, int);
4233 /* Create a variant of type T with alignment ALIGN. */
4235 extern tree
build_aligned_type (tree
, unsigned int);
4237 /* Like build_qualified_type, but only deals with the `const' and
4238 `volatile' qualifiers. This interface is retained for backwards
4239 compatibility with the various front-ends; new code should use
4240 build_qualified_type instead. */
4242 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4243 build_qualified_type ((TYPE), \
4244 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4245 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4247 /* Make a copy of a type node. */
4249 extern tree
build_distinct_type_copy (tree
);
4250 extern tree
build_variant_type_copy (tree
);
4252 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4253 return a canonicalized ..._TYPE node, so that duplicates are not made.
4254 How the hash code is computed is up to the caller, as long as any two
4255 callers that could hash identical-looking type nodes agree. */
4257 extern tree
type_hash_canon (unsigned int, tree
);
4259 extern tree
convert (tree
, tree
);
4260 extern unsigned int expr_align (const_tree
);
4261 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4263 size_in_bytes (const_tree t
)
4265 return size_in_bytes_loc (input_location
, t
);
4268 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4269 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4270 extern tree
bit_position (const_tree
);
4271 extern tree
byte_position (const_tree
);
4272 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4274 /* Type for sizes of data-type. */
4276 #define sizetype sizetype_tab[(int) stk_sizetype]
4277 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4278 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4279 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4280 #define size_int(L) size_int_kind (L, stk_sizetype)
4281 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4282 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4283 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4285 /* Log2 of BITS_PER_UNIT. */
4287 #if BITS_PER_UNIT == 8
4288 #define LOG2_BITS_PER_UNIT 3
4289 #elif BITS_PER_UNIT == 16
4290 #define LOG2_BITS_PER_UNIT 4
4292 #error Unknown BITS_PER_UNIT
4295 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4296 by making the last node in X point to Y.
4297 Returns X, except if X is 0 returns Y. */
4299 extern tree
chainon (tree
, tree
);
4301 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4303 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4304 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4306 /* Return the last tree node in a chain. */
4308 extern tree
tree_last (tree
);
4310 /* Reverse the order of elements in a chain, and return the new head. */
4312 extern tree
nreverse (tree
);
4314 /* Returns the length of a chain of nodes
4315 (number of chain pointers to follow before reaching a null pointer). */
4317 extern int list_length (const_tree
);
4319 /* Returns the first FIELD_DECL in a type. */
4321 extern tree
first_field (const_tree
);
4323 /* Given an initializer INIT, return TRUE if INIT is zero or some
4324 aggregate of zeros. Otherwise return FALSE. */
4326 extern bool initializer_zerop (const_tree
);
4328 /* Given a vector VEC, return its first element if all elements are
4329 the same. Otherwise return NULL_TREE. */
4331 extern tree
uniform_vector_p (const_tree
);
4333 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4335 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4337 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4339 extern int zerop (const_tree
);
4341 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4343 extern int integer_zerop (const_tree
);
4345 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4347 extern int integer_onep (const_tree
);
4349 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4350 a vector or complex where each part is 1. */
4352 extern int integer_each_onep (const_tree
);
4354 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4355 all of whose significant bits are 1. */
4357 extern int integer_all_onesp (const_tree
);
4359 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4362 extern int integer_minus_onep (const_tree
);
4364 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4365 exactly one bit 1. */
4367 extern int integer_pow2p (const_tree
);
4369 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4370 with a nonzero value. */
4372 extern int integer_nonzerop (const_tree
);
4374 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4375 a vector where each element is an integer constant of value -1. */
4377 extern int integer_truep (const_tree
);
4379 extern bool cst_and_fits_in_hwi (const_tree
);
4380 extern tree
num_ending_zeros (const_tree
);
4382 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4385 extern int fixed_zerop (const_tree
);
4387 /* staticp (tree x) is nonzero if X is a reference to data allocated
4388 at a fixed address in memory. Returns the outermost data. */
4390 extern tree
staticp (tree
);
4392 /* save_expr (EXP) returns an expression equivalent to EXP
4393 but it can be used multiple times within context CTX
4394 and only evaluate EXP once. */
4396 extern tree
save_expr (tree
);
4398 /* Return true if T is function-invariant. */
4400 extern bool tree_invariant_p (tree
);
4402 /* Look inside EXPR into any simple arithmetic operations. Return the
4403 outermost non-arithmetic or non-invariant node. */
4405 extern tree
skip_simple_arithmetic (tree
);
4407 /* Look inside EXPR into simple arithmetic operations involving constants.
4408 Return the outermost non-arithmetic or non-constant node. */
4410 extern tree
skip_simple_constant_arithmetic (tree
);
4412 /* Return which tree structure is used by T. */
4414 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4416 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4417 size or offset that depends on a field within a record. */
4419 extern bool contains_placeholder_p (const_tree
);
4421 /* This macro calls the above function but short-circuits the common
4422 case of a constant to save time. Also check for null. */
4424 #define CONTAINS_PLACEHOLDER_P(EXP) \
4425 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4427 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4428 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4431 extern bool type_contains_placeholder_p (tree
);
4433 /* Given a tree EXP, find all occurrences of references to fields
4434 in a PLACEHOLDER_EXPR and place them in vector REFS without
4435 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4436 we assume here that EXP contains only arithmetic expressions
4437 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4440 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4442 /* This macro calls the above function but short-circuits the common
4443 case of a constant to save time and also checks for NULL. */
4445 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4447 if((EXP) && !TREE_CONSTANT (EXP)) \
4448 find_placeholder_in_expr (EXP, V); \
4451 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4452 return a tree with all occurrences of references to F in a
4453 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4454 CONST_DECLs. Note that we assume here that EXP contains only
4455 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4456 occurring only in their argument list. */
4458 extern tree
substitute_in_expr (tree
, tree
, tree
);
4460 /* This macro calls the above function but short-circuits the common
4461 case of a constant to save time and also checks for NULL. */
4463 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4464 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4466 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4467 for it within OBJ, a tree that is an object or a chain of references. */
4469 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4471 /* This macro calls the above function but short-circuits the common
4472 case of a constant to save time and also checks for NULL. */
4474 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4475 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4476 : substitute_placeholder_in_expr (EXP, OBJ))
4479 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4480 but it can be used multiple times
4481 and only evaluate the subexpressions once. */
4483 extern tree
stabilize_reference (tree
);
4485 /* Return EXP, stripped of any conversions to wider types
4486 in such a way that the result of converting to type FOR_TYPE
4487 is the same as if EXP were converted to FOR_TYPE.
4488 If FOR_TYPE is 0, it signifies EXP's type. */
4490 extern tree
get_unwidened (tree
, tree
);
4492 /* Return OP or a simpler expression for a narrower value
4493 which can be sign-extended or zero-extended to give back OP.
4494 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4495 or 0 if the value should be sign-extended. */
4497 extern tree
get_narrower (tree
, int *);
4499 /* Return true if T is an expression that get_inner_reference handles. */
4502 handled_component_p (const_tree t
)
4504 switch (TREE_CODE (t
))
4509 case ARRAY_RANGE_REF
:
4512 case VIEW_CONVERT_EXPR
:
4520 /* Return true T is a component with reverse storage order. */
4523 reverse_storage_order_for_component_p (tree t
)
4525 /* The storage order only applies to scalar components. */
4526 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4529 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4530 t
= TREE_OPERAND (t
, 0);
4532 switch (TREE_CODE (t
))
4536 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4537 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4538 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4539 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4543 return REF_REVERSE_STORAGE_ORDER (t
);
4545 case ARRAY_RANGE_REF
:
4546 case VIEW_CONVERT_EXPR
:
4554 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4555 that can modify the storage order of objects. Note that, even if the
4556 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4557 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4558 it can change the partition of the aggregate object into scalars. */
4561 storage_order_barrier_p (const_tree t
)
4563 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4566 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4567 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4570 tree op
= TREE_OPERAND (t
, 0);
4572 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4573 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4579 /* Given a DECL or TYPE, return the scope in which it was declared, or
4580 NUL_TREE if there is no containing scope. */
4582 extern tree
get_containing_scope (const_tree
);
4584 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4586 extern tree
decl_function_context (const_tree
);
4588 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4589 this _DECL with its context, or zero if none. */
4590 extern tree
decl_type_context (const_tree
);
4592 /* Return 1 if EXPR is the real constant zero. */
4593 extern int real_zerop (const_tree
);
4595 /* Initialize the iterator I with arguments from function FNDECL */
4598 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4600 i
->next
= TYPE_ARG_TYPES (fntype
);
4603 /* Return a pointer that holds the next argument if there are more arguments to
4604 handle, otherwise return NULL. */
4606 static inline tree
*
4607 function_args_iter_cond_ptr (function_args_iterator
*i
)
4609 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4612 /* Return the next argument if there are more arguments to handle, otherwise
4616 function_args_iter_cond (function_args_iterator
*i
)
4618 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4621 /* Advance to the next argument. */
4623 function_args_iter_next (function_args_iterator
*i
)
4625 gcc_assert (i
->next
!= NULL_TREE
);
4626 i
->next
= TREE_CHAIN (i
->next
);
4629 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4632 inlined_function_outer_scope_p (const_tree block
)
4634 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4637 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4638 to point to the next tree element. ITER is an instance of
4639 function_args_iterator used to iterate the arguments. */
4640 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4641 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4642 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4643 function_args_iter_next (&(ITER)))
4645 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4646 to the next tree element. ITER is an instance of function_args_iterator
4647 used to iterate the arguments. */
4648 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4649 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4650 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4651 function_args_iter_next (&(ITER)))
4654 extern unsigned crc32_string (unsigned, const char *);
4655 extern unsigned crc32_byte (unsigned, char);
4656 extern unsigned crc32_unsigned (unsigned, unsigned);
4657 extern void clean_symbol_name (char *);
4658 extern tree
get_file_function_name (const char *);
4659 extern tree
get_callee_fndecl (const_tree
);
4660 extern combined_fn
get_call_combined_fn (const_tree
);
4661 extern int type_num_arguments (const_tree
);
4662 extern bool associative_tree_code (enum tree_code
);
4663 extern bool commutative_tree_code (enum tree_code
);
4664 extern bool commutative_ternary_tree_code (enum tree_code
);
4665 extern bool operation_can_overflow (enum tree_code
);
4666 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
4667 extern tree
upper_bound_in_type (tree
, tree
);
4668 extern tree
lower_bound_in_type (tree
, tree
);
4669 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4670 extern tree
create_artificial_label (location_t
);
4671 extern const char *get_name (tree
);
4672 extern bool stdarg_p (const_tree
);
4673 extern bool prototype_p (const_tree
);
4674 extern bool is_typedef_decl (const_tree x
);
4675 extern bool typedef_variant_p (const_tree
);
4676 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4677 extern tree
build_low_bits_mask (tree
, unsigned);
4678 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4679 extern tree
tree_strip_nop_conversions (tree
);
4680 extern tree
tree_strip_sign_nop_conversions (tree
);
4681 extern const_tree
strip_invariant_refs (const_tree
);
4682 extern tree
lhd_gcc_personality (void);
4683 extern void assign_assembler_name_if_neeeded (tree
);
4684 extern void warn_deprecated_use (tree
, tree
);
4685 extern void cache_integer_cst (tree
);
4686 extern const char *combined_fn_name (combined_fn
);
4688 /* Compare and hash for any structure which begins with a canonical
4689 pointer. Assumes all pointers are interchangeable, which is sort
4690 of already assumed by gcc elsewhere IIRC. */
4693 struct_ptr_eq (const void *a
, const void *b
)
4695 const void * const * x
= (const void * const *) a
;
4696 const void * const * y
= (const void * const *) b
;
4700 static inline hashval_t
4701 struct_ptr_hash (const void *a
)
4703 const void * const * x
= (const void * const *) a
;
4704 return (intptr_t)*x
>> 4;
4707 /* Return nonzero if CODE is a tree code that represents a truth value. */
4709 truth_value_p (enum tree_code code
)
4711 return (TREE_CODE_CLASS (code
) == tcc_comparison
4712 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4713 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4714 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4717 /* Return whether TYPE is a type suitable for an offset for
4718 a POINTER_PLUS_EXPR. */
4720 ptrofftype_p (tree type
)
4722 return (INTEGRAL_TYPE_P (type
)
4723 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4724 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4727 /* Return true if the argument is a complete type or an array
4728 of unknown bound (whose type is incomplete but) whose elements
4729 have complete type. */
4731 complete_or_array_type_p (const_tree type
)
4733 return COMPLETE_TYPE_P (type
)
4734 || (TREE_CODE (type
) == ARRAY_TYPE
4735 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
4738 extern tree
strip_float_extensions (tree
);
4739 extern int really_constant_p (const_tree
);
4740 extern bool decl_address_invariant_p (const_tree
);
4741 extern bool decl_address_ip_invariant_p (const_tree
);
4742 extern bool int_fits_type_p (const_tree
, const_tree
);
4743 #ifndef GENERATOR_FILE
4744 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4746 extern bool variably_modified_type_p (tree
, tree
);
4747 extern int tree_log2 (const_tree
);
4748 extern int tree_floor_log2 (const_tree
);
4749 extern unsigned int tree_ctz (const_tree
);
4750 extern int simple_cst_equal (const_tree
, const_tree
);
4755 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
4759 /* Compat version until all callers are converted. Return hash for
4761 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4763 inchash::hash
hstate (seed
);
4764 inchash::add_expr (tree
, hstate
);
4765 return hstate
.end ();
4768 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4769 extern int type_list_equal (const_tree
, const_tree
);
4770 extern int chain_member (const_tree
, const_tree
);
4771 extern void dump_tree_statistics (void);
4772 extern void recompute_tree_invariant_for_addr_expr (tree
);
4773 extern bool needs_to_live_in_memory (const_tree
);
4774 extern tree
reconstruct_complex_type (tree
, tree
);
4775 extern int real_onep (const_tree
);
4776 extern int real_minus_onep (const_tree
);
4777 extern void init_ttree (void);
4778 extern void build_common_tree_nodes (bool);
4779 extern void build_common_builtin_nodes (void);
4780 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4781 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
4782 extern tree
build_range_type (tree
, tree
, tree
);
4783 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4784 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4785 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4786 extern tree
tree_block (tree
);
4787 extern void tree_set_block (tree
, tree
);
4788 extern location_t
*block_nonartificial_location (tree
);
4789 extern location_t
tree_nonartificial_location (tree
);
4790 extern tree
block_ultimate_origin (const_tree
);
4791 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4792 extern bool virtual_method_call_p (const_tree
);
4793 extern tree
obj_type_ref_class (const_tree ref
);
4794 extern bool types_same_for_odr (const_tree type1
, const_tree type2
,
4796 extern bool contains_bitfld_component_ref_p (const_tree
);
4797 extern bool block_may_fallthru (const_tree
);
4798 extern void using_eh_for_cleanups (void);
4799 extern bool using_eh_for_cleanups_p (void);
4800 extern const char *get_tree_code_name (enum tree_code
);
4801 extern void set_call_expr_flags (tree
, int);
4802 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
4804 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4806 #define walk_tree(a,b,c,d) \
4807 walk_tree_1 (a, b, c, d, NULL)
4808 #define walk_tree_without_duplicates(a,b,c) \
4809 walk_tree_without_duplicates_1 (a, b, c, NULL)
4811 extern tree
drop_tree_overflow (tree
);
4813 /* Given a memory reference expression T, return its base address.
4814 The base address of a memory reference expression is the main
4815 object being referenced. */
4816 extern tree
get_base_address (tree t
);
4818 /* Return a tree of sizetype representing the size, in bytes, of the element
4819 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4820 extern tree
array_ref_element_size (tree
);
4822 /* Return a tree representing the upper bound of the array mentioned in
4823 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4824 extern tree
array_ref_up_bound (tree
);
4826 /* Return a tree representing the lower bound of the array mentioned in
4827 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4828 extern tree
array_ref_low_bound (tree
);
4830 /* Returns true if REF is an array reference to an array at the end of
4831 a structure. If this is the case, the array may be allocated larger
4832 than its upper bound implies. */
4833 extern bool array_at_struct_end_p (tree
);
4835 /* Return a tree representing the offset, in bytes, of the field referenced
4836 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4837 extern tree
component_ref_field_offset (tree
);
4839 extern int tree_map_base_eq (const void *, const void *);
4840 extern unsigned int tree_map_base_hash (const void *);
4841 extern int tree_map_base_marked_p (const void *);
4842 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
4843 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
4844 bool trust_type_canonical
= true);
4845 extern bool type_with_interoperable_signedness (const_tree
);
4847 /* Return simplified tree code of type that is used for canonical type
4849 inline enum tree_code
4850 tree_code_for_canonical_type_merging (enum tree_code code
)
4852 /* By C standard, each enumerated type shall be compatible with char,
4853 a signed integer, or an unsigned integer. The choice of type is
4854 implementation defined (in our case it depends on -fshort-enum).
4856 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4857 type and compare only by their signedness and precision. */
4858 if (code
== ENUMERAL_TYPE
)
4859 return INTEGER_TYPE
;
4860 /* To allow inter-operability between languages having references and
4861 C, we consider reference types and pointers alike. Note that this is
4862 not strictly necessary for C-Fortran 2008 interoperability because
4863 Fortran define C_PTR type that needs to be compatible with C pointers
4864 and we handle this one as ptr_type_node. */
4865 if (code
== REFERENCE_TYPE
)
4866 return POINTER_TYPE
;
4870 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
4871 We don't define the types for pointers, arrays and vectors. The reason is
4872 that pointers are handled specially: ptr_type_node accesses conflict with
4873 accesses to all other pointers. This is done by alias.c.
4874 Because alias sets of arrays and vectors are the same as types of their
4875 elements, we can't compute canonical type either. Otherwise we could go
4876 form void *[10] to int *[10] (because they are equivalent for canonical type
4877 machinery) and get wrong TBAA. */
4880 canonical_type_used_p (const_tree t
)
4882 return !(POINTER_TYPE_P (t
)
4883 || TREE_CODE (t
) == ARRAY_TYPE
4884 || TREE_CODE (t
) == VECTOR_TYPE
);
4887 #define tree_map_eq tree_map_base_eq
4888 extern unsigned int tree_map_hash (const void *);
4889 #define tree_map_marked_p tree_map_base_marked_p
4891 #define tree_decl_map_eq tree_map_base_eq
4892 extern unsigned int tree_decl_map_hash (const void *);
4893 #define tree_decl_map_marked_p tree_map_base_marked_p
4895 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
4897 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
4899 equal (tree_decl_map
*a
, tree_decl_map
*b
)
4901 return tree_decl_map_eq (a
, b
);
4905 keep_cache_entry (tree_decl_map
*&m
)
4907 return ggc_marked_p (m
->base
.from
);
4911 #define tree_int_map_eq tree_map_base_eq
4912 #define tree_int_map_hash tree_map_base_hash
4913 #define tree_int_map_marked_p tree_map_base_marked_p
4915 #define tree_vec_map_eq tree_map_base_eq
4916 #define tree_vec_map_hash tree_decl_map_hash
4917 #define tree_vec_map_marked_p tree_map_base_marked_p
4919 /* Initialize the abstract argument list iterator object ITER with the
4920 arguments from CALL_EXPR node EXP. */
4922 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4925 iter
->n
= call_expr_nargs (exp
);
4930 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4933 iter
->n
= call_expr_nargs (exp
);
4937 /* Return the next argument from abstract argument list iterator object ITER,
4938 and advance its state. Return NULL_TREE if there are no more arguments. */
4940 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4943 if (iter
->i
>= iter
->n
)
4945 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4950 static inline const_tree
4951 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4954 if (iter
->i
>= iter
->n
)
4956 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4961 /* Initialize the abstract argument list iterator object ITER, then advance
4962 past and return the first argument. Useful in for expressions, e.g.
4963 for (arg = first_call_expr_arg (exp, &iter); arg;
4964 arg = next_call_expr_arg (&iter)) */
4966 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4968 init_call_expr_arg_iterator (exp
, iter
);
4969 return next_call_expr_arg (iter
);
4972 static inline const_tree
4973 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4975 init_const_call_expr_arg_iterator (exp
, iter
);
4976 return next_const_call_expr_arg (iter
);
4979 /* Test whether there are more arguments in abstract argument list iterator
4980 ITER, without changing its state. */
4982 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
4984 return (iter
->i
< iter
->n
);
4987 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4988 (of type call_expr_arg_iterator) to hold the iteration state. */
4989 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4990 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4991 (arg) = next_call_expr_arg (&(iter)))
4993 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4994 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4995 (arg) = next_const_call_expr_arg (&(iter)))
4997 /* Return true if tree node T is a language-specific node. */
4999 is_lang_specific (const_tree t
)
5001 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5004 /* Valid builtin number. */
5005 #define BUILTIN_VALID_P(FNCODE) \
5006 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5008 /* Return the tree node for an explicit standard builtin function or NULL. */
5010 builtin_decl_explicit (enum built_in_function fncode
)
5012 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5014 return builtin_info
[(size_t)fncode
].decl
;
5017 /* Return the tree node for an implicit builtin function or NULL. */
5019 builtin_decl_implicit (enum built_in_function fncode
)
5021 size_t uns_fncode
= (size_t)fncode
;
5022 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5024 if (!builtin_info
[uns_fncode
].implicit_p
)
5027 return builtin_info
[uns_fncode
].decl
;
5030 /* Set explicit builtin function nodes and whether it is an implicit
5034 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5036 size_t ufncode
= (size_t)fncode
;
5038 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5039 && (decl
!= NULL_TREE
|| !implicit_p
));
5041 builtin_info
[ufncode
].decl
= decl
;
5042 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5043 builtin_info
[ufncode
].declared_p
= false;
5046 /* Set the implicit flag for a builtin function. */
5049 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5051 size_t uns_fncode
= (size_t)fncode
;
5053 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5054 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5056 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5059 /* Set the declared flag for a builtin function. */
5062 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5064 size_t uns_fncode
= (size_t)fncode
;
5066 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5067 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5069 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5072 /* Return whether the standard builtin function can be used as an explicit
5076 builtin_decl_explicit_p (enum built_in_function fncode
)
5078 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5079 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5082 /* Return whether the standard builtin function can be used implicitly. */
5085 builtin_decl_implicit_p (enum built_in_function fncode
)
5087 size_t uns_fncode
= (size_t)fncode
;
5089 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5090 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5091 && builtin_info
[uns_fncode
].implicit_p
);
5094 /* Return whether the standard builtin function was declared. */
5097 builtin_decl_declared_p (enum built_in_function fncode
)
5099 size_t uns_fncode
= (size_t)fncode
;
5101 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5102 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5103 && builtin_info
[uns_fncode
].declared_p
);
5106 /* Return true if T (assumed to be a DECL) is a global variable.
5107 A variable is considered global if its storage is not automatic. */
5110 is_global_var (const_tree t
)
5112 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5115 /* Return true if VAR may be aliased. A variable is considered as
5116 maybe aliased if it has its address taken by the local TU
5117 or possibly by another TU and might be modified through a pointer. */
5120 may_be_aliased (const_tree var
)
5122 return (TREE_CODE (var
) != CONST_DECL
5123 && (TREE_PUBLIC (var
)
5124 || DECL_EXTERNAL (var
)
5125 || TREE_ADDRESSABLE (var
))
5126 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5127 && ((TREE_READONLY (var
)
5128 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5129 || (TREE_CODE (var
) == VAR_DECL
5130 && DECL_NONALIASED (var
)))));
5133 /* Return pointer to optimization flags of FNDECL. */
5134 static inline struct cl_optimization
*
5135 opts_for_fn (const_tree fndecl
)
5137 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5138 if (fn_opts
== NULL_TREE
)
5139 fn_opts
= optimization_default_node
;
5140 return TREE_OPTIMIZATION (fn_opts
);
5143 /* Return pointer to target flags of FNDECL. */
5144 static inline cl_target_option
*
5145 target_opts_for_fn (const_tree fndecl
)
5147 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5148 if (fn_opts
== NULL_TREE
)
5149 fn_opts
= target_option_default_node
;
5150 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5153 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5154 the optimization level of function fndecl. */
5155 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5157 /* For anonymous aggregate types, we need some sort of name to
5158 hold on to. In practice, this should not appear, but it should
5159 not be harmful if it does. */
5160 extern const char *anon_aggrname_format();
5161 extern bool anon_aggrname_p (const_tree
);
5163 /* The tree and const_tree overload templates. */
5167 struct int_traits
<const_tree
>
5169 static const enum precision_type precision_type
= VAR_PRECISION
;
5170 static const bool host_dependent_precision
= false;
5171 static const bool is_sign_extended
= false;
5172 static unsigned int get_precision (const_tree
);
5173 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
5178 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
5187 extended_tree (const_tree
);
5189 unsigned int get_precision () const;
5190 const HOST_WIDE_INT
*get_val () const;
5191 unsigned int get_len () const;
5195 struct int_traits
<extended_tree
<N
> >
5197 static const enum precision_type precision_type
= CONST_PRECISION
;
5198 static const bool host_dependent_precision
= false;
5199 static const bool is_sign_extended
= true;
5200 static const unsigned int precision
= N
;
5203 generic_wide_int
<extended_tree
<WIDE_INT_MAX_PRECISION
> >
5204 to_widest (const_tree
);
5206 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
5208 wide_int
to_wide (const_tree
, unsigned int);
5212 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
5214 return TYPE_PRECISION (TREE_TYPE (tcst
));
5217 /* Convert the tree_cst X into a wide_int of PRECISION. */
5218 inline wi::storage_ref
5219 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
5220 unsigned int precision
, const_tree x
)
5222 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
5226 inline generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
> >
5227 wi::to_widest (const_tree t
)
5232 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
5233 wi::to_offset (const_tree t
)
5238 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5239 truncating as necessary. When extending, use sign extension if T's
5240 type is signed and zero extension if T's type is unsigned. */
5243 wi::to_wide (const_tree t
, unsigned int prec
)
5245 return wide_int::from (t
, prec
, TYPE_SIGN (TREE_TYPE (t
)));
5249 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5252 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5257 wi::extended_tree
<N
>::get_precision () const
5263 inline const HOST_WIDE_INT
*
5264 wi::extended_tree
<N
>::get_val () const
5266 return &TREE_INT_CST_ELT (m_t
, 0);
5271 wi::extended_tree
<N
>::get_len () const
5273 if (N
== ADDR_MAX_PRECISION
)
5274 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5275 else if (N
>= WIDE_INT_MAX_PRECISION
)
5276 return TREE_INT_CST_EXT_NUNITS (m_t
);
5278 /* This class is designed to be used for specific output precisions
5279 and needs to be as fast as possible, so there is no fallback for
5286 template <typename T
>
5287 bool fits_to_tree_p (const T
&x
, const_tree
);
5289 wide_int
min_value (const_tree
);
5290 wide_int
max_value (const_tree
);
5291 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5294 template <typename T
>
5296 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5298 if (TYPE_SIGN (type
) == UNSIGNED
)
5299 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5301 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5304 /* Produce the smallest number that is represented in TYPE. The precision
5305 and sign are taken from TYPE. */
5307 wi::min_value (const_tree type
)
5309 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5312 /* Produce the largest number that is represented in TYPE. The precision
5313 and sign are taken from TYPE. */
5315 wi::max_value (const_tree type
)
5317 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5320 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5321 extending both according to their respective TYPE_SIGNs. */
5324 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5326 return wi::to_widest (t1
) < wi::to_widest (t2
);
5329 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5330 extending both according to their respective TYPE_SIGNs. */
5333 tree_int_cst_le (const_tree t1
, const_tree t2
)
5335 return wi::to_widest (t1
) <= wi::to_widest (t2
);
5338 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5339 are both INTEGER_CSTs and their values are extended according to their
5340 respective TYPE_SIGNs. */
5343 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5345 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5348 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5349 but none of these files are allowed to be included from front ends.
5350 They should be split in two. One suitable for the FEs, the other suitable
5353 /* Assign the RTX to declaration. */
5354 extern void set_decl_rtl (tree
, rtx
);
5355 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5357 /* Given an expression EXP that is a handled_component_p,
5358 look for the ultimate containing object, which is returned and specify
5359 the access position and size. */
5360 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5361 tree
*, machine_mode
*, int *, int *, int *);
5363 extern tree
build_personality_function (const char *);
5365 struct GTY(()) int_n_trees_t
{
5366 /* These parts are initialized at runtime */
5371 /* This is also in machmode.h */
5372 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5373 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5375 /* Like bit_position, but return as an integer. It must be representable in
5376 that way (since it could be a signed value, we don't have the
5377 option of returning -1 like int_size_in_byte can. */
5379 inline HOST_WIDE_INT
5380 int_bit_position (const_tree field
)
5382 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
5383 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5386 /* Return true if it makes sense to consider alias set for a type T. */
5389 type_with_alias_set_p (const_tree t
)
5391 /* Function and method types are never accessed as memory locations. */
5392 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5395 if (COMPLETE_TYPE_P (t
))
5398 /* Incomplete types can not be accessed in general except for arrays
5399 where we can fetch its element despite we have no array bounds. */
5400 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5406 extern location_t
set_block (location_t loc
, tree block
);
5408 extern void gt_ggc_mx (tree
&);
5409 extern void gt_pch_nx (tree
&);
5410 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5412 extern bool nonnull_arg_p (const_tree
);
5413 extern bool is_redundant_typedef (const_tree
);
5416 set_source_range (tree expr
, location_t start
, location_t finish
);
5419 set_source_range (tree expr
, source_range src_range
);
5421 static inline source_range
5422 get_decl_source_range (tree decl
)
5424 location_t loc
= DECL_SOURCE_LOCATION (decl
);
5425 return get_range_from_loc (line_table
, loc
);
5428 /* Return true if it makes sense to promote/demote from_type to to_type. */
5430 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
5432 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
5434 /* OK to promote if to_type is no bigger than word_mode. */
5435 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
5438 /* Otherwise, allow only if narrowing or same precision conversions. */
5439 return to_type_precision
<= TYPE_PRECISION (from_type
);
5442 #endif /* GCC_TREE_H */