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 many boolean fields that all tree nodes have. */
630 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
631 of this is needed. So it cannot be in a register.
632 In a FUNCTION_DECL it has no meaning.
633 In LABEL_DECL nodes, it means a goto for this label has been seen
634 from a place outside all binding contours that restore stack levels.
635 In an artificial SSA_NAME that points to a stack partition with at least
636 two variables, it means that at least one variable has TREE_ADDRESSABLE.
637 In ..._TYPE nodes, it means that objects of this type must be fully
638 addressable. This means that pieces of this object cannot go into
639 register parameters, for example. If this a function type, this
640 means that the value must be returned in memory.
641 In CONSTRUCTOR nodes, it means object constructed must be in memory.
642 In IDENTIFIER_NODEs, this means that some extern decl for this name
643 had its address taken. That matters for inline functions.
644 In a STMT_EXPR, it means we want the result of the enclosed expression. */
645 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
647 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
648 exit of a function. Calls for which this is true are candidates for tail
649 call optimizations. */
650 #define CALL_EXPR_TAILCALL(NODE) \
651 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
653 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
654 optimization for correctness. */
655 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
656 (CALL_EXPR_CHECK (NODE)->base.static_flag)
658 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
659 CASE_LOW operand has been processed. */
660 #define CASE_LOW_SEEN(NODE) \
661 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
663 #define PREDICT_EXPR_OUTCOME(NODE) \
664 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
665 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
666 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
667 #define PREDICT_EXPR_PREDICTOR(NODE) \
668 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
670 /* In a VAR_DECL, nonzero means allocate static storage.
671 In a FUNCTION_DECL, nonzero if function has been defined.
672 In a CONSTRUCTOR, nonzero means allocate static storage. */
673 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
675 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
676 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
678 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
679 should only be executed if an exception is thrown, not on normal exit
681 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
683 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
684 separate cleanup in honor_protect_cleanup_actions. */
685 #define TRY_CATCH_IS_CLEANUP(NODE) \
686 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
688 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
689 CASE_HIGH operand has been processed. */
690 #define CASE_HIGH_SEEN(NODE) \
691 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
693 /* Used to mark scoped enums. */
694 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
696 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
697 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
699 /* In an expr node (usually a conversion) this means the node was made
700 implicitly and should not lead to any sort of warning. In a decl node,
701 warnings concerning the decl should be suppressed. This is used at
702 least for used-before-set warnings, and it set after one warning is
704 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
706 /* Nonzero if we should warn about the change in empty class parameter
707 passing ABI in this TU. */
708 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
709 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
711 /* Nonzero if this type is "empty" according to the particular psABI. */
712 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
714 /* Used to indicate that this TYPE represents a compiler-generated entity. */
715 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
717 /* True if the type is indivisible at the source level, i.e. if its
718 component parts cannot be accessed directly. This is used to suppress
719 normal GNU extensions for target-specific vector types. */
720 #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
722 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
723 this string as an argument. */
724 #define TREE_SYMBOL_REFERENCED(NODE) \
725 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
727 /* Nonzero in a pointer or reference type means the data pointed to
728 by this type can alias anything. */
729 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
730 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
732 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
733 there was an overflow in folding. */
735 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
737 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
739 #define TREE_OVERFLOW_P(EXPR) \
740 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
742 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
743 nonzero means name is to be accessible from outside this translation unit.
744 In an IDENTIFIER_NODE, nonzero means an external declaration
745 accessible from outside this translation unit was previously seen
746 for this name in an inner scope. */
747 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
749 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
750 of cached values, or is something else. */
751 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
753 /* In a SAVE_EXPR, indicates that the original expression has already
754 been substituted with a VAR_DECL that contains the value. */
755 #define SAVE_EXPR_RESOLVED_P(NODE) \
756 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
758 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
760 #define CALL_EXPR_VA_ARG_PACK(NODE) \
761 (CALL_EXPR_CHECK (NODE)->base.public_flag)
763 /* In any expression, decl, or constant, nonzero means it has side effects or
764 reevaluation of the whole expression could produce a different value.
765 This is set if any subexpression is a function call, a side effect or a
766 reference to a volatile variable. In a ..._DECL, this is set only if the
767 declaration said `volatile'. This will never be set for a constant. */
768 #define TREE_SIDE_EFFECTS(NODE) \
769 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
771 /* In a LABEL_DECL, nonzero means this label had its address taken
772 and therefore can never be deleted and is a jump target for
774 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
776 /* Whether a case or a user-defined label is allowed to fall through to.
777 This is used to implement -Wimplicit-fallthrough. */
778 #define FALLTHROUGH_LABEL_P(NODE) \
779 (LABEL_DECL_CHECK (NODE)->base.private_flag)
781 /* Set on the artificial label created for break; stmt from a switch.
782 This is used to implement -Wimplicit-fallthrough. */
783 #define SWITCH_BREAK_LABEL_P(NODE) \
784 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
786 /* Nonzero means this expression is volatile in the C sense:
787 its address should be of type `volatile WHATEVER *'.
788 In other words, the declared item is volatile qualified.
789 This is used in _DECL nodes and _REF nodes.
790 On a FUNCTION_DECL node, this means the function does not
791 return normally. This is the same effect as setting
792 the attribute noreturn on the function in C.
794 In a ..._TYPE node, means this type is volatile-qualified.
795 But use TYPE_VOLATILE instead of this macro when the node is a type,
796 because eventually we may make that a different bit.
798 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
799 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
801 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
802 accessing the memory pointed to won't generate a trap. However,
803 this only applies to an object when used appropriately: it doesn't
804 mean that writing a READONLY mem won't trap.
806 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
807 (or slice of the array) always belongs to the range of the array.
808 I.e. that the access will not trap, provided that the access to
809 the base to the array will not trap. */
810 #define TREE_THIS_NOTRAP(NODE) \
811 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
812 ARRAY_RANGE_REF)->base.nothrow_flag)
814 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
815 nonzero means it may not be the lhs of an assignment.
816 Nonzero in a FUNCTION_DECL means this function should be treated
817 as "const" function (can only read its arguments). */
818 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
820 /* Value of expression is constant. Always on in all ..._CST nodes. May
821 also appear in an expression or decl where the value is constant. */
822 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
824 /* Nonzero if NODE, a type, has had its sizes gimplified. */
825 #define TYPE_SIZES_GIMPLIFIED(NODE) \
826 (TYPE_CHECK (NODE)->base.constant_flag)
828 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
829 #define DECL_UNSIGNED(NODE) \
830 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
832 /* In integral and pointer types, means an unsigned type. */
833 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
835 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
836 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
838 /* True if overflow wraps around for the given integral or pointer type. That
839 is, TYPE_MAX + 1 == TYPE_MIN. */
840 #define TYPE_OVERFLOW_WRAPS(TYPE) \
841 (POINTER_TYPE_P (TYPE) \
842 ? flag_wrapv_pointer \
843 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
846 /* True if overflow is undefined for the given integral or pointer type.
847 We may optimize on the assumption that values in the type never overflow.
849 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
850 must issue a warning based on warn_strict_overflow. In some cases
851 it will be appropriate to issue the warning immediately, and in
852 other cases it will be appropriate to simply set a flag and let the
853 caller decide whether a warning is appropriate or not. */
854 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
855 (POINTER_TYPE_P (TYPE) \
856 ? !flag_wrapv_pointer \
857 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
858 && !flag_wrapv && !flag_trapv))
860 /* True if overflow for the given integral type should issue a
862 #define TYPE_OVERFLOW_TRAPS(TYPE) \
863 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
865 /* True if an overflow is to be preserved for sanitization. */
866 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
867 (INTEGRAL_TYPE_P (TYPE) \
868 && !TYPE_OVERFLOW_WRAPS (TYPE) \
869 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
871 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
872 Nonzero in a FUNCTION_DECL means that the function has been compiled.
873 This is interesting in an inline function, since it might not need
874 to be compiled separately.
875 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
876 or TYPE_DECL if the debugging info for the type has been written.
877 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
878 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
880 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
882 /* Nonzero in a _DECL if the name is used in its scope.
883 Nonzero in an expr node means inhibit warning if value is unused.
884 In IDENTIFIER_NODEs, this means that some extern decl for this name
886 In a BLOCK, this means that the block contains variables that are used. */
887 #define TREE_USED(NODE) ((NODE)->base.used_flag)
889 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
890 throw an exception. In a CALL_EXPR, nonzero means the call cannot
891 throw. We can't easily check the node type here as the C++
892 frontend also uses this flag (for AGGR_INIT_EXPR). */
893 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
895 /* In a CALL_EXPR, means that it's safe to use the target of the call
896 expansion as the return slot for a call that returns in memory. */
897 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
898 (CALL_EXPR_CHECK (NODE)->base.private_flag)
900 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
901 passed by invisible reference (and the TREE_TYPE is a pointer to the true
903 #define DECL_BY_REFERENCE(NODE) \
904 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
905 RESULT_DECL)->decl_common.decl_by_reference_flag)
907 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
909 #define DECL_READ_P(NODE) \
910 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
912 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
913 attempting to share the stack slot with some other variable. */
914 #define DECL_NONSHAREABLE(NODE) \
915 (TREE_CHECK2 (NODE, VAR_DECL, \
916 RESULT_DECL)->decl_common.decl_nonshareable_flag)
918 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
919 buggy callers don't pass to the callee. */
920 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
921 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
923 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
924 thunked-to function. */
925 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
927 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
928 it has been built for the declaration of a variable-sized object and, if the
929 function being called is BUILT_IN_MEMCPY, means that it has been built for
930 the assignment of a variable-sized object. */
931 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
932 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
934 /* Used in classes in C++. */
935 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
936 /* Used in classes in C++. */
937 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
939 /* True if reference type NODE is a C++ rvalue reference. */
940 #define TYPE_REF_IS_RVALUE(NODE) \
941 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
943 /* Nonzero in a _DECL if the use of the name is defined as a
944 deprecated feature by __attribute__((deprecated)). */
945 #define TREE_DEPRECATED(NODE) \
946 ((NODE)->base.deprecated_flag)
948 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
949 aggregate, (as created by anon_aggr_name_format). */
950 #define IDENTIFIER_ANON_P(NODE) \
951 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
953 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
954 uses are to be substituted for uses of the TREE_CHAINed identifier. */
955 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
956 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
958 /* In an aggregate type, indicates that the scalar fields of the type are
959 stored in reverse order from the target order. This effectively
960 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
961 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
962 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
964 /* In a non-aggregate type, indicates a saturating type. */
965 #define TYPE_SATURATING(NODE) \
966 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
968 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
969 of bits stored in reverse order from the target order. This effectively
970 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
972 The overall strategy is to preserve the invariant that every scalar in
973 memory is associated with a single storage order, i.e. all accesses to
974 this scalar are done with the same storage order. This invariant makes
975 it possible to factor out the storage order in most transformations, as
976 only the address and/or the value (in target order) matter for them.
977 But, of course, the storage order must be preserved when the accesses
978 themselves are rewritten or transformed. */
979 #define REF_REVERSE_STORAGE_ORDER(NODE) \
980 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
982 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
983 represented by a descriptor instead of a trampoline. */
984 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
985 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
987 /* In a CALL_EXPR, indicates that this is an indirect call for which
988 pointers to nested function are descriptors instead of trampolines. */
989 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
990 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
992 /* These flags are available for each language front end to use internally. */
993 #define TREE_LANG_FLAG_0(NODE) \
994 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
995 #define TREE_LANG_FLAG_1(NODE) \
996 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
997 #define TREE_LANG_FLAG_2(NODE) \
998 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
999 #define TREE_LANG_FLAG_3(NODE) \
1000 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1001 #define TREE_LANG_FLAG_4(NODE) \
1002 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1003 #define TREE_LANG_FLAG_5(NODE) \
1004 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1005 #define TREE_LANG_FLAG_6(NODE) \
1006 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1008 /* Define additional fields and accessors for nodes representing constants. */
1010 #define TREE_INT_CST_NUNITS(NODE) \
1011 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1012 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1013 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1014 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1015 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1016 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1017 #define TREE_INT_CST_LOW(NODE) \
1018 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1020 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1021 targets with variable-sized modes. */
1022 #define POLY_INT_CST_P(NODE) \
1023 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1025 /* In a POLY_INT_CST node. */
1026 #define POLY_INT_CST_COEFF(NODE, I) \
1027 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1029 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1030 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1032 #define TREE_FIXED_CST_PTR(NODE) \
1033 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1034 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1036 /* In a STRING_CST */
1037 /* In C terms, this is sizeof, not strlen. */
1038 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1039 #define TREE_STRING_POINTER(NODE) \
1040 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1042 /* In a COMPLEX_CST node. */
1043 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1044 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1046 /* In a VECTOR_CST node. See generic.texi for details. */
1047 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1048 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1050 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1051 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1052 #define VECTOR_CST_NPATTERNS(NODE) \
1053 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1054 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1055 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1056 #define VECTOR_CST_DUPLICATE_P(NODE) \
1057 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1058 #define VECTOR_CST_STEPPED_P(NODE) \
1059 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1060 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1061 (VECTOR_CST_CHECK (NODE)->vector.elts)
1062 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1063 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1065 /* Define fields and accessors for some special-purpose tree nodes. */
1067 #define IDENTIFIER_LENGTH(NODE) \
1068 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1069 #define IDENTIFIER_POINTER(NODE) \
1070 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1071 #define IDENTIFIER_HASH_VALUE(NODE) \
1072 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1074 /* Translate a hash table identifier pointer to a tree_identifier
1075 pointer, and vice versa. */
1077 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1078 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1079 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1081 /* In a TREE_LIST node. */
1082 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1083 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1085 /* In a TREE_VEC node. */
1086 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1087 #define TREE_VEC_END(NODE) \
1088 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1090 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1092 /* In a CONSTRUCTOR node. */
1093 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1094 #define CONSTRUCTOR_ELT(NODE,IDX) \
1095 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1096 #define CONSTRUCTOR_NELTS(NODE) \
1097 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1098 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1099 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1101 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1102 value of each element (stored within VAL). IX must be a scratch variable
1103 of unsigned integer type. */
1104 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1105 for (IX = 0; (IX >= vec_safe_length (V)) \
1107 : ((VAL = (*(V))[IX].value), \
1111 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1112 the value of each element (stored within VAL) and its index (stored
1113 within INDEX). IX must be a scratch variable of unsigned integer type. */
1114 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1115 for (IX = 0; (IX >= vec_safe_length (V)) \
1117 : (((void) (VAL = (*V)[IX].value)), \
1118 (INDEX = (*V)[IX].index), \
1122 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1123 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1125 constructor_elt _ce___ = {INDEX, VALUE}; \
1126 vec_safe_push ((V), _ce___); \
1129 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1130 constructor output purposes. */
1131 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1132 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1134 /* True if NODE is a clobber right hand side, an expression of indeterminate
1135 value that clobbers the LHS in a copy instruction. We use a volatile
1136 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1137 In particular the volatile flag causes us to not prematurely remove
1138 such clobber instructions. */
1139 #define TREE_CLOBBER_P(NODE) \
1140 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1142 /* Define fields and accessors for some nodes that represent expressions. */
1144 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1145 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1146 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1147 && integer_zerop (TREE_OPERAND (NODE, 0)))
1149 /* In ordinary expression nodes. */
1150 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1151 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1153 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1154 length. Its value includes the length operand itself; that is,
1155 the minimum valid length is 1.
1156 Note that we have to bypass the use of TREE_OPERAND to access
1157 that field to avoid infinite recursion in expanding the macros. */
1158 #define VL_EXP_OPERAND_LENGTH(NODE) \
1159 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1161 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1162 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1163 /* Nonzero if gimple_debug_bind_p() (and thus
1164 gimple_debug_source_bind_p()) may possibly hold. */
1165 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1166 /* Nonzero if is_gimple_debug() may possibly hold. */
1167 #define MAY_HAVE_DEBUG_STMTS \
1168 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1170 /* In a LOOP_EXPR node. */
1171 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1173 /* The source location of this expression. Non-tree_exp nodes such as
1174 decls and constants can be shared among multiple locations, so
1176 #define EXPR_LOCATION(NODE) \
1177 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1178 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1179 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1180 != UNKNOWN_LOCATION)
1181 /* The location to be used in a diagnostic about this expression. Do not
1182 use this macro if the location will be assigned to other expressions. */
1183 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1184 ? (NODE)->exp.locus : (LOCUS))
1185 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1186 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1188 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1189 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1191 #define EXPR_HAS_RANGE(NODE) \
1192 (CAN_HAVE_RANGE_P (NODE) \
1193 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1196 /* True if a tree is an expression or statement that can have a
1198 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1200 static inline source_range
1201 get_expr_source_range (tree expr
)
1203 location_t loc
= EXPR_LOCATION (expr
);
1204 return get_range_from_loc (line_table
, loc
);
1207 extern void protected_set_expr_location (tree
, location_t
);
1208 extern void protected_set_expr_location_if_unset (tree
, location_t
);
1210 extern tree
maybe_wrap_with_location (tree
, location_t
);
1212 extern int suppress_location_wrappers
;
1214 /* A class for suppressing the creation of location wrappers.
1215 Location wrappers will not be created during the lifetime
1216 of an instance of this class. */
1218 class auto_suppress_location_wrappers
1221 auto_suppress_location_wrappers () { ++suppress_location_wrappers
; }
1222 ~auto_suppress_location_wrappers () { --suppress_location_wrappers
; }
1225 /* In a TARGET_EXPR node. */
1226 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1227 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1228 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1229 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1230 on rhs of MODIFY_EXPR. */
1231 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1233 /* DECL_EXPR accessor. This gives access to the DECL associated with
1234 the given declaration statement. */
1235 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1237 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1239 /* COMPOUND_LITERAL_EXPR accessors. */
1240 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1241 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1242 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1243 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1245 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1246 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1247 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1248 /* True if there are case labels for all possible values of SWITCH_COND, either
1249 because there is a default: case label or because the case label ranges cover
1251 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1253 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1254 of a case label, respectively. */
1255 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1256 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1257 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1258 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1260 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1261 corresponding MEM_REF operands. */
1262 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1263 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1264 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1265 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1266 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1268 #define MR_DEPENDENCE_CLIQUE(NODE) \
1269 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1270 #define MR_DEPENDENCE_BASE(NODE) \
1271 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1273 /* The operands of a BIND_EXPR. */
1274 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1275 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1276 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1278 /* GOTO_EXPR accessor. This gives access to the label associated with
1279 a goto statement. */
1280 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1282 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1283 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1284 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1286 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1287 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1288 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1289 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1290 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1291 /* Nonzero if we want to create an ASM_INPUT instead of an
1292 ASM_OPERAND with no operands. */
1293 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1294 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1295 /* Nonzero if we want to consider this asm as minimum length and cost
1296 for inlining decisions. */
1297 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1299 /* COND_EXPR accessors. */
1300 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1301 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1302 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1304 /* Accessors for the chains of recurrences. */
1305 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1306 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1307 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1309 /* LABEL_EXPR accessor. This gives access to the label associated with
1310 the given label expression. */
1311 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1313 /* CATCH_EXPR accessors. */
1314 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1315 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1317 /* EH_FILTER_EXPR accessors. */
1318 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1319 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1321 /* OBJ_TYPE_REF accessors. */
1322 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1323 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1324 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1326 /* ASSERT_EXPR accessors. */
1327 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1328 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1330 /* CALL_EXPR accessors. */
1331 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1332 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1333 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1334 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1335 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1337 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1338 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1339 the argument count is zero when checking is enabled. Instead, do
1340 the pointer arithmetic to advance past the 3 fixed operands in a
1341 CALL_EXPR. That produces a valid pointer to just past the end of the
1342 operand array, even if it's not valid to dereference it. */
1343 #define CALL_EXPR_ARGP(NODE) \
1344 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1346 /* TM directives and accessors. */
1347 #define TRANSACTION_EXPR_BODY(NODE) \
1348 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1349 #define TRANSACTION_EXPR_OUTER(NODE) \
1350 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1351 #define TRANSACTION_EXPR_RELAXED(NODE) \
1352 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1354 /* OpenMP and OpenACC directive and clause accessors. */
1356 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1358 #define OMP_BODY(NODE) \
1359 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1360 #define OMP_CLAUSES(NODE) \
1361 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1363 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1364 #define OMP_STANDALONE_CLAUSES(NODE) \
1365 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1367 #define OACC_DATA_BODY(NODE) \
1368 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1369 #define OACC_DATA_CLAUSES(NODE) \
1370 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1372 #define OACC_HOST_DATA_BODY(NODE) \
1373 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1374 #define OACC_HOST_DATA_CLAUSES(NODE) \
1375 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1377 #define OACC_CACHE_CLAUSES(NODE) \
1378 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1380 #define OACC_DECLARE_CLAUSES(NODE) \
1381 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1383 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1384 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1386 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1387 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1389 #define OACC_UPDATE_CLAUSES(NODE) \
1390 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1392 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1393 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1395 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1396 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1398 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1399 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1400 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1402 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1403 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1404 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1405 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1406 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1407 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1408 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1409 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1411 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1412 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1414 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1416 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1417 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1419 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1421 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1422 #define OMP_TASKGROUP_CLAUSES(NODE) \
1423 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1425 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1426 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1428 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1429 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1430 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1432 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1433 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1435 #define OMP_TARGET_DATA_BODY(NODE) \
1436 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1437 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1438 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1440 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1441 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1443 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1444 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1446 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1447 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1449 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1450 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1452 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1453 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1455 #define OMP_CLAUSE_SIZE(NODE) \
1456 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1458 OMP_CLAUSE__CACHE_), 1)
1460 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1461 #define OMP_CLAUSE_DECL(NODE) \
1462 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1463 OMP_CLAUSE_PRIVATE, \
1464 OMP_CLAUSE__SCANTEMP_), 0)
1465 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1466 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1467 != UNKNOWN_LOCATION)
1468 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1470 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1471 is non-rectangular. */
1472 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1473 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1475 /* True on an OMP_SECTION statement that was the last lexical member.
1476 This status is meaningful in the implementation of lastprivate. */
1477 #define OMP_SECTION_LAST(NODE) \
1478 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1480 /* True on an OMP_PARALLEL statement if it represents an explicit
1481 combined parallel work-sharing constructs. */
1482 #define OMP_PARALLEL_COMBINED(NODE) \
1483 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1485 /* True on an OMP_TEAMS statement if it represents an explicit
1486 combined teams distribute constructs. */
1487 #define OMP_TEAMS_COMBINED(NODE) \
1488 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1490 /* True on an OMP_TARGET statement if it represents explicit
1491 combined target teams, target parallel or target simd constructs. */
1492 #define OMP_TARGET_COMBINED(NODE) \
1493 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1495 /* Memory order for OMP_ATOMIC*. */
1496 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1497 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1498 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1500 /* True on a PRIVATE clause if its decl is kept around for debugging
1501 information only and its DECL_VALUE_EXPR is supposed to point
1502 to what it has been remapped to. */
1503 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1504 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1506 /* True on a PRIVATE clause if ctor needs access to outer region's
1508 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1509 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1511 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1512 (thus should be private on the outer taskloop and firstprivate on
1514 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1515 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1517 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1518 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1519 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1521 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1522 to should be firstprivatized. */
1523 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1524 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1526 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1527 decl is present in the chain. */
1528 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1529 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1530 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1531 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1532 OMP_CLAUSE_LASTPRIVATE),\
1534 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1535 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1537 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1538 loop construct (thus should be lastprivate on the outer taskloop and
1539 firstprivate on task for the taskloop construct and carefully handled
1540 for loop construct). */
1541 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1542 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1544 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1545 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1546 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1548 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1549 decl is present in the chain (this can happen only for taskloop
1550 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1551 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1552 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1554 /* True on a SHARED clause if a scalar is not modified in the body and
1555 thus could be optimized as firstprivate. */
1556 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1557 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1559 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1560 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1562 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1563 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1564 #define OMP_CLAUSE_IF_EXPR(NODE) \
1565 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1566 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1567 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1568 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1569 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1570 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1571 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1572 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1573 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1575 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1576 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1578 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1579 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1581 /* OpenACC clause expressions */
1582 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1583 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1584 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1585 OMP_CLAUSE_OPERAND ( \
1586 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1587 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1588 OMP_CLAUSE_OPERAND ( \
1589 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1590 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1591 OMP_CLAUSE_OPERAND ( \
1592 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1593 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1594 OMP_CLAUSE_OPERAND ( \
1595 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1596 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1597 OMP_CLAUSE_OPERAND ( \
1598 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1599 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1600 OMP_CLAUSE_OPERAND ( \
1601 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1602 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1603 OMP_CLAUSE_OPERAND ( \
1604 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1605 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1606 OMP_CLAUSE_OPERAND ( \
1607 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1608 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1609 OMP_CLAUSE_OPERAND ( \
1610 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1612 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1613 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1615 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1616 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1618 #define OMP_CLAUSE_MAP_KIND(NODE) \
1619 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1620 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1621 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1622 = (unsigned int) (MAP_KIND))
1624 /* Nonzero if this map clause is for array (rather than pointer) based array
1625 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1626 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1627 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1628 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1629 /* Nonzero if this is a mapped array section, that might need special
1630 treatment if OMP_CLAUSE_SIZE is zero. */
1631 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1632 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1633 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1635 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1636 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1638 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1640 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1641 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1643 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1644 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1646 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1647 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1649 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1650 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1651 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1652 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1653 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1654 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1656 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1657 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1659 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1660 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1661 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1662 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1663 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1664 OMP_CLAUSE_IN_REDUCTION), 1)
1665 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1666 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1667 OMP_CLAUSE_IN_REDUCTION), 2)
1668 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1669 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1670 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1671 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1672 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1673 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1674 OMP_CLAUSE_IN_REDUCTION), 3)
1675 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1676 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1677 OMP_CLAUSE_IN_REDUCTION), 4)
1679 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1680 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1681 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1682 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1683 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1685 /* True if a REDUCTION clause has task reduction-modifier. */
1686 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1687 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1689 /* True if a REDUCTION clause has inscan reduction-modifier. */
1690 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1691 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1693 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1694 are always initialized inside of the loop construct, false otherwise. */
1695 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1696 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1698 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1699 are declared inside of the simd construct. */
1700 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1701 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1703 /* True if a LINEAR clause has a stride that is variable. */
1704 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1705 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1707 /* True if a LINEAR clause is for an array or allocatable variable that
1708 needs special handling by the frontend. */
1709 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1710 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1712 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1713 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1715 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1716 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1718 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1719 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1721 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1722 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1724 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1725 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1727 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1728 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1730 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1731 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1732 OMP_CLAUSE_THREAD_LIMIT), 0)
1734 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1735 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1737 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1739 OMP_CLAUSE_DIST_SCHEDULE), 0)
1741 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1742 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1744 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1745 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1747 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1750 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1751 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1753 /* True if a SCHEDULE clause has the simd modifier on it. */
1754 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1755 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1757 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1758 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1760 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1761 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1762 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1763 ((enum omp_clause_defaultmap_kind) \
1764 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1765 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1766 ((enum omp_clause_defaultmap_kind) \
1767 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1768 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1769 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1770 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1772 #define OMP_CLAUSE_BIND_KIND(NODE) \
1773 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
1775 #define OMP_CLAUSE_TILE_LIST(NODE) \
1776 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1777 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1778 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1779 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1780 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1782 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1783 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1784 ->omp_clause.subcode.dimension)
1785 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1786 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1787 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1788 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1790 /* _CONDTEMP_ holding temporary with iteration count. */
1791 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
1792 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
1794 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
1796 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
1797 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
1799 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
1800 one boolean_type_node for test whether alloca was used, another one
1801 to pass to __builtin_stack_restore or free. */
1802 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
1803 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
1805 /* SSA_NAME accessors. */
1807 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1808 information in the underlying SSA_NAME_VAR for efficiency. */
1809 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1810 SSA_NAME_CHECK (NODE)->base.public_flag
1812 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1813 if there is no name associated with it. */
1814 #define SSA_NAME_IDENTIFIER(NODE) \
1815 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1816 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1817 ? (NODE)->ssa_name.var \
1818 : DECL_NAME ((NODE)->ssa_name.var)) \
1821 /* Returns the variable being referenced. This can be NULL_TREE for
1822 temporaries not associated with any user variable.
1823 Once released, this is the only field that can be relied upon. */
1824 #define SSA_NAME_VAR(NODE) \
1825 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1826 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1827 ? NULL_TREE : (NODE)->ssa_name.var)
1829 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1832 tree var_ = (VAR); \
1833 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1834 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1836 && TREE_CODE (var_) == VAR_DECL \
1837 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1841 /* Returns the statement which defines this SSA name. */
1842 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1844 /* Returns the SSA version number of this SSA name. Note that in
1845 tree SSA, version numbers are not per variable and may be recycled. */
1846 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1848 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1849 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1851 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1852 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1854 /* Nonzero if this SSA_NAME expression is currently on the free list of
1855 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1856 has no meaning for an SSA_NAME. */
1857 #define SSA_NAME_IN_FREE_LIST(NODE) \
1858 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1860 /* Nonzero if this SSA_NAME is the default definition for the
1861 underlying symbol. A default SSA name is created for symbol S if
1862 the very first reference to S in the function is a read operation.
1863 Default definitions are always created by an empty statement and
1864 belong to no basic block. */
1865 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1866 SSA_NAME_CHECK (NODE)->base.default_def_flag
1868 /* Nonzero if this SSA_NAME is known to point to memory that may not
1869 be written to. This is set for default defs of function parameters
1870 that have a corresponding r or R specification in the functions
1871 fn spec attribute. This is used by alias analysis. */
1872 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1873 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1875 /* Attributes for SSA_NAMEs for pointer-type variables. */
1876 #define SSA_NAME_PTR_INFO(N) \
1877 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1879 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1880 #define SSA_NAME_ANTI_RANGE_P(N) \
1881 SSA_NAME_CHECK (N)->base.static_flag
1883 /* The type of range described by SSA_NAME_RANGE_INFO. */
1884 #define SSA_NAME_RANGE_TYPE(N) \
1885 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1887 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1888 #define SSA_NAME_RANGE_INFO(N) \
1889 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1891 /* Return the immediate_use information for an SSA_NAME. */
1892 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1894 #define OMP_CLAUSE_CODE(NODE) \
1895 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1897 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1898 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1900 #define OMP_CLAUSE_OPERAND(NODE, I) \
1901 OMP_CLAUSE_ELT_CHECK (NODE, I)
1903 /* In a BLOCK node. */
1904 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1905 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1906 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1907 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1908 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1909 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1910 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1911 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1912 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1913 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1914 #define BLOCK_ORIGIN(NODE) \
1915 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
1916 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1918 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1919 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1921 /* True if BLOCK appears in cold section. */
1922 #define BLOCK_IN_COLD_SECTION_P(NODE) \
1923 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
1925 /* An index number for this block. These values are not guaranteed to
1926 be unique across functions -- whether or not they are depends on
1927 the debugging output format in use. */
1928 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1930 /* If block reordering splits a lexical block into discontiguous
1931 address ranges, we'll make a copy of the original block.
1933 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1934 In that case, we have one source block that has been replicated
1935 (through inlining or unrolling) into many logical blocks, and that
1936 these logical blocks have different physical variables in them.
1938 In this case, we have one logical block split into several
1939 non-contiguous address ranges. Most debug formats can't actually
1940 represent this idea directly, so we fake it by creating multiple
1941 logical blocks with the same variables in them. However, for those
1942 that do support non-contiguous regions, these allow the original
1943 logical block to be reconstructed, along with the set of address
1946 One of the logical block fragments is arbitrarily chosen to be
1947 the ORIGIN. The other fragments will point to the origin via
1948 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1949 be null. The list of fragments will be chained through
1950 BLOCK_FRAGMENT_CHAIN from the origin. */
1952 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1953 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1955 /* For an inlined function, this gives the location where it was called
1956 from. This is only set in the top level block, which corresponds to the
1957 inlined function scope. This is used in the debug output routines. */
1959 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1961 /* This gives the location of the end of the block, useful to attach
1962 code implicitly generated for outgoing paths. */
1964 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1966 /* Define fields and accessors for nodes representing data types. */
1968 /* See tree.def for documentation of the use of these fields.
1969 Look at the documentation of the various ..._TYPE tree codes.
1971 Note that the type.values, type.minval, and type.maxval fields are
1972 overloaded and used for different macros in different kinds of types.
1973 Each macro must check to ensure the tree node is of the proper kind of
1974 type. Note also that some of the front-ends also overload these fields,
1975 so they must be checked as well. */
1977 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1978 /* Type size in bits as a tree expression. Need not be constant
1980 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1981 /* Likewise, type size in bytes. */
1982 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1983 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1984 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1985 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1986 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1987 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1988 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1989 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1991 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1992 #define TYPE_MODE(NODE) \
1993 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1994 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1995 #define SCALAR_TYPE_MODE(NODE) \
1996 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
1997 #define SCALAR_INT_TYPE_MODE(NODE) \
1998 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
1999 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2000 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2001 #define SET_TYPE_MODE(NODE, MODE) \
2002 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2004 extern machine_mode
element_mode (const_tree
);
2005 extern machine_mode
vector_type_mode (const_tree
);
2006 extern unsigned int vector_element_bits (const_tree
);
2007 extern tree
vector_element_bits_tree (const_tree
);
2009 /* The "canonical" type for this type node, which is used by frontends to
2010 compare the type for equality with another type. If two types are
2011 equal (based on the semantics of the language), then they will have
2012 equivalent TYPE_CANONICAL entries.
2014 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2015 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2016 be used for comparison against other types. Instead, the type is
2017 said to require structural equality checks, described in
2018 TYPE_STRUCTURAL_EQUALITY_P.
2020 For unqualified aggregate and function types the middle-end relies on
2021 TYPE_CANONICAL to tell whether two variables can be assigned
2022 to each other without a conversion. The middle-end also makes sure
2023 to assign the same alias-sets to the type partition with equal
2024 TYPE_CANONICAL of their unqualified variants. */
2025 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2026 /* Indicates that the type node requires structural equality
2027 checks. The compiler will need to look at the composition of the
2028 type to determine whether it is equal to another type, rather than
2029 just comparing canonical type pointers. For instance, we would need
2030 to look at the return and parameter types of a FUNCTION_TYPE
2032 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2033 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2034 type node requires structural equality. */
2035 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2037 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2038 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2040 /* The (language-specific) typed-based alias set for this type.
2041 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2042 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2043 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2044 type can alias objects of any type. */
2045 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2047 /* Nonzero iff the typed-based alias set for this type has been
2049 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2050 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2052 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2054 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2056 /* The alignment necessary for objects of this type.
2057 The value is an int, measured in bits and must be a power of two.
2058 We support also an "alignment" of zero. */
2059 #define TYPE_ALIGN(NODE) \
2060 (TYPE_CHECK (NODE)->type_common.align \
2061 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
2063 /* Specify that TYPE_ALIGN(NODE) is X. */
2064 #define SET_TYPE_ALIGN(NODE, X) \
2065 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2067 /* 1 if the alignment for this type was requested by "aligned" attribute,
2068 0 if it is the default for this type. */
2069 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2071 /* The alignment for NODE, in bytes. */
2072 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2074 /* The minimum alignment necessary for objects of this type without
2075 warning. The value is an int, measured in bits. */
2076 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2077 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2078 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2080 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2081 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2082 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2084 /* If your language allows you to declare types, and you want debug info
2085 for them, then you need to generate corresponding TYPE_DECL nodes.
2086 These "stub" TYPE_DECL nodes have no name, and simply point at the
2087 type node. You then set the TYPE_STUB_DECL field of the type node
2088 to point back at the TYPE_DECL node. This allows the debug routines
2089 to know that the two nodes represent the same type, so that we only
2090 get one debug info record for them. */
2091 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2093 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2094 the type has BLKmode only because it lacks the alignment required for
2096 #define TYPE_NO_FORCE_BLK(NODE) \
2097 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2099 /* Nonzero in a type considered volatile as a whole. */
2100 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2102 /* Nonzero in a type considered atomic as a whole. */
2103 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2105 /* Means this type is const-qualified. */
2106 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2108 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2110 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2112 /* If nonzero, type's name shouldn't be emitted into debug info. */
2113 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2115 /* The address space the type is in. */
2116 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2118 /* Encode/decode the named memory support as part of the qualifier. If more
2119 than 8 qualifiers are added, these macros need to be adjusted. */
2120 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2121 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2123 /* Return all qualifiers except for the address space qualifiers. */
2124 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2126 /* Only keep the address space out of the qualifiers and discard the other
2128 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2130 /* The set of type qualifiers for this type. */
2131 #define TYPE_QUALS(NODE) \
2132 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2133 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2134 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2135 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2136 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2138 /* The same as TYPE_QUALS without the address space qualifications. */
2139 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2140 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2141 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2142 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2143 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2145 /* The same as TYPE_QUALS without the address space and atomic
2147 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2148 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2149 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2150 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2152 /* These flags are available for each language front end to use internally. */
2153 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2154 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2155 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2156 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2157 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2158 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2159 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2160 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2162 /* Used to keep track of visited nodes in tree traversals. This is set to
2163 0 by copy_node and make_node. */
2164 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2166 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2167 that distinguish string from array of char).
2168 If set in a INTEGER_TYPE, indicates a character type. */
2169 #define TYPE_STRING_FLAG(NODE) \
2170 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2172 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2173 to the C++ one definition rule. This is used for LTO canonical type
2175 #define TYPE_CXX_ODR_P(NODE) \
2176 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2178 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2179 about missing conversions to other vector types of the same size. */
2180 #define TYPE_VECTOR_OPAQUE(NODE) \
2181 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2183 /* Indicates that objects of this type must be initialized by calling a
2184 function when they are created. */
2185 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2186 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2188 /* Indicates that a UNION_TYPE object should be passed the same way that
2189 the first union alternative would be passed, or that a RECORD_TYPE
2190 object should be passed the same way that the first (and only) member
2192 #define TYPE_TRANSPARENT_AGGR(NODE) \
2193 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2195 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2196 address of a component of the type. This is the counterpart of
2197 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2198 #define TYPE_NONALIASED_COMPONENT(NODE) \
2199 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2201 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2202 whether the array is typeless storage or the type contains a member
2203 with this flag set. Such types are exempt from type-based alias
2204 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2205 the flag should be inherited from the element type, can change
2206 when type is finalized and because of that should not be used in
2207 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2208 the flag should not be changed after the array is created and should
2209 be used in type hashing. */
2210 #define TYPE_TYPELESS_STORAGE(NODE) \
2211 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2212 ARRAY_TYPE)->type_common.typeless_storage)
2214 /* Indicated that objects of this type should be laid out in as
2215 compact a way as possible. */
2216 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2218 /* Used by type_contains_placeholder_p to avoid recomputation.
2219 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2220 this field directly. */
2221 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2222 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2224 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2225 #define TYPE_FINAL_P(NODE) \
2226 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2228 /* The debug output functions use the symtab union field to store
2229 information specific to the debugging format. The different debug
2230 output hooks store different types in the union field. These three
2231 macros are used to access different fields in the union. The debug
2232 hooks are responsible for consistently using only a specific
2235 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2236 hold the type's number in the generated stabs. */
2237 #define TYPE_SYMTAB_ADDRESS(NODE) \
2238 (TYPE_CHECK (NODE)->type_common.symtab.address)
2240 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2241 in dwarf2out.c to point to the DIE generated for the type. */
2242 #define TYPE_SYMTAB_DIE(NODE) \
2243 (TYPE_CHECK (NODE)->type_common.symtab.die)
2245 /* The garbage collector needs to know the interpretation of the
2246 symtab field. These constants represent the different types in the
2249 #define TYPE_SYMTAB_IS_ADDRESS (0)
2250 #define TYPE_SYMTAB_IS_DIE (1)
2252 #define TYPE_LANG_SPECIFIC(NODE) \
2253 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2255 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2256 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2257 #define TYPE_FIELDS(NODE) \
2258 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2259 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2260 #define TYPE_ARG_TYPES(NODE) \
2261 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2262 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2264 #define TYPE_MIN_VALUE(NODE) \
2265 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2266 #define TYPE_NEXT_PTR_TO(NODE) \
2267 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2268 #define TYPE_NEXT_REF_TO(NODE) \
2269 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2270 #define TYPE_VFIELD(NODE) \
2271 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2272 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2274 #define TYPE_MAX_VALUE(NODE) \
2275 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2276 #define TYPE_METHOD_BASETYPE(NODE) \
2277 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2278 #define TYPE_OFFSET_BASETYPE(NODE) \
2279 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2280 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2281 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2283 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2284 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2285 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2286 /* For record and union types, information about this type, as a base type
2288 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2290 /* For types, used in a language-dependent way. */
2291 #define TYPE_LANG_SLOT_1(NODE) \
2292 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2294 /* Define accessor macros for information about type inheritance
2297 A "basetype" means a particular usage of a data type for inheritance
2298 in another type. Each such basetype usage has its own "binfo"
2299 object to describe it. The binfo object is a TREE_VEC node.
2301 Inheritance is represented by the binfo nodes allocated for a
2302 given type. For example, given types C and D, such that D is
2303 inherited by C, 3 binfo nodes will be allocated: one for describing
2304 the binfo properties of C, similarly one for D, and one for
2305 describing the binfo properties of D as a base type for C.
2306 Thus, given a pointer to class C, one can get a pointer to the binfo
2307 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2309 /* BINFO specific flags. */
2311 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2312 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2314 /* Flags for language dependent use. */
2315 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2316 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2317 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2318 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2319 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2320 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2321 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2323 /* The actual data type node being inherited in this basetype. */
2324 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2326 /* The offset where this basetype appears in its containing type.
2327 BINFO_OFFSET slot holds the offset (in bytes)
2328 from the base of the complete object to the base of the part of the
2329 object that is allocated on behalf of this `type'.
2330 This is always 0 except when there is multiple inheritance. */
2332 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2333 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2335 /* The virtual function table belonging to this basetype. Virtual
2336 function tables provide a mechanism for run-time method dispatching.
2337 The entries of a virtual function table are language-dependent. */
2339 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2341 /* The virtual functions in the virtual function table. This is
2342 a TREE_LIST that is used as an initial approximation for building
2343 a virtual function table for this basetype. */
2344 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2346 /* A vector of binfos for the direct basetypes inherited by this
2349 If this basetype describes type D as inherited in C, and if the
2350 basetypes of D are E and F, then this vector contains binfos for
2351 inheritance of E and F by C. */
2352 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2354 /* The number of basetypes for NODE. */
2355 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2357 /* Accessor macro to get to the Nth base binfo of this binfo. */
2358 #define BINFO_BASE_BINFO(NODE,N) \
2359 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2360 #define BINFO_BASE_ITERATE(NODE,N,B) \
2361 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2362 #define BINFO_BASE_APPEND(NODE,T) \
2363 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2365 /* For a BINFO record describing a virtual base class, i.e., one where
2366 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2367 base. The actual contents are language-dependent. In the C++
2368 front-end this field is an INTEGER_CST giving an offset into the
2369 vtable where the offset to the virtual base can be found. */
2370 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2372 /* Indicates the accesses this binfo has to its bases. The values are
2373 access_public_node, access_protected_node or access_private_node.
2374 If this array is not present, public access is implied. */
2375 #define BINFO_BASE_ACCESSES(NODE) \
2376 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2378 #define BINFO_BASE_ACCESS(NODE,N) \
2379 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2380 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2381 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2383 /* The index in the VTT where this subobject's sub-VTT can be found.
2384 NULL_TREE if there is no sub-VTT. */
2385 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2387 /* The index in the VTT where the vptr for this subobject can be
2388 found. NULL_TREE if there is no secondary vptr in the VTT. */
2389 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2391 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2392 inheriting this base for non-virtual bases. For virtual bases it
2393 points either to the binfo for which this is a primary binfo, or to
2394 the binfo of the most derived type. */
2395 #define BINFO_INHERITANCE_CHAIN(NODE) \
2396 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2399 /* Define fields and accessors for nodes representing declared names. */
2401 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2402 have an associated SSA name. */
2403 #define SSA_VAR_P(DECL) \
2404 (TREE_CODE (DECL) == VAR_DECL \
2405 || TREE_CODE (DECL) == PARM_DECL \
2406 || TREE_CODE (DECL) == RESULT_DECL \
2407 || TREE_CODE (DECL) == SSA_NAME)
2410 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2412 /* This is the name of the object as written by the user.
2413 It is an IDENTIFIER_NODE. */
2414 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2416 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2417 #define TYPE_IDENTIFIER(NODE) \
2418 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2419 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2421 /* Every ..._DECL node gets a unique number. */
2422 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2424 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2426 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2428 /* Every ..._DECL node gets a unique number that stays the same even
2429 when the decl is copied by the inliner once it is set. */
2430 #define DECL_PT_UID(NODE) \
2431 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2432 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2433 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2434 #define SET_DECL_PT_UID(NODE, UID) \
2435 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2436 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2437 be preserved when copyin the decl. */
2438 #define DECL_PT_UID_SET_P(NODE) \
2439 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2441 /* These two fields describe where in the source code the declaration
2442 was. If the declaration appears in several places (as for a C
2443 function that is declared first and then defined later), this
2444 information should refer to the definition. */
2445 #define DECL_SOURCE_LOCATION(NODE) \
2446 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2447 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2448 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2449 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2450 /* This accessor returns TRUE if the decl it operates on was created
2451 by a front-end or back-end rather than by user code. In this case
2452 builtin-ness is indicated by source location. */
2453 #define DECL_IS_BUILTIN(DECL) \
2454 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2456 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2457 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2458 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2459 nodes, this points to either the FUNCTION_DECL for the containing
2460 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2461 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2462 scope". In particular, for VAR_DECLs which are virtual table pointers
2463 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2465 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2466 #define DECL_FIELD_CONTEXT(NODE) \
2467 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2469 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2470 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2472 /* For any sort of a ..._DECL node, this points to the original (abstract)
2473 decl node which this decl is an inlined/cloned instance of, or else it
2474 is NULL indicating that this decl is not an instance of some other decl.
2476 The C front-end also uses this in a nested declaration of an inline
2477 function, to point back to the definition. */
2478 #define DECL_ABSTRACT_ORIGIN(NODE) \
2479 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2481 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2482 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2483 #define DECL_ORIGIN(NODE) \
2484 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2486 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2487 inline instance of some original (abstract) decl from an inline function;
2488 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2489 nodes can also have their abstract origin set to themselves. */
2490 #define DECL_FROM_INLINE(NODE) \
2491 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2492 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2494 /* In a DECL this is the field where attributes are stored. */
2495 #define DECL_ATTRIBUTES(NODE) \
2496 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2498 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2499 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2500 For a VAR_DECL, holds the initial value.
2501 For a PARM_DECL, used for DECL_ARG_TYPE--default
2502 values for parameters are encoded in the type of the function,
2503 not in the PARM_DECL slot.
2504 For a FIELD_DECL, this is used for enumeration values and the C
2505 frontend uses it for temporarily storing bitwidth of bitfields.
2507 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2508 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2510 /* Holds the size of the datum, in bits, as a tree expression.
2511 Need not be constant and may be null. */
2512 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2513 /* Likewise for the size in bytes. */
2514 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2515 /* Returns the alignment required for the datum, in bits. It must
2516 be a power of two, but an "alignment" of zero is supported
2517 (e.g. as "uninitialized" sentinel). */
2518 #define DECL_ALIGN(NODE) \
2519 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2520 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2521 /* Specify that DECL_ALIGN(NODE) is X. */
2522 #define SET_DECL_ALIGN(NODE, X) \
2523 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2525 /* The minimum alignment necessary for the datum, in bits, without
2527 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2528 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \
2529 ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0)
2531 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2532 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2533 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X))
2535 /* The alignment of NODE, in bytes. */
2536 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2537 /* Set if the alignment of this DECL has been set by the user, for
2538 example with an 'aligned' attribute. */
2539 #define DECL_USER_ALIGN(NODE) \
2540 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2541 /* Holds the machine mode corresponding to the declaration of a variable or
2542 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2544 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2545 #define SET_DECL_MODE(NODE, MODE) \
2546 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2548 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2549 operation it is. This is only intended for low-level accesses;
2550 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2551 should be used instead. */
2552 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2553 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2555 /* Test if FCODE is a function code for an alloca operation. */
2556 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2557 ((FCODE) == BUILT_IN_ALLOCA \
2558 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2559 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2561 /* Generate case for an alloca operation. */
2562 #define CASE_BUILT_IN_ALLOCA \
2563 case BUILT_IN_ALLOCA: \
2564 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2565 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2567 #define DECL_FUNCTION_PERSONALITY(NODE) \
2568 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2570 /* Nonzero for a given ..._DECL node means that the name of this node should
2571 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2572 the associated type should be ignored. For a FUNCTION_DECL, the body of
2573 the function should also be ignored. */
2574 #define DECL_IGNORED_P(NODE) \
2575 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2577 /* Nonzero for a given ..._DECL node means that this node represents an
2578 "abstract instance" of the given declaration (e.g. in the original
2579 declaration of an inline function). When generating symbolic debugging
2580 information, we mustn't try to generate any address information for nodes
2581 marked as "abstract instances" because we don't actually generate
2582 any code or allocate any data space for such instances. */
2583 #define DECL_ABSTRACT_P(NODE) \
2584 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2586 /* Language-specific decl information. */
2587 #define DECL_LANG_SPECIFIC(NODE) \
2588 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2590 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2591 do not allocate storage, and refer to a definition elsewhere. Note that
2592 this does not necessarily imply the entity represented by NODE
2593 has no program source-level definition in this translation unit. For
2594 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2595 DECL_EXTERNAL may be true simultaneously; that can be the case for
2596 a C99 "extern inline" function. */
2597 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2599 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2600 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2602 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2604 Also set in some languages for variables, etc., outside the normal
2605 lexical scope, such as class instance variables. */
2606 #define DECL_NONLOCAL(NODE) \
2607 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2609 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2610 Used in FIELD_DECLs for vtable pointers.
2611 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2612 #define DECL_VIRTUAL_P(NODE) \
2613 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2615 /* Used to indicate that this DECL represents a compiler-generated entity. */
2616 #define DECL_ARTIFICIAL(NODE) \
2617 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2619 /* Additional flags for language-specific uses. */
2620 #define DECL_LANG_FLAG_0(NODE) \
2621 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2622 #define DECL_LANG_FLAG_1(NODE) \
2623 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2624 #define DECL_LANG_FLAG_2(NODE) \
2625 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2626 #define DECL_LANG_FLAG_3(NODE) \
2627 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2628 #define DECL_LANG_FLAG_4(NODE) \
2629 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2630 #define DECL_LANG_FLAG_5(NODE) \
2631 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2632 #define DECL_LANG_FLAG_6(NODE) \
2633 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2634 #define DECL_LANG_FLAG_7(NODE) \
2635 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2636 #define DECL_LANG_FLAG_8(NODE) \
2637 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2639 /* Nonzero for a scope which is equal to file scope. */
2640 #define SCOPE_FILE_SCOPE_P(EXP) \
2641 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2642 /* Nonzero for a decl which is at file scope. */
2643 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2644 /* Nonzero for a type which is at file scope. */
2645 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2647 /* Nonzero for a decl that is decorated using attribute used.
2648 This indicates to compiler tools that this decl needs to be preserved. */
2649 #define DECL_PRESERVE_P(DECL) \
2650 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2652 /* For function local variables of COMPLEX and VECTOR types,
2653 indicates that the variable is not aliased, and that all
2654 modifications to the variable have been adjusted so that
2655 they are killing assignments. Thus the variable may now
2656 be treated as a GIMPLE register, and use real instead of
2657 virtual ops in SSA form. */
2658 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2659 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2661 extern tree
decl_value_expr_lookup (tree
);
2662 extern void decl_value_expr_insert (tree
, tree
);
2664 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2665 if transformations have made this more complicated than evaluating the
2667 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2668 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2669 ->decl_common.decl_flag_2)
2670 #define DECL_VALUE_EXPR(NODE) \
2671 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2672 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2673 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2675 /* Holds the RTL expression for the value of a variable or function.
2676 This value can be evaluated lazily for functions, variables with
2677 static storage duration, and labels. */
2678 #define DECL_RTL(NODE) \
2679 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2680 ? (NODE)->decl_with_rtl.rtl \
2681 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2683 /* Set the DECL_RTL for NODE to RTL. */
2684 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2686 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2687 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2689 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2690 #define DECL_RTL_SET_P(NODE) \
2691 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2693 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2694 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2695 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2696 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2697 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2699 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2700 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2702 #if (GCC_VERSION >= 2007)
2703 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2704 ({ tree const __d = (decl); \
2705 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2706 /* Dereference it so the compiler knows it can't be NULL even \
2707 without assertion checking. */ \
2708 &*DECL_RTL_IF_SET (__d); })
2710 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2713 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2714 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2716 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2717 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2718 of the structure. */
2719 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2721 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2722 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2723 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2724 natural alignment of the field's type). */
2725 #define DECL_FIELD_BIT_OFFSET(NODE) \
2726 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2728 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2729 if so, the type that was originally specified for it.
2730 TREE_TYPE may have been modified (in finish_struct). */
2731 #define DECL_BIT_FIELD_TYPE(NODE) \
2732 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2734 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2735 representative FIELD_DECL. */
2736 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2737 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2739 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2740 if nonzero, indicates that the field occupies the type. */
2741 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2743 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2744 DECL_FIELD_OFFSET which are known to be always zero.
2745 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2747 #define DECL_OFFSET_ALIGN(NODE) \
2748 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2750 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2751 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2752 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2754 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2755 which this FIELD_DECL is defined. This information is needed when
2756 writing debugging information about vfield and vbase decls for C++. */
2757 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2759 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2760 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2762 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
2763 like passing/returning containing struct by value.
2764 Set for C++17 empty base artificial FIELD_DECLs as well as
2765 empty [[no_unique_address]] non-static data members. */
2766 #define DECL_FIELD_ABI_IGNORED(NODE) \
2767 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2769 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2771 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2773 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2774 this component. This makes it possible for Type-Based Alias Analysis
2775 to disambiguate accesses to this field with indirect accesses using
2778 struct S { int i; } s;
2781 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2783 From the implementation's viewpoint, the alias set of the type of the
2784 field 'i' (int) will not be recorded as a subset of that of the type of
2785 's' (struct S) in record_component_aliases. The counterpart is that
2786 accesses to s.i must not be given the alias set of the type of 'i'
2787 (int) but instead directly that of the type of 's' (struct S). */
2788 #define DECL_NONADDRESSABLE_P(NODE) \
2789 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2791 /* Used in a FIELD_DECL to indicate that this field is padding. */
2792 #define DECL_PADDING_P(NODE) \
2793 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2795 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2796 dense, unique within any one function, and may be used to index arrays.
2797 If the value is -1, then no UID has been assigned. */
2798 #define LABEL_DECL_UID(NODE) \
2799 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2801 /* In a LABEL_DECL, the EH region number for which the label is the
2802 post_landing_pad. */
2803 #define EH_LANDING_PAD_NR(NODE) \
2804 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2806 /* For a PARM_DECL, records the data type used to pass the argument,
2807 which may be different from the type seen in the program. */
2808 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2810 /* For PARM_DECL, holds an RTL for the stack slot or register
2811 where the data was actually passed. */
2812 #define DECL_INCOMING_RTL(NODE) \
2813 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2815 /* Nonzero for a given ..._DECL node means that no warnings should be
2816 generated just because this node is unused. */
2817 #define DECL_IN_SYSTEM_HEADER(NODE) \
2818 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2820 /* Used to indicate that the linkage status of this DECL is not yet known,
2821 so it should not be output now. */
2822 #define DECL_DEFER_OUTPUT(NODE) \
2823 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2825 /* In a VAR_DECL that's static,
2826 nonzero if the space is in the text section. */
2827 #define DECL_IN_TEXT_SECTION(NODE) \
2828 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2830 /* In a VAR_DECL that's static,
2831 nonzero if it belongs to the global constant pool. */
2832 #define DECL_IN_CONSTANT_POOL(NODE) \
2833 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2835 /* Nonzero for a given ..._DECL node means that this node should be
2836 put in .common, if possible. If a DECL_INITIAL is given, and it
2837 is not error_mark_node, then the decl cannot be put in .common. */
2838 #define DECL_COMMON(NODE) \
2839 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2841 /* In a VAR_DECL, nonzero if the decl is a register variable with
2842 an explicit asm specification. */
2843 #define DECL_HARD_REGISTER(NODE) \
2844 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2846 /* Used to indicate that this DECL has weak linkage. */
2847 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2849 /* Used to indicate that the DECL is a dllimport. */
2850 #define DECL_DLLIMPORT_P(NODE) \
2851 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2853 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2854 not be put out unless it is needed in this translation unit.
2855 Entities like this are shared across translation units (like weak
2856 entities), but are guaranteed to be generated by any translation
2857 unit that needs them, and therefore need not be put out anywhere
2858 where they are not needed. DECL_COMDAT is just a hint to the
2859 back-end; it is up to front-ends which set this flag to ensure
2860 that there will never be any harm, other than bloat, in putting out
2861 something which is DECL_COMDAT. */
2862 #define DECL_COMDAT(NODE) \
2863 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2865 #define DECL_COMDAT_GROUP(NODE) \
2866 decl_comdat_group (NODE)
2868 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2869 multiple translation units should be merged. */
2870 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2871 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2873 /* The name of the object as the assembler will see it (but before any
2874 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2875 as DECL_NAME. It is an IDENTIFIER_NODE.
2877 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2878 One Definition Rule based type merging at LTO. It is computed only for
2879 LTO compilation and C++. */
2880 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2882 /* Raw accessor for DECL_ASSEMBLE_NAME. */
2883 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
2884 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
2886 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2887 This is true of all DECL nodes except FIELD_DECL. */
2888 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2889 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2891 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2892 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2894 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2895 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
2897 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2898 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2899 overwrite_decl_assembler_name (NODE, NAME)
2901 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
2902 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
2903 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
2904 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
2905 other words, the semantics of using this macro, are different than
2908 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
2910 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
2912 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
2913 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
2915 /* Records the section name in a section attribute. Used to pass
2916 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2917 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2919 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2920 this variable in a BIND_EXPR. */
2921 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2922 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2924 /* Value of the decls's visibility attribute */
2925 #define DECL_VISIBILITY(NODE) \
2926 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2928 /* Nonzero means that the decl (or an enclosing scope) had its
2929 visibility specified rather than being inferred. */
2930 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2931 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2933 /* In a VAR_DECL, the model to use if the data should be allocated from
2934 thread-local storage. */
2935 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2937 /* In a VAR_DECL, nonzero if the data should be allocated from
2938 thread-local storage. */
2939 #define DECL_THREAD_LOCAL_P(NODE) \
2940 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2942 /* In a non-local VAR_DECL with static storage duration, true if the
2943 variable has an initialization priority. If false, the variable
2944 will be initialized at the DEFAULT_INIT_PRIORITY. */
2945 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2946 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2948 extern tree
decl_debug_expr_lookup (tree
);
2949 extern void decl_debug_expr_insert (tree
, tree
);
2951 /* For VAR_DECL, this is set to an expression that it was split from. */
2952 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2953 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2954 #define DECL_DEBUG_EXPR(NODE) \
2955 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2957 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2958 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2960 extern priority_type
decl_init_priority_lookup (tree
);
2961 extern priority_type
decl_fini_priority_lookup (tree
);
2962 extern void decl_init_priority_insert (tree
, priority_type
);
2963 extern void decl_fini_priority_insert (tree
, priority_type
);
2965 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2967 #define DECL_INIT_PRIORITY(NODE) \
2968 (decl_init_priority_lookup (NODE))
2969 /* Set the initialization priority for NODE to VAL. */
2970 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2971 (decl_init_priority_insert (NODE, VAL))
2973 /* For a FUNCTION_DECL the finalization priority of NODE. */
2974 #define DECL_FINI_PRIORITY(NODE) \
2975 (decl_fini_priority_lookup (NODE))
2976 /* Set the finalization priority for NODE to VAL. */
2977 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2978 (decl_fini_priority_insert (NODE, VAL))
2980 /* The initialization priority for entities for which no explicit
2981 initialization priority has been specified. */
2982 #define DEFAULT_INIT_PRIORITY 65535
2984 /* The maximum allowed initialization priority. */
2985 #define MAX_INIT_PRIORITY 65535
2987 /* The largest priority value reserved for use by system runtime
2989 #define MAX_RESERVED_INIT_PRIORITY 100
2991 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2992 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2993 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2995 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2996 #define DECL_NONLOCAL_FRAME(NODE) \
2997 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2999 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3000 #define DECL_NONALIASED(NODE) \
3001 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3003 /* This field is used to reference anything in decl.result and is meant only
3004 for use by the garbage collector. */
3005 #define DECL_RESULT_FLD(NODE) \
3006 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3008 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3009 Before the struct containing the FUNCTION_DECL is laid out,
3010 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3011 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3012 function. When the class is laid out, this pointer is changed
3013 to an INTEGER_CST node which is suitable for use as an index
3014 into the virtual function table. */
3015 #define DECL_VINDEX(NODE) \
3016 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3018 /* In FUNCTION_DECL, holds the decl for the return value. */
3019 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3021 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3022 #define DECL_UNINLINABLE(NODE) \
3023 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3025 /* In a FUNCTION_DECL, the saved representation of the body of the
3027 #define DECL_SAVED_TREE(NODE) \
3028 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3030 /* Nonzero in a FUNCTION_DECL means this function should be treated
3031 as if it were a malloc, meaning it returns a pointer that is
3033 #define DECL_IS_MALLOC(NODE) \
3034 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3036 /* Macro for direct set and get of function_decl.decl_type. */
3037 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3038 (NODE->function_decl.decl_type)
3040 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3044 set_function_decl_type (tree decl
, function_decl_type t
, bool set
)
3048 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl
) == NONE
3049 || FUNCTION_DECL_DECL_TYPE (decl
) == t
);
3050 decl
->function_decl
.decl_type
= t
;
3052 else if (FUNCTION_DECL_DECL_TYPE (decl
) == t
)
3053 FUNCTION_DECL_DECL_TYPE (decl
) = NONE
;
3056 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3057 function (like replaceable operators new or delete). */
3058 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3059 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3061 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3062 C++ operator new, meaning that it returns a pointer for which we
3063 should not use type based aliasing. */
3064 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3065 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_NEW)
3067 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3068 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3070 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3071 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3073 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3074 C++ operator delete. */
3075 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3076 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == OPERATOR_DELETE)
3078 #define DECL_IS_REPLACEABLE_OPERATOR_DELETE_P(NODE) \
3079 (DECL_IS_OPERATOR_DELETE_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3081 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3082 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3084 /* Nonzero in a FUNCTION_DECL means this function may return more
3086 #define DECL_IS_RETURNS_TWICE(NODE) \
3087 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3089 /* Nonzero in a FUNCTION_DECL means this function should be treated
3090 as "pure" function (like const function, but may read global memory). */
3091 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3093 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3094 the const or pure function may not terminate. When this is nonzero
3095 for a const or pure function, it can be dealt with by cse passes
3096 but cannot be removed by dce passes since you are not allowed to
3097 change an infinite looping program into one that terminates without
3099 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3100 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3102 /* Nonzero in a FUNCTION_DECL means this function should be treated
3103 as "novops" function (function that does not read global memory,
3104 but may have arbitrary side effects). */
3105 #define DECL_IS_NOVOPS(NODE) \
3106 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3108 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3109 at the beginning or end of execution. */
3110 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3111 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3113 #define DECL_STATIC_DESTRUCTOR(NODE) \
3114 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3116 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3117 be instrumented with calls to support routines. */
3118 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3119 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3121 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3122 disabled in this function. */
3123 #define DECL_NO_LIMIT_STACK(NODE) \
3124 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3126 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3127 #define DECL_STATIC_CHAIN(NODE) \
3128 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3130 /* Nonzero for a decl that cgraph has decided should be inlined into
3131 at least one call site. It is not meaningful to look at this
3132 directly; always use cgraph_function_possibly_inlined_p. */
3133 #define DECL_POSSIBLY_INLINED(DECL) \
3134 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3136 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3137 such as via the `inline' keyword in C/C++. This flag controls the linkage
3138 semantics of 'inline' */
3139 #define DECL_DECLARED_INLINE_P(NODE) \
3140 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3142 /* Nonzero in a FUNCTION_DECL means this function should not get
3143 -Winline warnings. */
3144 #define DECL_NO_INLINE_WARNING_P(NODE) \
3145 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3147 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3148 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3149 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3151 /* Nonzero if a FUNCTION_CODE is a TM load. */
3152 #define BUILTIN_TM_LOAD_P(FN) \
3153 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3155 /* Nonzero if a FUNCTION_CODE is a TM store. */
3156 #define BUILTIN_TM_STORE_P(FN) \
3157 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3159 #define CASE_BUILT_IN_TM_LOAD(FN) \
3160 case BUILT_IN_TM_LOAD_##FN: \
3161 case BUILT_IN_TM_LOAD_RAR_##FN: \
3162 case BUILT_IN_TM_LOAD_RAW_##FN: \
3163 case BUILT_IN_TM_LOAD_RFW_##FN
3165 #define CASE_BUILT_IN_TM_STORE(FN) \
3166 case BUILT_IN_TM_STORE_##FN: \
3167 case BUILT_IN_TM_STORE_WAR_##FN: \
3168 case BUILT_IN_TM_STORE_WAW_##FN
3170 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3171 disregarding size and cost heuristics. This is equivalent to using
3172 the always_inline attribute without the required diagnostics if the
3173 function cannot be inlined. */
3174 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3175 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3177 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3178 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3180 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3181 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3182 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3184 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3185 that describes the status of this function. */
3186 #define DECL_STRUCT_FUNCTION(NODE) \
3187 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3189 /* For a builtin function, identify which part of the compiler defined it. */
3190 #define DECL_BUILT_IN_CLASS(NODE) \
3191 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3193 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3194 #define DECL_ARGUMENTS(NODE) \
3195 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3197 /* In FUNCTION_DECL, the function specific target options to use when compiling
3199 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3200 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3202 /* In FUNCTION_DECL, the function specific optimization options to use when
3203 compiling this function. */
3204 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3205 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3207 /* In FUNCTION_DECL, this is set if this function has other versions generated
3208 using "target" attributes. The default version is the one which does not
3209 have any "target" attribute set. */
3210 #define DECL_FUNCTION_VERSIONED(NODE)\
3211 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3213 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3214 Devirtualization machinery uses this knowledge for determing type of the
3215 object constructed. Also we assume that constructor address is not
3217 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3218 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3220 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3221 Devirtualization machinery uses this to track types in destruction. */
3222 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3223 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3225 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3226 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3227 (FUNCTION_DECL_CHECK (NODE)->function_decl.decl_type == LAMBDA_FUNCTION)
3229 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3230 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3232 /* In FUNCTION_DECL that represent an virtual method this is set when
3233 the method is final. */
3234 #define DECL_FINAL_P(NODE)\
3235 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3237 /* The source language of the translation-unit. */
3238 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3239 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3241 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3243 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3244 #define DECL_ORIGINAL_TYPE(NODE) \
3245 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3247 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3248 into stabs. Instead it will generate cross reference ('x') of names.
3249 This uses the same flag as DECL_EXTERNAL. */
3250 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3251 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3253 /* Getter of the imported declaration associated to the
3254 IMPORTED_DECL node. */
3255 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3256 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3258 /* Getter of the symbol declaration associated with the
3259 NAMELIST_DECL node. */
3260 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3261 (DECL_INITIAL (NODE))
3263 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3264 To reduce overhead, the nodes containing the statements are not trees.
3265 This avoids the overhead of tree_common on all linked list elements.
3267 Use the interface in tree-iterator.h to access this node. */
3269 #define STATEMENT_LIST_HEAD(NODE) \
3270 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3271 #define STATEMENT_LIST_TAIL(NODE) \
3272 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3274 #define TREE_OPTIMIZATION(NODE) \
3275 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3277 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3278 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3280 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3281 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3283 /* Return a tree node that encapsulates the optimization options in OPTS. */
3284 extern tree
build_optimization_node (struct gcc_options
*opts
);
3286 #define TREE_TARGET_OPTION(NODE) \
3287 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3289 #define TREE_TARGET_GLOBALS(NODE) \
3290 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3292 /* Return a tree node that encapsulates the target options in OPTS. */
3293 extern tree
build_target_option_node (struct gcc_options
*opts
);
3295 extern void prepare_target_option_nodes_for_pch (void);
3297 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3300 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3302 if (TREE_CODE (__t
) != __c
)
3303 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3308 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3311 if (TREE_CODE (__t
) == __c
)
3312 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3317 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3318 enum tree_code __c1
, enum tree_code __c2
)
3320 if (TREE_CODE (__t
) != __c1
3321 && TREE_CODE (__t
) != __c2
)
3322 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3327 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3328 enum tree_code __c1
, enum tree_code __c2
)
3330 if (TREE_CODE (__t
) == __c1
3331 || TREE_CODE (__t
) == __c2
)
3332 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3337 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3338 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3340 if (TREE_CODE (__t
) != __c1
3341 && TREE_CODE (__t
) != __c2
3342 && TREE_CODE (__t
) != __c3
)
3343 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3348 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3349 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3351 if (TREE_CODE (__t
) == __c1
3352 || TREE_CODE (__t
) == __c2
3353 || TREE_CODE (__t
) == __c3
)
3354 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3359 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3360 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3361 enum tree_code __c4
)
3363 if (TREE_CODE (__t
) != __c1
3364 && TREE_CODE (__t
) != __c2
3365 && TREE_CODE (__t
) != __c3
3366 && TREE_CODE (__t
) != __c4
)
3367 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3372 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3373 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3374 enum tree_code __c4
)
3376 if (TREE_CODE (__t
) == __c1
3377 || TREE_CODE (__t
) == __c2
3378 || TREE_CODE (__t
) == __c3
3379 || TREE_CODE (__t
) == __c4
)
3380 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3385 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3386 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3387 enum tree_code __c4
, enum tree_code __c5
)
3389 if (TREE_CODE (__t
) != __c1
3390 && TREE_CODE (__t
) != __c2
3391 && TREE_CODE (__t
) != __c3
3392 && TREE_CODE (__t
) != __c4
3393 && TREE_CODE (__t
) != __c5
)
3394 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3399 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3400 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3401 enum tree_code __c4
, enum tree_code __c5
)
3403 if (TREE_CODE (__t
) == __c1
3404 || TREE_CODE (__t
) == __c2
3405 || TREE_CODE (__t
) == __c3
3406 || TREE_CODE (__t
) == __c4
3407 || TREE_CODE (__t
) == __c5
)
3408 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3413 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3414 const char *__f
, int __l
, const char *__g
)
3416 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3417 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3422 tree_class_check (tree __t
, const enum tree_code_class __class
,
3423 const char *__f
, int __l
, const char *__g
)
3425 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3426 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3431 tree_range_check (tree __t
,
3432 enum tree_code __code1
, enum tree_code __code2
,
3433 const char *__f
, int __l
, const char *__g
)
3435 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3436 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3441 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3442 const char *__f
, int __l
, const char *__g
)
3444 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3445 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3446 if (__t
->omp_clause
.code
!= __code
)
3447 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3452 omp_clause_range_check (tree __t
,
3453 enum omp_clause_code __code1
,
3454 enum omp_clause_code __code2
,
3455 const char *__f
, int __l
, const char *__g
)
3457 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3458 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3459 if ((int) __t
->omp_clause
.code
< (int) __code1
3460 || (int) __t
->omp_clause
.code
> (int) __code2
)
3461 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3465 /* These checks have to be special cased. */
3468 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3470 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3471 if (!IS_EXPR_CODE_CLASS (__c
))
3472 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3476 /* These checks have to be special cased. */
3479 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3482 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3486 inline const HOST_WIDE_INT
*
3487 tree_int_cst_elt_check (const_tree __t
, int __i
,
3488 const char *__f
, int __l
, const char *__g
)
3490 if (TREE_CODE (__t
) != INTEGER_CST
)
3491 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3492 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3493 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3495 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3498 inline HOST_WIDE_INT
*
3499 tree_int_cst_elt_check (tree __t
, int __i
,
3500 const char *__f
, int __l
, const char *__g
)
3502 if (TREE_CODE (__t
) != INTEGER_CST
)
3503 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3504 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3505 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3507 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3510 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3512 # if GCC_VERSION >= 4006
3513 #pragma GCC diagnostic push
3514 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3518 tree_vec_elt_check (tree __t
, int __i
,
3519 const char *__f
, int __l
, const char *__g
)
3521 if (TREE_CODE (__t
) != TREE_VEC
)
3522 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3523 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3524 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3525 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3528 # if GCC_VERSION >= 4006
3529 #pragma GCC diagnostic pop
3533 omp_clause_elt_check (tree __t
, int __i
,
3534 const char *__f
, int __l
, const char *__g
)
3536 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3537 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3538 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3539 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3540 return &__t
->omp_clause
.ops
[__i
];
3543 /* These checks have to be special cased. */
3546 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3548 if (!ANY_INTEGRAL_TYPE_P (__t
))
3549 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3555 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3558 if (TREE_CODE (__t
) != __c
)
3559 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3564 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3567 if (TREE_CODE (__t
) == __c
)
3568 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3573 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3574 enum tree_code __c1
, enum tree_code __c2
)
3576 if (TREE_CODE (__t
) != __c1
3577 && TREE_CODE (__t
) != __c2
)
3578 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3583 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3584 enum tree_code __c1
, enum tree_code __c2
)
3586 if (TREE_CODE (__t
) == __c1
3587 || TREE_CODE (__t
) == __c2
)
3588 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3593 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3594 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3596 if (TREE_CODE (__t
) != __c1
3597 && TREE_CODE (__t
) != __c2
3598 && TREE_CODE (__t
) != __c3
)
3599 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3604 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3605 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3607 if (TREE_CODE (__t
) == __c1
3608 || TREE_CODE (__t
) == __c2
3609 || TREE_CODE (__t
) == __c3
)
3610 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3615 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3616 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3617 enum tree_code __c4
)
3619 if (TREE_CODE (__t
) != __c1
3620 && TREE_CODE (__t
) != __c2
3621 && TREE_CODE (__t
) != __c3
3622 && TREE_CODE (__t
) != __c4
)
3623 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3628 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3629 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3630 enum tree_code __c4
)
3632 if (TREE_CODE (__t
) == __c1
3633 || TREE_CODE (__t
) == __c2
3634 || TREE_CODE (__t
) == __c3
3635 || TREE_CODE (__t
) == __c4
)
3636 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3641 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3642 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3643 enum tree_code __c4
, enum tree_code __c5
)
3645 if (TREE_CODE (__t
) != __c1
3646 && TREE_CODE (__t
) != __c2
3647 && TREE_CODE (__t
) != __c3
3648 && TREE_CODE (__t
) != __c4
3649 && TREE_CODE (__t
) != __c5
)
3650 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3655 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3656 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3657 enum tree_code __c4
, enum tree_code __c5
)
3659 if (TREE_CODE (__t
) == __c1
3660 || TREE_CODE (__t
) == __c2
3661 || TREE_CODE (__t
) == __c3
3662 || TREE_CODE (__t
) == __c4
3663 || TREE_CODE (__t
) == __c5
)
3664 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3669 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3670 const char *__f
, int __l
, const char *__g
)
3672 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3673 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3678 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3679 const char *__f
, int __l
, const char *__g
)
3681 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3682 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3687 tree_range_check (const_tree __t
,
3688 enum tree_code __code1
, enum tree_code __code2
,
3689 const char *__f
, int __l
, const char *__g
)
3691 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3692 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3697 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3698 const char *__f
, int __l
, const char *__g
)
3700 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3701 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3702 if (__t
->omp_clause
.code
!= __code
)
3703 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3708 omp_clause_range_check (const_tree __t
,
3709 enum omp_clause_code __code1
,
3710 enum omp_clause_code __code2
,
3711 const char *__f
, int __l
, const char *__g
)
3713 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3714 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3715 if ((int) __t
->omp_clause
.code
< (int) __code1
3716 || (int) __t
->omp_clause
.code
> (int) __code2
)
3717 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3722 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3724 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3725 if (!IS_EXPR_CODE_CLASS (__c
))
3726 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3731 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3734 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3738 # if GCC_VERSION >= 4006
3739 #pragma GCC diagnostic push
3740 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3744 tree_vec_elt_check (const_tree __t
, int __i
,
3745 const char *__f
, int __l
, const char *__g
)
3747 if (TREE_CODE (__t
) != TREE_VEC
)
3748 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3749 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3750 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3751 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3752 //return &__t->vec.a[__i];
3755 # if GCC_VERSION >= 4006
3756 #pragma GCC diagnostic pop
3760 omp_clause_elt_check (const_tree __t
, int __i
,
3761 const char *__f
, int __l
, const char *__g
)
3763 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3764 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3765 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3766 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3767 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3771 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3774 if (!ANY_INTEGRAL_TYPE_P (__t
))
3775 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3782 /* Compute the number of operands in an expression node NODE. For
3783 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3784 otherwise it is looked up from the node's code. */
3786 tree_operand_length (const_tree node
)
3788 if (VL_EXP_CLASS_P (node
))
3789 return VL_EXP_OPERAND_LENGTH (node
);
3791 return TREE_CODE_LENGTH (TREE_CODE (node
));
3794 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3796 /* Special checks for TREE_OPERANDs. */
3798 tree_operand_check (tree __t
, int __i
,
3799 const char *__f
, int __l
, const char *__g
)
3801 const_tree __u
= EXPR_CHECK (__t
);
3802 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3803 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3804 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3808 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3809 const char *__f
, int __l
, const char *__g
)
3811 if (TREE_CODE (__t
) != __code
)
3812 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3813 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3814 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3815 return &__t
->exp
.operands
[__i
];
3819 tree_operand_check (const_tree __t
, int __i
,
3820 const char *__f
, int __l
, const char *__g
)
3822 const_tree __u
= EXPR_CHECK (__t
);
3823 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3824 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3825 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3829 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3830 const char *__f
, int __l
, const char *__g
)
3832 if (TREE_CODE (__t
) != __code
)
3833 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3834 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3835 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3836 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3841 /* True iff an identifier matches a C string. */
3844 id_equal (const_tree id
, const char *str
)
3846 return !strcmp (IDENTIFIER_POINTER (id
), str
);
3850 id_equal (const char *str
, const_tree id
)
3852 return !strcmp (str
, IDENTIFIER_POINTER (id
));
3855 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
3858 TYPE_VECTOR_SUBPARTS (const_tree node
)
3860 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3861 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
3862 if (NUM_POLY_INT_COEFFS
== 2)
3864 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
3865 description of the encoding. */
3866 poly_uint64 res
= 0;
3867 res
.coeffs
[0] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3868 if (precision
& 0x100)
3869 res
.coeffs
[1] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3873 return HOST_WIDE_INT_1U
<< precision
;
3876 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
3877 satisfy valid_vector_subparts_p. */
3880 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
3882 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3883 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3884 int index
= exact_log2 (coeff0
);
3885 gcc_assert (index
>= 0);
3886 if (NUM_POLY_INT_COEFFS
== 2)
3888 /* We have two coefficients that are each in the range 1 << [0, 63],
3889 so supporting all combinations would require 6 bits per coefficient
3890 and 12 bits in total. Since the precision field is only 10 bits
3891 in size, we need to be more restrictive than that.
3893 At present, coeff[1] is always either 0 (meaning that the number
3894 of units is constant) or equal to coeff[0] (meaning that the number
3895 of units is N + X * N for some target-dependent zero-based runtime
3896 parameter X). We can therefore encode coeff[1] in a single bit.
3898 The most compact encoding would be to use mask 0x3f for coeff[0]
3899 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
3900 get slightly more efficient code on some hosts if we instead
3901 treat the shift amount as an independent byte, so here we use
3902 0xff for coeff[0] and 0x100 for coeff[1]. */
3903 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3904 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
3905 VECTOR_TYPE_CHECK (node
)->type_common
.precision
3906 = index
+ (coeff1
!= 0 ? 0x100 : 0);
3909 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
3912 /* Return true if we can construct vector types with the given number
3916 valid_vector_subparts_p (poly_uint64 subparts
)
3918 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3919 if (!pow2p_hwi (coeff0
))
3921 if (NUM_POLY_INT_COEFFS
== 2)
3923 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3924 if (coeff1
!= 0 && coeff1
!= coeff0
)
3930 /* Return the built-in function that DECL represents, given that it is known
3931 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
3932 inline built_in_function
3933 DECL_FUNCTION_CODE (const_tree decl
)
3935 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3936 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_NORMAL
);
3937 return (built_in_function
) fndecl
.function_code
;
3940 /* Return the target-specific built-in function that DECL represents,
3941 given that it is known to be a FUNCTION_DECL with built-in class
3944 DECL_MD_FUNCTION_CODE (const_tree decl
)
3946 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3947 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_MD
);
3948 return fndecl
.function_code
;
3951 /* Return the frontend-specific built-in function that DECL represents,
3952 given that it is known to be a FUNCTION_DECL with built-in class
3953 BUILT_IN_FRONTEND. */
3955 DECL_FE_FUNCTION_CODE (const_tree decl
)
3957 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3958 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_FRONTEND
);
3959 return fndecl
.function_code
;
3962 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
3965 set_decl_built_in_function (tree decl
, built_in_class fclass
,
3968 tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
3969 fndecl
.built_in_class
= fclass
;
3970 fndecl
.function_code
= fcode
;
3973 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
3974 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
3976 copy_decl_built_in_function (tree newdecl
, const_tree olddecl
)
3978 tree_function_decl
&newfndecl
= FUNCTION_DECL_CHECK (newdecl
)->function_decl
;
3979 const tree_function_decl
&oldfndecl
3980 = FUNCTION_DECL_CHECK (olddecl
)->function_decl
;
3981 newfndecl
.built_in_class
= oldfndecl
.built_in_class
;
3982 newfndecl
.function_code
= oldfndecl
.function_code
;
3985 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
3986 wrapper added to express a location_t on behalf of the node's child
3987 (e.g. by maybe_wrap_with_location). */
3989 #define EXPR_LOCATION_WRAPPER_P(NODE) \
3990 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
3992 /* Test if EXP is merely a wrapper node, added to express a location_t
3993 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
3996 location_wrapper_p (const_tree exp
)
3998 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
3999 the flag EXPR_LOCATION_WRAPPER_P is set.
4000 It normally has the same type as its operand, but it can have a
4001 different one if the type of the operand has changed (e.g. when
4002 merging duplicate decls).
4004 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4005 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4006 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
4007 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4008 && EXPR_LOCATION_WRAPPER_P (exp
))
4013 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4016 tree_strip_any_location_wrapper (tree exp
)
4018 if (location_wrapper_p (exp
))
4019 return TREE_OPERAND (exp
, 0);
4024 #define error_mark_node global_trees[TI_ERROR_MARK]
4026 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4027 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4028 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4029 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4030 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4032 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4033 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4034 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4035 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4036 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4038 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4039 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4040 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4041 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4042 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4044 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4045 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4046 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4047 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4049 #define void_node global_trees[TI_VOID]
4051 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4052 #define integer_one_node global_trees[TI_INTEGER_ONE]
4053 #define integer_three_node global_trees[TI_INTEGER_THREE]
4054 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4055 #define size_zero_node global_trees[TI_SIZE_ZERO]
4056 #define size_one_node global_trees[TI_SIZE_ONE]
4057 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4058 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4059 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4061 /* Base access nodes. */
4062 #define access_public_node global_trees[TI_PUBLIC]
4063 #define access_protected_node global_trees[TI_PROTECTED]
4064 #define access_private_node global_trees[TI_PRIVATE]
4066 #define null_pointer_node global_trees[TI_NULL_POINTER]
4068 #define float_type_node global_trees[TI_FLOAT_TYPE]
4069 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4070 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4072 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4073 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4074 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4075 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4077 /* Names for individual types (code should normally iterate over all
4078 such types; these are only for back-end use, or in contexts such as
4079 *.def where iteration is not possible). */
4080 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4081 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4082 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4083 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4084 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4085 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4086 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4088 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4089 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4090 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4091 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4093 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4094 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4095 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4096 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4098 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4100 #define void_type_node global_trees[TI_VOID_TYPE]
4101 /* The C type `void *'. */
4102 #define ptr_type_node global_trees[TI_PTR_TYPE]
4103 /* The C type `const void *'. */
4104 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4105 /* The C type `size_t'. */
4106 #define size_type_node global_trees[TI_SIZE_TYPE]
4107 #define pid_type_node global_trees[TI_PID_TYPE]
4108 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4109 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4110 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4111 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4112 /* The C type `FILE *'. */
4113 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4114 /* The C type `const struct tm *'. */
4115 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4116 /* The C type `fenv_t *'. */
4117 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4118 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4119 /* The C type `fexcept_t *'. */
4120 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4121 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4122 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4124 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4125 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4126 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4128 /* The decimal floating point types. */
4129 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4130 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4131 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4133 /* The fixed-point types. */
4134 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4135 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4136 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4137 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4138 #define sat_unsigned_short_fract_type_node \
4139 global_trees[TI_SAT_USFRACT_TYPE]
4140 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4141 #define sat_unsigned_long_fract_type_node \
4142 global_trees[TI_SAT_ULFRACT_TYPE]
4143 #define sat_unsigned_long_long_fract_type_node \
4144 global_trees[TI_SAT_ULLFRACT_TYPE]
4145 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4146 #define fract_type_node global_trees[TI_FRACT_TYPE]
4147 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4148 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4149 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4150 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4151 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4152 #define unsigned_long_long_fract_type_node \
4153 global_trees[TI_ULLFRACT_TYPE]
4154 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4155 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4156 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4157 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4158 #define sat_unsigned_short_accum_type_node \
4159 global_trees[TI_SAT_USACCUM_TYPE]
4160 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4161 #define sat_unsigned_long_accum_type_node \
4162 global_trees[TI_SAT_ULACCUM_TYPE]
4163 #define sat_unsigned_long_long_accum_type_node \
4164 global_trees[TI_SAT_ULLACCUM_TYPE]
4165 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4166 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4167 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4168 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4169 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4170 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4171 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4172 #define unsigned_long_long_accum_type_node \
4173 global_trees[TI_ULLACCUM_TYPE]
4174 #define qq_type_node global_trees[TI_QQ_TYPE]
4175 #define hq_type_node global_trees[TI_HQ_TYPE]
4176 #define sq_type_node global_trees[TI_SQ_TYPE]
4177 #define dq_type_node global_trees[TI_DQ_TYPE]
4178 #define tq_type_node global_trees[TI_TQ_TYPE]
4179 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4180 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4181 #define usq_type_node global_trees[TI_USQ_TYPE]
4182 #define udq_type_node global_trees[TI_UDQ_TYPE]
4183 #define utq_type_node global_trees[TI_UTQ_TYPE]
4184 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4185 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4186 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4187 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4188 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4189 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4190 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4191 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4192 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4193 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4194 #define ha_type_node global_trees[TI_HA_TYPE]
4195 #define sa_type_node global_trees[TI_SA_TYPE]
4196 #define da_type_node global_trees[TI_DA_TYPE]
4197 #define ta_type_node global_trees[TI_TA_TYPE]
4198 #define uha_type_node global_trees[TI_UHA_TYPE]
4199 #define usa_type_node global_trees[TI_USA_TYPE]
4200 #define uda_type_node global_trees[TI_UDA_TYPE]
4201 #define uta_type_node global_trees[TI_UTA_TYPE]
4202 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4203 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4204 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4205 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4206 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4207 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4208 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4209 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4211 /* The node that should be placed at the end of a parameter list to
4212 indicate that the function does not take a variable number of
4213 arguments. The TREE_VALUE will be void_type_node and there will be
4214 no TREE_CHAIN. Language-independent code should not assume
4215 anything else about this node. */
4216 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4218 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4219 #define MAIN_NAME_P(NODE) \
4220 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4222 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4224 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4225 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4227 /* Default/current target options (TARGET_OPTION_NODE). */
4228 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4229 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4231 /* Default tree list option(), optimize() pragmas to be linked into the
4233 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4234 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4236 /* SCEV analyzer global shared trees. */
4237 #define chrec_not_analyzed_yet NULL_TREE
4238 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4239 #define chrec_known global_trees[TI_CHREC_KNOWN]
4241 #define char_type_node integer_types[itk_char]
4242 #define signed_char_type_node integer_types[itk_signed_char]
4243 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4244 #define short_integer_type_node integer_types[itk_short]
4245 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4246 #define integer_type_node integer_types[itk_int]
4247 #define unsigned_type_node integer_types[itk_unsigned_int]
4248 #define long_integer_type_node integer_types[itk_long]
4249 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4250 #define long_long_integer_type_node integer_types[itk_long_long]
4251 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4253 /* True if NODE is an erroneous expression. */
4255 #define error_operand_p(NODE) \
4256 ((NODE) == error_mark_node \
4257 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4259 /* Return the number of elements encoded directly in a VECTOR_CST. */
4262 vector_cst_encoded_nelts (const_tree t
)
4264 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4267 extern tree
decl_assembler_name (tree
);
4268 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4269 extern tree
decl_comdat_group (const_tree
);
4270 extern tree
decl_comdat_group_id (const_tree
);
4271 extern const char *decl_section_name (const_tree
);
4272 extern void set_decl_section_name (tree
, const char *);
4273 extern enum tls_model
decl_tls_model (const_tree
);
4274 extern void set_decl_tls_model (tree
, enum tls_model
);
4276 /* Compute the number of bytes occupied by 'node'. This routine only
4277 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4279 extern size_t tree_size (const_tree
);
4281 /* Compute the number of bytes occupied by a tree with code CODE.
4282 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4283 which are of variable length. */
4284 extern size_t tree_code_size (enum tree_code
);
4286 /* Allocate and return a new UID from the DECL_UID namespace. */
4287 extern int allocate_decl_uid (void);
4289 /* Lowest level primitive for allocating a node.
4290 The TREE_CODE is the only argument. Contents are initialized
4291 to zero except for a few of the common fields. */
4293 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4295 /* Free tree node. */
4297 extern void free_node (tree
);
4299 /* Make a copy of a node, with all the same contents. */
4301 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4303 /* Make a copy of a chain of TREE_LIST nodes. */
4305 extern tree
copy_list (tree
);
4307 /* Make a CASE_LABEL_EXPR. */
4309 extern tree
build_case_label (tree
, tree
, tree
);
4312 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4314 /* Make an INTEGER_CST. */
4316 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4318 /* Make a TREE_VEC. */
4320 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4322 /* Grow a TREE_VEC. */
4324 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4326 /* Construct various types of nodes. */
4328 extern tree
build_nt (enum tree_code
, ...);
4329 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4331 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4332 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4333 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4334 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4335 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4336 tree CXX_MEM_STAT_INFO
);
4337 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4338 tree CXX_MEM_STAT_INFO
);
4340 /* _loc versions of build[1-5]. */
4343 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4344 tree arg1 CXX_MEM_STAT_INFO
)
4346 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4347 if (CAN_HAVE_LOCATION_P (t
))
4348 SET_EXPR_LOCATION (t
, loc
);
4353 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4354 tree arg1 CXX_MEM_STAT_INFO
)
4356 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4357 if (CAN_HAVE_LOCATION_P (t
))
4358 SET_EXPR_LOCATION (t
, loc
);
4363 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4364 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4366 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4367 if (CAN_HAVE_LOCATION_P (t
))
4368 SET_EXPR_LOCATION (t
, loc
);
4373 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4374 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4376 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4377 if (CAN_HAVE_LOCATION_P (t
))
4378 SET_EXPR_LOCATION (t
, loc
);
4383 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4384 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4386 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4387 arg4 PASS_MEM_STAT
);
4388 if (CAN_HAVE_LOCATION_P (t
))
4389 SET_EXPR_LOCATION (t
, loc
);
4393 /* Constructs double_int from tree CST. */
4395 extern tree
double_int_to_tree (tree
, double_int
);
4397 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4398 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4400 /* Create an INT_CST node with a CST value zero extended. */
4403 extern tree
build_int_cst (tree
, poly_int64
);
4404 extern tree
build_int_cstu (tree type
, poly_uint64
);
4405 extern tree
build_int_cst_type (tree
, poly_int64
);
4406 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4407 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
4408 extern tree
build_vector_from_val (tree
, tree
);
4409 extern tree
build_uniform_cst (tree
, tree
);
4410 extern tree
build_vec_series (tree
, tree
, tree
);
4411 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4412 extern tree
build_vector_a_then_b (tree
, unsigned int, tree
, tree
);
4413 extern void recompute_constructor_flags (tree
);
4414 extern void verify_constructor_flags (tree
);
4415 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> * CXX_MEM_STAT_INFO
);
4416 extern tree
build_constructor_single (tree
, tree
, tree
);
4417 extern tree
build_constructor_from_list (tree
, tree
);
4418 extern tree
build_constructor_va (tree
, int, ...);
4419 extern tree
build_clobber (tree
);
4420 extern tree
build_real_from_int_cst (tree
, const_tree
);
4421 extern tree
build_complex (tree
, tree
, tree
);
4422 extern tree
build_complex_inf (tree
, bool);
4423 extern tree
build_each_one_cst (tree
);
4424 extern tree
build_one_cst (tree
);
4425 extern tree
build_minus_one_cst (tree
);
4426 extern tree
build_all_ones_cst (tree
);
4427 extern tree
build_zero_cst (tree
);
4428 extern tree
build_string (int, const char *);
4429 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4430 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4431 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4432 extern tree
build_decl (location_t
, enum tree_code
,
4433 tree
, tree CXX_MEM_STAT_INFO
);
4434 extern tree
build_fn_decl (const char *, tree
);
4435 extern tree
build_translation_unit_decl (tree
);
4436 extern tree
build_block (tree
, tree
, tree
, tree
);
4437 extern tree
build_empty_stmt (location_t
);
4438 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4440 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4442 extern tree
build_call_nary (tree
, tree
, int, ...);
4443 extern tree
build_call_valist (tree
, tree
, int, va_list);
4444 #define build_call_array(T1,T2,N,T3)\
4445 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4446 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4447 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
4448 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4449 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4450 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4451 extern tree
build_call_expr (tree
, int, ...);
4452 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4454 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4455 tree
, int, const tree
*);
4456 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4458 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4459 extern tree
build_string_literal (int, const char *, tree
= char_type_node
,
4460 unsigned HOST_WIDE_INT
= HOST_WIDE_INT_M1U
);
4462 /* Construct various nodes representing data types. */
4464 extern tree
signed_or_unsigned_type_for (int, tree
);
4465 extern tree
signed_type_for (tree
);
4466 extern tree
unsigned_type_for (tree
);
4467 extern tree
truth_type_for (tree
);
4468 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4469 extern tree
build_pointer_type (tree
);
4470 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4471 extern tree
build_reference_type (tree
);
4472 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4473 extern tree
build_vector_type (tree
, poly_int64
);
4474 extern tree
build_truth_vector_type_for_mode (poly_uint64
, machine_mode
);
4475 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4476 extern tree
build_index_type (tree
);
4477 extern tree
build_array_type (tree
, tree
, bool = false);
4478 extern tree
build_nonshared_array_type (tree
, tree
);
4479 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4480 extern tree
build_function_type (tree
, tree
);
4481 extern tree
build_function_type_list (tree
, ...);
4482 extern tree
build_varargs_function_type_list (tree
, ...);
4483 extern tree
build_function_type_array (tree
, int, tree
*);
4484 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4485 #define build_function_type_vec(RET, V) \
4486 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4487 #define build_varargs_function_type_vec(RET, V) \
4488 build_varargs_function_type_array (RET, vec_safe_length (V), \
4489 vec_safe_address (V))
4490 extern tree
build_method_type_directly (tree
, tree
, tree
);
4491 extern tree
build_method_type (tree
, tree
);
4492 extern tree
build_offset_type (tree
, tree
);
4493 extern tree
build_complex_type (tree
, bool named
= false);
4494 extern tree
array_type_nelts (const_tree
);
4496 extern tree
value_member (tree
, tree
);
4497 extern tree
purpose_member (const_tree
, tree
);
4498 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4499 extern tree
chain_index (int, tree
);
4501 /* Arguments may be null. */
4502 extern int tree_int_cst_equal (const_tree
, const_tree
);
4504 /* The following predicates are safe to call with a null argument. */
4505 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4506 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4507 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4508 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4510 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4511 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4512 extern poly_int64
tree_to_poly_int64 (const_tree
)
4513 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4514 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4515 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4516 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4517 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4518 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4519 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4520 tree_to_shwi (const_tree t
)
4522 gcc_assert (tree_fits_shwi_p (t
));
4523 return TREE_INT_CST_LOW (t
);
4526 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4527 tree_to_uhwi (const_tree t
)
4529 gcc_assert (tree_fits_uhwi_p (t
));
4530 return TREE_INT_CST_LOW (t
);
4532 #if NUM_POLY_INT_COEFFS == 1
4533 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4534 tree_to_poly_int64 (const_tree t
)
4536 gcc_assert (tree_fits_poly_int64_p (t
));
4537 return TREE_INT_CST_LOW (t
);
4540 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4541 tree_to_poly_uint64 (const_tree t
)
4543 gcc_assert (tree_fits_poly_uint64_p (t
));
4544 return TREE_INT_CST_LOW (t
);
4548 extern int tree_int_cst_sgn (const_tree
);
4549 extern int tree_int_cst_sign_bit (const_tree
);
4550 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4551 extern tree
strip_array_types (tree
);
4552 extern tree
excess_precision_type (tree
);
4554 /* Desription of the reason why the argument of valid_constant_size_p
4555 is not a valid size. */
4556 enum cst_size_error
{
4558 cst_size_not_constant
,
4564 extern bool valid_constant_size_p (const_tree
, cst_size_error
* = NULL
);
4565 extern tree
max_object_size ();
4567 /* Return true if T holds a value that can be represented as a poly_int64
4568 without loss of precision. Store the value in *VALUE if so. */
4571 poly_int_tree_p (const_tree t
, poly_int64_pod
*value
)
4573 if (tree_fits_poly_int64_p (t
))
4575 *value
= tree_to_poly_int64 (t
);
4581 /* Return true if T holds a value that can be represented as a poly_uint64
4582 without loss of precision. Store the value in *VALUE if so. */
4585 poly_int_tree_p (const_tree t
, poly_uint64_pod
*value
)
4587 if (tree_fits_poly_uint64_p (t
))
4589 *value
= tree_to_poly_uint64 (t
);
4595 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4596 put the prototype here. Rtl.h does declare the prototype if
4597 tree.h had been included. */
4599 extern tree
make_tree (tree
, rtx
);
4601 /* Returns true iff CAND and BASE have equivalent language-specific
4604 extern bool check_lang_type (const_tree cand
, const_tree base
);
4606 /* Returns true iff unqualified CAND and BASE are equivalent. */
4608 extern bool check_base_type (const_tree cand
, const_tree base
);
4610 /* Check whether CAND is suitable to be returned from get_qualified_type
4611 (BASE, TYPE_QUALS). */
4613 extern bool check_qualified_type (const_tree
, const_tree
, int);
4615 /* Return a version of the TYPE, qualified as indicated by the
4616 TYPE_QUALS, if one exists. If no qualified version exists yet,
4617 return NULL_TREE. */
4619 extern tree
get_qualified_type (tree
, int);
4621 /* Like get_qualified_type, but creates the type if it does not
4622 exist. This function never returns NULL_TREE. */
4624 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
4626 /* Create a variant of type T with alignment ALIGN. */
4628 extern tree
build_aligned_type (tree
, unsigned int);
4630 /* Like build_qualified_type, but only deals with the `const' and
4631 `volatile' qualifiers. This interface is retained for backwards
4632 compatibility with the various front-ends; new code should use
4633 build_qualified_type instead. */
4635 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4636 build_qualified_type ((TYPE), \
4637 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4638 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4640 /* Make a copy of a type node. */
4642 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
4643 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
4645 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4646 return a canonicalized ..._TYPE node, so that duplicates are not made.
4647 How the hash code is computed is up to the caller, as long as any two
4648 callers that could hash identical-looking type nodes agree. */
4650 extern hashval_t
type_hash_canon_hash (tree
);
4651 extern tree
type_hash_canon (unsigned int, tree
);
4653 extern tree
convert (tree
, tree
);
4654 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4656 size_in_bytes (const_tree t
)
4658 return size_in_bytes_loc (input_location
, t
);
4661 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4662 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4663 extern tree
bit_position (const_tree
);
4664 extern tree
byte_position (const_tree
);
4665 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4667 /* Type for sizes of data-type. */
4669 #define sizetype sizetype_tab[(int) stk_sizetype]
4670 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4671 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4672 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4673 #define size_int(L) size_int_kind (L, stk_sizetype)
4674 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4675 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4676 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4678 /* Log2 of BITS_PER_UNIT. */
4680 #if BITS_PER_UNIT == 8
4681 #define LOG2_BITS_PER_UNIT 3
4682 #elif BITS_PER_UNIT == 16
4683 #define LOG2_BITS_PER_UNIT 4
4685 #error Unknown BITS_PER_UNIT
4688 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4689 by making the last node in X point to Y.
4690 Returns X, except if X is 0 returns Y. */
4692 extern tree
chainon (tree
, tree
);
4694 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4696 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
4698 /* Return the last tree node in a chain. */
4700 extern tree
tree_last (tree
);
4702 /* Reverse the order of elements in a chain, and return the new head. */
4704 extern tree
nreverse (tree
);
4706 /* Returns the length of a chain of nodes
4707 (number of chain pointers to follow before reaching a null pointer). */
4709 extern int list_length (const_tree
);
4711 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
4713 extern tree
first_field (const_tree
) ATTRIBUTE_NONNULL (1);
4714 extern tree
last_field (const_tree
) ATTRIBUTE_NONNULL (1);
4716 /* Given an initializer INIT, return TRUE if INIT is zero or some
4717 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4718 null, set *NONZERO if and only if INIT is known not to be all
4719 zeros. The combination of return value of false and *NONZERO
4720 false implies that INIT may but need not be all zeros. Other
4721 combinations indicate definitive answers. */
4723 extern bool initializer_zerop (const_tree
, bool * = NULL
);
4724 extern bool initializer_each_zero_or_onep (const_tree
);
4726 extern wide_int
vector_cst_int_elt (const_tree
, unsigned int);
4727 extern tree
vector_cst_elt (const_tree
, unsigned int);
4729 /* Given a vector VEC, return its first element if all elements are
4730 the same. Otherwise return NULL_TREE. */
4732 extern tree
uniform_vector_p (const_tree
);
4734 /* If the argument is INTEGER_CST, return it. If the argument is vector
4735 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4736 return NULL_TREE. */
4738 extern tree
uniform_integer_cst_p (tree
);
4740 extern int single_nonzero_element (const_tree
);
4742 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4744 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4746 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4748 extern bool zerop (const_tree
);
4750 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4752 extern bool integer_zerop (const_tree
);
4754 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4756 extern bool integer_onep (const_tree
);
4758 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4759 a vector or complex where each part is 1. */
4761 extern bool integer_each_onep (const_tree
);
4763 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4764 all of whose significant bits are 1. */
4766 extern bool integer_all_onesp (const_tree
);
4768 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4771 extern bool integer_minus_onep (const_tree
);
4773 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4774 exactly one bit 1. */
4776 extern bool integer_pow2p (const_tree
);
4778 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4779 with a nonzero value. */
4781 extern bool integer_nonzerop (const_tree
);
4783 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4784 a vector where each element is an integer constant of value -1. */
4786 extern bool integer_truep (const_tree
);
4788 extern bool cst_and_fits_in_hwi (const_tree
);
4789 extern tree
num_ending_zeros (const_tree
);
4791 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4794 extern bool fixed_zerop (const_tree
);
4796 /* staticp (tree x) is nonzero if X is a reference to data allocated
4797 at a fixed address in memory. Returns the outermost data. */
4799 extern tree
staticp (tree
);
4801 /* save_expr (EXP) returns an expression equivalent to EXP
4802 but it can be used multiple times within context CTX
4803 and only evaluate EXP once. */
4805 extern tree
save_expr (tree
);
4807 /* Return true if T is function-invariant. */
4809 extern bool tree_invariant_p (tree
);
4811 /* Look inside EXPR into any simple arithmetic operations. Return the
4812 outermost non-arithmetic or non-invariant node. */
4814 extern tree
skip_simple_arithmetic (tree
);
4816 /* Look inside EXPR into simple arithmetic operations involving constants.
4817 Return the outermost non-arithmetic or non-constant node. */
4819 extern tree
skip_simple_constant_arithmetic (tree
);
4821 /* Return which tree structure is used by T. */
4823 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4825 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4826 size or offset that depends on a field within a record. */
4828 extern bool contains_placeholder_p (const_tree
);
4830 /* This macro calls the above function but short-circuits the common
4831 case of a constant to save time. Also check for null. */
4833 #define CONTAINS_PLACEHOLDER_P(EXP) \
4834 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4836 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4837 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4840 extern bool type_contains_placeholder_p (tree
);
4842 /* Given a tree EXP, find all occurrences of references to fields
4843 in a PLACEHOLDER_EXPR and place them in vector REFS without
4844 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4845 we assume here that EXP contains only arithmetic expressions
4846 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4849 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4851 /* This macro calls the above function but short-circuits the common
4852 case of a constant to save time and also checks for NULL. */
4854 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4856 if((EXP) && !TREE_CONSTANT (EXP)) \
4857 find_placeholder_in_expr (EXP, V); \
4860 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4861 return a tree with all occurrences of references to F in a
4862 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4863 CONST_DECLs. Note that we assume here that EXP contains only
4864 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4865 occurring only in their argument list. */
4867 extern tree
substitute_in_expr (tree
, tree
, tree
);
4869 /* This macro calls the above function but short-circuits the common
4870 case of a constant to save time and also checks for NULL. */
4872 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4873 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4875 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4876 for it within OBJ, a tree that is an object or a chain of references. */
4878 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4880 /* This macro calls the above function but short-circuits the common
4881 case of a constant to save time and also checks for NULL. */
4883 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4884 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4885 : substitute_placeholder_in_expr (EXP, OBJ))
4888 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4889 but it can be used multiple times
4890 and only evaluate the subexpressions once. */
4892 extern tree
stabilize_reference (tree
);
4894 /* Return EXP, stripped of any conversions to wider types
4895 in such a way that the result of converting to type FOR_TYPE
4896 is the same as if EXP were converted to FOR_TYPE.
4897 If FOR_TYPE is 0, it signifies EXP's type. */
4899 extern tree
get_unwidened (tree
, tree
);
4901 /* Return OP or a simpler expression for a narrower value
4902 which can be sign-extended or zero-extended to give back OP.
4903 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4904 or 0 if the value should be sign-extended. */
4906 extern tree
get_narrower (tree
, int *);
4908 /* Return true if T is an expression that get_inner_reference handles. */
4911 handled_component_p (const_tree t
)
4913 switch (TREE_CODE (t
))
4918 case ARRAY_RANGE_REF
:
4921 case VIEW_CONVERT_EXPR
:
4929 /* Return true T is a component with reverse storage order. */
4932 reverse_storage_order_for_component_p (tree t
)
4934 /* The storage order only applies to scalar components. */
4935 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4938 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4939 t
= TREE_OPERAND (t
, 0);
4941 switch (TREE_CODE (t
))
4945 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4946 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4947 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4948 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4952 return REF_REVERSE_STORAGE_ORDER (t
);
4954 case ARRAY_RANGE_REF
:
4955 case VIEW_CONVERT_EXPR
:
4963 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4964 that can modify the storage order of objects. Note that, even if the
4965 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4966 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4967 it can change the partition of the aggregate object into scalars. */
4970 storage_order_barrier_p (const_tree t
)
4972 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4975 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4976 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4979 tree op
= TREE_OPERAND (t
, 0);
4981 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4982 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4988 /* Given a DECL or TYPE, return the scope in which it was declared, or
4989 NUL_TREE if there is no containing scope. */
4991 extern tree
get_containing_scope (const_tree
);
4993 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
4995 extern const_tree
get_ultimate_context (const_tree
);
4997 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4999 extern tree
decl_function_context (const_tree
);
5001 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5002 this _DECL with its context, or zero if none. */
5003 extern tree
decl_type_context (const_tree
);
5005 /* Return true if EXPR is the real constant zero. */
5006 extern bool real_zerop (const_tree
);
5008 /* Initialize the iterator I with arguments from function FNDECL */
5011 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5013 i
->next
= TYPE_ARG_TYPES (fntype
);
5016 /* Return a pointer that holds the next argument if there are more arguments to
5017 handle, otherwise return NULL. */
5019 static inline tree
*
5020 function_args_iter_cond_ptr (function_args_iterator
*i
)
5022 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5025 /* Return the next argument if there are more arguments to handle, otherwise
5029 function_args_iter_cond (function_args_iterator
*i
)
5031 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5034 /* Advance to the next argument. */
5036 function_args_iter_next (function_args_iterator
*i
)
5038 gcc_assert (i
->next
!= NULL_TREE
);
5039 i
->next
= TREE_CHAIN (i
->next
);
5042 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5045 inlined_function_outer_scope_p (const_tree block
)
5047 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
5050 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5051 to point to the next tree element. ITER is an instance of
5052 function_args_iterator used to iterate the arguments. */
5053 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5054 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5055 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5056 function_args_iter_next (&(ITER)))
5058 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5059 to the next tree element. ITER is an instance of function_args_iterator
5060 used to iterate the arguments. */
5061 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5062 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5063 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5064 function_args_iter_next (&(ITER)))
5067 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5068 extern unsigned crc32_string (unsigned, const char *);
5070 crc32_unsigned (unsigned chksum
, unsigned value
)
5072 return crc32_unsigned_n (chksum
, value
, 4);
5075 crc32_byte (unsigned chksum
, char byte
)
5077 return crc32_unsigned_n (chksum
, byte
, 1);
5079 extern void clean_symbol_name (char *);
5080 extern tree
get_file_function_name (const char *);
5081 extern tree
get_callee_fndecl (const_tree
);
5082 extern combined_fn
get_call_combined_fn (const_tree
);
5083 extern int type_num_arguments (const_tree
);
5084 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
5085 extern bool associative_tree_code (enum tree_code
);
5086 extern bool commutative_tree_code (enum tree_code
);
5087 extern bool commutative_ternary_tree_code (enum tree_code
);
5088 extern bool operation_can_overflow (enum tree_code
);
5089 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
5090 extern tree
upper_bound_in_type (tree
, tree
);
5091 extern tree
lower_bound_in_type (tree
, tree
);
5092 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5093 extern tree
create_artificial_label (location_t
);
5094 extern const char *get_name (tree
);
5095 extern bool stdarg_p (const_tree
);
5096 extern bool prototype_p (const_tree
);
5097 extern bool is_typedef_decl (const_tree x
);
5098 extern bool typedef_variant_p (const_tree
);
5099 extern bool auto_var_p (const_tree
);
5100 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5101 extern tree
build_low_bits_mask (tree
, unsigned);
5102 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
5103 extern tree
tree_strip_nop_conversions (tree
);
5104 extern tree
tree_strip_sign_nop_conversions (tree
);
5105 extern const_tree
strip_invariant_refs (const_tree
);
5106 extern tree
lhd_gcc_personality (void);
5107 extern void assign_assembler_name_if_needed (tree
);
5108 extern bool warn_deprecated_use (tree
, tree
);
5109 extern void cache_integer_cst (tree
);
5110 extern const char *combined_fn_name (combined_fn
);
5112 /* Compare and hash for any structure which begins with a canonical
5113 pointer. Assumes all pointers are interchangeable, which is sort
5114 of already assumed by gcc elsewhere IIRC. */
5117 struct_ptr_eq (const void *a
, const void *b
)
5119 const void * const * x
= (const void * const *) a
;
5120 const void * const * y
= (const void * const *) b
;
5124 static inline hashval_t
5125 struct_ptr_hash (const void *a
)
5127 const void * const * x
= (const void * const *) a
;
5128 return (intptr_t)*x
>> 4;
5131 /* Return nonzero if CODE is a tree code that represents a truth value. */
5133 truth_value_p (enum tree_code code
)
5135 return (TREE_CODE_CLASS (code
) == tcc_comparison
5136 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5137 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5138 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5141 /* Return whether TYPE is a type suitable for an offset for
5142 a POINTER_PLUS_EXPR. */
5144 ptrofftype_p (tree type
)
5146 return (INTEGRAL_TYPE_P (type
)
5147 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5148 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5151 /* Return true if the argument is a complete type or an array
5152 of unknown bound (whose type is incomplete but) whose elements
5153 have complete type. */
5155 complete_or_array_type_p (const_tree type
)
5157 return COMPLETE_TYPE_P (type
)
5158 || (TREE_CODE (type
) == ARRAY_TYPE
5159 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
5162 /* Return true if the value of T could be represented as a poly_widest_int. */
5165 poly_int_tree_p (const_tree t
)
5167 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
5170 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5171 to be a poly_uint64. (This is always true at the gimple level.) */
5174 bit_field_size (const_tree t
)
5176 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
5179 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5180 known to be a poly_uint64. (This is always true at the gimple level.) */
5183 bit_field_offset (const_tree t
)
5185 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
5188 extern tree
strip_float_extensions (tree
);
5189 extern bool really_constant_p (const_tree
);
5190 extern bool ptrdiff_tree_p (const_tree
, poly_int64_pod
*);
5191 extern bool decl_address_invariant_p (const_tree
);
5192 extern bool decl_address_ip_invariant_p (const_tree
);
5193 extern bool int_fits_type_p (const_tree
, const_tree
)
5194 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
5195 #ifndef GENERATOR_FILE
5196 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5198 extern bool variably_modified_type_p (tree
, tree
);
5199 extern int tree_log2 (const_tree
);
5200 extern int tree_floor_log2 (const_tree
);
5201 extern unsigned int tree_ctz (const_tree
);
5202 extern int simple_cst_equal (const_tree
, const_tree
);
5207 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
5211 /* Compat version until all callers are converted. Return hash for
5213 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
5215 inchash::hash
hstate (seed
);
5216 inchash::add_expr (tree
, hstate
);
5217 return hstate
.end ();
5220 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5221 extern bool type_list_equal (const_tree
, const_tree
);
5222 extern bool chain_member (const_tree
, const_tree
);
5223 extern void dump_tree_statistics (void);
5224 extern void recompute_tree_invariant_for_addr_expr (tree
);
5225 extern bool needs_to_live_in_memory (const_tree
);
5226 extern tree
reconstruct_complex_type (tree
, tree
);
5227 extern bool real_onep (const_tree
);
5228 extern bool real_minus_onep (const_tree
);
5229 extern void init_ttree (void);
5230 extern void build_common_tree_nodes (bool);
5231 extern void build_common_builtin_nodes (void);
5232 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5233 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
5234 extern tree
build_range_type (tree
, tree
, tree
);
5235 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5236 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5237 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5238 extern tree
tree_block (tree
);
5239 extern void tree_set_block (tree
, tree
);
5240 extern location_t
*block_nonartificial_location (tree
);
5241 extern location_t
tree_nonartificial_location (tree
);
5242 extern tree
block_ultimate_origin (const_tree
);
5243 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5244 extern bool virtual_method_call_p (const_tree
, bool = false);
5245 extern tree
obj_type_ref_class (const_tree ref
, bool = false);
5246 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5247 extern bool contains_bitfld_component_ref_p (const_tree
);
5248 extern bool block_may_fallthru (const_tree
);
5249 extern void using_eh_for_cleanups (void);
5250 extern bool using_eh_for_cleanups_p (void);
5251 extern const char *get_tree_code_name (enum tree_code
);
5252 extern void set_call_expr_flags (tree
, int);
5253 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5255 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5257 #define walk_tree(a,b,c,d) \
5258 walk_tree_1 (a, b, c, d, NULL)
5259 #define walk_tree_without_duplicates(a,b,c) \
5260 walk_tree_without_duplicates_1 (a, b, c, NULL)
5262 extern tree
drop_tree_overflow (tree
);
5264 /* Given a memory reference expression T, return its base address.
5265 The base address of a memory reference expression is the main
5266 object being referenced. */
5267 extern tree
get_base_address (tree t
);
5269 /* Return a tree of sizetype representing the size, in bytes, of the element
5270 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5271 extern tree
array_ref_element_size (tree
);
5273 /* Return a typenode for the "standard" C type with a given name. */
5274 extern tree
get_typenode_from_name (const char *);
5276 /* Return a tree representing the upper bound of the array mentioned in
5277 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5278 extern tree
array_ref_up_bound (tree
);
5280 /* Return a tree representing the lower bound of the array mentioned in
5281 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5282 extern tree
array_ref_low_bound (tree
);
5284 /* Returns true if REF is an array reference or a component reference
5285 to an array at the end of a structure. If this is the case, the array
5286 may be allocated larger than its upper bound implies. */
5287 extern bool array_at_struct_end_p (tree
);
5289 /* Return a tree representing the offset, in bytes, of the field referenced
5290 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5291 extern tree
component_ref_field_offset (tree
);
5293 /* Return the size of the member referenced by the COMPONENT_REF, using
5294 its initializer expression if necessary in order to determine the size
5295 of an initialized flexible array member. The size might be zero for
5296 an object with an uninitialized flexible array member or null if it
5297 cannot be determined. */
5298 extern tree
component_ref_size (tree
, bool * = NULL
);
5300 extern int tree_map_base_eq (const void *, const void *);
5301 extern unsigned int tree_map_base_hash (const void *);
5302 extern int tree_map_base_marked_p (const void *);
5303 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5304 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5305 bool trust_type_canonical
= true);
5306 extern bool type_with_interoperable_signedness (const_tree
);
5307 extern bitmap
get_nonnull_args (const_tree
);
5308 extern int get_range_pos_neg (tree
);
5310 /* Return simplified tree code of type that is used for canonical type
5312 inline enum tree_code
5313 tree_code_for_canonical_type_merging (enum tree_code code
)
5315 /* By C standard, each enumerated type shall be compatible with char,
5316 a signed integer, or an unsigned integer. The choice of type is
5317 implementation defined (in our case it depends on -fshort-enum).
5319 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5320 type and compare only by their signedness and precision. */
5321 if (code
== ENUMERAL_TYPE
)
5322 return INTEGER_TYPE
;
5323 /* To allow inter-operability between languages having references and
5324 C, we consider reference types and pointers alike. Note that this is
5325 not strictly necessary for C-Fortran 2008 interoperability because
5326 Fortran define C_PTR type that needs to be compatible with C pointers
5327 and we handle this one as ptr_type_node. */
5328 if (code
== REFERENCE_TYPE
)
5329 return POINTER_TYPE
;
5333 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5334 We don't define the types for pointers, arrays and vectors. The reason is
5335 that pointers are handled specially: ptr_type_node accesses conflict with
5336 accesses to all other pointers. This is done by alias.c.
5337 Because alias sets of arrays and vectors are the same as types of their
5338 elements, we can't compute canonical type either. Otherwise we could go
5339 form void *[10] to int *[10] (because they are equivalent for canonical type
5340 machinery) and get wrong TBAA. */
5343 canonical_type_used_p (const_tree t
)
5345 return !(POINTER_TYPE_P (t
)
5346 || TREE_CODE (t
) == ARRAY_TYPE
5347 || TREE_CODE (t
) == VECTOR_TYPE
);
5350 #define tree_map_eq tree_map_base_eq
5351 extern unsigned int tree_map_hash (const void *);
5352 #define tree_map_marked_p tree_map_base_marked_p
5354 #define tree_decl_map_eq tree_map_base_eq
5355 extern unsigned int tree_decl_map_hash (const void *);
5356 #define tree_decl_map_marked_p tree_map_base_marked_p
5358 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5360 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5362 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5364 return tree_decl_map_eq (a
, b
);
5368 keep_cache_entry (tree_decl_map
*&m
)
5370 return ggc_marked_p (m
->base
.from
);
5374 #define tree_int_map_eq tree_map_base_eq
5375 #define tree_int_map_hash tree_map_base_hash
5376 #define tree_int_map_marked_p tree_map_base_marked_p
5378 #define tree_vec_map_eq tree_map_base_eq
5379 #define tree_vec_map_hash tree_decl_map_hash
5380 #define tree_vec_map_marked_p tree_map_base_marked_p
5382 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5383 is a better hash than the pointer value and gives a predictable traversal
5384 order. Additionally it can be used across PCH save/restore. */
5385 struct tree_decl_hash
: ggc_ptr_hash
<tree_node
>
5387 static inline hashval_t
hash (tree
);
5391 tree_decl_hash::hash (tree t
)
5393 return DECL_UID (t
);
5396 /* Similarly for types. Uses TYPE_UID as hash function. */
5397 struct tree_type_hash
: ggc_ptr_hash
<tree_node
>
5399 static inline hashval_t
hash (tree
);
5403 tree_type_hash::hash (tree t
)
5405 return TYPE_UID (t
);
5408 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5409 here, but the SSA_NAME_VERSION is a better hash than the pointer
5410 value and gives a predictable traversal order. */
5411 struct tree_ssa_name_hash
: ggc_ptr_hash
<tree_node
>
5413 static inline hashval_t
hash (tree
);
5417 tree_ssa_name_hash::hash (tree t
)
5419 return SSA_NAME_VERSION (t
);
5422 /* Hasher for general trees, based on their TREE_HASH. */
5423 struct tree_hash
: ggc_ptr_hash
<tree_node
>
5425 static hashval_t
hash (tree
);
5429 tree_hash::hash (tree t
)
5431 return TREE_HASH (t
);
5434 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5435 such a map will not mark keys, and will mark values if the key is already
5437 struct tree_cache_traits
5438 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5439 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5441 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5442 This is for hash_maps from decls to trees that need to work across PCH. */
5443 struct decl_tree_cache_traits
5444 : simple_cache_map_traits
<tree_decl_hash
, tree
> { };
5445 typedef hash_map
<tree
,tree
,decl_tree_cache_traits
> decl_tree_cache_map
;
5447 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5448 This is for hash_maps from types to trees that need to work across PCH. */
5449 struct type_tree_cache_traits
5450 : simple_cache_map_traits
<tree_type_hash
, tree
> { };
5451 typedef hash_map
<tree
,tree
,type_tree_cache_traits
> type_tree_cache_map
;
5453 /* Initialize the abstract argument list iterator object ITER with the
5454 arguments from CALL_EXPR node EXP. */
5456 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5459 iter
->n
= call_expr_nargs (exp
);
5464 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5467 iter
->n
= call_expr_nargs (exp
);
5471 /* Return the next argument from abstract argument list iterator object ITER,
5472 and advance its state. Return NULL_TREE if there are no more arguments. */
5474 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5477 if (iter
->i
>= iter
->n
)
5479 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5484 static inline const_tree
5485 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5488 if (iter
->i
>= iter
->n
)
5490 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5495 /* Initialize the abstract argument list iterator object ITER, then advance
5496 past and return the first argument. Useful in for expressions, e.g.
5497 for (arg = first_call_expr_arg (exp, &iter); arg;
5498 arg = next_call_expr_arg (&iter)) */
5500 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5502 init_call_expr_arg_iterator (exp
, iter
);
5503 return next_call_expr_arg (iter
);
5506 static inline const_tree
5507 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5509 init_const_call_expr_arg_iterator (exp
, iter
);
5510 return next_const_call_expr_arg (iter
);
5513 /* Test whether there are more arguments in abstract argument list iterator
5514 ITER, without changing its state. */
5516 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5518 return (iter
->i
< iter
->n
);
5521 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5522 (of type call_expr_arg_iterator) to hold the iteration state. */
5523 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5524 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5525 (arg) = next_call_expr_arg (&(iter)))
5527 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5528 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5529 (arg) = next_const_call_expr_arg (&(iter)))
5531 /* Return true if tree node T is a language-specific node. */
5533 is_lang_specific (const_tree t
)
5535 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5538 /* Valid builtin number. */
5539 #define BUILTIN_VALID_P(FNCODE) \
5540 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5542 /* Return the tree node for an explicit standard builtin function or NULL. */
5544 builtin_decl_explicit (enum built_in_function fncode
)
5546 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5548 return builtin_info
[(size_t)fncode
].decl
;
5551 /* Return the tree node for an implicit builtin function or NULL. */
5553 builtin_decl_implicit (enum built_in_function fncode
)
5555 size_t uns_fncode
= (size_t)fncode
;
5556 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5558 if (!builtin_info
[uns_fncode
].implicit_p
)
5561 return builtin_info
[uns_fncode
].decl
;
5564 /* Set explicit builtin function nodes and whether it is an implicit
5568 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5570 size_t ufncode
= (size_t)fncode
;
5572 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5573 && (decl
!= NULL_TREE
|| !implicit_p
));
5575 builtin_info
[ufncode
].decl
= decl
;
5576 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5577 builtin_info
[ufncode
].declared_p
= false;
5580 /* Set the implicit flag for a builtin function. */
5583 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5585 size_t uns_fncode
= (size_t)fncode
;
5587 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5588 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5590 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5593 /* Set the declared flag for a builtin function. */
5596 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5598 size_t uns_fncode
= (size_t)fncode
;
5600 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5601 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5603 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5606 /* Return whether the standard builtin function can be used as an explicit
5610 builtin_decl_explicit_p (enum built_in_function fncode
)
5612 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5613 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5616 /* Return whether the standard builtin function can be used implicitly. */
5619 builtin_decl_implicit_p (enum built_in_function fncode
)
5621 size_t uns_fncode
= (size_t)fncode
;
5623 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5624 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5625 && builtin_info
[uns_fncode
].implicit_p
);
5628 /* Return whether the standard builtin function was declared. */
5631 builtin_decl_declared_p (enum built_in_function fncode
)
5633 size_t uns_fncode
= (size_t)fncode
;
5635 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5636 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5637 && builtin_info
[uns_fncode
].declared_p
);
5640 /* Determine if the function identified by FNDECL is one that
5641 makes sense to match by name, for those places where we detect
5642 "magic" functions by name.
5644 Return true if FNDECL has a name and is an extern fndecl at file scope.
5645 FNDECL must be a non-NULL decl.
5647 Avoid using this, as it's generally better to use attributes rather
5648 than to check for functions by name. */
5651 maybe_special_function_p (const_tree fndecl
)
5653 tree name_decl
= DECL_NAME (fndecl
);
5655 /* Exclude functions not at the file scope, or not `extern',
5656 since they are not the magic functions we would otherwise
5658 && (DECL_CONTEXT (fndecl
) == NULL_TREE
5659 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
5660 && TREE_PUBLIC (fndecl
))
5665 /* Return true if T (assumed to be a DECL) is a global variable.
5666 A variable is considered global if its storage is not automatic. */
5669 is_global_var (const_tree t
)
5671 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5674 /* Return true if VAR may be aliased. A variable is considered as
5675 maybe aliased if it has its address taken by the local TU
5676 or possibly by another TU and might be modified through a pointer. */
5679 may_be_aliased (const_tree var
)
5681 return (TREE_CODE (var
) != CONST_DECL
5682 && (TREE_PUBLIC (var
)
5683 || DECL_EXTERNAL (var
)
5684 || TREE_ADDRESSABLE (var
))
5685 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5686 && (TREE_READONLY (var
)
5687 || (TREE_CODE (var
) == VAR_DECL
5688 && DECL_NONALIASED (var
)))));
5691 /* Return pointer to optimization flags of FNDECL. */
5692 static inline struct cl_optimization
*
5693 opts_for_fn (const_tree fndecl
)
5695 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5696 if (fn_opts
== NULL_TREE
)
5697 fn_opts
= optimization_default_node
;
5698 return TREE_OPTIMIZATION (fn_opts
);
5701 /* Return pointer to target flags of FNDECL. */
5702 static inline cl_target_option
*
5703 target_opts_for_fn (const_tree fndecl
)
5705 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5706 if (fn_opts
== NULL_TREE
)
5707 fn_opts
= target_option_default_node
;
5708 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5711 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5712 the optimization level of function fndecl. */
5713 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5715 /* For anonymous aggregate types, we need some sort of name to
5716 hold on to. In practice, this should not appear, but it should
5717 not be harmful if it does. Identifiers returned will be
5718 IDENTIFIER_ANON_P. */
5719 extern tree
make_anon_name ();
5721 /* The tree and const_tree overload templates. */
5724 class unextended_tree
5730 unextended_tree () {}
5731 unextended_tree (const_tree t
) : m_t (t
) {}
5733 unsigned int get_precision () const;
5734 const HOST_WIDE_INT
*get_val () const;
5735 unsigned int get_len () const;
5736 const_tree
get_tree () const { return m_t
; }
5740 struct int_traits
<unextended_tree
>
5742 static const enum precision_type precision_type
= VAR_PRECISION
;
5743 static const bool host_dependent_precision
= false;
5744 static const bool is_sign_extended
= false;
5755 extended_tree (const_tree
);
5757 unsigned int get_precision () const;
5758 const HOST_WIDE_INT
*get_val () const;
5759 unsigned int get_len () const;
5760 const_tree
get_tree () const { return m_t
; }
5764 struct int_traits
<extended_tree
<N
> >
5766 static const enum precision_type precision_type
= CONST_PRECISION
;
5767 static const bool host_dependent_precision
= false;
5768 static const bool is_sign_extended
= true;
5769 static const unsigned int precision
= N
;
5772 typedef extended_tree
<WIDE_INT_MAX_PRECISION
> widest_extended_tree
;
5773 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
5775 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
5776 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
5777 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
5780 tree_to_widest_ref
to_widest (const_tree
);
5781 tree_to_offset_ref
to_offset (const_tree
);
5782 tree_to_wide_ref
to_wide (const_tree
);
5783 wide_int
to_wide (const_tree
, unsigned int);
5785 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5786 generic_wide_int
<widest_extended_tree
> >
5787 tree_to_poly_widest_ref
;
5788 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5789 generic_wide_int
<offset_extended_tree
> >
5790 tree_to_poly_offset_ref
;
5791 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5792 generic_wide_int
<unextended_tree
> >
5793 tree_to_poly_wide_ref
;
5795 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
5796 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
5797 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
5800 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
5802 typedef generic_wide_int
<extended_tree
<N
> > extended
;
5803 static extended
zero (const extended
&);
5807 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
5809 typedef generic_wide_int
<unextended_tree
> unextended
;
5810 static unextended
zero (const unextended
&);
5814 /* Used to convert a tree to a widest2_int like this:
5815 widest2_int foo = widest2_int_cst (some_tree). */
5816 typedef generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
* 2> >
5819 /* Refer to INTEGER_CST T as though it were a widest_int.
5821 This function gives T's actual numerical value, influenced by the
5822 signedness of its type. For example, a signed byte with just the
5823 top bit set would be -128 while an unsigned byte with the same
5824 bit pattern would be 128.
5826 This is the right choice when operating on groups of INTEGER_CSTs
5827 that might have different signedness or precision. It is also the
5828 right choice in code that specifically needs an approximation of
5829 infinite-precision arithmetic instead of normal modulo arithmetic.
5831 The approximation of infinite precision is good enough for realistic
5832 numbers of additions and subtractions of INTEGER_CSTs (where
5833 "realistic" includes any number less than 1 << 31) but it cannot
5834 represent the result of multiplying the two largest supported
5835 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
5836 of multiplying two arbitrary INTEGER_CSTs and checking that the
5837 result is representable as a widest_int.
5839 Note that any overflow checking done on these values is relative to
5840 the range of widest_int rather than the range of a TREE_TYPE.
5842 Calling this function should have no overhead in release builds,
5843 so it is OK to call it several times for the same tree. If it is
5844 useful for readability reasons to reduce the number of calls,
5845 it is more efficient to use:
5847 wi::tree_to_widest_ref wt = wi::to_widest (t);
5851 widest_int wt = wi::to_widest (t). */
5853 inline wi::tree_to_widest_ref
5854 wi::to_widest (const_tree t
)
5859 /* Refer to INTEGER_CST T as though it were an offset_int.
5861 This function is an optimisation of wi::to_widest for cases
5862 in which T is known to be a bit or byte count in the range
5863 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
5864 the target's address size in bits.
5866 This is the right choice when operating on bit or byte counts as
5867 untyped numbers rather than M-bit values. The wi::to_widest comments
5868 about addition, subtraction and multiplication apply here: sequences
5869 of 1 << 31 additions and subtractions do not induce overflow, but
5870 multiplying the largest sizes might. Again,
5872 wi::tree_to_offset_ref wt = wi::to_offset (t);
5874 is more efficient than:
5876 offset_int wt = wi::to_offset (t). */
5878 inline wi::tree_to_offset_ref
5879 wi::to_offset (const_tree t
)
5884 /* Refer to INTEGER_CST T as though it were a wide_int.
5886 In contrast to the approximation of infinite-precision numbers given
5887 by wi::to_widest and wi::to_offset, this function treats T as a
5888 signless collection of N bits, where N is the precision of T's type.
5889 As with machine registers, signedness is determined by the operation
5890 rather than the operands; for example, there is a distinction between
5891 signed and unsigned division.
5893 This is the right choice when operating on values with the same type
5894 using normal modulo arithmetic. The overflow-checking forms of things
5895 like wi::add check whether the result can be represented in T's type.
5897 Calling this function should have no overhead in release builds,
5898 so it is OK to call it several times for the same tree. If it is
5899 useful for readability reasons to reduce the number of calls,
5900 it is more efficient to use:
5902 wi::tree_to_wide_ref wt = wi::to_wide (t);
5906 wide_int wt = wi::to_wide (t). */
5908 inline wi::tree_to_wide_ref
5909 wi::to_wide (const_tree t
)
5911 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
5912 TYPE_PRECISION (TREE_TYPE (t
)));
5915 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5916 truncating as necessary. When extending, use sign extension if T's
5917 type is signed and zero extension if T's type is unsigned. */
5920 wi::to_wide (const_tree t
, unsigned int prec
)
5922 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
5926 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5929 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5934 wi::extended_tree
<N
>::get_precision () const
5940 inline const HOST_WIDE_INT
*
5941 wi::extended_tree
<N
>::get_val () const
5943 return &TREE_INT_CST_ELT (m_t
, 0);
5948 wi::extended_tree
<N
>::get_len () const
5950 if (N
== ADDR_MAX_PRECISION
)
5951 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5952 else if (N
>= WIDE_INT_MAX_PRECISION
)
5953 return TREE_INT_CST_EXT_NUNITS (m_t
);
5955 /* This class is designed to be used for specific output precisions
5956 and needs to be as fast as possible, so there is no fallback for
5962 wi::unextended_tree::get_precision () const
5964 return TYPE_PRECISION (TREE_TYPE (m_t
));
5967 inline const HOST_WIDE_INT
*
5968 wi::unextended_tree::get_val () const
5970 return &TREE_INT_CST_ELT (m_t
, 0);
5974 wi::unextended_tree::get_len () const
5976 return TREE_INT_CST_NUNITS (m_t
);
5979 /* Return the value of a POLY_INT_CST in its native precision. */
5981 inline wi::tree_to_poly_wide_ref
5982 poly_int_cst_value (const_tree x
)
5984 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
5985 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5986 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
5990 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5991 poly_widest_int. See wi::to_widest for more details. */
5993 inline wi::tree_to_poly_widest_ref
5994 wi::to_poly_widest (const_tree t
)
5996 if (POLY_INT_CST_P (t
))
5998 poly_int
<NUM_POLY_INT_COEFFS
,
5999 generic_wide_int
<widest_extended_tree
> > res
;
6000 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6001 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6007 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6008 poly_offset_int. See wi::to_offset for more details. */
6010 inline wi::tree_to_poly_offset_ref
6011 wi::to_poly_offset (const_tree t
)
6013 if (POLY_INT_CST_P (t
))
6015 poly_int
<NUM_POLY_INT_COEFFS
,
6016 generic_wide_int
<offset_extended_tree
> > res
;
6017 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6018 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6024 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6025 poly_wide_int. See wi::to_wide for more details. */
6027 inline wi::tree_to_poly_wide_ref
6028 wi::to_poly_wide (const_tree t
)
6030 if (POLY_INT_CST_P (t
))
6031 return poly_int_cst_value (t
);
6036 inline generic_wide_int
<wi::extended_tree
<N
> >
6037 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
6038 wi::CONST_PRECISION
>::zero (const extended
&x
)
6040 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6043 inline generic_wide_int
<wi::unextended_tree
>
6044 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
6045 wi::VAR_PRECISION
>::zero (const unextended
&x
)
6047 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6052 template <typename T
>
6053 bool fits_to_boolean_p (const T
&x
, const_tree
);
6055 template <typename T
>
6056 bool fits_to_tree_p (const T
&x
, const_tree
);
6058 wide_int
min_value (const_tree
);
6059 wide_int
max_value (const_tree
);
6060 wide_int
from_mpz (const_tree
, mpz_t
, bool);
6063 template <typename T
>
6065 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
6067 typedef typename poly_int_traits
<T
>::int_type int_type
;
6068 return (known_eq (x
, int_type (0))
6069 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
6072 template <typename T
>
6074 wi::fits_to_tree_p (const T
&x
, const_tree type
)
6076 /* Non-standard boolean types can have arbitrary precision but various
6077 transformations assume that they can only take values 0 and +/-1. */
6078 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
6079 return fits_to_boolean_p (x
, type
);
6081 if (TYPE_UNSIGNED (type
))
6082 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
6084 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
6087 /* Produce the smallest number that is represented in TYPE. The precision
6088 and sign are taken from TYPE. */
6090 wi::min_value (const_tree type
)
6092 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6095 /* Produce the largest number that is represented in TYPE. The precision
6096 and sign are taken from TYPE. */
6098 wi::max_value (const_tree type
)
6100 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6103 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6104 extending both according to their respective TYPE_SIGNs. */
6107 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6109 return wi::to_widest (t1
) < wi::to_widest (t2
);
6112 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6113 extending both according to their respective TYPE_SIGNs. */
6116 tree_int_cst_le (const_tree t1
, const_tree t2
)
6118 return wi::to_widest (t1
) <= wi::to_widest (t2
);
6121 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6122 are both INTEGER_CSTs and their values are extended according to their
6123 respective TYPE_SIGNs. */
6126 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6128 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
6131 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6132 but none of these files are allowed to be included from front ends.
6133 They should be split in two. One suitable for the FEs, the other suitable
6136 /* Assign the RTX to declaration. */
6137 extern void set_decl_rtl (tree
, rtx
);
6138 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
6140 /* Given an expression EXP that is a handled_component_p,
6141 look for the ultimate containing object, which is returned and specify
6142 the access position and size. */
6143 extern tree
get_inner_reference (tree
, poly_int64_pod
*, poly_int64_pod
*,
6144 tree
*, machine_mode
*, int *, int *, int *);
6146 extern tree
build_personality_function (const char *);
6148 struct GTY(()) int_n_trees_t
{
6149 /* These parts are initialized at runtime */
6154 /* This is also in machmode.h */
6155 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
6156 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
6158 /* Like bit_position, but return as an integer. It must be representable in
6159 that way (since it could be a signed value, we don't have the
6160 option of returning -1 like int_size_in_byte can. */
6162 inline HOST_WIDE_INT
6163 int_bit_position (const_tree field
)
6165 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
6166 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
6169 /* Return true if it makes sense to consider alias set for a type T. */
6172 type_with_alias_set_p (const_tree t
)
6174 /* Function and method types are never accessed as memory locations. */
6175 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
6178 if (COMPLETE_TYPE_P (t
))
6181 /* Incomplete types cannot be accessed in general except for arrays
6182 where we can fetch its element despite we have no array bounds. */
6183 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
6189 extern location_t
set_block (location_t loc
, tree block
);
6191 extern void gt_ggc_mx (tree
&);
6192 extern void gt_pch_nx (tree
&);
6193 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
6195 extern bool nonnull_arg_p (const_tree
);
6196 extern bool default_is_empty_record (const_tree
);
6197 extern bool flexible_array_type_p (const_tree
);
6198 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
6199 extern tree
arg_size_in_bytes (const_tree
);
6200 extern bool expr_type_first_operand_type_p (tree_code
);
6203 set_source_range (tree expr
, location_t start
, location_t finish
);
6206 set_source_range (tree expr
, source_range src_range
);
6208 /* Return true if it makes sense to promote/demote from_type to to_type. */
6210 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
6212 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
6214 /* OK to promote if to_type is no bigger than word_mode. */
6215 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
6218 /* Otherwise, allow only if narrowing or same precision conversions. */
6219 return to_type_precision
<= TYPE_PRECISION (from_type
);
6222 /* Pointer type used to declare builtins before we have seen its real
6224 class builtin_structptr_type
6231 extern const builtin_structptr_type builtin_structptr_types
[6];
6233 /* Return true if type T has the same precision as its underlying mode. */
6236 type_has_mode_precision_p (const_tree t
)
6238 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
6241 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6243 Note that it is different from the DECL_IS_BUILTIN accessor. For
6244 instance, user declared prototypes of C library functions are not
6245 DECL_IS_BUILTIN but may be fndecl_built_in_p. */
6248 fndecl_built_in_p (const_tree node
)
6250 return DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
;
6253 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6257 fndecl_built_in_p (const_tree node
, built_in_class klass
)
6259 return fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
;
6262 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6263 of class KLASS with name equal to NAME. */
6266 fndecl_built_in_p (const_tree node
, unsigned int name
, built_in_class klass
)
6268 return (fndecl_built_in_p (node
, klass
)
6269 && DECL_UNCHECKED_FUNCTION_CODE (node
) == name
);
6272 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6273 of BUILT_IN_NORMAL class with name equal to NAME. */
6276 fndecl_built_in_p (const_tree node
, built_in_function name
)
6278 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
6279 && DECL_FUNCTION_CODE (node
) == name
);
6282 /* A struct for encapsulating location information about an operator
6283 and the operation built from it.
6285 m_operator_loc is the location of the operator
6286 m_combined_loc is the location of the compound expression.
6288 For example, given "a && b" the, operator location is:
6291 and the combined location is:
6294 Capturing this information allows for class binary_op_rich_location
6295 to provide detailed information about e.g. type mismatches in binary
6296 operations where enough location information is available:
6304 falling back to just showing the combined location:
6314 location_t m_operator_loc
;
6315 location_t m_combined_loc
;
6317 /* 1-argument ctor, for constructing from a combined location. */
6318 op_location_t (location_t combined_loc
)
6319 : m_operator_loc (UNKNOWN_LOCATION
), m_combined_loc (combined_loc
)
6322 /* 2-argument ctor, for distinguishing between the operator's location
6323 and the combined location. */
6324 op_location_t (location_t operator_loc
, location_t combined_loc
)
6325 : m_operator_loc (operator_loc
), m_combined_loc (combined_loc
)
6328 /* Implicitly convert back to a location_t, using the combined location. */
6329 operator location_t () const { return m_combined_loc
; }
6332 #endif /* GCC_TREE_H */