1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2020 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_TYPE_NON_COMMON(C) \
98 (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \
99 tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \
101 #define MARK_TS_DECL_MINIMAL(C) \
102 (MARK_TS_COMMON (C), \
103 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
105 #define MARK_TS_DECL_COMMON(C) \
106 (MARK_TS_DECL_MINIMAL (C), \
107 tree_contains_struct[C][TS_DECL_COMMON] = true)
109 #define MARK_TS_DECL_WRTL(C) \
110 (MARK_TS_DECL_COMMON (C), \
111 tree_contains_struct[C][TS_DECL_WRTL] = true)
113 #define MARK_TS_DECL_WITH_VIS(C) \
114 (MARK_TS_DECL_WRTL (C), \
115 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
117 #define MARK_TS_DECL_NON_COMMON(C) \
118 (MARK_TS_DECL_WITH_VIS (C), \
119 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
121 #define MARK_TS_EXP(C) \
122 (MARK_TS_TYPED (C), \
123 tree_contains_struct[C][TS_EXP] = true)
125 /* Returns the string representing CLASS. */
127 #define TREE_CODE_CLASS_STRING(CLASS)\
128 tree_code_class_strings[(int) (CLASS)]
130 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
132 /* Nonzero if NODE represents an exceptional code. */
134 #define EXCEPTIONAL_CLASS_P(NODE)\
135 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
137 /* Nonzero if NODE represents a constant. */
139 #define CONSTANT_CLASS_P(NODE)\
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
142 /* Nonzero if NODE represents a constant, or is a location wrapper
143 around such a node. */
145 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
146 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
148 /* Nonzero if NODE represents a type. */
150 #define TYPE_P(NODE)\
151 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
153 /* Nonzero if NODE represents a declaration. */
155 #define DECL_P(NODE)\
156 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
158 /* True if NODE designates a variable declaration. */
159 #define VAR_P(NODE) \
160 (TREE_CODE (NODE) == VAR_DECL)
162 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
164 #define VAR_OR_FUNCTION_DECL_P(DECL)\
165 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
167 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
168 ascending code order. */
170 #define INDIRECT_REF_P(NODE)\
171 (TREE_CODE (NODE) == INDIRECT_REF)
173 /* Nonzero if NODE represents a reference. */
175 #define REFERENCE_CLASS_P(NODE)\
176 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
178 /* Nonzero if NODE represents a comparison. */
180 #define COMPARISON_CLASS_P(NODE)\
181 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
183 /* Nonzero if NODE represents a unary arithmetic expression. */
185 #define UNARY_CLASS_P(NODE)\
186 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
188 /* Nonzero if NODE represents a binary arithmetic expression. */
190 #define BINARY_CLASS_P(NODE)\
191 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
193 /* Nonzero if NODE represents a statement expression. */
195 #define STATEMENT_CLASS_P(NODE)\
196 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
198 /* Nonzero if NODE represents a function call-like expression with a
199 variable-length operand vector. */
201 #define VL_EXP_CLASS_P(NODE)\
202 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
204 /* Nonzero if NODE represents any other expression. */
206 #define EXPRESSION_CLASS_P(NODE)\
207 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
209 /* Returns nonzero iff NODE represents a type or declaration. */
211 #define IS_TYPE_OR_DECL_P(NODE)\
212 (TYPE_P (NODE) || DECL_P (NODE))
214 /* Returns nonzero iff CLASS is the tree-code class of an
217 #define IS_EXPR_CODE_CLASS(CLASS)\
218 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
220 /* Returns nonzero iff NODE is an expression of some kind. */
222 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
224 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
227 /* Helper macros for math builtins. */
229 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
230 #define CASE_FLT_FN_FLOATN_NX(FN) \
231 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
232 case FN##F32X: case FN##F64X: case FN##F128X
233 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
234 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
236 #define NULL_TREE (tree) NULL
238 /* Define accessors for the fields that all tree nodes have
239 (though some fields are not used for all kinds of nodes). */
241 /* The tree-code says what kind of node it is.
242 Codes are defined in tree.def. */
243 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
244 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
246 /* When checking is enabled, errors will be generated if a tree node
247 is accessed incorrectly. The macros die with a fatal error. */
248 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
250 #define TREE_CHECK(T, CODE) \
251 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
253 #define TREE_NOT_CHECK(T, CODE) \
254 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
256 #define TREE_CHECK2(T, CODE1, CODE2) \
257 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
259 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
260 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
262 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
263 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
265 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
266 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
267 (CODE1), (CODE2), (CODE3)))
269 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
270 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
271 (CODE1), (CODE2), (CODE3), (CODE4)))
273 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
274 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
275 (CODE1), (CODE2), (CODE3), (CODE4)))
277 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
278 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
279 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
281 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
282 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
283 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
285 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
286 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
288 #define TREE_CLASS_CHECK(T, CLASS) \
289 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
291 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
292 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
294 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
295 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
297 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
298 (omp_clause_range_check ((T), (CODE1), (CODE2), \
299 __FILE__, __LINE__, __FUNCTION__))
301 /* These checks have to be special cased. */
302 #define EXPR_CHECK(T) \
303 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
305 /* These checks have to be special cased. */
306 #define NON_TYPE_CHECK(T) \
307 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
309 /* These checks have to be special cased. */
310 #define ANY_INTEGRAL_TYPE_CHECK(T) \
311 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
313 #define TREE_INT_CST_ELT_CHECK(T, I) \
314 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
316 #define TREE_VEC_ELT_CHECK(T, I) \
317 (*(CONST_CAST2 (tree *, typeof (T)*, \
318 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
320 #define OMP_CLAUSE_ELT_CHECK(T, I) \
321 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
323 /* Special checks for TREE_OPERANDs. */
324 #define TREE_OPERAND_CHECK(T, I) \
325 (*(CONST_CAST2 (tree*, typeof (T)*, \
326 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
328 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
329 (*(tree_operand_check_code ((T), (CODE), (I), \
330 __FILE__, __LINE__, __FUNCTION__)))
332 /* Nodes are chained together for many purposes.
333 Types are chained together to record them for being output to the debugger
334 (see the function `chain_type').
335 Decls in the same scope are chained together to record the contents
337 Statement nodes for successive statements used to be chained together.
338 Often lists of things are represented by TREE_LIST nodes that
339 are chained together. */
341 #define TREE_CHAIN(NODE) \
342 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
344 /* In all nodes that are expressions, this is the data type of the expression.
345 In POINTER_TYPE nodes, this is the type that the pointer points to.
346 In ARRAY_TYPE nodes, this is the type of the elements.
347 In VECTOR_TYPE nodes, this is the type of the elements. */
348 #define TREE_TYPE(NODE) \
349 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
351 extern void tree_contains_struct_check_failed (const_tree
,
352 const enum tree_node_structure_enum
,
353 const char *, int, const char *)
354 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
356 extern void tree_check_failed (const_tree
, const char *, int, const char *,
357 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
358 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
359 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
360 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
361 const char *, int, const char *)
362 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
363 extern void tree_range_check_failed (const_tree
, const char *, int,
364 const char *, enum tree_code
,
366 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
367 extern void tree_not_class_check_failed (const_tree
,
368 const enum tree_code_class
,
369 const char *, int, const char *)
370 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
371 extern void tree_int_cst_elt_check_failed (int, int, const char *,
373 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
374 extern void tree_vec_elt_check_failed (int, int, const char *,
376 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
377 extern void phi_node_elt_check_failed (int, int, const char *,
379 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
380 extern void tree_operand_check_failed (int, const_tree
,
381 const char *, int, const char *)
382 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
383 extern void omp_clause_check_failed (const_tree
, const char *, int,
384 const char *, enum omp_clause_code
)
385 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
386 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
388 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
389 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
390 const char *, enum omp_clause_code
,
391 enum omp_clause_code
)
392 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
394 #else /* not ENABLE_TREE_CHECKING, or not gcc */
396 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
397 #define TREE_CHECK(T, CODE) (T)
398 #define TREE_NOT_CHECK(T, CODE) (T)
399 #define TREE_CHECK2(T, CODE1, CODE2) (T)
400 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
401 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
402 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
403 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
404 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
405 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
406 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
407 #define TREE_CLASS_CHECK(T, CODE) (T)
408 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
409 #define EXPR_CHECK(T) (T)
410 #define NON_TYPE_CHECK(T) (T)
411 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
412 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
413 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
414 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
415 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
416 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
417 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
418 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
420 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
421 #define TREE_TYPE(NODE) ((NODE)->typed.type)
425 #define TREE_BLOCK(NODE) (tree_block (NODE))
426 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
428 #include "tree-check.h"
430 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
431 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
432 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
433 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
434 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
435 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
436 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
437 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
438 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
439 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
440 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
442 #define RECORD_OR_UNION_CHECK(T) \
443 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
444 #define NOT_RECORD_OR_UNION_CHECK(T) \
445 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
446 #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
447 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
449 #define NUMERICAL_TYPE_CHECK(T) \
450 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
453 /* Here is how primitive or already-canonicalized types' hash codes
455 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
457 /* A simple hash function for an arbitrary tree node. This must not be
458 used in hash tables which are saved to a PCH. */
459 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
461 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
462 #define CONVERT_EXPR_CODE_P(CODE) \
463 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
465 /* Similarly, but accept an expression instead of a tree code. */
466 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
468 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
470 #define CASE_CONVERT \
474 /* Given an expression as a tree, strip any conversion that generates
475 no instruction. Accepts both tree and const_tree arguments since
476 we are not modifying the tree itself. */
478 #define STRIP_NOPS(EXP) \
479 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
481 /* Like STRIP_NOPS, but don't let the signedness change either. */
483 #define STRIP_SIGN_NOPS(EXP) \
484 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
486 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
488 #define STRIP_TYPE_NOPS(EXP) \
489 while ((CONVERT_EXPR_P (EXP) \
490 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
491 && TREE_OPERAND (EXP, 0) != error_mark_node \
492 && (TREE_TYPE (EXP) \
493 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
494 (EXP) = TREE_OPERAND (EXP, 0)
496 /* Remove unnecessary type conversions according to
497 tree_ssa_useless_type_conversion. */
499 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
500 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
502 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
503 in use to provide a location_t. */
505 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
506 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
508 /* Nonzero if TYPE represents a vector type. */
510 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
512 /* Nonzero if TYPE represents a vector of booleans. */
514 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
515 (TREE_CODE (TYPE) == VECTOR_TYPE \
516 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
518 /* Nonzero if TYPE represents an integral type. Note that we do not
519 include COMPLEX types here. Keep these checks in ascending code
522 #define INTEGRAL_TYPE_P(TYPE) \
523 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
524 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
525 || TREE_CODE (TYPE) == INTEGER_TYPE)
527 /* Nonzero if TYPE represents an integral type, including complex
528 and vector integer types. */
530 #define ANY_INTEGRAL_TYPE_P(TYPE) \
531 (INTEGRAL_TYPE_P (TYPE) \
532 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
533 || VECTOR_TYPE_P (TYPE)) \
534 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
536 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
538 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
539 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
541 /* Nonzero if TYPE represents a saturating fixed-point type. */
543 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
544 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
546 /* Nonzero if TYPE represents a fixed-point type. */
548 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
550 /* Nonzero if TYPE represents a scalar floating-point type. */
552 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
554 /* Nonzero if TYPE represents a complex floating-point type. */
556 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
557 (TREE_CODE (TYPE) == COMPLEX_TYPE \
558 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
560 /* Nonzero if TYPE represents a vector integer type. */
562 #define VECTOR_INTEGER_TYPE_P(TYPE) \
563 (VECTOR_TYPE_P (TYPE) \
564 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
567 /* Nonzero if TYPE represents a vector floating-point type. */
569 #define VECTOR_FLOAT_TYPE_P(TYPE) \
570 (VECTOR_TYPE_P (TYPE) \
571 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
573 /* Nonzero if TYPE represents a floating-point type, including complex
574 and vector floating-point types. The vector and complex check does
575 not use the previous two macros to enable early folding. */
577 #define FLOAT_TYPE_P(TYPE) \
578 (SCALAR_FLOAT_TYPE_P (TYPE) \
579 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
580 || VECTOR_TYPE_P (TYPE)) \
581 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
583 /* Nonzero if TYPE represents a decimal floating-point type. */
584 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
585 (SCALAR_FLOAT_TYPE_P (TYPE) \
586 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
588 /* Nonzero if TYPE is a record or union type. */
589 #define RECORD_OR_UNION_TYPE_P(TYPE) \
590 (TREE_CODE (TYPE) == RECORD_TYPE \
591 || TREE_CODE (TYPE) == UNION_TYPE \
592 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
594 /* Nonzero if TYPE represents an aggregate (multi-component) type.
595 Keep these checks in ascending code order. */
597 #define AGGREGATE_TYPE_P(TYPE) \
598 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
600 /* Nonzero if TYPE represents a pointer or reference type.
601 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
602 ascending code order. */
604 #define POINTER_TYPE_P(TYPE) \
605 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
607 /* Nonzero if TYPE represents a pointer to function. */
608 #define FUNCTION_POINTER_TYPE_P(TYPE) \
609 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
611 /* Nonzero if this type is a complete type. */
612 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
614 /* Nonzero if this type is the (possibly qualified) void type. */
615 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
617 /* Nonzero if this type is complete or is cv void. */
618 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
619 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
621 /* Nonzero if this type is complete or is an array with unspecified bound. */
622 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
623 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
625 #define FUNC_OR_METHOD_TYPE_P(NODE) \
626 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
628 #define OPAQUE_TYPE_P(NODE) \
629 (TREE_CODE (NODE) == OPAQUE_TYPE)
631 /* Define many boolean fields that all tree nodes have. */
633 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
634 of this is needed. So it cannot be in a register.
635 In a FUNCTION_DECL it has no meaning.
636 In LABEL_DECL nodes, it means a goto for this label has been seen
637 from a place outside all binding contours that restore stack levels.
638 In an artificial SSA_NAME that points to a stack partition with at least
639 two variables, it means that at least one variable has TREE_ADDRESSABLE.
640 In ..._TYPE nodes, it means that objects of this type must be fully
641 addressable. This means that pieces of this object cannot go into
642 register parameters, for example. If this a function type, this
643 means that the value must be returned in memory.
644 In CONSTRUCTOR nodes, it means object constructed must be in memory.
645 In IDENTIFIER_NODEs, this means that some extern decl for this name
646 had its address taken. That matters for inline functions.
647 In a STMT_EXPR, it means we want the result of the enclosed expression. */
648 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
650 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
651 exit of a function. Calls for which this is true are candidates for tail
652 call optimizations. */
653 #define CALL_EXPR_TAILCALL(NODE) \
654 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
656 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
657 optimization for correctness. */
658 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
659 (CALL_EXPR_CHECK (NODE)->base.static_flag)
661 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
662 CASE_LOW operand has been processed. */
663 #define CASE_LOW_SEEN(NODE) \
664 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
666 #define PREDICT_EXPR_OUTCOME(NODE) \
667 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
668 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
669 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
670 #define PREDICT_EXPR_PREDICTOR(NODE) \
671 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
673 /* In a VAR_DECL, nonzero means allocate static storage.
674 In a FUNCTION_DECL, nonzero if function has been defined.
675 In a CONSTRUCTOR, nonzero means allocate static storage. */
676 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
678 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
679 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
681 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
682 should only be executed if an exception is thrown, not on normal exit
684 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
686 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
687 separate cleanup in honor_protect_cleanup_actions. */
688 #define TRY_CATCH_IS_CLEANUP(NODE) \
689 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
691 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
692 CASE_HIGH operand has been processed. */
693 #define CASE_HIGH_SEEN(NODE) \
694 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
696 /* Used to mark scoped enums. */
697 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
699 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
700 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
702 /* In an expr node (usually a conversion) this means the node was made
703 implicitly and should not lead to any sort of warning. In a decl node,
704 warnings concerning the decl should be suppressed. This is used at
705 least for used-before-set warnings, and it set after one warning is
707 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
709 /* Nonzero if we should warn about the change in empty class parameter
710 passing ABI in this TU. */
711 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
712 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
714 /* Nonzero if this type is "empty" according to the particular psABI. */
715 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
717 /* Used to indicate that this TYPE represents a compiler-generated entity. */
718 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
720 /* True if the type is indivisible at the source level, i.e. if its
721 component parts cannot be accessed directly. This is used to suppress
722 normal GNU extensions for target-specific vector types. */
723 #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
725 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
726 this string as an argument. */
727 #define TREE_SYMBOL_REFERENCED(NODE) \
728 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
730 /* Nonzero in a pointer or reference type means the data pointed to
731 by this type can alias anything. */
732 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
733 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
735 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
736 there was an overflow in folding. */
738 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
740 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
742 #define TREE_OVERFLOW_P(EXPR) \
743 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
745 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
746 nonzero means name is to be accessible from outside this translation unit.
747 In an IDENTIFIER_NODE, nonzero means an external declaration
748 accessible from outside this translation unit was previously seen
749 for this name in an inner scope. */
750 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
752 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
753 of cached values, or is something else. */
754 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
756 /* In a SAVE_EXPR, indicates that the original expression has already
757 been substituted with a VAR_DECL that contains the value. */
758 #define SAVE_EXPR_RESOLVED_P(NODE) \
759 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
761 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
763 #define CALL_EXPR_VA_ARG_PACK(NODE) \
764 (CALL_EXPR_CHECK (NODE)->base.public_flag)
766 /* In any expression, decl, or constant, nonzero means it has side effects or
767 reevaluation of the whole expression could produce a different value.
768 This is set if any subexpression is a function call, a side effect or a
769 reference to a volatile variable. In a ..._DECL, this is set only if the
770 declaration said `volatile'. This will never be set for a constant. */
771 #define TREE_SIDE_EFFECTS(NODE) \
772 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
774 /* In a LABEL_DECL, nonzero means this label had its address taken
775 and therefore can never be deleted and is a jump target for
777 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
779 /* Whether a case or a user-defined label is allowed to fall through to.
780 This is used to implement -Wimplicit-fallthrough. */
781 #define FALLTHROUGH_LABEL_P(NODE) \
782 (LABEL_DECL_CHECK (NODE)->base.private_flag)
784 /* Set on the artificial label created for break; stmt from a switch.
785 This is used to implement -Wimplicit-fallthrough. */
786 #define SWITCH_BREAK_LABEL_P(NODE) \
787 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
789 /* Nonzero means this expression is volatile in the C sense:
790 its address should be of type `volatile WHATEVER *'.
791 In other words, the declared item is volatile qualified.
792 This is used in _DECL nodes and _REF nodes.
793 On a FUNCTION_DECL node, this means the function does not
794 return normally. This is the same effect as setting
795 the attribute noreturn on the function in C.
797 In a ..._TYPE node, means this type is volatile-qualified.
798 But use TYPE_VOLATILE instead of this macro when the node is a type,
799 because eventually we may make that a different bit.
801 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
802 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
804 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
805 accessing the memory pointed to won't generate a trap. However,
806 this only applies to an object when used appropriately: it doesn't
807 mean that writing a READONLY mem won't trap.
809 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
810 (or slice of the array) always belongs to the range of the array.
811 I.e. that the access will not trap, provided that the access to
812 the base to the array will not trap. */
813 #define TREE_THIS_NOTRAP(NODE) \
814 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
815 ARRAY_RANGE_REF)->base.nothrow_flag)
817 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
818 nonzero means it may not be the lhs of an assignment.
819 Nonzero in a FUNCTION_DECL means this function should be treated
820 as "const" function (can only read its arguments). */
821 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
823 /* Value of expression is constant. Always on in all ..._CST nodes. May
824 also appear in an expression or decl where the value is constant. */
825 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
827 /* Nonzero if NODE, a type, has had its sizes gimplified. */
828 #define TYPE_SIZES_GIMPLIFIED(NODE) \
829 (TYPE_CHECK (NODE)->base.constant_flag)
831 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
832 #define DECL_UNSIGNED(NODE) \
833 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
835 /* In integral and pointer types, means an unsigned type. */
836 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
838 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
839 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
841 /* True if overflow wraps around for the given integral or pointer type. That
842 is, TYPE_MAX + 1 == TYPE_MIN. */
843 #define TYPE_OVERFLOW_WRAPS(TYPE) \
844 (POINTER_TYPE_P (TYPE) \
845 ? flag_wrapv_pointer \
846 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
849 /* True if overflow is undefined for the given integral or pointer type.
850 We may optimize on the assumption that values in the type never overflow.
852 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
853 must issue a warning based on warn_strict_overflow. In some cases
854 it will be appropriate to issue the warning immediately, and in
855 other cases it will be appropriate to simply set a flag and let the
856 caller decide whether a warning is appropriate or not. */
857 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
858 (POINTER_TYPE_P (TYPE) \
859 ? !flag_wrapv_pointer \
860 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
861 && !flag_wrapv && !flag_trapv))
863 /* True if overflow for the given integral type should issue a
865 #define TYPE_OVERFLOW_TRAPS(TYPE) \
866 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
868 /* True if an overflow is to be preserved for sanitization. */
869 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
870 (INTEGRAL_TYPE_P (TYPE) \
871 && !TYPE_OVERFLOW_WRAPS (TYPE) \
872 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
874 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
875 Nonzero in a FUNCTION_DECL means that the function has been compiled.
876 This is interesting in an inline function, since it might not need
877 to be compiled separately.
878 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
879 or TYPE_DECL if the debugging info for the type has been written.
880 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
881 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
883 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
885 /* Nonzero in a _DECL if the name is used in its scope.
886 Nonzero in an expr node means inhibit warning if value is unused.
887 In IDENTIFIER_NODEs, this means that some extern decl for this name
889 In a BLOCK, this means that the block contains variables that are used. */
890 #define TREE_USED(NODE) ((NODE)->base.used_flag)
892 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
893 throw an exception. In a CALL_EXPR, nonzero means the call cannot
894 throw. We can't easily check the node type here as the C++
895 frontend also uses this flag (for AGGR_INIT_EXPR). */
896 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
898 /* In a CALL_EXPR, means that it's safe to use the target of the call
899 expansion as the return slot for a call that returns in memory. */
900 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
901 (CALL_EXPR_CHECK (NODE)->base.private_flag)
903 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
904 passed by invisible reference (and the TREE_TYPE is a pointer to the true
906 #define DECL_BY_REFERENCE(NODE) \
907 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
908 RESULT_DECL)->decl_common.decl_by_reference_flag)
910 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
912 #define DECL_READ_P(NODE) \
913 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
915 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
916 attempting to share the stack slot with some other variable. */
917 #define DECL_NONSHAREABLE(NODE) \
918 (TREE_CHECK2 (NODE, VAR_DECL, \
919 RESULT_DECL)->decl_common.decl_nonshareable_flag)
921 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
922 buggy callers don't pass to the callee. */
923 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
924 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
926 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
927 thunked-to function. Be careful to avoid using this macro when one of the
928 next two applies instead. */
929 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
931 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
932 it has been built for the declaration of a variable-sized object and, if the
933 function being called is BUILT_IN_MEMCPY, means that it has been built for
934 the assignment of a variable-sized object. */
935 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
936 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
938 /* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or
939 DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete
941 #define CALL_FROM_NEW_OR_DELETE_P(NODE) \
942 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
944 /* Used in classes in C++. */
945 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
946 /* Used in classes in C++. */
947 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
949 /* True if reference type NODE is a C++ rvalue reference. */
950 #define TYPE_REF_IS_RVALUE(NODE) \
951 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
953 /* Nonzero in a _DECL if the use of the name is defined as a
954 deprecated feature by __attribute__((deprecated)). */
955 #define TREE_DEPRECATED(NODE) \
956 ((NODE)->base.deprecated_flag)
958 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
959 aggregate, (as created by anon_aggr_name_format). */
960 #define IDENTIFIER_ANON_P(NODE) \
961 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
963 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
964 uses are to be substituted for uses of the TREE_CHAINed identifier. */
965 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
966 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
968 /* In an aggregate type, indicates that the scalar fields of the type are
969 stored in reverse order from the target order. This effectively
970 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
971 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
972 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
974 /* In a non-aggregate type, indicates a saturating type. */
975 #define TYPE_SATURATING(NODE) \
976 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
978 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
979 of bits stored in reverse order from the target order. This effectively
980 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
982 The overall strategy is to preserve the invariant that every scalar in
983 memory is associated with a single storage order, i.e. all accesses to
984 this scalar are done with the same storage order. This invariant makes
985 it possible to factor out the storage order in most transformations, as
986 only the address and/or the value (in target order) matter for them.
987 But, of course, the storage order must be preserved when the accesses
988 themselves are rewritten or transformed. */
989 #define REF_REVERSE_STORAGE_ORDER(NODE) \
990 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
992 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
993 represented by a descriptor instead of a trampoline. */
994 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
995 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
997 /* In a CALL_EXPR, indicates that this is an indirect call for which
998 pointers to nested function are descriptors instead of trampolines. */
999 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
1000 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
1002 /* These flags are available for each language front end to use internally. */
1003 #define TREE_LANG_FLAG_0(NODE) \
1004 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1005 #define TREE_LANG_FLAG_1(NODE) \
1006 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1007 #define TREE_LANG_FLAG_2(NODE) \
1008 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1009 #define TREE_LANG_FLAG_3(NODE) \
1010 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1011 #define TREE_LANG_FLAG_4(NODE) \
1012 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1013 #define TREE_LANG_FLAG_5(NODE) \
1014 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1015 #define TREE_LANG_FLAG_6(NODE) \
1016 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1018 /* Define additional fields and accessors for nodes representing constants. */
1020 #define TREE_INT_CST_NUNITS(NODE) \
1021 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1022 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1023 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1024 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1025 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1026 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1027 #define TREE_INT_CST_LOW(NODE) \
1028 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1030 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1031 targets with variable-sized modes. */
1032 #define POLY_INT_CST_P(NODE) \
1033 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1035 /* In a POLY_INT_CST node. */
1036 #define POLY_INT_CST_COEFF(NODE, I) \
1037 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1039 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1040 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1042 #define TREE_FIXED_CST_PTR(NODE) \
1043 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1044 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1046 /* In a STRING_CST */
1047 /* In C terms, this is sizeof, not strlen. */
1048 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1049 #define TREE_STRING_POINTER(NODE) \
1050 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1052 /* In a COMPLEX_CST node. */
1053 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1054 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1056 /* In a VECTOR_CST node. See generic.texi for details. */
1057 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1058 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1060 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1061 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1062 #define VECTOR_CST_NPATTERNS(NODE) \
1063 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1064 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1065 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1066 #define VECTOR_CST_DUPLICATE_P(NODE) \
1067 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1068 #define VECTOR_CST_STEPPED_P(NODE) \
1069 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1070 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1071 (VECTOR_CST_CHECK (NODE)->vector.elts)
1072 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1073 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1075 /* Define fields and accessors for some special-purpose tree nodes. */
1077 #define IDENTIFIER_LENGTH(NODE) \
1078 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1079 #define IDENTIFIER_POINTER(NODE) \
1080 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1081 #define IDENTIFIER_HASH_VALUE(NODE) \
1082 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1084 /* Translate a hash table identifier pointer to a tree_identifier
1085 pointer, and vice versa. */
1087 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1088 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1089 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1091 /* In a TREE_LIST node. */
1092 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1093 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1095 /* In a TREE_VEC node. */
1096 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1097 #define TREE_VEC_END(NODE) \
1098 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1100 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1102 /* In a CONSTRUCTOR node. */
1103 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1104 #define CONSTRUCTOR_ELT(NODE,IDX) \
1105 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1106 #define CONSTRUCTOR_NELTS(NODE) \
1107 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1108 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1109 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1111 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1112 value of each element (stored within VAL). IX must be a scratch variable
1113 of unsigned integer type. */
1114 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1115 for (IX = 0; (IX >= vec_safe_length (V)) \
1117 : ((VAL = (*(V))[IX].value), \
1121 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1122 the value of each element (stored within VAL) and its index (stored
1123 within INDEX). IX must be a scratch variable of unsigned integer type. */
1124 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1125 for (IX = 0; (IX >= vec_safe_length (V)) \
1127 : (((void) (VAL = (*V)[IX].value)), \
1128 (INDEX = (*V)[IX].index), \
1132 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1133 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1135 constructor_elt _ce___ = {INDEX, VALUE}; \
1136 vec_safe_push ((V), _ce___); \
1139 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1140 constructor output purposes. */
1141 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1142 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1144 /* True if NODE is a clobber right hand side, an expression of indeterminate
1145 value that clobbers the LHS in a copy instruction. We use a volatile
1146 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1147 In particular the volatile flag causes us to not prematurely remove
1148 such clobber instructions. */
1149 #define TREE_CLOBBER_P(NODE) \
1150 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1152 /* Define fields and accessors for some nodes that represent expressions. */
1154 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1155 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1156 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1157 && integer_zerop (TREE_OPERAND (NODE, 0)))
1159 /* In ordinary expression nodes. */
1160 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1161 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1163 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1164 length. Its value includes the length operand itself; that is,
1165 the minimum valid length is 1.
1166 Note that we have to bypass the use of TREE_OPERAND to access
1167 that field to avoid infinite recursion in expanding the macros. */
1168 #define VL_EXP_OPERAND_LENGTH(NODE) \
1169 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1171 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1172 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1173 /* Nonzero if gimple_debug_bind_p() (and thus
1174 gimple_debug_source_bind_p()) may possibly hold. */
1175 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1176 /* Nonzero if is_gimple_debug() may possibly hold. */
1177 #define MAY_HAVE_DEBUG_STMTS \
1178 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1180 /* In a LOOP_EXPR node. */
1181 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1183 /* The source location of this expression. Non-tree_exp nodes such as
1184 decls and constants can be shared among multiple locations, so
1186 #define EXPR_LOCATION(NODE) \
1187 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1188 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1189 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1190 != UNKNOWN_LOCATION)
1191 /* The location to be used in a diagnostic about this expression. Do not
1192 use this macro if the location will be assigned to other expressions. */
1193 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1194 ? (NODE)->exp.locus : (LOCUS))
1195 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1196 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1198 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1199 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1201 #define EXPR_HAS_RANGE(NODE) \
1202 (CAN_HAVE_RANGE_P (NODE) \
1203 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1206 /* True if a tree is an expression or statement that can have a
1208 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1210 static inline source_range
1211 get_expr_source_range (tree expr
)
1213 location_t loc
= EXPR_LOCATION (expr
);
1214 return get_range_from_loc (line_table
, loc
);
1217 extern void protected_set_expr_location (tree
, location_t
);
1218 extern void protected_set_expr_location_if_unset (tree
, location_t
);
1220 WARN_UNUSED_RESULT
extern tree
maybe_wrap_with_location (tree
, location_t
);
1222 extern int suppress_location_wrappers
;
1224 /* A class for suppressing the creation of location wrappers.
1225 Location wrappers will not be created during the lifetime
1226 of an instance of this class. */
1228 class auto_suppress_location_wrappers
1231 auto_suppress_location_wrappers () { ++suppress_location_wrappers
; }
1232 ~auto_suppress_location_wrappers () { --suppress_location_wrappers
; }
1235 /* In a TARGET_EXPR node. */
1236 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1237 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1238 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1239 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1240 on rhs of MODIFY_EXPR. */
1241 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1243 /* DECL_EXPR accessor. This gives access to the DECL associated with
1244 the given declaration statement. */
1245 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1247 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1249 /* COMPOUND_LITERAL_EXPR accessors. */
1250 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1251 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1252 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1253 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1255 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1256 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1257 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1258 /* True if there are case labels for all possible values of SWITCH_COND, either
1259 because there is a default: case label or because the case label ranges cover
1261 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1263 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1264 of a case label, respectively. */
1265 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1266 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1267 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1268 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1270 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1271 corresponding MEM_REF operands. */
1272 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1273 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1274 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1275 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1276 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1278 #define MR_DEPENDENCE_CLIQUE(NODE) \
1279 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1280 #define MR_DEPENDENCE_BASE(NODE) \
1281 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1283 /* The operands of a BIND_EXPR. */
1284 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1285 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1286 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1288 /* GOTO_EXPR accessor. This gives access to the label associated with
1289 a goto statement. */
1290 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1292 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1293 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1294 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1296 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1297 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1298 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1299 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1300 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1301 /* Nonzero if we want to create an ASM_INPUT instead of an
1302 ASM_OPERAND with no operands. */
1303 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1304 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1305 /* Nonzero if we want to consider this asm as minimum length and cost
1306 for inlining decisions. */
1307 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1309 /* COND_EXPR accessors. */
1310 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1311 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1312 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1314 /* Accessors for the chains of recurrences. */
1315 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1316 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1317 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1319 /* LABEL_EXPR accessor. This gives access to the label associated with
1320 the given label expression. */
1321 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1323 /* CATCH_EXPR accessors. */
1324 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1325 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1327 /* EH_FILTER_EXPR accessors. */
1328 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1329 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1331 /* OBJ_TYPE_REF accessors. */
1332 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1333 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1334 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1336 /* ASSERT_EXPR accessors. */
1337 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1338 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1340 /* CALL_EXPR accessors. */
1341 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1342 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1343 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1344 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1345 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1347 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1348 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1349 the argument count is zero when checking is enabled. Instead, do
1350 the pointer arithmetic to advance past the 3 fixed operands in a
1351 CALL_EXPR. That produces a valid pointer to just past the end of the
1352 operand array, even if it's not valid to dereference it. */
1353 #define CALL_EXPR_ARGP(NODE) \
1354 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1356 /* TM directives and accessors. */
1357 #define TRANSACTION_EXPR_BODY(NODE) \
1358 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1359 #define TRANSACTION_EXPR_OUTER(NODE) \
1360 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1361 #define TRANSACTION_EXPR_RELAXED(NODE) \
1362 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1364 /* OpenMP and OpenACC directive and clause accessors. */
1366 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1368 #define OMP_BODY(NODE) \
1369 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1370 #define OMP_CLAUSES(NODE) \
1371 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1373 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1374 #define OMP_STANDALONE_CLAUSES(NODE) \
1375 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1377 #define OACC_DATA_BODY(NODE) \
1378 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1379 #define OACC_DATA_CLAUSES(NODE) \
1380 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1382 #define OACC_HOST_DATA_BODY(NODE) \
1383 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1384 #define OACC_HOST_DATA_CLAUSES(NODE) \
1385 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1387 #define OACC_CACHE_CLAUSES(NODE) \
1388 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1390 #define OACC_DECLARE_CLAUSES(NODE) \
1391 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1393 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1394 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1396 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1397 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1399 #define OACC_UPDATE_CLAUSES(NODE) \
1400 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1402 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1403 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1405 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1406 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1408 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1409 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1410 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1412 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1413 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1414 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1415 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1416 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1417 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1418 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1419 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1421 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1422 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1424 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1426 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1427 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1429 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1431 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1432 #define OMP_TASKGROUP_CLAUSES(NODE) \
1433 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1435 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1436 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1438 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1439 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1440 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1442 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1443 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1445 #define OMP_TARGET_DATA_BODY(NODE) \
1446 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1447 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1448 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1450 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1451 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1453 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1454 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1456 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1457 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1459 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1460 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1462 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1463 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1465 #define OMP_CLAUSE_SIZE(NODE) \
1466 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1468 OMP_CLAUSE__CACHE_), 1)
1470 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1471 #define OMP_CLAUSE_DECL(NODE) \
1472 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1473 OMP_CLAUSE_PRIVATE, \
1474 OMP_CLAUSE__SCANTEMP_), 0)
1475 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1476 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1477 != UNKNOWN_LOCATION)
1478 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1480 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1481 is non-rectangular. */
1482 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1483 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1485 /* True on an OMP_SECTION statement that was the last lexical member.
1486 This status is meaningful in the implementation of lastprivate. */
1487 #define OMP_SECTION_LAST(NODE) \
1488 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1490 /* True on an OMP_PARALLEL statement if it represents an explicit
1491 combined parallel work-sharing constructs. */
1492 #define OMP_PARALLEL_COMBINED(NODE) \
1493 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1495 /* True on an OMP_TEAMS statement if it represents an explicit
1496 combined teams distribute constructs. */
1497 #define OMP_TEAMS_COMBINED(NODE) \
1498 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1500 /* True on an OMP_TARGET statement if it represents explicit
1501 combined target teams, target parallel or target simd constructs. */
1502 #define OMP_TARGET_COMBINED(NODE) \
1503 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1505 /* Memory order for OMP_ATOMIC*. */
1506 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1507 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1508 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1510 /* True on a PRIVATE clause if its decl is kept around for debugging
1511 information only and its DECL_VALUE_EXPR is supposed to point
1512 to what it has been remapped to. */
1513 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1514 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1516 /* True on a PRIVATE clause if ctor needs access to outer region's
1518 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1519 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1521 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1522 (thus should be private on the outer taskloop and firstprivate on
1524 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1525 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1527 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1528 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1529 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1531 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1532 to should be firstprivatized. */
1533 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1534 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1536 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1537 decl is present in the chain. */
1538 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1539 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1540 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1541 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1542 OMP_CLAUSE_LASTPRIVATE),\
1544 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1545 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1547 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1548 loop construct (thus should be lastprivate on the outer taskloop and
1549 firstprivate on task for the taskloop construct and carefully handled
1550 for loop construct). */
1551 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1552 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1554 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1555 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1556 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1558 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1559 decl is present in the chain (this can happen only for taskloop
1560 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1561 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1562 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1564 /* True on a SHARED clause if a scalar is not modified in the body and
1565 thus could be optimized as firstprivate. */
1566 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1567 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1569 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1570 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1572 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1573 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1574 #define OMP_CLAUSE_IF_EXPR(NODE) \
1575 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1576 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1577 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1578 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1579 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1580 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1581 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1582 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1583 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1585 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1586 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1588 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1589 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1591 /* OpenACC clause expressions */
1592 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1593 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1594 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1595 OMP_CLAUSE_OPERAND ( \
1596 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1597 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1598 OMP_CLAUSE_OPERAND ( \
1599 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1600 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1601 OMP_CLAUSE_OPERAND ( \
1602 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1603 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1604 OMP_CLAUSE_OPERAND ( \
1605 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1606 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1607 OMP_CLAUSE_OPERAND ( \
1608 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1609 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1610 OMP_CLAUSE_OPERAND ( \
1611 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1612 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1613 OMP_CLAUSE_OPERAND ( \
1614 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1615 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1616 OMP_CLAUSE_OPERAND ( \
1617 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1618 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1619 OMP_CLAUSE_OPERAND ( \
1620 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1622 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1623 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1625 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1626 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1628 #define OMP_CLAUSE_MAP_KIND(NODE) \
1629 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1630 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1631 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1632 = (unsigned int) (MAP_KIND))
1634 /* Nonzero if this map clause is for array (rather than pointer) based array
1635 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1636 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1637 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1638 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1639 /* Nonzero if this is a mapped array section, that might need special
1640 treatment if OMP_CLAUSE_SIZE is zero. */
1641 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1642 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1643 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1645 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1646 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1648 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1650 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1651 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1653 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1654 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1656 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1657 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1659 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1660 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1661 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1662 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1663 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1664 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1666 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1667 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1669 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1670 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1671 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1672 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1673 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1674 OMP_CLAUSE_IN_REDUCTION), 1)
1675 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1676 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1677 OMP_CLAUSE_IN_REDUCTION), 2)
1678 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1679 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1680 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1681 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1682 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1683 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1684 OMP_CLAUSE_IN_REDUCTION), 3)
1685 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1686 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1687 OMP_CLAUSE_IN_REDUCTION), 4)
1689 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1690 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1691 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1692 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1693 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1695 /* True if a REDUCTION clause has task reduction-modifier. */
1696 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1697 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1699 /* True if a REDUCTION clause has inscan reduction-modifier. */
1700 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1701 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1703 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1704 are always initialized inside of the loop construct, false otherwise. */
1705 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1706 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1708 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1709 are declared inside of the simd construct. */
1710 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1711 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1713 /* True if a LINEAR clause has a stride that is variable. */
1714 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1715 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1717 /* True if a LINEAR clause is for an array or allocatable variable that
1718 needs special handling by the frontend. */
1719 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1720 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1722 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1723 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1725 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1726 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1728 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1729 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1731 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1732 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1734 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1735 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1737 #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1740 /* True if an ALLOCATE clause was present on a combined or composite
1741 construct and the code for splitting the clauses has already performed
1742 checking if the listed variable has explicit privatization on the
1744 #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1745 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1747 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1750 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1752 OMP_CLAUSE_THREAD_LIMIT), 0)
1754 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1755 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1757 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1759 OMP_CLAUSE_DIST_SCHEDULE), 0)
1761 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1762 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1764 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1765 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1767 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1768 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1770 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1771 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1773 /* True if a SCHEDULE clause has the simd modifier on it. */
1774 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1775 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1777 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1778 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1780 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1781 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1782 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1783 ((enum omp_clause_defaultmap_kind) \
1784 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1785 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1786 ((enum omp_clause_defaultmap_kind) \
1787 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1788 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1789 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1790 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1792 #define OMP_CLAUSE_BIND_KIND(NODE) \
1793 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
1795 #define OMP_CLAUSE_TILE_LIST(NODE) \
1796 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1797 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1798 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1799 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1802 /* _CONDTEMP_ holding temporary with iteration count. */
1803 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
1804 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
1806 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
1808 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
1809 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
1811 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
1812 one boolean_type_node for test whether alloca was used, another one
1813 to pass to __builtin_stack_restore or free. */
1814 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
1815 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
1817 /* SSA_NAME accessors. */
1819 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1820 information in the underlying SSA_NAME_VAR for efficiency. */
1821 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1822 SSA_NAME_CHECK (NODE)->base.public_flag
1824 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1825 if there is no name associated with it. */
1826 #define SSA_NAME_IDENTIFIER(NODE) \
1827 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1828 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1829 ? (NODE)->ssa_name.var \
1830 : DECL_NAME ((NODE)->ssa_name.var)) \
1833 /* Returns the variable being referenced. This can be NULL_TREE for
1834 temporaries not associated with any user variable.
1835 Once released, this is the only field that can be relied upon. */
1836 #define SSA_NAME_VAR(NODE) \
1837 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1838 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1839 ? NULL_TREE : (NODE)->ssa_name.var)
1841 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1844 tree var_ = (VAR); \
1845 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1846 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1848 && TREE_CODE (var_) == VAR_DECL \
1849 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1853 /* Returns the statement which defines this SSA name. */
1854 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1856 /* Returns the SSA version number of this SSA name. Note that in
1857 tree SSA, version numbers are not per variable and may be recycled. */
1858 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1860 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1861 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1863 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1864 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1866 /* Nonzero if this SSA_NAME expression is currently on the free list of
1867 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1868 has no meaning for an SSA_NAME. */
1869 #define SSA_NAME_IN_FREE_LIST(NODE) \
1870 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1872 /* Nonzero if this SSA_NAME is the default definition for the
1873 underlying symbol. A default SSA name is created for symbol S if
1874 the very first reference to S in the function is a read operation.
1875 Default definitions are always created by an empty statement and
1876 belong to no basic block. */
1877 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1878 SSA_NAME_CHECK (NODE)->base.default_def_flag
1880 /* Nonzero if this SSA_NAME is known to point to memory that may not
1881 be written to. This is set for default defs of function parameters
1882 that have a corresponding r or R specification in the functions
1883 fn spec attribute. This is used by alias analysis. */
1884 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1885 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1887 /* Attributes for SSA_NAMEs for pointer-type variables. */
1888 #define SSA_NAME_PTR_INFO(N) \
1889 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1891 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1892 #define SSA_NAME_ANTI_RANGE_P(N) \
1893 SSA_NAME_CHECK (N)->base.static_flag
1895 /* The type of range described by SSA_NAME_RANGE_INFO. */
1896 #define SSA_NAME_RANGE_TYPE(N) \
1897 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1899 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1900 #define SSA_NAME_RANGE_INFO(N) \
1901 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1903 /* Return the immediate_use information for an SSA_NAME. */
1904 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1906 #define OMP_CLAUSE_CODE(NODE) \
1907 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1909 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1910 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1912 #define OMP_CLAUSE_OPERAND(NODE, I) \
1913 OMP_CLAUSE_ELT_CHECK (NODE, I)
1915 /* In a BLOCK node. */
1916 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1917 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1918 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1919 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1920 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1921 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1922 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1923 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1924 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1925 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1926 #define BLOCK_ORIGIN(NODE) \
1927 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
1928 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1930 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1931 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1933 /* True if BLOCK appears in cold section. */
1934 #define BLOCK_IN_COLD_SECTION_P(NODE) \
1935 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
1937 /* An index number for this block. These values are not guaranteed to
1938 be unique across functions -- whether or not they are depends on
1939 the debugging output format in use. */
1940 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1942 /* If block reordering splits a lexical block into discontiguous
1943 address ranges, we'll make a copy of the original block.
1945 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1946 In that case, we have one source block that has been replicated
1947 (through inlining or unrolling) into many logical blocks, and that
1948 these logical blocks have different physical variables in them.
1950 In this case, we have one logical block split into several
1951 non-contiguous address ranges. Most debug formats can't actually
1952 represent this idea directly, so we fake it by creating multiple
1953 logical blocks with the same variables in them. However, for those
1954 that do support non-contiguous regions, these allow the original
1955 logical block to be reconstructed, along with the set of address
1958 One of the logical block fragments is arbitrarily chosen to be
1959 the ORIGIN. The other fragments will point to the origin via
1960 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1961 be null. The list of fragments will be chained through
1962 BLOCK_FRAGMENT_CHAIN from the origin. */
1964 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1965 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1967 /* For an inlined function, this gives the location where it was called
1968 from. This is only set in the top level block, which corresponds to the
1969 inlined function scope. This is used in the debug output routines. */
1971 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1973 /* This gives the location of the end of the block, useful to attach
1974 code implicitly generated for outgoing paths. */
1976 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1978 /* Define fields and accessors for nodes representing data types. */
1980 /* See tree.def for documentation of the use of these fields.
1981 Look at the documentation of the various ..._TYPE tree codes.
1983 Note that the type.values, type.minval, and type.maxval fields are
1984 overloaded and used for different macros in different kinds of types.
1985 Each macro must check to ensure the tree node is of the proper kind of
1986 type. Note also that some of the front-ends also overload these fields,
1987 so they must be checked as well. */
1989 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1990 /* Type size in bits as a tree expression. Need not be constant
1992 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1993 /* Likewise, type size in bytes. */
1994 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1995 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1996 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1997 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1998 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1999 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2000 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2001 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2003 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2004 #define TYPE_MODE(NODE) \
2005 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2006 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2007 #define SCALAR_TYPE_MODE(NODE) \
2008 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2009 #define SCALAR_INT_TYPE_MODE(NODE) \
2010 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2011 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2012 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2013 #define SET_TYPE_MODE(NODE, MODE) \
2014 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2016 extern machine_mode
element_mode (const_tree
);
2017 extern machine_mode
vector_type_mode (const_tree
);
2018 extern unsigned int vector_element_bits (const_tree
);
2019 extern tree
vector_element_bits_tree (const_tree
);
2021 /* The "canonical" type for this type node, which is used by frontends to
2022 compare the type for equality with another type. If two types are
2023 equal (based on the semantics of the language), then they will have
2024 equivalent TYPE_CANONICAL entries.
2026 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2027 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2028 be used for comparison against other types. Instead, the type is
2029 said to require structural equality checks, described in
2030 TYPE_STRUCTURAL_EQUALITY_P.
2032 For unqualified aggregate and function types the middle-end relies on
2033 TYPE_CANONICAL to tell whether two variables can be assigned
2034 to each other without a conversion. The middle-end also makes sure
2035 to assign the same alias-sets to the type partition with equal
2036 TYPE_CANONICAL of their unqualified variants. */
2037 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2038 /* Indicates that the type node requires structural equality
2039 checks. The compiler will need to look at the composition of the
2040 type to determine whether it is equal to another type, rather than
2041 just comparing canonical type pointers. For instance, we would need
2042 to look at the return and parameter types of a FUNCTION_TYPE
2044 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2045 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2046 type node requires structural equality. */
2047 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2049 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2050 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2052 /* The (language-specific) typed-based alias set for this type.
2053 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2054 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2055 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2056 type can alias objects of any type. */
2057 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2059 /* Nonzero iff the typed-based alias set for this type has been
2061 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2062 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2064 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2066 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2068 /* The alignment necessary for objects of this type.
2069 The value is an int, measured in bits and must be a power of two.
2070 We support also an "alignment" of zero. */
2071 #define TYPE_ALIGN(NODE) \
2072 (TYPE_CHECK (NODE)->type_common.align \
2073 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
2075 /* Specify that TYPE_ALIGN(NODE) is X. */
2076 #define SET_TYPE_ALIGN(NODE, X) \
2077 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2079 /* 1 if the alignment for this type was requested by "aligned" attribute,
2080 0 if it is the default for this type. */
2081 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2083 /* The alignment for NODE, in bytes. */
2084 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2086 /* The minimum alignment necessary for objects of this type without
2087 warning. The value is an int, measured in bits. */
2088 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2089 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2090 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2092 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2093 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2094 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2096 /* If your language allows you to declare types, and you want debug info
2097 for them, then you need to generate corresponding TYPE_DECL nodes.
2098 These "stub" TYPE_DECL nodes have no name, and simply point at the
2099 type node. You then set the TYPE_STUB_DECL field of the type node
2100 to point back at the TYPE_DECL node. This allows the debug routines
2101 to know that the two nodes represent the same type, so that we only
2102 get one debug info record for them. */
2103 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2105 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2106 the type has BLKmode only because it lacks the alignment required for
2108 #define TYPE_NO_FORCE_BLK(NODE) \
2109 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2111 /* Nonzero in a type considered volatile as a whole. */
2112 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2114 /* Nonzero in a type considered atomic as a whole. */
2115 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2117 /* Means this type is const-qualified. */
2118 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2120 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2122 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2124 /* If nonzero, type's name shouldn't be emitted into debug info. */
2125 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2127 /* The address space the type is in. */
2128 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2130 /* Encode/decode the named memory support as part of the qualifier. If more
2131 than 8 qualifiers are added, these macros need to be adjusted. */
2132 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2133 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2135 /* Return all qualifiers except for the address space qualifiers. */
2136 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2138 /* Only keep the address space out of the qualifiers and discard the other
2140 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2142 /* The set of type qualifiers for this type. */
2143 #define TYPE_QUALS(NODE) \
2144 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2145 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2146 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2147 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2148 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2150 /* The same as TYPE_QUALS without the address space qualifications. */
2151 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2152 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2153 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2154 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2155 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2157 /* The same as TYPE_QUALS without the address space and atomic
2159 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2160 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2161 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2162 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2164 /* These flags are available for each language front end to use internally. */
2165 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2166 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2167 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2168 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2169 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2170 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2171 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2172 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2174 /* Used to keep track of visited nodes in tree traversals. This is set to
2175 0 by copy_node and make_node. */
2176 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2178 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2179 that distinguish string from array of char).
2180 If set in a INTEGER_TYPE, indicates a character type. */
2181 #define TYPE_STRING_FLAG(NODE) \
2182 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2184 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2185 to the C++ one definition rule. This is used for LTO canonical type
2187 #define TYPE_CXX_ODR_P(NODE) \
2188 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2190 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2191 about missing conversions to other vector types of the same size. */
2192 #define TYPE_VECTOR_OPAQUE(NODE) \
2193 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2195 /* Indicates that objects of this type must be initialized by calling a
2196 function when they are created. */
2197 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2198 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2200 /* Indicates that a UNION_TYPE object should be passed the same way that
2201 the first union alternative would be passed, or that a RECORD_TYPE
2202 object should be passed the same way that the first (and only) member
2204 #define TYPE_TRANSPARENT_AGGR(NODE) \
2205 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2207 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2208 address of a component of the type. This is the counterpart of
2209 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2210 #define TYPE_NONALIASED_COMPONENT(NODE) \
2211 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2213 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2214 whether the array is typeless storage or the type contains a member
2215 with this flag set. Such types are exempt from type-based alias
2216 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2217 the flag should be inherited from the element type, can change
2218 when type is finalized and because of that should not be used in
2219 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2220 the flag should not be changed after the array is created and should
2221 be used in type hashing. */
2222 #define TYPE_TYPELESS_STORAGE(NODE) \
2223 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2224 ARRAY_TYPE)->type_common.typeless_storage)
2226 /* Indicated that objects of this type should be laid out in as
2227 compact a way as possible. */
2228 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2230 /* Used by type_contains_placeholder_p to avoid recomputation.
2231 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2232 this field directly. */
2233 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2234 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2236 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2237 #define TYPE_FINAL_P(NODE) \
2238 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2240 /* The debug output functions use the symtab union field to store
2241 information specific to the debugging format. The different debug
2242 output hooks store different types in the union field. These three
2243 macros are used to access different fields in the union. The debug
2244 hooks are responsible for consistently using only a specific
2247 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2248 hold the type's number in the generated stabs. */
2249 #define TYPE_SYMTAB_ADDRESS(NODE) \
2250 (TYPE_CHECK (NODE)->type_common.symtab.address)
2252 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2253 in dwarf2out.c to point to the DIE generated for the type. */
2254 #define TYPE_SYMTAB_DIE(NODE) \
2255 (TYPE_CHECK (NODE)->type_common.symtab.die)
2257 /* The garbage collector needs to know the interpretation of the
2258 symtab field. These constants represent the different types in the
2261 #define TYPE_SYMTAB_IS_ADDRESS (0)
2262 #define TYPE_SYMTAB_IS_DIE (1)
2264 #define TYPE_LANG_SPECIFIC(NODE) \
2265 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2267 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2268 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2269 #define TYPE_FIELDS(NODE) \
2270 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2271 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2272 #define TYPE_ARG_TYPES(NODE) \
2273 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2274 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2276 #define TYPE_MIN_VALUE(NODE) \
2277 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2278 #define TYPE_NEXT_PTR_TO(NODE) \
2279 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2280 #define TYPE_NEXT_REF_TO(NODE) \
2281 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2282 #define TYPE_VFIELD(NODE) \
2283 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2284 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2286 #define TYPE_MAX_VALUE(NODE) \
2287 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2288 #define TYPE_METHOD_BASETYPE(NODE) \
2289 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2290 #define TYPE_OFFSET_BASETYPE(NODE) \
2291 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2292 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2293 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2295 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2296 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2297 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2298 /* For record and union types, information about this type, as a base type
2300 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2302 /* For types, used in a language-dependent way. */
2303 #define TYPE_LANG_SLOT_1(NODE) \
2304 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2306 /* Define accessor macros for information about type inheritance
2309 A "basetype" means a particular usage of a data type for inheritance
2310 in another type. Each such basetype usage has its own "binfo"
2311 object to describe it. The binfo object is a TREE_VEC node.
2313 Inheritance is represented by the binfo nodes allocated for a
2314 given type. For example, given types C and D, such that D is
2315 inherited by C, 3 binfo nodes will be allocated: one for describing
2316 the binfo properties of C, similarly one for D, and one for
2317 describing the binfo properties of D as a base type for C.
2318 Thus, given a pointer to class C, one can get a pointer to the binfo
2319 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2321 /* BINFO specific flags. */
2323 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2324 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2326 /* Flags for language dependent use. */
2327 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2328 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2329 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2330 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2331 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2332 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2333 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2335 /* The actual data type node being inherited in this basetype. */
2336 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2338 /* The offset where this basetype appears in its containing type.
2339 BINFO_OFFSET slot holds the offset (in bytes)
2340 from the base of the complete object to the base of the part of the
2341 object that is allocated on behalf of this `type'.
2342 This is always 0 except when there is multiple inheritance. */
2344 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2345 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2347 /* The virtual function table belonging to this basetype. Virtual
2348 function tables provide a mechanism for run-time method dispatching.
2349 The entries of a virtual function table are language-dependent. */
2351 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2353 /* The virtual functions in the virtual function table. This is
2354 a TREE_LIST that is used as an initial approximation for building
2355 a virtual function table for this basetype. */
2356 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2358 /* A vector of binfos for the direct basetypes inherited by this
2361 If this basetype describes type D as inherited in C, and if the
2362 basetypes of D are E and F, then this vector contains binfos for
2363 inheritance of E and F by C. */
2364 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2366 /* The number of basetypes for NODE. */
2367 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2369 /* Accessor macro to get to the Nth base binfo of this binfo. */
2370 #define BINFO_BASE_BINFO(NODE,N) \
2371 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2372 #define BINFO_BASE_ITERATE(NODE,N,B) \
2373 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2374 #define BINFO_BASE_APPEND(NODE,T) \
2375 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2377 /* For a BINFO record describing a virtual base class, i.e., one where
2378 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2379 base. The actual contents are language-dependent. In the C++
2380 front-end this field is an INTEGER_CST giving an offset into the
2381 vtable where the offset to the virtual base can be found. */
2382 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2384 /* Indicates the accesses this binfo has to its bases. The values are
2385 access_public_node, access_protected_node or access_private_node.
2386 If this array is not present, public access is implied. */
2387 #define BINFO_BASE_ACCESSES(NODE) \
2388 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2390 #define BINFO_BASE_ACCESS(NODE,N) \
2391 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2392 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2393 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2395 /* The index in the VTT where this subobject's sub-VTT can be found.
2396 NULL_TREE if there is no sub-VTT. */
2397 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2399 /* The index in the VTT where the vptr for this subobject can be
2400 found. NULL_TREE if there is no secondary vptr in the VTT. */
2401 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2403 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2404 inheriting this base for non-virtual bases. For virtual bases it
2405 points either to the binfo for which this is a primary binfo, or to
2406 the binfo of the most derived type. */
2407 #define BINFO_INHERITANCE_CHAIN(NODE) \
2408 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2411 /* Define fields and accessors for nodes representing declared names. */
2413 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2414 have an associated SSA name. */
2415 #define SSA_VAR_P(DECL) \
2416 (TREE_CODE (DECL) == VAR_DECL \
2417 || TREE_CODE (DECL) == PARM_DECL \
2418 || TREE_CODE (DECL) == RESULT_DECL \
2419 || TREE_CODE (DECL) == SSA_NAME)
2422 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2424 /* This is the name of the object as written by the user.
2425 It is an IDENTIFIER_NODE. */
2426 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2428 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2429 #define TYPE_IDENTIFIER(NODE) \
2430 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2431 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2433 /* Every ..._DECL node gets a unique number. */
2434 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2436 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2438 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2440 /* Every ..._DECL node gets a unique number that stays the same even
2441 when the decl is copied by the inliner once it is set. */
2442 #define DECL_PT_UID(NODE) \
2443 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2444 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2445 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2446 #define SET_DECL_PT_UID(NODE, UID) \
2447 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2448 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2449 be preserved when copyin the decl. */
2450 #define DECL_PT_UID_SET_P(NODE) \
2451 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2453 /* These two fields describe where in the source code the declaration
2454 was. If the declaration appears in several places (as for a C
2455 function that is declared first and then defined later), this
2456 information should refer to the definition. */
2457 #define DECL_SOURCE_LOCATION(NODE) \
2458 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2459 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2460 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2461 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2462 /* This decl was created by a front-end or back-end rather than by
2463 user code, and has not been explicitly declared by the user -- when
2464 that happens the source location is updated to the user's
2465 source. This includes decls with no location (!). */
2466 #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2467 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2469 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2470 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2471 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2472 nodes, this points to either the FUNCTION_DECL for the containing
2473 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2474 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2475 scope". In particular, for VAR_DECLs which are virtual table pointers
2476 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2478 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2479 #define DECL_FIELD_CONTEXT(NODE) \
2480 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2482 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2483 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2485 /* For any sort of a ..._DECL node, this points to the original (abstract)
2486 decl node which this decl is an inlined/cloned instance of, or else it
2487 is NULL indicating that this decl is not an instance of some other decl.
2489 The C front-end also uses this in a nested declaration of an inline
2490 function, to point back to the definition. */
2491 #define DECL_ABSTRACT_ORIGIN(NODE) \
2492 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2494 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2495 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2496 #define DECL_ORIGIN(NODE) \
2497 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2499 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2500 inline instance of some original (abstract) decl from an inline function;
2501 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2502 nodes can also have their abstract origin set to themselves. */
2503 #define DECL_FROM_INLINE(NODE) \
2504 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2505 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2507 /* In a DECL this is the field where attributes are stored. */
2508 #define DECL_ATTRIBUTES(NODE) \
2509 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2511 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2512 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2513 For a VAR_DECL, holds the initial value.
2514 For a PARM_DECL, used for DECL_ARG_TYPE--default
2515 values for parameters are encoded in the type of the function,
2516 not in the PARM_DECL slot.
2517 For a FIELD_DECL, this is used for enumeration values and the C
2518 frontend uses it for temporarily storing bitwidth of bitfields.
2520 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2521 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2523 /* Holds the size of the datum, in bits, as a tree expression.
2524 Need not be constant and may be null. */
2525 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2526 /* Likewise for the size in bytes. */
2527 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2528 /* Returns the alignment required for the datum, in bits. It must
2529 be a power of two, but an "alignment" of zero is supported
2530 (e.g. as "uninitialized" sentinel). */
2531 #define DECL_ALIGN(NODE) \
2532 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2533 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2534 /* Specify that DECL_ALIGN(NODE) is X. */
2535 #define SET_DECL_ALIGN(NODE, X) \
2536 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2538 /* The minimum alignment necessary for the datum, in bits, without
2540 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2541 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \
2542 ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0)
2544 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2545 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2546 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X))
2548 /* The alignment of NODE, in bytes. */
2549 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2550 /* Set if the alignment of this DECL has been set by the user, for
2551 example with an 'aligned' attribute. */
2552 #define DECL_USER_ALIGN(NODE) \
2553 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2554 /* Holds the machine mode corresponding to the declaration of a variable or
2555 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2557 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2558 #define SET_DECL_MODE(NODE, MODE) \
2559 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2561 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2562 operation it is. This is only intended for low-level accesses;
2563 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2564 should be used instead. */
2565 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2566 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2568 /* Test if FCODE is a function code for an alloca operation. */
2569 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2570 ((FCODE) == BUILT_IN_ALLOCA \
2571 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2572 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2574 /* Generate case for an alloca operation. */
2575 #define CASE_BUILT_IN_ALLOCA \
2576 case BUILT_IN_ALLOCA: \
2577 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2578 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2580 #define DECL_FUNCTION_PERSONALITY(NODE) \
2581 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2583 /* Nonzero for a given ..._DECL node means that the name of this node should
2584 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2585 the associated type should be ignored. For a FUNCTION_DECL, the body of
2586 the function should also be ignored. */
2587 #define DECL_IGNORED_P(NODE) \
2588 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2590 /* Nonzero for a given ..._DECL node means that this node represents an
2591 "abstract instance" of the given declaration (e.g. in the original
2592 declaration of an inline function). When generating symbolic debugging
2593 information, we mustn't try to generate any address information for nodes
2594 marked as "abstract instances" because we don't actually generate
2595 any code or allocate any data space for such instances. */
2596 #define DECL_ABSTRACT_P(NODE) \
2597 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2599 /* Language-specific decl information. */
2600 #define DECL_LANG_SPECIFIC(NODE) \
2601 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2603 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2604 do not allocate storage, and refer to a definition elsewhere. Note that
2605 this does not necessarily imply the entity represented by NODE
2606 has no program source-level definition in this translation unit. For
2607 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2608 DECL_EXTERNAL may be true simultaneously; that can be the case for
2609 a C99 "extern inline" function. */
2610 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2612 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2613 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2615 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2617 Also set in some languages for variables, etc., outside the normal
2618 lexical scope, such as class instance variables. */
2619 #define DECL_NONLOCAL(NODE) \
2620 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2622 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2623 Used in FIELD_DECLs for vtable pointers.
2624 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2625 #define DECL_VIRTUAL_P(NODE) \
2626 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2628 /* Used to indicate that this DECL represents a compiler-generated entity. */
2629 #define DECL_ARTIFICIAL(NODE) \
2630 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2632 /* Additional flags for language-specific uses. */
2633 #define DECL_LANG_FLAG_0(NODE) \
2634 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2635 #define DECL_LANG_FLAG_1(NODE) \
2636 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2637 #define DECL_LANG_FLAG_2(NODE) \
2638 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2639 #define DECL_LANG_FLAG_3(NODE) \
2640 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2641 #define DECL_LANG_FLAG_4(NODE) \
2642 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2643 #define DECL_LANG_FLAG_5(NODE) \
2644 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2645 #define DECL_LANG_FLAG_6(NODE) \
2646 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2647 #define DECL_LANG_FLAG_7(NODE) \
2648 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2649 #define DECL_LANG_FLAG_8(NODE) \
2650 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2652 /* Nonzero for a scope which is equal to file scope. */
2653 #define SCOPE_FILE_SCOPE_P(EXP) \
2654 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2655 /* Nonzero for a decl which is at file scope. */
2656 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2657 /* Nonzero for a type which is at file scope. */
2658 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2660 /* Nonzero for a decl that is decorated using attribute used.
2661 This indicates to compiler tools that this decl needs to be preserved. */
2662 #define DECL_PRESERVE_P(DECL) \
2663 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2665 /* Nonzero for a decl that is decorated with the "noinit" attribute.
2666 decls with this attribute are placed into the ".noinit" section, so they are
2667 not initialized by the target's startup code. */
2668 #define DECL_NOINIT_P(DECL) \
2670 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2672 /* Nonzero for a decl that is decorated with the "persistent" attribute.
2673 decls with this attribute are placed into the ".persistent" section, so they
2674 are not initialized by the target's startup code. */
2675 #define DECL_PERSISTENT_P(DECL) \
2677 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2679 /* For function local variables of COMPLEX and VECTOR types,
2680 indicates that the variable is not aliased, and that all
2681 modifications to the variable have been adjusted so that
2682 they are killing assignments. Thus the variable may now
2683 be treated as a GIMPLE register, and use real instead of
2684 virtual ops in SSA form. */
2685 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2686 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2688 extern tree
decl_value_expr_lookup (tree
);
2689 extern void decl_value_expr_insert (tree
, tree
);
2691 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2692 if transformations have made this more complicated than evaluating the
2694 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2695 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2696 ->decl_common.decl_flag_2)
2697 #define DECL_VALUE_EXPR(NODE) \
2698 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2699 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2700 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2702 /* Holds the RTL expression for the value of a variable or function.
2703 This value can be evaluated lazily for functions, variables with
2704 static storage duration, and labels. */
2705 #define DECL_RTL(NODE) \
2706 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2707 ? (NODE)->decl_with_rtl.rtl \
2708 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2710 /* Set the DECL_RTL for NODE to RTL. */
2711 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2713 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2714 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2716 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2717 #define DECL_RTL_SET_P(NODE) \
2718 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2720 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2721 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2722 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2723 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2724 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2726 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2727 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2729 #if (GCC_VERSION >= 2007)
2730 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2731 ({ tree const __d = (decl); \
2732 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2733 /* Dereference it so the compiler knows it can't be NULL even \
2734 without assertion checking. */ \
2735 &*DECL_RTL_IF_SET (__d); })
2737 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2740 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2741 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2743 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2744 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2745 of the structure. */
2746 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2748 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2749 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2750 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2751 natural alignment of the field's type). */
2752 #define DECL_FIELD_BIT_OFFSET(NODE) \
2753 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2755 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2756 if so, the type that was originally specified for it.
2757 TREE_TYPE may have been modified (in finish_struct). */
2758 #define DECL_BIT_FIELD_TYPE(NODE) \
2759 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2761 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2762 representative FIELD_DECL. */
2763 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2764 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2766 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2767 if nonzero, indicates that the field occupies the type. */
2768 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2770 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2771 DECL_FIELD_OFFSET which are known to be always zero.
2772 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2774 #define DECL_OFFSET_ALIGN(NODE) \
2775 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2777 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2778 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2779 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2781 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2782 which this FIELD_DECL is defined. This information is needed when
2783 writing debugging information about vfield and vbase decls for C++. */
2784 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2786 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2787 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2789 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
2790 like passing/returning containing struct by value.
2791 Set for C++17 empty base artificial FIELD_DECLs as well as
2792 empty [[no_unique_address]] non-static data members. */
2793 #define DECL_FIELD_ABI_IGNORED(NODE) \
2794 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2796 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2798 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2800 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2801 this component. This makes it possible for Type-Based Alias Analysis
2802 to disambiguate accesses to this field with indirect accesses using
2805 struct S { int i; } s;
2808 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2810 From the implementation's viewpoint, the alias set of the type of the
2811 field 'i' (int) will not be recorded as a subset of that of the type of
2812 's' (struct S) in record_component_aliases. The counterpart is that
2813 accesses to s.i must not be given the alias set of the type of 'i'
2814 (int) but instead directly that of the type of 's' (struct S). */
2815 #define DECL_NONADDRESSABLE_P(NODE) \
2816 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2818 /* Used in a FIELD_DECL to indicate that this field is padding. */
2819 #define DECL_PADDING_P(NODE) \
2820 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2822 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2823 dense, unique within any one function, and may be used to index arrays.
2824 If the value is -1, then no UID has been assigned. */
2825 #define LABEL_DECL_UID(NODE) \
2826 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2828 /* In a LABEL_DECL, the EH region number for which the label is the
2829 post_landing_pad. */
2830 #define EH_LANDING_PAD_NR(NODE) \
2831 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2833 /* For a PARM_DECL, records the data type used to pass the argument,
2834 which may be different from the type seen in the program. */
2835 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2837 /* For PARM_DECL, holds an RTL for the stack slot or register
2838 where the data was actually passed. */
2839 #define DECL_INCOMING_RTL(NODE) \
2840 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2842 /* Nonzero for a given ..._DECL node means that no warnings should be
2843 generated just because this node is unused. */
2844 #define DECL_IN_SYSTEM_HEADER(NODE) \
2845 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2847 /* Used to indicate that the linkage status of this DECL is not yet known,
2848 so it should not be output now. */
2849 #define DECL_DEFER_OUTPUT(NODE) \
2850 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2852 /* In a VAR_DECL that's static,
2853 nonzero if the space is in the text section. */
2854 #define DECL_IN_TEXT_SECTION(NODE) \
2855 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2857 /* In a VAR_DECL that's static,
2858 nonzero if it belongs to the global constant pool. */
2859 #define DECL_IN_CONSTANT_POOL(NODE) \
2860 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2862 /* Nonzero for a given ..._DECL node means that this node should be
2863 put in .common, if possible. If a DECL_INITIAL is given, and it
2864 is not error_mark_node, then the decl cannot be put in .common. */
2865 #define DECL_COMMON(NODE) \
2866 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2868 /* In a VAR_DECL, nonzero if the decl is a register variable with
2869 an explicit asm specification. */
2870 #define DECL_HARD_REGISTER(NODE) \
2871 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2873 /* Used to indicate that this DECL has weak linkage. */
2874 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2876 /* Used to indicate that the DECL is a dllimport. */
2877 #define DECL_DLLIMPORT_P(NODE) \
2878 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2880 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2881 not be put out unless it is needed in this translation unit.
2882 Entities like this are shared across translation units (like weak
2883 entities), but are guaranteed to be generated by any translation
2884 unit that needs them, and therefore need not be put out anywhere
2885 where they are not needed. DECL_COMDAT is just a hint to the
2886 back-end; it is up to front-ends which set this flag to ensure
2887 that there will never be any harm, other than bloat, in putting out
2888 something which is DECL_COMDAT. */
2889 #define DECL_COMDAT(NODE) \
2890 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2892 #define DECL_COMDAT_GROUP(NODE) \
2893 decl_comdat_group (NODE)
2895 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2896 multiple translation units should be merged. */
2897 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2898 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2900 /* The name of the object as the assembler will see it (but before any
2901 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2902 as DECL_NAME. It is an IDENTIFIER_NODE.
2904 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2905 One Definition Rule based type merging at LTO. It is computed only for
2906 LTO compilation and C++. */
2907 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2909 /* Raw accessor for DECL_ASSEMBLE_NAME. */
2910 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
2911 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
2913 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2914 This is true of all DECL nodes except FIELD_DECL. */
2915 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2916 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2918 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2919 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2921 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2922 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
2924 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2925 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2926 overwrite_decl_assembler_name (NODE, NAME)
2928 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
2929 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
2930 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
2931 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
2932 other words, the semantics of using this macro, are different than
2935 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
2937 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
2939 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
2940 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
2942 /* Records the section name in a section attribute. Used to pass
2943 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2944 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2946 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2947 this variable in a BIND_EXPR. */
2948 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2949 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2951 /* Value of the decls's visibility attribute */
2952 #define DECL_VISIBILITY(NODE) \
2953 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2955 /* Nonzero means that the decl (or an enclosing scope) had its
2956 visibility specified rather than being inferred. */
2957 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2958 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2960 /* In a VAR_DECL, the model to use if the data should be allocated from
2961 thread-local storage. */
2962 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2964 /* In a VAR_DECL, nonzero if the data should be allocated from
2965 thread-local storage. */
2966 #define DECL_THREAD_LOCAL_P(NODE) \
2967 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2969 /* In a non-local VAR_DECL with static storage duration, true if the
2970 variable has an initialization priority. If false, the variable
2971 will be initialized at the DEFAULT_INIT_PRIORITY. */
2972 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2973 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2975 extern tree
decl_debug_expr_lookup (tree
);
2976 extern void decl_debug_expr_insert (tree
, tree
);
2978 /* For VAR_DECL, this is set to an expression that it was split from. */
2979 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2980 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2981 #define DECL_DEBUG_EXPR(NODE) \
2982 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2984 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2985 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2987 extern priority_type
decl_init_priority_lookup (tree
);
2988 extern priority_type
decl_fini_priority_lookup (tree
);
2989 extern void decl_init_priority_insert (tree
, priority_type
);
2990 extern void decl_fini_priority_insert (tree
, priority_type
);
2992 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2994 #define DECL_INIT_PRIORITY(NODE) \
2995 (decl_init_priority_lookup (NODE))
2996 /* Set the initialization priority for NODE to VAL. */
2997 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2998 (decl_init_priority_insert (NODE, VAL))
3000 /* For a FUNCTION_DECL the finalization priority of NODE. */
3001 #define DECL_FINI_PRIORITY(NODE) \
3002 (decl_fini_priority_lookup (NODE))
3003 /* Set the finalization priority for NODE to VAL. */
3004 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3005 (decl_fini_priority_insert (NODE, VAL))
3007 /* The initialization priority for entities for which no explicit
3008 initialization priority has been specified. */
3009 #define DEFAULT_INIT_PRIORITY 65535
3011 /* The maximum allowed initialization priority. */
3012 #define MAX_INIT_PRIORITY 65535
3014 /* The largest priority value reserved for use by system runtime
3016 #define MAX_RESERVED_INIT_PRIORITY 100
3018 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3019 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3020 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3022 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3023 #define DECL_NONLOCAL_FRAME(NODE) \
3024 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3026 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3027 #define DECL_NONALIASED(NODE) \
3028 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3030 /* This field is used to reference anything in decl.result and is meant only
3031 for use by the garbage collector. */
3032 #define DECL_RESULT_FLD(NODE) \
3033 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3035 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3036 Before the struct containing the FUNCTION_DECL is laid out,
3037 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3038 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3039 function. When the class is laid out, this pointer is changed
3040 to an INTEGER_CST node which is suitable for use as an index
3041 into the virtual function table. */
3042 #define DECL_VINDEX(NODE) \
3043 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3045 /* In FUNCTION_DECL, holds the decl for the return value. */
3046 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3048 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3049 #define DECL_UNINLINABLE(NODE) \
3050 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3052 /* In a FUNCTION_DECL, the saved representation of the body of the
3054 #define DECL_SAVED_TREE(NODE) \
3055 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3057 /* Nonzero in a FUNCTION_DECL means this function should be treated
3058 as if it were a malloc, meaning it returns a pointer that is
3060 #define DECL_IS_MALLOC(NODE) \
3061 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3063 /* Macro for direct set and get of function_decl.decl_type. */
3064 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3065 (NODE->function_decl.decl_type)
3067 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3071 set_function_decl_type (tree decl
, function_decl_type t
, bool set
)
3075 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl
) == NONE
3076 || FUNCTION_DECL_DECL_TYPE (decl
) == t
);
3077 decl
->function_decl
.decl_type
= t
;
3079 else if (FUNCTION_DECL_DECL_TYPE (decl
) == t
)
3080 FUNCTION_DECL_DECL_TYPE (decl
) = NONE
;
3083 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3084 function (like replaceable operators new or delete). */
3085 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3086 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3088 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3089 C++ operator new, meaning that it returns a pointer for which we
3090 should not use type based aliasing. */
3091 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3092 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_NEW)
3094 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3095 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3097 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3098 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3100 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3101 C++ operator delete. */
3102 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3103 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_DELETE)
3105 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3106 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3108 /* Nonzero in a FUNCTION_DECL means this function may return more
3110 #define DECL_IS_RETURNS_TWICE(NODE) \
3111 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3113 /* Nonzero in a FUNCTION_DECL means this function should be treated
3114 as "pure" function (like const function, but may read global memory). */
3115 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3117 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3118 the const or pure function may not terminate. When this is nonzero
3119 for a const or pure function, it can be dealt with by cse passes
3120 but cannot be removed by dce passes since you are not allowed to
3121 change an infinite looping program into one that terminates without
3123 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3124 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3126 /* Nonzero in a FUNCTION_DECL means this function should be treated
3127 as "novops" function (function that does not read global memory,
3128 but may have arbitrary side effects). */
3129 #define DECL_IS_NOVOPS(NODE) \
3130 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3132 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3133 at the beginning or end of execution. */
3134 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3135 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3137 #define DECL_STATIC_DESTRUCTOR(NODE) \
3138 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3140 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3141 be instrumented with calls to support routines. */
3142 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3143 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3145 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3146 disabled in this function. */
3147 #define DECL_NO_LIMIT_STACK(NODE) \
3148 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3150 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3151 #define DECL_STATIC_CHAIN(NODE) \
3152 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3154 /* Nonzero for a decl that cgraph has decided should be inlined into
3155 at least one call site. It is not meaningful to look at this
3156 directly; always use cgraph_function_possibly_inlined_p. */
3157 #define DECL_POSSIBLY_INLINED(DECL) \
3158 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3160 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3161 such as via the `inline' keyword in C/C++. This flag controls the linkage
3162 semantics of 'inline' */
3163 #define DECL_DECLARED_INLINE_P(NODE) \
3164 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3166 /* Nonzero in a FUNCTION_DECL means this function should not get
3167 -Winline warnings. */
3168 #define DECL_NO_INLINE_WARNING_P(NODE) \
3169 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3171 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3172 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3173 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3175 /* Nonzero if a FUNCTION_CODE is a TM load. */
3176 #define BUILTIN_TM_LOAD_P(FN) \
3177 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3179 /* Nonzero if a FUNCTION_CODE is a TM store. */
3180 #define BUILTIN_TM_STORE_P(FN) \
3181 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3183 #define CASE_BUILT_IN_TM_LOAD(FN) \
3184 case BUILT_IN_TM_LOAD_##FN: \
3185 case BUILT_IN_TM_LOAD_RAR_##FN: \
3186 case BUILT_IN_TM_LOAD_RAW_##FN: \
3187 case BUILT_IN_TM_LOAD_RFW_##FN
3189 #define CASE_BUILT_IN_TM_STORE(FN) \
3190 case BUILT_IN_TM_STORE_##FN: \
3191 case BUILT_IN_TM_STORE_WAR_##FN: \
3192 case BUILT_IN_TM_STORE_WAW_##FN
3194 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3195 disregarding size and cost heuristics. This is equivalent to using
3196 the always_inline attribute without the required diagnostics if the
3197 function cannot be inlined. */
3198 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3199 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3201 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3202 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3204 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3205 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3206 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3208 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3209 that describes the status of this function. */
3210 #define DECL_STRUCT_FUNCTION(NODE) \
3211 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3213 /* For a builtin function, identify which part of the compiler defined it. */
3214 #define DECL_BUILT_IN_CLASS(NODE) \
3215 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3217 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3218 #define DECL_ARGUMENTS(NODE) \
3219 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3221 /* In FUNCTION_DECL, the function specific target options to use when compiling
3223 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3224 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3226 /* In FUNCTION_DECL, the function specific optimization options to use when
3227 compiling this function. */
3228 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3229 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3231 /* In FUNCTION_DECL, this is set if this function has other versions generated
3232 using "target" attributes. The default version is the one which does not
3233 have any "target" attribute set. */
3234 #define DECL_FUNCTION_VERSIONED(NODE)\
3235 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3237 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3238 Devirtualization machinery uses this knowledge for determing type of the
3239 object constructed. Also we assume that constructor address is not
3241 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3242 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3244 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3245 Devirtualization machinery uses this to track types in destruction. */
3246 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3247 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3249 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3250 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3251 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == LAMBDA_FUNCTION)
3253 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3254 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3256 /* In FUNCTION_DECL that represent an virtual method this is set when
3257 the method is final. */
3258 #define DECL_FINAL_P(NODE)\
3259 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3261 /* The source language of the translation-unit. */
3262 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3263 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3265 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3267 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3268 #define DECL_ORIGINAL_TYPE(NODE) \
3269 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3271 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3272 into stabs. Instead it will generate cross reference ('x') of names.
3273 This uses the same flag as DECL_EXTERNAL. */
3274 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3275 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3277 /* Getter of the imported declaration associated to the
3278 IMPORTED_DECL node. */
3279 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3280 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3282 /* Getter of the symbol declaration associated with the
3283 NAMELIST_DECL node. */
3284 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3285 (DECL_INITIAL (NODE))
3287 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3288 To reduce overhead, the nodes containing the statements are not trees.
3289 This avoids the overhead of tree_common on all linked list elements.
3291 Use the interface in tree-iterator.h to access this node. */
3293 #define STATEMENT_LIST_HEAD(NODE) \
3294 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3295 #define STATEMENT_LIST_TAIL(NODE) \
3296 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3298 #define TREE_OPTIMIZATION(NODE) \
3299 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3301 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3302 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3304 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3305 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3307 /* Return a tree node that encapsulates the optimization options in OPTS
3309 extern tree
build_optimization_node (struct gcc_options
*opts
,
3310 struct gcc_options
*opts_set
);
3312 #define TREE_TARGET_OPTION(NODE) \
3313 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3315 #define TREE_TARGET_GLOBALS(NODE) \
3316 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3318 /* Return a tree node that encapsulates the target options in OPTS and
3320 extern tree
build_target_option_node (struct gcc_options
*opts
,
3321 struct gcc_options
*opts_set
);
3323 extern void prepare_target_option_nodes_for_pch (void);
3325 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3328 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3330 if (TREE_CODE (__t
) != __c
)
3331 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3336 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3339 if (TREE_CODE (__t
) == __c
)
3340 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3345 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3346 enum tree_code __c1
, enum tree_code __c2
)
3348 if (TREE_CODE (__t
) != __c1
3349 && TREE_CODE (__t
) != __c2
)
3350 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3355 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3356 enum tree_code __c1
, enum tree_code __c2
)
3358 if (TREE_CODE (__t
) == __c1
3359 || TREE_CODE (__t
) == __c2
)
3360 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3365 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3366 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3368 if (TREE_CODE (__t
) != __c1
3369 && TREE_CODE (__t
) != __c2
3370 && TREE_CODE (__t
) != __c3
)
3371 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3376 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3377 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3379 if (TREE_CODE (__t
) == __c1
3380 || TREE_CODE (__t
) == __c2
3381 || TREE_CODE (__t
) == __c3
)
3382 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3387 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3388 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3389 enum tree_code __c4
)
3391 if (TREE_CODE (__t
) != __c1
3392 && TREE_CODE (__t
) != __c2
3393 && TREE_CODE (__t
) != __c3
3394 && TREE_CODE (__t
) != __c4
)
3395 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3400 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3401 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3402 enum tree_code __c4
)
3404 if (TREE_CODE (__t
) == __c1
3405 || TREE_CODE (__t
) == __c2
3406 || TREE_CODE (__t
) == __c3
3407 || TREE_CODE (__t
) == __c4
)
3408 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3413 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3414 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3415 enum tree_code __c4
, enum tree_code __c5
)
3417 if (TREE_CODE (__t
) != __c1
3418 && TREE_CODE (__t
) != __c2
3419 && TREE_CODE (__t
) != __c3
3420 && TREE_CODE (__t
) != __c4
3421 && TREE_CODE (__t
) != __c5
)
3422 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3427 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3428 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3429 enum tree_code __c4
, enum tree_code __c5
)
3431 if (TREE_CODE (__t
) == __c1
3432 || TREE_CODE (__t
) == __c2
3433 || TREE_CODE (__t
) == __c3
3434 || TREE_CODE (__t
) == __c4
3435 || TREE_CODE (__t
) == __c5
)
3436 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3441 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3442 const char *__f
, int __l
, const char *__g
)
3444 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3445 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3450 tree_class_check (tree __t
, const enum tree_code_class __class
,
3451 const char *__f
, int __l
, const char *__g
)
3453 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3454 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3459 tree_range_check (tree __t
,
3460 enum tree_code __code1
, enum tree_code __code2
,
3461 const char *__f
, int __l
, const char *__g
)
3463 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3464 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3469 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3470 const char *__f
, int __l
, const char *__g
)
3472 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3473 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3474 if (__t
->omp_clause
.code
!= __code
)
3475 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3480 omp_clause_range_check (tree __t
,
3481 enum omp_clause_code __code1
,
3482 enum omp_clause_code __code2
,
3483 const char *__f
, int __l
, const char *__g
)
3485 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3486 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3487 if ((int) __t
->omp_clause
.code
< (int) __code1
3488 || (int) __t
->omp_clause
.code
> (int) __code2
)
3489 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3493 /* These checks have to be special cased. */
3496 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3498 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3499 if (!IS_EXPR_CODE_CLASS (__c
))
3500 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3504 /* These checks have to be special cased. */
3507 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3510 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3514 inline const HOST_WIDE_INT
*
3515 tree_int_cst_elt_check (const_tree __t
, int __i
,
3516 const char *__f
, int __l
, const char *__g
)
3518 if (TREE_CODE (__t
) != INTEGER_CST
)
3519 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3520 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3521 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3523 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3526 inline HOST_WIDE_INT
*
3527 tree_int_cst_elt_check (tree __t
, int __i
,
3528 const char *__f
, int __l
, const char *__g
)
3530 if (TREE_CODE (__t
) != INTEGER_CST
)
3531 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3532 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3533 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3535 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3538 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3540 # if GCC_VERSION >= 4006
3541 #pragma GCC diagnostic push
3542 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3546 tree_vec_elt_check (tree __t
, int __i
,
3547 const char *__f
, int __l
, const char *__g
)
3549 if (TREE_CODE (__t
) != TREE_VEC
)
3550 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3551 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3552 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3553 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3556 # if GCC_VERSION >= 4006
3557 #pragma GCC diagnostic pop
3561 omp_clause_elt_check (tree __t
, int __i
,
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 (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3567 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3568 return &__t
->omp_clause
.ops
[__i
];
3571 /* These checks have to be special cased. */
3574 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3576 if (!ANY_INTEGRAL_TYPE_P (__t
))
3577 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3583 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3586 if (TREE_CODE (__t
) != __c
)
3587 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3592 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3595 if (TREE_CODE (__t
) == __c
)
3596 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3601 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3602 enum tree_code __c1
, enum tree_code __c2
)
3604 if (TREE_CODE (__t
) != __c1
3605 && TREE_CODE (__t
) != __c2
)
3606 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3611 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3612 enum tree_code __c1
, enum tree_code __c2
)
3614 if (TREE_CODE (__t
) == __c1
3615 || TREE_CODE (__t
) == __c2
)
3616 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3621 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3622 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3624 if (TREE_CODE (__t
) != __c1
3625 && TREE_CODE (__t
) != __c2
3626 && TREE_CODE (__t
) != __c3
)
3627 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3632 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3633 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3635 if (TREE_CODE (__t
) == __c1
3636 || TREE_CODE (__t
) == __c2
3637 || TREE_CODE (__t
) == __c3
)
3638 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3643 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3644 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3645 enum tree_code __c4
)
3647 if (TREE_CODE (__t
) != __c1
3648 && TREE_CODE (__t
) != __c2
3649 && TREE_CODE (__t
) != __c3
3650 && TREE_CODE (__t
) != __c4
)
3651 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3656 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3657 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3658 enum tree_code __c4
)
3660 if (TREE_CODE (__t
) == __c1
3661 || TREE_CODE (__t
) == __c2
3662 || TREE_CODE (__t
) == __c3
3663 || TREE_CODE (__t
) == __c4
)
3664 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3669 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3670 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3671 enum tree_code __c4
, enum tree_code __c5
)
3673 if (TREE_CODE (__t
) != __c1
3674 && TREE_CODE (__t
) != __c2
3675 && TREE_CODE (__t
) != __c3
3676 && TREE_CODE (__t
) != __c4
3677 && TREE_CODE (__t
) != __c5
)
3678 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3683 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3684 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3685 enum tree_code __c4
, enum tree_code __c5
)
3687 if (TREE_CODE (__t
) == __c1
3688 || TREE_CODE (__t
) == __c2
3689 || TREE_CODE (__t
) == __c3
3690 || TREE_CODE (__t
) == __c4
3691 || TREE_CODE (__t
) == __c5
)
3692 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3697 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3698 const char *__f
, int __l
, const char *__g
)
3700 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3701 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3706 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3707 const char *__f
, int __l
, const char *__g
)
3709 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3710 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3715 tree_range_check (const_tree __t
,
3716 enum tree_code __code1
, enum tree_code __code2
,
3717 const char *__f
, int __l
, const char *__g
)
3719 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3720 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3725 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3726 const char *__f
, int __l
, const char *__g
)
3728 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3729 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3730 if (__t
->omp_clause
.code
!= __code
)
3731 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3736 omp_clause_range_check (const_tree __t
,
3737 enum omp_clause_code __code1
,
3738 enum omp_clause_code __code2
,
3739 const char *__f
, int __l
, const char *__g
)
3741 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3742 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3743 if ((int) __t
->omp_clause
.code
< (int) __code1
3744 || (int) __t
->omp_clause
.code
> (int) __code2
)
3745 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3750 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3752 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3753 if (!IS_EXPR_CODE_CLASS (__c
))
3754 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3759 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3762 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3766 # if GCC_VERSION >= 4006
3767 #pragma GCC diagnostic push
3768 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3772 tree_vec_elt_check (const_tree __t
, int __i
,
3773 const char *__f
, int __l
, const char *__g
)
3775 if (TREE_CODE (__t
) != TREE_VEC
)
3776 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3777 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3778 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3779 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3780 //return &__t->vec.a[__i];
3783 # if GCC_VERSION >= 4006
3784 #pragma GCC diagnostic pop
3788 omp_clause_elt_check (const_tree __t
, int __i
,
3789 const char *__f
, int __l
, const char *__g
)
3791 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3792 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3793 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3794 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3795 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3799 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3802 if (!ANY_INTEGRAL_TYPE_P (__t
))
3803 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3810 /* Compute the number of operands in an expression node NODE. For
3811 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3812 otherwise it is looked up from the node's code. */
3814 tree_operand_length (const_tree node
)
3816 if (VL_EXP_CLASS_P (node
))
3817 return VL_EXP_OPERAND_LENGTH (node
);
3819 return TREE_CODE_LENGTH (TREE_CODE (node
));
3822 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3824 /* Special checks for TREE_OPERANDs. */
3826 tree_operand_check (tree __t
, int __i
,
3827 const char *__f
, int __l
, const char *__g
)
3829 const_tree __u
= EXPR_CHECK (__t
);
3830 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3831 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3832 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3836 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3837 const char *__f
, int __l
, const char *__g
)
3839 if (TREE_CODE (__t
) != __code
)
3840 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3841 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3842 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3843 return &__t
->exp
.operands
[__i
];
3847 tree_operand_check (const_tree __t
, int __i
,
3848 const char *__f
, int __l
, const char *__g
)
3850 const_tree __u
= EXPR_CHECK (__t
);
3851 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3852 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3853 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3857 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3858 const char *__f
, int __l
, const char *__g
)
3860 if (TREE_CODE (__t
) != __code
)
3861 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3862 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3863 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3864 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3869 /* True iff an identifier matches a C string. */
3872 id_equal (const_tree id
, const char *str
)
3874 return !strcmp (IDENTIFIER_POINTER (id
), str
);
3878 id_equal (const char *str
, const_tree id
)
3880 return id_equal (id
, str
);
3883 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
3886 TYPE_VECTOR_SUBPARTS (const_tree node
)
3888 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3889 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
3890 if (NUM_POLY_INT_COEFFS
== 2)
3892 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
3893 description of the encoding. */
3894 poly_uint64 res
= 0;
3895 res
.coeffs
[0] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3896 if (precision
& 0x100)
3897 res
.coeffs
[1] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3901 return HOST_WIDE_INT_1U
<< precision
;
3904 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
3905 satisfy valid_vector_subparts_p. */
3908 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
3910 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3911 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3912 int index
= exact_log2 (coeff0
);
3913 gcc_assert (index
>= 0);
3914 if (NUM_POLY_INT_COEFFS
== 2)
3916 /* We have two coefficients that are each in the range 1 << [0, 63],
3917 so supporting all combinations would require 6 bits per coefficient
3918 and 12 bits in total. Since the precision field is only 10 bits
3919 in size, we need to be more restrictive than that.
3921 At present, coeff[1] is always either 0 (meaning that the number
3922 of units is constant) or equal to coeff[0] (meaning that the number
3923 of units is N + X * N for some target-dependent zero-based runtime
3924 parameter X). We can therefore encode coeff[1] in a single bit.
3926 The most compact encoding would be to use mask 0x3f for coeff[0]
3927 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
3928 get slightly more efficient code on some hosts if we instead
3929 treat the shift amount as an independent byte, so here we use
3930 0xff for coeff[0] and 0x100 for coeff[1]. */
3931 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3932 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
3933 VECTOR_TYPE_CHECK (node
)->type_common
.precision
3934 = index
+ (coeff1
!= 0 ? 0x100 : 0);
3937 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
3940 /* Return true if we can construct vector types with the given number
3944 valid_vector_subparts_p (poly_uint64 subparts
)
3946 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3947 if (!pow2p_hwi (coeff0
))
3949 if (NUM_POLY_INT_COEFFS
== 2)
3951 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3952 if (coeff1
!= 0 && coeff1
!= coeff0
)
3958 /* Return the built-in function that DECL represents, given that it is known
3959 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
3960 inline built_in_function
3961 DECL_FUNCTION_CODE (const_tree decl
)
3963 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3964 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_NORMAL
);
3965 return (built_in_function
) fndecl
.function_code
;
3968 /* Return the target-specific built-in function that DECL represents,
3969 given that it is known to be a FUNCTION_DECL with built-in class
3972 DECL_MD_FUNCTION_CODE (const_tree decl
)
3974 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3975 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_MD
);
3976 return fndecl
.function_code
;
3979 /* Return the frontend-specific built-in function that DECL represents,
3980 given that it is known to be a FUNCTION_DECL with built-in class
3981 BUILT_IN_FRONTEND. */
3983 DECL_FE_FUNCTION_CODE (const_tree decl
)
3985 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3986 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_FRONTEND
);
3987 return fndecl
.function_code
;
3990 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
3993 set_decl_built_in_function (tree decl
, built_in_class fclass
,
3996 tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3997 fndecl
.built_in_class
= fclass
;
3998 fndecl
.function_code
= fcode
;
4001 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4002 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4004 copy_decl_built_in_function (tree newdecl
, const_tree olddecl
)
4006 tree_function_decl
&newfndecl
= FUNCTION_DECL_CHECK (newdecl
)->function_decl
;
4007 const tree_function_decl
&oldfndecl
4008 = FUNCTION_DECL_CHECK (olddecl
)->function_decl
;
4009 newfndecl
.built_in_class
= oldfndecl
.built_in_class
;
4010 newfndecl
.function_code
= oldfndecl
.function_code
;
4013 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4014 wrapper added to express a location_t on behalf of the node's child
4015 (e.g. by maybe_wrap_with_location). */
4017 #define EXPR_LOCATION_WRAPPER_P(NODE) \
4018 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4020 /* Test if EXP is merely a wrapper node, added to express a location_t
4021 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4024 location_wrapper_p (const_tree exp
)
4026 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4027 the flag EXPR_LOCATION_WRAPPER_P is set.
4028 It normally has the same type as its operand, but it can have a
4029 different one if the type of the operand has changed (e.g. when
4030 merging duplicate decls).
4032 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4033 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4034 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
4035 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4036 && EXPR_LOCATION_WRAPPER_P (exp
))
4041 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4044 tree_strip_any_location_wrapper (tree exp
)
4046 if (location_wrapper_p (exp
))
4047 return TREE_OPERAND (exp
, 0);
4052 #define error_mark_node global_trees[TI_ERROR_MARK]
4054 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4055 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4056 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4057 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4058 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4060 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4061 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4062 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4063 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4064 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4066 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4067 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4068 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4069 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4070 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4072 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4073 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4074 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4075 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4077 #define void_node global_trees[TI_VOID]
4079 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4080 #define integer_one_node global_trees[TI_INTEGER_ONE]
4081 #define integer_three_node global_trees[TI_INTEGER_THREE]
4082 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4083 #define size_zero_node global_trees[TI_SIZE_ZERO]
4084 #define size_one_node global_trees[TI_SIZE_ONE]
4085 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4086 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4087 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4089 /* Base access nodes. */
4090 #define access_public_node global_trees[TI_PUBLIC]
4091 #define access_protected_node global_trees[TI_PROTECTED]
4092 #define access_private_node global_trees[TI_PRIVATE]
4094 #define null_pointer_node global_trees[TI_NULL_POINTER]
4096 #define float_type_node global_trees[TI_FLOAT_TYPE]
4097 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4098 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4100 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4101 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4102 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4103 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4105 /* Names for individual types (code should normally iterate over all
4106 such types; these are only for back-end use, or in contexts such as
4107 *.def where iteration is not possible). */
4108 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4109 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4110 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4111 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4112 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4113 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4114 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4116 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4117 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4118 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4119 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4121 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4122 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4123 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4124 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4126 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4128 #define void_type_node global_trees[TI_VOID_TYPE]
4129 /* The C type `void *'. */
4130 #define ptr_type_node global_trees[TI_PTR_TYPE]
4131 /* The C type `const void *'. */
4132 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4133 /* The C type `size_t'. */
4134 #define size_type_node global_trees[TI_SIZE_TYPE]
4135 #define pid_type_node global_trees[TI_PID_TYPE]
4136 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4137 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4138 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4139 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4140 /* The C type `FILE *'. */
4141 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4142 /* The C type `const struct tm *'. */
4143 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4144 /* The C type `fenv_t *'. */
4145 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4146 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4147 /* The C type `fexcept_t *'. */
4148 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4149 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4150 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4152 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4153 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4154 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4156 /* The decimal floating point types. */
4157 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4158 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4159 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4161 /* The fixed-point types. */
4162 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4163 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4164 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4165 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4166 #define sat_unsigned_short_fract_type_node \
4167 global_trees[TI_SAT_USFRACT_TYPE]
4168 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4169 #define sat_unsigned_long_fract_type_node \
4170 global_trees[TI_SAT_ULFRACT_TYPE]
4171 #define sat_unsigned_long_long_fract_type_node \
4172 global_trees[TI_SAT_ULLFRACT_TYPE]
4173 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4174 #define fract_type_node global_trees[TI_FRACT_TYPE]
4175 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4176 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4177 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4178 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4179 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4180 #define unsigned_long_long_fract_type_node \
4181 global_trees[TI_ULLFRACT_TYPE]
4182 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4183 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4184 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4185 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4186 #define sat_unsigned_short_accum_type_node \
4187 global_trees[TI_SAT_USACCUM_TYPE]
4188 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4189 #define sat_unsigned_long_accum_type_node \
4190 global_trees[TI_SAT_ULACCUM_TYPE]
4191 #define sat_unsigned_long_long_accum_type_node \
4192 global_trees[TI_SAT_ULLACCUM_TYPE]
4193 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4194 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4195 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4196 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4197 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4198 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4199 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4200 #define unsigned_long_long_accum_type_node \
4201 global_trees[TI_ULLACCUM_TYPE]
4202 #define qq_type_node global_trees[TI_QQ_TYPE]
4203 #define hq_type_node global_trees[TI_HQ_TYPE]
4204 #define sq_type_node global_trees[TI_SQ_TYPE]
4205 #define dq_type_node global_trees[TI_DQ_TYPE]
4206 #define tq_type_node global_trees[TI_TQ_TYPE]
4207 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4208 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4209 #define usq_type_node global_trees[TI_USQ_TYPE]
4210 #define udq_type_node global_trees[TI_UDQ_TYPE]
4211 #define utq_type_node global_trees[TI_UTQ_TYPE]
4212 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4213 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4214 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4215 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4216 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4217 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4218 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4219 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4220 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4221 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4222 #define ha_type_node global_trees[TI_HA_TYPE]
4223 #define sa_type_node global_trees[TI_SA_TYPE]
4224 #define da_type_node global_trees[TI_DA_TYPE]
4225 #define ta_type_node global_trees[TI_TA_TYPE]
4226 #define uha_type_node global_trees[TI_UHA_TYPE]
4227 #define usa_type_node global_trees[TI_USA_TYPE]
4228 #define uda_type_node global_trees[TI_UDA_TYPE]
4229 #define uta_type_node global_trees[TI_UTA_TYPE]
4230 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4231 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4232 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4233 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4234 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4235 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4236 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4237 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4239 /* The node that should be placed at the end of a parameter list to
4240 indicate that the function does not take a variable number of
4241 arguments. The TREE_VALUE will be void_type_node and there will be
4242 no TREE_CHAIN. Language-independent code should not assume
4243 anything else about this node. */
4244 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4246 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4247 #define MAIN_NAME_P(NODE) \
4248 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4250 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4252 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4253 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4255 /* Default/current target options (TARGET_OPTION_NODE). */
4256 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4257 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4259 /* Default tree list option(), optimize() pragmas to be linked into the
4261 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4262 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4264 /* SCEV analyzer global shared trees. */
4265 #define chrec_not_analyzed_yet NULL_TREE
4266 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4267 #define chrec_known global_trees[TI_CHREC_KNOWN]
4269 #define char_type_node integer_types[itk_char]
4270 #define signed_char_type_node integer_types[itk_signed_char]
4271 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4272 #define short_integer_type_node integer_types[itk_short]
4273 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4274 #define integer_type_node integer_types[itk_int]
4275 #define unsigned_type_node integer_types[itk_unsigned_int]
4276 #define long_integer_type_node integer_types[itk_long]
4277 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4278 #define long_long_integer_type_node integer_types[itk_long_long]
4279 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4281 /* True if NODE is an erroneous expression. */
4283 #define error_operand_p(NODE) \
4284 ((NODE) == error_mark_node \
4285 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4287 /* Return the number of elements encoded directly in a VECTOR_CST. */
4290 vector_cst_encoded_nelts (const_tree t
)
4292 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4295 extern tree
decl_assembler_name (tree
);
4296 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4297 extern tree
decl_comdat_group (const_tree
);
4298 extern tree
decl_comdat_group_id (const_tree
);
4299 extern const char *decl_section_name (const_tree
);
4300 extern void set_decl_section_name (tree
, const char *);
4301 extern void set_decl_section_name (tree
, const_tree
);
4302 extern enum tls_model
decl_tls_model (const_tree
);
4303 extern void set_decl_tls_model (tree
, enum tls_model
);
4305 /* Compute the number of bytes occupied by 'node'. This routine only
4306 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4308 extern size_t tree_size (const_tree
);
4310 /* Compute the number of bytes occupied by a tree with code CODE.
4311 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4312 which are of variable length. */
4313 extern size_t tree_code_size (enum tree_code
);
4315 /* Allocate and return a new UID from the DECL_UID namespace. */
4316 extern int allocate_decl_uid (void);
4318 /* Lowest level primitive for allocating a node.
4319 The TREE_CODE is the only argument. Contents are initialized
4320 to zero except for a few of the common fields. */
4322 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4324 /* Free tree node. */
4326 extern void free_node (tree
);
4328 /* Make a copy of a node, with all the same contents. */
4330 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4332 /* Make a copy of a chain of TREE_LIST nodes. */
4334 extern tree
copy_list (tree
);
4336 /* Make a CASE_LABEL_EXPR. */
4338 extern tree
build_case_label (tree
, tree
, tree
);
4341 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4343 /* Make an INTEGER_CST. */
4345 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4347 /* Make a TREE_VEC. */
4349 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4351 /* Grow a TREE_VEC. */
4353 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4355 /* Construct various types of nodes. */
4357 extern tree
build_nt (enum tree_code
, ...);
4358 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4360 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4361 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4362 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4363 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4364 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4365 tree CXX_MEM_STAT_INFO
);
4366 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4367 tree CXX_MEM_STAT_INFO
);
4369 /* _loc versions of build[1-5]. */
4372 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4373 tree arg1 CXX_MEM_STAT_INFO
)
4375 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4376 if (CAN_HAVE_LOCATION_P (t
))
4377 SET_EXPR_LOCATION (t
, loc
);
4382 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4383 tree arg1 CXX_MEM_STAT_INFO
)
4385 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4386 if (CAN_HAVE_LOCATION_P (t
))
4387 SET_EXPR_LOCATION (t
, loc
);
4392 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4393 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4395 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4396 if (CAN_HAVE_LOCATION_P (t
))
4397 SET_EXPR_LOCATION (t
, loc
);
4402 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4403 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4405 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4406 if (CAN_HAVE_LOCATION_P (t
))
4407 SET_EXPR_LOCATION (t
, loc
);
4412 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4413 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4415 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4416 arg4 PASS_MEM_STAT
);
4417 if (CAN_HAVE_LOCATION_P (t
))
4418 SET_EXPR_LOCATION (t
, loc
);
4422 /* Constructs double_int from tree CST. */
4424 extern tree
double_int_to_tree (tree
, double_int
);
4426 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4427 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4429 /* Create an INT_CST node with a CST value zero extended. */
4432 extern tree
build_int_cst (tree
, poly_int64
);
4433 extern tree
build_int_cstu (tree type
, poly_uint64
);
4434 extern tree
build_int_cst_type (tree
, poly_int64
);
4435 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4436 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
4437 extern tree
build_vector_from_val (tree
, tree
);
4438 extern tree
build_uniform_cst (tree
, tree
);
4439 extern tree
build_vec_series (tree
, tree
, tree
);
4440 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4441 extern tree
build_vector_a_then_b (tree
, unsigned int, tree
, tree
);
4442 extern void recompute_constructor_flags (tree
);
4443 extern void verify_constructor_flags (tree
);
4444 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> * CXX_MEM_STAT_INFO
);
4445 extern tree
build_constructor_single (tree
, tree
, tree
);
4446 extern tree
build_constructor_from_list (tree
, tree
);
4447 extern tree
build_constructor_from_vec (tree
, const vec
<tree
, va_gc
> *);
4448 extern tree
build_constructor_va (tree
, int, ...);
4449 extern tree
build_clobber (tree
);
4450 extern tree
build_real_from_int_cst (tree
, const_tree
);
4451 extern tree
build_real_from_wide (tree
, const wide_int_ref
&, signop
);
4452 extern tree
build_complex (tree
, tree
, tree
);
4453 extern tree
build_complex_inf (tree
, bool);
4454 extern tree
build_each_one_cst (tree
);
4455 extern tree
build_one_cst (tree
);
4456 extern tree
build_minus_one_cst (tree
);
4457 extern tree
build_all_ones_cst (tree
);
4458 extern tree
build_zero_cst (tree
);
4459 extern tree
build_string (unsigned, const char * = NULL
);
4460 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4461 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4462 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4463 extern tree
build_decl (location_t
, enum tree_code
,
4464 tree
, tree CXX_MEM_STAT_INFO
);
4465 extern tree
build_fn_decl (const char *, tree
);
4466 extern tree
build_translation_unit_decl (tree
);
4467 extern tree
build_block (tree
, tree
, tree
, tree
);
4468 extern tree
build_empty_stmt (location_t
);
4469 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4471 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4473 extern tree
build_call_nary (tree
, tree
, int, ...);
4474 extern tree
build_call_valist (tree
, tree
, int, va_list);
4475 #define build_call_array(T1,T2,N,T3)\
4476 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4477 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4478 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
4479 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4480 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4481 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4482 extern tree
build_call_expr (tree
, int, ...);
4483 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4485 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4486 tree
, int, const tree
*);
4487 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4489 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4490 extern tree
build_string_literal (unsigned, const char * = NULL
,
4491 tree
= char_type_node
,
4492 unsigned HOST_WIDE_INT
= HOST_WIDE_INT_M1U
);
4494 /* Construct various nodes representing data types. */
4496 extern tree
signed_or_unsigned_type_for (int, tree
);
4497 extern tree
signed_type_for (tree
);
4498 extern tree
unsigned_type_for (tree
);
4499 extern tree
truth_type_for (tree
);
4500 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4501 extern tree
build_pointer_type (tree
);
4502 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4503 extern tree
build_reference_type (tree
);
4504 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4505 extern tree
build_vector_type (tree
, poly_int64
);
4506 extern tree
build_truth_vector_type_for_mode (poly_uint64
, machine_mode
);
4507 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4508 extern tree
build_index_type (tree
);
4509 extern tree
build_array_type (tree
, tree
, bool = false);
4510 extern tree
build_nonshared_array_type (tree
, tree
);
4511 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4512 extern tree
build_function_type (tree
, tree
);
4513 extern tree
build_function_type_list (tree
, ...);
4514 extern tree
build_varargs_function_type_list (tree
, ...);
4515 extern tree
build_function_type_array (tree
, int, tree
*);
4516 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4517 #define build_function_type_vec(RET, V) \
4518 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4519 #define build_varargs_function_type_vec(RET, V) \
4520 build_varargs_function_type_array (RET, vec_safe_length (V), \
4521 vec_safe_address (V))
4522 extern tree
build_method_type_directly (tree
, tree
, tree
);
4523 extern tree
build_method_type (tree
, tree
);
4524 extern tree
build_offset_type (tree
, tree
);
4525 extern tree
build_complex_type (tree
, bool named
= false);
4526 extern tree
array_type_nelts (const_tree
);
4528 extern tree
value_member (tree
, tree
);
4529 extern tree
purpose_member (const_tree
, tree
);
4530 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4531 extern tree
chain_index (int, tree
);
4533 /* Arguments may be null. */
4534 extern int tree_int_cst_equal (const_tree
, const_tree
);
4536 /* The following predicates are safe to call with a null argument. */
4537 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4538 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4539 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4540 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4542 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4543 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4544 extern poly_int64
tree_to_poly_int64 (const_tree
)
4545 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4546 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4547 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4548 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4549 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4550 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4551 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4552 tree_to_shwi (const_tree t
)
4554 gcc_assert (tree_fits_shwi_p (t
));
4555 return TREE_INT_CST_LOW (t
);
4558 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4559 tree_to_uhwi (const_tree t
)
4561 gcc_assert (tree_fits_uhwi_p (t
));
4562 return TREE_INT_CST_LOW (t
);
4564 #if NUM_POLY_INT_COEFFS == 1
4565 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4566 tree_to_poly_int64 (const_tree t
)
4568 gcc_assert (tree_fits_poly_int64_p (t
));
4569 return TREE_INT_CST_LOW (t
);
4572 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4573 tree_to_poly_uint64 (const_tree t
)
4575 gcc_assert (tree_fits_poly_uint64_p (t
));
4576 return TREE_INT_CST_LOW (t
);
4580 extern int tree_int_cst_sgn (const_tree
);
4581 extern int tree_int_cst_sign_bit (const_tree
);
4582 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4583 extern tree
strip_array_types (tree
);
4584 extern tree
excess_precision_type (tree
);
4586 /* Desription of the reason why the argument of valid_constant_size_p
4587 is not a valid size. */
4588 enum cst_size_error
{
4590 cst_size_not_constant
,
4596 extern bool valid_constant_size_p (const_tree
, cst_size_error
* = NULL
);
4597 extern tree
max_object_size ();
4599 /* Return true if T holds a value that can be represented as a poly_int64
4600 without loss of precision. Store the value in *VALUE if so. */
4603 poly_int_tree_p (const_tree t
, poly_int64_pod
*value
)
4605 if (tree_fits_poly_int64_p (t
))
4607 *value
= tree_to_poly_int64 (t
);
4613 /* Return true if T holds a value that can be represented as a poly_uint64
4614 without loss of precision. Store the value in *VALUE if so. */
4617 poly_int_tree_p (const_tree t
, poly_uint64_pod
*value
)
4619 if (tree_fits_poly_uint64_p (t
))
4621 *value
= tree_to_poly_uint64 (t
);
4627 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4628 put the prototype here. Rtl.h does declare the prototype if
4629 tree.h had been included. */
4631 extern tree
make_tree (tree
, rtx
);
4633 /* Returns true iff CAND and BASE have equivalent language-specific
4636 extern bool check_lang_type (const_tree cand
, const_tree base
);
4638 /* Returns true iff unqualified CAND and BASE are equivalent. */
4640 extern bool check_base_type (const_tree cand
, const_tree base
);
4642 /* Check whether CAND is suitable to be returned from get_qualified_type
4643 (BASE, TYPE_QUALS). */
4645 extern bool check_qualified_type (const_tree
, const_tree
, int);
4647 /* Return a version of the TYPE, qualified as indicated by the
4648 TYPE_QUALS, if one exists. If no qualified version exists yet,
4649 return NULL_TREE. */
4651 extern tree
get_qualified_type (tree
, int);
4653 /* Like get_qualified_type, but creates the type if it does not
4654 exist. This function never returns NULL_TREE. */
4656 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
4658 /* Create a variant of type T with alignment ALIGN. */
4660 extern tree
build_aligned_type (tree
, unsigned int);
4662 /* Like build_qualified_type, but only deals with the `const' and
4663 `volatile' qualifiers. This interface is retained for backwards
4664 compatibility with the various front-ends; new code should use
4665 build_qualified_type instead. */
4667 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4668 build_qualified_type ((TYPE), \
4669 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4670 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4672 /* Make a copy of a type node. */
4674 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
4675 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
4677 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4678 return a canonicalized ..._TYPE node, so that duplicates are not made.
4679 How the hash code is computed is up to the caller, as long as any two
4680 callers that could hash identical-looking type nodes agree. */
4682 extern hashval_t
type_hash_canon_hash (tree
);
4683 extern tree
type_hash_canon (unsigned int, tree
);
4685 extern tree
convert (tree
, tree
);
4686 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4688 size_in_bytes (const_tree t
)
4690 return size_in_bytes_loc (input_location
, t
);
4693 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4694 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4695 extern tree
bit_position (const_tree
);
4696 extern tree
byte_position (const_tree
);
4697 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4699 /* Type for sizes of data-type. */
4701 #define sizetype sizetype_tab[(int) stk_sizetype]
4702 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4703 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4704 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4705 #define size_int(L) size_int_kind (L, stk_sizetype)
4706 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4707 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4708 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4710 /* Log2 of BITS_PER_UNIT. */
4712 #if BITS_PER_UNIT == 8
4713 #define LOG2_BITS_PER_UNIT 3
4714 #elif BITS_PER_UNIT == 16
4715 #define LOG2_BITS_PER_UNIT 4
4717 #error Unknown BITS_PER_UNIT
4720 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4721 by making the last node in X point to Y.
4722 Returns X, except if X is 0 returns Y. */
4724 extern tree
chainon (tree
, tree
);
4726 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4728 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
4730 /* Return the last tree node in a chain. */
4732 extern tree
tree_last (tree
);
4734 /* Reverse the order of elements in a chain, and return the new head. */
4736 extern tree
nreverse (tree
);
4738 /* Returns the length of a chain of nodes
4739 (number of chain pointers to follow before reaching a null pointer). */
4741 extern int list_length (const_tree
);
4743 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
4745 extern tree
first_field (const_tree
) ATTRIBUTE_NONNULL (1);
4746 extern tree
last_field (const_tree
) ATTRIBUTE_NONNULL (1);
4748 /* Given an initializer INIT, return TRUE if INIT is zero or some
4749 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4750 null, set *NONZERO if and only if INIT is known not to be all
4751 zeros. The combination of return value of false and *NONZERO
4752 false implies that INIT may but need not be all zeros. Other
4753 combinations indicate definitive answers. */
4755 extern bool initializer_zerop (const_tree
, bool * = NULL
);
4756 extern bool initializer_each_zero_or_onep (const_tree
);
4758 extern wide_int
vector_cst_int_elt (const_tree
, unsigned int);
4759 extern tree
vector_cst_elt (const_tree
, unsigned int);
4761 /* Given a vector VEC, return its first element if all elements are
4762 the same. Otherwise return NULL_TREE. */
4764 extern tree
uniform_vector_p (const_tree
);
4766 /* If the argument is INTEGER_CST, return it. If the argument is vector
4767 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4768 return NULL_TREE. */
4770 extern tree
uniform_integer_cst_p (tree
);
4772 extern int single_nonzero_element (const_tree
);
4774 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4776 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4778 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4780 extern bool zerop (const_tree
);
4782 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4784 extern bool integer_zerop (const_tree
);
4786 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4788 extern bool integer_onep (const_tree
);
4790 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4791 a vector or complex where each part is 1. */
4793 extern bool integer_each_onep (const_tree
);
4795 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4796 all of whose significant bits are 1. */
4798 extern bool integer_all_onesp (const_tree
);
4800 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4803 extern bool integer_minus_onep (const_tree
);
4805 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4806 exactly one bit 1. */
4808 extern bool integer_pow2p (const_tree
);
4810 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4811 with a nonzero value. */
4813 extern bool integer_nonzerop (const_tree
);
4815 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4816 a vector where each element is an integer constant of value -1. */
4818 extern bool integer_truep (const_tree
);
4820 extern bool cst_and_fits_in_hwi (const_tree
);
4821 extern tree
num_ending_zeros (const_tree
);
4823 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4826 extern bool fixed_zerop (const_tree
);
4828 /* staticp (tree x) is nonzero if X is a reference to data allocated
4829 at a fixed address in memory. Returns the outermost data. */
4831 extern tree
staticp (tree
);
4833 /* save_expr (EXP) returns an expression equivalent to EXP
4834 but it can be used multiple times within context CTX
4835 and only evaluate EXP once. */
4837 extern tree
save_expr (tree
);
4839 /* Return true if T is function-invariant. */
4841 extern bool tree_invariant_p (tree
);
4843 /* Look inside EXPR into any simple arithmetic operations. Return the
4844 outermost non-arithmetic or non-invariant node. */
4846 extern tree
skip_simple_arithmetic (tree
);
4848 /* Look inside EXPR into simple arithmetic operations involving constants.
4849 Return the outermost non-arithmetic or non-constant node. */
4851 extern tree
skip_simple_constant_arithmetic (tree
);
4853 /* Return which tree structure is used by T. */
4855 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4857 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4858 size or offset that depends on a field within a record. */
4860 extern bool contains_placeholder_p (const_tree
);
4862 /* This macro calls the above function but short-circuits the common
4863 case of a constant to save time. Also check for null. */
4865 #define CONTAINS_PLACEHOLDER_P(EXP) \
4866 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4868 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4869 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4872 extern bool type_contains_placeholder_p (tree
);
4874 /* Given a tree EXP, find all occurrences of references to fields
4875 in a PLACEHOLDER_EXPR and place them in vector REFS without
4876 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4877 we assume here that EXP contains only arithmetic expressions
4878 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4881 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4883 /* This macro calls the above function but short-circuits the common
4884 case of a constant to save time and also checks for NULL. */
4886 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4888 if((EXP) && !TREE_CONSTANT (EXP)) \
4889 find_placeholder_in_expr (EXP, V); \
4892 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4893 return a tree with all occurrences of references to F in a
4894 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4895 CONST_DECLs. Note that we assume here that EXP contains only
4896 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4897 occurring only in their argument list. */
4899 extern tree
substitute_in_expr (tree
, tree
, tree
);
4901 /* This macro calls the above function but short-circuits the common
4902 case of a constant to save time and also checks for NULL. */
4904 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4905 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4907 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4908 for it within OBJ, a tree that is an object or a chain of references. */
4910 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4912 /* This macro calls the above function but short-circuits the common
4913 case of a constant to save time and also checks for NULL. */
4915 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4916 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4917 : substitute_placeholder_in_expr (EXP, OBJ))
4920 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4921 but it can be used multiple times
4922 and only evaluate the subexpressions once. */
4924 extern tree
stabilize_reference (tree
);
4926 /* Return EXP, stripped of any conversions to wider types
4927 in such a way that the result of converting to type FOR_TYPE
4928 is the same as if EXP were converted to FOR_TYPE.
4929 If FOR_TYPE is 0, it signifies EXP's type. */
4931 extern tree
get_unwidened (tree
, tree
);
4933 /* Return OP or a simpler expression for a narrower value
4934 which can be sign-extended or zero-extended to give back OP.
4935 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4936 or 0 if the value should be sign-extended. */
4938 extern tree
get_narrower (tree
, int *);
4940 /* Return true if T is an expression that get_inner_reference handles. */
4943 handled_component_p (const_tree t
)
4945 switch (TREE_CODE (t
))
4950 case ARRAY_RANGE_REF
:
4953 case VIEW_CONVERT_EXPR
:
4961 /* Return true T is a component with reverse storage order. */
4964 reverse_storage_order_for_component_p (tree t
)
4966 /* The storage order only applies to scalar components. */
4967 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4970 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4971 t
= TREE_OPERAND (t
, 0);
4973 switch (TREE_CODE (t
))
4977 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4978 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4979 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4980 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4984 return REF_REVERSE_STORAGE_ORDER (t
);
4986 case ARRAY_RANGE_REF
:
4987 case VIEW_CONVERT_EXPR
:
4995 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4996 that can modify the storage order of objects. Note that, even if the
4997 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4998 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4999 it can change the partition of the aggregate object into scalars. */
5002 storage_order_barrier_p (const_tree t
)
5004 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
5007 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
5008 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
5011 tree op
= TREE_OPERAND (t
, 0);
5013 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
5014 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
5020 /* Given a DECL or TYPE, return the scope in which it was declared, or
5021 NUL_TREE if there is no containing scope. */
5023 extern tree
get_containing_scope (const_tree
);
5025 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5027 extern const_tree
get_ultimate_context (const_tree
);
5029 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5031 extern tree
decl_function_context (const_tree
);
5033 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5034 this _DECL with its context, or zero if none. */
5035 extern tree
decl_type_context (const_tree
);
5037 /* Return true if EXPR is the real constant zero. */
5038 extern bool real_zerop (const_tree
);
5040 /* Initialize the iterator I with arguments from function FNDECL */
5043 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5045 i
->next
= TYPE_ARG_TYPES (fntype
);
5048 /* Return a pointer that holds the next argument if there are more arguments to
5049 handle, otherwise return NULL. */
5051 static inline tree
*
5052 function_args_iter_cond_ptr (function_args_iterator
*i
)
5054 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5057 /* Return the next argument if there are more arguments to handle, otherwise
5061 function_args_iter_cond (function_args_iterator
*i
)
5063 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5066 /* Advance to the next argument. */
5068 function_args_iter_next (function_args_iterator
*i
)
5070 gcc_assert (i
->next
!= NULL_TREE
);
5071 i
->next
= TREE_CHAIN (i
->next
);
5074 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5077 inlined_function_outer_scope_p (const_tree block
)
5079 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
5082 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5083 to point to the next tree element. ITER is an instance of
5084 function_args_iterator used to iterate the arguments. */
5085 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5086 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5087 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5088 function_args_iter_next (&(ITER)))
5090 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5091 to the next tree element. ITER is an instance of function_args_iterator
5092 used to iterate the arguments. */
5093 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5094 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5095 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5096 function_args_iter_next (&(ITER)))
5099 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5100 extern unsigned crc32_string (unsigned, const char *);
5102 crc32_unsigned (unsigned chksum
, unsigned value
)
5104 return crc32_unsigned_n (chksum
, value
, 4);
5107 crc32_byte (unsigned chksum
, char byte
)
5109 return crc32_unsigned_n (chksum
, byte
, 1);
5111 extern void clean_symbol_name (char *);
5112 extern tree
get_file_function_name (const char *);
5113 extern tree
get_callee_fndecl (const_tree
);
5114 extern combined_fn
get_call_combined_fn (const_tree
);
5115 extern int type_num_arguments (const_tree
);
5116 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
5117 extern bool associative_tree_code (enum tree_code
);
5118 extern bool commutative_tree_code (enum tree_code
);
5119 extern bool commutative_ternary_tree_code (enum tree_code
);
5120 extern bool operation_can_overflow (enum tree_code
);
5121 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
5122 extern tree
upper_bound_in_type (tree
, tree
);
5123 extern tree
lower_bound_in_type (tree
, tree
);
5124 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5125 extern tree
create_artificial_label (location_t
);
5126 extern const char *get_name (tree
);
5127 extern bool stdarg_p (const_tree
);
5128 extern bool prototype_p (const_tree
);
5129 extern bool is_typedef_decl (const_tree x
);
5130 extern bool typedef_variant_p (const_tree
);
5131 extern bool auto_var_p (const_tree
);
5132 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5133 extern tree
build_low_bits_mask (tree
, unsigned);
5134 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
5135 extern tree
tree_strip_nop_conversions (tree
);
5136 extern tree
tree_strip_sign_nop_conversions (tree
);
5137 extern const_tree
strip_invariant_refs (const_tree
);
5138 extern tree
lhd_gcc_personality (void);
5139 extern void assign_assembler_name_if_needed (tree
);
5140 extern bool warn_deprecated_use (tree
, tree
);
5141 extern tree
cache_integer_cst (tree
, bool might_duplicate
= false);
5142 extern const char *combined_fn_name (combined_fn
);
5144 /* Compare and hash for any structure which begins with a canonical
5145 pointer. Assumes all pointers are interchangeable, which is sort
5146 of already assumed by gcc elsewhere IIRC. */
5149 struct_ptr_eq (const void *a
, const void *b
)
5151 const void * const * x
= (const void * const *) a
;
5152 const void * const * y
= (const void * const *) b
;
5156 static inline hashval_t
5157 struct_ptr_hash (const void *a
)
5159 const void * const * x
= (const void * const *) a
;
5160 return (intptr_t)*x
>> 4;
5163 /* Return nonzero if CODE is a tree code that represents a truth value. */
5165 truth_value_p (enum tree_code code
)
5167 return (TREE_CODE_CLASS (code
) == tcc_comparison
5168 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5169 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5170 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5173 /* Return whether TYPE is a type suitable for an offset for
5174 a POINTER_PLUS_EXPR. */
5176 ptrofftype_p (tree type
)
5178 return (INTEGRAL_TYPE_P (type
)
5179 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5180 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5183 /* Return true if the argument is a complete type or an array
5184 of unknown bound (whose type is incomplete but) whose elements
5185 have complete type. */
5187 complete_or_array_type_p (const_tree type
)
5189 return COMPLETE_TYPE_P (type
)
5190 || (TREE_CODE (type
) == ARRAY_TYPE
5191 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
5194 /* Return true if the value of T could be represented as a poly_widest_int. */
5197 poly_int_tree_p (const_tree t
)
5199 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
5202 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5203 to be a poly_uint64. (This is always true at the gimple level.) */
5206 bit_field_size (const_tree t
)
5208 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
5211 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5212 known to be a poly_uint64. (This is always true at the gimple level.) */
5215 bit_field_offset (const_tree t
)
5217 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
5220 extern tree
strip_float_extensions (tree
);
5221 extern bool really_constant_p (const_tree
);
5222 extern bool ptrdiff_tree_p (const_tree
, poly_int64_pod
*);
5223 extern bool decl_address_invariant_p (const_tree
);
5224 extern bool decl_address_ip_invariant_p (const_tree
);
5225 extern bool int_fits_type_p (const_tree
, const_tree
)
5226 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
5227 #ifndef GENERATOR_FILE
5228 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5230 extern bool variably_modified_type_p (tree
, tree
);
5231 extern int tree_log2 (const_tree
);
5232 extern int tree_floor_log2 (const_tree
);
5233 extern unsigned int tree_ctz (const_tree
);
5234 extern int simple_cst_equal (const_tree
, const_tree
);
5239 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
5243 /* Compat version until all callers are converted. Return hash for
5245 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
5247 inchash::hash
hstate (seed
);
5248 inchash::add_expr (tree
, hstate
);
5249 return hstate
.end ();
5252 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5253 extern bool type_list_equal (const_tree
, const_tree
);
5254 extern bool chain_member (const_tree
, const_tree
);
5255 extern void dump_tree_statistics (void);
5256 extern void recompute_tree_invariant_for_addr_expr (tree
);
5257 extern bool needs_to_live_in_memory (const_tree
);
5258 extern tree
reconstruct_complex_type (tree
, tree
);
5259 extern bool real_onep (const_tree
);
5260 extern bool real_minus_onep (const_tree
);
5261 extern void init_ttree (void);
5262 extern void build_common_tree_nodes (bool);
5263 extern void build_common_builtin_nodes (void);
5264 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5265 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
5266 extern tree
build_range_type (tree
, tree
, tree
);
5267 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5268 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5269 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5270 extern tree
tree_block (tree
);
5271 extern void tree_set_block (tree
, tree
);
5272 extern location_t
*block_nonartificial_location (tree
);
5273 extern location_t
tree_nonartificial_location (tree
);
5274 extern tree
block_ultimate_origin (const_tree
);
5275 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5276 extern bool virtual_method_call_p (const_tree
, bool = false);
5277 extern tree
obj_type_ref_class (const_tree ref
, bool = false);
5278 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5279 extern bool contains_bitfld_component_ref_p (const_tree
);
5280 extern bool block_may_fallthru (const_tree
);
5281 extern void using_eh_for_cleanups (void);
5282 extern bool using_eh_for_cleanups_p (void);
5283 extern const char *get_tree_code_name (enum tree_code
);
5284 extern void set_call_expr_flags (tree
, int);
5285 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5287 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5289 #define walk_tree(a,b,c,d) \
5290 walk_tree_1 (a, b, c, d, NULL)
5291 #define walk_tree_without_duplicates(a,b,c) \
5292 walk_tree_without_duplicates_1 (a, b, c, NULL)
5294 extern tree
drop_tree_overflow (tree
);
5296 /* Given a memory reference expression T, return its base address.
5297 The base address of a memory reference expression is the main
5298 object being referenced. */
5299 extern tree
get_base_address (tree t
);
5301 /* Return a tree of sizetype representing the size, in bytes, of the element
5302 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5303 extern tree
array_ref_element_size (tree
);
5305 /* Return a typenode for the "standard" C type with a given name. */
5306 extern tree
get_typenode_from_name (const char *);
5308 /* Return a tree representing the upper bound of the array mentioned in
5309 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5310 extern tree
array_ref_up_bound (tree
);
5312 /* Return a tree representing the lower bound of the array mentioned in
5313 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5314 extern tree
array_ref_low_bound (tree
);
5316 /* Returns true if REF is an array reference or a component reference
5317 to an array at the end of a structure. If this is the case, the array
5318 may be allocated larger than its upper bound implies. */
5319 extern bool array_at_struct_end_p (tree
);
5321 /* Return a tree representing the offset, in bytes, of the field referenced
5322 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5323 extern tree
component_ref_field_offset (tree
);
5325 /* Describes a "special" array member due to which component_ref_size
5327 enum struct special_array_member
5329 none
, /* Not a special array member. */
5330 int_0
, /* Interior array member with size zero. */
5331 trail_0
, /* Trailing array member with size zero. */
5332 trail_1
/* Trailing array member with one element. */
5335 /* Return the size of the member referenced by the COMPONENT_REF, using
5336 its initializer expression if necessary in order to determine the size
5337 of an initialized flexible array member. The size might be zero for
5338 an object with an uninitialized flexible array member or null if it
5339 cannot be determined. */
5340 extern tree
component_ref_size (tree
, special_array_member
* = NULL
);
5342 extern int tree_map_base_eq (const void *, const void *);
5343 extern unsigned int tree_map_base_hash (const void *);
5344 extern int tree_map_base_marked_p (const void *);
5345 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5346 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5347 bool trust_type_canonical
= true);
5348 extern bool type_with_interoperable_signedness (const_tree
);
5349 extern bitmap
get_nonnull_args (const_tree
);
5350 extern int get_range_pos_neg (tree
);
5352 /* Return simplified tree code of type that is used for canonical type
5354 inline enum tree_code
5355 tree_code_for_canonical_type_merging (enum tree_code code
)
5357 /* By C standard, each enumerated type shall be compatible with char,
5358 a signed integer, or an unsigned integer. The choice of type is
5359 implementation defined (in our case it depends on -fshort-enum).
5361 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5362 type and compare only by their signedness and precision. */
5363 if (code
== ENUMERAL_TYPE
)
5364 return INTEGER_TYPE
;
5365 /* To allow inter-operability between languages having references and
5366 C, we consider reference types and pointers alike. Note that this is
5367 not strictly necessary for C-Fortran 2008 interoperability because
5368 Fortran define C_PTR type that needs to be compatible with C pointers
5369 and we handle this one as ptr_type_node. */
5370 if (code
== REFERENCE_TYPE
)
5371 return POINTER_TYPE
;
5375 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5376 We don't define the types for pointers, arrays and vectors. The reason is
5377 that pointers are handled specially: ptr_type_node accesses conflict with
5378 accesses to all other pointers. This is done by alias.c.
5379 Because alias sets of arrays and vectors are the same as types of their
5380 elements, we can't compute canonical type either. Otherwise we could go
5381 form void *[10] to int *[10] (because they are equivalent for canonical type
5382 machinery) and get wrong TBAA. */
5385 canonical_type_used_p (const_tree t
)
5387 return !(POINTER_TYPE_P (t
)
5388 || TREE_CODE (t
) == ARRAY_TYPE
5389 || TREE_CODE (t
) == VECTOR_TYPE
);
5392 /* Kinds of access to pass-by-reference arguments to functions. */
5396 access_read_only
= 1,
5397 access_write_only
= 2,
5398 access_read_write
= access_read_only
| access_write_only
,
5402 #define tree_map_eq tree_map_base_eq
5403 extern unsigned int tree_map_hash (const void *);
5404 #define tree_map_marked_p tree_map_base_marked_p
5406 #define tree_decl_map_eq tree_map_base_eq
5407 extern unsigned int tree_decl_map_hash (const void *);
5408 #define tree_decl_map_marked_p tree_map_base_marked_p
5410 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5412 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5414 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5416 return tree_decl_map_eq (a
, b
);
5420 keep_cache_entry (tree_decl_map
*&m
)
5422 return ggc_marked_p (m
->base
.from
);
5426 #define tree_int_map_eq tree_map_base_eq
5427 #define tree_int_map_hash tree_map_base_hash
5428 #define tree_int_map_marked_p tree_map_base_marked_p
5430 #define tree_vec_map_eq tree_map_base_eq
5431 #define tree_vec_map_hash tree_decl_map_hash
5432 #define tree_vec_map_marked_p tree_map_base_marked_p
5434 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5435 is a better hash than the pointer value and gives a predictable traversal
5436 order. Additionally it can be used across PCH save/restore. */
5437 struct tree_decl_hash
: ggc_ptr_hash
<tree_node
>
5439 static inline hashval_t
hash (tree
);
5443 tree_decl_hash::hash (tree t
)
5445 return DECL_UID (t
);
5448 /* Similarly for types. Uses TYPE_UID as hash function. */
5449 struct tree_type_hash
: ggc_ptr_hash
<tree_node
>
5451 static inline hashval_t
hash (tree
);
5455 tree_type_hash::hash (tree t
)
5457 return TYPE_UID (t
);
5460 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5461 here, but the SSA_NAME_VERSION is a better hash than the pointer
5462 value and gives a predictable traversal order. */
5463 struct tree_ssa_name_hash
: ggc_ptr_hash
<tree_node
>
5465 static inline hashval_t
hash (tree
);
5469 tree_ssa_name_hash::hash (tree t
)
5471 return SSA_NAME_VERSION (t
);
5474 /* Hasher for general trees, based on their TREE_HASH. */
5475 struct tree_hash
: ggc_ptr_hash
<tree_node
>
5477 static hashval_t
hash (tree
);
5481 tree_hash::hash (tree t
)
5483 return TREE_HASH (t
);
5486 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5487 such a map will not mark keys, and will mark values if the key is already
5489 struct tree_cache_traits
5490 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5491 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5493 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5494 This is for hash_maps from decls to trees that need to work across PCH. */
5495 struct decl_tree_cache_traits
5496 : simple_cache_map_traits
<tree_decl_hash
, tree
> { };
5497 typedef hash_map
<tree
,tree
,decl_tree_cache_traits
> decl_tree_cache_map
;
5499 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5500 This is for hash_maps from types to trees that need to work across PCH. */
5501 struct type_tree_cache_traits
5502 : simple_cache_map_traits
<tree_type_hash
, tree
> { };
5503 typedef hash_map
<tree
,tree
,type_tree_cache_traits
> type_tree_cache_map
;
5505 /* Similarly to decl_tree_cache_map, but without caching. */
5506 struct decl_tree_traits
5507 : simple_hashmap_traits
<tree_decl_hash
, tree
> { };
5508 typedef hash_map
<tree
,tree
,decl_tree_traits
> decl_tree_map
;
5510 /* Initialize the abstract argument list iterator object ITER with the
5511 arguments from CALL_EXPR node EXP. */
5513 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5516 iter
->n
= call_expr_nargs (exp
);
5521 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5524 iter
->n
= call_expr_nargs (exp
);
5528 /* Return the next argument from abstract argument list iterator object ITER,
5529 and advance its state. Return NULL_TREE if there are no more arguments. */
5531 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5534 if (iter
->i
>= iter
->n
)
5536 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5541 static inline const_tree
5542 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5545 if (iter
->i
>= iter
->n
)
5547 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5552 /* Initialize the abstract argument list iterator object ITER, then advance
5553 past and return the first argument. Useful in for expressions, e.g.
5554 for (arg = first_call_expr_arg (exp, &iter); arg;
5555 arg = next_call_expr_arg (&iter)) */
5557 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5559 init_call_expr_arg_iterator (exp
, iter
);
5560 return next_call_expr_arg (iter
);
5563 static inline const_tree
5564 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5566 init_const_call_expr_arg_iterator (exp
, iter
);
5567 return next_const_call_expr_arg (iter
);
5570 /* Test whether there are more arguments in abstract argument list iterator
5571 ITER, without changing its state. */
5573 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5575 return (iter
->i
< iter
->n
);
5578 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5579 (of type call_expr_arg_iterator) to hold the iteration state. */
5580 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5581 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5582 (arg) = next_call_expr_arg (&(iter)))
5584 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5585 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5586 (arg) = next_const_call_expr_arg (&(iter)))
5588 /* Return true if tree node T is a language-specific node. */
5590 is_lang_specific (const_tree t
)
5592 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5595 /* Valid builtin number. */
5596 #define BUILTIN_VALID_P(FNCODE) \
5597 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5599 /* Return the tree node for an explicit standard builtin function or NULL. */
5601 builtin_decl_explicit (enum built_in_function fncode
)
5603 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5605 return builtin_info
[(size_t)fncode
].decl
;
5608 /* Return the tree node for an implicit builtin function or NULL. */
5610 builtin_decl_implicit (enum built_in_function fncode
)
5612 size_t uns_fncode
= (size_t)fncode
;
5613 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5615 if (!builtin_info
[uns_fncode
].implicit_p
)
5618 return builtin_info
[uns_fncode
].decl
;
5621 /* Set explicit builtin function nodes and whether it is an implicit
5625 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5627 size_t ufncode
= (size_t)fncode
;
5629 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5630 && (decl
!= NULL_TREE
|| !implicit_p
));
5632 builtin_info
[ufncode
].decl
= decl
;
5633 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5634 builtin_info
[ufncode
].declared_p
= false;
5637 /* Set the implicit flag for a builtin function. */
5640 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5642 size_t uns_fncode
= (size_t)fncode
;
5644 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5645 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5647 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5650 /* Set the declared flag for a builtin function. */
5653 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5655 size_t uns_fncode
= (size_t)fncode
;
5657 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5658 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5660 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5663 /* Return whether the standard builtin function can be used as an explicit
5667 builtin_decl_explicit_p (enum built_in_function fncode
)
5669 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5670 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5673 /* Return whether the standard builtin function can be used implicitly. */
5676 builtin_decl_implicit_p (enum built_in_function fncode
)
5678 size_t uns_fncode
= (size_t)fncode
;
5680 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5681 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5682 && builtin_info
[uns_fncode
].implicit_p
);
5685 /* Return whether the standard builtin function was declared. */
5688 builtin_decl_declared_p (enum built_in_function fncode
)
5690 size_t uns_fncode
= (size_t)fncode
;
5692 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5693 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5694 && builtin_info
[uns_fncode
].declared_p
);
5697 /* Determine if the function identified by FNDECL is one that
5698 makes sense to match by name, for those places where we detect
5699 "magic" functions by name.
5701 Return true if FNDECL has a name and is an extern fndecl at file scope.
5702 FNDECL must be a non-NULL decl.
5704 Avoid using this, as it's generally better to use attributes rather
5705 than to check for functions by name. */
5708 maybe_special_function_p (const_tree fndecl
)
5710 tree name_decl
= DECL_NAME (fndecl
);
5712 /* Exclude functions not at the file scope, or not `extern',
5713 since they are not the magic functions we would otherwise
5715 && (DECL_CONTEXT (fndecl
) == NULL_TREE
5716 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
5717 && TREE_PUBLIC (fndecl
))
5722 /* Return true if T (assumed to be a DECL) is a global variable.
5723 A variable is considered global if its storage is not automatic. */
5726 is_global_var (const_tree t
)
5728 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5731 /* Return true if VAR may be aliased. A variable is considered as
5732 maybe aliased if it has its address taken by the local TU
5733 or possibly by another TU and might be modified through a pointer. */
5736 may_be_aliased (const_tree var
)
5738 return (TREE_CODE (var
) != CONST_DECL
5739 && (TREE_PUBLIC (var
)
5740 || DECL_EXTERNAL (var
)
5741 || TREE_ADDRESSABLE (var
))
5742 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5743 && (TREE_READONLY (var
)
5744 || (TREE_CODE (var
) == VAR_DECL
5745 && DECL_NONALIASED (var
)))));
5748 /* Return pointer to optimization flags of FNDECL. */
5749 static inline struct cl_optimization
*
5750 opts_for_fn (const_tree fndecl
)
5752 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5753 if (fn_opts
== NULL_TREE
)
5754 fn_opts
= optimization_default_node
;
5755 return TREE_OPTIMIZATION (fn_opts
);
5758 /* Return pointer to target flags of FNDECL. */
5759 static inline cl_target_option
*
5760 target_opts_for_fn (const_tree fndecl
)
5762 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5763 if (fn_opts
== NULL_TREE
)
5764 fn_opts
= target_option_default_node
;
5765 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5768 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5769 the optimization level of function fndecl. */
5770 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5772 /* For anonymous aggregate types, we need some sort of name to
5773 hold on to. In practice, this should not appear, but it should
5774 not be harmful if it does. Identifiers returned will be
5775 IDENTIFIER_ANON_P. */
5776 extern tree
make_anon_name ();
5778 /* The tree and const_tree overload templates. */
5781 class unextended_tree
5787 unextended_tree () {}
5788 unextended_tree (const_tree t
) : m_t (t
) {}
5790 unsigned int get_precision () const;
5791 const HOST_WIDE_INT
*get_val () const;
5792 unsigned int get_len () const;
5793 const_tree
get_tree () const { return m_t
; }
5797 struct int_traits
<unextended_tree
>
5799 static const enum precision_type precision_type
= VAR_PRECISION
;
5800 static const bool host_dependent_precision
= false;
5801 static const bool is_sign_extended
= false;
5812 extended_tree (const_tree
);
5814 unsigned int get_precision () const;
5815 const HOST_WIDE_INT
*get_val () const;
5816 unsigned int get_len () const;
5817 const_tree
get_tree () const { return m_t
; }
5821 struct int_traits
<extended_tree
<N
> >
5823 static const enum precision_type precision_type
= CONST_PRECISION
;
5824 static const bool host_dependent_precision
= false;
5825 static const bool is_sign_extended
= true;
5826 static const unsigned int precision
= N
;
5829 typedef extended_tree
<WIDE_INT_MAX_PRECISION
> widest_extended_tree
;
5830 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
5832 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
5833 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
5834 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
5837 tree_to_widest_ref
to_widest (const_tree
);
5838 tree_to_offset_ref
to_offset (const_tree
);
5839 tree_to_wide_ref
to_wide (const_tree
);
5840 wide_int
to_wide (const_tree
, unsigned int);
5842 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5843 generic_wide_int
<widest_extended_tree
> >
5844 tree_to_poly_widest_ref
;
5845 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5846 generic_wide_int
<offset_extended_tree
> >
5847 tree_to_poly_offset_ref
;
5848 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5849 generic_wide_int
<unextended_tree
> >
5850 tree_to_poly_wide_ref
;
5852 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
5853 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
5854 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
5857 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
5859 typedef generic_wide_int
<extended_tree
<N
> > extended
;
5860 static extended
zero (const extended
&);
5864 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
5866 typedef generic_wide_int
<unextended_tree
> unextended
;
5867 static unextended
zero (const unextended
&);
5871 /* Used to convert a tree to a widest2_int like this:
5872 widest2_int foo = widest2_int_cst (some_tree). */
5873 typedef generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
* 2> >
5876 /* Refer to INTEGER_CST T as though it were a widest_int.
5878 This function gives T's actual numerical value, influenced by the
5879 signedness of its type. For example, a signed byte with just the
5880 top bit set would be -128 while an unsigned byte with the same
5881 bit pattern would be 128.
5883 This is the right choice when operating on groups of INTEGER_CSTs
5884 that might have different signedness or precision. It is also the
5885 right choice in code that specifically needs an approximation of
5886 infinite-precision arithmetic instead of normal modulo arithmetic.
5888 The approximation of infinite precision is good enough for realistic
5889 numbers of additions and subtractions of INTEGER_CSTs (where
5890 "realistic" includes any number less than 1 << 31) but it cannot
5891 represent the result of multiplying the two largest supported
5892 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
5893 of multiplying two arbitrary INTEGER_CSTs and checking that the
5894 result is representable as a widest_int.
5896 Note that any overflow checking done on these values is relative to
5897 the range of widest_int rather than the range of a TREE_TYPE.
5899 Calling this function should have no overhead in release builds,
5900 so it is OK to call it several times for the same tree. If it is
5901 useful for readability reasons to reduce the number of calls,
5902 it is more efficient to use:
5904 wi::tree_to_widest_ref wt = wi::to_widest (t);
5908 widest_int wt = wi::to_widest (t). */
5910 inline wi::tree_to_widest_ref
5911 wi::to_widest (const_tree t
)
5916 /* Refer to INTEGER_CST T as though it were an offset_int.
5918 This function is an optimisation of wi::to_widest for cases
5919 in which T is known to be a bit or byte count in the range
5920 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
5921 the target's address size in bits.
5923 This is the right choice when operating on bit or byte counts as
5924 untyped numbers rather than M-bit values. The wi::to_widest comments
5925 about addition, subtraction and multiplication apply here: sequences
5926 of 1 << 31 additions and subtractions do not induce overflow, but
5927 multiplying the largest sizes might. Again,
5929 wi::tree_to_offset_ref wt = wi::to_offset (t);
5931 is more efficient than:
5933 offset_int wt = wi::to_offset (t). */
5935 inline wi::tree_to_offset_ref
5936 wi::to_offset (const_tree t
)
5941 /* Refer to INTEGER_CST T as though it were a wide_int.
5943 In contrast to the approximation of infinite-precision numbers given
5944 by wi::to_widest and wi::to_offset, this function treats T as a
5945 signless collection of N bits, where N is the precision of T's type.
5946 As with machine registers, signedness is determined by the operation
5947 rather than the operands; for example, there is a distinction between
5948 signed and unsigned division.
5950 This is the right choice when operating on values with the same type
5951 using normal modulo arithmetic. The overflow-checking forms of things
5952 like wi::add check whether the result can be represented in T's type.
5954 Calling this function should have no overhead in release builds,
5955 so it is OK to call it several times for the same tree. If it is
5956 useful for readability reasons to reduce the number of calls,
5957 it is more efficient to use:
5959 wi::tree_to_wide_ref wt = wi::to_wide (t);
5963 wide_int wt = wi::to_wide (t). */
5965 inline wi::tree_to_wide_ref
5966 wi::to_wide (const_tree t
)
5968 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
5969 TYPE_PRECISION (TREE_TYPE (t
)));
5972 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5973 truncating as necessary. When extending, use sign extension if T's
5974 type is signed and zero extension if T's type is unsigned. */
5977 wi::to_wide (const_tree t
, unsigned int prec
)
5979 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
5983 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5986 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5991 wi::extended_tree
<N
>::get_precision () const
5997 inline const HOST_WIDE_INT
*
5998 wi::extended_tree
<N
>::get_val () const
6000 return &TREE_INT_CST_ELT (m_t
, 0);
6005 wi::extended_tree
<N
>::get_len () const
6007 if (N
== ADDR_MAX_PRECISION
)
6008 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
6009 else if (N
>= WIDE_INT_MAX_PRECISION
)
6010 return TREE_INT_CST_EXT_NUNITS (m_t
);
6012 /* This class is designed to be used for specific output precisions
6013 and needs to be as fast as possible, so there is no fallback for
6019 wi::unextended_tree::get_precision () const
6021 return TYPE_PRECISION (TREE_TYPE (m_t
));
6024 inline const HOST_WIDE_INT
*
6025 wi::unextended_tree::get_val () const
6027 return &TREE_INT_CST_ELT (m_t
, 0);
6031 wi::unextended_tree::get_len () const
6033 return TREE_INT_CST_NUNITS (m_t
);
6036 /* Return the value of a POLY_INT_CST in its native precision. */
6038 inline wi::tree_to_poly_wide_ref
6039 poly_int_cst_value (const_tree x
)
6041 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
6042 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6043 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
6047 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6048 poly_widest_int. See wi::to_widest for more details. */
6050 inline wi::tree_to_poly_widest_ref
6051 wi::to_poly_widest (const_tree t
)
6053 if (POLY_INT_CST_P (t
))
6055 poly_int
<NUM_POLY_INT_COEFFS
,
6056 generic_wide_int
<widest_extended_tree
> > res
;
6057 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6058 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6064 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6065 poly_offset_int. See wi::to_offset for more details. */
6067 inline wi::tree_to_poly_offset_ref
6068 wi::to_poly_offset (const_tree t
)
6070 if (POLY_INT_CST_P (t
))
6072 poly_int
<NUM_POLY_INT_COEFFS
,
6073 generic_wide_int
<offset_extended_tree
> > res
;
6074 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6075 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6081 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6082 poly_wide_int. See wi::to_wide for more details. */
6084 inline wi::tree_to_poly_wide_ref
6085 wi::to_poly_wide (const_tree t
)
6087 if (POLY_INT_CST_P (t
))
6088 return poly_int_cst_value (t
);
6093 inline generic_wide_int
<wi::extended_tree
<N
> >
6094 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
6095 wi::CONST_PRECISION
>::zero (const extended
&x
)
6097 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6100 inline generic_wide_int
<wi::unextended_tree
>
6101 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
6102 wi::VAR_PRECISION
>::zero (const unextended
&x
)
6104 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6109 template <typename T
>
6110 bool fits_to_boolean_p (const T
&x
, const_tree
);
6112 template <typename T
>
6113 bool fits_to_tree_p (const T
&x
, const_tree
);
6115 wide_int
min_value (const_tree
);
6116 wide_int
max_value (const_tree
);
6117 wide_int
from_mpz (const_tree
, mpz_t
, bool);
6120 template <typename T
>
6122 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
6124 typedef typename poly_int_traits
<T
>::int_type int_type
;
6125 return (known_eq (x
, int_type (0))
6126 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
6129 template <typename T
>
6131 wi::fits_to_tree_p (const T
&x
, const_tree type
)
6133 /* Non-standard boolean types can have arbitrary precision but various
6134 transformations assume that they can only take values 0 and +/-1. */
6135 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
6136 return fits_to_boolean_p (x
, type
);
6138 if (TYPE_UNSIGNED (type
))
6139 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
6141 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
6144 /* Produce the smallest number that is represented in TYPE. The precision
6145 and sign are taken from TYPE. */
6147 wi::min_value (const_tree type
)
6149 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6152 /* Produce the largest number that is represented in TYPE. The precision
6153 and sign are taken from TYPE. */
6155 wi::max_value (const_tree type
)
6157 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6160 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6161 extending both according to their respective TYPE_SIGNs. */
6164 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6166 return wi::to_widest (t1
) < wi::to_widest (t2
);
6169 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6170 extending both according to their respective TYPE_SIGNs. */
6173 tree_int_cst_le (const_tree t1
, const_tree t2
)
6175 return wi::to_widest (t1
) <= wi::to_widest (t2
);
6178 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6179 are both INTEGER_CSTs and their values are extended according to their
6180 respective TYPE_SIGNs. */
6183 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6185 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
6188 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6189 but none of these files are allowed to be included from front ends.
6190 They should be split in two. One suitable for the FEs, the other suitable
6193 /* Assign the RTX to declaration. */
6194 extern void set_decl_rtl (tree
, rtx
);
6195 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
6197 /* Given an expression EXP that is a handled_component_p,
6198 look for the ultimate containing object, which is returned and specify
6199 the access position and size. */
6200 extern tree
get_inner_reference (tree
, poly_int64_pod
*, poly_int64_pod
*,
6201 tree
*, machine_mode
*, int *, int *, int *);
6203 extern tree
build_personality_function (const char *);
6205 struct GTY(()) int_n_trees_t
{
6206 /* These parts are initialized at runtime */
6211 /* This is also in machmode.h */
6212 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
6213 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
6215 /* Like bit_position, but return as an integer. It must be representable in
6216 that way (since it could be a signed value, we don't have the
6217 option of returning -1 like int_size_in_byte can. */
6219 inline HOST_WIDE_INT
6220 int_bit_position (const_tree field
)
6222 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
6223 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
6226 /* Return true if it makes sense to consider alias set for a type T. */
6229 type_with_alias_set_p (const_tree t
)
6231 /* Function and method types are never accessed as memory locations. */
6232 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
6235 if (COMPLETE_TYPE_P (t
))
6238 /* Incomplete types cannot be accessed in general except for arrays
6239 where we can fetch its element despite we have no array bounds. */
6240 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
6246 extern location_t
set_block (location_t loc
, tree block
);
6248 extern void gt_ggc_mx (tree
&);
6249 extern void gt_pch_nx (tree
&);
6250 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
6252 extern bool nonnull_arg_p (const_tree
);
6253 extern bool is_empty_type (const_tree
);
6254 extern bool default_is_empty_record (const_tree
);
6255 extern bool flexible_array_type_p (const_tree
);
6256 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
6257 extern tree
arg_size_in_bytes (const_tree
);
6258 extern bool expr_type_first_operand_type_p (tree_code
);
6261 set_source_range (tree expr
, location_t start
, location_t finish
);
6264 set_source_range (tree expr
, source_range src_range
);
6266 /* Return true if it makes sense to promote/demote from_type to to_type. */
6268 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
6270 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
6272 /* OK to promote if to_type is no bigger than word_mode. */
6273 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
6276 /* Otherwise, allow only if narrowing or same precision conversions. */
6277 return to_type_precision
<= TYPE_PRECISION (from_type
);
6280 /* Pointer type used to declare builtins before we have seen its real
6282 class builtin_structptr_type
6289 extern const builtin_structptr_type builtin_structptr_types
[6];
6291 /* Return true if type T has the same precision as its underlying mode. */
6294 type_has_mode_precision_p (const_tree t
)
6296 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
6299 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6301 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6302 accessor, as this is impervious to user declaration. */
6305 fndecl_built_in_p (const_tree node
)
6307 return DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
;
6310 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6314 fndecl_built_in_p (const_tree node
, built_in_class klass
)
6316 return fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
;
6319 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6320 of class KLASS with name equal to NAME. */
6323 fndecl_built_in_p (const_tree node
, unsigned int name
, built_in_class klass
)
6325 return (fndecl_built_in_p (node
, klass
)
6326 && DECL_UNCHECKED_FUNCTION_CODE (node
) == name
);
6329 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6330 of BUILT_IN_NORMAL class with name equal to NAME. */
6333 fndecl_built_in_p (const_tree node
, built_in_function name
)
6335 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
6336 && DECL_FUNCTION_CODE (node
) == name
);
6339 /* A struct for encapsulating location information about an operator
6340 and the operation built from it.
6342 m_operator_loc is the location of the operator
6343 m_combined_loc is the location of the compound expression.
6345 For example, given "a && b" the, operator location is:
6348 and the combined location is:
6351 Capturing this information allows for class binary_op_rich_location
6352 to provide detailed information about e.g. type mismatches in binary
6353 operations where enough location information is available:
6361 falling back to just showing the combined location:
6371 location_t m_operator_loc
;
6372 location_t m_combined_loc
;
6374 /* 1-argument ctor, for constructing from a combined location. */
6375 op_location_t (location_t combined_loc
)
6376 : m_operator_loc (UNKNOWN_LOCATION
), m_combined_loc (combined_loc
)
6379 /* 2-argument ctor, for distinguishing between the operator's location
6380 and the combined location. */
6381 op_location_t (location_t operator_loc
, location_t combined_loc
)
6382 : m_operator_loc (operator_loc
), m_combined_loc (combined_loc
)
6385 /* Implicitly convert back to a location_t, using the combined location. */
6386 operator location_t () const { return m_combined_loc
; }
6389 #endif /* GCC_TREE_H */