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_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
238 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
240 #define NULL_TREE (tree) NULL
242 /* Define accessors for the fields that all tree nodes have
243 (though some fields are not used for all kinds of nodes). */
245 /* The tree-code says what kind of node it is.
246 Codes are defined in tree.def. */
247 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
248 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
250 /* When checking is enabled, errors will be generated if a tree node
251 is accessed incorrectly. The macros die with a fatal error. */
252 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
254 #define TREE_CHECK(T, CODE) \
255 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
257 #define TREE_NOT_CHECK(T, CODE) \
258 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
260 #define TREE_CHECK2(T, CODE1, CODE2) \
261 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
263 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
264 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
266 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
267 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
269 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
270 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
271 (CODE1), (CODE2), (CODE3)))
273 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
274 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
275 (CODE1), (CODE2), (CODE3), (CODE4)))
277 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
278 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
279 (CODE1), (CODE2), (CODE3), (CODE4)))
281 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
282 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
283 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
285 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
286 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
287 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
289 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
290 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
292 #define TREE_CLASS_CHECK(T, CLASS) \
293 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
295 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
296 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
298 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
299 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
301 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
302 (omp_clause_range_check ((T), (CODE1), (CODE2), \
303 __FILE__, __LINE__, __FUNCTION__))
305 /* These checks have to be special cased. */
306 #define EXPR_CHECK(T) \
307 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
309 /* These checks have to be special cased. */
310 #define NON_TYPE_CHECK(T) \
311 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
313 /* These checks have to be special cased. */
314 #define ANY_INTEGRAL_TYPE_CHECK(T) \
315 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
317 #define TREE_INT_CST_ELT_CHECK(T, I) \
318 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
320 #define TREE_VEC_ELT_CHECK(T, I) \
321 (*(CONST_CAST2 (tree *, typeof (T)*, \
322 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
324 #define OMP_CLAUSE_ELT_CHECK(T, I) \
325 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
327 /* Special checks for TREE_OPERANDs. */
328 #define TREE_OPERAND_CHECK(T, I) \
329 (*(CONST_CAST2 (tree*, typeof (T)*, \
330 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
332 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
333 (*(tree_operand_check_code ((T), (CODE), (I), \
334 __FILE__, __LINE__, __FUNCTION__)))
336 /* Nodes are chained together for many purposes.
337 Types are chained together to record them for being output to the debugger
338 (see the function `chain_type').
339 Decls in the same scope are chained together to record the contents
341 Statement nodes for successive statements used to be chained together.
342 Often lists of things are represented by TREE_LIST nodes that
343 are chained together. */
345 #define TREE_CHAIN(NODE) \
346 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
348 /* In all nodes that are expressions, this is the data type of the expression.
349 In POINTER_TYPE nodes, this is the type that the pointer points to.
350 In ARRAY_TYPE nodes, this is the type of the elements.
351 In VECTOR_TYPE nodes, this is the type of the elements. */
352 #define TREE_TYPE(NODE) \
353 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
355 extern void tree_contains_struct_check_failed (const_tree
,
356 const enum tree_node_structure_enum
,
357 const char *, int, const char *)
360 extern void tree_check_failed (const_tree
, const char *, int, const char *,
361 ...) ATTRIBUTE_NORETURN
;
362 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
363 ...) ATTRIBUTE_NORETURN
;
364 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
365 const char *, int, const char *)
367 extern void tree_range_check_failed (const_tree
, const char *, int,
368 const char *, enum tree_code
,
371 extern void tree_not_class_check_failed (const_tree
,
372 const enum tree_code_class
,
373 const char *, int, const char *)
375 extern void tree_int_cst_elt_check_failed (int, int, const char *,
378 extern void tree_vec_elt_check_failed (int, int, const char *,
381 extern void phi_node_elt_check_failed (int, int, const char *,
384 extern void tree_operand_check_failed (int, const_tree
,
385 const char *, int, const char *)
387 extern void omp_clause_check_failed (const_tree
, const char *, int,
388 const char *, enum omp_clause_code
)
390 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
393 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
394 const char *, enum omp_clause_code
,
395 enum omp_clause_code
)
398 #else /* not ENABLE_TREE_CHECKING, or not gcc */
400 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
401 #define TREE_CHECK(T, CODE) (T)
402 #define TREE_NOT_CHECK(T, CODE) (T)
403 #define TREE_CHECK2(T, CODE1, CODE2) (T)
404 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
405 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
406 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
407 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
408 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
409 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
410 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
411 #define TREE_CLASS_CHECK(T, CODE) (T)
412 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
413 #define EXPR_CHECK(T) (T)
414 #define NON_TYPE_CHECK(T) (T)
415 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
416 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
417 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
418 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
419 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
420 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
421 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
422 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
424 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
425 #define TREE_TYPE(NODE) ((NODE)->typed.type)
429 #define TREE_BLOCK(NODE) (tree_block (NODE))
430 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
432 #include "tree-check.h"
434 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
435 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
436 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
437 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
438 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
439 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
440 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
441 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
442 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
443 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
444 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
446 #define RECORD_OR_UNION_CHECK(T) \
447 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
448 #define NOT_RECORD_OR_UNION_CHECK(T) \
449 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
451 #define NUMERICAL_TYPE_CHECK(T) \
452 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
455 /* Here is how primitive or already-canonicalized types' hash codes
457 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
459 /* A simple hash function for an arbitrary tree node. This must not be
460 used in hash tables which are saved to a PCH. */
461 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
463 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
464 #define CONVERT_EXPR_CODE_P(CODE) \
465 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
467 /* Similarly, but accept an expression instead of a tree code. */
468 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
470 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
472 #define CASE_CONVERT \
476 /* Given an expression as a tree, strip any conversion that generates
477 no instruction. Accepts both tree and const_tree arguments since
478 we are not modifying the tree itself. */
480 #define STRIP_NOPS(EXP) \
481 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
483 /* Like STRIP_NOPS, but don't let the signedness change either. */
485 #define STRIP_SIGN_NOPS(EXP) \
486 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
488 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
490 #define STRIP_TYPE_NOPS(EXP) \
491 while ((CONVERT_EXPR_P (EXP) \
492 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
493 && TREE_OPERAND (EXP, 0) != error_mark_node \
494 && (TREE_TYPE (EXP) \
495 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
496 (EXP) = TREE_OPERAND (EXP, 0)
498 /* Remove unnecessary type conversions according to
499 tree_ssa_useless_type_conversion. */
501 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
502 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
504 /* Nonzero if TYPE represents a vector type. */
506 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
508 /* Nonzero if TYPE represents a vector of booleans. */
510 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
511 (TREE_CODE (TYPE) == VECTOR_TYPE \
512 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
514 /* Nonzero if TYPE represents an integral type. Note that we do not
515 include COMPLEX types here. Keep these checks in ascending code
518 #define INTEGRAL_TYPE_P(TYPE) \
519 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
520 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
521 || TREE_CODE (TYPE) == INTEGER_TYPE)
523 /* Nonzero if TYPE represents an integral type, including complex
524 and vector integer types. */
526 #define ANY_INTEGRAL_TYPE_P(TYPE) \
527 (INTEGRAL_TYPE_P (TYPE) \
528 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
529 || VECTOR_TYPE_P (TYPE)) \
530 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
532 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
534 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
535 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
537 /* Nonzero if TYPE represents a saturating fixed-point type. */
539 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
540 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
542 /* Nonzero if TYPE represents a fixed-point type. */
544 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
546 /* Nonzero if TYPE represents a scalar floating-point type. */
548 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
550 /* Nonzero if TYPE represents a complex floating-point type. */
552 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
553 (TREE_CODE (TYPE) == COMPLEX_TYPE \
554 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
556 /* Nonzero if TYPE represents a vector integer type. */
558 #define VECTOR_INTEGER_TYPE_P(TYPE) \
559 (VECTOR_TYPE_P (TYPE) \
560 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
563 /* Nonzero if TYPE represents a vector floating-point type. */
565 #define VECTOR_FLOAT_TYPE_P(TYPE) \
566 (VECTOR_TYPE_P (TYPE) \
567 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
569 /* Nonzero if TYPE represents a floating-point type, including complex
570 and vector floating-point types. The vector and complex check does
571 not use the previous two macros to enable early folding. */
573 #define FLOAT_TYPE_P(TYPE) \
574 (SCALAR_FLOAT_TYPE_P (TYPE) \
575 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
576 || VECTOR_TYPE_P (TYPE)) \
577 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
579 /* Nonzero if TYPE represents a decimal floating-point type. */
580 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
581 (SCALAR_FLOAT_TYPE_P (TYPE) \
582 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
584 /* Nonzero if TYPE is a record or union type. */
585 #define RECORD_OR_UNION_TYPE_P(TYPE) \
586 (TREE_CODE (TYPE) == RECORD_TYPE \
587 || TREE_CODE (TYPE) == UNION_TYPE \
588 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
590 /* Nonzero if TYPE represents an aggregate (multi-component) type.
591 Keep these checks in ascending code order. */
593 #define AGGREGATE_TYPE_P(TYPE) \
594 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
596 /* Nonzero if TYPE represents a pointer or reference type.
597 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
598 ascending code order. */
600 #define POINTER_TYPE_P(TYPE) \
601 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
603 /* Nonzero if TYPE represents a pointer to function. */
604 #define FUNCTION_POINTER_TYPE_P(TYPE) \
605 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
607 /* Nonzero if this type is a complete type. */
608 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
610 /* Nonzero if this type is a pointer bounds type. */
611 #define POINTER_BOUNDS_TYPE_P(NODE) \
612 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
614 /* Nonzero if this node has a pointer bounds type. */
615 #define POINTER_BOUNDS_P(NODE) \
616 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
618 /* Nonzero if this type supposes bounds existence. */
619 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
621 /* Nonzero for objects with bounded type. */
622 #define BOUNDED_P(node) \
623 BOUNDED_TYPE_P (TREE_TYPE (node))
625 /* Nonzero if this type is the (possibly qualified) void type. */
626 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
628 /* Nonzero if this type is complete or is cv void. */
629 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
630 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
632 /* Nonzero if this type is complete or is an array with unspecified bound. */
633 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
634 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
636 #define FUNC_OR_METHOD_TYPE_P(NODE) \
637 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
639 /* Define many boolean fields that all tree nodes have. */
641 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
642 of this is needed. So it cannot be in a register.
643 In a FUNCTION_DECL it has no meaning.
644 In LABEL_DECL nodes, it means a goto for this label has been seen
645 from a place outside all binding contours that restore stack levels.
646 In an artificial SSA_NAME that points to a stack partition with at least
647 two variables, it means that at least one variable has TREE_ADDRESSABLE.
648 In ..._TYPE nodes, it means that objects of this type must be fully
649 addressable. This means that pieces of this object cannot go into
650 register parameters, for example. If this a function type, this
651 means that the value must be returned in memory.
652 In CONSTRUCTOR nodes, it means object constructed must be in memory.
653 In IDENTIFIER_NODEs, this means that some extern decl for this name
654 had its address taken. That matters for inline functions.
655 In a STMT_EXPR, it means we want the result of the enclosed expression. */
656 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
658 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
659 exit of a function. Calls for which this is true are candidates for tail
660 call optimizations. */
661 #define CALL_EXPR_TAILCALL(NODE) \
662 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
664 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
665 optimization for correctness. */
666 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
667 (CALL_EXPR_CHECK (NODE)->base.static_flag)
669 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
670 CASE_LOW operand has been processed. */
671 #define CASE_LOW_SEEN(NODE) \
672 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
674 #define PREDICT_EXPR_OUTCOME(NODE) \
675 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
676 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
677 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
678 #define PREDICT_EXPR_PREDICTOR(NODE) \
679 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
681 /* In a VAR_DECL, nonzero means allocate static storage.
682 In a FUNCTION_DECL, nonzero if function has been defined.
683 In a CONSTRUCTOR, nonzero means allocate static storage. */
684 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
686 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
687 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
689 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
690 should only be executed if an exception is thrown, not on normal exit
692 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
694 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
695 separate cleanup in honor_protect_cleanup_actions. */
696 #define TRY_CATCH_IS_CLEANUP(NODE) \
697 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
699 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
700 CASE_HIGH operand has been processed. */
701 #define CASE_HIGH_SEEN(NODE) \
702 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
704 /* Used to mark scoped enums. */
705 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
707 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
708 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
710 /* In an expr node (usually a conversion) this means the node was made
711 implicitly and should not lead to any sort of warning. In a decl node,
712 warnings concerning the decl should be suppressed. This is used at
713 least for used-before-set warnings, and it set after one warning is
715 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
717 /* Used to indicate that this TYPE represents a compiler-generated entity. */
718 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
720 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
721 this string as an argument. */
722 #define TREE_SYMBOL_REFERENCED(NODE) \
723 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
725 /* Nonzero in a pointer or reference type means the data pointed to
726 by this type can alias anything. */
727 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
728 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
730 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
731 there was an overflow in folding. */
733 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
735 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
737 #define TREE_OVERFLOW_P(EXPR) \
738 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
740 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
741 nonzero means name is to be accessible from outside this translation unit.
742 In an IDENTIFIER_NODE, nonzero means an external declaration
743 accessible from outside this translation unit was previously seen
744 for this name in an inner scope. */
745 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
747 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
748 of cached values, or is something else. */
749 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
751 /* In a SAVE_EXPR, indicates that the original expression has already
752 been substituted with a VAR_DECL that contains the value. */
753 #define SAVE_EXPR_RESOLVED_P(NODE) \
754 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
756 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
758 #define CALL_EXPR_VA_ARG_PACK(NODE) \
759 (CALL_EXPR_CHECK (NODE)->base.public_flag)
761 /* In any expression, decl, or constant, nonzero means it has side effects or
762 reevaluation of the whole expression could produce a different value.
763 This is set if any subexpression is a function call, a side effect or a
764 reference to a volatile variable. In a ..._DECL, this is set only if the
765 declaration said `volatile'. This will never be set for a constant. */
766 #define TREE_SIDE_EFFECTS(NODE) \
767 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
769 /* In a LABEL_DECL, nonzero means this label had its address taken
770 and therefore can never be deleted and is a jump target for
772 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
774 /* Nonzero means this expression is volatile in the C sense:
775 its address should be of type `volatile WHATEVER *'.
776 In other words, the declared item is volatile qualified.
777 This is used in _DECL nodes and _REF nodes.
778 On a FUNCTION_DECL node, this means the function does not
779 return normally. This is the same effect as setting
780 the attribute noreturn on the function in C.
782 In a ..._TYPE node, means this type is volatile-qualified.
783 But use TYPE_VOLATILE instead of this macro when the node is a type,
784 because eventually we may make that a different bit.
786 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
787 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
789 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
790 accessing the memory pointed to won't generate a trap. However,
791 this only applies to an object when used appropriately: it doesn't
792 mean that writing a READONLY mem won't trap.
794 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
795 (or slice of the array) always belongs to the range of the array.
796 I.e. that the access will not trap, provided that the access to
797 the base to the array will not trap. */
798 #define TREE_THIS_NOTRAP(NODE) \
799 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
800 ARRAY_RANGE_REF)->base.nothrow_flag)
802 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
803 nonzero means it may not be the lhs of an assignment.
804 Nonzero in a FUNCTION_DECL means this function should be treated
805 as "const" function (can only read its arguments). */
806 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
808 /* Value of expression is constant. Always on in all ..._CST nodes. May
809 also appear in an expression or decl where the value is constant. */
810 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
812 /* Nonzero if NODE, a type, has had its sizes gimplified. */
813 #define TYPE_SIZES_GIMPLIFIED(NODE) \
814 (TYPE_CHECK (NODE)->base.constant_flag)
816 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
817 #define DECL_UNSIGNED(NODE) \
818 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
820 /* In integral and pointer types, means an unsigned type. */
821 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
823 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
824 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
826 /* True if overflow wraps around for the given integral type. That
827 is, TYPE_MAX + 1 == TYPE_MIN. */
828 #define TYPE_OVERFLOW_WRAPS(TYPE) \
829 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
831 /* True if overflow is undefined for the given integral type. We may
832 optimize on the assumption that values in the type never overflow.
834 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
835 must issue a warning based on warn_strict_overflow. In some cases
836 it will be appropriate to issue the warning immediately, and in
837 other cases it will be appropriate to simply set a flag and let the
838 caller decide whether a warning is appropriate or not. */
839 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
840 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
841 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
843 /* True if overflow for the given integral type should issue a
845 #define TYPE_OVERFLOW_TRAPS(TYPE) \
846 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
848 /* True if an overflow is to be preserved for sanitization. */
849 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
850 (INTEGRAL_TYPE_P (TYPE) \
851 && !TYPE_OVERFLOW_WRAPS (TYPE) \
852 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
854 /* True if pointer types have undefined overflow. */
855 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
857 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
858 Nonzero in a FUNCTION_DECL means that the function has been compiled.
859 This is interesting in an inline function, since it might not need
860 to be compiled separately.
861 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
862 or TYPE_DECL if the debugging info for the type has been written.
863 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
864 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
866 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
868 /* Nonzero in a _DECL if the name is used in its scope.
869 Nonzero in an expr node means inhibit warning if value is unused.
870 In IDENTIFIER_NODEs, this means that some extern decl for this name
872 In a BLOCK, this means that the block contains variables that are used. */
873 #define TREE_USED(NODE) ((NODE)->base.used_flag)
875 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
876 throw an exception. In a CALL_EXPR, nonzero means the call cannot
877 throw. We can't easily check the node type here as the C++
878 frontend also uses this flag (for AGGR_INIT_EXPR). */
879 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
881 /* In a CALL_EXPR, means that it's safe to use the target of the call
882 expansion as the return slot for a call that returns in memory. */
883 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
884 (CALL_EXPR_CHECK (NODE)->base.private_flag)
886 /* Cilk keywords accessors. */
887 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
889 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
890 passed by invisible reference (and the TREE_TYPE is a pointer to the true
892 #define DECL_BY_REFERENCE(NODE) \
893 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
894 RESULT_DECL)->decl_common.decl_by_reference_flag)
896 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
898 #define DECL_READ_P(NODE) \
899 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
901 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
902 attempting to share the stack slot with some other variable. */
903 #define DECL_NONSHAREABLE(NODE) \
904 (TREE_CHECK2 (NODE, VAR_DECL, \
905 RESULT_DECL)->decl_common.decl_nonshareable_flag)
907 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
908 thunked-to function. */
909 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
911 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
912 it has been built for the declaration of a variable-sized object. */
913 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
914 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
916 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
917 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
919 /* In a type, nonzero means that all objects of the type are guaranteed by the
920 language or front-end to be properly aligned, so we can indicate that a MEM
921 of this type is aligned at least to the alignment of the type, even if it
922 doesn't appear that it is. We see this, for example, in object-oriented
923 languages where a tag field may show this is an object of a more-aligned
924 variant of the more generic type. */
925 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_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 /* These flags are available for each language front end to use internally. */
971 #define TREE_LANG_FLAG_0(NODE) \
972 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
973 #define TREE_LANG_FLAG_1(NODE) \
974 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
975 #define TREE_LANG_FLAG_2(NODE) \
976 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
977 #define TREE_LANG_FLAG_3(NODE) \
978 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
979 #define TREE_LANG_FLAG_4(NODE) \
980 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
981 #define TREE_LANG_FLAG_5(NODE) \
982 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
983 #define TREE_LANG_FLAG_6(NODE) \
984 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
986 /* Define additional fields and accessors for nodes representing constants. */
988 #define TREE_INT_CST_NUNITS(NODE) \
989 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
990 #define TREE_INT_CST_EXT_NUNITS(NODE) \
991 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
992 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
993 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
994 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
995 #define TREE_INT_CST_LOW(NODE) \
996 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
998 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
999 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1001 #define TREE_FIXED_CST_PTR(NODE) \
1002 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1003 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1005 /* In a STRING_CST */
1006 /* In C terms, this is sizeof, not strlen. */
1007 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1008 #define TREE_STRING_POINTER(NODE) \
1009 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1011 /* In a COMPLEX_CST node. */
1012 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1013 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1015 /* In a VECTOR_CST node. */
1016 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1017 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1018 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1020 /* Define fields and accessors for some special-purpose tree nodes. */
1022 #define IDENTIFIER_LENGTH(NODE) \
1023 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1024 #define IDENTIFIER_POINTER(NODE) \
1025 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1026 #define IDENTIFIER_HASH_VALUE(NODE) \
1027 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1029 /* Translate a hash table identifier pointer to a tree_identifier
1030 pointer, and vice versa. */
1032 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1033 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1034 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1036 /* In a TREE_LIST node. */
1037 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1038 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1040 /* In a TREE_VEC node. */
1041 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1042 #define TREE_VEC_END(NODE) \
1043 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1045 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1047 /* In a CONSTRUCTOR node. */
1048 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1049 #define CONSTRUCTOR_ELT(NODE,IDX) \
1050 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1051 #define CONSTRUCTOR_NELTS(NODE) \
1052 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1053 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1054 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1056 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1057 value of each element (stored within VAL). IX must be a scratch variable
1058 of unsigned integer type. */
1059 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1060 for (IX = 0; (IX >= vec_safe_length (V)) \
1062 : ((VAL = (*(V))[IX].value), \
1066 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1067 the value of each element (stored within VAL) and its index (stored
1068 within INDEX). IX must be a scratch variable of unsigned integer type. */
1069 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1070 for (IX = 0; (IX >= vec_safe_length (V)) \
1072 : (((void) (VAL = (*V)[IX].value)), \
1073 (INDEX = (*V)[IX].index), \
1077 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1078 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1080 constructor_elt _ce___ = {INDEX, VALUE}; \
1081 vec_safe_push ((V), _ce___); \
1084 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1085 constructor output purposes. */
1086 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1087 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1089 /* True if NODE is a clobber right hand side, an expression of indeterminate
1090 value that clobbers the LHS in a copy instruction. We use a volatile
1091 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1092 In particular the volatile flag causes us to not prematurely remove
1093 such clobber instructions. */
1094 #define TREE_CLOBBER_P(NODE) \
1095 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1097 /* Define fields and accessors for some nodes that represent expressions. */
1099 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1100 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1101 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1102 && integer_zerop (TREE_OPERAND (NODE, 0)))
1104 /* In ordinary expression nodes. */
1105 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1106 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1108 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1109 length. Its value includes the length operand itself; that is,
1110 the minimum valid length is 1.
1111 Note that we have to bypass the use of TREE_OPERAND to access
1112 that field to avoid infinite recursion in expanding the macros. */
1113 #define VL_EXP_OPERAND_LENGTH(NODE) \
1114 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1116 /* Nonzero if is_gimple_debug() may possibly hold. */
1117 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1119 /* In a LOOP_EXPR node. */
1120 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1122 /* The source location of this expression. Non-tree_exp nodes such as
1123 decls and constants can be shared among multiple locations, so
1125 #define EXPR_LOCATION(NODE) \
1126 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1127 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1128 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1129 != UNKNOWN_LOCATION)
1130 /* The location to be used in a diagnostic about this expression. Do not
1131 use this macro if the location will be assigned to other expressions. */
1132 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1133 ? (NODE)->exp.locus : (LOCUS))
1134 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1135 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1137 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1138 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1140 #define EXPR_HAS_RANGE(NODE) \
1141 (CAN_HAVE_RANGE_P (NODE) \
1142 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1145 /* True if a tree is an expression or statement that can have a
1147 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1149 static inline source_range
1150 get_expr_source_range (tree expr
)
1152 location_t loc
= EXPR_LOCATION (expr
);
1153 return get_range_from_loc (line_table
, loc
);
1156 extern void protected_set_expr_location (tree
, location_t
);
1158 /* In a TARGET_EXPR node. */
1159 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1160 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1161 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1163 /* DECL_EXPR accessor. This gives access to the DECL associated with
1164 the given declaration statement. */
1165 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1167 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1169 /* COMPOUND_LITERAL_EXPR accessors. */
1170 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1171 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1172 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1173 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1175 /* SWITCH_EXPR accessors. These give access to the condition, body and
1176 original condition type (before any compiler conversions)
1177 of the switch statement, respectively. */
1178 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1179 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1180 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1182 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1183 of a case label, respectively. */
1184 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1185 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1186 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1187 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1189 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1190 corresponding MEM_REF operands. */
1191 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1192 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1193 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1194 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1195 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1197 #define MR_DEPENDENCE_CLIQUE(NODE) \
1198 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1199 #define MR_DEPENDENCE_BASE(NODE) \
1200 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1202 /* The operands of a BIND_EXPR. */
1203 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1204 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1205 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1207 /* GOTO_EXPR accessor. This gives access to the label associated with
1208 a goto statement. */
1209 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1211 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1212 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1213 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1215 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1216 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1217 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1218 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1219 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1220 /* Nonzero if we want to create an ASM_INPUT instead of an
1221 ASM_OPERAND with no operands. */
1222 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1223 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1225 /* COND_EXPR accessors. */
1226 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1227 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1228 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1230 /* Accessors for the chains of recurrences. */
1231 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1232 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1233 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1234 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1236 /* LABEL_EXPR accessor. This gives access to the label associated with
1237 the given label expression. */
1238 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1240 /* CATCH_EXPR accessors. */
1241 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1242 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1244 /* EH_FILTER_EXPR accessors. */
1245 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1246 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1248 /* OBJ_TYPE_REF accessors. */
1249 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1250 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1251 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1253 /* ASSERT_EXPR accessors. */
1254 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1255 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1257 /* CALL_EXPR accessors. */
1258 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1259 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1260 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1261 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1262 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1264 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1265 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1266 the argument count is zero when checking is enabled. Instead, do
1267 the pointer arithmetic to advance past the 3 fixed operands in a
1268 CALL_EXPR. That produces a valid pointer to just past the end of the
1269 operand array, even if it's not valid to dereference it. */
1270 #define CALL_EXPR_ARGP(NODE) \
1271 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1273 /* TM directives and accessors. */
1274 #define TRANSACTION_EXPR_BODY(NODE) \
1275 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1276 #define TRANSACTION_EXPR_OUTER(NODE) \
1277 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1278 #define TRANSACTION_EXPR_RELAXED(NODE) \
1279 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1281 /* OpenMP and OpenACC directive and clause accessors. */
1283 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1285 #define OMP_BODY(NODE) \
1286 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1287 #define OMP_CLAUSES(NODE) \
1288 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1290 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1291 #define OMP_STANDALONE_CLAUSES(NODE) \
1292 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1294 #define OACC_DATA_BODY(NODE) \
1295 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1296 #define OACC_DATA_CLAUSES(NODE) \
1297 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1299 #define OACC_HOST_DATA_BODY(NODE) \
1300 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1301 #define OACC_HOST_DATA_CLAUSES(NODE) \
1302 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1304 #define OACC_CACHE_CLAUSES(NODE) \
1305 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1307 #define OACC_DECLARE_CLAUSES(NODE) \
1308 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1310 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1311 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1313 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1314 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1316 #define OACC_UPDATE_CLAUSES(NODE) \
1317 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1319 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1320 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1322 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1323 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1325 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1326 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1327 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1329 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1330 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1331 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1332 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1333 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1334 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1335 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1336 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1338 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1339 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1341 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1343 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1344 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1346 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1348 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1350 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1351 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1353 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1354 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1355 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1357 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1358 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1360 #define OMP_TARGET_DATA_BODY(NODE) \
1361 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1362 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1363 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1365 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1366 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1368 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1369 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1371 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1372 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1374 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1375 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1377 #define OMP_CLAUSE_SIZE(NODE) \
1378 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1380 OMP_CLAUSE__CACHE_), 1)
1382 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1383 #define OMP_CLAUSE_DECL(NODE) \
1384 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1385 OMP_CLAUSE_PRIVATE, \
1386 OMP_CLAUSE__LOOPTEMP_), 0)
1387 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1388 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1389 != UNKNOWN_LOCATION)
1390 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1392 /* True on an OMP_SECTION statement that was the last lexical member.
1393 This status is meaningful in the implementation of lastprivate. */
1394 #define OMP_SECTION_LAST(NODE) \
1395 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1397 /* True on an OMP_PARALLEL statement if it represents an explicit
1398 combined parallel work-sharing constructs. */
1399 #define OMP_PARALLEL_COMBINED(NODE) \
1400 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1402 /* True on an OMP_TEAMS statement if it represents an explicit
1403 combined teams distribute constructs. */
1404 #define OMP_TEAMS_COMBINED(NODE) \
1405 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1407 /* True on an OMP_TARGET statement if it represents explicit
1408 combined target teams, target parallel or target simd constructs. */
1409 #define OMP_TARGET_COMBINED(NODE) \
1410 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1412 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1413 as opposed to relaxed. */
1414 #define OMP_ATOMIC_SEQ_CST(NODE) \
1415 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1416 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1418 /* True on a PRIVATE clause if its decl is kept around for debugging
1419 information only and its DECL_VALUE_EXPR is supposed to point
1420 to what it has been remapped to. */
1421 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1422 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1424 /* True on a PRIVATE clause if ctor needs access to outer region's
1426 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1427 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1429 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1430 (thus should be private on the outer taskloop and firstprivate on
1432 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1433 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1435 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1436 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1437 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1439 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1440 decl is present in the chain. */
1441 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1442 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1443 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1444 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1445 OMP_CLAUSE_LASTPRIVATE),\
1447 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1448 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1450 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1451 (thus should be lastprivate on the outer taskloop and firstprivate on
1453 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1454 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1456 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1457 decl is present in the chain (this can happen only for taskloop
1458 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1459 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1460 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1462 /* True on a SHARED clause if a scalar is not modified in the body and
1463 thus could be optimized as firstprivate. */
1464 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1465 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1467 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1468 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1470 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1471 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1472 #define OMP_CLAUSE_IF_EXPR(NODE) \
1473 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1474 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1475 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1476 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1477 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1478 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1479 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1480 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1481 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1483 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1484 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1486 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1487 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1489 /* OpenACC clause expressions */
1490 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1491 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1492 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1493 OMP_CLAUSE_OPERAND ( \
1494 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1495 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1496 OMP_CLAUSE_OPERAND ( \
1497 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1498 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1499 OMP_CLAUSE_OPERAND ( \
1500 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1501 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1502 OMP_CLAUSE_OPERAND ( \
1503 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1504 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1505 OMP_CLAUSE_OPERAND ( \
1506 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1507 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1508 OMP_CLAUSE_OPERAND ( \
1509 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1510 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1511 OMP_CLAUSE_OPERAND ( \
1512 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1513 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1514 OMP_CLAUSE_OPERAND ( \
1515 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1516 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1517 OMP_CLAUSE_OPERAND ( \
1518 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1520 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1521 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1523 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1524 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1526 #define OMP_CLAUSE_MAP_KIND(NODE) \
1527 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1528 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1529 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1530 = (unsigned int) (MAP_KIND))
1532 /* Nonzero if this map clause is for array (rather than pointer) based array
1533 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1534 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1535 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1536 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1537 /* Nonzero if this is a mapped array section, that might need special
1538 treatment if OMP_CLAUSE_SIZE is zero. */
1539 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1540 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1541 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1542 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1543 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1545 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1546 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1548 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1549 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1550 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1551 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1552 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1553 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1555 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1556 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1558 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1559 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1560 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1561 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1562 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1563 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1564 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1565 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1566 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1567 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1568 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1569 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1570 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1571 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1573 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1574 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1575 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1576 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1578 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1579 are always initialized inside of the loop construct, false otherwise. */
1580 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1581 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1583 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1584 are declared inside of the simd construct. */
1585 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1586 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1588 /* True if a LINEAR clause has a stride that is variable. */
1589 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1590 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1592 /* True if a LINEAR clause is for an array or allocatable variable that
1593 needs special handling by the frontend. */
1594 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1595 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1597 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1598 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1600 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1601 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1603 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1604 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1606 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1607 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1609 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1610 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1612 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1613 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1615 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1616 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1617 OMP_CLAUSE_THREAD_LIMIT), 0)
1619 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1620 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1622 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1623 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1624 OMP_CLAUSE_DIST_SCHEDULE), 0)
1626 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1627 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1629 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1630 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1632 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1633 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1635 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1636 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1638 /* True if a SCHEDULE clause has the simd modifier on it. */
1639 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1640 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1642 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1643 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1645 #define OMP_CLAUSE_TILE_LIST(NODE) \
1646 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1648 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1649 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1650 ->omp_clause.subcode.dimension)
1651 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1652 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1653 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1654 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1656 /* SSA_NAME accessors. */
1658 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1659 if there is no name associated with it. */
1660 #define SSA_NAME_IDENTIFIER(NODE) \
1661 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1662 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1663 ? (NODE)->ssa_name.var \
1664 : DECL_NAME ((NODE)->ssa_name.var)) \
1667 /* Returns the variable being referenced. This can be NULL_TREE for
1668 temporaries not associated with any user variable.
1669 Once released, this is the only field that can be relied upon. */
1670 #define SSA_NAME_VAR(NODE) \
1671 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1672 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1673 ? NULL_TREE : (NODE)->ssa_name.var)
1675 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1676 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1678 /* Returns the statement which defines this SSA name. */
1679 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1681 /* Returns the SSA version number of this SSA name. Note that in
1682 tree SSA, version numbers are not per variable and may be recycled. */
1683 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1685 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1686 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1688 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1689 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1691 /* Nonzero if this SSA_NAME expression is currently on the free list of
1692 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1693 has no meaning for an SSA_NAME. */
1694 #define SSA_NAME_IN_FREE_LIST(NODE) \
1695 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1697 /* Nonzero if this SSA_NAME is the default definition for the
1698 underlying symbol. A default SSA name is created for symbol S if
1699 the very first reference to S in the function is a read operation.
1700 Default definitions are always created by an empty statement and
1701 belong to no basic block. */
1702 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1703 SSA_NAME_CHECK (NODE)->base.default_def_flag
1705 /* Attributes for SSA_NAMEs for pointer-type variables. */
1706 #define SSA_NAME_PTR_INFO(N) \
1707 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1709 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1710 #define SSA_NAME_ANTI_RANGE_P(N) \
1711 SSA_NAME_CHECK (N)->base.static_flag
1713 /* The type of range described by SSA_NAME_RANGE_INFO. */
1714 #define SSA_NAME_RANGE_TYPE(N) \
1715 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1717 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1718 #define SSA_NAME_RANGE_INFO(N) \
1719 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1721 /* Return the immediate_use information for an SSA_NAME. */
1722 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1724 #define OMP_CLAUSE_CODE(NODE) \
1725 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1727 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1728 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1730 #define OMP_CLAUSE_OPERAND(NODE, I) \
1731 OMP_CLAUSE_ELT_CHECK (NODE, I)
1733 /* In a BLOCK node. */
1734 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1735 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1736 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1737 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1738 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1739 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1740 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1741 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1742 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1743 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1744 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1745 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1747 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1748 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1750 /* An index number for this block. These values are not guaranteed to
1751 be unique across functions -- whether or not they are depends on
1752 the debugging output format in use. */
1753 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1755 /* If block reordering splits a lexical block into discontiguous
1756 address ranges, we'll make a copy of the original block.
1758 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1759 In that case, we have one source block that has been replicated
1760 (through inlining or unrolling) into many logical blocks, and that
1761 these logical blocks have different physical variables in them.
1763 In this case, we have one logical block split into several
1764 non-contiguous address ranges. Most debug formats can't actually
1765 represent this idea directly, so we fake it by creating multiple
1766 logical blocks with the same variables in them. However, for those
1767 that do support non-contiguous regions, these allow the original
1768 logical block to be reconstructed, along with the set of address
1771 One of the logical block fragments is arbitrarily chosen to be
1772 the ORIGIN. The other fragments will point to the origin via
1773 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1774 be null. The list of fragments will be chained through
1775 BLOCK_FRAGMENT_CHAIN from the origin. */
1777 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1778 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1780 /* For an inlined function, this gives the location where it was called
1781 from. This is only set in the top level block, which corresponds to the
1782 inlined function scope. This is used in the debug output routines. */
1784 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1786 /* This gives the location of the end of the block, useful to attach
1787 code implicitly generated for outgoing paths. */
1789 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1791 /* Define fields and accessors for nodes representing data types. */
1793 /* See tree.def for documentation of the use of these fields.
1794 Look at the documentation of the various ..._TYPE tree codes.
1796 Note that the type.values, type.minval, and type.maxval fields are
1797 overloaded and used for different macros in different kinds of types.
1798 Each macro must check to ensure the tree node is of the proper kind of
1799 type. Note also that some of the front-ends also overload these fields,
1800 so they must be checked as well. */
1802 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1803 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1804 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1805 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1806 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1807 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1808 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1809 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1810 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1811 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1813 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1814 #define TYPE_MODE(NODE) \
1815 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1816 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1817 #define SET_TYPE_MODE(NODE, MODE) \
1818 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1820 extern machine_mode
element_mode (const_tree t
);
1822 /* The "canonical" type for this type node, which is used by frontends to
1823 compare the type for equality with another type. If two types are
1824 equal (based on the semantics of the language), then they will have
1825 equivalent TYPE_CANONICAL entries.
1827 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1828 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1829 be used for comparison against other types. Instead, the type is
1830 said to require structural equality checks, described in
1831 TYPE_STRUCTURAL_EQUALITY_P.
1833 For unqualified aggregate and function types the middle-end relies on
1834 TYPE_CANONICAL to tell whether two variables can be assigned
1835 to each other without a conversion. The middle-end also makes sure
1836 to assign the same alias-sets to the type partition with equal
1837 TYPE_CANONICAL of their unqualified variants. */
1838 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1839 /* Indicates that the type node requires structural equality
1840 checks. The compiler will need to look at the composition of the
1841 type to determine whether it is equal to another type, rather than
1842 just comparing canonical type pointers. For instance, we would need
1843 to look at the return and parameter types of a FUNCTION_TYPE
1845 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1846 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1847 type node requires structural equality. */
1848 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1850 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1851 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1853 /* The (language-specific) typed-based alias set for this type.
1854 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1855 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1856 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1857 type can alias objects of any type. */
1858 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1860 /* Nonzero iff the typed-based alias set for this type has been
1862 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1863 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1865 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1867 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1869 /* The alignment necessary for objects of this type.
1870 The value is an int, measured in bits and must be a power of two.
1871 We support also an "alignement" of zero. */
1872 #define TYPE_ALIGN(NODE) \
1873 (TYPE_CHECK (NODE)->type_common.align \
1874 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
1876 /* Specify that TYPE_ALIGN(NODE) is X. */
1877 #define SET_TYPE_ALIGN(NODE, X) \
1878 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
1880 /* 1 if the alignment for this type was requested by "aligned" attribute,
1881 0 if it is the default for this type. */
1882 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1884 /* The alignment for NODE, in bytes. */
1885 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1887 /* If your language allows you to declare types, and you want debug info
1888 for them, then you need to generate corresponding TYPE_DECL nodes.
1889 These "stub" TYPE_DECL nodes have no name, and simply point at the
1890 type node. You then set the TYPE_STUB_DECL field of the type node
1891 to point back at the TYPE_DECL node. This allows the debug routines
1892 to know that the two nodes represent the same type, so that we only
1893 get one debug info record for them. */
1894 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1896 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1897 the type has BLKmode only because it lacks the alignment required for
1899 #define TYPE_NO_FORCE_BLK(NODE) \
1900 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1902 /* Nonzero in a type considered volatile as a whole. */
1903 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1905 /* Nonzero in a type considered atomic as a whole. */
1906 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1908 /* Means this type is const-qualified. */
1909 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1911 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1913 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1915 /* If nonzero, type's name shouldn't be emitted into debug info. */
1916 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1918 /* The address space the type is in. */
1919 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1921 /* Encode/decode the named memory support as part of the qualifier. If more
1922 than 8 qualifiers are added, these macros need to be adjusted. */
1923 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1924 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1926 /* Return all qualifiers except for the address space qualifiers. */
1927 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1929 /* Only keep the address space out of the qualifiers and discard the other
1931 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1933 /* The set of type qualifiers for this type. */
1934 #define TYPE_QUALS(NODE) \
1935 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1936 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1937 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1938 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1939 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1941 /* The same as TYPE_QUALS without the address space qualifications. */
1942 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1943 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1944 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1945 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1946 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1948 /* The same as TYPE_QUALS without the address space and atomic
1950 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1951 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1952 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1953 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1955 /* These flags are available for each language front end to use internally. */
1956 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1957 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1958 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1959 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1960 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1961 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1962 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1964 /* Used to keep track of visited nodes in tree traversals. This is set to
1965 0 by copy_node and make_node. */
1966 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1968 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1969 that distinguish string from array of char).
1970 If set in a INTEGER_TYPE, indicates a character type. */
1971 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1973 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1974 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1975 (((unsigned HOST_WIDE_INT) 1) \
1976 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1978 /* Set precision to n when we have 2^n sub-parts of the vector. */
1979 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1980 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1982 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1983 about missing conversions to other vector types of the same size. */
1984 #define TYPE_VECTOR_OPAQUE(NODE) \
1985 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1987 /* Indicates that objects of this type must be initialized by calling a
1988 function when they are created. */
1989 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1990 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1992 /* Indicates that a UNION_TYPE object should be passed the same way that
1993 the first union alternative would be passed, or that a RECORD_TYPE
1994 object should be passed the same way that the first (and only) member
1996 #define TYPE_TRANSPARENT_AGGR(NODE) \
1997 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1999 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2000 address of a component of the type. This is the counterpart of
2001 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2002 #define TYPE_NONALIASED_COMPONENT(NODE) \
2003 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2005 /* Indicated that objects of this type should be laid out in as
2006 compact a way as possible. */
2007 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2009 /* Used by type_contains_placeholder_p to avoid recomputation.
2010 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2011 this field directly. */
2012 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2013 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2015 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2016 #define TYPE_FINAL_P(NODE) \
2017 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2019 /* The debug output functions use the symtab union field to store
2020 information specific to the debugging format. The different debug
2021 output hooks store different types in the union field. These three
2022 macros are used to access different fields in the union. The debug
2023 hooks are responsible for consistently using only a specific
2026 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2027 hold the type's number in the generated stabs. */
2028 #define TYPE_SYMTAB_ADDRESS(NODE) \
2029 (TYPE_CHECK (NODE)->type_common.symtab.address)
2031 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2032 hold struct/union type tag names. */
2033 #define TYPE_SYMTAB_POINTER(NODE) \
2034 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2036 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2037 in dwarf2out.c to point to the DIE generated for the type. */
2038 #define TYPE_SYMTAB_DIE(NODE) \
2039 (TYPE_CHECK (NODE)->type_common.symtab.die)
2041 /* The garbage collector needs to know the interpretation of the
2042 symtab field. These constants represent the different types in the
2045 #define TYPE_SYMTAB_IS_ADDRESS (0)
2046 #define TYPE_SYMTAB_IS_POINTER (1)
2047 #define TYPE_SYMTAB_IS_DIE (2)
2049 #define TYPE_LANG_SPECIFIC(NODE) \
2050 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2052 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2053 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2054 #define TYPE_FIELDS(NODE) \
2055 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2056 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2057 #define TYPE_ARG_TYPES(NODE) \
2058 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2059 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2061 #define TYPE_METHODS(NODE) \
2062 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2063 #define TYPE_VFIELD(NODE) \
2064 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2065 #define TYPE_METHOD_BASETYPE(NODE) \
2066 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2067 #define TYPE_OFFSET_BASETYPE(NODE) \
2068 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2069 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2070 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2071 #define TYPE_NEXT_PTR_TO(NODE) \
2072 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2073 #define TYPE_NEXT_REF_TO(NODE) \
2074 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2075 #define TYPE_MIN_VALUE(NODE) \
2076 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2077 #define TYPE_MAX_VALUE(NODE) \
2078 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2080 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2081 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2083 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2084 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2086 /* For record and union types, information about this type, as a base type
2088 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2090 /* For non record and union types, used in a language-dependent way. */
2091 #define TYPE_LANG_SLOT_1(NODE) \
2092 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2094 /* Define accessor macros for information about type inheritance
2097 A "basetype" means a particular usage of a data type for inheritance
2098 in another type. Each such basetype usage has its own "binfo"
2099 object to describe it. The binfo object is a TREE_VEC node.
2101 Inheritance is represented by the binfo nodes allocated for a
2102 given type. For example, given types C and D, such that D is
2103 inherited by C, 3 binfo nodes will be allocated: one for describing
2104 the binfo properties of C, similarly one for D, and one for
2105 describing the binfo properties of D as a base type for C.
2106 Thus, given a pointer to class C, one can get a pointer to the binfo
2107 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2109 /* BINFO specific flags. */
2111 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2112 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2114 /* Flags for language dependent use. */
2115 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2116 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2117 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2118 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2119 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2120 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2121 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2123 /* The actual data type node being inherited in this basetype. */
2124 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2126 /* The offset where this basetype appears in its containing type.
2127 BINFO_OFFSET slot holds the offset (in bytes)
2128 from the base of the complete object to the base of the part of the
2129 object that is allocated on behalf of this `type'.
2130 This is always 0 except when there is multiple inheritance. */
2132 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2133 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2135 /* The virtual function table belonging to this basetype. Virtual
2136 function tables provide a mechanism for run-time method dispatching.
2137 The entries of a virtual function table are language-dependent. */
2139 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2141 /* The virtual functions in the virtual function table. This is
2142 a TREE_LIST that is used as an initial approximation for building
2143 a virtual function table for this basetype. */
2144 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2146 /* A vector of binfos for the direct basetypes inherited by this
2149 If this basetype describes type D as inherited in C, and if the
2150 basetypes of D are E and F, then this vector contains binfos for
2151 inheritance of E and F by C. */
2152 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2154 /* The number of basetypes for NODE. */
2155 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2157 /* Accessor macro to get to the Nth base binfo of this binfo. */
2158 #define BINFO_BASE_BINFO(NODE,N) \
2159 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2160 #define BINFO_BASE_ITERATE(NODE,N,B) \
2161 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2162 #define BINFO_BASE_APPEND(NODE,T) \
2163 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2165 /* For a BINFO record describing a virtual base class, i.e., one where
2166 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2167 base. The actual contents are language-dependent. In the C++
2168 front-end this field is an INTEGER_CST giving an offset into the
2169 vtable where the offset to the virtual base can be found. */
2170 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2172 /* Indicates the accesses this binfo has to its bases. The values are
2173 access_public_node, access_protected_node or access_private_node.
2174 If this array is not present, public access is implied. */
2175 #define BINFO_BASE_ACCESSES(NODE) \
2176 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2178 #define BINFO_BASE_ACCESS(NODE,N) \
2179 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2180 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2181 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2183 /* The index in the VTT where this subobject's sub-VTT can be found.
2184 NULL_TREE if there is no sub-VTT. */
2185 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2187 /* The index in the VTT where the vptr for this subobject can be
2188 found. NULL_TREE if there is no secondary vptr in the VTT. */
2189 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2191 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2192 inheriting this base for non-virtual bases. For virtual bases it
2193 points either to the binfo for which this is a primary binfo, or to
2194 the binfo of the most derived type. */
2195 #define BINFO_INHERITANCE_CHAIN(NODE) \
2196 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2199 /* Define fields and accessors for nodes representing declared names. */
2201 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2202 have an associated SSA name. */
2203 #define SSA_VAR_P(DECL) \
2204 (TREE_CODE (DECL) == VAR_DECL \
2205 || TREE_CODE (DECL) == PARM_DECL \
2206 || TREE_CODE (DECL) == RESULT_DECL \
2207 || TREE_CODE (DECL) == SSA_NAME)
2210 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2212 /* This is the name of the object as written by the user.
2213 It is an IDENTIFIER_NODE. */
2214 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2216 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2217 #define TYPE_IDENTIFIER(NODE) \
2218 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2219 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2221 /* Every ..._DECL node gets a unique number. */
2222 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2224 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2226 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2228 /* Every ..._DECL node gets a unique number that stays the same even
2229 when the decl is copied by the inliner once it is set. */
2230 #define DECL_PT_UID(NODE) \
2231 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2232 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2233 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2234 #define SET_DECL_PT_UID(NODE, UID) \
2235 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2236 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2237 be preserved when copyin the decl. */
2238 #define DECL_PT_UID_SET_P(NODE) \
2239 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2241 /* These two fields describe where in the source code the declaration
2242 was. If the declaration appears in several places (as for a C
2243 function that is declared first and then defined later), this
2244 information should refer to the definition. */
2245 #define DECL_SOURCE_LOCATION(NODE) \
2246 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2247 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2248 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2249 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2250 /* This accessor returns TRUE if the decl it operates on was created
2251 by a front-end or back-end rather than by user code. In this case
2252 builtin-ness is indicated by source location. */
2253 #define DECL_IS_BUILTIN(DECL) \
2254 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2256 #define DECL_LOCATION_RANGE(NODE) \
2257 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE)))
2259 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2260 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2261 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2262 nodes, this points to either the FUNCTION_DECL for the containing
2263 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2264 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2265 scope". In particular, for VAR_DECLs which are virtual table pointers
2266 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2268 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2269 #define DECL_FIELD_CONTEXT(NODE) \
2270 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2272 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2273 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2275 /* For any sort of a ..._DECL node, this points to the original (abstract)
2276 decl node which this decl is an inlined/cloned instance of, or else it
2277 is NULL indicating that this decl is not an instance of some other decl.
2279 The C front-end also uses this in a nested declaration of an inline
2280 function, to point back to the definition. */
2281 #define DECL_ABSTRACT_ORIGIN(NODE) \
2282 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2284 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2285 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2286 #define DECL_ORIGIN(NODE) \
2287 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2289 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2290 inline instance of some original (abstract) decl from an inline function;
2291 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2292 nodes can also have their abstract origin set to themselves. */
2293 #define DECL_FROM_INLINE(NODE) \
2294 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2295 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2297 /* In a DECL this is the field where attributes are stored. */
2298 #define DECL_ATTRIBUTES(NODE) \
2299 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2301 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2302 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2303 For a VAR_DECL, holds the initial value.
2304 For a PARM_DECL, used for DECL_ARG_TYPE--default
2305 values for parameters are encoded in the type of the function,
2306 not in the PARM_DECL slot.
2307 For a FIELD_DECL, this is used for enumeration values and the C
2308 frontend uses it for temporarily storing bitwidth of bitfields.
2310 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2311 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2313 /* Holds the size of the datum, in bits, as a tree expression.
2314 Need not be constant. */
2315 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2316 /* Likewise for the size in bytes. */
2317 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2318 /* Returns the alignment required for the datum, in bits. It must
2319 be a power of two, but an "alignment" of zero is supported
2320 (e.g. as "uninitialized" sentinel). */
2321 #define DECL_ALIGN(NODE) \
2322 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2323 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2324 /* Specify that DECL_ALIGN(NODE) is X. */
2325 #define SET_DECL_ALIGN(NODE, X) \
2326 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2328 /* The alignment of NODE, in bytes. */
2329 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2330 /* Set if the alignment of this DECL has been set by the user, for
2331 example with an 'aligned' attribute. */
2332 #define DECL_USER_ALIGN(NODE) \
2333 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2334 /* Holds the machine mode corresponding to the declaration of a variable or
2335 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2337 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2339 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2340 operation it is. Note, however, that this field is overloaded, with
2341 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2342 checked before any access to the former. */
2343 #define DECL_FUNCTION_CODE(NODE) \
2344 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2346 #define DECL_FUNCTION_PERSONALITY(NODE) \
2347 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2349 /* Nonzero for a given ..._DECL node means that the name of this node should
2350 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2351 the associated type should be ignored. For a FUNCTION_DECL, the body of
2352 the function should also be ignored. */
2353 #define DECL_IGNORED_P(NODE) \
2354 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2356 /* Nonzero for a given ..._DECL node means that this node represents an
2357 "abstract instance" of the given declaration (e.g. in the original
2358 declaration of an inline function). When generating symbolic debugging
2359 information, we mustn't try to generate any address information for nodes
2360 marked as "abstract instances" because we don't actually generate
2361 any code or allocate any data space for such instances. */
2362 #define DECL_ABSTRACT_P(NODE) \
2363 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2365 /* Language-specific decl information. */
2366 #define DECL_LANG_SPECIFIC(NODE) \
2367 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2369 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2370 do not allocate storage, and refer to a definition elsewhere. Note that
2371 this does not necessarily imply the entity represented by NODE
2372 has no program source-level definition in this translation unit. For
2373 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2374 DECL_EXTERNAL may be true simultaneously; that can be the case for
2375 a C99 "extern inline" function. */
2376 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2378 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2379 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2381 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2383 Also set in some languages for variables, etc., outside the normal
2384 lexical scope, such as class instance variables. */
2385 #define DECL_NONLOCAL(NODE) \
2386 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2388 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2389 Used in FIELD_DECLs for vtable pointers.
2390 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2391 #define DECL_VIRTUAL_P(NODE) \
2392 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2394 /* Used to indicate that this DECL represents a compiler-generated entity. */
2395 #define DECL_ARTIFICIAL(NODE) \
2396 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2398 /* Additional flags for language-specific uses. */
2399 #define DECL_LANG_FLAG_0(NODE) \
2400 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2401 #define DECL_LANG_FLAG_1(NODE) \
2402 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2403 #define DECL_LANG_FLAG_2(NODE) \
2404 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2405 #define DECL_LANG_FLAG_3(NODE) \
2406 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2407 #define DECL_LANG_FLAG_4(NODE) \
2408 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2409 #define DECL_LANG_FLAG_5(NODE) \
2410 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2411 #define DECL_LANG_FLAG_6(NODE) \
2412 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2413 #define DECL_LANG_FLAG_7(NODE) \
2414 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2415 #define DECL_LANG_FLAG_8(NODE) \
2416 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2418 /* Nonzero for a scope which is equal to file scope. */
2419 #define SCOPE_FILE_SCOPE_P(EXP) \
2420 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2421 /* Nonzero for a decl which is at file scope. */
2422 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2423 /* Nonzero for a type which is at file scope. */
2424 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2426 /* Nonzero for a decl that is decorated using attribute used.
2427 This indicates to compiler tools that this decl needs to be preserved. */
2428 #define DECL_PRESERVE_P(DECL) \
2429 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2431 /* For function local variables of COMPLEX and VECTOR types,
2432 indicates that the variable is not aliased, and that all
2433 modifications to the variable have been adjusted so that
2434 they are killing assignments. Thus the variable may now
2435 be treated as a GIMPLE register, and use real instead of
2436 virtual ops in SSA form. */
2437 #define DECL_GIMPLE_REG_P(DECL) \
2438 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2440 extern tree
decl_value_expr_lookup (tree
);
2441 extern void decl_value_expr_insert (tree
, tree
);
2443 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2444 if transformations have made this more complicated than evaluating the
2445 decl itself. This should only be used for debugging; once this field has
2446 been set, the decl itself may not legitimately appear in the function. */
2447 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2448 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2449 ->decl_common.decl_flag_2)
2450 #define DECL_VALUE_EXPR(NODE) \
2451 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2452 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2453 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2455 /* Holds the RTL expression for the value of a variable or function.
2456 This value can be evaluated lazily for functions, variables with
2457 static storage duration, and labels. */
2458 #define DECL_RTL(NODE) \
2459 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2460 ? (NODE)->decl_with_rtl.rtl \
2461 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2463 /* Set the DECL_RTL for NODE to RTL. */
2464 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2466 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2467 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2469 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2470 #define DECL_RTL_SET_P(NODE) \
2471 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2473 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2474 NODE1, it will not be set for NODE2; this is a lazy copy. */
2475 #define COPY_DECL_RTL(NODE1, NODE2) \
2476 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2477 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2479 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2480 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2482 #if (GCC_VERSION >= 2007)
2483 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2484 ({ tree const __d = (decl); \
2485 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2486 /* Dereference it so the compiler knows it can't be NULL even \
2487 without assertion checking. */ \
2488 &*DECL_RTL_IF_SET (__d); })
2490 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2493 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2494 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2496 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2497 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2498 of the structure. */
2499 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2501 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2502 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2503 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2504 natural alignment of the field's type). */
2505 #define DECL_FIELD_BIT_OFFSET(NODE) \
2506 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2508 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2509 if so, the type that was originally specified for it.
2510 TREE_TYPE may have been modified (in finish_struct). */
2511 #define DECL_BIT_FIELD_TYPE(NODE) \
2512 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2514 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2515 representative FIELD_DECL. */
2516 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2517 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2519 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2520 if nonzero, indicates that the field occupies the type. */
2521 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2523 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2524 DECL_FIELD_OFFSET which are known to be always zero.
2525 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2527 #define DECL_OFFSET_ALIGN(NODE) \
2528 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2530 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2531 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2532 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2534 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2535 which this FIELD_DECL is defined. This information is needed when
2536 writing debugging information about vfield and vbase decls for C++. */
2537 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2539 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2540 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2542 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2544 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2546 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2547 this component. This makes it possible for Type-Based Alias Analysis
2548 to disambiguate accesses to this field with indirect accesses using
2551 struct S { int i; } s;
2554 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2556 From the implementation's viewpoint, the alias set of the type of the
2557 field 'i' (int) will not be recorded as a subset of that of the type of
2558 's' (struct S) in record_component_aliases. The counterpart is that
2559 accesses to s.i must not be given the alias set of the type of 'i'
2560 (int) but instead directly that of the type of 's' (struct S). */
2561 #define DECL_NONADDRESSABLE_P(NODE) \
2562 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2564 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2565 dense, unique within any one function, and may be used to index arrays.
2566 If the value is -1, then no UID has been assigned. */
2567 #define LABEL_DECL_UID(NODE) \
2568 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2570 /* In a LABEL_DECL, the EH region number for which the label is the
2571 post_landing_pad. */
2572 #define EH_LANDING_PAD_NR(NODE) \
2573 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2575 /* For a PARM_DECL, records the data type used to pass the argument,
2576 which may be different from the type seen in the program. */
2577 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2579 /* For PARM_DECL, holds an RTL for the stack slot or register
2580 where the data was actually passed. */
2581 #define DECL_INCOMING_RTL(NODE) \
2582 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2584 /* Nonzero for a given ..._DECL node means that no warnings should be
2585 generated just because this node is unused. */
2586 #define DECL_IN_SYSTEM_HEADER(NODE) \
2587 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2589 /* Used to indicate that the linkage status of this DECL is not yet known,
2590 so it should not be output now. */
2591 #define DECL_DEFER_OUTPUT(NODE) \
2592 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2594 /* In a VAR_DECL that's static,
2595 nonzero if the space is in the text section. */
2596 #define DECL_IN_TEXT_SECTION(NODE) \
2597 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2599 /* In a VAR_DECL that's static,
2600 nonzero if it belongs to the global constant pool. */
2601 #define DECL_IN_CONSTANT_POOL(NODE) \
2602 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2604 /* Nonzero for a given ..._DECL node means that this node should be
2605 put in .common, if possible. If a DECL_INITIAL is given, and it
2606 is not error_mark_node, then the decl cannot be put in .common. */
2607 #define DECL_COMMON(NODE) \
2608 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2610 /* In a VAR_DECL, nonzero if the decl is a register variable with
2611 an explicit asm specification. */
2612 #define DECL_HARD_REGISTER(NODE) \
2613 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2615 /* Used to indicate that this DECL has weak linkage. */
2616 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2618 /* Used to indicate that the DECL is a dllimport. */
2619 #define DECL_DLLIMPORT_P(NODE) \
2620 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2622 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2623 not be put out unless it is needed in this translation unit.
2624 Entities like this are shared across translation units (like weak
2625 entities), but are guaranteed to be generated by any translation
2626 unit that needs them, and therefore need not be put out anywhere
2627 where they are not needed. DECL_COMDAT is just a hint to the
2628 back-end; it is up to front-ends which set this flag to ensure
2629 that there will never be any harm, other than bloat, in putting out
2630 something which is DECL_COMDAT. */
2631 #define DECL_COMDAT(NODE) \
2632 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2634 #define DECL_COMDAT_GROUP(NODE) \
2635 decl_comdat_group (NODE)
2637 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2638 multiple translation units should be merged. */
2639 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2640 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2642 /* The name of the object as the assembler will see it (but before any
2643 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2644 as DECL_NAME. It is an IDENTIFIER_NODE.
2646 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2647 One Definition Rule based type merging at LTO. It is computed only for
2648 LTO compilation and C++. */
2649 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2651 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2652 This is true of all DECL nodes except FIELD_DECL. */
2653 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2654 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2656 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2657 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2659 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2660 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2661 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2663 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2664 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2665 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2667 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2668 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2669 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2670 semantics of using this macro, are different than saying:
2672 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2674 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2676 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2677 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2678 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2679 DECL_ASSEMBLER_NAME (DECL1)) \
2682 /* Records the section name in a section attribute. Used to pass
2683 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2684 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2686 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2687 this variable in a BIND_EXPR. */
2688 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2689 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2691 /* Value of the decls's visibility attribute */
2692 #define DECL_VISIBILITY(NODE) \
2693 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2695 /* Nonzero means that the decl had its visibility specified rather than
2697 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2698 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2700 /* In a VAR_DECL, the model to use if the data should be allocated from
2701 thread-local storage. */
2702 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2704 /* In a VAR_DECL, nonzero if the data should be allocated from
2705 thread-local storage. */
2706 #define DECL_THREAD_LOCAL_P(NODE) \
2707 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2709 /* In a non-local VAR_DECL with static storage duration, true if the
2710 variable has an initialization priority. If false, the variable
2711 will be initialized at the DEFAULT_INIT_PRIORITY. */
2712 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2713 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2715 extern tree
decl_debug_expr_lookup (tree
);
2716 extern void decl_debug_expr_insert (tree
, tree
);
2718 /* For VAR_DECL, this is set to an expression that it was split from. */
2719 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2720 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2721 #define DECL_DEBUG_EXPR(NODE) \
2722 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2724 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2725 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2727 extern priority_type
decl_init_priority_lookup (tree
);
2728 extern priority_type
decl_fini_priority_lookup (tree
);
2729 extern void decl_init_priority_insert (tree
, priority_type
);
2730 extern void decl_fini_priority_insert (tree
, priority_type
);
2732 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2734 #define DECL_INIT_PRIORITY(NODE) \
2735 (decl_init_priority_lookup (NODE))
2736 /* Set the initialization priority for NODE to VAL. */
2737 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2738 (decl_init_priority_insert (NODE, VAL))
2740 /* For a FUNCTION_DECL the finalization priority of NODE. */
2741 #define DECL_FINI_PRIORITY(NODE) \
2742 (decl_fini_priority_lookup (NODE))
2743 /* Set the finalization priority for NODE to VAL. */
2744 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2745 (decl_fini_priority_insert (NODE, VAL))
2747 /* The initialization priority for entities for which no explicit
2748 initialization priority has been specified. */
2749 #define DEFAULT_INIT_PRIORITY 65535
2751 /* The maximum allowed initialization priority. */
2752 #define MAX_INIT_PRIORITY 65535
2754 /* The largest priority value reserved for use by system runtime
2756 #define MAX_RESERVED_INIT_PRIORITY 100
2758 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2759 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2760 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2762 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2763 #define DECL_NONLOCAL_FRAME(NODE) \
2764 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2766 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2767 #define DECL_NONALIASED(NODE) \
2768 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2770 /* This field is used to reference anything in decl.result and is meant only
2771 for use by the garbage collector. */
2772 #define DECL_RESULT_FLD(NODE) \
2773 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2775 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2776 Before the struct containing the FUNCTION_DECL is laid out,
2777 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2778 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2779 function. When the class is laid out, this pointer is changed
2780 to an INTEGER_CST node which is suitable for use as an index
2781 into the virtual function table. */
2782 #define DECL_VINDEX(NODE) \
2783 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2785 /* In FUNCTION_DECL, holds the decl for the return value. */
2786 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2788 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2789 #define DECL_UNINLINABLE(NODE) \
2790 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2792 /* In a FUNCTION_DECL, the saved representation of the body of the
2794 #define DECL_SAVED_TREE(NODE) \
2795 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2797 /* Nonzero in a FUNCTION_DECL means this function should be treated
2798 as if it were a malloc, meaning it returns a pointer that is
2800 #define DECL_IS_MALLOC(NODE) \
2801 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2803 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2804 C++ operator new, meaning that it returns a pointer for which we
2805 should not use type based aliasing. */
2806 #define DECL_IS_OPERATOR_NEW(NODE) \
2807 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2809 /* Nonzero in a FUNCTION_DECL means this function may return more
2811 #define DECL_IS_RETURNS_TWICE(NODE) \
2812 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2814 /* Nonzero in a FUNCTION_DECL means this function should be treated
2815 as "pure" function (like const function, but may read global memory). */
2816 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2818 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2819 the const or pure function may not terminate. When this is nonzero
2820 for a const or pure function, it can be dealt with by cse passes
2821 but cannot be removed by dce passes since you are not allowed to
2822 change an infinite looping program into one that terminates without
2824 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2825 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2827 /* Nonzero in a FUNCTION_DECL means this function should be treated
2828 as "novops" function (function that does not read global memory,
2829 but may have arbitrary side effects). */
2830 #define DECL_IS_NOVOPS(NODE) \
2831 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2833 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2834 at the beginning or end of execution. */
2835 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2836 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2838 #define DECL_STATIC_DESTRUCTOR(NODE) \
2839 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2841 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2842 be instrumented with calls to support routines. */
2843 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2844 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2846 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2847 disabled in this function. */
2848 #define DECL_NO_LIMIT_STACK(NODE) \
2849 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2851 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2852 #define DECL_STATIC_CHAIN(NODE) \
2853 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2855 /* Nonzero for a decl that cgraph has decided should be inlined into
2856 at least one call site. It is not meaningful to look at this
2857 directly; always use cgraph_function_possibly_inlined_p. */
2858 #define DECL_POSSIBLY_INLINED(DECL) \
2859 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2861 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2862 such as via the `inline' keyword in C/C++. This flag controls the linkage
2863 semantics of 'inline' */
2864 #define DECL_DECLARED_INLINE_P(NODE) \
2865 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2867 /* Nonzero in a FUNCTION_DECL means this function should not get
2868 -Winline warnings. */
2869 #define DECL_NO_INLINE_WARNING_P(NODE) \
2870 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2872 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2873 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2874 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2876 /* Nonzero if a FUNCTION_CODE is a TM load. */
2877 #define BUILTIN_TM_LOAD_P(FN) \
2878 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2880 /* Nonzero if a FUNCTION_CODE is a TM store. */
2881 #define BUILTIN_TM_STORE_P(FN) \
2882 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2884 #define CASE_BUILT_IN_TM_LOAD(FN) \
2885 case BUILT_IN_TM_LOAD_##FN: \
2886 case BUILT_IN_TM_LOAD_RAR_##FN: \
2887 case BUILT_IN_TM_LOAD_RAW_##FN: \
2888 case BUILT_IN_TM_LOAD_RFW_##FN
2890 #define CASE_BUILT_IN_TM_STORE(FN) \
2891 case BUILT_IN_TM_STORE_##FN: \
2892 case BUILT_IN_TM_STORE_WAR_##FN: \
2893 case BUILT_IN_TM_STORE_WAW_##FN
2895 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2896 disregarding size and cost heuristics. This is equivalent to using
2897 the always_inline attribute without the required diagnostics if the
2898 function cannot be inlined. */
2899 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2900 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2902 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2903 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2905 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2906 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2907 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2909 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2910 that describes the status of this function. */
2911 #define DECL_STRUCT_FUNCTION(NODE) \
2912 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2914 /* In a FUNCTION_DECL, nonzero means a built in function of a
2915 standard library or more generally a built in function that is
2916 recognized by optimizers and expanders.
2918 Note that it is different from the DECL_IS_BUILTIN accessor. For
2919 instance, user declared prototypes of C library functions are not
2920 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2921 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2923 /* For a builtin function, identify which part of the compiler defined it. */
2924 #define DECL_BUILT_IN_CLASS(NODE) \
2925 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2927 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2928 #define DECL_ARGUMENTS(NODE) \
2929 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2931 /* In FUNCTION_DECL, the function specific target options to use when compiling
2933 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2934 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2936 /* In FUNCTION_DECL, the function specific optimization options to use when
2937 compiling this function. */
2938 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2939 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2941 /* In FUNCTION_DECL, this is set if this function has other versions generated
2942 using "target" attributes. The default version is the one which does not
2943 have any "target" attribute set. */
2944 #define DECL_FUNCTION_VERSIONED(NODE)\
2945 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2947 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2948 Devirtualization machinery uses this knowledge for determing type of the
2949 object constructed. Also we assume that constructor address is not
2951 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2952 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2954 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2955 Devirtualization machinery uses this to track types in destruction. */
2956 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2957 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2959 /* In FUNCTION_DECL that represent an virtual method this is set when
2960 the method is final. */
2961 #define DECL_FINAL_P(NODE)\
2962 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2964 /* The source language of the translation-unit. */
2965 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2966 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2968 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2970 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2971 #define DECL_ORIGINAL_TYPE(NODE) \
2972 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2974 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2975 into stabs. Instead it will generate cross reference ('x') of names.
2976 This uses the same flag as DECL_EXTERNAL. */
2977 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2978 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2980 /* Getter of the imported declaration associated to the
2981 IMPORTED_DECL node. */
2982 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2983 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2985 /* Getter of the symbol declaration associated with the
2986 NAMELIST_DECL node. */
2987 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2988 (DECL_INITIAL (NODE))
2990 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2991 To reduce overhead, the nodes containing the statements are not trees.
2992 This avoids the overhead of tree_common on all linked list elements.
2994 Use the interface in tree-iterator.h to access this node. */
2996 #define STATEMENT_LIST_HEAD(NODE) \
2997 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2998 #define STATEMENT_LIST_TAIL(NODE) \
2999 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3001 #define TREE_OPTIMIZATION(NODE) \
3002 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3004 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3005 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3007 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3008 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3010 /* Return a tree node that encapsulates the optimization options in OPTS. */
3011 extern tree
build_optimization_node (struct gcc_options
*opts
);
3013 #define TREE_TARGET_OPTION(NODE) \
3014 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3016 #define TREE_TARGET_GLOBALS(NODE) \
3017 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3019 /* Return a tree node that encapsulates the target options in OPTS. */
3020 extern tree
build_target_option_node (struct gcc_options
*opts
);
3022 extern void prepare_target_option_nodes_for_pch (void);
3024 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3027 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3029 if (TREE_CODE (__t
) != __c
)
3030 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3035 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3038 if (TREE_CODE (__t
) == __c
)
3039 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3044 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3045 enum tree_code __c1
, enum tree_code __c2
)
3047 if (TREE_CODE (__t
) != __c1
3048 && TREE_CODE (__t
) != __c2
)
3049 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3054 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3055 enum tree_code __c1
, enum tree_code __c2
)
3057 if (TREE_CODE (__t
) == __c1
3058 || TREE_CODE (__t
) == __c2
)
3059 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3064 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3065 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3067 if (TREE_CODE (__t
) != __c1
3068 && TREE_CODE (__t
) != __c2
3069 && TREE_CODE (__t
) != __c3
)
3070 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3075 tree_not_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_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3086 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3087 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3088 enum tree_code __c4
)
3090 if (TREE_CODE (__t
) != __c1
3091 && TREE_CODE (__t
) != __c2
3092 && TREE_CODE (__t
) != __c3
3093 && TREE_CODE (__t
) != __c4
)
3094 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3099 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3100 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3101 enum tree_code __c4
)
3103 if (TREE_CODE (__t
) == __c1
3104 || TREE_CODE (__t
) == __c2
3105 || TREE_CODE (__t
) == __c3
3106 || TREE_CODE (__t
) == __c4
)
3107 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3112 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3113 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3114 enum tree_code __c4
, enum tree_code __c5
)
3116 if (TREE_CODE (__t
) != __c1
3117 && TREE_CODE (__t
) != __c2
3118 && TREE_CODE (__t
) != __c3
3119 && TREE_CODE (__t
) != __c4
3120 && TREE_CODE (__t
) != __c5
)
3121 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3126 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3127 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3128 enum tree_code __c4
, enum tree_code __c5
)
3130 if (TREE_CODE (__t
) == __c1
3131 || TREE_CODE (__t
) == __c2
3132 || TREE_CODE (__t
) == __c3
3133 || TREE_CODE (__t
) == __c4
3134 || TREE_CODE (__t
) == __c5
)
3135 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3140 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3141 const char *__f
, int __l
, const char *__g
)
3143 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3144 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3149 tree_class_check (tree __t
, const enum tree_code_class __class
,
3150 const char *__f
, int __l
, const char *__g
)
3152 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3153 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3158 tree_range_check (tree __t
,
3159 enum tree_code __code1
, enum tree_code __code2
,
3160 const char *__f
, int __l
, const char *__g
)
3162 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3163 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3168 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3169 const char *__f
, int __l
, const char *__g
)
3171 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3172 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3173 if (__t
->omp_clause
.code
!= __code
)
3174 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3179 omp_clause_range_check (tree __t
,
3180 enum omp_clause_code __code1
,
3181 enum omp_clause_code __code2
,
3182 const char *__f
, int __l
, const char *__g
)
3184 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3185 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3186 if ((int) __t
->omp_clause
.code
< (int) __code1
3187 || (int) __t
->omp_clause
.code
> (int) __code2
)
3188 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3192 /* These checks have to be special cased. */
3195 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3197 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3198 if (!IS_EXPR_CODE_CLASS (__c
))
3199 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3203 /* These checks have to be special cased. */
3206 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3209 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3213 inline const HOST_WIDE_INT
*
3214 tree_int_cst_elt_check (const_tree __t
, int __i
,
3215 const char *__f
, int __l
, const char *__g
)
3217 if (TREE_CODE (__t
) != INTEGER_CST
)
3218 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3219 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3220 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3222 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3225 inline HOST_WIDE_INT
*
3226 tree_int_cst_elt_check (tree __t
, int __i
,
3227 const char *__f
, int __l
, const char *__g
)
3229 if (TREE_CODE (__t
) != INTEGER_CST
)
3230 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3231 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3232 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3234 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3237 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3239 # if GCC_VERSION >= 4006
3240 #pragma GCC diagnostic push
3241 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3245 tree_vec_elt_check (tree __t
, int __i
,
3246 const char *__f
, int __l
, const char *__g
)
3248 if (TREE_CODE (__t
) != TREE_VEC
)
3249 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3250 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3251 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3252 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3255 # if GCC_VERSION >= 4006
3256 #pragma GCC diagnostic pop
3260 omp_clause_elt_check (tree __t
, int __i
,
3261 const char *__f
, int __l
, const char *__g
)
3263 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3264 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3265 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3266 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3267 return &__t
->omp_clause
.ops
[__i
];
3270 /* These checks have to be special cased. */
3273 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3275 if (!ANY_INTEGRAL_TYPE_P (__t
))
3276 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3282 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3285 if (TREE_CODE (__t
) != __c
)
3286 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3291 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3294 if (TREE_CODE (__t
) == __c
)
3295 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3300 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3301 enum tree_code __c1
, enum tree_code __c2
)
3303 if (TREE_CODE (__t
) != __c1
3304 && TREE_CODE (__t
) != __c2
)
3305 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3310 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3311 enum tree_code __c1
, enum tree_code __c2
)
3313 if (TREE_CODE (__t
) == __c1
3314 || TREE_CODE (__t
) == __c2
)
3315 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3320 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3321 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3323 if (TREE_CODE (__t
) != __c1
3324 && TREE_CODE (__t
) != __c2
3325 && TREE_CODE (__t
) != __c3
)
3326 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3331 tree_not_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_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3342 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3343 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3344 enum tree_code __c4
)
3346 if (TREE_CODE (__t
) != __c1
3347 && TREE_CODE (__t
) != __c2
3348 && TREE_CODE (__t
) != __c3
3349 && TREE_CODE (__t
) != __c4
)
3350 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3355 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3356 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3357 enum tree_code __c4
)
3359 if (TREE_CODE (__t
) == __c1
3360 || TREE_CODE (__t
) == __c2
3361 || TREE_CODE (__t
) == __c3
3362 || TREE_CODE (__t
) == __c4
)
3363 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3368 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3369 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3370 enum tree_code __c4
, enum tree_code __c5
)
3372 if (TREE_CODE (__t
) != __c1
3373 && TREE_CODE (__t
) != __c2
3374 && TREE_CODE (__t
) != __c3
3375 && TREE_CODE (__t
) != __c4
3376 && TREE_CODE (__t
) != __c5
)
3377 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3382 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3383 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3384 enum tree_code __c4
, enum tree_code __c5
)
3386 if (TREE_CODE (__t
) == __c1
3387 || TREE_CODE (__t
) == __c2
3388 || TREE_CODE (__t
) == __c3
3389 || TREE_CODE (__t
) == __c4
3390 || TREE_CODE (__t
) == __c5
)
3391 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3396 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3397 const char *__f
, int __l
, const char *__g
)
3399 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3400 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3405 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3406 const char *__f
, int __l
, const char *__g
)
3408 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3409 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3414 tree_range_check (const_tree __t
,
3415 enum tree_code __code1
, enum tree_code __code2
,
3416 const char *__f
, int __l
, const char *__g
)
3418 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3419 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3424 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3425 const char *__f
, int __l
, const char *__g
)
3427 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3428 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3429 if (__t
->omp_clause
.code
!= __code
)
3430 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3435 omp_clause_range_check (const_tree __t
,
3436 enum omp_clause_code __code1
,
3437 enum omp_clause_code __code2
,
3438 const char *__f
, int __l
, const char *__g
)
3440 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3441 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3442 if ((int) __t
->omp_clause
.code
< (int) __code1
3443 || (int) __t
->omp_clause
.code
> (int) __code2
)
3444 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3449 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3451 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3452 if (!IS_EXPR_CODE_CLASS (__c
))
3453 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3458 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3461 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3465 # if GCC_VERSION >= 4006
3466 #pragma GCC diagnostic push
3467 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3471 tree_vec_elt_check (const_tree __t
, int __i
,
3472 const char *__f
, int __l
, const char *__g
)
3474 if (TREE_CODE (__t
) != TREE_VEC
)
3475 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3476 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3477 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3478 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3479 //return &__t->vec.a[__i];
3482 # if GCC_VERSION >= 4006
3483 #pragma GCC diagnostic pop
3487 omp_clause_elt_check (const_tree __t
, int __i
,
3488 const char *__f
, int __l
, const char *__g
)
3490 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3491 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3492 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3493 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3494 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3498 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3501 if (!ANY_INTEGRAL_TYPE_P (__t
))
3502 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3509 /* Compute the number of operands in an expression node NODE. For
3510 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3511 otherwise it is looked up from the node's code. */
3513 tree_operand_length (const_tree node
)
3515 if (VL_EXP_CLASS_P (node
))
3516 return VL_EXP_OPERAND_LENGTH (node
);
3518 return TREE_CODE_LENGTH (TREE_CODE (node
));
3521 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3523 /* Special checks for TREE_OPERANDs. */
3525 tree_operand_check (tree __t
, int __i
,
3526 const char *__f
, int __l
, const char *__g
)
3528 const_tree __u
= EXPR_CHECK (__t
);
3529 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3530 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3531 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3535 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3536 const char *__f
, int __l
, const char *__g
)
3538 if (TREE_CODE (__t
) != __code
)
3539 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3540 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3541 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3542 return &__t
->exp
.operands
[__i
];
3546 tree_operand_check (const_tree __t
, int __i
,
3547 const char *__f
, int __l
, const char *__g
)
3549 const_tree __u
= EXPR_CHECK (__t
);
3550 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3551 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3552 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3556 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3557 const char *__f
, int __l
, const char *__g
)
3559 if (TREE_CODE (__t
) != __code
)
3560 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3561 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3562 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3563 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3568 #define error_mark_node global_trees[TI_ERROR_MARK]
3570 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3571 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3572 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3573 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3574 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3576 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3577 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3578 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3579 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3580 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3582 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3583 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3584 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3585 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3586 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3588 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3589 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3590 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3592 #define void_node global_trees[TI_VOID]
3594 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3595 #define integer_one_node global_trees[TI_INTEGER_ONE]
3596 #define integer_three_node global_trees[TI_INTEGER_THREE]
3597 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3598 #define size_zero_node global_trees[TI_SIZE_ZERO]
3599 #define size_one_node global_trees[TI_SIZE_ONE]
3600 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3601 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3602 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3604 /* Base access nodes. */
3605 #define access_public_node global_trees[TI_PUBLIC]
3606 #define access_protected_node global_trees[TI_PROTECTED]
3607 #define access_private_node global_trees[TI_PRIVATE]
3609 #define null_pointer_node global_trees[TI_NULL_POINTER]
3611 #define float_type_node global_trees[TI_FLOAT_TYPE]
3612 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3613 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3615 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3616 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3617 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3618 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3620 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3621 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3622 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3623 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3625 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3627 #define void_type_node global_trees[TI_VOID_TYPE]
3628 /* The C type `void *'. */
3629 #define ptr_type_node global_trees[TI_PTR_TYPE]
3630 /* The C type `const void *'. */
3631 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3632 /* The C type `size_t'. */
3633 #define size_type_node global_trees[TI_SIZE_TYPE]
3634 #define pid_type_node global_trees[TI_PID_TYPE]
3635 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3636 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3637 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3638 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3639 /* The C type `FILE *'. */
3640 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3641 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3643 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3644 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3645 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3647 /* The decimal floating point types. */
3648 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3649 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3650 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3651 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3652 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3653 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3655 /* The fixed-point types. */
3656 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3657 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3658 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3659 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3660 #define sat_unsigned_short_fract_type_node \
3661 global_trees[TI_SAT_USFRACT_TYPE]
3662 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3663 #define sat_unsigned_long_fract_type_node \
3664 global_trees[TI_SAT_ULFRACT_TYPE]
3665 #define sat_unsigned_long_long_fract_type_node \
3666 global_trees[TI_SAT_ULLFRACT_TYPE]
3667 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3668 #define fract_type_node global_trees[TI_FRACT_TYPE]
3669 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3670 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3671 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3672 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3673 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3674 #define unsigned_long_long_fract_type_node \
3675 global_trees[TI_ULLFRACT_TYPE]
3676 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3677 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3678 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3679 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3680 #define sat_unsigned_short_accum_type_node \
3681 global_trees[TI_SAT_USACCUM_TYPE]
3682 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3683 #define sat_unsigned_long_accum_type_node \
3684 global_trees[TI_SAT_ULACCUM_TYPE]
3685 #define sat_unsigned_long_long_accum_type_node \
3686 global_trees[TI_SAT_ULLACCUM_TYPE]
3687 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3688 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3689 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3690 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3691 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3692 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3693 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3694 #define unsigned_long_long_accum_type_node \
3695 global_trees[TI_ULLACCUM_TYPE]
3696 #define qq_type_node global_trees[TI_QQ_TYPE]
3697 #define hq_type_node global_trees[TI_HQ_TYPE]
3698 #define sq_type_node global_trees[TI_SQ_TYPE]
3699 #define dq_type_node global_trees[TI_DQ_TYPE]
3700 #define tq_type_node global_trees[TI_TQ_TYPE]
3701 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3702 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3703 #define usq_type_node global_trees[TI_USQ_TYPE]
3704 #define udq_type_node global_trees[TI_UDQ_TYPE]
3705 #define utq_type_node global_trees[TI_UTQ_TYPE]
3706 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3707 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3708 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3709 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3710 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3711 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3712 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3713 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3714 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3715 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3716 #define ha_type_node global_trees[TI_HA_TYPE]
3717 #define sa_type_node global_trees[TI_SA_TYPE]
3718 #define da_type_node global_trees[TI_DA_TYPE]
3719 #define ta_type_node global_trees[TI_TA_TYPE]
3720 #define uha_type_node global_trees[TI_UHA_TYPE]
3721 #define usa_type_node global_trees[TI_USA_TYPE]
3722 #define uda_type_node global_trees[TI_UDA_TYPE]
3723 #define uta_type_node global_trees[TI_UTA_TYPE]
3724 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3725 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3726 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3727 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3728 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3729 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3730 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3731 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3733 /* The node that should be placed at the end of a parameter list to
3734 indicate that the function does not take a variable number of
3735 arguments. The TREE_VALUE will be void_type_node and there will be
3736 no TREE_CHAIN. Language-independent code should not assume
3737 anything else about this node. */
3738 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3740 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3741 #define MAIN_NAME_P(NODE) \
3742 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3744 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3746 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3747 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3749 /* Default/current target options (TARGET_OPTION_NODE). */
3750 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3751 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3753 /* Default tree list option(), optimize() pragmas to be linked into the
3755 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3756 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3758 #define char_type_node integer_types[itk_char]
3759 #define signed_char_type_node integer_types[itk_signed_char]
3760 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3761 #define short_integer_type_node integer_types[itk_short]
3762 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3763 #define integer_type_node integer_types[itk_int]
3764 #define unsigned_type_node integer_types[itk_unsigned_int]
3765 #define long_integer_type_node integer_types[itk_long]
3766 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3767 #define long_long_integer_type_node integer_types[itk_long_long]
3768 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3770 /* True if NODE is an erroneous expression. */
3772 #define error_operand_p(NODE) \
3773 ((NODE) == error_mark_node \
3774 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3776 extern tree
decl_assembler_name (tree
);
3777 extern tree
decl_comdat_group (const_tree
);
3778 extern tree
decl_comdat_group_id (const_tree
);
3779 extern const char *decl_section_name (const_tree
);
3780 extern void set_decl_section_name (tree
, const char *);
3781 extern enum tls_model
decl_tls_model (const_tree
);
3782 extern void set_decl_tls_model (tree
, enum tls_model
);
3784 /* Compute the number of bytes occupied by 'node'. This routine only
3785 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3787 extern size_t tree_size (const_tree
);
3789 /* Compute the number of bytes occupied by a tree with code CODE.
3790 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3791 which are of variable length. */
3792 extern size_t tree_code_size (enum tree_code
);
3794 /* Allocate and return a new UID from the DECL_UID namespace. */
3795 extern int allocate_decl_uid (void);
3797 /* Lowest level primitive for allocating a node.
3798 The TREE_CODE is the only argument. Contents are initialized
3799 to zero except for a few of the common fields. */
3801 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3802 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3804 /* Free tree node. */
3806 extern void free_node (tree
);
3808 /* Make a copy of a node, with all the same contents. */
3810 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3811 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3813 /* Make a copy of a chain of TREE_LIST nodes. */
3815 extern tree
copy_list (tree
);
3817 /* Make a CASE_LABEL_EXPR. */
3819 extern tree
build_case_label (tree
, tree
, tree
);
3822 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3823 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3825 /* Make an INTEGER_CST. */
3827 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3828 #define make_int_cst(LEN, EXT_LEN) \
3829 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3831 /* Make a TREE_VEC. */
3833 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3834 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3836 /* Grow a TREE_VEC. */
3838 extern tree
grow_tree_vec_stat (tree v
, int MEM_STAT_DECL
);
3839 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3841 /* Construct various types of nodes. */
3843 extern tree
build_nt (enum tree_code
, ...);
3844 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3846 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3847 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3848 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3849 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3850 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3851 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3852 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3853 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3854 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3855 tree MEM_STAT_DECL
);
3856 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3857 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3858 tree MEM_STAT_DECL
);
3859 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3861 /* _loc versions of build[1-5]. */
3864 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3865 tree arg1 MEM_STAT_DECL
)
3867 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3868 if (CAN_HAVE_LOCATION_P (t
))
3869 SET_EXPR_LOCATION (t
, loc
);
3872 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3875 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3876 tree arg1 MEM_STAT_DECL
)
3878 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3879 if (CAN_HAVE_LOCATION_P (t
))
3880 SET_EXPR_LOCATION (t
, loc
);
3883 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3886 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3887 tree arg1
, tree arg2 MEM_STAT_DECL
)
3889 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3890 if (CAN_HAVE_LOCATION_P (t
))
3891 SET_EXPR_LOCATION (t
, loc
);
3894 #define build3_loc(l,c,t1,t2,t3,t4) \
3895 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3898 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3899 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3901 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3902 if (CAN_HAVE_LOCATION_P (t
))
3903 SET_EXPR_LOCATION (t
, loc
);
3906 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3907 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3910 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3911 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3913 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3914 arg4 PASS_MEM_STAT
);
3915 if (CAN_HAVE_LOCATION_P (t
))
3916 SET_EXPR_LOCATION (t
, loc
);
3919 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3920 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3922 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3923 #define build_var_debug_value(t1,t2) \
3924 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3926 /* Constructs double_int from tree CST. */
3928 extern tree
double_int_to_tree (tree
, double_int
);
3930 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3931 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3933 /* Create an INT_CST node with a CST value zero extended. */
3936 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3937 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3938 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3939 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3940 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3941 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3942 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3943 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3944 extern tree
build_vector_from_val (tree
, tree
);
3945 extern void recompute_constructor_flags (tree
);
3946 extern void verify_constructor_flags (tree
);
3947 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3948 extern tree
build_constructor_single (tree
, tree
, tree
);
3949 extern tree
build_constructor_from_list (tree
, tree
);
3950 extern tree
build_constructor_va (tree
, int, ...);
3951 extern tree
build_real_from_int_cst (tree
, const_tree
);
3952 extern tree
build_complex (tree
, tree
, tree
);
3953 extern tree
build_complex_inf (tree
, bool);
3954 extern tree
build_each_one_cst (tree
);
3955 extern tree
build_one_cst (tree
);
3956 extern tree
build_minus_one_cst (tree
);
3957 extern tree
build_all_ones_cst (tree
);
3958 extern tree
build_zero_cst (tree
);
3959 extern tree
build_string (int, const char *);
3960 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3961 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3962 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3963 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3964 extern tree
build_decl_stat (location_t
, enum tree_code
,
3965 tree
, tree MEM_STAT_DECL
);
3966 extern tree
build_fn_decl (const char *, tree
);
3967 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3968 extern tree
build_translation_unit_decl (tree
);
3969 extern tree
build_block (tree
, tree
, tree
, tree
);
3970 extern tree
build_empty_stmt (location_t
);
3971 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3973 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3974 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3976 extern tree
build_call_nary (tree
, tree
, int, ...);
3977 extern tree
build_call_valist (tree
, tree
, int, va_list);
3978 #define build_call_array(T1,T2,N,T3)\
3979 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3980 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3981 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3982 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
3983 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
3984 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
3985 extern tree
build_call_expr (tree
, int, ...);
3986 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
3988 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
3990 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
3992 extern tree
build_string_literal (int, const char *);
3994 /* Construct various nodes representing data types. */
3996 extern tree
signed_or_unsigned_type_for (int, tree
);
3997 extern tree
signed_type_for (tree
);
3998 extern tree
unsigned_type_for (tree
);
3999 extern tree
truth_type_for (tree
);
4000 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4001 extern tree
build_pointer_type (tree
);
4002 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4003 extern tree
build_reference_type (tree
);
4004 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4005 extern tree
build_vector_type (tree innertype
, int nunits
);
4006 extern tree
build_truth_vector_type (unsigned, unsigned);
4007 extern tree
build_same_sized_truth_vector_type (tree vectype
);
4008 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4009 extern tree
build_index_type (tree
);
4010 extern tree
build_array_type (tree
, tree
);
4011 extern tree
build_nonshared_array_type (tree
, tree
);
4012 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4013 extern tree
build_function_type (tree
, tree
);
4014 extern tree
build_function_type_list (tree
, ...);
4015 extern tree
build_varargs_function_type_list (tree
, ...);
4016 extern tree
build_function_type_array (tree
, int, tree
*);
4017 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4018 #define build_function_type_vec(RET, V) \
4019 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4020 #define build_varargs_function_type_vec(RET, V) \
4021 build_varargs_function_type_array (RET, vec_safe_length (V), \
4022 vec_safe_address (V))
4023 extern tree
build_method_type_directly (tree
, tree
, tree
);
4024 extern tree
build_method_type (tree
, tree
);
4025 extern tree
build_offset_type (tree
, tree
);
4026 extern tree
build_complex_type (tree
);
4027 extern tree
array_type_nelts (const_tree
);
4029 extern tree
value_member (tree
, tree
);
4030 extern tree
purpose_member (const_tree
, tree
);
4031 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4032 extern tree
chain_index (int, tree
);
4034 extern int attribute_list_equal (const_tree
, const_tree
);
4035 extern int attribute_list_contained (const_tree
, const_tree
);
4036 extern int tree_int_cst_equal (const_tree
, const_tree
);
4038 extern bool tree_fits_shwi_p (const_tree
)
4039 #ifndef ENABLE_TREE_CHECKING
4040 ATTRIBUTE_PURE
/* tree_fits_shwi_p is pure only when checking is disabled. */
4043 extern bool tree_fits_uhwi_p (const_tree
)
4044 #ifndef ENABLE_TREE_CHECKING
4045 ATTRIBUTE_PURE
/* tree_fits_uhwi_p is pure only when checking is disabled. */
4048 extern HOST_WIDE_INT
tree_to_shwi (const_tree
);
4049 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
);
4050 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4051 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4052 tree_to_shwi (const_tree t
)
4054 gcc_assert (tree_fits_shwi_p (t
));
4055 return TREE_INT_CST_LOW (t
);
4058 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4059 tree_to_uhwi (const_tree t
)
4061 gcc_assert (tree_fits_uhwi_p (t
));
4062 return TREE_INT_CST_LOW (t
);
4065 extern int tree_int_cst_sgn (const_tree
);
4066 extern int tree_int_cst_sign_bit (const_tree
);
4067 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4068 extern tree
strip_array_types (tree
);
4069 extern tree
excess_precision_type (tree
);
4070 extern bool valid_constant_size_p (const_tree
);
4073 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4074 put the prototype here. Rtl.h does declare the prototype if
4075 tree.h had been included. */
4077 extern tree
make_tree (tree
, rtx
);
4079 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4082 Such modified types already made are recorded so that duplicates
4085 extern tree
build_type_attribute_variant (tree
, tree
);
4086 extern tree
build_decl_attribute_variant (tree
, tree
);
4087 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4089 extern bool attribute_value_equal (const_tree
, const_tree
);
4091 /* Return 0 if the attributes for two types are incompatible, 1 if they
4092 are compatible, and 2 if they are nearly compatible (which causes a
4093 warning to be generated). */
4094 extern int comp_type_attributes (const_tree
, const_tree
);
4096 /* Default versions of target-overridable functions. */
4097 extern tree
merge_decl_attributes (tree
, tree
);
4098 extern tree
merge_type_attributes (tree
, tree
);
4100 /* This function is a private implementation detail of lookup_attribute()
4101 and you should never call it directly. */
4102 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4104 /* This function is a private implementation detail
4105 of lookup_attribute_by_prefix() and you should never call it directly. */
4106 extern tree
private_lookup_attribute_by_prefix (const char *, size_t, tree
);
4108 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4109 return a pointer to the attribute's list element if the attribute
4110 is part of the list, or NULL_TREE if not found. If the attribute
4111 appears more than once, this only returns the first occurrence; the
4112 TREE_CHAIN of the return value should be passed back in if further
4113 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4117 lookup_attribute (const char *attr_name
, tree list
)
4119 gcc_checking_assert (attr_name
[0] != '_');
4120 /* In most cases, list is NULL_TREE. */
4121 if (list
== NULL_TREE
)
4124 /* Do the strlen() before calling the out-of-line implementation.
4125 In most cases attr_name is a string constant, and the compiler
4126 will optimize the strlen() away. */
4127 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4130 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4131 return a pointer to the attribute's list first element if the attribute
4132 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4136 lookup_attribute_by_prefix (const char *attr_name
, tree list
)
4138 gcc_checking_assert (attr_name
[0] != '_');
4139 /* In most cases, list is NULL_TREE. */
4140 if (list
== NULL_TREE
)
4143 return private_lookup_attribute_by_prefix (attr_name
, strlen (attr_name
),
4148 /* This function is a private implementation detail of
4149 is_attribute_p() and you should never call it directly. */
4150 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4152 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4153 if the identifier node is a valid attribute name for the string.
4154 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4155 be the identifier for 'text' or for '__text__'. */
4158 is_attribute_p (const char *attr_name
, const_tree ident
)
4160 gcc_checking_assert (attr_name
[0] != '_');
4161 /* Do the strlen() before calling the out-of-line implementation.
4162 In most cases attr_name is a string constant, and the compiler
4163 will optimize the strlen() away. */
4164 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4167 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4168 modified list. ATTR_NAME must be in the form 'text' (not
4171 extern tree
remove_attribute (const char *, tree
);
4173 /* Given two attributes lists, return a list of their union. */
4175 extern tree
merge_attributes (tree
, tree
);
4177 /* Given two Windows decl attributes lists, possibly including
4178 dllimport, return a list of their union . */
4179 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4181 /* Handle a "dllimport" or "dllexport" attribute. */
4182 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4184 /* Returns true iff unqualified CAND and BASE are equivalent. */
4186 extern bool check_base_type (const_tree cand
, const_tree base
);
4188 /* Check whether CAND is suitable to be returned from get_qualified_type
4189 (BASE, TYPE_QUALS). */
4191 extern bool check_qualified_type (const_tree
, const_tree
, int);
4193 /* Return a version of the TYPE, qualified as indicated by the
4194 TYPE_QUALS, if one exists. If no qualified version exists yet,
4195 return NULL_TREE. */
4197 extern tree
get_qualified_type (tree
, int);
4199 /* Like get_qualified_type, but creates the type if it does not
4200 exist. This function never returns NULL_TREE. */
4202 extern tree
build_qualified_type (tree
, int);
4204 /* Create a variant of type T with alignment ALIGN. */
4206 extern tree
build_aligned_type (tree
, unsigned int);
4208 /* Like build_qualified_type, but only deals with the `const' and
4209 `volatile' qualifiers. This interface is retained for backwards
4210 compatibility with the various front-ends; new code should use
4211 build_qualified_type instead. */
4213 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4214 build_qualified_type ((TYPE), \
4215 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4216 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4218 /* Make a copy of a type node. */
4220 extern tree
build_distinct_type_copy (tree
);
4221 extern tree
build_variant_type_copy (tree
);
4223 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4224 return a canonicalized ..._TYPE node, so that duplicates are not made.
4225 How the hash code is computed is up to the caller, as long as any two
4226 callers that could hash identical-looking type nodes agree. */
4228 extern tree
type_hash_canon (unsigned int, tree
);
4230 extern tree
convert (tree
, tree
);
4231 extern unsigned int expr_align (const_tree
);
4232 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4234 size_in_bytes (const_tree t
)
4236 return size_in_bytes_loc (input_location
, t
);
4239 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4240 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4241 extern tree
bit_position (const_tree
);
4242 extern tree
byte_position (const_tree
);
4243 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4245 #define sizetype sizetype_tab[(int) stk_sizetype]
4246 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4247 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4248 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4249 #define size_int(L) size_int_kind (L, stk_sizetype)
4250 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4251 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4252 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4254 /* Type for sizes of data-type. */
4256 #define BITS_PER_UNIT_LOG \
4257 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4258 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4259 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4261 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4262 by making the last node in X point to Y.
4263 Returns X, except if X is 0 returns Y. */
4265 extern tree
chainon (tree
, tree
);
4267 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4269 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4270 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4272 /* Return the last tree node in a chain. */
4274 extern tree
tree_last (tree
);
4276 /* Reverse the order of elements in a chain, and return the new head. */
4278 extern tree
nreverse (tree
);
4280 /* Returns the length of a chain of nodes
4281 (number of chain pointers to follow before reaching a null pointer). */
4283 extern int list_length (const_tree
);
4285 /* Returns the first FIELD_DECL in a type. */
4287 extern tree
first_field (const_tree
);
4289 /* Given an initializer INIT, return TRUE if INIT is zero or some
4290 aggregate of zeros. Otherwise return FALSE. */
4292 extern bool initializer_zerop (const_tree
);
4294 /* Given a vector VEC, return its first element if all elements are
4295 the same. Otherwise return NULL_TREE. */
4297 extern tree
uniform_vector_p (const_tree
);
4299 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4301 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4303 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4305 extern int zerop (const_tree
);
4307 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4309 extern int integer_zerop (const_tree
);
4311 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4313 extern int integer_onep (const_tree
);
4315 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4316 a vector or complex where each part is 1. */
4318 extern int integer_each_onep (const_tree
);
4320 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4321 all of whose significant bits are 1. */
4323 extern int integer_all_onesp (const_tree
);
4325 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4328 extern int integer_minus_onep (const_tree
);
4330 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4331 exactly one bit 1. */
4333 extern int integer_pow2p (const_tree
);
4335 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4336 with a nonzero value. */
4338 extern int integer_nonzerop (const_tree
);
4340 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4341 a vector where each element is an integer constant of value -1. */
4343 extern int integer_truep (const_tree
);
4345 extern bool cst_and_fits_in_hwi (const_tree
);
4346 extern tree
num_ending_zeros (const_tree
);
4348 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4351 extern int fixed_zerop (const_tree
);
4353 /* staticp (tree x) is nonzero if X is a reference to data allocated
4354 at a fixed address in memory. Returns the outermost data. */
4356 extern tree
staticp (tree
);
4358 /* save_expr (EXP) returns an expression equivalent to EXP
4359 but it can be used multiple times within context CTX
4360 and only evaluate EXP once. */
4362 extern tree
save_expr (tree
);
4364 /* Return true if T is function-invariant. */
4366 extern bool tree_invariant_p (tree
);
4368 /* Look inside EXPR into any simple arithmetic operations. Return the
4369 outermost non-arithmetic or non-invariant node. */
4371 extern tree
skip_simple_arithmetic (tree
);
4373 /* Look inside EXPR into simple arithmetic operations involving constants.
4374 Return the outermost non-arithmetic or non-constant node. */
4376 extern tree
skip_simple_constant_arithmetic (tree
);
4378 /* Return which tree structure is used by T. */
4380 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4382 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4383 size or offset that depends on a field within a record. */
4385 extern bool contains_placeholder_p (const_tree
);
4387 /* This macro calls the above function but short-circuits the common
4388 case of a constant to save time. Also check for null. */
4390 #define CONTAINS_PLACEHOLDER_P(EXP) \
4391 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4393 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4394 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4397 extern bool type_contains_placeholder_p (tree
);
4399 /* Given a tree EXP, find all occurrences of references to fields
4400 in a PLACEHOLDER_EXPR and place them in vector REFS without
4401 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4402 we assume here that EXP contains only arithmetic expressions
4403 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4406 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4408 /* This macro calls the above function but short-circuits the common
4409 case of a constant to save time and also checks for NULL. */
4411 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4413 if((EXP) && !TREE_CONSTANT (EXP)) \
4414 find_placeholder_in_expr (EXP, V); \
4417 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4418 return a tree with all occurrences of references to F in a
4419 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4420 CONST_DECLs. Note that we assume here that EXP contains only
4421 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4422 occurring only in their argument list. */
4424 extern tree
substitute_in_expr (tree
, tree
, tree
);
4426 /* This macro calls the above function but short-circuits the common
4427 case of a constant to save time and also checks for NULL. */
4429 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4430 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4432 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4433 for it within OBJ, a tree that is an object or a chain of references. */
4435 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4437 /* This macro calls the above function but short-circuits the common
4438 case of a constant to save time and also checks for NULL. */
4440 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4441 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4442 : substitute_placeholder_in_expr (EXP, OBJ))
4445 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4446 but it can be used multiple times
4447 and only evaluate the subexpressions once. */
4449 extern tree
stabilize_reference (tree
);
4451 /* Return EXP, stripped of any conversions to wider types
4452 in such a way that the result of converting to type FOR_TYPE
4453 is the same as if EXP were converted to FOR_TYPE.
4454 If FOR_TYPE is 0, it signifies EXP's type. */
4456 extern tree
get_unwidened (tree
, tree
);
4458 /* Return OP or a simpler expression for a narrower value
4459 which can be sign-extended or zero-extended to give back OP.
4460 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4461 or 0 if the value should be sign-extended. */
4463 extern tree
get_narrower (tree
, int *);
4465 /* Return true if T is an expression that get_inner_reference handles. */
4468 handled_component_p (const_tree t
)
4470 switch (TREE_CODE (t
))
4475 case ARRAY_RANGE_REF
:
4478 case VIEW_CONVERT_EXPR
:
4486 /* Return true T is a component with reverse storage order. */
4489 reverse_storage_order_for_component_p (tree t
)
4491 /* The storage order only applies to scalar components. */
4492 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4495 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4496 t
= TREE_OPERAND (t
, 0);
4498 switch (TREE_CODE (t
))
4502 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4503 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4504 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4505 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4509 return REF_REVERSE_STORAGE_ORDER (t
);
4511 case ARRAY_RANGE_REF
:
4512 case VIEW_CONVERT_EXPR
:
4520 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4521 that can modify the storage order of objects. Note that, even if the
4522 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4523 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4524 it can change the partition of the aggregate object into scalars. */
4527 storage_order_barrier_p (const_tree t
)
4529 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4532 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4533 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4536 tree op
= TREE_OPERAND (t
, 0);
4538 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4539 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4545 /* Given a DECL or TYPE, return the scope in which it was declared, or
4546 NUL_TREE if there is no containing scope. */
4548 extern tree
get_containing_scope (const_tree
);
4550 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4552 extern tree
decl_function_context (const_tree
);
4554 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4555 this _DECL with its context, or zero if none. */
4556 extern tree
decl_type_context (const_tree
);
4558 /* Return 1 if EXPR is the real constant zero. */
4559 extern int real_zerop (const_tree
);
4561 /* Initialize the iterator I with arguments from function FNDECL */
4564 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4566 i
->next
= TYPE_ARG_TYPES (fntype
);
4569 /* Return a pointer that holds the next argument if there are more arguments to
4570 handle, otherwise return NULL. */
4572 static inline tree
*
4573 function_args_iter_cond_ptr (function_args_iterator
*i
)
4575 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4578 /* Return the next argument if there are more arguments to handle, otherwise
4582 function_args_iter_cond (function_args_iterator
*i
)
4584 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4587 /* Advance to the next argument. */
4589 function_args_iter_next (function_args_iterator
*i
)
4591 gcc_assert (i
->next
!= NULL_TREE
);
4592 i
->next
= TREE_CHAIN (i
->next
);
4595 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4598 inlined_function_outer_scope_p (const_tree block
)
4600 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4603 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4604 to point to the next tree element. ITER is an instance of
4605 function_args_iterator used to iterate the arguments. */
4606 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4607 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4608 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4609 function_args_iter_next (&(ITER)))
4611 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4612 to the next tree element. ITER is an instance of function_args_iterator
4613 used to iterate the arguments. */
4614 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4615 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4616 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4617 function_args_iter_next (&(ITER)))
4620 extern unsigned crc32_string (unsigned, const char *);
4621 extern unsigned crc32_byte (unsigned, char);
4622 extern unsigned crc32_unsigned (unsigned, unsigned);
4623 extern void clean_symbol_name (char *);
4624 extern tree
get_file_function_name (const char *);
4625 extern tree
get_callee_fndecl (const_tree
);
4626 extern combined_fn
get_call_combined_fn (const_tree
);
4627 extern int type_num_arguments (const_tree
);
4628 extern bool associative_tree_code (enum tree_code
);
4629 extern bool commutative_tree_code (enum tree_code
);
4630 extern bool commutative_ternary_tree_code (enum tree_code
);
4631 extern bool operation_can_overflow (enum tree_code
);
4632 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
4633 extern tree
upper_bound_in_type (tree
, tree
);
4634 extern tree
lower_bound_in_type (tree
, tree
);
4635 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4636 extern tree
create_artificial_label (location_t
);
4637 extern const char *get_name (tree
);
4638 extern bool stdarg_p (const_tree
);
4639 extern bool prototype_p (const_tree
);
4640 extern bool is_typedef_decl (const_tree x
);
4641 extern bool typedef_variant_p (const_tree
);
4642 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4643 extern tree
build_low_bits_mask (tree
, unsigned);
4644 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4645 extern tree
tree_strip_nop_conversions (tree
);
4646 extern tree
tree_strip_sign_nop_conversions (tree
);
4647 extern const_tree
strip_invariant_refs (const_tree
);
4648 extern tree
lhd_gcc_personality (void);
4649 extern void assign_assembler_name_if_neeeded (tree
);
4650 extern void warn_deprecated_use (tree
, tree
);
4651 extern void cache_integer_cst (tree
);
4652 extern const char *combined_fn_name (combined_fn
);
4654 /* Return the memory model from a host integer. */
4655 static inline enum memmodel
4656 memmodel_from_int (unsigned HOST_WIDE_INT val
)
4658 return (enum memmodel
) (val
& MEMMODEL_MASK
);
4661 /* Return the base memory model from a host integer. */
4662 static inline enum memmodel
4663 memmodel_base (unsigned HOST_WIDE_INT val
)
4665 return (enum memmodel
) (val
& MEMMODEL_BASE_MASK
);
4668 /* Return TRUE if the memory model is RELAXED. */
4670 is_mm_relaxed (enum memmodel model
)
4672 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELAXED
;
4675 /* Return TRUE if the memory model is CONSUME. */
4677 is_mm_consume (enum memmodel model
)
4679 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_CONSUME
;
4682 /* Return TRUE if the memory model is ACQUIRE. */
4684 is_mm_acquire (enum memmodel model
)
4686 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQUIRE
;
4689 /* Return TRUE if the memory model is RELEASE. */
4691 is_mm_release (enum memmodel model
)
4693 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_RELEASE
;
4696 /* Return TRUE if the memory model is ACQ_REL. */
4698 is_mm_acq_rel (enum memmodel model
)
4700 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_ACQ_REL
;
4703 /* Return TRUE if the memory model is SEQ_CST. */
4705 is_mm_seq_cst (enum memmodel model
)
4707 return (model
& MEMMODEL_BASE_MASK
) == MEMMODEL_SEQ_CST
;
4710 /* Return TRUE if the memory model is a SYNC variant. */
4712 is_mm_sync (enum memmodel model
)
4714 return (model
& MEMMODEL_SYNC
);
4717 /* Compare and hash for any structure which begins with a canonical
4718 pointer. Assumes all pointers are interchangeable, which is sort
4719 of already assumed by gcc elsewhere IIRC. */
4722 struct_ptr_eq (const void *a
, const void *b
)
4724 const void * const * x
= (const void * const *) a
;
4725 const void * const * y
= (const void * const *) b
;
4729 static inline hashval_t
4730 struct_ptr_hash (const void *a
)
4732 const void * const * x
= (const void * const *) a
;
4733 return (intptr_t)*x
>> 4;
4736 /* Return nonzero if CODE is a tree code that represents a truth value. */
4738 truth_value_p (enum tree_code code
)
4740 return (TREE_CODE_CLASS (code
) == tcc_comparison
4741 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4742 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4743 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4746 /* Return whether TYPE is a type suitable for an offset for
4747 a POINTER_PLUS_EXPR. */
4749 ptrofftype_p (tree type
)
4751 return (INTEGRAL_TYPE_P (type
)
4752 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4753 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4756 /* Return true if the argument is a complete type or an array
4757 of unknown bound (whose type is incomplete but) whose elements
4758 have complete type. */
4760 complete_or_array_type_p (const_tree type
)
4762 return COMPLETE_TYPE_P (type
)
4763 || (TREE_CODE (type
) == ARRAY_TYPE
4764 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
4767 extern tree
strip_float_extensions (tree
);
4768 extern int really_constant_p (const_tree
);
4769 extern bool decl_address_invariant_p (const_tree
);
4770 extern bool decl_address_ip_invariant_p (const_tree
);
4771 extern bool int_fits_type_p (const_tree
, const_tree
);
4772 #ifndef GENERATOR_FILE
4773 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4775 extern bool variably_modified_type_p (tree
, tree
);
4776 extern int tree_log2 (const_tree
);
4777 extern int tree_floor_log2 (const_tree
);
4778 extern unsigned int tree_ctz (const_tree
);
4779 extern int simple_cst_equal (const_tree
, const_tree
);
4784 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
4788 /* Compat version until all callers are converted. Return hash for
4790 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4792 inchash::hash
hstate (seed
);
4793 inchash::add_expr (tree
, hstate
);
4794 return hstate
.end ();
4797 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4798 extern int type_list_equal (const_tree
, const_tree
);
4799 extern int chain_member (const_tree
, const_tree
);
4800 extern void dump_tree_statistics (void);
4801 extern void recompute_tree_invariant_for_addr_expr (tree
);
4802 extern bool needs_to_live_in_memory (const_tree
);
4803 extern tree
reconstruct_complex_type (tree
, tree
);
4804 extern int real_onep (const_tree
);
4805 extern int real_minus_onep (const_tree
);
4806 extern void init_ttree (void);
4807 extern void build_common_tree_nodes (bool);
4808 extern void build_common_builtin_nodes (void);
4809 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4810 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
4811 extern tree
build_range_type (tree
, tree
, tree
);
4812 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4813 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4814 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4815 extern tree
tree_block (tree
);
4816 extern void tree_set_block (tree
, tree
);
4817 extern location_t
*block_nonartificial_location (tree
);
4818 extern location_t
tree_nonartificial_location (tree
);
4819 extern tree
block_ultimate_origin (const_tree
);
4820 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4821 extern bool virtual_method_call_p (const_tree
);
4822 extern tree
obj_type_ref_class (const_tree ref
);
4823 extern bool types_same_for_odr (const_tree type1
, const_tree type2
,
4825 extern bool contains_bitfld_component_ref_p (const_tree
);
4826 extern bool block_may_fallthru (const_tree
);
4827 extern void using_eh_for_cleanups (void);
4828 extern bool using_eh_for_cleanups_p (void);
4829 extern const char *get_tree_code_name (enum tree_code
);
4830 extern void set_call_expr_flags (tree
, int);
4831 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
4833 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4835 #define walk_tree(a,b,c,d) \
4836 walk_tree_1 (a, b, c, d, NULL)
4837 #define walk_tree_without_duplicates(a,b,c) \
4838 walk_tree_without_duplicates_1 (a, b, c, NULL)
4840 extern tree
drop_tree_overflow (tree
);
4842 /* Given a memory reference expression T, return its base address.
4843 The base address of a memory reference expression is the main
4844 object being referenced. */
4845 extern tree
get_base_address (tree t
);
4847 /* Return a tree of sizetype representing the size, in bytes, of the element
4848 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4849 extern tree
array_ref_element_size (tree
);
4851 /* Return a tree representing the upper bound of the array mentioned in
4852 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4853 extern tree
array_ref_up_bound (tree
);
4855 /* Return a tree representing the lower bound of the array mentioned in
4856 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4857 extern tree
array_ref_low_bound (tree
);
4859 /* Returns true if REF is an array reference to an array at the end of
4860 a structure. If this is the case, the array may be allocated larger
4861 than its upper bound implies. */
4862 extern bool array_at_struct_end_p (tree
);
4864 /* Return a tree representing the offset, in bytes, of the field referenced
4865 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4866 extern tree
component_ref_field_offset (tree
);
4868 extern int tree_map_base_eq (const void *, const void *);
4869 extern unsigned int tree_map_base_hash (const void *);
4870 extern int tree_map_base_marked_p (const void *);
4871 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
4872 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
4873 bool trust_type_canonical
= true);
4874 extern bool type_with_interoperable_signedness (const_tree
);
4876 /* Return simplified tree code of type that is used for canonical type
4878 inline enum tree_code
4879 tree_code_for_canonical_type_merging (enum tree_code code
)
4881 /* By C standard, each enumerated type shall be compatible with char,
4882 a signed integer, or an unsigned integer. The choice of type is
4883 implementation defined (in our case it depends on -fshort-enum).
4885 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4886 type and compare only by their signedness and precision. */
4887 if (code
== ENUMERAL_TYPE
)
4888 return INTEGER_TYPE
;
4889 /* To allow inter-operability between languages having references and
4890 C, we consider reference types and pointers alike. Note that this is
4891 not strictly necessary for C-Fortran 2008 interoperability because
4892 Fortran define C_PTR type that needs to be compatible with C pointers
4893 and we handle this one as ptr_type_node. */
4894 if (code
== REFERENCE_TYPE
)
4895 return POINTER_TYPE
;
4899 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
4900 We don't define the types for pointers, arrays and vectors. The reason is
4901 that pointers are handled specially: ptr_type_node accesses conflict with
4902 accesses to all other pointers. This is done by alias.c.
4903 Because alias sets of arrays and vectors are the same as types of their
4904 elements, we can't compute canonical type either. Otherwise we could go
4905 form void *[10] to int *[10] (because they are equivalent for canonical type
4906 machinery) and get wrong TBAA. */
4909 canonical_type_used_p (const_tree t
)
4911 return !(POINTER_TYPE_P (t
)
4912 || TREE_CODE (t
) == ARRAY_TYPE
4913 || TREE_CODE (t
) == VECTOR_TYPE
);
4916 #define tree_map_eq tree_map_base_eq
4917 extern unsigned int tree_map_hash (const void *);
4918 #define tree_map_marked_p tree_map_base_marked_p
4920 #define tree_decl_map_eq tree_map_base_eq
4921 extern unsigned int tree_decl_map_hash (const void *);
4922 #define tree_decl_map_marked_p tree_map_base_marked_p
4924 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
4926 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
4928 equal (tree_decl_map
*a
, tree_decl_map
*b
)
4930 return tree_decl_map_eq (a
, b
);
4934 keep_cache_entry (tree_decl_map
*&m
)
4936 return ggc_marked_p (m
->base
.from
);
4940 #define tree_int_map_eq tree_map_base_eq
4941 #define tree_int_map_hash tree_map_base_hash
4942 #define tree_int_map_marked_p tree_map_base_marked_p
4944 #define tree_vec_map_eq tree_map_base_eq
4945 #define tree_vec_map_hash tree_decl_map_hash
4946 #define tree_vec_map_marked_p tree_map_base_marked_p
4948 /* Initialize the abstract argument list iterator object ITER with the
4949 arguments from CALL_EXPR node EXP. */
4951 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
4954 iter
->n
= call_expr_nargs (exp
);
4959 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
4962 iter
->n
= call_expr_nargs (exp
);
4966 /* Return the next argument from abstract argument list iterator object ITER,
4967 and advance its state. Return NULL_TREE if there are no more arguments. */
4969 next_call_expr_arg (call_expr_arg_iterator
*iter
)
4972 if (iter
->i
>= iter
->n
)
4974 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4979 static inline const_tree
4980 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
4983 if (iter
->i
>= iter
->n
)
4985 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
4990 /* Initialize the abstract argument list iterator object ITER, then advance
4991 past and return the first argument. Useful in for expressions, e.g.
4992 for (arg = first_call_expr_arg (exp, &iter); arg;
4993 arg = next_call_expr_arg (&iter)) */
4995 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
4997 init_call_expr_arg_iterator (exp
, iter
);
4998 return next_call_expr_arg (iter
);
5001 static inline const_tree
5002 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5004 init_const_call_expr_arg_iterator (exp
, iter
);
5005 return next_const_call_expr_arg (iter
);
5008 /* Test whether there are more arguments in abstract argument list iterator
5009 ITER, without changing its state. */
5011 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5013 return (iter
->i
< iter
->n
);
5016 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5017 (of type call_expr_arg_iterator) to hold the iteration state. */
5018 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5019 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5020 (arg) = next_call_expr_arg (&(iter)))
5022 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5023 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5024 (arg) = next_const_call_expr_arg (&(iter)))
5026 /* Return true if tree node T is a language-specific node. */
5028 is_lang_specific (const_tree t
)
5030 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5033 /* Valid builtin number. */
5034 #define BUILTIN_VALID_P(FNCODE) \
5035 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5037 /* Return the tree node for an explicit standard builtin function or NULL. */
5039 builtin_decl_explicit (enum built_in_function fncode
)
5041 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5043 return builtin_info
[(size_t)fncode
].decl
;
5046 /* Return the tree node for an implicit builtin function or NULL. */
5048 builtin_decl_implicit (enum built_in_function fncode
)
5050 size_t uns_fncode
= (size_t)fncode
;
5051 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5053 if (!builtin_info
[uns_fncode
].implicit_p
)
5056 return builtin_info
[uns_fncode
].decl
;
5059 /* Set explicit builtin function nodes and whether it is an implicit
5063 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5065 size_t ufncode
= (size_t)fncode
;
5067 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5068 && (decl
!= NULL_TREE
|| !implicit_p
));
5070 builtin_info
[ufncode
].decl
= decl
;
5071 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5072 builtin_info
[ufncode
].declared_p
= false;
5075 /* Set the implicit flag for a builtin function. */
5078 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5080 size_t uns_fncode
= (size_t)fncode
;
5082 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5083 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5085 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5088 /* Set the declared flag for a builtin function. */
5091 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5093 size_t uns_fncode
= (size_t)fncode
;
5095 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5096 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5098 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5101 /* Return whether the standard builtin function can be used as an explicit
5105 builtin_decl_explicit_p (enum built_in_function fncode
)
5107 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5108 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5111 /* Return whether the standard builtin function can be used implicitly. */
5114 builtin_decl_implicit_p (enum built_in_function fncode
)
5116 size_t uns_fncode
= (size_t)fncode
;
5118 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5119 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5120 && builtin_info
[uns_fncode
].implicit_p
);
5123 /* Return whether the standard builtin function was declared. */
5126 builtin_decl_declared_p (enum built_in_function fncode
)
5128 size_t uns_fncode
= (size_t)fncode
;
5130 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5131 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5132 && builtin_info
[uns_fncode
].declared_p
);
5135 /* Return true if T (assumed to be a DECL) is a global variable.
5136 A variable is considered global if its storage is not automatic. */
5139 is_global_var (const_tree t
)
5141 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5144 /* Return true if VAR may be aliased. A variable is considered as
5145 maybe aliased if it has its address taken by the local TU
5146 or possibly by another TU and might be modified through a pointer. */
5149 may_be_aliased (const_tree var
)
5151 return (TREE_CODE (var
) != CONST_DECL
5152 && (TREE_PUBLIC (var
)
5153 || DECL_EXTERNAL (var
)
5154 || TREE_ADDRESSABLE (var
))
5155 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5156 && ((TREE_READONLY (var
)
5157 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5158 || (TREE_CODE (var
) == VAR_DECL
5159 && DECL_NONALIASED (var
)))));
5162 /* Return pointer to optimization flags of FNDECL. */
5163 static inline struct cl_optimization
*
5164 opts_for_fn (const_tree fndecl
)
5166 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5167 if (fn_opts
== NULL_TREE
)
5168 fn_opts
= optimization_default_node
;
5169 return TREE_OPTIMIZATION (fn_opts
);
5172 /* Return pointer to target flags of FNDECL. */
5173 static inline cl_target_option
*
5174 target_opts_for_fn (const_tree fndecl
)
5176 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5177 if (fn_opts
== NULL_TREE
)
5178 fn_opts
= target_option_default_node
;
5179 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5182 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5183 the optimization level of function fndecl. */
5184 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5186 /* For anonymous aggregate types, we need some sort of name to
5187 hold on to. In practice, this should not appear, but it should
5188 not be harmful if it does. */
5189 extern const char *anon_aggrname_format();
5190 extern bool anon_aggrname_p (const_tree
);
5192 /* The tree and const_tree overload templates. */
5196 struct int_traits
<const_tree
>
5198 static const enum precision_type precision_type
= VAR_PRECISION
;
5199 static const bool host_dependent_precision
= false;
5200 static const bool is_sign_extended
= false;
5201 static unsigned int get_precision (const_tree
);
5202 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
5207 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
5216 extended_tree (const_tree
);
5218 unsigned int get_precision () const;
5219 const HOST_WIDE_INT
*get_val () const;
5220 unsigned int get_len () const;
5224 struct int_traits
<extended_tree
<N
> >
5226 static const enum precision_type precision_type
= CONST_PRECISION
;
5227 static const bool host_dependent_precision
= false;
5228 static const bool is_sign_extended
= true;
5229 static const unsigned int precision
= N
;
5232 generic_wide_int
<extended_tree
<WIDE_INT_MAX_PRECISION
> >
5233 to_widest (const_tree
);
5235 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
5237 wide_int
to_wide (const_tree
, unsigned int);
5241 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
5243 return TYPE_PRECISION (TREE_TYPE (tcst
));
5246 /* Convert the tree_cst X into a wide_int of PRECISION. */
5247 inline wi::storage_ref
5248 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
5249 unsigned int precision
, const_tree x
)
5251 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
5255 inline generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
> >
5256 wi::to_widest (const_tree t
)
5261 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
5262 wi::to_offset (const_tree t
)
5267 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5268 truncating as necessary. When extending, use sign extension if T's
5269 type is signed and zero extension if T's type is unsigned. */
5272 wi::to_wide (const_tree t
, unsigned int prec
)
5274 return wide_int::from (t
, prec
, TYPE_SIGN (TREE_TYPE (t
)));
5278 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5281 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5286 wi::extended_tree
<N
>::get_precision () const
5292 inline const HOST_WIDE_INT
*
5293 wi::extended_tree
<N
>::get_val () const
5295 return &TREE_INT_CST_ELT (m_t
, 0);
5300 wi::extended_tree
<N
>::get_len () const
5302 if (N
== ADDR_MAX_PRECISION
)
5303 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5304 else if (N
>= WIDE_INT_MAX_PRECISION
)
5305 return TREE_INT_CST_EXT_NUNITS (m_t
);
5307 /* This class is designed to be used for specific output precisions
5308 and needs to be as fast as possible, so there is no fallback for
5315 template <typename T
>
5316 bool fits_to_tree_p (const T
&x
, const_tree
);
5318 wide_int
min_value (const_tree
);
5319 wide_int
max_value (const_tree
);
5320 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5323 template <typename T
>
5325 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5327 if (TYPE_SIGN (type
) == UNSIGNED
)
5328 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5330 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5333 /* Produce the smallest number that is represented in TYPE. The precision
5334 and sign are taken from TYPE. */
5336 wi::min_value (const_tree type
)
5338 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5341 /* Produce the largest number that is represented in TYPE. The precision
5342 and sign are taken from TYPE. */
5344 wi::max_value (const_tree type
)
5346 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5349 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5350 extending both according to their respective TYPE_SIGNs. */
5353 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5355 return wi::to_widest (t1
) < wi::to_widest (t2
);
5358 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5359 extending both according to their respective TYPE_SIGNs. */
5362 tree_int_cst_le (const_tree t1
, const_tree t2
)
5364 return wi::to_widest (t1
) <= wi::to_widest (t2
);
5367 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5368 are both INTEGER_CSTs and their values are extended according to their
5369 respective TYPE_SIGNs. */
5372 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5374 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5377 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5378 but none of these files are allowed to be included from front ends.
5379 They should be split in two. One suitable for the FEs, the other suitable
5382 /* Assign the RTX to declaration. */
5383 extern void set_decl_rtl (tree
, rtx
);
5384 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5386 /* Given an expression EXP that is a handled_component_p,
5387 look for the ultimate containing object, which is returned and specify
5388 the access position and size. */
5389 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5390 tree
*, machine_mode
*, int *, int *,
5393 extern tree
build_personality_function (const char *);
5395 struct GTY(()) int_n_trees_t
{
5396 /* These parts are initialized at runtime */
5401 /* This is also in machmode.h */
5402 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5403 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5405 /* Like bit_position, but return as an integer. It must be representable in
5406 that way (since it could be a signed value, we don't have the
5407 option of returning -1 like int_size_in_byte can. */
5409 inline HOST_WIDE_INT
5410 int_bit_position (const_tree field
)
5412 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << BITS_PER_UNIT_LOG
)
5413 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5416 /* Return true if it makes sense to consider alias set for a type T. */
5419 type_with_alias_set_p (const_tree t
)
5421 /* Function and method types are never accessed as memory locations. */
5422 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5425 if (COMPLETE_TYPE_P (t
))
5428 /* Incomplete types can not be accessed in general except for arrays
5429 where we can fetch its element despite we have no array bounds. */
5430 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5436 extern location_t
get_pure_location (location_t loc
);
5438 /* Get the endpoint of any range encoded within location LOC. */
5440 static inline location_t
5441 get_finish (location_t loc
)
5443 return get_range_from_loc (line_table
, loc
).m_finish
;
5446 extern location_t
set_block (location_t loc
, tree block
);
5448 extern void gt_ggc_mx (tree
&);
5449 extern void gt_pch_nx (tree
&);
5450 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5452 extern bool nonnull_arg_p (const_tree
);
5453 extern bool is_redundant_typedef (const_tree
);
5456 set_source_range (tree expr
, location_t start
, location_t finish
);
5459 set_source_range (tree expr
, source_range src_range
);
5461 static inline source_range
5462 get_decl_source_range (tree decl
)
5464 location_t loc
= DECL_SOURCE_LOCATION (decl
);
5465 return get_range_from_loc (line_table
, loc
);
5469 make_location (location_t caret
, location_t start
, location_t finish
);
5471 /* Return true if it makes sense to promote/demote from_type to to_type. */
5473 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
5475 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
5477 /* OK to promote if to_type is no bigger than word_mode. */
5478 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
5481 /* Otherwise, allow only if narrowing or same precision conversions. */
5482 return to_type_precision
<= TYPE_PRECISION (from_type
);
5485 #endif /* GCC_TREE_H */