C99 testsuite readiness: Compile more tests with -std=gnu89
[official-gcc.git] / gcc / tree.h
blob781297c7e770fef5d7d5be4c453e23af980e8f64
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
9 version.
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
14 for more details.
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/>. */
20 #ifndef GCC_TREE_H
21 #define GCC_TREE_H
23 #include "tree-core.h"
24 #include "options.h"
26 /* Convert a target-independent built-in function code to a combined_fn. */
28 inline 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. */
36 inline 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. */
44 inline bool
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. */
62 inline bool
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). */
71 inline internal_fn
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. */
80 class code_helper
82 public:
83 code_helper () {}
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; }
103 private:
104 int 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. */
111 inline tree_code
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. */
121 inline combined_fn
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));
136 inline bool
137 code_helper::is_internal_fn () const
139 return is_fn_code () && internal_fn_p (combined_fn (*this));
142 inline bool
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) \
153 (MARK_TS_BASE (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)]
204 #else
205 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
206 #endif
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
291 expression. */
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)]
303 #else
304 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
305 #endif
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
425 of the scope.
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,
454 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 *,
461 int, const char *)
462 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
463 extern void tree_vec_elt_check_failed (int, int, const char *,
464 int, const char *)
465 ATTRIBUTE_NORETURN ATTRIBUTE_COLD;
466 extern void phi_node_elt_check_failed (int, int, const char *,
467 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 *,
476 int, 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)
514 #endif
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
545 are made. */
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 \
562 case NOP_EXPR: \
563 case CONVERT_EXPR
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
611 order. */
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
779 of its scope. */
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
802 emitted. */
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 (C2x
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
869 pack. */
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
883 computed gotos. */
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 \
960 || flag_wrapv))
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
977 trap. */
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
995 PHI node. */
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
1001 was used.
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
1018 type). */
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
1024 being set. */
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)) \
1234 ? false \
1235 : ((VAL = (*(V))[IX].value), \
1236 true); \
1237 (IX)++)
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)) \
1244 ? false \
1245 : (((void) (VAL = (*V)[IX].value)), \
1246 (INDEX = (*V)[IX].index), \
1247 true); \
1248 (IX)++)
1250 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1251 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1252 do { \
1253 constructor_elt _ce___ = {INDEX, VALUE}; \
1254 vec_safe_push ((V), _ce___); \
1255 } while (0)
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
1309 return nothing. */
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 \
1328 : false)
1330 /* True if a tree is an expression or statement that can have a
1331 location. */
1332 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1334 inline source_range
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
1356 public:
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
1386 all values. */
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
1421 statement. */
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
1445 /* LABEL_EXPR accessor. This gives access to the label associated with
1446 the given label expression. */
1447 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1449 /* CATCH_EXPR accessors. */
1450 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1451 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1453 /* EH_FILTER_EXPR accessors. */
1454 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1455 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1457 /* OBJ_TYPE_REF accessors. */
1458 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1459 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1460 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1462 /* CALL_EXPR accessors. */
1463 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1464 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1465 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1466 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1467 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1469 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1470 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1471 the argument count is zero when checking is enabled. Instead, do
1472 the pointer arithmetic to advance past the 3 fixed operands in a
1473 CALL_EXPR. That produces a valid pointer to just past the end of the
1474 operand array, even if it's not valid to dereference it. */
1475 #define CALL_EXPR_ARGP(NODE) \
1476 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1478 /* TM directives and accessors. */
1479 #define TRANSACTION_EXPR_BODY(NODE) \
1480 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1481 #define TRANSACTION_EXPR_OUTER(NODE) \
1482 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1483 #define TRANSACTION_EXPR_RELAXED(NODE) \
1484 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1486 /* OpenMP and OpenACC directive and clause accessors. */
1488 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1489 as operand 1. */
1490 #define OMP_BODY(NODE) \
1491 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1492 #define OMP_CLAUSES(NODE) \
1493 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1495 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1496 #define OMP_STANDALONE_CLAUSES(NODE) \
1497 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1499 #define OACC_DATA_BODY(NODE) \
1500 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1501 #define OACC_DATA_CLAUSES(NODE) \
1502 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1504 #define OACC_HOST_DATA_BODY(NODE) \
1505 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1506 #define OACC_HOST_DATA_CLAUSES(NODE) \
1507 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1509 #define OACC_CACHE_CLAUSES(NODE) \
1510 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1512 #define OACC_DECLARE_CLAUSES(NODE) \
1513 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1515 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1516 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1518 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1519 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1521 #define OACC_UPDATE_CLAUSES(NODE) \
1522 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1524 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1525 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1527 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1528 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1530 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1531 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1532 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1534 #define OMP_LOOPING_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1535 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 0)
1536 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 1)
1537 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 2)
1538 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 3)
1539 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 4)
1540 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 5)
1541 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOPING_CHECK (NODE), 6)
1543 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1544 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1546 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1548 #define OMP_STRUCTURED_BLOCK_BODY(NODE) \
1549 TREE_OPERAND (OMP_STRUCTURED_BLOCK_CHECK (NODE), 0)
1551 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1552 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1554 #define OMP_SCOPE_BODY(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 0)
1555 #define OMP_SCOPE_CLAUSES(NODE) TREE_OPERAND (OMP_SCOPE_CHECK (NODE), 1)
1557 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1559 #define OMP_MASKED_BODY(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 0)
1560 #define OMP_MASKED_CLAUSES(NODE) TREE_OPERAND (OMP_MASKED_CHECK (NODE), 1)
1562 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1563 #define OMP_TASKGROUP_CLAUSES(NODE) \
1564 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1566 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1567 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1569 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1570 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1571 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1573 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1574 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1576 #define OMP_TARGET_DATA_BODY(NODE) \
1577 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1578 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1579 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1581 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1582 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1584 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1585 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1587 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1588 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1590 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1591 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1593 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1594 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1596 #define OMP_CLAUSE_SIZE(NODE) \
1597 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1598 OMP_CLAUSE_FROM, \
1599 OMP_CLAUSE__CACHE_), 1)
1601 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1602 #define OMP_CLAUSE_DECL(NODE) \
1603 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1604 OMP_CLAUSE_PRIVATE, \
1605 OMP_CLAUSE__SCANTEMP_), 0)
1606 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1607 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1608 != UNKNOWN_LOCATION)
1609 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1611 /* True on OMP_FOR and other OpenMP/OpenACC looping constructs if the loop nest
1612 is non-rectangular. */
1613 #define OMP_FOR_NON_RECTANGULAR(NODE) \
1614 (OMP_LOOPING_CHECK (NODE)->base.private_flag)
1616 /* True on an OMP_SECTION statement that was the last lexical member.
1617 This status is meaningful in the implementation of lastprivate. */
1618 #define OMP_SECTION_LAST(NODE) \
1619 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1621 /* True on an OMP_PARALLEL statement if it represents an explicit
1622 combined parallel work-sharing constructs. */
1623 #define OMP_PARALLEL_COMBINED(NODE) \
1624 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1626 /* True on an OMP_TEAMS statement if it represents an explicit
1627 combined teams distribute constructs. */
1628 #define OMP_TEAMS_COMBINED(NODE) \
1629 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1631 /* True on an OMP_TARGET statement if it represents explicit
1632 combined target teams, target parallel or target simd constructs. */
1633 #define OMP_TARGET_COMBINED(NODE) \
1634 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1636 /* True on an OMP_MASTER statement if it represents an explicit
1637 combined master constructs. */
1638 #define OMP_MASTER_COMBINED(NODE) \
1639 (OMP_MASTER_CHECK (NODE)->base.private_flag)
1641 /* True on an OMP_MASKED statement if it represents an explicit
1642 combined masked constructs. */
1643 #define OMP_MASKED_COMBINED(NODE) \
1644 (OMP_MASKED_CHECK (NODE)->base.private_flag)
1646 /* Memory order for OMP_ATOMIC*. */
1647 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1648 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1649 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1651 /* Weak clause on OMP_ATOMIC*. */
1652 #define OMP_ATOMIC_WEAK(NODE) \
1653 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1654 OMP_ATOMIC_CAPTURE_NEW)->base.public_flag)
1656 /* True on a PRIVATE clause if its decl is kept around for debugging
1657 information only and its DECL_VALUE_EXPR is supposed to point
1658 to what it has been remapped to. */
1659 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1660 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1662 /* True on a PRIVATE clause if ctor needs access to outer region's
1663 variable. */
1664 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1665 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1667 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1668 (thus should be private on the outer taskloop and firstprivate on
1669 task). */
1670 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1671 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1673 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1674 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1675 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1677 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1678 to should be firstprivatized. */
1679 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1680 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1682 /* True on a FIRSTPRIVATE clause with OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT also
1683 set if target construct is the only one that accepts the clause. */
1684 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT_TARGET(NODE) \
1685 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1687 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1688 decl is present in the chain. */
1689 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1690 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1691 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1692 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1693 OMP_CLAUSE_LASTPRIVATE),\
1695 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1696 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1698 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop or
1699 loop construct (thus should be lastprivate on the outer taskloop and
1700 firstprivate on task for the taskloop construct and carefully handled
1701 for loop construct). */
1702 #define OMP_CLAUSE_LASTPRIVATE_LOOP_IV(NODE) \
1703 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1705 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1706 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1707 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1709 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1710 decl is present in the chain (this can happen only for taskloop
1711 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1712 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1713 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1715 /* True on a SHARED clause if a scalar is not modified in the body and
1716 thus could be optimized as firstprivate. */
1717 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1718 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1720 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1721 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1723 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1724 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1725 #define OMP_CLAUSE_IF_EXPR(NODE) \
1726 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1727 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1728 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1729 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1730 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1731 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1732 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1733 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1734 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1735 #define OMP_CLAUSE_FILTER_EXPR(NODE) \
1736 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FILTER), 0)
1738 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1739 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1741 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1742 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1744 #define OMP_CLAUSE_GRAINSIZE_STRICT(NODE) \
1745 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE))
1746 #define OMP_CLAUSE_NUM_TASKS_STRICT(NODE) \
1747 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS))
1749 /* OpenACC clause expressions */
1750 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1752 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1753 OMP_CLAUSE_OPERAND ( \
1754 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1755 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1756 OMP_CLAUSE_OPERAND ( \
1757 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1758 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1759 OMP_CLAUSE_OPERAND ( \
1760 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1761 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1762 OMP_CLAUSE_OPERAND ( \
1763 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1764 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1765 OMP_CLAUSE_OPERAND ( \
1766 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1767 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1768 OMP_CLAUSE_OPERAND ( \
1769 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1770 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1771 OMP_CLAUSE_OPERAND ( \
1772 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1773 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1774 OMP_CLAUSE_OPERAND ( \
1775 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1776 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1777 OMP_CLAUSE_OPERAND ( \
1778 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1780 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1781 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1783 #define OMP_CLAUSE_DOACROSS_KIND(NODE) \
1784 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS)->omp_clause.subcode.doacross_kind)
1786 #define OMP_CLAUSE_DOACROSS_SINK_NEGATIVE(NODE) \
1787 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1789 /* True if DOACROSS clause is spelled as DEPEND. */
1790 #define OMP_CLAUSE_DOACROSS_DEPEND(NODE) \
1791 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DOACROSS))
1793 #define OMP_CLAUSE_MAP_KIND(NODE) \
1794 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1795 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1796 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1797 = (unsigned int) (MAP_KIND))
1799 #define OMP_CLAUSE_MOTION_PRESENT(NODE) \
1800 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_FROM, OMP_CLAUSE_TO)->base.deprecated_flag)
1802 /* Nonzero if this map clause is for array (rather than pointer) based array
1803 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1804 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1805 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1806 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1807 /* Nonzero if this is a mapped array section, that might need special
1808 treatment if OMP_CLAUSE_SIZE is zero. */
1809 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1810 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1811 /* Nonzero if this map clause is for an OpenACC compute construct's reduction
1812 variable or OpenMP map clause mentioned also in in_reduction clause on the
1813 same construct. */
1814 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1815 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1816 /* Nonzero on map clauses added implicitly for reduction clauses on combined
1817 or composite constructs. They shall be removed if there is an explicit
1818 map clause. */
1819 #define OMP_CLAUSE_MAP_IMPLICIT(NODE) \
1820 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.default_def_flag)
1821 /* Nonzero if this map clause is to be indicated to the runtime as 'implicit',
1822 due to being created through implicit data-mapping rules in the middle-end.
1823 NOTE: this is different than OMP_CLAUSE_MAP_IMPLICIT. */
1824 #define OMP_CLAUSE_MAP_RUNTIME_IMPLICIT_P(NODE) \
1825 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.deprecated_flag)
1827 /* Flag that 'OMP_CLAUSE_DECL (NODE)' is to be made addressable during OMP
1828 lowering. */
1829 #define OMP_CLAUSE_MAP_DECL_MAKE_ADDRESSABLE(NODE) \
1830 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.addressable_flag)
1832 /* True on an OMP_CLAUSE_USE_DEVICE_PTR with an OpenACC 'if_present'
1833 clause. */
1834 #define OMP_CLAUSE_USE_DEVICE_PTR_IF_PRESENT(NODE) \
1835 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_USE_DEVICE_PTR)->base.public_flag)
1837 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1838 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1840 #define OMP_CLAUSE_DEVICE_TYPE_KIND(NODE) \
1841 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE_TYPE)->omp_clause.subcode.device_type_kind)
1843 /* True if there is a device clause with a device-modifier 'ancestor'. */
1844 #define OMP_CLAUSE_DEVICE_ANCESTOR(NODE) \
1845 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE)->base.public_flag)
1847 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1848 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1849 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1850 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1851 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1852 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1854 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1855 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1857 /* True on an OMP_CLAUSE_ORDERED if stand-alone ordered construct is nested
1858 inside of work-sharing loop the clause is on. */
1859 #define OMP_CLAUSE_ORDERED_DOACROSS(NODE) \
1860 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED)->base.public_flag)
1862 /* True for unconstrained modifier on order(concurrent) clause. */
1863 #define OMP_CLAUSE_ORDER_UNCONSTRAINED(NODE) \
1864 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER)->base.public_flag)
1865 /* True for reproducible modifier on order(concurrent) clause. */
1866 #define OMP_CLAUSE_ORDER_REPRODUCIBLE(NODE) \
1867 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDER))
1869 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1870 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1871 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1872 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1873 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1874 OMP_CLAUSE_IN_REDUCTION), 1)
1875 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1876 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1877 OMP_CLAUSE_IN_REDUCTION), 2)
1878 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1879 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1880 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1881 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1882 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1883 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1884 OMP_CLAUSE_IN_REDUCTION), 3)
1885 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1886 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1887 OMP_CLAUSE_IN_REDUCTION), 4)
1889 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1890 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1891 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1892 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1893 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1895 /* True if a REDUCTION clause has task reduction-modifier. */
1896 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1897 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1899 /* True if a REDUCTION clause has inscan reduction-modifier. */
1900 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1901 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1903 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1904 are always initialized inside of the loop construct, false otherwise. */
1905 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1906 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1908 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1909 are declared inside of the simd construct. */
1910 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1911 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1913 /* True if a LINEAR clause has a stride that is variable. */
1914 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1915 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1917 /* True for a LINEAR clause with old style modifier syntax
1918 linear(modifier(list)) or linear(modifier(list):step). */
1919 #define OMP_CLAUSE_LINEAR_OLD_LINEAR_MODIFIER(NODE) \
1920 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.addressable_flag)
1922 /* True if a LINEAR clause is for an array or allocatable variable that
1923 needs special handling by the frontend. */
1924 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1925 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1927 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1928 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1930 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1931 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1933 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1934 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1936 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1937 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1939 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1940 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1942 #define OMP_CLAUSE_ALLOCATE_ALLOCATOR(NODE) \
1943 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 1)
1945 #define OMP_CLAUSE_ALLOCATE_ALIGN(NODE) \
1946 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE), 2)
1948 /* True if an ALLOCATE clause was present on a combined or composite
1949 construct and the code for splitting the clauses has already performed
1950 checking if the listed variable has explicit privatization on the
1951 construct. */
1952 #define OMP_CLAUSE_ALLOCATE_COMBINED(NODE) \
1953 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALLOCATE)->base.public_flag)
1955 #define OMP_CLAUSE_NUM_TEAMS_UPPER_EXPR(NODE) \
1956 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1958 #define OMP_CLAUSE_NUM_TEAMS_LOWER_EXPR(NODE) \
1959 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 1)
1961 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1962 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1963 OMP_CLAUSE_THREAD_LIMIT), 0)
1965 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1966 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1968 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1969 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1970 OMP_CLAUSE_DIST_SCHEDULE), 0)
1972 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1973 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1975 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1976 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1978 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1979 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1981 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1982 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1984 /* True if a SCHEDULE clause has the simd modifier on it. */
1985 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1986 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1988 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1989 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1991 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1992 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1993 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1994 ((enum omp_clause_defaultmap_kind) \
1995 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1996 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1997 ((enum omp_clause_defaultmap_kind) \
1998 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1999 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
2000 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
2001 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
2003 #define OMP_CLAUSE_BIND_KIND(NODE) \
2004 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_BIND)->omp_clause.subcode.bind_kind)
2006 /* True if ENTER clause is spelled as TO. */
2007 #define OMP_CLAUSE_ENTER_TO(NODE) \
2008 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ENTER)->base.public_flag)
2010 #define OMP_CLAUSE_TILE_LIST(NODE) \
2011 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
2012 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
2013 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
2014 #define OMP_CLAUSE_TILE_COUNT(NODE) \
2015 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
2017 /* _CONDTEMP_ holding temporary with iteration count. */
2018 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
2019 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
2021 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
2022 allocation. */
2023 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
2024 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
2026 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
2027 one boolean_type_node for test whether alloca was used, another one
2028 to pass to __builtin_stack_restore or free. */
2029 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
2030 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
2032 /* SSA_NAME accessors. */
2034 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
2035 information in the underlying SSA_NAME_VAR for efficiency. */
2036 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
2037 SSA_NAME_CHECK (NODE)->base.public_flag
2039 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
2040 if there is no name associated with it. */
2041 #define SSA_NAME_IDENTIFIER(NODE) \
2042 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
2043 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2044 ? (NODE)->ssa_name.var \
2045 : DECL_NAME ((NODE)->ssa_name.var)) \
2046 : NULL_TREE)
2048 /* Returns the variable being referenced. This can be NULL_TREE for
2049 temporaries not associated with any user variable.
2050 Once released, this is the only field that can be relied upon. */
2051 #define SSA_NAME_VAR(NODE) \
2052 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
2053 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
2054 ? NULL_TREE : (NODE)->ssa_name.var)
2056 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
2057 do \
2059 tree var_ = (VAR); \
2060 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
2061 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
2062 = (var_ \
2063 && TREE_CODE (var_) == VAR_DECL \
2064 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
2066 while (0)
2068 /* Returns the statement which defines this SSA name. */
2069 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
2071 /* Returns the SSA version number of this SSA name. Note that in
2072 tree SSA, version numbers are not per variable and may be recycled. */
2073 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
2075 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
2076 never output, so we can safely use the ASM_WRITTEN_FLAG for this
2077 status bit. */
2078 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
2079 SSA_NAME_CHECK (NODE)->base.asm_written_flag
2081 /* Nonzero if this SSA_NAME expression is currently on the free list of
2082 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
2083 has no meaning for an SSA_NAME. */
2084 #define SSA_NAME_IN_FREE_LIST(NODE) \
2085 SSA_NAME_CHECK (NODE)->base.nothrow_flag
2087 /* Nonzero if this SSA_NAME is the default definition for the
2088 underlying symbol. A default SSA name is created for symbol S if
2089 the very first reference to S in the function is a read operation.
2090 Default definitions are always created by an empty statement and
2091 belong to no basic block. */
2092 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2093 SSA_NAME_CHECK (NODE)->base.default_def_flag
2095 /* Nonzero if this SSA_NAME is known to point to memory that may not
2096 be written to. This is set for default defs of function parameters
2097 that have a corresponding r or R specification in the functions
2098 fn spec attribute. This is used by alias analysis. */
2099 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
2100 SSA_NAME_CHECK (NODE)->base.deprecated_flag
2102 /* Attributes for SSA_NAMEs for pointer-type variables. */
2103 #define SSA_NAME_PTR_INFO(N) \
2104 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
2106 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
2107 #define SSA_NAME_RANGE_INFO(N) \
2108 SSA_NAME_CHECK (N)->ssa_name.info.range_info
2110 /* Return the immediate_use information for an SSA_NAME. */
2111 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2113 #define OMP_CLAUSE_CODE(NODE) \
2114 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2116 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2117 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2119 #define OMP_CLAUSE_OPERAND(NODE, I) \
2120 OMP_CLAUSE_ELT_CHECK (NODE, I)
2122 /* In a BLOCK (scope) node:
2123 Variables declared in the scope NODE. */
2124 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2125 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2126 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2127 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2128 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
2129 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
2130 /* A chain of BLOCKs (scopes) nested within the scope NODE. */
2131 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2132 /* The scope enclosing the scope NODE, or FUNCTION_DECL for the "outermost"
2133 function scope. Inlined functions are chained by this so that given
2134 expression E and its TREE_BLOCK(E) B, BLOCK_SUPERCONTEXT(B) is the scope
2135 in which E has been made or into which E has been inlined. */
2136 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2137 /* Points to the next scope at the same level of nesting as scope NODE. */
2138 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2139 /* A BLOCK, or FUNCTION_DECL of the function from which a block has been
2140 inlined. In a scope immediately enclosing an inlined leaf expression,
2141 points to the outermost scope into which it has been inlined (thus
2142 bypassing all intermediate BLOCK_SUPERCONTEXTs). */
2143 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2144 #define BLOCK_ORIGIN(NODE) \
2145 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
2146 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
2148 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
2149 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
2151 /* True if BLOCK appears in cold section. */
2152 #define BLOCK_IN_COLD_SECTION_P(NODE) \
2153 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
2155 /* An index number for this block. These values are not guaranteed to
2156 be unique across functions -- whether or not they are depends on
2157 the debugging output format in use. */
2158 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2160 /* If block reordering splits a lexical block into discontiguous
2161 address ranges, we'll make a copy of the original block.
2163 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2164 In that case, we have one source block that has been replicated
2165 (through inlining or unrolling) into many logical blocks, and that
2166 these logical blocks have different physical variables in them.
2168 In this case, we have one logical block split into several
2169 non-contiguous address ranges. Most debug formats can't actually
2170 represent this idea directly, so we fake it by creating multiple
2171 logical blocks with the same variables in them. However, for those
2172 that do support non-contiguous regions, these allow the original
2173 logical block to be reconstructed, along with the set of address
2174 ranges.
2176 One of the logical block fragments is arbitrarily chosen to be
2177 the ORIGIN. The other fragments will point to the origin via
2178 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2179 be null. The list of fragments will be chained through
2180 BLOCK_FRAGMENT_CHAIN from the origin. */
2182 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2183 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2185 /* For an inlined function, this gives the location where it was called
2186 from. This is only set in the top level block, which corresponds to the
2187 inlined function scope. This is used in the debug output routines. */
2189 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2191 /* This gives the location of the end of the block, useful to attach
2192 code implicitly generated for outgoing paths. */
2194 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
2196 /* Define fields and accessors for nodes representing data types. */
2198 /* See tree.def for documentation of the use of these fields.
2199 Look at the documentation of the various ..._TYPE tree codes.
2201 Note that the type.values, type.minval, and type.maxval fields are
2202 overloaded and used for different macros in different kinds of types.
2203 Each macro must check to ensure the tree node is of the proper kind of
2204 type. Note also that some of the front-ends also overload these fields,
2205 so they must be checked as well. */
2207 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2208 /* Type size in bits as a tree expression. Need not be constant and may
2209 be greater than TYPE_SIZE for a C++ FIELD_DECL representing a base
2210 class subobject with its own virtual base classes (which are laid out
2211 separately). */
2212 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2213 /* Likewise, type size in bytes. */
2214 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2215 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2216 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2217 #define TYPE_PRECISION(NODE) \
2218 (TREE_NOT_CHECK (TYPE_CHECK (NODE), VECTOR_TYPE)->type_common.precision)
2219 #define TYPE_PRECISION_RAW(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2220 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2221 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2222 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2223 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2225 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
2226 #define TYPE_MODE(NODE) \
2227 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
2228 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2229 #define SCALAR_TYPE_MODE(NODE) \
2230 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
2231 #define SCALAR_INT_TYPE_MODE(NODE) \
2232 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
2233 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
2234 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
2235 #define SET_TYPE_MODE(NODE, MODE) \
2236 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2238 extern unsigned int element_precision (const_tree);
2239 extern machine_mode element_mode (const_tree);
2240 extern machine_mode vector_type_mode (const_tree);
2241 extern unsigned int vector_element_bits (const_tree);
2242 extern tree vector_element_bits_tree (const_tree);
2244 /* The "canonical" type for this type node, which is used by frontends to
2245 compare the type for equality with another type. If two types are
2246 equal (based on the semantics of the language), then they will have
2247 equivalent TYPE_CANONICAL entries.
2249 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2250 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2251 be used for comparison against other types. Instead, the type is
2252 said to require structural equality checks, described in
2253 TYPE_STRUCTURAL_EQUALITY_P.
2255 For unqualified aggregate and function types the middle-end relies on
2256 TYPE_CANONICAL to tell whether two variables can be assigned
2257 to each other without a conversion. The middle-end also makes sure
2258 to assign the same alias-sets to the type partition with equal
2259 TYPE_CANONICAL of their unqualified variants. */
2260 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2261 /* Indicates that the type node requires structural equality
2262 checks. The compiler will need to look at the composition of the
2263 type to determine whether it is equal to another type, rather than
2264 just comparing canonical type pointers. For instance, we would need
2265 to look at the return and parameter types of a FUNCTION_TYPE
2266 node. */
2267 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2268 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2269 type node requires structural equality. */
2270 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2272 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2273 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2275 /* The (language-specific) typed-based alias set for this type.
2276 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2277 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2278 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2279 type can alias objects of any type. */
2280 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2282 /* Nonzero iff the typed-based alias set for this type has been
2283 calculated. */
2284 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2285 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2287 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2288 to this type. */
2289 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2291 /* Raw access to the alignment field. */
2292 #define TYPE_ALIGN_RAW(NODE) \
2293 (TYPE_CHECK (NODE)->type_common.align)
2295 /* The alignment necessary for objects of this type.
2296 The value is an int, measured in bits and must be a power of two.
2297 We support also an "alignment" of zero. */
2298 #define TYPE_ALIGN(NODE) \
2299 (TYPE_ALIGN_RAW (NODE) \
2300 ? ((unsigned)1) << (TYPE_ALIGN_RAW(NODE) - 1) : 0)
2302 /* Specify that TYPE_ALIGN(NODE) is X. */
2303 #define SET_TYPE_ALIGN(NODE, X) \
2304 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2306 /* 1 if the alignment for this type was requested by "aligned" attribute,
2307 0 if it is the default for this type. */
2308 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2310 /* The alignment for NODE, in bytes. */
2311 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2313 /* The minimum alignment necessary for objects of this type without
2314 warning. The value is an int, measured in bits. */
2315 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2316 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2317 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2319 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2320 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2321 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2323 /* If your language allows you to declare types, and you want debug info
2324 for them, then you need to generate corresponding TYPE_DECL nodes.
2325 These "stub" TYPE_DECL nodes have no name, and simply point at the
2326 type node. You then set the TYPE_STUB_DECL field of the type node
2327 to point back at the TYPE_DECL node. This allows the debug routines
2328 to know that the two nodes represent the same type, so that we only
2329 get one debug info record for them. */
2330 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2332 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2333 the type has BLKmode only because it lacks the alignment required for
2334 its size. */
2335 #define TYPE_NO_FORCE_BLK(NODE) \
2336 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2338 /* Nonzero in a type considered volatile as a whole. */
2339 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2341 /* Nonzero in a type considered atomic as a whole. */
2342 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2344 /* Means this type is const-qualified. */
2345 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2347 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2348 the term. */
2349 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2351 /* If nonzero, type's name shouldn't be emitted into debug info. */
2352 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2354 /* The address space the type is in. */
2355 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2357 /* Encode/decode the named memory support as part of the qualifier. If more
2358 than 8 qualifiers are added, these macros need to be adjusted. */
2359 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2360 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2362 /* Return all qualifiers except for the address space qualifiers. */
2363 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2365 /* Only keep the address space out of the qualifiers and discard the other
2366 qualifiers. */
2367 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2369 /* The set of type qualifiers for this type. */
2370 #define TYPE_QUALS(NODE) \
2371 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2372 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2373 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2374 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2375 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2377 /* The same as TYPE_QUALS without the address space qualifications. */
2378 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2379 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2380 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2381 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2382 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2384 /* The same as TYPE_QUALS without the address space and atomic
2385 qualifications. */
2386 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2387 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2388 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2389 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2391 /* These flags are available for each language front end to use internally. */
2392 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2393 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2394 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2395 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2396 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2397 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2398 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2399 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2401 /* Used to keep track of visited nodes in tree traversals. This is set to
2402 0 by copy_node and make_node. */
2403 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2405 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2406 that distinguish string from array of char).
2407 If set in a INTEGER_TYPE, indicates a character type. */
2408 #define TYPE_STRING_FLAG(NODE) \
2409 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2411 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2412 to the C++ one definition rule. This is used for LTO canonical type
2413 computation. */
2414 #define TYPE_CXX_ODR_P(NODE) \
2415 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2417 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2418 about missing conversions to other vector types of the same size. */
2419 #define TYPE_VECTOR_OPAQUE(NODE) \
2420 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2422 /* Indicates that objects of this type must be initialized by calling a
2423 function when they are created. */
2424 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2425 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2427 /* Indicates that a UNION_TYPE object should be passed the same way that
2428 the first union alternative would be passed, or that a RECORD_TYPE
2429 object should be passed the same way that the first (and only) member
2430 would be passed. */
2431 #define TYPE_TRANSPARENT_AGGR(NODE) \
2432 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2434 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2435 address of a component of the type. This is the counterpart of
2436 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2437 #define TYPE_NONALIASED_COMPONENT(NODE) \
2438 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2440 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2441 whether the array is typeless storage or the type contains a member
2442 with this flag set. Such types are exempt from type-based alias
2443 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2444 the flag should be inherited from the element type, can change
2445 when type is finalized and because of that should not be used in
2446 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2447 the flag should not be changed after the array is created and should
2448 be used in type hashing. */
2449 #define TYPE_TYPELESS_STORAGE(NODE) \
2450 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2451 ARRAY_TYPE)->type_common.typeless_storage)
2453 /* Indicated that objects of this type should be laid out in as
2454 compact a way as possible. */
2455 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2457 /* Used by type_contains_placeholder_p to avoid recomputation.
2458 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2459 this field directly. */
2460 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2461 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2463 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2464 #define TYPE_FINAL_P(NODE) \
2465 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2467 /* The debug output functions use the symtab union field to store
2468 information specific to the debugging format. The different debug
2469 output hooks store different types in the union field. These three
2470 macros are used to access different fields in the union. The debug
2471 hooks are responsible for consistently using only a specific
2472 macro. */
2474 /* Symtab field as an integer. Used by stabs generator in dbxout.cc to
2475 hold the type's number in the generated stabs. */
2476 #define TYPE_SYMTAB_ADDRESS(NODE) \
2477 (TYPE_CHECK (NODE)->type_common.symtab.address)
2479 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2480 in dwarf2out.cc to point to the DIE generated for the type. */
2481 #define TYPE_SYMTAB_DIE(NODE) \
2482 (TYPE_CHECK (NODE)->type_common.symtab.die)
2484 /* The garbage collector needs to know the interpretation of the
2485 symtab field. These constants represent the different types in the
2486 union. */
2488 #define TYPE_SYMTAB_IS_ADDRESS (0)
2489 #define TYPE_SYMTAB_IS_DIE (1)
2491 #define TYPE_LANG_SPECIFIC(NODE) \
2492 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2494 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2495 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2496 #define TYPE_FIELDS(NODE) \
2497 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2498 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2499 #define TYPE_ARG_TYPES(NODE) \
2500 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2501 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2503 #define TYPE_MIN_VALUE(NODE) \
2504 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2505 #define TYPE_NEXT_PTR_TO(NODE) \
2506 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2507 #define TYPE_NEXT_REF_TO(NODE) \
2508 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2509 #define TYPE_VFIELD(NODE) \
2510 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2511 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2513 #define TYPE_MAX_VALUE(NODE) \
2514 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2515 #define TYPE_METHOD_BASETYPE(NODE) \
2516 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2517 #define TYPE_OFFSET_BASETYPE(NODE) \
2518 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2519 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2520 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2521 allocated. */
2522 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2523 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2524 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2525 /* For record and union types, information about this type, as a base type
2526 for itself. */
2527 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2529 /* For types, used in a language-dependent way. */
2530 #define TYPE_LANG_SLOT_1(NODE) \
2531 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2533 /* Define accessor macros for information about type inheritance
2534 and basetypes.
2536 A "basetype" means a particular usage of a data type for inheritance
2537 in another type. Each such basetype usage has its own "binfo"
2538 object to describe it. The binfo object is a TREE_VEC node.
2540 Inheritance is represented by the binfo nodes allocated for a
2541 given type. For example, given types C and D, such that D is
2542 inherited by C, 3 binfo nodes will be allocated: one for describing
2543 the binfo properties of C, similarly one for D, and one for
2544 describing the binfo properties of D as a base type for C.
2545 Thus, given a pointer to class C, one can get a pointer to the binfo
2546 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2548 /* BINFO specific flags. */
2550 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2551 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2553 /* Flags for language dependent use. */
2554 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2555 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2556 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2557 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2558 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2559 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2560 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2562 /* The actual data type node being inherited in this basetype. */
2563 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2565 /* The offset where this basetype appears in its containing type.
2566 BINFO_OFFSET slot holds the offset (in bytes)
2567 from the base of the complete object to the base of the part of the
2568 object that is allocated on behalf of this `type'.
2569 This is always 0 except when there is multiple inheritance. */
2571 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2572 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2574 /* The virtual function table belonging to this basetype. Virtual
2575 function tables provide a mechanism for run-time method dispatching.
2576 The entries of a virtual function table are language-dependent. */
2578 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2580 /* The virtual functions in the virtual function table. This is
2581 a TREE_LIST that is used as an initial approximation for building
2582 a virtual function table for this basetype. */
2583 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2585 /* A vector of binfos for the direct basetypes inherited by this
2586 basetype.
2588 If this basetype describes type D as inherited in C, and if the
2589 basetypes of D are E and F, then this vector contains binfos for
2590 inheritance of E and F by C. */
2591 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2593 /* The number of basetypes for NODE. */
2594 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2596 /* Accessor macro to get to the Nth base binfo of this binfo. */
2597 #define BINFO_BASE_BINFO(NODE,N) \
2598 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2599 #define BINFO_BASE_ITERATE(NODE,N,B) \
2600 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2601 #define BINFO_BASE_APPEND(NODE,T) \
2602 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2604 /* For a BINFO record describing a virtual base class, i.e., one where
2605 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2606 base. The actual contents are language-dependent. In the C++
2607 front-end this field is an INTEGER_CST giving an offset into the
2608 vtable where the offset to the virtual base can be found. */
2609 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2611 /* Indicates the accesses this binfo has to its bases. The values are
2612 access_public_node, access_protected_node or access_private_node.
2613 If this array is not present, public access is implied. */
2614 #define BINFO_BASE_ACCESSES(NODE) \
2615 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2617 #define BINFO_BASE_ACCESS(NODE,N) \
2618 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2619 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2620 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2622 /* The index in the VTT where this subobject's sub-VTT can be found.
2623 NULL_TREE if there is no sub-VTT. */
2624 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2626 /* The index in the VTT where the vptr for this subobject can be
2627 found. NULL_TREE if there is no secondary vptr in the VTT. */
2628 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2630 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2631 inheriting this base for non-virtual bases. For virtual bases it
2632 points either to the binfo for which this is a primary binfo, or to
2633 the binfo of the most derived type. */
2634 #define BINFO_INHERITANCE_CHAIN(NODE) \
2635 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2638 /* Define fields and accessors for nodes representing declared names. */
2640 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2641 have an associated SSA name. */
2642 #define SSA_VAR_P(DECL) \
2643 (TREE_CODE (DECL) == VAR_DECL \
2644 || TREE_CODE (DECL) == PARM_DECL \
2645 || TREE_CODE (DECL) == RESULT_DECL \
2646 || TREE_CODE (DECL) == SSA_NAME)
2649 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2651 /* This is the name of the object as written by the user.
2652 It is an IDENTIFIER_NODE. */
2653 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2655 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2656 #define TYPE_IDENTIFIER(NODE) \
2657 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2658 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2660 /* Every ..._DECL node gets a unique number. */
2661 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2663 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2664 uses. */
2665 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2667 /* Every ..._DECL node gets a unique number that stays the same even
2668 when the decl is copied by the inliner once it is set. */
2669 #define DECL_PT_UID(NODE) \
2670 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2671 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2672 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2673 #define SET_DECL_PT_UID(NODE, UID) \
2674 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2675 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2676 be preserved when copyin the decl. */
2677 #define DECL_PT_UID_SET_P(NODE) \
2678 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2680 /* These two fields describe where in the source code the declaration
2681 was. If the declaration appears in several places (as for a C
2682 function that is declared first and then defined later), this
2683 information should refer to the definition. */
2684 #define DECL_SOURCE_LOCATION(NODE) \
2685 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2686 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2687 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2688 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2689 /* This decl was created by a front-end or back-end rather than by
2690 user code, and has not been explicitly declared by the user -- when
2691 that happens the source location is updated to the user's
2692 source. This includes decls with no location (!). */
2693 #define DECL_IS_UNDECLARED_BUILTIN(DECL) \
2694 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2696 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2697 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2698 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2699 nodes, this points to either the FUNCTION_DECL for the containing
2700 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2701 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2702 scope". In particular, for VAR_DECLs which are virtual table pointers
2703 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2704 they belong to. */
2705 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2706 #define DECL_FIELD_CONTEXT(NODE) \
2707 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2709 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2710 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2712 /* For any sort of a ..._DECL node, this points to the original (abstract)
2713 decl node which this decl is an inlined/cloned instance of, or else it
2714 is NULL indicating that this decl is not an instance of some other decl.
2716 The C front-end also uses this in a nested declaration of an inline
2717 function, to point back to the definition. */
2718 #define DECL_ABSTRACT_ORIGIN(NODE) \
2719 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2721 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2722 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2723 #define DECL_ORIGIN(NODE) \
2724 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2726 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2727 inline instance of some original (abstract) decl from an inline function;
2728 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2729 nodes can also have their abstract origin set to themselves. */
2730 #define DECL_FROM_INLINE(NODE) \
2731 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2732 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2734 /* In a DECL this is the field where attributes are stored. */
2735 #define DECL_ATTRIBUTES(NODE) \
2736 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2738 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2739 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2740 For a VAR_DECL, holds the initial value.
2741 For a PARM_DECL, used for DECL_ARG_TYPE--default
2742 values for parameters are encoded in the type of the function,
2743 not in the PARM_DECL slot.
2744 For a FIELD_DECL, this is used for enumeration values and the C
2745 frontend uses it for temporarily storing bitwidth of bitfields.
2747 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2748 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2750 /* Holds the size of the datum, in bits, as a tree expression.
2751 Need not be constant and may be null. May be less than TYPE_SIZE
2752 for a C++ FIELD_DECL representing a base class subobject with its
2753 own virtual base classes (which are laid out separately). */
2754 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2755 /* Likewise for the size in bytes. */
2756 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2757 #define DECL_ALIGN_RAW(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2758 /* Returns the alignment required for the datum, in bits. It must
2759 be a power of two, but an "alignment" of zero is supported
2760 (e.g. as "uninitialized" sentinel). */
2761 #define DECL_ALIGN(NODE) \
2762 (DECL_ALIGN_RAW (NODE) \
2763 ? ((unsigned)1) << (DECL_ALIGN_RAW (NODE) - 1) : 0)
2764 /* Specify that DECL_ALIGN(NODE) is X. */
2765 #define SET_DECL_ALIGN(NODE, X) \
2766 (DECL_ALIGN_RAW (NODE) = ffs_hwi (X))
2768 /* The minimum alignment necessary for the datum, in bits, without
2769 warning. */
2770 #define DECL_WARN_IF_NOT_ALIGN_RAW(NODE) \
2771 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align)
2772 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2773 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) \
2774 ? ((unsigned)1) << (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) - 1) : 0)
2776 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2777 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2778 (DECL_WARN_IF_NOT_ALIGN_RAW (NODE) = ffs_hwi (X))
2780 /* The alignment of NODE, in bytes. */
2781 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2782 /* Set if the alignment of this DECL has been set by the user, for
2783 example with an 'aligned' attribute. */
2784 #define DECL_USER_ALIGN(NODE) \
2785 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2786 /* Holds the machine mode corresponding to the declaration of a variable or
2787 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2788 FIELD_DECL. */
2789 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2790 #define SET_DECL_MODE(NODE, MODE) \
2791 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2793 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2794 operation it is. This is only intended for low-level accesses;
2795 normally DECL_FUNCTION_CODE, DECL_FE_FUNCTION_CODE or DECL_MD_FUNCTION
2796 should be used instead. */
2797 #define DECL_UNCHECKED_FUNCTION_CODE(NODE) \
2798 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2800 /* Test if FCODE is a function code for an alloca operation. */
2801 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2802 ((FCODE) == BUILT_IN_ALLOCA \
2803 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2804 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2806 /* Generate case for an alloca operation. */
2807 #define CASE_BUILT_IN_ALLOCA \
2808 case BUILT_IN_ALLOCA: \
2809 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2810 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2812 #define DECL_FUNCTION_PERSONALITY(NODE) \
2813 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2815 /* Nonzero for a given ..._DECL node means that the name of this node should
2816 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2817 the associated type should be ignored. For a FUNCTION_DECL, the body of
2818 the function should also be ignored. */
2819 #define DECL_IGNORED_P(NODE) \
2820 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2822 /* Nonzero for a given ..._DECL node means that this node represents an
2823 "abstract instance" of the given declaration (e.g. in the original
2824 declaration of an inline function). When generating symbolic debugging
2825 information, we mustn't try to generate any address information for nodes
2826 marked as "abstract instances" because we don't actually generate
2827 any code or allocate any data space for such instances. */
2828 #define DECL_ABSTRACT_P(NODE) \
2829 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2831 /* Language-specific decl information. */
2832 #define DECL_LANG_SPECIFIC(NODE) \
2833 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2835 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2836 do not allocate storage, and refer to a definition elsewhere. Note that
2837 this does not necessarily imply the entity represented by NODE
2838 has no program source-level definition in this translation unit. For
2839 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2840 DECL_EXTERNAL may be true simultaneously; that can be the case for
2841 a C99 "extern inline" function. */
2842 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2844 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2845 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2847 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2849 Also set in some languages for variables, etc., outside the normal
2850 lexical scope, such as class instance variables. */
2851 #define DECL_NONLOCAL(NODE) \
2852 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2854 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2855 Used in FIELD_DECLs for vtable pointers.
2856 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2857 #define DECL_VIRTUAL_P(NODE) \
2858 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2860 /* Used to indicate that this DECL represents a compiler-generated entity. */
2861 #define DECL_ARTIFICIAL(NODE) \
2862 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2864 /* Additional flags for language-specific uses. */
2865 #define DECL_LANG_FLAG_0(NODE) \
2866 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2867 #define DECL_LANG_FLAG_1(NODE) \
2868 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2869 #define DECL_LANG_FLAG_2(NODE) \
2870 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2871 #define DECL_LANG_FLAG_3(NODE) \
2872 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2873 #define DECL_LANG_FLAG_4(NODE) \
2874 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2875 #define DECL_LANG_FLAG_5(NODE) \
2876 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2877 #define DECL_LANG_FLAG_6(NODE) \
2878 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2879 #define DECL_LANG_FLAG_7(NODE) \
2880 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2881 #define DECL_LANG_FLAG_8(NODE) \
2882 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2884 /* Nonzero for a scope which is equal to file scope. */
2885 #define SCOPE_FILE_SCOPE_P(EXP) \
2886 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2887 /* Nonzero for a decl which is at file scope. */
2888 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2889 /* Nonzero for a type which is at file scope. */
2890 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2892 /* Nonzero for a decl that is decorated using attribute used.
2893 This indicates to compiler tools that this decl needs to be preserved. */
2894 #define DECL_PRESERVE_P(DECL) \
2895 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2897 /* Nonzero for a decl that is decorated with the "noinit" attribute.
2898 decls with this attribute are placed into the ".noinit" section, so they are
2899 not initialized by the target's startup code. */
2900 #define DECL_NOINIT_P(DECL) \
2901 (DECL_P (DECL) \
2902 && (lookup_attribute ("noinit", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2904 /* Nonzero for a decl that is decorated with the "persistent" attribute.
2905 decls with this attribute are placed into the ".persistent" section, so they
2906 are not initialized by the target's startup code. */
2907 #define DECL_PERSISTENT_P(DECL) \
2908 (DECL_P (DECL) \
2909 && (lookup_attribute ("persistent", DECL_ATTRIBUTES (DECL)) != NULL_TREE))
2911 /* For function local variables of COMPLEX and VECTOR types,
2912 indicates that the variable is not aliased, and that all
2913 modifications to the variable have been adjusted so that
2914 they are killing assignments. Thus the variable may now
2915 be treated as a GIMPLE register, and use real instead of
2916 virtual ops in SSA form. */
2917 #define DECL_NOT_GIMPLE_REG_P(DECL) \
2918 DECL_COMMON_CHECK (DECL)->decl_common.not_gimple_reg_flag
2920 extern tree decl_value_expr_lookup (tree);
2921 extern void decl_value_expr_insert (tree, tree);
2923 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2924 if transformations have made this more complicated than evaluating the
2925 decl itself. */
2926 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2927 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2928 ->decl_common.decl_flag_2)
2929 #define DECL_VALUE_EXPR(NODE) \
2930 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2931 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2932 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2934 /* Holds the RTL expression for the value of a variable or function.
2935 This value can be evaluated lazily for functions, variables with
2936 static storage duration, and labels. */
2937 #define DECL_RTL(NODE) \
2938 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2939 ? (NODE)->decl_with_rtl.rtl \
2940 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2942 /* Set the DECL_RTL for NODE to RTL. */
2943 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2945 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2946 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2948 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2949 #define DECL_RTL_SET_P(NODE) \
2950 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2952 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2953 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2954 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2955 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2956 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2958 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2959 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2961 #if (GCC_VERSION >= 2007)
2962 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2963 ({ tree const __d = (decl); \
2964 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2965 /* Dereference it so the compiler knows it can't be NULL even \
2966 without assertion checking. */ \
2967 &*DECL_RTL_IF_SET (__d); })
2968 #else
2969 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2970 #endif
2972 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2973 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2975 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2976 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2977 of the structure. */
2978 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2980 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2981 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2982 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2983 natural alignment of the field's type). */
2984 #define DECL_FIELD_BIT_OFFSET(NODE) \
2985 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2987 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2988 if so, the type that was originally specified for it.
2989 TREE_TYPE may have been modified (in finish_struct). */
2990 #define DECL_BIT_FIELD_TYPE(NODE) \
2991 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2993 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2994 representative FIELD_DECL. */
2995 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2996 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2998 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2999 if nonzero, indicates that the field occupies the type. */
3000 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3002 /* For FIELD_DECLs, off_align holds the number of low-order bits of
3003 DECL_FIELD_OFFSET which are known to be always zero.
3004 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3005 has. */
3006 #define DECL_OFFSET_ALIGN(NODE) \
3007 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3009 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
3010 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3011 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3013 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3014 which this FIELD_DECL is defined. This information is needed when
3015 writing debugging information about vfield and vbase decls for C++. */
3016 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3018 /* In a FIELD_DECL, indicates this field should be bit-packed. */
3019 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
3021 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3022 specially. */
3023 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3025 /* In a FIELD_DECL, indicates this field should be ignored for ABI decisions
3026 like passing/returning containing struct by value.
3027 Set for C++17 empty base artificial FIELD_DECLs as well as
3028 empty [[no_unique_address]] non-static data members. */
3029 #define DECL_FIELD_ABI_IGNORED(NODE) \
3030 (!DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3031 #define SET_DECL_FIELD_ABI_IGNORED(NODE, VAL) \
3032 do { \
3033 gcc_checking_assert (!DECL_BIT_FIELD (NODE)); \
3034 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3035 } while (0)
3037 /* In a FIELD_DECL, indicates C++ zero-width bitfield that used to be
3038 removed from the IL since PR42217 until PR101539 and by that changed
3039 the ABI on several targets. This flag is provided so that the backends
3040 can decide on the ABI with zero-width bitfields and emit -Wpsabi
3041 warnings. */
3042 #define DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE) \
3043 (DECL_BIT_FIELD (NODE) && (NODE)->decl_common.decl_flag_0)
3044 #define SET_DECL_FIELD_CXX_ZERO_WIDTH_BIT_FIELD(NODE, VAL) \
3045 do { \
3046 gcc_checking_assert (DECL_BIT_FIELD (NODE)); \
3047 FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_0 = (VAL); \
3048 } while (0)
3050 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3051 this component. This makes it possible for Type-Based Alias Analysis
3052 to disambiguate accesses to this field with indirect accesses using
3053 the field's type:
3055 struct S { int i; } s;
3056 int *p;
3058 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3060 From the implementation's viewpoint, the alias set of the type of the
3061 field 'i' (int) will not be recorded as a subset of that of the type of
3062 's' (struct S) in record_component_aliases. The counterpart is that
3063 accesses to s.i must not be given the alias set of the type of 'i'
3064 (int) but instead directly that of the type of 's' (struct S). */
3065 #define DECL_NONADDRESSABLE_P(NODE) \
3066 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3068 /* Used in a FIELD_DECL to indicate that this field is padding. */
3069 #define DECL_PADDING_P(NODE) \
3070 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3072 /* Used in a FIELD_DECL to indicate whether this field is not a flexible
3073 array member. This is only valid for the last array type field of a
3074 structure. */
3075 #define DECL_NOT_FLEXARRAY(NODE) \
3076 (FIELD_DECL_CHECK (NODE)->decl_common.decl_not_flexarray)
3078 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3079 dense, unique within any one function, and may be used to index arrays.
3080 If the value is -1, then no UID has been assigned. */
3081 #define LABEL_DECL_UID(NODE) \
3082 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3084 /* In a LABEL_DECL, the EH region number for which the label is the
3085 post_landing_pad. */
3086 #define EH_LANDING_PAD_NR(NODE) \
3087 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3089 /* For a PARM_DECL, records the data type used to pass the argument,
3090 which may be different from the type seen in the program. */
3091 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3093 /* For PARM_DECL, holds an RTL for the stack slot or register
3094 where the data was actually passed. */
3095 #define DECL_INCOMING_RTL(NODE) \
3096 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3098 /* Nonzero for a given ..._DECL node means that no warnings should be
3099 generated just because this node is unused. */
3100 #define DECL_IN_SYSTEM_HEADER(NODE) \
3101 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3103 /* Used to indicate that the linkage status of this DECL is not yet known,
3104 so it should not be output now. */
3105 #define DECL_DEFER_OUTPUT(NODE) \
3106 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3108 /* In a VAR_DECL that's static,
3109 nonzero if the space is in the text section. */
3110 #define DECL_IN_TEXT_SECTION(NODE) \
3111 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3113 /* In a VAR_DECL that's static,
3114 nonzero if it belongs to the global constant pool. */
3115 #define DECL_IN_CONSTANT_POOL(NODE) \
3116 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3118 /* Nonzero for a given ..._DECL node means that this node should be
3119 put in .common, if possible. If a DECL_INITIAL is given, and it
3120 is not error_mark_node, then the decl cannot be put in .common. */
3121 #define DECL_COMMON(NODE) \
3122 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3124 /* In a VAR_DECL, nonzero if the decl is a register variable with
3125 an explicit asm specification. */
3126 #define DECL_HARD_REGISTER(NODE) \
3127 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3129 /* Used to indicate that this DECL has weak linkage. */
3130 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3132 /* Used to indicate that the DECL is a dllimport. */
3133 #define DECL_DLLIMPORT_P(NODE) \
3134 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3136 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3137 not be put out unless it is needed in this translation unit.
3138 Entities like this are shared across translation units (like weak
3139 entities), but are guaranteed to be generated by any translation
3140 unit that needs them, and therefore need not be put out anywhere
3141 where they are not needed. DECL_COMDAT is just a hint to the
3142 back-end; it is up to front-ends which set this flag to ensure
3143 that there will never be any harm, other than bloat, in putting out
3144 something which is DECL_COMDAT. */
3145 #define DECL_COMDAT(NODE) \
3146 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3148 #define DECL_COMDAT_GROUP(NODE) \
3149 decl_comdat_group (NODE)
3151 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3152 multiple translation units should be merged. */
3153 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
3154 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
3156 /* The name of the object as the assembler will see it (but before any
3157 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3158 as DECL_NAME. It is an IDENTIFIER_NODE.
3160 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
3161 One Definition Rule based type merging at LTO. It is computed only for
3162 LTO compilation and C++. */
3163 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3165 /* Raw accessor for DECL_ASSEMBLE_NAME. */
3166 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
3167 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
3169 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3170 This is true of all DECL nodes except FIELD_DECL. */
3171 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3172 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3174 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3175 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3176 yet. */
3177 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3178 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
3180 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3181 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3182 overwrite_decl_assembler_name (NODE, NAME)
3184 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
3185 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
3186 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
3187 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
3188 other words, the semantics of using this macro, are different than
3189 saying:
3191 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
3193 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
3195 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
3196 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
3198 /* Records the section name in a section attribute. Used to pass
3199 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3200 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
3202 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3203 this variable in a BIND_EXPR. */
3204 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3205 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3207 /* Value of the decls's visibility attribute */
3208 #define DECL_VISIBILITY(NODE) \
3209 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3211 /* Nonzero means that the decl (or an enclosing scope) had its
3212 visibility specified rather than being inferred. */
3213 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3214 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3216 /* In a VAR_DECL, the model to use if the data should be allocated from
3217 thread-local storage. */
3218 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
3220 /* In a VAR_DECL, nonzero if the data should be allocated from
3221 thread-local storage. */
3222 #define DECL_THREAD_LOCAL_P(NODE) \
3223 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
3225 /* In a non-local VAR_DECL with static storage duration, true if the
3226 variable has an initialization priority. If false, the variable
3227 will be initialized at the DEFAULT_INIT_PRIORITY. */
3228 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3229 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3231 extern tree decl_debug_expr_lookup (tree);
3232 extern void decl_debug_expr_insert (tree, tree);
3234 /* For VAR_DECL, this is set to an expression that it was split from. */
3235 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
3236 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
3237 #define DECL_DEBUG_EXPR(NODE) \
3238 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3240 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3241 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3243 extern priority_type decl_init_priority_lookup (tree);
3244 extern priority_type decl_fini_priority_lookup (tree);
3245 extern void decl_init_priority_insert (tree, priority_type);
3246 extern void decl_fini_priority_insert (tree, priority_type);
3248 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3249 NODE. */
3250 #define DECL_INIT_PRIORITY(NODE) \
3251 (decl_init_priority_lookup (NODE))
3252 /* Set the initialization priority for NODE to VAL. */
3253 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3254 (decl_init_priority_insert (NODE, VAL))
3256 /* For a FUNCTION_DECL the finalization priority of NODE. */
3257 #define DECL_FINI_PRIORITY(NODE) \
3258 (decl_fini_priority_lookup (NODE))
3259 /* Set the finalization priority for NODE to VAL. */
3260 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3261 (decl_fini_priority_insert (NODE, VAL))
3263 /* The initialization priority for entities for which no explicit
3264 initialization priority has been specified. */
3265 #define DEFAULT_INIT_PRIORITY 65535
3267 /* The maximum allowed initialization priority. */
3268 #define MAX_INIT_PRIORITY 65535
3270 /* The largest priority value reserved for use by system runtime
3271 libraries. */
3272 #define MAX_RESERVED_INIT_PRIORITY 100
3274 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
3275 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
3276 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
3278 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
3279 #define DECL_NONLOCAL_FRAME(NODE) \
3280 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
3282 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
3283 #define DECL_NONALIASED(NODE) \
3284 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
3286 /* In a VAR_DECL, nonzero if this variable is not required to have a distinct
3287 address from other variables with the same constant value. In other words,
3288 consider -fmerge-all-constants to be on for this VAR_DECL. */
3289 #define DECL_MERGEABLE(NODE) \
3290 (VAR_DECL_CHECK (NODE)->decl_common.decl_flag_3)
3292 /* This field is used to reference anything in decl.result and is meant only
3293 for use by the garbage collector. */
3294 #define DECL_RESULT_FLD(NODE) \
3295 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3297 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3298 Before the struct containing the FUNCTION_DECL is laid out,
3299 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3300 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3301 function. When the class is laid out, this pointer is changed
3302 to an INTEGER_CST node which is suitable for use as an index
3303 into the virtual function table. */
3304 #define DECL_VINDEX(NODE) \
3305 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
3307 /* In FUNCTION_DECL, holds the decl for the return value. */
3308 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3310 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3311 #define DECL_UNINLINABLE(NODE) \
3312 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3314 /* In a FUNCTION_DECL, the saved representation of the body of the
3315 entire function. */
3316 #define DECL_SAVED_TREE(NODE) \
3317 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
3319 /* Nonzero in a FUNCTION_DECL means this function should be treated
3320 as if it were a malloc, meaning it returns a pointer that is
3321 not an alias. */
3322 #define DECL_IS_MALLOC(NODE) \
3323 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3325 /* Macro for direct set and get of function_decl.decl_type. */
3326 #define FUNCTION_DECL_DECL_TYPE(NODE) \
3327 (NODE->function_decl.decl_type)
3329 /* Set decl_type of a DECL. Set it to T when SET is true, or reset
3330 it to NONE. */
3332 inline void
3333 set_function_decl_type (tree decl, function_decl_type t, bool set)
3335 if (set)
3337 gcc_assert (FUNCTION_DECL_DECL_TYPE (decl) == NONE
3338 || FUNCTION_DECL_DECL_TYPE (decl) == t);
3339 FUNCTION_DECL_DECL_TYPE (decl) = t;
3341 else if (FUNCTION_DECL_DECL_TYPE (decl) == t)
3342 FUNCTION_DECL_DECL_TYPE (decl) = NONE;
3345 /* Nonzero in a FUNCTION_DECL means this function is a replaceable
3346 function (like replaceable operators new or delete). */
3347 #define DECL_IS_REPLACEABLE_OPERATOR(NODE)\
3348 (FUNCTION_DECL_CHECK (NODE)->function_decl.replaceable_operator)
3350 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3351 C++ operator new, meaning that it returns a pointer for which we
3352 should not use type based aliasing. */
3353 #define DECL_IS_OPERATOR_NEW_P(NODE) \
3354 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_NEW)
3356 #define DECL_IS_REPLACEABLE_OPERATOR_NEW_P(NODE) \
3357 (DECL_IS_OPERATOR_NEW_P (NODE) && DECL_IS_REPLACEABLE_OPERATOR (NODE))
3359 #define DECL_SET_IS_OPERATOR_NEW(NODE, VAL) \
3360 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_NEW, VAL)
3362 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3363 C++ operator delete. */
3364 #define DECL_IS_OPERATOR_DELETE_P(NODE) \
3365 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == OPERATOR_DELETE)
3367 #define DECL_SET_IS_OPERATOR_DELETE(NODE, VAL) \
3368 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), OPERATOR_DELETE, VAL)
3370 /* Nonzero in a FUNCTION_DECL means this function may return more
3371 than once. */
3372 #define DECL_IS_RETURNS_TWICE(NODE) \
3373 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3375 /* Nonzero in a FUNCTION_DECL means this function should be treated
3376 as "pure" function (like const function, but may read global memory).
3377 Note that being pure or const for a function is orthogonal to being
3378 nothrow, i.e. it is valid to have DECL_PURE_P set and TREE_NOTHROW
3379 cleared. */
3380 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3382 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3383 the const or pure function may not terminate. When this is nonzero
3384 for a const or pure function, it can be dealt with by cse passes
3385 but cannot be removed by dce passes since you are not allowed to
3386 change an infinite looping program into one that terminates without
3387 error. */
3388 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3389 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3391 /* Nonzero in a FUNCTION_DECL means this function should be treated
3392 as "novops" function (function that does not read global memory,
3393 but may have arbitrary side effects). */
3394 #define DECL_IS_NOVOPS(NODE) \
3395 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3397 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3398 at the beginning or end of execution. */
3399 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3400 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3402 #define DECL_STATIC_DESTRUCTOR(NODE) \
3403 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3405 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3406 be instrumented with calls to support routines. */
3407 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3408 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3410 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3411 disabled in this function. */
3412 #define DECL_NO_LIMIT_STACK(NODE) \
3413 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3415 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3416 #define DECL_STATIC_CHAIN(NODE) \
3417 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3419 /* Nonzero for a decl that cgraph has decided should be inlined into
3420 at least one call site. It is not meaningful to look at this
3421 directly; always use cgraph_function_possibly_inlined_p. */
3422 #define DECL_POSSIBLY_INLINED(DECL) \
3423 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3425 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3426 such as via the `inline' keyword in C/C++. This flag controls the linkage
3427 semantics of 'inline' */
3428 #define DECL_DECLARED_INLINE_P(NODE) \
3429 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3431 /* Nonzero in a FUNCTION_DECL means this function should not get
3432 -Winline warnings. */
3433 #define DECL_NO_INLINE_WARNING_P(NODE) \
3434 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3436 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3437 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3438 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3440 /* Nonzero if a FUNCTION_CODE is a TM load. */
3441 #define BUILTIN_TM_LOAD_P(FN) \
3442 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3444 /* Nonzero if a FUNCTION_CODE is a TM store. */
3445 #define BUILTIN_TM_STORE_P(FN) \
3446 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3448 #define CASE_BUILT_IN_TM_LOAD(FN) \
3449 case BUILT_IN_TM_LOAD_##FN: \
3450 case BUILT_IN_TM_LOAD_RAR_##FN: \
3451 case BUILT_IN_TM_LOAD_RAW_##FN: \
3452 case BUILT_IN_TM_LOAD_RFW_##FN
3454 #define CASE_BUILT_IN_TM_STORE(FN) \
3455 case BUILT_IN_TM_STORE_##FN: \
3456 case BUILT_IN_TM_STORE_WAR_##FN: \
3457 case BUILT_IN_TM_STORE_WAW_##FN
3459 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3460 disregarding size and cost heuristics. This is equivalent to using
3461 the always_inline attribute without the required diagnostics if the
3462 function cannot be inlined. */
3463 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3464 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3466 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
3467 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
3469 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3470 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3471 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3473 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3474 that describes the status of this function. */
3475 #define DECL_STRUCT_FUNCTION(NODE) \
3476 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3478 /* For a builtin function, identify which part of the compiler defined it. */
3479 #define DECL_BUILT_IN_CLASS(NODE) \
3480 ((built_in_class) FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3482 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3483 #define DECL_ARGUMENTS(NODE) \
3484 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3486 /* In FUNCTION_DECL, the function specific target options to use when compiling
3487 this function. */
3488 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3489 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3491 /* In FUNCTION_DECL, the function specific optimization options to use when
3492 compiling this function. */
3493 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3494 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3496 /* In FUNCTION_DECL, this is set if this function has other versions generated
3497 using "target" attributes. The default version is the one which does not
3498 have any "target" attribute set. */
3499 #define DECL_FUNCTION_VERSIONED(NODE)\
3500 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3502 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3503 Devirtualization machinery uses this knowledge for determing type of the
3504 object constructed. Also we assume that constructor address is not
3505 important. */
3506 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3507 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3509 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3510 Devirtualization machinery uses this to track types in destruction. */
3511 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3512 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3514 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3515 #define DECL_LAMBDA_FUNCTION_P(NODE) \
3516 (FUNCTION_DECL_DECL_TYPE (FUNCTION_DECL_CHECK (NODE)) == LAMBDA_FUNCTION)
3518 #define DECL_SET_LAMBDA_FUNCTION(NODE, VAL) \
3519 set_function_decl_type (FUNCTION_DECL_CHECK (NODE), LAMBDA_FUNCTION, VAL)
3521 /* In FUNCTION_DECL that represent an virtual method this is set when
3522 the method is final. */
3523 #define DECL_FINAL_P(NODE)\
3524 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3526 /* The source language of the translation-unit. */
3527 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3528 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3530 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3532 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3533 #define DECL_ORIGINAL_TYPE(NODE) \
3534 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3536 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3537 into stabs. Instead it will generate cross reference ('x') of names.
3538 This uses the same flag as DECL_EXTERNAL. */
3539 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3540 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3542 /* Getter of the imported declaration associated to the
3543 IMPORTED_DECL node. */
3544 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3545 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3547 /* Getter of the symbol declaration associated with the
3548 NAMELIST_DECL node. */
3549 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3550 (DECL_INITIAL (NODE))
3552 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3553 To reduce overhead, the nodes containing the statements are not trees.
3554 This avoids the overhead of tree_common on all linked list elements.
3556 Use the interface in tree-iterator.h to access this node. */
3558 #define STATEMENT_LIST_HEAD(NODE) \
3559 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3560 #define STATEMENT_LIST_TAIL(NODE) \
3561 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3563 #define TREE_OPTIMIZATION(NODE) \
3564 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3566 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3567 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3569 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3570 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3572 /* Return a tree node that encapsulates the optimization options in OPTS
3573 and OPTS_SET. */
3574 extern tree build_optimization_node (struct gcc_options *opts,
3575 struct gcc_options *opts_set);
3577 #define TREE_TARGET_OPTION(NODE) \
3578 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3580 #define TREE_TARGET_GLOBALS(NODE) \
3581 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3583 /* Return a tree node that encapsulates the target options in OPTS and
3584 OPTS_SET. */
3585 extern tree build_target_option_node (struct gcc_options *opts,
3586 struct gcc_options *opts_set);
3588 extern void prepare_target_option_nodes_for_pch (void);
3590 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3592 inline tree
3593 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3595 if (TREE_CODE (__t) != __c)
3596 tree_check_failed (__t, __f, __l, __g, __c, 0);
3597 return __t;
3600 inline tree
3601 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3602 enum tree_code __c)
3604 if (TREE_CODE (__t) == __c)
3605 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3606 return __t;
3609 inline tree
3610 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3611 enum tree_code __c1, enum tree_code __c2)
3613 if (TREE_CODE (__t) != __c1
3614 && TREE_CODE (__t) != __c2)
3615 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3616 return __t;
3619 inline tree
3620 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3621 enum tree_code __c1, enum tree_code __c2)
3623 if (TREE_CODE (__t) == __c1
3624 || TREE_CODE (__t) == __c2)
3625 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3626 return __t;
3629 inline tree
3630 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3631 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3633 if (TREE_CODE (__t) != __c1
3634 && TREE_CODE (__t) != __c2
3635 && TREE_CODE (__t) != __c3)
3636 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3637 return __t;
3640 inline tree
3641 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
3642 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3644 if (TREE_CODE (__t) == __c1
3645 || TREE_CODE (__t) == __c2
3646 || TREE_CODE (__t) == __c3)
3647 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3648 return __t;
3651 inline tree
3652 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
3653 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3654 enum tree_code __c4)
3656 if (TREE_CODE (__t) != __c1
3657 && TREE_CODE (__t) != __c2
3658 && TREE_CODE (__t) != __c3
3659 && TREE_CODE (__t) != __c4)
3660 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3661 return __t;
3664 inline tree
3665 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
3666 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3667 enum tree_code __c4)
3669 if (TREE_CODE (__t) == __c1
3670 || TREE_CODE (__t) == __c2
3671 || TREE_CODE (__t) == __c3
3672 || TREE_CODE (__t) == __c4)
3673 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3674 return __t;
3677 inline tree
3678 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
3679 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3680 enum tree_code __c4, enum tree_code __c5)
3682 if (TREE_CODE (__t) != __c1
3683 && TREE_CODE (__t) != __c2
3684 && TREE_CODE (__t) != __c3
3685 && TREE_CODE (__t) != __c4
3686 && TREE_CODE (__t) != __c5)
3687 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3688 return __t;
3691 inline tree
3692 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
3693 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3694 enum tree_code __c4, enum tree_code __c5)
3696 if (TREE_CODE (__t) == __c1
3697 || TREE_CODE (__t) == __c2
3698 || TREE_CODE (__t) == __c3
3699 || TREE_CODE (__t) == __c4
3700 || TREE_CODE (__t) == __c5)
3701 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3702 return __t;
3705 inline tree
3706 tree_check6 (tree __t, const char *__f, int __l, const char *__g,
3707 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3708 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3710 if (TREE_CODE (__t) != __c1
3711 && TREE_CODE (__t) != __c2
3712 && TREE_CODE (__t) != __c3
3713 && TREE_CODE (__t) != __c4
3714 && TREE_CODE (__t) != __c5
3715 && TREE_CODE (__t) != __c6)
3716 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
3718 return __t;
3721 inline tree
3722 tree_not_check6 (tree __t, const char *__f, int __l, const char *__g,
3723 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3724 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3726 if (TREE_CODE (__t) == __c1
3727 || TREE_CODE (__t) == __c2
3728 || TREE_CODE (__t) == __c3
3729 || TREE_CODE (__t) == __c4
3730 || TREE_CODE (__t) == __c5
3731 || TREE_CODE (__t) == __c6)
3732 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
3733 __c6, 0);
3734 return __t;
3737 inline tree
3738 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
3739 const char *__f, int __l, const char *__g)
3741 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3742 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3743 return __t;
3746 inline tree
3747 tree_class_check (tree __t, const enum tree_code_class __class,
3748 const char *__f, int __l, const char *__g)
3750 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3751 tree_class_check_failed (__t, __class, __f, __l, __g);
3752 return __t;
3755 inline tree
3756 tree_range_check (tree __t,
3757 enum tree_code __code1, enum tree_code __code2,
3758 const char *__f, int __l, const char *__g)
3760 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3761 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3762 return __t;
3765 inline tree
3766 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
3767 const char *__f, int __l, const char *__g)
3769 if (TREE_CODE (__t) != OMP_CLAUSE)
3770 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3771 if (__t->omp_clause.code != __code)
3772 omp_clause_check_failed (__t, __f, __l, __g, __code);
3773 return __t;
3776 inline tree
3777 omp_clause_range_check (tree __t,
3778 enum omp_clause_code __code1,
3779 enum omp_clause_code __code2,
3780 const char *__f, int __l, const char *__g)
3782 if (TREE_CODE (__t) != OMP_CLAUSE)
3783 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3784 if ((int) __t->omp_clause.code < (int) __code1
3785 || (int) __t->omp_clause.code > (int) __code2)
3786 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3787 return __t;
3790 /* These checks have to be special cased. */
3792 inline tree
3793 expr_check (tree __t, const char *__f, int __l, const char *__g)
3795 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3796 if (!IS_EXPR_CODE_CLASS (__c))
3797 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3798 return __t;
3801 /* These checks have to be special cased. */
3803 inline tree
3804 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3806 if (TYPE_P (__t))
3807 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3808 return __t;
3811 inline const HOST_WIDE_INT *
3812 tree_int_cst_elt_check (const_tree __t, int __i,
3813 const char *__f, int __l, const char *__g)
3815 if (TREE_CODE (__t) != INTEGER_CST)
3816 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3817 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3818 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3819 __f, __l, __g);
3820 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3823 inline HOST_WIDE_INT *
3824 tree_int_cst_elt_check (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,
3831 __f, __l, __g);
3832 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3835 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3837 # if GCC_VERSION >= 4006
3838 #pragma GCC diagnostic push
3839 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3840 #endif
3842 inline tree *
3843 tree_vec_elt_check (tree __t, int __i,
3844 const char *__f, int __l, const char *__g)
3846 if (TREE_CODE (__t) != TREE_VEC)
3847 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3848 if (__i < 0 || __i >= __t->base.u.length)
3849 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3850 return &CONST_CAST_TREE (__t)->vec.a[__i];
3853 # if GCC_VERSION >= 4006
3854 #pragma GCC diagnostic pop
3855 #endif
3857 inline tree *
3858 omp_clause_elt_check (tree __t, int __i,
3859 const char *__f, int __l, const char *__g)
3861 if (TREE_CODE (__t) != OMP_CLAUSE)
3862 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3863 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3864 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3865 return &__t->omp_clause.ops[__i];
3868 /* These checks have to be special cased. */
3870 inline tree
3871 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3873 if (!ANY_INTEGRAL_TYPE_P (__t))
3874 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3875 INTEGER_TYPE, BITINT_TYPE, 0);
3876 return __t;
3879 inline const_tree
3880 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3881 tree_code __c)
3883 if (TREE_CODE (__t) != __c)
3884 tree_check_failed (__t, __f, __l, __g, __c, 0);
3885 return __t;
3888 inline const_tree
3889 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3890 enum tree_code __c)
3892 if (TREE_CODE (__t) == __c)
3893 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3894 return __t;
3897 inline const_tree
3898 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3899 enum tree_code __c1, enum tree_code __c2)
3901 if (TREE_CODE (__t) != __c1
3902 && TREE_CODE (__t) != __c2)
3903 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3904 return __t;
3907 inline const_tree
3908 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3909 enum tree_code __c1, enum tree_code __c2)
3911 if (TREE_CODE (__t) == __c1
3912 || TREE_CODE (__t) == __c2)
3913 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3914 return __t;
3917 inline const_tree
3918 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3919 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3921 if (TREE_CODE (__t) != __c1
3922 && TREE_CODE (__t) != __c2
3923 && TREE_CODE (__t) != __c3)
3924 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3925 return __t;
3928 inline const_tree
3929 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3930 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3932 if (TREE_CODE (__t) == __c1
3933 || TREE_CODE (__t) == __c2
3934 || TREE_CODE (__t) == __c3)
3935 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3936 return __t;
3939 inline const_tree
3940 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3941 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3942 enum tree_code __c4)
3944 if (TREE_CODE (__t) != __c1
3945 && TREE_CODE (__t) != __c2
3946 && TREE_CODE (__t) != __c3
3947 && TREE_CODE (__t) != __c4)
3948 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3949 return __t;
3952 inline const_tree
3953 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3954 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3955 enum tree_code __c4)
3957 if (TREE_CODE (__t) == __c1
3958 || TREE_CODE (__t) == __c2
3959 || TREE_CODE (__t) == __c3
3960 || TREE_CODE (__t) == __c4)
3961 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3962 return __t;
3965 inline const_tree
3966 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3967 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3968 enum tree_code __c4, enum tree_code __c5)
3970 if (TREE_CODE (__t) != __c1
3971 && TREE_CODE (__t) != __c2
3972 && TREE_CODE (__t) != __c3
3973 && TREE_CODE (__t) != __c4
3974 && TREE_CODE (__t) != __c5)
3975 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3976 return __t;
3979 inline const_tree
3980 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3981 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3982 enum tree_code __c4, enum tree_code __c5)
3984 if (TREE_CODE (__t) == __c1
3985 || TREE_CODE (__t) == __c2
3986 || TREE_CODE (__t) == __c3
3987 || TREE_CODE (__t) == __c4
3988 || TREE_CODE (__t) == __c5)
3989 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3990 return __t;
3993 inline const_tree
3994 tree_check6 (const_tree __t, const char *__f, int __l, const char *__g,
3995 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3996 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
3998 if (TREE_CODE (__t) != __c1
3999 && TREE_CODE (__t) != __c2
4000 && TREE_CODE (__t) != __c3
4001 && TREE_CODE (__t) != __c4
4002 && TREE_CODE (__t) != __c5
4003 && TREE_CODE (__t) != __c6)
4004 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, __c6,
4006 return __t;
4009 inline const_tree
4010 tree_not_check6 (const_tree __t, const char *__f, int __l, const char *__g,
4011 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
4012 enum tree_code __c4, enum tree_code __c5, enum tree_code __c6)
4014 if (TREE_CODE (__t) == __c1
4015 || TREE_CODE (__t) == __c2
4016 || TREE_CODE (__t) == __c3
4017 || TREE_CODE (__t) == __c4
4018 || TREE_CODE (__t) == __c5
4019 || TREE_CODE (__t) == __c6)
4020 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5,
4021 __c6, 0);
4022 return __t;
4025 inline const_tree
4026 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
4027 const char *__f, int __l, const char *__g)
4029 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
4030 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
4031 return __t;
4034 inline const_tree
4035 tree_class_check (const_tree __t, const enum tree_code_class __class,
4036 const char *__f, int __l, const char *__g)
4038 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
4039 tree_class_check_failed (__t, __class, __f, __l, __g);
4040 return __t;
4043 inline const_tree
4044 tree_range_check (const_tree __t,
4045 enum tree_code __code1, enum tree_code __code2,
4046 const char *__f, int __l, const char *__g)
4048 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
4049 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4050 return __t;
4053 inline const_tree
4054 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
4055 const char *__f, int __l, const char *__g)
4057 if (TREE_CODE (__t) != OMP_CLAUSE)
4058 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4059 if (__t->omp_clause.code != __code)
4060 omp_clause_check_failed (__t, __f, __l, __g, __code);
4061 return __t;
4064 inline const_tree
4065 omp_clause_range_check (const_tree __t,
4066 enum omp_clause_code __code1,
4067 enum omp_clause_code __code2,
4068 const char *__f, int __l, const char *__g)
4070 if (TREE_CODE (__t) != OMP_CLAUSE)
4071 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4072 if ((int) __t->omp_clause.code < (int) __code1
4073 || (int) __t->omp_clause.code > (int) __code2)
4074 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
4075 return __t;
4078 inline const_tree
4079 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
4081 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
4082 if (!IS_EXPR_CODE_CLASS (__c))
4083 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
4084 return __t;
4087 inline const_tree
4088 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
4090 if (TYPE_P (__t))
4091 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
4092 return __t;
4095 # if GCC_VERSION >= 4006
4096 #pragma GCC diagnostic push
4097 #pragma GCC diagnostic ignored "-Wstrict-overflow"
4098 #endif
4100 inline const_tree *
4101 tree_vec_elt_check (const_tree __t, int __i,
4102 const char *__f, int __l, const char *__g)
4104 if (TREE_CODE (__t) != TREE_VEC)
4105 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
4106 if (__i < 0 || __i >= __t->base.u.length)
4107 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
4108 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
4109 //return &__t->vec.a[__i];
4112 # if GCC_VERSION >= 4006
4113 #pragma GCC diagnostic pop
4114 #endif
4116 inline const_tree *
4117 omp_clause_elt_check (const_tree __t, int __i,
4118 const char *__f, int __l, const char *__g)
4120 if (TREE_CODE (__t) != OMP_CLAUSE)
4121 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
4122 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
4123 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
4124 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
4127 inline const_tree
4128 any_integral_type_check (const_tree __t, const char *__f, int __l,
4129 const char *__g)
4131 if (!ANY_INTEGRAL_TYPE_P (__t))
4132 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
4133 INTEGER_TYPE, BITINT_TYPE, 0);
4134 return __t;
4137 #endif
4139 /* Compute the number of operands in an expression node NODE. For
4140 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
4141 otherwise it is looked up from the node's code. */
4142 inline int
4143 tree_operand_length (const_tree node)
4145 if (VL_EXP_CLASS_P (node))
4146 return VL_EXP_OPERAND_LENGTH (node);
4147 else
4148 return TREE_CODE_LENGTH (TREE_CODE (node));
4151 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4153 /* Special checks for TREE_OPERANDs. */
4154 inline tree *
4155 tree_operand_check (tree __t, int __i,
4156 const char *__f, int __l, const char *__g)
4158 const_tree __u = EXPR_CHECK (__t);
4159 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4160 tree_operand_check_failed (__i, __u, __f, __l, __g);
4161 return &CONST_CAST_TREE (__u)->exp.operands[__i];
4164 inline tree *
4165 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
4166 const char *__f, int __l, const char *__g)
4168 if (TREE_CODE (__t) != __code)
4169 tree_check_failed (__t, __f, __l, __g, __code, 0);
4170 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4171 tree_operand_check_failed (__i, __t, __f, __l, __g);
4172 return &__t->exp.operands[__i];
4175 inline const_tree *
4176 tree_operand_check (const_tree __t, int __i,
4177 const char *__f, int __l, const char *__g)
4179 const_tree __u = EXPR_CHECK (__t);
4180 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
4181 tree_operand_check_failed (__i, __u, __f, __l, __g);
4182 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
4185 inline const_tree *
4186 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
4187 const char *__f, int __l, const char *__g)
4189 if (TREE_CODE (__t) != __code)
4190 tree_check_failed (__t, __f, __l, __g, __code, 0);
4191 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
4192 tree_operand_check_failed (__i, __t, __f, __l, __g);
4193 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
4196 #endif
4198 /* True iff an identifier matches a C string. */
4200 inline bool
4201 id_equal (const_tree id, const char *str)
4203 return !strcmp (IDENTIFIER_POINTER (id), str);
4206 inline bool
4207 id_equal (const char *str, const_tree id)
4209 return id_equal (id, str);
4212 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
4214 inline poly_uint64
4215 TYPE_VECTOR_SUBPARTS (const_tree node)
4217 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4218 unsigned int precision = VECTOR_TYPE_CHECK (node)->type_common.precision;
4219 if (NUM_POLY_INT_COEFFS == 2)
4221 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
4222 description of the encoding. */
4223 poly_uint64 res = 0;
4224 res.coeffs[0] = HOST_WIDE_INT_1U << (precision & 0xff);
4225 if (precision & 0x100)
4226 res.coeffs[1] = HOST_WIDE_INT_1U << (precision & 0xff);
4227 return res;
4229 else
4230 return HOST_WIDE_INT_1U << precision;
4233 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
4234 satisfy valid_vector_subparts_p. */
4236 inline void
4237 SET_TYPE_VECTOR_SUBPARTS (tree node, poly_uint64 subparts)
4239 STATIC_ASSERT (NUM_POLY_INT_COEFFS <= 2);
4240 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4241 int index = exact_log2 (coeff0);
4242 gcc_assert (index >= 0);
4243 if (NUM_POLY_INT_COEFFS == 2)
4245 /* We have two coefficients that are each in the range 1 << [0, 63],
4246 so supporting all combinations would require 6 bits per coefficient
4247 and 12 bits in total. Since the precision field is only 10 bits
4248 in size, we need to be more restrictive than that.
4250 At present, coeff[1] is always either 0 (meaning that the number
4251 of units is constant) or equal to coeff[0] (meaning that the number
4252 of units is N + X * N for some target-dependent zero-based runtime
4253 parameter X). We can therefore encode coeff[1] in a single bit.
4255 The most compact encoding would be to use mask 0x3f for coeff[0]
4256 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
4257 get slightly more efficient code on some hosts if we instead
4258 treat the shift amount as an independent byte, so here we use
4259 0xff for coeff[0] and 0x100 for coeff[1]. */
4260 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4261 gcc_assert (coeff1 == 0 || coeff1 == coeff0);
4262 VECTOR_TYPE_CHECK (node)->type_common.precision
4263 = index + (coeff1 != 0 ? 0x100 : 0);
4265 else
4266 VECTOR_TYPE_CHECK (node)->type_common.precision = index;
4269 /* Return true if we can construct vector types with the given number
4270 of subparts. */
4272 inline bool
4273 valid_vector_subparts_p (poly_uint64 subparts)
4275 unsigned HOST_WIDE_INT coeff0 = subparts.coeffs[0];
4276 if (!pow2p_hwi (coeff0))
4277 return false;
4278 if (NUM_POLY_INT_COEFFS == 2)
4280 unsigned HOST_WIDE_INT coeff1 = subparts.coeffs[1];
4281 if (coeff1 != 0 && coeff1 != coeff0)
4282 return false;
4284 return true;
4287 /* Return the built-in function that DECL represents, given that it is known
4288 to be a FUNCTION_DECL with built-in class BUILT_IN_NORMAL. */
4289 inline built_in_function
4290 DECL_FUNCTION_CODE (const_tree decl)
4292 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4293 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_NORMAL);
4294 return (built_in_function) fndecl.function_code;
4297 /* Return the target-specific built-in function that DECL represents,
4298 given that it is known to be a FUNCTION_DECL with built-in class
4299 BUILT_IN_MD. */
4300 inline int
4301 DECL_MD_FUNCTION_CODE (const_tree decl)
4303 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4304 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_MD);
4305 return fndecl.function_code;
4308 /* Return the frontend-specific built-in function that DECL represents,
4309 given that it is known to be a FUNCTION_DECL with built-in class
4310 BUILT_IN_FRONTEND. */
4311 inline int
4312 DECL_FE_FUNCTION_CODE (const_tree decl)
4314 const tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4315 gcc_checking_assert (fndecl.built_in_class == BUILT_IN_FRONTEND);
4316 return fndecl.function_code;
4319 /* Record that FUNCTION_DECL DECL represents built-in function FCODE of
4320 class FCLASS. */
4321 inline void
4322 set_decl_built_in_function (tree decl, built_in_class fclass,
4323 unsigned int fcode)
4325 tree_function_decl &fndecl = FUNCTION_DECL_CHECK (decl)->function_decl;
4326 fndecl.built_in_class = fclass;
4327 fndecl.function_code = fcode;
4330 /* Record that FUNCTION_DECL NEWDECL represents the same built-in function
4331 as OLDDECL (or none, if OLDDECL doesn't represent a built-in function). */
4332 inline void
4333 copy_decl_built_in_function (tree newdecl, const_tree olddecl)
4335 tree_function_decl &newfndecl = FUNCTION_DECL_CHECK (newdecl)->function_decl;
4336 const tree_function_decl &oldfndecl
4337 = FUNCTION_DECL_CHECK (olddecl)->function_decl;
4338 newfndecl.built_in_class = oldfndecl.built_in_class;
4339 newfndecl.function_code = oldfndecl.function_code;
4342 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
4343 wrapper added to express a location_t on behalf of the node's child
4344 (e.g. by maybe_wrap_with_location). */
4346 #define EXPR_LOCATION_WRAPPER_P(NODE) \
4347 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
4349 /* Test if EXP is merely a wrapper node, added to express a location_t
4350 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
4352 inline bool
4353 location_wrapper_p (const_tree exp)
4355 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
4356 the flag EXPR_LOCATION_WRAPPER_P is set.
4357 It normally has the same type as its operand, but it can have a
4358 different one if the type of the operand has changed (e.g. when
4359 merging duplicate decls).
4361 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
4362 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
4363 if ((TREE_CODE (exp) == NON_LVALUE_EXPR
4364 || TREE_CODE (exp) == VIEW_CONVERT_EXPR)
4365 && EXPR_LOCATION_WRAPPER_P (exp))
4366 return true;
4367 return false;
4370 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
4372 inline tree
4373 tree_strip_any_location_wrapper (tree exp)
4375 if (location_wrapper_p (exp))
4376 return TREE_OPERAND (exp, 0);
4377 else
4378 return exp;
4381 #define error_mark_node global_trees[TI_ERROR_MARK]
4383 #define intQI_type_node global_trees[TI_INTQI_TYPE]
4384 #define intHI_type_node global_trees[TI_INTHI_TYPE]
4385 #define intSI_type_node global_trees[TI_INTSI_TYPE]
4386 #define intDI_type_node global_trees[TI_INTDI_TYPE]
4387 #define intTI_type_node global_trees[TI_INTTI_TYPE]
4389 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
4390 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
4391 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
4392 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
4393 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
4395 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
4396 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
4397 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
4398 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
4399 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
4401 #define uint16_type_node global_trees[TI_UINT16_TYPE]
4402 #define uint32_type_node global_trees[TI_UINT32_TYPE]
4403 #define uint64_type_node global_trees[TI_UINT64_TYPE]
4404 #define uint128_type_node global_trees[TI_UINT128_TYPE]
4406 #define void_node global_trees[TI_VOID]
4408 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
4409 #define integer_one_node global_trees[TI_INTEGER_ONE]
4410 #define integer_three_node global_trees[TI_INTEGER_THREE]
4411 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
4412 #define size_zero_node global_trees[TI_SIZE_ZERO]
4413 #define size_one_node global_trees[TI_SIZE_ONE]
4414 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
4415 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
4416 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
4418 /* Base access nodes. */
4419 #define access_public_node global_trees[TI_PUBLIC]
4420 #define access_protected_node global_trees[TI_PROTECTED]
4421 #define access_private_node global_trees[TI_PRIVATE]
4423 #define null_pointer_node global_trees[TI_NULL_POINTER]
4425 #define float_type_node global_trees[TI_FLOAT_TYPE]
4426 #define double_type_node global_trees[TI_DOUBLE_TYPE]
4427 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
4428 #define bfloat16_type_node global_trees[TI_BFLOAT16_TYPE]
4430 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
4431 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
4432 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
4433 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
4435 /* Names for individual types (code should normally iterate over all
4436 such types; these are only for back-end use, or in contexts such as
4437 *.def where iteration is not possible). */
4438 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
4439 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
4440 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
4441 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
4442 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
4443 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
4444 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
4446 /* Type used by certain backends for __float128, which in C++ should be
4447 distinct type from _Float128 for backwards compatibility reasons. */
4448 #define float128t_type_node global_trees[TI_FLOAT128T_TYPE]
4450 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
4451 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
4452 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
4453 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
4455 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
4456 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
4457 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
4458 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
4460 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
4462 #define void_type_node global_trees[TI_VOID_TYPE]
4463 /* The C type `void *'. */
4464 #define ptr_type_node global_trees[TI_PTR_TYPE]
4465 /* The C type `const void *'. */
4466 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
4467 /* The C type `size_t'. */
4468 #define size_type_node global_trees[TI_SIZE_TYPE]
4469 #define pid_type_node global_trees[TI_PID_TYPE]
4470 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
4471 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
4472 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
4473 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
4474 /* The C type `FILE *'. */
4475 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
4476 /* The C type `const struct tm *'. */
4477 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
4478 /* The C type `fenv_t *'. */
4479 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
4480 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
4481 /* The C type `fexcept_t *'. */
4482 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
4483 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
4484 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
4486 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
4487 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
4488 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
4490 /* The decimal floating point types. */
4491 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
4492 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
4493 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
4495 /* The fixed-point types. */
4496 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
4497 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
4498 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
4499 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
4500 #define sat_unsigned_short_fract_type_node \
4501 global_trees[TI_SAT_USFRACT_TYPE]
4502 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4503 #define sat_unsigned_long_fract_type_node \
4504 global_trees[TI_SAT_ULFRACT_TYPE]
4505 #define sat_unsigned_long_long_fract_type_node \
4506 global_trees[TI_SAT_ULLFRACT_TYPE]
4507 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4508 #define fract_type_node global_trees[TI_FRACT_TYPE]
4509 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4510 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4511 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4512 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4513 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4514 #define unsigned_long_long_fract_type_node \
4515 global_trees[TI_ULLFRACT_TYPE]
4516 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4517 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4518 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4519 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4520 #define sat_unsigned_short_accum_type_node \
4521 global_trees[TI_SAT_USACCUM_TYPE]
4522 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4523 #define sat_unsigned_long_accum_type_node \
4524 global_trees[TI_SAT_ULACCUM_TYPE]
4525 #define sat_unsigned_long_long_accum_type_node \
4526 global_trees[TI_SAT_ULLACCUM_TYPE]
4527 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4528 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4529 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4530 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4531 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4532 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4533 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4534 #define unsigned_long_long_accum_type_node \
4535 global_trees[TI_ULLACCUM_TYPE]
4536 #define qq_type_node global_trees[TI_QQ_TYPE]
4537 #define hq_type_node global_trees[TI_HQ_TYPE]
4538 #define sq_type_node global_trees[TI_SQ_TYPE]
4539 #define dq_type_node global_trees[TI_DQ_TYPE]
4540 #define tq_type_node global_trees[TI_TQ_TYPE]
4541 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4542 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4543 #define usq_type_node global_trees[TI_USQ_TYPE]
4544 #define udq_type_node global_trees[TI_UDQ_TYPE]
4545 #define utq_type_node global_trees[TI_UTQ_TYPE]
4546 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4547 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4548 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4549 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4550 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4551 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4552 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4553 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4554 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4555 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4556 #define ha_type_node global_trees[TI_HA_TYPE]
4557 #define sa_type_node global_trees[TI_SA_TYPE]
4558 #define da_type_node global_trees[TI_DA_TYPE]
4559 #define ta_type_node global_trees[TI_TA_TYPE]
4560 #define uha_type_node global_trees[TI_UHA_TYPE]
4561 #define usa_type_node global_trees[TI_USA_TYPE]
4562 #define uda_type_node global_trees[TI_UDA_TYPE]
4563 #define uta_type_node global_trees[TI_UTA_TYPE]
4564 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4565 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4566 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4567 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4568 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4569 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4570 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4571 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4573 /* The node that should be placed at the end of a parameter list to
4574 indicate that the function does not take a variable number of
4575 arguments. The TREE_VALUE will be void_type_node and there will be
4576 no TREE_CHAIN. Language-independent code should not assume
4577 anything else about this node. */
4578 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4580 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4581 #define MAIN_NAME_P(NODE) \
4582 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4584 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4585 functions. */
4586 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4587 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4589 /* Default/current target options (TARGET_OPTION_NODE). */
4590 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4591 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4593 /* Default tree list option(), optimize() pragmas to be linked into the
4594 attribute list. */
4595 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4596 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4598 /* SCEV analyzer global shared trees. */
4599 #define chrec_not_analyzed_yet NULL_TREE
4600 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4601 #define chrec_known global_trees[TI_CHREC_KNOWN]
4603 #define char_type_node integer_types[itk_char]
4604 #define signed_char_type_node integer_types[itk_signed_char]
4605 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4606 #define short_integer_type_node integer_types[itk_short]
4607 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4608 #define integer_type_node integer_types[itk_int]
4609 #define unsigned_type_node integer_types[itk_unsigned_int]
4610 #define long_integer_type_node integer_types[itk_long]
4611 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4612 #define long_long_integer_type_node integer_types[itk_long_long]
4613 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4615 /* True if T is an erroneous expression. */
4617 inline bool
4618 error_operand_p (const_tree t)
4620 return (t == error_mark_node
4621 || (t && TREE_TYPE (t) == error_mark_node));
4624 /* Return the number of elements encoded directly in a VECTOR_CST. */
4626 inline unsigned int
4627 vector_cst_encoded_nelts (const_tree t)
4629 return VECTOR_CST_NPATTERNS (t) * VECTOR_CST_NELTS_PER_PATTERN (t);
4632 extern tree decl_assembler_name (tree);
4633 extern void overwrite_decl_assembler_name (tree decl, tree name);
4634 extern tree decl_comdat_group (const_tree);
4635 extern tree decl_comdat_group_id (const_tree);
4636 extern const char *decl_section_name (const_tree);
4637 extern void set_decl_section_name (tree, const char *);
4638 extern void set_decl_section_name (tree, const_tree);
4639 extern enum tls_model decl_tls_model (const_tree);
4640 extern void set_decl_tls_model (tree, enum tls_model);
4642 /* Compute the number of bytes occupied by 'node'. This routine only
4643 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4645 extern size_t tree_size (const_tree);
4647 /* Compute the number of bytes occupied by a tree with code CODE.
4648 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4649 which are of variable length. */
4650 extern size_t tree_code_size (enum tree_code);
4652 /* Allocate and return a new UID from the DECL_UID namespace. */
4653 extern int allocate_decl_uid (void);
4655 /* Lowest level primitive for allocating a node.
4656 The TREE_CODE is the only argument. Contents are initialized
4657 to zero except for a few of the common fields. */
4659 extern tree make_node (enum tree_code CXX_MEM_STAT_INFO);
4661 /* Free tree node. */
4663 extern void free_node (tree);
4665 /* Make a copy of a node, with all the same contents. */
4667 extern tree copy_node (tree CXX_MEM_STAT_INFO);
4669 /* Make a copy of a chain of TREE_LIST nodes. */
4671 extern tree copy_list (tree);
4673 /* Make a CASE_LABEL_EXPR. */
4675 extern tree build_case_label (tree, tree, tree);
4677 /* Make a BINFO. */
4678 extern tree make_tree_binfo (unsigned CXX_MEM_STAT_INFO);
4680 /* Make an INTEGER_CST. */
4682 extern tree make_int_cst (int, int CXX_MEM_STAT_INFO);
4684 /* Make a TREE_VEC. */
4686 extern tree make_tree_vec (int CXX_MEM_STAT_INFO);
4688 /* Grow a TREE_VEC. */
4690 extern tree grow_tree_vec (tree v, int CXX_MEM_STAT_INFO);
4692 /* Treat a TREE_VEC as a range of trees, e.g.
4693 for (tree e : tree_vec_range (v)) { ... } */
4695 class tree_vec_range
4697 tree v;
4698 public:
4699 tree_vec_range(tree v) : v(v) { }
4700 tree *begin() { return TREE_VEC_BEGIN (v); }
4701 tree *end() { return TREE_VEC_END (v); }
4704 /* Construct various types of nodes. */
4706 extern tree build_nt (enum tree_code, ...);
4707 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
4709 extern tree build0 (enum tree_code, tree CXX_MEM_STAT_INFO);
4710 extern tree build1 (enum tree_code, tree, tree CXX_MEM_STAT_INFO);
4711 extern tree build2 (enum tree_code, tree, tree, tree CXX_MEM_STAT_INFO);
4712 extern tree build3 (enum tree_code, tree, tree, tree, tree CXX_MEM_STAT_INFO);
4713 extern tree build4 (enum tree_code, tree, tree, tree, tree,
4714 tree CXX_MEM_STAT_INFO);
4715 extern tree build5 (enum tree_code, tree, tree, tree, tree, tree,
4716 tree CXX_MEM_STAT_INFO);
4718 /* _loc versions of build[1-5]. */
4720 inline tree
4721 build1_loc (location_t loc, enum tree_code code, tree type,
4722 tree arg1 CXX_MEM_STAT_INFO)
4724 tree t = build1 (code, type, arg1 PASS_MEM_STAT);
4725 if (CAN_HAVE_LOCATION_P (t))
4726 SET_EXPR_LOCATION (t, loc);
4727 return t;
4730 inline tree
4731 build2_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4732 tree arg1 CXX_MEM_STAT_INFO)
4734 tree t = build2 (code, type, arg0, arg1 PASS_MEM_STAT);
4735 if (CAN_HAVE_LOCATION_P (t))
4736 SET_EXPR_LOCATION (t, loc);
4737 return t;
4740 inline tree
4741 build3_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4742 tree arg1, tree arg2 CXX_MEM_STAT_INFO)
4744 tree t = build3 (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4745 if (CAN_HAVE_LOCATION_P (t))
4746 SET_EXPR_LOCATION (t, loc);
4747 return t;
4750 inline tree
4751 build4_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4752 tree arg1, tree arg2, tree arg3 CXX_MEM_STAT_INFO)
4754 tree t = build4 (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4755 if (CAN_HAVE_LOCATION_P (t))
4756 SET_EXPR_LOCATION (t, loc);
4757 return t;
4760 inline tree
4761 build5_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4762 tree arg1, tree arg2, tree arg3, tree arg4 CXX_MEM_STAT_INFO)
4764 tree t = build5 (code, type, arg0, arg1, arg2, arg3,
4765 arg4 PASS_MEM_STAT);
4766 if (CAN_HAVE_LOCATION_P (t))
4767 SET_EXPR_LOCATION (t, loc);
4768 return t;
4771 /* Constructs double_int from tree CST. */
4773 extern tree double_int_to_tree (tree, double_int);
4775 extern tree wide_int_to_tree (tree type, const poly_wide_int_ref &cst);
4776 extern tree force_fit_type (tree, const poly_wide_int_ref &, int, bool);
4778 /* Create an INT_CST node with a CST value zero extended. */
4780 /* static inline */
4781 extern tree build_int_cst (tree, poly_int64);
4782 extern tree build_int_cstu (tree type, poly_uint64);
4783 extern tree build_int_cst_type (tree, poly_int64);
4784 extern tree make_vector (unsigned, unsigned CXX_MEM_STAT_INFO);
4785 extern tree build_vector_from_ctor (tree, const vec<constructor_elt, va_gc> *);
4786 extern tree build_vector_from_val (tree, tree);
4787 extern tree build_uniform_cst (tree, tree);
4788 extern tree build_vec_series (tree, tree, tree);
4789 extern tree build_index_vector (tree, poly_uint64, poly_uint64);
4790 extern tree build_vector_a_then_b (tree, unsigned int, tree, tree);
4791 extern void recompute_constructor_flags (tree);
4792 extern void verify_constructor_flags (tree);
4793 extern tree build_constructor (tree, vec<constructor_elt, va_gc> * CXX_MEM_STAT_INFO);
4794 extern tree build_constructor_single (tree, tree, tree);
4795 extern tree build_constructor_from_list (tree, tree);
4796 extern tree build_constructor_from_vec (tree, const vec<tree, va_gc> *);
4797 extern tree build_constructor_va (tree, int, ...);
4798 extern tree build_clobber (tree, enum clobber_kind = CLOBBER_UNDEF);
4799 extern tree build_real_from_int_cst (tree, const_tree);
4800 extern tree build_real_from_wide (tree, const wide_int_ref &, signop);
4801 extern tree build_complex (tree, tree, tree);
4802 extern tree build_complex_inf (tree, bool);
4803 extern tree build_each_one_cst (tree);
4804 extern tree build_one_cst (tree);
4805 extern tree build_minus_one_cst (tree);
4806 extern tree build_all_ones_cst (tree);
4807 extern tree build_zero_cst (tree);
4808 extern tree build_replicated_int_cst (tree, unsigned, HOST_WIDE_INT);
4809 extern tree sign_mask_for (tree);
4810 extern tree build_string (unsigned, const char * = NULL);
4811 extern tree build_poly_int_cst (tree, const poly_wide_int_ref &);
4812 extern tree build_tree_list (tree, tree CXX_MEM_STAT_INFO);
4813 extern tree build_tree_list_vec (const vec<tree, va_gc> * CXX_MEM_STAT_INFO);
4814 extern tree build_decl (location_t, enum tree_code,
4815 tree, tree CXX_MEM_STAT_INFO);
4816 extern tree build_debug_expr_decl (tree type);
4817 extern tree build_fn_decl (const char *, tree);
4818 extern tree build_translation_unit_decl (tree);
4819 extern tree build_block (tree, tree, tree, tree);
4820 extern tree build_empty_stmt (location_t);
4821 extern tree build_omp_clause (location_t, enum omp_clause_code);
4823 extern tree build_vl_exp (enum tree_code, int CXX_MEM_STAT_INFO);
4825 extern tree build_call_nary (tree, tree, int, ...);
4826 extern tree build_call_valist (tree, tree, int, va_list);
4827 #define build_call_array(T1,T2,N,T3)\
4828 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4829 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4830 extern tree build_call_vec (tree, tree, const vec<tree, va_gc> *);
4831 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
4832 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
4833 extern tree build_call_expr_loc (location_t, tree, int, ...);
4834 extern tree build_call_expr (tree, int, ...);
4835 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
4836 tree, int, ...);
4837 extern tree build_call_expr_internal_loc_array (location_t, enum internal_fn,
4838 tree, int, const tree *);
4839 extern tree maybe_build_call_expr_loc (location_t, combined_fn, tree,
4840 int, ...);
4841 extern tree build_alloca_call_expr (tree, unsigned int, HOST_WIDE_INT);
4842 extern tree build_string_literal (unsigned, const char * = NULL,
4843 tree = char_type_node,
4844 unsigned HOST_WIDE_INT = HOST_WIDE_INT_M1U);
4845 inline tree build_string_literal (const char *p)
4846 { return build_string_literal (strlen (p) + 1, p); }
4847 inline tree build_string_literal (tree t)
4849 return build_string_literal (IDENTIFIER_LENGTH (t) + 1,
4850 IDENTIFIER_POINTER (t));
4853 /* Construct various nodes representing data types. */
4855 extern tree signed_or_unsigned_type_for (int, tree);
4856 extern tree signed_type_for (tree);
4857 extern tree unsigned_type_for (tree);
4858 extern bool is_truth_type_for (tree, tree);
4859 extern bool tree_zero_one_valued_p (tree);
4860 extern tree truth_type_for (tree);
4861 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
4862 extern tree build_pointer_type (tree);
4863 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
4864 extern tree build_reference_type (tree);
4865 extern tree build_vector_type_for_mode (tree, machine_mode);
4866 extern tree build_vector_type (tree, poly_int64);
4867 extern tree build_truth_vector_type_for_mode (poly_uint64, machine_mode);
4868 extern tree build_opaque_vector_type (tree, poly_int64);
4869 extern tree build_index_type (tree);
4870 extern tree build_array_type_1 (tree, tree, bool, bool, bool);
4871 extern tree build_array_type (tree, tree, bool = false);
4872 extern tree build_nonshared_array_type (tree, tree);
4873 extern tree build_array_type_nelts (tree, poly_uint64);
4874 extern tree build_function_type (tree, tree, bool = false);
4875 extern tree build_function_type_list (tree, ...);
4876 extern tree build_varargs_function_type_list (tree, ...);
4877 extern tree build_function_type_array (tree, int, tree *);
4878 extern tree build_varargs_function_type_array (tree, int, tree *);
4879 #define build_function_type_vec(RET, V) \
4880 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4881 #define build_varargs_function_type_vec(RET, V) \
4882 build_varargs_function_type_array (RET, vec_safe_length (V), \
4883 vec_safe_address (V))
4884 extern tree build_method_type_directly (tree, tree, tree);
4885 extern tree build_method_type (tree, tree);
4886 extern tree build_offset_type (tree, tree);
4887 extern tree build_complex_type (tree, bool named = false);
4888 extern tree array_type_nelts (const_tree);
4890 extern tree value_member (tree, tree);
4891 extern tree purpose_member (const_tree, tree);
4892 extern bool vec_member (const_tree, vec<tree, va_gc> *);
4893 extern tree chain_index (int, tree);
4895 /* Arguments may be null. */
4896 extern bool tree_int_cst_equal (const_tree, const_tree);
4898 /* The following predicates are safe to call with a null argument. */
4899 extern bool tree_fits_shwi_p (const_tree) ATTRIBUTE_PURE;
4900 extern bool tree_fits_poly_int64_p (const_tree) ATTRIBUTE_PURE;
4901 extern bool tree_fits_uhwi_p (const_tree) ATTRIBUTE_PURE;
4902 extern bool tree_fits_poly_uint64_p (const_tree) ATTRIBUTE_PURE;
4904 extern HOST_WIDE_INT tree_to_shwi (const_tree)
4905 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4906 extern poly_int64 tree_to_poly_int64 (const_tree)
4907 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4908 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree)
4909 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4910 extern poly_uint64 tree_to_poly_uint64 (const_tree)
4911 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE;
4912 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4913 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4914 tree_to_shwi (const_tree t)
4916 gcc_assert (tree_fits_shwi_p (t));
4917 return TREE_INT_CST_LOW (t);
4920 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
4921 tree_to_uhwi (const_tree t)
4923 gcc_assert (tree_fits_uhwi_p (t));
4924 return TREE_INT_CST_LOW (t);
4926 #if NUM_POLY_INT_COEFFS == 1
4927 extern inline __attribute__ ((__gnu_inline__)) poly_int64
4928 tree_to_poly_int64 (const_tree t)
4930 gcc_assert (tree_fits_poly_int64_p (t));
4931 return TREE_INT_CST_LOW (t);
4934 extern inline __attribute__ ((__gnu_inline__)) poly_uint64
4935 tree_to_poly_uint64 (const_tree t)
4937 gcc_assert (tree_fits_poly_uint64_p (t));
4938 return TREE_INT_CST_LOW (t);
4940 #endif
4941 #endif
4942 extern int tree_int_cst_sgn (const_tree);
4943 extern int tree_int_cst_sign_bit (const_tree);
4944 extern unsigned int tree_int_cst_min_precision (tree, signop);
4945 extern tree excess_precision_type (tree);
4947 /* Recursively examines the array elements of TYPE, until a non-array
4948 element type is found. */
4950 inline tree
4951 strip_array_types (tree type)
4953 while (TREE_CODE (type) == ARRAY_TYPE)
4954 type = TREE_TYPE (type);
4956 return type;
4959 /* Desription of the reason why the argument of valid_constant_size_p
4960 is not a valid size. */
4961 enum cst_size_error {
4962 cst_size_ok,
4963 cst_size_not_constant,
4964 cst_size_negative,
4965 cst_size_too_big,
4966 cst_size_overflow
4969 extern bool valid_constant_size_p (const_tree, cst_size_error * = NULL);
4970 extern tree max_object_size ();
4972 /* Return true if T holds a value that can be represented as a poly_int64
4973 without loss of precision. Store the value in *VALUE if so. */
4975 inline bool
4976 poly_int_tree_p (const_tree t, poly_int64 *value)
4978 if (tree_fits_poly_int64_p (t))
4980 *value = tree_to_poly_int64 (t);
4981 return true;
4983 return false;
4986 /* Return true if T holds a value that can be represented as a poly_uint64
4987 without loss of precision. Store the value in *VALUE if so. */
4989 inline bool
4990 poly_int_tree_p (const_tree t, poly_uint64 *value)
4992 if (tree_fits_poly_uint64_p (t))
4994 *value = tree_to_poly_uint64 (t);
4995 return true;
4997 return false;
5000 /* From expmed.cc. Since rtl.h is included after tree.h, we can't
5001 put the prototype here. Rtl.h does declare the prototype if
5002 tree.h had been included. */
5004 extern tree make_tree (tree, rtx);
5006 /* Returns true iff CAND and BASE have equivalent language-specific
5007 qualifiers. */
5009 extern bool check_lang_type (const_tree cand, const_tree base);
5011 /* Returns true iff unqualified CAND and BASE are equivalent. */
5013 extern bool check_base_type (const_tree cand, const_tree base);
5015 /* Check whether CAND is suitable to be returned from get_qualified_type
5016 (BASE, TYPE_QUALS). */
5018 extern bool check_qualified_type (const_tree, const_tree, int);
5020 /* Return a version of the TYPE, qualified as indicated by the
5021 TYPE_QUALS, if one exists. If no qualified version exists yet,
5022 return NULL_TREE. */
5024 extern tree get_qualified_type (tree, int);
5026 /* Like get_qualified_type, but creates the type if it does not
5027 exist. This function never returns NULL_TREE. */
5029 extern tree build_qualified_type (tree, int CXX_MEM_STAT_INFO);
5031 /* Create a variant of type T with alignment ALIGN. */
5033 extern tree build_aligned_type (tree, unsigned int);
5035 /* Like build_qualified_type, but only deals with the `const' and
5036 `volatile' qualifiers. This interface is retained for backwards
5037 compatibility with the various front-ends; new code should use
5038 build_qualified_type instead. */
5040 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
5041 build_qualified_type ((TYPE), \
5042 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
5043 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
5045 /* Make a copy of a type node. */
5047 extern tree build_distinct_type_copy (tree CXX_MEM_STAT_INFO);
5048 extern tree build_variant_type_copy (tree CXX_MEM_STAT_INFO);
5050 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
5051 return a canonicalized ..._TYPE node, so that duplicates are not made.
5052 How the hash code is computed is up to the caller, as long as any two
5053 callers that could hash identical-looking type nodes agree. */
5055 extern hashval_t type_hash_canon_hash (tree);
5056 extern tree type_hash_canon (unsigned int, tree);
5058 extern tree convert (tree, tree);
5059 extern tree size_in_bytes_loc (location_t, const_tree);
5060 inline tree
5061 size_in_bytes (const_tree t)
5063 return size_in_bytes_loc (input_location, t);
5066 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
5067 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
5068 extern tree bit_position (const_tree);
5069 extern tree byte_position (const_tree);
5070 extern HOST_WIDE_INT int_byte_position (const_tree);
5072 /* Type for sizes of data-type. */
5074 #define sizetype sizetype_tab[(int) stk_sizetype]
5075 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
5076 #define ssizetype sizetype_tab[(int) stk_ssizetype]
5077 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
5078 #define size_int(L) size_int_kind (L, stk_sizetype)
5079 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
5080 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
5081 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
5083 /* Log2 of BITS_PER_UNIT. */
5085 #if BITS_PER_UNIT == 8
5086 #define LOG2_BITS_PER_UNIT 3
5087 #elif BITS_PER_UNIT == 16
5088 #define LOG2_BITS_PER_UNIT 4
5089 #else
5090 #error Unknown BITS_PER_UNIT
5091 #endif
5093 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
5094 by making the last node in X point to Y.
5095 Returns X, except if X is 0 returns Y. */
5097 extern tree chainon (tree, tree);
5099 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
5101 extern tree tree_cons (tree, tree, tree CXX_MEM_STAT_INFO);
5103 /* Return the last tree node in a chain. */
5105 extern tree tree_last (tree);
5107 /* Reverse the order of elements in a chain, and return the new head. */
5109 extern tree nreverse (tree);
5111 /* Returns the length of a chain of nodes
5112 (number of chain pointers to follow before reaching a null pointer). */
5114 extern int list_length (const_tree);
5116 /* Returns the first/last FIELD_DECL in a RECORD_TYPE. */
5118 extern tree first_field (const_tree) ATTRIBUTE_NONNULL (1);
5119 extern tree last_field (const_tree) ATTRIBUTE_NONNULL (1);
5121 /* Given an initializer INIT, return TRUE if INIT is zero or some
5122 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
5123 null, set *NONZERO if and only if INIT is known not to be all
5124 zeros. The combination of return value of false and *NONZERO
5125 false implies that INIT may but need not be all zeros. Other
5126 combinations indicate definitive answers. */
5128 extern bool initializer_zerop (const_tree, bool * = NULL);
5129 extern bool initializer_each_zero_or_onep (const_tree);
5131 extern tree vector_cst_elt (const_tree, unsigned int);
5133 /* Given a vector VEC, return its first element if all elements are
5134 the same. Otherwise return NULL_TREE. */
5136 extern tree uniform_vector_p (const_tree);
5138 /* If the argument is INTEGER_CST, return it. If the argument is vector
5139 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
5140 return NULL_TREE. */
5142 extern tree uniform_integer_cst_p (tree);
5144 extern int single_nonzero_element (const_tree);
5146 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
5148 extern vec<tree, va_gc> *ctor_to_vec (tree);
5150 /* zerop (tree x) is nonzero if X is a constant of value 0. */
5152 extern bool zerop (const_tree);
5154 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
5156 extern bool integer_zerop (const_tree);
5158 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
5160 extern bool integer_onep (const_tree);
5162 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
5163 a vector or complex where each part is 1. */
5165 extern bool integer_each_onep (const_tree);
5167 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
5168 all of whose significant bits are 1. */
5170 extern bool integer_all_onesp (const_tree);
5172 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
5173 value -1. */
5175 extern bool integer_minus_onep (const_tree);
5177 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
5178 exactly one bit 1. */
5180 extern bool integer_pow2p (const_tree);
5182 /* Checks to see if T is a constant or a constant vector and if each element E
5183 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
5185 extern tree bitmask_inv_cst_vector_p (tree);
5187 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
5188 with a nonzero value. */
5190 extern bool integer_nonzerop (const_tree);
5192 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
5193 a vector where each element is an integer constant of value -1. */
5195 extern bool integer_truep (const_tree);
5197 extern bool cst_and_fits_in_hwi (const_tree);
5198 extern tree num_ending_zeros (const_tree);
5200 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
5201 value 0. */
5203 extern bool fixed_zerop (const_tree);
5205 /* staticp (tree x) is nonzero if X is a reference to data allocated
5206 at a fixed address in memory. Returns the outermost data. */
5208 extern tree staticp (tree);
5210 /* save_expr (EXP) returns an expression equivalent to EXP
5211 but it can be used multiple times within context CTX
5212 and only evaluate EXP once. */
5214 extern tree save_expr (tree);
5216 /* Return true if T is function-invariant. */
5218 extern bool tree_invariant_p (tree);
5220 /* Look inside EXPR into any simple arithmetic operations. Return the
5221 outermost non-arithmetic or non-invariant node. */
5223 extern tree skip_simple_arithmetic (tree);
5225 /* Look inside EXPR into simple arithmetic operations involving constants.
5226 Return the outermost non-arithmetic or non-constant node. */
5228 extern tree skip_simple_constant_arithmetic (tree);
5230 /* Return which tree structure is used by T. */
5232 enum tree_node_structure_enum tree_node_structure (const_tree);
5234 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
5235 size or offset that depends on a field within a record. */
5237 extern bool contains_placeholder_p (const_tree);
5239 /* This macro calls the above function but short-circuits the common
5240 case of a constant to save time. Also check for null. */
5242 #define CONTAINS_PLACEHOLDER_P(EXP) \
5243 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
5245 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
5246 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
5247 field positions. */
5249 extern bool type_contains_placeholder_p (tree);
5251 /* Given a tree EXP, find all occurrences of references to fields
5252 in a PLACEHOLDER_EXPR and place them in vector REFS without
5253 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
5254 we assume here that EXP contains only arithmetic expressions
5255 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
5256 argument list. */
5258 extern void find_placeholder_in_expr (tree, vec<tree> *);
5260 /* This macro calls the above function but short-circuits the common
5261 case of a constant to save time and also checks for NULL. */
5263 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
5264 do { \
5265 if((EXP) && !TREE_CONSTANT (EXP)) \
5266 find_placeholder_in_expr (EXP, V); \
5267 } while (0)
5269 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
5270 return a tree with all occurrences of references to F in a
5271 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
5272 CONST_DECLs. Note that we assume here that EXP contains only
5273 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
5274 occurring only in their argument list. */
5276 extern tree substitute_in_expr (tree, tree, tree);
5278 /* This macro calls the above function but short-circuits the common
5279 case of a constant to save time and also checks for NULL. */
5281 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
5282 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
5284 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
5285 for it within OBJ, a tree that is an object or a chain of references. */
5287 extern tree substitute_placeholder_in_expr (tree, tree);
5289 /* This macro calls the above function but short-circuits the common
5290 case of a constant to save time and also checks for NULL. */
5292 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
5293 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
5294 : substitute_placeholder_in_expr (EXP, OBJ))
5297 /* stabilize_reference (EXP) returns a reference equivalent to EXP
5298 but it can be used multiple times
5299 and only evaluate the subexpressions once. */
5301 extern tree stabilize_reference (tree);
5303 /* Return EXP, stripped of any conversions to wider types
5304 in such a way that the result of converting to type FOR_TYPE
5305 is the same as if EXP were converted to FOR_TYPE.
5306 If FOR_TYPE is 0, it signifies EXP's type. */
5308 extern tree get_unwidened (tree, tree);
5310 /* Return OP or a simpler expression for a narrower value
5311 which can be sign-extended or zero-extended to give back OP.
5312 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5313 or 0 if the value should be sign-extended. */
5315 extern tree get_narrower (tree, int *);
5317 /* Return true if T is an expression that get_inner_reference handles. */
5319 inline bool
5320 handled_component_p (const_tree t)
5322 switch (TREE_CODE (t))
5324 case COMPONENT_REF:
5325 case BIT_FIELD_REF:
5326 case ARRAY_REF:
5327 case ARRAY_RANGE_REF:
5328 case REALPART_EXPR:
5329 case IMAGPART_EXPR:
5330 case VIEW_CONVERT_EXPR:
5331 return true;
5333 default:
5334 return false;
5338 /* Return true T is a component with reverse storage order. */
5340 inline bool
5341 reverse_storage_order_for_component_p (tree t)
5343 /* The storage order only applies to scalar components. */
5344 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5345 || POINTER_TYPE_P (TREE_TYPE (t))
5346 || VECTOR_TYPE_P (TREE_TYPE (t)))
5347 return false;
5349 if (TREE_CODE (t) == REALPART_EXPR || TREE_CODE (t) == IMAGPART_EXPR)
5350 t = TREE_OPERAND (t, 0);
5352 switch (TREE_CODE (t))
5354 case ARRAY_REF:
5355 case COMPONENT_REF:
5356 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
5357 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
5358 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))
5359 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t, 0)));
5361 case BIT_FIELD_REF:
5362 case MEM_REF:
5363 return REF_REVERSE_STORAGE_ORDER (t);
5365 case ARRAY_RANGE_REF:
5366 case VIEW_CONVERT_EXPR:
5367 default:
5368 return false;
5372 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
5373 that can modify the storage order of objects. Note that, even if the
5374 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
5375 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
5376 it can change the partition of the aggregate object into scalars. */
5378 inline bool
5379 storage_order_barrier_p (const_tree t)
5381 if (TREE_CODE (t) != VIEW_CONVERT_EXPR)
5382 return false;
5384 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
5385 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t)))
5386 return true;
5388 tree op = TREE_OPERAND (t, 0);
5390 if (AGGREGATE_TYPE_P (TREE_TYPE (op))
5391 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op)))
5392 return true;
5394 return false;
5397 /* Given a DECL or TYPE, return the scope in which it was declared, or
5398 NUL_TREE if there is no containing scope. */
5400 extern tree get_containing_scope (const_tree);
5402 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
5404 extern const_tree get_ultimate_context (const_tree);
5406 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5407 or zero if none. */
5408 extern tree decl_function_context (const_tree);
5410 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5411 this _DECL with its context, or zero if none. */
5412 extern tree decl_type_context (const_tree);
5414 /* Return true if EXPR is the real constant zero. */
5415 extern bool real_zerop (const_tree);
5417 /* Initialize the iterator I with arguments from function FNDECL */
5419 inline void
5420 function_args_iter_init (function_args_iterator *i, const_tree fntype)
5422 i->next = TYPE_ARG_TYPES (fntype);
5425 /* Return a pointer that holds the next argument if there are more arguments to
5426 handle, otherwise return NULL. */
5428 inline tree *
5429 function_args_iter_cond_ptr (function_args_iterator *i)
5431 return (i->next) ? &TREE_VALUE (i->next) : NULL;
5434 /* Return the next argument if there are more arguments to handle, otherwise
5435 return NULL. */
5437 inline tree
5438 function_args_iter_cond (function_args_iterator *i)
5440 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
5443 /* Advance to the next argument. */
5444 inline void
5445 function_args_iter_next (function_args_iterator *i)
5447 gcc_assert (i->next != NULL_TREE);
5448 i->next = TREE_CHAIN (i->next);
5451 /* Returns true if a BLOCK has a source location.
5452 BLOCK_SOURCE_LOCATION is set only to inlined function entry points,
5453 so the function returns true for all but the innermost and outermost
5454 blocks into which an expression has been inlined. */
5456 inline bool
5457 inlined_function_outer_scope_p (const_tree block)
5459 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
5462 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5463 to point to the next tree element. ITER is an instance of
5464 function_args_iterator used to iterate the arguments. */
5465 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5466 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5467 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5468 function_args_iter_next (&(ITER)))
5470 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5471 to the next tree element. ITER is an instance of function_args_iterator
5472 used to iterate the arguments. */
5473 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5474 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5475 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5476 function_args_iter_next (&(ITER)))
5478 /* In tree.cc */
5479 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
5480 extern unsigned crc32_string (unsigned, const char *);
5481 inline unsigned
5482 crc32_unsigned (unsigned chksum, unsigned value)
5484 return crc32_unsigned_n (chksum, value, 4);
5486 inline unsigned
5487 crc32_byte (unsigned chksum, char byte)
5489 return crc32_unsigned_n (chksum, byte, 1);
5491 extern void clean_symbol_name (char *);
5492 extern tree get_file_function_name (const char *);
5493 extern tree get_callee_fndecl (const_tree);
5494 extern combined_fn get_call_combined_fn (const_tree);
5495 extern int type_num_arguments (const_tree);
5496 extern tree type_argument_type (const_tree, unsigned) ATTRIBUTE_NONNULL (1);
5497 extern bool associative_tree_code (enum tree_code);
5498 extern bool commutative_tree_code (enum tree_code);
5499 extern bool commutative_ternary_tree_code (enum tree_code);
5500 extern bool operation_can_overflow (enum tree_code);
5501 extern bool operation_no_trapping_overflow (tree, enum tree_code);
5502 extern tree upper_bound_in_type (tree, tree);
5503 extern tree lower_bound_in_type (tree, tree);
5504 extern bool operand_equal_for_phi_arg_p (const_tree, const_tree);
5505 extern tree create_artificial_label (location_t);
5506 extern const char *get_name (tree);
5507 extern bool stdarg_p (const_tree);
5508 extern bool prototype_p (const_tree);
5509 extern bool auto_var_p (const_tree);
5510 extern bool auto_var_in_fn_p (const_tree, const_tree);
5511 extern tree build_low_bits_mask (tree, unsigned);
5512 extern bool tree_nop_conversion_p (const_tree, const_tree);
5513 extern tree tree_strip_nop_conversions (tree);
5514 extern tree tree_strip_sign_nop_conversions (tree);
5515 extern const_tree strip_invariant_refs (const_tree);
5516 extern tree strip_zero_offset_components (tree);
5517 extern tree lhd_gcc_personality (void);
5518 extern void assign_assembler_name_if_needed (tree);
5519 extern bool warn_deprecated_use (tree, tree);
5520 extern void error_unavailable_use (tree, tree);
5521 extern tree cache_integer_cst (tree, bool might_duplicate = false);
5522 extern const char *combined_fn_name (combined_fn);
5524 /* Returns true if X is a typedef decl. */
5526 inline bool
5527 is_typedef_decl (const_tree x)
5529 return (x && TREE_CODE (x) == TYPE_DECL
5530 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
5533 /* Returns true iff TYPE is a type variant created for a typedef. */
5535 inline bool
5536 typedef_variant_p (const_tree type)
5538 return is_typedef_decl (TYPE_NAME (type));
5541 /* Compare and hash for any structure which begins with a canonical
5542 pointer. Assumes all pointers are interchangeable, which is sort
5543 of already assumed by gcc elsewhere IIRC. */
5545 inline int
5546 struct_ptr_eq (const void *a, const void *b)
5548 const void * const * x = (const void * const *) a;
5549 const void * const * y = (const void * const *) b;
5550 return *x == *y;
5553 inline hashval_t
5554 struct_ptr_hash (const void *a)
5556 const void * const * x = (const void * const *) a;
5557 return (intptr_t)*x >> 4;
5560 /* Return nonzero if CODE is a tree code that represents a truth value. */
5561 inline bool
5562 truth_value_p (enum tree_code code)
5564 return (TREE_CODE_CLASS (code) == tcc_comparison
5565 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5566 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5567 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5570 /* Return whether TYPE is a type suitable for an offset for
5571 a POINTER_PLUS_EXPR. */
5572 inline bool
5573 ptrofftype_p (tree type)
5575 return (INTEGRAL_TYPE_P (type)
5576 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
5577 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
5580 /* Return true if the argument is a complete type or an array
5581 of unknown bound (whose type is incomplete but) whose elements
5582 have complete type. */
5583 inline bool
5584 complete_or_array_type_p (const_tree type)
5586 return COMPLETE_TYPE_P (type)
5587 || (TREE_CODE (type) == ARRAY_TYPE
5588 && COMPLETE_TYPE_P (TREE_TYPE (type)));
5591 /* Return true if the value of T could be represented as a poly_widest_int. */
5593 inline bool
5594 poly_int_tree_p (const_tree t)
5596 return (TREE_CODE (t) == INTEGER_CST || POLY_INT_CST_P (t));
5599 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5600 to be a poly_uint64. (This is always true at the gimple level.) */
5602 inline poly_uint64
5603 bit_field_size (const_tree t)
5605 return tree_to_poly_uint64 (TREE_OPERAND (t, 1));
5608 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5609 known to be a poly_uint64. (This is always true at the gimple level.) */
5611 inline poly_uint64
5612 bit_field_offset (const_tree t)
5614 return tree_to_poly_uint64 (TREE_OPERAND (t, 2));
5617 extern tree strip_float_extensions (tree);
5618 extern bool really_constant_p (const_tree);
5619 extern bool ptrdiff_tree_p (const_tree, poly_int64 *);
5620 extern bool decl_address_invariant_p (const_tree);
5621 extern bool decl_address_ip_invariant_p (const_tree);
5622 extern bool int_fits_type_p (const_tree, const_tree)
5623 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE;
5624 #ifndef GENERATOR_FILE
5625 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5626 #endif
5627 extern bool variably_modified_type_p (tree, tree);
5628 extern int tree_log2 (const_tree);
5629 extern int tree_floor_log2 (const_tree);
5630 extern unsigned int tree_ctz (const_tree);
5631 extern int simple_cst_equal (const_tree, const_tree);
5633 namespace inchash
5636 extern void add_expr (const_tree, hash &, unsigned int = 0);
5640 /* Compat version until all callers are converted. Return hash for
5641 TREE with SEED. */
5642 inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
5644 inchash::hash hstate (seed);
5645 inchash::add_expr (tree, hstate);
5646 return hstate.end ();
5649 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5650 extern bool type_list_equal (const_tree, const_tree);
5651 extern bool chain_member (const_tree, const_tree);
5652 extern void dump_tree_statistics (void);
5653 extern void recompute_tree_invariant_for_addr_expr (tree);
5654 extern bool needs_to_live_in_memory (const_tree);
5655 extern tree reconstruct_complex_type (tree, tree);
5656 extern bool real_onep (const_tree);
5657 extern bool real_minus_onep (const_tree);
5658 extern bool real_maybe_zerop (const_tree);
5659 extern void init_ttree (void);
5660 extern void build_common_tree_nodes (bool);
5661 extern void build_common_builtin_nodes (void);
5662 extern void tree_cc_finalize (void);
5663 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5664 extern tree build_nonstandard_boolean_type (unsigned HOST_WIDE_INT);
5665 extern tree build_bitint_type (unsigned HOST_WIDE_INT, int);
5666 extern tree build_range_type (tree, tree, tree);
5667 extern tree build_nonshared_range_type (tree, tree, tree);
5668 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5669 extern HOST_WIDE_INT int_cst_value (const_tree);
5670 extern tree tree_block (tree);
5671 extern void tree_set_block (tree, tree);
5672 extern location_t *block_nonartificial_location (tree);
5673 extern location_t tree_nonartificial_location (tree);
5674 extern location_t tree_inlined_location (tree, bool = true);
5675 extern tree block_ultimate_origin (const_tree);
5676 extern tree get_binfo_at_offset (tree, poly_int64, tree);
5677 extern bool virtual_method_call_p (const_tree, bool = false);
5678 extern tree obj_type_ref_class (const_tree ref, bool = false);
5679 extern bool types_same_for_odr (const_tree type1, const_tree type2);
5680 extern bool contains_bitfld_component_ref_p (const_tree);
5681 extern bool block_may_fallthru (const_tree);
5682 extern void using_eh_for_cleanups (void);
5683 extern bool using_eh_for_cleanups_p (void);
5684 extern const char *get_tree_code_name (enum tree_code);
5685 extern void set_call_expr_flags (tree, int);
5686 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
5687 walk_tree_lh);
5688 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5689 walk_tree_lh);
5690 #define walk_tree(a,b,c,d) \
5691 walk_tree_1 (a, b, c, d, NULL)
5692 #define walk_tree_without_duplicates(a,b,c) \
5693 walk_tree_without_duplicates_1 (a, b, c, NULL)
5695 extern tree drop_tree_overflow (tree);
5697 /* Given a memory reference expression T, return its base address.
5698 The base address of a memory reference expression is the main
5699 object being referenced. */
5700 extern tree get_base_address (tree t);
5702 /* Return a tree of sizetype representing the size, in bytes, of the element
5703 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5704 extern tree array_ref_element_size (tree);
5706 /* Return a typenode for the "standard" C type with a given name. */
5707 extern tree get_typenode_from_name (const char *);
5709 /* Return a tree representing the upper bound of the array mentioned in
5710 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5711 extern tree array_ref_up_bound (tree);
5713 /* Return a tree representing the lower bound of the array mentioned in
5714 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5715 extern tree array_ref_low_bound (tree);
5717 /* Returns true if REF is an array reference, a component reference,
5718 or a memory reference to an array whose actual size might be larger
5719 than its upper bound implies. */
5720 extern bool array_ref_flexible_size_p (tree, bool * = NULL);
5722 /* Return a tree representing the offset, in bytes, of the field referenced
5723 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5724 extern tree component_ref_field_offset (tree);
5726 /* Describes a "special" array member for a COMPONENT_REF. */
5727 enum struct special_array_member
5729 none, /* Not a special array member. */
5730 int_0, /* Interior array member with zero elements. */
5731 trail_0, /* Trailing array member with zero elements. */
5732 trail_1, /* Trailing array member with one element. */
5733 trail_n, /* Trailing array member with two or more elements. */
5734 int_n /* Interior array member with one or more elements. */
5737 /* Determines the special array member type for a COMPONENT_REF. */
5738 extern special_array_member component_ref_sam_type (tree);
5740 /* Return the size of the member referenced by the COMPONENT_REF, using
5741 its initializer expression if necessary in order to determine the size
5742 of an initialized flexible array member. The size might be zero for
5743 an object with an uninitialized flexible array member or null if it
5744 cannot be determined. */
5745 extern tree component_ref_size (tree, special_array_member * = NULL);
5747 extern int tree_map_base_eq (const void *, const void *);
5748 extern unsigned int tree_map_base_hash (const void *);
5749 extern bool tree_map_base_marked_p (const void *);
5750 extern void DEBUG_FUNCTION verify_type (const_tree t);
5751 extern bool gimple_canonical_types_compatible_p (const_tree, const_tree,
5752 bool trust_type_canonical = true);
5753 extern bool type_with_interoperable_signedness (const_tree);
5754 extern bitmap get_nonnull_args (const_tree);
5755 extern int get_range_pos_neg (tree);
5757 /* Return true for a valid pair of new and delete operators. */
5758 extern bool valid_new_delete_pair_p (tree, tree, bool * = NULL);
5760 /* Return simplified tree code of type that is used for canonical type
5761 merging. */
5762 inline enum tree_code
5763 tree_code_for_canonical_type_merging (enum tree_code code)
5765 /* By C standard, each enumerated type shall be compatible with char,
5766 a signed integer, or an unsigned integer. The choice of type is
5767 implementation defined (in our case it depends on -fshort-enum).
5769 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5770 type and compare only by their signedness and precision. */
5771 if (code == ENUMERAL_TYPE)
5772 return INTEGER_TYPE;
5773 /* To allow inter-operability between languages having references and
5774 C, we consider reference types and pointers alike. Note that this is
5775 not strictly necessary for C-Fortran 2008 interoperability because
5776 Fortran define C_PTR type that needs to be compatible with C pointers
5777 and we handle this one as ptr_type_node. */
5778 if (code == REFERENCE_TYPE)
5779 return POINTER_TYPE;
5780 return code;
5783 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5784 We don't define the types for pointers, arrays and vectors. The reason is
5785 that pointers are handled specially: ptr_type_node accesses conflict with
5786 accesses to all other pointers. This is done by alias.cc.
5787 Because alias sets of arrays and vectors are the same as types of their
5788 elements, we can't compute canonical type either. Otherwise we could go
5789 form void *[10] to int *[10] (because they are equivalent for canonical type
5790 machinery) and get wrong TBAA. */
5792 inline bool
5793 canonical_type_used_p (const_tree t)
5795 return !(POINTER_TYPE_P (t)
5796 || TREE_CODE (t) == ARRAY_TYPE
5797 || TREE_CODE (t) == VECTOR_TYPE);
5800 /* Kinds of access to pass-by-reference arguments to functions. */
5801 enum access_mode
5803 access_none = 0,
5804 access_read_only = 1,
5805 access_write_only = 2,
5806 access_read_write = access_read_only | access_write_only,
5807 access_deferred = 4
5810 #define tree_map_eq tree_map_base_eq
5811 extern unsigned int tree_map_hash (const void *);
5812 #define tree_map_marked_p tree_map_base_marked_p
5814 #define tree_decl_map_eq tree_map_base_eq
5815 extern unsigned int tree_decl_map_hash (const void *);
5816 #define tree_decl_map_marked_p tree_map_base_marked_p
5818 struct tree_decl_map_cache_hasher : ggc_cache_ptr_hash<tree_decl_map>
5820 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
5821 static bool
5822 equal (tree_decl_map *a, tree_decl_map *b)
5824 return tree_decl_map_eq (a, b);
5827 static int
5828 keep_cache_entry (tree_decl_map *&m)
5830 return ggc_marked_p (m->base.from);
5834 #define tree_int_map_eq tree_map_base_eq
5835 #define tree_int_map_hash tree_map_base_hash
5836 #define tree_int_map_marked_p tree_map_base_marked_p
5838 #define tree_vec_map_eq tree_map_base_eq
5839 #define tree_vec_map_hash tree_decl_map_hash
5840 #define tree_vec_map_marked_p tree_map_base_marked_p
5842 struct tree_vec_map_cache_hasher : ggc_cache_ptr_hash<tree_vec_map>
5844 static hashval_t hash (tree_vec_map *m) { return DECL_UID (m->base.from); }
5846 static bool
5847 equal (tree_vec_map *a, tree_vec_map *b)
5849 return a->base.from == b->base.from;
5852 static int
5853 keep_cache_entry (tree_vec_map *&m)
5855 return ggc_marked_p (m->base.from);
5859 /* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
5860 is a better hash than the pointer value and gives a predictable traversal
5861 order. Additionally it can be used across PCH save/restore. */
5862 struct tree_decl_hash : ggc_ptr_hash <tree_node>
5864 static inline hashval_t hash (tree);
5867 inline hashval_t
5868 tree_decl_hash::hash (tree t)
5870 return DECL_UID (t);
5873 /* Similarly for types. Uses TYPE_UID as hash function. */
5874 struct tree_type_hash : ggc_ptr_hash <tree_node>
5876 static inline hashval_t hash (tree);
5879 inline hashval_t
5880 tree_type_hash::hash (tree t)
5882 return TYPE_UID (t);
5885 /* Hash for SSA_NAMEs in the same function. Pointer equality is enough
5886 here, but the SSA_NAME_VERSION is a better hash than the pointer
5887 value and gives a predictable traversal order. */
5888 struct tree_ssa_name_hash : ggc_ptr_hash <tree_node>
5890 static inline hashval_t hash (tree);
5893 inline hashval_t
5894 tree_ssa_name_hash::hash (tree t)
5896 return SSA_NAME_VERSION (t);
5899 /* Hasher for general trees, based on their TREE_HASH. */
5900 struct tree_hash : ggc_ptr_hash <tree_node>
5902 static hashval_t hash (tree);
5905 inline hashval_t
5906 tree_hash::hash (tree t)
5908 return TREE_HASH (t);
5911 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5912 such a map will not mark keys, and will mark values if the key is already
5913 marked. */
5914 struct tree_cache_traits
5915 : simple_cache_map_traits<default_hash_traits<tree>, tree> { };
5916 typedef hash_map<tree,tree,tree_cache_traits> tree_cache_map;
5918 /* Similarly, but use DECL_UID as hash function rather than pointer hashing.
5919 This is for hash_maps from decls to trees that need to work across PCH. */
5920 struct decl_tree_cache_traits
5921 : simple_cache_map_traits<tree_decl_hash, tree> { };
5922 typedef hash_map<tree,tree,decl_tree_cache_traits> decl_tree_cache_map;
5924 /* Similarly, but use TYPE_UID as hash function rather than pointer hashing.
5925 This is for hash_maps from types to trees that need to work across PCH. */
5926 struct type_tree_cache_traits
5927 : simple_cache_map_traits<tree_type_hash, tree> { };
5928 typedef hash_map<tree,tree,type_tree_cache_traits> type_tree_cache_map;
5930 /* Similarly to decl_tree_cache_map, but without caching. */
5931 struct decl_tree_traits
5932 : simple_hashmap_traits<tree_decl_hash, tree> { };
5933 typedef hash_map<tree,tree,decl_tree_traits> decl_tree_map;
5935 /* Initialize the abstract argument list iterator object ITER with the
5936 arguments from CALL_EXPR node EXP. */
5937 inline void
5938 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5940 iter->t = exp;
5941 iter->n = call_expr_nargs (exp);
5942 iter->i = 0;
5945 inline void
5946 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5948 iter->t = exp;
5949 iter->n = call_expr_nargs (exp);
5950 iter->i = 0;
5953 /* Return the next argument from abstract argument list iterator object ITER,
5954 and advance its state. Return NULL_TREE if there are no more arguments. */
5955 inline tree
5956 next_call_expr_arg (call_expr_arg_iterator *iter)
5958 tree result;
5959 if (iter->i >= iter->n)
5960 return NULL_TREE;
5961 result = CALL_EXPR_ARG (iter->t, iter->i);
5962 iter->i++;
5963 return result;
5966 inline const_tree
5967 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5969 const_tree result;
5970 if (iter->i >= iter->n)
5971 return NULL_TREE;
5972 result = CALL_EXPR_ARG (iter->t, iter->i);
5973 iter->i++;
5974 return result;
5977 /* Initialize the abstract argument list iterator object ITER, then advance
5978 past and return the first argument. Useful in for expressions, e.g.
5979 for (arg = first_call_expr_arg (exp, &iter); arg;
5980 arg = next_call_expr_arg (&iter)) */
5981 inline tree
5982 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5984 init_call_expr_arg_iterator (exp, iter);
5985 return next_call_expr_arg (iter);
5988 inline const_tree
5989 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5991 init_const_call_expr_arg_iterator (exp, iter);
5992 return next_const_call_expr_arg (iter);
5995 /* Test whether there are more arguments in abstract argument list iterator
5996 ITER, without changing its state. */
5997 inline bool
5998 more_call_expr_args_p (const call_expr_arg_iterator *iter)
6000 return (iter->i < iter->n);
6003 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6004 (of type call_expr_arg_iterator) to hold the iteration state. */
6005 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6006 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6007 (arg) = next_call_expr_arg (&(iter)))
6009 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6010 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6011 (arg) = next_const_call_expr_arg (&(iter)))
6013 /* Return true if tree node T is a language-specific node. */
6014 inline bool
6015 is_lang_specific (const_tree t)
6017 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
6020 /* Valid builtin number. */
6021 #define BUILTIN_VALID_P(FNCODE) \
6022 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6024 /* Obtain a pointer to the identifier string holding the asm name for
6025 BUILTIN, a BUILT_IN code. This is handy if the target
6026 mangles/overrides the function name that implements the
6027 builtin. */
6028 #define BUILTIN_ASM_NAME_PTR(BUILTIN) \
6029 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (builtin_decl_explicit (BUILTIN))))
6031 /* Return the tree node for an explicit standard builtin function or NULL. */
6032 inline tree
6033 builtin_decl_explicit (enum built_in_function fncode)
6035 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6037 return builtin_info[(size_t)fncode].decl;
6040 /* Return the tree node for an implicit builtin function or NULL. */
6041 inline tree
6042 builtin_decl_implicit (enum built_in_function fncode)
6044 size_t uns_fncode = (size_t)fncode;
6045 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6047 if (!builtin_info[uns_fncode].implicit_p)
6048 return NULL_TREE;
6050 return builtin_info[uns_fncode].decl;
6053 /* For BUILTIN_UNREACHABLE, use one of these or
6054 gimple_build_builtin_unreachable instead of one of the above. */
6055 extern tree builtin_decl_unreachable ();
6056 extern tree build_builtin_unreachable (location_t);
6058 /* Set explicit builtin function nodes and whether it is an implicit
6059 function. */
6061 inline void
6062 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
6064 size_t ufncode = (size_t)fncode;
6066 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6067 && (decl != NULL_TREE || !implicit_p));
6069 builtin_info[ufncode].decl = decl;
6070 builtin_info[ufncode].implicit_p = implicit_p;
6071 builtin_info[ufncode].declared_p = false;
6074 /* Set the implicit flag for a builtin function. */
6076 inline void
6077 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
6079 size_t uns_fncode = (size_t)fncode;
6081 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6082 && builtin_info[uns_fncode].decl != NULL_TREE);
6084 builtin_info[uns_fncode].implicit_p = implicit_p;
6087 /* Set the declared flag for a builtin function. */
6089 inline void
6090 set_builtin_decl_declared_p (enum built_in_function fncode, bool declared_p)
6092 size_t uns_fncode = (size_t)fncode;
6094 gcc_checking_assert (BUILTIN_VALID_P (fncode)
6095 && builtin_info[uns_fncode].decl != NULL_TREE);
6097 builtin_info[uns_fncode].declared_p = declared_p;
6100 /* Return whether the standard builtin function can be used as an explicit
6101 function. */
6103 inline bool
6104 builtin_decl_explicit_p (enum built_in_function fncode)
6106 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6107 return (builtin_info[(size_t)fncode].decl != NULL_TREE);
6110 /* Return whether the standard builtin function can be used implicitly. */
6112 inline bool
6113 builtin_decl_implicit_p (enum built_in_function fncode)
6115 size_t uns_fncode = (size_t)fncode;
6117 gcc_checking_assert (BUILTIN_VALID_P (fncode));
6118 return (builtin_info[uns_fncode].decl != NULL_TREE
6119 && builtin_info[uns_fncode].implicit_p);
6122 /* Return whether the standard builtin function was declared. */
6124 inline bool
6125 builtin_decl_declared_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].declared_p);
6134 /* Determine if the function identified by FNDECL is one that
6135 makes sense to match by name, for those places where we detect
6136 "magic" functions by name.
6138 Return true if FNDECL has a name and is an extern fndecl at file scope.
6139 FNDECL must be a non-NULL decl.
6141 Avoid using this, as it's generally better to use attributes rather
6142 than to check for functions by name. */
6144 inline bool
6145 maybe_special_function_p (const_tree fndecl)
6147 tree name_decl = DECL_NAME (fndecl);
6148 if (name_decl
6149 /* Exclude functions not at the file scope, or not `extern',
6150 since they are not the magic functions we would otherwise
6151 think they are. */
6152 && (DECL_CONTEXT (fndecl) == NULL_TREE
6153 || TREE_CODE (DECL_CONTEXT (fndecl)) == TRANSLATION_UNIT_DECL)
6154 && TREE_PUBLIC (fndecl))
6155 return true;
6156 return false;
6159 /* Return true if T (assumed to be a DECL) is a global variable.
6160 A variable is considered global if its storage is not automatic. */
6162 inline bool
6163 is_global_var (const_tree t)
6165 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
6168 /* Return true if VAR may be aliased. A variable is considered as
6169 maybe aliased if it has its address taken by the local TU
6170 or possibly by another TU and might be modified through a pointer. */
6172 inline bool
6173 may_be_aliased (const_tree var)
6175 return (TREE_CODE (var) != CONST_DECL
6176 && (TREE_PUBLIC (var)
6177 || DECL_EXTERNAL (var)
6178 || TREE_ADDRESSABLE (var))
6179 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
6180 && (TREE_READONLY (var)
6181 || (TREE_CODE (var) == VAR_DECL
6182 && DECL_NONALIASED (var)))));
6185 /* Return pointer to optimization flags of FNDECL. */
6186 inline struct cl_optimization *
6187 opts_for_fn (const_tree fndecl)
6189 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
6190 if (fn_opts == NULL_TREE)
6191 fn_opts = optimization_default_node;
6192 return TREE_OPTIMIZATION (fn_opts);
6195 /* Return pointer to target flags of FNDECL. */
6196 inline cl_target_option *
6197 target_opts_for_fn (const_tree fndecl)
6199 tree fn_opts = DECL_FUNCTION_SPECIFIC_TARGET (fndecl);
6200 if (fn_opts == NULL_TREE)
6201 fn_opts = target_option_default_node;
6202 return fn_opts == NULL_TREE ? NULL : TREE_TARGET_OPTION (fn_opts);
6205 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
6206 the optimization level of function fndecl. */
6207 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
6209 /* For anonymous aggregate types, we need some sort of name to
6210 hold on to. In practice, this should not appear, but it should
6211 not be harmful if it does. Identifiers returned will be
6212 IDENTIFIER_ANON_P. */
6213 extern tree make_anon_name ();
6215 /* The tree and const_tree overload templates. */
6216 namespace wi
6218 class unextended_tree
6220 private:
6221 const_tree m_t;
6223 public:
6224 unextended_tree () {}
6225 unextended_tree (const_tree t) : m_t (t) {}
6227 unsigned int get_precision () const;
6228 const HOST_WIDE_INT *get_val () const;
6229 unsigned int get_len () const;
6230 const_tree get_tree () const { return m_t; }
6233 template <>
6234 struct int_traits <unextended_tree>
6236 static const enum precision_type precision_type = VAR_PRECISION;
6237 static const bool host_dependent_precision = false;
6238 static const bool is_sign_extended = false;
6239 static const bool needs_write_val_arg = false;
6242 template <int N>
6243 class extended_tree
6245 private:
6246 const_tree m_t;
6248 public:
6249 extended_tree () {}
6250 extended_tree (const_tree);
6252 unsigned int get_precision () const;
6253 const HOST_WIDE_INT *get_val () const;
6254 unsigned int get_len () const;
6255 const_tree get_tree () const { return m_t; }
6258 template <int N>
6259 struct int_traits <extended_tree <N> >
6261 static const enum precision_type precision_type
6262 = N == ADDR_MAX_PRECISION ? INL_CONST_PRECISION : CONST_PRECISION;
6263 static const bool host_dependent_precision = false;
6264 static const bool is_sign_extended = true;
6265 static const bool needs_write_val_arg = false;
6266 static const unsigned int precision = N;
6269 typedef extended_tree <WIDEST_INT_MAX_PRECISION> widest_extended_tree;
6270 typedef extended_tree <ADDR_MAX_PRECISION> offset_extended_tree;
6272 typedef const generic_wide_int <widest_extended_tree> tree_to_widest_ref;
6273 typedef const generic_wide_int <offset_extended_tree> tree_to_offset_ref;
6274 typedef const generic_wide_int<wide_int_ref_storage<false, false> >
6275 tree_to_wide_ref;
6277 tree_to_widest_ref to_widest (const_tree);
6278 tree_to_offset_ref to_offset (const_tree);
6279 tree_to_wide_ref to_wide (const_tree);
6280 wide_int to_wide (const_tree, unsigned int);
6282 typedef const poly_int <NUM_POLY_INT_COEFFS,
6283 generic_wide_int <widest_extended_tree> >
6284 tree_to_poly_widest_ref;
6285 typedef const poly_int <NUM_POLY_INT_COEFFS,
6286 generic_wide_int <offset_extended_tree> >
6287 tree_to_poly_offset_ref;
6288 typedef const poly_int <NUM_POLY_INT_COEFFS,
6289 generic_wide_int <unextended_tree> >
6290 tree_to_poly_wide_ref;
6292 tree_to_poly_widest_ref to_poly_widest (const_tree);
6293 tree_to_poly_offset_ref to_poly_offset (const_tree);
6294 tree_to_poly_wide_ref to_poly_wide (const_tree);
6296 template <int N>
6297 struct ints_for <generic_wide_int <extended_tree <N> >, INL_CONST_PRECISION>
6299 typedef generic_wide_int <extended_tree <N> > extended;
6300 static extended zero (const extended &);
6303 template <int N>
6304 struct ints_for <generic_wide_int <extended_tree <N> >, CONST_PRECISION>
6306 typedef generic_wide_int <extended_tree <N> > extended;
6307 static extended zero (const extended &);
6310 template <>
6311 struct ints_for <generic_wide_int <unextended_tree>, VAR_PRECISION>
6313 typedef generic_wide_int <unextended_tree> unextended;
6314 static unextended zero (const unextended &);
6318 /* Used to convert a tree to a widest2_int like this:
6319 widest2_int foo = widest2_int_cst (some_tree). */
6320 typedef generic_wide_int <wi::extended_tree <WIDEST_INT_MAX_PRECISION * 2> >
6321 widest2_int_cst;
6323 /* Refer to INTEGER_CST T as though it were a widest_int.
6325 This function gives T's actual numerical value, influenced by the
6326 signedness of its type. For example, a signed byte with just the
6327 top bit set would be -128 while an unsigned byte with the same
6328 bit pattern would be 128.
6330 This is the right choice when operating on groups of INTEGER_CSTs
6331 that might have different signedness or precision. It is also the
6332 right choice in code that specifically needs an approximation of
6333 infinite-precision arithmetic instead of normal modulo arithmetic.
6335 The approximation of infinite precision is good enough for realistic
6336 numbers of additions and subtractions of INTEGER_CSTs (where
6337 "realistic" includes any number less than 1 << 31) but it cannot
6338 represent the result of multiplying the two largest supported
6339 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
6340 of multiplying two arbitrary INTEGER_CSTs and checking that the
6341 result is representable as a widest_int.
6343 Note that any overflow checking done on these values is relative to
6344 the range of widest_int rather than the range of a TREE_TYPE.
6346 Calling this function should have no overhead in release builds,
6347 so it is OK to call it several times for the same tree. If it is
6348 useful for readability reasons to reduce the number of calls,
6349 it is more efficient to use:
6351 wi::tree_to_widest_ref wt = wi::to_widest (t);
6353 instead of:
6355 widest_int wt = wi::to_widest (t). */
6357 inline wi::tree_to_widest_ref
6358 wi::to_widest (const_tree t)
6360 return t;
6363 /* Refer to INTEGER_CST T as though it were an offset_int.
6365 This function is an optimisation of wi::to_widest for cases
6366 in which T is known to be a bit or byte count in the range
6367 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
6368 the target's address size in bits.
6370 This is the right choice when operating on bit or byte counts as
6371 untyped numbers rather than M-bit values. The wi::to_widest comments
6372 about addition, subtraction and multiplication apply here: sequences
6373 of 1 << 31 additions and subtractions do not induce overflow, but
6374 multiplying the largest sizes might. Again,
6376 wi::tree_to_offset_ref wt = wi::to_offset (t);
6378 is more efficient than:
6380 offset_int wt = wi::to_offset (t). */
6382 inline wi::tree_to_offset_ref
6383 wi::to_offset (const_tree t)
6385 return t;
6388 /* Refer to INTEGER_CST T as though it were a wide_int.
6390 In contrast to the approximation of infinite-precision numbers given
6391 by wi::to_widest and wi::to_offset, this function treats T as a
6392 signless collection of N bits, where N is the precision of T's type.
6393 As with machine registers, signedness is determined by the operation
6394 rather than the operands; for example, there is a distinction between
6395 signed and unsigned division.
6397 This is the right choice when operating on values with the same type
6398 using normal modulo arithmetic. The overflow-checking forms of things
6399 like wi::add check whether the result can be represented in T's type.
6401 Calling this function should have no overhead in release builds,
6402 so it is OK to call it several times for the same tree. If it is
6403 useful for readability reasons to reduce the number of calls,
6404 it is more efficient to use:
6406 wi::tree_to_wide_ref wt = wi::to_wide (t);
6408 instead of:
6410 wide_int wt = wi::to_wide (t). */
6412 inline wi::tree_to_wide_ref
6413 wi::to_wide (const_tree t)
6415 return wi::storage_ref (&TREE_INT_CST_ELT (t, 0), TREE_INT_CST_NUNITS (t),
6416 TYPE_PRECISION (TREE_TYPE (t)));
6419 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
6420 truncating as necessary. When extending, use sign extension if T's
6421 type is signed and zero extension if T's type is unsigned. */
6423 inline wide_int
6424 wi::to_wide (const_tree t, unsigned int prec)
6426 return wide_int::from (wi::to_wide (t), prec, TYPE_SIGN (TREE_TYPE (t)));
6429 template <int N>
6430 inline wi::extended_tree <N>::extended_tree (const_tree t)
6431 : m_t (t)
6433 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
6436 template <int N>
6437 inline unsigned int
6438 wi::extended_tree <N>::get_precision () const
6440 return N;
6443 template <int N>
6444 inline const HOST_WIDE_INT *
6445 wi::extended_tree <N>::get_val () const
6447 return &TREE_INT_CST_ELT (m_t, 0);
6450 template <int N>
6451 inline unsigned int
6452 wi::extended_tree <N>::get_len () const
6454 if (N == ADDR_MAX_PRECISION)
6456 /* to_offset can only be applied to trees that are offset_int-sized
6457 or smaller. EXT_LEN is correct if it fits, otherwise the constant
6458 must be exactly the precision of offset_int and so LEN is correct. */
6459 unsigned int ext_len = TREE_INT_CST_EXT_NUNITS (m_t);
6460 if (ext_len <= OFFSET_INT_ELTS)
6461 return ext_len;
6462 return TREE_INT_CST_NUNITS (m_t);
6464 else if (N >= WIDEST_INT_MAX_PRECISION)
6465 return TREE_INT_CST_EXT_NUNITS (m_t);
6466 else
6467 /* This class is designed to be used for specific output precisions
6468 and needs to be as fast as possible, so there is no fallback for
6469 other casees. */
6470 gcc_unreachable ();
6473 inline unsigned int
6474 wi::unextended_tree::get_precision () const
6476 return TYPE_PRECISION (TREE_TYPE (m_t));
6479 inline const HOST_WIDE_INT *
6480 wi::unextended_tree::get_val () const
6482 return &TREE_INT_CST_ELT (m_t, 0);
6485 inline unsigned int
6486 wi::unextended_tree::get_len () const
6488 return TREE_INT_CST_NUNITS (m_t);
6491 /* Return the value of a POLY_INT_CST in its native precision. */
6493 inline wi::tree_to_poly_wide_ref
6494 poly_int_cst_value (const_tree x)
6496 poly_int <NUM_POLY_INT_COEFFS, generic_wide_int <wi::unextended_tree> > res;
6497 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6498 res.coeffs[i] = POLY_INT_CST_COEFF (x, i);
6499 return res;
6502 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6503 poly_widest_int. See wi::to_widest for more details. */
6505 inline wi::tree_to_poly_widest_ref
6506 wi::to_poly_widest (const_tree t)
6508 if (POLY_INT_CST_P (t))
6510 poly_int <NUM_POLY_INT_COEFFS,
6511 generic_wide_int <widest_extended_tree> > res;
6512 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6513 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6514 return res;
6516 return t;
6519 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6520 poly_offset_int. See wi::to_offset for more details. */
6522 inline wi::tree_to_poly_offset_ref
6523 wi::to_poly_offset (const_tree t)
6525 if (POLY_INT_CST_P (t))
6527 poly_int <NUM_POLY_INT_COEFFS,
6528 generic_wide_int <offset_extended_tree> > res;
6529 for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i)
6530 res.coeffs[i] = POLY_INT_CST_COEFF (t, i);
6531 return res;
6533 return t;
6536 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
6537 poly_wide_int. See wi::to_wide for more details. */
6539 inline wi::tree_to_poly_wide_ref
6540 wi::to_poly_wide (const_tree t)
6542 if (POLY_INT_CST_P (t))
6543 return poly_int_cst_value (t);
6544 return t;
6547 template <int N>
6548 inline generic_wide_int <wi::extended_tree <N> >
6549 wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6550 wi::INL_CONST_PRECISION>::zero (const extended &x)
6552 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6555 template <int N>
6556 inline generic_wide_int <wi::extended_tree <N> >
6557 wi::ints_for <generic_wide_int <wi::extended_tree <N> >,
6558 wi::CONST_PRECISION>::zero (const extended &x)
6560 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6563 inline generic_wide_int <wi::unextended_tree>
6564 wi::ints_for <generic_wide_int <wi::unextended_tree>,
6565 wi::VAR_PRECISION>::zero (const unextended &x)
6567 return build_zero_cst (TREE_TYPE (x.get_tree ()));
6570 namespace wi
6572 template <typename T>
6573 bool fits_to_boolean_p (const T &x, const_tree);
6575 template <typename T>
6576 bool fits_to_tree_p (const T &x, const_tree);
6578 wide_int min_value (const_tree);
6579 wide_int max_value (const_tree);
6580 #ifndef GENERATOR_FILE
6581 wide_int from_mpz (const_tree, mpz_t, bool);
6582 #endif
6585 template <typename T>
6586 bool
6587 wi::fits_to_boolean_p (const T &x, const_tree type)
6589 typedef typename poly_int_traits<T>::int_type int_type;
6590 return (known_eq (x, int_type (0))
6591 || known_eq (x, int_type (TYPE_UNSIGNED (type) ? 1 : -1)));
6594 template <typename T>
6595 bool
6596 wi::fits_to_tree_p (const T &x, const_tree type)
6598 /* Non-standard boolean types can have arbitrary precision but various
6599 transformations assume that they can only take values 0 and +/-1. */
6600 if (TREE_CODE (type) == BOOLEAN_TYPE)
6601 return fits_to_boolean_p (x, type);
6603 if (TYPE_UNSIGNED (type))
6604 return known_eq (x, zext (x, TYPE_PRECISION (type)));
6605 else
6606 return known_eq (x, sext (x, TYPE_PRECISION (type)));
6609 /* Produce the smallest number that is represented in TYPE. The precision
6610 and sign are taken from TYPE. */
6611 inline wide_int
6612 wi::min_value (const_tree type)
6614 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6617 /* Produce the largest number that is represented in TYPE. The precision
6618 and sign are taken from TYPE. */
6619 inline wide_int
6620 wi::max_value (const_tree type)
6622 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
6625 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
6626 extending both according to their respective TYPE_SIGNs. */
6628 inline bool
6629 tree_int_cst_lt (const_tree t1, const_tree t2)
6631 return wi::to_widest (t1) < wi::to_widest (t2);
6634 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
6635 extending both according to their respective TYPE_SIGNs. */
6637 inline bool
6638 tree_int_cst_le (const_tree t1, const_tree t2)
6640 return wi::to_widest (t1) <= wi::to_widest (t2);
6643 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
6644 are both INTEGER_CSTs and their values are extended according to their
6645 respective TYPE_SIGNs. */
6647 inline int
6648 tree_int_cst_compare (const_tree t1, const_tree t2)
6650 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
6653 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
6654 but none of these files are allowed to be included from front ends.
6655 They should be split in two. One suitable for the FEs, the other suitable
6656 for the BE. */
6658 /* Assign the RTX to declaration. */
6659 extern void set_decl_rtl (tree, rtx);
6660 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
6662 /* Given an expression EXP that is a handled_component_p,
6663 look for the ultimate containing object, which is returned and specify
6664 the access position and size. */
6665 extern tree get_inner_reference (tree, poly_int64 *, poly_int64 *,
6666 tree *, machine_mode *, int *, int *, int *);
6668 extern tree build_personality_function (const char *);
6670 struct GTY(()) int_n_trees_t {
6671 /* These parts are initialized at runtime */
6672 tree signed_type;
6673 tree unsigned_type;
6676 /* This is also in machmode.h */
6677 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
6678 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
6680 /* Like bit_position, but return as an integer. It must be representable in
6681 that way (since it could be a signed value, we don't have the
6682 option of returning -1 like int_size_in_byte can. */
6684 inline HOST_WIDE_INT
6685 int_bit_position (const_tree field)
6687 return ((wi::to_offset (DECL_FIELD_OFFSET (field)) << LOG2_BITS_PER_UNIT)
6688 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
6691 /* Return true if it makes sense to consider alias set for a type T. */
6693 inline bool
6694 type_with_alias_set_p (const_tree t)
6696 /* Function and method types are never accessed as memory locations. */
6697 if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
6698 return false;
6700 if (COMPLETE_TYPE_P (t))
6701 return true;
6703 /* Incomplete types cannot be accessed in general except for arrays
6704 where we can fetch its element despite we have no array bounds. */
6705 if (TREE_CODE (t) == ARRAY_TYPE && COMPLETE_TYPE_P (TREE_TYPE (t)))
6706 return true;
6708 return false;
6711 extern location_t set_block (location_t loc, tree block);
6713 extern void gt_ggc_mx (tree &);
6714 extern void gt_pch_nx (tree &);
6715 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
6717 extern bool nonnull_arg_p (const_tree);
6718 extern bool is_empty_type (const_tree);
6719 extern bool default_is_empty_record (const_tree);
6720 extern bool flexible_array_type_p (const_tree);
6721 extern HOST_WIDE_INT arg_int_size_in_bytes (const_tree);
6722 extern tree arg_size_in_bytes (const_tree);
6723 extern bool expr_type_first_operand_type_p (tree_code);
6725 extern location_t
6726 set_source_range (tree expr, location_t start, location_t finish);
6728 extern location_t
6729 set_source_range (tree expr, source_range src_range);
6731 /* Return true if it makes sense to promote/demote from_type to to_type. */
6732 inline bool
6733 desired_pro_or_demotion_p (const_tree to_type, const_tree from_type)
6735 unsigned int to_type_precision = TYPE_PRECISION (to_type);
6737 /* OK to promote if to_type is no bigger than word_mode. */
6738 if (to_type_precision <= GET_MODE_PRECISION (word_mode))
6739 return true;
6741 /* Otherwise, allow only if narrowing or same precision conversions. */
6742 return to_type_precision <= TYPE_PRECISION (from_type);
6745 /* Pointer type used to declare builtins before we have seen its real
6746 declaration. */
6747 class builtin_structptr_type
6749 public:
6750 tree& node;
6751 tree& base;
6752 const char *str;
6754 extern const builtin_structptr_type builtin_structptr_types[6];
6756 /* Return true if type T has the same precision as its underlying mode. */
6758 inline bool
6759 type_has_mode_precision_p (const_tree t)
6761 return known_eq (TYPE_PRECISION (t), GET_MODE_PRECISION (TYPE_MODE (t)));
6764 /* Helper functions for fndecl_built_in_p. */
6766 inline bool
6767 built_in_function_equal_p (built_in_function name0, built_in_function name1)
6769 return name0 == name1;
6772 /* Recursive case for two or more names. */
6774 template <typename... F>
6775 inline bool
6776 built_in_function_equal_p (built_in_function name0, built_in_function name1,
6777 built_in_function name2, F... names)
6779 return name0 == name1 || built_in_function_equal_p (name0, name2, names...);
6782 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6784 Note that it is different from the DECL_IS_UNDECLARED_BUILTIN
6785 accessor, as this is impervious to user declaration. */
6787 inline bool
6788 fndecl_built_in_p (const_tree node)
6790 return DECL_BUILT_IN_CLASS (node) != NOT_BUILT_IN;
6793 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6794 of class KLASS. */
6796 inline bool
6797 fndecl_built_in_p (const_tree node, built_in_class klass)
6799 return fndecl_built_in_p (node) && DECL_BUILT_IN_CLASS (node) == klass;
6802 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6803 of class KLASS with name equal to NAME. */
6805 inline bool
6806 fndecl_built_in_p (const_tree node, unsigned int name, built_in_class klass)
6808 return (fndecl_built_in_p (node, klass)
6809 && DECL_UNCHECKED_FUNCTION_CODE (node) == name);
6812 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6813 of BUILT_IN_NORMAL class with name equal to NAME1 (or other mentioned
6814 NAMES). */
6816 template <typename... F>
6817 inline bool
6818 fndecl_built_in_p (const_tree node, built_in_function name1, F... names)
6820 return (fndecl_built_in_p (node, BUILT_IN_NORMAL)
6821 && built_in_function_equal_p (DECL_FUNCTION_CODE (node),
6822 name1, names...));
6825 /* A struct for encapsulating location information about an operator
6826 and the operation built from it.
6828 m_operator_loc is the location of the operator
6829 m_combined_loc is the location of the compound expression.
6831 For example, given "a && b" the, operator location is:
6832 a && b
6834 and the combined location is:
6835 a && b
6836 ~~^~~~
6837 Capturing this information allows for class binary_op_rich_location
6838 to provide detailed information about e.g. type mismatches in binary
6839 operations where enough location information is available:
6841 arg_0 op arg_1
6842 ~~~~~ ^~ ~~~~~
6844 | arg1 type
6845 arg0 type
6847 falling back to just showing the combined location:
6849 arg_0 op arg_1
6850 ~~~~~~^~~~~~~~
6852 where it is not. */
6854 class op_location_t
6856 public:
6857 location_t m_operator_loc;
6858 location_t m_combined_loc;
6860 /* 1-argument ctor, for constructing from a combined location. */
6861 op_location_t (location_t combined_loc)
6862 : m_operator_loc (UNKNOWN_LOCATION), m_combined_loc (combined_loc)
6865 /* 2-argument ctor, for distinguishing between the operator's location
6866 and the combined location. */
6867 op_location_t (location_t operator_loc, location_t combined_loc)
6868 : m_operator_loc (operator_loc), m_combined_loc (combined_loc)
6871 /* Implicitly convert back to a location_t, using the combined location. */
6872 operator location_t () const { return m_combined_loc; }
6875 /* Code that doesn't refer to any warning. Has no effect on suppression
6876 functions. */
6877 constexpr opt_code no_warning = opt_code ();
6878 /* Wildcard code that refers to all warnings. */
6879 constexpr opt_code all_warnings = N_OPTS;
6881 /* Return the disposition for a warning (or all warnings by default)
6882 at a location. */
6883 extern bool warning_suppressed_at (location_t, opt_code = all_warnings);
6884 /* Set the disposition for a warning (or all warnings by default)
6885 at a location to disabled by default. */
6886 extern bool suppress_warning_at (location_t, opt_code = all_warnings,
6887 bool = true);
6888 /* Copy warning disposition from one location to another. */
6889 extern void copy_warning (location_t, location_t);
6891 /* Return the disposition for a warning (or all warnings by default)
6892 for an expression. */
6893 extern bool warning_suppressed_p (const_tree, opt_code = all_warnings);
6894 /* Set the disposition for a warning (or all warnings by default)
6895 at a location to disabled by default. */
6896 extern void suppress_warning (tree, opt_code = all_warnings, bool = true)
6897 ATTRIBUTE_NONNULL (1);
6898 /* Copy warning disposition from one expression to another. */
6899 extern void copy_warning (tree, const_tree);
6901 /* Return the zero-based number corresponding to the argument being
6902 deallocated if FNDECL is a deallocation function or an out-of-bounds
6903 value if it isn't. */
6904 extern unsigned fndecl_dealloc_argno (tree);
6906 /* If an expression refers to a character array or pointer declared
6907 attribute nonstring, return a decl for that array or pointer and
6908 if nonnull, set the second argument to the referenced enclosing
6909 object or pointer. Otherwise return null. */
6910 extern tree get_attr_nonstring_decl (tree, tree * = NULL);
6912 extern int get_target_clone_attr_len (tree);
6914 #endif /* GCC_TREE_H */