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 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
665 CASE_LOW operand has been processed. */
666 #define CASE_LOW_SEEN(NODE) \
667 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
669 #define PREDICT_EXPR_OUTCOME(NODE) \
670 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
671 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
672 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
673 #define PREDICT_EXPR_PREDICTOR(NODE) \
674 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
676 /* In a VAR_DECL, nonzero means allocate static storage.
677 In a FUNCTION_DECL, nonzero if function has been defined.
678 In a CONSTRUCTOR, nonzero means allocate static storage. */
679 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
681 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
682 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
684 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
685 should only be executed if an exception is thrown, not on normal exit
687 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
689 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
690 separate cleanup in honor_protect_cleanup_actions. */
691 #define TRY_CATCH_IS_CLEANUP(NODE) \
692 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
694 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
695 CASE_HIGH operand has been processed. */
696 #define CASE_HIGH_SEEN(NODE) \
697 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
699 /* Used to mark scoped enums. */
700 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
702 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
703 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
705 /* In an expr node (usually a conversion) this means the node was made
706 implicitly and should not lead to any sort of warning. In a decl node,
707 warnings concerning the decl should be suppressed. This is used at
708 least for used-before-set warnings, and it set after one warning is
710 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
712 /* Used to indicate that this TYPE represents a compiler-generated entity. */
713 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
715 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
716 this string as an argument. */
717 #define TREE_SYMBOL_REFERENCED(NODE) \
718 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
720 /* Nonzero in a pointer or reference type means the data pointed to
721 by this type can alias anything. */
722 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
723 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
725 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
726 there was an overflow in folding. */
728 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
730 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
732 #define TREE_OVERFLOW_P(EXPR) \
733 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
735 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
736 nonzero means name is to be accessible from outside this translation unit.
737 In an IDENTIFIER_NODE, nonzero means an external declaration
738 accessible from outside this translation unit was previously seen
739 for this name in an inner scope. */
740 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
742 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
743 of cached values, or is something else. */
744 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
746 /* In a SAVE_EXPR, indicates that the original expression has already
747 been substituted with a VAR_DECL that contains the value. */
748 #define SAVE_EXPR_RESOLVED_P(NODE) \
749 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
751 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
753 #define CALL_EXPR_VA_ARG_PACK(NODE) \
754 (CALL_EXPR_CHECK (NODE)->base.public_flag)
756 /* In any expression, decl, or constant, nonzero means it has side effects or
757 reevaluation of the whole expression could produce a different value.
758 This is set if any subexpression is a function call, a side effect or a
759 reference to a volatile variable. In a ..._DECL, this is set only if the
760 declaration said `volatile'. This will never be set for a constant. */
761 #define TREE_SIDE_EFFECTS(NODE) \
762 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
764 /* In a LABEL_DECL, nonzero means this label had its address taken
765 and therefore can never be deleted and is a jump target for
767 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
769 /* Nonzero means this expression is volatile in the C sense:
770 its address should be of type `volatile WHATEVER *'.
771 In other words, the declared item is volatile qualified.
772 This is used in _DECL nodes and _REF nodes.
773 On a FUNCTION_DECL node, this means the function does not
774 return normally. This is the same effect as setting
775 the attribute noreturn on the function in C.
777 In a ..._TYPE node, means this type is volatile-qualified.
778 But use TYPE_VOLATILE instead of this macro when the node is a type,
779 because eventually we may make that a different bit.
781 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
782 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
784 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
785 accessing the memory pointed to won't generate a trap. However,
786 this only applies to an object when used appropriately: it doesn't
787 mean that writing a READONLY mem won't trap.
789 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
790 (or slice of the array) always belongs to the range of the array.
791 I.e. that the access will not trap, provided that the access to
792 the base to the array will not trap. */
793 #define TREE_THIS_NOTRAP(NODE) \
794 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
795 ARRAY_RANGE_REF)->base.nothrow_flag)
797 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
798 nonzero means it may not be the lhs of an assignment.
799 Nonzero in a FUNCTION_DECL means this function should be treated
800 as "const" function (can only read its arguments). */
801 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
803 /* Value of expression is constant. Always on in all ..._CST nodes. May
804 also appear in an expression or decl where the value is constant. */
805 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
807 /* Nonzero if NODE, a type, has had its sizes gimplified. */
808 #define TYPE_SIZES_GIMPLIFIED(NODE) \
809 (TYPE_CHECK (NODE)->base.constant_flag)
811 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
812 #define DECL_UNSIGNED(NODE) \
813 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
815 /* In integral and pointer types, means an unsigned type. */
816 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
818 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
819 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
821 /* True if overflow wraps around for the given integral type. That
822 is, TYPE_MAX + 1 == TYPE_MIN. */
823 #define TYPE_OVERFLOW_WRAPS(TYPE) \
824 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
826 /* True if overflow is undefined for the given integral type. We may
827 optimize on the assumption that values in the type never overflow.
829 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
830 must issue a warning based on warn_strict_overflow. In some cases
831 it will be appropriate to issue the warning immediately, and in
832 other cases it will be appropriate to simply set a flag and let the
833 caller decide whether a warning is appropriate or not. */
834 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
835 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
836 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
838 /* True if overflow for the given integral type should issue a
840 #define TYPE_OVERFLOW_TRAPS(TYPE) \
841 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
843 /* True if an overflow is to be preserved for sanitization. */
844 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
845 (INTEGRAL_TYPE_P (TYPE) \
846 && (flag_sanitize & (SANITIZE_SI_OVERFLOW | SANITIZE_UI_OVERFLOW)))
848 /* True if pointer types have undefined overflow. */
849 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
851 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
852 Nonzero in a FUNCTION_DECL means that the function has been compiled.
853 This is interesting in an inline function, since it might not need
854 to be compiled separately.
855 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
856 or TYPE_DECL if the debugging info for the type has been written.
857 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
858 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
860 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
862 /* Nonzero in a _DECL if the name is used in its scope.
863 Nonzero in an expr node means inhibit warning if value is unused.
864 In IDENTIFIER_NODEs, this means that some extern decl for this name
866 In a BLOCK, this means that the block contains variables that are used. */
867 #define TREE_USED(NODE) ((NODE)->base.used_flag)
869 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
870 throw an exception. In a CALL_EXPR, nonzero means the call cannot
871 throw. We can't easily check the node type here as the C++
872 frontend also uses this flag (for AGGR_INIT_EXPR). */
873 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
875 /* In a CALL_EXPR, means that it's safe to use the target of the call
876 expansion as the return slot for a call that returns in memory. */
877 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
878 (CALL_EXPR_CHECK (NODE)->base.private_flag)
880 /* Cilk keywords accessors. */
881 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
883 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
884 passed by invisible reference (and the TREE_TYPE is a pointer to the true
886 #define DECL_BY_REFERENCE(NODE) \
887 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
888 RESULT_DECL)->decl_common.decl_by_reference_flag)
890 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
892 #define DECL_READ_P(NODE) \
893 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
895 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
896 attempting to share the stack slot with some other variable. */
897 #define DECL_NONSHAREABLE(NODE) \
898 (TREE_CHECK2 (NODE, VAR_DECL, \
899 RESULT_DECL)->decl_common.decl_nonshareable_flag)
901 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
902 thunked-to function. */
903 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
905 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
906 it has been built for the declaration of a variable-sized object. */
907 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
908 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
910 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
911 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
913 /* In a type, nonzero means that all objects of the type are guaranteed by the
914 language or front-end to be properly aligned, so we can indicate that a MEM
915 of this type is aligned at least to the alignment of the type, even if it
916 doesn't appear that it is. We see this, for example, in object-oriented
917 languages where a tag field may show this is an object of a more-aligned
918 variant of the more generic type.
920 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
922 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
924 /* Used in classes in C++. */
925 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
926 /* Used in classes in C++. */
927 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
929 /* True if reference type NODE is a C++ rvalue reference. */
930 #define TYPE_REF_IS_RVALUE(NODE) \
931 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
933 /* Nonzero in a _DECL if the use of the name is defined as a
934 deprecated feature by __attribute__((deprecated)). */
935 #define TREE_DEPRECATED(NODE) \
936 ((NODE)->base.deprecated_flag)
938 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
939 uses are to be substituted for uses of the TREE_CHAINed identifier. */
940 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
941 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
943 /* In an aggregate type, indicates that the scalar fields of the type are
944 stored in reverse order from the target order. This effectively
945 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
946 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
947 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
949 /* In a non-aggregate type, indicates a saturating type. */
950 #define TYPE_SATURATING(NODE) \
951 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
953 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
954 of bits stored in reverse order from the target order. This effectively
955 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
957 The overall strategy is to preserve the invariant that every scalar in
958 memory is associated with a single storage order, i.e. all accesses to
959 this scalar are done with the same storage order. This invariant makes
960 it possible to factor out the storage order in most transformations, as
961 only the address and/or the value (in target order) matter for them.
962 But, of course, the storage order must be preserved when the accesses
963 themselves are rewritten or transformed. */
964 #define REF_REVERSE_STORAGE_ORDER(NODE) \
965 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
967 /* These flags are available for each language front end to use internally. */
968 #define TREE_LANG_FLAG_0(NODE) \
969 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
970 #define TREE_LANG_FLAG_1(NODE) \
971 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
972 #define TREE_LANG_FLAG_2(NODE) \
973 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
974 #define TREE_LANG_FLAG_3(NODE) \
975 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
976 #define TREE_LANG_FLAG_4(NODE) \
977 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
978 #define TREE_LANG_FLAG_5(NODE) \
979 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
980 #define TREE_LANG_FLAG_6(NODE) \
981 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
983 /* Define additional fields and accessors for nodes representing constants. */
985 #define TREE_INT_CST_NUNITS(NODE) \
986 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
987 #define TREE_INT_CST_EXT_NUNITS(NODE) \
988 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
989 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
990 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
991 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
992 #define TREE_INT_CST_LOW(NODE) \
993 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
995 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
996 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
998 #define TREE_FIXED_CST_PTR(NODE) \
999 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1000 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1002 /* In a STRING_CST */
1003 /* In C terms, this is sizeof, not strlen. */
1004 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1005 #define TREE_STRING_POINTER(NODE) \
1006 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1008 /* In a COMPLEX_CST node. */
1009 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1010 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1012 /* In a VECTOR_CST node. */
1013 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1014 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1015 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1017 /* Define fields and accessors for some special-purpose tree nodes. */
1019 #define IDENTIFIER_LENGTH(NODE) \
1020 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1021 #define IDENTIFIER_POINTER(NODE) \
1022 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1023 #define IDENTIFIER_HASH_VALUE(NODE) \
1024 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1026 /* Translate a hash table identifier pointer to a tree_identifier
1027 pointer, and vice versa. */
1029 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1030 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1031 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1033 /* In a TREE_LIST node. */
1034 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1035 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1037 /* In a TREE_VEC node. */
1038 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1039 #define TREE_VEC_END(NODE) \
1040 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1042 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1044 /* In a CONSTRUCTOR node. */
1045 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1046 #define CONSTRUCTOR_ELT(NODE,IDX) \
1047 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1048 #define CONSTRUCTOR_NELTS(NODE) \
1049 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1050 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1051 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1053 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1054 value of each element (stored within VAL). IX must be a scratch variable
1055 of unsigned integer type. */
1056 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1057 for (IX = 0; (IX >= vec_safe_length (V)) \
1059 : ((VAL = (*(V))[IX].value), \
1063 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1064 the value of each element (stored within VAL) and its index (stored
1065 within INDEX). IX must be a scratch variable of unsigned integer type. */
1066 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1067 for (IX = 0; (IX >= vec_safe_length (V)) \
1069 : (((void) (VAL = (*V)[IX].value)), \
1070 (INDEX = (*V)[IX].index), \
1074 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1075 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1077 constructor_elt _ce___ = {INDEX, VALUE}; \
1078 vec_safe_push ((V), _ce___); \
1081 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1082 constructor output purposes. */
1083 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1084 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1086 /* True if NODE is a clobber right hand side, an expression of indeterminate
1087 value that clobbers the LHS in a copy instruction. We use a volatile
1088 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1089 In particular the volatile flag causes us to not prematurely remove
1090 such clobber instructions. */
1091 #define TREE_CLOBBER_P(NODE) \
1092 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1094 /* Define fields and accessors for some nodes that represent expressions. */
1096 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1097 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1098 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1099 && integer_zerop (TREE_OPERAND (NODE, 0)))
1101 /* In ordinary expression nodes. */
1102 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1103 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1105 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1106 length. Its value includes the length operand itself; that is,
1107 the minimum valid length is 1.
1108 Note that we have to bypass the use of TREE_OPERAND to access
1109 that field to avoid infinite recursion in expanding the macros. */
1110 #define VL_EXP_OPERAND_LENGTH(NODE) \
1111 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1113 /* Nonzero if is_gimple_debug() may possibly hold. */
1114 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1116 /* In a LOOP_EXPR node. */
1117 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1119 /* The source location of this expression. Non-tree_exp nodes such as
1120 decls and constants can be shared among multiple locations, so
1122 #define EXPR_LOCATION(NODE) \
1123 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1124 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1125 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1126 != UNKNOWN_LOCATION)
1127 /* The location to be used in a diagnostic about this expression. Do not
1128 use this macro if the location will be assigned to other expressions. */
1129 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1130 ? (NODE)->exp.locus : (LOCUS))
1131 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1132 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1134 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1135 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1137 #define EXPR_HAS_RANGE(NODE) \
1138 (CAN_HAVE_RANGE_P (NODE) \
1139 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1142 /* True if a tree is an expression or statement that can have a
1144 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1146 static inline source_range
1147 get_expr_source_range (tree expr)
1149 location_t loc = EXPR_LOCATION (expr);
1150 return get_range_from_loc (line_table, loc);
1153 extern void protected_set_expr_location (tree, location_t);
1155 /* In a TARGET_EXPR node. */
1156 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1157 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1158 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1160 /* DECL_EXPR accessor. This gives access to the DECL associated with
1161 the given declaration statement. */
1162 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1164 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1166 /* COMPOUND_LITERAL_EXPR accessors. */
1167 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1168 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1169 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1170 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1172 /* SWITCH_EXPR accessors. These give access to the condition, body and
1173 original condition type (before any compiler conversions)
1174 of the switch statement, respectively. */
1175 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1176 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1177 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1179 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1180 of a case label, respectively. */
1181 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1182 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1183 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1184 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1186 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1187 corresponding MEM_REF operands. */
1188 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1189 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1190 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1191 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1192 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1194 #define MR_DEPENDENCE_CLIQUE(NODE) \
1195 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1196 #define MR_DEPENDENCE_BASE(NODE) \
1197 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1199 /* The operands of a BIND_EXPR. */
1200 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1201 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1202 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1204 /* GOTO_EXPR accessor. This gives access to the label associated with
1205 a goto statement. */
1206 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1208 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1209 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1210 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1212 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1213 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1214 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1215 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1216 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1217 /* Nonzero if we want to create an ASM_INPUT instead of an
1218 ASM_OPERAND with no operands. */
1219 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1220 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1222 /* COND_EXPR accessors. */
1223 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1224 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1225 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1227 /* Accessors for the chains of recurrences. */
1228 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1229 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1230 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1231 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1233 /* LABEL_EXPR accessor. This gives access to the label associated with
1234 the given label expression. */
1235 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1237 /* CATCH_EXPR accessors. */
1238 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1239 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1241 /* EH_FILTER_EXPR accessors. */
1242 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1243 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1245 /* OBJ_TYPE_REF accessors. */
1246 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1247 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1248 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1250 /* ASSERT_EXPR accessors. */
1251 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1252 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1254 /* CALL_EXPR accessors. */
1255 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1256 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1257 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1258 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1259 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1261 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1262 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1263 the argument count is zero when checking is enabled. Instead, do
1264 the pointer arithmetic to advance past the 3 fixed operands in a
1265 CALL_EXPR. That produces a valid pointer to just past the end of the
1266 operand array, even if it's not valid to dereference it. */
1267 #define CALL_EXPR_ARGP(NODE) \
1268 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1270 /* TM directives and accessors. */
1271 #define TRANSACTION_EXPR_BODY(NODE) \
1272 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1273 #define TRANSACTION_EXPR_OUTER(NODE) \
1274 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1275 #define TRANSACTION_EXPR_RELAXED(NODE) \
1276 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1278 /* OpenMP and OpenACC directive and clause accessors. */
1280 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1282 #define OMP_BODY(NODE) \
1283 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1284 #define OMP_CLAUSES(NODE) \
1285 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1287 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1288 #define OMP_STANDALONE_CLAUSES(NODE) \
1289 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1291 #define OACC_DATA_BODY(NODE) \
1292 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1293 #define OACC_DATA_CLAUSES(NODE) \
1294 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1296 #define OACC_HOST_DATA_BODY(NODE) \
1297 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1298 #define OACC_HOST_DATA_CLAUSES(NODE) \
1299 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1301 #define OACC_CACHE_CLAUSES(NODE) \
1302 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1304 #define OACC_DECLARE_CLAUSES(NODE) \
1305 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1307 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1308 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1310 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1311 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1313 #define OACC_UPDATE_CLAUSES(NODE) \
1314 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1316 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1317 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1319 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1320 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1322 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1323 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1324 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1326 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1327 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1328 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1329 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1330 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1331 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1332 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1333 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1335 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1336 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1338 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1340 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1341 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1343 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1345 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1347 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1348 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1350 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1351 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1352 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1354 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1355 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1357 #define OMP_TARGET_DATA_BODY(NODE) \
1358 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1359 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1360 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1362 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1363 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1365 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1366 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1368 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1369 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1371 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1372 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1374 #define OMP_CLAUSE_SIZE(NODE) \
1375 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1377 OMP_CLAUSE__CACHE_), 1)
1379 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1380 #define OMP_CLAUSE_DECL(NODE) \
1381 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1382 OMP_CLAUSE_PRIVATE, \
1383 OMP_CLAUSE__LOOPTEMP_), 0)
1384 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1385 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1386 != UNKNOWN_LOCATION)
1387 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1389 /* True on an OMP_SECTION statement that was the last lexical member.
1390 This status is meaningful in the implementation of lastprivate. */
1391 #define OMP_SECTION_LAST(NODE) \
1392 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1394 /* True on an OMP_PARALLEL statement if it represents an explicit
1395 combined parallel work-sharing constructs. */
1396 #define OMP_PARALLEL_COMBINED(NODE) \
1397 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1399 /* True on an OMP_TEAMS statement if it represents an explicit
1400 combined teams distribute constructs. */
1401 #define OMP_TEAMS_COMBINED(NODE) \
1402 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1404 /* True on an OMP_TARGET statement if it represents explicit
1405 combined target teams, target parallel or target simd constructs. */
1406 #define OMP_TARGET_COMBINED(NODE) \
1407 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1409 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1410 as opposed to relaxed. */
1411 #define OMP_ATOMIC_SEQ_CST(NODE) \
1412 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1413 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1415 /* True on a PRIVATE clause if its decl is kept around for debugging
1416 information only and its DECL_VALUE_EXPR is supposed to point
1417 to what it has been remapped to. */
1418 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1419 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1421 /* True on a PRIVATE clause if ctor needs access to outer region's
1423 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1424 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1426 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1427 (thus should be private on the outer taskloop and firstprivate on
1429 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1430 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1432 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1433 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1434 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1436 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1437 decl is present in the chain. */
1438 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1439 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1440 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1441 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1442 OMP_CLAUSE_LASTPRIVATE),\
1444 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1445 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1447 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1448 (thus should be lastprivate on the outer taskloop and firstprivate on
1450 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1451 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1453 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1454 decl is present in the chain (this can happen only for taskloop
1455 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1456 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1457 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1459 /* True on a SHARED clause if a scalar is not modified in the body and
1460 thus could be optimized as firstprivate. */
1461 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1462 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1464 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1465 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1467 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1468 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1469 #define OMP_CLAUSE_IF_EXPR(NODE) \
1470 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1471 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1472 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1473 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1474 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1475 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1476 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1477 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1478 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1480 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1481 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1483 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1484 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1486 /* OpenACC clause expressions */
1487 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1488 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1489 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1490 OMP_CLAUSE_OPERAND ( \
1491 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1492 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1493 OMP_CLAUSE_OPERAND ( \
1494 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1495 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1496 OMP_CLAUSE_OPERAND ( \
1497 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1498 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1499 OMP_CLAUSE_OPERAND ( \
1500 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1501 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1502 OMP_CLAUSE_OPERAND ( \
1503 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1504 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1505 OMP_CLAUSE_OPERAND ( \
1506 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1507 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1508 OMP_CLAUSE_OPERAND ( \
1509 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1510 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1511 OMP_CLAUSE_OPERAND ( \
1512 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1513 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1514 OMP_CLAUSE_OPERAND ( \
1515 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1517 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1518 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1520 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1521 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1523 #define OMP_CLAUSE_MAP_KIND(NODE) \
1524 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1525 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1526 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1527 = (unsigned int) (MAP_KIND))
1529 /* Nonzero if this map clause is for array (rather than pointer) based array
1530 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1531 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1532 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1533 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1534 /* Nonzero if this is a mapped array section, that might need special
1535 treatment if OMP_CLAUSE_SIZE is zero. */
1536 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1537 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1538 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1539 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1540 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1542 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1543 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1545 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1546 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1547 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1548 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1549 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1550 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1552 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1553 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1555 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1556 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1557 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1558 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1559 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1560 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1561 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1562 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1563 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1564 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1565 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1566 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1567 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1568 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1570 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1571 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1572 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1573 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1575 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1576 are always initialized inside of the loop construct, false otherwise. */
1577 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1578 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1580 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1581 are declared inside of the simd construct. */
1582 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1583 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1585 /* True if a LINEAR clause has a stride that is variable. */
1586 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1587 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1589 /* True if a LINEAR clause is for an array or allocatable variable that
1590 needs special handling by the frontend. */
1591 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1592 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1594 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1595 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1597 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1598 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1600 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1601 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1603 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1604 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1606 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1607 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1609 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1610 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1612 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1613 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1614 OMP_CLAUSE_THREAD_LIMIT), 0)
1616 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1617 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1619 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1620 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1621 OMP_CLAUSE_DIST_SCHEDULE), 0)
1623 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1624 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1626 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1627 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1629 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1630 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1632 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1633 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1635 /* True if a SCHEDULE clause has the simd modifier on it. */
1636 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1637 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1639 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1640 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1642 #define OMP_CLAUSE_TILE_LIST(NODE) \
1643 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1645 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1646 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1647 ->omp_clause.subcode.dimension)
1648 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1649 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1650 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1651 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1653 /* SSA_NAME accessors. */
1655 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1656 if there is no name associated with it. */
1657 #define SSA_NAME_IDENTIFIER(NODE) \
1658 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1659 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1660 ? (NODE)->ssa_name.var \
1661 : DECL_NAME ((NODE)->ssa_name.var)) \
1664 /* Returns the variable being referenced. This can be NULL_TREE for
1665 temporaries not associated with any user variable.
1666 Once released, this is the only field that can be relied upon. */
1667 #define SSA_NAME_VAR(NODE) \
1668 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1669 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1670 ? NULL_TREE : (NODE)->ssa_name.var)
1672 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1673 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1675 /* Returns the statement which defines this SSA name. */
1676 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1678 /* Returns the SSA version number of this SSA name. Note that in
1679 tree SSA, version numbers are not per variable and may be recycled. */
1680 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1682 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1683 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1685 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1686 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1688 /* Nonzero if this SSA_NAME expression is currently on the free list of
1689 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1690 has no meaning for an SSA_NAME. */
1691 #define SSA_NAME_IN_FREE_LIST(NODE) \
1692 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1694 /* Nonzero if this SSA_NAME is the default definition for the
1695 underlying symbol. A default SSA name is created for symbol S if
1696 the very first reference to S in the function is a read operation.
1697 Default definitions are always created by an empty statement and
1698 belong to no basic block. */
1699 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1700 SSA_NAME_CHECK (NODE)->base.default_def_flag
1702 /* Attributes for SSA_NAMEs for pointer-type variables. */
1703 #define SSA_NAME_PTR_INFO(N) \
1704 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1706 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1707 #define SSA_NAME_ANTI_RANGE_P(N) \
1708 SSA_NAME_CHECK (N)->base.static_flag
1710 /* The type of range described by SSA_NAME_RANGE_INFO. */
1711 #define SSA_NAME_RANGE_TYPE(N) \
1712 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1714 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1715 #define SSA_NAME_RANGE_INFO(N) \
1716 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1718 /* Return the immediate_use information for an SSA_NAME. */
1719 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1721 #define OMP_CLAUSE_CODE(NODE) \
1722 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1724 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1725 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1727 #define OMP_CLAUSE_OPERAND(NODE, I) \
1728 OMP_CLAUSE_ELT_CHECK (NODE, I)
1730 /* In a BLOCK node. */
1731 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1732 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1733 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1734 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1735 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1736 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1737 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1738 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1739 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1740 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1741 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1742 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1744 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1745 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1747 /* An index number for this block. These values are not guaranteed to
1748 be unique across functions -- whether or not they are depends on
1749 the debugging output format in use. */
1750 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1752 /* If block reordering splits a lexical block into discontiguous
1753 address ranges, we'll make a copy of the original block.
1755 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1756 In that case, we have one source block that has been replicated
1757 (through inlining or unrolling) into many logical blocks, and that
1758 these logical blocks have different physical variables in them.
1760 In this case, we have one logical block split into several
1761 non-contiguous address ranges. Most debug formats can't actually
1762 represent this idea directly, so we fake it by creating multiple
1763 logical blocks with the same variables in them. However, for those
1764 that do support non-contiguous regions, these allow the original
1765 logical block to be reconstructed, along with the set of address
1768 One of the logical block fragments is arbitrarily chosen to be
1769 the ORIGIN. The other fragments will point to the origin via
1770 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1771 be null. The list of fragments will be chained through
1772 BLOCK_FRAGMENT_CHAIN from the origin. */
1774 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1775 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1777 /* For an inlined function, this gives the location where it was called
1778 from. This is only set in the top level block, which corresponds to the
1779 inlined function scope. This is used in the debug output routines. */
1781 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1783 /* This gives the location of the end of the block, useful to attach
1784 code implicitly generated for outgoing paths. */
1786 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1788 /* Define fields and accessors for nodes representing data types. */
1790 /* See tree.def for documentation of the use of these fields.
1791 Look at the documentation of the various ..._TYPE tree codes.
1793 Note that the type.values, type.minval, and type.maxval fields are
1794 overloaded and used for different macros in different kinds of types.
1795 Each macro must check to ensure the tree node is of the proper kind of
1796 type. Note also that some of the front-ends also overload these fields,
1797 so they must be checked as well. */
1799 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1800 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1801 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1802 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1803 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1804 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1805 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1806 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1807 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1808 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1810 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1811 #define TYPE_MODE(NODE) \
1812 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1813 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1814 #define SET_TYPE_MODE(NODE, MODE) \
1815 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1817 extern machine_mode element_mode (const_tree t);
1819 /* The "canonical" type for this type node, which is used by frontends to
1820 compare the type for equality with another type. If two types are
1821 equal (based on the semantics of the language), then they will have
1822 equivalent TYPE_CANONICAL entries.
1824 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1825 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1826 be used for comparison against other types. Instead, the type is
1827 said to require structural equality checks, described in
1828 TYPE_STRUCTURAL_EQUALITY_P.
1830 For unqualified aggregate and function types the middle-end relies on
1831 TYPE_CANONICAL to tell whether two variables can be assigned
1832 to each other without a conversion. The middle-end also makes sure
1833 to assign the same alias-sets to the type partition with equal
1834 TYPE_CANONICAL of their unqualified variants. */
1835 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1836 /* Indicates that the type node requires structural equality
1837 checks. The compiler will need to look at the composition of the
1838 type to determine whether it is equal to another type, rather than
1839 just comparing canonical type pointers. For instance, we would need
1840 to look at the return and parameter types of a FUNCTION_TYPE
1842 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1843 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1844 type node requires structural equality. */
1845 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1847 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1848 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1850 /* The (language-specific) typed-based alias set for this type.
1851 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1852 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1853 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1854 type can alias objects of any type. */
1855 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1857 /* Nonzero iff the typed-based alias set for this type has been
1859 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1860 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1862 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1864 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1866 /* The alignment necessary for objects of this type.
1867 The value is an int, measured in bits. */
1868 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1870 /* 1 if the alignment for this type was requested by "aligned" attribute,
1871 0 if it is the default for this type. */
1872 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1874 /* The alignment for NODE, in bytes. */
1875 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1877 /* If your language allows you to declare types, and you want debug info
1878 for them, then you need to generate corresponding TYPE_DECL nodes.
1879 These "stub" TYPE_DECL nodes have no name, and simply point at the
1880 type node. You then set the TYPE_STUB_DECL field of the type node
1881 to point back at the TYPE_DECL node. This allows the debug routines
1882 to know that the two nodes represent the same type, so that we only
1883 get one debug info record for them. */
1884 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1886 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1887 the type has BLKmode only because it lacks the alignment required for
1889 #define TYPE_NO_FORCE_BLK(NODE) \
1890 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1892 /* Nonzero in a type considered volatile as a whole. */
1893 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1895 /* Nonzero in a type considered atomic as a whole. */
1896 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1898 /* Means this type is const-qualified. */
1899 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1901 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1903 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1905 /* If nonzero, type's name shouldn't be emitted into debug info. */
1906 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1908 /* The address space the type is in. */
1909 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1911 /* Encode/decode the named memory support as part of the qualifier. If more
1912 than 8 qualifiers are added, these macros need to be adjusted. */
1913 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1914 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1916 /* Return all qualifiers except for the address space qualifiers. */
1917 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1919 /* Only keep the address space out of the qualifiers and discard the other
1921 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1923 /* The set of type qualifiers for this type. */
1924 #define TYPE_QUALS(NODE) \
1925 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1926 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1927 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1928 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1929 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1931 /* The same as TYPE_QUALS without the address space qualifications. */
1932 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1933 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1934 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1935 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1936 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1938 /* The same as TYPE_QUALS without the address space and atomic
1940 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1941 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1942 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1943 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1945 /* These flags are available for each language front end to use internally. */
1946 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1947 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1948 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1949 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1950 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1951 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1952 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1954 /* Used to keep track of visited nodes in tree traversals. This is set to
1955 0 by copy_node and make_node. */
1956 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1958 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1959 that distinguish string from array of char).
1960 If set in a INTEGER_TYPE, indicates a character type. */
1961 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1963 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1964 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1965 (((unsigned HOST_WIDE_INT) 1) \
1966 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1968 /* Set precision to n when we have 2^n sub-parts of the vector. */
1969 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1970 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1972 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1973 about missing conversions to other vector types of the same size. */
1974 #define TYPE_VECTOR_OPAQUE(NODE) \
1975 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1977 /* Indicates that objects of this type must be initialized by calling a
1978 function when they are created. */
1979 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1980 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1982 /* Indicates that a UNION_TYPE object should be passed the same way that
1983 the first union alternative would be passed, or that a RECORD_TYPE
1984 object should be passed the same way that the first (and only) member
1986 #define TYPE_TRANSPARENT_AGGR(NODE) \
1987 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1989 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1990 address of a component of the type. This is the counterpart of
1991 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1992 #define TYPE_NONALIASED_COMPONENT(NODE) \
1993 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1995 /* Indicated that objects of this type should be laid out in as
1996 compact a way as possible. */
1997 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1999 /* Used by type_contains_placeholder_p to avoid recomputation.
2000 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2001 this field directly. */
2002 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2003 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2005 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2006 #define TYPE_FINAL_P(NODE) \
2007 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2009 /* The debug output functions use the symtab union field to store
2010 information specific to the debugging format. The different debug
2011 output hooks store different types in the union field. These three
2012 macros are used to access different fields in the union. The debug
2013 hooks are responsible for consistently using only a specific
2016 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2017 hold the type's number in the generated stabs. */
2018 #define TYPE_SYMTAB_ADDRESS(NODE) \
2019 (TYPE_CHECK (NODE)->type_common.symtab.address)
2021 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2022 hold struct/union type tag names. */
2023 #define TYPE_SYMTAB_POINTER(NODE) \
2024 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2026 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2027 in dwarf2out.c to point to the DIE generated for the type. */
2028 #define TYPE_SYMTAB_DIE(NODE) \
2029 (TYPE_CHECK (NODE)->type_common.symtab.die)
2031 /* The garbage collector needs to know the interpretation of the
2032 symtab field. These constants represent the different types in the
2035 #define TYPE_SYMTAB_IS_ADDRESS (0)
2036 #define TYPE_SYMTAB_IS_POINTER (1)
2037 #define TYPE_SYMTAB_IS_DIE (2)
2039 #define TYPE_LANG_SPECIFIC(NODE) \
2040 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2042 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2043 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2044 #define TYPE_FIELDS(NODE) \
2045 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2046 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2047 #define TYPE_ARG_TYPES(NODE) \
2048 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2049 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2051 #define TYPE_METHODS(NODE) \
2052 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2053 #define TYPE_VFIELD(NODE) \
2054 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2055 #define TYPE_METHOD_BASETYPE(NODE) \
2056 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2057 #define TYPE_OFFSET_BASETYPE(NODE) \
2058 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2059 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2060 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2061 #define TYPE_NEXT_PTR_TO(NODE) \
2062 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2063 #define TYPE_NEXT_REF_TO(NODE) \
2064 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2065 #define TYPE_MIN_VALUE(NODE) \
2066 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2067 #define TYPE_MAX_VALUE(NODE) \
2068 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2070 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2071 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2073 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2074 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2076 /* For record and union types, information about this type, as a base type
2078 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2080 /* For non record and union types, used in a language-dependent way. */
2081 #define TYPE_LANG_SLOT_1(NODE) \
2082 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2084 /* Define accessor macros for information about type inheritance
2087 A "basetype" means a particular usage of a data type for inheritance
2088 in another type. Each such basetype usage has its own "binfo"
2089 object to describe it. The binfo object is a TREE_VEC node.
2091 Inheritance is represented by the binfo nodes allocated for a
2092 given type. For example, given types C and D, such that D is
2093 inherited by C, 3 binfo nodes will be allocated: one for describing
2094 the binfo properties of C, similarly one for D, and one for
2095 describing the binfo properties of D as a base type for C.
2096 Thus, given a pointer to class C, one can get a pointer to the binfo
2097 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2099 /* BINFO specific flags. */
2101 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2102 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2104 /* Flags for language dependent use. */
2105 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2106 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2107 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2108 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2109 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2110 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2111 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2113 /* The actual data type node being inherited in this basetype. */
2114 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2116 /* The offset where this basetype appears in its containing type.
2117 BINFO_OFFSET slot holds the offset (in bytes)
2118 from the base of the complete object to the base of the part of the
2119 object that is allocated on behalf of this `type'.
2120 This is always 0 except when there is multiple inheritance. */
2122 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2123 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2125 /* The virtual function table belonging to this basetype. Virtual
2126 function tables provide a mechanism for run-time method dispatching.
2127 The entries of a virtual function table are language-dependent. */
2129 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2131 /* The virtual functions in the virtual function table. This is
2132 a TREE_LIST that is used as an initial approximation for building
2133 a virtual function table for this basetype. */
2134 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2136 /* A vector of binfos for the direct basetypes inherited by this
2139 If this basetype describes type D as inherited in C, and if the
2140 basetypes of D are E and F, then this vector contains binfos for
2141 inheritance of E and F by C. */
2142 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2144 /* The number of basetypes for NODE. */
2145 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2147 /* Accessor macro to get to the Nth base binfo of this binfo. */
2148 #define BINFO_BASE_BINFO(NODE,N) \
2149 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2150 #define BINFO_BASE_ITERATE(NODE,N,B) \
2151 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2152 #define BINFO_BASE_APPEND(NODE,T) \
2153 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2155 /* For a BINFO record describing a virtual base class, i.e., one where
2156 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2157 base. The actual contents are language-dependent. In the C++
2158 front-end this field is an INTEGER_CST giving an offset into the
2159 vtable where the offset to the virtual base can be found. */
2160 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2162 /* Indicates the accesses this binfo has to its bases. The values are
2163 access_public_node, access_protected_node or access_private_node.
2164 If this array is not present, public access is implied. */
2165 #define BINFO_BASE_ACCESSES(NODE) \
2166 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2168 #define BINFO_BASE_ACCESS(NODE,N) \
2169 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2170 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2171 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2173 /* The index in the VTT where this subobject's sub-VTT can be found.
2174 NULL_TREE if there is no sub-VTT. */
2175 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2177 /* The index in the VTT where the vptr for this subobject can be
2178 found. NULL_TREE if there is no secondary vptr in the VTT. */
2179 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2181 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2182 inheriting this base for non-virtual bases. For virtual bases it
2183 points either to the binfo for which this is a primary binfo, or to
2184 the binfo of the most derived type. */
2185 #define BINFO_INHERITANCE_CHAIN(NODE) \
2186 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2189 /* Define fields and accessors for nodes representing declared names. */
2191 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2192 have an associated SSA name. */
2193 #define SSA_VAR_P(DECL) \
2194 (TREE_CODE (DECL) == VAR_DECL \
2195 || TREE_CODE (DECL) == PARM_DECL \
2196 || TREE_CODE (DECL) == RESULT_DECL \
2197 || TREE_CODE (DECL) == SSA_NAME)
2200 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2202 /* This is the name of the object as written by the user.
2203 It is an IDENTIFIER_NODE. */
2204 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2206 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2207 #define TYPE_IDENTIFIER(NODE) \
2208 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2209 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2211 /* Every ..._DECL node gets a unique number. */
2212 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2214 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2216 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2218 /* Every ..._DECL node gets a unique number that stays the same even
2219 when the decl is copied by the inliner once it is set. */
2220 #define DECL_PT_UID(NODE) \
2221 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2222 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2223 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2224 #define SET_DECL_PT_UID(NODE, UID) \
2225 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2226 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2227 be preserved when copyin the decl. */
2228 #define DECL_PT_UID_SET_P(NODE) \
2229 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2231 /* These two fields describe where in the source code the declaration
2232 was. If the declaration appears in several places (as for a C
2233 function that is declared first and then defined later), this
2234 information should refer to the definition. */
2235 #define DECL_SOURCE_LOCATION(NODE) \
2236 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2237 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2238 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2239 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2240 /* This accessor returns TRUE if the decl it operates on was created
2241 by a front-end or back-end rather than by user code. In this case
2242 builtin-ness is indicated by source location. */
2243 #define DECL_IS_BUILTIN(DECL) \
2244 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2246 #define DECL_LOCATION_RANGE(NODE) \
2247 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE)))
2249 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2250 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2251 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2252 nodes, this points to either the FUNCTION_DECL for the containing
2253 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2254 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2255 scope". In particular, for VAR_DECLs which are virtual table pointers
2256 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2258 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2259 #define DECL_FIELD_CONTEXT(NODE) \
2260 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2262 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2263 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2265 /* For any sort of a ..._DECL node, this points to the original (abstract)
2266 decl node which this decl is an inlined/cloned instance of, or else it
2267 is NULL indicating that this decl is not an instance of some other decl.
2269 The C front-end also uses this in a nested declaration of an inline
2270 function, to point back to the definition. */
2271 #define DECL_ABSTRACT_ORIGIN(NODE) \
2272 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2274 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2275 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2276 #define DECL_ORIGIN(NODE) \
2277 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2279 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2280 inline instance of some original (abstract) decl from an inline function;
2281 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2282 nodes can also have their abstract origin set to themselves. */
2283 #define DECL_FROM_INLINE(NODE) \
2284 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2285 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2287 /* In a DECL this is the field where attributes are stored. */
2288 #define DECL_ATTRIBUTES(NODE) \
2289 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2291 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2292 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2293 For a VAR_DECL, holds the initial value.
2294 For a PARM_DECL, used for DECL_ARG_TYPE--default
2295 values for parameters are encoded in the type of the function,
2296 not in the PARM_DECL slot.
2297 For a FIELD_DECL, this is used for enumeration values and the C
2298 frontend uses it for temporarily storing bitwidth of bitfields.
2300 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2301 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2303 /* Holds the size of the datum, in bits, as a tree expression.
2304 Need not be constant. */
2305 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2306 /* Likewise for the size in bytes. */
2307 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2308 /* Holds the alignment required for the datum, in bits. */
2309 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2310 /* The alignment of NODE, in bytes. */
2311 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2312 /* Set if the alignment of this DECL has been set by the user, for
2313 example with an 'aligned' attribute. */
2314 #define DECL_USER_ALIGN(NODE) \
2315 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2316 /* Holds the machine mode corresponding to the declaration of a variable or
2317 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2319 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2321 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2322 operation it is. Note, however, that this field is overloaded, with
2323 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2324 checked before any access to the former. */
2325 #define DECL_FUNCTION_CODE(NODE) \
2326 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2328 #define DECL_FUNCTION_PERSONALITY(NODE) \
2329 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2331 /* Nonzero for a given ..._DECL node means that the name of this node should
2332 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2333 the associated type should be ignored. For a FUNCTION_DECL, the body of
2334 the function should also be ignored. */
2335 #define DECL_IGNORED_P(NODE) \
2336 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2338 /* Nonzero for a given ..._DECL node means that this node represents an
2339 "abstract instance" of the given declaration (e.g. in the original
2340 declaration of an inline function). When generating symbolic debugging
2341 information, we mustn't try to generate any address information for nodes
2342 marked as "abstract instances" because we don't actually generate
2343 any code or allocate any data space for such instances. */
2344 #define DECL_ABSTRACT_P(NODE) \
2345 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2347 /* Language-specific decl information. */
2348 #define DECL_LANG_SPECIFIC(NODE) \
2349 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2351 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2352 do not allocate storage, and refer to a definition elsewhere. Note that
2353 this does not necessarily imply the entity represented by NODE
2354 has no program source-level definition in this translation unit. For
2355 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2356 DECL_EXTERNAL may be true simultaneously; that can be the case for
2357 a C99 "extern inline" function. */
2358 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2360 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2361 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2363 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2365 Also set in some languages for variables, etc., outside the normal
2366 lexical scope, such as class instance variables. */
2367 #define DECL_NONLOCAL(NODE) \
2368 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2370 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2371 Used in FIELD_DECLs for vtable pointers.
2372 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2373 #define DECL_VIRTUAL_P(NODE) \
2374 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2376 /* Used to indicate that this DECL represents a compiler-generated entity. */
2377 #define DECL_ARTIFICIAL(NODE) \
2378 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2380 /* Additional flags for language-specific uses. */
2381 #define DECL_LANG_FLAG_0(NODE) \
2382 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2383 #define DECL_LANG_FLAG_1(NODE) \
2384 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2385 #define DECL_LANG_FLAG_2(NODE) \
2386 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2387 #define DECL_LANG_FLAG_3(NODE) \
2388 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2389 #define DECL_LANG_FLAG_4(NODE) \
2390 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2391 #define DECL_LANG_FLAG_5(NODE) \
2392 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2393 #define DECL_LANG_FLAG_6(NODE) \
2394 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2395 #define DECL_LANG_FLAG_7(NODE) \
2396 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2397 #define DECL_LANG_FLAG_8(NODE) \
2398 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2400 /* Nonzero for a scope which is equal to file scope. */
2401 #define SCOPE_FILE_SCOPE_P(EXP) \
2402 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2403 /* Nonzero for a decl which is at file scope. */
2404 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2405 /* Nonzero for a type which is at file scope. */
2406 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2408 /* Nonzero for a decl that is decorated using attribute used.
2409 This indicates to compiler tools that this decl needs to be preserved. */
2410 #define DECL_PRESERVE_P(DECL) \
2411 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2413 /* For function local variables of COMPLEX and VECTOR types,
2414 indicates that the variable is not aliased, and that all
2415 modifications to the variable have been adjusted so that
2416 they are killing assignments. Thus the variable may now
2417 be treated as a GIMPLE register, and use real instead of
2418 virtual ops in SSA form. */
2419 #define DECL_GIMPLE_REG_P(DECL) \
2420 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2422 extern tree decl_value_expr_lookup (tree);
2423 extern void decl_value_expr_insert (tree, tree);
2425 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2426 if transformations have made this more complicated than evaluating the
2427 decl itself. This should only be used for debugging; once this field has
2428 been set, the decl itself may not legitimately appear in the function. */
2429 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2430 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2431 ->decl_common.decl_flag_2)
2432 #define DECL_VALUE_EXPR(NODE) \
2433 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2434 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2435 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2437 /* Holds the RTL expression for the value of a variable or function.
2438 This value can be evaluated lazily for functions, variables with
2439 static storage duration, and labels. */
2440 #define DECL_RTL(NODE) \
2441 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2442 ? (NODE)->decl_with_rtl.rtl \
2443 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2445 /* Set the DECL_RTL for NODE to RTL. */
2446 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2448 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2449 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2451 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2452 #define DECL_RTL_SET_P(NODE) \
2453 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2455 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2456 NODE1, it will not be set for NODE2; this is a lazy copy. */
2457 #define COPY_DECL_RTL(NODE1, NODE2) \
2458 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2459 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2461 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2462 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2464 #if (GCC_VERSION >= 2007)
2465 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2466 ({ tree const __d = (decl); \
2467 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2468 /* Dereference it so the compiler knows it can't be NULL even \
2469 without assertion checking. */ \
2470 &*DECL_RTL_IF_SET (__d); })
2472 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2475 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2476 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2478 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2479 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2480 of the structure. */
2481 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2483 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2484 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2485 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2486 natural alignment of the field's type). */
2487 #define DECL_FIELD_BIT_OFFSET(NODE) \
2488 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2490 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2491 if so, the type that was originally specified for it.
2492 TREE_TYPE may have been modified (in finish_struct). */
2493 #define DECL_BIT_FIELD_TYPE(NODE) \
2494 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2496 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2497 representative FIELD_DECL. */
2498 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2499 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2501 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2502 if nonzero, indicates that the field occupies the type. */
2503 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2505 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2506 DECL_FIELD_OFFSET which are known to be always zero.
2507 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2509 #define DECL_OFFSET_ALIGN(NODE) \
2510 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2512 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2513 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2514 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2516 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2517 which this FIELD_DECL is defined. This information is needed when
2518 writing debugging information about vfield and vbase decls for C++. */
2519 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2521 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2522 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2524 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2526 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2528 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2529 this component. This makes it possible for Type-Based Alias Analysis
2530 to disambiguate accesses to this field with indirect accesses using
2533 struct S { int i; } s;
2536 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2538 From the implementation's viewpoint, the alias set of the type of the
2539 field 'i' (int) will not be recorded as a subset of that of the type of
2540 's' (struct S) in record_component_aliases. The counterpart is that
2541 accesses to s.i must not be given the alias set of the type of 'i'
2542 (int) but instead directly that of the type of 's' (struct S). */
2543 #define DECL_NONADDRESSABLE_P(NODE) \
2544 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2546 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2547 dense, unique within any one function, and may be used to index arrays.
2548 If the value is -1, then no UID has been assigned. */
2549 #define LABEL_DECL_UID(NODE) \
2550 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2552 /* In a LABEL_DECL, the EH region number for which the label is the
2553 post_landing_pad. */
2554 #define EH_LANDING_PAD_NR(NODE) \
2555 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2557 /* For a PARM_DECL, records the data type used to pass the argument,
2558 which may be different from the type seen in the program. */
2559 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2561 /* For PARM_DECL, holds an RTL for the stack slot or register
2562 where the data was actually passed. */
2563 #define DECL_INCOMING_RTL(NODE) \
2564 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2566 /* Nonzero for a given ..._DECL node means that no warnings should be
2567 generated just because this node is unused. */
2568 #define DECL_IN_SYSTEM_HEADER(NODE) \
2569 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2571 /* Used to indicate that the linkage status of this DECL is not yet known,
2572 so it should not be output now. */
2573 #define DECL_DEFER_OUTPUT(NODE) \
2574 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2576 /* In a VAR_DECL that's static,
2577 nonzero if the space is in the text section. */
2578 #define DECL_IN_TEXT_SECTION(NODE) \
2579 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2581 /* In a VAR_DECL that's static,
2582 nonzero if it belongs to the global constant pool. */
2583 #define DECL_IN_CONSTANT_POOL(NODE) \
2584 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2586 /* Nonzero for a given ..._DECL node means that this node should be
2587 put in .common, if possible. If a DECL_INITIAL is given, and it
2588 is not error_mark_node, then the decl cannot be put in .common. */
2589 #define DECL_COMMON(NODE) \
2590 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2592 /* In a VAR_DECL, nonzero if the decl is a register variable with
2593 an explicit asm specification. */
2594 #define DECL_HARD_REGISTER(NODE) \
2595 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2597 /* Used to indicate that this DECL has weak linkage. */
2598 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2600 /* Used to indicate that the DECL is a dllimport. */
2601 #define DECL_DLLIMPORT_P(NODE) \
2602 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2604 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2605 not be put out unless it is needed in this translation unit.
2606 Entities like this are shared across translation units (like weak
2607 entities), but are guaranteed to be generated by any translation
2608 unit that needs them, and therefore need not be put out anywhere
2609 where they are not needed. DECL_COMDAT is just a hint to the
2610 back-end; it is up to front-ends which set this flag to ensure
2611 that there will never be any harm, other than bloat, in putting out
2612 something which is DECL_COMDAT. */
2613 #define DECL_COMDAT(NODE) \
2614 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2616 #define DECL_COMDAT_GROUP(NODE) \
2617 decl_comdat_group (NODE)
2619 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2620 multiple translation units should be merged. */
2621 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2622 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2624 /* The name of the object as the assembler will see it (but before any
2625 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2626 as DECL_NAME. It is an IDENTIFIER_NODE.
2628 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2629 One Definition Rule based type merging at LTO. It is computed only for
2630 LTO compilation and C++. */
2631 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2633 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2634 This is true of all DECL nodes except FIELD_DECL. */
2635 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2636 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2638 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2639 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2641 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2642 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2643 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2645 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2646 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2647 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2649 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2650 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2651 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2652 semantics of using this macro, are different than saying:
2654 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2656 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2658 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2659 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2660 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2661 DECL_ASSEMBLER_NAME (DECL1)) \
2664 /* Records the section name in a section attribute. Used to pass
2665 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2666 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2668 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2669 this variable in a BIND_EXPR. */
2670 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2671 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2673 /* Value of the decls's visibility attribute */
2674 #define DECL_VISIBILITY(NODE) \
2675 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2677 /* Nonzero means that the decl had its visibility specified rather than
2679 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2680 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2682 /* In a VAR_DECL, the model to use if the data should be allocated from
2683 thread-local storage. */
2684 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2686 /* In a VAR_DECL, nonzero if the data should be allocated from
2687 thread-local storage. */
2688 #define DECL_THREAD_LOCAL_P(NODE) \
2689 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2691 /* In a non-local VAR_DECL with static storage duration, true if the
2692 variable has an initialization priority. If false, the variable
2693 will be initialized at the DEFAULT_INIT_PRIORITY. */
2694 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2695 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2697 extern tree decl_debug_expr_lookup (tree);
2698 extern void decl_debug_expr_insert (tree, tree);
2700 /* For VAR_DECL, this is set to an expression that it was split from. */
2701 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2702 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2703 #define DECL_DEBUG_EXPR(NODE) \
2704 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2706 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2707 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2709 extern priority_type decl_init_priority_lookup (tree);
2710 extern priority_type decl_fini_priority_lookup (tree);
2711 extern void decl_init_priority_insert (tree, priority_type);
2712 extern void decl_fini_priority_insert (tree, priority_type);
2714 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2716 #define DECL_INIT_PRIORITY(NODE) \
2717 (decl_init_priority_lookup (NODE))
2718 /* Set the initialization priority for NODE to VAL. */
2719 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2720 (decl_init_priority_insert (NODE, VAL))
2722 /* For a FUNCTION_DECL the finalization priority of NODE. */
2723 #define DECL_FINI_PRIORITY(NODE) \
2724 (decl_fini_priority_lookup (NODE))
2725 /* Set the finalization priority for NODE to VAL. */
2726 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2727 (decl_fini_priority_insert (NODE, VAL))
2729 /* The initialization priority for entities for which no explicit
2730 initialization priority has been specified. */
2731 #define DEFAULT_INIT_PRIORITY 65535
2733 /* The maximum allowed initialization priority. */
2734 #define MAX_INIT_PRIORITY 65535
2736 /* The largest priority value reserved for use by system runtime
2738 #define MAX_RESERVED_INIT_PRIORITY 100
2740 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2741 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2742 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2744 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2745 #define DECL_NONLOCAL_FRAME(NODE) \
2746 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2748 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2749 #define DECL_NONALIASED(NODE) \
2750 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2752 /* This field is used to reference anything in decl.result and is meant only
2753 for use by the garbage collector. */
2754 #define DECL_RESULT_FLD(NODE) \
2755 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2757 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2758 Before the struct containing the FUNCTION_DECL is laid out,
2759 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2760 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2761 function. When the class is laid out, this pointer is changed
2762 to an INTEGER_CST node which is suitable for use as an index
2763 into the virtual function table. */
2764 #define DECL_VINDEX(NODE) \
2765 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2767 /* In FUNCTION_DECL, holds the decl for the return value. */
2768 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2770 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2771 #define DECL_UNINLINABLE(NODE) \
2772 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2774 /* In a FUNCTION_DECL, the saved representation of the body of the
2776 #define DECL_SAVED_TREE(NODE) \
2777 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2779 /* Nonzero in a FUNCTION_DECL means this function should be treated
2780 as if it were a malloc, meaning it returns a pointer that is
2782 #define DECL_IS_MALLOC(NODE) \
2783 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2785 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2786 C++ operator new, meaning that it returns a pointer for which we
2787 should not use type based aliasing. */
2788 #define DECL_IS_OPERATOR_NEW(NODE) \
2789 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2791 /* Nonzero in a FUNCTION_DECL means this function may return more
2793 #define DECL_IS_RETURNS_TWICE(NODE) \
2794 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2796 /* Nonzero in a FUNCTION_DECL means this function should be treated
2797 as "pure" function (like const function, but may read global memory). */
2798 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2800 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2801 the const or pure function may not terminate. When this is nonzero
2802 for a const or pure function, it can be dealt with by cse passes
2803 but cannot be removed by dce passes since you are not allowed to
2804 change an infinite looping program into one that terminates without
2806 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2807 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2809 /* Nonzero in a FUNCTION_DECL means this function should be treated
2810 as "novops" function (function that does not read global memory,
2811 but may have arbitrary side effects). */
2812 #define DECL_IS_NOVOPS(NODE) \
2813 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2815 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2816 at the beginning or end of execution. */
2817 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2818 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2820 #define DECL_STATIC_DESTRUCTOR(NODE) \
2821 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2823 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2824 be instrumented with calls to support routines. */
2825 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2826 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2828 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2829 disabled in this function. */
2830 #define DECL_NO_LIMIT_STACK(NODE) \
2831 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2833 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2834 #define DECL_STATIC_CHAIN(NODE) \
2835 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2837 /* Nonzero for a decl that cgraph has decided should be inlined into
2838 at least one call site. It is not meaningful to look at this
2839 directly; always use cgraph_function_possibly_inlined_p. */
2840 #define DECL_POSSIBLY_INLINED(DECL) \
2841 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2843 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2844 such as via the `inline' keyword in C/C++. This flag controls the linkage
2845 semantics of 'inline' */
2846 #define DECL_DECLARED_INLINE_P(NODE) \
2847 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2849 /* Nonzero in a FUNCTION_DECL means this function should not get
2850 -Winline warnings. */
2851 #define DECL_NO_INLINE_WARNING_P(NODE) \
2852 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2854 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2855 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2856 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2858 /* Nonzero if a FUNCTION_CODE is a TM load. */
2859 #define BUILTIN_TM_LOAD_P(FN) \
2860 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2862 /* Nonzero if a FUNCTION_CODE is a TM store. */
2863 #define BUILTIN_TM_STORE_P(FN) \
2864 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2866 #define CASE_BUILT_IN_TM_LOAD(FN) \
2867 case BUILT_IN_TM_LOAD_##FN: \
2868 case BUILT_IN_TM_LOAD_RAR_##FN: \
2869 case BUILT_IN_TM_LOAD_RAW_##FN: \
2870 case BUILT_IN_TM_LOAD_RFW_##FN
2872 #define CASE_BUILT_IN_TM_STORE(FN) \
2873 case BUILT_IN_TM_STORE_##FN: \
2874 case BUILT_IN_TM_STORE_WAR_##FN: \
2875 case BUILT_IN_TM_STORE_WAW_##FN
2877 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2878 disregarding size and cost heuristics. This is equivalent to using
2879 the always_inline attribute without the required diagnostics if the
2880 function cannot be inlined. */
2881 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2882 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2884 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2885 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2887 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2888 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2889 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2891 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2892 that describes the status of this function. */
2893 #define DECL_STRUCT_FUNCTION(NODE) \
2894 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2896 /* In a FUNCTION_DECL, nonzero means a built in function of a
2897 standard library or more generally a built in function that is
2898 recognized by optimizers and expanders.
2900 Note that it is different from the DECL_IS_BUILTIN accessor. For
2901 instance, user declared prototypes of C library functions are not
2902 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2903 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2905 /* For a builtin function, identify which part of the compiler defined it. */
2906 #define DECL_BUILT_IN_CLASS(NODE) \
2907 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2909 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2910 #define DECL_ARGUMENTS(NODE) \
2911 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2913 /* In FUNCTION_DECL, the function specific target options to use when compiling
2915 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2916 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2918 /* In FUNCTION_DECL, the function specific optimization options to use when
2919 compiling this function. */
2920 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2921 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2923 /* In FUNCTION_DECL, this is set if this function has other versions generated
2924 using "target" attributes. The default version is the one which does not
2925 have any "target" attribute set. */
2926 #define DECL_FUNCTION_VERSIONED(NODE)\
2927 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2929 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2930 Devirtualization machinery uses this knowledge for determing type of the
2931 object constructed. Also we assume that constructor address is not
2933 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2934 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2936 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2937 Devirtualization machinery uses this to track types in destruction. */
2938 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2939 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2941 /* In FUNCTION_DECL that represent an virtual method this is set when
2942 the method is final. */
2943 #define DECL_FINAL_P(NODE)\
2944 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2946 /* The source language of the translation-unit. */
2947 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2948 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2950 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2952 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2953 #define DECL_ORIGINAL_TYPE(NODE) \
2954 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2956 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2957 into stabs. Instead it will generate cross reference ('x') of names.
2958 This uses the same flag as DECL_EXTERNAL. */
2959 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2960 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2962 /* Getter of the imported declaration associated to the
2963 IMPORTED_DECL node. */
2964 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2965 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2967 /* Getter of the symbol declaration associated with the
2968 NAMELIST_DECL node. */
2969 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2970 (DECL_INITIAL (NODE))
2972 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2973 To reduce overhead, the nodes containing the statements are not trees.
2974 This avoids the overhead of tree_common on all linked list elements.
2976 Use the interface in tree-iterator.h to access this node. */
2978 #define STATEMENT_LIST_HEAD(NODE) \
2979 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2980 #define STATEMENT_LIST_TAIL(NODE) \
2981 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2983 #define TREE_OPTIMIZATION(NODE) \
2984 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2986 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2987 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2989 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2990 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2992 /* Return a tree node that encapsulates the optimization options in OPTS. */
2993 extern tree build_optimization_node (struct gcc_options *opts);
2995 #define TREE_TARGET_OPTION(NODE) \
2996 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2998 #define TREE_TARGET_GLOBALS(NODE) \
2999 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3001 /* Return a tree node that encapsulates the target options in OPTS. */
3002 extern tree build_target_option_node (struct gcc_options *opts);
3004 extern void prepare_target_option_nodes_for_pch (void);
3006 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3009 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3011 if (TREE_CODE (__t) != __c)
3012 tree_check_failed (__t, __f, __l, __g, __c, 0);
3017 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3020 if (TREE_CODE (__t) == __c)
3021 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3026 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3027 enum tree_code __c1, enum tree_code __c2)
3029 if (TREE_CODE (__t) != __c1
3030 && TREE_CODE (__t) != __c2)
3031 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3036 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3037 enum tree_code __c1, enum tree_code __c2)
3039 if (TREE_CODE (__t) == __c1
3040 || TREE_CODE (__t) == __c2)
3041 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3046 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3047 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3049 if (TREE_CODE (__t) != __c1
3050 && TREE_CODE (__t) != __c2
3051 && TREE_CODE (__t) != __c3)
3052 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3057 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3058 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3060 if (TREE_CODE (__t) == __c1
3061 || TREE_CODE (__t) == __c2
3062 || TREE_CODE (__t) == __c3)
3063 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3068 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3069 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3070 enum tree_code __c4)
3072 if (TREE_CODE (__t) != __c1
3073 && TREE_CODE (__t) != __c2
3074 && TREE_CODE (__t) != __c3
3075 && TREE_CODE (__t) != __c4)
3076 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3081 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3082 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3083 enum tree_code __c4)
3085 if (TREE_CODE (__t) == __c1
3086 || TREE_CODE (__t) == __c2
3087 || TREE_CODE (__t) == __c3
3088 || TREE_CODE (__t) == __c4)
3089 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3094 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3095 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3096 enum tree_code __c4, enum tree_code __c5)
3098 if (TREE_CODE (__t) != __c1
3099 && TREE_CODE (__t) != __c2
3100 && TREE_CODE (__t) != __c3
3101 && TREE_CODE (__t) != __c4
3102 && TREE_CODE (__t) != __c5)
3103 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3108 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3109 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3110 enum tree_code __c4, enum tree_code __c5)
3112 if (TREE_CODE (__t) == __c1
3113 || TREE_CODE (__t) == __c2
3114 || TREE_CODE (__t) == __c3
3115 || TREE_CODE (__t) == __c4
3116 || TREE_CODE (__t) == __c5)
3117 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3122 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3123 const char *__f, int __l, const char *__g)
3125 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3126 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3131 tree_class_check (tree __t, const enum tree_code_class __class,
3132 const char *__f, int __l, const char *__g)
3134 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3135 tree_class_check_failed (__t, __class, __f, __l, __g);
3140 tree_range_check (tree __t,
3141 enum tree_code __code1, enum tree_code __code2,
3142 const char *__f, int __l, const char *__g)
3144 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3145 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3150 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3151 const char *__f, int __l, const char *__g)
3153 if (TREE_CODE (__t) != OMP_CLAUSE)
3154 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3155 if (__t->omp_clause.code != __code)
3156 omp_clause_check_failed (__t, __f, __l, __g, __code);
3161 omp_clause_range_check (tree __t,
3162 enum omp_clause_code __code1,
3163 enum omp_clause_code __code2,
3164 const char *__f, int __l, const char *__g)
3166 if (TREE_CODE (__t) != OMP_CLAUSE)
3167 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3168 if ((int) __t->omp_clause.code < (int) __code1
3169 || (int) __t->omp_clause.code > (int) __code2)
3170 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3174 /* These checks have to be special cased. */
3177 expr_check (tree __t, const char *__f, int __l, const char *__g)
3179 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3180 if (!IS_EXPR_CODE_CLASS (__c))
3181 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3185 /* These checks have to be special cased. */
3188 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3191 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3195 inline const HOST_WIDE_INT *
3196 tree_int_cst_elt_check (const_tree __t, int __i,
3197 const char *__f, int __l, const char *__g)
3199 if (TREE_CODE (__t) != INTEGER_CST)
3200 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3201 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3202 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3204 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3207 inline HOST_WIDE_INT *
3208 tree_int_cst_elt_check (tree __t, int __i,
3209 const char *__f, int __l, const char *__g)
3211 if (TREE_CODE (__t) != INTEGER_CST)
3212 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3213 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3214 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3216 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3219 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3221 # if GCC_VERSION >= 4006
3222 #pragma GCC diagnostic push
3223 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3227 tree_vec_elt_check (tree __t, int __i,
3228 const char *__f, int __l, const char *__g)
3230 if (TREE_CODE (__t) != TREE_VEC)
3231 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3232 if (__i < 0 || __i >= __t->base.u.length)
3233 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3234 return &CONST_CAST_TREE (__t)->vec.a[__i];
3237 # if GCC_VERSION >= 4006
3238 #pragma GCC diagnostic pop
3242 omp_clause_elt_check (tree __t, int __i,
3243 const char *__f, int __l, const char *__g)
3245 if (TREE_CODE (__t) != OMP_CLAUSE)
3246 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3247 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3248 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3249 return &__t->omp_clause.ops[__i];
3252 /* These checks have to be special cased. */
3255 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3257 if (!ANY_INTEGRAL_TYPE_P (__t))
3258 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3264 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3267 if (TREE_CODE (__t) != __c)
3268 tree_check_failed (__t, __f, __l, __g, __c, 0);
3273 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3276 if (TREE_CODE (__t) == __c)
3277 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3282 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3283 enum tree_code __c1, enum tree_code __c2)
3285 if (TREE_CODE (__t) != __c1
3286 && TREE_CODE (__t) != __c2)
3287 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3292 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3293 enum tree_code __c1, enum tree_code __c2)
3295 if (TREE_CODE (__t) == __c1
3296 || TREE_CODE (__t) == __c2)
3297 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3302 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3303 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3305 if (TREE_CODE (__t) != __c1
3306 && TREE_CODE (__t) != __c2
3307 && TREE_CODE (__t) != __c3)
3308 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3313 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3314 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3316 if (TREE_CODE (__t) == __c1
3317 || TREE_CODE (__t) == __c2
3318 || TREE_CODE (__t) == __c3)
3319 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3324 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3325 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3326 enum tree_code __c4)
3328 if (TREE_CODE (__t) != __c1
3329 && TREE_CODE (__t) != __c2
3330 && TREE_CODE (__t) != __c3
3331 && TREE_CODE (__t) != __c4)
3332 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3337 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3338 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3339 enum tree_code __c4)
3341 if (TREE_CODE (__t) == __c1
3342 || TREE_CODE (__t) == __c2
3343 || TREE_CODE (__t) == __c3
3344 || TREE_CODE (__t) == __c4)
3345 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3350 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3351 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3352 enum tree_code __c4, enum tree_code __c5)
3354 if (TREE_CODE (__t) != __c1
3355 && TREE_CODE (__t) != __c2
3356 && TREE_CODE (__t) != __c3
3357 && TREE_CODE (__t) != __c4
3358 && TREE_CODE (__t) != __c5)
3359 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3364 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3365 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3366 enum tree_code __c4, enum tree_code __c5)
3368 if (TREE_CODE (__t) == __c1
3369 || TREE_CODE (__t) == __c2
3370 || TREE_CODE (__t) == __c3
3371 || TREE_CODE (__t) == __c4
3372 || TREE_CODE (__t) == __c5)
3373 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3378 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3379 const char *__f, int __l, const char *__g)
3381 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3382 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3387 tree_class_check (const_tree __t, const enum tree_code_class __class,
3388 const char *__f, int __l, const char *__g)
3390 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3391 tree_class_check_failed (__t, __class, __f, __l, __g);
3396 tree_range_check (const_tree __t,
3397 enum tree_code __code1, enum tree_code __code2,
3398 const char *__f, int __l, const char *__g)
3400 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3401 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3406 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3407 const char *__f, int __l, const char *__g)
3409 if (TREE_CODE (__t) != OMP_CLAUSE)
3410 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3411 if (__t->omp_clause.code != __code)
3412 omp_clause_check_failed (__t, __f, __l, __g, __code);
3417 omp_clause_range_check (const_tree __t,
3418 enum omp_clause_code __code1,
3419 enum omp_clause_code __code2,
3420 const char *__f, int __l, const char *__g)
3422 if (TREE_CODE (__t) != OMP_CLAUSE)
3423 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3424 if ((int) __t->omp_clause.code < (int) __code1
3425 || (int) __t->omp_clause.code > (int) __code2)
3426 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3431 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3433 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3434 if (!IS_EXPR_CODE_CLASS (__c))
3435 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3440 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3443 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3447 # if GCC_VERSION >= 4006
3448 #pragma GCC diagnostic push
3449 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3453 tree_vec_elt_check (const_tree __t, int __i,
3454 const char *__f, int __l, const char *__g)
3456 if (TREE_CODE (__t) != TREE_VEC)
3457 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3458 if (__i < 0 || __i >= __t->base.u.length)
3459 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3460 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3461 //return &__t->vec.a[__i];
3464 # if GCC_VERSION >= 4006
3465 #pragma GCC diagnostic pop
3469 omp_clause_elt_check (const_tree __t, int __i,
3470 const char *__f, int __l, const char *__g)
3472 if (TREE_CODE (__t) != OMP_CLAUSE)
3473 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3474 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3475 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3476 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3480 any_integral_type_check (const_tree __t, const char *__f, int __l,
3483 if (!ANY_INTEGRAL_TYPE_P (__t))
3484 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3491 /* Compute the number of operands in an expression node NODE. For
3492 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3493 otherwise it is looked up from the node's code. */
3495 tree_operand_length (const_tree node)
3497 if (VL_EXP_CLASS_P (node))
3498 return VL_EXP_OPERAND_LENGTH (node);
3500 return TREE_CODE_LENGTH (TREE_CODE (node));
3503 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3505 /* Special checks for TREE_OPERANDs. */
3507 tree_operand_check (tree __t, int __i,
3508 const char *__f, int __l, const char *__g)
3510 const_tree __u = EXPR_CHECK (__t);
3511 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3512 tree_operand_check_failed (__i, __u, __f, __l, __g);
3513 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3517 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3518 const char *__f, int __l, const char *__g)
3520 if (TREE_CODE (__t) != __code)
3521 tree_check_failed (__t, __f, __l, __g, __code, 0);
3522 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3523 tree_operand_check_failed (__i, __t, __f, __l, __g);
3524 return &__t->exp.operands[__i];
3528 tree_operand_check (const_tree __t, int __i,
3529 const char *__f, int __l, const char *__g)
3531 const_tree __u = EXPR_CHECK (__t);
3532 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3533 tree_operand_check_failed (__i, __u, __f, __l, __g);
3534 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3538 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3539 const char *__f, int __l, const char *__g)
3541 if (TREE_CODE (__t) != __code)
3542 tree_check_failed (__t, __f, __l, __g, __code, 0);
3543 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3544 tree_operand_check_failed (__i, __t, __f, __l, __g);
3545 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3550 #define error_mark_node global_trees[TI_ERROR_MARK]
3552 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3553 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3554 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3555 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3556 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3558 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3559 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3560 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3561 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3562 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3564 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3565 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3566 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3567 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3568 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3570 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3571 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3572 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3574 #define void_node global_trees[TI_VOID]
3576 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3577 #define integer_one_node global_trees[TI_INTEGER_ONE]
3578 #define integer_three_node global_trees[TI_INTEGER_THREE]
3579 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3580 #define size_zero_node global_trees[TI_SIZE_ZERO]
3581 #define size_one_node global_trees[TI_SIZE_ONE]
3582 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3583 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3584 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3586 /* Base access nodes. */
3587 #define access_public_node global_trees[TI_PUBLIC]
3588 #define access_protected_node global_trees[TI_PROTECTED]
3589 #define access_private_node global_trees[TI_PRIVATE]
3591 #define null_pointer_node global_trees[TI_NULL_POINTER]
3593 #define float_type_node global_trees[TI_FLOAT_TYPE]
3594 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3595 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3597 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3598 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3599 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3600 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3602 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3603 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3604 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3605 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3607 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3609 #define void_type_node global_trees[TI_VOID_TYPE]
3610 /* The C type `void *'. */
3611 #define ptr_type_node global_trees[TI_PTR_TYPE]
3612 /* The C type `const void *'. */
3613 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3614 /* The C type `size_t'. */
3615 #define size_type_node global_trees[TI_SIZE_TYPE]
3616 #define pid_type_node global_trees[TI_PID_TYPE]
3617 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3618 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3619 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3620 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3621 /* The C type `FILE *'. */
3622 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3623 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3625 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3626 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3627 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3629 /* The decimal floating point types. */
3630 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3631 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3632 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3633 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3634 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3635 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3637 /* The fixed-point types. */
3638 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3639 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3640 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3641 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3642 #define sat_unsigned_short_fract_type_node \
3643 global_trees[TI_SAT_USFRACT_TYPE]
3644 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3645 #define sat_unsigned_long_fract_type_node \
3646 global_trees[TI_SAT_ULFRACT_TYPE]
3647 #define sat_unsigned_long_long_fract_type_node \
3648 global_trees[TI_SAT_ULLFRACT_TYPE]
3649 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3650 #define fract_type_node global_trees[TI_FRACT_TYPE]
3651 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3652 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3653 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3654 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3655 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3656 #define unsigned_long_long_fract_type_node \
3657 global_trees[TI_ULLFRACT_TYPE]
3658 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3659 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3660 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3661 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3662 #define sat_unsigned_short_accum_type_node \
3663 global_trees[TI_SAT_USACCUM_TYPE]
3664 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3665 #define sat_unsigned_long_accum_type_node \
3666 global_trees[TI_SAT_ULACCUM_TYPE]
3667 #define sat_unsigned_long_long_accum_type_node \
3668 global_trees[TI_SAT_ULLACCUM_TYPE]
3669 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3670 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3671 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3672 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3673 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3674 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3675 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3676 #define unsigned_long_long_accum_type_node \
3677 global_trees[TI_ULLACCUM_TYPE]
3678 #define qq_type_node global_trees[TI_QQ_TYPE]
3679 #define hq_type_node global_trees[TI_HQ_TYPE]
3680 #define sq_type_node global_trees[TI_SQ_TYPE]
3681 #define dq_type_node global_trees[TI_DQ_TYPE]
3682 #define tq_type_node global_trees[TI_TQ_TYPE]
3683 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3684 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3685 #define usq_type_node global_trees[TI_USQ_TYPE]
3686 #define udq_type_node global_trees[TI_UDQ_TYPE]
3687 #define utq_type_node global_trees[TI_UTQ_TYPE]
3688 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3689 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3690 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3691 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3692 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3693 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3694 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3695 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3696 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3697 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3698 #define ha_type_node global_trees[TI_HA_TYPE]
3699 #define sa_type_node global_trees[TI_SA_TYPE]
3700 #define da_type_node global_trees[TI_DA_TYPE]
3701 #define ta_type_node global_trees[TI_TA_TYPE]
3702 #define uha_type_node global_trees[TI_UHA_TYPE]
3703 #define usa_type_node global_trees[TI_USA_TYPE]
3704 #define uda_type_node global_trees[TI_UDA_TYPE]
3705 #define uta_type_node global_trees[TI_UTA_TYPE]
3706 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3707 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3708 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3709 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3710 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3711 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3712 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3713 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3715 /* The node that should be placed at the end of a parameter list to
3716 indicate that the function does not take a variable number of
3717 arguments. The TREE_VALUE will be void_type_node and there will be
3718 no TREE_CHAIN. Language-independent code should not assume
3719 anything else about this node. */
3720 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3722 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3723 #define MAIN_NAME_P(NODE) \
3724 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3726 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3728 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3729 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3731 /* Default/current target options (TARGET_OPTION_NODE). */
3732 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3733 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3735 /* Default tree list option(), optimize() pragmas to be linked into the
3737 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3738 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3740 #define char_type_node integer_types[itk_char]
3741 #define signed_char_type_node integer_types[itk_signed_char]
3742 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3743 #define short_integer_type_node integer_types[itk_short]
3744 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3745 #define integer_type_node integer_types[itk_int]
3746 #define unsigned_type_node integer_types[itk_unsigned_int]
3747 #define long_integer_type_node integer_types[itk_long]
3748 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3749 #define long_long_integer_type_node integer_types[itk_long_long]
3750 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3752 /* True if NODE is an erroneous expression. */
3754 #define error_operand_p(NODE) \
3755 ((NODE) == error_mark_node \
3756 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3758 extern tree decl_assembler_name (tree);
3759 extern tree decl_comdat_group (const_tree);
3760 extern tree decl_comdat_group_id (const_tree);
3761 extern const char *decl_section_name (const_tree);
3762 extern void set_decl_section_name (tree, const char *);
3763 extern enum tls_model decl_tls_model (const_tree);
3764 extern void set_decl_tls_model (tree, enum tls_model);
3766 /* Compute the number of bytes occupied by 'node'. This routine only
3767 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3769 extern size_t tree_size (const_tree);
3771 /* Compute the number of bytes occupied by a tree with code CODE.
3772 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3773 which are of variable length. */
3774 extern size_t tree_code_size (enum tree_code);
3776 /* Allocate and return a new UID from the DECL_UID namespace. */
3777 extern int allocate_decl_uid (void);
3779 /* Lowest level primitive for allocating a node.
3780 The TREE_CODE is the only argument. Contents are initialized
3781 to zero except for a few of the common fields. */
3783 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3784 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3786 /* Free tree node. */
3788 extern void free_node (tree);
3790 /* Make a copy of a node, with all the same contents. */
3792 extern tree copy_node_stat (tree MEM_STAT_DECL);
3793 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3795 /* Make a copy of a chain of TREE_LIST nodes. */
3797 extern tree copy_list (tree);
3799 /* Make a CASE_LABEL_EXPR. */
3801 extern tree build_case_label (tree, tree, tree);
3804 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3805 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3807 /* Make an INTEGER_CST. */
3809 extern tree make_int_cst_stat (int, int MEM_STAT_DECL);
3810 #define make_int_cst(LEN, EXT_LEN) \
3811 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3813 /* Make a TREE_VEC. */
3815 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3816 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3818 /* Grow a TREE_VEC. */
3820 extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3821 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3823 /* Construct various types of nodes. */
3825 extern tree build_nt (enum tree_code, ...);
3826 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3828 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3829 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3830 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3831 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3832 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3833 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3834 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3835 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3836 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3837 tree MEM_STAT_DECL);
3838 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3839 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3840 tree MEM_STAT_DECL);
3841 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3843 /* _loc versions of build[1-5]. */
3846 build1_stat_loc (location_t loc, enum tree_code code, tree type,
3847 tree arg1 MEM_STAT_DECL)
3849 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3850 if (CAN_HAVE_LOCATION_P (t))
3851 SET_EXPR_LOCATION (t, loc);
3854 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3857 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3858 tree arg1 MEM_STAT_DECL)
3860 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3861 if (CAN_HAVE_LOCATION_P (t))
3862 SET_EXPR_LOCATION (t, loc);
3865 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3868 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3869 tree arg1, tree arg2 MEM_STAT_DECL)
3871 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3872 if (CAN_HAVE_LOCATION_P (t))
3873 SET_EXPR_LOCATION (t, loc);
3876 #define build3_loc(l,c,t1,t2,t3,t4) \
3877 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3880 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3881 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3883 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3884 if (CAN_HAVE_LOCATION_P (t))
3885 SET_EXPR_LOCATION (t, loc);
3888 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3889 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3892 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3893 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3895 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3896 arg4 PASS_MEM_STAT);
3897 if (CAN_HAVE_LOCATION_P (t))
3898 SET_EXPR_LOCATION (t, loc);
3901 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3902 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3904 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3905 #define build_var_debug_value(t1,t2) \
3906 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3908 /* Constructs double_int from tree CST. */
3910 extern tree double_int_to_tree (tree, double_int);
3912 extern tree wide_int_to_tree (tree type, const wide_int_ref &cst);
3913 extern tree force_fit_type (tree, const wide_int_ref &, int, bool);
3915 /* Create an INT_CST node with a CST value zero extended. */
3918 extern tree build_int_cst (tree, HOST_WIDE_INT);
3919 extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst);
3920 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3921 extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3922 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3923 extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3924 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3925 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3926 extern tree build_vector_from_val (tree, tree);
3927 extern void recompute_constructor_flags (tree);
3928 extern void verify_constructor_flags (tree);
3929 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3930 extern tree build_constructor_single (tree, tree, tree);
3931 extern tree build_constructor_from_list (tree, tree);
3932 extern tree build_constructor_va (tree, int, ...);
3933 extern tree build_real_from_int_cst (tree, const_tree);
3934 extern tree build_complex (tree, tree, tree);
3935 extern tree build_complex_inf (tree, bool);
3936 extern tree build_each_one_cst (tree);
3937 extern tree build_one_cst (tree);
3938 extern tree build_minus_one_cst (tree);
3939 extern tree build_all_ones_cst (tree);
3940 extern tree build_zero_cst (tree);
3941 extern tree build_string (int, const char *);
3942 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3943 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3944 extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3945 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3946 extern tree build_decl_stat (location_t, enum tree_code,
3947 tree, tree MEM_STAT_DECL);
3948 extern tree build_fn_decl (const char *, tree);
3949 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3950 extern tree build_translation_unit_decl (tree);
3951 extern tree build_block (tree, tree, tree, tree);
3952 extern tree build_empty_stmt (location_t);
3953 extern tree build_omp_clause (location_t, enum omp_clause_code);
3955 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3956 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3958 extern tree build_call_nary (tree, tree, int, ...);
3959 extern tree build_call_valist (tree, tree, int, va_list);
3960 #define build_call_array(T1,T2,N,T3)\
3961 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3962 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3963 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3964 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
3965 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
3966 extern tree build_call_expr_loc (location_t, tree, int, ...);
3967 extern tree build_call_expr (tree, int, ...);
3968 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3970 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3972 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
3974 extern tree build_string_literal (int, const char *);
3976 /* Construct various nodes representing data types. */
3978 extern tree signed_or_unsigned_type_for (int, tree);
3979 extern tree signed_type_for (tree);
3980 extern tree unsigned_type_for (tree);
3981 extern tree truth_type_for (tree);
3982 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
3983 extern tree build_pointer_type (tree);
3984 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
3985 extern tree build_reference_type (tree);
3986 extern tree build_vector_type_for_mode (tree, machine_mode);
3987 extern tree build_vector_type (tree innertype, int nunits);
3988 extern tree build_truth_vector_type (unsigned, unsigned);
3989 extern tree build_same_sized_truth_vector_type (tree vectype);
3990 extern tree build_opaque_vector_type (tree innertype, int nunits);
3991 extern tree build_index_type (tree);
3992 extern tree build_array_type (tree, tree);
3993 extern tree build_nonshared_array_type (tree, tree);
3994 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
3995 extern tree build_function_type (tree, tree);
3996 extern tree build_function_type_list (tree, ...);
3997 extern tree build_varargs_function_type_list (tree, ...);
3998 extern tree build_function_type_array (tree, int, tree *);
3999 extern tree build_varargs_function_type_array (tree, int, tree *);
4000 #define build_function_type_vec(RET, V) \
4001 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4002 #define build_varargs_function_type_vec(RET, V) \
4003 build_varargs_function_type_array (RET, vec_safe_length (V), \
4004 vec_safe_address (V))
4005 extern tree build_method_type_directly (tree, tree, tree);
4006 extern tree build_method_type (tree, tree);
4007 extern tree build_offset_type (tree, tree);
4008 extern tree build_complex_type (tree, bool named = false);
4009 extern tree array_type_nelts (const_tree);
4011 extern tree value_member (tree, tree);
4012 extern tree purpose_member (const_tree, tree);
4013 extern bool vec_member (const_tree, vec<tree, va_gc> *);
4014 extern tree chain_index (int, tree);
4016 extern int attribute_list_equal (const_tree, const_tree);
4017 extern int attribute_list_contained (const_tree, const_tree);
4018 extern int tree_int_cst_equal (const_tree, const_tree);
4020 extern bool tree_fits_shwi_p (const_tree)
4021 #ifndef ENABLE_TREE_CHECKING
4022 ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */
4025 extern bool tree_fits_uhwi_p (const_tree)
4026 #ifndef ENABLE_TREE_CHECKING
4027 ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */
4030 extern HOST_WIDE_INT tree_to_shwi (const_tree);
4031 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
4032 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4033 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4034 tree_to_shwi (const_tree t)
4036 gcc_assert (tree_fits_shwi_p (t));
4037 return TREE_INT_CST_LOW (t);
4040 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
4041 tree_to_uhwi (const_tree t)
4043 gcc_assert (tree_fits_uhwi_p (t));
4044 return TREE_INT_CST_LOW (t);
4047 extern int tree_int_cst_sgn (const_tree);
4048 extern int tree_int_cst_sign_bit (const_tree);
4049 extern unsigned int tree_int_cst_min_precision (tree, signop);
4050 extern tree strip_array_types (tree);
4051 extern tree excess_precision_type (tree);
4052 extern bool valid_constant_size_p (const_tree);
4055 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4056 put the prototype here. Rtl.h does declare the prototype if
4057 tree.h had been included. */
4059 extern tree make_tree (tree, rtx);
4061 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4064 Such modified types already made are recorded so that duplicates
4067 extern tree build_type_attribute_variant (tree, tree);
4068 extern tree build_decl_attribute_variant (tree, tree);
4069 extern tree build_type_attribute_qual_variant (tree, tree, int);
4071 extern bool attribute_value_equal (const_tree, const_tree);
4073 /* Return 0 if the attributes for two types are incompatible, 1 if they
4074 are compatible, and 2 if they are nearly compatible (which causes a
4075 warning to be generated). */
4076 extern int comp_type_attributes (const_tree, const_tree);
4078 /* Default versions of target-overridable functions. */
4079 extern tree merge_decl_attributes (tree, tree);
4080 extern tree merge_type_attributes (tree, tree);
4082 /* This function is a private implementation detail of lookup_attribute()
4083 and you should never call it directly. */
4084 extern tree private_lookup_attribute (const char *, size_t, tree);
4086 /* This function is a private implementation detail
4087 of lookup_attribute_by_prefix() and you should never call it directly. */
4088 extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree);
4090 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4091 return a pointer to the attribute's list element if the attribute
4092 is part of the list, or NULL_TREE if not found. If the attribute
4093 appears more than once, this only returns the first occurrence; the
4094 TREE_CHAIN of the return value should be passed back in if further
4095 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4099 lookup_attribute (const char *attr_name, tree list)
4101 gcc_checking_assert (attr_name[0] != '_');
4102 /* In most cases, list is NULL_TREE. */
4103 if (list == NULL_TREE)
4106 /* Do the strlen() before calling the out-of-line implementation.
4107 In most cases attr_name is a string constant, and the compiler
4108 will optimize the strlen() away. */
4109 return private_lookup_attribute (attr_name, strlen (attr_name), list);
4112 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4113 return a pointer to the attribute's list first element if the attribute
4114 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4118 lookup_attribute_by_prefix (const char *attr_name, tree list)
4120 gcc_checking_assert (attr_name[0] != '_');
4121 /* In most cases, list is NULL_TREE. */
4122 if (list == NULL_TREE)
4125 return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name),
4130 /* This function is a private implementation detail of
4131 is_attribute_p() and you should never call it directly. */
4132 extern bool private_is_attribute_p (const char *, size_t, const_tree);
4134 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4135 if the identifier node is a valid attribute name for the string.
4136 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4137 be the identifier for 'text' or for '__text__'. */
4140 is_attribute_p (const char *attr_name, const_tree ident)
4142 gcc_checking_assert (attr_name[0] != '_');
4143 /* Do the strlen() before calling the out-of-line implementation.
4144 In most cases attr_name is a string constant, and the compiler
4145 will optimize the strlen() away. */
4146 return private_is_attribute_p (attr_name, strlen (attr_name), ident);
4149 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4150 modified list. ATTR_NAME must be in the form 'text' (not
4153 extern tree remove_attribute (const char *, tree);
4155 /* Given two attributes lists, return a list of their union. */
4157 extern tree merge_attributes (tree, tree);
4159 /* Given two Windows decl attributes lists, possibly including
4160 dllimport, return a list of their union . */
4161 extern tree merge_dllimport_decl_attributes (tree, tree);
4163 /* Handle a "dllimport" or "dllexport" attribute. */
4164 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4166 /* Returns true iff unqualified CAND and BASE are equivalent. */
4168 extern bool check_base_type (const_tree cand, const_tree base);
4170 /* Check whether CAND is suitable to be returned from get_qualified_type
4171 (BASE, TYPE_QUALS). */
4173 extern bool check_qualified_type (const_tree, const_tree, int);
4175 /* Return a version of the TYPE, qualified as indicated by the
4176 TYPE_QUALS, if one exists. If no qualified version exists yet,
4177 return NULL_TREE. */
4179 extern tree get_qualified_type (tree, int);
4181 /* Like get_qualified_type, but creates the type if it does not
4182 exist. This function never returns NULL_TREE. */
4184 extern tree build_qualified_type (tree, int);
4186 /* Create a variant of type T with alignment ALIGN. */
4188 extern tree build_aligned_type (tree, unsigned int);
4190 /* Like build_qualified_type, but only deals with the `const' and
4191 `volatile' qualifiers. This interface is retained for backwards
4192 compatibility with the various front-ends; new code should use
4193 build_qualified_type instead. */
4195 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4196 build_qualified_type ((TYPE), \
4197 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4198 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4200 /* Make a copy of a type node. */
4202 extern tree build_distinct_type_copy (tree);
4203 extern tree build_variant_type_copy (tree);
4205 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4206 return a canonicalized ..._TYPE node, so that duplicates are not made.
4207 How the hash code is computed is up to the caller, as long as any two
4208 callers that could hash identical-looking type nodes agree. */
4210 extern tree type_hash_canon (unsigned int, tree);
4212 extern tree convert (tree, tree);
4213 extern unsigned int expr_align (const_tree);
4214 extern tree size_in_bytes (const_tree);
4215 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4216 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4217 extern tree bit_position (const_tree);
4218 extern tree byte_position (const_tree);
4219 extern HOST_WIDE_INT int_byte_position (const_tree);
4221 #define sizetype sizetype_tab[(int) stk_sizetype]
4222 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4223 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4224 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4225 #define size_int(L) size_int_kind (L, stk_sizetype)
4226 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4227 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4228 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4230 /* Type for sizes of data-type. */
4232 #define BITS_PER_UNIT_LOG \
4233 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4234 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4235 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4237 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4238 by making the last node in X point to Y.
4239 Returns X, except if X is 0 returns Y. */
4241 extern tree chainon (tree, tree);
4243 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4245 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4246 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4248 /* Return the last tree node in a chain. */
4250 extern tree tree_last (tree);
4252 /* Reverse the order of elements in a chain, and return the new head. */
4254 extern tree nreverse (tree);
4256 /* Returns the length of a chain of nodes
4257 (number of chain pointers to follow before reaching a null pointer). */
4259 extern int list_length (const_tree);
4261 /* Returns the first FIELD_DECL in a type. */
4263 extern tree first_field (const_tree);
4265 /* Given an initializer INIT, return TRUE if INIT is zero or some
4266 aggregate of zeros. Otherwise return FALSE. */
4268 extern bool initializer_zerop (const_tree);
4270 /* Given a vector VEC, return its first element if all elements are
4271 the same. Otherwise return NULL_TREE. */
4273 extern tree uniform_vector_p (const_tree);
4275 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4277 extern vec<tree, va_gc> *ctor_to_vec (tree);
4279 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4281 extern int zerop (const_tree);
4283 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4285 extern int integer_zerop (const_tree);
4287 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4289 extern int integer_onep (const_tree);
4291 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4292 a vector or complex where each part is 1. */
4294 extern int integer_each_onep (const_tree);
4296 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4297 all of whose significant bits are 1. */
4299 extern int integer_all_onesp (const_tree);
4301 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4304 extern int integer_minus_onep (const_tree);
4306 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4307 exactly one bit 1. */
4309 extern int integer_pow2p (const_tree);
4311 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4312 with a nonzero value. */
4314 extern int integer_nonzerop (const_tree);
4316 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4317 a vector where each element is an integer constant of value -1. */
4319 extern int integer_truep (const_tree);
4321 extern bool cst_and_fits_in_hwi (const_tree);
4322 extern tree num_ending_zeros (const_tree);
4324 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4327 extern int fixed_zerop (const_tree);
4329 /* staticp (tree x) is nonzero if X is a reference to data allocated
4330 at a fixed address in memory. Returns the outermost data. */
4332 extern tree staticp (tree);
4334 /* save_expr (EXP) returns an expression equivalent to EXP
4335 but it can be used multiple times within context CTX
4336 and only evaluate EXP once. */
4338 extern tree save_expr (tree);
4340 /* Return true if T is function-invariant. */
4342 extern bool tree_invariant_p (tree);
4344 /* Look inside EXPR into any simple arithmetic operations. Return the
4345 outermost non-arithmetic or non-invariant node. */
4347 extern tree skip_simple_arithmetic (tree);
4349 /* Look inside EXPR into simple arithmetic operations involving constants.
4350 Return the outermost non-arithmetic or non-constant node. */
4352 extern tree skip_simple_constant_arithmetic (tree);
4354 /* Return which tree structure is used by T. */
4356 enum tree_node_structure_enum tree_node_structure (const_tree);
4358 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4359 size or offset that depends on a field within a record. */
4361 extern bool contains_placeholder_p (const_tree);
4363 /* This macro calls the above function but short-circuits the common
4364 case of a constant to save time. Also check for null. */
4366 #define CONTAINS_PLACEHOLDER_P(EXP) \
4367 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4369 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4370 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4373 extern bool type_contains_placeholder_p (tree);
4375 /* Given a tree EXP, find all occurrences of references to fields
4376 in a PLACEHOLDER_EXPR and place them in vector REFS without
4377 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4378 we assume here that EXP contains only arithmetic expressions
4379 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4382 extern void find_placeholder_in_expr (tree, vec<tree> *);
4384 /* This macro calls the above function but short-circuits the common
4385 case of a constant to save time and also checks for NULL. */
4387 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4389 if((EXP) && !TREE_CONSTANT (EXP)) \
4390 find_placeholder_in_expr (EXP, V); \
4393 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4394 return a tree with all occurrences of references to F in a
4395 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4396 CONST_DECLs. Note that we assume here that EXP contains only
4397 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4398 occurring only in their argument list. */
4400 extern tree substitute_in_expr (tree, tree, tree);
4402 /* This macro calls the above function but short-circuits the common
4403 case of a constant to save time and also checks for NULL. */
4405 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4406 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4408 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4409 for it within OBJ, a tree that is an object or a chain of references. */
4411 extern tree substitute_placeholder_in_expr (tree, tree);
4413 /* This macro calls the above function but short-circuits the common
4414 case of a constant to save time and also checks for NULL. */
4416 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4417 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4418 : substitute_placeholder_in_expr (EXP, OBJ))
4421 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4422 but it can be used multiple times
4423 and only evaluate the subexpressions once. */
4425 extern tree stabilize_reference (tree);
4427 /* Return EXP, stripped of any conversions to wider types
4428 in such a way that the result of converting to type FOR_TYPE
4429 is the same as if EXP were converted to FOR_TYPE.
4430 If FOR_TYPE is 0, it signifies EXP's type. */
4432 extern tree get_unwidened (tree, tree);
4434 /* Return OP or a simpler expression for a narrower value
4435 which can be sign-extended or zero-extended to give back OP.
4436 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4437 or 0 if the value should be sign-extended. */
4439 extern tree get_narrower (tree, int *);
4441 /* Return true if T is an expression that get_inner_reference handles. */
4444 handled_component_p (const_tree t)
4446 switch (TREE_CODE (t))
4451 case ARRAY_RANGE_REF:
4454 case VIEW_CONVERT_EXPR:
4462 /* Return true T is a component with reverse storage order. */
4465 reverse_storage_order_for_component_p (tree t)
4467 /* The storage order only applies to scalar components. */
4468 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t)))
4471 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
4472 t = TREE_OPERAND (t, 0);
4474 switch (TREE_CODE (t))
4478 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4479 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4480 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
4481 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
4485 return REF_REVERSE_STORAGE_ORDER (t);
4487 case ARRAY_RANGE_REF:
4488 case VIEW_CONVERT_EXPR:
4496 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4497 that can modify the storage order of objects. Note that, even if the
4498 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4499 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4500 it can change the partition of the aggregate object into scalars. */
4503 storage_order_barrier_p (const_tree t)
4505 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
4508 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4509 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
4512 tree op = TREE_OPERAND (t, 0);
4514 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
4515 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
4521 /* Given a DECL or TYPE, return the scope in which it was declared, or
4522 NUL_TREE if there is no containing scope. */
4524 extern tree get_containing_scope (const_tree);
4526 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4528 extern tree decl_function_context (const_tree);
4530 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4531 this _DECL with its context, or zero if none. */
4532 extern tree decl_type_context (const_tree);
4534 /* Return 1 if EXPR is the real constant zero. */
4535 extern int real_zerop (const_tree);
4537 /* Initialize the iterator I with arguments from function FNDECL */
4540 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4542 i->next = TYPE_ARG_TYPES (fntype);
4545 /* Return a pointer that holds the next argument if there are more arguments to
4546 handle, otherwise return NULL. */
4548 static inline tree *
4549 function_args_iter_cond_ptr (function_args_iterator *i)
4551 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4554 /* Return the next argument if there are more arguments to handle, otherwise
4558 function_args_iter_cond (function_args_iterator *i)
4560 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4563 /* Advance to the next argument. */
4565 function_args_iter_next (function_args_iterator *i)
4567 gcc_assert (i->next != NULL_TREE);
4568 i->next = TREE_CHAIN (i->next);
4571 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4574 inlined_function_outer_scope_p (const_tree block)
4576 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4579 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4580 to point to the next tree element. ITER is an instance of
4581 function_args_iterator used to iterate the arguments. */
4582 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4583 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4584 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4585 function_args_iter_next (&(ITER)))
4587 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4588 to the next tree element. ITER is an instance of function_args_iterator
4589 used to iterate the arguments. */
4590 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4591 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4592 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4593 function_args_iter_next (&(ITER)))
4596 extern unsigned crc32_string (unsigned, const char *);
4597 extern unsigned crc32_byte (unsigned, char);
4598 extern unsigned crc32_unsigned (unsigned, unsigned);
4599 extern void clean_symbol_name (char *);
4600 extern tree get_file_function_name (const char *);
4601 extern tree get_callee_fndecl (const_tree);
4602 extern combined_fn get_call_combined_fn (const_tree);
4603 extern int type_num_arguments (const_tree);
4604 extern bool associative_tree_code (enum tree_code);
4605 extern bool commutative_tree_code (enum tree_code);
4606 extern bool commutative_ternary_tree_code (enum tree_code);
4607 extern bool operation_can_overflow (enum tree_code);
4608 extern bool operation_no_trapping_overflow (tree, enum tree_code);
4609 extern tree upper_bound_in_type (tree, tree);
4610 extern tree lower_bound_in_type (tree, tree);
4611 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4612 extern tree create_artificial_label (location_t);
4613 extern const char *get_name (tree);
4614 extern bool stdarg_p (const_tree);
4615 extern bool prototype_p (const_tree);
4616 extern bool is_typedef_decl (const_tree x);
4617 extern bool typedef_variant_p (const_tree);
4618 extern bool auto_var_in_fn_p (const_tree, const_tree);
4619 extern tree build_low_bits_mask (tree, unsigned);
4620 extern bool tree_nop_conversion_p (const_tree, const_tree);
4621 extern tree tree_strip_nop_conversions (tree);
4622 extern tree tree_strip_sign_nop_conversions (tree);
4623 extern const_tree strip_invariant_refs (const_tree);
4624 extern tree lhd_gcc_personality (void);
4625 extern void assign_assembler_name_if_neeeded (tree);
4626 extern void warn_deprecated_use (tree, tree);
4627 extern void cache_integer_cst (tree);
4628 extern const char *combined_fn_name (combined_fn);
4630 /* Compare and hash for any structure which begins with a canonical
4631 pointer. Assumes all pointers are interchangeable, which is sort
4632 of already assumed by gcc elsewhere IIRC. */
4635 struct_ptr_eq (const void *a, const void *b)
4637 const void * const * x = (const void * const *) a;
4638 const void * const * y = (const void * const *) b;
4642 static inline hashval_t
4643 struct_ptr_hash (const void *a)
4645 const void * const * x = (const void * const *) a;
4646 return (intptr_t)*x >> 4;
4649 /* Return nonzero if CODE is a tree code that represents a truth value. */
4651 truth_value_p (enum tree_code code)
4653 return (TREE_CODE_CLASS (code) == tcc_comparison
4654 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4655 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4656 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4659 /* Return whether TYPE is a type suitable for an offset for
4660 a POINTER_PLUS_EXPR. */
4662 ptrofftype_p (tree type)
4664 return (INTEGRAL_TYPE_P (type)
4665 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4666 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4669 /* Return true if the argument is a complete type or an array
4670 of unknown bound (whose type is incomplete but) whose elements
4671 have complete type. */
4673 complete_or_array_type_p (const_tree type)
4675 return COMPLETE_TYPE_P (type)
4676 || (TREE_CODE (type) == ARRAY_TYPE
4677 && COMPLETE_TYPE_P (TREE_TYPE (type)));
4680 extern tree strip_float_extensions (tree);
4681 extern int really_constant_p (const_tree);
4682 extern bool decl_address_invariant_p (const_tree);
4683 extern bool decl_address_ip_invariant_p (const_tree);
4684 extern bool int_fits_type_p (const_tree, const_tree);
4685 #ifndef GENERATOR_FILE
4686 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4688 extern bool variably_modified_type_p (tree, tree);
4689 extern int tree_log2 (const_tree);
4690 extern int tree_floor_log2 (const_tree);
4691 extern unsigned int tree_ctz (const_tree);
4692 extern int simple_cst_equal (const_tree, const_tree);
4697 extern void add_expr (const_tree, hash &);
4701 /* Compat version until all callers are converted. Return hash for
4703 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
4705 inchash::hash hstate (seed);
4706 inchash::add_expr (tree, hstate);
4707 return hstate.end ();
4710 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4711 extern int type_list_equal (const_tree, const_tree);
4712 extern int chain_member (const_tree, const_tree);
4713 extern void dump_tree_statistics (void);
4714 extern void recompute_tree_invariant_for_addr_expr (tree);
4715 extern bool needs_to_live_in_memory (const_tree);
4716 extern tree reconstruct_complex_type (tree, tree);
4717 extern int real_onep (const_tree);
4718 extern int real_minus_onep (const_tree);
4719 extern void init_ttree (void);
4720 extern void build_common_tree_nodes (bool);
4721 extern void build_common_builtin_nodes (void);
4722 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4723 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
4724 extern tree build_range_type (tree, tree, tree);
4725 extern tree build_nonshared_range_type (tree, tree, tree);
4726 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4727 extern HOST_WIDE_INT int_cst_value (const_tree);
4728 extern tree tree_block (tree);
4729 extern void tree_set_block (tree, tree);
4730 extern location_t *block_nonartificial_location (tree);
4731 extern location_t tree_nonartificial_location (tree);
4732 extern tree block_ultimate_origin (const_tree);
4733 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4734 extern bool virtual_method_call_p (const_tree);
4735 extern tree obj_type_ref_class (const_tree ref);
4736 extern bool types_same_for_odr (const_tree type1, const_tree type2,
4738 extern bool contains_bitfld_component_ref_p (const_tree);
4739 extern bool block_may_fallthru (const_tree);
4740 extern void using_eh_for_cleanups (void);
4741 extern bool using_eh_for_cleanups_p (void);
4742 extern const char *get_tree_code_name (enum tree_code);
4743 extern void set_call_expr_flags (tree, int);
4744 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
4746 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4748 #define walk_tree(a,b,c,d) \
4749 walk_tree_1 (a, b, c, d, NULL)
4750 #define walk_tree_without_duplicates(a,b,c) \
4751 walk_tree_without_duplicates_1 (a, b, c, NULL)
4753 extern tree drop_tree_overflow (tree);
4755 /* Given a memory reference expression T, return its base address.
4756 The base address of a memory reference expression is the main
4757 object being referenced. */
4758 extern tree get_base_address (tree t);
4760 /* Return a tree of sizetype representing the size, in bytes, of the element
4761 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4762 extern tree array_ref_element_size (tree);
4764 /* Return a tree representing the upper bound of the array mentioned in
4765 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4766 extern tree array_ref_up_bound (tree);
4768 /* Return a tree representing the lower bound of the array mentioned in
4769 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4770 extern tree array_ref_low_bound (tree);
4772 /* Returns true if REF is an array reference to an array at the end of
4773 a structure. If this is the case, the array may be allocated larger
4774 than its upper bound implies. */
4775 extern bool array_at_struct_end_p (tree);
4777 /* Return a tree representing the offset, in bytes, of the field referenced
4778 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4779 extern tree component_ref_field_offset (tree);
4781 extern int tree_map_base_eq (const void *, const void *);
4782 extern unsigned int tree_map_base_hash (const void *);
4783 extern int tree_map_base_marked_p (const void *);
4784 extern void DEBUG_FUNCTION verify_type (const_tree t);
4785 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
4786 bool trust_type_canonical = true);
4787 extern bool type_with_interoperable_signedness (const_tree);
4789 /* Return simplified tree code of type that is used for canonical type
4791 inline enum tree_code
4792 tree_code_for_canonical_type_merging (enum tree_code code)
4794 /* By C standard, each enumerated type shall be compatible with char,
4795 a signed integer, or an unsigned integer. The choice of type is
4796 implementation defined (in our case it depends on -fshort-enum).
4798 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4799 type and compare only by their signedness and precision. */
4800 if (code == ENUMERAL_TYPE)
4801 return INTEGER_TYPE;
4802 /* To allow inter-operability between languages having references and
4803 C, we consider reference types and pointers alike. Note that this is
4804 not strictly necessary for C-Fortran 2008 interoperability because
4805 Fortran define C_PTR type that needs to be compatible with C pointers
4806 and we handle this one as ptr_type_node. */
4807 if (code == REFERENCE_TYPE)
4808 return POINTER_TYPE;
4812 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
4813 We don't define the types for pointers, arrays and vectors. The reason is
4814 that pointers are handled specially: ptr_type_node accesses conflict with
4815 accesses to all other pointers. This is done by alias.c.
4816 Because alias sets of arrays and vectors are the same as types of their
4817 elements, we can't compute canonical type either. Otherwise we could go
4818 form void *[10] to int *[10] (because they are equivalent for canonical type
4819 machinery) and get wrong TBAA. */
4822 canonical_type_used_p (const_tree t)
4824 return !(POINTER_TYPE_P (t)
4825 || TREE_CODE (t) == ARRAY_TYPE
4826 || TREE_CODE (t) == VECTOR_TYPE);
4829 #define tree_map_eq tree_map_base_eq
4830 extern unsigned int tree_map_hash (const void *);
4831 #define tree_map_marked_p tree_map_base_marked_p
4833 #define tree_decl_map_eq tree_map_base_eq
4834 extern unsigned int tree_decl_map_hash (const void *);
4835 #define tree_decl_map_marked_p tree_map_base_marked_p
4837 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
4839 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
4841 equal (tree_decl_map *a, tree_decl_map *b)
4843 return tree_decl_map_eq (a, b);
4847 keep_cache_entry (tree_decl_map *&m)
4849 return ggc_marked_p (m->base.from);
4853 #define tree_int_map_eq tree_map_base_eq
4854 #define tree_int_map_hash tree_map_base_hash
4855 #define tree_int_map_marked_p tree_map_base_marked_p
4857 #define tree_vec_map_eq tree_map_base_eq
4858 #define tree_vec_map_hash tree_decl_map_hash
4859 #define tree_vec_map_marked_p tree_map_base_marked_p
4861 /* Initialize the abstract argument list iterator object ITER with the
4862 arguments from CALL_EXPR node EXP. */
4864 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4867 iter->n = call_expr_nargs (exp);
4872 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4875 iter->n = call_expr_nargs (exp);
4879 /* Return the next argument from abstract argument list iterator object ITER,
4880 and advance its state. Return NULL_TREE if there are no more arguments. */
4882 next_call_expr_arg (call_expr_arg_iterator *iter)
4885 if (iter->i >= iter->n)
4887 result = CALL_EXPR_ARG (iter->t, iter->i);
4892 static inline const_tree
4893 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4896 if (iter->i >= iter->n)
4898 result = CALL_EXPR_ARG (iter->t, iter->i);
4903 /* Initialize the abstract argument list iterator object ITER, then advance
4904 past and return the first argument. Useful in for expressions, e.g.
4905 for (arg = first_call_expr_arg (exp, &iter); arg;
4906 arg = next_call_expr_arg (&iter)) */
4908 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4910 init_call_expr_arg_iterator (exp, iter);
4911 return next_call_expr_arg (iter);
4914 static inline const_tree
4915 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4917 init_const_call_expr_arg_iterator (exp, iter);
4918 return next_const_call_expr_arg (iter);
4921 /* Test whether there are more arguments in abstract argument list iterator
4922 ITER, without changing its state. */
4924 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4926 return (iter->i < iter->n);
4929 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4930 (of type call_expr_arg_iterator) to hold the iteration state. */
4931 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4932 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4933 (arg) = next_call_expr_arg (&(iter)))
4935 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4936 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4937 (arg) = next_const_call_expr_arg (&(iter)))
4939 /* Return true if tree node T is a language-specific node. */
4941 is_lang_specific (const_tree t)
4943 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4946 /* Valid builtin number. */
4947 #define BUILTIN_VALID_P(FNCODE) \
4948 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4950 /* Return the tree node for an explicit standard builtin function or NULL. */
4952 builtin_decl_explicit (enum built_in_function fncode)
4954 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4956 return builtin_info[(size_t)fncode].decl;
4959 /* Return the tree node for an implicit builtin function or NULL. */
4961 builtin_decl_implicit (enum built_in_function fncode)
4963 size_t uns_fncode = (size_t)fncode;
4964 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4966 if (!builtin_info[uns_fncode].implicit_p)
4969 return builtin_info[uns_fncode].decl;
4972 /* Set explicit builtin function nodes and whether it is an implicit
4976 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4978 size_t ufncode = (size_t)fncode;
4980 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4981 && (decl != NULL_TREE || !implicit_p));
4983 builtin_info[ufncode].decl = decl;
4984 builtin_info[ufncode].implicit_p = implicit_p;
4985 builtin_info[ufncode].declared_p = false;
4988 /* Set the implicit flag for a builtin function. */
4991 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
4993 size_t uns_fncode = (size_t)fncode;
4995 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4996 && builtin_info[uns_fncode].decl != NULL_TREE);
4998 builtin_info[uns_fncode].implicit_p = implicit_p;
5001 /* Set the declared flag for a builtin function. */
5004 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
5006 size_t uns_fncode = (size_t)fncode;
5008 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5009 && builtin_info[uns_fncode].decl != NULL_TREE);
5011 builtin_info[uns_fncode].declared_p = declared_p;
5014 /* Return whether the standard builtin function can be used as an explicit
5018 builtin_decl_explicit_p (enum built_in_function fncode)
5020 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5021 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
5024 /* Return whether the standard builtin function can be used implicitly. */
5027 builtin_decl_implicit_p (enum built_in_function fncode)
5029 size_t uns_fncode = (size_t)fncode;
5031 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5032 return (builtin_info[uns_fncode].decl != NULL_TREE
5033 && builtin_info[uns_fncode].implicit_p);
5036 /* Return whether the standard builtin function was declared. */
5039 builtin_decl_declared_p (enum built_in_function fncode)
5041 size_t uns_fncode = (size_t)fncode;
5043 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5044 return (builtin_info[uns_fncode].decl != NULL_TREE
5045 && builtin_info[uns_fncode].declared_p);
5048 /* Return true if T (assumed to be a DECL) is a global variable.
5049 A variable is considered global if its storage is not automatic. */
5052 is_global_var (const_tree t)
5054 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5057 /* Return true if VAR may be aliased. A variable is considered as
5058 maybe aliased if it has its address taken by the local TU
5059 or possibly by another TU and might be modified through a pointer. */
5062 may_be_aliased (const_tree var)
5064 return (TREE_CODE (var) != CONST_DECL
5065 && (TREE_PUBLIC (var)
5066 || DECL_EXTERNAL (var)
5067 || TREE_ADDRESSABLE (var))
5068 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
5069 && ((TREE_READONLY (var)
5070 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
5071 || (TREE_CODE (var) == VAR_DECL
5072 && DECL_NONALIASED (var)))));
5075 /* Return pointer to optimization flags of FNDECL. */
5076 static inline struct cl_optimization *
5077 opts_for_fn (const_tree fndecl)
5079 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
5080 if (fn_opts == NULL_TREE)
5081 fn_opts = optimization_default_node;
5082 return TREE_OPTIMIZATION (fn_opts);
5085 /* Return pointer to target flags of FNDECL. */
5086 static inline cl_target_option *
5087 target_opts_for_fn (const_tree fndecl)
5089 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
5090 if (fn_opts == NULL_TREE)
5091 fn_opts = target_option_default_node;
5092 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
5095 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5096 the optimization level of function fndecl. */
5097 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5099 /* For anonymous aggregate types, we need some sort of name to
5100 hold on to. In practice, this should not appear, but it should
5101 not be harmful if it does. */
5102 extern const char *anon_aggrname_format();
5103 extern bool anon_aggrname_p (const_tree);
5105 /* The tree and const_tree overload templates. */
5109 struct int_traits <const_tree>
5111 static const enum precision_type precision_type = VAR_PRECISION;
5112 static const bool host_dependent_precision = false;
5113 static const bool is_sign_extended = false;
5114 static unsigned int get_precision (const_tree);
5115 static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int,
5120 struct int_traits <tree> : public int_traits <const_tree> {};
5129 extended_tree (const_tree);
5131 unsigned int get_precision () const;
5132 const HOST_WIDE_INT *get_val () const;
5133 unsigned int get_len () const;
5137 struct int_traits <extended_tree <N> >
5139 static const enum precision_type precision_type = CONST_PRECISION;
5140 static const bool host_dependent_precision = false;
5141 static const bool is_sign_extended = true;
5142 static const unsigned int precision = N;
5145 generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> >
5146 to_widest (const_tree);
5148 generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree);
5152 wi::int_traits <const_tree>::get_precision (const_tree tcst)
5154 return TYPE_PRECISION (TREE_TYPE (tcst));
5157 /* Convert the tree_cst X into a wide_int of PRECISION. */
5158 inline wi::storage_ref
5159 wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
5160 unsigned int precision, const_tree x)
5162 return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
5166 inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> >
5167 wi::to_widest (const_tree t)
5172 inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> >
5173 wi::to_offset (const_tree t)
5179 inline wi::extended_tree <N>::extended_tree (const_tree t)
5182 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
5187 wi::extended_tree <N>::get_precision () const
5193 inline const HOST_WIDE_INT *
5194 wi::extended_tree <N>::get_val () const
5196 return &TREE_INT_CST_ELT (m_t, 0);
5201 wi::extended_tree <N>::get_len () const
5203 if (N == ADDR_MAX_PRECISION)
5204 return TREE_INT_CST_OFFSET_NUNITS (m_t);
5205 else if (N >= WIDE_INT_MAX_PRECISION)
5206 return TREE_INT_CST_EXT_NUNITS (m_t);
5208 /* This class is designed to be used for specific output precisions
5209 and needs to be as fast as possible, so there is no fallback for
5216 template <typename T>
5217 bool fits_to_boolean_p (const T &x, const_tree);
5219 template <typename T>
5220 bool fits_to_tree_p (const T &x, const_tree);
5222 wide_int min_value (const_tree);
5223 wide_int max_value (const_tree);
5224 wide_int from_mpz (const_tree, mpz_t, bool);
5227 template <typename T>
5229 wi::fits_to_boolean_p (const T &x, const_tree type)
5231 return eq_p (x, 0) || eq_p (x, TYPE_UNSIGNED (type) ? 1 : -1);
5234 template <typename T>
5236 wi::fits_to_tree_p (const T &x, const_tree type)
5238 /* Non-standard boolean types can have arbitrary precision but various
5239 transformations assume that they can only take values 0 and +/-1. */
5240 if (TREE_CODE (type) == BOOLEAN_TYPE)
5241 return fits_to_boolean_p (x, type);
5243 if (TYPE_UNSIGNED (type))
5244 return eq_p (x, zext (x, TYPE_PRECISION (type)));
5246 return eq_p (x, sext (x, TYPE_PRECISION (type)));
5249 /* Produce the smallest number that is represented in TYPE. The precision
5250 and sign are taken from TYPE. */
5252 wi::min_value (const_tree type)
5254 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5257 /* Produce the largest number that is represented in TYPE. The precision
5258 and sign are taken from TYPE. */
5260 wi::max_value (const_tree type)
5262 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5265 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5266 extending both according to their respective TYPE_SIGNs. */
5269 tree_int_cst_lt (const_tree t1, const_tree t2)
5271 return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2));
5274 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5275 extending both according to their respective TYPE_SIGNs. */
5278 tree_int_cst_le (const_tree t1, const_tree t2)
5280 return wi::les_p (wi::to_widest (t1), wi::to_widest (t2));
5283 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5284 are both INTEGER_CSTs and their values are extended according to their
5285 respective TYPE_SIGNs. */
5288 tree_int_cst_compare (const_tree t1, const_tree t2)
5290 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
5293 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5294 but none of these files are allowed to be included from front ends.
5295 They should be split in two. One suitable for the FEs, the other suitable
5298 /* Assign the RTX to declaration. */
5299 extern void set_decl_rtl (tree, rtx);
5300 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
5302 /* Given an expression EXP that is a handled_component_p,
5303 look for the ultimate containing object, which is returned and specify
5304 the access position and size. */
5305 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
5306 tree *, machine_mode *, int *, int *,
5309 extern tree build_personality_function (const char *);
5311 struct GTY(()) int_n_trees_t {
5312 /* These parts are initialized at runtime */
5317 /* This is also in machmode.h */
5318 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
5319 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
5321 /* Like bit_position, but return as an integer. It must be representable in
5322 that way (since it could be a signed value, we don't have the
5323 option of returning -1 like int_size_in_byte can. */
5325 inline HOST_WIDE_INT
5326 int_bit_position (const_tree field)
5328 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field)), BITS_PER_UNIT_LOG)
5329 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
5332 /* Return true if it makes sense to consider alias set for a type T. */
5335 type_with_alias_set_p (const_tree t)
5337 /* Function and method types are never accessed as memory locations. */
5338 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
5341 if (COMPLETE_TYPE_P (t))
5344 /* Incomplete types can not be accessed in general except for arrays
5345 where we can fetch its element despite we have no array bounds. */
5346 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
5352 extern location_t get_pure_location (location_t loc);
5354 /* Get the endpoint of any range encoded within location LOC. */
5356 static inline location_t
5357 get_finish (location_t loc)
5359 return get_range_from_loc (line_table, loc).m_finish;
5362 extern location_t set_block (location_t loc, tree block);
5364 extern void gt_ggc_mx (tree &);
5365 extern void gt_pch_nx (tree &);
5366 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
5368 extern bool nonnull_arg_p (const_tree);
5369 extern bool is_redundant_typedef (const_tree);
5372 set_source_range (tree expr, location_t start, location_t finish);
5375 set_source_range (tree expr, source_range src_range);
5377 static inline source_range
5378 get_decl_source_range (tree decl)
5380 location_t loc = DECL_SOURCE_LOCATION (decl);
5381 return get_range_from_loc (line_table, loc);
5385 make_location (location_t caret, location_t start, location_t finish);
5387 /* Return true if it makes sense to promote/demote from_type to to_type. */
5389 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
5391 unsigned int to_type_precision = TYPE_PRECISION (to_type);
5393 /* OK to promote if to_type is no bigger than word_mode. */
5394 if (to_type_precision <= GET_MODE_PRECISION (word_mode))
5397 /* Otherwise, allow only if narrowing or same precision conversions. */
5398 return to_type_precision <= TYPE_PRECISION (from_type);
5401 #endif /* GCC_TREE_H */