1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
25 /* Convert a target-independent built-in function code to a combined_fn. */
28 as_combined_fn (built_in_function fn
)
30 return combined_fn (int (fn
));
33 /* Convert an internal function code to a combined_fn. */
36 as_combined_fn (internal_fn fn
)
38 return combined_fn (int (fn
) + int (END_BUILTINS
));
41 /* Return true if CODE is a target-independent built-in function. */
44 builtin_fn_p (combined_fn code
)
46 return int (code
) < int (END_BUILTINS
);
49 /* Return the target-independent built-in function represented by CODE.
50 Only valid if builtin_fn_p (CODE). */
52 inline built_in_function
53 as_builtin_fn (combined_fn code
)
55 gcc_checking_assert (builtin_fn_p (code
));
56 return built_in_function (int (code
));
59 /* Return true if CODE is an internal function. */
62 internal_fn_p (combined_fn code
)
64 return int (code
) >= int (END_BUILTINS
);
67 /* Return the internal function represented by CODE. Only valid if
68 internal_fn_p (CODE). */
71 as_internal_fn (combined_fn code
)
73 gcc_checking_assert (internal_fn_p (code
));
74 return internal_fn (int (code
) - int (END_BUILTINS
));
77 /* Macros for initializing `tree_contains_struct'. */
78 #define MARK_TS_BASE(C) \
79 (tree_contains_struct[C][TS_BASE] = true)
81 #define MARK_TS_TYPED(C) \
83 tree_contains_struct[C][TS_TYPED] = true)
85 #define MARK_TS_COMMON(C) \
87 tree_contains_struct[C][TS_COMMON] = true)
89 #define MARK_TS_TYPE_COMMON(C) \
90 (MARK_TS_COMMON (C), \
91 tree_contains_struct[C][TS_TYPE_COMMON] = true)
93 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
94 (MARK_TS_TYPE_COMMON (C), \
95 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = true)
97 #define MARK_TS_DECL_MINIMAL(C) \
98 (MARK_TS_COMMON (C), \
99 tree_contains_struct[C][TS_DECL_MINIMAL] = true)
101 #define MARK_TS_DECL_COMMON(C) \
102 (MARK_TS_DECL_MINIMAL (C), \
103 tree_contains_struct[C][TS_DECL_COMMON] = true)
105 #define MARK_TS_DECL_WRTL(C) \
106 (MARK_TS_DECL_COMMON (C), \
107 tree_contains_struct[C][TS_DECL_WRTL] = true)
109 #define MARK_TS_DECL_WITH_VIS(C) \
110 (MARK_TS_DECL_WRTL (C), \
111 tree_contains_struct[C][TS_DECL_WITH_VIS] = true)
113 #define MARK_TS_DECL_NON_COMMON(C) \
114 (MARK_TS_DECL_WITH_VIS (C), \
115 tree_contains_struct[C][TS_DECL_NON_COMMON] = true)
117 #define MARK_TS_EXP(C) \
118 (MARK_TS_TYPED (C), \
119 tree_contains_struct[C][TS_EXP] = true)
121 /* Returns the string representing CLASS. */
123 #define TREE_CODE_CLASS_STRING(CLASS)\
124 tree_code_class_strings[(int) (CLASS)]
126 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
128 /* Nonzero if NODE represents an exceptional code. */
130 #define EXCEPTIONAL_CLASS_P(NODE)\
131 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
133 /* Nonzero if NODE represents a constant. */
135 #define CONSTANT_CLASS_P(NODE)\
136 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
138 /* Nonzero if NODE represents a constant, or is a location wrapper
139 around such a node. */
141 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\
142 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
144 /* Nonzero if NODE represents a type. */
146 #define TYPE_P(NODE)\
147 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
149 /* Nonzero if NODE represents a declaration. */
151 #define DECL_P(NODE)\
152 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
154 /* True if NODE designates a variable declaration. */
155 #define VAR_P(NODE) \
156 (TREE_CODE (NODE) == VAR_DECL)
158 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
160 #define VAR_OR_FUNCTION_DECL_P(DECL)\
161 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
163 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
164 ascending code order. */
166 #define INDIRECT_REF_P(NODE)\
167 (TREE_CODE (NODE) == INDIRECT_REF)
169 /* Nonzero if NODE represents a reference. */
171 #define REFERENCE_CLASS_P(NODE)\
172 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
174 /* Nonzero if NODE represents a comparison. */
176 #define COMPARISON_CLASS_P(NODE)\
177 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
179 /* Nonzero if NODE represents a unary arithmetic expression. */
181 #define UNARY_CLASS_P(NODE)\
182 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
184 /* Nonzero if NODE represents a binary arithmetic expression. */
186 #define BINARY_CLASS_P(NODE)\
187 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
189 /* Nonzero if NODE represents a statement expression. */
191 #define STATEMENT_CLASS_P(NODE)\
192 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
194 /* Nonzero if NODE represents a function call-like expression with a
195 variable-length operand vector. */
197 #define VL_EXP_CLASS_P(NODE)\
198 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
200 /* Nonzero if NODE represents any other expression. */
202 #define EXPRESSION_CLASS_P(NODE)\
203 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
205 /* Returns nonzero iff NODE represents a type or declaration. */
207 #define IS_TYPE_OR_DECL_P(NODE)\
208 (TYPE_P (NODE) || DECL_P (NODE))
210 /* Returns nonzero iff CLASS is the tree-code class of an
213 #define IS_EXPR_CODE_CLASS(CLASS)\
214 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
216 /* Returns nonzero iff NODE is an expression of some kind. */
218 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
220 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
223 /* Helper macros for math builtins. */
225 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
226 #define CASE_FLT_FN_FLOATN_NX(FN) \
227 case FN##F16: case FN##F32: case FN##F64: case FN##F128: \
228 case FN##F32X: case FN##F64X: case FN##F128X
229 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
230 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
232 #define NULL_TREE (tree) NULL
234 /* Define accessors for the fields that all tree nodes have
235 (though some fields are not used for all kinds of nodes). */
237 /* The tree-code says what kind of node it is.
238 Codes are defined in tree.def. */
239 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
240 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
242 /* When checking is enabled, errors will be generated if a tree node
243 is accessed incorrectly. The macros die with a fatal error. */
244 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
246 #define TREE_CHECK(T, CODE) \
247 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
249 #define TREE_NOT_CHECK(T, CODE) \
250 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
252 #define TREE_CHECK2(T, CODE1, CODE2) \
253 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
255 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
256 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
258 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
259 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
261 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
262 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
263 (CODE1), (CODE2), (CODE3)))
265 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
266 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
267 (CODE1), (CODE2), (CODE3), (CODE4)))
269 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
270 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
271 (CODE1), (CODE2), (CODE3), (CODE4)))
273 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
274 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
275 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
277 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
278 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
279 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
281 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
282 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
284 #define TREE_CLASS_CHECK(T, CLASS) \
285 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
287 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
288 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
290 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
291 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
293 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
294 (omp_clause_range_check ((T), (CODE1), (CODE2), \
295 __FILE__, __LINE__, __FUNCTION__))
297 /* These checks have to be special cased. */
298 #define EXPR_CHECK(T) \
299 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
301 /* These checks have to be special cased. */
302 #define NON_TYPE_CHECK(T) \
303 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
305 /* These checks have to be special cased. */
306 #define ANY_INTEGRAL_TYPE_CHECK(T) \
307 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
309 #define TREE_INT_CST_ELT_CHECK(T, I) \
310 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
312 #define TREE_VEC_ELT_CHECK(T, I) \
313 (*(CONST_CAST2 (tree *, typeof (T)*, \
314 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
316 #define OMP_CLAUSE_ELT_CHECK(T, I) \
317 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
319 /* Special checks for TREE_OPERANDs. */
320 #define TREE_OPERAND_CHECK(T, I) \
321 (*(CONST_CAST2 (tree*, typeof (T)*, \
322 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
324 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
325 (*(tree_operand_check_code ((T), (CODE), (I), \
326 __FILE__, __LINE__, __FUNCTION__)))
328 /* Nodes are chained together for many purposes.
329 Types are chained together to record them for being output to the debugger
330 (see the function `chain_type').
331 Decls in the same scope are chained together to record the contents
333 Statement nodes for successive statements used to be chained together.
334 Often lists of things are represented by TREE_LIST nodes that
335 are chained together. */
337 #define TREE_CHAIN(NODE) \
338 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
340 /* In all nodes that are expressions, this is the data type of the expression.
341 In POINTER_TYPE nodes, this is the type that the pointer points to.
342 In ARRAY_TYPE nodes, this is the type of the elements.
343 In VECTOR_TYPE nodes, this is the type of the elements. */
344 #define TREE_TYPE(NODE) \
345 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
347 extern void tree_contains_struct_check_failed (const_tree
,
348 const enum tree_node_structure_enum
,
349 const char *, int, const char *)
350 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
352 extern void tree_check_failed (const_tree
, const char *, int, const char *,
353 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
354 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
355 ...) ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
356 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
357 const char *, int, const char *)
358 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
359 extern void tree_range_check_failed (const_tree
, const char *, int,
360 const char *, enum tree_code
,
362 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
363 extern void tree_not_class_check_failed (const_tree
,
364 const enum tree_code_class
,
365 const char *, int, const char *)
366 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
367 extern void tree_int_cst_elt_check_failed (int, int, const char *,
369 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
370 extern void tree_vec_elt_check_failed (int, int, const char *,
372 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
373 extern void phi_node_elt_check_failed (int, int, const char *,
375 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
376 extern void tree_operand_check_failed (int, const_tree
,
377 const char *, int, const char *)
378 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
379 extern void omp_clause_check_failed (const_tree
, const char *, int,
380 const char *, enum omp_clause_code
)
381 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
382 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
384 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
385 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
386 const char *, enum omp_clause_code
,
387 enum omp_clause_code
)
388 ATTRIBUTE_NORETURN ATTRIBUTE_COLD
;
390 #else /* not ENABLE_TREE_CHECKING, or not gcc */
392 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
393 #define TREE_CHECK(T, CODE) (T)
394 #define TREE_NOT_CHECK(T, CODE) (T)
395 #define TREE_CHECK2(T, CODE1, CODE2) (T)
396 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
397 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
398 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
399 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
400 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
401 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
402 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
403 #define TREE_CLASS_CHECK(T, CODE) (T)
404 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
405 #define EXPR_CHECK(T) (T)
406 #define NON_TYPE_CHECK(T) (T)
407 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
408 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
409 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
410 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
411 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
412 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
413 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
414 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
416 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
417 #define TREE_TYPE(NODE) ((NODE)->typed.type)
421 #define TREE_BLOCK(NODE) (tree_block (NODE))
422 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
424 #include "tree-check.h"
426 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
427 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
428 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
429 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
430 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
431 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
432 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
433 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
434 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
435 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
436 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
438 #define RECORD_OR_UNION_CHECK(T) \
439 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
440 #define NOT_RECORD_OR_UNION_CHECK(T) \
441 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
442 #define ARRAY_OR_INTEGER_TYPE_CHECK(T) \
443 TREE_CHECK2 (T, ARRAY_TYPE, INTEGER_TYPE)
445 #define NUMERICAL_TYPE_CHECK(T) \
446 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
449 /* Here is how primitive or already-canonicalized types' hash codes
451 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
453 /* A simple hash function for an arbitrary tree node. This must not be
454 used in hash tables which are saved to a PCH. */
455 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
457 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
458 #define CONVERT_EXPR_CODE_P(CODE) \
459 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
461 /* Similarly, but accept an expression instead of a tree code. */
462 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
464 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
466 #define CASE_CONVERT \
470 /* Given an expression as a tree, strip any conversion that generates
471 no instruction. Accepts both tree and const_tree arguments since
472 we are not modifying the tree itself. */
474 #define STRIP_NOPS(EXP) \
475 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
477 /* Like STRIP_NOPS, but don't let the signedness change either. */
479 #define STRIP_SIGN_NOPS(EXP) \
480 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
482 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
484 #define STRIP_TYPE_NOPS(EXP) \
485 while ((CONVERT_EXPR_P (EXP) \
486 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
487 && TREE_OPERAND (EXP, 0) != error_mark_node \
488 && (TREE_TYPE (EXP) \
489 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
490 (EXP) = TREE_OPERAND (EXP, 0)
492 /* Remove unnecessary type conversions according to
493 tree_ssa_useless_type_conversion. */
495 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
496 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
498 /* Remove any VIEW_CONVERT_EXPR or NON_LVALUE_EXPR that's purely
499 in use to provide a location_t. */
501 #define STRIP_ANY_LOCATION_WRAPPER(EXP) \
502 (EXP) = tree_strip_any_location_wrapper (CONST_CAST_TREE (EXP))
504 /* Nonzero if TYPE represents a vector type. */
506 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
508 /* Nonzero if TYPE represents a vector of booleans. */
510 #define VECTOR_BOOLEAN_TYPE_P(TYPE) \
511 (TREE_CODE (TYPE) == VECTOR_TYPE \
512 && TREE_CODE (TREE_TYPE (TYPE)) == BOOLEAN_TYPE)
514 /* Nonzero if TYPE represents an integral type. Note that we do not
515 include COMPLEX types here. Keep these checks in ascending code
518 #define INTEGRAL_TYPE_P(TYPE) \
519 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
520 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
521 || TREE_CODE (TYPE) == INTEGER_TYPE)
523 /* Nonzero if TYPE represents an integral type, including complex
524 and vector integer types. */
526 #define ANY_INTEGRAL_TYPE_P(TYPE) \
527 (INTEGRAL_TYPE_P (TYPE) \
528 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
529 || VECTOR_TYPE_P (TYPE)) \
530 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
532 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
534 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
535 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
537 /* Nonzero if TYPE represents a saturating fixed-point type. */
539 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
540 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
542 /* Nonzero if TYPE represents a fixed-point type. */
544 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
546 /* Nonzero if TYPE represents a scalar floating-point type. */
548 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
550 /* Nonzero if TYPE represents a complex floating-point type. */
552 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
553 (TREE_CODE (TYPE) == COMPLEX_TYPE \
554 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
556 /* Nonzero if TYPE represents a vector integer type. */
558 #define VECTOR_INTEGER_TYPE_P(TYPE) \
559 (VECTOR_TYPE_P (TYPE) \
560 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
563 /* Nonzero if TYPE represents a vector floating-point type. */
565 #define VECTOR_FLOAT_TYPE_P(TYPE) \
566 (VECTOR_TYPE_P (TYPE) \
567 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
569 /* Nonzero if TYPE represents a floating-point type, including complex
570 and vector floating-point types. The vector and complex check does
571 not use the previous two macros to enable early folding. */
573 #define FLOAT_TYPE_P(TYPE) \
574 (SCALAR_FLOAT_TYPE_P (TYPE) \
575 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
576 || VECTOR_TYPE_P (TYPE)) \
577 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
579 /* Nonzero if TYPE represents a decimal floating-point type. */
580 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
581 (SCALAR_FLOAT_TYPE_P (TYPE) \
582 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
584 /* Nonzero if TYPE is a record or union type. */
585 #define RECORD_OR_UNION_TYPE_P(TYPE) \
586 (TREE_CODE (TYPE) == RECORD_TYPE \
587 || TREE_CODE (TYPE) == UNION_TYPE \
588 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
590 /* Nonzero if TYPE represents an aggregate (multi-component) type.
591 Keep these checks in ascending code order. */
593 #define AGGREGATE_TYPE_P(TYPE) \
594 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
596 /* Nonzero if TYPE represents a pointer or reference type.
597 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
598 ascending code order. */
600 #define POINTER_TYPE_P(TYPE) \
601 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
603 /* Nonzero if TYPE represents a pointer to function. */
604 #define FUNCTION_POINTER_TYPE_P(TYPE) \
605 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
607 /* Nonzero if this type is a complete type. */
608 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
610 /* Nonzero if this type is the (possibly qualified) void type. */
611 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
613 /* Nonzero if this type is complete or is cv void. */
614 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
615 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
617 /* Nonzero if this type is complete or is an array with unspecified bound. */
618 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
619 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
621 #define FUNC_OR_METHOD_TYPE_P(NODE) \
622 (TREE_CODE (NODE) == FUNCTION_TYPE || TREE_CODE (NODE) == METHOD_TYPE)
624 /* Define many boolean fields that all tree nodes have. */
626 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
627 of this is needed. So it cannot be in a register.
628 In a FUNCTION_DECL it has no meaning.
629 In LABEL_DECL nodes, it means a goto for this label has been seen
630 from a place outside all binding contours that restore stack levels.
631 In an artificial SSA_NAME that points to a stack partition with at least
632 two variables, it means that at least one variable has TREE_ADDRESSABLE.
633 In ..._TYPE nodes, it means that objects of this type must be fully
634 addressable. This means that pieces of this object cannot go into
635 register parameters, for example. If this a function type, this
636 means that the value must be returned in memory.
637 In CONSTRUCTOR nodes, it means object constructed must be in memory.
638 In IDENTIFIER_NODEs, this means that some extern decl for this name
639 had its address taken. That matters for inline functions.
640 In a STMT_EXPR, it means we want the result of the enclosed expression. */
641 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
643 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
644 exit of a function. Calls for which this is true are candidates for tail
645 call optimizations. */
646 #define CALL_EXPR_TAILCALL(NODE) \
647 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
649 /* Set on a CALL_EXPR if the call has been marked as requiring tail call
650 optimization for correctness. */
651 #define CALL_EXPR_MUST_TAIL_CALL(NODE) \
652 (CALL_EXPR_CHECK (NODE)->base.static_flag)
654 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
655 CASE_LOW operand has been processed. */
656 #define CASE_LOW_SEEN(NODE) \
657 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
659 #define PREDICT_EXPR_OUTCOME(NODE) \
660 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
661 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
662 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
663 #define PREDICT_EXPR_PREDICTOR(NODE) \
664 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
666 /* In a VAR_DECL, nonzero means allocate static storage.
667 In a FUNCTION_DECL, nonzero if function has been defined.
668 In a CONSTRUCTOR, nonzero means allocate static storage. */
669 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
671 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
672 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
674 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
675 should only be executed if an exception is thrown, not on normal exit
677 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
679 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
680 separate cleanup in honor_protect_cleanup_actions. */
681 #define TRY_CATCH_IS_CLEANUP(NODE) \
682 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
684 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
685 CASE_HIGH operand has been processed. */
686 #define CASE_HIGH_SEEN(NODE) \
687 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
689 /* Used to mark scoped enums. */
690 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
692 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
693 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
695 /* In an expr node (usually a conversion) this means the node was made
696 implicitly and should not lead to any sort of warning. In a decl node,
697 warnings concerning the decl should be suppressed. This is used at
698 least for used-before-set warnings, and it set after one warning is
700 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
702 /* Nonzero if we should warn about the change in empty class parameter
703 passing ABI in this TU. */
704 #define TRANSLATION_UNIT_WARN_EMPTY_P(NODE) \
705 (TRANSLATION_UNIT_DECL_CHECK (NODE)->decl_common.decl_flag_0)
707 /* Nonzero if this type is "empty" according to the particular psABI. */
708 #define TYPE_EMPTY_P(NODE) (TYPE_CHECK (NODE)->type_common.empty_flag)
710 /* Used to indicate that this TYPE represents a compiler-generated entity. */
711 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
713 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
714 this string as an argument. */
715 #define TREE_SYMBOL_REFERENCED(NODE) \
716 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
718 /* Nonzero in a pointer or reference type means the data pointed to
719 by this type can alias anything. */
720 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
721 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
723 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
724 there was an overflow in folding. */
726 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
728 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
730 #define TREE_OVERFLOW_P(EXPR) \
731 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
733 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
734 nonzero means name is to be accessible from outside this translation unit.
735 In an IDENTIFIER_NODE, nonzero means an external declaration
736 accessible from outside this translation unit was previously seen
737 for this name in an inner scope. */
738 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
740 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
741 of cached values, or is something else. */
742 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
744 /* In a SAVE_EXPR, indicates that the original expression has already
745 been substituted with a VAR_DECL that contains the value. */
746 #define SAVE_EXPR_RESOLVED_P(NODE) \
747 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
749 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
751 #define CALL_EXPR_VA_ARG_PACK(NODE) \
752 (CALL_EXPR_CHECK (NODE)->base.public_flag)
754 /* In any expression, decl, or constant, nonzero means it has side effects or
755 reevaluation of the whole expression could produce a different value.
756 This is set if any subexpression is a function call, a side effect or a
757 reference to a volatile variable. In a ..._DECL, this is set only if the
758 declaration said `volatile'. This will never be set for a constant. */
759 #define TREE_SIDE_EFFECTS(NODE) \
760 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
762 /* In a LABEL_DECL, nonzero means this label had its address taken
763 and therefore can never be deleted and is a jump target for
765 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
767 /* Whether a case or a user-defined label is allowed to fall through to.
768 This is used to implement -Wimplicit-fallthrough. */
769 #define FALLTHROUGH_LABEL_P(NODE) \
770 (LABEL_DECL_CHECK (NODE)->base.private_flag)
772 /* Set on the artificial label created for break; stmt from a switch.
773 This is used to implement -Wimplicit-fallthrough. */
774 #define SWITCH_BREAK_LABEL_P(NODE) \
775 (LABEL_DECL_CHECK (NODE)->base.protected_flag)
777 /* Nonzero means this expression is volatile in the C sense:
778 its address should be of type `volatile WHATEVER *'.
779 In other words, the declared item is volatile qualified.
780 This is used in _DECL nodes and _REF nodes.
781 On a FUNCTION_DECL node, this means the function does not
782 return normally. This is the same effect as setting
783 the attribute noreturn on the function in C.
785 In a ..._TYPE node, means this type is volatile-qualified.
786 But use TYPE_VOLATILE instead of this macro when the node is a type,
787 because eventually we may make that a different bit.
789 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
790 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
792 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
793 accessing the memory pointed to won't generate a trap. However,
794 this only applies to an object when used appropriately: it doesn't
795 mean that writing a READONLY mem won't trap.
797 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
798 (or slice of the array) always belongs to the range of the array.
799 I.e. that the access will not trap, provided that the access to
800 the base to the array will not trap. */
801 #define TREE_THIS_NOTRAP(NODE) \
802 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
803 ARRAY_RANGE_REF)->base.nothrow_flag)
805 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
806 nonzero means it may not be the lhs of an assignment.
807 Nonzero in a FUNCTION_DECL means this function should be treated
808 as "const" function (can only read its arguments). */
809 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
811 /* Value of expression is constant. Always on in all ..._CST nodes. May
812 also appear in an expression or decl where the value is constant. */
813 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
815 /* Nonzero if NODE, a type, has had its sizes gimplified. */
816 #define TYPE_SIZES_GIMPLIFIED(NODE) \
817 (TYPE_CHECK (NODE)->base.constant_flag)
819 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
820 #define DECL_UNSIGNED(NODE) \
821 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
823 /* In integral and pointer types, means an unsigned type. */
824 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
826 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
827 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
829 /* True if overflow wraps around for the given integral or pointer type. That
830 is, TYPE_MAX + 1 == TYPE_MIN. */
831 #define TYPE_OVERFLOW_WRAPS(TYPE) \
832 (POINTER_TYPE_P (TYPE) \
833 ? flag_wrapv_pointer \
834 : (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
837 /* True if overflow is undefined for the given integral or pointer type.
838 We may optimize on the assumption that values in the type never overflow.
840 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
841 must issue a warning based on warn_strict_overflow. In some cases
842 it will be appropriate to issue the warning immediately, and in
843 other cases it will be appropriate to simply set a flag and let the
844 caller decide whether a warning is appropriate or not. */
845 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
846 (POINTER_TYPE_P (TYPE) \
847 ? !flag_wrapv_pointer \
848 : (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
849 && !flag_wrapv && !flag_trapv))
851 /* True if overflow for the given integral type should issue a
853 #define TYPE_OVERFLOW_TRAPS(TYPE) \
854 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
856 /* True if an overflow is to be preserved for sanitization. */
857 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
858 (INTEGRAL_TYPE_P (TYPE) \
859 && !TYPE_OVERFLOW_WRAPS (TYPE) \
860 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
862 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
863 Nonzero in a FUNCTION_DECL means that the function has been compiled.
864 This is interesting in an inline function, since it might not need
865 to be compiled separately.
866 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
867 or TYPE_DECL if the debugging info for the type has been written.
868 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
869 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
871 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
873 /* Nonzero in a _DECL if the name is used in its scope.
874 Nonzero in an expr node means inhibit warning if value is unused.
875 In IDENTIFIER_NODEs, this means that some extern decl for this name
877 In a BLOCK, this means that the block contains variables that are used. */
878 #define TREE_USED(NODE) ((NODE)->base.used_flag)
880 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
881 throw an exception. In a CALL_EXPR, nonzero means the call cannot
882 throw. We can't easily check the node type here as the C++
883 frontend also uses this flag (for AGGR_INIT_EXPR). */
884 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
886 /* In a CALL_EXPR, means that it's safe to use the target of the call
887 expansion as the return slot for a call that returns in memory. */
888 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
889 (CALL_EXPR_CHECK (NODE)->base.private_flag)
891 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
892 passed by invisible reference (and the TREE_TYPE is a pointer to the true
894 #define DECL_BY_REFERENCE(NODE) \
895 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
896 RESULT_DECL)->decl_common.decl_by_reference_flag)
898 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
900 #define DECL_READ_P(NODE) \
901 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
903 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
904 attempting to share the stack slot with some other variable. */
905 #define DECL_NONSHAREABLE(NODE) \
906 (TREE_CHECK2 (NODE, VAR_DECL, \
907 RESULT_DECL)->decl_common.decl_nonshareable_flag)
909 /* In a PARM_DECL, set for Fortran hidden string length arguments that some
910 buggy callers don't pass to the callee. */
911 #define DECL_HIDDEN_STRING_LENGTH(NODE) \
912 (TREE_CHECK (NODE, PARM_DECL)->decl_common.decl_nonshareable_flag)
914 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
915 thunked-to function. */
916 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
918 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
919 it has been built for the declaration of a variable-sized object. */
920 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
921 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
923 /* Used in classes in C++. */
924 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
925 /* Used in classes in C++. */
926 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
928 /* True if reference type NODE is a C++ rvalue reference. */
929 #define TYPE_REF_IS_RVALUE(NODE) \
930 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
932 /* Nonzero in a _DECL if the use of the name is defined as a
933 deprecated feature by __attribute__((deprecated)). */
934 #define TREE_DEPRECATED(NODE) \
935 ((NODE)->base.deprecated_flag)
937 /* Nonzero indicates an IDENTIFIER_NODE that names an anonymous
938 aggregate, (as created by anon_aggr_name_format). */
939 #define IDENTIFIER_ANON_P(NODE) \
940 (IDENTIFIER_NODE_CHECK (NODE)->base.private_flag)
942 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
943 uses are to be substituted for uses of the TREE_CHAINed identifier. */
944 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
945 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
947 /* In an aggregate type, indicates that the scalar fields of the type are
948 stored in reverse order from the target order. This effectively
949 toggles BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN within the type. */
950 #define TYPE_REVERSE_STORAGE_ORDER(NODE) \
951 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
953 /* In a non-aggregate type, indicates a saturating type. */
954 #define TYPE_SATURATING(NODE) \
955 (TREE_NOT_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ARRAY_TYPE)->base.u.bits.saturating_flag)
957 /* In a BIT_FIELD_REF and MEM_REF, indicates that the reference is to a group
958 of bits stored in reverse order from the target order. This effectively
959 toggles both BYTES_BIG_ENDIAN and WORDS_BIG_ENDIAN for the reference.
961 The overall strategy is to preserve the invariant that every scalar in
962 memory is associated with a single storage order, i.e. all accesses to
963 this scalar are done with the same storage order. This invariant makes
964 it possible to factor out the storage order in most transformations, as
965 only the address and/or the value (in target order) matter for them.
966 But, of course, the storage order must be preserved when the accesses
967 themselves are rewritten or transformed. */
968 #define REF_REVERSE_STORAGE_ORDER(NODE) \
969 (TREE_CHECK2 (NODE, BIT_FIELD_REF, MEM_REF)->base.default_def_flag)
971 /* In an ADDR_EXPR, indicates that this is a pointer to nested function
972 represented by a descriptor instead of a trampoline. */
973 #define FUNC_ADDR_BY_DESCRIPTOR(NODE) \
974 (TREE_CHECK (NODE, ADDR_EXPR)->base.default_def_flag)
976 /* In a CALL_EXPR, indicates that this is an indirect call for which
977 pointers to nested function are descriptors instead of trampolines. */
978 #define CALL_EXPR_BY_DESCRIPTOR(NODE) \
979 (TREE_CHECK (NODE, CALL_EXPR)->base.default_def_flag)
981 /* These flags are available for each language front end to use internally. */
982 #define TREE_LANG_FLAG_0(NODE) \
983 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
984 #define TREE_LANG_FLAG_1(NODE) \
985 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
986 #define TREE_LANG_FLAG_2(NODE) \
987 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
988 #define TREE_LANG_FLAG_3(NODE) \
989 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
990 #define TREE_LANG_FLAG_4(NODE) \
991 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
992 #define TREE_LANG_FLAG_5(NODE) \
993 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
994 #define TREE_LANG_FLAG_6(NODE) \
995 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
997 /* Define additional fields and accessors for nodes representing constants. */
999 #define TREE_INT_CST_NUNITS(NODE) \
1000 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
1001 #define TREE_INT_CST_EXT_NUNITS(NODE) \
1002 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
1003 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
1004 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
1005 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
1006 #define TREE_INT_CST_LOW(NODE) \
1007 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
1009 /* Return true if NODE is a POLY_INT_CST. This is only ever true on
1010 targets with variable-sized modes. */
1011 #define POLY_INT_CST_P(NODE) \
1012 (NUM_POLY_INT_COEFFS > 1 && TREE_CODE (NODE) == POLY_INT_CST)
1014 /* In a POLY_INT_CST node. */
1015 #define POLY_INT_CST_COEFF(NODE, I) \
1016 (POLY_INT_CST_CHECK (NODE)->poly_int_cst.coeffs[I])
1018 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1019 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1021 #define TREE_FIXED_CST_PTR(NODE) \
1022 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1023 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1025 /* In a STRING_CST */
1026 /* In C terms, this is sizeof, not strlen. */
1027 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1028 #define TREE_STRING_POINTER(NODE) \
1029 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1031 /* In a COMPLEX_CST node. */
1032 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1033 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1035 /* In a VECTOR_CST node. See generic.texi for details. */
1036 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
1037 #define VECTOR_CST_ELT(NODE,IDX) vector_cst_elt (NODE, IDX)
1039 #define VECTOR_CST_LOG2_NPATTERNS(NODE) \
1040 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.log2_npatterns)
1041 #define VECTOR_CST_NPATTERNS(NODE) \
1042 (1U << VECTOR_CST_LOG2_NPATTERNS (NODE))
1043 #define VECTOR_CST_NELTS_PER_PATTERN(NODE) \
1044 (VECTOR_CST_CHECK (NODE)->base.u.vector_cst.nelts_per_pattern)
1045 #define VECTOR_CST_DUPLICATE_P(NODE) \
1046 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 1)
1047 #define VECTOR_CST_STEPPED_P(NODE) \
1048 (VECTOR_CST_NELTS_PER_PATTERN (NODE) == 3)
1049 #define VECTOR_CST_ENCODED_ELTS(NODE) \
1050 (VECTOR_CST_CHECK (NODE)->vector.elts)
1051 #define VECTOR_CST_ENCODED_ELT(NODE, ELT) \
1052 (VECTOR_CST_CHECK (NODE)->vector.elts[ELT])
1054 /* Define fields and accessors for some special-purpose tree nodes. */
1056 #define IDENTIFIER_LENGTH(NODE) \
1057 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1058 #define IDENTIFIER_POINTER(NODE) \
1059 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1060 #define IDENTIFIER_HASH_VALUE(NODE) \
1061 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1063 /* Translate a hash table identifier pointer to a tree_identifier
1064 pointer, and vice versa. */
1066 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1067 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1068 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1070 /* In a TREE_LIST node. */
1071 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1072 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1074 /* In a TREE_VEC node. */
1075 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
1076 #define TREE_VEC_END(NODE) \
1077 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
1079 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1081 /* In a CONSTRUCTOR node. */
1082 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1083 #define CONSTRUCTOR_ELT(NODE,IDX) \
1084 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
1085 #define CONSTRUCTOR_NELTS(NODE) \
1086 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
1087 #define CONSTRUCTOR_NO_CLEARING(NODE) \
1088 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
1090 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1091 value of each element (stored within VAL). IX must be a scratch variable
1092 of unsigned integer type. */
1093 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1094 for (IX = 0; (IX >= vec_safe_length (V)) \
1096 : ((VAL = (*(V))[IX].value), \
1100 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1101 the value of each element (stored within VAL) and its index (stored
1102 within INDEX). IX must be a scratch variable of unsigned integer type. */
1103 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1104 for (IX = 0; (IX >= vec_safe_length (V)) \
1106 : (((void) (VAL = (*V)[IX].value)), \
1107 (INDEX = (*V)[IX].index), \
1111 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1112 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1114 constructor_elt _ce___ = {INDEX, VALUE}; \
1115 vec_safe_push ((V), _ce___); \
1118 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1119 constructor output purposes. */
1120 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1121 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1123 /* True if NODE is a clobber right hand side, an expression of indeterminate
1124 value that clobbers the LHS in a copy instruction. We use a volatile
1125 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1126 In particular the volatile flag causes us to not prematurely remove
1127 such clobber instructions. */
1128 #define TREE_CLOBBER_P(NODE) \
1129 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1131 /* Define fields and accessors for some nodes that represent expressions. */
1133 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1134 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1135 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1136 && integer_zerop (TREE_OPERAND (NODE, 0)))
1138 /* In ordinary expression nodes. */
1139 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1140 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1142 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1143 length. Its value includes the length operand itself; that is,
1144 the minimum valid length is 1.
1145 Note that we have to bypass the use of TREE_OPERAND to access
1146 that field to avoid infinite recursion in expanding the macros. */
1147 #define VL_EXP_OPERAND_LENGTH(NODE) \
1148 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1150 /* Nonzero if gimple_debug_nonbind_marker_p() may possibly hold. */
1151 #define MAY_HAVE_DEBUG_MARKER_STMTS debug_nonbind_markers_p
1152 /* Nonzero if gimple_debug_bind_p() (and thus
1153 gimple_debug_source_bind_p()) may possibly hold. */
1154 #define MAY_HAVE_DEBUG_BIND_STMTS flag_var_tracking_assignments
1155 /* Nonzero if is_gimple_debug() may possibly hold. */
1156 #define MAY_HAVE_DEBUG_STMTS \
1157 (MAY_HAVE_DEBUG_MARKER_STMTS || MAY_HAVE_DEBUG_BIND_STMTS)
1159 /* In a LOOP_EXPR node. */
1160 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1162 /* The source location of this expression. Non-tree_exp nodes such as
1163 decls and constants can be shared among multiple locations, so
1165 #define EXPR_LOCATION(NODE) \
1166 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1167 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1168 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1169 != UNKNOWN_LOCATION)
1170 /* The location to be used in a diagnostic about this expression. Do not
1171 use this macro if the location will be assigned to other expressions. */
1172 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1173 ? (NODE)->exp.locus : (LOCUS))
1174 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1175 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1177 #define CAN_HAVE_RANGE_P(NODE) (CAN_HAVE_LOCATION_P (NODE))
1178 #define EXPR_LOCATION_RANGE(NODE) (get_expr_source_range (EXPR_CHECK ((NODE))))
1180 #define EXPR_HAS_RANGE(NODE) \
1181 (CAN_HAVE_RANGE_P (NODE) \
1182 ? EXPR_LOCATION_RANGE (NODE).m_start != UNKNOWN_LOCATION \
1185 /* True if a tree is an expression or statement that can have a
1187 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1189 static inline source_range
1190 get_expr_source_range (tree expr
)
1192 location_t loc
= EXPR_LOCATION (expr
);
1193 return get_range_from_loc (line_table
, loc
);
1196 extern void protected_set_expr_location (tree
, location_t
);
1198 extern tree
maybe_wrap_with_location (tree
, location_t
);
1200 extern int suppress_location_wrappers
;
1202 /* A class for suppressing the creation of location wrappers.
1203 Location wrappers will not be created during the lifetime
1204 of an instance of this class. */
1206 class auto_suppress_location_wrappers
1209 auto_suppress_location_wrappers () { ++suppress_location_wrappers
; }
1210 ~auto_suppress_location_wrappers () { --suppress_location_wrappers
; }
1213 /* In a TARGET_EXPR node. */
1214 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1215 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1216 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1217 /* Don't elide the initialization of TARGET_EXPR_SLOT for this TARGET_EXPR
1218 on rhs of MODIFY_EXPR. */
1219 #define TARGET_EXPR_NO_ELIDE(NODE) (TARGET_EXPR_CHECK (NODE)->base.private_flag)
1221 /* DECL_EXPR accessor. This gives access to the DECL associated with
1222 the given declaration statement. */
1223 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1225 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1227 /* COMPOUND_LITERAL_EXPR accessors. */
1228 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1229 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1230 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1231 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1233 /* SWITCH_EXPR accessors. These give access to the condition and body. */
1234 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1235 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1236 /* True if there are case labels for all possible values of SWITCH_COND, either
1237 because there is a default: case label or because the case label ranges cover
1239 #define SWITCH_ALL_CASES_P(NODE) (SWITCH_EXPR_CHECK (NODE)->base.private_flag)
1241 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1242 of a case label, respectively. */
1243 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1244 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1245 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1246 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1248 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1249 corresponding MEM_REF operands. */
1250 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1251 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1252 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1253 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1254 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1256 #define MR_DEPENDENCE_CLIQUE(NODE) \
1257 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1258 #define MR_DEPENDENCE_BASE(NODE) \
1259 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1261 /* The operands of a BIND_EXPR. */
1262 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1263 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1264 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1266 /* GOTO_EXPR accessor. This gives access to the label associated with
1267 a goto statement. */
1268 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_EXPR_CHECK (NODE), 0)
1270 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1271 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1272 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1274 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1275 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1276 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1277 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1278 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1279 /* Nonzero if we want to create an ASM_INPUT instead of an
1280 ASM_OPERAND with no operands. */
1281 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1282 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1283 /* Nonzero if we want to consider this asm as minimum length and cost
1284 for inlining decisions. */
1285 #define ASM_INLINE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.protected_flag)
1287 /* COND_EXPR accessors. */
1288 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1289 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1290 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1292 /* Accessors for the chains of recurrences. */
1293 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1294 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1295 #define CHREC_VARIABLE(NODE) POLYNOMIAL_CHREC_CHECK (NODE)->base.u.chrec_var
1297 /* LABEL_EXPR accessor. This gives access to the label associated with
1298 the given label expression. */
1299 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1301 /* CATCH_EXPR accessors. */
1302 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1303 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1305 /* EH_FILTER_EXPR accessors. */
1306 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1307 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1309 /* OBJ_TYPE_REF accessors. */
1310 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1311 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1312 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1314 /* ASSERT_EXPR accessors. */
1315 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1316 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1318 /* CALL_EXPR accessors. */
1319 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1320 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1321 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1322 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1323 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1325 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1326 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1327 the argument count is zero when checking is enabled. Instead, do
1328 the pointer arithmetic to advance past the 3 fixed operands in a
1329 CALL_EXPR. That produces a valid pointer to just past the end of the
1330 operand array, even if it's not valid to dereference it. */
1331 #define CALL_EXPR_ARGP(NODE) \
1332 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1334 /* TM directives and accessors. */
1335 #define TRANSACTION_EXPR_BODY(NODE) \
1336 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1337 #define TRANSACTION_EXPR_OUTER(NODE) \
1338 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1339 #define TRANSACTION_EXPR_RELAXED(NODE) \
1340 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1342 /* OpenMP and OpenACC directive and clause accessors. */
1344 /* Generic accessors for OMP nodes that keep the body as operand 0, and clauses
1346 #define OMP_BODY(NODE) \
1347 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_MASTER), 0)
1348 #define OMP_CLAUSES(NODE) \
1349 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SCAN), 1)
1351 /* Generic accessors for OMP nodes that keep clauses as operand 0. */
1352 #define OMP_STANDALONE_CLAUSES(NODE) \
1353 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_CACHE, OMP_TARGET_EXIT_DATA), 0)
1355 #define OACC_DATA_BODY(NODE) \
1356 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1357 #define OACC_DATA_CLAUSES(NODE) \
1358 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1360 #define OACC_HOST_DATA_BODY(NODE) \
1361 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1362 #define OACC_HOST_DATA_CLAUSES(NODE) \
1363 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1365 #define OACC_CACHE_CLAUSES(NODE) \
1366 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1368 #define OACC_DECLARE_CLAUSES(NODE) \
1369 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1371 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1372 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1374 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1375 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1377 #define OACC_UPDATE_CLAUSES(NODE) \
1378 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1380 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1381 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1383 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1384 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1386 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1387 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1388 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1390 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1391 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1392 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1393 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1394 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1395 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1396 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1397 #define OMP_FOR_ORIG_DECLS(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 6)
1399 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1400 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1402 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1404 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1405 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1407 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1409 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1410 #define OMP_TASKGROUP_CLAUSES(NODE) \
1411 TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 1)
1413 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1414 #define OMP_ORDERED_CLAUSES(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 1)
1416 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1417 #define OMP_CRITICAL_CLAUSES(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1418 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 2)
1420 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1421 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1423 #define OMP_TARGET_DATA_BODY(NODE) \
1424 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1425 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1426 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1428 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1429 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1431 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1432 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1434 #define OMP_TARGET_ENTER_DATA_CLAUSES(NODE)\
1435 TREE_OPERAND (OMP_TARGET_ENTER_DATA_CHECK (NODE), 0)
1437 #define OMP_TARGET_EXIT_DATA_CLAUSES(NODE)\
1438 TREE_OPERAND (OMP_TARGET_EXIT_DATA_CHECK (NODE), 0)
1440 #define OMP_SCAN_BODY(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 0)
1441 #define OMP_SCAN_CLAUSES(NODE) TREE_OPERAND (OMP_SCAN_CHECK (NODE), 1)
1443 #define OMP_CLAUSE_SIZE(NODE) \
1444 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1446 OMP_CLAUSE__CACHE_), 1)
1448 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1449 #define OMP_CLAUSE_DECL(NODE) \
1450 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1451 OMP_CLAUSE_PRIVATE, \
1452 OMP_CLAUSE__SCANTEMP_), 0)
1453 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1454 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1455 != UNKNOWN_LOCATION)
1456 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1458 /* True on an OMP_SECTION statement that was the last lexical member.
1459 This status is meaningful in the implementation of lastprivate. */
1460 #define OMP_SECTION_LAST(NODE) \
1461 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1463 /* True on an OMP_PARALLEL statement if it represents an explicit
1464 combined parallel work-sharing constructs. */
1465 #define OMP_PARALLEL_COMBINED(NODE) \
1466 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1468 /* True on an OMP_TEAMS statement if it represents an explicit
1469 combined teams distribute constructs. */
1470 #define OMP_TEAMS_COMBINED(NODE) \
1471 (OMP_TEAMS_CHECK (NODE)->base.private_flag)
1473 /* True on an OMP_TARGET statement if it represents explicit
1474 combined target teams, target parallel or target simd constructs. */
1475 #define OMP_TARGET_COMBINED(NODE) \
1476 (OMP_TARGET_CHECK (NODE)->base.private_flag)
1478 /* Memory order for OMP_ATOMIC*. */
1479 #define OMP_ATOMIC_MEMORY_ORDER(NODE) \
1480 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1481 OMP_ATOMIC_CAPTURE_NEW)->base.u.omp_atomic_memory_order)
1483 /* True on a PRIVATE clause if its decl is kept around for debugging
1484 information only and its DECL_VALUE_EXPR is supposed to point
1485 to what it has been remapped to. */
1486 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1487 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1489 /* True on a PRIVATE clause if ctor needs access to outer region's
1491 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1492 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1494 /* True if a PRIVATE clause is for a C++ class IV on taskloop construct
1495 (thus should be private on the outer taskloop and firstprivate on
1497 #define OMP_CLAUSE_PRIVATE_TASKLOOP_IV(NODE) \
1498 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1500 /* True on a FIRSTPRIVATE clause if it has been added implicitly. */
1501 #define OMP_CLAUSE_FIRSTPRIVATE_IMPLICIT(NODE) \
1502 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE)->base.public_flag)
1504 /* True on a FIRSTPRIVATE clause if only the reference and not what it refers
1505 to should be firstprivatized. */
1506 #define OMP_CLAUSE_FIRSTPRIVATE_NO_REFERENCE(NODE) \
1507 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FIRSTPRIVATE))
1509 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1510 decl is present in the chain. */
1511 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1512 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1513 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1514 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1515 OMP_CLAUSE_LASTPRIVATE),\
1517 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1518 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1520 /* True if a LASTPRIVATE clause is for a C++ class IV on taskloop construct
1521 (thus should be lastprivate on the outer taskloop and firstprivate on
1523 #define OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV(NODE) \
1524 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1526 /* True if a LASTPRIVATE clause has CONDITIONAL: modifier. */
1527 #define OMP_CLAUSE_LASTPRIVATE_CONDITIONAL(NODE) \
1528 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1530 /* True on a SHARED clause if a FIRSTPRIVATE clause for the same
1531 decl is present in the chain (this can happen only for taskloop
1532 with FIRSTPRIVATE/LASTPRIVATE on it originally. */
1533 #define OMP_CLAUSE_SHARED_FIRSTPRIVATE(NODE) \
1534 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED)->base.public_flag)
1536 /* True on a SHARED clause if a scalar is not modified in the body and
1537 thus could be optimized as firstprivate. */
1538 #define OMP_CLAUSE_SHARED_READONLY(NODE) \
1539 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SHARED))
1541 #define OMP_CLAUSE_IF_MODIFIER(NODE) \
1542 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF)->omp_clause.subcode.if_modifier)
1544 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1545 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1546 #define OMP_CLAUSE_IF_EXPR(NODE) \
1547 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1548 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1549 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1550 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1551 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1552 #define OMP_CLAUSE_NUM_TASKS_EXPR(NODE) \
1553 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TASKS), 0)
1554 #define OMP_CLAUSE_HINT_EXPR(NODE) \
1555 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_HINT), 0)
1557 #define OMP_CLAUSE_GRAINSIZE_EXPR(NODE) \
1558 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GRAINSIZE),0)
1560 #define OMP_CLAUSE_PRIORITY_EXPR(NODE) \
1561 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIORITY),0)
1563 /* OpenACC clause expressions */
1564 #define OMP_CLAUSE_EXPR(NODE, CLAUSE) \
1565 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, CLAUSE), 0)
1566 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1567 OMP_CLAUSE_OPERAND ( \
1568 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1569 #define OMP_CLAUSE_GANG_STATIC_EXPR(NODE) \
1570 OMP_CLAUSE_OPERAND ( \
1571 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 1)
1572 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1573 OMP_CLAUSE_OPERAND ( \
1574 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1575 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1576 OMP_CLAUSE_OPERAND ( \
1577 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1578 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1579 OMP_CLAUSE_OPERAND ( \
1580 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1581 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1582 OMP_CLAUSE_OPERAND ( \
1583 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1584 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1585 OMP_CLAUSE_OPERAND ( \
1586 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1587 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1588 OMP_CLAUSE_OPERAND ( \
1589 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1590 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1591 OMP_CLAUSE_OPERAND ( \
1592 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1594 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1595 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1597 #define OMP_CLAUSE_DEPEND_SINK_NEGATIVE(NODE) \
1598 TREE_PUBLIC (TREE_LIST_CHECK (NODE))
1600 #define OMP_CLAUSE_MAP_KIND(NODE) \
1601 ((enum gomp_map_kind) OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1602 #define OMP_CLAUSE_SET_MAP_KIND(NODE, MAP_KIND) \
1603 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind \
1604 = (unsigned int) (MAP_KIND))
1606 /* Nonzero if this map clause is for array (rather than pointer) based array
1607 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and corresponding
1608 OMP_CLAUSE_MAP with GOMP_MAP_POINTER are marked with this flag. */
1609 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1610 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1611 /* Nonzero if this is a mapped array section, that might need special
1612 treatment if OMP_CLAUSE_SIZE is zero. */
1613 #define OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION(NODE) \
1614 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1615 /* Nonzero if this map clause is for an ACC parallel reduction variable. */
1616 #define OMP_CLAUSE_MAP_IN_REDUCTION(NODE) \
1617 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP))
1619 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1620 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1622 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1623 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1624 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1625 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1626 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1627 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1629 #define OMP_CLAUSE_ORDERED_EXPR(NODE) \
1630 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ORDERED), 0)
1632 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1633 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1634 OMP_CLAUSE_IN_REDUCTION)->omp_clause.subcode.reduction_code)
1635 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1636 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1637 OMP_CLAUSE_IN_REDUCTION), 1)
1638 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1639 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1640 OMP_CLAUSE_IN_REDUCTION), 2)
1641 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1642 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1643 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1644 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1645 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1646 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1647 OMP_CLAUSE_IN_REDUCTION), 3)
1648 #define OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER(NODE) \
1649 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1650 OMP_CLAUSE_IN_REDUCTION), 4)
1652 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1653 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1654 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1655 (OMP_CLAUSE_RANGE_CHECK (NODE, OMP_CLAUSE_REDUCTION, \
1656 OMP_CLAUSE_IN_REDUCTION)->base.public_flag)
1658 /* True if a REDUCTION clause has task reduction-modifier. */
1659 #define OMP_CLAUSE_REDUCTION_TASK(NODE) \
1660 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1662 /* True if a REDUCTION clause has inscan reduction-modifier. */
1663 #define OMP_CLAUSE_REDUCTION_INSCAN(NODE) \
1664 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION))
1666 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1667 are always initialized inside of the loop construct, false otherwise. */
1668 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1669 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1671 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1672 are declared inside of the simd construct. */
1673 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1674 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1676 /* True if a LINEAR clause has a stride that is variable. */
1677 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1678 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1680 /* True if a LINEAR clause is for an array or allocatable variable that
1681 needs special handling by the frontend. */
1682 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1683 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1685 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1686 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1688 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1689 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1691 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1692 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1694 #define OMP_CLAUSE_LINEAR_KIND(NODE) \
1695 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->omp_clause.subcode.linear_kind)
1697 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1698 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1700 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1701 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1703 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1704 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1705 OMP_CLAUSE_THREAD_LIMIT), 0)
1707 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1708 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1710 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1711 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1712 OMP_CLAUSE_DIST_SCHEDULE), 0)
1714 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1715 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1717 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1718 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1720 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1721 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1723 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1724 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1726 /* True if a SCHEDULE clause has the simd modifier on it. */
1727 #define OMP_CLAUSE_SCHEDULE_SIMD(NODE) \
1728 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->base.public_flag)
1730 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1731 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1733 #define OMP_CLAUSE_DEFAULTMAP_KIND(NODE) \
1734 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULTMAP)->omp_clause.subcode.defaultmap_kind)
1735 #define OMP_CLAUSE_DEFAULTMAP_CATEGORY(NODE) \
1736 ((enum omp_clause_defaultmap_kind) \
1737 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_CATEGORY_MASK))
1738 #define OMP_CLAUSE_DEFAULTMAP_BEHAVIOR(NODE) \
1739 ((enum omp_clause_defaultmap_kind) \
1740 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) & OMP_CLAUSE_DEFAULTMAP_MASK))
1741 #define OMP_CLAUSE_DEFAULTMAP_SET_KIND(NODE, BEHAVIOR, CATEGORY) \
1742 (OMP_CLAUSE_DEFAULTMAP_KIND (NODE) \
1743 = (enum omp_clause_defaultmap_kind) (CATEGORY | BEHAVIOR))
1745 #define OMP_CLAUSE_TILE_LIST(NODE) \
1746 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 0)
1747 #define OMP_CLAUSE_TILE_ITERVAR(NODE) \
1748 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 1)
1749 #define OMP_CLAUSE_TILE_COUNT(NODE) \
1750 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_TILE), 2)
1752 #define OMP_CLAUSE__GRIDDIM__DIMENSION(NODE) \
1753 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_)\
1754 ->omp_clause.subcode.dimension)
1755 #define OMP_CLAUSE__GRIDDIM__SIZE(NODE) \
1756 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 0)
1757 #define OMP_CLAUSE__GRIDDIM__GROUP(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__GRIDDIM_), 1)
1760 /* _CONDTEMP_ holding temporary with iteration count. */
1761 #define OMP_CLAUSE__CONDTEMP__ITER(NODE) \
1762 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__CONDTEMP_)->base.public_flag)
1764 /* _SCANTEMP_ holding temporary with pointer to thread's local array;
1766 #define OMP_CLAUSE__SCANTEMP__ALLOC(NODE) \
1767 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_)->base.public_flag)
1769 /* _SCANTEMP_ holding temporary with a control variable for deallocation;
1770 one boolean_type_node for test whether alloca was used, another one
1771 to pass to __builtin_stack_restore or free. */
1772 #define OMP_CLAUSE__SCANTEMP__CONTROL(NODE) \
1773 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SCANTEMP_))
1775 /* SSA_NAME accessors. */
1777 /* Whether SSA_NAME NODE is a virtual operand. This simply caches the
1778 information in the underlying SSA_NAME_VAR for efficiency. */
1779 #define SSA_NAME_IS_VIRTUAL_OPERAND(NODE) \
1780 SSA_NAME_CHECK (NODE)->base.public_flag
1782 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1783 if there is no name associated with it. */
1784 #define SSA_NAME_IDENTIFIER(NODE) \
1785 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1786 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1787 ? (NODE)->ssa_name.var \
1788 : DECL_NAME ((NODE)->ssa_name.var)) \
1791 /* Returns the variable being referenced. This can be NULL_TREE for
1792 temporaries not associated with any user variable.
1793 Once released, this is the only field that can be relied upon. */
1794 #define SSA_NAME_VAR(NODE) \
1795 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1796 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1797 ? NULL_TREE : (NODE)->ssa_name.var)
1799 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1802 tree var_ = (VAR); \
1803 SSA_NAME_CHECK (NODE)->ssa_name.var = var_; \
1804 SSA_NAME_IS_VIRTUAL_OPERAND (NODE) \
1806 && TREE_CODE (var_) == VAR_DECL \
1807 && VAR_DECL_IS_VIRTUAL_OPERAND (var_)); \
1811 /* Returns the statement which defines this SSA name. */
1812 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1814 /* Returns the SSA version number of this SSA name. Note that in
1815 tree SSA, version numbers are not per variable and may be recycled. */
1816 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1818 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1819 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1821 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1822 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1824 /* Nonzero if this SSA_NAME expression is currently on the free list of
1825 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1826 has no meaning for an SSA_NAME. */
1827 #define SSA_NAME_IN_FREE_LIST(NODE) \
1828 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1830 /* Nonzero if this SSA_NAME is the default definition for the
1831 underlying symbol. A default SSA name is created for symbol S if
1832 the very first reference to S in the function is a read operation.
1833 Default definitions are always created by an empty statement and
1834 belong to no basic block. */
1835 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1836 SSA_NAME_CHECK (NODE)->base.default_def_flag
1838 /* Nonzero if this SSA_NAME is known to point to memory that may not
1839 be written to. This is set for default defs of function parameters
1840 that have a corresponding r or R specification in the functions
1841 fn spec attribute. This is used by alias analysis. */
1842 #define SSA_NAME_POINTS_TO_READONLY_MEMORY(NODE) \
1843 SSA_NAME_CHECK (NODE)->base.deprecated_flag
1845 /* Attributes for SSA_NAMEs for pointer-type variables. */
1846 #define SSA_NAME_PTR_INFO(N) \
1847 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1849 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1850 #define SSA_NAME_ANTI_RANGE_P(N) \
1851 SSA_NAME_CHECK (N)->base.static_flag
1853 /* The type of range described by SSA_NAME_RANGE_INFO. */
1854 #define SSA_NAME_RANGE_TYPE(N) \
1855 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1857 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1858 #define SSA_NAME_RANGE_INFO(N) \
1859 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1861 /* Return the immediate_use information for an SSA_NAME. */
1862 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1864 #define OMP_CLAUSE_CODE(NODE) \
1865 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1867 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1868 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1870 #define OMP_CLAUSE_OPERAND(NODE, I) \
1871 OMP_CLAUSE_ELT_CHECK (NODE, I)
1873 /* In a BLOCK node. */
1874 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1875 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1876 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1877 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1878 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1879 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1880 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1881 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1882 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1883 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1884 #define BLOCK_ORIGIN(NODE) \
1885 (BLOCK_ABSTRACT_ORIGIN(NODE) ? BLOCK_ABSTRACT_ORIGIN(NODE) : (NODE))
1886 #define BLOCK_DIE(NODE) (BLOCK_CHECK (NODE)->block.die)
1888 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1889 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1891 /* True if BLOCK appears in cold section. */
1892 #define BLOCK_IN_COLD_SECTION_P(NODE) \
1893 (BLOCK_CHECK (NODE)->base.u.bits.atomic_flag)
1895 /* An index number for this block. These values are not guaranteed to
1896 be unique across functions -- whether or not they are depends on
1897 the debugging output format in use. */
1898 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1900 /* If block reordering splits a lexical block into discontiguous
1901 address ranges, we'll make a copy of the original block.
1903 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1904 In that case, we have one source block that has been replicated
1905 (through inlining or unrolling) into many logical blocks, and that
1906 these logical blocks have different physical variables in them.
1908 In this case, we have one logical block split into several
1909 non-contiguous address ranges. Most debug formats can't actually
1910 represent this idea directly, so we fake it by creating multiple
1911 logical blocks with the same variables in them. However, for those
1912 that do support non-contiguous regions, these allow the original
1913 logical block to be reconstructed, along with the set of address
1916 One of the logical block fragments is arbitrarily chosen to be
1917 the ORIGIN. The other fragments will point to the origin via
1918 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1919 be null. The list of fragments will be chained through
1920 BLOCK_FRAGMENT_CHAIN from the origin. */
1922 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1923 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1925 /* For an inlined function, this gives the location where it was called
1926 from. This is only set in the top level block, which corresponds to the
1927 inlined function scope. This is used in the debug output routines. */
1929 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1931 /* This gives the location of the end of the block, useful to attach
1932 code implicitly generated for outgoing paths. */
1934 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1936 /* Define fields and accessors for nodes representing data types. */
1938 /* See tree.def for documentation of the use of these fields.
1939 Look at the documentation of the various ..._TYPE tree codes.
1941 Note that the type.values, type.minval, and type.maxval fields are
1942 overloaded and used for different macros in different kinds of types.
1943 Each macro must check to ensure the tree node is of the proper kind of
1944 type. Note also that some of the front-ends also overload these fields,
1945 so they must be checked as well. */
1947 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1948 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1949 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1950 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1951 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1952 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1953 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1954 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1955 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1956 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1958 #define TYPE_MODE_RAW(NODE) (TYPE_CHECK (NODE)->type_common.mode)
1959 #define TYPE_MODE(NODE) \
1960 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1961 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1962 #define SCALAR_TYPE_MODE(NODE) \
1963 (as_a <scalar_mode> (TYPE_CHECK (NODE)->type_common.mode))
1964 #define SCALAR_INT_TYPE_MODE(NODE) \
1965 (as_a <scalar_int_mode> (TYPE_CHECK (NODE)->type_common.mode))
1966 #define SCALAR_FLOAT_TYPE_MODE(NODE) \
1967 (as_a <scalar_float_mode> (TYPE_CHECK (NODE)->type_common.mode))
1968 #define SET_TYPE_MODE(NODE, MODE) \
1969 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1971 extern machine_mode
element_mode (const_tree
);
1972 extern machine_mode
vector_type_mode (const_tree
);
1974 /* The "canonical" type for this type node, which is used by frontends to
1975 compare the type for equality with another type. If two types are
1976 equal (based on the semantics of the language), then they will have
1977 equivalent TYPE_CANONICAL entries.
1979 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1980 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1981 be used for comparison against other types. Instead, the type is
1982 said to require structural equality checks, described in
1983 TYPE_STRUCTURAL_EQUALITY_P.
1985 For unqualified aggregate and function types the middle-end relies on
1986 TYPE_CANONICAL to tell whether two variables can be assigned
1987 to each other without a conversion. The middle-end also makes sure
1988 to assign the same alias-sets to the type partition with equal
1989 TYPE_CANONICAL of their unqualified variants. */
1990 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1991 /* Indicates that the type node requires structural equality
1992 checks. The compiler will need to look at the composition of the
1993 type to determine whether it is equal to another type, rather than
1994 just comparing canonical type pointers. For instance, we would need
1995 to look at the return and parameter types of a FUNCTION_TYPE
1997 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1998 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1999 type node requires structural equality. */
2000 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2002 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2003 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2005 /* The (language-specific) typed-based alias set for this type.
2006 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2007 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2008 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2009 type can alias objects of any type. */
2010 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2012 /* Nonzero iff the typed-based alias set for this type has been
2014 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2015 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2017 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2019 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2021 /* The alignment necessary for objects of this type.
2022 The value is an int, measured in bits and must be a power of two.
2023 We support also an "alignment" of zero. */
2024 #define TYPE_ALIGN(NODE) \
2025 (TYPE_CHECK (NODE)->type_common.align \
2026 ? ((unsigned)1) << ((NODE)->type_common.align - 1) : 0)
2028 /* Specify that TYPE_ALIGN(NODE) is X. */
2029 #define SET_TYPE_ALIGN(NODE, X) \
2030 (TYPE_CHECK (NODE)->type_common.align = ffs_hwi (X))
2032 /* 1 if the alignment for this type was requested by "aligned" attribute,
2033 0 if it is the default for this type. */
2034 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
2036 /* The alignment for NODE, in bytes. */
2037 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2039 /* The minimum alignment necessary for objects of this type without
2040 warning. The value is an int, measured in bits. */
2041 #define TYPE_WARN_IF_NOT_ALIGN(NODE) \
2042 (TYPE_CHECK (NODE)->type_common.warn_if_not_align \
2043 ? ((unsigned)1) << ((NODE)->type_common.warn_if_not_align - 1) : 0)
2045 /* Specify that TYPE_WARN_IF_NOT_ALIGN(NODE) is X. */
2046 #define SET_TYPE_WARN_IF_NOT_ALIGN(NODE, X) \
2047 (TYPE_CHECK (NODE)->type_common.warn_if_not_align = ffs_hwi (X))
2049 /* If your language allows you to declare types, and you want debug info
2050 for them, then you need to generate corresponding TYPE_DECL nodes.
2051 These "stub" TYPE_DECL nodes have no name, and simply point at the
2052 type node. You then set the TYPE_STUB_DECL field of the type node
2053 to point back at the TYPE_DECL node. This allows the debug routines
2054 to know that the two nodes represent the same type, so that we only
2055 get one debug info record for them. */
2056 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
2058 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
2059 the type has BLKmode only because it lacks the alignment required for
2061 #define TYPE_NO_FORCE_BLK(NODE) \
2062 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2064 /* Nonzero in a type considered volatile as a whole. */
2065 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2067 /* Nonzero in a type considered atomic as a whole. */
2068 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
2070 /* Means this type is const-qualified. */
2071 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2073 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2075 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2077 /* If nonzero, type's name shouldn't be emitted into debug info. */
2078 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
2080 /* The address space the type is in. */
2081 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
2083 /* Encode/decode the named memory support as part of the qualifier. If more
2084 than 8 qualifiers are added, these macros need to be adjusted. */
2085 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2086 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2088 /* Return all qualifiers except for the address space qualifiers. */
2089 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2091 /* Only keep the address space out of the qualifiers and discard the other
2093 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2095 /* The set of type qualifiers for this type. */
2096 #define TYPE_QUALS(NODE) \
2097 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2098 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2099 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2100 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2101 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
2103 /* The same as TYPE_QUALS without the address space qualifications. */
2104 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2105 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2106 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2107 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
2108 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2110 /* The same as TYPE_QUALS without the address space and atomic
2112 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
2113 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2114 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2115 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
2117 /* These flags are available for each language front end to use internally. */
2118 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2119 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2120 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2121 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2122 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2123 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2124 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2125 #define TYPE_LANG_FLAG_7(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_7)
2127 /* Used to keep track of visited nodes in tree traversals. This is set to
2128 0 by copy_node and make_node. */
2129 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2131 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2132 that distinguish string from array of char).
2133 If set in a INTEGER_TYPE, indicates a character type. */
2134 #define TYPE_STRING_FLAG(NODE) \
2135 (ARRAY_OR_INTEGER_TYPE_CHECK (NODE)->type_common.string_flag)
2137 /* If set for RECORD_TYPE or UNION_TYPE it indicates that the type conforms
2138 to the C++ one definition rule. This is used for LTO canonical type
2140 #define TYPE_CXX_ODR_P(NODE) \
2141 (RECORD_OR_UNION_CHECK (NODE)->type_common.string_flag)
2143 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2144 about missing conversions to other vector types of the same size. */
2145 #define TYPE_VECTOR_OPAQUE(NODE) \
2146 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2148 /* Indicates that objects of this type must be initialized by calling a
2149 function when they are created. */
2150 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2151 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2153 /* Indicates that a UNION_TYPE object should be passed the same way that
2154 the first union alternative would be passed, or that a RECORD_TYPE
2155 object should be passed the same way that the first (and only) member
2157 #define TYPE_TRANSPARENT_AGGR(NODE) \
2158 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2160 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2161 address of a component of the type. This is the counterpart of
2162 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2163 #define TYPE_NONALIASED_COMPONENT(NODE) \
2164 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2166 /* For an ARRAY_TYPE, a RECORD_TYPE, a UNION_TYPE or a QUAL_UNION_TYPE
2167 whether the array is typeless storage or the type contains a member
2168 with this flag set. Such types are exempt from type-based alias
2169 analysis. For ARRAY_TYPEs with AGGREGATE_TYPE_P element types
2170 the flag should be inherited from the element type, can change
2171 when type is finalized and because of that should not be used in
2172 type hashing. For ARRAY_TYPEs with non-AGGREGATE_TYPE_P element types
2173 the flag should not be changed after the array is created and should
2174 be used in type hashing. */
2175 #define TYPE_TYPELESS_STORAGE(NODE) \
2176 (TREE_CHECK4 (NODE, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, \
2177 ARRAY_TYPE)->type_common.typeless_storage)
2179 /* Indicated that objects of this type should be laid out in as
2180 compact a way as possible. */
2181 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
2183 /* Used by type_contains_placeholder_p to avoid recomputation.
2184 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2185 this field directly. */
2186 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2187 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2189 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
2190 #define TYPE_FINAL_P(NODE) \
2191 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
2193 /* The debug output functions use the symtab union field to store
2194 information specific to the debugging format. The different debug
2195 output hooks store different types in the union field. These three
2196 macros are used to access different fields in the union. The debug
2197 hooks are responsible for consistently using only a specific
2200 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2201 hold the type's number in the generated stabs. */
2202 #define TYPE_SYMTAB_ADDRESS(NODE) \
2203 (TYPE_CHECK (NODE)->type_common.symtab.address)
2205 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2206 in dwarf2out.c to point to the DIE generated for the type. */
2207 #define TYPE_SYMTAB_DIE(NODE) \
2208 (TYPE_CHECK (NODE)->type_common.symtab.die)
2210 /* The garbage collector needs to know the interpretation of the
2211 symtab field. These constants represent the different types in the
2214 #define TYPE_SYMTAB_IS_ADDRESS (0)
2215 #define TYPE_SYMTAB_IS_DIE (1)
2217 #define TYPE_LANG_SPECIFIC(NODE) \
2218 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2220 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2221 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2222 #define TYPE_FIELDS(NODE) \
2223 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2224 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2225 #define TYPE_ARG_TYPES(NODE) \
2226 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2227 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
2229 #define TYPE_MIN_VALUE(NODE) \
2230 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2231 #define TYPE_NEXT_PTR_TO(NODE) \
2232 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2233 #define TYPE_NEXT_REF_TO(NODE) \
2234 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2235 #define TYPE_VFIELD(NODE) \
2236 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2237 #define TYPE_MIN_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2239 #define TYPE_MAX_VALUE(NODE) \
2240 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2241 #define TYPE_METHOD_BASETYPE(NODE) \
2242 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2243 #define TYPE_OFFSET_BASETYPE(NODE) \
2244 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2245 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2246 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2248 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2249 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2250 #define TYPE_MAX_VALUE_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2251 /* For record and union types, information about this type, as a base type
2253 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2255 /* For types, used in a language-dependent way. */
2256 #define TYPE_LANG_SLOT_1(NODE) \
2257 (TYPE_CHECK (NODE)->type_non_common.lang_1)
2259 /* Define accessor macros for information about type inheritance
2262 A "basetype" means a particular usage of a data type for inheritance
2263 in another type. Each such basetype usage has its own "binfo"
2264 object to describe it. The binfo object is a TREE_VEC node.
2266 Inheritance is represented by the binfo nodes allocated for a
2267 given type. For example, given types C and D, such that D is
2268 inherited by C, 3 binfo nodes will be allocated: one for describing
2269 the binfo properties of C, similarly one for D, and one for
2270 describing the binfo properties of D as a base type for C.
2271 Thus, given a pointer to class C, one can get a pointer to the binfo
2272 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2274 /* BINFO specific flags. */
2276 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2277 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2279 /* Flags for language dependent use. */
2280 #define BINFO_FLAG_0(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
2281 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
2282 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
2283 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
2284 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
2285 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
2286 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
2288 /* The actual data type node being inherited in this basetype. */
2289 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
2291 /* The offset where this basetype appears in its containing type.
2292 BINFO_OFFSET slot holds the offset (in bytes)
2293 from the base of the complete object to the base of the part of the
2294 object that is allocated on behalf of this `type'.
2295 This is always 0 except when there is multiple inheritance. */
2297 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
2298 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2300 /* The virtual function table belonging to this basetype. Virtual
2301 function tables provide a mechanism for run-time method dispatching.
2302 The entries of a virtual function table are language-dependent. */
2304 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
2306 /* The virtual functions in the virtual function table. This is
2307 a TREE_LIST that is used as an initial approximation for building
2308 a virtual function table for this basetype. */
2309 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
2311 /* A vector of binfos for the direct basetypes inherited by this
2314 If this basetype describes type D as inherited in C, and if the
2315 basetypes of D are E and F, then this vector contains binfos for
2316 inheritance of E and F by C. */
2317 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
2319 /* The number of basetypes for NODE. */
2320 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
2322 /* Accessor macro to get to the Nth base binfo of this binfo. */
2323 #define BINFO_BASE_BINFO(NODE,N) \
2324 ((*BINFO_BASE_BINFOS (NODE))[(N)])
2325 #define BINFO_BASE_ITERATE(NODE,N,B) \
2326 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
2327 #define BINFO_BASE_APPEND(NODE,T) \
2328 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
2330 /* For a BINFO record describing a virtual base class, i.e., one where
2331 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2332 base. The actual contents are language-dependent. In the C++
2333 front-end this field is an INTEGER_CST giving an offset into the
2334 vtable where the offset to the virtual base can be found. */
2335 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2337 /* Indicates the accesses this binfo has to its bases. The values are
2338 access_public_node, access_protected_node or access_private_node.
2339 If this array is not present, public access is implied. */
2340 #define BINFO_BASE_ACCESSES(NODE) \
2341 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2343 #define BINFO_BASE_ACCESS(NODE,N) \
2344 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2345 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2346 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2348 /* The index in the VTT where this subobject's sub-VTT can be found.
2349 NULL_TREE if there is no sub-VTT. */
2350 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2352 /* The index in the VTT where the vptr for this subobject can be
2353 found. NULL_TREE if there is no secondary vptr in the VTT. */
2354 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2356 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2357 inheriting this base for non-virtual bases. For virtual bases it
2358 points either to the binfo for which this is a primary binfo, or to
2359 the binfo of the most derived type. */
2360 #define BINFO_INHERITANCE_CHAIN(NODE) \
2361 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2364 /* Define fields and accessors for nodes representing declared names. */
2366 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2367 have an associated SSA name. */
2368 #define SSA_VAR_P(DECL) \
2369 (TREE_CODE (DECL) == VAR_DECL \
2370 || TREE_CODE (DECL) == PARM_DECL \
2371 || TREE_CODE (DECL) == RESULT_DECL \
2372 || TREE_CODE (DECL) == SSA_NAME)
2375 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2377 /* This is the name of the object as written by the user.
2378 It is an IDENTIFIER_NODE. */
2379 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2381 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2382 #define TYPE_IDENTIFIER(NODE) \
2383 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2384 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2386 /* Every ..._DECL node gets a unique number. */
2387 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2389 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2391 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2393 /* Every ..._DECL node gets a unique number that stays the same even
2394 when the decl is copied by the inliner once it is set. */
2395 #define DECL_PT_UID(NODE) \
2396 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2397 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2398 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2399 #define SET_DECL_PT_UID(NODE, UID) \
2400 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2401 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2402 be preserved when copyin the decl. */
2403 #define DECL_PT_UID_SET_P(NODE) \
2404 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2406 /* These two fields describe where in the source code the declaration
2407 was. If the declaration appears in several places (as for a C
2408 function that is declared first and then defined later), this
2409 information should refer to the definition. */
2410 #define DECL_SOURCE_LOCATION(NODE) \
2411 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2412 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2413 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2414 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2415 /* This accessor returns TRUE if the decl it operates on was created
2416 by a front-end or back-end rather than by user code. In this case
2417 builtin-ness is indicated by source location. */
2418 #define DECL_IS_BUILTIN(DECL) \
2419 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2421 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2422 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2423 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2424 nodes, this points to either the FUNCTION_DECL for the containing
2425 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2426 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2427 scope". In particular, for VAR_DECLs which are virtual table pointers
2428 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2430 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2431 #define DECL_FIELD_CONTEXT(NODE) \
2432 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2434 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2435 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2437 /* For any sort of a ..._DECL node, this points to the original (abstract)
2438 decl node which this decl is an inlined/cloned instance of, or else it
2439 is NULL indicating that this decl is not an instance of some other decl.
2441 The C front-end also uses this in a nested declaration of an inline
2442 function, to point back to the definition. */
2443 #define DECL_ABSTRACT_ORIGIN(NODE) \
2444 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2446 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2447 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2448 #define DECL_ORIGIN(NODE) \
2449 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2451 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2452 inline instance of some original (abstract) decl from an inline function;
2453 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2454 nodes can also have their abstract origin set to themselves. */
2455 #define DECL_FROM_INLINE(NODE) \
2456 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2457 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2459 /* In a DECL this is the field where attributes are stored. */
2460 #define DECL_ATTRIBUTES(NODE) \
2461 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2463 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2464 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2465 For a VAR_DECL, holds the initial value.
2466 For a PARM_DECL, used for DECL_ARG_TYPE--default
2467 values for parameters are encoded in the type of the function,
2468 not in the PARM_DECL slot.
2469 For a FIELD_DECL, this is used for enumeration values and the C
2470 frontend uses it for temporarily storing bitwidth of bitfields.
2472 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2473 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2475 /* Holds the size of the datum, in bits, as a tree expression.
2476 Need not be constant. */
2477 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2478 /* Likewise for the size in bytes. */
2479 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2480 /* Returns the alignment required for the datum, in bits. It must
2481 be a power of two, but an "alignment" of zero is supported
2482 (e.g. as "uninitialized" sentinel). */
2483 #define DECL_ALIGN(NODE) \
2484 (DECL_COMMON_CHECK (NODE)->decl_common.align \
2485 ? ((unsigned)1) << ((NODE)->decl_common.align - 1) : 0)
2486 /* Specify that DECL_ALIGN(NODE) is X. */
2487 #define SET_DECL_ALIGN(NODE, X) \
2488 (DECL_COMMON_CHECK (NODE)->decl_common.align = ffs_hwi (X))
2490 /* The minimum alignment necessary for the datum, in bits, without
2492 #define DECL_WARN_IF_NOT_ALIGN(NODE) \
2493 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align \
2494 ? ((unsigned)1) << ((NODE)->decl_common.warn_if_not_align - 1) : 0)
2496 /* Specify that DECL_WARN_IF_NOT_ALIGN(NODE) is X. */
2497 #define SET_DECL_WARN_IF_NOT_ALIGN(NODE, X) \
2498 (DECL_COMMON_CHECK (NODE)->decl_common.warn_if_not_align = ffs_hwi (X))
2500 /* The alignment of NODE, in bytes. */
2501 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2502 /* Set if the alignment of this DECL has been set by the user, for
2503 example with an 'aligned' attribute. */
2504 #define DECL_USER_ALIGN(NODE) \
2505 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2506 /* Holds the machine mode corresponding to the declaration of a variable or
2507 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2509 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2510 #define SET_DECL_MODE(NODE, MODE) \
2511 (DECL_COMMON_CHECK (NODE)->decl_common.mode = (MODE))
2513 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2514 operation it is. Note, however, that this field is overloaded, with
2515 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2516 checked before any access to the former. */
2517 #define DECL_FUNCTION_CODE(NODE) \
2518 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2520 /* Test if FCODE is a function code for an alloca operation. */
2521 #define ALLOCA_FUNCTION_CODE_P(FCODE) \
2522 ((FCODE) == BUILT_IN_ALLOCA \
2523 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN \
2524 || (FCODE) == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX)
2526 /* Generate case for an alloca operation. */
2527 #define CASE_BUILT_IN_ALLOCA \
2528 case BUILT_IN_ALLOCA: \
2529 case BUILT_IN_ALLOCA_WITH_ALIGN: \
2530 case BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
2532 #define DECL_FUNCTION_PERSONALITY(NODE) \
2533 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2535 /* Nonzero for a given ..._DECL node means that the name of this node should
2536 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2537 the associated type should be ignored. For a FUNCTION_DECL, the body of
2538 the function should also be ignored. */
2539 #define DECL_IGNORED_P(NODE) \
2540 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2542 /* Nonzero for a given ..._DECL node means that this node represents an
2543 "abstract instance" of the given declaration (e.g. in the original
2544 declaration of an inline function). When generating symbolic debugging
2545 information, we mustn't try to generate any address information for nodes
2546 marked as "abstract instances" because we don't actually generate
2547 any code or allocate any data space for such instances. */
2548 #define DECL_ABSTRACT_P(NODE) \
2549 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2551 /* Language-specific decl information. */
2552 #define DECL_LANG_SPECIFIC(NODE) \
2553 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2555 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2556 do not allocate storage, and refer to a definition elsewhere. Note that
2557 this does not necessarily imply the entity represented by NODE
2558 has no program source-level definition in this translation unit. For
2559 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2560 DECL_EXTERNAL may be true simultaneously; that can be the case for
2561 a C99 "extern inline" function. */
2562 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2564 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2565 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2567 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2569 Also set in some languages for variables, etc., outside the normal
2570 lexical scope, such as class instance variables. */
2571 #define DECL_NONLOCAL(NODE) \
2572 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2574 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2575 Used in FIELD_DECLs for vtable pointers.
2576 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2577 #define DECL_VIRTUAL_P(NODE) \
2578 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2580 /* Used to indicate that this DECL represents a compiler-generated entity. */
2581 #define DECL_ARTIFICIAL(NODE) \
2582 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2584 /* Additional flags for language-specific uses. */
2585 #define DECL_LANG_FLAG_0(NODE) \
2586 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2587 #define DECL_LANG_FLAG_1(NODE) \
2588 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2589 #define DECL_LANG_FLAG_2(NODE) \
2590 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2591 #define DECL_LANG_FLAG_3(NODE) \
2592 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2593 #define DECL_LANG_FLAG_4(NODE) \
2594 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2595 #define DECL_LANG_FLAG_5(NODE) \
2596 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2597 #define DECL_LANG_FLAG_6(NODE) \
2598 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2599 #define DECL_LANG_FLAG_7(NODE) \
2600 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2601 #define DECL_LANG_FLAG_8(NODE) \
2602 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2604 /* Nonzero for a scope which is equal to file scope. */
2605 #define SCOPE_FILE_SCOPE_P(EXP) \
2606 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2607 /* Nonzero for a decl which is at file scope. */
2608 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2609 /* Nonzero for a type which is at file scope. */
2610 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2612 /* Nonzero for a decl that is decorated using attribute used.
2613 This indicates to compiler tools that this decl needs to be preserved. */
2614 #define DECL_PRESERVE_P(DECL) \
2615 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2617 /* For function local variables of COMPLEX and VECTOR types,
2618 indicates that the variable is not aliased, and that all
2619 modifications to the variable have been adjusted so that
2620 they are killing assignments. Thus the variable may now
2621 be treated as a GIMPLE register, and use real instead of
2622 virtual ops in SSA form. */
2623 #define DECL_GIMPLE_REG_P(DECL) \
2624 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2626 extern tree
decl_value_expr_lookup (tree
);
2627 extern void decl_value_expr_insert (tree
, tree
);
2629 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2630 if transformations have made this more complicated than evaluating the
2632 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2633 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2634 ->decl_common.decl_flag_2)
2635 #define DECL_VALUE_EXPR(NODE) \
2636 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2637 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2638 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2640 /* Holds the RTL expression for the value of a variable or function.
2641 This value can be evaluated lazily for functions, variables with
2642 static storage duration, and labels. */
2643 #define DECL_RTL(NODE) \
2644 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2645 ? (NODE)->decl_with_rtl.rtl \
2646 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2648 /* Set the DECL_RTL for NODE to RTL. */
2649 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2651 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2652 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2654 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2655 #define DECL_RTL_SET_P(NODE) \
2656 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2658 /* Copy the RTL from SRC_DECL to DST_DECL. If the RTL was not set for
2659 SRC_DECL, it will not be set for DST_DECL; this is a lazy copy. */
2660 #define COPY_DECL_RTL(SRC_DECL, DST_DECL) \
2661 (DECL_WRTL_CHECK (DST_DECL)->decl_with_rtl.rtl \
2662 = DECL_WRTL_CHECK (SRC_DECL)->decl_with_rtl.rtl)
2664 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2665 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2667 #if (GCC_VERSION >= 2007)
2668 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2669 ({ tree const __d = (decl); \
2670 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2671 /* Dereference it so the compiler knows it can't be NULL even \
2672 without assertion checking. */ \
2673 &*DECL_RTL_IF_SET (__d); })
2675 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2678 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2679 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2681 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2682 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2683 of the structure. */
2684 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2686 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2687 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2688 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2689 natural alignment of the field's type). */
2690 #define DECL_FIELD_BIT_OFFSET(NODE) \
2691 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2693 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2694 if so, the type that was originally specified for it.
2695 TREE_TYPE may have been modified (in finish_struct). */
2696 #define DECL_BIT_FIELD_TYPE(NODE) \
2697 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2699 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2700 representative FIELD_DECL. */
2701 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2702 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2704 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2705 if nonzero, indicates that the field occupies the type. */
2706 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2708 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2709 DECL_FIELD_OFFSET which are known to be always zero.
2710 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2712 #define DECL_OFFSET_ALIGN(NODE) \
2713 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2715 /* Specify that DECL_OFFSET_ALIGN(NODE) is X. */
2716 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2717 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2719 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2720 which this FIELD_DECL is defined. This information is needed when
2721 writing debugging information about vfield and vbase decls for C++. */
2722 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2724 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2725 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2727 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2729 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2731 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2732 this component. This makes it possible for Type-Based Alias Analysis
2733 to disambiguate accesses to this field with indirect accesses using
2736 struct S { int i; } s;
2739 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2741 From the implementation's viewpoint, the alias set of the type of the
2742 field 'i' (int) will not be recorded as a subset of that of the type of
2743 's' (struct S) in record_component_aliases. The counterpart is that
2744 accesses to s.i must not be given the alias set of the type of 'i'
2745 (int) but instead directly that of the type of 's' (struct S). */
2746 #define DECL_NONADDRESSABLE_P(NODE) \
2747 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2749 /* Used in a FIELD_DECL to indicate that this field is padding. */
2750 #define DECL_PADDING_P(NODE) \
2751 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2753 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2754 dense, unique within any one function, and may be used to index arrays.
2755 If the value is -1, then no UID has been assigned. */
2756 #define LABEL_DECL_UID(NODE) \
2757 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2759 /* In a LABEL_DECL, the EH region number for which the label is the
2760 post_landing_pad. */
2761 #define EH_LANDING_PAD_NR(NODE) \
2762 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2764 /* For a PARM_DECL, records the data type used to pass the argument,
2765 which may be different from the type seen in the program. */
2766 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2768 /* For PARM_DECL, holds an RTL for the stack slot or register
2769 where the data was actually passed. */
2770 #define DECL_INCOMING_RTL(NODE) \
2771 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2773 /* Nonzero for a given ..._DECL node means that no warnings should be
2774 generated just because this node is unused. */
2775 #define DECL_IN_SYSTEM_HEADER(NODE) \
2776 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2778 /* Used to indicate that the linkage status of this DECL is not yet known,
2779 so it should not be output now. */
2780 #define DECL_DEFER_OUTPUT(NODE) \
2781 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2783 /* In a VAR_DECL that's static,
2784 nonzero if the space is in the text section. */
2785 #define DECL_IN_TEXT_SECTION(NODE) \
2786 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2788 /* In a VAR_DECL that's static,
2789 nonzero if it belongs to the global constant pool. */
2790 #define DECL_IN_CONSTANT_POOL(NODE) \
2791 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2793 /* Nonzero for a given ..._DECL node means that this node should be
2794 put in .common, if possible. If a DECL_INITIAL is given, and it
2795 is not error_mark_node, then the decl cannot be put in .common. */
2796 #define DECL_COMMON(NODE) \
2797 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2799 /* In a VAR_DECL, nonzero if the decl is a register variable with
2800 an explicit asm specification. */
2801 #define DECL_HARD_REGISTER(NODE) \
2802 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2804 /* Used to indicate that this DECL has weak linkage. */
2805 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2807 /* Used to indicate that the DECL is a dllimport. */
2808 #define DECL_DLLIMPORT_P(NODE) \
2809 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2811 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2812 not be put out unless it is needed in this translation unit.
2813 Entities like this are shared across translation units (like weak
2814 entities), but are guaranteed to be generated by any translation
2815 unit that needs them, and therefore need not be put out anywhere
2816 where they are not needed. DECL_COMDAT is just a hint to the
2817 back-end; it is up to front-ends which set this flag to ensure
2818 that there will never be any harm, other than bloat, in putting out
2819 something which is DECL_COMDAT. */
2820 #define DECL_COMDAT(NODE) \
2821 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2823 #define DECL_COMDAT_GROUP(NODE) \
2824 decl_comdat_group (NODE)
2826 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2827 multiple translation units should be merged. */
2828 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2829 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2831 /* The name of the object as the assembler will see it (but before any
2832 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2833 as DECL_NAME. It is an IDENTIFIER_NODE.
2835 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2836 One Definition Rule based type merging at LTO. It is computed only for
2837 LTO compilation and C++. */
2838 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2840 /* Raw accessor for DECL_ASSEMBLE_NAME. */
2841 #define DECL_ASSEMBLER_NAME_RAW(NODE) \
2842 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name)
2844 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2845 This is true of all DECL nodes except FIELD_DECL. */
2846 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2847 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2849 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2850 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2852 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2853 (DECL_ASSEMBLER_NAME_RAW (NODE) != NULL_TREE)
2855 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2856 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2857 overwrite_decl_assembler_name (NODE, NAME)
2859 /* Copy the DECL_ASSEMBLER_NAME from SRC_DECL to DST_DECL. Note that
2860 if SRC_DECL's DECL_ASSEMBLER_NAME has not yet been set, using this
2861 macro will not cause the DECL_ASSEMBLER_NAME to be set, but will
2862 clear DECL_ASSEMBLER_NAME of DST_DECL, if it was already set. In
2863 other words, the semantics of using this macro, are different than
2866 SET_DECL_ASSEMBLER_NAME(DST_DECL, DECL_ASSEMBLER_NAME (SRC_DECL))
2868 which will try to set the DECL_ASSEMBLER_NAME for SRC_DECL. */
2870 #define COPY_DECL_ASSEMBLER_NAME(SRC_DECL, DST_DECL) \
2871 SET_DECL_ASSEMBLER_NAME (DST_DECL, DECL_ASSEMBLER_NAME_RAW (SRC_DECL))
2873 /* Records the section name in a section attribute. Used to pass
2874 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2875 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2877 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2878 this variable in a BIND_EXPR. */
2879 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2880 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2882 /* Value of the decls's visibility attribute */
2883 #define DECL_VISIBILITY(NODE) \
2884 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2886 /* Nonzero means that the decl had its visibility specified rather than
2888 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2889 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2891 /* In a VAR_DECL, the model to use if the data should be allocated from
2892 thread-local storage. */
2893 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2895 /* In a VAR_DECL, nonzero if the data should be allocated from
2896 thread-local storage. */
2897 #define DECL_THREAD_LOCAL_P(NODE) \
2898 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2900 /* In a non-local VAR_DECL with static storage duration, true if the
2901 variable has an initialization priority. If false, the variable
2902 will be initialized at the DEFAULT_INIT_PRIORITY. */
2903 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2904 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2906 extern tree
decl_debug_expr_lookup (tree
);
2907 extern void decl_debug_expr_insert (tree
, tree
);
2909 /* For VAR_DECL, this is set to an expression that it was split from. */
2910 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2911 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2912 #define DECL_DEBUG_EXPR(NODE) \
2913 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2915 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2916 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2918 extern priority_type
decl_init_priority_lookup (tree
);
2919 extern priority_type
decl_fini_priority_lookup (tree
);
2920 extern void decl_init_priority_insert (tree
, priority_type
);
2921 extern void decl_fini_priority_insert (tree
, priority_type
);
2923 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2925 #define DECL_INIT_PRIORITY(NODE) \
2926 (decl_init_priority_lookup (NODE))
2927 /* Set the initialization priority for NODE to VAL. */
2928 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2929 (decl_init_priority_insert (NODE, VAL))
2931 /* For a FUNCTION_DECL the finalization priority of NODE. */
2932 #define DECL_FINI_PRIORITY(NODE) \
2933 (decl_fini_priority_lookup (NODE))
2934 /* Set the finalization priority for NODE to VAL. */
2935 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2936 (decl_fini_priority_insert (NODE, VAL))
2938 /* The initialization priority for entities for which no explicit
2939 initialization priority has been specified. */
2940 #define DEFAULT_INIT_PRIORITY 65535
2942 /* The maximum allowed initialization priority. */
2943 #define MAX_INIT_PRIORITY 65535
2945 /* The largest priority value reserved for use by system runtime
2947 #define MAX_RESERVED_INIT_PRIORITY 100
2949 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2950 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2951 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2953 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2954 #define DECL_NONLOCAL_FRAME(NODE) \
2955 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2957 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2958 #define DECL_NONALIASED(NODE) \
2959 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2961 /* This field is used to reference anything in decl.result and is meant only
2962 for use by the garbage collector. */
2963 #define DECL_RESULT_FLD(NODE) \
2964 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2966 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2967 Before the struct containing the FUNCTION_DECL is laid out,
2968 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2969 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2970 function. When the class is laid out, this pointer is changed
2971 to an INTEGER_CST node which is suitable for use as an index
2972 into the virtual function table. */
2973 #define DECL_VINDEX(NODE) \
2974 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2976 /* In FUNCTION_DECL, holds the decl for the return value. */
2977 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2979 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2980 #define DECL_UNINLINABLE(NODE) \
2981 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2983 /* In a FUNCTION_DECL, the saved representation of the body of the
2985 #define DECL_SAVED_TREE(NODE) \
2986 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2988 /* Nonzero in a FUNCTION_DECL means this function should be treated
2989 as if it were a malloc, meaning it returns a pointer that is
2991 #define DECL_IS_MALLOC(NODE) \
2992 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2994 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2995 C++ operator new, meaning that it returns a pointer for which we
2996 should not use type based aliasing. */
2997 #define DECL_IS_OPERATOR_NEW(NODE) \
2998 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3000 /* Nonzero in a FUNCTION_DECL means this function may return more
3002 #define DECL_IS_RETURNS_TWICE(NODE) \
3003 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3005 /* Nonzero in a FUNCTION_DECL means this function should be treated
3006 as "pure" function (like const function, but may read global memory). */
3007 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3009 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3010 the const or pure function may not terminate. When this is nonzero
3011 for a const or pure function, it can be dealt with by cse passes
3012 but cannot be removed by dce passes since you are not allowed to
3013 change an infinite looping program into one that terminates without
3015 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3016 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3018 /* Nonzero in a FUNCTION_DECL means this function should be treated
3019 as "novops" function (function that does not read global memory,
3020 but may have arbitrary side effects). */
3021 #define DECL_IS_NOVOPS(NODE) \
3022 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3024 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3025 at the beginning or end of execution. */
3026 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3027 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3029 #define DECL_STATIC_DESTRUCTOR(NODE) \
3030 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3032 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3033 be instrumented with calls to support routines. */
3034 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3035 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3037 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3038 disabled in this function. */
3039 #define DECL_NO_LIMIT_STACK(NODE) \
3040 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3042 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3043 #define DECL_STATIC_CHAIN(NODE) \
3044 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
3046 /* Nonzero for a decl that cgraph has decided should be inlined into
3047 at least one call site. It is not meaningful to look at this
3048 directly; always use cgraph_function_possibly_inlined_p. */
3049 #define DECL_POSSIBLY_INLINED(DECL) \
3050 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3052 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3053 such as via the `inline' keyword in C/C++. This flag controls the linkage
3054 semantics of 'inline' */
3055 #define DECL_DECLARED_INLINE_P(NODE) \
3056 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3058 /* Nonzero in a FUNCTION_DECL means this function should not get
3059 -Winline warnings. */
3060 #define DECL_NO_INLINE_WARNING_P(NODE) \
3061 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3063 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3064 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3065 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3067 /* Nonzero if a FUNCTION_CODE is a TM load. */
3068 #define BUILTIN_TM_LOAD_P(FN) \
3069 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3071 /* Nonzero if a FUNCTION_CODE is a TM store. */
3072 #define BUILTIN_TM_STORE_P(FN) \
3073 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3075 #define CASE_BUILT_IN_TM_LOAD(FN) \
3076 case BUILT_IN_TM_LOAD_##FN: \
3077 case BUILT_IN_TM_LOAD_RAR_##FN: \
3078 case BUILT_IN_TM_LOAD_RAW_##FN: \
3079 case BUILT_IN_TM_LOAD_RFW_##FN
3081 #define CASE_BUILT_IN_TM_STORE(FN) \
3082 case BUILT_IN_TM_STORE_##FN: \
3083 case BUILT_IN_TM_STORE_WAR_##FN: \
3084 case BUILT_IN_TM_STORE_WAW_##FN
3086 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3087 disregarding size and cost heuristics. This is equivalent to using
3088 the always_inline attribute without the required diagnostics if the
3089 function cannot be inlined. */
3090 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3091 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3093 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
3094 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
3096 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3097 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3098 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3100 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3101 that describes the status of this function. */
3102 #define DECL_STRUCT_FUNCTION(NODE) \
3103 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3106 /* For a builtin function, identify which part of the compiler defined it. */
3107 #define DECL_BUILT_IN_CLASS(NODE) \
3108 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3110 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
3111 #define DECL_ARGUMENTS(NODE) \
3112 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
3114 /* In FUNCTION_DECL, the function specific target options to use when compiling
3116 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3117 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3119 /* In FUNCTION_DECL, the function specific optimization options to use when
3120 compiling this function. */
3121 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3122 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3124 /* In FUNCTION_DECL, this is set if this function has other versions generated
3125 using "target" attributes. The default version is the one which does not
3126 have any "target" attribute set. */
3127 #define DECL_FUNCTION_VERSIONED(NODE)\
3128 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
3130 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
3131 Devirtualization machinery uses this knowledge for determing type of the
3132 object constructed. Also we assume that constructor address is not
3134 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
3135 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
3137 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
3138 Devirtualization machinery uses this to track types in destruction. */
3139 #define DECL_CXX_DESTRUCTOR_P(NODE)\
3140 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
3142 /* In FUNCTION_DECL, this is set if this function is a lambda function. */
3143 #define DECL_LAMBDA_FUNCTION(NODE) \
3144 (FUNCTION_DECL_CHECK (NODE)->function_decl.lambda_function)
3146 /* In FUNCTION_DECL that represent an virtual method this is set when
3147 the method is final. */
3148 #define DECL_FINAL_P(NODE)\
3149 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
3151 /* The source language of the translation-unit. */
3152 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3153 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3155 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3157 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3158 #define DECL_ORIGINAL_TYPE(NODE) \
3159 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3161 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3162 into stabs. Instead it will generate cross reference ('x') of names.
3163 This uses the same flag as DECL_EXTERNAL. */
3164 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3165 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3167 /* Getter of the imported declaration associated to the
3168 IMPORTED_DECL node. */
3169 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3170 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3172 /* Getter of the symbol declaration associated with the
3173 NAMELIST_DECL node. */
3174 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
3175 (DECL_INITIAL (NODE))
3177 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3178 To reduce overhead, the nodes containing the statements are not trees.
3179 This avoids the overhead of tree_common on all linked list elements.
3181 Use the interface in tree-iterator.h to access this node. */
3183 #define STATEMENT_LIST_HEAD(NODE) \
3184 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3185 #define STATEMENT_LIST_TAIL(NODE) \
3186 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3188 #define TREE_OPTIMIZATION(NODE) \
3189 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3191 #define TREE_OPTIMIZATION_OPTABS(NODE) \
3192 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
3194 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
3195 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
3197 /* Return a tree node that encapsulates the optimization options in OPTS. */
3198 extern tree
build_optimization_node (struct gcc_options
*opts
);
3200 #define TREE_TARGET_OPTION(NODE) \
3201 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3203 #define TREE_TARGET_GLOBALS(NODE) \
3204 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
3206 /* Return a tree node that encapsulates the target options in OPTS. */
3207 extern tree
build_target_option_node (struct gcc_options
*opts
);
3209 extern void prepare_target_option_nodes_for_pch (void);
3211 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3214 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
3216 if (TREE_CODE (__t
) != __c
)
3217 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3222 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
3225 if (TREE_CODE (__t
) == __c
)
3226 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3231 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3232 enum tree_code __c1
, enum tree_code __c2
)
3234 if (TREE_CODE (__t
) != __c1
3235 && TREE_CODE (__t
) != __c2
)
3236 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3241 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
3242 enum tree_code __c1
, enum tree_code __c2
)
3244 if (TREE_CODE (__t
) == __c1
3245 || TREE_CODE (__t
) == __c2
)
3246 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3251 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3252 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3254 if (TREE_CODE (__t
) != __c1
3255 && TREE_CODE (__t
) != __c2
3256 && TREE_CODE (__t
) != __c3
)
3257 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3262 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
3263 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3265 if (TREE_CODE (__t
) == __c1
3266 || TREE_CODE (__t
) == __c2
3267 || TREE_CODE (__t
) == __c3
)
3268 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3273 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3274 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3275 enum tree_code __c4
)
3277 if (TREE_CODE (__t
) != __c1
3278 && TREE_CODE (__t
) != __c2
3279 && TREE_CODE (__t
) != __c3
3280 && TREE_CODE (__t
) != __c4
)
3281 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3286 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
3287 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3288 enum tree_code __c4
)
3290 if (TREE_CODE (__t
) == __c1
3291 || TREE_CODE (__t
) == __c2
3292 || TREE_CODE (__t
) == __c3
3293 || TREE_CODE (__t
) == __c4
)
3294 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3299 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3300 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3301 enum tree_code __c4
, enum tree_code __c5
)
3303 if (TREE_CODE (__t
) != __c1
3304 && TREE_CODE (__t
) != __c2
3305 && TREE_CODE (__t
) != __c3
3306 && TREE_CODE (__t
) != __c4
3307 && TREE_CODE (__t
) != __c5
)
3308 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3313 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
3314 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3315 enum tree_code __c4
, enum tree_code __c5
)
3317 if (TREE_CODE (__t
) == __c1
3318 || TREE_CODE (__t
) == __c2
3319 || TREE_CODE (__t
) == __c3
3320 || TREE_CODE (__t
) == __c4
3321 || TREE_CODE (__t
) == __c5
)
3322 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3327 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
3328 const char *__f
, int __l
, const char *__g
)
3330 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3331 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3336 tree_class_check (tree __t
, const enum tree_code_class __class
,
3337 const char *__f
, int __l
, const char *__g
)
3339 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3340 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3345 tree_range_check (tree __t
,
3346 enum tree_code __code1
, enum tree_code __code2
,
3347 const char *__f
, int __l
, const char *__g
)
3349 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3350 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3355 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
3356 const char *__f
, int __l
, const char *__g
)
3358 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3359 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3360 if (__t
->omp_clause
.code
!= __code
)
3361 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3366 omp_clause_range_check (tree __t
,
3367 enum omp_clause_code __code1
,
3368 enum omp_clause_code __code2
,
3369 const char *__f
, int __l
, const char *__g
)
3371 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3372 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3373 if ((int) __t
->omp_clause
.code
< (int) __code1
3374 || (int) __t
->omp_clause
.code
> (int) __code2
)
3375 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3379 /* These checks have to be special cased. */
3382 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3384 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3385 if (!IS_EXPR_CODE_CLASS (__c
))
3386 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3390 /* These checks have to be special cased. */
3393 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3396 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3400 inline const HOST_WIDE_INT
*
3401 tree_int_cst_elt_check (const_tree __t
, int __i
,
3402 const char *__f
, int __l
, const char *__g
)
3404 if (TREE_CODE (__t
) != INTEGER_CST
)
3405 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3406 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3407 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3409 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3412 inline HOST_WIDE_INT
*
3413 tree_int_cst_elt_check (tree __t
, int __i
,
3414 const char *__f
, int __l
, const char *__g
)
3416 if (TREE_CODE (__t
) != INTEGER_CST
)
3417 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
3418 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
3419 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
3421 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
3424 /* Workaround -Wstrict-overflow false positive during profiledbootstrap. */
3426 # if GCC_VERSION >= 4006
3427 #pragma GCC diagnostic push
3428 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3432 tree_vec_elt_check (tree __t
, int __i
,
3433 const char *__f
, int __l
, const char *__g
)
3435 if (TREE_CODE (__t
) != TREE_VEC
)
3436 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3437 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3438 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3439 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
3442 # if GCC_VERSION >= 4006
3443 #pragma GCC diagnostic pop
3447 omp_clause_elt_check (tree __t
, int __i
,
3448 const char *__f
, int __l
, const char *__g
)
3450 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3451 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3452 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3453 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3454 return &__t
->omp_clause
.ops
[__i
];
3457 /* These checks have to be special cased. */
3460 any_integral_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
3462 if (!ANY_INTEGRAL_TYPE_P (__t
))
3463 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3469 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3472 if (TREE_CODE (__t
) != __c
)
3473 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3478 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3481 if (TREE_CODE (__t
) == __c
)
3482 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
3487 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3488 enum tree_code __c1
, enum tree_code __c2
)
3490 if (TREE_CODE (__t
) != __c1
3491 && TREE_CODE (__t
) != __c2
)
3492 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3497 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3498 enum tree_code __c1
, enum tree_code __c2
)
3500 if (TREE_CODE (__t
) == __c1
3501 || TREE_CODE (__t
) == __c2
)
3502 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
3507 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3508 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3510 if (TREE_CODE (__t
) != __c1
3511 && TREE_CODE (__t
) != __c2
3512 && TREE_CODE (__t
) != __c3
)
3513 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3518 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3519 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
3521 if (TREE_CODE (__t
) == __c1
3522 || TREE_CODE (__t
) == __c2
3523 || TREE_CODE (__t
) == __c3
)
3524 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
3529 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3530 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3531 enum tree_code __c4
)
3533 if (TREE_CODE (__t
) != __c1
3534 && TREE_CODE (__t
) != __c2
3535 && TREE_CODE (__t
) != __c3
3536 && TREE_CODE (__t
) != __c4
)
3537 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3542 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3543 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3544 enum tree_code __c4
)
3546 if (TREE_CODE (__t
) == __c1
3547 || TREE_CODE (__t
) == __c2
3548 || TREE_CODE (__t
) == __c3
3549 || TREE_CODE (__t
) == __c4
)
3550 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3555 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3556 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3557 enum tree_code __c4
, enum tree_code __c5
)
3559 if (TREE_CODE (__t
) != __c1
3560 && TREE_CODE (__t
) != __c2
3561 && TREE_CODE (__t
) != __c3
3562 && TREE_CODE (__t
) != __c4
3563 && TREE_CODE (__t
) != __c5
)
3564 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3569 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3570 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3571 enum tree_code __c4
, enum tree_code __c5
)
3573 if (TREE_CODE (__t
) == __c1
3574 || TREE_CODE (__t
) == __c2
3575 || TREE_CODE (__t
) == __c3
3576 || TREE_CODE (__t
) == __c4
3577 || TREE_CODE (__t
) == __c5
)
3578 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3583 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3584 const char *__f
, int __l
, const char *__g
)
3586 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3587 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3592 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3593 const char *__f
, int __l
, const char *__g
)
3595 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3596 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3601 tree_range_check (const_tree __t
,
3602 enum tree_code __code1
, enum tree_code __code2
,
3603 const char *__f
, int __l
, const char *__g
)
3605 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3606 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3611 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3612 const char *__f
, int __l
, const char *__g
)
3614 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3615 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3616 if (__t
->omp_clause
.code
!= __code
)
3617 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3622 omp_clause_range_check (const_tree __t
,
3623 enum omp_clause_code __code1
,
3624 enum omp_clause_code __code2
,
3625 const char *__f
, int __l
, const char *__g
)
3627 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3628 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3629 if ((int) __t
->omp_clause
.code
< (int) __code1
3630 || (int) __t
->omp_clause
.code
> (int) __code2
)
3631 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3636 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3638 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3639 if (!IS_EXPR_CODE_CLASS (__c
))
3640 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3645 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3648 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3652 # if GCC_VERSION >= 4006
3653 #pragma GCC diagnostic push
3654 #pragma GCC diagnostic ignored "-Wstrict-overflow"
3658 tree_vec_elt_check (const_tree __t
, int __i
,
3659 const char *__f
, int __l
, const char *__g
)
3661 if (TREE_CODE (__t
) != TREE_VEC
)
3662 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3663 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3664 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3665 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3666 //return &__t->vec.a[__i];
3669 # if GCC_VERSION >= 4006
3670 #pragma GCC diagnostic pop
3674 omp_clause_elt_check (const_tree __t
, int __i
,
3675 const char *__f
, int __l
, const char *__g
)
3677 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3678 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3679 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3680 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3681 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3685 any_integral_type_check (const_tree __t
, const char *__f
, int __l
,
3688 if (!ANY_INTEGRAL_TYPE_P (__t
))
3689 tree_check_failed (__t
, __f
, __l
, __g
, BOOLEAN_TYPE
, ENUMERAL_TYPE
,
3696 /* Compute the number of operands in an expression node NODE. For
3697 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3698 otherwise it is looked up from the node's code. */
3700 tree_operand_length (const_tree node
)
3702 if (VL_EXP_CLASS_P (node
))
3703 return VL_EXP_OPERAND_LENGTH (node
);
3705 return TREE_CODE_LENGTH (TREE_CODE (node
));
3708 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3710 /* Special checks for TREE_OPERANDs. */
3712 tree_operand_check (tree __t
, int __i
,
3713 const char *__f
, int __l
, const char *__g
)
3715 const_tree __u
= EXPR_CHECK (__t
);
3716 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3717 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3718 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3722 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3723 const char *__f
, int __l
, const char *__g
)
3725 if (TREE_CODE (__t
) != __code
)
3726 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3727 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3728 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3729 return &__t
->exp
.operands
[__i
];
3733 tree_operand_check (const_tree __t
, int __i
,
3734 const char *__f
, int __l
, const char *__g
)
3736 const_tree __u
= EXPR_CHECK (__t
);
3737 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3738 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3739 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3743 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3744 const char *__f
, int __l
, const char *__g
)
3746 if (TREE_CODE (__t
) != __code
)
3747 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3748 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3749 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3750 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3755 /* True iff an identifier matches a C string. */
3758 id_equal (const_tree id
, const char *str
)
3760 return !strcmp (IDENTIFIER_POINTER (id
), str
);
3764 id_equal (const char *str
, const_tree id
)
3766 return !strcmp (str
, IDENTIFIER_POINTER (id
));
3769 /* Return the number of elements in the VECTOR_TYPE given by NODE. */
3772 TYPE_VECTOR_SUBPARTS (const_tree node
)
3774 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3775 unsigned int precision
= VECTOR_TYPE_CHECK (node
)->type_common
.precision
;
3776 if (NUM_POLY_INT_COEFFS
== 2)
3778 /* See the corresponding code in SET_TYPE_VECTOR_SUBPARTS for a
3779 description of the encoding. */
3780 poly_uint64 res
= 0;
3781 res
.coeffs
[0] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3782 if (precision
& 0x100)
3783 res
.coeffs
[1] = HOST_WIDE_INT_1U
<< (precision
& 0xff);
3787 return HOST_WIDE_INT_1U
<< precision
;
3790 /* Set the number of elements in VECTOR_TYPE NODE to SUBPARTS, which must
3791 satisfy valid_vector_subparts_p. */
3794 SET_TYPE_VECTOR_SUBPARTS (tree node
, poly_uint64 subparts
)
3796 STATIC_ASSERT (NUM_POLY_INT_COEFFS
<= 2);
3797 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3798 int index
= exact_log2 (coeff0
);
3799 gcc_assert (index
>= 0);
3800 if (NUM_POLY_INT_COEFFS
== 2)
3802 /* We have two coefficients that are each in the range 1 << [0, 63],
3803 so supporting all combinations would require 6 bits per coefficient
3804 and 12 bits in total. Since the precision field is only 10 bits
3805 in size, we need to be more restrictive than that.
3807 At present, coeff[1] is always either 0 (meaning that the number
3808 of units is constant) or equal to coeff[0] (meaning that the number
3809 of units is N + X * N for some target-dependent zero-based runtime
3810 parameter X). We can therefore encode coeff[1] in a single bit.
3812 The most compact encoding would be to use mask 0x3f for coeff[0]
3813 and 0x40 for coeff[1], leaving 0x380 unused. It's possible to
3814 get slightly more efficient code on some hosts if we instead
3815 treat the shift amount as an independent byte, so here we use
3816 0xff for coeff[0] and 0x100 for coeff[1]. */
3817 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3818 gcc_assert (coeff1
== 0 || coeff1
== coeff0
);
3819 VECTOR_TYPE_CHECK (node
)->type_common
.precision
3820 = index
+ (coeff1
!= 0 ? 0x100 : 0);
3823 VECTOR_TYPE_CHECK (node
)->type_common
.precision
= index
;
3826 /* Return true if we can construct vector types with the given number
3830 valid_vector_subparts_p (poly_uint64 subparts
)
3832 unsigned HOST_WIDE_INT coeff0
= subparts
.coeffs
[0];
3833 if (!pow2p_hwi (coeff0
))
3835 if (NUM_POLY_INT_COEFFS
== 2)
3837 unsigned HOST_WIDE_INT coeff1
= subparts
.coeffs
[1];
3838 if (coeff1
!= 0 && coeff1
!= coeff0
)
3844 /* In NON_LVALUE_EXPR and VIEW_CONVERT_EXPR, set when this node is merely a
3845 wrapper added to express a location_t on behalf of the node's child
3846 (e.g. by maybe_wrap_with_location). */
3848 #define EXPR_LOCATION_WRAPPER_P(NODE) \
3849 (TREE_CHECK2(NODE, NON_LVALUE_EXPR, VIEW_CONVERT_EXPR)->base.public_flag)
3851 /* Test if EXP is merely a wrapper node, added to express a location_t
3852 on behalf of the node's child (e.g. by maybe_wrap_with_location). */
3855 location_wrapper_p (const_tree exp
)
3857 /* A wrapper node has code NON_LVALUE_EXPR or VIEW_CONVERT_EXPR, and
3858 the flag EXPR_LOCATION_WRAPPER_P is set.
3859 It normally has the same type as its operand, but it can have a
3860 different one if the type of the operand has changed (e.g. when
3861 merging duplicate decls).
3863 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
3864 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST. */
3865 if ((TREE_CODE (exp
) == NON_LVALUE_EXPR
3866 || TREE_CODE (exp
) == VIEW_CONVERT_EXPR
)
3867 && EXPR_LOCATION_WRAPPER_P (exp
))
3872 /* Implementation of STRIP_ANY_LOCATION_WRAPPER. */
3875 tree_strip_any_location_wrapper (tree exp
)
3877 if (location_wrapper_p (exp
))
3878 return TREE_OPERAND (exp
, 0);
3883 #define error_mark_node global_trees[TI_ERROR_MARK]
3885 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3886 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3887 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3888 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3889 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3891 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3892 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3893 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3894 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3895 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3897 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3898 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3899 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3900 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3901 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3903 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3904 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3905 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3907 #define void_node global_trees[TI_VOID]
3909 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3910 #define integer_one_node global_trees[TI_INTEGER_ONE]
3911 #define integer_three_node global_trees[TI_INTEGER_THREE]
3912 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3913 #define size_zero_node global_trees[TI_SIZE_ZERO]
3914 #define size_one_node global_trees[TI_SIZE_ONE]
3915 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3916 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3917 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3919 /* Base access nodes. */
3920 #define access_public_node global_trees[TI_PUBLIC]
3921 #define access_protected_node global_trees[TI_PROTECTED]
3922 #define access_private_node global_trees[TI_PRIVATE]
3924 #define null_pointer_node global_trees[TI_NULL_POINTER]
3926 #define float_type_node global_trees[TI_FLOAT_TYPE]
3927 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3928 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3930 /* Nodes for particular _FloatN and _FloatNx types in sequence. */
3931 #define FLOATN_TYPE_NODE(IDX) global_trees[TI_FLOATN_TYPE_FIRST + (IDX)]
3932 #define FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_FLOATN_NX_TYPE_FIRST + (IDX)]
3933 #define FLOATNX_TYPE_NODE(IDX) global_trees[TI_FLOATNX_TYPE_FIRST + (IDX)]
3935 /* Names for individual types (code should normally iterate over all
3936 such types; these are only for back-end use, or in contexts such as
3937 *.def where iteration is not possible). */
3938 #define float16_type_node global_trees[TI_FLOAT16_TYPE]
3939 #define float32_type_node global_trees[TI_FLOAT32_TYPE]
3940 #define float64_type_node global_trees[TI_FLOAT64_TYPE]
3941 #define float128_type_node global_trees[TI_FLOAT128_TYPE]
3942 #define float32x_type_node global_trees[TI_FLOAT32X_TYPE]
3943 #define float64x_type_node global_trees[TI_FLOAT64X_TYPE]
3944 #define float128x_type_node global_trees[TI_FLOAT128X_TYPE]
3946 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3947 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3948 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3949 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3951 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3952 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3953 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3954 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3956 #define COMPLEX_FLOATN_NX_TYPE_NODE(IDX) global_trees[TI_COMPLEX_FLOATN_NX_TYPE_FIRST + (IDX)]
3958 #define void_type_node global_trees[TI_VOID_TYPE]
3959 /* The C type `void *'. */
3960 #define ptr_type_node global_trees[TI_PTR_TYPE]
3961 /* The C type `const void *'. */
3962 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3963 /* The C type `size_t'. */
3964 #define size_type_node global_trees[TI_SIZE_TYPE]
3965 #define pid_type_node global_trees[TI_PID_TYPE]
3966 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3967 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3968 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3969 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3970 /* The C type `FILE *'. */
3971 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3972 /* The C type `const struct tm *'. */
3973 #define const_tm_ptr_type_node global_trees[TI_CONST_TM_PTR_TYPE]
3974 /* The C type `fenv_t *'. */
3975 #define fenv_t_ptr_type_node global_trees[TI_FENV_T_PTR_TYPE]
3976 #define const_fenv_t_ptr_type_node global_trees[TI_CONST_FENV_T_PTR_TYPE]
3977 /* The C type `fexcept_t *'. */
3978 #define fexcept_t_ptr_type_node global_trees[TI_FEXCEPT_T_PTR_TYPE]
3979 #define const_fexcept_t_ptr_type_node global_trees[TI_CONST_FEXCEPT_T_PTR_TYPE]
3980 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3982 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3983 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3984 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3986 /* The decimal floating point types. */
3987 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3988 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3989 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3990 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3991 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3992 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3994 /* The fixed-point types. */
3995 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3996 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3997 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3998 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3999 #define sat_unsigned_short_fract_type_node \
4000 global_trees[TI_SAT_USFRACT_TYPE]
4001 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
4002 #define sat_unsigned_long_fract_type_node \
4003 global_trees[TI_SAT_ULFRACT_TYPE]
4004 #define sat_unsigned_long_long_fract_type_node \
4005 global_trees[TI_SAT_ULLFRACT_TYPE]
4006 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
4007 #define fract_type_node global_trees[TI_FRACT_TYPE]
4008 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
4009 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
4010 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
4011 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
4012 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
4013 #define unsigned_long_long_fract_type_node \
4014 global_trees[TI_ULLFRACT_TYPE]
4015 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
4016 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
4017 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
4018 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
4019 #define sat_unsigned_short_accum_type_node \
4020 global_trees[TI_SAT_USACCUM_TYPE]
4021 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
4022 #define sat_unsigned_long_accum_type_node \
4023 global_trees[TI_SAT_ULACCUM_TYPE]
4024 #define sat_unsigned_long_long_accum_type_node \
4025 global_trees[TI_SAT_ULLACCUM_TYPE]
4026 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4027 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4028 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4029 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4030 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4031 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4032 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4033 #define unsigned_long_long_accum_type_node \
4034 global_trees[TI_ULLACCUM_TYPE]
4035 #define qq_type_node global_trees[TI_QQ_TYPE]
4036 #define hq_type_node global_trees[TI_HQ_TYPE]
4037 #define sq_type_node global_trees[TI_SQ_TYPE]
4038 #define dq_type_node global_trees[TI_DQ_TYPE]
4039 #define tq_type_node global_trees[TI_TQ_TYPE]
4040 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4041 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4042 #define usq_type_node global_trees[TI_USQ_TYPE]
4043 #define udq_type_node global_trees[TI_UDQ_TYPE]
4044 #define utq_type_node global_trees[TI_UTQ_TYPE]
4045 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4046 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4047 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4048 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4049 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4050 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4051 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4052 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4053 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4054 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4055 #define ha_type_node global_trees[TI_HA_TYPE]
4056 #define sa_type_node global_trees[TI_SA_TYPE]
4057 #define da_type_node global_trees[TI_DA_TYPE]
4058 #define ta_type_node global_trees[TI_TA_TYPE]
4059 #define uha_type_node global_trees[TI_UHA_TYPE]
4060 #define usa_type_node global_trees[TI_USA_TYPE]
4061 #define uda_type_node global_trees[TI_UDA_TYPE]
4062 #define uta_type_node global_trees[TI_UTA_TYPE]
4063 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4064 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4065 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4066 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4067 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4068 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4069 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4070 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4072 /* The node that should be placed at the end of a parameter list to
4073 indicate that the function does not take a variable number of
4074 arguments. The TREE_VALUE will be void_type_node and there will be
4075 no TREE_CHAIN. Language-independent code should not assume
4076 anything else about this node. */
4077 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4079 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4080 #define MAIN_NAME_P(NODE) \
4081 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4083 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4085 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4086 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4088 /* Default/current target options (TARGET_OPTION_NODE). */
4089 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4090 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4092 /* Default tree list option(), optimize() pragmas to be linked into the
4094 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4095 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4097 /* SCEV analyzer global shared trees. */
4098 #define chrec_not_analyzed_yet NULL_TREE
4099 #define chrec_dont_know global_trees[TI_CHREC_DONT_KNOW]
4100 #define chrec_known global_trees[TI_CHREC_KNOWN]
4102 #define char_type_node integer_types[itk_char]
4103 #define signed_char_type_node integer_types[itk_signed_char]
4104 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4105 #define short_integer_type_node integer_types[itk_short]
4106 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4107 #define integer_type_node integer_types[itk_int]
4108 #define unsigned_type_node integer_types[itk_unsigned_int]
4109 #define long_integer_type_node integer_types[itk_long]
4110 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4111 #define long_long_integer_type_node integer_types[itk_long_long]
4112 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4114 /* True if NODE is an erroneous expression. */
4116 #define error_operand_p(NODE) \
4117 ((NODE) == error_mark_node \
4118 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4120 /* Return the number of elements encoded directly in a VECTOR_CST. */
4123 vector_cst_encoded_nelts (const_tree t
)
4125 return VECTOR_CST_NPATTERNS (t
) * VECTOR_CST_NELTS_PER_PATTERN (t
);
4128 extern tree
decl_assembler_name (tree
);
4129 extern void overwrite_decl_assembler_name (tree decl
, tree name
);
4130 extern tree
decl_comdat_group (const_tree
);
4131 extern tree
decl_comdat_group_id (const_tree
);
4132 extern const char *decl_section_name (const_tree
);
4133 extern void set_decl_section_name (tree
, const char *);
4134 extern enum tls_model
decl_tls_model (const_tree
);
4135 extern void set_decl_tls_model (tree
, enum tls_model
);
4137 /* Compute the number of bytes occupied by 'node'. This routine only
4138 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4140 extern size_t tree_size (const_tree
);
4142 /* Compute the number of bytes occupied by a tree with code CODE.
4143 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
4144 which are of variable length. */
4145 extern size_t tree_code_size (enum tree_code
);
4147 /* Allocate and return a new UID from the DECL_UID namespace. */
4148 extern int allocate_decl_uid (void);
4150 /* Lowest level primitive for allocating a node.
4151 The TREE_CODE is the only argument. Contents are initialized
4152 to zero except for a few of the common fields. */
4154 extern tree
make_node (enum tree_code CXX_MEM_STAT_INFO
);
4156 /* Free tree node. */
4158 extern void free_node (tree
);
4160 /* Make a copy of a node, with all the same contents. */
4162 extern tree
copy_node (tree CXX_MEM_STAT_INFO
);
4164 /* Make a copy of a chain of TREE_LIST nodes. */
4166 extern tree
copy_list (tree
);
4168 /* Make a CASE_LABEL_EXPR. */
4170 extern tree
build_case_label (tree
, tree
, tree
);
4173 extern tree
make_tree_binfo (unsigned CXX_MEM_STAT_INFO
);
4175 /* Make an INTEGER_CST. */
4177 extern tree
make_int_cst (int, int CXX_MEM_STAT_INFO
);
4179 /* Make a TREE_VEC. */
4181 extern tree
make_tree_vec (int CXX_MEM_STAT_INFO
);
4183 /* Grow a TREE_VEC. */
4185 extern tree
grow_tree_vec (tree v
, int CXX_MEM_STAT_INFO
);
4187 /* Construct various types of nodes. */
4189 extern tree
build_nt (enum tree_code
, ...);
4190 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
4192 extern tree
build0 (enum tree_code
, tree CXX_MEM_STAT_INFO
);
4193 extern tree
build1 (enum tree_code
, tree
, tree CXX_MEM_STAT_INFO
);
4194 extern tree
build2 (enum tree_code
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4195 extern tree
build3 (enum tree_code
, tree
, tree
, tree
, tree CXX_MEM_STAT_INFO
);
4196 extern tree
build4 (enum tree_code
, tree
, tree
, tree
, tree
,
4197 tree CXX_MEM_STAT_INFO
);
4198 extern tree
build5 (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4199 tree CXX_MEM_STAT_INFO
);
4201 /* _loc versions of build[1-5]. */
4204 build1_loc (location_t loc
, enum tree_code code
, tree type
,
4205 tree arg1 CXX_MEM_STAT_INFO
)
4207 tree t
= build1 (code
, type
, arg1 PASS_MEM_STAT
);
4208 if (CAN_HAVE_LOCATION_P (t
))
4209 SET_EXPR_LOCATION (t
, loc
);
4214 build2_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4215 tree arg1 CXX_MEM_STAT_INFO
)
4217 tree t
= build2 (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4218 if (CAN_HAVE_LOCATION_P (t
))
4219 SET_EXPR_LOCATION (t
, loc
);
4224 build3_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4225 tree arg1
, tree arg2 CXX_MEM_STAT_INFO
)
4227 tree t
= build3 (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4228 if (CAN_HAVE_LOCATION_P (t
))
4229 SET_EXPR_LOCATION (t
, loc
);
4234 build4_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4235 tree arg1
, tree arg2
, tree arg3 CXX_MEM_STAT_INFO
)
4237 tree t
= build4 (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4238 if (CAN_HAVE_LOCATION_P (t
))
4239 SET_EXPR_LOCATION (t
, loc
);
4244 build5_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4245 tree arg1
, tree arg2
, tree arg3
, tree arg4 CXX_MEM_STAT_INFO
)
4247 tree t
= build5 (code
, type
, arg0
, arg1
, arg2
, arg3
,
4248 arg4 PASS_MEM_STAT
);
4249 if (CAN_HAVE_LOCATION_P (t
))
4250 SET_EXPR_LOCATION (t
, loc
);
4254 /* Constructs double_int from tree CST. */
4256 extern tree
double_int_to_tree (tree
, double_int
);
4258 extern tree
wide_int_to_tree (tree type
, const poly_wide_int_ref
&cst
);
4259 extern tree
force_fit_type (tree
, const poly_wide_int_ref
&, int, bool);
4261 /* Create an INT_CST node with a CST value zero extended. */
4264 extern tree
build_int_cst (tree
, poly_int64
);
4265 extern tree
build_int_cstu (tree type
, poly_uint64
);
4266 extern tree
build_int_cst_type (tree
, poly_int64
);
4267 extern tree
make_vector (unsigned, unsigned CXX_MEM_STAT_INFO
);
4268 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
4269 extern tree
build_vector_from_val (tree
, tree
);
4270 extern tree
build_uniform_cst (tree
, tree
);
4271 extern tree
build_vec_series (tree
, tree
, tree
);
4272 extern tree
build_index_vector (tree
, poly_uint64
, poly_uint64
);
4273 extern void recompute_constructor_flags (tree
);
4274 extern void verify_constructor_flags (tree
);
4275 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> * CXX_MEM_STAT_INFO
);
4276 extern tree
build_constructor_single (tree
, tree
, tree
);
4277 extern tree
build_constructor_from_list (tree
, tree
);
4278 extern tree
build_constructor_va (tree
, int, ...);
4279 extern tree
build_clobber (tree
);
4280 extern tree
build_real_from_int_cst (tree
, const_tree
);
4281 extern tree
build_complex (tree
, tree
, tree
);
4282 extern tree
build_complex_inf (tree
, bool);
4283 extern tree
build_each_one_cst (tree
);
4284 extern tree
build_one_cst (tree
);
4285 extern tree
build_minus_one_cst (tree
);
4286 extern tree
build_all_ones_cst (tree
);
4287 extern tree
build_zero_cst (tree
);
4288 extern tree
build_string (int, const char *);
4289 extern tree
build_poly_int_cst (tree
, const poly_wide_int_ref
&);
4290 extern tree
build_tree_list (tree
, tree CXX_MEM_STAT_INFO
);
4291 extern tree
build_tree_list_vec (const vec
<tree
, va_gc
> * CXX_MEM_STAT_INFO
);
4292 extern tree
build_decl (location_t
, enum tree_code
,
4293 tree
, tree CXX_MEM_STAT_INFO
);
4294 extern tree
build_fn_decl (const char *, tree
);
4295 extern tree
build_translation_unit_decl (tree
);
4296 extern tree
build_block (tree
, tree
, tree
, tree
);
4297 extern tree
build_empty_stmt (location_t
);
4298 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4300 extern tree
build_vl_exp (enum tree_code
, int CXX_MEM_STAT_INFO
);
4302 extern tree
build_call_nary (tree
, tree
, int, ...);
4303 extern tree
build_call_valist (tree
, tree
, int, va_list);
4304 #define build_call_array(T1,T2,N,T3)\
4305 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4306 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4307 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
4308 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4309 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4310 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4311 extern tree
build_call_expr (tree
, int, ...);
4312 extern tree
build_call_expr_internal_loc (location_t
, enum internal_fn
,
4314 extern tree
build_call_expr_internal_loc_array (location_t
, enum internal_fn
,
4315 tree
, int, const tree
*);
4316 extern tree
maybe_build_call_expr_loc (location_t
, combined_fn
, tree
,
4318 extern tree
build_alloca_call_expr (tree
, unsigned int, HOST_WIDE_INT
);
4319 extern tree
build_string_literal (int, const char *, tree
= char_type_node
);
4321 /* Construct various nodes representing data types. */
4323 extern tree
signed_or_unsigned_type_for (int, tree
);
4324 extern tree
signed_type_for (tree
);
4325 extern tree
unsigned_type_for (tree
);
4326 extern tree
truth_type_for (tree
);
4327 extern tree
build_pointer_type_for_mode (tree
, machine_mode
, bool);
4328 extern tree
build_pointer_type (tree
);
4329 extern tree
build_reference_type_for_mode (tree
, machine_mode
, bool);
4330 extern tree
build_reference_type (tree
);
4331 extern tree
build_vector_type_for_mode (tree
, machine_mode
);
4332 extern tree
build_vector_type (tree
, poly_int64
);
4333 extern tree
build_truth_vector_type (poly_uint64
, poly_uint64
);
4334 extern tree
build_same_sized_truth_vector_type (tree vectype
);
4335 extern tree
build_opaque_vector_type (tree
, poly_int64
);
4336 extern tree
build_index_type (tree
);
4337 extern tree
build_array_type (tree
, tree
, bool = false);
4338 extern tree
build_nonshared_array_type (tree
, tree
);
4339 extern tree
build_array_type_nelts (tree
, poly_uint64
);
4340 extern tree
build_function_type (tree
, tree
);
4341 extern tree
build_function_type_list (tree
, ...);
4342 extern tree
build_varargs_function_type_list (tree
, ...);
4343 extern tree
build_function_type_array (tree
, int, tree
*);
4344 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4345 #define build_function_type_vec(RET, V) \
4346 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
4347 #define build_varargs_function_type_vec(RET, V) \
4348 build_varargs_function_type_array (RET, vec_safe_length (V), \
4349 vec_safe_address (V))
4350 extern tree
build_method_type_directly (tree
, tree
, tree
);
4351 extern tree
build_method_type (tree
, tree
);
4352 extern tree
build_offset_type (tree
, tree
);
4353 extern tree
build_complex_type (tree
, bool named
= false);
4354 extern tree
array_type_nelts (const_tree
);
4356 extern tree
value_member (tree
, tree
);
4357 extern tree
purpose_member (const_tree
, tree
);
4358 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
4359 extern tree
chain_index (int, tree
);
4361 /* Arguments may be null. */
4362 extern int tree_int_cst_equal (const_tree
, const_tree
);
4364 /* The following predicates are safe to call with a null argument. */
4365 extern bool tree_fits_shwi_p (const_tree
) ATTRIBUTE_PURE
;
4366 extern bool tree_fits_poly_int64_p (const_tree
) ATTRIBUTE_PURE
;
4367 extern bool tree_fits_uhwi_p (const_tree
) ATTRIBUTE_PURE
;
4368 extern bool tree_fits_poly_uint64_p (const_tree
) ATTRIBUTE_PURE
;
4370 extern HOST_WIDE_INT
tree_to_shwi (const_tree
)
4371 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4372 extern poly_int64
tree_to_poly_int64 (const_tree
)
4373 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4374 extern unsigned HOST_WIDE_INT
tree_to_uhwi (const_tree
)
4375 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4376 extern poly_uint64
tree_to_poly_uint64 (const_tree
)
4377 ATTRIBUTE_NONNULL (1) ATTRIBUTE_PURE
;
4378 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4379 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4380 tree_to_shwi (const_tree t
)
4382 gcc_assert (tree_fits_shwi_p (t
));
4383 return TREE_INT_CST_LOW (t
);
4386 extern inline __attribute__ ((__gnu_inline__
)) unsigned HOST_WIDE_INT
4387 tree_to_uhwi (const_tree t
)
4389 gcc_assert (tree_fits_uhwi_p (t
));
4390 return TREE_INT_CST_LOW (t
);
4392 #if NUM_POLY_INT_COEFFS == 1
4393 extern inline __attribute__ ((__gnu_inline__
)) poly_int64
4394 tree_to_poly_int64 (const_tree t
)
4396 gcc_assert (tree_fits_poly_int64_p (t
));
4397 return TREE_INT_CST_LOW (t
);
4400 extern inline __attribute__ ((__gnu_inline__
)) poly_uint64
4401 tree_to_poly_uint64 (const_tree t
)
4403 gcc_assert (tree_fits_poly_uint64_p (t
));
4404 return TREE_INT_CST_LOW (t
);
4408 extern int tree_int_cst_sgn (const_tree
);
4409 extern int tree_int_cst_sign_bit (const_tree
);
4410 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
4411 extern tree
strip_array_types (tree
);
4412 extern tree
excess_precision_type (tree
);
4414 /* Desription of the reason why the argument of valid_constant_size_p
4415 is not a valid size. */
4416 enum cst_size_error
{
4418 cst_size_not_constant
,
4424 extern bool valid_constant_size_p (const_tree
, cst_size_error
* = NULL
);
4425 extern tree
max_object_size ();
4427 /* Return true if T holds a value that can be represented as a poly_int64
4428 without loss of precision. Store the value in *VALUE if so. */
4431 poly_int_tree_p (const_tree t
, poly_int64_pod
*value
)
4433 if (tree_fits_poly_int64_p (t
))
4435 *value
= tree_to_poly_int64 (t
);
4441 /* Return true if T holds a value that can be represented as a poly_uint64
4442 without loss of precision. Store the value in *VALUE if so. */
4445 poly_int_tree_p (const_tree t
, poly_uint64_pod
*value
)
4447 if (tree_fits_poly_uint64_p (t
))
4449 *value
= tree_to_poly_uint64 (t
);
4455 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4456 put the prototype here. Rtl.h does declare the prototype if
4457 tree.h had been included. */
4459 extern tree
make_tree (tree
, rtx
);
4461 /* Returns true iff CAND and BASE have equivalent language-specific
4464 extern bool check_lang_type (const_tree cand
, const_tree base
);
4466 /* Returns true iff unqualified CAND and BASE are equivalent. */
4468 extern bool check_base_type (const_tree cand
, const_tree base
);
4470 /* Check whether CAND is suitable to be returned from get_qualified_type
4471 (BASE, TYPE_QUALS). */
4473 extern bool check_qualified_type (const_tree
, const_tree
, int);
4475 /* Return a version of the TYPE, qualified as indicated by the
4476 TYPE_QUALS, if one exists. If no qualified version exists yet,
4477 return NULL_TREE. */
4479 extern tree
get_qualified_type (tree
, int);
4481 /* Like get_qualified_type, but creates the type if it does not
4482 exist. This function never returns NULL_TREE. */
4484 extern tree
build_qualified_type (tree
, int CXX_MEM_STAT_INFO
);
4486 /* Create a variant of type T with alignment ALIGN. */
4488 extern tree
build_aligned_type (tree
, unsigned int);
4490 /* Like build_qualified_type, but only deals with the `const' and
4491 `volatile' qualifiers. This interface is retained for backwards
4492 compatibility with the various front-ends; new code should use
4493 build_qualified_type instead. */
4495 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4496 build_qualified_type ((TYPE), \
4497 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4498 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4500 /* Make a copy of a type node. */
4502 extern tree
build_distinct_type_copy (tree CXX_MEM_STAT_INFO
);
4503 extern tree
build_variant_type_copy (tree CXX_MEM_STAT_INFO
);
4505 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4506 return a canonicalized ..._TYPE node, so that duplicates are not made.
4507 How the hash code is computed is up to the caller, as long as any two
4508 callers that could hash identical-looking type nodes agree. */
4510 extern hashval_t
type_hash_canon_hash (tree
);
4511 extern tree
type_hash_canon (unsigned int, tree
);
4513 extern tree
convert (tree
, tree
);
4514 extern unsigned int expr_align (const_tree
);
4515 extern tree
size_in_bytes_loc (location_t
, const_tree
);
4517 size_in_bytes (const_tree t
)
4519 return size_in_bytes_loc (input_location
, t
);
4522 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4523 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4524 extern tree
bit_position (const_tree
);
4525 extern tree
byte_position (const_tree
);
4526 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4528 /* Type for sizes of data-type. */
4530 #define sizetype sizetype_tab[(int) stk_sizetype]
4531 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4532 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4533 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4534 #define size_int(L) size_int_kind (L, stk_sizetype)
4535 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4536 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4537 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4539 /* Log2 of BITS_PER_UNIT. */
4541 #if BITS_PER_UNIT == 8
4542 #define LOG2_BITS_PER_UNIT 3
4543 #elif BITS_PER_UNIT == 16
4544 #define LOG2_BITS_PER_UNIT 4
4546 #error Unknown BITS_PER_UNIT
4549 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4550 by making the last node in X point to Y.
4551 Returns X, except if X is 0 returns Y. */
4553 extern tree
chainon (tree
, tree
);
4555 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4557 extern tree
tree_cons (tree
, tree
, tree CXX_MEM_STAT_INFO
);
4559 /* Return the last tree node in a chain. */
4561 extern tree
tree_last (tree
);
4563 /* Reverse the order of elements in a chain, and return the new head. */
4565 extern tree
nreverse (tree
);
4567 /* Returns the length of a chain of nodes
4568 (number of chain pointers to follow before reaching a null pointer). */
4570 extern int list_length (const_tree
);
4572 /* Returns the first FIELD_DECL in a type. */
4574 extern tree
first_field (const_tree
);
4576 /* Given an initializer INIT, return TRUE if INIT is zero or some
4577 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
4578 null, set *NONZERO if and only if INIT is known not to be all
4579 zeros. The combination of return value of false and *NONZERO
4580 false implies that INIT may but need not be all zeros. Other
4581 combinations indicate definitive answers. */
4583 extern bool initializer_zerop (const_tree
, bool * = NULL
);
4584 extern bool initializer_each_zero_or_onep (const_tree
);
4586 extern wide_int
vector_cst_int_elt (const_tree
, unsigned int);
4587 extern tree
vector_cst_elt (const_tree
, unsigned int);
4589 /* Given a vector VEC, return its first element if all elements are
4590 the same. Otherwise return NULL_TREE. */
4592 extern tree
uniform_vector_p (const_tree
);
4594 /* If the argument is INTEGER_CST, return it. If the argument is vector
4595 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
4596 return NULL_TREE. */
4598 extern tree
uniform_integer_cst_p (tree
);
4600 extern int single_nonzero_element (const_tree
);
4602 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4604 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4606 /* zerop (tree x) is nonzero if X is a constant of value 0. */
4608 extern bool zerop (const_tree
);
4610 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4612 extern bool integer_zerop (const_tree
);
4614 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4616 extern bool integer_onep (const_tree
);
4618 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4619 a vector or complex where each part is 1. */
4621 extern bool integer_each_onep (const_tree
);
4623 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4624 all of whose significant bits are 1. */
4626 extern bool integer_all_onesp (const_tree
);
4628 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4631 extern bool integer_minus_onep (const_tree
);
4633 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4634 exactly one bit 1. */
4636 extern bool integer_pow2p (const_tree
);
4638 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4639 with a nonzero value. */
4641 extern bool integer_nonzerop (const_tree
);
4643 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4644 a vector where each element is an integer constant of value -1. */
4646 extern bool integer_truep (const_tree
);
4648 extern bool cst_and_fits_in_hwi (const_tree
);
4649 extern tree
num_ending_zeros (const_tree
);
4651 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4654 extern bool fixed_zerop (const_tree
);
4656 /* staticp (tree x) is nonzero if X is a reference to data allocated
4657 at a fixed address in memory. Returns the outermost data. */
4659 extern tree
staticp (tree
);
4661 /* save_expr (EXP) returns an expression equivalent to EXP
4662 but it can be used multiple times within context CTX
4663 and only evaluate EXP once. */
4665 extern tree
save_expr (tree
);
4667 /* Return true if T is function-invariant. */
4669 extern bool tree_invariant_p (tree
);
4671 /* Look inside EXPR into any simple arithmetic operations. Return the
4672 outermost non-arithmetic or non-invariant node. */
4674 extern tree
skip_simple_arithmetic (tree
);
4676 /* Look inside EXPR into simple arithmetic operations involving constants.
4677 Return the outermost non-arithmetic or non-constant node. */
4679 extern tree
skip_simple_constant_arithmetic (tree
);
4681 /* Return which tree structure is used by T. */
4683 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4685 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4686 size or offset that depends on a field within a record. */
4688 extern bool contains_placeholder_p (const_tree
);
4690 /* This macro calls the above function but short-circuits the common
4691 case of a constant to save time. Also check for null. */
4693 #define CONTAINS_PLACEHOLDER_P(EXP) \
4694 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4696 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4697 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4700 extern bool type_contains_placeholder_p (tree
);
4702 /* Given a tree EXP, find all occurrences of references to fields
4703 in a PLACEHOLDER_EXPR and place them in vector REFS without
4704 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4705 we assume here that EXP contains only arithmetic expressions
4706 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4709 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4711 /* This macro calls the above function but short-circuits the common
4712 case of a constant to save time and also checks for NULL. */
4714 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4716 if((EXP) && !TREE_CONSTANT (EXP)) \
4717 find_placeholder_in_expr (EXP, V); \
4720 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4721 return a tree with all occurrences of references to F in a
4722 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4723 CONST_DECLs. Note that we assume here that EXP contains only
4724 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4725 occurring only in their argument list. */
4727 extern tree
substitute_in_expr (tree
, tree
, tree
);
4729 /* This macro calls the above function but short-circuits the common
4730 case of a constant to save time and also checks for NULL. */
4732 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4733 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4735 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4736 for it within OBJ, a tree that is an object or a chain of references. */
4738 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4740 /* This macro calls the above function but short-circuits the common
4741 case of a constant to save time and also checks for NULL. */
4743 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4744 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4745 : substitute_placeholder_in_expr (EXP, OBJ))
4748 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4749 but it can be used multiple times
4750 and only evaluate the subexpressions once. */
4752 extern tree
stabilize_reference (tree
);
4754 /* Return EXP, stripped of any conversions to wider types
4755 in such a way that the result of converting to type FOR_TYPE
4756 is the same as if EXP were converted to FOR_TYPE.
4757 If FOR_TYPE is 0, it signifies EXP's type. */
4759 extern tree
get_unwidened (tree
, tree
);
4761 /* Return OP or a simpler expression for a narrower value
4762 which can be sign-extended or zero-extended to give back OP.
4763 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4764 or 0 if the value should be sign-extended. */
4766 extern tree
get_narrower (tree
, int *);
4768 /* Return true if T is an expression that get_inner_reference handles. */
4771 handled_component_p (const_tree t
)
4773 switch (TREE_CODE (t
))
4778 case ARRAY_RANGE_REF
:
4781 case VIEW_CONVERT_EXPR
:
4789 /* Return true T is a component with reverse storage order. */
4792 reverse_storage_order_for_component_p (tree t
)
4794 /* The storage order only applies to scalar components. */
4795 if (AGGREGATE_TYPE_P (TREE_TYPE (t
)) || VECTOR_TYPE_P (TREE_TYPE (t
)))
4798 if (TREE_CODE (t
) == REALPART_EXPR
|| TREE_CODE (t
) == IMAGPART_EXPR
)
4799 t
= TREE_OPERAND (t
, 0);
4801 switch (TREE_CODE (t
))
4805 /* ??? Fortran can take COMPONENT_REF of a VOID_TYPE. */
4806 /* ??? UBSan can take COMPONENT_REF of a REFERENCE_TYPE. */
4807 return AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0)))
4808 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (TREE_OPERAND (t
, 0)));
4812 return REF_REVERSE_STORAGE_ORDER (t
);
4814 case ARRAY_RANGE_REF
:
4815 case VIEW_CONVERT_EXPR
:
4823 /* Return true if T is a storage order barrier, i.e. a VIEW_CONVERT_EXPR
4824 that can modify the storage order of objects. Note that, even if the
4825 TYPE_REVERSE_STORAGE_ORDER flag is set on both the inner type and the
4826 outer type, a VIEW_CONVERT_EXPR can modify the storage order because
4827 it can change the partition of the aggregate object into scalars. */
4830 storage_order_barrier_p (const_tree t
)
4832 if (TREE_CODE (t
) != VIEW_CONVERT_EXPR
)
4835 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4836 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (t
)))
4839 tree op
= TREE_OPERAND (t
, 0);
4841 if (AGGREGATE_TYPE_P (TREE_TYPE (op
))
4842 && TYPE_REVERSE_STORAGE_ORDER (TREE_TYPE (op
)))
4848 /* Given a DECL or TYPE, return the scope in which it was declared, or
4849 NUL_TREE if there is no containing scope. */
4851 extern tree
get_containing_scope (const_tree
);
4853 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
4855 extern const_tree
get_ultimate_context (const_tree
);
4857 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4859 extern tree
decl_function_context (const_tree
);
4861 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4862 this _DECL with its context, or zero if none. */
4863 extern tree
decl_type_context (const_tree
);
4865 /* Return true if EXPR is the real constant zero. */
4866 extern bool real_zerop (const_tree
);
4868 /* Initialize the iterator I with arguments from function FNDECL */
4871 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4873 i
->next
= TYPE_ARG_TYPES (fntype
);
4876 /* Return a pointer that holds the next argument if there are more arguments to
4877 handle, otherwise return NULL. */
4879 static inline tree
*
4880 function_args_iter_cond_ptr (function_args_iterator
*i
)
4882 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4885 /* Return the next argument if there are more arguments to handle, otherwise
4889 function_args_iter_cond (function_args_iterator
*i
)
4891 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4894 /* Advance to the next argument. */
4896 function_args_iter_next (function_args_iterator
*i
)
4898 gcc_assert (i
->next
!= NULL_TREE
);
4899 i
->next
= TREE_CHAIN (i
->next
);
4902 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4905 inlined_function_outer_scope_p (const_tree block
)
4907 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4910 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4911 to point to the next tree element. ITER is an instance of
4912 function_args_iterator used to iterate the arguments. */
4913 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4914 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4915 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4916 function_args_iter_next (&(ITER)))
4918 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4919 to the next tree element. ITER is an instance of function_args_iterator
4920 used to iterate the arguments. */
4921 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4922 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4923 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4924 function_args_iter_next (&(ITER)))
4927 extern unsigned crc32_unsigned_n (unsigned, unsigned, unsigned);
4928 extern unsigned crc32_string (unsigned, const char *);
4930 crc32_unsigned (unsigned chksum
, unsigned value
)
4932 return crc32_unsigned_n (chksum
, value
, 4);
4935 crc32_byte (unsigned chksum
, char byte
)
4937 return crc32_unsigned_n (chksum
, byte
, 1);
4939 extern void clean_symbol_name (char *);
4940 extern tree
get_file_function_name (const char *);
4941 extern tree
get_callee_fndecl (const_tree
);
4942 extern combined_fn
get_call_combined_fn (const_tree
);
4943 extern int type_num_arguments (const_tree
);
4944 extern tree
type_argument_type (const_tree
, unsigned) ATTRIBUTE_NONNULL (1);
4945 extern bool associative_tree_code (enum tree_code
);
4946 extern bool commutative_tree_code (enum tree_code
);
4947 extern bool commutative_ternary_tree_code (enum tree_code
);
4948 extern bool operation_can_overflow (enum tree_code
);
4949 extern bool operation_no_trapping_overflow (tree
, enum tree_code
);
4950 extern tree
upper_bound_in_type (tree
, tree
);
4951 extern tree
lower_bound_in_type (tree
, tree
);
4952 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4953 extern tree
create_artificial_label (location_t
);
4954 extern const char *get_name (tree
);
4955 extern bool stdarg_p (const_tree
);
4956 extern bool prototype_p (const_tree
);
4957 extern bool is_typedef_decl (const_tree x
);
4958 extern bool typedef_variant_p (const_tree
);
4959 extern bool auto_var_p (const_tree
);
4960 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4961 extern tree
build_low_bits_mask (tree
, unsigned);
4962 extern bool tree_nop_conversion_p (const_tree
, const_tree
);
4963 extern tree
tree_strip_nop_conversions (tree
);
4964 extern tree
tree_strip_sign_nop_conversions (tree
);
4965 extern const_tree
strip_invariant_refs (const_tree
);
4966 extern tree
lhd_gcc_personality (void);
4967 extern void assign_assembler_name_if_needed (tree
);
4968 extern bool warn_deprecated_use (tree
, tree
);
4969 extern void cache_integer_cst (tree
);
4970 extern const char *combined_fn_name (combined_fn
);
4972 /* Compare and hash for any structure which begins with a canonical
4973 pointer. Assumes all pointers are interchangeable, which is sort
4974 of already assumed by gcc elsewhere IIRC. */
4977 struct_ptr_eq (const void *a
, const void *b
)
4979 const void * const * x
= (const void * const *) a
;
4980 const void * const * y
= (const void * const *) b
;
4984 static inline hashval_t
4985 struct_ptr_hash (const void *a
)
4987 const void * const * x
= (const void * const *) a
;
4988 return (intptr_t)*x
>> 4;
4991 /* Return nonzero if CODE is a tree code that represents a truth value. */
4993 truth_value_p (enum tree_code code
)
4995 return (TREE_CODE_CLASS (code
) == tcc_comparison
4996 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4997 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4998 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5001 /* Return whether TYPE is a type suitable for an offset for
5002 a POINTER_PLUS_EXPR. */
5004 ptrofftype_p (tree type
)
5006 return (INTEGRAL_TYPE_P (type
)
5007 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5008 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5011 /* Return true if the argument is a complete type or an array
5012 of unknown bound (whose type is incomplete but) whose elements
5013 have complete type. */
5015 complete_or_array_type_p (const_tree type
)
5017 return COMPLETE_TYPE_P (type
)
5018 || (TREE_CODE (type
) == ARRAY_TYPE
5019 && COMPLETE_TYPE_P (TREE_TYPE (type
)));
5022 /* Return true if the value of T could be represented as a poly_widest_int. */
5025 poly_int_tree_p (const_tree t
)
5027 return (TREE_CODE (t
) == INTEGER_CST
|| POLY_INT_CST_P (t
));
5030 /* Return the bit size of BIT_FIELD_REF T, in cases where it is known
5031 to be a poly_uint64. (This is always true at the gimple level.) */
5034 bit_field_size (const_tree t
)
5036 return tree_to_poly_uint64 (TREE_OPERAND (t
, 1));
5039 /* Return the starting bit offset of BIT_FIELD_REF T, in cases where it is
5040 known to be a poly_uint64. (This is always true at the gimple level.) */
5043 bit_field_offset (const_tree t
)
5045 return tree_to_poly_uint64 (TREE_OPERAND (t
, 2));
5048 extern tree
strip_float_extensions (tree
);
5049 extern bool really_constant_p (const_tree
);
5050 extern bool ptrdiff_tree_p (const_tree
, poly_int64_pod
*);
5051 extern bool decl_address_invariant_p (const_tree
);
5052 extern bool decl_address_ip_invariant_p (const_tree
);
5053 extern bool int_fits_type_p (const_tree
, const_tree
)
5054 ATTRIBUTE_NONNULL (1) ATTRIBUTE_NONNULL (2) ATTRIBUTE_PURE
;
5055 #ifndef GENERATOR_FILE
5056 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5058 extern bool variably_modified_type_p (tree
, tree
);
5059 extern int tree_log2 (const_tree
);
5060 extern int tree_floor_log2 (const_tree
);
5061 extern unsigned int tree_ctz (const_tree
);
5062 extern int simple_cst_equal (const_tree
, const_tree
);
5067 extern void add_expr (const_tree
, hash
&, unsigned int = 0);
5071 /* Compat version until all callers are converted. Return hash for
5073 static inline hashval_t
iterative_hash_expr(const_tree tree
, hashval_t seed
)
5075 inchash::hash
hstate (seed
);
5076 inchash::add_expr (tree
, hstate
);
5077 return hstate
.end ();
5080 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5081 extern bool type_list_equal (const_tree
, const_tree
);
5082 extern bool chain_member (const_tree
, const_tree
);
5083 extern void dump_tree_statistics (void);
5084 extern void recompute_tree_invariant_for_addr_expr (tree
);
5085 extern bool needs_to_live_in_memory (const_tree
);
5086 extern tree
reconstruct_complex_type (tree
, tree
);
5087 extern bool real_onep (const_tree
);
5088 extern bool real_minus_onep (const_tree
);
5089 extern void init_ttree (void);
5090 extern void build_common_tree_nodes (bool);
5091 extern void build_common_builtin_nodes (void);
5092 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5093 extern tree
build_nonstandard_boolean_type (unsigned HOST_WIDE_INT
);
5094 extern tree
build_range_type (tree
, tree
, tree
);
5095 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5096 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5097 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5098 extern tree
tree_block (tree
);
5099 extern void tree_set_block (tree
, tree
);
5100 extern location_t
*block_nonartificial_location (tree
);
5101 extern location_t
tree_nonartificial_location (tree
);
5102 extern tree
block_ultimate_origin (const_tree
);
5103 extern tree
get_binfo_at_offset (tree
, poly_int64
, tree
);
5104 extern bool virtual_method_call_p (const_tree
);
5105 extern tree
obj_type_ref_class (const_tree ref
);
5106 extern bool types_same_for_odr (const_tree type1
, const_tree type2
);
5107 extern bool contains_bitfld_component_ref_p (const_tree
);
5108 extern bool block_may_fallthru (const_tree
);
5109 extern void using_eh_for_cleanups (void);
5110 extern bool using_eh_for_cleanups_p (void);
5111 extern const char *get_tree_code_name (enum tree_code
);
5112 extern void set_call_expr_flags (tree
, int);
5113 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, hash_set
<tree
>*,
5115 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5117 #define walk_tree(a,b,c,d) \
5118 walk_tree_1 (a, b, c, d, NULL)
5119 #define walk_tree_without_duplicates(a,b,c) \
5120 walk_tree_without_duplicates_1 (a, b, c, NULL)
5122 extern tree
drop_tree_overflow (tree
);
5124 /* Given a memory reference expression T, return its base address.
5125 The base address of a memory reference expression is the main
5126 object being referenced. */
5127 extern tree
get_base_address (tree t
);
5129 /* Return a tree of sizetype representing the size, in bytes, of the element
5130 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5131 extern tree
array_ref_element_size (tree
);
5133 /* Return a typenode for the "standard" C type with a given name. */
5134 extern tree
get_typenode_from_name (const char *);
5136 /* Return a tree representing the upper bound of the array mentioned in
5137 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5138 extern tree
array_ref_up_bound (tree
);
5140 /* Return a tree representing the lower bound of the array mentioned in
5141 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5142 extern tree
array_ref_low_bound (tree
);
5144 /* Returns true if REF is an array reference or a component reference
5145 to an array at the end of a structure. If this is the case, the array
5146 may be allocated larger than its upper bound implies. */
5147 extern bool array_at_struct_end_p (tree
);
5149 /* Return a tree representing the offset, in bytes, of the field referenced
5150 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5151 extern tree
component_ref_field_offset (tree
);
5153 extern int tree_map_base_eq (const void *, const void *);
5154 extern unsigned int tree_map_base_hash (const void *);
5155 extern int tree_map_base_marked_p (const void *);
5156 extern void DEBUG_FUNCTION
verify_type (const_tree t
);
5157 extern bool gimple_canonical_types_compatible_p (const_tree
, const_tree
,
5158 bool trust_type_canonical
= true);
5159 extern bool type_with_interoperable_signedness (const_tree
);
5160 extern bitmap
get_nonnull_args (const_tree
);
5161 extern int get_range_pos_neg (tree
);
5163 /* Return simplified tree code of type that is used for canonical type
5165 inline enum tree_code
5166 tree_code_for_canonical_type_merging (enum tree_code code
)
5168 /* By C standard, each enumerated type shall be compatible with char,
5169 a signed integer, or an unsigned integer. The choice of type is
5170 implementation defined (in our case it depends on -fshort-enum).
5172 For this reason we make no distinction between ENUMERAL_TYPE and INTEGER
5173 type and compare only by their signedness and precision. */
5174 if (code
== ENUMERAL_TYPE
)
5175 return INTEGER_TYPE
;
5176 /* To allow inter-operability between languages having references and
5177 C, we consider reference types and pointers alike. Note that this is
5178 not strictly necessary for C-Fortran 2008 interoperability because
5179 Fortran define C_PTR type that needs to be compatible with C pointers
5180 and we handle this one as ptr_type_node. */
5181 if (code
== REFERENCE_TYPE
)
5182 return POINTER_TYPE
;
5186 /* Return ture if get_alias_set care about TYPE_CANONICAL of given type.
5187 We don't define the types for pointers, arrays and vectors. The reason is
5188 that pointers are handled specially: ptr_type_node accesses conflict with
5189 accesses to all other pointers. This is done by alias.c.
5190 Because alias sets of arrays and vectors are the same as types of their
5191 elements, we can't compute canonical type either. Otherwise we could go
5192 form void *[10] to int *[10] (because they are equivalent for canonical type
5193 machinery) and get wrong TBAA. */
5196 canonical_type_used_p (const_tree t
)
5198 return !(POINTER_TYPE_P (t
)
5199 || TREE_CODE (t
) == ARRAY_TYPE
5200 || TREE_CODE (t
) == VECTOR_TYPE
);
5203 #define tree_map_eq tree_map_base_eq
5204 extern unsigned int tree_map_hash (const void *);
5205 #define tree_map_marked_p tree_map_base_marked_p
5207 #define tree_decl_map_eq tree_map_base_eq
5208 extern unsigned int tree_decl_map_hash (const void *);
5209 #define tree_decl_map_marked_p tree_map_base_marked_p
5211 struct tree_decl_map_cache_hasher
: ggc_cache_ptr_hash
<tree_decl_map
>
5213 static hashval_t
hash (tree_decl_map
*m
) { return tree_decl_map_hash (m
); }
5215 equal (tree_decl_map
*a
, tree_decl_map
*b
)
5217 return tree_decl_map_eq (a
, b
);
5221 keep_cache_entry (tree_decl_map
*&m
)
5223 return ggc_marked_p (m
->base
.from
);
5227 #define tree_int_map_eq tree_map_base_eq
5228 #define tree_int_map_hash tree_map_base_hash
5229 #define tree_int_map_marked_p tree_map_base_marked_p
5231 #define tree_vec_map_eq tree_map_base_eq
5232 #define tree_vec_map_hash tree_decl_map_hash
5233 #define tree_vec_map_marked_p tree_map_base_marked_p
5235 /* A hash_map of two trees for use with GTY((cache)). Garbage collection for
5236 such a map will not mark keys, and will mark values if the key is already
5238 struct tree_cache_traits
5239 : simple_cache_map_traits
<default_hash_traits
<tree
>, tree
> { };
5240 typedef hash_map
<tree
,tree
,tree_cache_traits
> tree_cache_map
;
5242 /* Initialize the abstract argument list iterator object ITER with the
5243 arguments from CALL_EXPR node EXP. */
5245 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5248 iter
->n
= call_expr_nargs (exp
);
5253 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5256 iter
->n
= call_expr_nargs (exp
);
5260 /* Return the next argument from abstract argument list iterator object ITER,
5261 and advance its state. Return NULL_TREE if there are no more arguments. */
5263 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5266 if (iter
->i
>= iter
->n
)
5268 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5273 static inline const_tree
5274 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5277 if (iter
->i
>= iter
->n
)
5279 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5284 /* Initialize the abstract argument list iterator object ITER, then advance
5285 past and return the first argument. Useful in for expressions, e.g.
5286 for (arg = first_call_expr_arg (exp, &iter); arg;
5287 arg = next_call_expr_arg (&iter)) */
5289 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5291 init_call_expr_arg_iterator (exp
, iter
);
5292 return next_call_expr_arg (iter
);
5295 static inline const_tree
5296 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5298 init_const_call_expr_arg_iterator (exp
, iter
);
5299 return next_const_call_expr_arg (iter
);
5302 /* Test whether there are more arguments in abstract argument list iterator
5303 ITER, without changing its state. */
5305 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5307 return (iter
->i
< iter
->n
);
5310 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5311 (of type call_expr_arg_iterator) to hold the iteration state. */
5312 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5313 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5314 (arg) = next_call_expr_arg (&(iter)))
5316 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5317 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5318 (arg) = next_const_call_expr_arg (&(iter)))
5320 /* Return true if tree node T is a language-specific node. */
5322 is_lang_specific (const_tree t
)
5324 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5327 /* Valid builtin number. */
5328 #define BUILTIN_VALID_P(FNCODE) \
5329 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5331 /* Return the tree node for an explicit standard builtin function or NULL. */
5333 builtin_decl_explicit (enum built_in_function fncode
)
5335 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5337 return builtin_info
[(size_t)fncode
].decl
;
5340 /* Return the tree node for an implicit builtin function or NULL. */
5342 builtin_decl_implicit (enum built_in_function fncode
)
5344 size_t uns_fncode
= (size_t)fncode
;
5345 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5347 if (!builtin_info
[uns_fncode
].implicit_p
)
5350 return builtin_info
[uns_fncode
].decl
;
5353 /* Set explicit builtin function nodes and whether it is an implicit
5357 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5359 size_t ufncode
= (size_t)fncode
;
5361 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5362 && (decl
!= NULL_TREE
|| !implicit_p
));
5364 builtin_info
[ufncode
].decl
= decl
;
5365 builtin_info
[ufncode
].implicit_p
= implicit_p
;
5366 builtin_info
[ufncode
].declared_p
= false;
5369 /* Set the implicit flag for a builtin function. */
5372 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5374 size_t uns_fncode
= (size_t)fncode
;
5376 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5377 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5379 builtin_info
[uns_fncode
].implicit_p
= implicit_p
;
5382 /* Set the declared flag for a builtin function. */
5385 set_builtin_decl_declared_p (enum built_in_function fncode
, bool declared_p
)
5387 size_t uns_fncode
= (size_t)fncode
;
5389 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5390 && builtin_info
[uns_fncode
].decl
!= NULL_TREE
);
5392 builtin_info
[uns_fncode
].declared_p
= declared_p
;
5395 /* Return whether the standard builtin function can be used as an explicit
5399 builtin_decl_explicit_p (enum built_in_function fncode
)
5401 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5402 return (builtin_info
[(size_t)fncode
].decl
!= NULL_TREE
);
5405 /* Return whether the standard builtin function can be used implicitly. */
5408 builtin_decl_implicit_p (enum built_in_function fncode
)
5410 size_t uns_fncode
= (size_t)fncode
;
5412 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5413 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5414 && builtin_info
[uns_fncode
].implicit_p
);
5417 /* Return whether the standard builtin function was declared. */
5420 builtin_decl_declared_p (enum built_in_function fncode
)
5422 size_t uns_fncode
= (size_t)fncode
;
5424 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5425 return (builtin_info
[uns_fncode
].decl
!= NULL_TREE
5426 && builtin_info
[uns_fncode
].declared_p
);
5429 /* Return true if T (assumed to be a DECL) is a global variable.
5430 A variable is considered global if its storage is not automatic. */
5433 is_global_var (const_tree t
)
5435 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5438 /* Return true if VAR may be aliased. A variable is considered as
5439 maybe aliased if it has its address taken by the local TU
5440 or possibly by another TU and might be modified through a pointer. */
5443 may_be_aliased (const_tree var
)
5445 return (TREE_CODE (var
) != CONST_DECL
5446 && (TREE_PUBLIC (var
)
5447 || DECL_EXTERNAL (var
)
5448 || TREE_ADDRESSABLE (var
))
5449 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5450 && (TREE_READONLY (var
)
5451 || (TREE_CODE (var
) == VAR_DECL
5452 && DECL_NONALIASED (var
)))));
5455 /* Return pointer to optimization flags of FNDECL. */
5456 static inline struct cl_optimization
*
5457 opts_for_fn (const_tree fndecl
)
5459 tree fn_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl
);
5460 if (fn_opts
== NULL_TREE
)
5461 fn_opts
= optimization_default_node
;
5462 return TREE_OPTIMIZATION (fn_opts
);
5465 /* Return pointer to target flags of FNDECL. */
5466 static inline cl_target_option
*
5467 target_opts_for_fn (const_tree fndecl
)
5469 tree fn_opts
= DECL_FUNCTION_SPECIFIC_TARGET (fndecl
);
5470 if (fn_opts
== NULL_TREE
)
5471 fn_opts
= target_option_default_node
;
5472 return fn_opts
== NULL_TREE
? NULL
: TREE_TARGET_OPTION (fn_opts
);
5475 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
5476 the optimization level of function fndecl. */
5477 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
5479 /* For anonymous aggregate types, we need some sort of name to
5480 hold on to. In practice, this should not appear, but it should
5481 not be harmful if it does. Identifiers returned will be
5482 IDENTIFIER_ANON_P. */
5483 extern tree
make_anon_name ();
5485 /* The tree and const_tree overload templates. */
5488 class unextended_tree
5494 unextended_tree () {}
5495 unextended_tree (const_tree t
) : m_t (t
) {}
5497 unsigned int get_precision () const;
5498 const HOST_WIDE_INT
*get_val () const;
5499 unsigned int get_len () const;
5500 const_tree
get_tree () const { return m_t
; }
5504 struct int_traits
<unextended_tree
>
5506 static const enum precision_type precision_type
= VAR_PRECISION
;
5507 static const bool host_dependent_precision
= false;
5508 static const bool is_sign_extended
= false;
5519 extended_tree (const_tree
);
5521 unsigned int get_precision () const;
5522 const HOST_WIDE_INT
*get_val () const;
5523 unsigned int get_len () const;
5524 const_tree
get_tree () const { return m_t
; }
5528 struct int_traits
<extended_tree
<N
> >
5530 static const enum precision_type precision_type
= CONST_PRECISION
;
5531 static const bool host_dependent_precision
= false;
5532 static const bool is_sign_extended
= true;
5533 static const unsigned int precision
= N
;
5536 typedef extended_tree
<WIDE_INT_MAX_PRECISION
> widest_extended_tree
;
5537 typedef extended_tree
<ADDR_MAX_PRECISION
> offset_extended_tree
;
5539 typedef const generic_wide_int
<widest_extended_tree
> tree_to_widest_ref
;
5540 typedef const generic_wide_int
<offset_extended_tree
> tree_to_offset_ref
;
5541 typedef const generic_wide_int
<wide_int_ref_storage
<false, false> >
5544 tree_to_widest_ref
to_widest (const_tree
);
5545 tree_to_offset_ref
to_offset (const_tree
);
5546 tree_to_wide_ref
to_wide (const_tree
);
5547 wide_int
to_wide (const_tree
, unsigned int);
5549 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5550 generic_wide_int
<widest_extended_tree
> >
5551 tree_to_poly_widest_ref
;
5552 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5553 generic_wide_int
<offset_extended_tree
> >
5554 tree_to_poly_offset_ref
;
5555 typedef const poly_int
<NUM_POLY_INT_COEFFS
,
5556 generic_wide_int
<unextended_tree
> >
5557 tree_to_poly_wide_ref
;
5559 tree_to_poly_widest_ref
to_poly_widest (const_tree
);
5560 tree_to_poly_offset_ref
to_poly_offset (const_tree
);
5561 tree_to_poly_wide_ref
to_poly_wide (const_tree
);
5564 struct ints_for
<generic_wide_int
<extended_tree
<N
> >, CONST_PRECISION
>
5566 typedef generic_wide_int
<extended_tree
<N
> > extended
;
5567 static extended
zero (const extended
&);
5571 struct ints_for
<generic_wide_int
<unextended_tree
>, VAR_PRECISION
>
5573 typedef generic_wide_int
<unextended_tree
> unextended
;
5574 static unextended
zero (const unextended
&);
5578 /* Used to convert a tree to a widest2_int like this:
5579 widest2_int foo = widest2_int_cst (some_tree). */
5580 typedef generic_wide_int
<wi::extended_tree
<WIDE_INT_MAX_PRECISION
* 2> >
5583 /* Refer to INTEGER_CST T as though it were a widest_int.
5585 This function gives T's actual numerical value, influenced by the
5586 signedness of its type. For example, a signed byte with just the
5587 top bit set would be -128 while an unsigned byte with the same
5588 bit pattern would be 128.
5590 This is the right choice when operating on groups of INTEGER_CSTs
5591 that might have different signedness or precision. It is also the
5592 right choice in code that specifically needs an approximation of
5593 infinite-precision arithmetic instead of normal modulo arithmetic.
5595 The approximation of infinite precision is good enough for realistic
5596 numbers of additions and subtractions of INTEGER_CSTs (where
5597 "realistic" includes any number less than 1 << 31) but it cannot
5598 represent the result of multiplying the two largest supported
5599 INTEGER_CSTs. The overflow-checking form of wi::mul provides a way
5600 of multiplying two arbitrary INTEGER_CSTs and checking that the
5601 result is representable as a widest_int.
5603 Note that any overflow checking done on these values is relative to
5604 the range of widest_int rather than the range of a TREE_TYPE.
5606 Calling this function should have no overhead in release builds,
5607 so it is OK to call it several times for the same tree. If it is
5608 useful for readability reasons to reduce the number of calls,
5609 it is more efficient to use:
5611 wi::tree_to_widest_ref wt = wi::to_widest (t);
5615 widest_int wt = wi::to_widest (t). */
5617 inline wi::tree_to_widest_ref
5618 wi::to_widest (const_tree t
)
5623 /* Refer to INTEGER_CST T as though it were an offset_int.
5625 This function is an optimisation of wi::to_widest for cases
5626 in which T is known to be a bit or byte count in the range
5627 (-(2 ^ (N + BITS_PER_UNIT)), 2 ^ (N + BITS_PER_UNIT)), where N is
5628 the target's address size in bits.
5630 This is the right choice when operating on bit or byte counts as
5631 untyped numbers rather than M-bit values. The wi::to_widest comments
5632 about addition, subtraction and multiplication apply here: sequences
5633 of 1 << 31 additions and subtractions do not induce overflow, but
5634 multiplying the largest sizes might. Again,
5636 wi::tree_to_offset_ref wt = wi::to_offset (t);
5638 is more efficient than:
5640 offset_int wt = wi::to_offset (t). */
5642 inline wi::tree_to_offset_ref
5643 wi::to_offset (const_tree t
)
5648 /* Refer to INTEGER_CST T as though it were a wide_int.
5650 In contrast to the approximation of infinite-precision numbers given
5651 by wi::to_widest and wi::to_offset, this function treats T as a
5652 signless collection of N bits, where N is the precision of T's type.
5653 As with machine registers, signedness is determined by the operation
5654 rather than the operands; for example, there is a distinction between
5655 signed and unsigned division.
5657 This is the right choice when operating on values with the same type
5658 using normal modulo arithmetic. The overflow-checking forms of things
5659 like wi::add check whether the result can be represented in T's type.
5661 Calling this function should have no overhead in release builds,
5662 so it is OK to call it several times for the same tree. If it is
5663 useful for readability reasons to reduce the number of calls,
5664 it is more efficient to use:
5666 wi::tree_to_wide_ref wt = wi::to_wide (t);
5670 wide_int wt = wi::to_wide (t). */
5672 inline wi::tree_to_wide_ref
5673 wi::to_wide (const_tree t
)
5675 return wi::storage_ref (&TREE_INT_CST_ELT (t
, 0), TREE_INT_CST_NUNITS (t
),
5676 TYPE_PRECISION (TREE_TYPE (t
)));
5679 /* Convert INTEGER_CST T to a wide_int of precision PREC, extending or
5680 truncating as necessary. When extending, use sign extension if T's
5681 type is signed and zero extension if T's type is unsigned. */
5684 wi::to_wide (const_tree t
, unsigned int prec
)
5686 return wide_int::from (wi::to_wide (t
), prec
, TYPE_SIGN (TREE_TYPE (t
)));
5690 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5693 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5698 wi::extended_tree
<N
>::get_precision () const
5704 inline const HOST_WIDE_INT
*
5705 wi::extended_tree
<N
>::get_val () const
5707 return &TREE_INT_CST_ELT (m_t
, 0);
5712 wi::extended_tree
<N
>::get_len () const
5714 if (N
== ADDR_MAX_PRECISION
)
5715 return TREE_INT_CST_OFFSET_NUNITS (m_t
);
5716 else if (N
>= WIDE_INT_MAX_PRECISION
)
5717 return TREE_INT_CST_EXT_NUNITS (m_t
);
5719 /* This class is designed to be used for specific output precisions
5720 and needs to be as fast as possible, so there is no fallback for
5726 wi::unextended_tree::get_precision () const
5728 return TYPE_PRECISION (TREE_TYPE (m_t
));
5731 inline const HOST_WIDE_INT
*
5732 wi::unextended_tree::get_val () const
5734 return &TREE_INT_CST_ELT (m_t
, 0);
5738 wi::unextended_tree::get_len () const
5740 return TREE_INT_CST_NUNITS (m_t
);
5743 /* Return the value of a POLY_INT_CST in its native precision. */
5745 inline wi::tree_to_poly_wide_ref
5746 poly_int_cst_value (const_tree x
)
5748 poly_int
<NUM_POLY_INT_COEFFS
, generic_wide_int
<wi::unextended_tree
> > res
;
5749 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5750 res
.coeffs
[i
] = POLY_INT_CST_COEFF (x
, i
);
5754 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5755 poly_widest_int. See wi::to_widest for more details. */
5757 inline wi::tree_to_poly_widest_ref
5758 wi::to_poly_widest (const_tree t
)
5760 if (POLY_INT_CST_P (t
))
5762 poly_int
<NUM_POLY_INT_COEFFS
,
5763 generic_wide_int
<widest_extended_tree
> > res
;
5764 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5765 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
5771 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5772 poly_offset_int. See wi::to_offset for more details. */
5774 inline wi::tree_to_poly_offset_ref
5775 wi::to_poly_offset (const_tree t
)
5777 if (POLY_INT_CST_P (t
))
5779 poly_int
<NUM_POLY_INT_COEFFS
,
5780 generic_wide_int
<offset_extended_tree
> > res
;
5781 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
5782 res
.coeffs
[i
] = POLY_INT_CST_COEFF (t
, i
);
5788 /* Access INTEGER_CST or POLY_INT_CST tree T as if it were a
5789 poly_wide_int. See wi::to_wide for more details. */
5791 inline wi::tree_to_poly_wide_ref
5792 wi::to_poly_wide (const_tree t
)
5794 if (POLY_INT_CST_P (t
))
5795 return poly_int_cst_value (t
);
5800 inline generic_wide_int
<wi::extended_tree
<N
> >
5801 wi::ints_for
<generic_wide_int
<wi::extended_tree
<N
> >,
5802 wi::CONST_PRECISION
>::zero (const extended
&x
)
5804 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
5807 inline generic_wide_int
<wi::unextended_tree
>
5808 wi::ints_for
<generic_wide_int
<wi::unextended_tree
>,
5809 wi::VAR_PRECISION
>::zero (const unextended
&x
)
5811 return build_zero_cst (TREE_TYPE (x
.get_tree ()));
5816 template <typename T
>
5817 bool fits_to_boolean_p (const T
&x
, const_tree
);
5819 template <typename T
>
5820 bool fits_to_tree_p (const T
&x
, const_tree
);
5822 wide_int
min_value (const_tree
);
5823 wide_int
max_value (const_tree
);
5824 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5827 template <typename T
>
5829 wi::fits_to_boolean_p (const T
&x
, const_tree type
)
5831 typedef typename poly_int_traits
<T
>::int_type int_type
;
5832 return (known_eq (x
, int_type (0))
5833 || known_eq (x
, int_type (TYPE_UNSIGNED (type
) ? 1 : -1)));
5836 template <typename T
>
5838 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5840 /* Non-standard boolean types can have arbitrary precision but various
5841 transformations assume that they can only take values 0 and +/-1. */
5842 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
5843 return fits_to_boolean_p (x
, type
);
5845 if (TYPE_UNSIGNED (type
))
5846 return known_eq (x
, zext (x
, TYPE_PRECISION (type
)));
5848 return known_eq (x
, sext (x
, TYPE_PRECISION (type
)));
5851 /* Produce the smallest number that is represented in TYPE. The precision
5852 and sign are taken from TYPE. */
5854 wi::min_value (const_tree type
)
5856 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5859 /* Produce the largest number that is represented in TYPE. The precision
5860 and sign are taken from TYPE. */
5862 wi::max_value (const_tree type
)
5864 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5867 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
5868 extending both according to their respective TYPE_SIGNs. */
5871 tree_int_cst_lt (const_tree t1
, const_tree t2
)
5873 return wi::to_widest (t1
) < wi::to_widest (t2
);
5876 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
5877 extending both according to their respective TYPE_SIGNs. */
5880 tree_int_cst_le (const_tree t1
, const_tree t2
)
5882 return wi::to_widest (t1
) <= wi::to_widest (t2
);
5885 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
5886 are both INTEGER_CSTs and their values are extended according to their
5887 respective TYPE_SIGNs. */
5890 tree_int_cst_compare (const_tree t1
, const_tree t2
)
5892 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
5895 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
5896 but none of these files are allowed to be included from front ends.
5897 They should be split in two. One suitable for the FEs, the other suitable
5900 /* Assign the RTX to declaration. */
5901 extern void set_decl_rtl (tree
, rtx
);
5902 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
5904 /* Given an expression EXP that is a handled_component_p,
5905 look for the ultimate containing object, which is returned and specify
5906 the access position and size. */
5907 extern tree
get_inner_reference (tree
, poly_int64_pod
*, poly_int64_pod
*,
5908 tree
*, machine_mode
*, int *, int *, int *);
5910 extern tree
build_personality_function (const char *);
5912 struct GTY(()) int_n_trees_t
{
5913 /* These parts are initialized at runtime */
5918 /* This is also in machmode.h */
5919 extern bool int_n_enabled_p
[NUM_INT_N_ENTS
];
5920 extern GTY(()) struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
5922 /* Like bit_position, but return as an integer. It must be representable in
5923 that way (since it could be a signed value, we don't have the
5924 option of returning -1 like int_size_in_byte can. */
5926 inline HOST_WIDE_INT
5927 int_bit_position (const_tree field
)
5929 return ((wi::to_offset (DECL_FIELD_OFFSET (field
)) << LOG2_BITS_PER_UNIT
)
5930 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field
))).to_shwi ();
5933 /* Return true if it makes sense to consider alias set for a type T. */
5936 type_with_alias_set_p (const_tree t
)
5938 /* Function and method types are never accessed as memory locations. */
5939 if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
5942 if (COMPLETE_TYPE_P (t
))
5945 /* Incomplete types cannot be accessed in general except for arrays
5946 where we can fetch its element despite we have no array bounds. */
5947 if (TREE_CODE (t
) == ARRAY_TYPE
&& COMPLETE_TYPE_P (TREE_TYPE (t
)))
5953 extern location_t
set_block (location_t loc
, tree block
);
5955 extern void gt_ggc_mx (tree
&);
5956 extern void gt_pch_nx (tree
&);
5957 extern void gt_pch_nx (tree
&, gt_pointer_operator
, void *);
5959 extern bool nonnull_arg_p (const_tree
);
5960 extern bool default_is_empty_record (const_tree
);
5961 extern HOST_WIDE_INT
arg_int_size_in_bytes (const_tree
);
5962 extern tree
arg_size_in_bytes (const_tree
);
5963 extern bool expr_type_first_operand_type_p (tree_code
);
5966 set_source_range (tree expr
, location_t start
, location_t finish
);
5969 set_source_range (tree expr
, source_range src_range
);
5971 /* Return true if it makes sense to promote/demote from_type to to_type. */
5973 desired_pro_or_demotion_p (const_tree to_type
, const_tree from_type
)
5975 unsigned int to_type_precision
= TYPE_PRECISION (to_type
);
5977 /* OK to promote if to_type is no bigger than word_mode. */
5978 if (to_type_precision
<= GET_MODE_PRECISION (word_mode
))
5981 /* Otherwise, allow only if narrowing or same precision conversions. */
5982 return to_type_precision
<= TYPE_PRECISION (from_type
);
5985 /* Pointer type used to declare builtins before we have seen its real
5987 class builtin_structptr_type
5994 extern const builtin_structptr_type builtin_structptr_types
[6];
5996 /* Return true if type T has the same precision as its underlying mode. */
5999 type_has_mode_precision_p (const_tree t
)
6001 return known_eq (TYPE_PRECISION (t
), GET_MODE_PRECISION (TYPE_MODE (t
)));
6004 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function.
6006 Note that it is different from the DECL_IS_BUILTIN accessor. For
6007 instance, user declared prototypes of C library functions are not
6008 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
6011 fndecl_built_in_p (const_tree node
)
6013 return (DECL_BUILT_IN_CLASS (node
) != NOT_BUILT_IN
);
6016 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6020 fndecl_built_in_p (const_tree node
, built_in_class klass
)
6022 return (fndecl_built_in_p (node
) && DECL_BUILT_IN_CLASS (node
) == klass
);
6025 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6026 of class KLASS with name equal to NAME. */
6029 fndecl_built_in_p (const_tree node
, int name
, built_in_class klass
)
6031 return (fndecl_built_in_p (node
, klass
) && DECL_FUNCTION_CODE (node
) == name
);
6034 /* Return true if a FUNCTION_DECL NODE is a GCC built-in function
6035 of BUILT_IN_NORMAL class with name equal to NAME. */
6038 fndecl_built_in_p (const_tree node
, built_in_function name
)
6040 return (fndecl_built_in_p (node
, BUILT_IN_NORMAL
)
6041 && DECL_FUNCTION_CODE (node
) == name
);
6044 /* A struct for encapsulating location information about an operator
6045 and the operation built from it.
6047 m_operator_loc is the location of the operator
6048 m_combined_loc is the location of the compound expression.
6050 For example, given "a && b" the, operator location is:
6053 and the combined location is:
6056 Capturing this information allows for class binary_op_rich_location
6057 to provide detailed information about e.g. type mismatches in binary
6058 operations where enough location information is available:
6066 falling back to just showing the combined location:
6076 location_t m_operator_loc
;
6077 location_t m_combined_loc
;
6079 /* 1-argument ctor, for constructing from a combined location. */
6080 op_location_t (location_t combined_loc
)
6081 : m_operator_loc (UNKNOWN_LOCATION
), m_combined_loc (combined_loc
)
6084 /* 2-argument ctor, for distinguishing between the operator's location
6085 and the combined location. */
6086 op_location_t (location_t operator_loc
, location_t combined_loc
)
6087 : m_operator_loc (operator_loc
), m_combined_loc (combined_loc
)
6090 /* Implicitly convert back to a location_t, using the combined location. */
6091 operator location_t () const { return m_combined_loc
; }
6094 #endif /* GCC_TREE_H */