1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2018 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) \
79 (tree_contains_struct[C][TS_BASE] = true)
81 #define MARK_TS_TYPED(C) \
83 tree_contains_struct[C][TS_TYPED] = true)
85 #define MARK_TS_COMMON(C) \
87 tree_contains_struct[C][TS_COMMON] = true)
89 #define MARK_TS_TYPE_COMMON(C) \
90 (MARK_TS_COMMON (C), \
91 tree_contains_struct[C][TS_TYPE_COMMON] = true)
93 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
94 (MARK_TS_TYPE_COMMON (C), \
95 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
97 #define MARK_TS_DECL_MINIMAL(C) \
98 (MARK_TS_COMMON (C), \
99 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
101 #define MARK_TS_DECL_COMMON(C) \
102 (MARK_TS_DECL_MINIMAL (C), \
103 tree_contains_struct[C][TS_DECL_COMMON] = true)
105 #define MARK_TS_DECL_WRTL(C) \
106 (MARK_TS_DECL_COMMON (C), \
107 tree_contains_struct[C][TS_DECL_WRTL] = true)
109 #define MARK_TS_DECL_WITH_VIS(C) \
110 (MARK_TS_DECL_WRTL (C), \
111 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
113 #define MARK_TS_DECL_NON_COMMON(C) \
114 (MARK_TS_DECL_WITH_VIS (C), \
115 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
117 /* Returns the string representing CLASS. */
119 #define TREE_CODE_CLASS_STRING(CLASS)\
120 tree_code_class_strings[(int) (CLASS)]
122 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
124 /* Nonzero if NODE represents an exceptional code. */
126 #define EXCEPTIONAL_CLASS_P(NODE)\
127 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
129 /* Nonzero if NODE represents a constant. */
131 #define CONSTANT_CLASS_P(NODE)\
132 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
134 /* Nonzero if NODE represents a type. */
136 #define TYPE_P(NODE)\
137 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
139 /* Nonzero if NODE represents a declaration. */
141 #define DECL_P(NODE)\
142 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
144 /* True if NODE designates a variable declaration. */
145 #define VAR_P(NODE) \
146 (TREE_CODE (NODE) == VAR_DECL)
148 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
150 #define VAR_OR_FUNCTION_DECL_P(DECL)\
151 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
153 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
154 ascending code order. */
156 #define INDIRECT_REF_P(NODE)\
157 (TREE_CODE (NODE) == INDIRECT_REF)
159 /* Nonzero if NODE represents a reference. */
161 #define REFERENCE_CLASS_P(NODE)\
162 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
164 /* Nonzero if NODE represents a comparison. */
166 #define COMPARISON_CLASS_P(NODE)\
167 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
169 /* Nonzero if NODE represents a unary arithmetic expression. */
171 #define UNARY_CLASS_P(NODE)\
172 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
174 /* Nonzero if NODE represents a binary arithmetic expression. */
176 #define BINARY_CLASS_P(NODE)\
177 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
179 /* Nonzero if NODE represents a statement expression. */
181 #define STATEMENT_CLASS_P(NODE)\
182 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
184 /* Nonzero if NODE represents a function call-like expression with a
185 variable-length operand vector. */
187 #define VL_EXP_CLASS_P(NODE)\
188 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
190 /* Nonzero if NODE represents any other expression. */
192 #define EXPRESSION_CLASS_P(NODE)\
193 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
195 /* Returns nonzero iff NODE represents a type or declaration. */
197 #define IS_TYPE_OR_DECL_P(NODE)\
198 (TYPE_P (NODE) || DECL_P (NODE))
200 /* Returns nonzero iff CLASS is the tree-code class of an
203 #define IS_EXPR_CODE_CLASS(CLASS)\
204 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
206 /* Returns nonzero iff NODE is an expression of some kind. */
208 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
210 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
213 /* Helper macros for math builtins. */
215 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
216 #define CASE_FLT_FN_FLOATN_NX(FN) \
217 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
218 case FN##F32X: case FN##F64X: case FN##F128X
219 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
220 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
222 #define NULL_TREE (tree) NULL
224 /* Define accessors for the fields that all tree nodes have
225 (though some fields are not used for all kinds of nodes). */
227 /* The tree-code says what kind of node it is.
228 Codes are defined in tree.def. */
229 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
230 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
232 /* When checking is enabled, errors will be generated if a tree node
233 is accessed incorrectly. The macros die with a fatal error. */
234 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
236 #define TREE_CHECK(T, CODE) \
237 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
239 #define TREE_NOT_CHECK(T, CODE) \
240 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
242 #define TREE_CHECK2(T, CODE1, CODE2) \
243 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
245 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
246 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
248 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
249 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
251 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
252 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
253 (CODE1), (CODE2), (CODE3)))
255 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
256 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
257 (CODE1), (CODE2), (CODE3), (CODE4)))
259 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
260 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
261 (CODE1), (CODE2), (CODE3), (CODE4)))
263 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
264 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
265 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
267 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
268 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
269 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
271 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
272 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
274 #define TREE_CLASS_CHECK(T, CLASS) \
275 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
277 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
278 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
280 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
281 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
283 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
284 (omp_clause_range_check ((T), (CODE1), (CODE2), \
285 __FILE__, __LINE__, __FUNCTION__))
287 /* These checks have to be special cased. */
288 #define EXPR_CHECK(T) \
289 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
291 /* These checks have to be special cased. */
292 #define NON_TYPE_CHECK(T) \
293 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
295 /* These checks have to be special cased. */
296 #define ANY_INTEGRAL_TYPE_CHECK(T) \
297 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
299 #define TREE_INT_CST_ELT_CHECK(T, I) \
300 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
302 #define TREE_VEC_ELT_CHECK(T, I) \
303 (*(CONST_CAST2 (tree *, typeof (T)*, \
304 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
306 #define OMP_CLAUSE_ELT_CHECK(T, I) \
307 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
309 /* Special checks for TREE_OPERANDs. */
310 #define TREE_OPERAND_CHECK(T, I) \
311 (*(CONST_CAST2 (tree*, typeof (T)*, \
312 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
314 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
315 (*(tree_operand_check_code ((T), (CODE), (I), \
316 __FILE__, __LINE__, __FUNCTION__)))
318 /* Nodes are chained together for many purposes.
319 Types are chained together to record them for being output to the debugger
320 (see the function `chain_type').
321 Decls in the same scope are chained together to record the contents
323 Statement nodes for successive statements used to be chained together.
324 Often lists of things are represented by TREE_LIST nodes that
325 are chained together. */
327 #define TREE_CHAIN(NODE) \
328 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
330 /* In all nodes that are expressions, this is the data type of the expression.
331 In POINTER_TYPE nodes, this is the type that the pointer points to.
332 In ARRAY_TYPE nodes, this is the type of the elements.
333 In VECTOR_TYPE nodes, this is the type of the elements. */
334 #define TREE_TYPE(NODE) \
335 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
337 extern void tree_contains_struct_check_failed (const_tree
,
338 const enum tree_node_structure_enum
,
339 const char *, int, const char *)
340 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
342 extern void tree_check_failed (const_tree
, const char *, int, const char *,
343 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
344 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
345 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
346 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
347 const char *, int, const char *)
348 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
349 extern void tree_range_check_failed (const_tree
, const char *, int,
350 const char *, enum tree_code
,
352 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
353 extern void tree_not_class_check_failed (const_tree
,
354 const enum tree_code_class
,
355 const char *, int, const char *)
356 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
357 extern void tree_int_cst_elt_check_failed (int, int, const char *,
359 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
360 extern void tree_vec_elt_check_failed (int, int, const char *,
362 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
363 extern void phi_node_elt_check_failed (int, int, const char *,
365 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
366 extern void tree_operand_check_failed (int, const_tree
,
367 const char *, int, const char *)
368 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
369 extern void omp_clause_check_failed (const_tree
, const char *, int,
370 const char *, enum omp_clause_code
)
371 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
372 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
374 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
375 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
376 const char *, enum omp_clause_code
,
377 enum omp_clause_code
)
378 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
380 #else /* not ENABLE_TREE_CHECKING, or not gcc */
382 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
383 #define TREE_CHECK(T, CODE) (T)
384 #define TREE_NOT_CHECK(T, CODE) (T)
385 #define TREE_CHECK2(T, CODE1, CODE2) (T)
386 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
387 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
388 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
389 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
390 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
391 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
392 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
393 #define TREE_CLASS_CHECK(T, CODE) (T)
394 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
395 #define EXPR_CHECK(T) (T)
396 #define NON_TYPE_CHECK(T) (T)
397 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
398 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
399 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
400 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
401 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
402 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
403 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
404 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
406 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
407 #define TREE_TYPE(NODE) ((NODE)->typed.type)
411 #define TREE_BLOCK(NODE) (tree_block (NODE))
412 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
414 #include "tree-check.h"
416 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
417 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
418 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
419 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
420 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
421 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
422 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
423 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
424 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
425 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
426 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
428 #define RECORD_OR_UNION_CHECK(T) \
429 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
430 #define NOT_RECORD_OR_UNION_CHECK(T) \
431 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
433 #define NUMERICAL_TYPE_CHECK(T) \
434 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
437 /* Here is how primitive or already-canonicalized types' hash codes
439 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
441 /* A simple hash function for an arbitrary tree node. This must not be
442 used in hash tables which are saved to a PCH. */
443 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
445 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
446 #define CONVERT_EXPR_CODE_P(CODE) \
447 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
449 /* Similarly, but accept an expression instead of a tree code. */
450 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
452 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
454 #define CASE_CONVERT \
458 /* Given an expression as a tree, strip any conversion that generates
459 no instruction. Accepts both tree and const_tree arguments since
460 we are not modifying the tree itself. */
462 #define STRIP_NOPS(EXP) \
463 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
465 /* Like STRIP_NOPS, but don't let the signedness change either. */
467 #define STRIP_SIGN_NOPS(EXP) \
468 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
470 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
472 #define STRIP_TYPE_NOPS(EXP) \
473 while ((CONVERT_EXPR_P (EXP) \
474 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
475 && TREE_OPERAND (EXP, 0) != error_mark_node \
476 && (TREE_TYPE (EXP) \
477 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
478 (EXP) = TREE_OPERAND (EXP, 0)
480 /* Remove unnecessary type conversions according to
481 tree_ssa_useless_type_conversion. */
483 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
484 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
486 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
487 in use to provide a location_t. */
489 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
490 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
492 /* Nonzero if TYPE represents a vector type. */
494 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
496 /* Nonzero if TYPE represents a vector of booleans. */
498 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
499 (TREE_CODE (TYPE) == VECTOR_TYPE \
500 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
502 /* Nonzero if TYPE represents an integral type. Note that we do not
503 include COMPLEX types here. Keep these checks in ascending code
506 #define INTEGRAL_TYPE_P(TYPE) \
507 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
508 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
509 || TREE_CODE (TYPE) == INTEGER_TYPE)
511 /* Nonzero if TYPE represents an integral type, including complex
512 and vector integer types. */
514 #define ANY_INTEGRAL_TYPE_P(TYPE) \
515 (INTEGRAL_TYPE_P (TYPE) \
516 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
517 || VECTOR_TYPE_P (TYPE)) \
518 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
520 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
522 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
523 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
525 /* Nonzero if TYPE represents a saturating fixed-point type. */
527 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
528 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
530 /* Nonzero if TYPE represents a fixed-point type. */
532 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
534 /* Nonzero if TYPE represents a scalar floating-point type. */
536 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
538 /* Nonzero if TYPE represents a complex floating-point type. */
540 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
541 (TREE_CODE (TYPE) == COMPLEX_TYPE \
542 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
544 /* Nonzero if TYPE represents a vector integer type. */
546 #define VECTOR_INTEGER_TYPE_P(TYPE) \
547 (VECTOR_TYPE_P (TYPE) \
548 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
551 /* Nonzero if TYPE represents a vector floating-point type. */
553 #define VECTOR_FLOAT_TYPE_P(TYPE) \
554 (VECTOR_TYPE_P (TYPE) \
555 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
557 /* Nonzero if TYPE represents a floating-point type, including complex
558 and vector floating-point types. The vector and complex check does
559 not use the previous two macros to enable early folding. */
561 #define FLOAT_TYPE_P(TYPE) \
562 (SCALAR_FLOAT_TYPE_P (TYPE) \
563 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
564 || VECTOR_TYPE_P (TYPE)) \
565 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
567 /* Nonzero if TYPE represents a decimal floating-point type. */
568 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
569 (SCALAR_FLOAT_TYPE_P (TYPE) \
570 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
572 /* Nonzero if TYPE is a record or union type. */
573 #define RECORD_OR_UNION_TYPE_P(TYPE) \
574 (TREE_CODE (TYPE) == RECORD_TYPE \
575 || TREE_CODE (TYPE) == UNION_TYPE \
576 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
578 /* Nonzero if TYPE represents an aggregate (multi-component) type.
579 Keep these checks in ascending code order. */
581 #define AGGREGATE_TYPE_P(TYPE) \
582 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
584 /* Nonzero if TYPE represents a pointer or reference type.
585 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
586 ascending code order. */
588 #define POINTER_TYPE_P(TYPE) \
589 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
591 /* Nonzero if TYPE represents a pointer to function. */
592 #define FUNCTION_POINTER_TYPE_P(TYPE) \
593 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
595 /* Nonzero if this type is a complete type. */
596 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
598 /* Nonzero if this type is the (possibly qualified) void type. */
599 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
601 /* Nonzero if this type is complete or is cv void. */
602 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
603 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
605 /* Nonzero if this type is complete or is an array with unspecified bound. */
606 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
607 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
609 #define FUNC_OR_METHOD_TYPE_P(NODE) \
610 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
612 /* Define many boolean fields that all tree nodes have. */
614 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
615 of this is needed. So it cannot be in a register.
616 In a FUNCTION_DECL it has no meaning.
617 In LABEL_DECL nodes, it means a goto for this label has been seen
618 from a place outside all binding contours that restore stack levels.
619 In an artificial SSA_NAME that points to a stack partition with at least
620 two variables, it means that at least one variable has TREE_ADDRESSABLE.
621 In ..._TYPE nodes, it means that objects of this type must be fully
622 addressable. This means that pieces of this object cannot go into
623 register parameters, for example. If this a function type, this
624 means that the value must be returned in memory.
625 In CONSTRUCTOR nodes, it means object constructed must be in memory.
626 In IDENTIFIER_NODEs, this means that some extern decl for this name
627 had its address taken. That matters for inline functions.
628 In a STMT_EXPR, it means we want the result of the enclosed expression. */
629 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
631 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
632 exit of a function. Calls for which this is true are candidates for tail
633 call optimizations. */
634 #define CALL_EXPR_TAILCALL(NODE) \
635 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
637 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
638 optimization for correctness. */
639 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
640 (CALL_EXPR_CHECK (NODE)->base.static_flag)
642 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
643 CASE_LOW operand has been processed. */
644 #define CASE_LOW_SEEN(NODE) \
645 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
647 #define PREDICT_EXPR_OUTCOME(NODE) \
648 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
649 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
650 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
651 #define PREDICT_EXPR_PREDICTOR(NODE) \
652 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
654 /* In a VAR_DECL, nonzero means allocate static storage.
655 In a FUNCTION_DECL, nonzero if function has been defined.
656 In a CONSTRUCTOR, nonzero means allocate static storage. */
657 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
659 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
660 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
662 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
663 should only be executed if an exception is thrown, not on normal exit
665 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
667 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
668 separate cleanup in honor_protect_cleanup_actions. */
669 #define TRY_CATCH_IS_CLEANUP(NODE) \
670 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
672 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
673 CASE_HIGH operand has been processed. */
674 #define CASE_HIGH_SEEN(NODE) \
675 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
677 /* Used to mark scoped enums. */
678 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
680 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
681 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
683 /* In an expr node (usually a conversion) this means the node was made
684 implicitly and should not lead to any sort of warning. In a decl node,
685 warnings concerning the decl should be suppressed. This is used at
686 least for used-before-set warnings, and it set after one warning is
688 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
690 /* Nonzero if we should warn about the change in empty class parameter
691 passing ABI in this TU. */
692 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
693 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
695 /* Nonzero if this type is "empty" according to the particular psABI. */
696 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
698 /* Used to indicate that this TYPE represents a compiler-generated entity. */
699 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
701 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
702 this string as an argument. */
703 #define TREE_SYMBOL_REFERENCED(NODE) \
704 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
706 /* Nonzero in a pointer or reference type means the data pointed to
707 by this type can alias anything. */
708 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
709 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
711 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
712 there was an overflow in folding. */
714 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
716 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
718 #define TREE_OVERFLOW_P(EXPR) \
719 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
721 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
722 nonzero means name is to be accessible from outside this translation unit.
723 In an IDENTIFIER_NODE, nonzero means an external declaration
724 accessible from outside this translation unit was previously seen
725 for this name in an inner scope. */
726 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
728 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
729 of cached values, or is something else. */
730 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
732 /* In a SAVE_EXPR, indicates that the original expression has already
733 been substituted with a VAR_DECL that contains the value. */
734 #define SAVE_EXPR_RESOLVED_P(NODE) \
735 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
737 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
739 #define CALL_EXPR_VA_ARG_PACK(NODE) \
740 (CALL_EXPR_CHECK (NODE)->base.public_flag)
742 /* In any expression, decl, or constant, nonzero means it has side effects or
743 reevaluation of the whole expression could produce a different value.
744 This is set if any subexpression is a function call, a side effect or a
745 reference to a volatile variable. In a ..._DECL, this is set only if the
746 declaration said `volatile'. This will never be set for a constant. */
747 #define TREE_SIDE_EFFECTS(NODE) \
748 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
750 /* In a LABEL_DECL, nonzero means this label had its address taken
751 and therefore can never be deleted and is a jump target for
753 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
755 /* Whether a case or a user-defined label is allowed to fall through to.
756 This is used to implement -Wimplicit-fallthrough. */
757 #define FALLTHROUGH_LABEL_P(NODE) \
758 (LABEL_DECL_CHECK (NODE)->base.private_flag)
760 /* Set on the artificial label created for break; stmt from a switch.
761 This is used to implement -Wimplicit-fallthrough. */
762 #define SWITCH_BREAK_LABEL_P(NODE) \
763 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
765 /* Nonzero means this expression is volatile in the C sense:
766 its address should be of type `volatile WHATEVER *'.
767 In other words, the declared item is volatile qualified.
768 This is used in _DECL nodes and _REF nodes.
769 On a FUNCTION_DECL node, this means the function does not
770 return normally. This is the same effect as setting
771 the attribute noreturn on the function in C.
773 In a ..._TYPE node, means this type is volatile-qualified.
774 But use TYPE_VOLATILE instead of this macro when the node is a type,
775 because eventually we may make that a different bit.
777 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
778 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
780 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
781 accessing the memory pointed to won't generate a trap. However,
782 this only applies to an object when used appropriately: it doesn't
783 mean that writing a READONLY mem won't trap.
785 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
786 (or slice of the array) always belongs to the range of the array.
787 I.e. that the access will not trap, provided that the access to
788 the base to the array will not trap. */
789 #define TREE_THIS_NOTRAP(NODE) \
790 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
791 ARRAY_RANGE_REF)->base.nothrow_flag)
793 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
794 nonzero means it may not be the lhs of an assignment.
795 Nonzero in a FUNCTION_DECL means this function should be treated
796 as "const" function (can only read its arguments). */
797 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
799 /* Value of expression is constant. Always on in all ..._CST nodes. May
800 also appear in an expression or decl where the value is constant. */
801 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
803 /* Nonzero if NODE, a type, has had its sizes gimplified. */
804 #define TYPE_SIZES_GIMPLIFIED(NODE) \
805 (TYPE_CHECK (NODE)->base.constant_flag)
807 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
808 #define DECL_UNSIGNED(NODE) \
809 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
811 /* In integral and pointer types, means an unsigned type. */
812 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
814 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
815 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
817 /* True if overflow wraps around for the given integral or pointer type. That
818 is, TYPE_MAX + 1 == TYPE_MIN. */
819 #define TYPE_OVERFLOW_WRAPS(TYPE) \
820 (POINTER_TYPE_P (TYPE) \
821 ? flag_wrapv_pointer \
822 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
825 /* True if overflow is undefined for the given integral or pointer type.
826 We may optimize on the assumption that values in the type never overflow.
828 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
829 must issue a warning based on warn_strict_overflow. In some cases
830 it will be appropriate to issue the warning immediately, and in
831 other cases it will be appropriate to simply set a flag and let the
832 caller decide whether a warning is appropriate or not. */
833 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
834 (POINTER_TYPE_P (TYPE) \
835 ? !flag_wrapv_pointer \
836 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
837 && !flag_wrapv && !flag_trapv))
839 /* True if overflow for the given integral type should issue a
841 #define TYPE_OVERFLOW_TRAPS(TYPE) \
842 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
844 /* True if an overflow is to be preserved for sanitization. */
845 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
846 (INTEGRAL_TYPE_P (TYPE) \
847 && !TYPE_OVERFLOW_WRAPS (TYPE) \
848 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
850 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
851 Nonzero in a FUNCTION_DECL means that the function has been compiled.
852 This is interesting in an inline function, since it might not need
853 to be compiled separately.
854 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
855 or TYPE_DECL if the debugging info for the type has been written.
856 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
857 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
859 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
861 /* Nonzero in a _DECL if the name is used in its scope.
862 Nonzero in an expr node means inhibit warning if value is unused.
863 In IDENTIFIER_NODEs, this means that some extern decl for this name
865 In a BLOCK, this means that the block contains variables that are used. */
866 #define TREE_USED(NODE) ((NODE)->base.used_flag)
868 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
869 throw an exception. In a CALL_EXPR, nonzero means the call cannot
870 throw. We can't easily check the node type here as the C++
871 frontend also uses this flag (for AGGR_INIT_EXPR). */
872 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
874 /* In a CALL_EXPR, means that it's safe to use the target of the call
875 expansion as the return slot for a call that returns in memory. */
876 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
877 (CALL_EXPR_CHECK (NODE)->base.private_flag)
879 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
880 passed by invisible reference (and the TREE_TYPE is a pointer to the true
882 #define DECL_BY_REFERENCE(NODE) \
883 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
884 RESULT_DECL)->decl_common.decl_by_reference_flag)
886 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
888 #define DECL_READ_P(NODE) \
889 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
891 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
892 attempting to share the stack slot with some other variable. */
893 #define DECL_NONSHAREABLE(NODE) \
894 (TREE_CHECK2 (NODE, VAR_DECL, \
895 RESULT_DECL)->decl_common.decl_nonshareable_flag)
897 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
898 thunked-to function. */
899 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
901 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
902 it has been built for the declaration of a variable-sized object. */
903 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
904 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
906 /* Used in classes in C++. */
907 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
908 /* Used in classes in C++. */
909 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
911 /* True if reference type NODE is a C++ rvalue reference. */
912 #define TYPE_REF_IS_RVALUE(NODE) \
913 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
915 /* Nonzero in a _DECL if the use of the name is defined as a
916 deprecated feature by __attribute__((deprecated)). */
917 #define TREE_DEPRECATED(NODE) \
918 ((NODE)->base.deprecated_flag)
920 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
921 uses are to be substituted for uses of the TREE_CHAINed identifier. */
922 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
923 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
925 /* In an aggregate type, indicates that the scalar fields of the type are
926 stored in reverse order from the target order. This effectively
927 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
928 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
929 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
931 /* In a non-aggregate type, indicates a saturating type. */
932 #define TYPE_SATURATING(NODE) \
933 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
935 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
936 of bits stored in reverse order from the target order. This effectively
937 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
939 The overall strategy is to preserve the invariant that every scalar in
940 memory is associated with a single storage order, i.e. all accesses to
941 this scalar are done with the same storage order. This invariant makes
942 it possible to factor out the storage order in most transformations, as
943 only the address and/or the value (in target order) matter for them.
944 But, of course, the storage order must be preserved when the accesses
945 themselves are rewritten or transformed. */
946 #define REF_REVERSE_STORAGE_ORDER(NODE) \
947 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
949 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
950 represented by a descriptor instead of a trampoline. */
951 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
952 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
954 /* In a CALL_EXPR, indicates that this is an indirect call for which
955 pointers to nested function are descriptors instead of trampolines. */
956 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
957 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
959 /* These flags are available for each language front end to use internally. */
960 #define TREE_LANG_FLAG_0(NODE) \
961 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
962 #define TREE_LANG_FLAG_1(NODE) \
963 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
964 #define TREE_LANG_FLAG_2(NODE) \
965 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
966 #define TREE_LANG_FLAG_3(NODE) \
967 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
968 #define TREE_LANG_FLAG_4(NODE) \
969 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
970 #define TREE_LANG_FLAG_5(NODE) \
971 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
972 #define TREE_LANG_FLAG_6(NODE) \
973 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
975 /* Define additional fields and accessors for nodes representing constants. */
977 #define TREE_INT_CST_NUNITS(NODE) \
978 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
979 #define TREE_INT_CST_EXT_NUNITS(NODE) \
980 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
981 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
982 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
983 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
984 #define TREE_INT_CST_LOW(NODE) \
985 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
987 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
988 targets with variable-sized modes. */
989 #define POLY_INT_CST_P(NODE) \
990 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
992 /* In a POLY_INT_CST node. */
993 #define POLY_INT_CST_COEFF(NODE, I) \
994 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
996 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
997 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
999 #define TREE_FIXED_CST_PTR(NODE) \
1000 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1001 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1003 /* In a STRING_CST */
1004 /* In C terms, this is sizeof, not strlen. */
1005 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1006 #define TREE_STRING_POINTER(NODE) \
1007 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1009 /* In a COMPLEX_CST node. */
1010 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1011 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1013 /* In a VECTOR_CST node. See generic.texi for details. */
1014 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1015 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1017 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1018 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1019 #define VECTOR_CST_NPATTERNS(NODE) \
1020 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1021 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1022 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1023 #define VECTOR_CST_DUPLICATE_P(NODE) \
1024 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1025 #define VECTOR_CST_STEPPED_P(NODE) \
1026 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1027 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1028 (VECTOR_CST_CHECK (NODE)->vector.elts)
1029 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1030 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1032 /* Define fields and accessors for some special-purpose tree nodes. */
1034 #define IDENTIFIER_LENGTH(NODE) \
1035 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1036 #define IDENTIFIER_POINTER(NODE) \
1037 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1038 #define IDENTIFIER_HASH_VALUE(NODE) \
1039 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1041 /* Translate a hash table identifier pointer to a tree_identifier
1042 pointer, and vice versa. */
1044 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1045 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1046 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1048 /* In a TREE_LIST node. */
1049 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1050 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1052 /* In a TREE_VEC node. */
1053 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1054 #define TREE_VEC_END(NODE) \
1055 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1057 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1059 /* In a CONSTRUCTOR node. */
1060 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1061 #define CONSTRUCTOR_ELT(NODE,IDX) \
1062 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1063 #define CONSTRUCTOR_NELTS(NODE) \
1064 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1065 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1066 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1068 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1069 value of each element (stored within VAL). IX must be a scratch variable
1070 of unsigned integer type. */
1071 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1072 for (IX = 0; (IX >= vec_safe_length (V)) \
1074 : ((VAL = (*(V))[IX].value), \
1078 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1079 the value of each element (stored within VAL) and its index (stored
1080 within INDEX). IX must be a scratch variable of unsigned integer type. */
1081 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1082 for (IX = 0; (IX >= vec_safe_length (V)) \
1084 : (((void) (VAL = (*V)[IX].value)), \
1085 (INDEX = (*V)[IX].index), \
1089 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1090 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1092 constructor_elt _ce___ = {INDEX, VALUE}; \
1093 vec_safe_push ((V), _ce___); \
1096 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1097 constructor output purposes. */
1098 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1099 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1101 /* True if NODE is a clobber right hand side, an expression of indeterminate
1102 value that clobbers the LHS in a copy instruction. We use a volatile
1103 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1104 In particular the volatile flag causes us to not prematurely remove
1105 such clobber instructions. */
1106 #define TREE_CLOBBER_P(NODE) \
1107 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1109 /* Define fields and accessors for some nodes that represent expressions. */
1111 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1112 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1113 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1114 && integer_zerop (TREE_OPERAND (NODE, 0)))
1116 /* In ordinary expression nodes. */
1117 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1118 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1120 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1121 length. Its value includes the length operand itself; that is,
1122 the minimum valid length is 1.
1123 Note that we have to bypass the use of TREE_OPERAND to access
1124 that field to avoid infinite recursion in expanding the macros. */
1125 #define VL_EXP_OPERAND_LENGTH(NODE) \
1126 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1128 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1129 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1130 /* Nonzero if gimple_debug_bind_p() (and thus
1131 gimple_debug_source_bind_p()) may possibly hold. */
1132 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1133 /* Nonzero if is_gimple_debug() may possibly hold. */
1134 #define MAY_HAVE_DEBUG_STMTS \
1135 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1137 /* In a LOOP_EXPR node. */
1138 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1140 /* The source location of this expression. Non-tree_exp nodes such as
1141 decls and constants can be shared among multiple locations, so
1143 #define EXPR_LOCATION(NODE) \
1144 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1145 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1146 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1147 != UNKNOWN_LOCATION)
1148 /* The location to be used in a diagnostic about this expression. Do not
1149 use this macro if the location will be assigned to other expressions. */
1150 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1151 ? (NODE)->exp.locus : (LOCUS))
1152 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1153 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1155 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1156 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1158 #define EXPR_HAS_RANGE(NODE) \
1159 (CAN_HAVE_RANGE_P (NODE) \
1160 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1163 /* True if a tree is an expression or statement that can have a
1165 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1167 static inline source_range
1168 get_expr_source_range (tree expr
)
1170 location_t loc
= EXPR_LOCATION (expr
);
1171 return get_range_from_loc (line_table
, loc
);
1174 extern void protected_set_expr_location (tree
, location_t
);
1176 extern tree
maybe_wrap_with_location (tree
, location_t
);
1178 /* In a TARGET_EXPR node. */
1179 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1180 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1181 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1182 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1183 on rhs of MODIFY_EXPR. */
1184 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1186 /* DECL_EXPR accessor. This gives access to the DECL associated with
1187 the given declaration statement. */
1188 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1190 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1192 /* COMPOUND_LITERAL_EXPR accessors. */
1193 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1194 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1195 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1196 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1198 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1199 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1200 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1201 /* True if there are case labels for all possible values of SWITCH_COND, either
1202 because there is a default: case label or because the case label ranges cover
1204 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1206 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1207 of a case label, respectively. */
1208 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1209 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1210 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1211 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1213 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1214 corresponding MEM_REF operands. */
1215 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1216 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1217 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1218 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1219 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1221 #define MR_DEPENDENCE_CLIQUE(NODE) \
1222 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1223 #define MR_DEPENDENCE_BASE(NODE) \
1224 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1226 /* The operands of a BIND_EXPR. */
1227 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1228 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1229 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1231 /* GOTO_EXPR accessor. This gives access to the label associated with
1232 a goto statement. */
1233 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1235 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1236 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1237 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1239 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1240 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1241 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1242 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1243 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1244 /* Nonzero if we want to create an ASM_INPUT instead of an
1245 ASM_OPERAND with no operands. */
1246 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1247 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1249 /* COND_EXPR accessors. */
1250 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1251 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1252 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1254 /* Accessors for the chains of recurrences. */
1255 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1256 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1257 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1259 /* LABEL_EXPR accessor. This gives access to the label associated with
1260 the given label expression. */
1261 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1263 /* CATCH_EXPR accessors. */
1264 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1265 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1267 /* EH_FILTER_EXPR accessors. */
1268 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1269 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1271 /* OBJ_TYPE_REF accessors. */
1272 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1273 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1274 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1276 /* ASSERT_EXPR accessors. */
1277 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1278 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1280 /* CALL_EXPR accessors. */
1281 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1282 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1283 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1284 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1285 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1287 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1288 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1289 the argument count is zero when checking is enabled. Instead, do
1290 the pointer arithmetic to advance past the 3 fixed operands in a
1291 CALL_EXPR. That produces a valid pointer to just past the end of the
1292 operand array, even if it's not valid to dereference it. */
1293 #define CALL_EXPR_ARGP(NODE) \
1294 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1296 /* TM directives and accessors. */
1297 #define TRANSACTION_EXPR_BODY(NODE) \
1298 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1299 #define TRANSACTION_EXPR_OUTER(NODE) \
1300 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1301 #define TRANSACTION_EXPR_RELAXED(NODE) \
1302 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1304 /* OpenMP and OpenACC directive and clause accessors. */
1306 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1308 #define OMP_BODY(NODE) \
1309 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1310 #define OMP_CLAUSES(NODE) \
1311 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_TASKGROUP), 1)
1313 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1314 #define OMP_STANDALONE_CLAUSES(NODE) \
1315 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1317 #define OACC_DATA_BODY(NODE) \
1318 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1319 #define OACC_DATA_CLAUSES(NODE) \
1320 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1322 #define OACC_HOST_DATA_BODY(NODE) \
1323 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1324 #define OACC_HOST_DATA_CLAUSES(NODE) \
1325 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1327 #define OACC_CACHE_CLAUSES(NODE) \
1328 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1330 #define OACC_DECLARE_CLAUSES(NODE) \
1331 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1333 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1334 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1336 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1337 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1339 #define OACC_UPDATE_CLAUSES(NODE) \
1340 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1342 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1343 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1345 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1346 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1348 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1349 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1350 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1352 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1353 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1354 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1355 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1356 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1357 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1358 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1359 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1361 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1362 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1364 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1366 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1367 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1369 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1371 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1372 #define OMP_TASKGROUP_CLAUSES(NODE) \
1373 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1375 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1376 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1378 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1379 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1380 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1382 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1383 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1385 #define OMP_TARGET_DATA_BODY(NODE) \
1386 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1387 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1388 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1390 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1391 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1393 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1394 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1396 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1397 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1399 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1400 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1402 #define OMP_CLAUSE_SIZE(NODE) \
1403 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1405 OMP_CLAUSE__CACHE_), 1)
1407 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1408 #define OMP_CLAUSE_DECL(NODE) \
1409 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1410 OMP_CLAUSE_PRIVATE, \
1411 OMP_CLAUSE__REDUCTEMP_), 0)
1412 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1413 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1414 != UNKNOWN_LOCATION)
1415 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1417 /* True on an OMP_SECTION statement that was the last lexical member.
1418 This status is meaningful in the implementation of lastprivate. */
1419 #define OMP_SECTION_LAST(NODE) \
1420 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1422 /* True on an OMP_PARALLEL statement if it represents an explicit
1423 combined parallel work-sharing constructs. */
1424 #define OMP_PARALLEL_COMBINED(NODE) \
1425 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1427 /* True on an OMP_TEAMS statement if it represents an explicit
1428 combined teams distribute constructs. */
1429 #define OMP_TEAMS_COMBINED(NODE) \
1430 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1432 /* True on an OMP_TARGET statement if it represents explicit
1433 combined target teams, target parallel or target simd constructs. */
1434 #define OMP_TARGET_COMBINED(NODE) \
1435 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1437 /* Memory order for OMP_ATOMIC*. */
1438 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1439 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1440 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1442 /* True on a PRIVATE clause if its decl is kept around for debugging
1443 information only and its DECL_VALUE_EXPR is supposed to point
1444 to what it has been remapped to. */
1445 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1446 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1448 /* True on a PRIVATE clause if ctor needs access to outer region's
1450 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1451 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1453 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1454 (thus should be private on the outer taskloop and firstprivate on
1456 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1457 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1459 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1460 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1461 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1463 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1464 to should be firstprivatized. */
1465 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1466 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1468 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1469 decl is present in the chain. */
1470 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1471 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1472 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1473 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1474 OMP_CLAUSE_LASTPRIVATE),\
1476 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1477 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1479 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1480 (thus should be lastprivate on the outer taskloop and firstprivate on
1482 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1483 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1485 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1486 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1487 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1489 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1490 decl is present in the chain (this can happen only for taskloop
1491 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1492 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1493 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1495 /* True on a SHARED clause if a scalar is not modified in the body and
1496 thus could be optimized as firstprivate. */
1497 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1498 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1500 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1501 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1503 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1504 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1505 #define OMP_CLAUSE_IF_EXPR(NODE) \
1506 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1507 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1508 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1509 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1510 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1511 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1512 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1513 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1514 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1516 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1517 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1519 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1520 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1522 /* OpenACC clause expressions */
1523 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1524 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1525 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1526 OMP_CLAUSE_OPERAND ( \
1527 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1528 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1529 OMP_CLAUSE_OPERAND ( \
1530 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1531 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1532 OMP_CLAUSE_OPERAND ( \
1533 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1534 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1535 OMP_CLAUSE_OPERAND ( \
1536 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1537 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1538 OMP_CLAUSE_OPERAND ( \
1539 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1540 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1541 OMP_CLAUSE_OPERAND ( \
1542 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1543 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1544 OMP_CLAUSE_OPERAND ( \
1545 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1546 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1547 OMP_CLAUSE_OPERAND ( \
1548 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1549 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1550 OMP_CLAUSE_OPERAND ( \
1551 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1553 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1554 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1556 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1557 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1559 #define OMP_CLAUSE_MAP_KIND(NODE) \
1560 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1561 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1562 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1563 = (unsigned int) (MAP_KIND))
1565 /* Nonzero if this map clause is for array (rather than pointer) based array
1566 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1567 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1568 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1569 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1570 /* Nonzero if this is a mapped array section, that might need special
1571 treatment if OMP_CLAUSE_SIZE is zero. */
1572 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1573 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1574 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1575 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1576 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1578 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1579 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1581 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1582 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1583 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1584 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1585 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1586 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1588 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1589 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1591 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1592 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1593 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1594 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1595 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1596 OMP_CLAUSE_IN_REDUCTION), 1)
1597 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1598 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1599 OMP_CLAUSE_IN_REDUCTION), 2)
1600 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1601 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1602 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1603 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1604 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1605 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1606 OMP_CLAUSE_IN_REDUCTION), 3)
1607 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1608 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1609 OMP_CLAUSE_IN_REDUCTION), 4)
1611 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1612 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1613 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1614 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1615 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1617 /* True if a REDUCTION clause has task reduction-modifier. */
1618 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1619 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1621 /* True if a REDUCTION clause has inscan reduction-modifier. */
1622 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1623 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1625 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1626 are always initialized inside of the loop construct, false otherwise. */
1627 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1628 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1630 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1631 are declared inside of the simd construct. */
1632 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1633 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1635 /* True if a LINEAR clause has a stride that is variable. */
1636 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1637 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1639 /* True if a LINEAR clause is for an array or allocatable variable that
1640 needs special handling by the frontend. */
1641 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1642 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1644 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1645 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1647 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1648 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1650 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1651 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1653 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1654 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1656 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1657 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1659 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1660 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1662 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1663 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1664 OMP_CLAUSE_THREAD_LIMIT), 0)
1666 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1667 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1669 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1670 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1671 OMP_CLAUSE_DIST_SCHEDULE), 0)
1673 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1674 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1676 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1677 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1679 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1680 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1682 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1683 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1685 /* True if a SCHEDULE clause has the simd modifier on it. */
1686 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1687 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1689 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1690 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1692 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1693 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1694 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1695 ((enum omp_clause_defaultmap_kind) \
1696 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1697 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1698 ((enum omp_clause_defaultmap_kind) \
1699 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1700 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1701 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1702 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1704 #define OMP_CLAUSE_TILE_LIST(NODE) \
1705 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1706 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1707 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1708 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1709 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1711 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1712 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1713 ->omp_clause.subcode.dimension)
1714 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1715 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1716 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1717 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1719 /* SSA_NAME accessors. */
1721 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1722 information in the underlying SSA_NAME_VAR for efficiency. */
1723 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1724 SSA_NAME_CHECK (NODE)->base.public_flag
1726 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1727 if there is no name associated with it. */
1728 #define SSA_NAME_IDENTIFIER(NODE) \
1729 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1730 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1731 ? (NODE)->ssa_name.var \
1732 : DECL_NAME ((NODE)->ssa_name.var)) \
1735 /* Returns the variable being referenced. This can be NULL_TREE for
1736 temporaries not associated with any user variable.
1737 Once released, this is the only field that can be relied upon. */
1738 #define SSA_NAME_VAR(NODE) \
1739 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1740 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1741 ? NULL_TREE : (NODE)->ssa_name.var)
1743 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1746 tree var_ = (VAR); \
1747 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1748 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1750 && TREE_CODE (var_) == VAR_DECL \
1751 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1755 /* Returns the statement which defines this SSA name. */
1756 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1758 /* Returns the SSA version number of this SSA name. Note that in
1759 tree SSA, version numbers are not per variable and may be recycled. */
1760 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1762 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1763 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1765 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1766 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1768 /* Nonzero if this SSA_NAME expression is currently on the free list of
1769 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1770 has no meaning for an SSA_NAME. */
1771 #define SSA_NAME_IN_FREE_LIST(NODE) \
1772 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1774 /* Nonzero if this SSA_NAME is the default definition for the
1775 underlying symbol. A default SSA name is created for symbol S if
1776 the very first reference to S in the function is a read operation.
1777 Default definitions are always created by an empty statement and
1778 belong to no basic block. */
1779 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1780 SSA_NAME_CHECK (NODE)->base.default_def_flag
1782 /* Nonzero if this SSA_NAME is known to point to memory that may not
1783 be written to. This is set for default defs of function parameters
1784 that have a corresponding r or R specification in the functions
1785 fn spec attribute. This is used by alias analysis. */
1786 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1787 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1789 /* Attributes for SSA_NAMEs for pointer-type variables. */
1790 #define SSA_NAME_PTR_INFO(N) \
1791 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1793 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1794 #define SSA_NAME_ANTI_RANGE_P(N) \
1795 SSA_NAME_CHECK (N)->base.static_flag
1797 /* The type of range described by SSA_NAME_RANGE_INFO. */
1798 #define SSA_NAME_RANGE_TYPE(N) \
1799 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1801 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1802 #define SSA_NAME_RANGE_INFO(N) \
1803 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1805 /* Return the immediate_use information for an SSA_NAME. */
1806 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1808 #define OMP_CLAUSE_CODE(NODE) \
1809 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1811 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1812 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1814 #define OMP_CLAUSE_OPERAND(NODE, I) \
1815 OMP_CLAUSE_ELT_CHECK (NODE, I)
1817 /* In a BLOCK node. */
1818 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1819 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1820 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1821 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1822 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1823 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1824 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1825 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1826 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1827 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1828 #define BLOCK_ORIGIN(NODE) \
1829 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
1830 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1832 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1833 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1835 /* True if BLOCK appears in cold section. */
1836 #define BLOCK_IN_COLD_SECTION_P(NODE) \
1837 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
1839 /* An index number for this block. These values are not guaranteed to
1840 be unique across functions -- whether or not they are depends on
1841 the debugging output format in use. */
1842 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1844 /* If block reordering splits a lexical block into discontiguous
1845 address ranges, we'll make a copy of the original block.
1847 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1848 In that case, we have one source block that has been replicated
1849 (through inlining or unrolling) into many logical blocks, and that
1850 these logical blocks have different physical variables in them.
1852 In this case, we have one logical block split into several
1853 non-contiguous address ranges. Most debug formats can't actually
1854 represent this idea directly, so we fake it by creating multiple
1855 logical blocks with the same variables in them. However, for those
1856 that do support non-contiguous regions, these allow the original
1857 logical block to be reconstructed, along with the set of address
1860 One of the logical block fragments is arbitrarily chosen to be
1861 the ORIGIN. The other fragments will point to the origin via
1862 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1863 be null. The list of fragments will be chained through
1864 BLOCK_FRAGMENT_CHAIN from the origin. */
1866 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1867 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1869 /* For an inlined function, this gives the location where it was called
1870 from. This is only set in the top level block, which corresponds to the
1871 inlined function scope. This is used in the debug output routines. */
1873 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1875 /* This gives the location of the end of the block, useful to attach
1876 code implicitly generated for outgoing paths. */
1878 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1880 /* Define fields and accessors for nodes representing data types. */
1882 /* See tree.def for documentation of the use of these fields.
1883 Look at the documentation of the various ..._TYPE tree codes.
1885 Note that the type.values, type.minval, and type.maxval fields are
1886 overloaded and used for different macros in different kinds of types.
1887 Each macro must check to ensure the tree node is of the proper kind of
1888 type. Note also that some of the front-ends also overload these fields,
1889 so they must be checked as well. */
1891 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1892 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1893 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1894 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1895 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1896 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1897 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1898 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1899 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1900 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1902 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1903 #define TYPE_MODE(NODE) \
1904 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1905 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1906 #define SCALAR_TYPE_MODE(NODE) \
1907 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
1908 #define SCALAR_INT_TYPE_MODE(NODE) \
1909 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
1910 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
1911 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
1912 #define SET_TYPE_MODE(NODE, MODE) \
1913 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1915 extern machine_mode
element_mode (const_tree
);
1916 extern machine_mode
vector_type_mode (const_tree
);
1918 /* The "canonical" type for this type node, which is used by frontends to
1919 compare the type for equality with another type. If two types are
1920 equal (based on the semantics of the language), then they will have
1921 equivalent TYPE_CANONICAL entries.
1923 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1924 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1925 be used for comparison against other types. Instead, the type is
1926 said to require structural equality checks, described in
1927 TYPE_STRUCTURAL_EQUALITY_P.
1929 For unqualified aggregate and function types the middle-end relies on
1930 TYPE_CANONICAL to tell whether two variables can be assigned
1931 to each other without a conversion. The middle-end also makes sure
1932 to assign the same alias-sets to the type partition with equal
1933 TYPE_CANONICAL of their unqualified variants. */
1934 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1935 /* Indicates that the type node requires structural equality
1936 checks. The compiler will need to look at the composition of the
1937 type to determine whether it is equal to another type, rather than
1938 just comparing canonical type pointers. For instance, we would need
1939 to look at the return and parameter types of a FUNCTION_TYPE
1941 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1942 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1943 type node requires structural equality. */
1944 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1946 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1947 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1949 /* The (language-specific) typed-based alias set for this type.
1950 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1951 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1952 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1953 type can alias objects of any type. */
1954 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1956 /* Nonzero iff the typed-based alias set for this type has been
1958 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1959 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1961 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1963 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1965 /* The alignment necessary for objects of this type.
1966 The value is an int, measured in bits and must be a power of two.
1967 We support also an "alignment" of zero. */
1968 #define TYPE_ALIGN(NODE) \
1969 (TYPE_CHECK (NODE)->type_common.align \
1970 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
1972 /* Specify that TYPE_ALIGN(NODE) is X. */
1973 #define SET_TYPE_ALIGN(NODE, X) \
1974 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
1976 /* 1 if the alignment for this type was requested by "aligned" attribute,
1977 0 if it is the default for this type. */
1978 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1980 /* The alignment for NODE, in bytes. */
1981 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1983 /* The minimum alignment necessary for objects of this type without
1984 warning. The value is an int, measured in bits. */
1985 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
1986 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
1987 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
1989 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
1990 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
1991 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
1993 /* If your language allows you to declare types, and you want debug info
1994 for them, then you need to generate corresponding TYPE_DECL nodes.
1995 These "stub" TYPE_DECL nodes have no name, and simply point at the
1996 type node. You then set the TYPE_STUB_DECL field of the type node
1997 to point back at the TYPE_DECL node. This allows the debug routines
1998 to know that the two nodes represent the same type, so that we only
1999 get one debug info record for them. */
2000 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2002 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2003 the type has BLKmode only because it lacks the alignment required for
2005 #define TYPE_NO_FORCE_BLK(NODE) \
2006 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2008 /* Nonzero in a type considered volatile as a whole. */
2009 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2011 /* Nonzero in a type considered atomic as a whole. */
2012 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2014 /* Means this type is const-qualified. */
2015 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2017 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2019 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2021 /* If nonzero, type's name shouldn't be emitted into debug info. */
2022 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2024 /* The address space the type is in. */
2025 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2027 /* Encode/decode the named memory support as part of the qualifier. If more
2028 than 8 qualifiers are added, these macros need to be adjusted. */
2029 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2030 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2032 /* Return all qualifiers except for the address space qualifiers. */
2033 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2035 /* Only keep the address space out of the qualifiers and discard the other
2037 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2039 /* The set of type qualifiers for this type. */
2040 #define TYPE_QUALS(NODE) \
2041 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2042 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2043 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2044 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2045 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2047 /* The same as TYPE_QUALS without the address space qualifications. */
2048 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2049 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2050 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2051 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2052 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2054 /* The same as TYPE_QUALS without the address space and atomic
2056 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2057 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2058 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2059 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2061 /* These flags are available for each language front end to use internally. */
2062 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2063 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2064 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2065 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2066 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2067 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2068 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2069 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2071 /* Used to keep track of visited nodes in tree traversals. This is set to
2072 0 by copy_node and make_node. */
2073 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2075 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2076 that distinguish string from array of char).
2077 If set in a INTEGER_TYPE, indicates a character type. */
2078 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
2080 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2081 about missing conversions to other vector types of the same size. */
2082 #define TYPE_VECTOR_OPAQUE(NODE) \
2083 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2085 /* Indicates that objects of this type must be initialized by calling a
2086 function when they are created. */
2087 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2088 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2090 /* Indicates that a UNION_TYPE object should be passed the same way that
2091 the first union alternative would be passed, or that a RECORD_TYPE
2092 object should be passed the same way that the first (and only) member
2094 #define TYPE_TRANSPARENT_AGGR(NODE) \
2095 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2097 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2098 address of a component of the type. This is the counterpart of
2099 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2100 #define TYPE_NONALIASED_COMPONENT(NODE) \
2101 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2103 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2104 whether the array is typeless storage or the type contains a member
2105 with this flag set. Such types are exempt from type-based alias
2106 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2107 the flag should be inherited from the element type, can change
2108 when type is finalized and because of that should not be used in
2109 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2110 the flag should not be changed after the array is created and should
2111 be used in type hashing. */
2112 #define TYPE_TYPELESS_STORAGE(NODE) \
2113 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2114 ARRAY_TYPE)->type_common.typeless_storage)
2116 /* Indicated that objects of this type should be laid out in as
2117 compact a way as possible. */
2118 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2120 /* Used by type_contains_placeholder_p to avoid recomputation.
2121 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2122 this field directly. */
2123 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2124 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2126 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2127 #define TYPE_FINAL_P(NODE) \
2128 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2130 /* The debug output functions use the symtab union field to store
2131 information specific to the debugging format. The different debug
2132 output hooks store different types in the union field. These three
2133 macros are used to access different fields in the union. The debug
2134 hooks are responsible for consistently using only a specific
2137 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2138 hold the type's number in the generated stabs. */
2139 #define TYPE_SYMTAB_ADDRESS(NODE) \
2140 (TYPE_CHECK (NODE)->type_common.symtab.address)
2142 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2143 in dwarf2out.c to point to the DIE generated for the type. */
2144 #define TYPE_SYMTAB_DIE(NODE) \
2145 (TYPE_CHECK (NODE)->type_common.symtab.die)
2147 /* The garbage collector needs to know the interpretation of the
2148 symtab field. These constants represent the different types in the
2151 #define TYPE_SYMTAB_IS_ADDRESS (0)
2152 #define TYPE_SYMTAB_IS_DIE (1)
2154 #define TYPE_LANG_SPECIFIC(NODE) \
2155 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2157 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2158 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2159 #define TYPE_FIELDS(NODE) \
2160 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2161 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2162 #define TYPE_ARG_TYPES(NODE) \
2163 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2164 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2166 #define TYPE_MIN_VALUE(NODE) \
2167 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2168 #define TYPE_NEXT_PTR_TO(NODE) \
2169 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2170 #define TYPE_NEXT_REF_TO(NODE) \
2171 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2172 #define TYPE_VFIELD(NODE) \
2173 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2174 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2176 #define TYPE_MAX_VALUE(NODE) \
2177 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2178 #define TYPE_METHOD_BASETYPE(NODE) \
2179 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2180 #define TYPE_OFFSET_BASETYPE(NODE) \
2181 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2182 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2183 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2185 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2186 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2187 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2188 /* For record and union types, information about this type, as a base type
2190 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2192 /* For types, used in a language-dependent way. */
2193 #define TYPE_LANG_SLOT_1(NODE) \
2194 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2196 /* Define accessor macros for information about type inheritance
2199 A "basetype" means a particular usage of a data type for inheritance
2200 in another type. Each such basetype usage has its own "binfo"
2201 object to describe it. The binfo object is a TREE_VEC node.
2203 Inheritance is represented by the binfo nodes allocated for a
2204 given type. For example, given types C and D, such that D is
2205 inherited by C, 3 binfo nodes will be allocated: one for describing
2206 the binfo properties of C, similarly one for D, and one for
2207 describing the binfo properties of D as a base type for C.
2208 Thus, given a pointer to class C, one can get a pointer to the binfo
2209 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2211 /* BINFO specific flags. */
2213 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2214 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2216 /* Flags for language dependent use. */
2217 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2218 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2219 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2220 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2221 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2222 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2223 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2225 /* The actual data type node being inherited in this basetype. */
2226 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2228 /* The offset where this basetype appears in its containing type.
2229 BINFO_OFFSET slot holds the offset (in bytes)
2230 from the base of the complete object to the base of the part of the
2231 object that is allocated on behalf of this `type'.
2232 This is always 0 except when there is multiple inheritance. */
2234 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2235 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2237 /* The virtual function table belonging to this basetype. Virtual
2238 function tables provide a mechanism for run-time method dispatching.
2239 The entries of a virtual function table are language-dependent. */
2241 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2243 /* The virtual functions in the virtual function table. This is
2244 a TREE_LIST that is used as an initial approximation for building
2245 a virtual function table for this basetype. */
2246 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2248 /* A vector of binfos for the direct basetypes inherited by this
2251 If this basetype describes type D as inherited in C, and if the
2252 basetypes of D are E and F, then this vector contains binfos for
2253 inheritance of E and F by C. */
2254 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2256 /* The number of basetypes for NODE. */
2257 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2259 /* Accessor macro to get to the Nth base binfo of this binfo. */
2260 #define BINFO_BASE_BINFO(NODE,N) \
2261 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2262 #define BINFO_BASE_ITERATE(NODE,N,B) \
2263 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2264 #define BINFO_BASE_APPEND(NODE,T) \
2265 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2267 /* For a BINFO record describing a virtual base class, i.e., one where
2268 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2269 base. The actual contents are language-dependent. In the C++
2270 front-end this field is an INTEGER_CST giving an offset into the
2271 vtable where the offset to the virtual base can be found. */
2272 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2274 /* Indicates the accesses this binfo has to its bases. The values are
2275 access_public_node, access_protected_node or access_private_node.
2276 If this array is not present, public access is implied. */
2277 #define BINFO_BASE_ACCESSES(NODE) \
2278 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2280 #define BINFO_BASE_ACCESS(NODE,N) \
2281 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2282 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2283 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2285 /* The index in the VTT where this subobject's sub-VTT can be found.
2286 NULL_TREE if there is no sub-VTT. */
2287 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2289 /* The index in the VTT where the vptr for this subobject can be
2290 found. NULL_TREE if there is no secondary vptr in the VTT. */
2291 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2293 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2294 inheriting this base for non-virtual bases. For virtual bases it
2295 points either to the binfo for which this is a primary binfo, or to
2296 the binfo of the most derived type. */
2297 #define BINFO_INHERITANCE_CHAIN(NODE) \
2298 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2301 /* Define fields and accessors for nodes representing declared names. */
2303 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2304 have an associated SSA name. */
2305 #define SSA_VAR_P(DECL) \
2306 (TREE_CODE (DECL) == VAR_DECL \
2307 || TREE_CODE (DECL) == PARM_DECL \
2308 || TREE_CODE (DECL) == RESULT_DECL \
2309 || TREE_CODE (DECL) == SSA_NAME)
2312 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2314 /* This is the name of the object as written by the user.
2315 It is an IDENTIFIER_NODE. */
2316 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2318 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2319 #define TYPE_IDENTIFIER(NODE) \
2320 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2321 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2323 /* Every ..._DECL node gets a unique number. */
2324 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2326 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2328 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2330 /* Every ..._DECL node gets a unique number that stays the same even
2331 when the decl is copied by the inliner once it is set. */
2332 #define DECL_PT_UID(NODE) \
2333 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2334 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2335 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2336 #define SET_DECL_PT_UID(NODE, UID) \
2337 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2338 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2339 be preserved when copyin the decl. */
2340 #define DECL_PT_UID_SET_P(NODE) \
2341 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2343 /* These two fields describe where in the source code the declaration
2344 was. If the declaration appears in several places (as for a C
2345 function that is declared first and then defined later), this
2346 information should refer to the definition. */
2347 #define DECL_SOURCE_LOCATION(NODE) \
2348 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2349 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2350 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2351 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2352 /* This accessor returns TRUE if the decl it operates on was created
2353 by a front-end or back-end rather than by user code. In this case
2354 builtin-ness is indicated by source location. */
2355 #define DECL_IS_BUILTIN(DECL) \
2356 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2358 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2359 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2360 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2361 nodes, this points to either the FUNCTION_DECL for the containing
2362 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2363 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2364 scope". In particular, for VAR_DECLs which are virtual table pointers
2365 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2367 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2368 #define DECL_FIELD_CONTEXT(NODE) \
2369 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2371 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2372 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2374 /* For any sort of a ..._DECL node, this points to the original (abstract)
2375 decl node which this decl is an inlined/cloned instance of, or else it
2376 is NULL indicating that this decl is not an instance of some other decl.
2378 The C front-end also uses this in a nested declaration of an inline
2379 function, to point back to the definition. */
2380 #define DECL_ABSTRACT_ORIGIN(NODE) \
2381 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2383 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2384 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2385 #define DECL_ORIGIN(NODE) \
2386 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2388 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2389 inline instance of some original (abstract) decl from an inline function;
2390 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2391 nodes can also have their abstract origin set to themselves. */
2392 #define DECL_FROM_INLINE(NODE) \
2393 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2394 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2396 /* In a DECL this is the field where attributes are stored. */
2397 #define DECL_ATTRIBUTES(NODE) \
2398 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2400 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2401 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2402 For a VAR_DECL, holds the initial value.
2403 For a PARM_DECL, used for DECL_ARG_TYPE--default
2404 values for parameters are encoded in the type of the function,
2405 not in the PARM_DECL slot.
2406 For a FIELD_DECL, this is used for enumeration values and the C
2407 frontend uses it for temporarily storing bitwidth of bitfields.
2409 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2410 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2412 /* Holds the size of the datum, in bits, as a tree expression.
2413 Need not be constant. */
2414 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2415 /* Likewise for the size in bytes. */
2416 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2417 /* Returns the alignment required for the datum, in bits. It must
2418 be a power of two, but an "alignment" of zero is supported
2419 (e.g. as "uninitialized" sentinel). */
2420 #define DECL_ALIGN(NODE) \
2421 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2422 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2423 /* Specify that DECL_ALIGN(NODE) is X. */
2424 #define SET_DECL_ALIGN(NODE, X) \
2425 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2427 /* The minimum alignment necessary for the datum, in bits, without
2429 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2430 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \
2431 ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0)
2433 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2434 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2435 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X))
2437 /* The alignment of NODE, in bytes. */
2438 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2439 /* Set if the alignment of this DECL has been set by the user, for
2440 example with an 'aligned' attribute. */
2441 #define DECL_USER_ALIGN(NODE) \
2442 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2443 /* Holds the machine mode corresponding to the declaration of a variable or
2444 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2446 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2447 #define SET_DECL_MODE(NODE, MODE) \
2448 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2450 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2451 operation it is. Note, however, that this field is overloaded, with
2452 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2453 checked before any access to the former. */
2454 #define DECL_FUNCTION_CODE(NODE) \
2455 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2457 /* Test if FCODE is a function code for an alloca operation. */
2458 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2459 ((FCODE) == BUILT_IN_ALLOCA \
2460 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2461 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2463 /* Generate case for an alloca operation. */
2464 #define CASE_BUILT_IN_ALLOCA \
2465 case BUILT_IN_ALLOCA: \
2466 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2467 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2469 #define DECL_FUNCTION_PERSONALITY(NODE) \
2470 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2472 /* Nonzero for a given ..._DECL node means that the name of this node should
2473 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2474 the associated type should be ignored. For a FUNCTION_DECL, the body of
2475 the function should also be ignored. */
2476 #define DECL_IGNORED_P(NODE) \
2477 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2479 /* Nonzero for a given ..._DECL node means that this node represents an
2480 "abstract instance" of the given declaration (e.g. in the original
2481 declaration of an inline function). When generating symbolic debugging
2482 information, we mustn't try to generate any address information for nodes
2483 marked as "abstract instances" because we don't actually generate
2484 any code or allocate any data space for such instances. */
2485 #define DECL_ABSTRACT_P(NODE) \
2486 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2488 /* Language-specific decl information. */
2489 #define DECL_LANG_SPECIFIC(NODE) \
2490 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2492 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2493 do not allocate storage, and refer to a definition elsewhere. Note that
2494 this does not necessarily imply the entity represented by NODE
2495 has no program source-level definition in this translation unit. For
2496 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2497 DECL_EXTERNAL may be true simultaneously; that can be the case for
2498 a C99 "extern inline" function. */
2499 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2501 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2502 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2504 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2506 Also set in some languages for variables, etc., outside the normal
2507 lexical scope, such as class instance variables. */
2508 #define DECL_NONLOCAL(NODE) \
2509 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2511 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2512 Used in FIELD_DECLs for vtable pointers.
2513 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2514 #define DECL_VIRTUAL_P(NODE) \
2515 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2517 /* Used to indicate that this DECL represents a compiler-generated entity. */
2518 #define DECL_ARTIFICIAL(NODE) \
2519 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2521 /* Additional flags for language-specific uses. */
2522 #define DECL_LANG_FLAG_0(NODE) \
2523 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2524 #define DECL_LANG_FLAG_1(NODE) \
2525 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2526 #define DECL_LANG_FLAG_2(NODE) \
2527 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2528 #define DECL_LANG_FLAG_3(NODE) \
2529 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2530 #define DECL_LANG_FLAG_4(NODE) \
2531 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2532 #define DECL_LANG_FLAG_5(NODE) \
2533 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2534 #define DECL_LANG_FLAG_6(NODE) \
2535 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2536 #define DECL_LANG_FLAG_7(NODE) \
2537 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2538 #define DECL_LANG_FLAG_8(NODE) \
2539 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2541 /* Nonzero for a scope which is equal to file scope. */
2542 #define SCOPE_FILE_SCOPE_P(EXP) \
2543 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2544 /* Nonzero for a decl which is at file scope. */
2545 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2546 /* Nonzero for a type which is at file scope. */
2547 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2549 /* Nonzero for a decl that is decorated using attribute used.
2550 This indicates to compiler tools that this decl needs to be preserved. */
2551 #define DECL_PRESERVE_P(DECL) \
2552 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2554 /* For function local variables of COMPLEX and VECTOR types,
2555 indicates that the variable is not aliased, and that all
2556 modifications to the variable have been adjusted so that
2557 they are killing assignments. Thus the variable may now
2558 be treated as a GIMPLE register, and use real instead of
2559 virtual ops in SSA form. */
2560 #define DECL_GIMPLE_REG_P(DECL) \
2561 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2563 extern tree
decl_value_expr_lookup (tree
);
2564 extern void decl_value_expr_insert (tree
, tree
);
2566 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2567 if transformations have made this more complicated than evaluating the
2569 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2570 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2571 ->decl_common.decl_flag_2)
2572 #define DECL_VALUE_EXPR(NODE) \
2573 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2574 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2575 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2577 /* Holds the RTL expression for the value of a variable or function.
2578 This value can be evaluated lazily for functions, variables with
2579 static storage duration, and labels. */
2580 #define DECL_RTL(NODE) \
2581 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2582 ? (NODE)->decl_with_rtl.rtl \
2583 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2585 /* Set the DECL_RTL for NODE to RTL. */
2586 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2588 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2589 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2591 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2592 #define DECL_RTL_SET_P(NODE) \
2593 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2595 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2596 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2597 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2598 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2599 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2601 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2602 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2604 #if (GCC_VERSION >= 2007)
2605 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2606 ({ tree const __d = (decl); \
2607 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2608 /* Dereference it so the compiler knows it can't be NULL even \
2609 without assertion checking. */ \
2610 &*DECL_RTL_IF_SET (__d); })
2612 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2615 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2616 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2618 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2619 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2620 of the structure. */
2621 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2623 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2624 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2625 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2626 natural alignment of the field's type). */
2627 #define DECL_FIELD_BIT_OFFSET(NODE) \
2628 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2630 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2631 if so, the type that was originally specified for it.
2632 TREE_TYPE may have been modified (in finish_struct). */
2633 #define DECL_BIT_FIELD_TYPE(NODE) \
2634 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2636 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2637 representative FIELD_DECL. */
2638 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2639 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2641 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2642 if nonzero, indicates that the field occupies the type. */
2643 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2645 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2646 DECL_FIELD_OFFSET which are known to be always zero.
2647 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2649 #define DECL_OFFSET_ALIGN(NODE) \
2650 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2652 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2653 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2654 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2656 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2657 which this FIELD_DECL is defined. This information is needed when
2658 writing debugging information about vfield and vbase decls for C++. */
2659 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2661 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2662 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2664 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2666 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2668 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2669 this component. This makes it possible for Type-Based Alias Analysis
2670 to disambiguate accesses to this field with indirect accesses using
2673 struct S { int i; } s;
2676 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2678 From the implementation's viewpoint, the alias set of the type of the
2679 field 'i' (int) will not be recorded as a subset of that of the type of
2680 's' (struct S) in record_component_aliases. The counterpart is that
2681 accesses to s.i must not be given the alias set of the type of 'i'
2682 (int) but instead directly that of the type of 's' (struct S). */
2683 #define DECL_NONADDRESSABLE_P(NODE) \
2684 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2686 /* Used in a FIELD_DECL to indicate that this field is padding. */
2687 #define DECL_PADDING_P(NODE) \
2688 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2690 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2691 dense, unique within any one function, and may be used to index arrays.
2692 If the value is -1, then no UID has been assigned. */
2693 #define LABEL_DECL_UID(NODE) \
2694 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2696 /* In a LABEL_DECL, the EH region number for which the label is the
2697 post_landing_pad. */
2698 #define EH_LANDING_PAD_NR(NODE) \
2699 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2701 /* For a PARM_DECL, records the data type used to pass the argument,
2702 which may be different from the type seen in the program. */
2703 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2705 /* For PARM_DECL, holds an RTL for the stack slot or register
2706 where the data was actually passed. */
2707 #define DECL_INCOMING_RTL(NODE) \
2708 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2710 /* Nonzero for a given ..._DECL node means that no warnings should be
2711 generated just because this node is unused. */
2712 #define DECL_IN_SYSTEM_HEADER(NODE) \
2713 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2715 /* Used to indicate that the linkage status of this DECL is not yet known,
2716 so it should not be output now. */
2717 #define DECL_DEFER_OUTPUT(NODE) \
2718 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2720 /* In a VAR_DECL that's static,
2721 nonzero if the space is in the text section. */
2722 #define DECL_IN_TEXT_SECTION(NODE) \
2723 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2725 /* In a VAR_DECL that's static,
2726 nonzero if it belongs to the global constant pool. */
2727 #define DECL_IN_CONSTANT_POOL(NODE) \
2728 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2730 /* Nonzero for a given ..._DECL node means that this node should be
2731 put in .common, if possible. If a DECL_INITIAL is given, and it
2732 is not error_mark_node, then the decl cannot be put in .common. */
2733 #define DECL_COMMON(NODE) \
2734 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2736 /* In a VAR_DECL, nonzero if the decl is a register variable with
2737 an explicit asm specification. */
2738 #define DECL_HARD_REGISTER(NODE) \
2739 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2741 /* Used to indicate that this DECL has weak linkage. */
2742 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2744 /* Used to indicate that the DECL is a dllimport. */
2745 #define DECL_DLLIMPORT_P(NODE) \
2746 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2748 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2749 not be put out unless it is needed in this translation unit.
2750 Entities like this are shared across translation units (like weak
2751 entities), but are guaranteed to be generated by any translation
2752 unit that needs them, and therefore need not be put out anywhere
2753 where they are not needed. DECL_COMDAT is just a hint to the
2754 back-end; it is up to front-ends which set this flag to ensure
2755 that there will never be any harm, other than bloat, in putting out
2756 something which is DECL_COMDAT. */
2757 #define DECL_COMDAT(NODE) \
2758 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2760 #define DECL_COMDAT_GROUP(NODE) \
2761 decl_comdat_group (NODE)
2763 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2764 multiple translation units should be merged. */
2765 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2766 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2768 /* The name of the object as the assembler will see it (but before any
2769 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2770 as DECL_NAME. It is an IDENTIFIER_NODE.
2772 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2773 One Definition Rule based type merging at LTO. It is computed only for
2774 LTO compilation and C++. */
2775 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2777 /* Raw accessor for DECL_ASSEMBLE_NAME. */
2778 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
2779 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
2781 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2782 This is true of all DECL nodes except FIELD_DECL. */
2783 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2784 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2786 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2787 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2789 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2790 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
2792 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2793 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2794 overwrite_decl_assembler_name (NODE, NAME)
2796 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
2797 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
2798 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
2799 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
2800 other words, the semantics of using this macro, are different than
2803 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
2805 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
2807 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
2808 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
2810 /* Records the section name in a section attribute. Used to pass
2811 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2812 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2814 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2815 this variable in a BIND_EXPR. */
2816 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2817 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2819 /* Value of the decls's visibility attribute */
2820 #define DECL_VISIBILITY(NODE) \
2821 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2823 /* Nonzero means that the decl had its visibility specified rather than
2825 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2826 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2828 /* In a VAR_DECL, the model to use if the data should be allocated from
2829 thread-local storage. */
2830 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2832 /* In a VAR_DECL, nonzero if the data should be allocated from
2833 thread-local storage. */
2834 #define DECL_THREAD_LOCAL_P(NODE) \
2835 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2837 /* In a non-local VAR_DECL with static storage duration, true if the
2838 variable has an initialization priority. If false, the variable
2839 will be initialized at the DEFAULT_INIT_PRIORITY. */
2840 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2841 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2843 extern tree
decl_debug_expr_lookup (tree
);
2844 extern void decl_debug_expr_insert (tree
, tree
);
2846 /* For VAR_DECL, this is set to an expression that it was split from. */
2847 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2848 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2849 #define DECL_DEBUG_EXPR(NODE) \
2850 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2852 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2853 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2855 extern priority_type
decl_init_priority_lookup (tree
);
2856 extern priority_type
decl_fini_priority_lookup (tree
);
2857 extern void decl_init_priority_insert (tree
, priority_type
);
2858 extern void decl_fini_priority_insert (tree
, priority_type
);
2860 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2862 #define DECL_INIT_PRIORITY(NODE) \
2863 (decl_init_priority_lookup (NODE))
2864 /* Set the initialization priority for NODE to VAL. */
2865 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2866 (decl_init_priority_insert (NODE, VAL))
2868 /* For a FUNCTION_DECL the finalization priority of NODE. */
2869 #define DECL_FINI_PRIORITY(NODE) \
2870 (decl_fini_priority_lookup (NODE))
2871 /* Set the finalization priority for NODE to VAL. */
2872 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2873 (decl_fini_priority_insert (NODE, VAL))
2875 /* The initialization priority for entities for which no explicit
2876 initialization priority has been specified. */
2877 #define DEFAULT_INIT_PRIORITY 65535
2879 /* The maximum allowed initialization priority. */
2880 #define MAX_INIT_PRIORITY 65535
2882 /* The largest priority value reserved for use by system runtime
2884 #define MAX_RESERVED_INIT_PRIORITY 100
2886 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2887 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2888 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2890 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2891 #define DECL_NONLOCAL_FRAME(NODE) \
2892 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2894 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2895 #define DECL_NONALIASED(NODE) \
2896 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2898 /* This field is used to reference anything in decl.result and is meant only
2899 for use by the garbage collector. */
2900 #define DECL_RESULT_FLD(NODE) \
2901 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2903 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2904 Before the struct containing the FUNCTION_DECL is laid out,
2905 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2906 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2907 function. When the class is laid out, this pointer is changed
2908 to an INTEGER_CST node which is suitable for use as an index
2909 into the virtual function table. */
2910 #define DECL_VINDEX(NODE) \
2911 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2913 /* In FUNCTION_DECL, holds the decl for the return value. */
2914 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2916 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2917 #define DECL_UNINLINABLE(NODE) \
2918 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2920 /* In a FUNCTION_DECL, the saved representation of the body of the
2922 #define DECL_SAVED_TREE(NODE) \
2923 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2925 /* Nonzero in a FUNCTION_DECL means this function should be treated
2926 as if it were a malloc, meaning it returns a pointer that is
2928 #define DECL_IS_MALLOC(NODE) \
2929 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2931 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2932 C++ operator new, meaning that it returns a pointer for which we
2933 should not use type based aliasing. */
2934 #define DECL_IS_OPERATOR_NEW(NODE) \
2935 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2937 /* Nonzero in a FUNCTION_DECL means this function may return more
2939 #define DECL_IS_RETURNS_TWICE(NODE) \
2940 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2942 /* Nonzero in a FUNCTION_DECL means this function should be treated
2943 as "pure" function (like const function, but may read global memory). */
2944 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2946 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2947 the const or pure function may not terminate. When this is nonzero
2948 for a const or pure function, it can be dealt with by cse passes
2949 but cannot be removed by dce passes since you are not allowed to
2950 change an infinite looping program into one that terminates without
2952 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2953 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2955 /* Nonzero in a FUNCTION_DECL means this function should be treated
2956 as "novops" function (function that does not read global memory,
2957 but may have arbitrary side effects). */
2958 #define DECL_IS_NOVOPS(NODE) \
2959 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2961 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2962 at the beginning or end of execution. */
2963 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2964 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2966 #define DECL_STATIC_DESTRUCTOR(NODE) \
2967 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2969 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2970 be instrumented with calls to support routines. */
2971 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2972 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2974 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2975 disabled in this function. */
2976 #define DECL_NO_LIMIT_STACK(NODE) \
2977 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2979 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2980 #define DECL_STATIC_CHAIN(NODE) \
2981 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2983 /* Nonzero for a decl that cgraph has decided should be inlined into
2984 at least one call site. It is not meaningful to look at this
2985 directly; always use cgraph_function_possibly_inlined_p. */
2986 #define DECL_POSSIBLY_INLINED(DECL) \
2987 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2989 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2990 such as via the `inline' keyword in C/C++. This flag controls the linkage
2991 semantics of 'inline' */
2992 #define DECL_DECLARED_INLINE_P(NODE) \
2993 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2995 /* Nonzero in a FUNCTION_DECL means this function should not get
2996 -Winline warnings. */
2997 #define DECL_NO_INLINE_WARNING_P(NODE) \
2998 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3000 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3001 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3002 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3004 /* Nonzero if a FUNCTION_CODE is a TM load. */
3005 #define BUILTIN_TM_LOAD_P(FN) \
3006 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3008 /* Nonzero if a FUNCTION_CODE is a TM store. */
3009 #define BUILTIN_TM_STORE_P(FN) \
3010 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3012 #define CASE_BUILT_IN_TM_LOAD(FN) \
3013 case BUILT_IN_TM_LOAD_##FN: \
3014 case BUILT_IN_TM_LOAD_RAR_##FN: \
3015 case BUILT_IN_TM_LOAD_RAW_##FN: \
3016 case BUILT_IN_TM_LOAD_RFW_##FN
3018 #define CASE_BUILT_IN_TM_STORE(FN) \
3019 case BUILT_IN_TM_STORE_##FN: \
3020 case BUILT_IN_TM_STORE_WAR_##FN: \
3021 case BUILT_IN_TM_STORE_WAW_##FN
3023 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3024 disregarding size and cost heuristics. This is equivalent to using
3025 the always_inline attribute without the required diagnostics if the
3026 function cannot be inlined. */
3027 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3028 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3030 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3031 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3033 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3034 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3035 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3037 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3038 that describes the status of this function. */
3039 #define DECL_STRUCT_FUNCTION(NODE) \
3040 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3043 /* For a builtin function, identify which part of the compiler defined it. */
3044 #define DECL_BUILT_IN_CLASS(NODE) \
3045 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3047 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3048 #define DECL_ARGUMENTS(NODE) \
3049 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3051 /* In FUNCTION_DECL, the function specific target options to use when compiling
3053 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3054 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3056 /* In FUNCTION_DECL, the function specific optimization options to use when
3057 compiling this function. */
3058 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3059 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3061 /* In FUNCTION_DECL, this is set if this function has other versions generated
3062 using "target" attributes. The default version is the one which does not
3063 have any "target" attribute set. */
3064 #define DECL_FUNCTION_VERSIONED(NODE)\
3065 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3067 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3068 Devirtualization machinery uses this knowledge for determing type of the
3069 object constructed. Also we assume that constructor address is not
3071 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3072 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3074 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3075 Devirtualization machinery uses this to track types in destruction. */
3076 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3077 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3079 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3080 #define DECL_LAMBDA_FUNCTION(NODE) \
3081 (FUNCTION_DECL_CHECK (NODE)->function_decl.lambda_function)
3083 /* In FUNCTION_DECL that represent an virtual method this is set when
3084 the method is final. */
3085 #define DECL_FINAL_P(NODE)\
3086 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3088 /* The source language of the translation-unit. */
3089 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3090 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3092 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3094 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3095 #define DECL_ORIGINAL_TYPE(NODE) \
3096 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3098 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3099 into stabs. Instead it will generate cross reference ('x') of names.
3100 This uses the same flag as DECL_EXTERNAL. */
3101 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3102 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3104 /* Getter of the imported declaration associated to the
3105 IMPORTED_DECL node. */
3106 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3107 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3109 /* Getter of the symbol declaration associated with the
3110 NAMELIST_DECL node. */
3111 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3112 (DECL_INITIAL (NODE))
3114 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3115 To reduce overhead, the nodes containing the statements are not trees.
3116 This avoids the overhead of tree_common on all linked list elements.
3118 Use the interface in tree-iterator.h to access this node. */
3120 #define STATEMENT_LIST_HEAD(NODE) \
3121 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3122 #define STATEMENT_LIST_TAIL(NODE) \
3123 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3125 #define TREE_OPTIMIZATION(NODE) \
3126 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3128 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3129 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3131 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3132 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3134 /* Return a tree node that encapsulates the optimization options in OPTS. */
3135 extern tree
build_optimization_node (struct gcc_options
*opts
);
3137 #define TREE_TARGET_OPTION(NODE) \
3138 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3140 #define TREE_TARGET_GLOBALS(NODE) \
3141 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3143 /* Return a tree node that encapsulates the target options in OPTS. */
3144 extern tree
build_target_option_node (struct gcc_options
*opts
);
3146 extern void prepare_target_option_nodes_for_pch (void);
3148 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3151 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3153 if (TREE_CODE (__t
) != __c
)
3154 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3159 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3162 if (TREE_CODE (__t
) == __c
)
3163 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3168 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3169 enum tree_code __c1
, enum tree_code __c2
)
3171 if (TREE_CODE (__t
) != __c1
3172 && TREE_CODE (__t
) != __c2
)
3173 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3178 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3179 enum tree_code __c1
, enum tree_code __c2
)
3181 if (TREE_CODE (__t
) == __c1
3182 || TREE_CODE (__t
) == __c2
)
3183 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3188 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3189 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3191 if (TREE_CODE (__t
) != __c1
3192 && TREE_CODE (__t
) != __c2
3193 && TREE_CODE (__t
) != __c3
)
3194 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3199 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3200 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3202 if (TREE_CODE (__t
) == __c1
3203 || TREE_CODE (__t
) == __c2
3204 || TREE_CODE (__t
) == __c3
)
3205 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3210 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3211 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3212 enum tree_code __c4
)
3214 if (TREE_CODE (__t
) != __c1
3215 && TREE_CODE (__t
) != __c2
3216 && TREE_CODE (__t
) != __c3
3217 && TREE_CODE (__t
) != __c4
)
3218 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3223 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3224 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3225 enum tree_code __c4
)
3227 if (TREE_CODE (__t
) == __c1
3228 || TREE_CODE (__t
) == __c2
3229 || TREE_CODE (__t
) == __c3
3230 || TREE_CODE (__t
) == __c4
)
3231 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3236 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3237 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3238 enum tree_code __c4
, enum tree_code __c5
)
3240 if (TREE_CODE (__t
) != __c1
3241 && TREE_CODE (__t
) != __c2
3242 && TREE_CODE (__t
) != __c3
3243 && TREE_CODE (__t
) != __c4
3244 && TREE_CODE (__t
) != __c5
)
3245 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3250 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3251 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3252 enum tree_code __c4
, enum tree_code __c5
)
3254 if (TREE_CODE (__t
) == __c1
3255 || TREE_CODE (__t
) == __c2
3256 || TREE_CODE (__t
) == __c3
3257 || TREE_CODE (__t
) == __c4
3258 || TREE_CODE (__t
) == __c5
)
3259 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3264 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3265 const char *__f
, int __l
, const char *__g
)
3267 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3268 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3273 tree_class_check (tree __t
, const enum tree_code_class __class
,
3274 const char *__f
, int __l
, const char *__g
)
3276 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3277 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3282 tree_range_check (tree __t
,
3283 enum tree_code __code1
, enum tree_code __code2
,
3284 const char *__f
, int __l
, const char *__g
)
3286 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3287 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3292 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3293 const char *__f
, int __l
, const char *__g
)
3295 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3296 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3297 if (__t
->omp_clause
.code
!= __code
)
3298 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3303 omp_clause_range_check (tree __t
,
3304 enum omp_clause_code __code1
,
3305 enum omp_clause_code __code2
,
3306 const char *__f
, int __l
, const char *__g
)
3308 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3309 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3310 if ((int) __t
->omp_clause
.code
< (int) __code1
3311 || (int) __t
->omp_clause
.code
> (int) __code2
)
3312 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3316 /* These checks have to be special cased. */
3319 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3321 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3322 if (!IS_EXPR_CODE_CLASS (__c
))
3323 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3327 /* These checks have to be special cased. */
3330 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3333 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3337 inline const HOST_WIDE_INT
*
3338 tree_int_cst_elt_check (const_tree __t
, int __i
,
3339 const char *__f
, int __l
, const char *__g
)
3341 if (TREE_CODE (__t
) != INTEGER_CST
)
3342 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3343 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3344 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3346 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3349 inline HOST_WIDE_INT
*
3350 tree_int_cst_elt_check (tree __t
, int __i
,
3351 const char *__f
, int __l
, const char *__g
)
3353 if (TREE_CODE (__t
) != INTEGER_CST
)
3354 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3355 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3356 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3358 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3361 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3363 # if GCC_VERSION >= 4006
3364 #pragma GCC diagnostic push
3365 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3369 tree_vec_elt_check (tree __t
, int __i
,
3370 const char *__f
, int __l
, const char *__g
)
3372 if (TREE_CODE (__t
) != TREE_VEC
)
3373 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3374 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3375 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3376 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3379 # if GCC_VERSION >= 4006
3380 #pragma GCC diagnostic pop
3384 omp_clause_elt_check (tree __t
, int __i
,
3385 const char *__f
, int __l
, const char *__g
)
3387 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3388 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3389 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3390 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3391 return &__t
->omp_clause
.ops
[__i
];
3394 /* These checks have to be special cased. */
3397 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3399 if (!ANY_INTEGRAL_TYPE_P (__t
))
3400 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3406 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3409 if (TREE_CODE (__t
) != __c
)
3410 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3415 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3418 if (TREE_CODE (__t
) == __c
)
3419 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3424 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3425 enum tree_code __c1
, enum tree_code __c2
)
3427 if (TREE_CODE (__t
) != __c1
3428 && TREE_CODE (__t
) != __c2
)
3429 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3434 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3435 enum tree_code __c1
, enum tree_code __c2
)
3437 if (TREE_CODE (__t
) == __c1
3438 || TREE_CODE (__t
) == __c2
)
3439 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3444 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3445 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3447 if (TREE_CODE (__t
) != __c1
3448 && TREE_CODE (__t
) != __c2
3449 && TREE_CODE (__t
) != __c3
)
3450 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3455 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3456 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3458 if (TREE_CODE (__t
) == __c1
3459 || TREE_CODE (__t
) == __c2
3460 || TREE_CODE (__t
) == __c3
)
3461 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3466 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3467 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3468 enum tree_code __c4
)
3470 if (TREE_CODE (__t
) != __c1
3471 && TREE_CODE (__t
) != __c2
3472 && TREE_CODE (__t
) != __c3
3473 && TREE_CODE (__t
) != __c4
)
3474 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3479 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3480 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3481 enum tree_code __c4
)
3483 if (TREE_CODE (__t
) == __c1
3484 || TREE_CODE (__t
) == __c2
3485 || TREE_CODE (__t
) == __c3
3486 || TREE_CODE (__t
) == __c4
)
3487 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3492 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3493 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3494 enum tree_code __c4
, enum tree_code __c5
)
3496 if (TREE_CODE (__t
) != __c1
3497 && TREE_CODE (__t
) != __c2
3498 && TREE_CODE (__t
) != __c3
3499 && TREE_CODE (__t
) != __c4
3500 && TREE_CODE (__t
) != __c5
)
3501 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3506 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3507 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3508 enum tree_code __c4
, enum tree_code __c5
)
3510 if (TREE_CODE (__t
) == __c1
3511 || TREE_CODE (__t
) == __c2
3512 || TREE_CODE (__t
) == __c3
3513 || TREE_CODE (__t
) == __c4
3514 || TREE_CODE (__t
) == __c5
)
3515 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3520 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3521 const char *__f
, int __l
, const char *__g
)
3523 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3524 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3529 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3530 const char *__f
, int __l
, const char *__g
)
3532 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3533 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3538 tree_range_check (const_tree __t
,
3539 enum tree_code __code1
, enum tree_code __code2
,
3540 const char *__f
, int __l
, const char *__g
)
3542 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3543 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3548 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3549 const char *__f
, int __l
, const char *__g
)
3551 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3552 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3553 if (__t
->omp_clause
.code
!= __code
)
3554 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3559 omp_clause_range_check (const_tree __t
,
3560 enum omp_clause_code __code1
,
3561 enum omp_clause_code __code2
,
3562 const char *__f
, int __l
, const char *__g
)
3564 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3565 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3566 if ((int) __t
->omp_clause
.code
< (int) __code1
3567 || (int) __t
->omp_clause
.code
> (int) __code2
)
3568 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3573 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3575 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3576 if (!IS_EXPR_CODE_CLASS (__c
))
3577 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3582 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3585 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3589 # if GCC_VERSION >= 4006
3590 #pragma GCC diagnostic push
3591 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3595 tree_vec_elt_check (const_tree __t
, int __i
,
3596 const char *__f
, int __l
, const char *__g
)
3598 if (TREE_CODE (__t
) != TREE_VEC
)
3599 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3600 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3601 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3602 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3603 //return &__t->vec.a[__i];
3606 # if GCC_VERSION >= 4006
3607 #pragma GCC diagnostic pop
3611 omp_clause_elt_check (const_tree __t
, int __i
,
3612 const char *__f
, int __l
, const char *__g
)
3614 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3615 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3616 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3617 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3618 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3622 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3625 if (!ANY_INTEGRAL_TYPE_P (__t
))
3626 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3633 /* Compute the number of operands in an expression node NODE. For
3634 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3635 otherwise it is looked up from the node's code. */
3637 tree_operand_length (const_tree node
)
3639 if (VL_EXP_CLASS_P (node
))
3640 return VL_EXP_OPERAND_LENGTH (node
);
3642 return TREE_CODE_LENGTH (TREE_CODE (node
));
3645 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3647 /* Special checks for TREE_OPERANDs. */
3649 tree_operand_check (tree __t
, int __i
,
3650 const char *__f
, int __l
, const char *__g
)
3652 const_tree __u
= EXPR_CHECK (__t
);
3653 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3654 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3655 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3659 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3660 const char *__f
, int __l
, const char *__g
)
3662 if (TREE_CODE (__t
) != __code
)
3663 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3664 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3665 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3666 return &__t
->exp
.operands
[__i
];
3670 tree_operand_check (const_tree __t
, int __i
,
3671 const char *__f
, int __l
, const char *__g
)
3673 const_tree __u
= EXPR_CHECK (__t
);
3674 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3675 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3676 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3680 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3681 const char *__f
, int __l
, const char *__g
)
3683 if (TREE_CODE (__t
) != __code
)
3684 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3685 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3686 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3687 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3692 /* True iff an identifier matches a C string. */
3695 id_equal (const_tree id
, const char *str
)
3697 return !strcmp (IDENTIFIER_POINTER (id
), str
);
3701 id_equal (const char *str
, const_tree id
)
3703 return !strcmp (str
, IDENTIFIER_POINTER (id
));
3706 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
3709 TYPE_VECTOR_SUBPARTS (const_tree node
)
3711 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3712 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
3713 if (NUM_POLY_INT_COEFFS
== 2)
3715 poly_uint64 res
= 0;
3716 res
.coeffs
[0] = 1 << (precision
& 0xff);
3717 if (precision
& 0x100)
3718 res
.coeffs
[1] = 1 << (precision
& 0xff);
3722 return 1 << precision
;
3725 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
3726 satisfy valid_vector_subparts_p. */
3729 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
3731 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3732 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3733 int index
= exact_log2 (coeff0
);
3734 gcc_assert (index
>= 0);
3735 if (NUM_POLY_INT_COEFFS
== 2)
3737 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3738 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
3739 VECTOR_TYPE_CHECK (node
)->type_common
.precision
3740 = index
+ (coeff1
!= 0 ? 0x100 : 0);
3743 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
3746 /* Return true if we can construct vector types with the given number
3750 valid_vector_subparts_p (poly_uint64 subparts
)
3752 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3753 if (!pow2p_hwi (coeff0
))
3755 if (NUM_POLY_INT_COEFFS
== 2)
3757 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3758 if (coeff1
!= 0 && coeff1
!= coeff0
)
3764 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
3765 wrapper added to express a location_t on behalf of the node's child
3766 (e.g. by maybe_wrap_with_location). */
3768 #define EXPR_LOCATION_WRAPPER_P(NODE) \
3769 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
3771 /* Test if EXP is merely a wrapper node, added to express a location_t
3772 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
3775 location_wrapper_p (const_tree exp
)
3777 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
3778 the flag EXPR_LOCATION_WRAPPER_P is set.
3779 It normally has the same type as its operand, but it can have a
3780 different one if the type of the operand has changed (e.g. when
3781 merging duplicate decls).
3783 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
3784 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
3785 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
3786 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3787 && EXPR_LOCATION_WRAPPER_P (exp
))
3792 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
3795 tree_strip_any_location_wrapper (tree exp
)
3797 if (location_wrapper_p (exp
))
3798 return TREE_OPERAND (exp
, 0);
3803 #define error_mark_node global_trees[TI_ERROR_MARK]
3805 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3806 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3807 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3808 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3809 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3811 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3812 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3813 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3814 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3815 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3817 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3818 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3819 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3820 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3821 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3823 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3824 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3825 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3827 #define void_node global_trees[TI_VOID]
3829 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3830 #define integer_one_node global_trees[TI_INTEGER_ONE]
3831 #define integer_three_node global_trees[TI_INTEGER_THREE]
3832 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3833 #define size_zero_node global_trees[TI_SIZE_ZERO]
3834 #define size_one_node global_trees[TI_SIZE_ONE]
3835 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3836 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3837 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3839 /* Base access nodes. */
3840 #define access_public_node global_trees[TI_PUBLIC]
3841 #define access_protected_node global_trees[TI_PROTECTED]
3842 #define access_private_node global_trees[TI_PRIVATE]
3844 #define null_pointer_node global_trees[TI_NULL_POINTER]
3846 #define float_type_node global_trees[TI_FLOAT_TYPE]
3847 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3848 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3850 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
3851 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
3852 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
3853 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
3855 /* Names for individual types (code should normally iterate over all
3856 such types; these are only for back-end use, or in contexts such as
3857 *.def where iteration is not possible). */
3858 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
3859 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
3860 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
3861 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
3862 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
3863 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
3864 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
3866 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3867 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3868 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3869 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3871 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3872 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3873 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3874 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3876 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
3878 #define void_type_node global_trees[TI_VOID_TYPE]
3879 /* The C type `void *'. */
3880 #define ptr_type_node global_trees[TI_PTR_TYPE]
3881 /* The C type `const void *'. */
3882 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3883 /* The C type `size_t'. */
3884 #define size_type_node global_trees[TI_SIZE_TYPE]
3885 #define pid_type_node global_trees[TI_PID_TYPE]
3886 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3887 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3888 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3889 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3890 /* The C type `FILE *'. */
3891 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3892 /* The C type `const struct tm *'. */
3893 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
3894 /* The C type `fenv_t *'. */
3895 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
3896 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
3897 /* The C type `fexcept_t *'. */
3898 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
3899 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
3900 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3902 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3903 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3904 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3906 /* The decimal floating point types. */
3907 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3908 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3909 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3910 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3911 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3912 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3914 /* The fixed-point types. */
3915 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3916 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3917 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3918 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3919 #define sat_unsigned_short_fract_type_node \
3920 global_trees[TI_SAT_USFRACT_TYPE]
3921 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3922 #define sat_unsigned_long_fract_type_node \
3923 global_trees[TI_SAT_ULFRACT_TYPE]
3924 #define sat_unsigned_long_long_fract_type_node \
3925 global_trees[TI_SAT_ULLFRACT_TYPE]
3926 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3927 #define fract_type_node global_trees[TI_FRACT_TYPE]
3928 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3929 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3930 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3931 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3932 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3933 #define unsigned_long_long_fract_type_node \
3934 global_trees[TI_ULLFRACT_TYPE]
3935 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3936 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3937 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3938 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3939 #define sat_unsigned_short_accum_type_node \
3940 global_trees[TI_SAT_USACCUM_TYPE]
3941 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3942 #define sat_unsigned_long_accum_type_node \
3943 global_trees[TI_SAT_ULACCUM_TYPE]
3944 #define sat_unsigned_long_long_accum_type_node \
3945 global_trees[TI_SAT_ULLACCUM_TYPE]
3946 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3947 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3948 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3949 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3950 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3951 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3952 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3953 #define unsigned_long_long_accum_type_node \
3954 global_trees[TI_ULLACCUM_TYPE]
3955 #define qq_type_node global_trees[TI_QQ_TYPE]
3956 #define hq_type_node global_trees[TI_HQ_TYPE]
3957 #define sq_type_node global_trees[TI_SQ_TYPE]
3958 #define dq_type_node global_trees[TI_DQ_TYPE]
3959 #define tq_type_node global_trees[TI_TQ_TYPE]
3960 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3961 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3962 #define usq_type_node global_trees[TI_USQ_TYPE]
3963 #define udq_type_node global_trees[TI_UDQ_TYPE]
3964 #define utq_type_node global_trees[TI_UTQ_TYPE]
3965 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3966 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3967 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3968 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3969 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3970 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3971 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3972 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3973 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3974 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3975 #define ha_type_node global_trees[TI_HA_TYPE]
3976 #define sa_type_node global_trees[TI_SA_TYPE]
3977 #define da_type_node global_trees[TI_DA_TYPE]
3978 #define ta_type_node global_trees[TI_TA_TYPE]
3979 #define uha_type_node global_trees[TI_UHA_TYPE]
3980 #define usa_type_node global_trees[TI_USA_TYPE]
3981 #define uda_type_node global_trees[TI_UDA_TYPE]
3982 #define uta_type_node global_trees[TI_UTA_TYPE]
3983 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3984 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3985 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3986 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3987 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3988 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3989 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3990 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3992 /* The node that should be placed at the end of a parameter list to
3993 indicate that the function does not take a variable number of
3994 arguments. The TREE_VALUE will be void_type_node and there will be
3995 no TREE_CHAIN. Language-independent code should not assume
3996 anything else about this node. */
3997 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3999 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4000 #define MAIN_NAME_P(NODE) \
4001 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4003 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4005 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4006 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4008 /* Default/current target options (TARGET_OPTION_NODE). */
4009 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4010 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4012 /* Default tree list option(), optimize() pragmas to be linked into the
4014 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4015 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4017 #define char_type_node integer_types[itk_char]
4018 #define signed_char_type_node integer_types[itk_signed_char]
4019 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4020 #define short_integer_type_node integer_types[itk_short]
4021 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4022 #define integer_type_node integer_types[itk_int]
4023 #define unsigned_type_node integer_types[itk_unsigned_int]
4024 #define long_integer_type_node integer_types[itk_long]
4025 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4026 #define long_long_integer_type_node integer_types[itk_long_long]
4027 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4029 /* True if NODE is an erroneous expression. */
4031 #define error_operand_p(NODE) \
4032 ((NODE) == error_mark_node \
4033 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4035 /* Return the number of elements encoded directly in a VECTOR_CST. */
4038 vector_cst_encoded_nelts (const_tree t
)
4040 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4043 extern tree
decl_assembler_name (tree
);
4044 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4045 extern tree
decl_comdat_group (const_tree
);
4046 extern tree
decl_comdat_group_id (const_tree
);
4047 extern const char *decl_section_name (const_tree
);
4048 extern void set_decl_section_name (tree
, const char *);
4049 extern enum tls_model
decl_tls_model (const_tree
);
4050 extern void set_decl_tls_model (tree
, enum tls_model
);
4052 /* Compute the number of bytes occupied by 'node'. This routine only
4053 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4055 extern size_t tree_size (const_tree
);
4057 /* Compute the number of bytes occupied by a tree with code CODE.
4058 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4059 which are of variable length. */
4060 extern size_t tree_code_size (enum tree_code
);
4062 /* Allocate and return a new UID from the DECL_UID namespace. */
4063 extern int allocate_decl_uid (void);
4065 /* Lowest level primitive for allocating a node.
4066 The TREE_CODE is the only argument. Contents are initialized
4067 to zero except for a few of the common fields. */
4069 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4071 /* Free tree node. */
4073 extern void free_node (tree
);
4075 /* Make a copy of a node, with all the same contents. */
4077 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4079 /* Make a copy of a chain of TREE_LIST nodes. */
4081 extern tree
copy_list (tree
);
4083 /* Make a CASE_LABEL_EXPR. */
4085 extern tree
build_case_label (tree
, tree
, tree
);
4088 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4090 /* Make an INTEGER_CST. */
4092 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4094 /* Make a TREE_VEC. */
4096 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4098 /* Grow a TREE_VEC. */
4100 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4102 /* Construct various types of nodes. */
4104 extern tree
build_nt (enum tree_code
, ...);
4105 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4107 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4108 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4109 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4110 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4111 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4112 tree CXX_MEM_STAT_INFO
);
4113 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4114 tree CXX_MEM_STAT_INFO
);
4116 /* _loc versions of build[1-5]. */
4119 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4120 tree arg1 CXX_MEM_STAT_INFO
)
4122 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4123 if (CAN_HAVE_LOCATION_P (t
))
4124 SET_EXPR_LOCATION (t
, loc
);
4129 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4130 tree arg1 CXX_MEM_STAT_INFO
)
4132 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4133 if (CAN_HAVE_LOCATION_P (t
))
4134 SET_EXPR_LOCATION (t
, loc
);
4139 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4140 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4142 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4143 if (CAN_HAVE_LOCATION_P (t
))
4144 SET_EXPR_LOCATION (t
, loc
);
4149 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4150 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4152 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4153 if (CAN_HAVE_LOCATION_P (t
))
4154 SET_EXPR_LOCATION (t
, loc
);
4159 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4160 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4162 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4163 arg4 PASS_MEM_STAT
);
4164 if (CAN_HAVE_LOCATION_P (t
))
4165 SET_EXPR_LOCATION (t
, loc
);
4169 /* Constructs double_int from tree CST. */
4171 extern tree
double_int_to_tree (tree
, double_int
);
4173 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4174 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4176 /* Create an INT_CST node with a CST value zero extended. */
4179 extern tree
build_int_cst (tree
, poly_int64
);
4180 extern tree
build_int_cstu (tree type
, poly_uint64
);
4181 extern tree
build_int_cst_type (tree
, poly_int64
);
4182 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4183 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
4184 extern tree
build_vector_from_val (tree
, tree
);
4185 extern tree
build_uniform_cst (tree
, tree
);
4186 extern tree
build_vec_series (tree
, tree
, tree
);
4187 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4188 extern void recompute_constructor_flags (tree
);
4189 extern void verify_constructor_flags (tree
);
4190 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
4191 extern tree
build_constructor_single (tree
, tree
, tree
);
4192 extern tree
build_constructor_from_list (tree
, tree
);
4193 extern tree
build_constructor_va (tree
, int, ...);
4194 extern tree
build_clobber (tree
);
4195 extern tree
build_real_from_int_cst (tree
, const_tree
);
4196 extern tree
build_complex (tree
, tree
, tree
);
4197 extern tree
build_complex_inf (tree
, bool);
4198 extern tree
build_each_one_cst (tree
);
4199 extern tree
build_one_cst (tree
);
4200 extern tree
build_minus_one_cst (tree
);
4201 extern tree
build_all_ones_cst (tree
);
4202 extern tree
build_zero_cst (tree
);
4203 extern tree
build_string (int, const char *);
4204 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4205 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4206 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4207 extern tree
build_decl (location_t
, enum tree_code
,
4208 tree
, tree CXX_MEM_STAT_INFO
);
4209 extern tree
build_fn_decl (const char *, tree
);
4210 extern tree
build_translation_unit_decl (tree
);
4211 extern tree
build_block (tree
, tree
, tree
, tree
);
4212 extern tree
build_empty_stmt (location_t
);
4213 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4215 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4217 extern tree
build_call_nary (tree
, tree
, int, ...);
4218 extern tree
build_call_valist (tree
, tree
, int, va_list);
4219 #define build_call_array(T1,T2,N,T3)\
4220 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4221 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4222 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
4223 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4224 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4225 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4226 extern tree
build_call_expr (tree
, int, ...);
4227 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4229 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4230 tree
, int, const tree
*);
4231 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4233 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4234 extern tree
build_string_literal (int, const char *, tree
= char_type_node
);
4236 /* Construct various nodes representing data types. */
4238 extern tree
signed_or_unsigned_type_for (int, tree
);
4239 extern tree
signed_type_for (tree
);
4240 extern tree
unsigned_type_for (tree
);
4241 extern tree
truth_type_for (tree
);
4242 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4243 extern tree
build_pointer_type (tree
);
4244 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4245 extern tree
build_reference_type (tree
);
4246 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4247 extern tree
build_vector_type (tree
, poly_int64
);
4248 extern tree
build_truth_vector_type (poly_uint64
, poly_uint64
);
4249 extern tree
build_same_sized_truth_vector_type (tree vectype
);
4250 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4251 extern tree
build_index_type (tree
);
4252 extern tree
build_array_type (tree
, tree
, bool = false);
4253 extern tree
build_nonshared_array_type (tree
, tree
);
4254 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4255 extern tree
build_function_type (tree
, tree
);
4256 extern tree
build_function_type_list (tree
, ...);
4257 extern tree
build_varargs_function_type_list (tree
, ...);
4258 extern tree
build_function_type_array (tree
, int, tree
*);
4259 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4260 #define build_function_type_vec(RET, V) \
4261 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4262 #define build_varargs_function_type_vec(RET, V) \
4263 build_varargs_function_type_array (RET, vec_safe_length (V), \
4264 vec_safe_address (V))
4265 extern tree
build_method_type_directly (tree
, tree
, tree
);
4266 extern tree
build_method_type (tree
, tree
);
4267 extern tree
build_offset_type (tree
, tree
);
4268 extern tree
build_complex_type (tree
, bool named
= false);
4269 extern tree
array_type_nelts (const_tree
);
4271 extern tree
value_member (tree
, tree
);
4272 extern tree
purpose_member (const_tree
, tree
);
4273 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4274 extern tree
chain_index (int, tree
);
4276 /* Arguments may be null. */
4277 extern int tree_int_cst_equal (const_tree
, const_tree
);
4279 /* The following predicates are safe to call with a null argument. */
4280 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4281 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4282 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4283 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4285 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4286 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4287 extern poly_int64
tree_to_poly_int64 (const_tree
)
4288 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4289 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4290 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4291 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4292 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4293 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4294 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4295 tree_to_shwi (const_tree t
)
4297 gcc_assert (tree_fits_shwi_p (t
));
4298 return TREE_INT_CST_LOW (t
);
4301 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4302 tree_to_uhwi (const_tree t
)
4304 gcc_assert (tree_fits_uhwi_p (t
));
4305 return TREE_INT_CST_LOW (t
);
4307 #if NUM_POLY_INT_COEFFS == 1
4308 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4309 tree_to_poly_int64 (const_tree t
)
4311 gcc_assert (tree_fits_poly_int64_p (t
));
4312 return TREE_INT_CST_LOW (t
);
4315 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4316 tree_to_poly_uint64 (const_tree t
)
4318 gcc_assert (tree_fits_poly_uint64_p (t
));
4319 return TREE_INT_CST_LOW (t
);
4323 extern int tree_int_cst_sgn (const_tree
);
4324 extern int tree_int_cst_sign_bit (const_tree
);
4325 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4326 extern tree
strip_array_types (tree
);
4327 extern tree
excess_precision_type (tree
);
4328 extern bool valid_constant_size_p (const_tree
);
4330 /* Return true if T holds a value that can be represented as a poly_int64
4331 without loss of precision. Store the value in *VALUE if so. */
4334 poly_int_tree_p (const_tree t
, poly_int64_pod
*value
)
4336 if (tree_fits_poly_int64_p (t
))
4338 *value
= tree_to_poly_int64 (t
);
4344 /* Return true if T holds a value that can be represented as a poly_uint64
4345 without loss of precision. Store the value in *VALUE if so. */
4348 poly_int_tree_p (const_tree t
, poly_uint64_pod
*value
)
4350 if (tree_fits_poly_uint64_p (t
))
4352 *value
= tree_to_poly_uint64 (t
);
4358 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4359 put the prototype here. Rtl.h does declare the prototype if
4360 tree.h had been included. */
4362 extern tree
make_tree (tree
, rtx
);
4364 /* Returns true iff CAND and BASE have equivalent language-specific
4367 extern bool check_lang_type (const_tree cand
, const_tree base
);
4369 /* Returns true iff unqualified CAND and BASE are equivalent. */
4371 extern bool check_base_type (const_tree cand
, const_tree base
);
4373 /* Check whether CAND is suitable to be returned from get_qualified_type
4374 (BASE, TYPE_QUALS). */
4376 extern bool check_qualified_type (const_tree
, const_tree
, int);
4378 /* Return a version of the TYPE, qualified as indicated by the
4379 TYPE_QUALS, if one exists. If no qualified version exists yet,
4380 return NULL_TREE. */
4382 extern tree
get_qualified_type (tree
, int);
4384 /* Like get_qualified_type, but creates the type if it does not
4385 exist. This function never returns NULL_TREE. */
4387 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
4389 /* Create a variant of type T with alignment ALIGN. */
4391 extern tree
build_aligned_type (tree
, unsigned int);
4393 /* Like build_qualified_type, but only deals with the `const' and
4394 `volatile' qualifiers. This interface is retained for backwards
4395 compatibility with the various front-ends; new code should use
4396 build_qualified_type instead. */
4398 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4399 build_qualified_type ((TYPE), \
4400 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4401 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4403 /* Make a copy of a type node. */
4405 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
4406 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
4408 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4409 return a canonicalized ..._TYPE node, so that duplicates are not made.
4410 How the hash code is computed is up to the caller, as long as any two
4411 callers that could hash identical-looking type nodes agree. */
4413 extern hashval_t
type_hash_canon_hash (tree
);
4414 extern tree
type_hash_canon (unsigned int, tree
);
4416 extern tree
convert (tree
, tree
);
4417 extern unsigned int expr_align (const_tree
);
4418 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4420 size_in_bytes (const_tree t
)
4422 return size_in_bytes_loc (input_location
, t
);
4425 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4426 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4427 extern tree
bit_position (const_tree
);
4428 extern tree
byte_position (const_tree
);
4429 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4431 /* Type for sizes of data-type. */
4433 #define sizetype sizetype_tab[(int) stk_sizetype]
4434 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4435 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4436 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4437 #define size_int(L) size_int_kind (L, stk_sizetype)
4438 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4439 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4440 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4442 /* Log2 of BITS_PER_UNIT. */
4444 #if BITS_PER_UNIT == 8
4445 #define LOG2_BITS_PER_UNIT 3
4446 #elif BITS_PER_UNIT == 16
4447 #define LOG2_BITS_PER_UNIT 4
4449 #error Unknown BITS_PER_UNIT
4452 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4453 by making the last node in X point to Y.
4454 Returns X, except if X is 0 returns Y. */
4456 extern tree
chainon (tree
, tree
);
4458 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4460 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
4462 /* Return the last tree node in a chain. */
4464 extern tree
tree_last (tree
);
4466 /* Reverse the order of elements in a chain, and return the new head. */
4468 extern tree
nreverse (tree
);
4470 /* Returns the length of a chain of nodes
4471 (number of chain pointers to follow before reaching a null pointer). */
4473 extern int list_length (const_tree
);
4475 /* Returns the first FIELD_DECL in a type. */
4477 extern tree
first_field (const_tree
);
4479 /* Given an initializer INIT, return TRUE if INIT is zero or some
4480 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4481 null, set *NONZERO if and only if INIT is known not to be all
4482 zeros. The combination of return value of false and *NONZERO
4483 false implies that INIT may but need not be all zeros. Other
4484 combinations indicate definitive answers. */
4486 extern bool initializer_zerop (const_tree
, bool * = NULL
);
4488 extern wide_int
vector_cst_int_elt (const_tree
, unsigned int);
4489 extern tree
vector_cst_elt (const_tree
, unsigned int);
4491 /* Given a vector VEC, return its first element if all elements are
4492 the same. Otherwise return NULL_TREE. */
4494 extern tree
uniform_vector_p (const_tree
);
4496 /* If the argument is INTEGER_CST, return it. If the argument is vector
4497 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4498 return NULL_TREE. */
4500 extern tree
uniform_integer_cst_p (tree
);
4502 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4504 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4506 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4508 extern bool zerop (const_tree
);
4510 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4512 extern bool integer_zerop (const_tree
);
4514 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4516 extern bool integer_onep (const_tree
);
4518 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4519 a vector or complex where each part is 1. */
4521 extern bool integer_each_onep (const_tree
);
4523 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4524 all of whose significant bits are 1. */
4526 extern bool integer_all_onesp (const_tree
);
4528 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4531 extern bool integer_minus_onep (const_tree
);
4533 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4534 exactly one bit 1. */
4536 extern bool integer_pow2p (const_tree
);
4538 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4539 with a nonzero value. */
4541 extern bool integer_nonzerop (const_tree
);
4543 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4544 a vector where each element is an integer constant of value -1. */
4546 extern bool integer_truep (const_tree
);
4548 extern bool cst_and_fits_in_hwi (const_tree
);
4549 extern tree
num_ending_zeros (const_tree
);
4551 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4554 extern bool fixed_zerop (const_tree
);
4556 /* staticp (tree x) is nonzero if X is a reference to data allocated
4557 at a fixed address in memory. Returns the outermost data. */
4559 extern tree
staticp (tree
);
4561 /* save_expr (EXP) returns an expression equivalent to EXP
4562 but it can be used multiple times within context CTX
4563 and only evaluate EXP once. */
4565 extern tree
save_expr (tree
);
4567 /* Return true if T is function-invariant. */
4569 extern bool tree_invariant_p (tree
);
4571 /* Look inside EXPR into any simple arithmetic operations. Return the
4572 outermost non-arithmetic or non-invariant node. */
4574 extern tree
skip_simple_arithmetic (tree
);
4576 /* Look inside EXPR into simple arithmetic operations involving constants.
4577 Return the outermost non-arithmetic or non-constant node. */
4579 extern tree
skip_simple_constant_arithmetic (tree
);
4581 /* Return which tree structure is used by T. */
4583 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4585 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4586 size or offset that depends on a field within a record. */
4588 extern bool contains_placeholder_p (const_tree
);
4590 /* This macro calls the above function but short-circuits the common
4591 case of a constant to save time. Also check for null. */
4593 #define CONTAINS_PLACEHOLDER_P(EXP) \
4594 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4596 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4597 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4600 extern bool type_contains_placeholder_p (tree
);
4602 /* Given a tree EXP, find all occurrences of references to fields
4603 in a PLACEHOLDER_EXPR and place them in vector REFS without
4604 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4605 we assume here that EXP contains only arithmetic expressions
4606 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4609 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4611 /* This macro calls the above function but short-circuits the common
4612 case of a constant to save time and also checks for NULL. */
4614 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4616 if((EXP) && !TREE_CONSTANT (EXP)) \
4617 find_placeholder_in_expr (EXP, V); \
4620 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4621 return a tree with all occurrences of references to F in a
4622 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4623 CONST_DECLs. Note that we assume here that EXP contains only
4624 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4625 occurring only in their argument list. */
4627 extern tree
substitute_in_expr (tree
, tree
, tree
);
4629 /* This macro calls the above function but short-circuits the common
4630 case of a constant to save time and also checks for NULL. */
4632 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4633 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4635 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4636 for it within OBJ, a tree that is an object or a chain of references. */
4638 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4640 /* This macro calls the above function but short-circuits the common
4641 case of a constant to save time and also checks for NULL. */
4643 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4644 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4645 : substitute_placeholder_in_expr (EXP, OBJ))
4648 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4649 but it can be used multiple times
4650 and only evaluate the subexpressions once. */
4652 extern tree
stabilize_reference (tree
);
4654 /* Return EXP, stripped of any conversions to wider types
4655 in such a way that the result of converting to type FOR_TYPE
4656 is the same as if EXP were converted to FOR_TYPE.
4657 If FOR_TYPE is 0, it signifies EXP's type. */
4659 extern tree
get_unwidened (tree
, tree
);
4661 /* Return OP or a simpler expression for a narrower value
4662 which can be sign-extended or zero-extended to give back OP.
4663 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4664 or 0 if the value should be sign-extended. */
4666 extern tree
get_narrower (tree
, int *);
4668 /* Return true if T is an expression that get_inner_reference handles. */
4671 handled_component_p (const_tree t
)
4673 switch (TREE_CODE (t
))
4678 case ARRAY_RANGE_REF
:
4681 case VIEW_CONVERT_EXPR
:
4689 /* Return true T is a component with reverse storage order. */
4692 reverse_storage_order_for_component_p (tree t
)
4694 /* The storage order only applies to scalar components. */
4695 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4698 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4699 t
= TREE_OPERAND (t
, 0);
4701 switch (TREE_CODE (t
))
4705 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4706 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4707 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4708 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4712 return REF_REVERSE_STORAGE_ORDER (t
);
4714 case ARRAY_RANGE_REF
:
4715 case VIEW_CONVERT_EXPR
:
4723 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4724 that can modify the storage order of objects. Note that, even if the
4725 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4726 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4727 it can change the partition of the aggregate object into scalars. */
4730 storage_order_barrier_p (const_tree t
)
4732 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4735 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4736 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4739 tree op
= TREE_OPERAND (t
, 0);
4741 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4742 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4748 /* Given a DECL or TYPE, return the scope in which it was declared, or
4749 NUL_TREE if there is no containing scope. */
4751 extern tree
get_containing_scope (const_tree
);
4753 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
4755 extern const_tree
get_ultimate_context (const_tree
);
4757 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4759 extern tree
decl_function_context (const_tree
);
4761 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4762 this _DECL with its context, or zero if none. */
4763 extern tree
decl_type_context (const_tree
);
4765 /* Return true if EXPR is the real constant zero. */
4766 extern bool real_zerop (const_tree
);
4768 /* Initialize the iterator I with arguments from function FNDECL */
4771 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4773 i
->next
= TYPE_ARG_TYPES (fntype
);
4776 /* Return a pointer that holds the next argument if there are more arguments to
4777 handle, otherwise return NULL. */
4779 static inline tree
*
4780 function_args_iter_cond_ptr (function_args_iterator
*i
)
4782 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4785 /* Return the next argument if there are more arguments to handle, otherwise
4789 function_args_iter_cond (function_args_iterator
*i
)
4791 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4794 /* Advance to the next argument. */
4796 function_args_iter_next (function_args_iterator
*i
)
4798 gcc_assert (i
->next
!= NULL_TREE
);
4799 i
->next
= TREE_CHAIN (i
->next
);
4802 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4805 inlined_function_outer_scope_p (const_tree block
)
4807 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4810 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4811 to point to the next tree element. ITER is an instance of
4812 function_args_iterator used to iterate the arguments. */
4813 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4814 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4815 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4816 function_args_iter_next (&(ITER)))
4818 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4819 to the next tree element. ITER is an instance of function_args_iterator
4820 used to iterate the arguments. */
4821 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4822 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4823 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4824 function_args_iter_next (&(ITER)))
4827 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
4828 extern unsigned crc32_string (unsigned, const char *);
4830 crc32_unsigned (unsigned chksum
, unsigned value
)
4832 return crc32_unsigned_n (chksum
, value
, 4);
4835 crc32_byte (unsigned chksum
, char byte
)
4837 return crc32_unsigned_n (chksum
, byte
, 1);
4839 extern void clean_symbol_name (char *);
4840 extern tree
get_file_function_name (const char *);
4841 extern tree
get_callee_fndecl (const_tree
);
4842 extern combined_fn
get_call_combined_fn (const_tree
);
4843 extern int type_num_arguments (const_tree
);
4844 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
4845 extern bool associative_tree_code (enum tree_code
);
4846 extern bool commutative_tree_code (enum tree_code
);
4847 extern bool commutative_ternary_tree_code (enum tree_code
);
4848 extern bool operation_can_overflow (enum tree_code
);
4849 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
4850 extern tree
upper_bound_in_type (tree
, tree
);
4851 extern tree
lower_bound_in_type (tree
, tree
);
4852 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4853 extern tree
create_artificial_label (location_t
);
4854 extern const char *get_name (tree
);
4855 extern bool stdarg_p (const_tree
);
4856 extern bool prototype_p (const_tree
);
4857 extern bool is_typedef_decl (const_tree x
);
4858 extern bool typedef_variant_p (const_tree
);
4859 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4860 extern tree
build_low_bits_mask (tree
, unsigned);
4861 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4862 extern tree
tree_strip_nop_conversions (tree
);
4863 extern tree
tree_strip_sign_nop_conversions (tree
);
4864 extern const_tree
strip_invariant_refs (const_tree
);
4865 extern tree
lhd_gcc_personality (void);
4866 extern void assign_assembler_name_if_needed (tree
);
4867 extern bool warn_deprecated_use (tree
, tree
);
4868 extern void cache_integer_cst (tree
);
4869 extern const char *combined_fn_name (combined_fn
);
4871 /* Compare and hash for any structure which begins with a canonical
4872 pointer. Assumes all pointers are interchangeable, which is sort
4873 of already assumed by gcc elsewhere IIRC. */
4876 struct_ptr_eq (const void *a
, const void *b
)
4878 const void * const * x
= (const void * const *) a
;
4879 const void * const * y
= (const void * const *) b
;
4883 static inline hashval_t
4884 struct_ptr_hash (const void *a
)
4886 const void * const * x
= (const void * const *) a
;
4887 return (intptr_t)*x
>> 4;
4890 /* Return nonzero if CODE is a tree code that represents a truth value. */
4892 truth_value_p (enum tree_code code
)
4894 return (TREE_CODE_CLASS (code
) == tcc_comparison
4895 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4896 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4897 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4900 /* Return whether TYPE is a type suitable for an offset for
4901 a POINTER_PLUS_EXPR. */
4903 ptrofftype_p (tree type
)
4905 return (INTEGRAL_TYPE_P (type
)
4906 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4907 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4910 /* Return true if the argument is a complete type or an array
4911 of unknown bound (whose type is incomplete but) whose elements
4912 have complete type. */
4914 complete_or_array_type_p (const_tree type
)
4916 return COMPLETE_TYPE_P (type
)
4917 || (TREE_CODE (type
) == ARRAY_TYPE
4918 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
4921 /* Return true if the value of T could be represented as a poly_widest_int. */
4924 poly_int_tree_p (const_tree t
)
4926 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
4929 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
4930 to be a poly_uint64. (This is always true at the gimple level.) */
4933 bit_field_size (const_tree t
)
4935 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
4938 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
4939 known to be a poly_uint64. (This is always true at the gimple level.) */
4942 bit_field_offset (const_tree t
)
4944 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
4947 extern tree
strip_float_extensions (tree
);
4948 extern bool really_constant_p (const_tree
);
4949 extern bool ptrdiff_tree_p (const_tree
, poly_int64_pod
*);
4950 extern bool decl_address_invariant_p (const_tree
);
4951 extern bool decl_address_ip_invariant_p (const_tree
);
4952 extern bool int_fits_type_p (const_tree
, const_tree
)
4953 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
4954 #ifndef GENERATOR_FILE
4955 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4957 extern bool variably_modified_type_p (tree
, tree
);
4958 extern int tree_log2 (const_tree
);
4959 extern int tree_floor_log2 (const_tree
);
4960 extern unsigned int tree_ctz (const_tree
);
4961 extern int simple_cst_equal (const_tree
, const_tree
);
4966 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
4970 /* Compat version until all callers are converted. Return hash for
4972 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
4974 inchash::hash
hstate (seed
);
4975 inchash::add_expr (tree
, hstate
);
4976 return hstate
.end ();
4979 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4980 extern bool type_list_equal (const_tree
, const_tree
);
4981 extern bool chain_member (const_tree
, const_tree
);
4982 extern void dump_tree_statistics (void);
4983 extern void recompute_tree_invariant_for_addr_expr (tree
);
4984 extern bool needs_to_live_in_memory (const_tree
);
4985 extern tree
reconstruct_complex_type (tree
, tree
);
4986 extern bool real_onep (const_tree
);
4987 extern bool real_minus_onep (const_tree
);
4988 extern void init_ttree (void);
4989 extern void build_common_tree_nodes (bool);
4990 extern void build_common_builtin_nodes (void);
4991 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4992 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
4993 extern tree
build_range_type (tree
, tree
, tree
);
4994 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4995 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4996 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4997 extern tree
tree_block (tree
);
4998 extern void tree_set_block (tree
, tree
);
4999 extern location_t
*block_nonartificial_location (tree
);
5000 extern location_t
tree_nonartificial_location (tree
);
5001 extern tree
block_ultimate_origin (const_tree
);
5002 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5003 extern bool virtual_method_call_p (const_tree
);
5004 extern tree
obj_type_ref_class (const_tree ref
);
5005 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5006 extern bool contains_bitfld_component_ref_p (const_tree
);
5007 extern bool block_may_fallthru (const_tree
);
5008 extern void using_eh_for_cleanups (void);
5009 extern bool using_eh_for_cleanups_p (void);
5010 extern const char *get_tree_code_name (enum tree_code
);
5011 extern void set_call_expr_flags (tree
, int);
5012 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5014 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5016 #define walk_tree(a,b,c,d) \
5017 walk_tree_1 (a, b, c, d, NULL)
5018 #define walk_tree_without_duplicates(a,b,c) \
5019 walk_tree_without_duplicates_1 (a, b, c, NULL)
5021 extern tree
drop_tree_overflow (tree
);
5023 /* Given a memory reference expression T, return its base address.
5024 The base address of a memory reference expression is the main
5025 object being referenced. */
5026 extern tree
get_base_address (tree t
);
5028 /* Return a tree of sizetype representing the size, in bytes, of the element
5029 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5030 extern tree
array_ref_element_size (tree
);
5032 /* Return a typenode for the "standard" C type with a given name. */
5033 extern tree
get_typenode_from_name (const char *);
5035 /* Return a tree representing the upper bound of the array mentioned in
5036 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5037 extern tree
array_ref_up_bound (tree
);
5039 /* Return a tree representing the lower bound of the array mentioned in
5040 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5041 extern tree
array_ref_low_bound (tree
);
5043 /* Returns true if REF is an array reference or a component reference
5044 to an array at the end of a structure. If this is the case, the array
5045 may be allocated larger than its upper bound implies. */
5046 extern bool array_at_struct_end_p (tree
);
5048 /* Return a tree representing the offset, in bytes, of the field referenced
5049 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5050 extern tree
component_ref_field_offset (tree
);
5052 extern int tree_map_base_eq (const void *, const void *);
5053 extern unsigned int tree_map_base_hash (const void *);
5054 extern int tree_map_base_marked_p (const void *);
5055 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5056 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5057 bool trust_type_canonical
= true);
5058 extern bool type_with_interoperable_signedness (const_tree
);
5059 extern bitmap
get_nonnull_args (const_tree
);
5060 extern int get_range_pos_neg (tree
);
5062 /* Return simplified tree code of type that is used for canonical type
5064 inline enum tree_code
5065 tree_code_for_canonical_type_merging (enum tree_code code
)
5067 /* By C standard, each enumerated type shall be compatible with char,
5068 a signed integer, or an unsigned integer. The choice of type is
5069 implementation defined (in our case it depends on -fshort-enum).
5071 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5072 type and compare only by their signedness and precision. */
5073 if (code
== ENUMERAL_TYPE
)
5074 return INTEGER_TYPE
;
5075 /* To allow inter-operability between languages having references and
5076 C, we consider reference types and pointers alike. Note that this is
5077 not strictly necessary for C-Fortran 2008 interoperability because
5078 Fortran define C_PTR type that needs to be compatible with C pointers
5079 and we handle this one as ptr_type_node. */
5080 if (code
== REFERENCE_TYPE
)
5081 return POINTER_TYPE
;
5085 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5086 We don't define the types for pointers, arrays and vectors. The reason is
5087 that pointers are handled specially: ptr_type_node accesses conflict with
5088 accesses to all other pointers. This is done by alias.c.
5089 Because alias sets of arrays and vectors are the same as types of their
5090 elements, we can't compute canonical type either. Otherwise we could go
5091 form void *[10] to int *[10] (because they are equivalent for canonical type
5092 machinery) and get wrong TBAA. */
5095 canonical_type_used_p (const_tree t
)
5097 return !(POINTER_TYPE_P (t
)
5098 || TREE_CODE (t
) == ARRAY_TYPE
5099 || TREE_CODE (t
) == VECTOR_TYPE
);
5102 #define tree_map_eq tree_map_base_eq
5103 extern unsigned int tree_map_hash (const void *);
5104 #define tree_map_marked_p tree_map_base_marked_p
5106 #define tree_decl_map_eq tree_map_base_eq
5107 extern unsigned int tree_decl_map_hash (const void *);
5108 #define tree_decl_map_marked_p tree_map_base_marked_p
5110 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5112 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5114 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5116 return tree_decl_map_eq (a
, b
);
5120 keep_cache_entry (tree_decl_map
*&m
)
5122 return ggc_marked_p (m
->base
.from
);
5126 #define tree_int_map_eq tree_map_base_eq
5127 #define tree_int_map_hash tree_map_base_hash
5128 #define tree_int_map_marked_p tree_map_base_marked_p
5130 #define tree_vec_map_eq tree_map_base_eq
5131 #define tree_vec_map_hash tree_decl_map_hash
5132 #define tree_vec_map_marked_p tree_map_base_marked_p
5134 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5135 such a map will not mark keys, and will mark values if the key is already
5137 struct tree_cache_traits
5138 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5139 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5141 /* Initialize the abstract argument list iterator object ITER with the
5142 arguments from CALL_EXPR node EXP. */
5144 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5147 iter
->n
= call_expr_nargs (exp
);
5152 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5155 iter
->n
= call_expr_nargs (exp
);
5159 /* Return the next argument from abstract argument list iterator object ITER,
5160 and advance its state. Return NULL_TREE if there are no more arguments. */
5162 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5165 if (iter
->i
>= iter
->n
)
5167 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5172 static inline const_tree
5173 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5176 if (iter
->i
>= iter
->n
)
5178 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5183 /* Initialize the abstract argument list iterator object ITER, then advance
5184 past and return the first argument. Useful in for expressions, e.g.
5185 for (arg = first_call_expr_arg (exp, &iter); arg;
5186 arg = next_call_expr_arg (&iter)) */
5188 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5190 init_call_expr_arg_iterator (exp
, iter
);
5191 return next_call_expr_arg (iter
);
5194 static inline const_tree
5195 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5197 init_const_call_expr_arg_iterator (exp
, iter
);
5198 return next_const_call_expr_arg (iter
);
5201 /* Test whether there are more arguments in abstract argument list iterator
5202 ITER, without changing its state. */
5204 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5206 return (iter
->i
< iter
->n
);
5209 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5210 (of type call_expr_arg_iterator) to hold the iteration state. */
5211 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5212 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5213 (arg) = next_call_expr_arg (&(iter)))
5215 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5216 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5217 (arg) = next_const_call_expr_arg (&(iter)))
5219 /* Return true if tree node T is a language-specific node. */
5221 is_lang_specific (const_tree t
)
5223 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5226 /* Valid builtin number. */
5227 #define BUILTIN_VALID_P(FNCODE) \
5228 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5230 /* Return the tree node for an explicit standard builtin function or NULL. */
5232 builtin_decl_explicit (enum built_in_function fncode
)
5234 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5236 return builtin_info
[(size_t)fncode
].decl
;
5239 /* Return the tree node for an implicit builtin function or NULL. */
5241 builtin_decl_implicit (enum built_in_function fncode
)
5243 size_t uns_fncode
= (size_t)fncode
;
5244 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5246 if (!builtin_info
[uns_fncode
].implicit_p
)
5249 return builtin_info
[uns_fncode
].decl
;
5252 /* Set explicit builtin function nodes and whether it is an implicit
5256 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5258 size_t ufncode
= (size_t)fncode
;
5260 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5261 && (decl
!= NULL_TREE
|| !implicit_p
));
5263 builtin_info
[ufncode
].decl
= decl
;
5264 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5265 builtin_info
[ufncode
].declared_p
= false;
5268 /* Set the implicit flag for a builtin function. */
5271 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5273 size_t uns_fncode
= (size_t)fncode
;
5275 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5276 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5278 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5281 /* Set the declared flag for a builtin function. */
5284 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5286 size_t uns_fncode
= (size_t)fncode
;
5288 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5289 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5291 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5294 /* Return whether the standard builtin function can be used as an explicit
5298 builtin_decl_explicit_p (enum built_in_function fncode
)
5300 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5301 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5304 /* Return whether the standard builtin function can be used implicitly. */
5307 builtin_decl_implicit_p (enum built_in_function fncode
)
5309 size_t uns_fncode
= (size_t)fncode
;
5311 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5312 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5313 && builtin_info
[uns_fncode
].implicit_p
);
5316 /* Return whether the standard builtin function was declared. */
5319 builtin_decl_declared_p (enum built_in_function fncode
)
5321 size_t uns_fncode
= (size_t)fncode
;
5323 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5324 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5325 && builtin_info
[uns_fncode
].declared_p
);
5328 /* Return true if T (assumed to be a DECL) is a global variable.
5329 A variable is considered global if its storage is not automatic. */
5332 is_global_var (const_tree t
)
5334 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5337 /* Return true if VAR may be aliased. A variable is considered as
5338 maybe aliased if it has its address taken by the local TU
5339 or possibly by another TU and might be modified through a pointer. */
5342 may_be_aliased (const_tree var
)
5344 return (TREE_CODE (var
) != CONST_DECL
5345 && (TREE_PUBLIC (var
)
5346 || DECL_EXTERNAL (var
)
5347 || TREE_ADDRESSABLE (var
))
5348 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5349 && ((TREE_READONLY (var
)
5350 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5351 || (TREE_CODE (var
) == VAR_DECL
5352 && DECL_NONALIASED (var
)))));
5355 /* Return pointer to optimization flags of FNDECL. */
5356 static inline struct cl_optimization
*
5357 opts_for_fn (const_tree fndecl
)
5359 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5360 if (fn_opts
== NULL_TREE
)
5361 fn_opts
= optimization_default_node
;
5362 return TREE_OPTIMIZATION (fn_opts
);
5365 /* Return pointer to target flags of FNDECL. */
5366 static inline cl_target_option
*
5367 target_opts_for_fn (const_tree fndecl
)
5369 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5370 if (fn_opts
== NULL_TREE
)
5371 fn_opts
= target_option_default_node
;
5372 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5375 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5376 the optimization level of function fndecl. */
5377 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5379 /* For anonymous aggregate types, we need some sort of name to
5380 hold on to. In practice, this should not appear, but it should
5381 not be harmful if it does. */
5382 extern const char *anon_aggrname_format();
5383 extern bool anon_aggrname_p (const_tree
);
5385 /* The tree and const_tree overload templates. */
5388 class unextended_tree
5394 unextended_tree () {}
5395 unextended_tree (const_tree t
) : m_t (t
) {}
5397 unsigned int get_precision () const;
5398 const HOST_WIDE_INT
*get_val () const;
5399 unsigned int get_len () const;
5400 const_tree
get_tree () const { return m_t
; }
5404 struct int_traits
<unextended_tree
>
5406 static const enum precision_type precision_type
= VAR_PRECISION
;
5407 static const bool host_dependent_precision
= false;
5408 static const bool is_sign_extended
= false;
5419 extended_tree (const_tree
);
5421 unsigned int get_precision () const;
5422 const HOST_WIDE_INT
*get_val () const;
5423 unsigned int get_len () const;
5424 const_tree
get_tree () const { return m_t
; }
5428 struct int_traits
<extended_tree
<N
> >
5430 static const enum precision_type precision_type
= CONST_PRECISION
;
5431 static const bool host_dependent_precision
= false;
5432 static const bool is_sign_extended
= true;
5433 static const unsigned int precision
= N
;
5436 typedef extended_tree
<WIDE_INT_MAX_PRECISION
> widest_extended_tree
;
5437 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
5439 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
5440 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
5441 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
5444 tree_to_widest_ref
to_widest (const_tree
);
5445 tree_to_offset_ref
to_offset (const_tree
);
5446 tree_to_wide_ref
to_wide (const_tree
);
5447 wide_int
to_wide (const_tree
, unsigned int);
5449 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5450 generic_wide_int
<widest_extended_tree
> >
5451 tree_to_poly_widest_ref
;
5452 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5453 generic_wide_int
<offset_extended_tree
> >
5454 tree_to_poly_offset_ref
;
5455 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5456 generic_wide_int
<unextended_tree
> >
5457 tree_to_poly_wide_ref
;
5459 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
5460 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
5461 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
5464 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
5466 typedef generic_wide_int
<extended_tree
<N
> > extended
;
5467 static extended
zero (const extended
&);
5471 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
5473 typedef generic_wide_int
<unextended_tree
> unextended
;
5474 static unextended
zero (const unextended
&);
5478 /* Used to convert a tree to a widest2_int like this:
5479 widest2_int foo = widest2_int_cst (some_tree). */
5480 typedef generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
* 2> >
5483 /* Refer to INTEGER_CST T as though it were a widest_int.
5485 This function gives T's actual numerical value, influenced by the
5486 signedness of its type. For example, a signed byte with just the
5487 top bit set would be -128 while an unsigned byte with the same
5488 bit pattern would be 128.
5490 This is the right choice when operating on groups of INTEGER_CSTs
5491 that might have different signedness or precision. It is also the
5492 right choice in code that specifically needs an approximation of
5493 infinite-precision arithmetic instead of normal modulo arithmetic.
5495 The approximation of infinite precision is good enough for realistic
5496 numbers of additions and subtractions of INTEGER_CSTs (where
5497 "realistic" includes any number less than 1 << 31) but it cannot
5498 represent the result of multiplying the two largest supported
5499 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
5500 of multiplying two arbitrary INTEGER_CSTs and checking that the
5501 result is representable as a widest_int.
5503 Note that any overflow checking done on these values is relative to
5504 the range of widest_int rather than the range of a TREE_TYPE.
5506 Calling this function should have no overhead in release builds,
5507 so it is OK to call it several times for the same tree. If it is
5508 useful for readability reasons to reduce the number of calls,
5509 it is more efficient to use:
5511 wi::tree_to_widest_ref wt = wi::to_widest (t);
5515 widest_int wt = wi::to_widest (t). */
5517 inline wi::tree_to_widest_ref
5518 wi::to_widest (const_tree t
)
5523 /* Refer to INTEGER_CST T as though it were an offset_int.
5525 This function is an optimisation of wi::to_widest for cases
5526 in which T is known to be a bit or byte count in the range
5527 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
5528 the target's address size in bits.
5530 This is the right choice when operating on bit or byte counts as
5531 untyped numbers rather than M-bit values. The wi::to_widest comments
5532 about addition, subtraction and multiplication apply here: sequences
5533 of 1 << 31 additions and subtractions do not induce overflow, but
5534 multiplying the largest sizes might. Again,
5536 wi::tree_to_offset_ref wt = wi::to_offset (t);
5538 is more efficient than:
5540 offset_int wt = wi::to_offset (t). */
5542 inline wi::tree_to_offset_ref
5543 wi::to_offset (const_tree t
)
5548 /* Refer to INTEGER_CST T as though it were a wide_int.
5550 In contrast to the approximation of infinite-precision numbers given
5551 by wi::to_widest and wi::to_offset, this function treats T as a
5552 signless collection of N bits, where N is the precision of T's type.
5553 As with machine registers, signedness is determined by the operation
5554 rather than the operands; for example, there is a distinction between
5555 signed and unsigned division.
5557 This is the right choice when operating on values with the same type
5558 using normal modulo arithmetic. The overflow-checking forms of things
5559 like wi::add check whether the result can be represented in T's type.
5561 Calling this function should have no overhead in release builds,
5562 so it is OK to call it several times for the same tree. If it is
5563 useful for readability reasons to reduce the number of calls,
5564 it is more efficient to use:
5566 wi::tree_to_wide_ref wt = wi::to_wide (t);
5570 wide_int wt = wi::to_wide (t). */
5572 inline wi::tree_to_wide_ref
5573 wi::to_wide (const_tree t
)
5575 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
5576 TYPE_PRECISION (TREE_TYPE (t
)));
5579 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5580 truncating as necessary. When extending, use sign extension if T's
5581 type is signed and zero extension if T's type is unsigned. */
5584 wi::to_wide (const_tree t
, unsigned int prec
)
5586 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
5590 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5593 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5598 wi::extended_tree
<N
>::get_precision () const
5604 inline const HOST_WIDE_INT
*
5605 wi::extended_tree
<N
>::get_val () const
5607 return &TREE_INT_CST_ELT (m_t
, 0);
5612 wi::extended_tree
<N
>::get_len () const
5614 if (N
== ADDR_MAX_PRECISION
)
5615 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5616 else if (N
>= WIDE_INT_MAX_PRECISION
)
5617 return TREE_INT_CST_EXT_NUNITS (m_t
);
5619 /* This class is designed to be used for specific output precisions
5620 and needs to be as fast as possible, so there is no fallback for
5626 wi::unextended_tree::get_precision () const
5628 return TYPE_PRECISION (TREE_TYPE (m_t
));
5631 inline const HOST_WIDE_INT
*
5632 wi::unextended_tree::get_val () const
5634 return &TREE_INT_CST_ELT (m_t
, 0);
5638 wi::unextended_tree::get_len () const
5640 return TREE_INT_CST_NUNITS (m_t
);
5643 /* Return the value of a POLY_INT_CST in its native precision. */
5645 inline wi::tree_to_poly_wide_ref
5646 poly_int_cst_value (const_tree x
)
5648 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
5649 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5650 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
5654 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5655 poly_widest_int. See wi::to_widest for more details. */
5657 inline wi::tree_to_poly_widest_ref
5658 wi::to_poly_widest (const_tree t
)
5660 if (POLY_INT_CST_P (t
))
5662 poly_int
<NUM_POLY_INT_COEFFS
,
5663 generic_wide_int
<widest_extended_tree
> > res
;
5664 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5665 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
5671 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5672 poly_offset_int. See wi::to_offset for more details. */
5674 inline wi::tree_to_poly_offset_ref
5675 wi::to_poly_offset (const_tree t
)
5677 if (POLY_INT_CST_P (t
))
5679 poly_int
<NUM_POLY_INT_COEFFS
,
5680 generic_wide_int
<offset_extended_tree
> > res
;
5681 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5682 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
5688 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5689 poly_wide_int. See wi::to_wide for more details. */
5691 inline wi::tree_to_poly_wide_ref
5692 wi::to_poly_wide (const_tree t
)
5694 if (POLY_INT_CST_P (t
))
5695 return poly_int_cst_value (t
);
5700 inline generic_wide_int
<wi::extended_tree
<N
> >
5701 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
5702 wi::CONST_PRECISION
>::zero (const extended
&x
)
5704 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
5707 inline generic_wide_int
<wi::unextended_tree
>
5708 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
5709 wi::VAR_PRECISION
>::zero (const unextended
&x
)
5711 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
5716 template <typename T
>
5717 bool fits_to_boolean_p (const T
&x
, const_tree
);
5719 template <typename T
>
5720 bool fits_to_tree_p (const T
&x
, const_tree
);
5722 wide_int
min_value (const_tree
);
5723 wide_int
max_value (const_tree
);
5724 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5727 template <typename T
>
5729 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
5731 typedef typename poly_int_traits
<T
>::int_type int_type
;
5732 return (known_eq (x
, int_type (0))
5733 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
5736 template <typename T
>
5738 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5740 /* Non-standard boolean types can have arbitrary precision but various
5741 transformations assume that they can only take values 0 and +/-1. */
5742 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
5743 return fits_to_boolean_p (x
, type
);
5745 if (TYPE_UNSIGNED (type
))
5746 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
5748 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
5751 /* Produce the smallest number that is represented in TYPE. The precision
5752 and sign are taken from TYPE. */
5754 wi::min_value (const_tree type
)
5756 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5759 /* Produce the largest number that is represented in TYPE. The precision
5760 and sign are taken from TYPE. */
5762 wi::max_value (const_tree type
)
5764 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5767 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5768 extending both according to their respective TYPE_SIGNs. */
5771 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5773 return wi::to_widest (t1
) < wi::to_widest (t2
);
5776 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5777 extending both according to their respective TYPE_SIGNs. */
5780 tree_int_cst_le (const_tree t1
, const_tree t2
)
5782 return wi::to_widest (t1
) <= wi::to_widest (t2
);
5785 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5786 are both INTEGER_CSTs and their values are extended according to their
5787 respective TYPE_SIGNs. */
5790 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5792 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5795 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5796 but none of these files are allowed to be included from front ends.
5797 They should be split in two. One suitable for the FEs, the other suitable
5800 /* Assign the RTX to declaration. */
5801 extern void set_decl_rtl (tree
, rtx
);
5802 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5804 /* Given an expression EXP that is a handled_component_p,
5805 look for the ultimate containing object, which is returned and specify
5806 the access position and size. */
5807 extern tree
get_inner_reference (tree
, poly_int64_pod
*, poly_int64_pod
*,
5808 tree
*, machine_mode
*, int *, int *, int *);
5810 extern tree
build_personality_function (const char *);
5812 struct GTY(()) int_n_trees_t
{
5813 /* These parts are initialized at runtime */
5818 /* This is also in machmode.h */
5819 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5820 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5822 /* Like bit_position, but return as an integer. It must be representable in
5823 that way (since it could be a signed value, we don't have the
5824 option of returning -1 like int_size_in_byte can. */
5826 inline HOST_WIDE_INT
5827 int_bit_position (const_tree field
)
5829 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
5830 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5833 /* Return true if it makes sense to consider alias set for a type T. */
5836 type_with_alias_set_p (const_tree t
)
5838 /* Function and method types are never accessed as memory locations. */
5839 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5842 if (COMPLETE_TYPE_P (t
))
5845 /* Incomplete types can not be accessed in general except for arrays
5846 where we can fetch its element despite we have no array bounds. */
5847 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5853 extern location_t
set_block (location_t loc
, tree block
);
5855 extern void gt_ggc_mx (tree
&);
5856 extern void gt_pch_nx (tree
&);
5857 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5859 extern bool nonnull_arg_p (const_tree
);
5860 extern bool default_is_empty_record (const_tree
);
5861 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
5862 extern tree
arg_size_in_bytes (const_tree
);
5863 extern bool expr_type_first_operand_type_p (tree_code
);
5866 set_source_range (tree expr
, location_t start
, location_t finish
);
5869 set_source_range (tree expr
, source_range src_range
);
5871 /* Return true if it makes sense to promote/demote from_type to to_type. */
5873 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
5875 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
5877 /* OK to promote if to_type is no bigger than word_mode. */
5878 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
5881 /* Otherwise, allow only if narrowing or same precision conversions. */
5882 return to_type_precision
<= TYPE_PRECISION (from_type
);
5885 /* Pointer type used to declare builtins before we have seen its real
5887 struct builtin_structptr_type
5893 extern const builtin_structptr_type builtin_structptr_types
[6];
5895 /* Return true if type T has the same precision as its underlying mode. */
5898 type_has_mode_precision_p (const_tree t
)
5900 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
5903 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
5905 Note that it is different from the DECL_IS_BUILTIN accessor. For
5906 instance, user declared prototypes of C library functions are not
5907 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
5910 fndecl_built_in_p (const_tree node
)
5912 return (DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
);
5915 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
5919 fndecl_built_in_p (const_tree node
, built_in_class klass
)
5921 return (fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
);
5924 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
5925 of class KLASS with name equal to NAME. */
5928 fndecl_built_in_p (const_tree node
, int name
, built_in_class klass
)
5930 return (fndecl_built_in_p (node
, klass
) && DECL_FUNCTION_CODE (node
) == name
);
5933 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
5934 of BUILT_IN_NORMAL class with name equal to NAME. */
5937 fndecl_built_in_p (const_tree node
, built_in_function name
)
5939 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
5940 && DECL_FUNCTION_CODE (node
) == name
);
5943 #endif /* GCC_TREE_H */