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 && !TYPE_OVERFLOW_WRAPS (TYPE) \
847 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
849 /* True if pointer types have undefined overflow. */
850 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
852 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
853 Nonzero in a FUNCTION_DECL means that the function has been compiled.
854 This is interesting in an inline function, since it might not need
855 to be compiled separately.
856 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
857 or TYPE_DECL if the debugging info for the type has been written.
858 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
859 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
861 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
863 /* Nonzero in a _DECL if the name is used in its scope.
864 Nonzero in an expr node means inhibit warning if value is unused.
865 In IDENTIFIER_NODEs, this means that some extern decl for this name
867 In a BLOCK, this means that the block contains variables that are used. */
868 #define TREE_USED(NODE) ((NODE)->base.used_flag)
870 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
871 throw an exception. In a CALL_EXPR, nonzero means the call cannot
872 throw. We can't easily check the node type here as the C++
873 frontend also uses this flag (for AGGR_INIT_EXPR). */
874 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
876 /* In a CALL_EXPR, means that it's safe to use the target of the call
877 expansion as the return slot for a call that returns in memory. */
878 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
879 (CALL_EXPR_CHECK (NODE)->base.private_flag)
881 /* Cilk keywords accessors. */
882 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
884 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
885 passed by invisible reference (and the TREE_TYPE is a pointer to the true
887 #define DECL_BY_REFERENCE(NODE) \
888 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
889 RESULT_DECL)->decl_common.decl_by_reference_flag)
891 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
893 #define DECL_READ_P(NODE) \
894 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
896 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
897 attempting to share the stack slot with some other variable. */
898 #define DECL_NONSHAREABLE(NODE) \
899 (TREE_CHECK2 (NODE, VAR_DECL, \
900 RESULT_DECL)->decl_common.decl_nonshareable_flag)
902 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
903 thunked-to function. */
904 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
906 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
907 it has been built for the declaration of a variable-sized object. */
908 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
909 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
911 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
912 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
914 /* In a type, nonzero means that all objects of the type are guaranteed by the
915 language or front-end to be properly aligned, so we can indicate that a MEM
916 of this type is aligned at least to the alignment of the type, even if it
917 doesn't appear that it is. We see this, for example, in object-oriented
918 languages where a tag field may show this is an object of a more-aligned
919 variant of the more generic type.
921 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
923 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
925 /* Used in classes in C++. */
926 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
927 /* Used in classes in C++. */
928 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
930 /* True if reference type NODE is a C++ rvalue reference. */
931 #define TYPE_REF_IS_RVALUE(NODE) \
932 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
934 /* Nonzero in a _DECL if the use of the name is defined as a
935 deprecated feature by __attribute__((deprecated)). */
936 #define TREE_DEPRECATED(NODE) \
937 ((NODE)->base.deprecated_flag)
939 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
940 uses are to be substituted for uses of the TREE_CHAINed identifier. */
941 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
942 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
944 /* In an aggregate type, indicates that the scalar fields of the type are
945 stored in reverse order from the target order. This effectively
946 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
947 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
948 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
950 /* In a non-aggregate type, indicates a saturating type. */
951 #define TYPE_SATURATING(NODE) \
952 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
954 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
955 of bits stored in reverse order from the target order. This effectively
956 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
958 The overall strategy is to preserve the invariant that every scalar in
959 memory is associated with a single storage order, i.e. all accesses to
960 this scalar are done with the same storage order. This invariant makes
961 it possible to factor out the storage order in most transformations, as
962 only the address and/or the value (in target order) matter for them.
963 But, of course, the storage order must be preserved when the accesses
964 themselves are rewritten or transformed. */
965 #define REF_REVERSE_STORAGE_ORDER(NODE) \
966 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
968 /* These flags are available for each language front end to use internally. */
969 #define TREE_LANG_FLAG_0(NODE) \
970 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
971 #define TREE_LANG_FLAG_1(NODE) \
972 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
973 #define TREE_LANG_FLAG_2(NODE) \
974 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
975 #define TREE_LANG_FLAG_3(NODE) \
976 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
977 #define TREE_LANG_FLAG_4(NODE) \
978 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
979 #define TREE_LANG_FLAG_5(NODE) \
980 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
981 #define TREE_LANG_FLAG_6(NODE) \
982 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
984 /* Define additional fields and accessors for nodes representing constants. */
986 #define TREE_INT_CST_NUNITS(NODE) \
987 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
988 #define TREE_INT_CST_EXT_NUNITS(NODE) \
989 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
990 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
991 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
992 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
993 #define TREE_INT_CST_LOW(NODE) \
994 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
996 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
997 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
999 #define TREE_FIXED_CST_PTR(NODE) \
1000 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1001 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1003 /* In a STRING_CST */
1004 /* In C terms, this is sizeof, not strlen. */
1005 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1006 #define TREE_STRING_POINTER(NODE) \
1007 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1009 /* In a COMPLEX_CST node. */
1010 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1011 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1013 /* In a VECTOR_CST node. */
1014 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1015 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1016 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1018 /* Define fields and accessors for some special-purpose tree nodes. */
1020 #define IDENTIFIER_LENGTH(NODE) \
1021 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1022 #define IDENTIFIER_POINTER(NODE) \
1023 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1024 #define IDENTIFIER_HASH_VALUE(NODE) \
1025 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1027 /* Translate a hash table identifier pointer to a tree_identifier
1028 pointer, and vice versa. */
1030 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1031 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1032 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1034 /* In a TREE_LIST node. */
1035 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1036 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1038 /* In a TREE_VEC node. */
1039 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1040 #define TREE_VEC_END(NODE) \
1041 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1043 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1045 /* In a CONSTRUCTOR node. */
1046 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1047 #define CONSTRUCTOR_ELT(NODE,IDX) \
1048 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1049 #define CONSTRUCTOR_NELTS(NODE) \
1050 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1051 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1052 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1054 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1055 value of each element (stored within VAL). IX must be a scratch variable
1056 of unsigned integer type. */
1057 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1058 for (IX = 0; (IX >= vec_safe_length (V)) \
1060 : ((VAL = (*(V))[IX].value), \
1064 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1065 the value of each element (stored within VAL) and its index (stored
1066 within INDEX). IX must be a scratch variable of unsigned integer type. */
1067 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1068 for (IX = 0; (IX >= vec_safe_length (V)) \
1070 : (((void) (VAL = (*V)[IX].value)), \
1071 (INDEX = (*V)[IX].index), \
1075 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1076 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1078 constructor_elt _ce___ = {INDEX, VALUE}; \
1079 vec_safe_push ((V), _ce___); \
1082 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1083 constructor output purposes. */
1084 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1085 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1087 /* True if NODE is a clobber right hand side, an expression of indeterminate
1088 value that clobbers the LHS in a copy instruction. We use a volatile
1089 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1090 In particular the volatile flag causes us to not prematurely remove
1091 such clobber instructions. */
1092 #define TREE_CLOBBER_P(NODE) \
1093 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1095 /* Define fields and accessors for some nodes that represent expressions. */
1097 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1098 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1099 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1100 && integer_zerop (TREE_OPERAND (NODE, 0)))
1102 /* In ordinary expression nodes. */
1103 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1104 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1106 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1107 length. Its value includes the length operand itself; that is,
1108 the minimum valid length is 1.
1109 Note that we have to bypass the use of TREE_OPERAND to access
1110 that field to avoid infinite recursion in expanding the macros. */
1111 #define VL_EXP_OPERAND_LENGTH(NODE) \
1112 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1114 /* Nonzero if is_gimple_debug() may possibly hold. */
1115 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1117 /* In a LOOP_EXPR node. */
1118 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1120 /* The source location of this expression. Non-tree_exp nodes such as
1121 decls and constants can be shared among multiple locations, so
1123 #define EXPR_LOCATION(NODE) \
1124 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1125 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1126 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1127 != UNKNOWN_LOCATION)
1128 /* The location to be used in a diagnostic about this expression. Do not
1129 use this macro if the location will be assigned to other expressions. */
1130 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1131 ? (NODE)->exp.locus : (LOCUS))
1132 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1133 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1135 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1136 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1138 #define EXPR_HAS_RANGE(NODE) \
1139 (CAN_HAVE_RANGE_P (NODE) \
1140 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1143 /* True if a tree is an expression or statement that can have a
1145 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1147 static inline source_range
1148 get_expr_source_range (tree expr)
1150 location_t loc = EXPR_LOCATION (expr);
1151 return get_range_from_loc (line_table, loc);
1154 extern void protected_set_expr_location (tree, location_t);
1156 /* In a TARGET_EXPR node. */
1157 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1158 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1159 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1161 /* DECL_EXPR accessor. This gives access to the DECL associated with
1162 the given declaration statement. */
1163 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1165 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1167 /* COMPOUND_LITERAL_EXPR accessors. */
1168 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1169 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1170 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1171 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1173 /* SWITCH_EXPR accessors. These give access to the condition, body and
1174 original condition type (before any compiler conversions)
1175 of the switch statement, respectively. */
1176 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1177 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1178 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1180 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1181 of a case label, respectively. */
1182 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1183 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1184 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1185 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1187 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1188 corresponding MEM_REF operands. */
1189 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1190 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1191 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1192 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1193 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1195 #define MR_DEPENDENCE_CLIQUE(NODE) \
1196 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1197 #define MR_DEPENDENCE_BASE(NODE) \
1198 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1200 /* The operands of a BIND_EXPR. */
1201 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1202 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1203 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1205 /* GOTO_EXPR accessor. This gives access to the label associated with
1206 a goto statement. */
1207 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1209 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1210 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1211 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1213 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1214 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1215 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1216 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1217 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1218 /* Nonzero if we want to create an ASM_INPUT instead of an
1219 ASM_OPERAND with no operands. */
1220 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1221 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1223 /* COND_EXPR accessors. */
1224 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1225 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1226 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1228 /* Accessors for the chains of recurrences. */
1229 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1230 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1231 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1232 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1234 /* LABEL_EXPR accessor. This gives access to the label associated with
1235 the given label expression. */
1236 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1238 /* CATCH_EXPR accessors. */
1239 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1240 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1242 /* EH_FILTER_EXPR accessors. */
1243 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1244 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1246 /* OBJ_TYPE_REF accessors. */
1247 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1248 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1249 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1251 /* ASSERT_EXPR accessors. */
1252 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1253 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1255 /* CALL_EXPR accessors. */
1256 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1257 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1258 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1259 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1260 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1262 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1263 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1264 the argument count is zero when checking is enabled. Instead, do
1265 the pointer arithmetic to advance past the 3 fixed operands in a
1266 CALL_EXPR. That produces a valid pointer to just past the end of the
1267 operand array, even if it's not valid to dereference it. */
1268 #define CALL_EXPR_ARGP(NODE) \
1269 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1271 /* TM directives and accessors. */
1272 #define TRANSACTION_EXPR_BODY(NODE) \
1273 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1274 #define TRANSACTION_EXPR_OUTER(NODE) \
1275 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1276 #define TRANSACTION_EXPR_RELAXED(NODE) \
1277 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1279 /* OpenMP and OpenACC directive and clause accessors. */
1281 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1283 #define OMP_BODY(NODE) \
1284 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1285 #define OMP_CLAUSES(NODE) \
1286 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1288 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1289 #define OMP_STANDALONE_CLAUSES(NODE) \
1290 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1292 #define OACC_DATA_BODY(NODE) \
1293 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1294 #define OACC_DATA_CLAUSES(NODE) \
1295 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1297 #define OACC_HOST_DATA_BODY(NODE) \
1298 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1299 #define OACC_HOST_DATA_CLAUSES(NODE) \
1300 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1302 #define OACC_CACHE_CLAUSES(NODE) \
1303 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1305 #define OACC_DECLARE_CLAUSES(NODE) \
1306 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1308 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1309 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1311 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1312 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1314 #define OACC_UPDATE_CLAUSES(NODE) \
1315 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1317 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1318 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1320 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1321 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1323 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1324 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1325 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1327 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1328 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1329 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1330 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1331 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1332 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1333 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1334 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1336 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1337 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1339 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1341 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1342 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1344 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1346 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1348 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1349 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1351 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1352 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1353 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1355 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1356 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1358 #define OMP_TARGET_DATA_BODY(NODE) \
1359 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1360 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1361 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1363 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1364 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1366 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1367 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1369 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1370 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1372 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1373 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1375 #define OMP_CLAUSE_SIZE(NODE) \
1376 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1378 OMP_CLAUSE__CACHE_), 1)
1380 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1381 #define OMP_CLAUSE_DECL(NODE) \
1382 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1383 OMP_CLAUSE_PRIVATE, \
1384 OMP_CLAUSE__LOOPTEMP_), 0)
1385 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1386 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1387 != UNKNOWN_LOCATION)
1388 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1390 /* True on an OMP_SECTION statement that was the last lexical member.
1391 This status is meaningful in the implementation of lastprivate. */
1392 #define OMP_SECTION_LAST(NODE) \
1393 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1395 /* True on an OMP_PARALLEL statement if it represents an explicit
1396 combined parallel work-sharing constructs. */
1397 #define OMP_PARALLEL_COMBINED(NODE) \
1398 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1400 /* True on an OMP_TEAMS statement if it represents an explicit
1401 combined teams distribute constructs. */
1402 #define OMP_TEAMS_COMBINED(NODE) \
1403 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1405 /* True on an OMP_TARGET statement if it represents explicit
1406 combined target teams, target parallel or target simd constructs. */
1407 #define OMP_TARGET_COMBINED(NODE) \
1408 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1410 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1411 as opposed to relaxed. */
1412 #define OMP_ATOMIC_SEQ_CST(NODE) \
1413 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1414 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1416 /* True on a PRIVATE clause if its decl is kept around for debugging
1417 information only and its DECL_VALUE_EXPR is supposed to point
1418 to what it has been remapped to. */
1419 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1420 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1422 /* True on a PRIVATE clause if ctor needs access to outer region's
1424 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1425 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1427 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1428 (thus should be private on the outer taskloop and firstprivate on
1430 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1431 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1433 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1434 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1435 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1437 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1438 decl is present in the chain. */
1439 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1440 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1441 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1442 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1443 OMP_CLAUSE_LASTPRIVATE),\
1445 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1446 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1448 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1449 (thus should be lastprivate on the outer taskloop and firstprivate on
1451 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1452 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1454 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1455 decl is present in the chain (this can happen only for taskloop
1456 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1457 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1458 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1460 /* True on a SHARED clause if a scalar is not modified in the body and
1461 thus could be optimized as firstprivate. */
1462 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1463 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1465 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1466 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1468 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1469 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1470 #define OMP_CLAUSE_IF_EXPR(NODE) \
1471 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1472 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1473 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1474 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1475 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1476 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1477 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1478 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1479 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1481 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1482 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1484 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1485 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1487 /* OpenACC clause expressions */
1488 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1489 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1490 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1491 OMP_CLAUSE_OPERAND ( \
1492 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1493 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1494 OMP_CLAUSE_OPERAND ( \
1495 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1496 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1497 OMP_CLAUSE_OPERAND ( \
1498 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1499 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1500 OMP_CLAUSE_OPERAND ( \
1501 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1502 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1503 OMP_CLAUSE_OPERAND ( \
1504 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1505 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1506 OMP_CLAUSE_OPERAND ( \
1507 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1508 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1509 OMP_CLAUSE_OPERAND ( \
1510 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1511 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1512 OMP_CLAUSE_OPERAND ( \
1513 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1514 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1515 OMP_CLAUSE_OPERAND ( \
1516 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1518 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1519 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1521 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1522 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1524 #define OMP_CLAUSE_MAP_KIND(NODE) \
1525 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1526 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1527 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1528 = (unsigned int) (MAP_KIND))
1530 /* Nonzero if this map clause is for array (rather than pointer) based array
1531 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1532 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1533 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1534 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1535 /* Nonzero if this is a mapped array section, that might need special
1536 treatment if OMP_CLAUSE_SIZE is zero. */
1537 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1538 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1539 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1540 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1541 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1543 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1544 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1546 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1547 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1548 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1549 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1550 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1551 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1553 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1554 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1556 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1557 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1558 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1559 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1560 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1561 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1562 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1563 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1564 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1565 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1566 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1567 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1568 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1569 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1571 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1572 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1573 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1574 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1576 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1577 are always initialized inside of the loop construct, false otherwise. */
1578 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1579 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1581 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1582 are declared inside of the simd construct. */
1583 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1584 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1586 /* True if a LINEAR clause has a stride that is variable. */
1587 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1588 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1590 /* True if a LINEAR clause is for an array or allocatable variable that
1591 needs special handling by the frontend. */
1592 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1593 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1595 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1596 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1598 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1599 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1601 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1602 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1604 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1605 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1607 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1608 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1610 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1611 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1613 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1614 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1615 OMP_CLAUSE_THREAD_LIMIT), 0)
1617 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1618 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1620 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1621 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1622 OMP_CLAUSE_DIST_SCHEDULE), 0)
1624 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1625 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1627 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1628 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1630 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1631 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1633 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1634 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1636 /* True if a SCHEDULE clause has the simd modifier on it. */
1637 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1638 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1640 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1641 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1643 #define OMP_CLAUSE_TILE_LIST(NODE) \
1644 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1646 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1647 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1648 ->omp_clause.subcode.dimension)
1649 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1650 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1651 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1652 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1654 /* SSA_NAME accessors. */
1656 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1657 if there is no name associated with it. */
1658 #define SSA_NAME_IDENTIFIER(NODE) \
1659 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1660 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1661 ? (NODE)->ssa_name.var \
1662 : DECL_NAME ((NODE)->ssa_name.var)) \
1665 /* Returns the variable being referenced. This can be NULL_TREE for
1666 temporaries not associated with any user variable.
1667 Once released, this is the only field that can be relied upon. */
1668 #define SSA_NAME_VAR(NODE) \
1669 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1670 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1671 ? NULL_TREE : (NODE)->ssa_name.var)
1673 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1674 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1676 /* Returns the statement which defines this SSA name. */
1677 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1679 /* Returns the SSA version number of this SSA name. Note that in
1680 tree SSA, version numbers are not per variable and may be recycled. */
1681 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1683 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1684 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1686 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1687 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1689 /* Nonzero if this SSA_NAME expression is currently on the free list of
1690 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1691 has no meaning for an SSA_NAME. */
1692 #define SSA_NAME_IN_FREE_LIST(NODE) \
1693 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1695 /* Nonzero if this SSA_NAME is the default definition for the
1696 underlying symbol. A default SSA name is created for symbol S if
1697 the very first reference to S in the function is a read operation.
1698 Default definitions are always created by an empty statement and
1699 belong to no basic block. */
1700 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1701 SSA_NAME_CHECK (NODE)->base.default_def_flag
1703 /* Attributes for SSA_NAMEs for pointer-type variables. */
1704 #define SSA_NAME_PTR_INFO(N) \
1705 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1707 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1708 #define SSA_NAME_ANTI_RANGE_P(N) \
1709 SSA_NAME_CHECK (N)->base.static_flag
1711 /* The type of range described by SSA_NAME_RANGE_INFO. */
1712 #define SSA_NAME_RANGE_TYPE(N) \
1713 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1715 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1716 #define SSA_NAME_RANGE_INFO(N) \
1717 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1719 /* Return the immediate_use information for an SSA_NAME. */
1720 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1722 #define OMP_CLAUSE_CODE(NODE) \
1723 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1725 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1726 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1728 #define OMP_CLAUSE_OPERAND(NODE, I) \
1729 OMP_CLAUSE_ELT_CHECK (NODE, I)
1731 /* In a BLOCK node. */
1732 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1733 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1734 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1735 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1736 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1737 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1738 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1739 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1740 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1741 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1742 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1743 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1745 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1746 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1748 /* An index number for this block. These values are not guaranteed to
1749 be unique across functions -- whether or not they are depends on
1750 the debugging output format in use. */
1751 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1753 /* If block reordering splits a lexical block into discontiguous
1754 address ranges, we'll make a copy of the original block.
1756 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1757 In that case, we have one source block that has been replicated
1758 (through inlining or unrolling) into many logical blocks, and that
1759 these logical blocks have different physical variables in them.
1761 In this case, we have one logical block split into several
1762 non-contiguous address ranges. Most debug formats can't actually
1763 represent this idea directly, so we fake it by creating multiple
1764 logical blocks with the same variables in them. However, for those
1765 that do support non-contiguous regions, these allow the original
1766 logical block to be reconstructed, along with the set of address
1769 One of the logical block fragments is arbitrarily chosen to be
1770 the ORIGIN. The other fragments will point to the origin via
1771 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1772 be null. The list of fragments will be chained through
1773 BLOCK_FRAGMENT_CHAIN from the origin. */
1775 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1776 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1778 /* For an inlined function, this gives the location where it was called
1779 from. This is only set in the top level block, which corresponds to the
1780 inlined function scope. This is used in the debug output routines. */
1782 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1784 /* This gives the location of the end of the block, useful to attach
1785 code implicitly generated for outgoing paths. */
1787 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1789 /* Define fields and accessors for nodes representing data types. */
1791 /* See tree.def for documentation of the use of these fields.
1792 Look at the documentation of the various ..._TYPE tree codes.
1794 Note that the type.values, type.minval, and type.maxval fields are
1795 overloaded and used for different macros in different kinds of types.
1796 Each macro must check to ensure the tree node is of the proper kind of
1797 type. Note also that some of the front-ends also overload these fields,
1798 so they must be checked as well. */
1800 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1801 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1802 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1803 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1804 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1805 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1806 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1807 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1808 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1809 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1811 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1812 #define TYPE_MODE(NODE) \
1813 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1814 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1815 #define SET_TYPE_MODE(NODE, MODE) \
1816 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1818 extern machine_mode element_mode (const_tree t);
1820 /* The "canonical" type for this type node, which is used by frontends to
1821 compare the type for equality with another type. If two types are
1822 equal (based on the semantics of the language), then they will have
1823 equivalent TYPE_CANONICAL entries.
1825 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1826 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1827 be used for comparison against other types. Instead, the type is
1828 said to require structural equality checks, described in
1829 TYPE_STRUCTURAL_EQUALITY_P.
1831 For unqualified aggregate and function types the middle-end relies on
1832 TYPE_CANONICAL to tell whether two variables can be assigned
1833 to each other without a conversion. The middle-end also makes sure
1834 to assign the same alias-sets to the type partition with equal
1835 TYPE_CANONICAL of their unqualified variants. */
1836 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1837 /* Indicates that the type node requires structural equality
1838 checks. The compiler will need to look at the composition of the
1839 type to determine whether it is equal to another type, rather than
1840 just comparing canonical type pointers. For instance, we would need
1841 to look at the return and parameter types of a FUNCTION_TYPE
1843 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1844 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1845 type node requires structural equality. */
1846 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1848 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1849 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1851 /* The (language-specific) typed-based alias set for this type.
1852 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1853 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1854 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1855 type can alias objects of any type. */
1856 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1858 /* Nonzero iff the typed-based alias set for this type has been
1860 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1861 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1863 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1865 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1867 /* The alignment necessary for objects of this type.
1868 The value is an int, measured in bits. */
1869 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1871 /* 1 if the alignment for this type was requested by "aligned" attribute,
1872 0 if it is the default for this type. */
1873 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1875 /* The alignment for NODE, in bytes. */
1876 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1878 /* If your language allows you to declare types, and you want debug info
1879 for them, then you need to generate corresponding TYPE_DECL nodes.
1880 These "stub" TYPE_DECL nodes have no name, and simply point at the
1881 type node. You then set the TYPE_STUB_DECL field of the type node
1882 to point back at the TYPE_DECL node. This allows the debug routines
1883 to know that the two nodes represent the same type, so that we only
1884 get one debug info record for them. */
1885 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1887 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1888 the type has BLKmode only because it lacks the alignment required for
1890 #define TYPE_NO_FORCE_BLK(NODE) \
1891 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1893 /* Nonzero in a type considered volatile as a whole. */
1894 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1896 /* Nonzero in a type considered atomic as a whole. */
1897 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1899 /* Means this type is const-qualified. */
1900 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1902 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1904 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1906 /* If nonzero, type's name shouldn't be emitted into debug info. */
1907 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1909 /* The address space the type is in. */
1910 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1912 /* Encode/decode the named memory support as part of the qualifier. If more
1913 than 8 qualifiers are added, these macros need to be adjusted. */
1914 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1915 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1917 /* Return all qualifiers except for the address space qualifiers. */
1918 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1920 /* Only keep the address space out of the qualifiers and discard the other
1922 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1924 /* The set of type qualifiers for this type. */
1925 #define TYPE_QUALS(NODE) \
1926 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1927 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1928 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1929 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1930 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1932 /* The same as TYPE_QUALS without the address space qualifications. */
1933 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1934 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1935 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1936 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1937 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1939 /* The same as TYPE_QUALS without the address space and atomic
1941 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1942 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1943 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1944 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1946 /* These flags are available for each language front end to use internally. */
1947 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1948 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1949 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1950 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1951 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1952 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1953 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1955 /* Used to keep track of visited nodes in tree traversals. This is set to
1956 0 by copy_node and make_node. */
1957 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1959 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1960 that distinguish string from array of char).
1961 If set in a INTEGER_TYPE, indicates a character type. */
1962 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1964 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1965 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1966 (((unsigned HOST_WIDE_INT) 1) \
1967 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1969 /* Set precision to n when we have 2^n sub-parts of the vector. */
1970 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1971 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1973 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1974 about missing conversions to other vector types of the same size. */
1975 #define TYPE_VECTOR_OPAQUE(NODE) \
1976 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1978 /* Indicates that objects of this type must be initialized by calling a
1979 function when they are created. */
1980 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1981 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1983 /* Indicates that a UNION_TYPE object should be passed the same way that
1984 the first union alternative would be passed, or that a RECORD_TYPE
1985 object should be passed the same way that the first (and only) member
1987 #define TYPE_TRANSPARENT_AGGR(NODE) \
1988 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1990 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1991 address of a component of the type. This is the counterpart of
1992 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1993 #define TYPE_NONALIASED_COMPONENT(NODE) \
1994 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1996 /* Indicated that objects of this type should be laid out in as
1997 compact a way as possible. */
1998 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2000 /* Used by type_contains_placeholder_p to avoid recomputation.
2001 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2002 this field directly. */
2003 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2004 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2006 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2007 #define TYPE_FINAL_P(NODE) \
2008 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2010 /* The debug output functions use the symtab union field to store
2011 information specific to the debugging format. The different debug
2012 output hooks store different types in the union field. These three
2013 macros are used to access different fields in the union. The debug
2014 hooks are responsible for consistently using only a specific
2017 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2018 hold the type's number in the generated stabs. */
2019 #define TYPE_SYMTAB_ADDRESS(NODE) \
2020 (TYPE_CHECK (NODE)->type_common.symtab.address)
2022 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2023 hold struct/union type tag names. */
2024 #define TYPE_SYMTAB_POINTER(NODE) \
2025 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2027 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2028 in dwarf2out.c to point to the DIE generated for the type. */
2029 #define TYPE_SYMTAB_DIE(NODE) \
2030 (TYPE_CHECK (NODE)->type_common.symtab.die)
2032 /* The garbage collector needs to know the interpretation of the
2033 symtab field. These constants represent the different types in the
2036 #define TYPE_SYMTAB_IS_ADDRESS (0)
2037 #define TYPE_SYMTAB_IS_POINTER (1)
2038 #define TYPE_SYMTAB_IS_DIE (2)
2040 #define TYPE_LANG_SPECIFIC(NODE) \
2041 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2043 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2044 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2045 #define TYPE_FIELDS(NODE) \
2046 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2047 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2048 #define TYPE_ARG_TYPES(NODE) \
2049 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2050 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2052 #define TYPE_METHODS(NODE) \
2053 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2054 #define TYPE_VFIELD(NODE) \
2055 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2056 #define TYPE_METHOD_BASETYPE(NODE) \
2057 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2058 #define TYPE_OFFSET_BASETYPE(NODE) \
2059 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2060 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2061 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2062 #define TYPE_NEXT_PTR_TO(NODE) \
2063 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2064 #define TYPE_NEXT_REF_TO(NODE) \
2065 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2066 #define TYPE_MIN_VALUE(NODE) \
2067 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2068 #define TYPE_MAX_VALUE(NODE) \
2069 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2071 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2072 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2074 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2075 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2077 /* For record and union types, information about this type, as a base type
2079 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2081 /* For non record and union types, used in a language-dependent way. */
2082 #define TYPE_LANG_SLOT_1(NODE) \
2083 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2085 /* Define accessor macros for information about type inheritance
2088 A "basetype" means a particular usage of a data type for inheritance
2089 in another type. Each such basetype usage has its own "binfo"
2090 object to describe it. The binfo object is a TREE_VEC node.
2092 Inheritance is represented by the binfo nodes allocated for a
2093 given type. For example, given types C and D, such that D is
2094 inherited by C, 3 binfo nodes will be allocated: one for describing
2095 the binfo properties of C, similarly one for D, and one for
2096 describing the binfo properties of D as a base type for C.
2097 Thus, given a pointer to class C, one can get a pointer to the binfo
2098 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2100 /* BINFO specific flags. */
2102 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2103 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2105 /* Flags for language dependent use. */
2106 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2107 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2108 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2109 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2110 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2111 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2112 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2114 /* The actual data type node being inherited in this basetype. */
2115 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2117 /* The offset where this basetype appears in its containing type.
2118 BINFO_OFFSET slot holds the offset (in bytes)
2119 from the base of the complete object to the base of the part of the
2120 object that is allocated on behalf of this `type'.
2121 This is always 0 except when there is multiple inheritance. */
2123 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2124 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2126 /* The virtual function table belonging to this basetype. Virtual
2127 function tables provide a mechanism for run-time method dispatching.
2128 The entries of a virtual function table are language-dependent. */
2130 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2132 /* The virtual functions in the virtual function table. This is
2133 a TREE_LIST that is used as an initial approximation for building
2134 a virtual function table for this basetype. */
2135 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2137 /* A vector of binfos for the direct basetypes inherited by this
2140 If this basetype describes type D as inherited in C, and if the
2141 basetypes of D are E and F, then this vector contains binfos for
2142 inheritance of E and F by C. */
2143 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2145 /* The number of basetypes for NODE. */
2146 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2148 /* Accessor macro to get to the Nth base binfo of this binfo. */
2149 #define BINFO_BASE_BINFO(NODE,N) \
2150 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2151 #define BINFO_BASE_ITERATE(NODE,N,B) \
2152 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2153 #define BINFO_BASE_APPEND(NODE,T) \
2154 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2156 /* For a BINFO record describing a virtual base class, i.e., one where
2157 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2158 base. The actual contents are language-dependent. In the C++
2159 front-end this field is an INTEGER_CST giving an offset into the
2160 vtable where the offset to the virtual base can be found. */
2161 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2163 /* Indicates the accesses this binfo has to its bases. The values are
2164 access_public_node, access_protected_node or access_private_node.
2165 If this array is not present, public access is implied. */
2166 #define BINFO_BASE_ACCESSES(NODE) \
2167 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2169 #define BINFO_BASE_ACCESS(NODE,N) \
2170 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2171 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2172 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2174 /* The index in the VTT where this subobject's sub-VTT can be found.
2175 NULL_TREE if there is no sub-VTT. */
2176 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2178 /* The index in the VTT where the vptr for this subobject can be
2179 found. NULL_TREE if there is no secondary vptr in the VTT. */
2180 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2182 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2183 inheriting this base for non-virtual bases. For virtual bases it
2184 points either to the binfo for which this is a primary binfo, or to
2185 the binfo of the most derived type. */
2186 #define BINFO_INHERITANCE_CHAIN(NODE) \
2187 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2190 /* Define fields and accessors for nodes representing declared names. */
2192 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2193 have an associated SSA name. */
2194 #define SSA_VAR_P(DECL) \
2195 (TREE_CODE (DECL) == VAR_DECL \
2196 || TREE_CODE (DECL) == PARM_DECL \
2197 || TREE_CODE (DECL) == RESULT_DECL \
2198 || TREE_CODE (DECL) == SSA_NAME)
2201 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2203 /* This is the name of the object as written by the user.
2204 It is an IDENTIFIER_NODE. */
2205 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2207 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2208 #define TYPE_IDENTIFIER(NODE) \
2209 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2210 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2212 /* Every ..._DECL node gets a unique number. */
2213 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2215 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2217 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2219 /* Every ..._DECL node gets a unique number that stays the same even
2220 when the decl is copied by the inliner once it is set. */
2221 #define DECL_PT_UID(NODE) \
2222 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2223 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2224 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2225 #define SET_DECL_PT_UID(NODE, UID) \
2226 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2227 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2228 be preserved when copyin the decl. */
2229 #define DECL_PT_UID_SET_P(NODE) \
2230 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2232 /* These two fields describe where in the source code the declaration
2233 was. If the declaration appears in several places (as for a C
2234 function that is declared first and then defined later), this
2235 information should refer to the definition. */
2236 #define DECL_SOURCE_LOCATION(NODE) \
2237 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2238 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2239 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2240 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2241 /* This accessor returns TRUE if the decl it operates on was created
2242 by a front-end or back-end rather than by user code. In this case
2243 builtin-ness is indicated by source location. */
2244 #define DECL_IS_BUILTIN(DECL) \
2245 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2247 #define DECL_LOCATION_RANGE(NODE) \
2248 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE)))
2250 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2251 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2252 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2253 nodes, this points to either the FUNCTION_DECL for the containing
2254 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2255 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2256 scope". In particular, for VAR_DECLs which are virtual table pointers
2257 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2259 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2260 #define DECL_FIELD_CONTEXT(NODE) \
2261 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2263 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2264 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2266 /* For any sort of a ..._DECL node, this points to the original (abstract)
2267 decl node which this decl is an inlined/cloned instance of, or else it
2268 is NULL indicating that this decl is not an instance of some other decl.
2270 The C front-end also uses this in a nested declaration of an inline
2271 function, to point back to the definition. */
2272 #define DECL_ABSTRACT_ORIGIN(NODE) \
2273 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2275 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2276 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2277 #define DECL_ORIGIN(NODE) \
2278 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2280 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2281 inline instance of some original (abstract) decl from an inline function;
2282 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2283 nodes can also have their abstract origin set to themselves. */
2284 #define DECL_FROM_INLINE(NODE) \
2285 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2286 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2288 /* In a DECL this is the field where attributes are stored. */
2289 #define DECL_ATTRIBUTES(NODE) \
2290 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2292 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2293 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2294 For a VAR_DECL, holds the initial value.
2295 For a PARM_DECL, used for DECL_ARG_TYPE--default
2296 values for parameters are encoded in the type of the function,
2297 not in the PARM_DECL slot.
2298 For a FIELD_DECL, this is used for enumeration values and the C
2299 frontend uses it for temporarily storing bitwidth of bitfields.
2301 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2302 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2304 /* Holds the size of the datum, in bits, as a tree expression.
2305 Need not be constant. */
2306 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2307 /* Likewise for the size in bytes. */
2308 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2309 /* Holds the alignment required for the datum, in bits. */
2310 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2311 /* The alignment of NODE, in bytes. */
2312 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2313 /* Set if the alignment of this DECL has been set by the user, for
2314 example with an 'aligned' attribute. */
2315 #define DECL_USER_ALIGN(NODE) \
2316 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2317 /* Holds the machine mode corresponding to the declaration of a variable or
2318 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2320 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2322 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2323 operation it is. Note, however, that this field is overloaded, with
2324 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2325 checked before any access to the former. */
2326 #define DECL_FUNCTION_CODE(NODE) \
2327 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2329 #define DECL_FUNCTION_PERSONALITY(NODE) \
2330 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2332 /* Nonzero for a given ..._DECL node means that the name of this node should
2333 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2334 the associated type should be ignored. For a FUNCTION_DECL, the body of
2335 the function should also be ignored. */
2336 #define DECL_IGNORED_P(NODE) \
2337 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2339 /* Nonzero for a given ..._DECL node means that this node represents an
2340 "abstract instance" of the given declaration (e.g. in the original
2341 declaration of an inline function). When generating symbolic debugging
2342 information, we mustn't try to generate any address information for nodes
2343 marked as "abstract instances" because we don't actually generate
2344 any code or allocate any data space for such instances. */
2345 #define DECL_ABSTRACT_P(NODE) \
2346 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2348 /* Language-specific decl information. */
2349 #define DECL_LANG_SPECIFIC(NODE) \
2350 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2352 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2353 do not allocate storage, and refer to a definition elsewhere. Note that
2354 this does not necessarily imply the entity represented by NODE
2355 has no program source-level definition in this translation unit. For
2356 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2357 DECL_EXTERNAL may be true simultaneously; that can be the case for
2358 a C99 "extern inline" function. */
2359 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2361 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2362 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2364 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2366 Also set in some languages for variables, etc., outside the normal
2367 lexical scope, such as class instance variables. */
2368 #define DECL_NONLOCAL(NODE) \
2369 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2371 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2372 Used in FIELD_DECLs for vtable pointers.
2373 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2374 #define DECL_VIRTUAL_P(NODE) \
2375 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2377 /* Used to indicate that this DECL represents a compiler-generated entity. */
2378 #define DECL_ARTIFICIAL(NODE) \
2379 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2381 /* Additional flags for language-specific uses. */
2382 #define DECL_LANG_FLAG_0(NODE) \
2383 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2384 #define DECL_LANG_FLAG_1(NODE) \
2385 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2386 #define DECL_LANG_FLAG_2(NODE) \
2387 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2388 #define DECL_LANG_FLAG_3(NODE) \
2389 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2390 #define DECL_LANG_FLAG_4(NODE) \
2391 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2392 #define DECL_LANG_FLAG_5(NODE) \
2393 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2394 #define DECL_LANG_FLAG_6(NODE) \
2395 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2396 #define DECL_LANG_FLAG_7(NODE) \
2397 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2398 #define DECL_LANG_FLAG_8(NODE) \
2399 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2401 /* Nonzero for a scope which is equal to file scope. */
2402 #define SCOPE_FILE_SCOPE_P(EXP) \
2403 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2404 /* Nonzero for a decl which is at file scope. */
2405 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2406 /* Nonzero for a type which is at file scope. */
2407 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2409 /* Nonzero for a decl that is decorated using attribute used.
2410 This indicates to compiler tools that this decl needs to be preserved. */
2411 #define DECL_PRESERVE_P(DECL) \
2412 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2414 /* For function local variables of COMPLEX and VECTOR types,
2415 indicates that the variable is not aliased, and that all
2416 modifications to the variable have been adjusted so that
2417 they are killing assignments. Thus the variable may now
2418 be treated as a GIMPLE register, and use real instead of
2419 virtual ops in SSA form. */
2420 #define DECL_GIMPLE_REG_P(DECL) \
2421 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2423 extern tree decl_value_expr_lookup (tree);
2424 extern void decl_value_expr_insert (tree, tree);
2426 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2427 if transformations have made this more complicated than evaluating the
2428 decl itself. This should only be used for debugging; once this field has
2429 been set, the decl itself may not legitimately appear in the function. */
2430 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2431 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2432 ->decl_common.decl_flag_2)
2433 #define DECL_VALUE_EXPR(NODE) \
2434 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2435 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2436 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2438 /* Holds the RTL expression for the value of a variable or function.
2439 This value can be evaluated lazily for functions, variables with
2440 static storage duration, and labels. */
2441 #define DECL_RTL(NODE) \
2442 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2443 ? (NODE)->decl_with_rtl.rtl \
2444 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2446 /* Set the DECL_RTL for NODE to RTL. */
2447 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2449 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2450 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2452 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2453 #define DECL_RTL_SET_P(NODE) \
2454 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2456 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2457 NODE1, it will not be set for NODE2; this is a lazy copy. */
2458 #define COPY_DECL_RTL(NODE1, NODE2) \
2459 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2460 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2462 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2463 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2465 #if (GCC_VERSION >= 2007)
2466 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2467 ({ tree const __d = (decl); \
2468 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2469 /* Dereference it so the compiler knows it can't be NULL even \
2470 without assertion checking. */ \
2471 &*DECL_RTL_IF_SET (__d); })
2473 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2476 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2477 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2479 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2480 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2481 of the structure. */
2482 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2484 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2485 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2486 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2487 natural alignment of the field's type). */
2488 #define DECL_FIELD_BIT_OFFSET(NODE) \
2489 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2491 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2492 if so, the type that was originally specified for it.
2493 TREE_TYPE may have been modified (in finish_struct). */
2494 #define DECL_BIT_FIELD_TYPE(NODE) \
2495 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2497 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2498 representative FIELD_DECL. */
2499 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2500 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2502 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2503 if nonzero, indicates that the field occupies the type. */
2504 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2506 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2507 DECL_FIELD_OFFSET which are known to be always zero.
2508 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2510 #define DECL_OFFSET_ALIGN(NODE) \
2511 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2513 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2514 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2515 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2517 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2518 which this FIELD_DECL is defined. This information is needed when
2519 writing debugging information about vfield and vbase decls for C++. */
2520 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2522 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2523 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2525 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2527 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2529 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2530 this component. This makes it possible for Type-Based Alias Analysis
2531 to disambiguate accesses to this field with indirect accesses using
2534 struct S { int i; } s;
2537 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2539 From the implementation's viewpoint, the alias set of the type of the
2540 field 'i' (int) will not be recorded as a subset of that of the type of
2541 's' (struct S) in record_component_aliases. The counterpart is that
2542 accesses to s.i must not be given the alias set of the type of 'i'
2543 (int) but instead directly that of the type of 's' (struct S). */
2544 #define DECL_NONADDRESSABLE_P(NODE) \
2545 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2547 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2548 dense, unique within any one function, and may be used to index arrays.
2549 If the value is -1, then no UID has been assigned. */
2550 #define LABEL_DECL_UID(NODE) \
2551 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2553 /* In a LABEL_DECL, the EH region number for which the label is the
2554 post_landing_pad. */
2555 #define EH_LANDING_PAD_NR(NODE) \
2556 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2558 /* For a PARM_DECL, records the data type used to pass the argument,
2559 which may be different from the type seen in the program. */
2560 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2562 /* For PARM_DECL, holds an RTL for the stack slot or register
2563 where the data was actually passed. */
2564 #define DECL_INCOMING_RTL(NODE) \
2565 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2567 /* Nonzero for a given ..._DECL node means that no warnings should be
2568 generated just because this node is unused. */
2569 #define DECL_IN_SYSTEM_HEADER(NODE) \
2570 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2572 /* Used to indicate that the linkage status of this DECL is not yet known,
2573 so it should not be output now. */
2574 #define DECL_DEFER_OUTPUT(NODE) \
2575 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2577 /* In a VAR_DECL that's static,
2578 nonzero if the space is in the text section. */
2579 #define DECL_IN_TEXT_SECTION(NODE) \
2580 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2582 /* In a VAR_DECL that's static,
2583 nonzero if it belongs to the global constant pool. */
2584 #define DECL_IN_CONSTANT_POOL(NODE) \
2585 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2587 /* Nonzero for a given ..._DECL node means that this node should be
2588 put in .common, if possible. If a DECL_INITIAL is given, and it
2589 is not error_mark_node, then the decl cannot be put in .common. */
2590 #define DECL_COMMON(NODE) \
2591 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2593 /* In a VAR_DECL, nonzero if the decl is a register variable with
2594 an explicit asm specification. */
2595 #define DECL_HARD_REGISTER(NODE) \
2596 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2598 /* Used to indicate that this DECL has weak linkage. */
2599 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2601 /* Used to indicate that the DECL is a dllimport. */
2602 #define DECL_DLLIMPORT_P(NODE) \
2603 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2605 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2606 not be put out unless it is needed in this translation unit.
2607 Entities like this are shared across translation units (like weak
2608 entities), but are guaranteed to be generated by any translation
2609 unit that needs them, and therefore need not be put out anywhere
2610 where they are not needed. DECL_COMDAT is just a hint to the
2611 back-end; it is up to front-ends which set this flag to ensure
2612 that there will never be any harm, other than bloat, in putting out
2613 something which is DECL_COMDAT. */
2614 #define DECL_COMDAT(NODE) \
2615 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2617 #define DECL_COMDAT_GROUP(NODE) \
2618 decl_comdat_group (NODE)
2620 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2621 multiple translation units should be merged. */
2622 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2623 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2625 /* The name of the object as the assembler will see it (but before any
2626 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2627 as DECL_NAME. It is an IDENTIFIER_NODE.
2629 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2630 One Definition Rule based type merging at LTO. It is computed only for
2631 LTO compilation and C++. */
2632 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2634 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2635 This is true of all DECL nodes except FIELD_DECL. */
2636 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2637 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2639 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2640 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2642 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2643 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2644 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2646 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2647 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2648 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2650 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2651 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2652 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2653 semantics of using this macro, are different than saying:
2655 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2657 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2659 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2660 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2661 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2662 DECL_ASSEMBLER_NAME (DECL1)) \
2665 /* Records the section name in a section attribute. Used to pass
2666 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2667 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2669 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2670 this variable in a BIND_EXPR. */
2671 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2672 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2674 /* Value of the decls's visibility attribute */
2675 #define DECL_VISIBILITY(NODE) \
2676 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2678 /* Nonzero means that the decl had its visibility specified rather than
2680 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2681 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2683 /* In a VAR_DECL, the model to use if the data should be allocated from
2684 thread-local storage. */
2685 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2687 /* In a VAR_DECL, nonzero if the data should be allocated from
2688 thread-local storage. */
2689 #define DECL_THREAD_LOCAL_P(NODE) \
2690 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2692 /* In a non-local VAR_DECL with static storage duration, true if the
2693 variable has an initialization priority. If false, the variable
2694 will be initialized at the DEFAULT_INIT_PRIORITY. */
2695 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2696 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2698 extern tree decl_debug_expr_lookup (tree);
2699 extern void decl_debug_expr_insert (tree, tree);
2701 /* For VAR_DECL, this is set to an expression that it was split from. */
2702 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2703 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2704 #define DECL_DEBUG_EXPR(NODE) \
2705 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2707 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2708 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2710 extern priority_type decl_init_priority_lookup (tree);
2711 extern priority_type decl_fini_priority_lookup (tree);
2712 extern void decl_init_priority_insert (tree, priority_type);
2713 extern void decl_fini_priority_insert (tree, priority_type);
2715 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2717 #define DECL_INIT_PRIORITY(NODE) \
2718 (decl_init_priority_lookup (NODE))
2719 /* Set the initialization priority for NODE to VAL. */
2720 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2721 (decl_init_priority_insert (NODE, VAL))
2723 /* For a FUNCTION_DECL the finalization priority of NODE. */
2724 #define DECL_FINI_PRIORITY(NODE) \
2725 (decl_fini_priority_lookup (NODE))
2726 /* Set the finalization priority for NODE to VAL. */
2727 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2728 (decl_fini_priority_insert (NODE, VAL))
2730 /* The initialization priority for entities for which no explicit
2731 initialization priority has been specified. */
2732 #define DEFAULT_INIT_PRIORITY 65535
2734 /* The maximum allowed initialization priority. */
2735 #define MAX_INIT_PRIORITY 65535
2737 /* The largest priority value reserved for use by system runtime
2739 #define MAX_RESERVED_INIT_PRIORITY 100
2741 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2742 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2743 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2745 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2746 #define DECL_NONLOCAL_FRAME(NODE) \
2747 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2749 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2750 #define DECL_NONALIASED(NODE) \
2751 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2753 /* This field is used to reference anything in decl.result and is meant only
2754 for use by the garbage collector. */
2755 #define DECL_RESULT_FLD(NODE) \
2756 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2758 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2759 Before the struct containing the FUNCTION_DECL is laid out,
2760 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2761 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2762 function. When the class is laid out, this pointer is changed
2763 to an INTEGER_CST node which is suitable for use as an index
2764 into the virtual function table. */
2765 #define DECL_VINDEX(NODE) \
2766 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2768 /* In FUNCTION_DECL, holds the decl for the return value. */
2769 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2771 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2772 #define DECL_UNINLINABLE(NODE) \
2773 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2775 /* In a FUNCTION_DECL, the saved representation of the body of the
2777 #define DECL_SAVED_TREE(NODE) \
2778 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2780 /* Nonzero in a FUNCTION_DECL means this function should be treated
2781 as if it were a malloc, meaning it returns a pointer that is
2783 #define DECL_IS_MALLOC(NODE) \
2784 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2786 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2787 C++ operator new, meaning that it returns a pointer for which we
2788 should not use type based aliasing. */
2789 #define DECL_IS_OPERATOR_NEW(NODE) \
2790 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2792 /* Nonzero in a FUNCTION_DECL means this function may return more
2794 #define DECL_IS_RETURNS_TWICE(NODE) \
2795 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2797 /* Nonzero in a FUNCTION_DECL means this function should be treated
2798 as "pure" function (like const function, but may read global memory). */
2799 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2801 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2802 the const or pure function may not terminate. When this is nonzero
2803 for a const or pure function, it can be dealt with by cse passes
2804 but cannot be removed by dce passes since you are not allowed to
2805 change an infinite looping program into one that terminates without
2807 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2808 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2810 /* Nonzero in a FUNCTION_DECL means this function should be treated
2811 as "novops" function (function that does not read global memory,
2812 but may have arbitrary side effects). */
2813 #define DECL_IS_NOVOPS(NODE) \
2814 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2816 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2817 at the beginning or end of execution. */
2818 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2819 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2821 #define DECL_STATIC_DESTRUCTOR(NODE) \
2822 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2824 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2825 be instrumented with calls to support routines. */
2826 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2827 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2829 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2830 disabled in this function. */
2831 #define DECL_NO_LIMIT_STACK(NODE) \
2832 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2834 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2835 #define DECL_STATIC_CHAIN(NODE) \
2836 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2838 /* Nonzero for a decl that cgraph has decided should be inlined into
2839 at least one call site. It is not meaningful to look at this
2840 directly; always use cgraph_function_possibly_inlined_p. */
2841 #define DECL_POSSIBLY_INLINED(DECL) \
2842 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2844 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2845 such as via the `inline' keyword in C/C++. This flag controls the linkage
2846 semantics of 'inline' */
2847 #define DECL_DECLARED_INLINE_P(NODE) \
2848 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2850 /* Nonzero in a FUNCTION_DECL means this function should not get
2851 -Winline warnings. */
2852 #define DECL_NO_INLINE_WARNING_P(NODE) \
2853 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2855 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2856 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2857 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2859 /* Nonzero if a FUNCTION_CODE is a TM load. */
2860 #define BUILTIN_TM_LOAD_P(FN) \
2861 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2863 /* Nonzero if a FUNCTION_CODE is a TM store. */
2864 #define BUILTIN_TM_STORE_P(FN) \
2865 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2867 #define CASE_BUILT_IN_TM_LOAD(FN) \
2868 case BUILT_IN_TM_LOAD_##FN: \
2869 case BUILT_IN_TM_LOAD_RAR_##FN: \
2870 case BUILT_IN_TM_LOAD_RAW_##FN: \
2871 case BUILT_IN_TM_LOAD_RFW_##FN
2873 #define CASE_BUILT_IN_TM_STORE(FN) \
2874 case BUILT_IN_TM_STORE_##FN: \
2875 case BUILT_IN_TM_STORE_WAR_##FN: \
2876 case BUILT_IN_TM_STORE_WAW_##FN
2878 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2879 disregarding size and cost heuristics. This is equivalent to using
2880 the always_inline attribute without the required diagnostics if the
2881 function cannot be inlined. */
2882 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2883 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2885 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2886 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2888 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2889 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2890 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2892 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2893 that describes the status of this function. */
2894 #define DECL_STRUCT_FUNCTION(NODE) \
2895 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2897 /* In a FUNCTION_DECL, nonzero means a built in function of a
2898 standard library or more generally a built in function that is
2899 recognized by optimizers and expanders.
2901 Note that it is different from the DECL_IS_BUILTIN accessor. For
2902 instance, user declared prototypes of C library functions are not
2903 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2904 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2906 /* For a builtin function, identify which part of the compiler defined it. */
2907 #define DECL_BUILT_IN_CLASS(NODE) \
2908 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2910 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2911 #define DECL_ARGUMENTS(NODE) \
2912 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2914 /* In FUNCTION_DECL, the function specific target options to use when compiling
2916 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2917 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2919 /* In FUNCTION_DECL, the function specific optimization options to use when
2920 compiling this function. */
2921 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2922 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2924 /* In FUNCTION_DECL, this is set if this function has other versions generated
2925 using "target" attributes. The default version is the one which does not
2926 have any "target" attribute set. */
2927 #define DECL_FUNCTION_VERSIONED(NODE)\
2928 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2930 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2931 Devirtualization machinery uses this knowledge for determing type of the
2932 object constructed. Also we assume that constructor address is not
2934 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2935 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2937 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2938 Devirtualization machinery uses this to track types in destruction. */
2939 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2940 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2942 /* In FUNCTION_DECL that represent an virtual method this is set when
2943 the method is final. */
2944 #define DECL_FINAL_P(NODE)\
2945 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2947 /* The source language of the translation-unit. */
2948 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2949 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2951 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2953 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2954 #define DECL_ORIGINAL_TYPE(NODE) \
2955 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2957 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2958 into stabs. Instead it will generate cross reference ('x') of names.
2959 This uses the same flag as DECL_EXTERNAL. */
2960 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2961 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2963 /* Getter of the imported declaration associated to the
2964 IMPORTED_DECL node. */
2965 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2966 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2968 /* Getter of the symbol declaration associated with the
2969 NAMELIST_DECL node. */
2970 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2971 (DECL_INITIAL (NODE))
2973 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2974 To reduce overhead, the nodes containing the statements are not trees.
2975 This avoids the overhead of tree_common on all linked list elements.
2977 Use the interface in tree-iterator.h to access this node. */
2979 #define STATEMENT_LIST_HEAD(NODE) \
2980 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2981 #define STATEMENT_LIST_TAIL(NODE) \
2982 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2984 #define TREE_OPTIMIZATION(NODE) \
2985 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2987 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2988 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2990 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2991 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2993 /* Return a tree node that encapsulates the optimization options in OPTS. */
2994 extern tree build_optimization_node (struct gcc_options *opts);
2996 #define TREE_TARGET_OPTION(NODE) \
2997 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2999 #define TREE_TARGET_GLOBALS(NODE) \
3000 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3002 /* Return a tree node that encapsulates the target options in OPTS. */
3003 extern tree build_target_option_node (struct gcc_options *opts);
3005 extern void prepare_target_option_nodes_for_pch (void);
3007 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3010 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3012 if (TREE_CODE (__t) != __c)
3013 tree_check_failed (__t, __f, __l, __g, __c, 0);
3018 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3021 if (TREE_CODE (__t) == __c)
3022 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3027 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3028 enum tree_code __c1, enum tree_code __c2)
3030 if (TREE_CODE (__t) != __c1
3031 && TREE_CODE (__t) != __c2)
3032 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3037 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3038 enum tree_code __c1, enum tree_code __c2)
3040 if (TREE_CODE (__t) == __c1
3041 || TREE_CODE (__t) == __c2)
3042 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3047 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3048 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3050 if (TREE_CODE (__t) != __c1
3051 && TREE_CODE (__t) != __c2
3052 && TREE_CODE (__t) != __c3)
3053 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3058 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3059 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3061 if (TREE_CODE (__t) == __c1
3062 || TREE_CODE (__t) == __c2
3063 || TREE_CODE (__t) == __c3)
3064 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3069 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3070 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3071 enum tree_code __c4)
3073 if (TREE_CODE (__t) != __c1
3074 && TREE_CODE (__t) != __c2
3075 && TREE_CODE (__t) != __c3
3076 && TREE_CODE (__t) != __c4)
3077 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3082 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3083 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3084 enum tree_code __c4)
3086 if (TREE_CODE (__t) == __c1
3087 || TREE_CODE (__t) == __c2
3088 || TREE_CODE (__t) == __c3
3089 || TREE_CODE (__t) == __c4)
3090 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3095 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3096 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3097 enum tree_code __c4, enum tree_code __c5)
3099 if (TREE_CODE (__t) != __c1
3100 && TREE_CODE (__t) != __c2
3101 && TREE_CODE (__t) != __c3
3102 && TREE_CODE (__t) != __c4
3103 && TREE_CODE (__t) != __c5)
3104 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3109 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3110 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3111 enum tree_code __c4, enum tree_code __c5)
3113 if (TREE_CODE (__t) == __c1
3114 || TREE_CODE (__t) == __c2
3115 || TREE_CODE (__t) == __c3
3116 || TREE_CODE (__t) == __c4
3117 || TREE_CODE (__t) == __c5)
3118 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3123 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3124 const char *__f, int __l, const char *__g)
3126 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3127 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3132 tree_class_check (tree __t, const enum tree_code_class __class,
3133 const char *__f, int __l, const char *__g)
3135 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3136 tree_class_check_failed (__t, __class, __f, __l, __g);
3141 tree_range_check (tree __t,
3142 enum tree_code __code1, enum tree_code __code2,
3143 const char *__f, int __l, const char *__g)
3145 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3146 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3151 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3152 const char *__f, int __l, const char *__g)
3154 if (TREE_CODE (__t) != OMP_CLAUSE)
3155 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3156 if (__t->omp_clause.code != __code)
3157 omp_clause_check_failed (__t, __f, __l, __g, __code);
3162 omp_clause_range_check (tree __t,
3163 enum omp_clause_code __code1,
3164 enum omp_clause_code __code2,
3165 const char *__f, int __l, const char *__g)
3167 if (TREE_CODE (__t) != OMP_CLAUSE)
3168 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3169 if ((int) __t->omp_clause.code < (int) __code1
3170 || (int) __t->omp_clause.code > (int) __code2)
3171 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3175 /* These checks have to be special cased. */
3178 expr_check (tree __t, const char *__f, int __l, const char *__g)
3180 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3181 if (!IS_EXPR_CODE_CLASS (__c))
3182 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3186 /* These checks have to be special cased. */
3189 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3192 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3196 inline const HOST_WIDE_INT *
3197 tree_int_cst_elt_check (const_tree __t, int __i,
3198 const char *__f, int __l, const char *__g)
3200 if (TREE_CODE (__t) != INTEGER_CST)
3201 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3202 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3203 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3205 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3208 inline HOST_WIDE_INT *
3209 tree_int_cst_elt_check (tree __t, int __i,
3210 const char *__f, int __l, const char *__g)
3212 if (TREE_CODE (__t) != INTEGER_CST)
3213 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3214 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3215 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3217 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3220 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3222 # if GCC_VERSION >= 4006
3223 #pragma GCC diagnostic push
3224 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3228 tree_vec_elt_check (tree __t, int __i,
3229 const char *__f, int __l, const char *__g)
3231 if (TREE_CODE (__t) != TREE_VEC)
3232 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3233 if (__i < 0 || __i >= __t->base.u.length)
3234 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3235 return &CONST_CAST_TREE (__t)->vec.a[__i];
3238 # if GCC_VERSION >= 4006
3239 #pragma GCC diagnostic pop
3243 omp_clause_elt_check (tree __t, int __i,
3244 const char *__f, int __l, const char *__g)
3246 if (TREE_CODE (__t) != OMP_CLAUSE)
3247 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3248 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3249 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3250 return &__t->omp_clause.ops[__i];
3253 /* These checks have to be special cased. */
3256 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3258 if (!ANY_INTEGRAL_TYPE_P (__t))
3259 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3265 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3268 if (TREE_CODE (__t) != __c)
3269 tree_check_failed (__t, __f, __l, __g, __c, 0);
3274 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3277 if (TREE_CODE (__t) == __c)
3278 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3283 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3284 enum tree_code __c1, enum tree_code __c2)
3286 if (TREE_CODE (__t) != __c1
3287 && TREE_CODE (__t) != __c2)
3288 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3293 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3294 enum tree_code __c1, enum tree_code __c2)
3296 if (TREE_CODE (__t) == __c1
3297 || TREE_CODE (__t) == __c2)
3298 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3303 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3304 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3306 if (TREE_CODE (__t) != __c1
3307 && TREE_CODE (__t) != __c2
3308 && TREE_CODE (__t) != __c3)
3309 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3314 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3315 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3317 if (TREE_CODE (__t) == __c1
3318 || TREE_CODE (__t) == __c2
3319 || TREE_CODE (__t) == __c3)
3320 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3325 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3326 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3327 enum tree_code __c4)
3329 if (TREE_CODE (__t) != __c1
3330 && TREE_CODE (__t) != __c2
3331 && TREE_CODE (__t) != __c3
3332 && TREE_CODE (__t) != __c4)
3333 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3338 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3339 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3340 enum tree_code __c4)
3342 if (TREE_CODE (__t) == __c1
3343 || TREE_CODE (__t) == __c2
3344 || TREE_CODE (__t) == __c3
3345 || TREE_CODE (__t) == __c4)
3346 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3351 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3352 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3353 enum tree_code __c4, enum tree_code __c5)
3355 if (TREE_CODE (__t) != __c1
3356 && TREE_CODE (__t) != __c2
3357 && TREE_CODE (__t) != __c3
3358 && TREE_CODE (__t) != __c4
3359 && TREE_CODE (__t) != __c5)
3360 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3365 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3366 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3367 enum tree_code __c4, enum tree_code __c5)
3369 if (TREE_CODE (__t) == __c1
3370 || TREE_CODE (__t) == __c2
3371 || TREE_CODE (__t) == __c3
3372 || TREE_CODE (__t) == __c4
3373 || TREE_CODE (__t) == __c5)
3374 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3379 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3380 const char *__f, int __l, const char *__g)
3382 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3383 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3388 tree_class_check (const_tree __t, const enum tree_code_class __class,
3389 const char *__f, int __l, const char *__g)
3391 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3392 tree_class_check_failed (__t, __class, __f, __l, __g);
3397 tree_range_check (const_tree __t,
3398 enum tree_code __code1, enum tree_code __code2,
3399 const char *__f, int __l, const char *__g)
3401 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3402 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3407 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3408 const char *__f, int __l, const char *__g)
3410 if (TREE_CODE (__t) != OMP_CLAUSE)
3411 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3412 if (__t->omp_clause.code != __code)
3413 omp_clause_check_failed (__t, __f, __l, __g, __code);
3418 omp_clause_range_check (const_tree __t,
3419 enum omp_clause_code __code1,
3420 enum omp_clause_code __code2,
3421 const char *__f, int __l, const char *__g)
3423 if (TREE_CODE (__t) != OMP_CLAUSE)
3424 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3425 if ((int) __t->omp_clause.code < (int) __code1
3426 || (int) __t->omp_clause.code > (int) __code2)
3427 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3432 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3434 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3435 if (!IS_EXPR_CODE_CLASS (__c))
3436 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3441 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3444 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3448 # if GCC_VERSION >= 4006
3449 #pragma GCC diagnostic push
3450 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3454 tree_vec_elt_check (const_tree __t, int __i,
3455 const char *__f, int __l, const char *__g)
3457 if (TREE_CODE (__t) != TREE_VEC)
3458 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3459 if (__i < 0 || __i >= __t->base.u.length)
3460 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3461 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3462 //return &__t->vec.a[__i];
3465 # if GCC_VERSION >= 4006
3466 #pragma GCC diagnostic pop
3470 omp_clause_elt_check (const_tree __t, int __i,
3471 const char *__f, int __l, const char *__g)
3473 if (TREE_CODE (__t) != OMP_CLAUSE)
3474 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3475 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3476 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3477 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3481 any_integral_type_check (const_tree __t, const char *__f, int __l,
3484 if (!ANY_INTEGRAL_TYPE_P (__t))
3485 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3492 /* Compute the number of operands in an expression node NODE. For
3493 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3494 otherwise it is looked up from the node's code. */
3496 tree_operand_length (const_tree node)
3498 if (VL_EXP_CLASS_P (node))
3499 return VL_EXP_OPERAND_LENGTH (node);
3501 return TREE_CODE_LENGTH (TREE_CODE (node));
3504 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3506 /* Special checks for TREE_OPERANDs. */
3508 tree_operand_check (tree __t, int __i,
3509 const char *__f, int __l, const char *__g)
3511 const_tree __u = EXPR_CHECK (__t);
3512 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3513 tree_operand_check_failed (__i, __u, __f, __l, __g);
3514 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3518 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3519 const char *__f, int __l, const char *__g)
3521 if (TREE_CODE (__t) != __code)
3522 tree_check_failed (__t, __f, __l, __g, __code, 0);
3523 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3524 tree_operand_check_failed (__i, __t, __f, __l, __g);
3525 return &__t->exp.operands[__i];
3529 tree_operand_check (const_tree __t, int __i,
3530 const char *__f, int __l, const char *__g)
3532 const_tree __u = EXPR_CHECK (__t);
3533 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3534 tree_operand_check_failed (__i, __u, __f, __l, __g);
3535 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3539 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3540 const char *__f, int __l, const char *__g)
3542 if (TREE_CODE (__t) != __code)
3543 tree_check_failed (__t, __f, __l, __g, __code, 0);
3544 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3545 tree_operand_check_failed (__i, __t, __f, __l, __g);
3546 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3551 #define error_mark_node global_trees[TI_ERROR_MARK]
3553 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3554 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3555 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3556 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3557 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3559 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3560 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3561 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3562 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3563 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3565 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3566 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3567 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3568 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3569 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3571 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3572 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3573 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3575 #define void_node global_trees[TI_VOID]
3577 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3578 #define integer_one_node global_trees[TI_INTEGER_ONE]
3579 #define integer_three_node global_trees[TI_INTEGER_THREE]
3580 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3581 #define size_zero_node global_trees[TI_SIZE_ZERO]
3582 #define size_one_node global_trees[TI_SIZE_ONE]
3583 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3584 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3585 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3587 /* Base access nodes. */
3588 #define access_public_node global_trees[TI_PUBLIC]
3589 #define access_protected_node global_trees[TI_PROTECTED]
3590 #define access_private_node global_trees[TI_PRIVATE]
3592 #define null_pointer_node global_trees[TI_NULL_POINTER]
3594 #define float_type_node global_trees[TI_FLOAT_TYPE]
3595 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3596 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3598 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3599 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3600 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3601 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3603 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3604 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3605 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3606 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3608 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3610 #define void_type_node global_trees[TI_VOID_TYPE]
3611 /* The C type `void *'. */
3612 #define ptr_type_node global_trees[TI_PTR_TYPE]
3613 /* The C type `const void *'. */
3614 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3615 /* The C type `size_t'. */
3616 #define size_type_node global_trees[TI_SIZE_TYPE]
3617 #define pid_type_node global_trees[TI_PID_TYPE]
3618 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3619 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3620 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3621 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3622 /* The C type `FILE *'. */
3623 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3624 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3626 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3627 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3628 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3630 /* The decimal floating point types. */
3631 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3632 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3633 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3634 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3635 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3636 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3638 /* The fixed-point types. */
3639 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3640 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3641 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3642 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3643 #define sat_unsigned_short_fract_type_node \
3644 global_trees[TI_SAT_USFRACT_TYPE]
3645 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3646 #define sat_unsigned_long_fract_type_node \
3647 global_trees[TI_SAT_ULFRACT_TYPE]
3648 #define sat_unsigned_long_long_fract_type_node \
3649 global_trees[TI_SAT_ULLFRACT_TYPE]
3650 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3651 #define fract_type_node global_trees[TI_FRACT_TYPE]
3652 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3653 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3654 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3655 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3656 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3657 #define unsigned_long_long_fract_type_node \
3658 global_trees[TI_ULLFRACT_TYPE]
3659 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3660 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3661 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3662 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3663 #define sat_unsigned_short_accum_type_node \
3664 global_trees[TI_SAT_USACCUM_TYPE]
3665 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3666 #define sat_unsigned_long_accum_type_node \
3667 global_trees[TI_SAT_ULACCUM_TYPE]
3668 #define sat_unsigned_long_long_accum_type_node \
3669 global_trees[TI_SAT_ULLACCUM_TYPE]
3670 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3671 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3672 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3673 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3674 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3675 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3676 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3677 #define unsigned_long_long_accum_type_node \
3678 global_trees[TI_ULLACCUM_TYPE]
3679 #define qq_type_node global_trees[TI_QQ_TYPE]
3680 #define hq_type_node global_trees[TI_HQ_TYPE]
3681 #define sq_type_node global_trees[TI_SQ_TYPE]
3682 #define dq_type_node global_trees[TI_DQ_TYPE]
3683 #define tq_type_node global_trees[TI_TQ_TYPE]
3684 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3685 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3686 #define usq_type_node global_trees[TI_USQ_TYPE]
3687 #define udq_type_node global_trees[TI_UDQ_TYPE]
3688 #define utq_type_node global_trees[TI_UTQ_TYPE]
3689 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3690 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3691 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3692 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3693 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3694 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3695 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3696 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3697 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3698 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3699 #define ha_type_node global_trees[TI_HA_TYPE]
3700 #define sa_type_node global_trees[TI_SA_TYPE]
3701 #define da_type_node global_trees[TI_DA_TYPE]
3702 #define ta_type_node global_trees[TI_TA_TYPE]
3703 #define uha_type_node global_trees[TI_UHA_TYPE]
3704 #define usa_type_node global_trees[TI_USA_TYPE]
3705 #define uda_type_node global_trees[TI_UDA_TYPE]
3706 #define uta_type_node global_trees[TI_UTA_TYPE]
3707 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3708 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3709 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3710 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3711 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3712 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3713 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3714 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3716 /* The node that should be placed at the end of a parameter list to
3717 indicate that the function does not take a variable number of
3718 arguments. The TREE_VALUE will be void_type_node and there will be
3719 no TREE_CHAIN. Language-independent code should not assume
3720 anything else about this node. */
3721 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3723 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3724 #define MAIN_NAME_P(NODE) \
3725 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3727 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3729 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3730 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3732 /* Default/current target options (TARGET_OPTION_NODE). */
3733 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3734 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3736 /* Default tree list option(), optimize() pragmas to be linked into the
3738 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3739 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3741 #define char_type_node integer_types[itk_char]
3742 #define signed_char_type_node integer_types[itk_signed_char]
3743 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3744 #define short_integer_type_node integer_types[itk_short]
3745 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3746 #define integer_type_node integer_types[itk_int]
3747 #define unsigned_type_node integer_types[itk_unsigned_int]
3748 #define long_integer_type_node integer_types[itk_long]
3749 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3750 #define long_long_integer_type_node integer_types[itk_long_long]
3751 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3753 /* True if NODE is an erroneous expression. */
3755 #define error_operand_p(NODE) \
3756 ((NODE) == error_mark_node \
3757 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3759 extern tree decl_assembler_name (tree);
3760 extern tree decl_comdat_group (const_tree);
3761 extern tree decl_comdat_group_id (const_tree);
3762 extern const char *decl_section_name (const_tree);
3763 extern void set_decl_section_name (tree, const char *);
3764 extern enum tls_model decl_tls_model (const_tree);
3765 extern void set_decl_tls_model (tree, enum tls_model);
3767 /* Compute the number of bytes occupied by 'node'. This routine only
3768 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3770 extern size_t tree_size (const_tree);
3772 /* Compute the number of bytes occupied by a tree with code CODE.
3773 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3774 which are of variable length. */
3775 extern size_t tree_code_size (enum tree_code);
3777 /* Allocate and return a new UID from the DECL_UID namespace. */
3778 extern int allocate_decl_uid (void);
3780 /* Lowest level primitive for allocating a node.
3781 The TREE_CODE is the only argument. Contents are initialized
3782 to zero except for a few of the common fields. */
3784 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3785 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3787 /* Free tree node. */
3789 extern void free_node (tree);
3791 /* Make a copy of a node, with all the same contents. */
3793 extern tree copy_node_stat (tree MEM_STAT_DECL);
3794 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3796 /* Make a copy of a chain of TREE_LIST nodes. */
3798 extern tree copy_list (tree);
3800 /* Make a CASE_LABEL_EXPR. */
3802 extern tree build_case_label (tree, tree, tree);
3805 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3806 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3808 /* Make an INTEGER_CST. */
3810 extern tree make_int_cst_stat (int, int MEM_STAT_DECL);
3811 #define make_int_cst(LEN, EXT_LEN) \
3812 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3814 /* Make a TREE_VEC. */
3816 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3817 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3819 /* Grow a TREE_VEC. */
3821 extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3822 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3824 /* Construct various types of nodes. */
3826 extern tree build_nt (enum tree_code, ...);
3827 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3829 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3830 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3831 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3832 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3833 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3834 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3835 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3836 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3837 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3838 tree MEM_STAT_DECL);
3839 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3840 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3841 tree MEM_STAT_DECL);
3842 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3844 /* _loc versions of build[1-5]. */
3847 build1_stat_loc (location_t loc, enum tree_code code, tree type,
3848 tree arg1 MEM_STAT_DECL)
3850 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3851 if (CAN_HAVE_LOCATION_P (t))
3852 SET_EXPR_LOCATION (t, loc);
3855 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3858 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3859 tree arg1 MEM_STAT_DECL)
3861 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3862 if (CAN_HAVE_LOCATION_P (t))
3863 SET_EXPR_LOCATION (t, loc);
3866 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3869 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3870 tree arg1, tree arg2 MEM_STAT_DECL)
3872 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3873 if (CAN_HAVE_LOCATION_P (t))
3874 SET_EXPR_LOCATION (t, loc);
3877 #define build3_loc(l,c,t1,t2,t3,t4) \
3878 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3881 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3882 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3884 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3885 if (CAN_HAVE_LOCATION_P (t))
3886 SET_EXPR_LOCATION (t, loc);
3889 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3890 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3893 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3894 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3896 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3897 arg4 PASS_MEM_STAT);
3898 if (CAN_HAVE_LOCATION_P (t))
3899 SET_EXPR_LOCATION (t, loc);
3902 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3903 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3905 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3906 #define build_var_debug_value(t1,t2) \
3907 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3909 /* Constructs double_int from tree CST. */
3911 extern tree double_int_to_tree (tree, double_int);
3913 extern tree wide_int_to_tree (tree type, const wide_int_ref &cst);
3914 extern tree force_fit_type (tree, const wide_int_ref &, int, bool);
3916 /* Create an INT_CST node with a CST value zero extended. */
3919 extern tree build_int_cst (tree, HOST_WIDE_INT);
3920 extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst);
3921 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3922 extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3923 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3924 extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3925 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3926 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3927 extern tree build_vector_from_val (tree, tree);
3928 extern void recompute_constructor_flags (tree);
3929 extern void verify_constructor_flags (tree);
3930 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3931 extern tree build_constructor_single (tree, tree, tree);
3932 extern tree build_constructor_from_list (tree, tree);
3933 extern tree build_constructor_va (tree, int, ...);
3934 extern tree build_real_from_int_cst (tree, const_tree);
3935 extern tree build_complex (tree, tree, tree);
3936 extern tree build_complex_inf (tree, bool);
3937 extern tree build_each_one_cst (tree);
3938 extern tree build_one_cst (tree);
3939 extern tree build_minus_one_cst (tree);
3940 extern tree build_all_ones_cst (tree);
3941 extern tree build_zero_cst (tree);
3942 extern tree build_string (int, const char *);
3943 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3944 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3945 extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3946 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3947 extern tree build_decl_stat (location_t, enum tree_code,
3948 tree, tree MEM_STAT_DECL);
3949 extern tree build_fn_decl (const char *, tree);
3950 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3951 extern tree build_translation_unit_decl (tree);
3952 extern tree build_block (tree, tree, tree, tree);
3953 extern tree build_empty_stmt (location_t);
3954 extern tree build_omp_clause (location_t, enum omp_clause_code);
3956 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3957 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3959 extern tree build_call_nary (tree, tree, int, ...);
3960 extern tree build_call_valist (tree, tree, int, va_list);
3961 #define build_call_array(T1,T2,N,T3)\
3962 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3963 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3964 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3965 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
3966 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
3967 extern tree build_call_expr_loc (location_t, tree, int, ...);
3968 extern tree build_call_expr (tree, int, ...);
3969 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3971 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3973 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
3975 extern tree build_string_literal (int, const char *);
3977 /* Construct various nodes representing data types. */
3979 extern tree signed_or_unsigned_type_for (int, tree);
3980 extern tree signed_type_for (tree);
3981 extern tree unsigned_type_for (tree);
3982 extern tree truth_type_for (tree);
3983 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
3984 extern tree build_pointer_type (tree);
3985 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
3986 extern tree build_reference_type (tree);
3987 extern tree build_vector_type_for_mode (tree, machine_mode);
3988 extern tree build_vector_type (tree innertype, int nunits);
3989 extern tree build_truth_vector_type (unsigned, unsigned);
3990 extern tree build_same_sized_truth_vector_type (tree vectype);
3991 extern tree build_opaque_vector_type (tree innertype, int nunits);
3992 extern tree build_index_type (tree);
3993 extern tree build_array_type (tree, tree);
3994 extern tree build_nonshared_array_type (tree, tree);
3995 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
3996 extern tree build_function_type (tree, tree);
3997 extern tree build_function_type_list (tree, ...);
3998 extern tree build_varargs_function_type_list (tree, ...);
3999 extern tree build_function_type_array (tree, int, tree *);
4000 extern tree build_varargs_function_type_array (tree, int, tree *);
4001 #define build_function_type_vec(RET, V) \
4002 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4003 #define build_varargs_function_type_vec(RET, V) \
4004 build_varargs_function_type_array (RET, vec_safe_length (V), \
4005 vec_safe_address (V))
4006 extern tree build_method_type_directly (tree, tree, tree);
4007 extern tree build_method_type (tree, tree);
4008 extern tree build_offset_type (tree, tree);
4009 extern tree build_complex_type (tree, bool named = false);
4010 extern tree array_type_nelts (const_tree);
4012 extern tree value_member (tree, tree);
4013 extern tree purpose_member (const_tree, tree);
4014 extern bool vec_member (const_tree, vec<tree, va_gc> *);
4015 extern tree chain_index (int, tree);
4017 extern int attribute_list_equal (const_tree, const_tree);
4018 extern int attribute_list_contained (const_tree, const_tree);
4019 extern int tree_int_cst_equal (const_tree, const_tree);
4021 extern bool tree_fits_shwi_p (const_tree)
4022 #ifndef ENABLE_TREE_CHECKING
4023 ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */
4026 extern bool tree_fits_uhwi_p (const_tree)
4027 #ifndef ENABLE_TREE_CHECKING
4028 ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */
4031 extern HOST_WIDE_INT tree_to_shwi (const_tree);
4032 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
4033 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4034 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4035 tree_to_shwi (const_tree t)
4037 gcc_assert (tree_fits_shwi_p (t));
4038 return TREE_INT_CST_LOW (t);
4041 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
4042 tree_to_uhwi (const_tree t)
4044 gcc_assert (tree_fits_uhwi_p (t));
4045 return TREE_INT_CST_LOW (t);
4048 extern int tree_int_cst_sgn (const_tree);
4049 extern int tree_int_cst_sign_bit (const_tree);
4050 extern unsigned int tree_int_cst_min_precision (tree, signop);
4051 extern tree strip_array_types (tree);
4052 extern tree excess_precision_type (tree);
4053 extern bool valid_constant_size_p (const_tree);
4056 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4057 put the prototype here. Rtl.h does declare the prototype if
4058 tree.h had been included. */
4060 extern tree make_tree (tree, rtx);
4062 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4065 Such modified types already made are recorded so that duplicates
4068 extern tree build_type_attribute_variant (tree, tree);
4069 extern tree build_decl_attribute_variant (tree, tree);
4070 extern tree build_type_attribute_qual_variant (tree, tree, int);
4072 extern bool attribute_value_equal (const_tree, const_tree);
4074 /* Return 0 if the attributes for two types are incompatible, 1 if they
4075 are compatible, and 2 if they are nearly compatible (which causes a
4076 warning to be generated). */
4077 extern int comp_type_attributes (const_tree, const_tree);
4079 /* Default versions of target-overridable functions. */
4080 extern tree merge_decl_attributes (tree, tree);
4081 extern tree merge_type_attributes (tree, tree);
4083 /* This function is a private implementation detail of lookup_attribute()
4084 and you should never call it directly. */
4085 extern tree private_lookup_attribute (const char *, size_t, tree);
4087 /* This function is a private implementation detail
4088 of lookup_attribute_by_prefix() and you should never call it directly. */
4089 extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree);
4091 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4092 return a pointer to the attribute's list element if the attribute
4093 is part of the list, or NULL_TREE if not found. If the attribute
4094 appears more than once, this only returns the first occurrence; the
4095 TREE_CHAIN of the return value should be passed back in if further
4096 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4100 lookup_attribute (const char *attr_name, tree list)
4102 gcc_checking_assert (attr_name[0] != '_');
4103 /* In most cases, list is NULL_TREE. */
4104 if (list == NULL_TREE)
4107 /* Do the strlen() before calling the out-of-line implementation.
4108 In most cases attr_name is a string constant, and the compiler
4109 will optimize the strlen() away. */
4110 return private_lookup_attribute (attr_name, strlen (attr_name), list);
4113 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4114 return a pointer to the attribute's list first element if the attribute
4115 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4119 lookup_attribute_by_prefix (const char *attr_name, tree list)
4121 gcc_checking_assert (attr_name[0] != '_');
4122 /* In most cases, list is NULL_TREE. */
4123 if (list == NULL_TREE)
4126 return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name),
4131 /* This function is a private implementation detail of
4132 is_attribute_p() and you should never call it directly. */
4133 extern bool private_is_attribute_p (const char *, size_t, const_tree);
4135 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4136 if the identifier node is a valid attribute name for the string.
4137 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4138 be the identifier for 'text' or for '__text__'. */
4141 is_attribute_p (const char *attr_name, const_tree ident)
4143 gcc_checking_assert (attr_name[0] != '_');
4144 /* Do the strlen() before calling the out-of-line implementation.
4145 In most cases attr_name is a string constant, and the compiler
4146 will optimize the strlen() away. */
4147 return private_is_attribute_p (attr_name, strlen (attr_name), ident);
4150 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4151 modified list. ATTR_NAME must be in the form 'text' (not
4154 extern tree remove_attribute (const char *, tree);
4156 /* Given two attributes lists, return a list of their union. */
4158 extern tree merge_attributes (tree, tree);
4160 /* Given two Windows decl attributes lists, possibly including
4161 dllimport, return a list of their union . */
4162 extern tree merge_dllimport_decl_attributes (tree, tree);
4164 /* Handle a "dllimport" or "dllexport" attribute. */
4165 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4167 /* Returns true iff unqualified CAND and BASE are equivalent. */
4169 extern bool check_base_type (const_tree cand, const_tree base);
4171 /* Check whether CAND is suitable to be returned from get_qualified_type
4172 (BASE, TYPE_QUALS). */
4174 extern bool check_qualified_type (const_tree, const_tree, int);
4176 /* Return a version of the TYPE, qualified as indicated by the
4177 TYPE_QUALS, if one exists. If no qualified version exists yet,
4178 return NULL_TREE. */
4180 extern tree get_qualified_type (tree, int);
4182 /* Like get_qualified_type, but creates the type if it does not
4183 exist. This function never returns NULL_TREE. */
4185 extern tree build_qualified_type (tree, int);
4187 /* Create a variant of type T with alignment ALIGN. */
4189 extern tree build_aligned_type (tree, unsigned int);
4191 /* Like build_qualified_type, but only deals with the `const' and
4192 `volatile' qualifiers. This interface is retained for backwards
4193 compatibility with the various front-ends; new code should use
4194 build_qualified_type instead. */
4196 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4197 build_qualified_type ((TYPE), \
4198 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4199 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4201 /* Make a copy of a type node. */
4203 extern tree build_distinct_type_copy (tree);
4204 extern tree build_variant_type_copy (tree);
4206 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4207 return a canonicalized ..._TYPE node, so that duplicates are not made.
4208 How the hash code is computed is up to the caller, as long as any two
4209 callers that could hash identical-looking type nodes agree. */
4211 extern tree type_hash_canon (unsigned int, tree);
4213 extern tree convert (tree, tree);
4214 extern unsigned int expr_align (const_tree);
4215 extern tree size_in_bytes (const_tree);
4216 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4217 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4218 extern tree bit_position (const_tree);
4219 extern tree byte_position (const_tree);
4220 extern HOST_WIDE_INT int_byte_position (const_tree);
4222 #define sizetype sizetype_tab[(int) stk_sizetype]
4223 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4224 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4225 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4226 #define size_int(L) size_int_kind (L, stk_sizetype)
4227 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4228 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4229 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4231 /* Type for sizes of data-type. */
4233 #define BITS_PER_UNIT_LOG \
4234 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4235 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4236 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4238 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4239 by making the last node in X point to Y.
4240 Returns X, except if X is 0 returns Y. */
4242 extern tree chainon (tree, tree);
4244 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4246 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4247 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4249 /* Return the last tree node in a chain. */
4251 extern tree tree_last (tree);
4253 /* Reverse the order of elements in a chain, and return the new head. */
4255 extern tree nreverse (tree);
4257 /* Returns the length of a chain of nodes
4258 (number of chain pointers to follow before reaching a null pointer). */
4260 extern int list_length (const_tree);
4262 /* Returns the first FIELD_DECL in a type. */
4264 extern tree first_field (const_tree);
4266 /* Given an initializer INIT, return TRUE if INIT is zero or some
4267 aggregate of zeros. Otherwise return FALSE. */
4269 extern bool initializer_zerop (const_tree);
4271 /* Given a vector VEC, return its first element if all elements are
4272 the same. Otherwise return NULL_TREE. */
4274 extern tree uniform_vector_p (const_tree);
4276 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4278 extern vec<tree, va_gc> *ctor_to_vec (tree);
4280 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4282 extern int zerop (const_tree);
4284 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4286 extern int integer_zerop (const_tree);
4288 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4290 extern int integer_onep (const_tree);
4292 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4293 a vector or complex where each part is 1. */
4295 extern int integer_each_onep (const_tree);
4297 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4298 all of whose significant bits are 1. */
4300 extern int integer_all_onesp (const_tree);
4302 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4305 extern int integer_minus_onep (const_tree);
4307 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4308 exactly one bit 1. */
4310 extern int integer_pow2p (const_tree);
4312 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4313 with a nonzero value. */
4315 extern int integer_nonzerop (const_tree);
4317 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4318 a vector where each element is an integer constant of value -1. */
4320 extern int integer_truep (const_tree);
4322 extern bool cst_and_fits_in_hwi (const_tree);
4323 extern tree num_ending_zeros (const_tree);
4325 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4328 extern int fixed_zerop (const_tree);
4330 /* staticp (tree x) is nonzero if X is a reference to data allocated
4331 at a fixed address in memory. Returns the outermost data. */
4333 extern tree staticp (tree);
4335 /* save_expr (EXP) returns an expression equivalent to EXP
4336 but it can be used multiple times within context CTX
4337 and only evaluate EXP once. */
4339 extern tree save_expr (tree);
4341 /* Return true if T is function-invariant. */
4343 extern bool tree_invariant_p (tree);
4345 /* Look inside EXPR into any simple arithmetic operations. Return the
4346 outermost non-arithmetic or non-invariant node. */
4348 extern tree skip_simple_arithmetic (tree);
4350 /* Look inside EXPR into simple arithmetic operations involving constants.
4351 Return the outermost non-arithmetic or non-constant node. */
4353 extern tree skip_simple_constant_arithmetic (tree);
4355 /* Return which tree structure is used by T. */
4357 enum tree_node_structure_enum tree_node_structure (const_tree);
4359 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4360 size or offset that depends on a field within a record. */
4362 extern bool contains_placeholder_p (const_tree);
4364 /* This macro calls the above function but short-circuits the common
4365 case of a constant to save time. Also check for null. */
4367 #define CONTAINS_PLACEHOLDER_P(EXP) \
4368 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4370 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4371 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4374 extern bool type_contains_placeholder_p (tree);
4376 /* Given a tree EXP, find all occurrences of references to fields
4377 in a PLACEHOLDER_EXPR and place them in vector REFS without
4378 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4379 we assume here that EXP contains only arithmetic expressions
4380 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4383 extern void find_placeholder_in_expr (tree, vec<tree> *);
4385 /* This macro calls the above function but short-circuits the common
4386 case of a constant to save time and also checks for NULL. */
4388 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4390 if((EXP) && !TREE_CONSTANT (EXP)) \
4391 find_placeholder_in_expr (EXP, V); \
4394 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4395 return a tree with all occurrences of references to F in a
4396 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4397 CONST_DECLs. Note that we assume here that EXP contains only
4398 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4399 occurring only in their argument list. */
4401 extern tree substitute_in_expr (tree, tree, tree);
4403 /* This macro calls the above function but short-circuits the common
4404 case of a constant to save time and also checks for NULL. */
4406 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4407 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4409 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4410 for it within OBJ, a tree that is an object or a chain of references. */
4412 extern tree substitute_placeholder_in_expr (tree, tree);
4414 /* This macro calls the above function but short-circuits the common
4415 case of a constant to save time and also checks for NULL. */
4417 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4418 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4419 : substitute_placeholder_in_expr (EXP, OBJ))
4422 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4423 but it can be used multiple times
4424 and only evaluate the subexpressions once. */
4426 extern tree stabilize_reference (tree);
4428 /* Return EXP, stripped of any conversions to wider types
4429 in such a way that the result of converting to type FOR_TYPE
4430 is the same as if EXP were converted to FOR_TYPE.
4431 If FOR_TYPE is 0, it signifies EXP's type. */
4433 extern tree get_unwidened (tree, tree);
4435 /* Return OP or a simpler expression for a narrower value
4436 which can be sign-extended or zero-extended to give back OP.
4437 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4438 or 0 if the value should be sign-extended. */
4440 extern tree get_narrower (tree, int *);
4442 /* Return true if T is an expression that get_inner_reference handles. */
4445 handled_component_p (const_tree t)
4447 switch (TREE_CODE (t))
4452 case ARRAY_RANGE_REF:
4455 case VIEW_CONVERT_EXPR:
4463 /* Return true T is a component with reverse storage order. */
4466 reverse_storage_order_for_component_p (tree t)
4468 /* The storage order only applies to scalar components. */
4469 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t)))
4472 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
4473 t = TREE_OPERAND (t, 0);
4475 switch (TREE_CODE (t))
4479 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4480 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4481 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
4482 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
4486 return REF_REVERSE_STORAGE_ORDER (t);
4488 case ARRAY_RANGE_REF:
4489 case VIEW_CONVERT_EXPR:
4497 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4498 that can modify the storage order of objects. Note that, even if the
4499 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4500 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4501 it can change the partition of the aggregate object into scalars. */
4504 storage_order_barrier_p (const_tree t)
4506 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
4509 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4510 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
4513 tree op = TREE_OPERAND (t, 0);
4515 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
4516 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
4522 /* Given a DECL or TYPE, return the scope in which it was declared, or
4523 NUL_TREE if there is no containing scope. */
4525 extern tree get_containing_scope (const_tree);
4527 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4529 extern tree decl_function_context (const_tree);
4531 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4532 this _DECL with its context, or zero if none. */
4533 extern tree decl_type_context (const_tree);
4535 /* Return 1 if EXPR is the real constant zero. */
4536 extern int real_zerop (const_tree);
4538 /* Initialize the iterator I with arguments from function FNDECL */
4541 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4543 i->next = TYPE_ARG_TYPES (fntype);
4546 /* Return a pointer that holds the next argument if there are more arguments to
4547 handle, otherwise return NULL. */
4549 static inline tree *
4550 function_args_iter_cond_ptr (function_args_iterator *i)
4552 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4555 /* Return the next argument if there are more arguments to handle, otherwise
4559 function_args_iter_cond (function_args_iterator *i)
4561 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4564 /* Advance to the next argument. */
4566 function_args_iter_next (function_args_iterator *i)
4568 gcc_assert (i->next != NULL_TREE);
4569 i->next = TREE_CHAIN (i->next);
4572 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4575 inlined_function_outer_scope_p (const_tree block)
4577 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4580 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4581 to point to the next tree element. ITER is an instance of
4582 function_args_iterator used to iterate the arguments. */
4583 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4584 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4585 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4586 function_args_iter_next (&(ITER)))
4588 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4589 to the next tree element. ITER is an instance of function_args_iterator
4590 used to iterate the arguments. */
4591 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4592 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4593 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4594 function_args_iter_next (&(ITER)))
4597 extern unsigned crc32_string (unsigned, const char *);
4598 extern unsigned crc32_byte (unsigned, char);
4599 extern unsigned crc32_unsigned (unsigned, unsigned);
4600 extern void clean_symbol_name (char *);
4601 extern tree get_file_function_name (const char *);
4602 extern tree get_callee_fndecl (const_tree);
4603 extern combined_fn get_call_combined_fn (const_tree);
4604 extern int type_num_arguments (const_tree);
4605 extern bool associative_tree_code (enum tree_code);
4606 extern bool commutative_tree_code (enum tree_code);
4607 extern bool commutative_ternary_tree_code (enum tree_code);
4608 extern bool operation_can_overflow (enum tree_code);
4609 extern bool operation_no_trapping_overflow (tree, enum tree_code);
4610 extern tree upper_bound_in_type (tree, tree);
4611 extern tree lower_bound_in_type (tree, tree);
4612 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4613 extern tree create_artificial_label (location_t);
4614 extern const char *get_name (tree);
4615 extern bool stdarg_p (const_tree);
4616 extern bool prototype_p (const_tree);
4617 extern bool is_typedef_decl (const_tree x);
4618 extern bool typedef_variant_p (const_tree);
4619 extern bool auto_var_in_fn_p (const_tree, const_tree);
4620 extern tree build_low_bits_mask (tree, unsigned);
4621 extern bool tree_nop_conversion_p (const_tree, const_tree);
4622 extern tree tree_strip_nop_conversions (tree);
4623 extern tree tree_strip_sign_nop_conversions (tree);
4624 extern const_tree strip_invariant_refs (const_tree);
4625 extern tree lhd_gcc_personality (void);
4626 extern void assign_assembler_name_if_neeeded (tree);
4627 extern void warn_deprecated_use (tree, tree);
4628 extern void cache_integer_cst (tree);
4629 extern const char *combined_fn_name (combined_fn);
4631 /* Compare and hash for any structure which begins with a canonical
4632 pointer. Assumes all pointers are interchangeable, which is sort
4633 of already assumed by gcc elsewhere IIRC. */
4636 struct_ptr_eq (const void *a, const void *b)
4638 const void * const * x = (const void * const *) a;
4639 const void * const * y = (const void * const *) b;
4643 static inline hashval_t
4644 struct_ptr_hash (const void *a)
4646 const void * const * x = (const void * const *) a;
4647 return (intptr_t)*x >> 4;
4650 /* Return nonzero if CODE is a tree code that represents a truth value. */
4652 truth_value_p (enum tree_code code)
4654 return (TREE_CODE_CLASS (code) == tcc_comparison
4655 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4656 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4657 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4660 /* Return whether TYPE is a type suitable for an offset for
4661 a POINTER_PLUS_EXPR. */
4663 ptrofftype_p (tree type)
4665 return (INTEGRAL_TYPE_P (type)
4666 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4667 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4670 /* Return true if the argument is a complete type or an array
4671 of unknown bound (whose type is incomplete but) whose elements
4672 have complete type. */
4674 complete_or_array_type_p (const_tree type)
4676 return COMPLETE_TYPE_P (type)
4677 || (TREE_CODE (type) == ARRAY_TYPE
4678 && COMPLETE_TYPE_P (TREE_TYPE (type)));
4681 extern tree strip_float_extensions (tree);
4682 extern int really_constant_p (const_tree);
4683 extern bool decl_address_invariant_p (const_tree);
4684 extern bool decl_address_ip_invariant_p (const_tree);
4685 extern bool int_fits_type_p (const_tree, const_tree);
4686 #ifndef GENERATOR_FILE
4687 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4689 extern bool variably_modified_type_p (tree, tree);
4690 extern int tree_log2 (const_tree);
4691 extern int tree_floor_log2 (const_tree);
4692 extern unsigned int tree_ctz (const_tree);
4693 extern int simple_cst_equal (const_tree, const_tree);
4698 extern void add_expr (const_tree, hash &);
4702 /* Compat version until all callers are converted. Return hash for
4704 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
4706 inchash::hash hstate (seed);
4707 inchash::add_expr (tree, hstate);
4708 return hstate.end ();
4711 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4712 extern int type_list_equal (const_tree, const_tree);
4713 extern int chain_member (const_tree, const_tree);
4714 extern void dump_tree_statistics (void);
4715 extern void recompute_tree_invariant_for_addr_expr (tree);
4716 extern bool needs_to_live_in_memory (const_tree);
4717 extern tree reconstruct_complex_type (tree, tree);
4718 extern int real_onep (const_tree);
4719 extern int real_minus_onep (const_tree);
4720 extern void init_ttree (void);
4721 extern void build_common_tree_nodes (bool);
4722 extern void build_common_builtin_nodes (void);
4723 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4724 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
4725 extern tree build_range_type (tree, tree, tree);
4726 extern tree build_nonshared_range_type (tree, tree, tree);
4727 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4728 extern HOST_WIDE_INT int_cst_value (const_tree);
4729 extern tree tree_block (tree);
4730 extern void tree_set_block (tree, tree);
4731 extern location_t *block_nonartificial_location (tree);
4732 extern location_t tree_nonartificial_location (tree);
4733 extern tree block_ultimate_origin (const_tree);
4734 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4735 extern bool virtual_method_call_p (const_tree);
4736 extern tree obj_type_ref_class (const_tree ref);
4737 extern bool types_same_for_odr (const_tree type1, const_tree type2,
4739 extern bool contains_bitfld_component_ref_p (const_tree);
4740 extern bool block_may_fallthru (const_tree);
4741 extern void using_eh_for_cleanups (void);
4742 extern bool using_eh_for_cleanups_p (void);
4743 extern const char *get_tree_code_name (enum tree_code);
4744 extern void set_call_expr_flags (tree, int);
4745 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
4747 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4749 #define walk_tree(a,b,c,d) \
4750 walk_tree_1 (a, b, c, d, NULL)
4751 #define walk_tree_without_duplicates(a,b,c) \
4752 walk_tree_without_duplicates_1 (a, b, c, NULL)
4754 extern tree drop_tree_overflow (tree);
4756 /* Given a memory reference expression T, return its base address.
4757 The base address of a memory reference expression is the main
4758 object being referenced. */
4759 extern tree get_base_address (tree t);
4761 /* Return a tree of sizetype representing the size, in bytes, of the element
4762 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4763 extern tree array_ref_element_size (tree);
4765 /* Return a tree representing the upper bound of the array mentioned in
4766 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4767 extern tree array_ref_up_bound (tree);
4769 /* Return a tree representing the lower bound of the array mentioned in
4770 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4771 extern tree array_ref_low_bound (tree);
4773 /* Returns true if REF is an array reference to an array at the end of
4774 a structure. If this is the case, the array may be allocated larger
4775 than its upper bound implies. */
4776 extern bool array_at_struct_end_p (tree);
4778 /* Return a tree representing the offset, in bytes, of the field referenced
4779 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4780 extern tree component_ref_field_offset (tree);
4782 extern int tree_map_base_eq (const void *, const void *);
4783 extern unsigned int tree_map_base_hash (const void *);
4784 extern int tree_map_base_marked_p (const void *);
4785 extern void DEBUG_FUNCTION verify_type (const_tree t);
4786 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
4787 bool trust_type_canonical = true);
4788 extern bool type_with_interoperable_signedness (const_tree);
4790 /* Return simplified tree code of type that is used for canonical type
4792 inline enum tree_code
4793 tree_code_for_canonical_type_merging (enum tree_code code)
4795 /* By C standard, each enumerated type shall be compatible with char,
4796 a signed integer, or an unsigned integer. The choice of type is
4797 implementation defined (in our case it depends on -fshort-enum).
4799 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4800 type and compare only by their signedness and precision. */
4801 if (code == ENUMERAL_TYPE)
4802 return INTEGER_TYPE;
4803 /* To allow inter-operability between languages having references and
4804 C, we consider reference types and pointers alike. Note that this is
4805 not strictly necessary for C-Fortran 2008 interoperability because
4806 Fortran define C_PTR type that needs to be compatible with C pointers
4807 and we handle this one as ptr_type_node. */
4808 if (code == REFERENCE_TYPE)
4809 return POINTER_TYPE;
4813 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
4814 We don't define the types for pointers, arrays and vectors. The reason is
4815 that pointers are handled specially: ptr_type_node accesses conflict with
4816 accesses to all other pointers. This is done by alias.c.
4817 Because alias sets of arrays and vectors are the same as types of their
4818 elements, we can't compute canonical type either. Otherwise we could go
4819 form void *[10] to int *[10] (because they are equivalent for canonical type
4820 machinery) and get wrong TBAA. */
4823 canonical_type_used_p (const_tree t)
4825 return !(POINTER_TYPE_P (t)
4826 || TREE_CODE (t) == ARRAY_TYPE
4827 || TREE_CODE (t) == VECTOR_TYPE);
4830 #define tree_map_eq tree_map_base_eq
4831 extern unsigned int tree_map_hash (const void *);
4832 #define tree_map_marked_p tree_map_base_marked_p
4834 #define tree_decl_map_eq tree_map_base_eq
4835 extern unsigned int tree_decl_map_hash (const void *);
4836 #define tree_decl_map_marked_p tree_map_base_marked_p
4838 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
4840 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
4842 equal (tree_decl_map *a, tree_decl_map *b)
4844 return tree_decl_map_eq (a, b);
4848 keep_cache_entry (tree_decl_map *&m)
4850 return ggc_marked_p (m->base.from);
4854 #define tree_int_map_eq tree_map_base_eq
4855 #define tree_int_map_hash tree_map_base_hash
4856 #define tree_int_map_marked_p tree_map_base_marked_p
4858 #define tree_vec_map_eq tree_map_base_eq
4859 #define tree_vec_map_hash tree_decl_map_hash
4860 #define tree_vec_map_marked_p tree_map_base_marked_p
4862 /* Initialize the abstract argument list iterator object ITER with the
4863 arguments from CALL_EXPR node EXP. */
4865 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4868 iter->n = call_expr_nargs (exp);
4873 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4876 iter->n = call_expr_nargs (exp);
4880 /* Return the next argument from abstract argument list iterator object ITER,
4881 and advance its state. Return NULL_TREE if there are no more arguments. */
4883 next_call_expr_arg (call_expr_arg_iterator *iter)
4886 if (iter->i >= iter->n)
4888 result = CALL_EXPR_ARG (iter->t, iter->i);
4893 static inline const_tree
4894 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4897 if (iter->i >= iter->n)
4899 result = CALL_EXPR_ARG (iter->t, iter->i);
4904 /* Initialize the abstract argument list iterator object ITER, then advance
4905 past and return the first argument. Useful in for expressions, e.g.
4906 for (arg = first_call_expr_arg (exp, &iter); arg;
4907 arg = next_call_expr_arg (&iter)) */
4909 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4911 init_call_expr_arg_iterator (exp, iter);
4912 return next_call_expr_arg (iter);
4915 static inline const_tree
4916 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4918 init_const_call_expr_arg_iterator (exp, iter);
4919 return next_const_call_expr_arg (iter);
4922 /* Test whether there are more arguments in abstract argument list iterator
4923 ITER, without changing its state. */
4925 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4927 return (iter->i < iter->n);
4930 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4931 (of type call_expr_arg_iterator) to hold the iteration state. */
4932 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4933 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4934 (arg) = next_call_expr_arg (&(iter)))
4936 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4937 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4938 (arg) = next_const_call_expr_arg (&(iter)))
4940 /* Return true if tree node T is a language-specific node. */
4942 is_lang_specific (const_tree t)
4944 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4947 /* Valid builtin number. */
4948 #define BUILTIN_VALID_P(FNCODE) \
4949 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4951 /* Return the tree node for an explicit standard builtin function or NULL. */
4953 builtin_decl_explicit (enum built_in_function fncode)
4955 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4957 return builtin_info[(size_t)fncode].decl;
4960 /* Return the tree node for an implicit builtin function or NULL. */
4962 builtin_decl_implicit (enum built_in_function fncode)
4964 size_t uns_fncode = (size_t)fncode;
4965 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4967 if (!builtin_info[uns_fncode].implicit_p)
4970 return builtin_info[uns_fncode].decl;
4973 /* Set explicit builtin function nodes and whether it is an implicit
4977 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4979 size_t ufncode = (size_t)fncode;
4981 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4982 && (decl != NULL_TREE || !implicit_p));
4984 builtin_info[ufncode].decl = decl;
4985 builtin_info[ufncode].implicit_p = implicit_p;
4986 builtin_info[ufncode].declared_p = false;
4989 /* Set the implicit flag for a builtin function. */
4992 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
4994 size_t uns_fncode = (size_t)fncode;
4996 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4997 && builtin_info[uns_fncode].decl != NULL_TREE);
4999 builtin_info[uns_fncode].implicit_p = implicit_p;
5002 /* Set the declared flag for a builtin function. */
5005 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
5007 size_t uns_fncode = (size_t)fncode;
5009 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5010 && builtin_info[uns_fncode].decl != NULL_TREE);
5012 builtin_info[uns_fncode].declared_p = declared_p;
5015 /* Return whether the standard builtin function can be used as an explicit
5019 builtin_decl_explicit_p (enum built_in_function fncode)
5021 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5022 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
5025 /* Return whether the standard builtin function can be used implicitly. */
5028 builtin_decl_implicit_p (enum built_in_function fncode)
5030 size_t uns_fncode = (size_t)fncode;
5032 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5033 return (builtin_info[uns_fncode].decl != NULL_TREE
5034 && builtin_info[uns_fncode].implicit_p);
5037 /* Return whether the standard builtin function was declared. */
5040 builtin_decl_declared_p (enum built_in_function fncode)
5042 size_t uns_fncode = (size_t)fncode;
5044 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5045 return (builtin_info[uns_fncode].decl != NULL_TREE
5046 && builtin_info[uns_fncode].declared_p);
5049 /* Return true if T (assumed to be a DECL) is a global variable.
5050 A variable is considered global if its storage is not automatic. */
5053 is_global_var (const_tree t)
5055 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5058 /* Return true if VAR may be aliased. A variable is considered as
5059 maybe aliased if it has its address taken by the local TU
5060 or possibly by another TU and might be modified through a pointer. */
5063 may_be_aliased (const_tree var)
5065 return (TREE_CODE (var) != CONST_DECL
5066 && (TREE_PUBLIC (var)
5067 || DECL_EXTERNAL (var)
5068 || TREE_ADDRESSABLE (var))
5069 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
5070 && ((TREE_READONLY (var)
5071 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
5072 || (TREE_CODE (var) == VAR_DECL
5073 && DECL_NONALIASED (var)))));
5076 /* Return pointer to optimization flags of FNDECL. */
5077 static inline struct cl_optimization *
5078 opts_for_fn (const_tree fndecl)
5080 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
5081 if (fn_opts == NULL_TREE)
5082 fn_opts = optimization_default_node;
5083 return TREE_OPTIMIZATION (fn_opts);
5086 /* Return pointer to target flags of FNDECL. */
5087 static inline cl_target_option *
5088 target_opts_for_fn (const_tree fndecl)
5090 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
5091 if (fn_opts == NULL_TREE)
5092 fn_opts = target_option_default_node;
5093 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
5096 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5097 the optimization level of function fndecl. */
5098 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5100 /* For anonymous aggregate types, we need some sort of name to
5101 hold on to. In practice, this should not appear, but it should
5102 not be harmful if it does. */
5103 extern const char *anon_aggrname_format();
5104 extern bool anon_aggrname_p (const_tree);
5106 /* The tree and const_tree overload templates. */
5110 struct int_traits <const_tree>
5112 static const enum precision_type precision_type = VAR_PRECISION;
5113 static const bool host_dependent_precision = false;
5114 static const bool is_sign_extended = false;
5115 static unsigned int get_precision (const_tree);
5116 static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int,
5121 struct int_traits <tree> : public int_traits <const_tree> {};
5130 extended_tree (const_tree);
5132 unsigned int get_precision () const;
5133 const HOST_WIDE_INT *get_val () const;
5134 unsigned int get_len () const;
5138 struct int_traits <extended_tree <N> >
5140 static const enum precision_type precision_type = CONST_PRECISION;
5141 static const bool host_dependent_precision = false;
5142 static const bool is_sign_extended = true;
5143 static const unsigned int precision = N;
5146 generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> >
5147 to_widest (const_tree);
5149 generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree);
5153 wi::int_traits <const_tree>::get_precision (const_tree tcst)
5155 return TYPE_PRECISION (TREE_TYPE (tcst));
5158 /* Convert the tree_cst X into a wide_int of PRECISION. */
5159 inline wi::storage_ref
5160 wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
5161 unsigned int precision, const_tree x)
5163 return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
5167 inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> >
5168 wi::to_widest (const_tree t)
5173 inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> >
5174 wi::to_offset (const_tree t)
5180 inline wi::extended_tree <N>::extended_tree (const_tree t)
5183 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
5188 wi::extended_tree <N>::get_precision () const
5194 inline const HOST_WIDE_INT *
5195 wi::extended_tree <N>::get_val () const
5197 return &TREE_INT_CST_ELT (m_t, 0);
5202 wi::extended_tree <N>::get_len () const
5204 if (N == ADDR_MAX_PRECISION)
5205 return TREE_INT_CST_OFFSET_NUNITS (m_t);
5206 else if (N >= WIDE_INT_MAX_PRECISION)
5207 return TREE_INT_CST_EXT_NUNITS (m_t);
5209 /* This class is designed to be used for specific output precisions
5210 and needs to be as fast as possible, so there is no fallback for
5217 template <typename T>
5218 bool fits_to_boolean_p (const T &x, const_tree);
5220 template <typename T>
5221 bool fits_to_tree_p (const T &x, const_tree);
5223 wide_int min_value (const_tree);
5224 wide_int max_value (const_tree);
5225 wide_int from_mpz (const_tree, mpz_t, bool);
5228 template <typename T>
5230 wi::fits_to_boolean_p (const T &x, const_tree type)
5232 return eq_p (x, 0) || eq_p (x, TYPE_UNSIGNED (type) ? 1 : -1);
5235 template <typename T>
5237 wi::fits_to_tree_p (const T &x, const_tree type)
5239 /* Non-standard boolean types can have arbitrary precision but various
5240 transformations assume that they can only take values 0 and +/-1. */
5241 if (TREE_CODE (type) == BOOLEAN_TYPE)
5242 return fits_to_boolean_p (x, type);
5244 if (TYPE_UNSIGNED (type))
5245 return eq_p (x, zext (x, TYPE_PRECISION (type)));
5247 return eq_p (x, sext (x, TYPE_PRECISION (type)));
5250 /* Produce the smallest number that is represented in TYPE. The precision
5251 and sign are taken from TYPE. */
5253 wi::min_value (const_tree type)
5255 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5258 /* Produce the largest number that is represented in TYPE. The precision
5259 and sign are taken from TYPE. */
5261 wi::max_value (const_tree type)
5263 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5266 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5267 extending both according to their respective TYPE_SIGNs. */
5270 tree_int_cst_lt (const_tree t1, const_tree t2)
5272 return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2));
5275 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5276 extending both according to their respective TYPE_SIGNs. */
5279 tree_int_cst_le (const_tree t1, const_tree t2)
5281 return wi::les_p (wi::to_widest (t1), wi::to_widest (t2));
5284 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5285 are both INTEGER_CSTs and their values are extended according to their
5286 respective TYPE_SIGNs. */
5289 tree_int_cst_compare (const_tree t1, const_tree t2)
5291 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
5294 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5295 but none of these files are allowed to be included from front ends.
5296 They should be split in two. One suitable for the FEs, the other suitable
5299 /* Assign the RTX to declaration. */
5300 extern void set_decl_rtl (tree, rtx);
5301 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
5303 /* Given an expression EXP that is a handled_component_p,
5304 look for the ultimate containing object, which is returned and specify
5305 the access position and size. */
5306 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
5307 tree *, machine_mode *, int *, int *,
5310 extern tree build_personality_function (const char *);
5312 struct GTY(()) int_n_trees_t {
5313 /* These parts are initialized at runtime */
5318 /* This is also in machmode.h */
5319 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
5320 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
5322 /* Like bit_position, but return as an integer. It must be representable in
5323 that way (since it could be a signed value, we don't have the
5324 option of returning -1 like int_size_in_byte can. */
5326 inline HOST_WIDE_INT
5327 int_bit_position (const_tree field)
5329 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field)), BITS_PER_UNIT_LOG)
5330 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
5333 /* Return true if it makes sense to consider alias set for a type T. */
5336 type_with_alias_set_p (const_tree t)
5338 /* Function and method types are never accessed as memory locations. */
5339 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
5342 if (COMPLETE_TYPE_P (t))
5345 /* Incomplete types can not be accessed in general except for arrays
5346 where we can fetch its element despite we have no array bounds. */
5347 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
5353 extern location_t get_pure_location (location_t loc);
5355 /* Get the endpoint of any range encoded within location LOC. */
5357 static inline location_t
5358 get_finish (location_t loc)
5360 return get_range_from_loc (line_table, loc).m_finish;
5363 extern location_t set_block (location_t loc, tree block);
5365 extern void gt_ggc_mx (tree &);
5366 extern void gt_pch_nx (tree &);
5367 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
5369 extern bool nonnull_arg_p (const_tree);
5370 extern bool is_redundant_typedef (const_tree);
5373 set_source_range (tree expr, location_t start, location_t finish);
5376 set_source_range (tree expr, source_range src_range);
5378 static inline source_range
5379 get_decl_source_range (tree decl)
5381 location_t loc = DECL_SOURCE_LOCATION (decl);
5382 return get_range_from_loc (line_table, loc);
5386 make_location (location_t caret, location_t start, location_t finish);
5388 /* Return true if it makes sense to promote/demote from_type to to_type. */
5390 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
5392 unsigned int to_type_precision = TYPE_PRECISION (to_type);
5394 /* OK to promote if to_type is no bigger than word_mode. */
5395 if (to_type_precision <= GET_MODE_PRECISION (word_mode))
5398 /* Otherwise, allow only if narrowing or same precision conversions. */
5399 return to_type_precision <= TYPE_PRECISION (from_type);
5402 #endif /* GCC_TREE_H */