1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2023 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"
26 /* Convert a target-independent built-in function code to a combined_fn. */
29 as_combined_fn (built_in_function fn
)
31 return combined_fn (int (fn
));
34 /* Convert an internal function code to a combined_fn. */
37 as_combined_fn (internal_fn fn
)
39 return combined_fn (int (fn
) + int (END_BUILTINS
));
42 /* Return true if CODE is a target-independent built-in function. */
45 builtin_fn_p (combined_fn code
)
47 return int (code
) < int (END_BUILTINS
);
50 /* Return the target-independent built-in function represented by CODE.
51 Only valid if builtin_fn_p (CODE). */
53 inline built_in_function
54 as_builtin_fn (combined_fn code
)
56 gcc_checking_assert (builtin_fn_p (code
));
57 return built_in_function (int (code
));
60 /* Return true if CODE is an internal function. */
63 internal_fn_p (combined_fn code
)
65 return int (code
) >= int (END_BUILTINS
);
68 /* Return the internal function represented by CODE. Only valid if
69 internal_fn_p (CODE). */
72 as_internal_fn (combined_fn code
)
74 gcc_checking_assert (internal_fn_p (code
));
75 return internal_fn (int (code
) - int (END_BUILTINS
));
78 /* Helper to transparently allow tree codes and builtin function codes
79 exist in one storage entity. */
84 code_helper (tree_code code
) : rep ((int) code
) {}
85 code_helper (combined_fn fn
) : rep (-(int) fn
) {}
86 code_helper (internal_fn fn
) : rep (-(int) as_combined_fn (fn
)) {}
87 explicit operator tree_code () const { return (tree_code
) rep
; }
88 explicit operator combined_fn () const { return (combined_fn
) -rep
; }
89 explicit operator internal_fn () const;
90 explicit operator built_in_function () const;
91 bool is_tree_code () const { return rep
> 0; }
92 bool is_fn_code () const { return rep
< 0; }
93 bool is_internal_fn () const;
94 bool is_builtin_fn () const;
95 int get_rep () const { return rep
; }
96 tree_code
safe_as_tree_code () const;
97 combined_fn
safe_as_fn_code () const;
98 bool operator== (const code_helper
&other
) { return rep
== other
.rep
; }
99 bool operator!= (const code_helper
&other
) { return rep
!= other
.rep
; }
100 bool operator== (tree_code c
) { return rep
== code_helper (c
).rep
; }
101 bool operator!= (tree_code c
) { return rep
!= code_helper (c
).rep
; }
107 /* Helper function that returns the tree_code representation of THIS
108 code_helper if it is a tree_code and MAX_TREE_CODES otherwise. This is
109 useful when passing a code_helper to a tree_code only check. */
112 code_helper::safe_as_tree_code () const
114 return is_tree_code () ? (tree_code
) *this : MAX_TREE_CODES
;
117 /* Helper function that returns the combined_fn representation of THIS
118 code_helper if it is a fn_code and CFN_LAST otherwise. This is useful when
119 passing a code_helper to a combined_fn only check. */
122 code_helper::safe_as_fn_code () const {
123 return is_fn_code () ? (combined_fn
) *this : CFN_LAST
;
126 inline code_helper::operator internal_fn () const
128 return as_internal_fn (combined_fn (*this));
131 inline code_helper::operator built_in_function () const
133 return as_builtin_fn (combined_fn (*this));
137 code_helper::is_internal_fn () const
139 return is_fn_code () && internal_fn_p (combined_fn (*this));
143 code_helper::is_builtin_fn () const
145 return is_fn_code () && builtin_fn_p (combined_fn (*this));
148 /* Macros for initializing `tree_contains_struct'. */
149 #define MARK_TS_BASE(C) \
150 (tree_contains_struct[C][TS_BASE] = true)
152 #define MARK_TS_TYPED(C) \
154 tree_contains_struct[C][TS_TYPED] = true)
156 #define MARK_TS_COMMON(C) \
157 (MARK_TS_TYPED (C), \
158 tree_contains_struct[C][TS_COMMON] = true)
160 #define MARK_TS_TYPE_COMMON(C) \
161 (MARK_TS_COMMON (C), \
162 tree_contains_struct[C][TS_TYPE_COMMON] = true)
164 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
165 (MARK_TS_TYPE_COMMON (C), \
166 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
168 #define MARK_TS_TYPE_NON_COMMON(C) \
169 (MARK_TS_TYPE_WITH_LANG_SPECIFIC (C), \
170 tree_contains_struct[C][TS_TYPE_NON_COMMON] = true) \
172 #define MARK_TS_DECL_MINIMAL(C) \
173 (MARK_TS_COMMON (C), \
174 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
176 #define MARK_TS_DECL_COMMON(C) \
177 (MARK_TS_DECL_MINIMAL (C), \
178 tree_contains_struct[C][TS_DECL_COMMON] = true)
180 #define MARK_TS_DECL_WRTL(C) \
181 (MARK_TS_DECL_COMMON (C), \
182 tree_contains_struct[C][TS_DECL_WRTL] = true)
184 #define MARK_TS_DECL_WITH_VIS(C) \
185 (MARK_TS_DECL_WRTL (C), \
186 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
188 #define MARK_TS_DECL_NON_COMMON(C) \
189 (MARK_TS_DECL_WITH_VIS (C), \
190 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
192 #define MARK_TS_EXP(C) \
193 (MARK_TS_TYPED (C), \
194 tree_contains_struct[C][TS_EXP] = true)
196 /* Returns the string representing CLASS. */
198 #define TREE_CODE_CLASS_STRING(CLASS)\
199 tree_code_class_strings[(int) (CLASS)]
201 #if __cpp_inline_variables < 201606L
202 #define TREE_CODE_CLASS(CODE) \
203 tree_code_type_tmpl <0>::tree_code_type[(int) (CODE)]
205 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
208 /* Nonzero if NODE represents an exceptional code. */
210 #define EXCEPTIONAL_CLASS_P(NODE)\
211 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
213 /* Nonzero if NODE represents a constant. */
215 #define CONSTANT_CLASS_P(NODE)\
216 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
218 /* Nonzero if NODE represents a constant, or is a location wrapper
219 around such a node. */
221 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
222 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
224 /* Nonzero if NODE represents a type. */
226 #define TYPE_P(NODE)\
227 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
229 /* Nonzero if NODE represents a declaration. */
231 #define DECL_P(NODE)\
232 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
234 /* True if NODE designates a variable declaration. */
235 #define VAR_P(NODE) \
236 (TREE_CODE (NODE) == VAR_DECL)
238 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
240 #define VAR_OR_FUNCTION_DECL_P(DECL)\
241 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
243 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
244 ascending code order. */
246 #define INDIRECT_REF_P(NODE)\
247 (TREE_CODE (NODE) == INDIRECT_REF)
249 /* Nonzero if NODE represents a reference. */
251 #define REFERENCE_CLASS_P(NODE)\
252 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
254 /* Nonzero if NODE represents a comparison. */
256 #define COMPARISON_CLASS_P(NODE)\
257 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
259 /* Nonzero if NODE represents a unary arithmetic expression. */
261 #define UNARY_CLASS_P(NODE)\
262 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
264 /* Nonzero if NODE represents a binary arithmetic expression. */
266 #define BINARY_CLASS_P(NODE)\
267 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
269 /* Nonzero if NODE represents a statement expression. */
271 #define STATEMENT_CLASS_P(NODE)\
272 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
274 /* Nonzero if NODE represents a function call-like expression with a
275 variable-length operand vector. */
277 #define VL_EXP_CLASS_P(NODE)\
278 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
280 /* Nonzero if NODE represents any other expression. */
282 #define EXPRESSION_CLASS_P(NODE)\
283 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
285 /* Returns nonzero iff NODE represents a type or declaration. */
287 #define IS_TYPE_OR_DECL_P(NODE)\
288 (TYPE_P (NODE) || DECL_P (NODE))
290 /* Returns nonzero iff CLASS is the tree-code class of an
293 #define IS_EXPR_CODE_CLASS(CLASS)\
294 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
296 /* Returns nonzero iff NODE is an expression of some kind. */
298 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
300 #if __cpp_inline_variables < 201606L
301 #define TREE_CODE_LENGTH(CODE) \
302 tree_code_length_tmpl <0>::tree_code_length[(int) (CODE)]
304 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
308 /* Helper macros for math builtins. */
310 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
311 #define CASE_FLT_FN_FLOATN_NX(FN) \
312 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
313 case FN##F32X: case FN##F64X: case FN##F128X
314 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
315 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
317 #define NULL_TREE (tree) NULL
319 /* Define accessors for the fields that all tree nodes have
320 (though some fields are not used for all kinds of nodes). */
322 /* The tree-code says what kind of node it is.
323 Codes are defined in tree.def. */
324 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
325 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
327 /* When checking is enabled, errors will be generated if a tree node
328 is accessed incorrectly. The macros die with a fatal error. */
329 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
331 #define TREE_CHECK(T, CODE) \
332 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
334 #define TREE_NOT_CHECK(T, CODE) \
335 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
337 #define TREE_CHECK2(T, CODE1, CODE2) \
338 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
340 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
341 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
343 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
344 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
346 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
347 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
348 (CODE1), (CODE2), (CODE3)))
350 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
351 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
352 (CODE1), (CODE2), (CODE3), (CODE4)))
354 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
355 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
356 (CODE1), (CODE2), (CODE3), (CODE4)))
358 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
359 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
360 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
362 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
363 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
364 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
366 #define TREE_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) \
367 (tree_check6 ((T), __FILE__, __LINE__, __FUNCTION__, \
368 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), (CODE6)))
370 #define TREE_NOT_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) \
371 (tree_not_check6 ((T), __FILE__, __LINE__, __FUNCTION__, \
372 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), (CODE6)))
374 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
375 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
377 #define TREE_CLASS_CHECK(T, CLASS) \
378 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
380 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
381 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
383 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
384 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
386 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
387 (omp_clause_range_check ((T), (CODE1), (CODE2), \
388 __FILE__, __LINE__, __FUNCTION__))
390 /* These checks have to be special cased. */
391 #define EXPR_CHECK(T) \
392 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
394 /* These checks have to be special cased. */
395 #define NON_TYPE_CHECK(T) \
396 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
398 /* These checks have to be special cased. */
399 #define ANY_INTEGRAL_TYPE_CHECK(T) \
400 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
402 #define TREE_INT_CST_ELT_CHECK(T, I) \
403 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
405 #define TREE_VEC_ELT_CHECK(T, I) \
406 (*(CONST_CAST2 (tree *, typeof (T)*, \
407 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
409 #define OMP_CLAUSE_ELT_CHECK(T, I) \
410 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
412 /* Special checks for TREE_OPERANDs. */
413 #define TREE_OPERAND_CHECK(T, I) \
414 (*(CONST_CAST2 (tree*, typeof (T)*, \
415 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
417 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
418 (*(tree_operand_check_code ((T), (CODE), (I), \
419 __FILE__, __LINE__, __FUNCTION__)))
421 /* Nodes are chained together for many purposes.
422 Types are chained together to record them for being output to the debugger
423 (see the function `chain_type').
424 Decls in the same scope are chained together to record the contents
426 Statement nodes for successive statements used to be chained together.
427 Often lists of things are represented by TREE_LIST nodes that
428 are chained together. */
430 #define TREE_CHAIN(NODE) \
431 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
433 /* In all nodes that are expressions, this is the data type of the expression.
434 In POINTER_TYPE nodes, this is the type that the pointer points to.
435 In ARRAY_TYPE nodes, this is the type of the elements.
436 In VECTOR_TYPE nodes, this is the type of the elements. */
437 #define TREE_TYPE(NODE) \
438 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
440 extern void tree_contains_struct_check_failed (const_tree
,
441 const enum tree_node_structure_enum
,
442 const char *, int, const char *)
443 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
445 extern void tree_check_failed (const_tree
, const char *, int, const char *,
446 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
447 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
448 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
449 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
450 const char *, int, const char *)
451 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
452 extern void tree_range_check_failed (const_tree
, const char *, int,
453 const char *, enum tree_code
,
455 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
456 extern void tree_not_class_check_failed (const_tree
,
457 const enum tree_code_class
,
458 const char *, int, const char *)
459 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
460 extern void tree_int_cst_elt_check_failed (int, int, const char *,
462 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
463 extern void tree_vec_elt_check_failed (int, int, const char *,
465 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
466 extern void phi_node_elt_check_failed (int, int, const char *,
468 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
469 extern void tree_operand_check_failed (int, const_tree
,
470 const char *, int, const char *)
471 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
472 extern void omp_clause_check_failed (const_tree
, const char *, int,
473 const char *, enum omp_clause_code
)
474 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
475 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
477 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
478 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
479 const char *, enum omp_clause_code
,
480 enum omp_clause_code
)
481 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
483 #else /* not ENABLE_TREE_CHECKING, or not gcc */
485 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
486 #define TREE_CHECK(T, CODE) (T)
487 #define TREE_NOT_CHECK(T, CODE) (T)
488 #define TREE_CHECK2(T, CODE1, CODE2) (T)
489 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
490 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
491 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
492 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
493 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
494 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
495 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
496 #define TREE_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) (T)
497 #define TREE_NOT_CHECK6(T, CODE1, CODE2, CODE3, CODE4, CODE5, CODE6) (T)
498 #define TREE_CLASS_CHECK(T, CODE) (T)
499 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
500 #define EXPR_CHECK(T) (T)
501 #define NON_TYPE_CHECK(T) (T)
502 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
503 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
504 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
505 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
506 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
507 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
508 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
509 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
511 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
512 #define TREE_TYPE(NODE) ((NODE)->typed.type)
516 #define TREE_BLOCK(NODE) (tree_block (NODE))
517 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
519 #include "tree-check.h"
521 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
522 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
523 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
524 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
525 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
526 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
527 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
528 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
529 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
530 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
531 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
533 #define RECORD_OR_UNION_CHECK(T) \
534 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
535 #define NOT_RECORD_OR_UNION_CHECK(T) \
536 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
537 #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
538 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
540 #define NUMERICAL_TYPE_CHECK(T) \
541 TREE_CHECK6 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
542 FIXED_POINT_TYPE, BITINT_TYPE)
544 /* Here is how primitive or already-canonicalized types' hash codes
546 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
548 /* A simple hash function for an arbitrary tree node. This must not be
549 used in hash tables which are saved to a PCH. */
550 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
552 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
553 #define CONVERT_EXPR_CODE_P(CODE) \
554 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
556 /* Similarly, but accept an expression instead of a tree code. */
557 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
559 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
561 #define CASE_CONVERT \
565 /* Given an expression as a tree, strip any conversion that generates
566 no instruction. Accepts both tree and const_tree arguments since
567 we are not modifying the tree itself. */
569 #define STRIP_NOPS(EXP) \
570 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
572 /* Like STRIP_NOPS, but don't let the signedness change either. */
574 #define STRIP_SIGN_NOPS(EXP) \
575 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
577 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
579 #define STRIP_TYPE_NOPS(EXP) \
580 while ((CONVERT_EXPR_P (EXP) \
581 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
582 && TREE_OPERAND (EXP, 0) != error_mark_node \
583 && (TREE_TYPE (EXP) \
584 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
585 (EXP) = TREE_OPERAND (EXP, 0)
587 /* Remove unnecessary type conversions according to
588 tree_ssa_useless_type_conversion. */
590 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
591 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
593 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
594 in use to provide a location_t. */
596 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
597 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
599 /* Nonzero if TYPE represents a vector type. */
601 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
603 /* Nonzero if TYPE represents a vector of booleans. */
605 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
606 (TREE_CODE (TYPE) == VECTOR_TYPE \
607 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
609 /* Nonzero if TYPE represents an integral type. Note that we do not
610 include COMPLEX types here. Keep these checks in ascending code
613 #define INTEGRAL_TYPE_P(TYPE) \
614 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
615 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
616 || TREE_CODE (TYPE) == INTEGER_TYPE \
617 || TREE_CODE (TYPE) == BITINT_TYPE)
619 /* Nonzero if TYPE represents an integral type, including complex
620 and vector integer types. */
622 #define ANY_INTEGRAL_TYPE_P(TYPE) \
623 (INTEGRAL_TYPE_P (TYPE) \
624 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
625 || VECTOR_TYPE_P (TYPE)) \
626 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
628 /* Nonzero if TYPE is bit-precise integer type. */
630 #define BITINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == BITINT_TYPE)
632 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
634 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
635 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
637 /* Nonzero if TYPE represents a saturating fixed-point type. */
639 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
640 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
642 /* Nonzero if TYPE represents a fixed-point type. */
644 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
646 /* Nonzero if TYPE represents a scalar floating-point type. */
648 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
650 /* Nonzero if TYPE represents a complex floating-point type. */
652 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
653 (TREE_CODE (TYPE) == COMPLEX_TYPE \
654 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
656 /* Nonzero if TYPE represents a vector integer type. */
658 #define VECTOR_INTEGER_TYPE_P(TYPE) \
659 (VECTOR_TYPE_P (TYPE) \
660 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
663 /* Nonzero if TYPE represents a vector floating-point type. */
665 #define VECTOR_FLOAT_TYPE_P(TYPE) \
666 (VECTOR_TYPE_P (TYPE) \
667 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
669 /* Nonzero if TYPE represents a floating-point type, including complex
670 and vector floating-point types. The vector and complex check does
671 not use the previous two macros to enable early folding. */
673 #define FLOAT_TYPE_P(TYPE) \
674 (SCALAR_FLOAT_TYPE_P (TYPE) \
675 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
676 || VECTOR_TYPE_P (TYPE)) \
677 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
679 /* Nonzero if TYPE represents a decimal floating-point type. */
680 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
681 (SCALAR_FLOAT_TYPE_P (TYPE) \
682 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
684 /* Nonzero if TYPE is a record or union type. */
685 #define RECORD_OR_UNION_TYPE_P(TYPE) \
686 (TREE_CODE (TYPE) == RECORD_TYPE \
687 || TREE_CODE (TYPE) == UNION_TYPE \
688 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
690 /* Nonzero if TYPE represents an aggregate (multi-component) type.
691 Keep these checks in ascending code order. */
693 #define AGGREGATE_TYPE_P(TYPE) \
694 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
696 /* Nonzero if TYPE represents a pointer or reference type.
697 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
698 ascending code order. */
700 #define POINTER_TYPE_P(TYPE) \
701 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
703 /* Nonzero if TYPE represents a pointer to function. */
704 #define FUNCTION_POINTER_TYPE_P(TYPE) \
705 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
707 /* Nonzero if this type is a complete type. */
708 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
710 /* Nonzero if this type is the (possibly qualified) void type. */
711 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
713 /* Nonzero if this type is complete or is cv void. */
714 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
715 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
717 /* Nonzero if this type is complete or is an array with unspecified bound. */
718 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
719 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
721 #define FUNC_OR_METHOD_TYPE_P(NODE) \
722 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
724 #define OPAQUE_TYPE_P(NODE) \
725 (TREE_CODE (NODE) == OPAQUE_TYPE)
727 /* Define many boolean fields that all tree nodes have. */
729 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
730 of this is needed. So it cannot be in a register.
731 In a FUNCTION_DECL it has no meaning.
732 In LABEL_DECL nodes, it means a goto for this label has been seen
733 from a place outside all binding contours that restore stack levels.
734 In an artificial SSA_NAME that points to a stack partition with at least
735 two variables, it means that at least one variable has TREE_ADDRESSABLE.
736 In ..._TYPE nodes, it means that objects of this type must be fully
737 addressable. This means that pieces of this object cannot go into
738 register parameters, for example. If this a function type, this
739 means that the value must be returned in memory.
740 In CONSTRUCTOR nodes, it means object constructed must be in memory.
741 In IDENTIFIER_NODEs, this means that some extern decl for this name
742 had its address taken. That matters for inline functions.
743 In a STMT_EXPR, it means we want the result of the enclosed expression. */
744 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
746 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
747 exit of a function. Calls for which this is true are candidates for tail
748 call optimizations. */
749 #define CALL_EXPR_TAILCALL(NODE) \
750 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
752 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
753 optimization for correctness. */
754 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
755 (CALL_EXPR_CHECK (NODE)->base.static_flag)
757 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
758 CASE_LOW operand has been processed. */
759 #define CASE_LOW_SEEN(NODE) \
760 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
762 #define PREDICT_EXPR_OUTCOME(NODE) \
763 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
764 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
765 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
766 #define PREDICT_EXPR_PREDICTOR(NODE) \
767 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
769 /* In a VAR_DECL, nonzero means allocate static storage.
770 In a FUNCTION_DECL, nonzero if function has been defined.
771 In a CONSTRUCTOR, nonzero means allocate static storage. */
772 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
774 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
775 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
777 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
778 should only be executed if an exception is thrown, not on normal exit
780 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
782 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
783 separate cleanup in honor_protect_cleanup_actions. */
784 #define TRY_CATCH_IS_CLEANUP(NODE) \
785 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
787 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
788 CASE_HIGH operand has been processed. */
789 #define CASE_HIGH_SEEN(NODE) \
790 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
792 /* Used to mark scoped enums. */
793 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
795 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
796 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
798 /* In an expr node (usually a conversion) this means the node was made
799 implicitly and should not lead to any sort of warning. In a decl node,
800 warnings concerning the decl should be suppressed. This is used at
801 least for used-before-set warnings, and it set after one warning is
803 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
805 /* Nonzero if we should warn about the change in empty class parameter
806 passing ABI in this TU. */
807 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
808 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
810 /* Nonzero if this type is "empty" according to the particular psABI. */
811 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
813 /* Used to indicate that this TYPE represents a compiler-generated entity. */
814 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
816 /* True if the type is indivisible at the source level, i.e. if its
817 component parts cannot be accessed directly. This is used to suppress
818 normal GNU extensions for target-specific vector types. */
819 #define TYPE_INDIVISIBLE_P(NODE) (TYPE_CHECK (NODE)->type_common.indivisible_p)
821 /* True if this is a stdarg function with no named arguments (C23
822 (...) prototype, where arguments can be accessed with va_start and
823 va_arg), as opposed to an unprototyped function. */
824 #define TYPE_NO_NAMED_ARGS_STDARG_P(NODE) \
825 (FUNC_OR_METHOD_CHECK (NODE)->type_common.no_named_args_stdarg_p)
827 /* True if this RECORD_TYPE or UNION_TYPE includes a flexible array member
828 as the last field recursively. */
829 #define TYPE_INCLUDES_FLEXARRAY(NODE) \
830 (RECORD_OR_UNION_CHECK (NODE)->type_common.no_named_args_stdarg_p)
832 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
833 this string as an argument. */
834 #define TREE_SYMBOL_REFERENCED(NODE) \
835 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
837 /* Nonzero in a pointer or reference type means the data pointed to
838 by this type can alias anything. */
839 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
840 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
842 /* In an INTEGER_CST, REAL_CST, or COMPLEX_CST, this means
843 there was an overflow in folding. */
845 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
847 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
849 #define TREE_OVERFLOW_P(EXPR) \
850 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
852 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
853 nonzero means name is to be accessible from outside this translation unit.
854 In an IDENTIFIER_NODE, nonzero means an external declaration
855 accessible from outside this translation unit was previously seen
856 for this name in an inner scope. */
857 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
859 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
860 of cached values, or is something else. */
861 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
863 /* In a SAVE_EXPR, indicates that the original expression has already
864 been substituted with a VAR_DECL that contains the value. */
865 #define SAVE_EXPR_RESOLVED_P(NODE) \
866 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
868 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
870 #define CALL_EXPR_VA_ARG_PACK(NODE) \
871 (CALL_EXPR_CHECK (NODE)->base.public_flag)
873 /* In any expression, decl, or constant, nonzero means it has side effects or
874 reevaluation of the whole expression could produce a different value.
875 This is set if any subexpression is a function call, a side effect or a
876 reference to a volatile variable. In a ..._DECL, this is set only if the
877 declaration said `volatile'. This will never be set for a constant. */
878 #define TREE_SIDE_EFFECTS(NODE) \
879 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
881 /* In a LABEL_DECL, nonzero means this label had its address taken
882 and therefore can never be deleted and is a jump target for
884 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
886 /* Whether a case or a user-defined label is allowed to fall through to.
887 This is used to implement -Wimplicit-fallthrough. */
888 #define FALLTHROUGH_LABEL_P(NODE) \
889 (LABEL_DECL_CHECK (NODE)->base.private_flag)
891 /* Set on the artificial label created for break; stmt from a switch.
892 This is used to implement -Wimplicit-fallthrough. */
893 #define SWITCH_BREAK_LABEL_P(NODE) \
894 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
896 /* Set on label that is known not to be jumped to, it can be only
897 reached by falling through from previous statements.
898 This is used to implement -Wimplicit-fallthrough. */
899 #define UNUSED_LABEL_P(NODE) \
900 (LABEL_DECL_CHECK (NODE)->base.default_def_flag)
902 /* Nonzero means this expression is volatile in the C sense:
903 its address should be of type `volatile WHATEVER *'.
904 In other words, the declared item is volatile qualified.
905 This is used in _DECL nodes and _REF nodes.
906 On a FUNCTION_DECL node, this means the function does not
907 return normally. This is the same effect as setting
908 the attribute noreturn on the function in C.
910 In a ..._TYPE node, means this type is volatile-qualified.
911 But use TYPE_VOLATILE instead of this macro when the node is a type,
912 because eventually we may make that a different bit.
914 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
915 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
917 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
918 accessing the memory pointed to won't generate a trap. However,
919 this only applies to an object when used appropriately: it doesn't
920 mean that writing a READONLY mem won't trap.
922 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
923 (or slice of the array) always belongs to the range of the array.
924 I.e. that the access will not trap, provided that the access to
925 the base to the array will not trap. */
926 #define TREE_THIS_NOTRAP(NODE) \
927 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
928 ARRAY_RANGE_REF)->base.nothrow_flag)
930 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
931 nonzero means it may not be the lhs of an assignment.
932 Nonzero in a FUNCTION_DECL means this function should be treated
933 as "const" function (can only read its arguments). */
934 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
936 /* Value of expression is constant. Always on in all ..._CST nodes. May
937 also appear in an expression or decl where the value is constant. */
938 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
940 /* Nonzero if NODE, a type, has had its sizes gimplified. */
941 #define TYPE_SIZES_GIMPLIFIED(NODE) \
942 (TYPE_CHECK (NODE)->base.constant_flag)
944 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
945 #define DECL_UNSIGNED(NODE) \
946 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
948 /* In integral and pointer types, means an unsigned type. */
949 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
951 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
952 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
954 /* True if overflow wraps around for the given integral or pointer type. That
955 is, TYPE_MAX + 1 == TYPE_MIN. */
956 #define TYPE_OVERFLOW_WRAPS(TYPE) \
957 (POINTER_TYPE_P (TYPE) \
958 ? flag_wrapv_pointer \
959 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
962 /* True if overflow is undefined for the given integral or pointer type.
963 We may optimize on the assumption that values in the type never overflow.
965 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
966 must issue a warning based on warn_strict_overflow. In some cases
967 it will be appropriate to issue the warning immediately, and in
968 other cases it will be appropriate to simply set a flag and let the
969 caller decide whether a warning is appropriate or not. */
970 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
971 (POINTER_TYPE_P (TYPE) \
972 ? !flag_wrapv_pointer \
973 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
974 && !flag_wrapv && !flag_trapv))
976 /* True if overflow for the given integral type should issue a
978 #define TYPE_OVERFLOW_TRAPS(TYPE) \
979 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
981 /* True if an overflow is to be preserved for sanitization. */
982 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
983 (INTEGRAL_TYPE_P (TYPE) \
984 && !TYPE_OVERFLOW_WRAPS (TYPE) \
985 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
987 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
988 Nonzero in a FUNCTION_DECL means that the function has been compiled.
989 This is interesting in an inline function, since it might not need
990 to be compiled separately.
991 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
992 or TYPE_DECL if the debugging info for the type has been written.
993 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
994 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
996 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
998 /* Nonzero in a _DECL if the name is used in its scope.
999 Nonzero in an expr node means inhibit warning if value is unused.
1000 In IDENTIFIER_NODEs, this means that some extern decl for this name
1002 In a BLOCK, this means that the block contains variables that are used. */
1003 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1005 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1006 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1007 throw. We can't easily check the node type here as the C++
1008 frontend also uses this flag (for AGGR_INIT_EXPR). */
1009 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1011 /* In a CALL_EXPR, means that it's safe to use the target of the call
1012 expansion as the return slot for a call that returns in memory. */
1013 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1014 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1016 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1017 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1019 #define DECL_BY_REFERENCE(NODE) \
1020 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1021 RESULT_DECL)->decl_common.decl_by_reference_flag)
1023 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
1025 #define DECL_READ_P(NODE) \
1026 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1028 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
1029 attempting to share the stack slot with some other variable. */
1030 #define DECL_NONSHAREABLE(NODE) \
1031 (TREE_CHECK2 (NODE, VAR_DECL, \
1032 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1034 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
1035 buggy callers don't pass to the callee. */
1036 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
1037 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
1039 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1040 thunked-to function. Be careful to avoid using this macro when one of the
1041 next two applies instead. */
1042 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1044 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1045 it has been built for the declaration of a variable-sized object and, if the
1046 function being called is BUILT_IN_MEMCPY, means that it has been built for
1047 the assignment of a variable-sized object. */
1048 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1049 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1051 /* In a CALL_EXPR, if the function being called is DECL_IS_OPERATOR_NEW_P or
1052 DECL_IS_OPERATOR_DELETE_P, true for allocator calls from C++ new or delete
1053 expressions. Not set for C++20 destroying delete operators. */
1054 #define CALL_FROM_NEW_OR_DELETE_P(NODE) \
1055 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1057 /* Used in classes in C++. */
1058 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1059 /* Used in classes in C++. */
1060 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1062 /* True if reference type NODE is a C++ rvalue reference. */
1063 #define TYPE_REF_IS_RVALUE(NODE) \
1064 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1066 /* Nonzero in a _DECL if the use of the name is defined as a
1067 deprecated feature by __attribute__((deprecated)). */
1068 #define TREE_DEPRECATED(NODE) \
1069 ((NODE)->base.deprecated_flag)
1071 /* Nonzero in a _DECL if the use of the name is defined as an
1072 unavailable feature by __attribute__((unavailable)). */
1073 #define TREE_UNAVAILABLE(NODE) \
1074 ((NODE)->base.u.bits.unavailable_flag)
1076 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
1077 aggregate, (as created by anon_aggr_name_format). */
1078 #define IDENTIFIER_ANON_P(NODE) \
1079 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
1081 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1082 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1083 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1084 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1086 /* In an aggregate type, indicates that the scalar fields of the type are
1087 stored in reverse order from the target order. This effectively
1088 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
1089 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
1090 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
1092 /* In a non-aggregate type, indicates a saturating type. */
1093 #define TYPE_SATURATING(NODE) \
1094 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
1096 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
1097 of bits stored in reverse order from the target order. This effectively
1098 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
1100 The overall strategy is to preserve the invariant that every scalar in
1101 memory is associated with a single storage order, i.e. all accesses to
1102 this scalar are done with the same storage order. This invariant makes
1103 it possible to factor out the storage order in most transformations, as
1104 only the address and/or the value (in target order) matter for them.
1105 But, of course, the storage order must be preserved when the accesses
1106 themselves are rewritten or transformed. */
1107 #define REF_REVERSE_STORAGE_ORDER(NODE) \
1108 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
1110 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
1111 represented by a descriptor instead of a trampoline. */
1112 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
1113 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
1115 /* In a CALL_EXPR, indicates that this is an indirect call for which
1116 pointers to nested function are descriptors instead of trampolines. */
1117 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
1118 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
1120 /* These flags are available for each language front end to use internally. */
1121 #define TREE_LANG_FLAG_0(NODE) \
1122 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
1123 #define TREE_LANG_FLAG_1(NODE) \
1124 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
1125 #define TREE_LANG_FLAG_2(NODE) \
1126 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
1127 #define TREE_LANG_FLAG_3(NODE) \
1128 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
1129 #define TREE_LANG_FLAG_4(NODE) \
1130 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
1131 #define TREE_LANG_FLAG_5(NODE) \
1132 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
1133 #define TREE_LANG_FLAG_6(NODE) \
1134 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
1136 /* Define additional fields and accessors for nodes representing constants. */
1138 #define TREE_INT_CST_NUNITS(NODE) \
1139 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1140 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1141 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1142 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1143 #define TREE_INT_CST_LOW(NODE) \
1144 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1146 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1147 targets with variable-sized modes. */
1148 #define POLY_INT_CST_P(NODE) \
1149 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1151 /* In a POLY_INT_CST node. */
1152 #define POLY_INT_CST_COEFF(NODE, I) \
1153 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1155 #define TREE_REAL_CST_PTR(NODE) (&REAL_CST_CHECK (NODE)->real_cst.value)
1156 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1158 #define TREE_FIXED_CST_PTR(NODE) \
1159 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1160 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1162 /* In a STRING_CST */
1163 /* In C terms, this is sizeof, not strlen. */
1164 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1165 #define TREE_STRING_POINTER(NODE) \
1166 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1168 /* In a COMPLEX_CST node. */
1169 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1170 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1172 /* In a VECTOR_CST node. See generic.texi for details. */
1173 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1174 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1176 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1177 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1178 #define VECTOR_CST_NPATTERNS(NODE) \
1179 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1180 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1181 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1182 #define VECTOR_CST_DUPLICATE_P(NODE) \
1183 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1184 #define VECTOR_CST_STEPPED_P(NODE) \
1185 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1186 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1187 (VECTOR_CST_CHECK (NODE)->vector.elts)
1188 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1189 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1191 /* Define fields and accessors for some special-purpose tree nodes. */
1193 /* Unlike STRING_CST, in C terms this is strlen, not sizeof. */
1194 #define IDENTIFIER_LENGTH(NODE) \
1195 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1196 #define IDENTIFIER_POINTER(NODE) \
1197 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1198 #define IDENTIFIER_HASH_VALUE(NODE) \
1199 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1201 /* Translate a hash table identifier pointer to a tree_identifier
1202 pointer, and vice versa. */
1204 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1205 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1206 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1208 /* In a TREE_LIST node. */
1209 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1210 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1212 /* In a TREE_VEC node. */
1213 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1214 #define TREE_VEC_BEGIN(NODE) (&TREE_VEC_CHECK (NODE)->vec.a[0])
1215 #define TREE_VEC_END(NODE) \
1216 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->base.u.length]))
1218 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1220 /* In a CONSTRUCTOR node. */
1221 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1222 #define CONSTRUCTOR_ELT(NODE,IDX) \
1223 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1224 #define CONSTRUCTOR_NELTS(NODE) \
1225 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1226 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1227 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1229 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1230 value of each element (stored within VAL). IX must be a scratch variable
1231 of unsigned integer type. */
1232 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1233 for (IX = 0; (IX >= vec_safe_length (V)) \
1235 : ((VAL = (*(V))[IX].value), \
1239 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1240 the value of each element (stored within VAL) and its index (stored
1241 within INDEX). IX must be a scratch variable of unsigned integer type. */
1242 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1243 for (IX = 0; (IX >= vec_safe_length (V)) \
1245 : (((void) (VAL = (*V)[IX].value)), \
1246 (INDEX = (*V)[IX].index), \
1250 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1251 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1253 constructor_elt _ce___ = {INDEX, VALUE}; \
1254 vec_safe_push ((V), _ce___); \
1257 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1258 constructor output purposes. */
1259 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1260 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) \
1261 && (DECL_MODE (NODE) != BLKmode \
1262 || TREE_CODE (TREE_TYPE (NODE)) == BITINT_TYPE))
1264 /* True if NODE is a clobber right hand side, an expression of indeterminate
1265 value that clobbers the LHS in a copy instruction. We use a volatile
1266 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1267 In particular the volatile flag causes us to not prematurely remove
1268 such clobber instructions. */
1269 #define TREE_CLOBBER_P(NODE) \
1270 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1272 /* Return the clobber_kind of a CLOBBER CONSTRUCTOR. */
1273 #define CLOBBER_KIND(NODE) \
1274 (CONSTRUCTOR_CHECK (NODE)->base.u.bits.address_space)
1276 /* Define fields and accessors for some nodes that represent expressions. */
1278 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1279 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1280 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1281 && integer_zerop (TREE_OPERAND (NODE, 0)))
1283 /* In ordinary expression nodes. */
1284 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1285 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1287 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1288 length. Its value includes the length operand itself; that is,
1289 the minimum valid length is 1.
1290 Note that we have to bypass the use of TREE_OPERAND to access
1291 that field to avoid infinite recursion in expanding the macros. */
1292 #define VL_EXP_OPERAND_LENGTH(NODE) \
1293 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1295 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1296 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1297 /* Nonzero if gimple_debug_bind_p() (and thus
1298 gimple_debug_source_bind_p()) may possibly hold. */
1299 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1300 /* Nonzero if is_gimple_debug() may possibly hold. */
1301 #define MAY_HAVE_DEBUG_STMTS \
1302 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1304 /* In a LOOP_EXPR node. */
1305 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1307 /* The source location of this expression. Non-tree_exp nodes such as
1308 decls and constants can be shared among multiple locations, so
1310 #define EXPR_LOCATION(NODE) \
1311 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1312 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1313 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1314 != UNKNOWN_LOCATION)
1315 /* The location to be used in a diagnostic about this expression. Do not
1316 use this macro if the location will be assigned to other expressions. */
1317 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1318 ? (NODE)->exp.locus : (LOCUS))
1319 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1320 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1322 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1323 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1325 #define EXPR_HAS_RANGE(NODE) \
1326 (CAN_HAVE_RANGE_P (NODE) \
1327 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1330 /* True if a tree is an expression or statement that can have a
1332 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1335 get_expr_source_range (tree expr
)
1337 location_t loc
= EXPR_LOCATION (expr
);
1338 return get_range_from_loc (line_table
, loc
);
1341 extern void protected_set_expr_location (tree
, location_t
);
1342 extern void protected_set_expr_location_if_unset (tree
, location_t
);
1343 ATTRIBUTE_WARN_UNUSED_RESULT
1344 extern tree
protected_set_expr_location_unshare (tree
, location_t
);
1346 WARN_UNUSED_RESULT
extern tree
maybe_wrap_with_location (tree
, location_t
);
1348 extern int suppress_location_wrappers
;
1350 /* A class for suppressing the creation of location wrappers.
1351 Location wrappers will not be created during the lifetime
1352 of an instance of this class. */
1354 class auto_suppress_location_wrappers
1357 auto_suppress_location_wrappers () { ++suppress_location_wrappers
; }
1358 ~auto_suppress_location_wrappers () { --suppress_location_wrappers
; }
1361 /* In a TARGET_EXPR node. */
1362 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1363 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1364 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1365 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1366 on rhs of MODIFY_EXPR. */
1367 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1369 /* DECL_EXPR accessor. This gives access to the DECL associated with
1370 the given declaration statement. */
1371 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1373 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1375 /* COMPOUND_LITERAL_EXPR accessors. */
1376 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1377 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1378 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1379 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1381 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1382 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1383 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1384 /* True if there are case labels for all possible values of SWITCH_COND, either
1385 because there is a default: case label or because the case label ranges cover
1387 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1389 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1390 of a case label, respectively. */
1391 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1392 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1393 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1394 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1396 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1397 corresponding MEM_REF operands. */
1398 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1399 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1400 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1401 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1402 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1404 #define MR_DEPENDENCE_CLIQUE(NODE) \
1405 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1406 #define MR_DEPENDENCE_BASE(NODE) \
1407 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1409 /* The operands of a BIND_EXPR. */
1410 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1411 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1412 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1414 /* GOTO_EXPR accessor. This gives access to the label associated with
1415 a goto statement. */
1416 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1418 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1419 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1420 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1422 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1423 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1424 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1425 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1426 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1427 /* Nonzero if we want to create an ASM_INPUT instead of an
1428 ASM_OPERAND with no operands. */
1429 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1430 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1431 /* Nonzero if we want to consider this asm as minimum length and cost
1432 for inlining decisions. */
1433 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1435 /* COND_EXPR accessors. */
1436 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1437 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1438 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1440 /* Accessors for the chains of recurrences. */
1441 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1442 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1443 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1444 /* Nonzero if this chrec doesn't overflow (i.e., nonwrapping). */
1445 #define CHREC_NOWRAP(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.nothrow_flag
1447 /* LABEL_EXPR accessor. This gives access to the label associated with
1448 the given label expression. */
1449 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1451 /* CATCH_EXPR accessors. */
1452 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1453 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1455 /* EH_FILTER_EXPR accessors. */
1456 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1457 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1459 /* OBJ_TYPE_REF accessors. */
1460 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1461 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1462 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1464 /* CALL_EXPR accessors. */
1465 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1466 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1467 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1468 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1469 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1471 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1472 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1473 the argument count is zero when checking is enabled. Instead, do
1474 the pointer arithmetic to advance past the 3 fixed operands in a
1475 CALL_EXPR. That produces a valid pointer to just past the end of the
1476 operand array, even if it's not valid to dereference it. */
1477 #define CALL_EXPR_ARGP(NODE) \
1478 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1480 /* TM directives and accessors. */
1481 #define TRANSACTION_EXPR_BODY(NODE) \
1482 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1483 #define TRANSACTION_EXPR_OUTER(NODE) \
1484 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1485 #define TRANSACTION_EXPR_RELAXED(NODE) \
1486 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1488 /* OpenMP and OpenACC directive and clause accessors. */
1490 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1492 #define OMP_BODY(NODE) \
1493 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1494 #define OMP_CLAUSES(NODE) \
1495 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1497 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1498 #define OMP_STANDALONE_CLAUSES(NODE) \
1499 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1501 #define OACC_DATA_BODY(NODE) \
1502 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1503 #define OACC_DATA_CLAUSES(NODE) \
1504 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1506 #define OACC_HOST_DATA_BODY(NODE) \
1507 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1508 #define OACC_HOST_DATA_CLAUSES(NODE) \
1509 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1511 #define OACC_CACHE_CLAUSES(NODE) \
1512 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1514 #define OACC_DECLARE_CLAUSES(NODE) \
1515 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1517 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1518 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1520 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1521 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1523 #define OACC_UPDATE_CLAUSES(NODE) \
1524 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1526 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1527 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1529 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1530 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1532 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1533 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1534 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1536 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1537 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1538 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1539 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1540 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1541 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1542 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1543 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1545 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1546 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1548 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1550 #define OMP_STRUCTURED_BLOCK_BODY(NODE) \
1551 TREE_OPERAND (OMP_STRUCTURED_BLOCK_CHECK (NODE), 0)
1553 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1554 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1556 #define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0)
1557 #define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1)
1559 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1561 #define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0)
1562 #define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1)
1564 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1565 #define OMP_TASKGROUP_CLAUSES(NODE) \
1566 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1568 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1569 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1571 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1572 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1573 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1575 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1576 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1578 #define OMP_TARGET_DATA_BODY(NODE) \
1579 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1580 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1581 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1583 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1584 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1586 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1587 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1589 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1590 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1592 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1593 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1595 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1596 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1598 #define OMP_CLAUSE_SIZE(NODE) \
1599 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1601 OMP_CLAUSE__CACHE_), 1)
1603 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1604 #define OMP_CLAUSE_DECL(NODE) \
1605 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1606 OMP_CLAUSE_PRIVATE, \
1607 OMP_CLAUSE__SCANTEMP_), 0)
1608 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1609 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1610 != UNKNOWN_LOCATION)
1611 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1613 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1614 is non-rectangular. */
1615 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1616 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1618 /* True on an OMP_SECTION statement that was the last lexical member.
1619 This status is meaningful in the implementation of lastprivate. */
1620 #define OMP_SECTION_LAST(NODE) \
1621 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1623 /* True on an OMP_PARALLEL statement if it represents an explicit
1624 combined parallel work-sharing constructs. */
1625 #define OMP_PARALLEL_COMBINED(NODE) \
1626 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1628 /* True on an OMP_TEAMS statement if it represents an explicit
1629 combined teams distribute constructs. */
1630 #define OMP_TEAMS_COMBINED(NODE) \
1631 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1633 /* True on an OMP_TARGET statement if it represents explicit
1634 combined target teams, target parallel or target simd constructs. */
1635 #define OMP_TARGET_COMBINED(NODE) \
1636 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1638 /* True on an OMP_MASTER statement if it represents an explicit
1639 combined master constructs. */
1640 #define OMP_MASTER_COMBINED(NODE) \
1641 (OMP_MASTER_CHECK (NODE)->base.private_flag)
1643 /* True on an OMP_MASKED statement if it represents an explicit
1644 combined masked constructs. */
1645 #define OMP_MASKED_COMBINED(NODE) \
1646 (OMP_MASKED_CHECK (NODE)->base.private_flag)
1648 /* Memory order for OMP_ATOMIC*. */
1649 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1650 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1651 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1653 /* Weak clause on OMP_ATOMIC*. */
1654 #define OMP_ATOMIC_WEAK(NODE) \
1655 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1656 OMP_ATOMIC_CAPTURE_NEW)->base.public_flag)
1658 /* True on a PRIVATE clause if its decl is kept around for debugging
1659 information only and its DECL_VALUE_EXPR is supposed to point
1660 to what it has been remapped to. */
1661 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1662 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1664 /* True on a PRIVATE clause if ctor needs access to outer region's
1666 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1667 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1669 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1670 (thus should be private on the outer taskloop and firstprivate on
1672 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1673 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1675 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1676 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1677 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1679 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1680 to should be firstprivatized. */
1681 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1682 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1684 /* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also
1685 set if target construct is the only one that accepts the clause. */
1686 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \
1687 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1689 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1690 decl is present in the chain. */
1691 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1692 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1693 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1694 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1695 OMP_CLAUSE_LASTPRIVATE),\
1697 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1698 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1700 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1701 loop construct (thus should be lastprivate on the outer taskloop and
1702 firstprivate on task for the taskloop construct and carefully handled
1703 for loop construct). */
1704 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1705 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1707 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1708 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1709 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1711 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1712 decl is present in the chain (this can happen only for taskloop
1713 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1714 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1715 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1717 /* True on a SHARED clause if a scalar is not modified in the body and
1718 thus could be optimized as firstprivate. */
1719 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1720 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1722 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1723 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1725 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1726 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1727 #define OMP_CLAUSE_IF_EXPR(NODE) \
1728 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1729 #define OMP_CLAUSE_SELF_EXPR(NODE) \
1730 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SELF), 0)
1731 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1732 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1733 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1734 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1735 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1736 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1737 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1738 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1739 #define OMP_CLAUSE_FILTER_EXPR(NODE) \
1740 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0)
1742 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1743 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1745 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1746 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1748 #define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \
1749 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE))
1750 #define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \
1751 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS))
1753 /* OpenACC clause expressions */
1754 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1755 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1756 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1757 OMP_CLAUSE_OPERAND ( \
1758 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1759 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1760 OMP_CLAUSE_OPERAND ( \
1761 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1762 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1763 OMP_CLAUSE_OPERAND ( \
1764 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1765 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1766 OMP_CLAUSE_OPERAND ( \
1767 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1768 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1769 OMP_CLAUSE_OPERAND ( \
1770 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1771 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1772 OMP_CLAUSE_OPERAND ( \
1773 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1774 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1775 OMP_CLAUSE_OPERAND ( \
1776 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1777 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1778 OMP_CLAUSE_OPERAND ( \
1779 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1780 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1781 OMP_CLAUSE_OPERAND ( \
1782 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1784 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1785 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1787 #define OMP_CLAUSE_DOACROSS_KIND(NODE) \
1788 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS)->omp_clause.subcode.doacross_kind)
1790 #define OMP_CLAUSE_DOACROSS_SINK_NEGATIVE(NODE) \
1791 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1793 /* True if DOACROSS clause is spelled as DEPEND. */
1794 #define OMP_CLAUSE_DOACROSS_DEPEND(NODE) \
1795 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS))
1797 #define OMP_CLAUSE_MAP_KIND(NODE) \
1798 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1799 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1800 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1801 = (unsigned int) (MAP_KIND))
1803 #define OMP_CLAUSE_MOTION_PRESENT(NODE) \
1804 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_FROM, OMP_CLAUSE_TO)->base.deprecated_flag)
1806 /* Nonzero if this map clause is for array (rather than pointer) based array
1807 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1808 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1809 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1810 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1811 /* Nonzero if this is a mapped array section, that might need special
1812 treatment if OMP_CLAUSE_SIZE is zero. */
1813 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1814 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1815 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1816 variable or OpenMP map clause mentioned also in in_reduction clause on the
1818 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1819 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1820 /* Nonzero on map clauses added implicitly for reduction clauses on combined
1821 or composite constructs. They shall be removed if there is an explicit
1823 #define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1824 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1825 /* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1826 due to being created through implicit data-mapping rules in the middle-end.
1827 NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1828 #define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1829 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1830 /* Nonzero for an attach/detach node whose decl was explicitly mapped on the
1832 #define OMP_CLAUSE_ATTACHMENT_MAPPING_ERASED(NODE) \
1833 TREE_STATIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1835 /* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1837 #define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1838 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1840 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1842 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1843 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1845 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1846 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1848 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1849 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1851 #define OMP_CLAUSE_INDIRECT_EXPR(NODE) \
1852 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_INDIRECT), 0)
1855 /* True if there is a device clause with a device-modifier 'ancestor'. */
1856 #define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
1857 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
1859 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1860 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1861 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1862 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1863 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1864 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1866 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1867 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1869 /* True on an OMP_CLAUSE_ORDERED if stand-alone ordered construct is nested
1870 inside of work-sharing loop the clause is on. */
1871 #define OMP_CLAUSE_ORDERED_DOACROSS(NODE) \
1872 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED)->base.public_flag)
1874 /* True for unconstrained modifier on order(concurrent) clause. */
1875 #define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
1876 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
1877 /* True for reproducible modifier on order(concurrent) clause. */
1878 #define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
1879 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
1881 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1882 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1883 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1884 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1885 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1886 OMP_CLAUSE_IN_REDUCTION), 1)
1887 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1888 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1889 OMP_CLAUSE_IN_REDUCTION), 2)
1890 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1891 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1892 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1893 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1894 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1895 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1896 OMP_CLAUSE_IN_REDUCTION), 3)
1897 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1898 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1899 OMP_CLAUSE_IN_REDUCTION), 4)
1901 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1902 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1903 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1904 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1905 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1907 /* True if a REDUCTION clause has task reduction-modifier. */
1908 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1909 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1911 /* True if a REDUCTION clause has inscan reduction-modifier. */
1912 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1913 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1915 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1916 are always initialized inside of the loop construct, false otherwise. */
1917 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1918 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1920 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1921 are declared inside of the simd construct. */
1922 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1923 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1925 /* True if a LINEAR clause has a stride that is variable. */
1926 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1927 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1929 /* True for a LINEAR clause with old style modifier syntax
1930 linear(modifier(list)) or linear(modifier(list):step). */
1931 #define OMP_CLAUSE_LINEAR_OLD_LINEAR_MODIFIER(NODE) \
1932 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.addressable_flag)
1934 /* True if a LINEAR clause is for an array or allocatable variable that
1935 needs special handling by the frontend. */
1936 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1937 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1939 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1940 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1942 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1943 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1945 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1946 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1948 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1949 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1951 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1952 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1954 #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1955 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1957 #define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
1958 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
1960 /* True if an ALLOCATE clause was present on a combined or composite
1961 construct and the code for splitting the clauses has already performed
1962 checking if the listed variable has explicit privatization on the
1964 #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1965 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1967 #define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
1968 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1970 #define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
1971 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
1973 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1974 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1975 OMP_CLAUSE_THREAD_LIMIT), 0)
1977 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1978 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1980 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1981 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1982 OMP_CLAUSE_DIST_SCHEDULE), 0)
1984 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1985 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1987 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1988 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1990 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1991 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1993 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1994 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1996 /* True if a SCHEDULE clause has the simd modifier on it. */
1997 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1998 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
2000 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
2001 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
2003 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
2004 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
2005 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
2006 ((enum omp_clause_defaultmap_kind) \
2007 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
2008 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
2009 ((enum omp_clause_defaultmap_kind) \
2010 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
2011 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
2012 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
2013 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
2015 #define OMP_CLAUSE_BIND_KIND(NODE) \
2016 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
2018 /* True if ENTER clause is spelled as TO. */
2019 #define OMP_CLAUSE_ENTER_TO(NODE) \
2020 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ENTER)->base.public_flag)
2022 #define OMP_CLAUSE_TILE_LIST(NODE) \
2023 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
2024 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
2025 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
2026 #define OMP_CLAUSE_TILE_COUNT(NODE) \
2027 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
2029 /* _CONDTEMP_ holding temporary with iteration count. */
2030 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
2031 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
2033 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
2035 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
2036 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
2038 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
2039 one boolean_type_node for test whether alloca was used, another one
2040 to pass to __builtin_stack_restore or free. */
2041 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
2042 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
2044 /* SSA_NAME accessors. */
2046 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
2047 information in the underlying SSA_NAME_VAR for efficiency. */
2048 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
2049 SSA_NAME_CHECK (NODE)->base.public_flag
2051 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
2052 if there is no name associated with it. */
2053 #define SSA_NAME_IDENTIFIER(NODE) \
2054 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
2055 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2056 ? (NODE)->ssa_name.var \
2057 : DECL_NAME ((NODE)->ssa_name.var)) \
2060 /* Returns the variable being referenced. This can be NULL_TREE for
2061 temporaries not associated with any user variable.
2062 Once released, this is the only field that can be relied upon. */
2063 #define SSA_NAME_VAR(NODE) \
2064 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
2065 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2066 ? NULL_TREE : (NODE)->ssa_name.var)
2068 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
2071 tree var_ = (VAR); \
2072 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
2073 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
2075 && TREE_CODE (var_) == VAR_DECL \
2076 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
2080 /* Returns the statement which defines this SSA name. */
2081 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
2083 /* Returns the SSA version number of this SSA name. Note that in
2084 tree SSA, version numbers are not per variable and may be recycled. */
2085 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
2087 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
2088 never output, so we can safely use the ASM_WRITTEN_FLAG for this
2090 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
2091 SSA_NAME_CHECK (NODE)->base.asm_written_flag
2093 /* Nonzero if this SSA_NAME expression is currently on the free list of
2094 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
2095 has no meaning for an SSA_NAME. */
2096 #define SSA_NAME_IN_FREE_LIST(NODE) \
2097 SSA_NAME_CHECK (NODE)->base.nothrow_flag
2099 /* Nonzero if this SSA_NAME is the default definition for the
2100 underlying symbol. A default SSA name is created for symbol S if
2101 the very first reference to S in the function is a read operation.
2102 Default definitions are always created by an empty statement and
2103 belong to no basic block. */
2104 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2105 SSA_NAME_CHECK (NODE)->base.default_def_flag
2107 /* Nonzero if this SSA_NAME is known to point to memory that may not
2108 be written to. This is set for default defs of function parameters
2109 that have a corresponding r or R specification in the functions
2110 fn spec attribute. This is used by alias analysis. */
2111 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
2112 SSA_NAME_CHECK (NODE)->base.deprecated_flag
2114 /* Attributes for SSA_NAMEs for pointer-type variables. */
2115 #define SSA_NAME_PTR_INFO(N) \
2116 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
2118 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
2119 #define SSA_NAME_RANGE_INFO(N) \
2120 SSA_NAME_CHECK (N)->ssa_name.info.range_info
2122 /* Return the immediate_use information for an SSA_NAME. */
2123 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2125 #define OMP_CLAUSE_CODE(NODE) \
2126 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2128 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2129 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2131 #define OMP_CLAUSE_OPERAND(NODE, I) \
2132 OMP_CLAUSE_ELT_CHECK (NODE, I)
2134 /* In a BLOCK (scope) node:
2135 Variables declared in the scope NODE. */
2136 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2137 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2138 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2139 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2140 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2141 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2142 /* A chain of BLOCKs (scopes) nested within the scope NODE. */
2143 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2144 /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2145 function scope. Inlined functions are chained by this so that given
2146 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2147 in which E has been made or into which E has been inlined. */
2148 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2149 /* Points to the next scope at the same level of nesting as scope NODE. */
2150 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2151 /* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2152 inlined. In a scope immediately enclosing an inlined leaf expression,
2153 points to the outermost scope into which it has been inlined (thus
2154 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2155 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2156 #define BLOCK_ORIGIN(NODE) \
2157 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2158 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2160 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2161 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2163 /* True if BLOCK appears in cold section. */
2164 #define BLOCK_IN_COLD_SECTION_P(NODE) \
2165 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2167 /* An index number for this block. These values are not guaranteed to
2168 be unique across functions -- whether or not they are depends on
2169 the debugging output format in use. */
2170 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2172 /* If block reordering splits a lexical block into discontiguous
2173 address ranges, we'll make a copy of the original block.
2175 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2176 In that case, we have one source block that has been replicated
2177 (through inlining or unrolling) into many logical blocks, and that
2178 these logical blocks have different physical variables in them.
2180 In this case, we have one logical block split into several
2181 non-contiguous address ranges. Most debug formats can't actually
2182 represent this idea directly, so we fake it by creating multiple
2183 logical blocks with the same variables in them. However, for those
2184 that do support non-contiguous regions, these allow the original
2185 logical block to be reconstructed, along with the set of address
2188 One of the logical block fragments is arbitrarily chosen to be
2189 the ORIGIN. The other fragments will point to the origin via
2190 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2191 be null. The list of fragments will be chained through
2192 BLOCK_FRAGMENT_CHAIN from the origin. */
2194 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2195 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2197 /* For an inlined function, this gives the location where it was called
2198 from. This is only set in the top level block, which corresponds to the
2199 inlined function scope. This is used in the debug output routines. */
2201 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2203 /* This gives the location of the end of the block, useful to attach
2204 code implicitly generated for outgoing paths. */
2206 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2208 /* Define fields and accessors for nodes representing data types. */
2210 /* See tree.def for documentation of the use of these fields.
2211 Look at the documentation of the various ..._TYPE tree codes.
2213 Note that the type.values, type.minval, and type.maxval fields are
2214 overloaded and used for different macros in different kinds of types.
2215 Each macro must check to ensure the tree node is of the proper kind of
2216 type. Note also that some of the front-ends also overload these fields,
2217 so they must be checked as well. */
2219 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2220 /* Type size in bits as a tree expression. Need not be constant and may
2221 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2222 class subobject with its own virtual base classes (which are laid out
2224 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2225 /* Likewise, type size in bytes. */
2226 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2227 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2228 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2229 #define TYPE_PRECISION(NODE) \
2230 (TREE_NOT_CHECK (TYPE_CHECK (NODE), VECTOR_TYPE)->type_common.precision)
2231 #define TYPE_PRECISION_RAW(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2232 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2233 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2234 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2235 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2237 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2238 #define TYPE_MODE(NODE) \
2239 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2240 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2241 #define SCALAR_TYPE_MODE(NODE) \
2242 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2243 #define SCALAR_INT_TYPE_MODE(NODE) \
2244 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2245 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2246 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2247 #define SET_TYPE_MODE(NODE, MODE) \
2248 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2250 extern unsigned int element_precision (const_tree
);
2251 extern machine_mode
element_mode (const_tree
);
2252 extern machine_mode
vector_type_mode (const_tree
);
2253 extern unsigned int vector_element_bits (const_tree
);
2254 extern tree
vector_element_bits_tree (const_tree
);
2256 /* The "canonical" type for this type node, which is used by frontends to
2257 compare the type for equality with another type. If two types are
2258 equal (based on the semantics of the language), then they will have
2259 equivalent TYPE_CANONICAL entries.
2261 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2262 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2263 be used for comparison against other types. Instead, the type is
2264 said to require structural equality checks, described in
2265 TYPE_STRUCTURAL_EQUALITY_P.
2267 For unqualified aggregate and function types the middle-end relies on
2268 TYPE_CANONICAL to tell whether two variables can be assigned
2269 to each other without a conversion. The middle-end also makes sure
2270 to assign the same alias-sets to the type partition with equal
2271 TYPE_CANONICAL of their unqualified variants. */
2272 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2273 /* Indicates that the type node requires structural equality
2274 checks. The compiler will need to look at the composition of the
2275 type to determine whether it is equal to another type, rather than
2276 just comparing canonical type pointers. For instance, we would need
2277 to look at the return and parameter types of a FUNCTION_TYPE
2279 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2280 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2281 type node requires structural equality. */
2282 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2284 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2285 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2287 /* The (language-specific) typed-based alias set for this type.
2288 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2289 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2290 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2291 type can alias objects of any type. */
2292 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2294 /* Nonzero iff the typed-based alias set for this type has been
2296 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2297 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2299 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2301 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2303 /* Raw access to the alignment field. */
2304 #define TYPE_ALIGN_RAW(NODE) \
2305 (TYPE_CHECK (NODE)->type_common.align)
2307 /* The alignment necessary for objects of this type.
2308 The value is an int, measured in bits and must be a power of two.
2309 We support also an "alignment" of zero. */
2310 #define TYPE_ALIGN(NODE) \
2311 (TYPE_ALIGN_RAW (NODE) \
2312 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2314 /* Specify that TYPE_ALIGN(NODE) is X. */
2315 #define SET_TYPE_ALIGN(NODE, X) \
2316 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2318 /* 1 if the alignment for this type was requested by "aligned" attribute,
2319 0 if it is the default for this type. */
2320 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2322 /* The alignment for NODE, in bytes. */
2323 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2325 /* The minimum alignment necessary for objects of this type without
2326 warning. The value is an int, measured in bits. */
2327 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2328 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2329 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2331 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2332 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2333 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2335 /* If your language allows you to declare types, and you want debug info
2336 for them, then you need to generate corresponding TYPE_DECL nodes.
2337 These "stub" TYPE_DECL nodes have no name, and simply point at the
2338 type node. You then set the TYPE_STUB_DECL field of the type node
2339 to point back at the TYPE_DECL node. This allows the debug routines
2340 to know that the two nodes represent the same type, so that we only
2341 get one debug info record for them. */
2342 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2344 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2345 the type has BLKmode only because it lacks the alignment required for
2347 #define TYPE_NO_FORCE_BLK(NODE) \
2348 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2350 /* Nonzero in a type considered volatile as a whole. */
2351 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2353 /* Nonzero in a type considered atomic as a whole. */
2354 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2356 /* Means this type is const-qualified. */
2357 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2359 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2361 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2363 /* If nonzero, type's name shouldn't be emitted into debug info. */
2364 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2366 /* The address space the type is in. */
2367 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2369 /* Encode/decode the named memory support as part of the qualifier. If more
2370 than 8 qualifiers are added, these macros need to be adjusted. */
2371 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2372 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2374 /* Return all qualifiers except for the address space qualifiers. */
2375 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2377 /* Only keep the address space out of the qualifiers and discard the other
2379 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2381 /* The set of type qualifiers for this type. */
2382 #define TYPE_QUALS(NODE) \
2383 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2384 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2385 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2386 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2387 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2389 /* The same as TYPE_QUALS without the address space qualifications. */
2390 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2391 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2392 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2393 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2394 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2396 /* The same as TYPE_QUALS without the address space and atomic
2398 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2399 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2400 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2401 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2403 /* These flags are available for each language front end to use internally. */
2404 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2405 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2406 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2407 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2408 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2409 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2410 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2411 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2413 /* Used to keep track of visited nodes in tree traversals. This is set to
2414 0 by copy_node and make_node. */
2415 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2417 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2418 that distinguish string from array of char).
2419 If set in a INTEGER_TYPE, indicates a character type. */
2420 #define TYPE_STRING_FLAG(NODE) \
2421 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2423 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2424 to the C++ one definition rule. This is used for LTO canonical type
2426 #define TYPE_CXX_ODR_P(NODE) \
2427 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2429 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2430 about missing conversions to other vector types of the same size. */
2431 #define TYPE_VECTOR_OPAQUE(NODE) \
2432 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2434 /* Indicates that objects of this type must be initialized by calling a
2435 function when they are created. */
2436 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2437 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2439 /* Indicates that a UNION_TYPE object should be passed the same way that
2440 the first union alternative would be passed, or that a RECORD_TYPE
2441 object should be passed the same way that the first (and only) member
2443 #define TYPE_TRANSPARENT_AGGR(NODE) \
2444 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2446 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2447 address of a component of the type. This is the counterpart of
2448 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2449 #define TYPE_NONALIASED_COMPONENT(NODE) \
2450 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2452 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2453 whether the array is typeless storage or the type contains a member
2454 with this flag set. Such types are exempt from type-based alias
2455 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2456 the flag should be inherited from the element type, can change
2457 when type is finalized and because of that should not be used in
2458 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2459 the flag should not be changed after the array is created and should
2460 be used in type hashing. */
2461 #define TYPE_TYPELESS_STORAGE(NODE) \
2462 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2463 ARRAY_TYPE)->type_common.typeless_storage)
2465 /* Indicated that objects of this type should be laid out in as
2466 compact a way as possible. */
2467 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2469 /* Used by type_contains_placeholder_p to avoid recomputation.
2470 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2471 this field directly. */
2472 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2473 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2475 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2476 #define TYPE_FINAL_P(NODE) \
2477 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2479 /* The debug output functions use the symtab union field to store
2480 information specific to the debugging format. The different debug
2481 output hooks store different types in the union field. These three
2482 macros are used to access different fields in the union. The debug
2483 hooks are responsible for consistently using only a specific
2486 /* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2487 hold the type's number in the generated stabs. */
2488 #define TYPE_SYMTAB_ADDRESS(NODE) \
2489 (TYPE_CHECK (NODE)->type_common.symtab.address)
2491 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2492 in dwarf2out.cc to point to the DIE generated for the type. */
2493 #define TYPE_SYMTAB_DIE(NODE) \
2494 (TYPE_CHECK (NODE)->type_common.symtab.die)
2496 /* The garbage collector needs to know the interpretation of the
2497 symtab field. These constants represent the different types in the
2500 #define TYPE_SYMTAB_IS_ADDRESS (0)
2501 #define TYPE_SYMTAB_IS_DIE (1)
2503 #define TYPE_LANG_SPECIFIC(NODE) \
2504 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2506 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2507 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2508 #define TYPE_FIELDS(NODE) \
2509 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2510 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2511 #define TYPE_ARG_TYPES(NODE) \
2512 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2513 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2515 #define TYPE_MIN_VALUE(NODE) \
2516 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2517 #define TYPE_NEXT_PTR_TO(NODE) \
2518 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2519 #define TYPE_NEXT_REF_TO(NODE) \
2520 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2521 #define TYPE_VFIELD(NODE) \
2522 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2523 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2525 #define TYPE_MAX_VALUE(NODE) \
2526 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2527 #define TYPE_METHOD_BASETYPE(NODE) \
2528 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2529 #define TYPE_OFFSET_BASETYPE(NODE) \
2530 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2531 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2532 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2534 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2535 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2536 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2537 /* For record and union types, information about this type, as a base type
2539 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2541 /* For types, used in a language-dependent way. */
2542 #define TYPE_LANG_SLOT_1(NODE) \
2543 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2545 /* Define accessor macros for information about type inheritance
2548 A "basetype" means a particular usage of a data type for inheritance
2549 in another type. Each such basetype usage has its own "binfo"
2550 object to describe it. The binfo object is a TREE_VEC node.
2552 Inheritance is represented by the binfo nodes allocated for a
2553 given type. For example, given types C and D, such that D is
2554 inherited by C, 3 binfo nodes will be allocated: one for describing
2555 the binfo properties of C, similarly one for D, and one for
2556 describing the binfo properties of D as a base type for C.
2557 Thus, given a pointer to class C, one can get a pointer to the binfo
2558 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2560 /* BINFO specific flags. */
2562 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2563 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2565 /* Flags for language dependent use. */
2566 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2567 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2568 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2569 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2570 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2571 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2572 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2574 /* The actual data type node being inherited in this basetype. */
2575 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2577 /* The offset where this basetype appears in its containing type.
2578 BINFO_OFFSET slot holds the offset (in bytes)
2579 from the base of the complete object to the base of the part of the
2580 object that is allocated on behalf of this `type'.
2581 This is always 0 except when there is multiple inheritance. */
2583 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2584 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2586 /* The virtual function table belonging to this basetype. Virtual
2587 function tables provide a mechanism for run-time method dispatching.
2588 The entries of a virtual function table are language-dependent. */
2590 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2592 /* The virtual functions in the virtual function table. This is
2593 a TREE_LIST that is used as an initial approximation for building
2594 a virtual function table for this basetype. */
2595 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2597 /* A vector of binfos for the direct basetypes inherited by this
2600 If this basetype describes type D as inherited in C, and if the
2601 basetypes of D are E and F, then this vector contains binfos for
2602 inheritance of E and F by C. */
2603 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2605 /* The number of basetypes for NODE. */
2606 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2608 /* Accessor macro to get to the Nth base binfo of this binfo. */
2609 #define BINFO_BASE_BINFO(NODE,N) \
2610 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2611 #define BINFO_BASE_ITERATE(NODE,N,B) \
2612 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2613 #define BINFO_BASE_APPEND(NODE,T) \
2614 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2616 /* For a BINFO record describing a virtual base class, i.e., one where
2617 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2618 base. The actual contents are language-dependent. In the C++
2619 front-end this field is an INTEGER_CST giving an offset into the
2620 vtable where the offset to the virtual base can be found. */
2621 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2623 /* Indicates the accesses this binfo has to its bases. The values are
2624 access_public_node, access_protected_node or access_private_node.
2625 If this array is not present, public access is implied. */
2626 #define BINFO_BASE_ACCESSES(NODE) \
2627 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2629 #define BINFO_BASE_ACCESS(NODE,N) \
2630 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2631 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2632 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2634 /* The index in the VTT where this subobject's sub-VTT can be found.
2635 NULL_TREE if there is no sub-VTT. */
2636 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2638 /* The index in the VTT where the vptr for this subobject can be
2639 found. NULL_TREE if there is no secondary vptr in the VTT. */
2640 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2642 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2643 inheriting this base for non-virtual bases. For virtual bases it
2644 points either to the binfo for which this is a primary binfo, or to
2645 the binfo of the most derived type. */
2646 #define BINFO_INHERITANCE_CHAIN(NODE) \
2647 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2650 /* Define fields and accessors for nodes representing declared names. */
2652 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2653 have an associated SSA name. */
2654 #define SSA_VAR_P(DECL) \
2655 (TREE_CODE (DECL) == VAR_DECL \
2656 || TREE_CODE (DECL) == PARM_DECL \
2657 || TREE_CODE (DECL) == RESULT_DECL \
2658 || TREE_CODE (DECL) == SSA_NAME)
2661 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2663 /* This is the name of the object as written by the user.
2664 It is an IDENTIFIER_NODE. */
2665 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2667 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2668 #define TYPE_IDENTIFIER(NODE) \
2669 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2670 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2672 /* Every ..._DECL node gets a unique number. */
2673 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2675 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2677 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2679 /* Every ..._DECL node gets a unique number that stays the same even
2680 when the decl is copied by the inliner once it is set. */
2681 #define DECL_PT_UID(NODE) \
2682 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2683 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2684 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2685 #define SET_DECL_PT_UID(NODE, UID) \
2686 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2687 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2688 be preserved when copyin the decl. */
2689 #define DECL_PT_UID_SET_P(NODE) \
2690 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2692 /* These two fields describe where in the source code the declaration
2693 was. If the declaration appears in several places (as for a C
2694 function that is declared first and then defined later), this
2695 information should refer to the definition. */
2696 #define DECL_SOURCE_LOCATION(NODE) \
2697 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2698 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2699 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2700 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2701 /* This decl was created by a front-end or back-end rather than by
2702 user code, and has not been explicitly declared by the user -- when
2703 that happens the source location is updated to the user's
2704 source. This includes decls with no location (!). */
2705 #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2706 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2708 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2709 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2710 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2711 nodes, this points to either the FUNCTION_DECL for the containing
2712 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2713 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2714 scope". In particular, for VAR_DECLs which are virtual table pointers
2715 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2717 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2718 #define DECL_FIELD_CONTEXT(NODE) \
2719 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2721 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2722 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2724 /* For any sort of a ..._DECL node, this points to the original (abstract)
2725 decl node which this decl is an inlined/cloned instance of, or else it
2726 is NULL indicating that this decl is not an instance of some other decl.
2728 The C front-end also uses this in a nested declaration of an inline
2729 function, to point back to the definition. */
2730 #define DECL_ABSTRACT_ORIGIN(NODE) \
2731 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2733 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2734 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2735 #define DECL_ORIGIN(NODE) \
2736 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2738 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2739 inline instance of some original (abstract) decl from an inline function;
2740 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2741 nodes can also have their abstract origin set to themselves. */
2742 #define DECL_FROM_INLINE(NODE) \
2743 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2744 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2746 /* In a DECL this is the field where attributes are stored. */
2747 #define DECL_ATTRIBUTES(NODE) \
2748 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2750 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2751 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2752 For a VAR_DECL, holds the initial value.
2753 For a PARM_DECL, used for DECL_ARG_TYPE--default
2754 values for parameters are encoded in the type of the function,
2755 not in the PARM_DECL slot.
2756 For a FIELD_DECL, this is used for enumeration values and the C
2757 frontend uses it for temporarily storing bitwidth of bitfields.
2759 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2760 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2762 /* Holds the size of the datum, in bits, as a tree expression.
2763 Need not be constant and may be null. May be less than TYPE_SIZE
2764 for a C++ FIELD_DECL representing a base class subobject with its
2765 own virtual base classes (which are laid out separately). */
2766 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2767 /* Likewise for the size in bytes. */
2768 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2769 #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2770 /* Returns the alignment required for the datum, in bits. It must
2771 be a power of two, but an "alignment" of zero is supported
2772 (e.g. as "uninitialized" sentinel). */
2773 #define DECL_ALIGN(NODE) \
2774 (DECL_ALIGN_RAW (NODE) \
2775 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2776 /* Specify that DECL_ALIGN(NODE) is X. */
2777 #define SET_DECL_ALIGN(NODE, X) \
2778 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2780 /* The minimum alignment necessary for the datum, in bits, without
2782 #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2783 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2784 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2785 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2786 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2788 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2789 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2790 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2792 /* The alignment of NODE, in bytes. */
2793 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2794 /* Set if the alignment of this DECL has been set by the user, for
2795 example with an 'aligned' attribute. */
2796 #define DECL_USER_ALIGN(NODE) \
2797 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2798 /* Holds the machine mode corresponding to the declaration of a variable or
2799 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2801 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2802 #define SET_DECL_MODE(NODE, MODE) \
2803 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2805 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2806 operation it is. This is only intended for low-level accesses;
2807 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2808 should be used instead. */
2809 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2810 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2812 /* Test if FCODE is a function code for an alloca operation. */
2813 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2814 ((FCODE) == BUILT_IN_ALLOCA \
2815 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2816 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2818 /* Generate case for an alloca operation. */
2819 #define CASE_BUILT_IN_ALLOCA \
2820 case BUILT_IN_ALLOCA: \
2821 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2822 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2824 #define DECL_FUNCTION_PERSONALITY(NODE) \
2825 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2827 /* Nonzero for a given ..._DECL node means that the name of this node should
2828 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2829 the associated type should be ignored. For a FUNCTION_DECL, the body of
2830 the function should also be ignored. */
2831 #define DECL_IGNORED_P(NODE) \
2832 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2834 /* Nonzero for a given ..._DECL node means that this node represents an
2835 "abstract instance" of the given declaration (e.g. in the original
2836 declaration of an inline function). When generating symbolic debugging
2837 information, we mustn't try to generate any address information for nodes
2838 marked as "abstract instances" because we don't actually generate
2839 any code or allocate any data space for such instances. */
2840 #define DECL_ABSTRACT_P(NODE) \
2841 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2843 /* Language-specific decl information. */
2844 #define DECL_LANG_SPECIFIC(NODE) \
2845 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2847 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2848 do not allocate storage, and refer to a definition elsewhere. Note that
2849 this does not necessarily imply the entity represented by NODE
2850 has no program source-level definition in this translation unit. For
2851 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2852 DECL_EXTERNAL may be true simultaneously; that can be the case for
2853 a C99 "extern inline" function. */
2854 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2856 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2857 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2859 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2861 Also set in some languages for variables, etc., outside the normal
2862 lexical scope, such as class instance variables. */
2863 #define DECL_NONLOCAL(NODE) \
2864 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2866 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2867 Used in FIELD_DECLs for vtable pointers.
2868 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2869 #define DECL_VIRTUAL_P(NODE) \
2870 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2872 /* Used to indicate that this DECL represents a compiler-generated entity. */
2873 #define DECL_ARTIFICIAL(NODE) \
2874 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2876 /* Additional flags for language-specific uses. */
2877 #define DECL_LANG_FLAG_0(NODE) \
2878 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2879 #define DECL_LANG_FLAG_1(NODE) \
2880 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2881 #define DECL_LANG_FLAG_2(NODE) \
2882 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2883 #define DECL_LANG_FLAG_3(NODE) \
2884 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2885 #define DECL_LANG_FLAG_4(NODE) \
2886 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2887 #define DECL_LANG_FLAG_5(NODE) \
2888 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2889 #define DECL_LANG_FLAG_6(NODE) \
2890 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2891 #define DECL_LANG_FLAG_7(NODE) \
2892 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2893 #define DECL_LANG_FLAG_8(NODE) \
2894 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2896 /* Nonzero for a scope which is equal to file scope. */
2897 #define SCOPE_FILE_SCOPE_P(EXP) \
2898 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2899 /* Nonzero for a decl which is at file scope. */
2900 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2901 /* Nonzero for a type which is at file scope. */
2902 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2904 /* Nonzero for a decl that is decorated using attribute used.
2905 This indicates to compiler tools that this decl needs to be preserved. */
2906 #define DECL_PRESERVE_P(DECL) \
2907 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2909 /* Nonzero for a decl that is decorated with the "noinit" attribute.
2910 decls with this attribute are placed into the ".noinit" section, so they are
2911 not initialized by the target's startup code. */
2912 #define DECL_NOINIT_P(DECL) \
2914 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2916 /* Nonzero for a decl that is decorated with the "persistent" attribute.
2917 decls with this attribute are placed into the ".persistent" section, so they
2918 are not initialized by the target's startup code. */
2919 #define DECL_PERSISTENT_P(DECL) \
2921 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2923 /* For function local variables of COMPLEX and VECTOR types,
2924 indicates that the variable is not aliased, and that all
2925 modifications to the variable have been adjusted so that
2926 they are killing assignments. Thus the variable may now
2927 be treated as a GIMPLE register, and use real instead of
2928 virtual ops in SSA form. */
2929 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2930 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2932 extern tree
decl_value_expr_lookup (tree
);
2933 extern void decl_value_expr_insert (tree
, tree
);
2935 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2936 if transformations have made this more complicated than evaluating the
2938 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2939 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2940 ->decl_common.decl_flag_2)
2941 #define DECL_VALUE_EXPR(NODE) \
2942 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2943 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2944 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2946 /* Holds the RTL expression for the value of a variable or function.
2947 This value can be evaluated lazily for functions, variables with
2948 static storage duration, and labels. */
2949 #define DECL_RTL(NODE) \
2950 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2951 ? (NODE)->decl_with_rtl.rtl \
2952 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2954 /* Set the DECL_RTL for NODE to RTL. */
2955 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2957 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2958 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2960 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2961 #define DECL_RTL_SET_P(NODE) \
2962 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2964 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2965 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2966 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2967 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2968 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2970 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2971 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2973 #if (GCC_VERSION >= 2007)
2974 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2975 ({ tree const __d = (decl); \
2976 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2977 /* Dereference it so the compiler knows it can't be NULL even \
2978 without assertion checking. */ \
2979 &*DECL_RTL_IF_SET (__d); })
2981 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2984 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2985 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2987 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2988 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2989 of the structure. */
2990 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2992 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2993 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2994 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2995 natural alignment of the field's type). */
2996 #define DECL_FIELD_BIT_OFFSET(NODE) \
2997 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2999 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
3000 if so, the type that was originally specified for it.
3001 TREE_TYPE may have been modified (in finish_struct). */
3002 #define DECL_BIT_FIELD_TYPE(NODE) \
3003 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3005 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
3006 representative FIELD_DECL. */
3007 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
3008 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3010 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3011 if nonzero, indicates that the field occupies the type. */
3012 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3014 /* For FIELD_DECLs, off_align holds the number of low-order bits of
3015 DECL_FIELD_OFFSET which are known to be always zero.
3016 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3018 #define DECL_OFFSET_ALIGN(NODE) \
3019 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3021 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
3022 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3023 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3025 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3026 which this FIELD_DECL is defined. This information is needed when
3027 writing debugging information about vfield and vbase decls for C++. */
3028 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3030 /* In a FIELD_DECL, indicates this field should be bit-packed. */
3031 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3033 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3035 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3037 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
3038 like passing/returning containing struct by value.
3039 Set for C++17 empty base artificial FIELD_DECLs as well as
3040 empty [[no_unique_address]] non-static data members. */
3041 #define DECL_FIELD_ABI_IGNORED(NODE) \
3042 (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3043 #define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
3045 gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
3046 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3049 /* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
3050 removed from the IL since PR42217 until PR101539 and by that changed
3051 the ABI on several targets. This flag is provided so that the backends
3052 can decide on the ABI with zero-width bitfields and emit -Wpsabi
3054 #define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
3055 (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3056 #define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
3058 gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
3059 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3062 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3063 this component. This makes it possible for Type-Based Alias Analysis
3064 to disambiguate accesses to this field with indirect accesses using
3067 struct S { int i; } s;
3070 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3072 From the implementation's viewpoint, the alias set of the type of the
3073 field 'i' (int) will not be recorded as a subset of that of the type of
3074 's' (struct S) in record_component_aliases. The counterpart is that
3075 accesses to s.i must not be given the alias set of the type of 'i'
3076 (int) but instead directly that of the type of 's' (struct S). */
3077 #define DECL_NONADDRESSABLE_P(NODE) \
3078 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3080 /* Used in a FIELD_DECL to indicate that this field is padding. */
3081 #define DECL_PADDING_P(NODE) \
3082 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3084 /* Used in a FIELD_DECL to indicate whether this field is not a flexible
3085 array member. This is only valid for the last array type field of a
3087 #define DECL_NOT_FLEXARRAY(NODE) \
3088 (FIELD_DECL_CHECK (NODE)->decl_common.decl_not_flexarray)
3090 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3091 dense, unique within any one function, and may be used to index arrays.
3092 If the value is -1, then no UID has been assigned. */
3093 #define LABEL_DECL_UID(NODE) \
3094 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3096 /* In a LABEL_DECL, the EH region number for which the label is the
3097 post_landing_pad. */
3098 #define EH_LANDING_PAD_NR(NODE) \
3099 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3101 /* For a PARM_DECL, records the data type used to pass the argument,
3102 which may be different from the type seen in the program. */
3103 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3105 /* For PARM_DECL, holds an RTL for the stack slot or register
3106 where the data was actually passed. */
3107 #define DECL_INCOMING_RTL(NODE) \
3108 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3110 /* Nonzero for a given ..._DECL node means that no warnings should be
3111 generated just because this node is unused. */
3112 #define DECL_IN_SYSTEM_HEADER(NODE) \
3113 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3115 /* Used to indicate that the linkage status of this DECL is not yet known,
3116 so it should not be output now. */
3117 #define DECL_DEFER_OUTPUT(NODE) \
3118 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3120 /* In a VAR_DECL that's static,
3121 nonzero if the space is in the text section. */
3122 #define DECL_IN_TEXT_SECTION(NODE) \
3123 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3125 /* In a VAR_DECL that's static,
3126 nonzero if it belongs to the global constant pool. */
3127 #define DECL_IN_CONSTANT_POOL(NODE) \
3128 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3130 /* Nonzero for a given ..._DECL node means that this node should be
3131 put in .common, if possible. If a DECL_INITIAL is given, and it
3132 is not error_mark_node, then the decl cannot be put in .common. */
3133 #define DECL_COMMON(NODE) \
3134 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3136 /* In a VAR_DECL, nonzero if the decl is a register variable with
3137 an explicit asm specification. */
3138 #define DECL_HARD_REGISTER(NODE) \
3139 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3141 /* Used to indicate that this DECL has weak linkage. */
3142 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3144 /* Used to indicate that the DECL is a dllimport. */
3145 #define DECL_DLLIMPORT_P(NODE) \
3146 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3148 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3149 not be put out unless it is needed in this translation unit.
3150 Entities like this are shared across translation units (like weak
3151 entities), but are guaranteed to be generated by any translation
3152 unit that needs them, and therefore need not be put out anywhere
3153 where they are not needed. DECL_COMDAT is just a hint to the
3154 back-end; it is up to front-ends which set this flag to ensure
3155 that there will never be any harm, other than bloat, in putting out
3156 something which is DECL_COMDAT. */
3157 #define DECL_COMDAT(NODE) \
3158 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3160 #define DECL_COMDAT_GROUP(NODE) \
3161 decl_comdat_group (NODE)
3163 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3164 multiple translation units should be merged. */
3165 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3166 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3168 /* The name of the object as the assembler will see it (but before any
3169 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3170 as DECL_NAME. It is an IDENTIFIER_NODE.
3172 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3173 One Definition Rule based type merging at LTO. It is computed only for
3174 LTO compilation and C++. */
3175 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3177 /* Raw accessor for DECL_ASSEMBLE_NAME. */
3178 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
3179 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3181 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3182 This is true of all DECL nodes except FIELD_DECL. */
3183 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3184 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3186 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3187 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3189 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3190 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3192 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3193 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3194 overwrite_decl_assembler_name (NODE, NAME)
3196 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3197 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3198 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3199 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3200 other words, the semantics of using this macro, are different than
3203 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3205 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3207 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3208 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3210 /* Records the section name in a section attribute. Used to pass
3211 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3212 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3214 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3215 this variable in a BIND_EXPR. */
3216 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3217 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3219 /* Value of the decls's visibility attribute */
3220 #define DECL_VISIBILITY(NODE) \
3221 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3223 /* Nonzero means that the decl (or an enclosing scope) had its
3224 visibility specified rather than being inferred. */
3225 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3226 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3228 /* In a VAR_DECL, the model to use if the data should be allocated from
3229 thread-local storage. */
3230 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3232 /* In a VAR_DECL, nonzero if the data should be allocated from
3233 thread-local storage. */
3234 #define DECL_THREAD_LOCAL_P(NODE) \
3235 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3237 /* In a non-local VAR_DECL with static storage duration, true if the
3238 variable has an initialization priority. If false, the variable
3239 will be initialized at the DEFAULT_INIT_PRIORITY. */
3240 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3241 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3243 extern tree
decl_debug_expr_lookup (tree
);
3244 extern void decl_debug_expr_insert (tree
, tree
);
3246 /* For VAR_DECL, this is set to an expression that it was split from. */
3247 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
3248 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3249 #define DECL_DEBUG_EXPR(NODE) \
3250 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3252 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3253 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3255 extern priority_type
decl_init_priority_lookup (tree
);
3256 extern priority_type
decl_fini_priority_lookup (tree
);
3257 extern void decl_init_priority_insert (tree
, priority_type
);
3258 extern void decl_fini_priority_insert (tree
, priority_type
);
3260 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3262 #define DECL_INIT_PRIORITY(NODE) \
3263 (decl_init_priority_lookup (NODE))
3264 /* Set the initialization priority for NODE to VAL. */
3265 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3266 (decl_init_priority_insert (NODE, VAL))
3268 /* For a FUNCTION_DECL the finalization priority of NODE. */
3269 #define DECL_FINI_PRIORITY(NODE) \
3270 (decl_fini_priority_lookup (NODE))
3271 /* Set the finalization priority for NODE to VAL. */
3272 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3273 (decl_fini_priority_insert (NODE, VAL))
3275 /* The initialization priority for entities for which no explicit
3276 initialization priority has been specified. */
3277 #define DEFAULT_INIT_PRIORITY 65535
3279 /* The maximum allowed initialization priority. */
3280 #define MAX_INIT_PRIORITY 65535
3282 /* The largest priority value reserved for use by system runtime
3284 #define MAX_RESERVED_INIT_PRIORITY 100
3286 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3287 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3288 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3290 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3291 #define DECL_NONLOCAL_FRAME(NODE) \
3292 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3294 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3295 #define DECL_NONALIASED(NODE) \
3296 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3298 /* In a VAR_DECL, nonzero if this variable is not required to have a distinct
3299 address from other variables with the same constant value. In other words,
3300 consider -fmerge-all-constants to be on for this VAR_DECL. */
3301 #define DECL_MERGEABLE(NODE) \
3302 (VAR_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3304 /* This field is used to reference anything in decl.result and is meant only
3305 for use by the garbage collector. */
3306 #define DECL_RESULT_FLD(NODE) \
3307 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3309 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3310 Before the struct containing the FUNCTION_DECL is laid out,
3311 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3312 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3313 function. When the class is laid out, this pointer is changed
3314 to an INTEGER_CST node which is suitable for use as an index
3315 into the virtual function table. */
3316 #define DECL_VINDEX(NODE) \
3317 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3319 /* In FUNCTION_DECL, holds the decl for the return value. */
3320 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3322 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3323 #define DECL_UNINLINABLE(NODE) \
3324 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3326 /* In a FUNCTION_DECL, the saved representation of the body of the
3328 #define DECL_SAVED_TREE(NODE) \
3329 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3331 /* Nonzero in a FUNCTION_DECL means this function should be treated
3332 as if it were a malloc, meaning it returns a pointer that is
3334 #define DECL_IS_MALLOC(NODE) \
3335 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3337 /* Macro for direct set and get of function_decl.decl_type. */
3338 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3339 (NODE->function_decl.decl_type)
3341 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3345 set_function_decl_type (tree decl
, function_decl_type t
, bool set
)
3349 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl
) == NONE
3350 || FUNCTION_DECL_DECL_TYPE (decl
) == t
);
3351 FUNCTION_DECL_DECL_TYPE (decl
) = t
;
3353 else if (FUNCTION_DECL_DECL_TYPE (decl
) == t
)
3354 FUNCTION_DECL_DECL_TYPE (decl
) = NONE
;
3357 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3358 function (like replaceable operators new or delete). */
3359 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3360 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3362 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3363 C++ operator new, meaning that it returns a pointer for which we
3364 should not use type based aliasing. */
3365 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3366 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_NEW)
3368 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3369 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3371 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3372 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3374 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3375 C++ operator delete. */
3376 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3377 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_DELETE)
3379 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3380 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3382 /* Nonzero in a FUNCTION_DECL means this function may return more
3384 #define DECL_IS_RETURNS_TWICE(NODE) \
3385 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3387 /* Nonzero in a FUNCTION_DECL means this function should be treated
3388 as "pure" function (like const function, but may read global memory).
3389 Note that being pure or const for a function is orthogonal to being
3390 nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3392 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3394 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3395 the const or pure function may not terminate. When this is nonzero
3396 for a const or pure function, it can be dealt with by cse passes
3397 but cannot be removed by dce passes since you are not allowed to
3398 change an infinite looping program into one that terminates without
3400 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3401 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3403 /* Nonzero in a FUNCTION_DECL means this function should be treated
3404 as "novops" function (function that does not read global memory,
3405 but may have arbitrary side effects). */
3406 #define DECL_IS_NOVOPS(NODE) \
3407 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3409 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3410 at the beginning or end of execution. */
3411 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3412 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3414 #define DECL_STATIC_DESTRUCTOR(NODE) \
3415 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3417 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3418 be instrumented with calls to support routines. */
3419 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3420 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3422 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3423 disabled in this function. */
3424 #define DECL_NO_LIMIT_STACK(NODE) \
3425 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3427 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3428 #define DECL_STATIC_CHAIN(NODE) \
3429 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3431 /* Nonzero for a decl that cgraph has decided should be inlined into
3432 at least one call site. It is not meaningful to look at this
3433 directly; always use cgraph_function_possibly_inlined_p. */
3434 #define DECL_POSSIBLY_INLINED(DECL) \
3435 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3437 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3438 such as via the `inline' keyword in C/C++. This flag controls the linkage
3439 semantics of 'inline' */
3440 #define DECL_DECLARED_INLINE_P(NODE) \
3441 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3443 /* Nonzero in a FUNCTION_DECL means this function should not get
3444 -Winline warnings. */
3445 #define DECL_NO_INLINE_WARNING_P(NODE) \
3446 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3448 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3449 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3450 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3452 /* Nonzero if a FUNCTION_CODE is a TM load. */
3453 #define BUILTIN_TM_LOAD_P(FN) \
3454 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3456 /* Nonzero if a FUNCTION_CODE is a TM store. */
3457 #define BUILTIN_TM_STORE_P(FN) \
3458 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3460 #define CASE_BUILT_IN_TM_LOAD(FN) \
3461 case BUILT_IN_TM_LOAD_##FN: \
3462 case BUILT_IN_TM_LOAD_RAR_##FN: \
3463 case BUILT_IN_TM_LOAD_RAW_##FN: \
3464 case BUILT_IN_TM_LOAD_RFW_##FN
3466 #define CASE_BUILT_IN_TM_STORE(FN) \
3467 case BUILT_IN_TM_STORE_##FN: \
3468 case BUILT_IN_TM_STORE_WAR_##FN: \
3469 case BUILT_IN_TM_STORE_WAW_##FN
3471 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3472 disregarding size and cost heuristics. This is equivalent to using
3473 the always_inline attribute without the required diagnostics if the
3474 function cannot be inlined. */
3475 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3476 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3478 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3479 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3481 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3482 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3483 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3485 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3486 that describes the status of this function. */
3487 #define DECL_STRUCT_FUNCTION(NODE) \
3488 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3490 /* For a builtin function, identify which part of the compiler defined it. */
3491 #define DECL_BUILT_IN_CLASS(NODE) \
3492 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3494 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3495 #define DECL_ARGUMENTS(NODE) \
3496 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3498 /* In FUNCTION_DECL, the function specific target options to use when compiling
3500 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3501 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3503 /* In FUNCTION_DECL, the function specific optimization options to use when
3504 compiling this function. */
3505 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3506 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3508 /* In FUNCTION_DECL, this is set if this function has other versions generated
3509 using "target" attributes. The default version is the one which does not
3510 have any "target" attribute set. */
3511 #define DECL_FUNCTION_VERSIONED(NODE)\
3512 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3514 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3515 Devirtualization machinery uses this knowledge for determing type of the
3516 object constructed. Also we assume that constructor address is not
3518 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3519 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3521 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3522 Devirtualization machinery uses this to track types in destruction. */
3523 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3524 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3526 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3527 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3528 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == LAMBDA_FUNCTION)
3530 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3531 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3533 /* In FUNCTION_DECL that represent an virtual method this is set when
3534 the method is final. */
3535 #define DECL_FINAL_P(NODE)\
3536 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3538 /* The source language of the translation-unit. */
3539 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3540 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3542 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3544 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3545 #define DECL_ORIGINAL_TYPE(NODE) \
3546 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3548 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3549 into stabs. Instead it will generate cross reference ('x') of names.
3550 This uses the same flag as DECL_EXTERNAL. */
3551 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3552 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3554 /* Getter of the imported declaration associated to the
3555 IMPORTED_DECL node. */
3556 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3557 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3559 /* Getter of the symbol declaration associated with the
3560 NAMELIST_DECL node. */
3561 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3562 (DECL_INITIAL (NODE))
3564 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3565 To reduce overhead, the nodes containing the statements are not trees.
3566 This avoids the overhead of tree_common on all linked list elements.
3568 Use the interface in tree-iterator.h to access this node. */
3570 #define STATEMENT_LIST_HEAD(NODE) \
3571 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3572 #define STATEMENT_LIST_TAIL(NODE) \
3573 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3575 #define TREE_OPTIMIZATION(NODE) \
3576 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3578 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3579 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3581 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3582 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3584 /* Return a tree node that encapsulates the optimization options in OPTS
3586 extern tree
build_optimization_node (struct gcc_options
*opts
,
3587 struct gcc_options
*opts_set
);
3589 #define TREE_TARGET_OPTION(NODE) \
3590 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3592 #define TREE_TARGET_GLOBALS(NODE) \
3593 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3595 /* Return a tree node that encapsulates the target options in OPTS and
3597 extern tree
build_target_option_node (struct gcc_options
*opts
,
3598 struct gcc_options
*opts_set
);
3600 extern void prepare_target_option_nodes_for_pch (void);
3602 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3605 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3607 if (TREE_CODE (__t
) != __c
)
3608 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3613 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3616 if (TREE_CODE (__t
) == __c
)
3617 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3622 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3623 enum tree_code __c1
, enum tree_code __c2
)
3625 if (TREE_CODE (__t
) != __c1
3626 && TREE_CODE (__t
) != __c2
)
3627 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3632 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3633 enum tree_code __c1
, enum tree_code __c2
)
3635 if (TREE_CODE (__t
) == __c1
3636 || TREE_CODE (__t
) == __c2
)
3637 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3642 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3643 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3645 if (TREE_CODE (__t
) != __c1
3646 && TREE_CODE (__t
) != __c2
3647 && TREE_CODE (__t
) != __c3
)
3648 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3653 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3654 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3656 if (TREE_CODE (__t
) == __c1
3657 || TREE_CODE (__t
) == __c2
3658 || TREE_CODE (__t
) == __c3
)
3659 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3664 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3665 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3666 enum tree_code __c4
)
3668 if (TREE_CODE (__t
) != __c1
3669 && TREE_CODE (__t
) != __c2
3670 && TREE_CODE (__t
) != __c3
3671 && TREE_CODE (__t
) != __c4
)
3672 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3677 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3678 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3679 enum tree_code __c4
)
3681 if (TREE_CODE (__t
) == __c1
3682 || TREE_CODE (__t
) == __c2
3683 || TREE_CODE (__t
) == __c3
3684 || TREE_CODE (__t
) == __c4
)
3685 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3690 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3691 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3692 enum tree_code __c4
, enum tree_code __c5
)
3694 if (TREE_CODE (__t
) != __c1
3695 && TREE_CODE (__t
) != __c2
3696 && TREE_CODE (__t
) != __c3
3697 && TREE_CODE (__t
) != __c4
3698 && TREE_CODE (__t
) != __c5
)
3699 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3704 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3705 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3706 enum tree_code __c4
, enum tree_code __c5
)
3708 if (TREE_CODE (__t
) == __c1
3709 || TREE_CODE (__t
) == __c2
3710 || TREE_CODE (__t
) == __c3
3711 || TREE_CODE (__t
) == __c4
3712 || TREE_CODE (__t
) == __c5
)
3713 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3718 tree_check6 (tree __t
, const char *__f
, int __l
, const char *__g
,
3719 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3720 enum tree_code __c4
, enum tree_code __c5
, enum tree_code __c6
)
3722 if (TREE_CODE (__t
) != __c1
3723 && TREE_CODE (__t
) != __c2
3724 && TREE_CODE (__t
) != __c3
3725 && TREE_CODE (__t
) != __c4
3726 && TREE_CODE (__t
) != __c5
3727 && TREE_CODE (__t
) != __c6
)
3728 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, __c6
,
3734 tree_not_check6 (tree __t
, const char *__f
, int __l
, const char *__g
,
3735 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3736 enum tree_code __c4
, enum tree_code __c5
, enum tree_code __c6
)
3738 if (TREE_CODE (__t
) == __c1
3739 || TREE_CODE (__t
) == __c2
3740 || TREE_CODE (__t
) == __c3
3741 || TREE_CODE (__t
) == __c4
3742 || TREE_CODE (__t
) == __c5
3743 || TREE_CODE (__t
) == __c6
)
3744 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
,
3750 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3751 const char *__f
, int __l
, const char *__g
)
3753 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3754 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3759 tree_class_check (tree __t
, const enum tree_code_class __class
,
3760 const char *__f
, int __l
, const char *__g
)
3762 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3763 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3768 tree_range_check (tree __t
,
3769 enum tree_code __code1
, enum tree_code __code2
,
3770 const char *__f
, int __l
, const char *__g
)
3772 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3773 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3778 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3779 const char *__f
, int __l
, const char *__g
)
3781 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3782 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3783 if (__t
->omp_clause
.code
!= __code
)
3784 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3789 omp_clause_range_check (tree __t
,
3790 enum omp_clause_code __code1
,
3791 enum omp_clause_code __code2
,
3792 const char *__f
, int __l
, const char *__g
)
3794 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3795 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3796 if ((int) __t
->omp_clause
.code
< (int) __code1
3797 || (int) __t
->omp_clause
.code
> (int) __code2
)
3798 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3802 /* These checks have to be special cased. */
3805 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3807 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3808 if (!IS_EXPR_CODE_CLASS (__c
))
3809 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3813 /* These checks have to be special cased. */
3816 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3819 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3823 inline const HOST_WIDE_INT
*
3824 tree_int_cst_elt_check (const_tree __t
, int __i
,
3825 const char *__f
, int __l
, const char *__g
)
3827 if (TREE_CODE (__t
) != INTEGER_CST
)
3828 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3829 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3830 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3832 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3835 inline HOST_WIDE_INT
*
3836 tree_int_cst_elt_check (tree __t
, int __i
,
3837 const char *__f
, int __l
, const char *__g
)
3839 if (TREE_CODE (__t
) != INTEGER_CST
)
3840 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3841 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3842 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3844 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3847 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3849 # if GCC_VERSION >= 4006
3850 #pragma GCC diagnostic push
3851 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3855 tree_vec_elt_check (tree __t
, int __i
,
3856 const char *__f
, int __l
, const char *__g
)
3858 if (TREE_CODE (__t
) != TREE_VEC
)
3859 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3860 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3861 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3862 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3865 # if GCC_VERSION >= 4006
3866 #pragma GCC diagnostic pop
3870 omp_clause_elt_check (tree __t
, int __i
,
3871 const char *__f
, int __l
, const char *__g
)
3873 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3874 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3875 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3876 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3877 return &__t
->omp_clause
.ops
[__i
];
3880 /* These checks have to be special cased. */
3883 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3885 if (!ANY_INTEGRAL_TYPE_P (__t
))
3886 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3887 INTEGER_TYPE
, BITINT_TYPE
, 0);
3892 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3895 if (TREE_CODE (__t
) != __c
)
3896 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3901 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3904 if (TREE_CODE (__t
) == __c
)
3905 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3910 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3911 enum tree_code __c1
, enum tree_code __c2
)
3913 if (TREE_CODE (__t
) != __c1
3914 && TREE_CODE (__t
) != __c2
)
3915 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3920 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3921 enum tree_code __c1
, enum tree_code __c2
)
3923 if (TREE_CODE (__t
) == __c1
3924 || TREE_CODE (__t
) == __c2
)
3925 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3930 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3931 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3933 if (TREE_CODE (__t
) != __c1
3934 && TREE_CODE (__t
) != __c2
3935 && TREE_CODE (__t
) != __c3
)
3936 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3941 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3942 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3944 if (TREE_CODE (__t
) == __c1
3945 || TREE_CODE (__t
) == __c2
3946 || TREE_CODE (__t
) == __c3
)
3947 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3952 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3953 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3954 enum tree_code __c4
)
3956 if (TREE_CODE (__t
) != __c1
3957 && TREE_CODE (__t
) != __c2
3958 && TREE_CODE (__t
) != __c3
3959 && TREE_CODE (__t
) != __c4
)
3960 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3965 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3966 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3967 enum tree_code __c4
)
3969 if (TREE_CODE (__t
) == __c1
3970 || TREE_CODE (__t
) == __c2
3971 || TREE_CODE (__t
) == __c3
3972 || TREE_CODE (__t
) == __c4
)
3973 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3978 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3979 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3980 enum tree_code __c4
, enum tree_code __c5
)
3982 if (TREE_CODE (__t
) != __c1
3983 && TREE_CODE (__t
) != __c2
3984 && TREE_CODE (__t
) != __c3
3985 && TREE_CODE (__t
) != __c4
3986 && TREE_CODE (__t
) != __c5
)
3987 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3992 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3993 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3994 enum tree_code __c4
, enum tree_code __c5
)
3996 if (TREE_CODE (__t
) == __c1
3997 || TREE_CODE (__t
) == __c2
3998 || TREE_CODE (__t
) == __c3
3999 || TREE_CODE (__t
) == __c4
4000 || TREE_CODE (__t
) == __c5
)
4001 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
4006 tree_check6 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
4007 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
4008 enum tree_code __c4
, enum tree_code __c5
, enum tree_code __c6
)
4010 if (TREE_CODE (__t
) != __c1
4011 && TREE_CODE (__t
) != __c2
4012 && TREE_CODE (__t
) != __c3
4013 && TREE_CODE (__t
) != __c4
4014 && TREE_CODE (__t
) != __c5
4015 && TREE_CODE (__t
) != __c6
)
4016 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, __c6
,
4022 tree_not_check6 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
4023 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
4024 enum tree_code __c4
, enum tree_code __c5
, enum tree_code __c6
)
4026 if (TREE_CODE (__t
) == __c1
4027 || TREE_CODE (__t
) == __c2
4028 || TREE_CODE (__t
) == __c3
4029 || TREE_CODE (__t
) == __c4
4030 || TREE_CODE (__t
) == __c5
4031 || TREE_CODE (__t
) == __c6
)
4032 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
,
4038 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
4039 const char *__f
, int __l
, const char *__g
)
4041 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
4042 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
4047 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
4048 const char *__f
, int __l
, const char *__g
)
4050 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
4051 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
4056 tree_range_check (const_tree __t
,
4057 enum tree_code __code1
, enum tree_code __code2
,
4058 const char *__f
, int __l
, const char *__g
)
4060 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
4061 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
4066 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
4067 const char *__f
, int __l
, const char *__g
)
4069 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4070 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4071 if (__t
->omp_clause
.code
!= __code
)
4072 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
4077 omp_clause_range_check (const_tree __t
,
4078 enum omp_clause_code __code1
,
4079 enum omp_clause_code __code2
,
4080 const char *__f
, int __l
, const char *__g
)
4082 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4083 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4084 if ((int) __t
->omp_clause
.code
< (int) __code1
4085 || (int) __t
->omp_clause
.code
> (int) __code2
)
4086 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
4091 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
4093 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
4094 if (!IS_EXPR_CODE_CLASS (__c
))
4095 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
4100 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
4103 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
4107 # if GCC_VERSION >= 4006
4108 #pragma GCC diagnostic push
4109 #pragma GCC diagnostic ignored "-Wstrict-overflow"
4113 tree_vec_elt_check (const_tree __t
, int __i
,
4114 const char *__f
, int __l
, const char *__g
)
4116 if (TREE_CODE (__t
) != TREE_VEC
)
4117 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
4118 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
4119 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
4120 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
4121 //return &__t->vec.a[__i];
4124 # if GCC_VERSION >= 4006
4125 #pragma GCC diagnostic pop
4129 omp_clause_elt_check (const_tree __t
, int __i
,
4130 const char *__f
, int __l
, const char *__g
)
4132 if (TREE_CODE (__t
) != OMP_CLAUSE
)
4133 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
4134 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
4135 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4136 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
4140 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
4143 if (!ANY_INTEGRAL_TYPE_P (__t
))
4144 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
4145 INTEGER_TYPE
, BITINT_TYPE
, 0);
4151 /* Compute the number of operands in an expression node NODE. For
4152 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4153 otherwise it is looked up from the node's code. */
4155 tree_operand_length (const_tree node
)
4157 if (VL_EXP_CLASS_P (node
))
4158 return VL_EXP_OPERAND_LENGTH (node
);
4160 return TREE_CODE_LENGTH (TREE_CODE (node
));
4163 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4165 /* Special checks for TREE_OPERANDs. */
4167 tree_operand_check (tree __t
, int __i
,
4168 const char *__f
, int __l
, const char *__g
)
4170 const_tree __u
= EXPR_CHECK (__t
);
4171 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
4172 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
4173 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
4177 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
4178 const char *__f
, int __l
, const char *__g
)
4180 if (TREE_CODE (__t
) != __code
)
4181 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
4182 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
4183 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4184 return &__t
->exp
.operands
[__i
];
4188 tree_operand_check (const_tree __t
, int __i
,
4189 const char *__f
, int __l
, const char *__g
)
4191 const_tree __u
= EXPR_CHECK (__t
);
4192 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
4193 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
4194 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
4198 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
4199 const char *__f
, int __l
, const char *__g
)
4201 if (TREE_CODE (__t
) != __code
)
4202 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
4203 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
4204 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
4205 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
4210 /* True iff an identifier matches a C string. */
4213 id_equal (const_tree id
, const char *str
)
4215 return !strcmp (IDENTIFIER_POINTER (id
), str
);
4219 id_equal (const char *str
, const_tree id
)
4221 return id_equal (id
, str
);
4224 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
4227 TYPE_VECTOR_SUBPARTS (const_tree node
)
4229 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
4230 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
4231 if (NUM_POLY_INT_COEFFS
== 2)
4233 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4234 description of the encoding. */
4235 poly_uint64 res
= 0;
4236 res
.coeffs
[0] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
4237 if (precision
& 0x100)
4238 res
.coeffs
[1] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
4242 return HOST_WIDE_INT_1U
<< precision
;
4245 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4246 satisfy valid_vector_subparts_p. */
4249 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
4251 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
4252 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
4253 int index
= exact_log2 (coeff0
);
4254 gcc_assert (index
>= 0);
4255 if (NUM_POLY_INT_COEFFS
== 2)
4257 /* We have two coefficients that are each in the range 1 << [0, 63],
4258 so supporting all combinations would require 6 bits per coefficient
4259 and 12 bits in total. Since the precision field is only 10 bits
4260 in size, we need to be more restrictive than that.
4262 At present, coeff[1] is always either 0 (meaning that the number
4263 of units is constant) or equal to coeff[0] (meaning that the number
4264 of units is N + X * N for some target-dependent zero-based runtime
4265 parameter X). We can therefore encode coeff[1] in a single bit.
4267 The most compact encoding would be to use mask 0x3f for coeff[0]
4268 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4269 get slightly more efficient code on some hosts if we instead
4270 treat the shift amount as an independent byte, so here we use
4271 0xff for coeff[0] and 0x100 for coeff[1]. */
4272 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
4273 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
4274 VECTOR_TYPE_CHECK (node
)->type_common
.precision
4275 = index
+ (coeff1
!= 0 ? 0x100 : 0);
4278 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
4281 /* Return true if we can construct vector types with the given number
4285 valid_vector_subparts_p (poly_uint64 subparts
)
4287 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
4288 if (!pow2p_hwi (coeff0
))
4290 if (NUM_POLY_INT_COEFFS
== 2)
4292 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
4293 if (coeff1
!= 0 && coeff1
!= coeff0
)
4299 /* Return the built-in function that DECL represents, given that it is known
4300 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4301 inline built_in_function
4302 DECL_FUNCTION_CODE (const_tree decl
)
4304 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4305 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_NORMAL
);
4306 return (built_in_function
) fndecl
.function_code
;
4309 /* Return the target-specific built-in function that DECL represents,
4310 given that it is known to be a FUNCTION_DECL with built-in class
4313 DECL_MD_FUNCTION_CODE (const_tree decl
)
4315 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4316 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_MD
);
4317 return fndecl
.function_code
;
4320 /* Return the frontend-specific built-in function that DECL represents,
4321 given that it is known to be a FUNCTION_DECL with built-in class
4322 BUILT_IN_FRONTEND. */
4324 DECL_FE_FUNCTION_CODE (const_tree decl
)
4326 const tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4327 gcc_checking_assert (fndecl
.built_in_class
== BUILT_IN_FRONTEND
);
4328 return fndecl
.function_code
;
4331 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4334 set_decl_built_in_function (tree decl
, built_in_class fclass
,
4337 tree_function_decl
&fndecl
= FUNCTION_DECL_CHECK (decl
)->function_decl
;
4338 fndecl
.built_in_class
= fclass
;
4339 fndecl
.function_code
= fcode
;
4342 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4343 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4345 copy_decl_built_in_function (tree newdecl
, const_tree olddecl
)
4347 tree_function_decl
&newfndecl
= FUNCTION_DECL_CHECK (newdecl
)->function_decl
;
4348 const tree_function_decl
&oldfndecl
4349 = FUNCTION_DECL_CHECK (olddecl
)->function_decl
;
4350 newfndecl
.built_in_class
= oldfndecl
.built_in_class
;
4351 newfndecl
.function_code
= oldfndecl
.function_code
;
4354 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4355 wrapper added to express a location_t on behalf of the node's child
4356 (e.g. by maybe_wrap_with_location). */
4358 #define EXPR_LOCATION_WRAPPER_P(NODE) \
4359 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4361 /* Test if EXP is merely a wrapper node, added to express a location_t
4362 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4365 location_wrapper_p (const_tree exp
)
4367 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4368 the flag EXPR_LOCATION_WRAPPER_P is set.
4369 It normally has the same type as its operand, but it can have a
4370 different one if the type of the operand has changed (e.g. when
4371 merging duplicate decls).
4373 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4374 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4375 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
4376 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
4377 && EXPR_LOCATION_WRAPPER_P (exp
))
4382 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4385 tree_strip_any_location_wrapper (tree exp
)
4387 if (location_wrapper_p (exp
))
4388 return TREE_OPERAND (exp
, 0);
4393 #define error_mark_node global_trees[TI_ERROR_MARK]
4395 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4396 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4397 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4398 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4399 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4401 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4402 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4403 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4404 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4405 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4407 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4408 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4409 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4410 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4411 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4413 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4414 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4415 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4416 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4418 #define void_node global_trees[TI_VOID]
4420 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4421 #define integer_one_node global_trees[TI_INTEGER_ONE]
4422 #define integer_three_node global_trees[TI_INTEGER_THREE]
4423 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4424 #define size_zero_node global_trees[TI_SIZE_ZERO]
4425 #define size_one_node global_trees[TI_SIZE_ONE]
4426 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4427 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4428 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4430 /* Base access nodes. */
4431 #define access_public_node global_trees[TI_PUBLIC]
4432 #define access_protected_node global_trees[TI_PROTECTED]
4433 #define access_private_node global_trees[TI_PRIVATE]
4435 #define null_pointer_node global_trees[TI_NULL_POINTER]
4437 #define float_type_node global_trees[TI_FLOAT_TYPE]
4438 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4439 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4440 #define bfloat16_type_node global_trees[TI_BFLOAT16_TYPE]
4442 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4443 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4444 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4445 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4447 /* Names for individual types (code should normally iterate over all
4448 such types; these are only for back-end use, or in contexts such as
4449 *.def where iteration is not possible). */
4450 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4451 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4452 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4453 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4454 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4455 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4456 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4458 /* Type used by certain backends for __float128, which in C++ should be
4459 distinct type from _Float128 for backwards compatibility reasons. */
4460 #define float128t_type_node global_trees[TI_FLOAT128T_TYPE]
4462 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4463 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4464 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4465 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4467 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4468 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4469 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4470 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4472 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4474 #define void_type_node global_trees[TI_VOID_TYPE]
4475 /* The C type `void *'. */
4476 #define ptr_type_node global_trees[TI_PTR_TYPE]
4477 /* The C type `const void *'. */
4478 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4479 /* The C type `size_t'. */
4480 #define size_type_node global_trees[TI_SIZE_TYPE]
4481 #define pid_type_node global_trees[TI_PID_TYPE]
4482 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4483 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4484 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4485 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4486 /* The C type `FILE *'. */
4487 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4488 /* The C type `const struct tm *'. */
4489 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4490 /* The C type `fenv_t *'. */
4491 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4492 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4493 /* The C type `fexcept_t *'. */
4494 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4495 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4496 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4498 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4499 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4500 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4502 /* The decimal floating point types. */
4503 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4504 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4505 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4507 /* The fixed-point types. */
4508 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4509 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4510 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4511 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4512 #define sat_unsigned_short_fract_type_node \
4513 global_trees[TI_SAT_USFRACT_TYPE]
4514 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4515 #define sat_unsigned_long_fract_type_node \
4516 global_trees[TI_SAT_ULFRACT_TYPE]
4517 #define sat_unsigned_long_long_fract_type_node \
4518 global_trees[TI_SAT_ULLFRACT_TYPE]
4519 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4520 #define fract_type_node global_trees[TI_FRACT_TYPE]
4521 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4522 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4523 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4524 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4525 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4526 #define unsigned_long_long_fract_type_node \
4527 global_trees[TI_ULLFRACT_TYPE]
4528 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4529 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4530 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4531 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4532 #define sat_unsigned_short_accum_type_node \
4533 global_trees[TI_SAT_USACCUM_TYPE]
4534 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4535 #define sat_unsigned_long_accum_type_node \
4536 global_trees[TI_SAT_ULACCUM_TYPE]
4537 #define sat_unsigned_long_long_accum_type_node \
4538 global_trees[TI_SAT_ULLACCUM_TYPE]
4539 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4540 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4541 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4542 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4543 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4544 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4545 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4546 #define unsigned_long_long_accum_type_node \
4547 global_trees[TI_ULLACCUM_TYPE]
4548 #define qq_type_node global_trees[TI_QQ_TYPE]
4549 #define hq_type_node global_trees[TI_HQ_TYPE]
4550 #define sq_type_node global_trees[TI_SQ_TYPE]
4551 #define dq_type_node global_trees[TI_DQ_TYPE]
4552 #define tq_type_node global_trees[TI_TQ_TYPE]
4553 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4554 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4555 #define usq_type_node global_trees[TI_USQ_TYPE]
4556 #define udq_type_node global_trees[TI_UDQ_TYPE]
4557 #define utq_type_node global_trees[TI_UTQ_TYPE]
4558 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4559 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4560 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4561 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4562 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4563 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4564 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4565 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4566 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4567 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4568 #define ha_type_node global_trees[TI_HA_TYPE]
4569 #define sa_type_node global_trees[TI_SA_TYPE]
4570 #define da_type_node global_trees[TI_DA_TYPE]
4571 #define ta_type_node global_trees[TI_TA_TYPE]
4572 #define uha_type_node global_trees[TI_UHA_TYPE]
4573 #define usa_type_node global_trees[TI_USA_TYPE]
4574 #define uda_type_node global_trees[TI_UDA_TYPE]
4575 #define uta_type_node global_trees[TI_UTA_TYPE]
4576 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4577 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4578 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4579 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4580 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4581 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4582 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4583 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4585 /* The node that should be placed at the end of a parameter list to
4586 indicate that the function does not take a variable number of
4587 arguments. The TREE_VALUE will be void_type_node and there will be
4588 no TREE_CHAIN. Language-independent code should not assume
4589 anything else about this node. */
4590 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4592 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4593 #define MAIN_NAME_P(NODE) \
4594 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4596 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4598 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4599 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4601 /* Default/current target options (TARGET_OPTION_NODE). */
4602 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4603 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4605 /* Default tree list option(), optimize() pragmas to be linked into the
4607 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4608 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4610 /* SCEV analyzer global shared trees. */
4611 #define chrec_not_analyzed_yet NULL_TREE
4612 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4613 #define chrec_known global_trees[TI_CHREC_KNOWN]
4615 #define char_type_node integer_types[itk_char]
4616 #define signed_char_type_node integer_types[itk_signed_char]
4617 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4618 #define short_integer_type_node integer_types[itk_short]
4619 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4620 #define integer_type_node integer_types[itk_int]
4621 #define unsigned_type_node integer_types[itk_unsigned_int]
4622 #define long_integer_type_node integer_types[itk_long]
4623 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4624 #define long_long_integer_type_node integer_types[itk_long_long]
4625 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4627 /* True if T is an erroneous expression. */
4630 error_operand_p (const_tree t
)
4632 return (t
== error_mark_node
4633 || (t
&& TREE_TYPE (t
) == error_mark_node
));
4636 /* Return the number of elements encoded directly in a VECTOR_CST. */
4639 vector_cst_encoded_nelts (const_tree t
)
4641 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4644 extern tree
decl_assembler_name (tree
);
4645 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4646 extern tree
decl_comdat_group (const_tree
);
4647 extern tree
decl_comdat_group_id (const_tree
);
4648 extern const char *decl_section_name (const_tree
);
4649 extern void set_decl_section_name (tree
, const char *);
4650 extern void set_decl_section_name (tree
, const_tree
);
4651 extern enum tls_model
decl_tls_model (const_tree
);
4652 extern void set_decl_tls_model (tree
, enum tls_model
);
4654 /* Compute the number of bytes occupied by 'node'. This routine only
4655 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4657 extern size_t tree_size (const_tree
);
4659 /* Compute the number of bytes occupied by a tree with code CODE.
4660 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4661 which are of variable length. */
4662 extern size_t tree_code_size (enum tree_code
);
4664 /* Allocate and return a new UID from the DECL_UID namespace. */
4665 extern int allocate_decl_uid (void);
4667 /* Lowest level primitive for allocating a node.
4668 The TREE_CODE is the only argument. Contents are initialized
4669 to zero except for a few of the common fields. */
4671 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4673 /* Free tree node. */
4675 extern void free_node (tree
);
4677 /* Make a copy of a node, with all the same contents. */
4679 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4681 /* Make a copy of a chain of TREE_LIST nodes. */
4683 extern tree
copy_list (tree
);
4685 /* Make a CASE_LABEL_EXPR. */
4687 extern tree
build_case_label (tree
, tree
, tree
);
4690 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4692 /* Make an INTEGER_CST. */
4694 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4696 /* Make a TREE_VEC. */
4698 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4700 /* Grow a TREE_VEC. */
4702 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4704 /* Treat a TREE_VEC as a range of trees, e.g.
4705 for (tree e : tree_vec_range (v)) { ... } */
4707 class tree_vec_range
4711 tree_vec_range(tree v
) : v(v
) { }
4712 tree
*begin() { return TREE_VEC_BEGIN (v
); }
4713 tree
*end() { return TREE_VEC_END (v
); }
4716 /* Construct various types of nodes. */
4718 extern tree
build_nt (enum tree_code
, ...);
4719 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4721 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4722 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4723 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4724 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4725 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4726 tree CXX_MEM_STAT_INFO
);
4727 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4728 tree CXX_MEM_STAT_INFO
);
4730 /* _loc versions of build[1-5]. */
4733 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4734 tree arg1 CXX_MEM_STAT_INFO
)
4736 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4737 if (CAN_HAVE_LOCATION_P (t
))
4738 SET_EXPR_LOCATION (t
, loc
);
4743 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4744 tree arg1 CXX_MEM_STAT_INFO
)
4746 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4747 if (CAN_HAVE_LOCATION_P (t
))
4748 SET_EXPR_LOCATION (t
, loc
);
4753 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4754 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4756 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4757 if (CAN_HAVE_LOCATION_P (t
))
4758 SET_EXPR_LOCATION (t
, loc
);
4763 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4764 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4766 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4767 if (CAN_HAVE_LOCATION_P (t
))
4768 SET_EXPR_LOCATION (t
, loc
);
4773 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4774 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4776 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4777 arg4 PASS_MEM_STAT
);
4778 if (CAN_HAVE_LOCATION_P (t
))
4779 SET_EXPR_LOCATION (t
, loc
);
4783 /* Constructs double_int from tree CST. */
4785 extern tree
double_int_to_tree (tree
, double_int
);
4787 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4788 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4790 /* Create an INT_CST node with a CST value zero extended. */
4793 extern tree
build_int_cst (tree
, poly_int64
);
4794 extern tree
build_int_cstu (tree type
, poly_uint64
);
4795 extern tree
build_int_cst_type (tree
, poly_int64
);
4796 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4797 extern tree
build_vector_from_ctor (tree
, const vec
<constructor_elt
, va_gc
> *);
4798 extern tree
build_vector_from_val (tree
, tree
);
4799 extern tree
build_uniform_cst (tree
, tree
);
4800 extern tree
build_vec_series (tree
, tree
, tree
);
4801 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4802 extern tree
build_vector_a_then_b (tree
, unsigned int, tree
, tree
);
4803 extern void recompute_constructor_flags (tree
);
4804 extern void verify_constructor_flags (tree
);
4805 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> * CXX_MEM_STAT_INFO
);
4806 extern tree
build_constructor_single (tree
, tree
, tree
);
4807 extern tree
build_constructor_from_list (tree
, tree
);
4808 extern tree
build_constructor_from_vec (tree
, const vec
<tree
, va_gc
> *);
4809 extern tree
build_constructor_va (tree
, int, ...);
4810 extern tree
build_clobber (tree
, enum clobber_kind
= CLOBBER_UNDEF
);
4811 extern tree
build_real_from_int_cst (tree
, const_tree
);
4812 extern tree
build_real_from_wide (tree
, const wide_int_ref
&, signop
);
4813 extern tree
build_complex (tree
, tree
, tree
);
4814 extern tree
build_complex_inf (tree
, bool);
4815 extern tree
build_each_one_cst (tree
);
4816 extern tree
build_one_cst (tree
);
4817 extern tree
build_minus_one_cst (tree
);
4818 extern tree
build_all_ones_cst (tree
);
4819 extern tree
build_zero_cst (tree
);
4820 extern tree
build_replicated_int_cst (tree
, unsigned, HOST_WIDE_INT
);
4821 extern tree
sign_mask_for (tree
);
4822 extern tree
build_string (unsigned, const char * = NULL
);
4823 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4824 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4825 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4826 extern tree
build_decl (location_t
, enum tree_code
,
4827 tree
, tree CXX_MEM_STAT_INFO
);
4828 extern tree
build_debug_expr_decl (tree type
);
4829 extern tree
build_fn_decl (const char *, tree
);
4830 extern tree
build_translation_unit_decl (tree
);
4831 extern tree
build_block (tree
, tree
, tree
, tree
);
4832 extern tree
build_empty_stmt (location_t
);
4833 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4835 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4837 extern tree
build_call_nary (tree
, tree
, int, ...);
4838 extern tree
build_call_valist (tree
, tree
, int, va_list);
4839 #define build_call_array(T1,T2,N,T3)\
4840 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4841 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4842 extern tree
build_call_vec (tree
, tree
, const vec
<tree
, va_gc
> *);
4843 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4844 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4845 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4846 extern tree
build_call_expr (tree
, int, ...);
4847 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4849 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4850 tree
, int, const tree
*);
4851 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4853 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4854 extern tree
build_string_literal (unsigned, const char * = NULL
,
4855 tree
= char_type_node
,
4856 unsigned HOST_WIDE_INT
= HOST_WIDE_INT_M1U
);
4857 inline tree
build_string_literal (const char *p
)
4858 { return build_string_literal (strlen (p
) + 1, p
); }
4859 inline tree
build_string_literal (tree t
)
4861 return build_string_literal (IDENTIFIER_LENGTH (t
) + 1,
4862 IDENTIFIER_POINTER (t
));
4865 /* Construct various nodes representing data types. */
4867 extern tree
signed_or_unsigned_type_for (int, tree
);
4868 extern tree
signed_type_for (tree
);
4869 extern tree
unsigned_type_for (tree
);
4870 extern bool is_truth_type_for (tree
, tree
);
4871 extern bool tree_zero_one_valued_p (tree
);
4872 extern tree
truth_type_for (tree
);
4873 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4874 extern tree
build_pointer_type (tree
);
4875 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4876 extern tree
build_reference_type (tree
);
4877 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4878 extern tree
build_vector_type (tree
, poly_int64
);
4879 extern tree
build_truth_vector_type_for_mode (poly_uint64
, machine_mode
);
4880 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4881 extern tree
build_index_type (tree
);
4882 extern tree
build_array_type_1 (tree
, tree
, bool, bool, bool);
4883 extern tree
build_array_type (tree
, tree
, bool = false);
4884 extern tree
build_nonshared_array_type (tree
, tree
);
4885 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4886 extern tree
build_function_type (tree
, tree
, bool = false);
4887 extern tree
build_function_type_list (tree
, ...);
4888 extern tree
build_varargs_function_type_list (tree
, ...);
4889 extern tree
build_function_type_array (tree
, int, tree
*);
4890 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4891 #define build_function_type_vec(RET, V) \
4892 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4893 #define build_varargs_function_type_vec(RET, V) \
4894 build_varargs_function_type_array (RET, vec_safe_length (V), \
4895 vec_safe_address (V))
4896 extern tree
build_method_type_directly (tree
, tree
, tree
);
4897 extern tree
build_method_type (tree
, tree
);
4898 extern tree
build_offset_type (tree
, tree
);
4899 extern tree
build_complex_type (tree
, bool named
= false);
4900 extern tree
array_type_nelts (const_tree
);
4902 extern tree
value_member (tree
, tree
);
4903 extern tree
purpose_member (const_tree
, tree
);
4904 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4905 extern tree
chain_index (int, tree
);
4907 /* Arguments may be null. */
4908 extern bool tree_int_cst_equal (const_tree
, const_tree
);
4910 /* The following predicates are safe to call with a null argument. */
4911 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4912 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4913 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4914 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4916 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4917 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4918 extern poly_int64
tree_to_poly_int64 (const_tree
)
4919 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4920 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4921 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4922 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4923 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4924 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4925 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4926 tree_to_shwi (const_tree t
)
4928 gcc_assert (tree_fits_shwi_p (t
));
4929 return TREE_INT_CST_LOW (t
);
4932 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4933 tree_to_uhwi (const_tree t
)
4935 gcc_assert (tree_fits_uhwi_p (t
));
4936 return TREE_INT_CST_LOW (t
);
4938 #if NUM_POLY_INT_COEFFS == 1
4939 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4940 tree_to_poly_int64 (const_tree t
)
4942 gcc_assert (tree_fits_poly_int64_p (t
));
4943 return TREE_INT_CST_LOW (t
);
4946 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4947 tree_to_poly_uint64 (const_tree t
)
4949 gcc_assert (tree_fits_poly_uint64_p (t
));
4950 return TREE_INT_CST_LOW (t
);
4954 extern int tree_int_cst_sgn (const_tree
);
4955 extern int tree_int_cst_sign_bit (const_tree
);
4956 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4957 extern tree
excess_precision_type (tree
);
4959 /* Recursively examines the array elements of TYPE, until a non-array
4960 element type is found. */
4963 strip_array_types (tree type
)
4965 while (TREE_CODE (type
) == ARRAY_TYPE
)
4966 type
= TREE_TYPE (type
);
4971 /* Desription of the reason why the argument of valid_constant_size_p
4972 is not a valid size. */
4973 enum cst_size_error
{
4975 cst_size_not_constant
,
4981 extern bool valid_constant_size_p (const_tree
, cst_size_error
* = NULL
);
4982 extern tree
max_object_size ();
4984 /* Return true if T holds a value that can be represented as a poly_int64
4985 without loss of precision. Store the value in *VALUE if so. */
4988 poly_int_tree_p (const_tree t
, poly_int64
*value
)
4990 if (tree_fits_poly_int64_p (t
))
4992 *value
= tree_to_poly_int64 (t
);
4998 /* Return true if T holds a value that can be represented as a poly_uint64
4999 without loss of precision. Store the value in *VALUE if so. */
5002 poly_int_tree_p (const_tree t
, poly_uint64
*value
)
5004 if (tree_fits_poly_uint64_p (t
))
5006 *value
= tree_to_poly_uint64 (t
);
5012 /* From expmed.cc. Since rtl.h is included after tree.h, we can't
5013 put the prototype here. Rtl.h does declare the prototype if
5014 tree.h had been included. */
5016 extern tree
make_tree (tree
, rtx
);
5018 /* Returns true iff CAND and BASE have equivalent language-specific
5021 extern bool check_lang_type (const_tree cand
, const_tree base
);
5023 /* Returns true iff unqualified CAND and BASE are equivalent. */
5025 extern bool check_base_type (const_tree cand
, const_tree base
);
5027 /* Check whether CAND is suitable to be returned from get_qualified_type
5028 (BASE, TYPE_QUALS). */
5030 extern bool check_qualified_type (const_tree
, const_tree
, int);
5032 /* Return a version of the TYPE, qualified as indicated by the
5033 TYPE_QUALS, if one exists. If no qualified version exists yet,
5034 return NULL_TREE. */
5036 extern tree
get_qualified_type (tree
, int);
5038 /* Like get_qualified_type, but creates the type if it does not
5039 exist. This function never returns NULL_TREE. */
5041 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
5043 /* Create a variant of type T with alignment ALIGN. */
5045 extern tree
build_aligned_type (tree
, unsigned int);
5047 /* Like build_qualified_type, but only deals with the `const' and
5048 `volatile' qualifiers. This interface is retained for backwards
5049 compatibility with the various front-ends; new code should use
5050 build_qualified_type instead. */
5052 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
5053 build_qualified_type ((TYPE), \
5054 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
5055 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
5057 /* Make a copy of a type node. */
5059 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
5060 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
5062 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
5063 return a canonicalized ..._TYPE node, so that duplicates are not made.
5064 How the hash code is computed is up to the caller, as long as any two
5065 callers that could hash identical-looking type nodes agree. */
5067 extern hashval_t
type_hash_canon_hash (tree
);
5068 extern tree
type_hash_canon (unsigned int, tree
);
5070 extern tree
convert (tree
, tree
);
5071 extern tree
size_in_bytes_loc (location_t
, const_tree
);
5073 size_in_bytes (const_tree t
)
5075 return size_in_bytes_loc (input_location
, t
);
5078 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
5079 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
5080 extern tree
bit_position (const_tree
);
5081 extern tree
byte_position (const_tree
);
5082 extern HOST_WIDE_INT
int_byte_position (const_tree
);
5084 /* Type for sizes of data-type. */
5086 #define sizetype sizetype_tab[(int) stk_sizetype]
5087 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
5088 #define ssizetype sizetype_tab[(int) stk_ssizetype]
5089 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
5090 #define size_int(L) size_int_kind (L, stk_sizetype)
5091 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
5092 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
5093 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
5095 /* Log2 of BITS_PER_UNIT. */
5097 #if BITS_PER_UNIT == 8
5098 #define LOG2_BITS_PER_UNIT 3
5099 #elif BITS_PER_UNIT == 16
5100 #define LOG2_BITS_PER_UNIT 4
5102 #error Unknown BITS_PER_UNIT
5105 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
5106 by making the last node in X point to Y.
5107 Returns X, except if X is 0 returns Y. */
5109 extern tree
chainon (tree
, tree
);
5111 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
5113 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
5115 /* Return the last tree node in a chain. */
5117 extern tree
tree_last (tree
);
5119 /* Reverse the order of elements in a chain, and return the new head. */
5121 extern tree
nreverse (tree
);
5123 /* Returns the length of a chain of nodes
5124 (number of chain pointers to follow before reaching a null pointer). */
5126 extern int list_length (const_tree
);
5128 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
5130 extern tree
first_field (const_tree
) ATTRIBUTE_NONNULL (1);
5131 extern tree
last_field (const_tree
) ATTRIBUTE_NONNULL (1);
5133 /* Given an initializer INIT, return TRUE if INIT is zero or some
5134 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
5135 null, set *NONZERO if and only if INIT is known not to be all
5136 zeros. The combination of return value of false and *NONZERO
5137 false implies that INIT may but need not be all zeros. Other
5138 combinations indicate definitive answers. */
5140 extern bool initializer_zerop (const_tree
, bool * = NULL
);
5141 extern bool initializer_each_zero_or_onep (const_tree
);
5143 extern tree
vector_cst_elt (const_tree
, unsigned int);
5145 /* Given a vector VEC, return its first element if all elements are
5146 the same. Otherwise return NULL_TREE. */
5148 extern tree
uniform_vector_p (const_tree
);
5150 /* If the argument is INTEGER_CST, return it. If the argument is vector
5151 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
5152 return NULL_TREE. */
5154 extern tree
uniform_integer_cst_p (tree
);
5156 extern int single_nonzero_element (const_tree
);
5158 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
5160 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
5162 /* zerop (tree x) is nonzero if X is a constant of value 0. */
5164 extern bool zerop (const_tree
);
5166 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
5168 extern bool integer_zerop (const_tree
);
5170 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
5172 extern bool integer_onep (const_tree
);
5174 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
5175 a vector or complex where each part is 1. */
5177 extern bool integer_each_onep (const_tree
);
5179 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
5180 all of whose significant bits are 1. */
5182 extern bool integer_all_onesp (const_tree
);
5184 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
5187 extern bool integer_minus_onep (const_tree
);
5189 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
5190 exactly one bit 1. */
5192 extern bool integer_pow2p (const_tree
);
5194 /* Checks to see if T is a constant or a constant vector and if each element E
5195 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
5197 extern tree
bitmask_inv_cst_vector_p (tree
);
5199 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
5200 with a nonzero value. */
5202 extern bool integer_nonzerop (const_tree
);
5204 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
5205 a vector where each element is an integer constant of value -1. */
5207 extern bool integer_truep (const_tree
);
5209 extern bool cst_and_fits_in_hwi (const_tree
);
5210 extern tree
num_ending_zeros (const_tree
);
5212 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
5215 extern bool fixed_zerop (const_tree
);
5217 /* staticp (tree x) is nonzero if X is a reference to data allocated
5218 at a fixed address in memory. Returns the outermost data. */
5220 extern tree
staticp (tree
);
5222 /* save_expr (EXP) returns an expression equivalent to EXP
5223 but it can be used multiple times within context CTX
5224 and only evaluate EXP once. */
5226 extern tree
save_expr (tree
);
5228 /* Return true if T is function-invariant. */
5230 extern bool tree_invariant_p (tree
);
5232 /* Look inside EXPR into any simple arithmetic operations. Return the
5233 outermost non-arithmetic or non-invariant node. */
5235 extern tree
skip_simple_arithmetic (tree
);
5237 /* Look inside EXPR into simple arithmetic operations involving constants.
5238 Return the outermost non-arithmetic or non-constant node. */
5240 extern tree
skip_simple_constant_arithmetic (tree
);
5242 /* Return which tree structure is used by T. */
5244 enum tree_node_structure_enum
tree_node_structure (const_tree
);
5246 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
5247 size or offset that depends on a field within a record. */
5249 extern bool contains_placeholder_p (const_tree
);
5251 /* This macro calls the above function but short-circuits the common
5252 case of a constant to save time. Also check for null. */
5254 #define CONTAINS_PLACEHOLDER_P(EXP) \
5255 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5257 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5258 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5261 extern bool type_contains_placeholder_p (tree
);
5263 /* Given a tree EXP, find all occurrences of references to fields
5264 in a PLACEHOLDER_EXPR and place them in vector REFS without
5265 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5266 we assume here that EXP contains only arithmetic expressions
5267 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5270 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
5272 /* This macro calls the above function but short-circuits the common
5273 case of a constant to save time and also checks for NULL. */
5275 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5277 if((EXP) && !TREE_CONSTANT (EXP)) \
5278 find_placeholder_in_expr (EXP, V); \
5281 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5282 return a tree with all occurrences of references to F in a
5283 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5284 CONST_DECLs. Note that we assume here that EXP contains only
5285 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5286 occurring only in their argument list. */
5288 extern tree
substitute_in_expr (tree
, tree
, tree
);
5290 /* This macro calls the above function but short-circuits the common
5291 case of a constant to save time and also checks for NULL. */
5293 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5294 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5296 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5297 for it within OBJ, a tree that is an object or a chain of references. */
5299 extern tree
substitute_placeholder_in_expr (tree
, tree
);
5301 /* This macro calls the above function but short-circuits the common
5302 case of a constant to save time and also checks for NULL. */
5304 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5305 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5306 : substitute_placeholder_in_expr (EXP, OBJ))
5309 /* stabilize_reference (EXP) returns a reference equivalent to EXP
5310 but it can be used multiple times
5311 and only evaluate the subexpressions once. */
5313 extern tree
stabilize_reference (tree
);
5315 /* Return EXP, stripped of any conversions to wider types
5316 in such a way that the result of converting to type FOR_TYPE
5317 is the same as if EXP were converted to FOR_TYPE.
5318 If FOR_TYPE is 0, it signifies EXP's type. */
5320 extern tree
get_unwidened (tree
, tree
);
5322 /* Return OP or a simpler expression for a narrower value
5323 which can be sign-extended or zero-extended to give back OP.
5324 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5325 or 0 if the value should be sign-extended. */
5327 extern tree
get_narrower (tree
, int *);
5329 /* Return true if T is an expression that get_inner_reference handles. */
5332 handled_component_p (const_tree t
)
5334 switch (TREE_CODE (t
))
5339 case ARRAY_RANGE_REF
:
5342 case VIEW_CONVERT_EXPR
:
5350 /* Return true T is a component with reverse storage order. */
5353 reverse_storage_order_for_component_p (tree t
)
5355 /* The storage order only applies to scalar components. */
5356 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
5357 || POINTER_TYPE_P (TREE_TYPE (t
))
5358 || VECTOR_TYPE_P (TREE_TYPE (t
)))
5361 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
5362 t
= TREE_OPERAND (t
, 0);
5364 switch (TREE_CODE (t
))
5368 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
5369 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5370 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
5371 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
5375 return REF_REVERSE_STORAGE_ORDER (t
);
5377 case ARRAY_RANGE_REF
:
5378 case VIEW_CONVERT_EXPR
:
5384 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5385 that can modify the storage order of objects. Note that, even if the
5386 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5387 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5388 it can change the partition of the aggregate object into scalars. */
5391 storage_order_barrier_p (const_tree t
)
5393 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
5396 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
5397 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
5400 tree op
= TREE_OPERAND (t
, 0);
5402 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
5403 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
5409 /* Given a DECL or TYPE, return the scope in which it was declared, or
5410 NUL_TREE if there is no containing scope. */
5412 extern tree
get_containing_scope (const_tree
);
5414 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5416 extern const_tree
get_ultimate_context (const_tree
);
5418 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5420 extern tree
decl_function_context (const_tree
);
5422 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5423 this _DECL with its context, or zero if none. */
5424 extern tree
decl_type_context (const_tree
);
5426 /* Return true if EXPR is the real constant zero. */
5427 extern bool real_zerop (const_tree
);
5429 /* Initialize the iterator I with arguments from function FNDECL */
5432 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5434 i
->next
= TYPE_ARG_TYPES (fntype
);
5437 /* Return a pointer that holds the next argument if there are more arguments to
5438 handle, otherwise return NULL. */
5441 function_args_iter_cond_ptr (function_args_iterator
*i
)
5443 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5446 /* Return the next argument if there are more arguments to handle, otherwise
5450 function_args_iter_cond (function_args_iterator
*i
)
5452 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5455 /* Advance to the next argument. */
5457 function_args_iter_next (function_args_iterator
*i
)
5459 gcc_assert (i
->next
!= NULL_TREE
);
5460 i
->next
= TREE_CHAIN (i
->next
);
5463 /* Returns true if a BLOCK has a source location.
5464 BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5465 so the function returns true for all but the innermost and outermost
5466 blocks into which an expression has been inlined. */
5469 inlined_function_outer_scope_p (const_tree block
)
5471 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
5474 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5475 to point to the next tree element. ITER is an instance of
5476 function_args_iterator used to iterate the arguments. */
5477 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5478 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5479 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5480 function_args_iter_next (&(ITER)))
5482 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5483 to the next tree element. ITER is an instance of function_args_iterator
5484 used to iterate the arguments. */
5485 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5486 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5487 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5488 function_args_iter_next (&(ITER)))
5491 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5492 extern unsigned crc32_string (unsigned, const char *);
5494 crc32_unsigned (unsigned chksum
, unsigned value
)
5496 return crc32_unsigned_n (chksum
, value
, 4);
5499 crc32_byte (unsigned chksum
, char byte
)
5501 return crc32_unsigned_n (chksum
, byte
, 1);
5503 extern void clean_symbol_name (char *);
5504 extern tree
get_file_function_name (const char *);
5505 extern tree
get_callee_fndecl (const_tree
);
5506 extern combined_fn
get_call_combined_fn (const_tree
);
5507 extern int type_num_arguments (const_tree
);
5508 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
5509 extern bool associative_tree_code (enum tree_code
);
5510 extern bool commutative_tree_code (enum tree_code
);
5511 extern bool commutative_ternary_tree_code (enum tree_code
);
5512 extern bool operation_can_overflow (enum tree_code
);
5513 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
5514 extern tree
upper_bound_in_type (tree
, tree
);
5515 extern tree
lower_bound_in_type (tree
, tree
);
5516 extern bool operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5517 extern tree
create_artificial_label (location_t
);
5518 extern const char *get_name (tree
);
5519 extern bool stdarg_p (const_tree
);
5520 extern bool prototype_p (const_tree
);
5521 extern bool auto_var_p (const_tree
);
5522 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5523 extern tree
build_low_bits_mask (tree
, unsigned);
5524 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
5525 extern tree
tree_strip_nop_conversions (tree
);
5526 extern tree
tree_strip_sign_nop_conversions (tree
);
5527 extern const_tree
strip_invariant_refs (const_tree
);
5528 extern tree
strip_zero_offset_components (tree
);
5529 extern tree
lhd_gcc_personality (void);
5530 extern void assign_assembler_name_if_needed (tree
);
5531 extern bool warn_deprecated_use (tree
, tree
);
5532 extern void error_unavailable_use (tree
, tree
);
5533 extern tree
cache_integer_cst (tree
, bool might_duplicate
= false);
5534 extern const char *combined_fn_name (combined_fn
);
5536 /* Returns true if X is a typedef decl. */
5539 is_typedef_decl (const_tree x
)
5541 return (x
&& TREE_CODE (x
) == TYPE_DECL
5542 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
5545 /* Returns true iff TYPE is a type variant created for a typedef. */
5548 typedef_variant_p (const_tree type
)
5550 return is_typedef_decl (TYPE_NAME (type
));
5553 /* Compare and hash for any structure which begins with a canonical
5554 pointer. Assumes all pointers are interchangeable, which is sort
5555 of already assumed by gcc elsewhere IIRC. */
5558 struct_ptr_eq (const void *a
, const void *b
)
5560 const void * const * x
= (const void * const *) a
;
5561 const void * const * y
= (const void * const *) b
;
5566 struct_ptr_hash (const void *a
)
5568 const void * const * x
= (const void * const *) a
;
5569 return (intptr_t)*x
>> 4;
5572 /* Return nonzero if CODE is a tree code that represents a truth value. */
5574 truth_value_p (enum tree_code code
)
5576 return (TREE_CODE_CLASS (code
) == tcc_comparison
5577 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5578 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5579 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5582 /* Return whether TYPE is a type suitable for an offset for
5583 a POINTER_PLUS_EXPR. */
5585 ptrofftype_p (tree type
)
5587 return (INTEGRAL_TYPE_P (type
)
5588 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5589 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5592 /* Return true if the argument is a complete type or an array
5593 of unknown bound (whose type is incomplete but) whose elements
5594 have complete type. */
5596 complete_or_array_type_p (const_tree type
)
5598 return COMPLETE_TYPE_P (type
)
5599 || (TREE_CODE (type
) == ARRAY_TYPE
5600 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
5603 /* Return true if the value of T could be represented as a poly_widest_int. */
5606 poly_int_tree_p (const_tree t
)
5608 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
5611 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5612 to be a poly_uint64. (This is always true at the gimple level.) */
5615 bit_field_size (const_tree t
)
5617 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
5620 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5621 known to be a poly_uint64. (This is always true at the gimple level.) */
5624 bit_field_offset (const_tree t
)
5626 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
5629 extern tree
strip_float_extensions (tree
);
5630 extern bool really_constant_p (const_tree
);
5631 extern bool ptrdiff_tree_p (const_tree
, poly_int64
*);
5632 extern bool decl_address_invariant_p (const_tree
);
5633 extern bool decl_address_ip_invariant_p (const_tree
);
5634 extern bool int_fits_type_p (const_tree
, const_tree
)
5635 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
5636 #ifndef GENERATOR_FILE
5637 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5639 extern bool variably_modified_type_p (tree
, tree
);
5640 extern int tree_log2 (const_tree
);
5641 extern int tree_floor_log2 (const_tree
);
5642 extern unsigned int tree_ctz (const_tree
);
5643 extern int simple_cst_equal (const_tree
, const_tree
);
5648 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
5652 /* Compat version until all callers are converted. Return hash for
5654 inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
5656 inchash::hash
hstate (seed
);
5657 inchash::add_expr (tree
, hstate
);
5658 return hstate
.end ();
5661 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5662 extern bool type_list_equal (const_tree
, const_tree
);
5663 extern bool chain_member (const_tree
, const_tree
);
5664 extern void dump_tree_statistics (void);
5665 extern void recompute_tree_invariant_for_addr_expr (tree
);
5666 extern bool needs_to_live_in_memory (const_tree
);
5667 extern tree
reconstruct_complex_type (tree
, tree
);
5668 extern bool real_onep (const_tree
);
5669 extern bool real_minus_onep (const_tree
);
5670 extern bool real_maybe_zerop (const_tree
);
5671 extern void init_ttree (void);
5672 extern void build_common_tree_nodes (bool);
5673 extern void build_common_builtin_nodes (void);
5674 extern void tree_cc_finalize (void);
5675 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5676 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
5677 extern tree
build_bitint_type (unsigned HOST_WIDE_INT
, int);
5678 extern tree
build_range_type (tree
, tree
, tree
);
5679 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5680 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5681 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5682 extern tree
tree_block (tree
);
5683 extern void tree_set_block (tree
, tree
);
5684 extern location_t
*block_nonartificial_location (tree
);
5685 extern location_t
tree_nonartificial_location (tree
);
5686 extern location_t
tree_inlined_location (tree
, bool = true);
5687 extern tree
block_ultimate_origin (const_tree
);
5688 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5689 extern bool virtual_method_call_p (const_tree
, bool = false);
5690 extern tree
obj_type_ref_class (const_tree ref
, bool = false);
5691 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5692 extern bool contains_bitfld_component_ref_p (const_tree
);
5693 extern bool block_may_fallthru (const_tree
);
5694 extern void using_eh_for_cleanups (void);
5695 extern bool using_eh_for_cleanups_p (void);
5696 extern const char *get_tree_code_name (enum tree_code
);
5697 extern void set_call_expr_flags (tree
, int);
5698 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5700 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5702 #define walk_tree(a,b,c,d) \
5703 walk_tree_1 (a, b, c, d, NULL)
5704 #define walk_tree_without_duplicates(a,b,c) \
5705 walk_tree_without_duplicates_1 (a, b, c, NULL)
5707 extern tree
drop_tree_overflow (tree
);
5709 /* Given a memory reference expression T, return its base address.
5710 The base address of a memory reference expression is the main
5711 object being referenced. */
5712 extern tree
get_base_address (tree t
);
5714 /* Return a tree of sizetype representing the size, in bytes, of the element
5715 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5716 extern tree
array_ref_element_size (tree
);
5718 /* Return a typenode for the "standard" C type with a given name. */
5719 extern tree
get_typenode_from_name (const char *);
5721 /* Return a tree representing the upper bound of the array mentioned in
5722 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5723 extern tree
array_ref_up_bound (tree
);
5725 /* Return a tree representing the lower bound of the array mentioned in
5726 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5727 extern tree
array_ref_low_bound (tree
);
5729 /* Returns true if REF is an array reference, a component reference,
5730 or a memory reference to an array whose actual size might be larger
5731 than its upper bound implies. */
5732 extern bool array_ref_flexible_size_p (tree
, bool * = NULL
);
5734 /* Return a tree representing the offset, in bytes, of the field referenced
5735 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5736 extern tree
component_ref_field_offset (tree
);
5738 /* Describes a "special" array member for a COMPONENT_REF. */
5739 enum struct special_array_member
5741 none
, /* Not a special array member. */
5742 int_0
, /* Interior array member with zero elements. */
5743 trail_0
, /* Trailing array member with zero elements. */
5744 trail_1
, /* Trailing array member with one element. */
5745 trail_n
, /* Trailing array member with two or more elements. */
5746 int_n
/* Interior array member with one or more elements. */
5749 /* Determines the special array member type for a COMPONENT_REF. */
5750 extern special_array_member
component_ref_sam_type (tree
);
5752 /* Return the size of the member referenced by the COMPONENT_REF, using
5753 its initializer expression if necessary in order to determine the size
5754 of an initialized flexible array member. The size might be zero for
5755 an object with an uninitialized flexible array member or null if it
5756 cannot be determined. */
5757 extern tree
component_ref_size (tree
, special_array_member
* = NULL
);
5759 extern int tree_map_base_eq (const void *, const void *);
5760 extern unsigned int tree_map_base_hash (const void *);
5761 extern bool tree_map_base_marked_p (const void *);
5762 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5763 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5764 bool trust_type_canonical
= true);
5765 extern bool type_with_interoperable_signedness (const_tree
);
5766 extern bitmap
get_nonnull_args (const_tree
);
5767 extern int get_range_pos_neg (tree
);
5769 /* Return true for a valid pair of new and delete operators. */
5770 extern bool valid_new_delete_pair_p (tree
, tree
, bool * = NULL
);
5772 /* Return simplified tree code of type that is used for canonical type
5774 inline enum tree_code
5775 tree_code_for_canonical_type_merging (enum tree_code code
)
5777 /* By C standard, each enumerated type shall be compatible with char,
5778 a signed integer, or an unsigned integer. The choice of type is
5779 implementation defined (in our case it depends on -fshort-enum).
5781 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5782 type and compare only by their signedness and precision. */
5783 if (code
== ENUMERAL_TYPE
)
5784 return INTEGER_TYPE
;
5785 /* To allow inter-operability between languages having references and
5786 C, we consider reference types and pointers alike. Note that this is
5787 not strictly necessary for C-Fortran 2008 interoperability because
5788 Fortran define C_PTR type that needs to be compatible with C pointers
5789 and we handle this one as ptr_type_node. */
5790 if (code
== REFERENCE_TYPE
)
5791 return POINTER_TYPE
;
5795 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5796 We don't define the types for pointers, arrays and vectors. The reason is
5797 that pointers are handled specially: ptr_type_node accesses conflict with
5798 accesses to all other pointers. This is done by alias.cc.
5799 Because alias sets of arrays and vectors are the same as types of their
5800 elements, we can't compute canonical type either. Otherwise we could go
5801 form void *[10] to int *[10] (because they are equivalent for canonical type
5802 machinery) and get wrong TBAA. */
5805 canonical_type_used_p (const_tree t
)
5807 return !(POINTER_TYPE_P (t
)
5808 || TREE_CODE (t
) == ARRAY_TYPE
5809 || TREE_CODE (t
) == VECTOR_TYPE
);
5812 /* Kinds of access to pass-by-reference arguments to functions. */
5816 access_read_only
= 1,
5817 access_write_only
= 2,
5818 access_read_write
= access_read_only
| access_write_only
,
5822 #define tree_map_eq tree_map_base_eq
5823 extern unsigned int tree_map_hash (const void *);
5824 #define tree_map_marked_p tree_map_base_marked_p
5826 #define tree_decl_map_eq tree_map_base_eq
5827 extern unsigned int tree_decl_map_hash (const void *);
5828 #define tree_decl_map_marked_p tree_map_base_marked_p
5830 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5832 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5834 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5836 return tree_decl_map_eq (a
, b
);
5840 keep_cache_entry (tree_decl_map
*&m
)
5842 return ggc_marked_p (m
->base
.from
);
5846 #define tree_int_map_eq tree_map_base_eq
5847 #define tree_int_map_hash tree_map_base_hash
5848 #define tree_int_map_marked_p tree_map_base_marked_p
5850 #define tree_vec_map_eq tree_map_base_eq
5851 #define tree_vec_map_hash tree_decl_map_hash
5852 #define tree_vec_map_marked_p tree_map_base_marked_p
5854 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
5856 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
5859 equal (tree_vec_map
*a
, tree_vec_map
*b
)
5861 return a
->base
.from
== b
->base
.from
;
5865 keep_cache_entry (tree_vec_map
*&m
)
5867 return ggc_marked_p (m
->base
.from
);
5871 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5872 is a better hash than the pointer value and gives a predictable traversal
5873 order. Additionally it can be used across PCH save/restore. */
5874 struct tree_decl_hash
: ggc_ptr_hash
<tree_node
>
5876 static inline hashval_t
hash (tree
);
5880 tree_decl_hash::hash (tree t
)
5882 return DECL_UID (t
);
5885 /* Similarly for types. Uses TYPE_UID as hash function. */
5886 struct tree_type_hash
: ggc_ptr_hash
<tree_node
>
5888 static inline hashval_t
hash (tree
);
5892 tree_type_hash::hash (tree t
)
5894 return TYPE_UID (t
);
5897 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5898 here, but the SSA_NAME_VERSION is a better hash than the pointer
5899 value and gives a predictable traversal order. */
5900 struct tree_ssa_name_hash
: ggc_ptr_hash
<tree_node
>
5902 static inline hashval_t
hash (tree
);
5906 tree_ssa_name_hash::hash (tree t
)
5908 return SSA_NAME_VERSION (t
);
5911 /* Hasher for general trees, based on their TREE_HASH. */
5912 struct tree_hash
: ggc_ptr_hash
<tree_node
>
5914 static hashval_t
hash (tree
);
5918 tree_hash::hash (tree t
)
5920 return TREE_HASH (t
);
5923 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5924 such a map will not mark keys, and will mark values if the key is already
5926 struct tree_cache_traits
5927 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5928 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5930 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5931 This is for hash_maps from decls to trees that need to work across PCH. */
5932 struct decl_tree_cache_traits
5933 : simple_cache_map_traits
<tree_decl_hash
, tree
> { };
5934 typedef hash_map
<tree
,tree
,decl_tree_cache_traits
> decl_tree_cache_map
;
5936 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5937 This is for hash_maps from types to trees that need to work across PCH. */
5938 struct type_tree_cache_traits
5939 : simple_cache_map_traits
<tree_type_hash
, tree
> { };
5940 typedef hash_map
<tree
,tree
,type_tree_cache_traits
> type_tree_cache_map
;
5942 /* Similarly to decl_tree_cache_map, but without caching. */
5943 struct decl_tree_traits
5944 : simple_hashmap_traits
<tree_decl_hash
, tree
> { };
5945 typedef hash_map
<tree
,tree
,decl_tree_traits
> decl_tree_map
;
5947 /* Initialize the abstract argument list iterator object ITER with the
5948 arguments from CALL_EXPR node EXP. */
5950 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5953 iter
->n
= call_expr_nargs (exp
);
5958 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5961 iter
->n
= call_expr_nargs (exp
);
5965 /* Return the next argument from abstract argument list iterator object ITER,
5966 and advance its state. Return NULL_TREE if there are no more arguments. */
5968 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5971 if (iter
->i
>= iter
->n
)
5973 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5979 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5982 if (iter
->i
>= iter
->n
)
5984 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5989 /* Initialize the abstract argument list iterator object ITER, then advance
5990 past and return the first argument. Useful in for expressions, e.g.
5991 for (arg = first_call_expr_arg (exp, &iter); arg;
5992 arg = next_call_expr_arg (&iter)) */
5994 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5996 init_call_expr_arg_iterator (exp
, iter
);
5997 return next_call_expr_arg (iter
);
6001 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
6003 init_const_call_expr_arg_iterator (exp
, iter
);
6004 return next_const_call_expr_arg (iter
);
6007 /* Test whether there are more arguments in abstract argument list iterator
6008 ITER, without changing its state. */
6010 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
6012 return (iter
->i
< iter
->n
);
6015 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6016 (of type call_expr_arg_iterator) to hold the iteration state. */
6017 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6018 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6019 (arg) = next_call_expr_arg (&(iter)))
6021 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6022 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6023 (arg) = next_const_call_expr_arg (&(iter)))
6025 /* Return true if tree node T is a language-specific node. */
6027 is_lang_specific (const_tree t
)
6029 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
6032 /* Valid builtin number. */
6033 #define BUILTIN_VALID_P(FNCODE) \
6034 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6036 /* Obtain a pointer to the identifier string holding the asm name for
6037 BUILTIN, a BUILT_IN code. This is handy if the target
6038 mangles/overrides the function name that implements the
6040 #define BUILTIN_ASM_NAME_PTR(BUILTIN) \
6041 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
6043 /* Return the tree node for an explicit standard builtin function or NULL. */
6045 builtin_decl_explicit (enum built_in_function fncode
)
6047 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6049 return builtin_info
[(size_t)fncode
].decl
;
6052 /* Return the tree node for an implicit builtin function or NULL. */
6054 builtin_decl_implicit (enum built_in_function fncode
)
6056 size_t uns_fncode
= (size_t)fncode
;
6057 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6059 if (!builtin_info
[uns_fncode
].implicit_p
)
6062 return builtin_info
[uns_fncode
].decl
;
6065 /* For BUILTIN_UNREACHABLE, use one of these or
6066 gimple_build_builtin_unreachable instead of one of the above. */
6067 extern tree
builtin_decl_unreachable ();
6068 extern tree
build_builtin_unreachable (location_t
);
6070 /* Set explicit builtin function nodes and whether it is an implicit
6074 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
6076 size_t ufncode
= (size_t)fncode
;
6078 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6079 && (decl
!= NULL_TREE
|| !implicit_p
));
6081 builtin_info
[ufncode
].decl
= decl
;
6082 builtin_info
[ufncode
].implicit_p
= implicit_p
;
6083 builtin_info
[ufncode
].declared_p
= false;
6086 /* Set the implicit flag for a builtin function. */
6089 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
6091 size_t uns_fncode
= (size_t)fncode
;
6093 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6094 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
6096 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
6099 /* Set the declared flag for a builtin function. */
6102 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
6104 size_t uns_fncode
= (size_t)fncode
;
6106 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6107 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
6109 builtin_info
[uns_fncode
].declared_p
= declared_p
;
6112 /* Return whether the standard builtin function can be used as an explicit
6116 builtin_decl_explicit_p (enum built_in_function fncode
)
6118 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6119 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
6122 /* Return whether the standard builtin function can be used implicitly. */
6125 builtin_decl_implicit_p (enum built_in_function fncode
)
6127 size_t uns_fncode
= (size_t)fncode
;
6129 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6130 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
6131 && builtin_info
[uns_fncode
].implicit_p
);
6134 /* Return whether the standard builtin function was declared. */
6137 builtin_decl_declared_p (enum built_in_function fncode
)
6139 size_t uns_fncode
= (size_t)fncode
;
6141 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6142 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
6143 && builtin_info
[uns_fncode
].declared_p
);
6146 /* Determine if the function identified by FNDECL is one that
6147 makes sense to match by name, for those places where we detect
6148 "magic" functions by name.
6150 Return true if FNDECL has a name and is an extern fndecl at file scope.
6151 FNDECL must be a non-NULL decl.
6153 Avoid using this, as it's generally better to use attributes rather
6154 than to check for functions by name. */
6157 maybe_special_function_p (const_tree fndecl
)
6159 tree name_decl
= DECL_NAME (fndecl
);
6161 /* Exclude functions not at the file scope, or not `extern',
6162 since they are not the magic functions we would otherwise
6164 && (DECL_CONTEXT (fndecl
) == NULL_TREE
6165 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
6166 && TREE_PUBLIC (fndecl
))
6171 /* Return true if T (assumed to be a DECL) is a global variable.
6172 A variable is considered global if its storage is not automatic. */
6175 is_global_var (const_tree t
)
6177 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
6180 /* Return true if VAR may be aliased. A variable is considered as
6181 maybe aliased if it has its address taken by the local TU
6182 or possibly by another TU and might be modified through a pointer. */
6185 may_be_aliased (const_tree var
)
6187 return (TREE_CODE (var
) != CONST_DECL
6188 && (TREE_PUBLIC (var
)
6189 || DECL_EXTERNAL (var
)
6190 || TREE_ADDRESSABLE (var
))
6191 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
6192 && (TREE_READONLY (var
)
6193 || (TREE_CODE (var
) == VAR_DECL
6194 && DECL_NONALIASED (var
)))));
6197 /* Return pointer to optimization flags of FNDECL. */
6198 inline struct cl_optimization
*
6199 opts_for_fn (const_tree fndecl
)
6201 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
6202 if (fn_opts
== NULL_TREE
)
6203 fn_opts
= optimization_default_node
;
6204 return TREE_OPTIMIZATION (fn_opts
);
6207 /* Return pointer to target flags of FNDECL. */
6208 inline cl_target_option
*
6209 target_opts_for_fn (const_tree fndecl
)
6211 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
6212 if (fn_opts
== NULL_TREE
)
6213 fn_opts
= target_option_default_node
;
6214 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
6217 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
6218 the optimization level of function fndecl. */
6219 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
6221 /* For anonymous aggregate types, we need some sort of name to
6222 hold on to. In practice, this should not appear, but it should
6223 not be harmful if it does. Identifiers returned will be
6224 IDENTIFIER_ANON_P. */
6225 extern tree
make_anon_name ();
6227 /* The tree and const_tree overload templates. */
6230 class unextended_tree
6236 unextended_tree () {}
6237 unextended_tree (const_tree t
) : m_t (t
) {}
6239 unsigned int get_precision () const;
6240 const HOST_WIDE_INT
*get_val () const;
6241 unsigned int get_len () const;
6242 const_tree
get_tree () const { return m_t
; }
6246 struct int_traits
<unextended_tree
>
6248 static const enum precision_type precision_type
= VAR_PRECISION
;
6249 static const bool host_dependent_precision
= false;
6250 static const bool is_sign_extended
= false;
6251 static const bool needs_write_val_arg
= false;
6262 extended_tree (const_tree
);
6264 unsigned int get_precision () const;
6265 const HOST_WIDE_INT
*get_val () const;
6266 unsigned int get_len () const;
6267 const_tree
get_tree () const { return m_t
; }
6271 struct int_traits
<extended_tree
<N
> >
6273 static const enum precision_type precision_type
6274 = N
== ADDR_MAX_PRECISION
? INL_CONST_PRECISION
: CONST_PRECISION
;
6275 static const bool host_dependent_precision
= false;
6276 static const bool is_sign_extended
= true;
6277 static const bool needs_write_val_arg
= false;
6278 static const unsigned int precision
= N
;
6281 typedef extended_tree
<WIDEST_INT_MAX_PRECISION
> widest_extended_tree
;
6282 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
6284 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
6285 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
6286 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
6289 tree_to_widest_ref
to_widest (const_tree
);
6290 tree_to_offset_ref
to_offset (const_tree
);
6291 tree_to_wide_ref
to_wide (const_tree
);
6292 wide_int
to_wide (const_tree
, unsigned int);
6294 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6295 generic_wide_int
<widest_extended_tree
> >
6296 tree_to_poly_widest_ref
;
6297 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6298 generic_wide_int
<offset_extended_tree
> >
6299 tree_to_poly_offset_ref
;
6300 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
6301 generic_wide_int
<unextended_tree
> >
6302 tree_to_poly_wide_ref
;
6304 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
6305 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
6306 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
6309 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, INL_CONST_PRECISION
>
6311 typedef generic_wide_int
<extended_tree
<N
> > extended
;
6312 static extended
zero (const extended
&);
6316 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
6318 typedef generic_wide_int
<extended_tree
<N
> > extended
;
6319 static extended
zero (const extended
&);
6323 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
6325 typedef generic_wide_int
<unextended_tree
> unextended
;
6326 static unextended
zero (const unextended
&);
6330 /* Used to convert a tree to a widest2_int like this:
6331 widest2_int foo = widest2_int_cst (some_tree). */
6332 typedef generic_wide_int
<wi::extended_tree
<WIDEST_INT_MAX_PRECISION
* 2> >
6335 /* Refer to INTEGER_CST T as though it were a widest_int.
6337 This function gives T's actual numerical value, influenced by the
6338 signedness of its type. For example, a signed byte with just the
6339 top bit set would be -128 while an unsigned byte with the same
6340 bit pattern would be 128.
6342 This is the right choice when operating on groups of INTEGER_CSTs
6343 that might have different signedness or precision. It is also the
6344 right choice in code that specifically needs an approximation of
6345 infinite-precision arithmetic instead of normal modulo arithmetic.
6347 The approximation of infinite precision is good enough for realistic
6348 numbers of additions and subtractions of INTEGER_CSTs (where
6349 "realistic" includes any number less than 1 << 31) but it cannot
6350 represent the result of multiplying the two largest supported
6351 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
6352 of multiplying two arbitrary INTEGER_CSTs and checking that the
6353 result is representable as a widest_int.
6355 Note that any overflow checking done on these values is relative to
6356 the range of widest_int rather than the range of a TREE_TYPE.
6358 Calling this function should have no overhead in release builds,
6359 so it is OK to call it several times for the same tree. If it is
6360 useful for readability reasons to reduce the number of calls,
6361 it is more efficient to use:
6363 wi::tree_to_widest_ref wt = wi::to_widest (t);
6367 widest_int wt = wi::to_widest (t). */
6369 inline wi::tree_to_widest_ref
6370 wi::to_widest (const_tree t
)
6375 /* Refer to INTEGER_CST T as though it were an offset_int.
6377 This function is an optimisation of wi::to_widest for cases
6378 in which T is known to be a bit or byte count in the range
6379 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
6380 the target's address size in bits.
6382 This is the right choice when operating on bit or byte counts as
6383 untyped numbers rather than M-bit values. The wi::to_widest comments
6384 about addition, subtraction and multiplication apply here: sequences
6385 of 1 << 31 additions and subtractions do not induce overflow, but
6386 multiplying the largest sizes might. Again,
6388 wi::tree_to_offset_ref wt = wi::to_offset (t);
6390 is more efficient than:
6392 offset_int wt = wi::to_offset (t). */
6394 inline wi::tree_to_offset_ref
6395 wi::to_offset (const_tree t
)
6400 /* Refer to INTEGER_CST T as though it were a wide_int.
6402 In contrast to the approximation of infinite-precision numbers given
6403 by wi::to_widest and wi::to_offset, this function treats T as a
6404 signless collection of N bits, where N is the precision of T's type.
6405 As with machine registers, signedness is determined by the operation
6406 rather than the operands; for example, there is a distinction between
6407 signed and unsigned division.
6409 This is the right choice when operating on values with the same type
6410 using normal modulo arithmetic. The overflow-checking forms of things
6411 like wi::add check whether the result can be represented in T's type.
6413 Calling this function should have no overhead in release builds,
6414 so it is OK to call it several times for the same tree. If it is
6415 useful for readability reasons to reduce the number of calls,
6416 it is more efficient to use:
6418 wi::tree_to_wide_ref wt = wi::to_wide (t);
6422 wide_int wt = wi::to_wide (t). */
6424 inline wi::tree_to_wide_ref
6425 wi::to_wide (const_tree t
)
6427 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
6428 TYPE_PRECISION (TREE_TYPE (t
)));
6431 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6432 truncating as necessary. When extending, use sign extension if T's
6433 type is signed and zero extension if T's type is unsigned. */
6436 wi::to_wide (const_tree t
, unsigned int prec
)
6438 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
6442 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
6445 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
6450 wi::extended_tree
<N
>::get_precision () const
6456 inline const HOST_WIDE_INT
*
6457 wi::extended_tree
<N
>::get_val () const
6459 return &TREE_INT_CST_ELT (m_t
, 0);
6464 wi::extended_tree
<N
>::get_len () const
6466 if (N
== ADDR_MAX_PRECISION
)
6468 /* to_offset can only be applied to trees that are offset_int-sized
6469 or smaller. EXT_LEN is correct if it fits, otherwise the constant
6470 must be exactly the precision of offset_int and so LEN is correct. */
6471 unsigned int ext_len
= TREE_INT_CST_EXT_NUNITS (m_t
);
6472 if (ext_len
<= OFFSET_INT_ELTS
)
6474 return TREE_INT_CST_NUNITS (m_t
);
6476 else if (N
>= WIDEST_INT_MAX_PRECISION
)
6477 return TREE_INT_CST_EXT_NUNITS (m_t
);
6479 /* This class is designed to be used for specific output precisions
6480 and needs to be as fast as possible, so there is no fallback for
6486 wi::unextended_tree::get_precision () const
6488 return TYPE_PRECISION (TREE_TYPE (m_t
));
6491 inline const HOST_WIDE_INT
*
6492 wi::unextended_tree::get_val () const
6494 return &TREE_INT_CST_ELT (m_t
, 0);
6498 wi::unextended_tree::get_len () const
6500 return TREE_INT_CST_NUNITS (m_t
);
6503 /* Return the value of a POLY_INT_CST in its native precision. */
6505 inline wi::tree_to_poly_wide_ref
6506 poly_int_cst_value (const_tree x
)
6508 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
6509 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6510 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
6514 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6515 poly_widest_int. See wi::to_widest for more details. */
6517 inline wi::tree_to_poly_widest_ref
6518 wi::to_poly_widest (const_tree t
)
6520 if (POLY_INT_CST_P (t
))
6522 poly_int
<NUM_POLY_INT_COEFFS
,
6523 generic_wide_int
<widest_extended_tree
> > res
;
6524 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6525 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6531 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6532 poly_offset_int. See wi::to_offset for more details. */
6534 inline wi::tree_to_poly_offset_ref
6535 wi::to_poly_offset (const_tree t
)
6537 if (POLY_INT_CST_P (t
))
6539 poly_int
<NUM_POLY_INT_COEFFS
,
6540 generic_wide_int
<offset_extended_tree
> > res
;
6541 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6542 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
6548 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6549 poly_wide_int. See wi::to_wide for more details. */
6551 inline wi::tree_to_poly_wide_ref
6552 wi::to_poly_wide (const_tree t
)
6554 if (POLY_INT_CST_P (t
))
6555 return poly_int_cst_value (t
);
6560 inline generic_wide_int
<wi::extended_tree
<N
> >
6561 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
6562 wi::INL_CONST_PRECISION
>::zero (const extended
&x
)
6564 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6568 inline generic_wide_int
<wi::extended_tree
<N
> >
6569 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
6570 wi::CONST_PRECISION
>::zero (const extended
&x
)
6572 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6575 inline generic_wide_int
<wi::unextended_tree
>
6576 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
6577 wi::VAR_PRECISION
>::zero (const unextended
&x
)
6579 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
6584 template <typename T
>
6585 bool fits_to_boolean_p (const T
&x
, const_tree
);
6587 template <typename T
>
6588 bool fits_to_tree_p (const T
&x
, const_tree
);
6590 wide_int
min_value (const_tree
);
6591 wide_int
max_value (const_tree
);
6592 #ifndef GENERATOR_FILE
6593 wide_int
from_mpz (const_tree
, mpz_t
, bool);
6597 template <typename T
>
6599 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
6601 typedef typename poly_int_traits
<T
>::int_type int_type
;
6602 return (known_eq (x
, int_type (0))
6603 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
6606 template <typename T
>
6608 wi::fits_to_tree_p (const T
&x
, const_tree type
)
6610 /* Non-standard boolean types can have arbitrary precision but various
6611 transformations assume that they can only take values 0 and +/-1. */
6612 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
6613 return fits_to_boolean_p (x
, type
);
6615 if (TYPE_UNSIGNED (type
))
6616 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
6618 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
6621 /* Produce the smallest number that is represented in TYPE. The precision
6622 and sign are taken from TYPE. */
6624 wi::min_value (const_tree type
)
6626 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6629 /* Produce the largest number that is represented in TYPE. The precision
6630 and sign are taken from TYPE. */
6632 wi::max_value (const_tree type
)
6634 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
6637 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6638 extending both according to their respective TYPE_SIGNs. */
6641 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6643 return wi::to_widest (t1
) < wi::to_widest (t2
);
6646 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6647 extending both according to their respective TYPE_SIGNs. */
6650 tree_int_cst_le (const_tree t1
, const_tree t2
)
6652 return wi::to_widest (t1
) <= wi::to_widest (t2
);
6655 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6656 are both INTEGER_CSTs and their values are extended according to their
6657 respective TYPE_SIGNs. */
6660 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6662 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
6665 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6666 but none of these files are allowed to be included from front ends.
6667 They should be split in two. One suitable for the FEs, the other suitable
6670 /* Assign the RTX to declaration. */
6671 extern void set_decl_rtl (tree
, rtx
);
6672 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
6674 /* Given an expression EXP that is a handled_component_p,
6675 look for the ultimate containing object, which is returned and specify
6676 the access position and size. */
6677 extern tree
get_inner_reference (tree
, poly_int64
*, poly_int64
*,
6678 tree
*, machine_mode
*, int *, int *, int *);
6680 extern tree
build_personality_function (const char *);
6682 struct GTY(()) int_n_trees_t
{
6683 /* These parts are initialized at runtime */
6688 /* This is also in machmode.h */
6689 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
6690 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
6692 /* Like bit_position, but return as an integer. It must be representable in
6693 that way (since it could be a signed value, we don't have the
6694 option of returning -1 like int_size_in_byte can. */
6696 inline HOST_WIDE_INT
6697 int_bit_position (const_tree field
)
6699 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
6700 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
6703 /* Return true if it makes sense to consider alias set for a type T. */
6706 type_with_alias_set_p (const_tree t
)
6708 /* Function and method types are never accessed as memory locations. */
6709 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
6712 if (COMPLETE_TYPE_P (t
))
6715 /* Incomplete types cannot be accessed in general except for arrays
6716 where we can fetch its element despite we have no array bounds. */
6717 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
6723 extern location_t
set_block (location_t loc
, tree block
);
6725 extern void gt_ggc_mx (tree
&);
6726 extern void gt_pch_nx (tree
&);
6727 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
6729 extern bool nonnull_arg_p (const_tree
);
6730 extern bool is_empty_type (const_tree
);
6731 extern bool default_is_empty_record (const_tree
);
6732 extern bool flexible_array_type_p (const_tree
);
6733 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
6734 extern tree
arg_size_in_bytes (const_tree
);
6735 extern bool expr_type_first_operand_type_p (tree_code
);
6738 set_source_range (tree expr
, location_t start
, location_t finish
);
6741 set_source_range (tree expr
, source_range src_range
);
6743 /* Return true if it makes sense to promote/demote from_type to to_type. */
6745 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
6747 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
6749 /* OK to promote if to_type is no bigger than word_mode. */
6750 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
6753 /* Otherwise, allow only if narrowing or same precision conversions. */
6754 return to_type_precision
<= TYPE_PRECISION (from_type
);
6757 /* Pointer type used to declare builtins before we have seen its real
6759 class builtin_structptr_type
6766 extern const builtin_structptr_type builtin_structptr_types
[6];
6768 /* Return true if type T has the same precision as its underlying mode. */
6771 type_has_mode_precision_p (const_tree t
)
6773 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
6776 /* Helper functions for fndecl_built_in_p. */
6779 built_in_function_equal_p (built_in_function name0
, built_in_function name1
)
6781 return name0
== name1
;
6784 /* Recursive case for two or more names. */
6786 template <typename
... F
>
6788 built_in_function_equal_p (built_in_function name0
, built_in_function name1
,
6789 built_in_function name2
, F
... names
)
6791 return name0
== name1
|| built_in_function_equal_p (name0
, name2
, names
...);
6794 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6796 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6797 accessor, as this is impervious to user declaration. */
6800 fndecl_built_in_p (const_tree node
)
6802 return DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
;
6805 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6809 fndecl_built_in_p (const_tree node
, built_in_class klass
)
6811 return fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
;
6814 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6815 of class KLASS with name equal to NAME. */
6818 fndecl_built_in_p (const_tree node
, unsigned int name
, built_in_class klass
)
6820 return (fndecl_built_in_p (node
, klass
)
6821 && DECL_UNCHECKED_FUNCTION_CODE (node
) == name
);
6824 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6825 of BUILT_IN_NORMAL class with name equal to NAME1 (or other mentioned
6828 template <typename
... F
>
6830 fndecl_built_in_p (const_tree node
, built_in_function name1
, F
... names
)
6832 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
6833 && built_in_function_equal_p (DECL_FUNCTION_CODE (node
),
6837 /* A struct for encapsulating location information about an operator
6838 and the operation built from it.
6840 m_operator_loc is the location of the operator
6841 m_combined_loc is the location of the compound expression.
6843 For example, given "a && b" the, operator location is:
6846 and the combined location is:
6849 Capturing this information allows for class binary_op_rich_location
6850 to provide detailed information about e.g. type mismatches in binary
6851 operations where enough location information is available:
6859 falling back to just showing the combined location:
6869 location_t m_operator_loc
;
6870 location_t m_combined_loc
;
6872 /* 1-argument ctor, for constructing from a combined location. */
6873 op_location_t (location_t combined_loc
)
6874 : m_operator_loc (UNKNOWN_LOCATION
), m_combined_loc (combined_loc
)
6877 /* 2-argument ctor, for distinguishing between the operator's location
6878 and the combined location. */
6879 op_location_t (location_t operator_loc
, location_t combined_loc
)
6880 : m_operator_loc (operator_loc
), m_combined_loc (combined_loc
)
6883 /* Implicitly convert back to a location_t, using the combined location. */
6884 operator location_t () const { return m_combined_loc
; }
6887 /* Code that doesn't refer to any warning. Has no effect on suppression
6889 constexpr opt_code no_warning
= opt_code ();
6890 /* Wildcard code that refers to all warnings. */
6891 constexpr opt_code all_warnings
= N_OPTS
;
6893 /* Return the disposition for a warning (or all warnings by default)
6895 extern bool warning_suppressed_at (location_t
, opt_code
= all_warnings
);
6896 /* Set the disposition for a warning (or all warnings by default)
6897 at a location to disabled by default. */
6898 extern bool suppress_warning_at (location_t
, opt_code
= all_warnings
,
6900 /* Copy warning disposition from one location to another. */
6901 extern void copy_warning (location_t
, location_t
);
6903 /* Return the disposition for a warning (or all warnings by default)
6904 for an expression. */
6905 extern bool warning_suppressed_p (const_tree
, opt_code
= all_warnings
);
6906 /* Set the disposition for a warning (or all warnings by default)
6907 at a location to disabled by default. */
6908 extern void suppress_warning (tree
, opt_code
= all_warnings
, bool = true)
6909 ATTRIBUTE_NONNULL (1);
6910 /* Copy warning disposition from one expression to another. */
6911 extern void copy_warning (tree
, const_tree
);
6913 /* Return the zero-based number corresponding to the argument being
6914 deallocated if FNDECL is a deallocation function or an out-of-bounds
6915 value if it isn't. */
6916 extern unsigned fndecl_dealloc_argno (tree
);
6918 /* If an expression refers to a character array or pointer declared
6919 attribute nonstring, return a decl for that array or pointer and
6920 if nonnull, set the second argument to the referenced enclosing
6921 object or pointer. Otherwise return null. */
6922 extern tree
get_attr_nonstring_decl (tree
, tree
* = NULL
);
6924 extern int get_target_clone_attr_len (tree
);
6926 #endif /* GCC_TREE_H */