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 /* Whether a case or a user-defined label is allowed to fall through to.
770 This is used to implement -Wimplicit-fallthrough. */
771 #define FALLTHROUGH_LABEL_P(NODE) \
772 (LABEL_DECL_CHECK (NODE)->base.public_flag)
774 /* Nonzero means this expression is volatile in the C sense:
775 its address should be of type `volatile WHATEVER *'.
776 In other words, the declared item is volatile qualified.
777 This is used in _DECL nodes and _REF nodes.
778 On a FUNCTION_DECL node, this means the function does not
779 return normally. This is the same effect as setting
780 the attribute noreturn on the function in C.
782 In a ..._TYPE node, means this type is volatile-qualified.
783 But use TYPE_VOLATILE instead of this macro when the node is a type,
784 because eventually we may make that a different bit.
786 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
787 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
789 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
790 accessing the memory pointed to won't generate a trap. However,
791 this only applies to an object when used appropriately: it doesn't
792 mean that writing a READONLY mem won't trap.
794 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
795 (or slice of the array) always belongs to the range of the array.
796 I.e. that the access will not trap, provided that the access to
797 the base to the array will not trap. */
798 #define TREE_THIS_NOTRAP(NODE) \
799 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
800 ARRAY_RANGE_REF)->base.nothrow_flag)
802 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
803 nonzero means it may not be the lhs of an assignment.
804 Nonzero in a FUNCTION_DECL means this function should be treated
805 as "const" function (can only read its arguments). */
806 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
808 /* Value of expression is constant. Always on in all ..._CST nodes. May
809 also appear in an expression or decl where the value is constant. */
810 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
812 /* Nonzero if NODE, a type, has had its sizes gimplified. */
813 #define TYPE_SIZES_GIMPLIFIED(NODE) \
814 (TYPE_CHECK (NODE)->base.constant_flag)
816 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
817 #define DECL_UNSIGNED(NODE) \
818 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
820 /* In integral and pointer types, means an unsigned type. */
821 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
823 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
824 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
826 /* True if overflow wraps around for the given integral type. That
827 is, TYPE_MAX + 1 == TYPE_MIN. */
828 #define TYPE_OVERFLOW_WRAPS(TYPE) \
829 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
831 /* True if overflow is undefined for the given integral type. We may
832 optimize on the assumption that values in the type never overflow.
834 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
835 must issue a warning based on warn_strict_overflow. In some cases
836 it will be appropriate to issue the warning immediately, and in
837 other cases it will be appropriate to simply set a flag and let the
838 caller decide whether a warning is appropriate or not. */
839 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
840 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
841 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
843 /* True if overflow for the given integral type should issue a
845 #define TYPE_OVERFLOW_TRAPS(TYPE) \
846 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
848 /* True if an overflow is to be preserved for sanitization. */
849 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
850 (INTEGRAL_TYPE_P (TYPE) \
851 && (flag_sanitize & (SANITIZE_SI_OVERFLOW | SANITIZE_UI_OVERFLOW)))
853 /* True if pointer types have undefined overflow. */
854 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
856 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
857 Nonzero in a FUNCTION_DECL means that the function has been compiled.
858 This is interesting in an inline function, since it might not need
859 to be compiled separately.
860 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
861 or TYPE_DECL if the debugging info for the type has been written.
862 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
863 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
865 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
867 /* Nonzero in a _DECL if the name is used in its scope.
868 Nonzero in an expr node means inhibit warning if value is unused.
869 In IDENTIFIER_NODEs, this means that some extern decl for this name
871 In a BLOCK, this means that the block contains variables that are used. */
872 #define TREE_USED(NODE) ((NODE)->base.used_flag)
874 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
875 throw an exception. In a CALL_EXPR, nonzero means the call cannot
876 throw. We can't easily check the node type here as the C++
877 frontend also uses this flag (for AGGR_INIT_EXPR). */
878 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
880 /* In a CALL_EXPR, means that it's safe to use the target of the call
881 expansion as the return slot for a call that returns in memory. */
882 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
883 (CALL_EXPR_CHECK (NODE)->base.private_flag)
885 /* Cilk keywords accessors. */
886 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
888 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
889 passed by invisible reference (and the TREE_TYPE is a pointer to the true
891 #define DECL_BY_REFERENCE(NODE) \
892 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
893 RESULT_DECL)->decl_common.decl_by_reference_flag)
895 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
897 #define DECL_READ_P(NODE) \
898 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
900 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
901 attempting to share the stack slot with some other variable. */
902 #define DECL_NONSHAREABLE(NODE) \
903 (TREE_CHECK2 (NODE, VAR_DECL, \
904 RESULT_DECL)->decl_common.decl_nonshareable_flag)
906 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
907 thunked-to function. */
908 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
910 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
911 it has been built for the declaration of a variable-sized object. */
912 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
913 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
915 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
916 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
918 /* In a type, nonzero means that all objects of the type are guaranteed by the
919 language or front-end to be properly aligned, so we can indicate that a MEM
920 of this type is aligned at least to the alignment of the type, even if it
921 doesn't appear that it is. We see this, for example, in object-oriented
922 languages where a tag field may show this is an object of a more-aligned
923 variant of the more generic type. */
924 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
926 /* Used in classes in C++. */
927 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
928 /* Used in classes in C++. */
929 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
931 /* True if reference type NODE is a C++ rvalue reference. */
932 #define TYPE_REF_IS_RVALUE(NODE) \
933 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
935 /* Nonzero in a _DECL if the use of the name is defined as a
936 deprecated feature by __attribute__((deprecated)). */
937 #define TREE_DEPRECATED(NODE) \
938 ((NODE)->base.deprecated_flag)
940 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
941 uses are to be substituted for uses of the TREE_CHAINed identifier. */
942 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
943 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
945 /* In an aggregate type, indicates that the scalar fields of the type are
946 stored in reverse order from the target order. This effectively
947 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
948 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
949 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
951 /* In a non-aggregate type, indicates a saturating type. */
952 #define TYPE_SATURATING(NODE) \
953 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
955 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
956 of bits stored in reverse order from the target order. This effectively
957 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
959 The overall strategy is to preserve the invariant that every scalar in
960 memory is associated with a single storage order, i.e. all accesses to
961 this scalar are done with the same storage order. This invariant makes
962 it possible to factor out the storage order in most transformations, as
963 only the address and/or the value (in target order) matter for them.
964 But, of course, the storage order must be preserved when the accesses
965 themselves are rewritten or transformed. */
966 #define REF_REVERSE_STORAGE_ORDER(NODE) \
967 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
969 /* These flags are available for each language front end to use internally. */
970 #define TREE_LANG_FLAG_0(NODE) \
971 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
972 #define TREE_LANG_FLAG_1(NODE) \
973 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
974 #define TREE_LANG_FLAG_2(NODE) \
975 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
976 #define TREE_LANG_FLAG_3(NODE) \
977 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
978 #define TREE_LANG_FLAG_4(NODE) \
979 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
980 #define TREE_LANG_FLAG_5(NODE) \
981 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
982 #define TREE_LANG_FLAG_6(NODE) \
983 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
985 /* Define additional fields and accessors for nodes representing constants. */
987 #define TREE_INT_CST_NUNITS(NODE) \
988 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
989 #define TREE_INT_CST_EXT_NUNITS(NODE) \
990 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
991 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
992 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
993 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
994 #define TREE_INT_CST_LOW(NODE) \
995 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
997 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
998 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1000 #define TREE_FIXED_CST_PTR(NODE) \
1001 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1002 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1004 /* In a STRING_CST */
1005 /* In C terms, this is sizeof, not strlen. */
1006 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1007 #define TREE_STRING_POINTER(NODE) \
1008 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1010 /* In a COMPLEX_CST node. */
1011 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1012 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1014 /* In a VECTOR_CST node. */
1015 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1016 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
1017 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
1019 /* Define fields and accessors for some special-purpose tree nodes. */
1021 #define IDENTIFIER_LENGTH(NODE) \
1022 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1023 #define IDENTIFIER_POINTER(NODE) \
1024 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1025 #define IDENTIFIER_HASH_VALUE(NODE) \
1026 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1028 /* Translate a hash table identifier pointer to a tree_identifier
1029 pointer, and vice versa. */
1031 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1032 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1033 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1035 /* In a TREE_LIST node. */
1036 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1037 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1039 /* In a TREE_VEC node. */
1040 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1041 #define TREE_VEC_END(NODE) \
1042 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1044 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1046 /* In a CONSTRUCTOR node. */
1047 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1048 #define CONSTRUCTOR_ELT(NODE,IDX) \
1049 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1050 #define CONSTRUCTOR_NELTS(NODE) \
1051 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1052 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1053 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1055 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1056 value of each element (stored within VAL). IX must be a scratch variable
1057 of unsigned integer type. */
1058 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1059 for (IX = 0; (IX >= vec_safe_length (V)) \
1061 : ((VAL = (*(V))[IX].value), \
1065 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1066 the value of each element (stored within VAL) and its index (stored
1067 within INDEX). IX must be a scratch variable of unsigned integer type. */
1068 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1069 for (IX = 0; (IX >= vec_safe_length (V)) \
1071 : (((void) (VAL = (*V)[IX].value)), \
1072 (INDEX = (*V)[IX].index), \
1076 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1077 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1079 constructor_elt _ce___ = {INDEX, VALUE}; \
1080 vec_safe_push ((V), _ce___); \
1083 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1084 constructor output purposes. */
1085 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1086 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1088 /* True if NODE is a clobber right hand side, an expression of indeterminate
1089 value that clobbers the LHS in a copy instruction. We use a volatile
1090 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1091 In particular the volatile flag causes us to not prematurely remove
1092 such clobber instructions. */
1093 #define TREE_CLOBBER_P(NODE) \
1094 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1096 /* Define fields and accessors for some nodes that represent expressions. */
1098 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1099 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1100 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1101 && integer_zerop (TREE_OPERAND (NODE, 0)))
1103 /* In ordinary expression nodes. */
1104 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1105 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1107 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1108 length. Its value includes the length operand itself; that is,
1109 the minimum valid length is 1.
1110 Note that we have to bypass the use of TREE_OPERAND to access
1111 that field to avoid infinite recursion in expanding the macros. */
1112 #define VL_EXP_OPERAND_LENGTH(NODE) \
1113 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1115 /* Nonzero if is_gimple_debug() may possibly hold. */
1116 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1118 /* In a LOOP_EXPR node. */
1119 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1121 /* The source location of this expression. Non-tree_exp nodes such as
1122 decls and constants can be shared among multiple locations, so
1124 #define EXPR_LOCATION(NODE) \
1125 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1126 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1127 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1128 != UNKNOWN_LOCATION)
1129 /* The location to be used in a diagnostic about this expression. Do not
1130 use this macro if the location will be assigned to other expressions. */
1131 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1132 ? (NODE)->exp.locus : (LOCUS))
1133 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1134 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1136 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1137 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1139 #define EXPR_HAS_RANGE(NODE) \
1140 (CAN_HAVE_RANGE_P (NODE) \
1141 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1144 /* True if a tree is an expression or statement that can have a
1146 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1148 static inline source_range
1149 get_expr_source_range (tree expr)
1151 location_t loc = EXPR_LOCATION (expr);
1152 return get_range_from_loc (line_table, loc);
1155 extern void protected_set_expr_location (tree, location_t);
1157 /* In a TARGET_EXPR node. */
1158 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1159 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1160 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1162 /* DECL_EXPR accessor. This gives access to the DECL associated with
1163 the given declaration statement. */
1164 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1166 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1168 /* COMPOUND_LITERAL_EXPR accessors. */
1169 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1170 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1171 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1172 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1174 /* SWITCH_EXPR accessors. These give access to the condition, body and
1175 original condition type (before any compiler conversions)
1176 of the switch statement, respectively. */
1177 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1178 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1179 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1181 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1182 of a case label, respectively. */
1183 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1184 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1185 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1186 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1188 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1189 corresponding MEM_REF operands. */
1190 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1191 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1192 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1193 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1194 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1196 #define MR_DEPENDENCE_CLIQUE(NODE) \
1197 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1198 #define MR_DEPENDENCE_BASE(NODE) \
1199 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1201 /* The operands of a BIND_EXPR. */
1202 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1203 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1204 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1206 /* GOTO_EXPR accessor. This gives access to the label associated with
1207 a goto statement. */
1208 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1210 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1211 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1212 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1214 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1215 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1216 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1217 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1218 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1219 /* Nonzero if we want to create an ASM_INPUT instead of an
1220 ASM_OPERAND with no operands. */
1221 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1222 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1224 /* COND_EXPR accessors. */
1225 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1226 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1227 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1229 /* Accessors for the chains of recurrences. */
1230 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1231 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1232 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1233 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1235 /* LABEL_EXPR accessor. This gives access to the label associated with
1236 the given label expression. */
1237 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1239 /* CATCH_EXPR accessors. */
1240 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1241 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1243 /* EH_FILTER_EXPR accessors. */
1244 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1245 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1247 /* OBJ_TYPE_REF accessors. */
1248 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1249 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1250 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1252 /* ASSERT_EXPR accessors. */
1253 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1254 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1256 /* CALL_EXPR accessors. */
1257 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1258 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1259 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1260 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1261 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1263 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1264 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1265 the argument count is zero when checking is enabled. Instead, do
1266 the pointer arithmetic to advance past the 3 fixed operands in a
1267 CALL_EXPR. That produces a valid pointer to just past the end of the
1268 operand array, even if it's not valid to dereference it. */
1269 #define CALL_EXPR_ARGP(NODE) \
1270 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1272 /* TM directives and accessors. */
1273 #define TRANSACTION_EXPR_BODY(NODE) \
1274 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1275 #define TRANSACTION_EXPR_OUTER(NODE) \
1276 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1277 #define TRANSACTION_EXPR_RELAXED(NODE) \
1278 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1280 /* OpenMP and OpenACC directive and clause accessors. */
1282 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1284 #define OMP_BODY(NODE) \
1285 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 0)
1286 #define OMP_CLAUSES(NODE) \
1287 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1289 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1290 #define OMP_STANDALONE_CLAUSES(NODE) \
1291 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1293 #define OACC_DATA_BODY(NODE) \
1294 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1295 #define OACC_DATA_CLAUSES(NODE) \
1296 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1298 #define OACC_HOST_DATA_BODY(NODE) \
1299 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1300 #define OACC_HOST_DATA_CLAUSES(NODE) \
1301 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1303 #define OACC_CACHE_CLAUSES(NODE) \
1304 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1306 #define OACC_DECLARE_CLAUSES(NODE) \
1307 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1309 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1310 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1312 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1313 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1315 #define OACC_UPDATE_CLAUSES(NODE) \
1316 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1318 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1319 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1321 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1322 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1324 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1325 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1326 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1328 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1329 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1330 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1331 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1332 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1333 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1334 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1335 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1337 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1338 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1340 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1342 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1343 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1345 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1347 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1349 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1350 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1352 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1353 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1354 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1356 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1357 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1359 #define OMP_TARGET_DATA_BODY(NODE) \
1360 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1361 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1362 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1364 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1365 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1367 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1368 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1370 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1371 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1373 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1374 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1376 #define OMP_CLAUSE_SIZE(NODE) \
1377 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1379 OMP_CLAUSE__CACHE_), 1)
1381 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1382 #define OMP_CLAUSE_DECL(NODE) \
1383 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1384 OMP_CLAUSE_PRIVATE, \
1385 OMP_CLAUSE__LOOPTEMP_), 0)
1386 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1387 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1388 != UNKNOWN_LOCATION)
1389 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1391 /* True on an OMP_SECTION statement that was the last lexical member.
1392 This status is meaningful in the implementation of lastprivate. */
1393 #define OMP_SECTION_LAST(NODE) \
1394 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1396 /* True on an OMP_PARALLEL statement if it represents an explicit
1397 combined parallel work-sharing constructs. */
1398 #define OMP_PARALLEL_COMBINED(NODE) \
1399 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1401 /* True on an OMP_TEAMS statement if it represents an explicit
1402 combined teams distribute constructs. */
1403 #define OMP_TEAMS_COMBINED(NODE) \
1404 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1406 /* True on an OMP_TARGET statement if it represents explicit
1407 combined target teams, target parallel or target simd constructs. */
1408 #define OMP_TARGET_COMBINED(NODE) \
1409 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1411 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1412 as opposed to relaxed. */
1413 #define OMP_ATOMIC_SEQ_CST(NODE) \
1414 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1415 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1417 /* True on a PRIVATE clause if its decl is kept around for debugging
1418 information only and its DECL_VALUE_EXPR is supposed to point
1419 to what it has been remapped to. */
1420 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1421 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1423 /* True on a PRIVATE clause if ctor needs access to outer region's
1425 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1426 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1428 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1429 (thus should be private on the outer taskloop and firstprivate on
1431 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1432 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1434 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1435 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1436 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1438 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1439 decl is present in the chain. */
1440 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1441 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1442 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1443 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1444 OMP_CLAUSE_LASTPRIVATE),\
1446 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1447 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1449 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1450 (thus should be lastprivate on the outer taskloop and firstprivate on
1452 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1453 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1455 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1456 decl is present in the chain (this can happen only for taskloop
1457 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1458 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1459 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1461 /* True on a SHARED clause if a scalar is not modified in the body and
1462 thus could be optimized as firstprivate. */
1463 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1464 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1466 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1467 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1469 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1470 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1471 #define OMP_CLAUSE_IF_EXPR(NODE) \
1472 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1473 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1474 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1475 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1476 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1477 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1478 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1479 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1480 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1482 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1483 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1485 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1486 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1488 /* OpenACC clause expressions */
1489 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1490 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1491 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1492 OMP_CLAUSE_OPERAND ( \
1493 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1494 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1495 OMP_CLAUSE_OPERAND ( \
1496 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1497 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1498 OMP_CLAUSE_OPERAND ( \
1499 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1500 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1501 OMP_CLAUSE_OPERAND ( \
1502 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1503 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1504 OMP_CLAUSE_OPERAND ( \
1505 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1506 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1507 OMP_CLAUSE_OPERAND ( \
1508 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1509 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1510 OMP_CLAUSE_OPERAND ( \
1511 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1512 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1513 OMP_CLAUSE_OPERAND ( \
1514 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1515 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1516 OMP_CLAUSE_OPERAND ( \
1517 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1519 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1520 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1522 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1523 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1525 #define OMP_CLAUSE_MAP_KIND(NODE) \
1526 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1527 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1528 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1529 = (unsigned int) (MAP_KIND))
1531 /* Nonzero if this map clause is for array (rather than pointer) based array
1532 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1533 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1534 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1535 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1536 /* Nonzero if this is a mapped array section, that might need special
1537 treatment if OMP_CLAUSE_SIZE is zero. */
1538 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1539 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1540 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1541 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1542 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1544 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1545 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1547 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1548 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1549 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1550 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1551 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1552 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1554 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1555 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1557 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1558 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1559 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1560 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1561 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1562 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1563 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1564 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1565 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1566 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1567 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1568 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1569 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1570 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 4)
1572 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1573 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1574 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1575 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1577 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1578 are always initialized inside of the loop construct, false otherwise. */
1579 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1580 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1582 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1583 are declared inside of the simd construct. */
1584 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1585 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1587 /* True if a LINEAR clause has a stride that is variable. */
1588 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1589 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1591 /* True if a LINEAR clause is for an array or allocatable variable that
1592 needs special handling by the frontend. */
1593 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1594 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1596 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1597 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1599 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1600 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1602 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1603 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1605 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1606 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1608 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1609 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1611 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1612 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1614 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1615 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1616 OMP_CLAUSE_THREAD_LIMIT), 0)
1618 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1619 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1621 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1622 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1623 OMP_CLAUSE_DIST_SCHEDULE), 0)
1625 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1626 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1628 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1629 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1631 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1632 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1634 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1635 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1637 /* True if a SCHEDULE clause has the simd modifier on it. */
1638 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1639 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1641 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1642 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1644 #define OMP_CLAUSE_TILE_LIST(NODE) \
1645 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1647 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1648 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1649 ->omp_clause.subcode.dimension)
1650 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1651 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1652 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1653 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1655 /* SSA_NAME accessors. */
1657 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1658 if there is no name associated with it. */
1659 #define SSA_NAME_IDENTIFIER(NODE) \
1660 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1661 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1662 ? (NODE)->ssa_name.var \
1663 : DECL_NAME ((NODE)->ssa_name.var)) \
1666 /* Returns the variable being referenced. This can be NULL_TREE for
1667 temporaries not associated with any user variable.
1668 Once released, this is the only field that can be relied upon. */
1669 #define SSA_NAME_VAR(NODE) \
1670 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1671 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1672 ? NULL_TREE : (NODE)->ssa_name.var)
1674 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1675 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1677 /* Returns the statement which defines this SSA name. */
1678 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1680 /* Returns the SSA version number of this SSA name. Note that in
1681 tree SSA, version numbers are not per variable and may be recycled. */
1682 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1684 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1685 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1687 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1688 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1690 /* Nonzero if this SSA_NAME expression is currently on the free list of
1691 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1692 has no meaning for an SSA_NAME. */
1693 #define SSA_NAME_IN_FREE_LIST(NODE) \
1694 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1696 /* Nonzero if this SSA_NAME is the default definition for the
1697 underlying symbol. A default SSA name is created for symbol S if
1698 the very first reference to S in the function is a read operation.
1699 Default definitions are always created by an empty statement and
1700 belong to no basic block. */
1701 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1702 SSA_NAME_CHECK (NODE)->base.default_def_flag
1704 /* Attributes for SSA_NAMEs for pointer-type variables. */
1705 #define SSA_NAME_PTR_INFO(N) \
1706 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1708 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1709 #define SSA_NAME_ANTI_RANGE_P(N) \
1710 SSA_NAME_CHECK (N)->base.static_flag
1712 /* The type of range described by SSA_NAME_RANGE_INFO. */
1713 #define SSA_NAME_RANGE_TYPE(N) \
1714 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1716 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1717 #define SSA_NAME_RANGE_INFO(N) \
1718 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1720 /* Return the immediate_use information for an SSA_NAME. */
1721 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1723 #define OMP_CLAUSE_CODE(NODE) \
1724 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1726 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1727 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1729 #define OMP_CLAUSE_OPERAND(NODE, I) \
1730 OMP_CLAUSE_ELT_CHECK (NODE, I)
1732 /* In a BLOCK node. */
1733 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1734 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1735 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1736 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1737 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1738 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1739 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1740 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1741 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1742 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1743 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1744 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1746 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1747 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1749 /* An index number for this block. These values are not guaranteed to
1750 be unique across functions -- whether or not they are depends on
1751 the debugging output format in use. */
1752 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1754 /* If block reordering splits a lexical block into discontiguous
1755 address ranges, we'll make a copy of the original block.
1757 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1758 In that case, we have one source block that has been replicated
1759 (through inlining or unrolling) into many logical blocks, and that
1760 these logical blocks have different physical variables in them.
1762 In this case, we have one logical block split into several
1763 non-contiguous address ranges. Most debug formats can't actually
1764 represent this idea directly, so we fake it by creating multiple
1765 logical blocks with the same variables in them. However, for those
1766 that do support non-contiguous regions, these allow the original
1767 logical block to be reconstructed, along with the set of address
1770 One of the logical block fragments is arbitrarily chosen to be
1771 the ORIGIN. The other fragments will point to the origin via
1772 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1773 be null. The list of fragments will be chained through
1774 BLOCK_FRAGMENT_CHAIN from the origin. */
1776 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1777 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1779 /* For an inlined function, this gives the location where it was called
1780 from. This is only set in the top level block, which corresponds to the
1781 inlined function scope. This is used in the debug output routines. */
1783 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1785 /* This gives the location of the end of the block, useful to attach
1786 code implicitly generated for outgoing paths. */
1788 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1790 /* Define fields and accessors for nodes representing data types. */
1792 /* See tree.def for documentation of the use of these fields.
1793 Look at the documentation of the various ..._TYPE tree codes.
1795 Note that the type.values, type.minval, and type.maxval fields are
1796 overloaded and used for different macros in different kinds of types.
1797 Each macro must check to ensure the tree node is of the proper kind of
1798 type. Note also that some of the front-ends also overload these fields,
1799 so they must be checked as well. */
1801 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1802 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1803 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1804 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1805 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1806 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1807 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1808 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1809 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1810 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1812 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1813 #define TYPE_MODE(NODE) \
1814 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1815 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1816 #define SET_TYPE_MODE(NODE, MODE) \
1817 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1819 extern machine_mode element_mode (const_tree t);
1821 /* The "canonical" type for this type node, which is used by frontends to
1822 compare the type for equality with another type. If two types are
1823 equal (based on the semantics of the language), then they will have
1824 equivalent TYPE_CANONICAL entries.
1826 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1827 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1828 be used for comparison against other types. Instead, the type is
1829 said to require structural equality checks, described in
1830 TYPE_STRUCTURAL_EQUALITY_P.
1832 For unqualified aggregate and function types the middle-end relies on
1833 TYPE_CANONICAL to tell whether two variables can be assigned
1834 to each other without a conversion. The middle-end also makes sure
1835 to assign the same alias-sets to the type partition with equal
1836 TYPE_CANONICAL of their unqualified variants. */
1837 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1838 /* Indicates that the type node requires structural equality
1839 checks. The compiler will need to look at the composition of the
1840 type to determine whether it is equal to another type, rather than
1841 just comparing canonical type pointers. For instance, we would need
1842 to look at the return and parameter types of a FUNCTION_TYPE
1844 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1845 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1846 type node requires structural equality. */
1847 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1849 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1850 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1852 /* The (language-specific) typed-based alias set for this type.
1853 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1854 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1855 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1856 type can alias objects of any type. */
1857 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1859 /* Nonzero iff the typed-based alias set for this type has been
1861 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1862 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1864 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1866 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1868 /* The alignment necessary for objects of this type.
1869 The value is an int, measured in bits and must be a power of two.
1870 We support also an "alignement" of zero. */
1871 #define TYPE_ALIGN(NODE) \
1872 (TYPE_CHECK (NODE)->type_common.align \
1873 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
1875 /* Specify that TYPE_ALIGN(NODE) is X. */
1876 #define SET_TYPE_ALIGN(NODE, X) \
1877 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
1879 /* 1 if the alignment for this type was requested by "aligned" attribute,
1880 0 if it is the default for this type. */
1881 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1883 /* The alignment for NODE, in bytes. */
1884 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1886 /* If your language allows you to declare types, and you want debug info
1887 for them, then you need to generate corresponding TYPE_DECL nodes.
1888 These "stub" TYPE_DECL nodes have no name, and simply point at the
1889 type node. You then set the TYPE_STUB_DECL field of the type node
1890 to point back at the TYPE_DECL node. This allows the debug routines
1891 to know that the two nodes represent the same type, so that we only
1892 get one debug info record for them. */
1893 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1895 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1896 the type has BLKmode only because it lacks the alignment required for
1898 #define TYPE_NO_FORCE_BLK(NODE) \
1899 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1901 /* Nonzero in a type considered volatile as a whole. */
1902 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1904 /* Nonzero in a type considered atomic as a whole. */
1905 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1907 /* Means this type is const-qualified. */
1908 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1910 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1912 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1914 /* If nonzero, type's name shouldn't be emitted into debug info. */
1915 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1917 /* The address space the type is in. */
1918 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1920 /* Encode/decode the named memory support as part of the qualifier. If more
1921 than 8 qualifiers are added, these macros need to be adjusted. */
1922 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1923 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1925 /* Return all qualifiers except for the address space qualifiers. */
1926 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1928 /* Only keep the address space out of the qualifiers and discard the other
1930 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1932 /* The set of type qualifiers for this type. */
1933 #define TYPE_QUALS(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) \
1938 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1940 /* The same as TYPE_QUALS without the address space qualifications. */
1941 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1942 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1943 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1944 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1945 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1947 /* The same as TYPE_QUALS without the address space and atomic
1949 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1950 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1951 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1952 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1954 /* These flags are available for each language front end to use internally. */
1955 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1956 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1957 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1958 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1959 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1960 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1961 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1963 /* Used to keep track of visited nodes in tree traversals. This is set to
1964 0 by copy_node and make_node. */
1965 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1967 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1968 that distinguish string from array of char).
1969 If set in a INTEGER_TYPE, indicates a character type. */
1970 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1972 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1973 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1974 (((unsigned HOST_WIDE_INT) 1) \
1975 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1977 /* Set precision to n when we have 2^n sub-parts of the vector. */
1978 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1979 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1981 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1982 about missing conversions to other vector types of the same size. */
1983 #define TYPE_VECTOR_OPAQUE(NODE) \
1984 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1986 /* Indicates that objects of this type must be initialized by calling a
1987 function when they are created. */
1988 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1989 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1991 /* Indicates that a UNION_TYPE object should be passed the same way that
1992 the first union alternative would be passed, or that a RECORD_TYPE
1993 object should be passed the same way that the first (and only) member
1995 #define TYPE_TRANSPARENT_AGGR(NODE) \
1996 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1998 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1999 address of a component of the type. This is the counterpart of
2000 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2001 #define TYPE_NONALIASED_COMPONENT(NODE) \
2002 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2004 /* Indicated that objects of this type should be laid out in as
2005 compact a way as possible. */
2006 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2008 /* Used by type_contains_placeholder_p to avoid recomputation.
2009 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2010 this field directly. */
2011 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2012 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2014 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2015 #define TYPE_FINAL_P(NODE) \
2016 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2018 /* The debug output functions use the symtab union field to store
2019 information specific to the debugging format. The different debug
2020 output hooks store different types in the union field. These three
2021 macros are used to access different fields in the union. The debug
2022 hooks are responsible for consistently using only a specific
2025 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2026 hold the type's number in the generated stabs. */
2027 #define TYPE_SYMTAB_ADDRESS(NODE) \
2028 (TYPE_CHECK (NODE)->type_common.symtab.address)
2030 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2031 hold struct/union type tag names. */
2032 #define TYPE_SYMTAB_POINTER(NODE) \
2033 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2035 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2036 in dwarf2out.c to point to the DIE generated for the type. */
2037 #define TYPE_SYMTAB_DIE(NODE) \
2038 (TYPE_CHECK (NODE)->type_common.symtab.die)
2040 /* The garbage collector needs to know the interpretation of the
2041 symtab field. These constants represent the different types in the
2044 #define TYPE_SYMTAB_IS_ADDRESS (0)
2045 #define TYPE_SYMTAB_IS_POINTER (1)
2046 #define TYPE_SYMTAB_IS_DIE (2)
2048 #define TYPE_LANG_SPECIFIC(NODE) \
2049 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2051 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2052 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2053 #define TYPE_FIELDS(NODE) \
2054 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2055 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2056 #define TYPE_ARG_TYPES(NODE) \
2057 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2058 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2060 #define TYPE_METHODS(NODE) \
2061 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2062 #define TYPE_VFIELD(NODE) \
2063 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2064 #define TYPE_METHOD_BASETYPE(NODE) \
2065 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2066 #define TYPE_OFFSET_BASETYPE(NODE) \
2067 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2068 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2069 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2070 #define TYPE_NEXT_PTR_TO(NODE) \
2071 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2072 #define TYPE_NEXT_REF_TO(NODE) \
2073 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2074 #define TYPE_MIN_VALUE(NODE) \
2075 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2076 #define TYPE_MAX_VALUE(NODE) \
2077 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2079 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2080 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2082 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2083 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2085 /* For record and union types, information about this type, as a base type
2087 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2089 /* For non record and union types, used in a language-dependent way. */
2090 #define TYPE_LANG_SLOT_1(NODE) \
2091 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
2093 /* Define accessor macros for information about type inheritance
2096 A "basetype" means a particular usage of a data type for inheritance
2097 in another type. Each such basetype usage has its own "binfo"
2098 object to describe it. The binfo object is a TREE_VEC node.
2100 Inheritance is represented by the binfo nodes allocated for a
2101 given type. For example, given types C and D, such that D is
2102 inherited by C, 3 binfo nodes will be allocated: one for describing
2103 the binfo properties of C, similarly one for D, and one for
2104 describing the binfo properties of D as a base type for C.
2105 Thus, given a pointer to class C, one can get a pointer to the binfo
2106 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2108 /* BINFO specific flags. */
2110 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2111 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2113 /* Flags for language dependent use. */
2114 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2115 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2116 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2117 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2118 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2119 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2120 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2122 /* The actual data type node being inherited in this basetype. */
2123 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2125 /* The offset where this basetype appears in its containing type.
2126 BINFO_OFFSET slot holds the offset (in bytes)
2127 from the base of the complete object to the base of the part of the
2128 object that is allocated on behalf of this `type'.
2129 This is always 0 except when there is multiple inheritance. */
2131 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2132 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2134 /* The virtual function table belonging to this basetype. Virtual
2135 function tables provide a mechanism for run-time method dispatching.
2136 The entries of a virtual function table are language-dependent. */
2138 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2140 /* The virtual functions in the virtual function table. This is
2141 a TREE_LIST that is used as an initial approximation for building
2142 a virtual function table for this basetype. */
2143 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2145 /* A vector of binfos for the direct basetypes inherited by this
2148 If this basetype describes type D as inherited in C, and if the
2149 basetypes of D are E and F, then this vector contains binfos for
2150 inheritance of E and F by C. */
2151 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2153 /* The number of basetypes for NODE. */
2154 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2156 /* Accessor macro to get to the Nth base binfo of this binfo. */
2157 #define BINFO_BASE_BINFO(NODE,N) \
2158 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2159 #define BINFO_BASE_ITERATE(NODE,N,B) \
2160 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2161 #define BINFO_BASE_APPEND(NODE,T) \
2162 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2164 /* For a BINFO record describing a virtual base class, i.e., one where
2165 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2166 base. The actual contents are language-dependent. In the C++
2167 front-end this field is an INTEGER_CST giving an offset into the
2168 vtable where the offset to the virtual base can be found. */
2169 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2171 /* Indicates the accesses this binfo has to its bases. The values are
2172 access_public_node, access_protected_node or access_private_node.
2173 If this array is not present, public access is implied. */
2174 #define BINFO_BASE_ACCESSES(NODE) \
2175 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2177 #define BINFO_BASE_ACCESS(NODE,N) \
2178 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2179 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2180 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2182 /* The index in the VTT where this subobject's sub-VTT can be found.
2183 NULL_TREE if there is no sub-VTT. */
2184 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2186 /* The index in the VTT where the vptr for this subobject can be
2187 found. NULL_TREE if there is no secondary vptr in the VTT. */
2188 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2190 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2191 inheriting this base for non-virtual bases. For virtual bases it
2192 points either to the binfo for which this is a primary binfo, or to
2193 the binfo of the most derived type. */
2194 #define BINFO_INHERITANCE_CHAIN(NODE) \
2195 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2198 /* Define fields and accessors for nodes representing declared names. */
2200 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2201 have an associated SSA name. */
2202 #define SSA_VAR_P(DECL) \
2203 (TREE_CODE (DECL) == VAR_DECL \
2204 || TREE_CODE (DECL) == PARM_DECL \
2205 || TREE_CODE (DECL) == RESULT_DECL \
2206 || TREE_CODE (DECL) == SSA_NAME)
2209 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2211 /* This is the name of the object as written by the user.
2212 It is an IDENTIFIER_NODE. */
2213 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2215 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2216 #define TYPE_IDENTIFIER(NODE) \
2217 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2218 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2220 /* Every ..._DECL node gets a unique number. */
2221 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2223 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2225 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2227 /* Every ..._DECL node gets a unique number that stays the same even
2228 when the decl is copied by the inliner once it is set. */
2229 #define DECL_PT_UID(NODE) \
2230 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2231 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2232 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2233 #define SET_DECL_PT_UID(NODE, UID) \
2234 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2235 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2236 be preserved when copyin the decl. */
2237 #define DECL_PT_UID_SET_P(NODE) \
2238 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2240 /* These two fields describe where in the source code the declaration
2241 was. If the declaration appears in several places (as for a C
2242 function that is declared first and then defined later), this
2243 information should refer to the definition. */
2244 #define DECL_SOURCE_LOCATION(NODE) \
2245 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2246 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2247 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2248 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2249 /* This accessor returns TRUE if the decl it operates on was created
2250 by a front-end or back-end rather than by user code. In this case
2251 builtin-ness is indicated by source location. */
2252 #define DECL_IS_BUILTIN(DECL) \
2253 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2255 #define DECL_LOCATION_RANGE(NODE) \
2256 (get_decl_source_range (DECL_MINIMAL_CHECK (NODE)))
2258 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2259 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2260 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2261 nodes, this points to either the FUNCTION_DECL for the containing
2262 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2263 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2264 scope". In particular, for VAR_DECLs which are virtual table pointers
2265 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2267 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2268 #define DECL_FIELD_CONTEXT(NODE) \
2269 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2271 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2272 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2274 /* For any sort of a ..._DECL node, this points to the original (abstract)
2275 decl node which this decl is an inlined/cloned instance of, or else it
2276 is NULL indicating that this decl is not an instance of some other decl.
2278 The C front-end also uses this in a nested declaration of an inline
2279 function, to point back to the definition. */
2280 #define DECL_ABSTRACT_ORIGIN(NODE) \
2281 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2283 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2284 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2285 #define DECL_ORIGIN(NODE) \
2286 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2288 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2289 inline instance of some original (abstract) decl from an inline function;
2290 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2291 nodes can also have their abstract origin set to themselves. */
2292 #define DECL_FROM_INLINE(NODE) \
2293 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2294 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2296 /* In a DECL this is the field where attributes are stored. */
2297 #define DECL_ATTRIBUTES(NODE) \
2298 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2300 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2301 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2302 For a VAR_DECL, holds the initial value.
2303 For a PARM_DECL, used for DECL_ARG_TYPE--default
2304 values for parameters are encoded in the type of the function,
2305 not in the PARM_DECL slot.
2306 For a FIELD_DECL, this is used for enumeration values and the C
2307 frontend uses it for temporarily storing bitwidth of bitfields.
2309 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2310 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2312 /* Holds the size of the datum, in bits, as a tree expression.
2313 Need not be constant. */
2314 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2315 /* Likewise for the size in bytes. */
2316 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2317 /* Returns the alignment required for the datum, in bits. It must
2318 be a power of two, but an "alignment" of zero is supported
2319 (e.g. as "uninitialized" sentinel). */
2320 #define DECL_ALIGN(NODE) \
2321 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2322 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2323 /* Specify that DECL_ALIGN(NODE) is X. */
2324 #define SET_DECL_ALIGN(NODE, X) \
2325 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2327 /* The alignment of NODE, in bytes. */
2328 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2329 /* Set if the alignment of this DECL has been set by the user, for
2330 example with an 'aligned' attribute. */
2331 #define DECL_USER_ALIGN(NODE) \
2332 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2333 /* Holds the machine mode corresponding to the declaration of a variable or
2334 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2336 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2338 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2339 operation it is. Note, however, that this field is overloaded, with
2340 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2341 checked before any access to the former. */
2342 #define DECL_FUNCTION_CODE(NODE) \
2343 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2345 #define DECL_FUNCTION_PERSONALITY(NODE) \
2346 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2348 /* Nonzero for a given ..._DECL node means that the name of this node should
2349 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2350 the associated type should be ignored. For a FUNCTION_DECL, the body of
2351 the function should also be ignored. */
2352 #define DECL_IGNORED_P(NODE) \
2353 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2355 /* Nonzero for a given ..._DECL node means that this node represents an
2356 "abstract instance" of the given declaration (e.g. in the original
2357 declaration of an inline function). When generating symbolic debugging
2358 information, we mustn't try to generate any address information for nodes
2359 marked as "abstract instances" because we don't actually generate
2360 any code or allocate any data space for such instances. */
2361 #define DECL_ABSTRACT_P(NODE) \
2362 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2364 /* Language-specific decl information. */
2365 #define DECL_LANG_SPECIFIC(NODE) \
2366 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2368 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2369 do not allocate storage, and refer to a definition elsewhere. Note that
2370 this does not necessarily imply the entity represented by NODE
2371 has no program source-level definition in this translation unit. For
2372 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2373 DECL_EXTERNAL may be true simultaneously; that can be the case for
2374 a C99 "extern inline" function. */
2375 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2377 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2378 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2380 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2382 Also set in some languages for variables, etc., outside the normal
2383 lexical scope, such as class instance variables. */
2384 #define DECL_NONLOCAL(NODE) \
2385 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2387 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2388 Used in FIELD_DECLs for vtable pointers.
2389 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2390 #define DECL_VIRTUAL_P(NODE) \
2391 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2393 /* Used to indicate that this DECL represents a compiler-generated entity. */
2394 #define DECL_ARTIFICIAL(NODE) \
2395 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2397 /* Additional flags for language-specific uses. */
2398 #define DECL_LANG_FLAG_0(NODE) \
2399 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2400 #define DECL_LANG_FLAG_1(NODE) \
2401 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2402 #define DECL_LANG_FLAG_2(NODE) \
2403 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2404 #define DECL_LANG_FLAG_3(NODE) \
2405 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2406 #define DECL_LANG_FLAG_4(NODE) \
2407 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2408 #define DECL_LANG_FLAG_5(NODE) \
2409 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2410 #define DECL_LANG_FLAG_6(NODE) \
2411 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2412 #define DECL_LANG_FLAG_7(NODE) \
2413 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2414 #define DECL_LANG_FLAG_8(NODE) \
2415 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2417 /* Nonzero for a scope which is equal to file scope. */
2418 #define SCOPE_FILE_SCOPE_P(EXP) \
2419 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2420 /* Nonzero for a decl which is at file scope. */
2421 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2422 /* Nonzero for a type which is at file scope. */
2423 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2425 /* Nonzero for a decl that is decorated using attribute used.
2426 This indicates to compiler tools that this decl needs to be preserved. */
2427 #define DECL_PRESERVE_P(DECL) \
2428 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2430 /* For function local variables of COMPLEX and VECTOR types,
2431 indicates that the variable is not aliased, and that all
2432 modifications to the variable have been adjusted so that
2433 they are killing assignments. Thus the variable may now
2434 be treated as a GIMPLE register, and use real instead of
2435 virtual ops in SSA form. */
2436 #define DECL_GIMPLE_REG_P(DECL) \
2437 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2439 extern tree decl_value_expr_lookup (tree);
2440 extern void decl_value_expr_insert (tree, tree);
2442 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2443 if transformations have made this more complicated than evaluating the
2444 decl itself. This should only be used for debugging; once this field has
2445 been set, the decl itself may not legitimately appear in the function. */
2446 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2447 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2448 ->decl_common.decl_flag_2)
2449 #define DECL_VALUE_EXPR(NODE) \
2450 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2451 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2452 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2454 /* Holds the RTL expression for the value of a variable or function.
2455 This value can be evaluated lazily for functions, variables with
2456 static storage duration, and labels. */
2457 #define DECL_RTL(NODE) \
2458 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2459 ? (NODE)->decl_with_rtl.rtl \
2460 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2462 /* Set the DECL_RTL for NODE to RTL. */
2463 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2465 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2466 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2468 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2469 #define DECL_RTL_SET_P(NODE) \
2470 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2472 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2473 NODE1, it will not be set for NODE2; this is a lazy copy. */
2474 #define COPY_DECL_RTL(NODE1, NODE2) \
2475 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2476 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2478 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2479 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2481 #if (GCC_VERSION >= 2007)
2482 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2483 ({ tree const __d = (decl); \
2484 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2485 /* Dereference it so the compiler knows it can't be NULL even \
2486 without assertion checking. */ \
2487 &*DECL_RTL_IF_SET (__d); })
2489 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2492 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2493 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2495 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2496 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2497 of the structure. */
2498 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2500 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2501 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2502 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2503 natural alignment of the field's type). */
2504 #define DECL_FIELD_BIT_OFFSET(NODE) \
2505 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2507 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2508 if so, the type that was originally specified for it.
2509 TREE_TYPE may have been modified (in finish_struct). */
2510 #define DECL_BIT_FIELD_TYPE(NODE) \
2511 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2513 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2514 representative FIELD_DECL. */
2515 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2516 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2518 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2519 if nonzero, indicates that the field occupies the type. */
2520 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2522 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2523 DECL_FIELD_OFFSET which are known to be always zero.
2524 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2526 #define DECL_OFFSET_ALIGN(NODE) \
2527 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2529 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2530 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2531 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2533 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2534 which this FIELD_DECL is defined. This information is needed when
2535 writing debugging information about vfield and vbase decls for C++. */
2536 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2538 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2539 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2541 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2543 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2545 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2546 this component. This makes it possible for Type-Based Alias Analysis
2547 to disambiguate accesses to this field with indirect accesses using
2550 struct S { int i; } s;
2553 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2555 From the implementation's viewpoint, the alias set of the type of the
2556 field 'i' (int) will not be recorded as a subset of that of the type of
2557 's' (struct S) in record_component_aliases. The counterpart is that
2558 accesses to s.i must not be given the alias set of the type of 'i'
2559 (int) but instead directly that of the type of 's' (struct S). */
2560 #define DECL_NONADDRESSABLE_P(NODE) \
2561 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2563 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2564 dense, unique within any one function, and may be used to index arrays.
2565 If the value is -1, then no UID has been assigned. */
2566 #define LABEL_DECL_UID(NODE) \
2567 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2569 /* In a LABEL_DECL, the EH region number for which the label is the
2570 post_landing_pad. */
2571 #define EH_LANDING_PAD_NR(NODE) \
2572 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2574 /* For a PARM_DECL, records the data type used to pass the argument,
2575 which may be different from the type seen in the program. */
2576 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2578 /* For PARM_DECL, holds an RTL for the stack slot or register
2579 where the data was actually passed. */
2580 #define DECL_INCOMING_RTL(NODE) \
2581 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2583 /* Nonzero for a given ..._DECL node means that no warnings should be
2584 generated just because this node is unused. */
2585 #define DECL_IN_SYSTEM_HEADER(NODE) \
2586 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2588 /* Used to indicate that the linkage status of this DECL is not yet known,
2589 so it should not be output now. */
2590 #define DECL_DEFER_OUTPUT(NODE) \
2591 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2593 /* In a VAR_DECL that's static,
2594 nonzero if the space is in the text section. */
2595 #define DECL_IN_TEXT_SECTION(NODE) \
2596 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2598 /* In a VAR_DECL that's static,
2599 nonzero if it belongs to the global constant pool. */
2600 #define DECL_IN_CONSTANT_POOL(NODE) \
2601 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2603 /* Nonzero for a given ..._DECL node means that this node should be
2604 put in .common, if possible. If a DECL_INITIAL is given, and it
2605 is not error_mark_node, then the decl cannot be put in .common. */
2606 #define DECL_COMMON(NODE) \
2607 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2609 /* In a VAR_DECL, nonzero if the decl is a register variable with
2610 an explicit asm specification. */
2611 #define DECL_HARD_REGISTER(NODE) \
2612 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2614 /* Used to indicate that this DECL has weak linkage. */
2615 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2617 /* Used to indicate that the DECL is a dllimport. */
2618 #define DECL_DLLIMPORT_P(NODE) \
2619 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2621 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2622 not be put out unless it is needed in this translation unit.
2623 Entities like this are shared across translation units (like weak
2624 entities), but are guaranteed to be generated by any translation
2625 unit that needs them, and therefore need not be put out anywhere
2626 where they are not needed. DECL_COMDAT is just a hint to the
2627 back-end; it is up to front-ends which set this flag to ensure
2628 that there will never be any harm, other than bloat, in putting out
2629 something which is DECL_COMDAT. */
2630 #define DECL_COMDAT(NODE) \
2631 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2633 #define DECL_COMDAT_GROUP(NODE) \
2634 decl_comdat_group (NODE)
2636 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2637 multiple translation units should be merged. */
2638 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2639 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2641 /* The name of the object as the assembler will see it (but before any
2642 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2643 as DECL_NAME. It is an IDENTIFIER_NODE.
2645 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2646 One Definition Rule based type merging at LTO. It is computed only for
2647 LTO compilation and C++. */
2648 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2650 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2651 This is true of all DECL nodes except FIELD_DECL. */
2652 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2653 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2655 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2656 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2658 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2659 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2660 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2662 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2663 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2664 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2666 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2667 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2668 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2669 semantics of using this macro, are different than saying:
2671 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2673 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2675 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2676 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2677 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2678 DECL_ASSEMBLER_NAME (DECL1)) \
2681 /* Records the section name in a section attribute. Used to pass
2682 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2683 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2685 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2686 this variable in a BIND_EXPR. */
2687 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2688 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2690 /* Value of the decls's visibility attribute */
2691 #define DECL_VISIBILITY(NODE) \
2692 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2694 /* Nonzero means that the decl had its visibility specified rather than
2696 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2697 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2699 /* In a VAR_DECL, the model to use if the data should be allocated from
2700 thread-local storage. */
2701 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2703 /* In a VAR_DECL, nonzero if the data should be allocated from
2704 thread-local storage. */
2705 #define DECL_THREAD_LOCAL_P(NODE) \
2706 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2708 /* In a non-local VAR_DECL with static storage duration, true if the
2709 variable has an initialization priority. If false, the variable
2710 will be initialized at the DEFAULT_INIT_PRIORITY. */
2711 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2712 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2714 extern tree decl_debug_expr_lookup (tree);
2715 extern void decl_debug_expr_insert (tree, tree);
2717 /* For VAR_DECL, this is set to an expression that it was split from. */
2718 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2719 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2720 #define DECL_DEBUG_EXPR(NODE) \
2721 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2723 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2724 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2726 extern priority_type decl_init_priority_lookup (tree);
2727 extern priority_type decl_fini_priority_lookup (tree);
2728 extern void decl_init_priority_insert (tree, priority_type);
2729 extern void decl_fini_priority_insert (tree, priority_type);
2731 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2733 #define DECL_INIT_PRIORITY(NODE) \
2734 (decl_init_priority_lookup (NODE))
2735 /* Set the initialization priority for NODE to VAL. */
2736 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2737 (decl_init_priority_insert (NODE, VAL))
2739 /* For a FUNCTION_DECL the finalization priority of NODE. */
2740 #define DECL_FINI_PRIORITY(NODE) \
2741 (decl_fini_priority_lookup (NODE))
2742 /* Set the finalization priority for NODE to VAL. */
2743 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2744 (decl_fini_priority_insert (NODE, VAL))
2746 /* The initialization priority for entities for which no explicit
2747 initialization priority has been specified. */
2748 #define DEFAULT_INIT_PRIORITY 65535
2750 /* The maximum allowed initialization priority. */
2751 #define MAX_INIT_PRIORITY 65535
2753 /* The largest priority value reserved for use by system runtime
2755 #define MAX_RESERVED_INIT_PRIORITY 100
2757 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2758 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2759 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2761 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2762 #define DECL_NONLOCAL_FRAME(NODE) \
2763 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2765 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2766 #define DECL_NONALIASED(NODE) \
2767 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2769 /* This field is used to reference anything in decl.result and is meant only
2770 for use by the garbage collector. */
2771 #define DECL_RESULT_FLD(NODE) \
2772 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2774 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2775 Before the struct containing the FUNCTION_DECL is laid out,
2776 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2777 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2778 function. When the class is laid out, this pointer is changed
2779 to an INTEGER_CST node which is suitable for use as an index
2780 into the virtual function table. */
2781 #define DECL_VINDEX(NODE) \
2782 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2784 /* In FUNCTION_DECL, holds the decl for the return value. */
2785 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2787 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2788 #define DECL_UNINLINABLE(NODE) \
2789 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2791 /* In a FUNCTION_DECL, the saved representation of the body of the
2793 #define DECL_SAVED_TREE(NODE) \
2794 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2796 /* Nonzero in a FUNCTION_DECL means this function should be treated
2797 as if it were a malloc, meaning it returns a pointer that is
2799 #define DECL_IS_MALLOC(NODE) \
2800 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2802 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2803 C++ operator new, meaning that it returns a pointer for which we
2804 should not use type based aliasing. */
2805 #define DECL_IS_OPERATOR_NEW(NODE) \
2806 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2808 /* Nonzero in a FUNCTION_DECL means this function may return more
2810 #define DECL_IS_RETURNS_TWICE(NODE) \
2811 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2813 /* Nonzero in a FUNCTION_DECL means this function should be treated
2814 as "pure" function (like const function, but may read global memory). */
2815 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2817 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2818 the const or pure function may not terminate. When this is nonzero
2819 for a const or pure function, it can be dealt with by cse passes
2820 but cannot be removed by dce passes since you are not allowed to
2821 change an infinite looping program into one that terminates without
2823 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2824 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2826 /* Nonzero in a FUNCTION_DECL means this function should be treated
2827 as "novops" function (function that does not read global memory,
2828 but may have arbitrary side effects). */
2829 #define DECL_IS_NOVOPS(NODE) \
2830 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2832 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2833 at the beginning or end of execution. */
2834 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2835 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2837 #define DECL_STATIC_DESTRUCTOR(NODE) \
2838 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2840 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2841 be instrumented with calls to support routines. */
2842 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2843 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2845 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2846 disabled in this function. */
2847 #define DECL_NO_LIMIT_STACK(NODE) \
2848 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2850 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2851 #define DECL_STATIC_CHAIN(NODE) \
2852 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2854 /* Nonzero for a decl that cgraph has decided should be inlined into
2855 at least one call site. It is not meaningful to look at this
2856 directly; always use cgraph_function_possibly_inlined_p. */
2857 #define DECL_POSSIBLY_INLINED(DECL) \
2858 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2860 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2861 such as via the `inline' keyword in C/C++. This flag controls the linkage
2862 semantics of 'inline' */
2863 #define DECL_DECLARED_INLINE_P(NODE) \
2864 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2866 /* Nonzero in a FUNCTION_DECL means this function should not get
2867 -Winline warnings. */
2868 #define DECL_NO_INLINE_WARNING_P(NODE) \
2869 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2871 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2872 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2873 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2875 /* Nonzero if a FUNCTION_CODE is a TM load. */
2876 #define BUILTIN_TM_LOAD_P(FN) \
2877 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2879 /* Nonzero if a FUNCTION_CODE is a TM store. */
2880 #define BUILTIN_TM_STORE_P(FN) \
2881 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2883 #define CASE_BUILT_IN_TM_LOAD(FN) \
2884 case BUILT_IN_TM_LOAD_##FN: \
2885 case BUILT_IN_TM_LOAD_RAR_##FN: \
2886 case BUILT_IN_TM_LOAD_RAW_##FN: \
2887 case BUILT_IN_TM_LOAD_RFW_##FN
2889 #define CASE_BUILT_IN_TM_STORE(FN) \
2890 case BUILT_IN_TM_STORE_##FN: \
2891 case BUILT_IN_TM_STORE_WAR_##FN: \
2892 case BUILT_IN_TM_STORE_WAW_##FN
2894 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2895 disregarding size and cost heuristics. This is equivalent to using
2896 the always_inline attribute without the required diagnostics if the
2897 function cannot be inlined. */
2898 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2899 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2901 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2902 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2904 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2905 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2906 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2908 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2909 that describes the status of this function. */
2910 #define DECL_STRUCT_FUNCTION(NODE) \
2911 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2913 /* In a FUNCTION_DECL, nonzero means a built in function of a
2914 standard library or more generally a built in function that is
2915 recognized by optimizers and expanders.
2917 Note that it is different from the DECL_IS_BUILTIN accessor. For
2918 instance, user declared prototypes of C library functions are not
2919 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2920 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2922 /* For a builtin function, identify which part of the compiler defined it. */
2923 #define DECL_BUILT_IN_CLASS(NODE) \
2924 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2926 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2927 #define DECL_ARGUMENTS(NODE) \
2928 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2930 /* In FUNCTION_DECL, the function specific target options to use when compiling
2932 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2933 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2935 /* In FUNCTION_DECL, the function specific optimization options to use when
2936 compiling this function. */
2937 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2938 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2940 /* In FUNCTION_DECL, this is set if this function has other versions generated
2941 using "target" attributes. The default version is the one which does not
2942 have any "target" attribute set. */
2943 #define DECL_FUNCTION_VERSIONED(NODE)\
2944 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2946 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2947 Devirtualization machinery uses this knowledge for determing type of the
2948 object constructed. Also we assume that constructor address is not
2950 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2951 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2953 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2954 Devirtualization machinery uses this to track types in destruction. */
2955 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2956 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2958 /* In FUNCTION_DECL that represent an virtual method this is set when
2959 the method is final. */
2960 #define DECL_FINAL_P(NODE)\
2961 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2963 /* The source language of the translation-unit. */
2964 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2965 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2967 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2969 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2970 #define DECL_ORIGINAL_TYPE(NODE) \
2971 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2973 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2974 into stabs. Instead it will generate cross reference ('x') of names.
2975 This uses the same flag as DECL_EXTERNAL. */
2976 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2977 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2979 /* Getter of the imported declaration associated to the
2980 IMPORTED_DECL node. */
2981 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2982 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2984 /* Getter of the symbol declaration associated with the
2985 NAMELIST_DECL node. */
2986 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2987 (DECL_INITIAL (NODE))
2989 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2990 To reduce overhead, the nodes containing the statements are not trees.
2991 This avoids the overhead of tree_common on all linked list elements.
2993 Use the interface in tree-iterator.h to access this node. */
2995 #define STATEMENT_LIST_HEAD(NODE) \
2996 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2997 #define STATEMENT_LIST_TAIL(NODE) \
2998 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3000 #define TREE_OPTIMIZATION(NODE) \
3001 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3003 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3004 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3006 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3007 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3009 /* Return a tree node that encapsulates the optimization options in OPTS. */
3010 extern tree build_optimization_node (struct gcc_options *opts);
3012 #define TREE_TARGET_OPTION(NODE) \
3013 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3015 #define TREE_TARGET_GLOBALS(NODE) \
3016 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3018 /* Return a tree node that encapsulates the target options in OPTS. */
3019 extern tree build_target_option_node (struct gcc_options *opts);
3021 extern void prepare_target_option_nodes_for_pch (void);
3023 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3026 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3028 if (TREE_CODE (__t) != __c)
3029 tree_check_failed (__t, __f, __l, __g, __c, 0);
3034 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3037 if (TREE_CODE (__t) == __c)
3038 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3043 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3044 enum tree_code __c1, enum tree_code __c2)
3046 if (TREE_CODE (__t) != __c1
3047 && TREE_CODE (__t) != __c2)
3048 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3053 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3054 enum tree_code __c1, enum tree_code __c2)
3056 if (TREE_CODE (__t) == __c1
3057 || TREE_CODE (__t) == __c2)
3058 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3063 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3064 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3066 if (TREE_CODE (__t) != __c1
3067 && TREE_CODE (__t) != __c2
3068 && TREE_CODE (__t) != __c3)
3069 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3074 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3075 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3077 if (TREE_CODE (__t) == __c1
3078 || TREE_CODE (__t) == __c2
3079 || TREE_CODE (__t) == __c3)
3080 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3085 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3086 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3087 enum tree_code __c4)
3089 if (TREE_CODE (__t) != __c1
3090 && TREE_CODE (__t) != __c2
3091 && TREE_CODE (__t) != __c3
3092 && TREE_CODE (__t) != __c4)
3093 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3098 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3099 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3100 enum tree_code __c4)
3102 if (TREE_CODE (__t) == __c1
3103 || TREE_CODE (__t) == __c2
3104 || TREE_CODE (__t) == __c3
3105 || TREE_CODE (__t) == __c4)
3106 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3111 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3112 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3113 enum tree_code __c4, enum tree_code __c5)
3115 if (TREE_CODE (__t) != __c1
3116 && TREE_CODE (__t) != __c2
3117 && TREE_CODE (__t) != __c3
3118 && TREE_CODE (__t) != __c4
3119 && TREE_CODE (__t) != __c5)
3120 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3125 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3126 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3127 enum tree_code __c4, enum tree_code __c5)
3129 if (TREE_CODE (__t) == __c1
3130 || TREE_CODE (__t) == __c2
3131 || TREE_CODE (__t) == __c3
3132 || TREE_CODE (__t) == __c4
3133 || TREE_CODE (__t) == __c5)
3134 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3139 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3140 const char *__f, int __l, const char *__g)
3142 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3143 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3148 tree_class_check (tree __t, const enum tree_code_class __class,
3149 const char *__f, int __l, const char *__g)
3151 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3152 tree_class_check_failed (__t, __class, __f, __l, __g);
3157 tree_range_check (tree __t,
3158 enum tree_code __code1, enum tree_code __code2,
3159 const char *__f, int __l, const char *__g)
3161 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3162 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3167 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3168 const char *__f, int __l, const char *__g)
3170 if (TREE_CODE (__t) != OMP_CLAUSE)
3171 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3172 if (__t->omp_clause.code != __code)
3173 omp_clause_check_failed (__t, __f, __l, __g, __code);
3178 omp_clause_range_check (tree __t,
3179 enum omp_clause_code __code1,
3180 enum omp_clause_code __code2,
3181 const char *__f, int __l, const char *__g)
3183 if (TREE_CODE (__t) != OMP_CLAUSE)
3184 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3185 if ((int) __t->omp_clause.code < (int) __code1
3186 || (int) __t->omp_clause.code > (int) __code2)
3187 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3191 /* These checks have to be special cased. */
3194 expr_check (tree __t, const char *__f, int __l, const char *__g)
3196 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3197 if (!IS_EXPR_CODE_CLASS (__c))
3198 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3202 /* These checks have to be special cased. */
3205 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3208 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3212 inline const HOST_WIDE_INT *
3213 tree_int_cst_elt_check (const_tree __t, int __i,
3214 const char *__f, int __l, const char *__g)
3216 if (TREE_CODE (__t) != INTEGER_CST)
3217 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3218 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3219 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3221 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3224 inline HOST_WIDE_INT *
3225 tree_int_cst_elt_check (tree __t, int __i,
3226 const char *__f, int __l, const char *__g)
3228 if (TREE_CODE (__t) != INTEGER_CST)
3229 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3230 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3231 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3233 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3236 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3238 # if GCC_VERSION >= 4006
3239 #pragma GCC diagnostic push
3240 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3244 tree_vec_elt_check (tree __t, int __i,
3245 const char *__f, int __l, const char *__g)
3247 if (TREE_CODE (__t) != TREE_VEC)
3248 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3249 if (__i < 0 || __i >= __t->base.u.length)
3250 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3251 return &CONST_CAST_TREE (__t)->vec.a[__i];
3254 # if GCC_VERSION >= 4006
3255 #pragma GCC diagnostic pop
3259 omp_clause_elt_check (tree __t, int __i,
3260 const char *__f, int __l, const char *__g)
3262 if (TREE_CODE (__t) != OMP_CLAUSE)
3263 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3264 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3265 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3266 return &__t->omp_clause.ops[__i];
3269 /* These checks have to be special cased. */
3272 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3274 if (!ANY_INTEGRAL_TYPE_P (__t))
3275 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3281 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3284 if (TREE_CODE (__t) != __c)
3285 tree_check_failed (__t, __f, __l, __g, __c, 0);
3290 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3293 if (TREE_CODE (__t) == __c)
3294 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3299 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3300 enum tree_code __c1, enum tree_code __c2)
3302 if (TREE_CODE (__t) != __c1
3303 && TREE_CODE (__t) != __c2)
3304 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3309 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3310 enum tree_code __c1, enum tree_code __c2)
3312 if (TREE_CODE (__t) == __c1
3313 || TREE_CODE (__t) == __c2)
3314 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3319 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3320 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3322 if (TREE_CODE (__t) != __c1
3323 && TREE_CODE (__t) != __c2
3324 && TREE_CODE (__t) != __c3)
3325 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3330 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3331 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3333 if (TREE_CODE (__t) == __c1
3334 || TREE_CODE (__t) == __c2
3335 || TREE_CODE (__t) == __c3)
3336 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3341 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3342 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3343 enum tree_code __c4)
3345 if (TREE_CODE (__t) != __c1
3346 && TREE_CODE (__t) != __c2
3347 && TREE_CODE (__t) != __c3
3348 && TREE_CODE (__t) != __c4)
3349 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3354 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3355 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3356 enum tree_code __c4)
3358 if (TREE_CODE (__t) == __c1
3359 || TREE_CODE (__t) == __c2
3360 || TREE_CODE (__t) == __c3
3361 || TREE_CODE (__t) == __c4)
3362 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3367 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3368 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3369 enum tree_code __c4, enum tree_code __c5)
3371 if (TREE_CODE (__t) != __c1
3372 && TREE_CODE (__t) != __c2
3373 && TREE_CODE (__t) != __c3
3374 && TREE_CODE (__t) != __c4
3375 && TREE_CODE (__t) != __c5)
3376 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3381 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3382 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3383 enum tree_code __c4, enum tree_code __c5)
3385 if (TREE_CODE (__t) == __c1
3386 || TREE_CODE (__t) == __c2
3387 || TREE_CODE (__t) == __c3
3388 || TREE_CODE (__t) == __c4
3389 || TREE_CODE (__t) == __c5)
3390 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3395 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3396 const char *__f, int __l, const char *__g)
3398 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3399 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3404 tree_class_check (const_tree __t, const enum tree_code_class __class,
3405 const char *__f, int __l, const char *__g)
3407 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3408 tree_class_check_failed (__t, __class, __f, __l, __g);
3413 tree_range_check (const_tree __t,
3414 enum tree_code __code1, enum tree_code __code2,
3415 const char *__f, int __l, const char *__g)
3417 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3418 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3423 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3424 const char *__f, int __l, const char *__g)
3426 if (TREE_CODE (__t) != OMP_CLAUSE)
3427 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3428 if (__t->omp_clause.code != __code)
3429 omp_clause_check_failed (__t, __f, __l, __g, __code);
3434 omp_clause_range_check (const_tree __t,
3435 enum omp_clause_code __code1,
3436 enum omp_clause_code __code2,
3437 const char *__f, int __l, const char *__g)
3439 if (TREE_CODE (__t) != OMP_CLAUSE)
3440 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3441 if ((int) __t->omp_clause.code < (int) __code1
3442 || (int) __t->omp_clause.code > (int) __code2)
3443 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3448 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3450 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3451 if (!IS_EXPR_CODE_CLASS (__c))
3452 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3457 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3460 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3464 # if GCC_VERSION >= 4006
3465 #pragma GCC diagnostic push
3466 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3470 tree_vec_elt_check (const_tree __t, int __i,
3471 const char *__f, int __l, const char *__g)
3473 if (TREE_CODE (__t) != TREE_VEC)
3474 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3475 if (__i < 0 || __i >= __t->base.u.length)
3476 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3477 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3478 //return &__t->vec.a[__i];
3481 # if GCC_VERSION >= 4006
3482 #pragma GCC diagnostic pop
3486 omp_clause_elt_check (const_tree __t, int __i,
3487 const char *__f, int __l, const char *__g)
3489 if (TREE_CODE (__t) != OMP_CLAUSE)
3490 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3491 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3492 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3493 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3497 any_integral_type_check (const_tree __t, const char *__f, int __l,
3500 if (!ANY_INTEGRAL_TYPE_P (__t))
3501 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3508 /* Compute the number of operands in an expression node NODE. For
3509 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3510 otherwise it is looked up from the node's code. */
3512 tree_operand_length (const_tree node)
3514 if (VL_EXP_CLASS_P (node))
3515 return VL_EXP_OPERAND_LENGTH (node);
3517 return TREE_CODE_LENGTH (TREE_CODE (node));
3520 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3522 /* Special checks for TREE_OPERANDs. */
3524 tree_operand_check (tree __t, int __i,
3525 const char *__f, int __l, const char *__g)
3527 const_tree __u = EXPR_CHECK (__t);
3528 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3529 tree_operand_check_failed (__i, __u, __f, __l, __g);
3530 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3534 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3535 const char *__f, int __l, const char *__g)
3537 if (TREE_CODE (__t) != __code)
3538 tree_check_failed (__t, __f, __l, __g, __code, 0);
3539 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3540 tree_operand_check_failed (__i, __t, __f, __l, __g);
3541 return &__t->exp.operands[__i];
3545 tree_operand_check (const_tree __t, int __i,
3546 const char *__f, int __l, const char *__g)
3548 const_tree __u = EXPR_CHECK (__t);
3549 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3550 tree_operand_check_failed (__i, __u, __f, __l, __g);
3551 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3555 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3556 const char *__f, int __l, const char *__g)
3558 if (TREE_CODE (__t) != __code)
3559 tree_check_failed (__t, __f, __l, __g, __code, 0);
3560 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3561 tree_operand_check_failed (__i, __t, __f, __l, __g);
3562 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3567 #define error_mark_node global_trees[TI_ERROR_MARK]
3569 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3570 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3571 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3572 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3573 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3575 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3576 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3577 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3578 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3579 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3581 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3582 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3583 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3584 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3585 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3587 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3588 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3589 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3591 #define void_node global_trees[TI_VOID]
3593 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3594 #define integer_one_node global_trees[TI_INTEGER_ONE]
3595 #define integer_three_node global_trees[TI_INTEGER_THREE]
3596 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3597 #define size_zero_node global_trees[TI_SIZE_ZERO]
3598 #define size_one_node global_trees[TI_SIZE_ONE]
3599 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3600 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3601 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3603 /* Base access nodes. */
3604 #define access_public_node global_trees[TI_PUBLIC]
3605 #define access_protected_node global_trees[TI_PROTECTED]
3606 #define access_private_node global_trees[TI_PRIVATE]
3608 #define null_pointer_node global_trees[TI_NULL_POINTER]
3610 #define float_type_node global_trees[TI_FLOAT_TYPE]
3611 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3612 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3614 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3615 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3616 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3617 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3619 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3620 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3621 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3622 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3624 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3626 #define void_type_node global_trees[TI_VOID_TYPE]
3627 /* The C type `void *'. */
3628 #define ptr_type_node global_trees[TI_PTR_TYPE]
3629 /* The C type `const void *'. */
3630 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3631 /* The C type `size_t'. */
3632 #define size_type_node global_trees[TI_SIZE_TYPE]
3633 #define pid_type_node global_trees[TI_PID_TYPE]
3634 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3635 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3636 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3637 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3638 /* The C type `FILE *'. */
3639 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3640 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3642 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3643 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3644 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3646 /* The decimal floating point types. */
3647 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3648 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3649 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3650 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3651 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3652 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3654 /* The fixed-point types. */
3655 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3656 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3657 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3658 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3659 #define sat_unsigned_short_fract_type_node \
3660 global_trees[TI_SAT_USFRACT_TYPE]
3661 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3662 #define sat_unsigned_long_fract_type_node \
3663 global_trees[TI_SAT_ULFRACT_TYPE]
3664 #define sat_unsigned_long_long_fract_type_node \
3665 global_trees[TI_SAT_ULLFRACT_TYPE]
3666 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3667 #define fract_type_node global_trees[TI_FRACT_TYPE]
3668 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3669 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3670 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3671 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3672 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3673 #define unsigned_long_long_fract_type_node \
3674 global_trees[TI_ULLFRACT_TYPE]
3675 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3676 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3677 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3678 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3679 #define sat_unsigned_short_accum_type_node \
3680 global_trees[TI_SAT_USACCUM_TYPE]
3681 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3682 #define sat_unsigned_long_accum_type_node \
3683 global_trees[TI_SAT_ULACCUM_TYPE]
3684 #define sat_unsigned_long_long_accum_type_node \
3685 global_trees[TI_SAT_ULLACCUM_TYPE]
3686 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3687 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3688 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3689 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3690 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3691 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3692 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3693 #define unsigned_long_long_accum_type_node \
3694 global_trees[TI_ULLACCUM_TYPE]
3695 #define qq_type_node global_trees[TI_QQ_TYPE]
3696 #define hq_type_node global_trees[TI_HQ_TYPE]
3697 #define sq_type_node global_trees[TI_SQ_TYPE]
3698 #define dq_type_node global_trees[TI_DQ_TYPE]
3699 #define tq_type_node global_trees[TI_TQ_TYPE]
3700 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3701 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3702 #define usq_type_node global_trees[TI_USQ_TYPE]
3703 #define udq_type_node global_trees[TI_UDQ_TYPE]
3704 #define utq_type_node global_trees[TI_UTQ_TYPE]
3705 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3706 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3707 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3708 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3709 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3710 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3711 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3712 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3713 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3714 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3715 #define ha_type_node global_trees[TI_HA_TYPE]
3716 #define sa_type_node global_trees[TI_SA_TYPE]
3717 #define da_type_node global_trees[TI_DA_TYPE]
3718 #define ta_type_node global_trees[TI_TA_TYPE]
3719 #define uha_type_node global_trees[TI_UHA_TYPE]
3720 #define usa_type_node global_trees[TI_USA_TYPE]
3721 #define uda_type_node global_trees[TI_UDA_TYPE]
3722 #define uta_type_node global_trees[TI_UTA_TYPE]
3723 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3724 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3725 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3726 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3727 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3728 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3729 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3730 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3732 /* The node that should be placed at the end of a parameter list to
3733 indicate that the function does not take a variable number of
3734 arguments. The TREE_VALUE will be void_type_node and there will be
3735 no TREE_CHAIN. Language-independent code should not assume
3736 anything else about this node. */
3737 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3739 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3740 #define MAIN_NAME_P(NODE) \
3741 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3743 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3745 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3746 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3748 /* Default/current target options (TARGET_OPTION_NODE). */
3749 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3750 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3752 /* Default tree list option(), optimize() pragmas to be linked into the
3754 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3755 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3757 #define char_type_node integer_types[itk_char]
3758 #define signed_char_type_node integer_types[itk_signed_char]
3759 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3760 #define short_integer_type_node integer_types[itk_short]
3761 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3762 #define integer_type_node integer_types[itk_int]
3763 #define unsigned_type_node integer_types[itk_unsigned_int]
3764 #define long_integer_type_node integer_types[itk_long]
3765 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3766 #define long_long_integer_type_node integer_types[itk_long_long]
3767 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3769 /* True if NODE is an erroneous expression. */
3771 #define error_operand_p(NODE) \
3772 ((NODE) == error_mark_node \
3773 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3775 extern tree decl_assembler_name (tree);
3776 extern tree decl_comdat_group (const_tree);
3777 extern tree decl_comdat_group_id (const_tree);
3778 extern const char *decl_section_name (const_tree);
3779 extern void set_decl_section_name (tree, const char *);
3780 extern enum tls_model decl_tls_model (const_tree);
3781 extern void set_decl_tls_model (tree, enum tls_model);
3783 /* Compute the number of bytes occupied by 'node'. This routine only
3784 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3786 extern size_t tree_size (const_tree);
3788 /* Compute the number of bytes occupied by a tree with code CODE.
3789 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3790 which are of variable length. */
3791 extern size_t tree_code_size (enum tree_code);
3793 /* Allocate and return a new UID from the DECL_UID namespace. */
3794 extern int allocate_decl_uid (void);
3796 /* Lowest level primitive for allocating a node.
3797 The TREE_CODE is the only argument. Contents are initialized
3798 to zero except for a few of the common fields. */
3800 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3801 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3803 /* Free tree node. */
3805 extern void free_node (tree);
3807 /* Make a copy of a node, with all the same contents. */
3809 extern tree copy_node_stat (tree MEM_STAT_DECL);
3810 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3812 /* Make a copy of a chain of TREE_LIST nodes. */
3814 extern tree copy_list (tree);
3816 /* Make a CASE_LABEL_EXPR. */
3818 extern tree build_case_label (tree, tree, tree);
3821 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3822 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3824 /* Make an INTEGER_CST. */
3826 extern tree make_int_cst_stat (int, int MEM_STAT_DECL);
3827 #define make_int_cst(LEN, EXT_LEN) \
3828 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3830 /* Make a TREE_VEC. */
3832 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3833 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3835 /* Grow a TREE_VEC. */
3837 extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3838 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3840 /* Construct various types of nodes. */
3842 extern tree build_nt (enum tree_code, ...);
3843 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3845 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3846 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3847 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3848 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3849 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3850 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3851 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3852 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3853 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3854 tree MEM_STAT_DECL);
3855 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3856 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3857 tree MEM_STAT_DECL);
3858 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3860 /* _loc versions of build[1-5]. */
3863 build1_stat_loc (location_t loc, enum tree_code code, tree type,
3864 tree arg1 MEM_STAT_DECL)
3866 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3867 if (CAN_HAVE_LOCATION_P (t))
3868 SET_EXPR_LOCATION (t, loc);
3871 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3874 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3875 tree arg1 MEM_STAT_DECL)
3877 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3878 if (CAN_HAVE_LOCATION_P (t))
3879 SET_EXPR_LOCATION (t, loc);
3882 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3885 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3886 tree arg1, tree arg2 MEM_STAT_DECL)
3888 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3889 if (CAN_HAVE_LOCATION_P (t))
3890 SET_EXPR_LOCATION (t, loc);
3893 #define build3_loc(l,c,t1,t2,t3,t4) \
3894 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3897 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3898 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3900 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3901 if (CAN_HAVE_LOCATION_P (t))
3902 SET_EXPR_LOCATION (t, loc);
3905 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3906 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3909 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3910 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3912 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3913 arg4 PASS_MEM_STAT);
3914 if (CAN_HAVE_LOCATION_P (t))
3915 SET_EXPR_LOCATION (t, loc);
3918 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3919 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3921 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3922 #define build_var_debug_value(t1,t2) \
3923 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3925 /* Constructs double_int from tree CST. */
3927 extern tree double_int_to_tree (tree, double_int);
3929 extern tree wide_int_to_tree (tree type, const wide_int_ref &cst);
3930 extern tree force_fit_type (tree, const wide_int_ref &, int, bool);
3932 /* Create an INT_CST node with a CST value zero extended. */
3935 extern tree build_int_cst (tree, HOST_WIDE_INT);
3936 extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst);
3937 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3938 extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3939 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3940 extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3941 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3942 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3943 extern tree build_vector_from_val (tree, tree);
3944 extern void recompute_constructor_flags (tree);
3945 extern void verify_constructor_flags (tree);
3946 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3947 extern tree build_constructor_single (tree, tree, tree);
3948 extern tree build_constructor_from_list (tree, tree);
3949 extern tree build_constructor_va (tree, int, ...);
3950 extern tree build_real_from_int_cst (tree, const_tree);
3951 extern tree build_complex (tree, tree, tree);
3952 extern tree build_complex_inf (tree, bool);
3953 extern tree build_each_one_cst (tree);
3954 extern tree build_one_cst (tree);
3955 extern tree build_minus_one_cst (tree);
3956 extern tree build_all_ones_cst (tree);
3957 extern tree build_zero_cst (tree);
3958 extern tree build_string (int, const char *);
3959 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3960 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3961 extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3962 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3963 extern tree build_decl_stat (location_t, enum tree_code,
3964 tree, tree MEM_STAT_DECL);
3965 extern tree build_fn_decl (const char *, tree);
3966 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3967 extern tree build_translation_unit_decl (tree);
3968 extern tree build_block (tree, tree, tree, tree);
3969 extern tree build_empty_stmt (location_t);
3970 extern tree build_omp_clause (location_t, enum omp_clause_code);
3972 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3973 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3975 extern tree build_call_nary (tree, tree, int, ...);
3976 extern tree build_call_valist (tree, tree, int, va_list);
3977 #define build_call_array(T1,T2,N,T3)\
3978 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3979 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3980 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3981 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
3982 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
3983 extern tree build_call_expr_loc (location_t, tree, int, ...);
3984 extern tree build_call_expr (tree, int, ...);
3985 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3987 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3989 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
3991 extern tree build_string_literal (int, const char *);
3993 /* Construct various nodes representing data types. */
3995 extern tree signed_or_unsigned_type_for (int, tree);
3996 extern tree signed_type_for (tree);
3997 extern tree unsigned_type_for (tree);
3998 extern tree truth_type_for (tree);
3999 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
4000 extern tree build_pointer_type (tree);
4001 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
4002 extern tree build_reference_type (tree);
4003 extern tree build_vector_type_for_mode (tree, machine_mode);
4004 extern tree build_vector_type (tree innertype, int nunits);
4005 extern tree build_truth_vector_type (unsigned, unsigned);
4006 extern tree build_same_sized_truth_vector_type (tree vectype);
4007 extern tree build_opaque_vector_type (tree innertype, int nunits);
4008 extern tree build_index_type (tree);
4009 extern tree build_array_type (tree, tree);
4010 extern tree build_nonshared_array_type (tree, tree);
4011 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
4012 extern tree build_function_type (tree, tree);
4013 extern tree build_function_type_list (tree, ...);
4014 extern tree build_varargs_function_type_list (tree, ...);
4015 extern tree build_function_type_array (tree, int, tree *);
4016 extern tree build_varargs_function_type_array (tree, int, tree *);
4017 #define build_function_type_vec(RET, V) \
4018 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4019 #define build_varargs_function_type_vec(RET, V) \
4020 build_varargs_function_type_array (RET, vec_safe_length (V), \
4021 vec_safe_address (V))
4022 extern tree build_method_type_directly (tree, tree, tree);
4023 extern tree build_method_type (tree, tree);
4024 extern tree build_offset_type (tree, tree);
4025 extern tree build_complex_type (tree, bool named = false);
4026 extern tree array_type_nelts (const_tree);
4028 extern tree value_member (tree, tree);
4029 extern tree purpose_member (const_tree, tree);
4030 extern bool vec_member (const_tree, vec<tree, va_gc> *);
4031 extern tree chain_index (int, tree);
4033 extern int attribute_list_equal (const_tree, const_tree);
4034 extern int attribute_list_contained (const_tree, const_tree);
4035 extern int tree_int_cst_equal (const_tree, const_tree);
4037 extern bool tree_fits_shwi_p (const_tree)
4038 #ifndef ENABLE_TREE_CHECKING
4039 ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */
4042 extern bool tree_fits_uhwi_p (const_tree)
4043 #ifndef ENABLE_TREE_CHECKING
4044 ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */
4047 extern HOST_WIDE_INT tree_to_shwi (const_tree);
4048 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
4049 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4050 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4051 tree_to_shwi (const_tree t)
4053 gcc_assert (tree_fits_shwi_p (t));
4054 return TREE_INT_CST_LOW (t);
4057 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
4058 tree_to_uhwi (const_tree t)
4060 gcc_assert (tree_fits_uhwi_p (t));
4061 return TREE_INT_CST_LOW (t);
4064 extern int tree_int_cst_sgn (const_tree);
4065 extern int tree_int_cst_sign_bit (const_tree);
4066 extern unsigned int tree_int_cst_min_precision (tree, signop);
4067 extern tree strip_array_types (tree);
4068 extern tree excess_precision_type (tree);
4069 extern bool valid_constant_size_p (const_tree);
4072 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4073 put the prototype here. Rtl.h does declare the prototype if
4074 tree.h had been included. */
4076 extern tree make_tree (tree, rtx);
4078 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4081 Such modified types already made are recorded so that duplicates
4084 extern tree build_type_attribute_variant (tree, tree);
4085 extern tree build_decl_attribute_variant (tree, tree);
4086 extern tree build_type_attribute_qual_variant (tree, tree, int);
4088 extern bool attribute_value_equal (const_tree, const_tree);
4090 /* Return 0 if the attributes for two types are incompatible, 1 if they
4091 are compatible, and 2 if they are nearly compatible (which causes a
4092 warning to be generated). */
4093 extern int comp_type_attributes (const_tree, const_tree);
4095 /* Default versions of target-overridable functions. */
4096 extern tree merge_decl_attributes (tree, tree);
4097 extern tree merge_type_attributes (tree, tree);
4099 /* This function is a private implementation detail of lookup_attribute()
4100 and you should never call it directly. */
4101 extern tree private_lookup_attribute (const char *, size_t, tree);
4103 /* This function is a private implementation detail
4104 of lookup_attribute_by_prefix() and you should never call it directly. */
4105 extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree);
4107 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4108 return a pointer to the attribute's list element if the attribute
4109 is part of the list, or NULL_TREE if not found. If the attribute
4110 appears more than once, this only returns the first occurrence; the
4111 TREE_CHAIN of the return value should be passed back in if further
4112 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4116 lookup_attribute (const char *attr_name, tree list)
4118 gcc_checking_assert (attr_name[0] != '_');
4119 /* In most cases, list is NULL_TREE. */
4120 if (list == NULL_TREE)
4123 /* Do the strlen() before calling the out-of-line implementation.
4124 In most cases attr_name is a string constant, and the compiler
4125 will optimize the strlen() away. */
4126 return private_lookup_attribute (attr_name, strlen (attr_name), list);
4129 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4130 return a pointer to the attribute's list first element if the attribute
4131 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
4135 lookup_attribute_by_prefix (const char *attr_name, tree list)
4137 gcc_checking_assert (attr_name[0] != '_');
4138 /* In most cases, list is NULL_TREE. */
4139 if (list == NULL_TREE)
4142 return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name),
4147 /* This function is a private implementation detail of
4148 is_attribute_p() and you should never call it directly. */
4149 extern bool private_is_attribute_p (const char *, size_t, const_tree);
4151 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4152 if the identifier node is a valid attribute name for the string.
4153 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4154 be the identifier for 'text' or for '__text__'. */
4157 is_attribute_p (const char *attr_name, const_tree ident)
4159 gcc_checking_assert (attr_name[0] != '_');
4160 /* Do the strlen() before calling the out-of-line implementation.
4161 In most cases attr_name is a string constant, and the compiler
4162 will optimize the strlen() away. */
4163 return private_is_attribute_p (attr_name, strlen (attr_name), ident);
4166 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4167 modified list. ATTR_NAME must be in the form 'text' (not
4170 extern tree remove_attribute (const char *, tree);
4172 /* Given two attributes lists, return a list of their union. */
4174 extern tree merge_attributes (tree, tree);
4176 /* Given two Windows decl attributes lists, possibly including
4177 dllimport, return a list of their union . */
4178 extern tree merge_dllimport_decl_attributes (tree, tree);
4180 /* Handle a "dllimport" or "dllexport" attribute. */
4181 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4183 /* Returns true iff unqualified CAND and BASE are equivalent. */
4185 extern bool check_base_type (const_tree cand, const_tree base);
4187 /* Check whether CAND is suitable to be returned from get_qualified_type
4188 (BASE, TYPE_QUALS). */
4190 extern bool check_qualified_type (const_tree, const_tree, int);
4192 /* Return a version of the TYPE, qualified as indicated by the
4193 TYPE_QUALS, if one exists. If no qualified version exists yet,
4194 return NULL_TREE. */
4196 extern tree get_qualified_type (tree, int);
4198 /* Like get_qualified_type, but creates the type if it does not
4199 exist. This function never returns NULL_TREE. */
4201 extern tree build_qualified_type (tree, int);
4203 /* Create a variant of type T with alignment ALIGN. */
4205 extern tree build_aligned_type (tree, unsigned int);
4207 /* Like build_qualified_type, but only deals with the `const' and
4208 `volatile' qualifiers. This interface is retained for backwards
4209 compatibility with the various front-ends; new code should use
4210 build_qualified_type instead. */
4212 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4213 build_qualified_type ((TYPE), \
4214 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4215 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4217 /* Make a copy of a type node. */
4219 extern tree build_distinct_type_copy (tree);
4220 extern tree build_variant_type_copy (tree);
4222 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4223 return a canonicalized ..._TYPE node, so that duplicates are not made.
4224 How the hash code is computed is up to the caller, as long as any two
4225 callers that could hash identical-looking type nodes agree. */
4227 extern tree type_hash_canon (unsigned int, tree);
4229 extern tree convert (tree, tree);
4230 extern unsigned int expr_align (const_tree);
4231 extern tree size_in_bytes (const_tree);
4232 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4233 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4234 extern tree bit_position (const_tree);
4235 extern tree byte_position (const_tree);
4236 extern HOST_WIDE_INT int_byte_position (const_tree);
4238 #define sizetype sizetype_tab[(int) stk_sizetype]
4239 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4240 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4241 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4242 #define size_int(L) size_int_kind (L, stk_sizetype)
4243 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4244 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4245 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4247 /* Type for sizes of data-type. */
4249 #define BITS_PER_UNIT_LOG \
4250 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4251 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4252 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4254 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4255 by making the last node in X point to Y.
4256 Returns X, except if X is 0 returns Y. */
4258 extern tree chainon (tree, tree);
4260 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4262 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4263 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4265 /* Return the last tree node in a chain. */
4267 extern tree tree_last (tree);
4269 /* Reverse the order of elements in a chain, and return the new head. */
4271 extern tree nreverse (tree);
4273 /* Returns the length of a chain of nodes
4274 (number of chain pointers to follow before reaching a null pointer). */
4276 extern int list_length (const_tree);
4278 /* Returns the first FIELD_DECL in a type. */
4280 extern tree first_field (const_tree);
4282 /* Given an initializer INIT, return TRUE if INIT is zero or some
4283 aggregate of zeros. Otherwise return FALSE. */
4285 extern bool initializer_zerop (const_tree);
4287 /* Given a vector VEC, return its first element if all elements are
4288 the same. Otherwise return NULL_TREE. */
4290 extern tree uniform_vector_p (const_tree);
4292 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4294 extern vec<tree, va_gc> *ctor_to_vec (tree);
4296 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4298 extern int zerop (const_tree);
4300 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4302 extern int integer_zerop (const_tree);
4304 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4306 extern int integer_onep (const_tree);
4308 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4309 a vector or complex where each part is 1. */
4311 extern int integer_each_onep (const_tree);
4313 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4314 all of whose significant bits are 1. */
4316 extern int integer_all_onesp (const_tree);
4318 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4321 extern int integer_minus_onep (const_tree);
4323 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4324 exactly one bit 1. */
4326 extern int integer_pow2p (const_tree);
4328 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4329 with a nonzero value. */
4331 extern int integer_nonzerop (const_tree);
4333 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4334 a vector where each element is an integer constant of value -1. */
4336 extern int integer_truep (const_tree);
4338 extern bool cst_and_fits_in_hwi (const_tree);
4339 extern tree num_ending_zeros (const_tree);
4341 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4344 extern int fixed_zerop (const_tree);
4346 /* staticp (tree x) is nonzero if X is a reference to data allocated
4347 at a fixed address in memory. Returns the outermost data. */
4349 extern tree staticp (tree);
4351 /* save_expr (EXP) returns an expression equivalent to EXP
4352 but it can be used multiple times within context CTX
4353 and only evaluate EXP once. */
4355 extern tree save_expr (tree);
4357 /* Return true if T is function-invariant. */
4359 extern bool tree_invariant_p (tree);
4361 /* Look inside EXPR into any simple arithmetic operations. Return the
4362 outermost non-arithmetic or non-invariant node. */
4364 extern tree skip_simple_arithmetic (tree);
4366 /* Look inside EXPR into simple arithmetic operations involving constants.
4367 Return the outermost non-arithmetic or non-constant node. */
4369 extern tree skip_simple_constant_arithmetic (tree);
4371 /* Return which tree structure is used by T. */
4373 enum tree_node_structure_enum tree_node_structure (const_tree);
4375 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4376 size or offset that depends on a field within a record. */
4378 extern bool contains_placeholder_p (const_tree);
4380 /* This macro calls the above function but short-circuits the common
4381 case of a constant to save time. Also check for null. */
4383 #define CONTAINS_PLACEHOLDER_P(EXP) \
4384 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4386 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4387 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4390 extern bool type_contains_placeholder_p (tree);
4392 /* Given a tree EXP, find all occurrences of references to fields
4393 in a PLACEHOLDER_EXPR and place them in vector REFS without
4394 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4395 we assume here that EXP contains only arithmetic expressions
4396 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4399 extern void find_placeholder_in_expr (tree, vec<tree> *);
4401 /* This macro calls the above function but short-circuits the common
4402 case of a constant to save time and also checks for NULL. */
4404 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4406 if((EXP) && !TREE_CONSTANT (EXP)) \
4407 find_placeholder_in_expr (EXP, V); \
4410 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4411 return a tree with all occurrences of references to F in a
4412 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4413 CONST_DECLs. Note that we assume here that EXP contains only
4414 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4415 occurring only in their argument list. */
4417 extern tree substitute_in_expr (tree, tree, tree);
4419 /* This macro calls the above function but short-circuits the common
4420 case of a constant to save time and also checks for NULL. */
4422 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4423 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4425 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4426 for it within OBJ, a tree that is an object or a chain of references. */
4428 extern tree substitute_placeholder_in_expr (tree, tree);
4430 /* This macro calls the above function but short-circuits the common
4431 case of a constant to save time and also checks for NULL. */
4433 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4434 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4435 : substitute_placeholder_in_expr (EXP, OBJ))
4438 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4439 but it can be used multiple times
4440 and only evaluate the subexpressions once. */
4442 extern tree stabilize_reference (tree);
4444 /* Return EXP, stripped of any conversions to wider types
4445 in such a way that the result of converting to type FOR_TYPE
4446 is the same as if EXP were converted to FOR_TYPE.
4447 If FOR_TYPE is 0, it signifies EXP's type. */
4449 extern tree get_unwidened (tree, tree);
4451 /* Return OP or a simpler expression for a narrower value
4452 which can be sign-extended or zero-extended to give back OP.
4453 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4454 or 0 if the value should be sign-extended. */
4456 extern tree get_narrower (tree, int *);
4458 /* Return true if T is an expression that get_inner_reference handles. */
4461 handled_component_p (const_tree t)
4463 switch (TREE_CODE (t))
4468 case ARRAY_RANGE_REF:
4471 case VIEW_CONVERT_EXPR:
4479 /* Return true T is a component with reverse storage order. */
4482 reverse_storage_order_for_component_p (tree t)
4484 /* The storage order only applies to scalar components. */
4485 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) || VECTOR_TYPE_P (TREE_TYPE (t)))
4488 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
4489 t = TREE_OPERAND (t, 0);
4491 switch (TREE_CODE (t))
4495 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4496 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4497 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
4498 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
4502 return REF_REVERSE_STORAGE_ORDER (t);
4504 case ARRAY_RANGE_REF:
4505 case VIEW_CONVERT_EXPR:
4513 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4514 that can modify the storage order of objects. Note that, even if the
4515 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4516 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4517 it can change the partition of the aggregate object into scalars. */
4520 storage_order_barrier_p (const_tree t)
4522 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
4525 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4526 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
4529 tree op = TREE_OPERAND (t, 0);
4531 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
4532 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
4538 /* Given a DECL or TYPE, return the scope in which it was declared, or
4539 NUL_TREE if there is no containing scope. */
4541 extern tree get_containing_scope (const_tree);
4543 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4545 extern tree decl_function_context (const_tree);
4547 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4548 this _DECL with its context, or zero if none. */
4549 extern tree decl_type_context (const_tree);
4551 /* Return 1 if EXPR is the real constant zero. */
4552 extern int real_zerop (const_tree);
4554 /* Initialize the iterator I with arguments from function FNDECL */
4557 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4559 i->next = TYPE_ARG_TYPES (fntype);
4562 /* Return a pointer that holds the next argument if there are more arguments to
4563 handle, otherwise return NULL. */
4565 static inline tree *
4566 function_args_iter_cond_ptr (function_args_iterator *i)
4568 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4571 /* Return the next argument if there are more arguments to handle, otherwise
4575 function_args_iter_cond (function_args_iterator *i)
4577 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4580 /* Advance to the next argument. */
4582 function_args_iter_next (function_args_iterator *i)
4584 gcc_assert (i->next != NULL_TREE);
4585 i->next = TREE_CHAIN (i->next);
4588 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4591 inlined_function_outer_scope_p (const_tree block)
4593 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4596 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4597 to point to the next tree element. ITER is an instance of
4598 function_args_iterator used to iterate the arguments. */
4599 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4600 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4601 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4602 function_args_iter_next (&(ITER)))
4604 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4605 to the next tree element. ITER is an instance of function_args_iterator
4606 used to iterate the arguments. */
4607 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4608 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4609 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4610 function_args_iter_next (&(ITER)))
4613 extern unsigned crc32_string (unsigned, const char *);
4614 extern unsigned crc32_byte (unsigned, char);
4615 extern unsigned crc32_unsigned (unsigned, unsigned);
4616 extern void clean_symbol_name (char *);
4617 extern tree get_file_function_name (const char *);
4618 extern tree get_callee_fndecl (const_tree);
4619 extern combined_fn get_call_combined_fn (const_tree);
4620 extern int type_num_arguments (const_tree);
4621 extern bool associative_tree_code (enum tree_code);
4622 extern bool commutative_tree_code (enum tree_code);
4623 extern bool commutative_ternary_tree_code (enum tree_code);
4624 extern bool operation_can_overflow (enum tree_code);
4625 extern bool operation_no_trapping_overflow (tree, enum tree_code);
4626 extern tree upper_bound_in_type (tree, tree);
4627 extern tree lower_bound_in_type (tree, tree);
4628 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4629 extern tree create_artificial_label (location_t);
4630 extern const char *get_name (tree);
4631 extern bool stdarg_p (const_tree);
4632 extern bool prototype_p (const_tree);
4633 extern bool is_typedef_decl (const_tree x);
4634 extern bool typedef_variant_p (const_tree);
4635 extern bool auto_var_in_fn_p (const_tree, const_tree);
4636 extern tree build_low_bits_mask (tree, unsigned);
4637 extern bool tree_nop_conversion_p (const_tree, const_tree);
4638 extern tree tree_strip_nop_conversions (tree);
4639 extern tree tree_strip_sign_nop_conversions (tree);
4640 extern const_tree strip_invariant_refs (const_tree);
4641 extern tree lhd_gcc_personality (void);
4642 extern void assign_assembler_name_if_neeeded (tree);
4643 extern void warn_deprecated_use (tree, tree);
4644 extern void cache_integer_cst (tree);
4645 extern const char *combined_fn_name (combined_fn);
4647 /* Compare and hash for any structure which begins with a canonical
4648 pointer. Assumes all pointers are interchangeable, which is sort
4649 of already assumed by gcc elsewhere IIRC. */
4652 struct_ptr_eq (const void *a, const void *b)
4654 const void * const * x = (const void * const *) a;
4655 const void * const * y = (const void * const *) b;
4659 static inline hashval_t
4660 struct_ptr_hash (const void *a)
4662 const void * const * x = (const void * const *) a;
4663 return (intptr_t)*x >> 4;
4666 /* Return nonzero if CODE is a tree code that represents a truth value. */
4668 truth_value_p (enum tree_code code)
4670 return (TREE_CODE_CLASS (code) == tcc_comparison
4671 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4672 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4673 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4676 /* Return whether TYPE is a type suitable for an offset for
4677 a POINTER_PLUS_EXPR. */
4679 ptrofftype_p (tree type)
4681 return (INTEGRAL_TYPE_P (type)
4682 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4683 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4686 /* Return true if the argument is a complete type or an array
4687 of unknown bound (whose type is incomplete but) whose elements
4688 have complete type. */
4690 complete_or_array_type_p (const_tree type)
4692 return COMPLETE_TYPE_P (type)
4693 || (TREE_CODE (type) == ARRAY_TYPE
4694 && COMPLETE_TYPE_P (TREE_TYPE (type)));
4697 extern tree strip_float_extensions (tree);
4698 extern int really_constant_p (const_tree);
4699 extern bool decl_address_invariant_p (const_tree);
4700 extern bool decl_address_ip_invariant_p (const_tree);
4701 extern bool int_fits_type_p (const_tree, const_tree);
4702 #ifndef GENERATOR_FILE
4703 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4705 extern bool variably_modified_type_p (tree, tree);
4706 extern int tree_log2 (const_tree);
4707 extern int tree_floor_log2 (const_tree);
4708 extern unsigned int tree_ctz (const_tree);
4709 extern int simple_cst_equal (const_tree, const_tree);
4714 extern void add_expr (const_tree, hash &);
4718 /* Compat version until all callers are converted. Return hash for
4720 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
4722 inchash::hash hstate (seed);
4723 inchash::add_expr (tree, hstate);
4724 return hstate.end ();
4727 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4728 extern int type_list_equal (const_tree, const_tree);
4729 extern int chain_member (const_tree, const_tree);
4730 extern void dump_tree_statistics (void);
4731 extern void recompute_tree_invariant_for_addr_expr (tree);
4732 extern bool needs_to_live_in_memory (const_tree);
4733 extern tree reconstruct_complex_type (tree, tree);
4734 extern int real_onep (const_tree);
4735 extern int real_minus_onep (const_tree);
4736 extern void init_ttree (void);
4737 extern void build_common_tree_nodes (bool);
4738 extern void build_common_builtin_nodes (void);
4739 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4740 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
4741 extern tree build_range_type (tree, tree, tree);
4742 extern tree build_nonshared_range_type (tree, tree, tree);
4743 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4744 extern HOST_WIDE_INT int_cst_value (const_tree);
4745 extern tree tree_block (tree);
4746 extern void tree_set_block (tree, tree);
4747 extern location_t *block_nonartificial_location (tree);
4748 extern location_t tree_nonartificial_location (tree);
4749 extern tree block_ultimate_origin (const_tree);
4750 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4751 extern bool virtual_method_call_p (const_tree);
4752 extern tree obj_type_ref_class (const_tree ref);
4753 extern bool types_same_for_odr (const_tree type1, const_tree type2,
4755 extern bool contains_bitfld_component_ref_p (const_tree);
4756 extern bool block_may_fallthru (const_tree);
4757 extern void using_eh_for_cleanups (void);
4758 extern bool using_eh_for_cleanups_p (void);
4759 extern const char *get_tree_code_name (enum tree_code);
4760 extern void set_call_expr_flags (tree, int);
4761 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
4763 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4765 #define walk_tree(a,b,c,d) \
4766 walk_tree_1 (a, b, c, d, NULL)
4767 #define walk_tree_without_duplicates(a,b,c) \
4768 walk_tree_without_duplicates_1 (a, b, c, NULL)
4770 extern tree drop_tree_overflow (tree);
4772 /* Given a memory reference expression T, return its base address.
4773 The base address of a memory reference expression is the main
4774 object being referenced. */
4775 extern tree get_base_address (tree t);
4777 /* Return a tree of sizetype representing the size, in bytes, of the element
4778 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4779 extern tree array_ref_element_size (tree);
4781 /* Return a tree representing the upper bound of the array mentioned in
4782 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4783 extern tree array_ref_up_bound (tree);
4785 /* Return a tree representing the lower bound of the array mentioned in
4786 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4787 extern tree array_ref_low_bound (tree);
4789 /* Returns true if REF is an array reference to an array at the end of
4790 a structure. If this is the case, the array may be allocated larger
4791 than its upper bound implies. */
4792 extern bool array_at_struct_end_p (tree);
4794 /* Return a tree representing the offset, in bytes, of the field referenced
4795 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4796 extern tree component_ref_field_offset (tree);
4798 extern int tree_map_base_eq (const void *, const void *);
4799 extern unsigned int tree_map_base_hash (const void *);
4800 extern int tree_map_base_marked_p (const void *);
4801 extern void DEBUG_FUNCTION verify_type (const_tree t);
4802 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
4803 bool trust_type_canonical = true);
4804 extern bool type_with_interoperable_signedness (const_tree);
4806 /* Return simplified tree code of type that is used for canonical type
4808 inline enum tree_code
4809 tree_code_for_canonical_type_merging (enum tree_code code)
4811 /* By C standard, each enumerated type shall be compatible with char,
4812 a signed integer, or an unsigned integer. The choice of type is
4813 implementation defined (in our case it depends on -fshort-enum).
4815 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
4816 type and compare only by their signedness and precision. */
4817 if (code == ENUMERAL_TYPE)
4818 return INTEGER_TYPE;
4819 /* To allow inter-operability between languages having references and
4820 C, we consider reference types and pointers alike. Note that this is
4821 not strictly necessary for C-Fortran 2008 interoperability because
4822 Fortran define C_PTR type that needs to be compatible with C pointers
4823 and we handle this one as ptr_type_node. */
4824 if (code == REFERENCE_TYPE)
4825 return POINTER_TYPE;
4829 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
4830 We don't define the types for pointers, arrays and vectors. The reason is
4831 that pointers are handled specially: ptr_type_node accesses conflict with
4832 accesses to all other pointers. This is done by alias.c.
4833 Because alias sets of arrays and vectors are the same as types of their
4834 elements, we can't compute canonical type either. Otherwise we could go
4835 form void *[10] to int *[10] (because they are equivalent for canonical type
4836 machinery) and get wrong TBAA. */
4839 canonical_type_used_p (const_tree t)
4841 return !(POINTER_TYPE_P (t)
4842 || TREE_CODE (t) == ARRAY_TYPE
4843 || TREE_CODE (t) == VECTOR_TYPE);
4846 #define tree_map_eq tree_map_base_eq
4847 extern unsigned int tree_map_hash (const void *);
4848 #define tree_map_marked_p tree_map_base_marked_p
4850 #define tree_decl_map_eq tree_map_base_eq
4851 extern unsigned int tree_decl_map_hash (const void *);
4852 #define tree_decl_map_marked_p tree_map_base_marked_p
4854 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
4856 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
4858 equal (tree_decl_map *a, tree_decl_map *b)
4860 return tree_decl_map_eq (a, b);
4864 keep_cache_entry (tree_decl_map *&m)
4866 return ggc_marked_p (m->base.from);
4870 #define tree_int_map_eq tree_map_base_eq
4871 #define tree_int_map_hash tree_map_base_hash
4872 #define tree_int_map_marked_p tree_map_base_marked_p
4874 #define tree_vec_map_eq tree_map_base_eq
4875 #define tree_vec_map_hash tree_decl_map_hash
4876 #define tree_vec_map_marked_p tree_map_base_marked_p
4878 /* Initialize the abstract argument list iterator object ITER with the
4879 arguments from CALL_EXPR node EXP. */
4881 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4884 iter->n = call_expr_nargs (exp);
4889 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4892 iter->n = call_expr_nargs (exp);
4896 /* Return the next argument from abstract argument list iterator object ITER,
4897 and advance its state. Return NULL_TREE if there are no more arguments. */
4899 next_call_expr_arg (call_expr_arg_iterator *iter)
4902 if (iter->i >= iter->n)
4904 result = CALL_EXPR_ARG (iter->t, iter->i);
4909 static inline const_tree
4910 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4913 if (iter->i >= iter->n)
4915 result = CALL_EXPR_ARG (iter->t, iter->i);
4920 /* Initialize the abstract argument list iterator object ITER, then advance
4921 past and return the first argument. Useful in for expressions, e.g.
4922 for (arg = first_call_expr_arg (exp, &iter); arg;
4923 arg = next_call_expr_arg (&iter)) */
4925 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4927 init_call_expr_arg_iterator (exp, iter);
4928 return next_call_expr_arg (iter);
4931 static inline const_tree
4932 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4934 init_const_call_expr_arg_iterator (exp, iter);
4935 return next_const_call_expr_arg (iter);
4938 /* Test whether there are more arguments in abstract argument list iterator
4939 ITER, without changing its state. */
4941 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4943 return (iter->i < iter->n);
4946 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4947 (of type call_expr_arg_iterator) to hold the iteration state. */
4948 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4949 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4950 (arg) = next_call_expr_arg (&(iter)))
4952 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4953 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4954 (arg) = next_const_call_expr_arg (&(iter)))
4956 /* Return true if tree node T is a language-specific node. */
4958 is_lang_specific (const_tree t)
4960 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4963 /* Valid builtin number. */
4964 #define BUILTIN_VALID_P(FNCODE) \
4965 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4967 /* Return the tree node for an explicit standard builtin function or NULL. */
4969 builtin_decl_explicit (enum built_in_function fncode)
4971 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4973 return builtin_info[(size_t)fncode].decl;
4976 /* Return the tree node for an implicit builtin function or NULL. */
4978 builtin_decl_implicit (enum built_in_function fncode)
4980 size_t uns_fncode = (size_t)fncode;
4981 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4983 if (!builtin_info[uns_fncode].implicit_p)
4986 return builtin_info[uns_fncode].decl;
4989 /* Set explicit builtin function nodes and whether it is an implicit
4993 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4995 size_t ufncode = (size_t)fncode;
4997 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4998 && (decl != NULL_TREE || !implicit_p));
5000 builtin_info[ufncode].decl = decl;
5001 builtin_info[ufncode].implicit_p = implicit_p;
5002 builtin_info[ufncode].declared_p = false;
5005 /* Set the implicit flag for a builtin function. */
5008 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
5010 size_t uns_fncode = (size_t)fncode;
5012 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5013 && builtin_info[uns_fncode].decl != NULL_TREE);
5015 builtin_info[uns_fncode].implicit_p = implicit_p;
5018 /* Set the declared flag for a builtin function. */
5021 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
5023 size_t uns_fncode = (size_t)fncode;
5025 gcc_checking_assert (BUILTIN_VALID_P (fncode)
5026 && builtin_info[uns_fncode].decl != NULL_TREE);
5028 builtin_info[uns_fncode].declared_p = declared_p;
5031 /* Return whether the standard builtin function can be used as an explicit
5035 builtin_decl_explicit_p (enum built_in_function fncode)
5037 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5038 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
5041 /* Return whether the standard builtin function can be used implicitly. */
5044 builtin_decl_implicit_p (enum built_in_function fncode)
5046 size_t uns_fncode = (size_t)fncode;
5048 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5049 return (builtin_info[uns_fncode].decl != NULL_TREE
5050 && builtin_info[uns_fncode].implicit_p);
5053 /* Return whether the standard builtin function was declared. */
5056 builtin_decl_declared_p (enum built_in_function fncode)
5058 size_t uns_fncode = (size_t)fncode;
5060 gcc_checking_assert (BUILTIN_VALID_P (fncode));
5061 return (builtin_info[uns_fncode].decl != NULL_TREE
5062 && builtin_info[uns_fncode].declared_p);
5065 /* Return true if T (assumed to be a DECL) is a global variable.
5066 A variable is considered global if its storage is not automatic. */
5069 is_global_var (const_tree t)
5071 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5074 /* Return true if VAR may be aliased. A variable is considered as
5075 maybe aliased if it has its address taken by the local TU
5076 or possibly by another TU and might be modified through a pointer. */
5079 may_be_aliased (const_tree var)
5081 return (TREE_CODE (var) != CONST_DECL
5082 && (TREE_PUBLIC (var)
5083 || DECL_EXTERNAL (var)
5084 || TREE_ADDRESSABLE (var))
5085 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
5086 && ((TREE_READONLY (var)
5087 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
5088 || (TREE_CODE (var) == VAR_DECL
5089 && DECL_NONALIASED (var)))));
5092 /* Return pointer to optimization flags of FNDECL. */
5093 static inline struct cl_optimization *
5094 opts_for_fn (const_tree fndecl)
5096 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
5097 if (fn_opts == NULL_TREE)
5098 fn_opts = optimization_default_node;
5099 return TREE_OPTIMIZATION (fn_opts);
5102 /* Return pointer to target flags of FNDECL. */
5103 static inline cl_target_option *
5104 target_opts_for_fn (const_tree fndecl)
5106 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
5107 if (fn_opts == NULL_TREE)
5108 fn_opts = target_option_default_node;
5109 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
5112 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5113 the optimization level of function fndecl. */
5114 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5116 /* For anonymous aggregate types, we need some sort of name to
5117 hold on to. In practice, this should not appear, but it should
5118 not be harmful if it does. */
5119 extern const char *anon_aggrname_format();
5120 extern bool anon_aggrname_p (const_tree);
5122 /* The tree and const_tree overload templates. */
5126 struct int_traits <const_tree>
5128 static const enum precision_type precision_type = VAR_PRECISION;
5129 static const bool host_dependent_precision = false;
5130 static const bool is_sign_extended = false;
5131 static unsigned int get_precision (const_tree);
5132 static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int,
5137 struct int_traits <tree> : public int_traits <const_tree> {};
5146 extended_tree (const_tree);
5148 unsigned int get_precision () const;
5149 const HOST_WIDE_INT *get_val () const;
5150 unsigned int get_len () const;
5154 struct int_traits <extended_tree <N> >
5156 static const enum precision_type precision_type = CONST_PRECISION;
5157 static const bool host_dependent_precision = false;
5158 static const bool is_sign_extended = true;
5159 static const unsigned int precision = N;
5162 generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> >
5163 to_widest (const_tree);
5165 generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree);
5169 wi::int_traits <const_tree>::get_precision (const_tree tcst)
5171 return TYPE_PRECISION (TREE_TYPE (tcst));
5174 /* Convert the tree_cst X into a wide_int of PRECISION. */
5175 inline wi::storage_ref
5176 wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
5177 unsigned int precision, const_tree x)
5179 return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
5183 inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> >
5184 wi::to_widest (const_tree t)
5189 inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> >
5190 wi::to_offset (const_tree t)
5196 inline wi::extended_tree <N>::extended_tree (const_tree t)
5199 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
5204 wi::extended_tree <N>::get_precision () const
5210 inline const HOST_WIDE_INT *
5211 wi::extended_tree <N>::get_val () const
5213 return &TREE_INT_CST_ELT (m_t, 0);
5218 wi::extended_tree <N>::get_len () const
5220 if (N == ADDR_MAX_PRECISION)
5221 return TREE_INT_CST_OFFSET_NUNITS (m_t);
5222 else if (N >= WIDE_INT_MAX_PRECISION)
5223 return TREE_INT_CST_EXT_NUNITS (m_t);
5225 /* This class is designed to be used for specific output precisions
5226 and needs to be as fast as possible, so there is no fallback for
5233 template <typename T>
5234 bool fits_to_boolean_p (const T &x, const_tree);
5236 template <typename T>
5237 bool fits_to_tree_p (const T &x, const_tree);
5239 wide_int min_value (const_tree);
5240 wide_int max_value (const_tree);
5241 wide_int from_mpz (const_tree, mpz_t, bool);
5244 template <typename T>
5246 wi::fits_to_boolean_p (const T &x, const_tree type)
5248 return eq_p (x, 0) || eq_p (x, TYPE_UNSIGNED (type) ? 1 : -1);
5251 template <typename T>
5253 wi::fits_to_tree_p (const T &x, const_tree type)
5255 /* Non-standard boolean types can have arbitrary precision but various
5256 transformations assume that they can only take values 0 and +/-1. */
5257 if (TREE_CODE (type) == BOOLEAN_TYPE)
5258 return fits_to_boolean_p (x, type);
5260 if (TYPE_UNSIGNED (type))
5261 return eq_p (x, zext (x, TYPE_PRECISION (type)));
5263 return eq_p (x, sext (x, TYPE_PRECISION (type)));
5266 /* Produce the smallest number that is represented in TYPE. The precision
5267 and sign are taken from TYPE. */
5269 wi::min_value (const_tree type)
5271 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5274 /* Produce the largest number that is represented in TYPE. The precision
5275 and sign are taken from TYPE. */
5277 wi::max_value (const_tree type)
5279 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
5282 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5283 extending both according to their respective TYPE_SIGNs. */
5286 tree_int_cst_lt (const_tree t1, const_tree t2)
5288 return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2));
5291 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5292 extending both according to their respective TYPE_SIGNs. */
5295 tree_int_cst_le (const_tree t1, const_tree t2)
5297 return wi::les_p (wi::to_widest (t1), wi::to_widest (t2));
5300 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5301 are both INTEGER_CSTs and their values are extended according to their
5302 respective TYPE_SIGNs. */
5305 tree_int_cst_compare (const_tree t1, const_tree t2)
5307 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
5310 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5311 but none of these files are allowed to be included from front ends.
5312 They should be split in two. One suitable for the FEs, the other suitable
5315 /* Assign the RTX to declaration. */
5316 extern void set_decl_rtl (tree, rtx);
5317 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
5319 /* Given an expression EXP that is a handled_component_p,
5320 look for the ultimate containing object, which is returned and specify
5321 the access position and size. */
5322 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
5323 tree *, machine_mode *, int *, int *,
5326 extern tree build_personality_function (const char *);
5328 struct GTY(()) int_n_trees_t {
5329 /* These parts are initialized at runtime */
5334 /* This is also in machmode.h */
5335 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
5336 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
5338 /* Like bit_position, but return as an integer. It must be representable in
5339 that way (since it could be a signed value, we don't have the
5340 option of returning -1 like int_size_in_byte can. */
5342 inline HOST_WIDE_INT
5343 int_bit_position (const_tree field)
5345 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field)), BITS_PER_UNIT_LOG)
5346 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
5349 /* Return true if it makes sense to consider alias set for a type T. */
5352 type_with_alias_set_p (const_tree t)
5354 /* Function and method types are never accessed as memory locations. */
5355 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
5358 if (COMPLETE_TYPE_P (t))
5361 /* Incomplete types can not be accessed in general except for arrays
5362 where we can fetch its element despite we have no array bounds. */
5363 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
5369 extern location_t get_pure_location (location_t loc);
5371 /* Get the endpoint of any range encoded within location LOC. */
5373 static inline location_t
5374 get_finish (location_t loc)
5376 return get_range_from_loc (line_table, loc).m_finish;
5379 extern location_t set_block (location_t loc, tree block);
5381 extern void gt_ggc_mx (tree &);
5382 extern void gt_pch_nx (tree &);
5383 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
5385 extern bool nonnull_arg_p (const_tree);
5386 extern bool is_redundant_typedef (const_tree);
5389 set_source_range (tree expr, location_t start, location_t finish);
5392 set_source_range (tree expr, source_range src_range);
5394 static inline source_range
5395 get_decl_source_range (tree decl)
5397 location_t loc = DECL_SOURCE_LOCATION (decl);
5398 return get_range_from_loc (line_table, loc);
5402 make_location (location_t caret, location_t start, location_t finish);
5404 /* Return true if it makes sense to promote/demote from_type to to_type. */
5406 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
5408 unsigned int to_type_precision = TYPE_PRECISION (to_type);
5410 /* OK to promote if to_type is no bigger than word_mode. */
5411 if (to_type_precision <= GET_MODE_PRECISION (word_mode))
5414 /* Otherwise, allow only if narrowing or same precision conversions. */
5415 return to_type_precision <= TYPE_PRECISION (from_type);
5418 #endif /* GCC_TREE_H */