1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "tree-core.h"
26 /* Macros for initializing `tree_contains_struct'. */
27 #define MARK_TS_BASE(C) \
29 tree_contains_struct[C][TS_BASE] = 1; \
32 #define MARK_TS_TYPED(C) \
35 tree_contains_struct[C][TS_TYPED] = 1; \
38 #define MARK_TS_COMMON(C) \
41 tree_contains_struct[C][TS_COMMON] = 1; \
44 #define MARK_TS_TYPE_COMMON(C) \
47 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
50 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
52 MARK_TS_TYPE_COMMON (C); \
53 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
56 #define MARK_TS_DECL_MINIMAL(C) \
59 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
62 #define MARK_TS_DECL_COMMON(C) \
64 MARK_TS_DECL_MINIMAL (C); \
65 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
68 #define MARK_TS_DECL_WRTL(C) \
70 MARK_TS_DECL_COMMON (C); \
71 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
74 #define MARK_TS_DECL_WITH_VIS(C) \
76 MARK_TS_DECL_WRTL (C); \
77 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
80 #define MARK_TS_DECL_NON_COMMON(C) \
82 MARK_TS_DECL_WITH_VIS (C); \
83 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
87 /* Returns the string representing CLASS. */
89 #define TREE_CODE_CLASS_STRING(CLASS)\
90 tree_code_class_strings[(int) (CLASS)]
92 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
94 /* Nonzero if NODE represents an exceptional code. */
96 #define EXCEPTIONAL_CLASS_P(NODE)\
97 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
99 /* Nonzero if NODE represents a constant. */
101 #define CONSTANT_CLASS_P(NODE)\
102 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
104 /* Nonzero if NODE represents a type. */
106 #define TYPE_P(NODE)\
107 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
109 /* Nonzero if NODE represents a declaration. */
111 #define DECL_P(NODE)\
112 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
114 /* True if NODE designates a variable declaration. */
115 #define VAR_P(NODE) \
116 (TREE_CODE (NODE) == VAR_DECL)
118 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
120 #define VAR_OR_FUNCTION_DECL_P(DECL)\
121 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
123 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
124 ascending code order. */
126 #define INDIRECT_REF_P(NODE)\
127 (TREE_CODE (NODE) == INDIRECT_REF)
129 /* Nonzero if NODE represents a reference. */
131 #define REFERENCE_CLASS_P(NODE)\
132 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
134 /* Nonzero if NODE represents a comparison. */
136 #define COMPARISON_CLASS_P(NODE)\
137 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
139 /* Nonzero if NODE represents a unary arithmetic expression. */
141 #define UNARY_CLASS_P(NODE)\
142 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
144 /* Nonzero if NODE represents a binary arithmetic expression. */
146 #define BINARY_CLASS_P(NODE)\
147 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
149 /* Nonzero if NODE represents a statement expression. */
151 #define STATEMENT_CLASS_P(NODE)\
152 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
154 /* Nonzero if NODE represents a function call-like expression with a
155 variable-length operand vector. */
157 #define VL_EXP_CLASS_P(NODE)\
158 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
160 /* Nonzero if NODE represents any other expression. */
162 #define EXPRESSION_CLASS_P(NODE)\
163 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
165 /* Returns nonzero iff NODE represents a type or declaration. */
167 #define IS_TYPE_OR_DECL_P(NODE)\
168 (TYPE_P (NODE) || DECL_P (NODE))
170 /* Returns nonzero iff CLASS is the tree-code class of an
173 #define IS_EXPR_CODE_CLASS(CLASS)\
174 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
176 /* Returns nonzero iff NODE is an expression of some kind. */
178 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
180 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
183 /* Helper macros for math builtins. */
185 #define BUILTIN_EXP10_P(FN) \
186 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
187 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
189 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
190 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
191 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
193 #define BUILTIN_SQRT_P(FN) \
194 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
196 #define BUILTIN_CBRT_P(FN) \
197 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
199 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
201 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
202 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
203 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
205 #define NULL_TREE (tree) NULL
207 /* Define accessors for the fields that all tree nodes have
208 (though some fields are not used for all kinds of nodes). */
210 /* The tree-code says what kind of node it is.
211 Codes are defined in tree.def. */
212 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
213 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
215 /* When checking is enabled, errors will be generated if a tree node
216 is accessed incorrectly. The macros die with a fatal error. */
217 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
219 #define TREE_CHECK(T, CODE) \
220 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
222 #define TREE_NOT_CHECK(T, CODE) \
223 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
225 #define TREE_CHECK2(T, CODE1, CODE2) \
226 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
228 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
229 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
231 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
232 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
234 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
235 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
236 (CODE1), (CODE2), (CODE3)))
238 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
239 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
240 (CODE1), (CODE2), (CODE3), (CODE4)))
242 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
243 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
244 (CODE1), (CODE2), (CODE3), (CODE4)))
246 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
247 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
248 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
250 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
251 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
252 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
254 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
255 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
257 #define TREE_CLASS_CHECK(T, CLASS) \
258 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
260 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
261 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
263 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
264 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
266 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
267 (omp_clause_range_check ((T), (CODE1), (CODE2), \
268 __FILE__, __LINE__, __FUNCTION__))
270 /* These checks have to be special cased. */
271 #define EXPR_CHECK(T) \
272 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
274 /* These checks have to be special cased. */
275 #define NON_TYPE_CHECK(T) \
276 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
278 #define TREE_INT_CST_ELT_CHECK(T, I) \
279 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
281 #define TREE_VEC_ELT_CHECK(T, I) \
282 (*(CONST_CAST2 (tree *, typeof (T)*, \
283 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
285 #define OMP_CLAUSE_ELT_CHECK(T, I) \
286 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
288 /* Special checks for TREE_OPERANDs. */
289 #define TREE_OPERAND_CHECK(T, I) \
290 (*(CONST_CAST2 (tree*, typeof (T)*, \
291 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
293 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
294 (*(tree_operand_check_code ((T), (CODE), (I), \
295 __FILE__, __LINE__, __FUNCTION__)))
297 /* Nodes are chained together for many purposes.
298 Types are chained together to record them for being output to the debugger
299 (see the function `chain_type').
300 Decls in the same scope are chained together to record the contents
302 Statement nodes for successive statements used to be chained together.
303 Often lists of things are represented by TREE_LIST nodes that
304 are chained together. */
306 #define TREE_CHAIN(NODE) \
307 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
309 /* In all nodes that are expressions, this is the data type of the expression.
310 In POINTER_TYPE nodes, this is the type that the pointer points to.
311 In ARRAY_TYPE nodes, this is the type of the elements.
312 In VECTOR_TYPE nodes, this is the type of the elements. */
313 #define TREE_TYPE(NODE) \
314 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
316 extern void tree_contains_struct_check_failed (const_tree
,
317 const enum tree_node_structure_enum
,
318 const char *, int, const char *)
321 extern void tree_check_failed (const_tree
, const char *, int, const char *,
322 ...) ATTRIBUTE_NORETURN
;
323 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
324 ...) ATTRIBUTE_NORETURN
;
325 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
326 const char *, int, const char *)
328 extern void tree_range_check_failed (const_tree
, const char *, int,
329 const char *, enum tree_code
,
332 extern void tree_not_class_check_failed (const_tree
,
333 const enum tree_code_class
,
334 const char *, int, const char *)
336 extern void tree_int_cst_elt_check_failed (int, int, const char *,
339 extern void tree_vec_elt_check_failed (int, int, const char *,
342 extern void phi_node_elt_check_failed (int, int, const char *,
345 extern void tree_operand_check_failed (int, const_tree
,
346 const char *, int, const char *)
348 extern void omp_clause_check_failed (const_tree
, const char *, int,
349 const char *, enum omp_clause_code
)
351 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
354 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
355 const char *, enum omp_clause_code
,
356 enum omp_clause_code
)
359 #else /* not ENABLE_TREE_CHECKING, or not gcc */
361 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
362 #define TREE_CHECK(T, CODE) (T)
363 #define TREE_NOT_CHECK(T, CODE) (T)
364 #define TREE_CHECK2(T, CODE1, CODE2) (T)
365 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
366 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
367 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
368 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
369 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
370 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
371 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
372 #define TREE_CLASS_CHECK(T, CODE) (T)
373 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
374 #define EXPR_CHECK(T) (T)
375 #define NON_TYPE_CHECK(T) (T)
376 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
377 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
378 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
379 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
380 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
381 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
382 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
384 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
385 #define TREE_TYPE(NODE) ((NODE)->typed.type)
389 #define TREE_BLOCK(NODE) (tree_block (NODE))
390 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
392 #include "tree-check.h"
394 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
395 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
396 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
397 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
398 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
399 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
400 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
401 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
402 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
403 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
404 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
406 #define RECORD_OR_UNION_CHECK(T) \
407 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
408 #define NOT_RECORD_OR_UNION_CHECK(T) \
409 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
411 #define NUMERICAL_TYPE_CHECK(T) \
412 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
415 /* Here is how primitive or already-canonicalized types' hash codes
417 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
419 /* A simple hash function for an arbitrary tree node. This must not be
420 used in hash tables which are saved to a PCH. */
421 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
423 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
424 #define CONVERT_EXPR_CODE_P(CODE) \
425 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
427 /* Similarly, but accept an expressions instead of a tree code. */
428 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
430 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
432 #define CASE_CONVERT \
436 /* Given an expression as a tree, strip any conversion that generates
437 no instruction. Accepts both tree and const_tree arguments since
438 we are not modifying the tree itself. */
440 #define STRIP_NOPS(EXP) \
441 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
443 /* Like STRIP_NOPS, but don't let the signedness change either. */
445 #define STRIP_SIGN_NOPS(EXP) \
446 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
448 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
450 #define STRIP_TYPE_NOPS(EXP) \
451 while ((CONVERT_EXPR_P (EXP) \
452 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
453 && TREE_OPERAND (EXP, 0) != error_mark_node \
454 && (TREE_TYPE (EXP) \
455 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
456 (EXP) = TREE_OPERAND (EXP, 0)
458 /* Remove unnecessary type conversions according to
459 tree_ssa_useless_type_conversion. */
461 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
462 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
464 /* Nonzero if TYPE represents a vector type. */
466 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
468 /* Nonzero if TYPE represents an integral type. Note that we do not
469 include COMPLEX types here. Keep these checks in ascending code
472 #define INTEGRAL_TYPE_P(TYPE) \
473 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
474 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
475 || TREE_CODE (TYPE) == INTEGER_TYPE)
477 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
479 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
480 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
482 /* Nonzero if TYPE represents a saturating fixed-point type. */
484 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
485 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
487 /* Nonzero if TYPE represents a fixed-point type. */
489 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
491 /* Nonzero if TYPE represents a scalar floating-point type. */
493 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
495 /* Nonzero if TYPE represents a complex floating-point type. */
497 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
498 (TREE_CODE (TYPE) == COMPLEX_TYPE \
499 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
501 /* Nonzero if TYPE represents a vector integer type. */
503 #define VECTOR_INTEGER_TYPE_P(TYPE) \
504 (VECTOR_TYPE_P (TYPE) \
505 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
508 /* Nonzero if TYPE represents a vector floating-point type. */
510 #define VECTOR_FLOAT_TYPE_P(TYPE) \
511 (VECTOR_TYPE_P (TYPE) \
512 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
514 /* Nonzero if TYPE represents a floating-point type, including complex
515 and vector floating-point types. The vector and complex check does
516 not use the previous two macros to enable early folding. */
518 #define FLOAT_TYPE_P(TYPE) \
519 (SCALAR_FLOAT_TYPE_P (TYPE) \
520 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
521 || VECTOR_TYPE_P (TYPE)) \
522 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
524 /* Nonzero if TYPE represents a decimal floating-point type. */
525 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
526 (SCALAR_FLOAT_TYPE_P (TYPE) \
527 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
529 /* Nonzero if TYPE is a record or union type. */
530 #define RECORD_OR_UNION_TYPE_P(TYPE) \
531 (TREE_CODE (TYPE) == RECORD_TYPE \
532 || TREE_CODE (TYPE) == UNION_TYPE \
533 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
535 /* Nonzero if TYPE represents an aggregate (multi-component) type.
536 Keep these checks in ascending code order. */
538 #define AGGREGATE_TYPE_P(TYPE) \
539 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
541 /* Nonzero if TYPE represents a pointer or reference type.
542 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
543 ascending code order. */
545 #define POINTER_TYPE_P(TYPE) \
546 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
548 /* Nonzero if TYPE represents a pointer to function. */
549 #define FUNCTION_POINTER_TYPE_P(TYPE) \
550 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
552 /* Nonzero if this type is a complete type. */
553 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
555 /* Nonzero if this type is a pointer bounds type. */
556 #define POINTER_BOUNDS_TYPE_P(NODE) \
557 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
559 /* Nonzero if this node has a pointer bounds type. */
560 #define POINTER_BOUNDS_P(NODE) \
561 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
563 /* Nonzero if this type supposes bounds existence. */
564 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
566 /* Nonzero for objects with bounded type. */
567 #define BOUNDED_P(node) \
568 BOUNDED_TYPE_P (TREE_TYPE (node))
570 /* Nonzero if this type is the (possibly qualified) void type. */
571 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
573 /* Nonzero if this type is complete or is cv void. */
574 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
575 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
577 /* Nonzero if this type is complete or is an array with unspecified bound. */
578 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
579 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
582 /* Define many boolean fields that all tree nodes have. */
584 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
585 of this is needed. So it cannot be in a register.
586 In a FUNCTION_DECL it has no meaning.
587 In LABEL_DECL nodes, it means a goto for this label has been seen
588 from a place outside all binding contours that restore stack levels.
589 In an artificial SSA_NAME that points to a stack partition with at least
590 two variables, it means that at least one variable has TREE_ADDRESSABLE.
591 In ..._TYPE nodes, it means that objects of this type must be fully
592 addressable. This means that pieces of this object cannot go into
593 register parameters, for example. If this a function type, this
594 means that the value must be returned in memory.
595 In CONSTRUCTOR nodes, it means object constructed must be in memory.
596 In IDENTIFIER_NODEs, this means that some extern decl for this name
597 had its address taken. That matters for inline functions.
598 In a STMT_EXPR, it means we want the result of the enclosed expression. */
599 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
601 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
602 exit of a function. Calls for which this is true are candidates for tail
603 call optimizations. */
604 #define CALL_EXPR_TAILCALL(NODE) \
605 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
607 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
608 CASE_LOW operand has been processed. */
609 #define CASE_LOW_SEEN(NODE) \
610 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
612 #define PREDICT_EXPR_OUTCOME(NODE) \
613 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
614 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
615 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
616 #define PREDICT_EXPR_PREDICTOR(NODE) \
617 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
619 /* In a VAR_DECL, nonzero means allocate static storage.
620 In a FUNCTION_DECL, nonzero if function has been defined.
621 In a CONSTRUCTOR, nonzero means allocate static storage. */
622 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
624 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
625 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
627 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
628 should only be executed if an exception is thrown, not on normal exit
630 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
632 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
633 separate cleanup in honor_protect_cleanup_actions. */
634 #define TRY_CATCH_IS_CLEANUP(NODE) \
635 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
637 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
638 CASE_HIGH operand has been processed. */
639 #define CASE_HIGH_SEEN(NODE) \
640 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
642 /* Used to mark scoped enums. */
643 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
645 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
646 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
648 /* In an expr node (usually a conversion) this means the node was made
649 implicitly and should not lead to any sort of warning. In a decl node,
650 warnings concerning the decl should be suppressed. This is used at
651 least for used-before-set warnings, and it set after one warning is
653 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
655 /* Used to indicate that this TYPE represents a compiler-generated entity. */
656 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
658 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
659 this string as an argument. */
660 #define TREE_SYMBOL_REFERENCED(NODE) \
661 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
663 /* Nonzero in a pointer or reference type means the data pointed to
664 by this type can alias anything. */
665 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
666 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
668 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
669 there was an overflow in folding. */
671 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
673 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
675 #define TREE_OVERFLOW_P(EXPR) \
676 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
678 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
679 nonzero means name is to be accessible from outside this translation unit.
680 In an IDENTIFIER_NODE, nonzero means an external declaration
681 accessible from outside this translation unit was previously seen
682 for this name in an inner scope. */
683 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
685 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
686 of cached values, or is something else. */
687 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
689 /* In a SAVE_EXPR, indicates that the original expression has already
690 been substituted with a VAR_DECL that contains the value. */
691 #define SAVE_EXPR_RESOLVED_P(NODE) \
692 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
694 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
696 #define CALL_EXPR_VA_ARG_PACK(NODE) \
697 (CALL_EXPR_CHECK (NODE)->base.public_flag)
699 /* In any expression, decl, or constant, nonzero means it has side effects or
700 reevaluation of the whole expression could produce a different value.
701 This is set if any subexpression is a function call, a side effect or a
702 reference to a volatile variable. In a ..._DECL, this is set only if the
703 declaration said `volatile'. This will never be set for a constant. */
704 #define TREE_SIDE_EFFECTS(NODE) \
705 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
707 /* In a LABEL_DECL, nonzero means this label had its address taken
708 and therefore can never be deleted and is a jump target for
710 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
712 /* Nonzero means this expression is volatile in the C sense:
713 its address should be of type `volatile WHATEVER *'.
714 In other words, the declared item is volatile qualified.
715 This is used in _DECL nodes and _REF nodes.
716 On a FUNCTION_DECL node, this means the function does not
717 return normally. This is the same effect as setting
718 the attribute noreturn on the function in C.
720 In a ..._TYPE node, means this type is volatile-qualified.
721 But use TYPE_VOLATILE instead of this macro when the node is a type,
722 because eventually we may make that a different bit.
724 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
725 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
727 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
728 accessing the memory pointed to won't generate a trap. However,
729 this only applies to an object when used appropriately: it doesn't
730 mean that writing a READONLY mem won't trap.
732 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
733 (or slice of the array) always belongs to the range of the array.
734 I.e. that the access will not trap, provided that the access to
735 the base to the array will not trap. */
736 #define TREE_THIS_NOTRAP(NODE) \
737 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
738 ARRAY_RANGE_REF)->base.nothrow_flag)
740 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
741 nonzero means it may not be the lhs of an assignment.
742 Nonzero in a FUNCTION_DECL means this function should be treated
743 as "const" function (can only read its arguments). */
744 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
746 /* Value of expression is constant. Always on in all ..._CST nodes. May
747 also appear in an expression or decl where the value is constant. */
748 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
750 /* Nonzero if NODE, a type, has had its sizes gimplified. */
751 #define TYPE_SIZES_GIMPLIFIED(NODE) \
752 (TYPE_CHECK (NODE)->base.constant_flag)
754 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
755 #define DECL_UNSIGNED(NODE) \
756 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
758 /* In integral and pointer types, means an unsigned type. */
759 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
761 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
762 #define TYPE_SIGN(NODE) ((signop)TYPE_UNSIGNED(NODE))
764 /* True if overflow wraps around for the given integral type. That
765 is, TYPE_MAX + 1 == TYPE_MIN. */
766 #define TYPE_OVERFLOW_WRAPS(TYPE) \
767 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
769 /* True if overflow is undefined for the given integral type. We may
770 optimize on the assumption that values in the type never overflow.
772 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
773 must issue a warning based on warn_strict_overflow. In some cases
774 it will be appropriate to issue the warning immediately, and in
775 other cases it will be appropriate to simply set a flag and let the
776 caller decide whether a warning is appropriate or not. */
777 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
778 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
780 /* True if overflow for the given integral type should issue a
782 #define TYPE_OVERFLOW_TRAPS(TYPE) \
783 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
785 /* True if pointer types have undefined overflow. */
786 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
788 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
789 Nonzero in a FUNCTION_DECL means that the function has been compiled.
790 This is interesting in an inline function, since it might not need
791 to be compiled separately.
792 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
793 or TYPE_DECL if the debugging info for the type has been written.
794 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
795 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
797 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
799 /* Nonzero in a _DECL if the name is used in its scope.
800 Nonzero in an expr node means inhibit warning if value is unused.
801 In IDENTIFIER_NODEs, this means that some extern decl for this name
803 In a BLOCK, this means that the block contains variables that are used. */
804 #define TREE_USED(NODE) ((NODE)->base.used_flag)
806 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
807 throw an exception. In a CALL_EXPR, nonzero means the call cannot
808 throw. We can't easily check the node type here as the C++
809 frontend also uses this flag (for AGGR_INIT_EXPR). */
810 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
812 /* In a CALL_EXPR, means that it's safe to use the target of the call
813 expansion as the return slot for a call that returns in memory. */
814 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
815 (CALL_EXPR_CHECK (NODE)->base.private_flag)
817 /* Cilk keywords accessors. */
818 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
820 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
821 passed by invisible reference (and the TREE_TYPE is a pointer to the true
823 #define DECL_BY_REFERENCE(NODE) \
824 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
825 RESULT_DECL)->decl_common.decl_by_reference_flag)
827 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
829 #define DECL_READ_P(NODE) \
830 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
832 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
833 attempting to share the stack slot with some other variable. */
834 #define DECL_NONSHAREABLE(NODE) \
835 (TREE_CHECK2 (NODE, VAR_DECL, \
836 RESULT_DECL)->decl_common.decl_nonshareable_flag)
838 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
839 thunked-to function. */
840 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
842 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
843 it has been built for the declaration of a variable-sized object. */
844 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
845 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
847 /* In a type, nonzero means that all objects of the type are guaranteed by the
848 language or front-end to be properly aligned, so we can indicate that a MEM
849 of this type is aligned at least to the alignment of the type, even if it
850 doesn't appear that it is. We see this, for example, in object-oriented
851 languages where a tag field may show this is an object of a more-aligned
852 variant of the more generic type.
854 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
856 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
858 /* Used in classes in C++. */
859 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
860 /* Used in classes in C++. */
861 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
863 /* True if reference type NODE is a C++ rvalue reference. */
864 #define TYPE_REF_IS_RVALUE(NODE) \
865 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
867 /* Nonzero in a _DECL if the use of the name is defined as a
868 deprecated feature by __attribute__((deprecated)). */
869 #define TREE_DEPRECATED(NODE) \
870 ((NODE)->base.deprecated_flag)
872 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
873 uses are to be substituted for uses of the TREE_CHAINed identifier. */
874 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
875 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
877 /* In fixed-point types, means a saturating type. */
878 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
880 /* These flags are available for each language front end to use internally. */
881 #define TREE_LANG_FLAG_0(NODE) \
882 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
883 #define TREE_LANG_FLAG_1(NODE) \
884 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
885 #define TREE_LANG_FLAG_2(NODE) \
886 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
887 #define TREE_LANG_FLAG_3(NODE) \
888 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
889 #define TREE_LANG_FLAG_4(NODE) \
890 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
891 #define TREE_LANG_FLAG_5(NODE) \
892 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
893 #define TREE_LANG_FLAG_6(NODE) \
894 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
896 /* Define additional fields and accessors for nodes representing constants. */
898 #define TREE_INT_CST_NUNITS(NODE) \
899 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
900 #define TREE_INT_CST_EXT_NUNITS(NODE) \
901 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
902 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
904 #define INT_CST_LT(A, B) (wi::lts_p (wi::to_widest (A), wi::to_widest (B)))
905 #define INT_CST_LE(A, B) (wi::les_p (wi::to_widest (A), wi::to_widest (B)))
907 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
908 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
910 #define TREE_FIXED_CST_PTR(NODE) \
911 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
912 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
914 /* In a STRING_CST */
915 /* In C terms, this is sizeof, not strlen. */
916 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
917 #define TREE_STRING_POINTER(NODE) \
918 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
920 /* In a COMPLEX_CST node. */
921 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
922 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
924 /* In a VECTOR_CST node. */
925 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
926 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
927 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
929 /* Define fields and accessors for some special-purpose tree nodes. */
931 #define IDENTIFIER_LENGTH(NODE) \
932 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
933 #define IDENTIFIER_POINTER(NODE) \
934 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
935 #define IDENTIFIER_HASH_VALUE(NODE) \
936 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
938 /* Translate a hash table identifier pointer to a tree_identifier
939 pointer, and vice versa. */
941 #define HT_IDENT_TO_GCC_IDENT(NODE) \
942 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
943 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
945 /* In a TREE_LIST node. */
946 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
947 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
949 /* In a TREE_VEC node. */
950 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
951 #define TREE_VEC_END(NODE) \
952 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
954 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
956 /* In a CONSTRUCTOR node. */
957 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
958 #define CONSTRUCTOR_ELT(NODE,IDX) \
959 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
960 #define CONSTRUCTOR_NELTS(NODE) \
961 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
963 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
964 value of each element (stored within VAL). IX must be a scratch variable
965 of unsigned integer type. */
966 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
967 for (IX = 0; (IX >= vec_safe_length (V)) \
969 : ((VAL = (*(V))[IX].value), \
973 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
974 the value of each element (stored within VAL) and its index (stored
975 within INDEX). IX must be a scratch variable of unsigned integer type. */
976 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
977 for (IX = 0; (IX >= vec_safe_length (V)) \
979 : (((void) (VAL = (*V)[IX].value)), \
980 (INDEX = (*V)[IX].index), \
984 /* Append a new constructor element to V, with the specified INDEX and VAL. */
985 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
987 constructor_elt _ce___ = {INDEX, VALUE}; \
988 vec_safe_push ((V), _ce___); \
991 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
992 constructor output purposes. */
993 #define CONSTRUCTOR_BITFIELD_P(NODE) \
994 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
996 /* True if NODE is a clobber right hand side, an expression of indeterminate
997 value that clobbers the LHS in a copy instruction. We use a volatile
998 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
999 In particular the volatile flag causes us to not prematurely remove
1000 such clobber instructions. */
1001 #define TREE_CLOBBER_P(NODE) \
1002 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1004 /* Define fields and accessors for some nodes that represent expressions. */
1006 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1007 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1008 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1009 && integer_zerop (TREE_OPERAND (NODE, 0)))
1011 /* In ordinary expression nodes. */
1012 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1013 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1015 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1016 length. Its value includes the length operand itself; that is,
1017 the minimum valid length is 1.
1018 Note that we have to bypass the use of TREE_OPERAND to access
1019 that field to avoid infinite recursion in expanding the macros. */
1020 #define VL_EXP_OPERAND_LENGTH(NODE) \
1021 ((int)tree_to_hwi (VL_EXP_CHECK (NODE)->exp.operands[0]))
1023 /* Nonzero if is_gimple_debug() may possibly hold. */
1024 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1026 /* In a LOOP_EXPR node. */
1027 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1029 /* The source location of this expression. Non-tree_exp nodes such as
1030 decls and constants can be shared among multiple locations, so
1032 #define EXPR_LOCATION(NODE) \
1033 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1034 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1035 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1036 != UNKNOWN_LOCATION)
1037 /* The location to be used in a diagnostic about this expression. Do not
1038 use this macro if the location will be assigned to other expressions. */
1039 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \
1040 ? (NODE)->exp.locus : input_location)
1041 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1042 ? (NODE)->exp.locus : (LOCUS))
1043 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1044 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1046 /* True if a tree is an expression or statement that can have a
1048 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1050 extern void protected_set_expr_location (tree
, location_t
);
1052 /* In a TARGET_EXPR node. */
1053 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1054 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1055 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1057 /* DECL_EXPR accessor. This gives access to the DECL associated with
1058 the given declaration statement. */
1059 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1061 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1063 /* COMPOUND_LITERAL_EXPR accessors. */
1064 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1065 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1066 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1067 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1069 /* SWITCH_EXPR accessors. These give access to the condition, body and
1070 original condition type (before any compiler conversions)
1071 of the switch statement, respectively. */
1072 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1073 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1074 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1076 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1077 of a case label, respectively. */
1078 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1079 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1080 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1081 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1083 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1084 corresponding MEM_REF operands. */
1085 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1086 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1087 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1088 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1089 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1091 /* The operands of a BIND_EXPR. */
1092 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1093 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1094 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1096 /* GOTO_EXPR accessor. This gives access to the label associated with
1097 a goto statement. */
1098 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1100 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1101 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1102 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1104 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1105 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1106 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1107 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1108 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1109 /* Nonzero if we want to create an ASM_INPUT instead of an
1110 ASM_OPERAND with no operands. */
1111 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1112 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1114 /* COND_EXPR accessors. */
1115 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1116 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1117 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1119 /* Accessors for the chains of recurrences. */
1120 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1121 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1122 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1123 #define CHREC_VARIABLE(NODE) tree_to_hwi (CHREC_VAR (NODE))
1125 /* LABEL_EXPR accessor. This gives access to the label associated with
1126 the given label expression. */
1127 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1129 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1130 accessors for SSA operands. */
1132 /* CATCH_EXPR accessors. */
1133 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1134 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1136 /* EH_FILTER_EXPR accessors. */
1137 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1138 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1140 /* OBJ_TYPE_REF accessors. */
1141 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1142 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1143 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1145 /* ASSERT_EXPR accessors. */
1146 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1147 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1149 /* CALL_EXPR accessors.
1151 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1152 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1153 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1154 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1156 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1157 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1158 the argument count is zero when checking is enabled. Instead, do
1159 the pointer arithmetic to advance past the 3 fixed operands in a
1160 CALL_EXPR. That produces a valid pointer to just past the end of the
1161 operand array, even if it's not valid to dereference it. */
1162 #define CALL_EXPR_ARGP(NODE) \
1163 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1165 /* TM directives and accessors. */
1166 #define TRANSACTION_EXPR_BODY(NODE) \
1167 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1168 #define TRANSACTION_EXPR_OUTER(NODE) \
1169 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1170 #define TRANSACTION_EXPR_RELAXED(NODE) \
1171 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1173 /* OpenMP directive and clause accessors. */
1175 #define OMP_BODY(NODE) \
1176 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1177 #define OMP_CLAUSES(NODE) \
1178 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1180 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1181 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1183 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1184 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1186 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1187 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1188 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1190 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1191 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1192 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1193 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1194 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1195 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1196 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1198 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1199 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1201 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1203 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1204 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1206 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1208 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1210 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1212 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1213 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1215 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1216 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1218 #define OMP_TARGET_DATA_BODY(NODE) \
1219 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1220 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1221 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1223 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1224 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1226 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1227 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1229 #define OMP_CLAUSE_SIZE(NODE) \
1230 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1234 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1235 #define OMP_CLAUSE_DECL(NODE) \
1236 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1237 OMP_CLAUSE_PRIVATE, \
1238 OMP_CLAUSE__LOOPTEMP_), 0)
1239 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1240 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1241 != UNKNOWN_LOCATION)
1242 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1244 /* True on an OMP_SECTION statement that was the last lexical member.
1245 This status is meaningful in the implementation of lastprivate. */
1246 #define OMP_SECTION_LAST(NODE) \
1247 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1249 /* True on an OMP_PARALLEL statement if it represents an explicit
1250 combined parallel work-sharing constructs. */
1251 #define OMP_PARALLEL_COMBINED(NODE) \
1252 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1254 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1255 as opposed to relaxed. */
1256 #define OMP_ATOMIC_SEQ_CST(NODE) \
1257 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1258 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1260 /* True on a PRIVATE clause if its decl is kept around for debugging
1261 information only and its DECL_VALUE_EXPR is supposed to point
1262 to what it has been remapped to. */
1263 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1264 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1266 /* True on a PRIVATE clause if ctor needs access to outer region's
1268 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1269 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1271 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1272 decl is present in the chain. */
1273 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1274 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1275 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1276 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1277 OMP_CLAUSE_LASTPRIVATE),\
1279 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1280 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1282 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1283 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1284 #define OMP_CLAUSE_IF_EXPR(NODE) \
1285 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1286 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1287 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1288 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1289 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1291 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1292 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1294 #define OMP_CLAUSE_MAP_KIND(NODE) \
1295 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1297 /* Nonzero if this map clause is for array (rather than pointer) based array
1298 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1299 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1300 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1301 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1303 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1304 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1306 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1307 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1308 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1309 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1310 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1311 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1313 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1314 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1315 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1316 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1317 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1318 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1319 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1320 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1321 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1322 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1323 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1324 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1326 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1327 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1328 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1329 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1331 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1332 are always initialized inside of the loop construct, false otherwise. */
1333 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1334 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1336 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1337 are declared inside of the simd construct. */
1338 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1339 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1341 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1342 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1344 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1345 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1347 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1348 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1350 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1351 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1352 OMP_CLAUSE_THREAD_LIMIT), 0)
1354 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1355 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1357 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1358 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1359 OMP_CLAUSE_DIST_SCHEDULE), 0)
1361 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1362 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1364 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1365 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1367 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1368 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1370 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1371 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1373 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1374 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1376 /* SSA_NAME accessors. */
1378 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1379 if there is no name associated with it. */
1380 #define SSA_NAME_IDENTIFIER(NODE) \
1381 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1382 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1383 ? (NODE)->ssa_name.var \
1384 : DECL_NAME ((NODE)->ssa_name.var)) \
1387 /* Returns the variable being referenced. This can be NULL_TREE for
1388 temporaries not associated with any user variable.
1389 Once released, this is the only field that can be relied upon. */
1390 #define SSA_NAME_VAR(NODE) \
1391 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1392 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1393 ? NULL_TREE : (NODE)->ssa_name.var)
1395 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1396 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1398 /* Returns the statement which defines this SSA name. */
1399 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1401 /* Returns the SSA version number of this SSA name. Note that in
1402 tree SSA, version numbers are not per variable and may be recycled. */
1403 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1405 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1406 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1408 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1409 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1411 /* Nonzero if this SSA_NAME expression is currently on the free list of
1412 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1413 has no meaning for an SSA_NAME. */
1414 #define SSA_NAME_IN_FREE_LIST(NODE) \
1415 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1417 /* Nonzero if this SSA_NAME is the default definition for the
1418 underlying symbol. A default SSA name is created for symbol S if
1419 the very first reference to S in the function is a read operation.
1420 Default definitions are always created by an empty statement and
1421 belong to no basic block. */
1422 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1423 SSA_NAME_CHECK (NODE)->base.default_def_flag
1425 /* Attributes for SSA_NAMEs for pointer-type variables. */
1426 #define SSA_NAME_PTR_INFO(N) \
1427 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1429 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1430 #define SSA_NAME_RANGE_INFO(N) \
1431 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1433 /* Return the immediate_use information for an SSA_NAME. */
1434 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1436 #define OMP_CLAUSE_CODE(NODE) \
1437 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1439 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1440 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1442 #define OMP_CLAUSE_OPERAND(NODE, I) \
1443 OMP_CLAUSE_ELT_CHECK (NODE, I)
1445 /* In a BLOCK node. */
1446 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1447 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1448 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1449 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1450 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1451 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1452 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1453 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1454 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1455 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1456 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1458 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1459 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1461 /* An index number for this block. These values are not guaranteed to
1462 be unique across functions -- whether or not they are depends on
1463 the debugging output format in use. */
1464 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1466 /* If block reordering splits a lexical block into discontiguous
1467 address ranges, we'll make a copy of the original block.
1469 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1470 In that case, we have one source block that has been replicated
1471 (through inlining or unrolling) into many logical blocks, and that
1472 these logical blocks have different physical variables in them.
1474 In this case, we have one logical block split into several
1475 non-contiguous address ranges. Most debug formats can't actually
1476 represent this idea directly, so we fake it by creating multiple
1477 logical blocks with the same variables in them. However, for those
1478 that do support non-contiguous regions, these allow the original
1479 logical block to be reconstructed, along with the set of address
1482 One of the logical block fragments is arbitrarily chosen to be
1483 the ORIGIN. The other fragments will point to the origin via
1484 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1485 be null. The list of fragments will be chained through
1486 BLOCK_FRAGMENT_CHAIN from the origin. */
1488 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1489 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1491 /* For an inlined function, this gives the location where it was called
1492 from. This is only set in the top level block, which corresponds to the
1493 inlined function scope. This is used in the debug output routines. */
1495 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1497 /* Define fields and accessors for nodes representing data types. */
1499 /* See tree.def for documentation of the use of these fields.
1500 Look at the documentation of the various ..._TYPE tree codes.
1502 Note that the type.values, type.minval, and type.maxval fields are
1503 overloaded and used for different macros in different kinds of types.
1504 Each macro must check to ensure the tree node is of the proper kind of
1505 type. Note also that some of the front-ends also overload these fields,
1506 so they must be checked as well. */
1508 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1509 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1510 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1511 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1512 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1513 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1514 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1515 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1516 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1517 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1519 /* Vector types need to check target flags to determine type. */
1520 extern enum machine_mode
vector_type_mode (const_tree
);
1521 #define TYPE_MODE(NODE) \
1522 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1523 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1524 #define SET_TYPE_MODE(NODE, MODE) \
1525 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1527 /* The "canonical" type for this type node, which is used by frontends to
1528 compare the type for equality with another type. If two types are
1529 equal (based on the semantics of the language), then they will have
1530 equivalent TYPE_CANONICAL entries.
1532 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1533 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1534 be used for comparison against other types. Instead, the type is
1535 said to require structural equality checks, described in
1536 TYPE_STRUCTURAL_EQUALITY_P.
1538 For unqualified aggregate and function types the middle-end relies on
1539 TYPE_CANONICAL to tell whether two variables can be assigned
1540 to each other without a conversion. The middle-end also makes sure
1541 to assign the same alias-sets to the type partition with equal
1542 TYPE_CANONICAL of their unqualified variants. */
1543 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1544 /* Indicates that the type node requires structural equality
1545 checks. The compiler will need to look at the composition of the
1546 type to determine whether it is equal to another type, rather than
1547 just comparing canonical type pointers. For instance, we would need
1548 to look at the return and parameter types of a FUNCTION_TYPE
1550 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1551 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1552 type node requires structural equality. */
1553 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1555 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1556 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1558 /* The (language-specific) typed-based alias set for this type.
1559 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1560 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1561 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1562 type can alias objects of any type. */
1563 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1565 /* Nonzero iff the typed-based alias set for this type has been
1567 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1568 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1570 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1572 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1574 /* The alignment necessary for objects of this type.
1575 The value is an int, measured in bits. */
1576 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1578 /* 1 if the alignment for this type was requested by "aligned" attribute,
1579 0 if it is the default for this type. */
1580 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1582 /* The alignment for NODE, in bytes. */
1583 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1585 /* If your language allows you to declare types, and you want debug info
1586 for them, then you need to generate corresponding TYPE_DECL nodes.
1587 These "stub" TYPE_DECL nodes have no name, and simply point at the
1588 type node. You then set the TYPE_STUB_DECL field of the type node
1589 to point back at the TYPE_DECL node. This allows the debug routines
1590 to know that the two nodes represent the same type, so that we only
1591 get one debug info record for them. */
1592 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1594 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1595 the type has BLKmode only because it lacks the alignment required for
1597 #define TYPE_NO_FORCE_BLK(NODE) \
1598 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1600 /* Nonzero in a type considered volatile as a whole. */
1601 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1603 /* Means this type is const-qualified. */
1604 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1606 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1608 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1610 /* If nonzero, type's name shouldn't be emitted into debug info. */
1611 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1613 /* The address space the type is in. */
1614 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1616 /* Encode/decode the named memory support as part of the qualifier. If more
1617 than 8 qualifiers are added, these macros need to be adjusted. */
1618 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1619 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1621 /* Return all qualifiers except for the address space qualifiers. */
1622 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1624 /* Only keep the address space out of the qualifiers and discard the other
1626 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1628 /* The set of type qualifiers for this type. */
1629 #define TYPE_QUALS(NODE) \
1630 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1631 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1632 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1633 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1635 /* The same as TYPE_QUALS without the address space qualifications. */
1636 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1637 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1638 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1639 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1641 /* These flags are available for each language front end to use internally. */
1642 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1643 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1644 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1645 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1646 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1647 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1648 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1650 /* Used to keep track of visited nodes in tree traversals. This is set to
1651 0 by copy_node and make_node. */
1652 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1654 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1655 that distinguish string from array of char).
1656 If set in a INTEGER_TYPE, indicates a character type. */
1657 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1659 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1660 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1661 (((unsigned HOST_WIDE_INT) 1) \
1662 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1664 /* Set precision to n when we have 2^n sub-parts of the vector. */
1665 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1666 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1668 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1669 about missing conversions to other vector types of the same size. */
1670 #define TYPE_VECTOR_OPAQUE(NODE) \
1671 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1673 /* Indicates that objects of this type must be initialized by calling a
1674 function when they are created. */
1675 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1676 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1678 /* Indicates that a UNION_TYPE object should be passed the same way that
1679 the first union alternative would be passed, or that a RECORD_TYPE
1680 object should be passed the same way that the first (and only) member
1682 #define TYPE_TRANSPARENT_AGGR(NODE) \
1683 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1685 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1686 address of a component of the type. This is the counterpart of
1687 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1688 #define TYPE_NONALIASED_COMPONENT(NODE) \
1689 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1691 /* Indicated that objects of this type should be laid out in as
1692 compact a way as possible. */
1693 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1695 /* Used by type_contains_placeholder_p to avoid recomputation.
1696 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1697 this field directly. */
1698 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1699 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1701 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1702 #define TYPE_FINAL_P(NODE) \
1703 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1705 /* The debug output functions use the symtab union field to store
1706 information specific to the debugging format. The different debug
1707 output hooks store different types in the union field. These three
1708 macros are used to access different fields in the union. The debug
1709 hooks are responsible for consistently using only a specific
1712 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1713 hold the type's number in the generated stabs. */
1714 #define TYPE_SYMTAB_ADDRESS(NODE) \
1715 (TYPE_CHECK (NODE)->type_common.symtab.address)
1717 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1718 hold struct/union type tag names. */
1719 #define TYPE_SYMTAB_POINTER(NODE) \
1720 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1722 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1723 in dwarf2out.c to point to the DIE generated for the type. */
1724 #define TYPE_SYMTAB_DIE(NODE) \
1725 (TYPE_CHECK (NODE)->type_common.symtab.die)
1727 /* The garbage collector needs to know the interpretation of the
1728 symtab field. These constants represent the different types in the
1731 #define TYPE_SYMTAB_IS_ADDRESS (0)
1732 #define TYPE_SYMTAB_IS_POINTER (1)
1733 #define TYPE_SYMTAB_IS_DIE (2)
1735 #define TYPE_LANG_SPECIFIC(NODE) \
1736 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1738 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1739 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1740 #define TYPE_FIELDS(NODE) \
1741 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1742 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1743 #define TYPE_ARG_TYPES(NODE) \
1744 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1745 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1747 #define TYPE_METHODS(NODE) \
1748 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1749 #define TYPE_VFIELD(NODE) \
1750 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1751 #define TYPE_METHOD_BASETYPE(NODE) \
1752 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1753 #define TYPE_OFFSET_BASETYPE(NODE) \
1754 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1755 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1756 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1757 #define TYPE_NEXT_PTR_TO(NODE) \
1758 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1759 #define TYPE_NEXT_REF_TO(NODE) \
1760 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1761 #define TYPE_MIN_VALUE(NODE) \
1762 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1763 #define TYPE_MAX_VALUE(NODE) \
1764 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1766 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1767 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1769 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1770 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1772 /* For record and union types, information about this type, as a base type
1774 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1776 /* For non record and union types, used in a language-dependent way. */
1777 #define TYPE_LANG_SLOT_1(NODE) \
1778 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1780 /* Define accessor macros for information about type inheritance
1783 A "basetype" means a particular usage of a data type for inheritance
1784 in another type. Each such basetype usage has its own "binfo"
1785 object to describe it. The binfo object is a TREE_VEC node.
1787 Inheritance is represented by the binfo nodes allocated for a
1788 given type. For example, given types C and D, such that D is
1789 inherited by C, 3 binfo nodes will be allocated: one for describing
1790 the binfo properties of C, similarly one for D, and one for
1791 describing the binfo properties of D as a base type for C.
1792 Thus, given a pointer to class C, one can get a pointer to the binfo
1793 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1795 /* BINFO specific flags. */
1797 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1798 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1800 /* Flags for language dependent use. */
1801 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1802 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1803 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1804 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1805 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1806 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1807 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1809 /* The actual data type node being inherited in this basetype. */
1810 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1812 /* The offset where this basetype appears in its containing type.
1813 BINFO_OFFSET slot holds the offset (in bytes)
1814 from the base of the complete object to the base of the part of the
1815 object that is allocated on behalf of this `type'.
1816 This is always 0 except when there is multiple inheritance. */
1818 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1819 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1821 /* The virtual function table belonging to this basetype. Virtual
1822 function tables provide a mechanism for run-time method dispatching.
1823 The entries of a virtual function table are language-dependent. */
1825 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1827 /* The virtual functions in the virtual function table. This is
1828 a TREE_LIST that is used as an initial approximation for building
1829 a virtual function table for this basetype. */
1830 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1832 /* A vector of binfos for the direct basetypes inherited by this
1835 If this basetype describes type D as inherited in C, and if the
1836 basetypes of D are E and F, then this vector contains binfos for
1837 inheritance of E and F by C. */
1838 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1840 /* The number of basetypes for NODE. */
1841 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1843 /* Accessor macro to get to the Nth base binfo of this binfo. */
1844 #define BINFO_BASE_BINFO(NODE,N) \
1845 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1846 #define BINFO_BASE_ITERATE(NODE,N,B) \
1847 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1848 #define BINFO_BASE_APPEND(NODE,T) \
1849 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1851 /* For a BINFO record describing a virtual base class, i.e., one where
1852 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1853 base. The actual contents are language-dependent. In the C++
1854 front-end this field is an INTEGER_CST giving an offset into the
1855 vtable where the offset to the virtual base can be found. */
1856 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1858 /* Indicates the accesses this binfo has to its bases. The values are
1859 access_public_node, access_protected_node or access_private_node.
1860 If this array is not present, public access is implied. */
1861 #define BINFO_BASE_ACCESSES(NODE) \
1862 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1864 #define BINFO_BASE_ACCESS(NODE,N) \
1865 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1866 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1867 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1869 /* The index in the VTT where this subobject's sub-VTT can be found.
1870 NULL_TREE if there is no sub-VTT. */
1871 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1873 /* The index in the VTT where the vptr for this subobject can be
1874 found. NULL_TREE if there is no secondary vptr in the VTT. */
1875 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1877 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1878 inheriting this base for non-virtual bases. For virtual bases it
1879 points either to the binfo for which this is a primary binfo, or to
1880 the binfo of the most derived type. */
1881 #define BINFO_INHERITANCE_CHAIN(NODE) \
1882 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1885 /* Define fields and accessors for nodes representing declared names. */
1887 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1888 have an associated SSA name. */
1889 #define SSA_VAR_P(DECL) \
1890 (TREE_CODE (DECL) == VAR_DECL \
1891 || TREE_CODE (DECL) == PARM_DECL \
1892 || TREE_CODE (DECL) == RESULT_DECL \
1893 || TREE_CODE (DECL) == SSA_NAME)
1896 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1898 /* This is the name of the object as written by the user.
1899 It is an IDENTIFIER_NODE. */
1900 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1902 /* Every ..._DECL node gets a unique number. */
1903 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1905 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1907 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1909 /* Every ..._DECL node gets a unique number that stays the same even
1910 when the decl is copied by the inliner once it is set. */
1911 #define DECL_PT_UID(NODE) \
1912 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1913 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1914 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1915 #define SET_DECL_PT_UID(NODE, UID) \
1916 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1917 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1918 be preserved when copyin the decl. */
1919 #define DECL_PT_UID_SET_P(NODE) \
1920 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1922 /* These two fields describe where in the source code the declaration
1923 was. If the declaration appears in several places (as for a C
1924 function that is declared first and then defined later), this
1925 information should refer to the definition. */
1926 #define DECL_SOURCE_LOCATION(NODE) \
1927 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1928 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1929 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1930 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1931 /* This accessor returns TRUE if the decl it operates on was created
1932 by a front-end or back-end rather than by user code. In this case
1933 builtin-ness is indicated by source location. */
1934 #define DECL_IS_BUILTIN(DECL) \
1935 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1937 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1938 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1939 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1940 nodes, this points to either the FUNCTION_DECL for the containing
1941 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1942 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1943 scope". In particular, for VAR_DECLs which are virtual table pointers
1944 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1946 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1947 #define DECL_FIELD_CONTEXT(NODE) \
1948 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1950 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1951 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1953 /* For any sort of a ..._DECL node, this points to the original (abstract)
1954 decl node which this decl is an inlined/cloned instance of, or else it
1955 is NULL indicating that this decl is not an instance of some other decl.
1957 The C front-end also uses this in a nested declaration of an inline
1958 function, to point back to the definition. */
1959 #define DECL_ABSTRACT_ORIGIN(NODE) \
1960 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1962 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1963 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1964 #define DECL_ORIGIN(NODE) \
1965 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1967 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1968 inline instance of some original (abstract) decl from an inline function;
1969 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1970 nodes can also have their abstract origin set to themselves. */
1971 #define DECL_FROM_INLINE(NODE) \
1972 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1973 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1975 /* In a DECL this is the field where attributes are stored. */
1976 #define DECL_ATTRIBUTES(NODE) \
1977 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
1979 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1980 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1981 For a VAR_DECL, holds the initial value.
1982 For a PARM_DECL, used for DECL_ARG_TYPE--default
1983 values for parameters are encoded in the type of the function,
1984 not in the PARM_DECL slot.
1985 For a FIELD_DECL, this is used for enumeration values and the C
1986 frontend uses it for temporarily storing bitwidth of bitfields.
1988 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1989 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
1991 /* Holds the size of the datum, in bits, as a tree expression.
1992 Need not be constant. */
1993 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
1994 /* Likewise for the size in bytes. */
1995 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
1996 /* Holds the alignment required for the datum, in bits. */
1997 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
1998 /* The alignment of NODE, in bytes. */
1999 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2000 /* Set if the alignment of this DECL has been set by the user, for
2001 example with an 'aligned' attribute. */
2002 #define DECL_USER_ALIGN(NODE) \
2003 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2004 /* Holds the machine mode corresponding to the declaration of a variable or
2005 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2007 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2009 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2010 operation it is. Note, however, that this field is overloaded, with
2011 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2012 checked before any access to the former. */
2013 #define DECL_FUNCTION_CODE(NODE) \
2014 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2016 #define DECL_FUNCTION_PERSONALITY(NODE) \
2017 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2019 /* Nonzero for a given ..._DECL node means that the name of this node should
2020 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2021 the associated type should be ignored. For a FUNCTION_DECL, the body of
2022 the function should also be ignored. */
2023 #define DECL_IGNORED_P(NODE) \
2024 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2026 /* Nonzero for a given ..._DECL node means that this node represents an
2027 "abstract instance" of the given declaration (e.g. in the original
2028 declaration of an inline function). When generating symbolic debugging
2029 information, we mustn't try to generate any address information for nodes
2030 marked as "abstract instances" because we don't actually generate
2031 any code or allocate any data space for such instances. */
2032 #define DECL_ABSTRACT(NODE) \
2033 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2035 /* Language-specific decl information. */
2036 #define DECL_LANG_SPECIFIC(NODE) \
2037 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2039 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2040 do not allocate storage, and refer to a definition elsewhere. Note that
2041 this does not necessarily imply the entity represented by NODE
2042 has no program source-level definition in this translation unit. For
2043 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2044 DECL_EXTERNAL may be true simultaneously; that can be the case for
2045 a C99 "extern inline" function. */
2046 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2048 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2049 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2051 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2053 Also set in some languages for variables, etc., outside the normal
2054 lexical scope, such as class instance variables. */
2055 #define DECL_NONLOCAL(NODE) \
2056 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2058 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2059 Used in FIELD_DECLs for vtable pointers.
2060 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2061 #define DECL_VIRTUAL_P(NODE) \
2062 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2064 /* Used to indicate that this DECL represents a compiler-generated entity. */
2065 #define DECL_ARTIFICIAL(NODE) \
2066 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2068 /* Additional flags for language-specific uses. */
2069 #define DECL_LANG_FLAG_0(NODE) \
2070 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2071 #define DECL_LANG_FLAG_1(NODE) \
2072 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2073 #define DECL_LANG_FLAG_2(NODE) \
2074 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2075 #define DECL_LANG_FLAG_3(NODE) \
2076 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2077 #define DECL_LANG_FLAG_4(NODE) \
2078 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2079 #define DECL_LANG_FLAG_5(NODE) \
2080 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2081 #define DECL_LANG_FLAG_6(NODE) \
2082 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2083 #define DECL_LANG_FLAG_7(NODE) \
2084 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2085 #define DECL_LANG_FLAG_8(NODE) \
2086 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2088 /* Nonzero for a scope which is equal to file scope. */
2089 #define SCOPE_FILE_SCOPE_P(EXP) \
2090 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2091 /* Nonzero for a decl which is at file scope. */
2092 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2093 /* Nonzero for a type which is at file scope. */
2094 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2096 /* Nonzero for a decl that is decorated using attribute used.
2097 This indicates to compiler tools that this decl needs to be preserved. */
2098 #define DECL_PRESERVE_P(DECL) \
2099 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2101 /* For function local variables of COMPLEX and VECTOR types,
2102 indicates that the variable is not aliased, and that all
2103 modifications to the variable have been adjusted so that
2104 they are killing assignments. Thus the variable may now
2105 be treated as a GIMPLE register, and use real instead of
2106 virtual ops in SSA form. */
2107 #define DECL_GIMPLE_REG_P(DECL) \
2108 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2110 extern tree
decl_value_expr_lookup (tree
);
2111 extern void decl_value_expr_insert (tree
, tree
);
2113 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2114 if transformations have made this more complicated than evaluating the
2115 decl itself. This should only be used for debugging; once this field has
2116 been set, the decl itself may not legitimately appear in the function. */
2117 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2118 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2119 ->decl_common.decl_flag_2)
2120 #define DECL_VALUE_EXPR(NODE) \
2121 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2122 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2123 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2125 /* Holds the RTL expression for the value of a variable or function.
2126 This value can be evaluated lazily for functions, variables with
2127 static storage duration, and labels. */
2128 #define DECL_RTL(NODE) \
2129 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2130 ? (NODE)->decl_with_rtl.rtl \
2131 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2133 /* Set the DECL_RTL for NODE to RTL. */
2134 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2136 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2137 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2139 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2140 #define DECL_RTL_SET_P(NODE) \
2141 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2143 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2144 NODE1, it will not be set for NODE2; this is a lazy copy. */
2145 #define COPY_DECL_RTL(NODE1, NODE2) \
2146 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2147 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2149 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2150 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2152 #if (GCC_VERSION >= 2007)
2153 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2154 ({ tree const __d = (decl); \
2155 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2156 /* Dereference it so the compiler knows it can't be NULL even \
2157 without assertion checking. */ \
2158 &*DECL_RTL_IF_SET (__d); })
2160 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2163 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2164 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2166 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2167 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2168 of the structure. */
2169 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2171 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2172 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2173 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2174 natural alignment of the field's type). */
2175 #define DECL_FIELD_BIT_OFFSET(NODE) \
2176 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2178 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2179 if so, the type that was originally specified for it.
2180 TREE_TYPE may have been modified (in finish_struct). */
2181 #define DECL_BIT_FIELD_TYPE(NODE) \
2182 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2184 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2185 representative FIELD_DECL. */
2186 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2187 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2189 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2190 if nonzero, indicates that the field occupies the type. */
2191 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2193 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2194 DECL_FIELD_OFFSET which are known to be always zero.
2195 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2197 #define DECL_OFFSET_ALIGN(NODE) \
2198 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2200 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2201 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2202 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2204 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2205 which this FIELD_DECL is defined. This information is needed when
2206 writing debugging information about vfield and vbase decls for C++. */
2207 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2209 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2210 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2212 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2214 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2216 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2217 this component. This makes it possible for Type-Based Alias Analysis
2218 to disambiguate accesses to this field with indirect accesses using
2221 struct S { int i; } s;
2224 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2226 From the implementation's viewpoint, the alias set of the type of the
2227 field 'i' (int) will not be recorded as a subset of that of the type of
2228 's' (struct S) in record_component_aliases. The counterpart is that
2229 accesses to s.i must not be given the alias set of the type of 'i'
2230 (int) but instead directly that of the type of 's' (struct S). */
2231 #define DECL_NONADDRESSABLE_P(NODE) \
2232 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2234 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2235 dense, unique within any one function, and may be used to index arrays.
2236 If the value is -1, then no UID has been assigned. */
2237 #define LABEL_DECL_UID(NODE) \
2238 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2240 /* In a LABEL_DECL, the EH region number for which the label is the
2241 post_landing_pad. */
2242 #define EH_LANDING_PAD_NR(NODE) \
2243 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2245 /* For a PARM_DECL, records the data type used to pass the argument,
2246 which may be different from the type seen in the program. */
2247 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2249 /* For PARM_DECL, holds an RTL for the stack slot or register
2250 where the data was actually passed. */
2251 #define DECL_INCOMING_RTL(NODE) \
2252 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2254 /* Nonzero for a given ..._DECL node means that no warnings should be
2255 generated just because this node is unused. */
2256 #define DECL_IN_SYSTEM_HEADER(NODE) \
2257 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2259 /* Used to indicate that the linkage status of this DECL is not yet known,
2260 so it should not be output now. */
2261 #define DECL_DEFER_OUTPUT(NODE) \
2262 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2264 /* In a VAR_DECL that's static,
2265 nonzero if the space is in the text section. */
2266 #define DECL_IN_TEXT_SECTION(NODE) \
2267 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2269 /* In a VAR_DECL that's static,
2270 nonzero if it belongs to the global constant pool. */
2271 #define DECL_IN_CONSTANT_POOL(NODE) \
2272 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2274 /* Nonzero for a given ..._DECL node means that this node should be
2275 put in .common, if possible. If a DECL_INITIAL is given, and it
2276 is not error_mark_node, then the decl cannot be put in .common. */
2277 #define DECL_COMMON(NODE) \
2278 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2280 /* In a VAR_DECL, nonzero if the decl is a register variable with
2281 an explicit asm specification. */
2282 #define DECL_HARD_REGISTER(NODE) \
2283 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2285 /* Used to indicate that this DECL has weak linkage. */
2286 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2288 /* Used to indicate that the DECL is a dllimport. */
2289 #define DECL_DLLIMPORT_P(NODE) \
2290 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2292 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2293 not be put out unless it is needed in this translation unit.
2294 Entities like this are shared across translation units (like weak
2295 entities), but are guaranteed to be generated by any translation
2296 unit that needs them, and therefore need not be put out anywhere
2297 where they are not needed. DECL_COMDAT is just a hint to the
2298 back-end; it is up to front-ends which set this flag to ensure
2299 that there will never be any harm, other than bloat, in putting out
2300 something which is DECL_COMDAT. */
2301 #define DECL_COMDAT(NODE) \
2302 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2304 #define DECL_COMDAT_GROUP(NODE) \
2305 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2307 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2308 multiple translation units should be merged. */
2309 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2311 /* The name of the object as the assembler will see it (but before any
2312 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2313 as DECL_NAME. It is an IDENTIFIER_NODE. */
2314 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2316 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2317 This is true of all DECL nodes except FIELD_DECL. */
2318 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2319 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2321 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2322 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2324 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2325 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2326 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2328 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2329 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2330 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2332 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2333 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2334 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2335 semantics of using this macro, are different than saying:
2337 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2339 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2341 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2342 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2343 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2344 DECL_ASSEMBLER_NAME (DECL1)) \
2347 /* Records the section name in a section attribute. Used to pass
2348 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2349 #define DECL_SECTION_NAME(NODE) \
2350 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2352 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2353 this variable in a BIND_EXPR. */
2354 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2355 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2357 /* Value of the decls's visibility attribute */
2358 #define DECL_VISIBILITY(NODE) \
2359 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2361 /* Nonzero means that the decl had its visibility specified rather than
2363 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2364 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2366 /* In a VAR_DECL, the model to use if the data should be allocated from
2367 thread-local storage. */
2368 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2370 /* In a VAR_DECL, nonzero if the data should be allocated from
2371 thread-local storage. */
2372 #define DECL_THREAD_LOCAL_P(NODE) \
2373 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2375 /* In a non-local VAR_DECL with static storage duration, true if the
2376 variable has an initialization priority. If false, the variable
2377 will be initialized at the DEFAULT_INIT_PRIORITY. */
2378 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2379 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2381 /* Specify whether the section name was set by user or by
2382 compiler via -ffunction-sections. */
2383 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2384 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2386 extern tree
decl_debug_expr_lookup (tree
);
2387 extern void decl_debug_expr_insert (tree
, tree
);
2389 /* For VAR_DECL, this is set to an expression that it was split from. */
2390 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2391 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2392 #define DECL_DEBUG_EXPR(NODE) \
2393 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2395 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2396 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2398 extern priority_type
decl_init_priority_lookup (tree
);
2399 extern priority_type
decl_fini_priority_lookup (tree
);
2400 extern void decl_init_priority_insert (tree
, priority_type
);
2401 extern void decl_fini_priority_insert (tree
, priority_type
);
2403 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2405 #define DECL_INIT_PRIORITY(NODE) \
2406 (decl_init_priority_lookup (NODE))
2407 /* Set the initialization priority for NODE to VAL. */
2408 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2409 (decl_init_priority_insert (NODE, VAL))
2411 /* For a FUNCTION_DECL the finalization priority of NODE. */
2412 #define DECL_FINI_PRIORITY(NODE) \
2413 (decl_fini_priority_lookup (NODE))
2414 /* Set the finalization priority for NODE to VAL. */
2415 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2416 (decl_fini_priority_insert (NODE, VAL))
2418 /* The initialization priority for entities for which no explicit
2419 initialization priority has been specified. */
2420 #define DEFAULT_INIT_PRIORITY 65535
2422 /* The maximum allowed initialization priority. */
2423 #define MAX_INIT_PRIORITY 65535
2425 /* The largest priority value reserved for use by system runtime
2427 #define MAX_RESERVED_INIT_PRIORITY 100
2429 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2430 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2431 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2433 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2434 #define DECL_NONLOCAL_FRAME(NODE) \
2435 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2437 /* This field is used to reference anything in decl.result and is meant only
2438 for use by the garbage collector. */
2439 #define DECL_RESULT_FLD(NODE) \
2440 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2442 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2443 Before the struct containing the FUNCTION_DECL is laid out,
2444 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2445 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2446 function. When the class is laid out, this pointer is changed
2447 to an INTEGER_CST node which is suitable for use as an index
2448 into the virtual function table.
2449 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2450 #define DECL_VINDEX(NODE) \
2451 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2453 /* In FUNCTION_DECL, holds the decl for the return value. */
2454 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2456 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2457 #define DECL_UNINLINABLE(NODE) \
2458 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2460 /* In a FUNCTION_DECL, the saved representation of the body of the
2462 #define DECL_SAVED_TREE(NODE) \
2463 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2465 /* Nonzero in a FUNCTION_DECL means this function should be treated
2466 as if it were a malloc, meaning it returns a pointer that is
2468 #define DECL_IS_MALLOC(NODE) \
2469 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2471 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2472 C++ operator new, meaning that it returns a pointer for which we
2473 should not use type based aliasing. */
2474 #define DECL_IS_OPERATOR_NEW(NODE) \
2475 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2477 /* Nonzero in a FUNCTION_DECL means this function may return more
2479 #define DECL_IS_RETURNS_TWICE(NODE) \
2480 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2482 /* Nonzero in a FUNCTION_DECL means this function should be treated
2483 as "pure" function (like const function, but may read global memory). */
2484 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2486 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2487 the const or pure function may not terminate. When this is nonzero
2488 for a const or pure function, it can be dealt with by cse passes
2489 but cannot be removed by dce passes since you are not allowed to
2490 change an infinite looping program into one that terminates without
2492 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2493 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2495 /* Nonzero in a FUNCTION_DECL means this function should be treated
2496 as "novops" function (function that does not read global memory,
2497 but may have arbitrary side effects). */
2498 #define DECL_IS_NOVOPS(NODE) \
2499 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2501 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2502 at the beginning or end of execution. */
2503 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2504 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2506 #define DECL_STATIC_DESTRUCTOR(NODE) \
2507 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2509 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2510 be instrumented with calls to support routines. */
2511 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2512 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2514 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2515 disabled in this function. */
2516 #define DECL_NO_LIMIT_STACK(NODE) \
2517 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2519 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2520 #define DECL_STATIC_CHAIN(NODE) \
2521 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2523 /* Nonzero for a decl that cgraph has decided should be inlined into
2524 at least one call site. It is not meaningful to look at this
2525 directly; always use cgraph_function_possibly_inlined_p. */
2526 #define DECL_POSSIBLY_INLINED(DECL) \
2527 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2529 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2530 such as via the `inline' keyword in C/C++. This flag controls the linkage
2531 semantics of 'inline' */
2532 #define DECL_DECLARED_INLINE_P(NODE) \
2533 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2535 /* Nonzero in a FUNCTION_DECL means this function should not get
2536 -Winline warnings. */
2537 #define DECL_NO_INLINE_WARNING_P(NODE) \
2538 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2540 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2541 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2542 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2544 /* Nonzero if a FUNCTION_CODE is a TM load. */
2545 #define BUILTIN_TM_LOAD_P(FN) \
2546 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2548 /* Nonzero if a FUNCTION_CODE is a TM store. */
2549 #define BUILTIN_TM_STORE_P(FN) \
2550 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2552 #define CASE_BUILT_IN_TM_LOAD(FN) \
2553 case BUILT_IN_TM_LOAD_##FN: \
2554 case BUILT_IN_TM_LOAD_RAR_##FN: \
2555 case BUILT_IN_TM_LOAD_RAW_##FN: \
2556 case BUILT_IN_TM_LOAD_RFW_##FN
2558 #define CASE_BUILT_IN_TM_STORE(FN) \
2559 case BUILT_IN_TM_STORE_##FN: \
2560 case BUILT_IN_TM_STORE_WAR_##FN: \
2561 case BUILT_IN_TM_STORE_WAW_##FN
2563 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2564 disregarding size and cost heuristics. This is equivalent to using
2565 the always_inline attribute without the required diagnostics if the
2566 function cannot be inlined. */
2567 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2568 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2570 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2571 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2573 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2574 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2575 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2577 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2578 that describes the status of this function. */
2579 #define DECL_STRUCT_FUNCTION(NODE) \
2580 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2582 /* In a FUNCTION_DECL, nonzero means a built in function of a
2583 standard library or more generally a built in function that is
2584 recognized by optimizers and expanders.
2586 Note that it is different from the DECL_IS_BUILTIN accessor. For
2587 instance, user declared prototypes of C library functions are not
2588 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2589 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2591 /* For a builtin function, identify which part of the compiler defined it. */
2592 #define DECL_BUILT_IN_CLASS(NODE) \
2593 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2595 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2596 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2598 #define DECL_ARGUMENTS(NODE) \
2599 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2600 #define DECL_ARGUMENT_FLD(NODE) \
2601 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2603 /* In FUNCTION_DECL, the function specific target options to use when compiling
2605 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2606 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2608 /* In FUNCTION_DECL, the function specific optimization options to use when
2609 compiling this function. */
2610 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2611 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2613 /* In FUNCTION_DECL, this is set if this function has other versions generated
2614 using "target" attributes. The default version is the one which does not
2615 have any "target" attribute set. */
2616 #define DECL_FUNCTION_VERSIONED(NODE)\
2617 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2619 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2620 Devirtualization machinery uses this knowledge for determing type of the
2621 object constructed. Also we assume that constructor address is not
2623 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2624 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2626 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2627 Devirtualization machinery uses this to track types in destruction. */
2628 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2629 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2631 /* In FUNCTION_DECL that represent an virtual method this is set when
2632 the method is final. */
2633 #define DECL_FINAL_P(NODE)\
2634 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2636 /* The source language of the translation-unit. */
2637 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2638 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2640 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2642 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2643 #define DECL_ORIGINAL_TYPE(NODE) \
2644 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2646 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2647 into stabs. Instead it will generate cross reference ('x') of names.
2648 This uses the same flag as DECL_EXTERNAL. */
2649 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2650 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2652 /* Getter of the imported declaration associated to the
2653 IMPORTED_DECL node. */
2654 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2655 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2657 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2658 To reduce overhead, the nodes containing the statements are not trees.
2659 This avoids the overhead of tree_common on all linked list elements.
2661 Use the interface in tree-iterator.h to access this node. */
2663 #define STATEMENT_LIST_HEAD(NODE) \
2664 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2665 #define STATEMENT_LIST_TAIL(NODE) \
2666 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2668 #define TREE_OPTIMIZATION(NODE) \
2669 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2671 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2672 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2674 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2675 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2677 /* Return a tree node that encapsulates the optimization options in OPTS. */
2678 extern tree
build_optimization_node (struct gcc_options
*opts
);
2680 extern void init_tree_optimization_optabs (tree
);
2682 #define TREE_TARGET_OPTION(NODE) \
2683 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2685 /* Return a tree node that encapsulates the target options in OPTS. */
2686 extern tree
build_target_option_node (struct gcc_options
*opts
);
2688 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2691 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2693 if (TREE_CODE (__t
) != __c
)
2694 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2699 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2702 if (TREE_CODE (__t
) == __c
)
2703 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2708 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2709 enum tree_code __c1
, enum tree_code __c2
)
2711 if (TREE_CODE (__t
) != __c1
2712 && TREE_CODE (__t
) != __c2
)
2713 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2718 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2719 enum tree_code __c1
, enum tree_code __c2
)
2721 if (TREE_CODE (__t
) == __c1
2722 || TREE_CODE (__t
) == __c2
)
2723 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2728 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2729 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2731 if (TREE_CODE (__t
) != __c1
2732 && TREE_CODE (__t
) != __c2
2733 && TREE_CODE (__t
) != __c3
)
2734 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2739 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2740 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2742 if (TREE_CODE (__t
) == __c1
2743 || TREE_CODE (__t
) == __c2
2744 || TREE_CODE (__t
) == __c3
)
2745 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2750 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2751 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2752 enum tree_code __c4
)
2754 if (TREE_CODE (__t
) != __c1
2755 && TREE_CODE (__t
) != __c2
2756 && TREE_CODE (__t
) != __c3
2757 && TREE_CODE (__t
) != __c4
)
2758 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2763 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2764 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2765 enum tree_code __c4
)
2767 if (TREE_CODE (__t
) == __c1
2768 || TREE_CODE (__t
) == __c2
2769 || TREE_CODE (__t
) == __c3
2770 || TREE_CODE (__t
) == __c4
)
2771 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2776 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2777 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2778 enum tree_code __c4
, enum tree_code __c5
)
2780 if (TREE_CODE (__t
) != __c1
2781 && TREE_CODE (__t
) != __c2
2782 && TREE_CODE (__t
) != __c3
2783 && TREE_CODE (__t
) != __c4
2784 && TREE_CODE (__t
) != __c5
)
2785 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2790 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2791 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2792 enum tree_code __c4
, enum tree_code __c5
)
2794 if (TREE_CODE (__t
) == __c1
2795 || TREE_CODE (__t
) == __c2
2796 || TREE_CODE (__t
) == __c3
2797 || TREE_CODE (__t
) == __c4
2798 || TREE_CODE (__t
) == __c5
)
2799 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2804 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2805 const char *__f
, int __l
, const char *__g
)
2807 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2808 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2813 tree_class_check (tree __t
, const enum tree_code_class __class
,
2814 const char *__f
, int __l
, const char *__g
)
2816 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2817 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2822 tree_range_check (tree __t
,
2823 enum tree_code __code1
, enum tree_code __code2
,
2824 const char *__f
, int __l
, const char *__g
)
2826 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2827 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2832 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2833 const char *__f
, int __l
, const char *__g
)
2835 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2836 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2837 if (__t
->omp_clause
.code
!= __code
)
2838 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2843 omp_clause_range_check (tree __t
,
2844 enum omp_clause_code __code1
,
2845 enum omp_clause_code __code2
,
2846 const char *__f
, int __l
, const char *__g
)
2848 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2849 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2850 if ((int) __t
->omp_clause
.code
< (int) __code1
2851 || (int) __t
->omp_clause
.code
> (int) __code2
)
2852 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2856 /* These checks have to be special cased. */
2859 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2861 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2862 if (!IS_EXPR_CODE_CLASS (__c
))
2863 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2867 /* These checks have to be special cased. */
2870 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2873 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2877 inline const HOST_WIDE_INT
*
2878 tree_int_cst_elt_check (const_tree __t
, int __i
,
2879 const char *__f
, int __l
, const char *__g
)
2881 if (TREE_CODE (__t
) != INTEGER_CST
)
2882 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2883 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2884 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2886 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2889 inline HOST_WIDE_INT
*
2890 tree_int_cst_elt_check (tree __t
, int __i
,
2891 const char *__f
, int __l
, const char *__g
)
2893 if (TREE_CODE (__t
) != INTEGER_CST
)
2894 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2895 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2896 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2898 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2902 tree_vec_elt_check (tree __t
, int __i
,
2903 const char *__f
, int __l
, const char *__g
)
2905 if (TREE_CODE (__t
) != TREE_VEC
)
2906 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2907 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2908 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2909 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2913 omp_clause_elt_check (tree __t
, int __i
,
2914 const char *__f
, int __l
, const char *__g
)
2916 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2917 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2918 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2919 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2920 return &__t
->omp_clause
.ops
[__i
];
2924 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2927 if (TREE_CODE (__t
) != __c
)
2928 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2933 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2936 if (TREE_CODE (__t
) == __c
)
2937 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2942 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2943 enum tree_code __c1
, enum tree_code __c2
)
2945 if (TREE_CODE (__t
) != __c1
2946 && TREE_CODE (__t
) != __c2
)
2947 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2952 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2953 enum tree_code __c1
, enum tree_code __c2
)
2955 if (TREE_CODE (__t
) == __c1
2956 || TREE_CODE (__t
) == __c2
)
2957 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2962 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2963 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2965 if (TREE_CODE (__t
) != __c1
2966 && TREE_CODE (__t
) != __c2
2967 && TREE_CODE (__t
) != __c3
)
2968 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2973 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2974 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2976 if (TREE_CODE (__t
) == __c1
2977 || TREE_CODE (__t
) == __c2
2978 || TREE_CODE (__t
) == __c3
)
2979 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2984 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2985 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2986 enum tree_code __c4
)
2988 if (TREE_CODE (__t
) != __c1
2989 && TREE_CODE (__t
) != __c2
2990 && TREE_CODE (__t
) != __c3
2991 && TREE_CODE (__t
) != __c4
)
2992 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2997 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2998 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2999 enum tree_code __c4
)
3001 if (TREE_CODE (__t
) == __c1
3002 || TREE_CODE (__t
) == __c2
3003 || TREE_CODE (__t
) == __c3
3004 || TREE_CODE (__t
) == __c4
)
3005 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
3010 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3011 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3012 enum tree_code __c4
, enum tree_code __c5
)
3014 if (TREE_CODE (__t
) != __c1
3015 && TREE_CODE (__t
) != __c2
3016 && TREE_CODE (__t
) != __c3
3017 && TREE_CODE (__t
) != __c4
3018 && TREE_CODE (__t
) != __c5
)
3019 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3024 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3025 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3026 enum tree_code __c4
, enum tree_code __c5
)
3028 if (TREE_CODE (__t
) == __c1
3029 || TREE_CODE (__t
) == __c2
3030 || TREE_CODE (__t
) == __c3
3031 || TREE_CODE (__t
) == __c4
3032 || TREE_CODE (__t
) == __c5
)
3033 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3038 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3039 const char *__f
, int __l
, const char *__g
)
3041 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3042 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3047 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3048 const char *__f
, int __l
, const char *__g
)
3050 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3051 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3056 tree_range_check (const_tree __t
,
3057 enum tree_code __code1
, enum tree_code __code2
,
3058 const char *__f
, int __l
, const char *__g
)
3060 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3061 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3066 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3067 const char *__f
, int __l
, const char *__g
)
3069 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3070 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3071 if (__t
->omp_clause
.code
!= __code
)
3072 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3077 omp_clause_range_check (const_tree __t
,
3078 enum omp_clause_code __code1
,
3079 enum omp_clause_code __code2
,
3080 const char *__f
, int __l
, const char *__g
)
3082 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3083 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3084 if ((int) __t
->omp_clause
.code
< (int) __code1
3085 || (int) __t
->omp_clause
.code
> (int) __code2
)
3086 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3091 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3093 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3094 if (!IS_EXPR_CODE_CLASS (__c
))
3095 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3100 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3103 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3108 tree_vec_elt_check (const_tree __t
, int __i
,
3109 const char *__f
, int __l
, const char *__g
)
3111 if (TREE_CODE (__t
) != TREE_VEC
)
3112 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3113 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3114 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3115 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3116 //return &__t->vec.a[__i];
3120 omp_clause_elt_check (const_tree __t
, int __i
,
3121 const char *__f
, int __l
, const char *__g
)
3123 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3124 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3125 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3126 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3127 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3132 /* Checks that X is integer constant that can be expressed in signed
3133 HOST_WIDE_INT without loss of precision. This function differs
3134 from the tree_fits_* versions in that the signedness of the
3135 type of X is not considered. */
3138 cst_fits_shwi_p (const_tree x
)
3140 if (TREE_CODE (x
) != INTEGER_CST
)
3143 return TREE_INT_CST_NUNITS (x
) == 1;
3146 /* Checks that X is integer constant that can be expressed in signed
3147 HOST_WIDE_INT without loss of precision. This function differs
3148 from the tree_fits_* versions in that the signedness of the
3149 type of X is not considered. */
3152 cst_fits_uhwi_p (const_tree x
)
3154 if (TREE_CODE (x
) != INTEGER_CST
)
3157 return TREE_INT_CST_NUNITS (x
) == 1 && TREE_INT_CST_ELT (x
, 0) >= 0;
3160 /* Return true if T is an INTEGER_CST whose value must be non-negative
3161 and can be represented in a single unsigned HOST_WIDE_INT. This
3162 function differs from the cst_fits versions in that the signedness
3163 of the type of cst is considered. */
3166 tree_fits_uhwi_p (const_tree cst
)
3169 if (cst
== NULL_TREE
)
3172 type
= TREE_TYPE (cst
);
3174 if (TREE_CODE (cst
) != INTEGER_CST
)
3177 if (TREE_INT_CST_NUNITS (cst
) == 1)
3179 if ((TYPE_SIGN (type
) == UNSIGNED
)
3180 && (TYPE_PRECISION (type
) <= HOST_BITS_PER_WIDE_INT
))
3183 /* For numbers of unsigned type that are longer than a HWI, if
3184 the top bit of the bottom word is set, and there is not
3185 another element, then this is too large to fit in a single
3186 hwi. For signed numbers, negative values are not allowed. */
3187 if (TREE_INT_CST_ELT (cst
, 0) >= 0)
3190 else if (TREE_INT_CST_NUNITS (cst
) == 2)
3192 if (TREE_INT_CST_ELT (cst
, 1) == 0)
3198 /* Return true if CST is an INTEGER_CST whose value can be represented
3199 in a single HOST_WIDE_INT. This function differs from the cst_fits
3200 versions in that the signedness of the type of cst is
3204 tree_fits_shwi_p (const_tree cst
)
3206 if (cst
== NULL_TREE
)
3209 if (TREE_CODE (cst
) != INTEGER_CST
)
3212 if (TREE_INT_CST_NUNITS (cst
) != 1)
3215 if (TYPE_SIGN (TREE_TYPE (cst
)) == SIGNED
)
3218 if (TREE_INT_CST_ELT (cst
, 0) >= 0)
3224 /* Return true if T is an INTEGER_CST that can be manipulated
3225 efficiently on the host. If SIGN is SIGNED, the value can be
3226 represented in a single HOST_WIDE_INT. If SIGN is UNSIGNED, the
3227 value must be non-negative and can be represented in a single
3228 unsigned HOST_WIDE_INT. */
3231 tree_fits_hwi_p (const_tree cst
, signop sign
)
3233 return sign
? tree_fits_uhwi_p (cst
) : tree_fits_shwi_p (cst
);
3236 /* Return true if T is an INTEGER_CST that can be manipulated
3237 efficiently on the host. If the sign of CST is SIGNED, the value
3238 can be represented in a single HOST_WIDE_INT. If the sign of CST
3239 is UNSIGNED, the value must be non-negative and can be represented
3240 in a single unsigned HOST_WIDE_INT. */
3243 tree_fits_hwi_p (const_tree cst
)
3245 if (cst
== NULL_TREE
)
3248 if (TREE_CODE (cst
) != INTEGER_CST
)
3251 return TYPE_UNSIGNED (TREE_TYPE (cst
))
3252 ? tree_fits_uhwi_p (cst
) : tree_fits_shwi_p (cst
);
3255 /* Return the unsigned HOST_WIDE_INT least significant bits of CST.
3256 If checking is enabled, this ices if the value does not fit. */
3258 static inline unsigned HOST_WIDE_INT
3259 tree_to_uhwi (const_tree cst
)
3261 gcc_checking_assert (tree_fits_uhwi_p (cst
));
3263 return (unsigned HOST_WIDE_INT
)TREE_INT_CST_ELT (cst
, 0);
3266 /* Return the HOST_WIDE_INT least significant bits of CST. If
3267 checking is enabled, this ices if the value does not fit. */
3269 static inline HOST_WIDE_INT
3270 tree_to_shwi (const_tree cst
)
3272 gcc_checking_assert (tree_fits_shwi_p (cst
));
3274 return (HOST_WIDE_INT
)TREE_INT_CST_ELT (cst
, 0);
3277 /* Return the HOST_WIDE_INT least significant bits of CST. No
3278 checking is done to assure that it fits. It is assumed that one of
3279 tree_fits_uhwi_p or tree_fits_shwi_p was done before this call. */
3281 static inline HOST_WIDE_INT
3282 tree_to_hwi (const_tree cst
)
3284 return TREE_INT_CST_ELT (cst
, 0);
3287 /* Return the HOST_WIDE_INT least significant bits of CST. The sign
3288 of the checking is based on SIGNOP. */
3290 static inline HOST_WIDE_INT
3291 tree_to_hwi (const_tree cst
, signop sgn
)
3294 return tree_to_shwi (cst
);
3296 return tree_to_uhwi (cst
);
3300 /* Compute the number of operands in an expression node NODE. For
3301 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3302 otherwise it is looked up from the node's code. */
3304 tree_operand_length (const_tree node
)
3306 if (VL_EXP_CLASS_P (node
))
3307 return VL_EXP_OPERAND_LENGTH (node
);
3309 return TREE_CODE_LENGTH (TREE_CODE (node
));
3312 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3314 /* Special checks for TREE_OPERANDs. */
3316 tree_operand_check (tree __t
, int __i
,
3317 const char *__f
, int __l
, const char *__g
)
3319 const_tree __u
= EXPR_CHECK (__t
);
3320 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3321 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3322 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3326 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3327 const char *__f
, int __l
, const char *__g
)
3329 if (TREE_CODE (__t
) != __code
)
3330 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3331 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3332 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3333 return &__t
->exp
.operands
[__i
];
3337 tree_operand_check (const_tree __t
, int __i
,
3338 const char *__f
, int __l
, const char *__g
)
3340 const_tree __u
= EXPR_CHECK (__t
);
3341 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3342 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3343 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3347 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3348 const char *__f
, int __l
, const char *__g
)
3350 if (TREE_CODE (__t
) != __code
)
3351 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3352 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3353 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3354 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3359 #define error_mark_node global_trees[TI_ERROR_MARK]
3361 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3362 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3363 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3364 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3365 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3367 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3368 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3369 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3370 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3371 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3373 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3374 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3375 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3377 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3378 #define integer_one_node global_trees[TI_INTEGER_ONE]
3379 #define integer_three_node global_trees[TI_INTEGER_THREE]
3380 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3381 #define size_zero_node global_trees[TI_SIZE_ZERO]
3382 #define size_one_node global_trees[TI_SIZE_ONE]
3383 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3384 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3385 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3387 /* Base access nodes. */
3388 #define access_public_node global_trees[TI_PUBLIC]
3389 #define access_protected_node global_trees[TI_PROTECTED]
3390 #define access_private_node global_trees[TI_PRIVATE]
3392 #define null_pointer_node global_trees[TI_NULL_POINTER]
3394 #define float_type_node global_trees[TI_FLOAT_TYPE]
3395 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3396 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3398 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3399 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3400 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3401 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3403 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3404 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3405 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3406 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3408 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3410 #define void_type_node global_trees[TI_VOID_TYPE]
3411 /* The C type `void *'. */
3412 #define ptr_type_node global_trees[TI_PTR_TYPE]
3413 /* The C type `const void *'. */
3414 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3415 /* The C type `size_t'. */
3416 #define size_type_node global_trees[TI_SIZE_TYPE]
3417 #define pid_type_node global_trees[TI_PID_TYPE]
3418 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3419 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3420 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3421 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3422 /* The C type `FILE *'. */
3423 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3424 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3426 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3427 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3428 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3430 /* The decimal floating point types. */
3431 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3432 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3433 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3434 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3435 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3436 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3438 /* The fixed-point types. */
3439 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3440 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3441 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3442 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3443 #define sat_unsigned_short_fract_type_node \
3444 global_trees[TI_SAT_USFRACT_TYPE]
3445 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3446 #define sat_unsigned_long_fract_type_node \
3447 global_trees[TI_SAT_ULFRACT_TYPE]
3448 #define sat_unsigned_long_long_fract_type_node \
3449 global_trees[TI_SAT_ULLFRACT_TYPE]
3450 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3451 #define fract_type_node global_trees[TI_FRACT_TYPE]
3452 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3453 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3454 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3455 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3456 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3457 #define unsigned_long_long_fract_type_node \
3458 global_trees[TI_ULLFRACT_TYPE]
3459 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3460 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3461 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3462 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3463 #define sat_unsigned_short_accum_type_node \
3464 global_trees[TI_SAT_USACCUM_TYPE]
3465 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3466 #define sat_unsigned_long_accum_type_node \
3467 global_trees[TI_SAT_ULACCUM_TYPE]
3468 #define sat_unsigned_long_long_accum_type_node \
3469 global_trees[TI_SAT_ULLACCUM_TYPE]
3470 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3471 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3472 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3473 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3474 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3475 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3476 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3477 #define unsigned_long_long_accum_type_node \
3478 global_trees[TI_ULLACCUM_TYPE]
3479 #define qq_type_node global_trees[TI_QQ_TYPE]
3480 #define hq_type_node global_trees[TI_HQ_TYPE]
3481 #define sq_type_node global_trees[TI_SQ_TYPE]
3482 #define dq_type_node global_trees[TI_DQ_TYPE]
3483 #define tq_type_node global_trees[TI_TQ_TYPE]
3484 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3485 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3486 #define usq_type_node global_trees[TI_USQ_TYPE]
3487 #define udq_type_node global_trees[TI_UDQ_TYPE]
3488 #define utq_type_node global_trees[TI_UTQ_TYPE]
3489 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3490 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3491 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3492 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3493 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3494 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3495 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3496 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3497 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3498 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3499 #define ha_type_node global_trees[TI_HA_TYPE]
3500 #define sa_type_node global_trees[TI_SA_TYPE]
3501 #define da_type_node global_trees[TI_DA_TYPE]
3502 #define ta_type_node global_trees[TI_TA_TYPE]
3503 #define uha_type_node global_trees[TI_UHA_TYPE]
3504 #define usa_type_node global_trees[TI_USA_TYPE]
3505 #define uda_type_node global_trees[TI_UDA_TYPE]
3506 #define uta_type_node global_trees[TI_UTA_TYPE]
3507 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3508 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3509 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3510 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3511 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3512 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3513 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3514 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3516 /* The node that should be placed at the end of a parameter list to
3517 indicate that the function does not take a variable number of
3518 arguments. The TREE_VALUE will be void_type_node and there will be
3519 no TREE_CHAIN. Language-independent code should not assume
3520 anything else about this node. */
3521 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3523 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3524 #define MAIN_NAME_P(NODE) \
3525 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3527 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3529 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3530 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3532 /* Default/current target options (TARGET_OPTION_NODE). */
3533 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3534 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3536 /* Default tree list option(), optimize() pragmas to be linked into the
3538 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3539 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3541 #define char_type_node integer_types[itk_char]
3542 #define signed_char_type_node integer_types[itk_signed_char]
3543 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3544 #define short_integer_type_node integer_types[itk_short]
3545 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3546 #define integer_type_node integer_types[itk_int]
3547 #define unsigned_type_node integer_types[itk_unsigned_int]
3548 #define long_integer_type_node integer_types[itk_long]
3549 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3550 #define long_long_integer_type_node integer_types[itk_long_long]
3551 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3552 #define int128_integer_type_node integer_types[itk_int128]
3553 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3555 /* True if NODE is an erroneous expression. */
3557 #define error_operand_p(NODE) \
3558 ((NODE) == error_mark_node \
3559 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3561 extern tree
decl_assembler_name (tree
);
3562 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3563 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3565 /* Compute the number of bytes occupied by 'node'. This routine only
3566 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3568 extern size_t tree_size (const_tree
);
3570 /* Compute the number of bytes occupied by a tree with code CODE.
3571 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3572 which are of variable length. */
3573 extern size_t tree_code_size (enum tree_code
);
3575 /* Allocate and return a new UID from the DECL_UID namespace. */
3576 extern int allocate_decl_uid (void);
3578 /* Lowest level primitive for allocating a node.
3579 The TREE_CODE is the only argument. Contents are initialized
3580 to zero except for a few of the common fields. */
3582 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3583 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3585 /* Make a copy of a node, with all the same contents. */
3587 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3588 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3590 /* Make a copy of a chain of TREE_LIST nodes. */
3592 extern tree
copy_list (tree
);
3594 /* Make a CASE_LABEL_EXPR. */
3596 extern tree
build_case_label (tree
, tree
, tree
);
3599 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3600 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3602 /* Make a INTEGER_CST. */
3604 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3605 #define make_int_cst(LEN, EXT_LEN) \
3606 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3608 /* Make a TREE_VEC. */
3610 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3611 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3613 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3614 The name is supplied as a char *. */
3616 extern tree
get_identifier (const char *);
3618 #if GCC_VERSION >= 3000
3619 #define get_identifier(str) \
3620 (__builtin_constant_p (str) \
3621 ? get_identifier_with_length ((str), strlen (str)) \
3622 : get_identifier (str))
3626 /* Identical to get_identifier, except that the length is assumed
3629 extern tree
get_identifier_with_length (const char *, size_t);
3631 /* If an identifier with the name TEXT (a null-terminated string) has
3632 previously been referred to, return that node; otherwise return
3635 extern tree
maybe_get_identifier (const char *);
3637 /* Construct various types of nodes. */
3639 extern tree
build_nt (enum tree_code
, ...);
3640 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3642 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3643 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3644 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3645 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3646 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3647 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3648 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3649 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3650 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3651 tree MEM_STAT_DECL
);
3652 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3653 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3654 tree MEM_STAT_DECL
);
3655 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3657 /* _loc versions of build[1-5]. */
3660 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3661 tree arg1 MEM_STAT_DECL
)
3663 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3664 if (CAN_HAVE_LOCATION_P (t
))
3665 SET_EXPR_LOCATION (t
, loc
);
3668 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3671 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3672 tree arg1 MEM_STAT_DECL
)
3674 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3675 if (CAN_HAVE_LOCATION_P (t
))
3676 SET_EXPR_LOCATION (t
, loc
);
3679 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3682 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3683 tree arg1
, tree arg2 MEM_STAT_DECL
)
3685 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3686 if (CAN_HAVE_LOCATION_P (t
))
3687 SET_EXPR_LOCATION (t
, loc
);
3690 #define build3_loc(l,c,t1,t2,t3,t4) \
3691 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3694 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3695 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3697 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3698 if (CAN_HAVE_LOCATION_P (t
))
3699 SET_EXPR_LOCATION (t
, loc
);
3702 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3703 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3706 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3707 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3709 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3710 arg4 PASS_MEM_STAT
);
3711 if (CAN_HAVE_LOCATION_P (t
))
3712 SET_EXPR_LOCATION (t
, loc
);
3715 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3716 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3718 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3719 #define build_var_debug_value(t1,t2) \
3720 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3722 /* Constructs double_int from tree CST. */
3724 extern tree
double_int_to_tree (tree
, double_int
);
3726 extern offset_int
mem_ref_offset (const_tree
);
3727 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3728 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3730 /* Create an INT_CST node with a CST value zero extended. */
3733 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3734 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3735 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3736 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3737 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3738 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3739 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3740 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3741 extern tree
build_vector_from_val (tree
, tree
);
3742 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3743 extern tree
build_constructor_single (tree
, tree
, tree
);
3744 extern tree
build_constructor_from_list (tree
, tree
);
3745 extern tree
build_constructor_va (tree
, int, ...);
3746 extern tree
build_real_from_int_cst (tree
, const_tree
);
3747 extern tree
build_complex (tree
, tree
, tree
);
3748 extern tree
build_one_cst (tree
);
3749 extern tree
build_minus_one_cst (tree
);
3750 extern tree
build_all_ones_cst (tree
);
3751 extern tree
build_zero_cst (tree
);
3752 extern tree
build_string (int, const char *);
3753 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3754 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3755 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3756 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3757 extern tree
build_decl_stat (location_t
, enum tree_code
,
3758 tree
, tree MEM_STAT_DECL
);
3759 extern tree
build_fn_decl (const char *, tree
);
3760 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3761 extern tree
build_translation_unit_decl (tree
);
3762 extern tree
build_block (tree
, tree
, tree
, tree
);
3763 extern tree
build_empty_stmt (location_t
);
3764 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3766 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3767 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3769 extern tree
build_call_nary (tree
, tree
, int, ...);
3770 extern tree
build_call_valist (tree
, tree
, int, va_list);
3771 #define build_call_array(T1,T2,N,T3)\
3772 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3773 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3774 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3776 /* Construct various nodes representing data types. */
3778 extern tree
make_signed_type (int);
3779 extern tree
make_unsigned_type (int);
3780 extern tree
signed_or_unsigned_type_for (int, tree
);
3781 extern tree
signed_type_for (tree
);
3782 extern tree
unsigned_type_for (tree
);
3783 extern tree
truth_type_for (tree
);
3784 extern void initialize_sizetypes (void);
3785 extern void fixup_unsigned_type (tree
);
3786 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3787 extern tree
build_pointer_type (tree
);
3788 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3789 extern tree
build_reference_type (tree
);
3790 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3791 extern tree
build_vector_type (tree innertype
, int nunits
);
3792 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3793 extern tree
build_type_no_quals (tree
);
3794 extern tree
build_index_type (tree
);
3795 extern tree
build_array_type (tree
, tree
);
3796 extern tree
build_nonshared_array_type (tree
, tree
);
3797 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3798 extern tree
build_function_type (tree
, tree
);
3799 extern tree
build_function_type_list (tree
, ...);
3800 extern tree
build_function_decl_skip_args (tree
, bitmap
, bool);
3801 extern tree
build_varargs_function_type_list (tree
, ...);
3802 extern tree
build_function_type_array (tree
, int, tree
*);
3803 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3804 #define build_function_type_vec(RET, V) \
3805 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3806 #define build_varargs_function_type_vec(RET, V) \
3807 build_varargs_function_type_array (RET, vec_safe_length (V), \
3808 vec_safe_address (V))
3809 extern tree
build_method_type_directly (tree
, tree
, tree
);
3810 extern tree
build_method_type (tree
, tree
);
3811 extern tree
build_offset_type (tree
, tree
);
3812 extern tree
build_complex_type (tree
);
3813 extern tree
array_type_nelts (const_tree
);
3814 extern bool in_array_bounds_p (tree
);
3815 extern bool range_in_array_bounds_p (tree
);
3817 extern tree
value_member (tree
, tree
);
3818 extern tree
purpose_member (const_tree
, tree
);
3819 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3820 extern tree
chain_index (int, tree
);
3822 extern int attribute_list_equal (const_tree
, const_tree
);
3823 extern int attribute_list_contained (const_tree
, const_tree
);
3824 extern int tree_int_cst_equal (const_tree
, const_tree
);
3825 extern int tree_int_cst_lt (const_tree
, const_tree
);
3826 extern int tree_int_cst_compare (const_tree
, const_tree
);
3827 extern HOST_WIDE_INT
size_low_cst (const_tree
);
3828 extern int tree_int_cst_sgn (const_tree
);
3829 extern int tree_int_cst_sign_bit (const_tree
);
3830 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
3831 extern bool tree_expr_nonnegative_p (tree
);
3832 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3833 extern bool may_negate_without_overflow_p (const_tree
);
3834 extern tree
strip_array_types (tree
);
3835 extern tree
excess_precision_type (tree
);
3836 extern bool valid_constant_size_p (const_tree
);
3837 extern unsigned int element_precision (const_tree
);
3839 /* Construct various nodes representing fract or accum data types. */
3841 extern tree
make_fract_type (int, int, int);
3842 extern tree
make_accum_type (int, int, int);
3844 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3845 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3846 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3847 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3848 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3849 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3850 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3851 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3853 #define make_or_reuse_signed_fract_type(P) \
3854 make_or_reuse_fract_type (P, 0, 0)
3855 #define make_or_reuse_unsigned_fract_type(P) \
3856 make_or_reuse_fract_type (P, 1, 0)
3857 #define make_or_reuse_sat_signed_fract_type(P) \
3858 make_or_reuse_fract_type (P, 0, 1)
3859 #define make_or_reuse_sat_unsigned_fract_type(P) \
3860 make_or_reuse_fract_type (P, 1, 1)
3861 #define make_or_reuse_signed_accum_type(P) \
3862 make_or_reuse_accum_type (P, 0, 0)
3863 #define make_or_reuse_unsigned_accum_type(P) \
3864 make_or_reuse_accum_type (P, 1, 0)
3865 #define make_or_reuse_sat_signed_accum_type(P) \
3866 make_or_reuse_accum_type (P, 0, 1)
3867 #define make_or_reuse_sat_unsigned_accum_type(P) \
3868 make_or_reuse_accum_type (P, 1, 1)
3870 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3871 put the prototype here. Rtl.h does declare the prototype if
3872 tree.h had been included. */
3874 extern tree
make_tree (tree
, rtx
);
3876 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3879 Such modified types already made are recorded so that duplicates
3882 extern tree
build_type_attribute_variant (tree
, tree
);
3883 extern tree
build_decl_attribute_variant (tree
, tree
);
3884 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3886 /* Remove redundant "omp declare simd" attributes from fndecl. */
3887 extern void omp_remove_redundant_declare_simd_attrs (tree
);
3889 /* Return 0 if the attributes for two types are incompatible, 1 if they
3890 are compatible, and 2 if they are nearly compatible (which causes a
3891 warning to be generated). */
3892 extern int comp_type_attributes (const_tree
, const_tree
);
3894 /* Default versions of target-overridable functions. */
3895 extern tree
merge_decl_attributes (tree
, tree
);
3896 extern tree
merge_type_attributes (tree
, tree
);
3898 /* This function is a private implementation detail of lookup_attribute()
3899 and you should never call it directly. */
3900 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3902 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3903 return a pointer to the attribute's list element if the attribute
3904 is part of the list, or NULL_TREE if not found. If the attribute
3905 appears more than once, this only returns the first occurrence; the
3906 TREE_CHAIN of the return value should be passed back in if further
3907 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3911 lookup_attribute (const char *attr_name
, tree list
)
3913 gcc_checking_assert (attr_name
[0] != '_');
3914 /* In most cases, list is NULL_TREE. */
3915 if (list
== NULL_TREE
)
3918 /* Do the strlen() before calling the out-of-line implementation.
3919 In most cases attr_name is a string constant, and the compiler
3920 will optimize the strlen() away. */
3921 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3924 /* This function is a private implementation detail of
3925 is_attribute_p() and you should never call it directly. */
3926 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3928 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3929 if the identifier node is a valid attribute name for the string.
3930 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3931 be the identifier for 'text' or for '__text__'. */
3934 is_attribute_p (const char *attr_name
, const_tree ident
)
3936 gcc_checking_assert (attr_name
[0] != '_');
3937 /* Do the strlen() before calling the out-of-line implementation.
3938 In most cases attr_name is a string constant, and the compiler
3939 will optimize the strlen() away. */
3940 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3943 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3944 modified list. ATTR_NAME must be in the form 'text' (not
3947 extern tree
remove_attribute (const char *, tree
);
3949 /* Given two attributes lists, return a list of their union. */
3951 extern tree
merge_attributes (tree
, tree
);
3953 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3954 /* Given two Windows decl attributes lists, possibly including
3955 dllimport, return a list of their union . */
3956 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3958 /* Handle a "dllimport" or "dllexport" attribute. */
3959 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3962 /* Check whether CAND is suitable to be returned from get_qualified_type
3963 (BASE, TYPE_QUALS). */
3965 extern bool check_qualified_type (const_tree
, const_tree
, int);
3967 /* Return a version of the TYPE, qualified as indicated by the
3968 TYPE_QUALS, if one exists. If no qualified version exists yet,
3969 return NULL_TREE. */
3971 extern tree
get_qualified_type (tree
, int);
3973 /* Like get_qualified_type, but creates the type if it does not
3974 exist. This function never returns NULL_TREE. */
3976 extern tree
build_qualified_type (tree
, int);
3978 /* Create a variant of type T with alignment ALIGN. */
3980 extern tree
build_aligned_type (tree
, unsigned int);
3982 /* Like build_qualified_type, but only deals with the `const' and
3983 `volatile' qualifiers. This interface is retained for backwards
3984 compatibility with the various front-ends; new code should use
3985 build_qualified_type instead. */
3987 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3988 build_qualified_type ((TYPE), \
3989 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3990 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3992 /* Make a copy of a type node. */
3994 extern tree
build_distinct_type_copy (tree
);
3995 extern tree
build_variant_type_copy (tree
);
3997 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3998 fields. Optionally specify an alignment, and then lay it out. */
4000 extern void finish_builtin_struct (tree
, const char *,
4003 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4004 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4005 node, does nothing except for the first time. */
4007 extern void layout_type (tree
);
4009 extern record_layout_info
start_record_layout (tree
);
4010 extern tree
bit_from_pos (tree
, tree
);
4011 extern tree
byte_from_pos (tree
, tree
);
4012 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4013 extern void normalize_offset (tree
*, tree
*, unsigned int);
4014 extern tree
rli_size_unit_so_far (record_layout_info
);
4015 extern tree
rli_size_so_far (record_layout_info
);
4016 extern void normalize_rli (record_layout_info
);
4017 extern void place_field (record_layout_info
, tree
);
4018 extern void compute_record_mode (tree
);
4019 extern void finish_record_layout (record_layout_info
, int);
4021 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4022 return a canonicalized ..._TYPE node, so that duplicates are not made.
4023 How the hash code is computed is up to the caller, as long as any two
4024 callers that could hash identical-looking type nodes agree. */
4026 extern tree
type_hash_canon (unsigned int, tree
);
4028 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4029 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4030 fields. Call this only once for any given decl node.
4032 Second argument is the boundary that this field can be assumed to
4033 be starting at (in bits). Zero means it can be assumed aligned
4034 on any boundary that may be needed. */
4036 extern void layout_decl (tree
, unsigned);
4038 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4039 a previous call to layout_decl and calls it again. */
4041 extern void relayout_decl (tree
);
4043 /* Return the mode for data of a given size SIZE and mode class CLASS.
4044 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4045 The value is BLKmode if no other mode is found. This is like
4046 mode_for_size, but is passed a tree. */
4048 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4050 /* Return an expr equal to X but certainly not valid as an lvalue. */
4052 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4053 extern tree
non_lvalue_loc (location_t
, tree
);
4055 extern tree
convert (tree
, tree
);
4056 extern unsigned int expr_align (const_tree
);
4057 extern tree
expr_first (tree
);
4058 extern tree
expr_last (tree
);
4059 extern tree
size_in_bytes (const_tree
);
4060 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4061 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4062 extern tree
tree_expr_size (const_tree
);
4063 extern tree
bit_position (const_tree
);
4064 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4065 extern tree
byte_position (const_tree
);
4066 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4068 #define sizetype sizetype_tab[(int) stk_sizetype]
4069 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4070 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4071 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4073 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4074 #define size_binop(CODE,T1,T2)\
4075 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4076 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4077 #define size_diffop(T1,T2)\
4078 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4079 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4081 #define size_int(L) size_int_kind (L, stk_sizetype)
4082 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4083 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4084 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4086 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4087 extern tree
round_up_loc (location_t
, tree
, int);
4088 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4089 extern tree
round_down_loc (location_t
, tree
, int);
4090 extern void finalize_size_functions (void);
4092 /* Type for sizes of data-type. */
4094 #define BITS_PER_UNIT_LOG \
4095 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4096 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4097 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4099 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4100 by making the last node in X point to Y.
4101 Returns X, except if X is 0 returns Y. */
4103 extern tree
chainon (tree
, tree
);
4105 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4107 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4108 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4110 /* Return the last tree node in a chain. */
4112 extern tree
tree_last (tree
);
4114 /* Reverse the order of elements in a chain, and return the new head. */
4116 extern tree
nreverse (tree
);
4118 /* Returns the length of a chain of nodes
4119 (number of chain pointers to follow before reaching a null pointer). */
4121 extern int list_length (const_tree
);
4123 /* Returns the number of FIELD_DECLs in a type. */
4125 extern int fields_length (const_tree
);
4127 /* Returns the first FIELD_DECL in a type. */
4129 extern tree
first_field (const_tree
);
4131 /* Given an initializer INIT, return TRUE if INIT is zero or some
4132 aggregate of zeros. Otherwise return FALSE. */
4134 extern bool initializer_zerop (const_tree
);
4136 /* Given a vector VEC, return its first element if all elements are
4137 the same. Otherwise return NULL_TREE. */
4139 extern tree
uniform_vector_p (const_tree
);
4141 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4143 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4145 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
4146 HOST_WIDE_INT
*, bool *);
4148 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4150 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4152 extern int integer_zerop (const_tree
);
4154 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4156 extern int integer_onep (const_tree
);
4158 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4159 all of whose significant bits are 1. */
4161 extern int integer_all_onesp (const_tree
);
4163 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4166 extern int integer_minus_onep (const_tree
);
4168 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4169 exactly one bit 1. */
4171 extern int integer_pow2p (const_tree
);
4173 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4174 with a nonzero value. */
4176 extern int integer_nonzerop (const_tree
);
4178 extern tree
num_ending_zeros (const_tree
);
4180 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4183 extern int fixed_zerop (const_tree
);
4185 /* staticp (tree x) is nonzero if X is a reference to data allocated
4186 at a fixed address in memory. Returns the outermost data. */
4188 extern tree
staticp (tree
);
4190 /* save_expr (EXP) returns an expression equivalent to EXP
4191 but it can be used multiple times within context CTX
4192 and only evaluate EXP once. */
4194 extern tree
save_expr (tree
);
4196 /* Look inside EXPR into any simple arithmetic operations. Return the
4197 outermost non-arithmetic or non-invariant node. */
4199 extern tree
skip_simple_arithmetic (tree
);
4201 /* Look inside EXPR into simple arithmetic operations involving constants.
4202 Return the outermost non-arithmetic or non-constant node. */
4204 extern tree
skip_simple_constant_arithmetic (tree
);
4206 /* Return which tree structure is used by T. */
4208 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4210 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4211 size or offset that depends on a field within a record. */
4213 extern bool contains_placeholder_p (const_tree
);
4215 /* This macro calls the above function but short-circuits the common
4216 case of a constant to save time. Also check for null. */
4218 #define CONTAINS_PLACEHOLDER_P(EXP) \
4219 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4221 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4222 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4225 extern bool type_contains_placeholder_p (tree
);
4227 /* Given a tree EXP, find all occurrences of references to fields
4228 in a PLACEHOLDER_EXPR and place them in vector REFS without
4229 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4230 we assume here that EXP contains only arithmetic expressions
4231 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4234 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4236 /* This macro calls the above function but short-circuits the common
4237 case of a constant to save time and also checks for NULL. */
4239 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4241 if((EXP) && !TREE_CONSTANT (EXP)) \
4242 find_placeholder_in_expr (EXP, V); \
4245 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4246 return a tree with all occurrences of references to F in a
4247 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4248 CONST_DECLs. Note that we assume here that EXP contains only
4249 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4250 occurring only in their argument list. */
4252 extern tree
substitute_in_expr (tree
, tree
, tree
);
4254 /* This macro calls the above function but short-circuits the common
4255 case of a constant to save time and also checks for NULL. */
4257 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4258 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4260 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4261 for it within OBJ, a tree that is an object or a chain of references. */
4263 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4265 /* This macro calls the above function but short-circuits the common
4266 case of a constant to save time and also checks for NULL. */
4268 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4269 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4270 : substitute_placeholder_in_expr (EXP, OBJ))
4272 /* variable_size (EXP) is like save_expr (EXP) except that it
4273 is for the special case of something that is part of a
4274 variable size for a data type. It makes special arrangements
4275 to compute the value at the right time when the data type
4276 belongs to a function parameter. */
4278 extern tree
variable_size (tree
);
4280 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4281 but it can be used multiple times
4282 and only evaluate the subexpressions once. */
4284 extern tree
stabilize_reference (tree
);
4286 /* Subroutine of stabilize_reference; this is called for subtrees of
4287 references. Any expression with side-effects must be put in a SAVE_EXPR
4288 to ensure that it is only evaluated once. */
4290 extern tree
stabilize_reference_1 (tree
);
4292 /* Return EXP, stripped of any conversions to wider types
4293 in such a way that the result of converting to type FOR_TYPE
4294 is the same as if EXP were converted to FOR_TYPE.
4295 If FOR_TYPE is 0, it signifies EXP's type. */
4297 extern tree
get_unwidened (tree
, tree
);
4299 /* Return OP or a simpler expression for a narrower value
4300 which can be sign-extended or zero-extended to give back OP.
4301 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4302 or 0 if the value should be sign-extended. */
4304 extern tree
get_narrower (tree
, int *);
4306 /* Return true if T is an expression that get_inner_reference handles. */
4309 handled_component_p (const_tree t
)
4311 switch (TREE_CODE (t
))
4316 case ARRAY_RANGE_REF
:
4319 case VIEW_CONVERT_EXPR
:
4327 /* Given an expression EXP that is a handled_component_p,
4328 look for the ultimate containing object, which is returned and specify
4329 the access position and size. */
4331 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4332 tree
*, enum machine_mode
*, int *, int *,
4335 /* Return a tree of sizetype representing the size, in bytes, of the element
4336 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4338 extern tree
array_ref_element_size (tree
);
4340 bool array_at_struct_end_p (tree
);
4342 /* Return a tree representing the lower bound of the array mentioned in
4343 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4345 extern tree
array_ref_low_bound (tree
);
4347 /* Return a tree representing the upper bound of the array mentioned in
4348 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4350 extern tree
array_ref_up_bound (tree
);
4352 /* Return a tree representing the offset, in bytes, of the field referenced
4353 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4355 extern tree
component_ref_field_offset (tree
);
4357 /* Given a DECL or TYPE, return the scope in which it was declared, or
4358 NUL_TREE if there is no containing scope. */
4360 extern tree
get_containing_scope (const_tree
);
4362 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4364 extern tree
decl_function_context (const_tree
);
4366 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4367 this _DECL with its context, or zero if none. */
4368 extern tree
decl_type_context (const_tree
);
4370 /* Return 1 if EXPR is the real constant zero. */
4371 extern int real_zerop (const_tree
);
4373 /* Initialize the iterator I with arguments from function FNDECL */
4376 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4378 i
->next
= TYPE_ARG_TYPES (fntype
);
4381 /* Return a pointer that holds the next argument if there are more arguments to
4382 handle, otherwise return NULL. */
4384 static inline tree
*
4385 function_args_iter_cond_ptr (function_args_iterator
*i
)
4387 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4390 /* Return the next argument if there are more arguments to handle, otherwise
4394 function_args_iter_cond (function_args_iterator
*i
)
4396 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4399 /* Advance to the next argument. */
4401 function_args_iter_next (function_args_iterator
*i
)
4403 gcc_assert (i
->next
!= NULL_TREE
);
4404 i
->next
= TREE_CHAIN (i
->next
);
4407 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4410 inlined_function_outer_scope_p (const_tree block
)
4412 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4415 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4416 to point to the next tree element. ITER is an instance of
4417 function_args_iterator used to iterate the arguments. */
4418 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4419 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4420 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4421 function_args_iter_next (&(ITER)))
4423 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4424 to the next tree element. ITER is an instance of function_args_iterator
4425 used to iterate the arguments. */
4426 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4427 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4428 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4429 function_args_iter_next (&(ITER)))
4434 extern unsigned crc32_string (unsigned, const char *);
4435 extern unsigned crc32_byte (unsigned, char);
4436 extern unsigned crc32_unsigned (unsigned, unsigned);
4437 extern void clean_symbol_name (char *);
4438 extern tree
get_file_function_name (const char *);
4439 extern tree
get_callee_fndecl (const_tree
);
4440 extern int type_num_arguments (const_tree
);
4441 extern bool associative_tree_code (enum tree_code
);
4442 extern bool commutative_tree_code (enum tree_code
);
4443 extern bool commutative_ternary_tree_code (enum tree_code
);
4444 extern tree
upper_bound_in_type (tree
, tree
);
4445 extern tree
lower_bound_in_type (tree
, tree
);
4446 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4447 extern tree
create_artificial_label (location_t
);
4448 extern const char *get_name (tree
);
4449 extern bool stdarg_p (const_tree
);
4450 extern bool prototype_p (tree
);
4451 extern bool is_typedef_decl (tree x
);
4452 extern bool typedef_variant_p (tree
);
4453 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4454 extern tree
build_low_bits_mask (tree
, unsigned);
4455 extern tree
tree_strip_nop_conversions (tree
);
4456 extern tree
tree_strip_sign_nop_conversions (tree
);
4457 extern const_tree
strip_invariant_refs (const_tree
);
4458 extern tree
lhd_gcc_personality (void);
4459 extern void assign_assembler_name_if_neeeded (tree
);
4460 extern void warn_deprecated_use (tree
, tree
);
4461 extern void cache_integer_cst (tree
);
4465 extern void change_decl_assembler_name (tree
, tree
);
4468 extern tree
unshare_expr (tree
);
4469 extern tree
unshare_expr_without_location (tree
);
4473 extern void expand_label (tree
);
4474 extern void expand_goto (tree
);
4476 extern rtx
expand_stack_save (void);
4477 extern void expand_stack_restore (tree
);
4478 extern void expand_return (tree
);
4480 /* Compare and hash for any structure which begins with a canonical
4481 pointer. Assumes all pointers are interchangeable, which is sort
4482 of already assumed by gcc elsewhere IIRC. */
4485 struct_ptr_eq (const void *a
, const void *b
)
4487 const void * const * x
= (const void * const *) a
;
4488 const void * const * y
= (const void * const *) b
;
4492 static inline hashval_t
4493 struct_ptr_hash (const void *a
)
4495 const void * const * x
= (const void * const *) a
;
4496 return (intptr_t)*x
>> 4;
4499 /* In fold-const.c */
4501 /* Non-zero if we are folding constants inside an initializer; zero
4503 extern int folding_initializer
;
4505 /* Convert between trees and native memory representation. */
4506 extern int native_encode_expr (const_tree
, unsigned char *, int);
4507 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4509 /* Fold constants as much as possible in an expression.
4510 Returns the simplified expression.
4511 Acts only on the top level of the expression;
4512 if the argument itself cannot be simplified, its
4513 subexpressions are not changed. */
4515 extern tree
fold (tree
);
4516 #define fold_unary(CODE,T1,T2)\
4517 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4518 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
4519 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4520 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4521 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
4522 #define fold_binary(CODE,T1,T2,T3)\
4523 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4524 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4525 #define fold_ternary(CODE,T1,T2,T3,T4)\
4526 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4527 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4528 #define fold_build1(c,t1,t2)\
4529 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4530 #define fold_build1_loc(l,c,t1,t2)\
4531 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4532 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
4533 tree MEM_STAT_DECL
);
4534 #define fold_build2(c,t1,t2,t3)\
4535 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4536 #define fold_build2_loc(l,c,t1,t2,t3)\
4537 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4538 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
4539 tree MEM_STAT_DECL
);
4540 #define fold_build3(c,t1,t2,t3,t4)\
4541 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4542 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4543 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4544 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
4545 tree MEM_STAT_DECL
);
4546 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
4547 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4548 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4549 #define fold_build_call_array(T1,T2,N,T4)\
4550 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4551 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
4552 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4553 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4554 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
4555 extern bool fold_convertible_p (const_tree
, const_tree
);
4556 #define fold_convert(T1,T2)\
4557 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
4558 extern tree
fold_convert_loc (location_t
, tree
, tree
);
4559 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
4560 extern tree
fold_ignored_result (tree
);
4561 extern tree
fold_abs_const (tree
, tree
);
4562 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
4563 extern void fold_defer_overflow_warnings (void);
4564 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4565 extern void fold_undefer_and_ignore_overflow_warnings (void);
4566 extern bool fold_deferring_overflow_warnings_p (void);
4567 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
4568 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4569 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4570 #define omit_one_operand(T1,T2,T3)\
4571 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4572 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
4573 #define omit_two_operands(T1,T2,T3,T4)\
4574 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4575 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
4576 #define invert_truthvalue(T)\
4577 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
4578 extern tree
invert_truthvalue_loc (location_t
, tree
);
4579 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4580 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4581 extern tree
fold_read_from_constant_string (tree
);
4582 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
4583 #define build_fold_addr_expr(T)\
4584 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4585 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
4586 #define build_fold_addr_expr_with_type(T,TYPE)\
4587 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4588 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
4589 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4590 extern tree
fold_strip_sign_ops (tree
);
4591 #define build_fold_indirect_ref(T)\
4592 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4593 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
4594 #define fold_indirect_ref(T)\
4595 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4596 extern tree
fold_indirect_ref_loc (location_t
, tree
);
4597 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
4598 #define build_simple_mem_ref(T)\
4599 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4600 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
4601 extern tree
constant_boolean_node (bool, tree
);
4602 extern tree
div_if_zero_remainder (const_tree
, const_tree
);
4604 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4605 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4607 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4608 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4610 extern bool tree_expr_nonzero_p (tree
);
4611 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4612 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4614 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4615 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4616 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4618 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4619 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4620 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4622 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4624 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4625 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
4626 enum tree_code
, tree
, tree
, tree
);
4627 extern void debug_fold_checksum (const_tree
);
4629 /* Return nonzero if CODE is a tree code that represents a truth value. */
4631 truth_value_p (enum tree_code code
)
4633 return (TREE_CODE_CLASS (code
) == tcc_comparison
4634 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4635 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4636 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4639 /* Return whether TYPE is a type suitable for an offset for
4640 a POINTER_PLUS_EXPR. */
4642 ptrofftype_p (tree type
)
4644 return (INTEGRAL_TYPE_P (type
)
4645 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4646 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4649 /* Return OFF converted to a pointer offset type suitable as offset for
4650 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4652 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4654 return fold_convert_loc (loc
, sizetype
, off
);
4656 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4658 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4660 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4662 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4663 ptr
, fold_convert_loc (loc
, sizetype
, off
));
4665 #define fold_build_pointer_plus(p,o) \
4666 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4668 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4670 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4672 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4673 ptr
, size_int (off
));
4675 #define fold_build_pointer_plus_hwi(p,o) \
4676 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4680 /* Non-zero if __builtin_constant_p should be folded right away. */
4681 extern bool force_folding_builtin_constant_p
;
4683 extern bool avoid_folding_inline_builtin (tree
);
4684 extern tree
fold_call_expr (location_t
, tree
, bool);
4685 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
4686 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
4687 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
4688 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
4689 enum built_in_function
);
4690 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4691 enum built_in_function
);
4692 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4693 enum built_in_function
);
4694 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
4695 extern bool fold_builtin_next_arg (tree
, bool);
4696 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4697 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
4698 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4699 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4700 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4701 extern tree
build_call_expr (tree
, int, ...);
4702 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4703 extern tree
c_strlen (tree
, int);
4704 extern tree
build_string_literal (int, const char *);
4705 extern bool validate_arglist (const_tree
, ...);
4706 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4707 extern bool is_builtin_fn (tree
);
4708 extern bool get_object_alignment_1 (tree
, unsigned int *,
4709 unsigned HOST_WIDE_INT
*);
4710 extern unsigned int get_object_alignment (tree
);
4711 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
4712 unsigned HOST_WIDE_INT
*);
4713 extern unsigned int get_pointer_alignment (tree
);
4714 extern tree
fold_call_stmt (gimple
, bool);
4715 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4716 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
4717 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
4718 tree
*, tree
*, int *, bool *);
4719 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
4720 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
4722 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
4723 extern bool is_simple_builtin (tree
);
4724 extern bool is_inexpensive_builtin (tree
);
4727 extern tree
strip_float_extensions (tree
);
4730 extern int really_constant_p (const_tree
);
4731 extern bool decl_address_invariant_p (const_tree
);
4732 extern bool decl_address_ip_invariant_p (const_tree
);
4733 extern bool int_fits_type_p (const_tree
, const_tree
);
4734 #ifndef GENERATOR_FILE
4735 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4737 extern bool variably_modified_type_p (tree
, tree
);
4738 extern int tree_log2 (const_tree
);
4739 extern int tree_floor_log2 (const_tree
);
4740 extern unsigned int tree_ctz (const_tree
);
4741 extern int simple_cst_equal (const_tree
, const_tree
);
4742 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4743 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4744 const_tree
, hashval_t
);
4745 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4746 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4747 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4748 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4749 extern int type_list_equal (const_tree
, const_tree
);
4750 extern int chain_member (const_tree
, const_tree
);
4751 extern int simple_cst_list_equal (const_tree
, const_tree
);
4752 extern void dump_tree_statistics (void);
4753 extern void recompute_tree_invariant_for_addr_expr (tree
);
4754 extern bool needs_to_live_in_memory (const_tree
);
4755 extern tree
reconstruct_complex_type (tree
, tree
);
4757 extern int real_onep (const_tree
);
4758 extern int real_twop (const_tree
);
4759 extern int real_minus_onep (const_tree
);
4760 extern void init_ttree (void);
4761 extern void build_common_tree_nodes (bool, bool);
4762 extern void build_common_builtin_nodes (void);
4763 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4764 extern tree
build_range_type (tree
, tree
, tree
);
4765 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4766 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4767 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4768 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4770 extern tree
tree_block (tree
);
4771 extern void tree_set_block (tree
, tree
);
4772 extern location_t
*block_nonartificial_location (tree
);
4773 extern location_t
tree_nonartificial_location (tree
);
4775 extern tree
block_ultimate_origin (const_tree
);
4777 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4778 extern bool virtual_method_call_p (tree
);
4779 extern tree
obj_type_ref_class (tree ref
);
4780 extern bool types_same_for_odr (tree type1
, tree type2
);
4781 extern bool contains_bitfld_component_ref_p (const_tree
);
4782 extern bool type_in_anonymous_namespace_p (tree
);
4783 extern bool block_may_fallthru (const_tree
);
4784 extern void using_eh_for_cleanups (void);
4785 extern bool using_eh_for_cleanups_p (void);
4787 extern const char *get_tree_code_name (enum tree_code
);
4789 /* In tree-nested.c */
4790 extern tree
build_addr (tree
, tree
);
4793 extern void expand_main_function (void);
4794 extern void expand_function_end (void);
4795 extern void expand_function_start (tree
);
4796 extern void stack_protect_prologue (void);
4797 extern void stack_protect_epilogue (void);
4798 extern void init_dummy_function_start (void);
4799 extern void expand_dummy_function_end (void);
4800 extern void allocate_struct_function (tree
, bool);
4801 extern void push_struct_function (tree fndecl
);
4802 extern void init_function_start (tree
);
4803 extern bool use_register_for_decl (const_tree
);
4804 extern void generate_setjmp_warnings (void);
4805 extern void init_temp_slots (void);
4806 extern void free_temp_slots (void);
4807 extern void pop_temp_slots (void);
4808 extern void push_temp_slots (void);
4809 extern void preserve_temp_slots (rtx
);
4810 extern int aggregate_value_p (const_tree
, const_tree
);
4811 extern void push_function_context (void);
4812 extern void pop_function_context (void);
4813 extern gimple_seq
gimplify_parameters (void);
4815 /* In print-rtl.c */
4817 extern void print_rtl (FILE *, const_rtx
);
4820 /* In print-tree.c */
4821 extern void debug_tree (tree
);
4822 extern void debug_raw (const tree_node
&ref
);
4823 extern void debug_raw (const tree_node
*ptr
);
4824 extern void debug (const tree_node
&ref
);
4825 extern void debug (const tree_node
*ptr
);
4826 extern void debug_verbose (const tree_node
&ref
);
4827 extern void debug_verbose (const tree_node
*ptr
);
4828 extern void debug_head (const tree_node
&ref
);
4829 extern void debug_head (const tree_node
*ptr
);
4830 extern void debug_body (const tree_node
&ref
);
4831 extern void debug_body (const tree_node
*ptr
);
4832 extern void debug_vec_tree (vec
<tree
, va_gc
> *);
4833 extern void debug (vec
<tree
, va_gc
> &ref
);
4834 extern void debug (vec
<tree
, va_gc
> *ptr
);
4835 extern void debug_raw (vec
<tree
, va_gc
> &ref
);
4836 extern void debug_raw (vec
<tree
, va_gc
> *ptr
);
4838 extern void dump_addr (FILE*, const char *, const void *);
4839 extern void print_node (FILE *, const char *, tree
, int);
4840 extern void print_vec_tree (FILE *, const char *, vec
<tree
, va_gc
> *, int);
4841 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4842 extern void indent_to (FILE *, int);
4845 /* In tree-inline.c: */
4846 extern bool debug_find_tree (tree
, tree
);
4847 /* This is in tree-inline.c since the routine uses
4848 data structures from the inliner. */
4849 extern tree
build_duplicate_type (tree
);
4852 extern int flags_from_decl_or_type (const_tree
);
4853 extern int call_expr_flags (const_tree
);
4854 extern void set_call_expr_flags (tree
, int);
4856 extern int setjmp_call_p (const_tree
);
4857 extern bool gimple_alloca_call_p (const_gimple
);
4858 extern bool alloca_call_p (const_tree
);
4859 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4860 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4864 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
4865 extern const struct attribute_spec
*lookup_scoped_attribute_spec (const_tree
,
4868 extern void init_attributes (void);
4870 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4871 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4872 it should be modified in place; if a TYPE, a copy should be created
4873 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4874 information, in the form of a bitwise OR of flags in enum attribute_flags
4875 from tree.h. Depending on these flags, some attributes may be
4876 returned to be applied at a later stage (for example, to apply
4877 a decl attribute to the declaration rather than to its type). */
4878 extern tree
decl_attributes (tree
*, tree
, int);
4880 extern bool cxx11_attribute_p (const_tree
);
4882 extern tree
get_attribute_name (const_tree
);
4884 extern tree
get_attribute_namespace (const_tree
);
4886 extern void apply_tm_attr (tree
, tree
);
4888 /* In stor-layout.c */
4889 extern void set_min_and_max_values_for_integral_type (tree
, int, signop
);
4890 extern void fixup_signed_type (tree
);
4891 extern void internal_reference_types (void);
4892 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4895 extern tree
tree_output_constant_def (tree
);
4896 extern void make_decl_rtl (tree
);
4897 extern rtx
make_decl_rtl_for_debug (tree
);
4898 extern void make_decl_one_only (tree
, tree
);
4899 extern int supports_one_only (void);
4900 extern void resolve_unique_section (tree
, int, int);
4901 extern void mark_referenced (tree
);
4902 extern void mark_decl_referenced (tree
);
4903 extern void notice_global_symbol (tree
);
4904 extern void set_user_assembler_name (tree
, const char *);
4905 extern void process_pending_assemble_externals (void);
4906 extern bool decl_replaceable_p (tree
);
4907 extern bool decl_binds_to_current_def_p (tree
);
4908 extern enum tls_model
decl_default_tls_model (const_tree
);
4910 /* Declare DECL to be a weak symbol. */
4911 extern void declare_weak (tree
);
4912 /* Merge weak status. */
4913 extern void merge_weak (tree
, tree
);
4914 /* Make one symbol an alias for another. */
4915 extern void assemble_alias (tree
, tree
);
4917 /* Return nonzero if VALUE is a valid constant-valued expression
4918 for use in initializing a static variable; one that can be an
4919 element of a "constant" initializer.
4921 Return null_pointer_node if the value is absolute;
4922 if it is relocatable, return the variable that determines the relocation.
4923 We assume that VALUE has been folded as much as possible;
4924 therefore, we do not need to check for such things as
4925 arithmetic-combinations of integers. */
4926 extern tree
initializer_constant_valid_p (tree
, tree
);
4928 /* Return true if VALUE is a valid constant-valued expression
4929 for use in initializing a static bit-field; one that can be
4930 an element of a "constant" initializer. */
4931 extern bool initializer_constant_valid_for_bitfield_p (tree
);
4933 /* Whether a constructor CTOR is a valid static constant initializer if all
4934 its elements are. This used to be internal to initializer_constant_valid_p
4935 and has been exposed to let other functions like categorize_ctor_elements
4936 evaluate the property while walking a constructor for other purposes. */
4938 extern bool constructor_static_from_elts_p (const_tree
);
4941 extern void expand_computed_goto (tree
);
4942 extern bool parse_output_constraint (const char **, int, int, int,
4943 bool *, bool *, bool *);
4944 extern bool parse_input_constraint (const char **, int, int, int, int,
4945 const char * const *, bool *, bool *);
4946 extern void expand_asm_stmt (gimple
);
4947 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
4949 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4950 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
4954 /* In tree-inline.c */
4956 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
4958 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4960 #define walk_tree(a,b,c,d) \
4961 walk_tree_1 (a, b, c, d, NULL)
4962 #define walk_tree_without_duplicates(a,b,c) \
4963 walk_tree_without_duplicates_1 (a, b, c, NULL)
4966 /* Assign the RTX to declaration. */
4968 extern void set_decl_rtl (tree
, rtx
);
4969 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
4972 extern tree
get_base_address (tree t
);
4973 extern void mark_addressable (tree
);
4976 extern int tree_map_base_eq (const void *, const void *);
4977 extern unsigned int tree_map_base_hash (const void *);
4978 extern int tree_map_base_marked_p (const void *);
4979 extern bool list_equal_p (const_tree
, const_tree
);
4981 #define tree_map_eq tree_map_base_eq
4982 extern unsigned int tree_map_hash (const void *);
4983 #define tree_map_marked_p tree_map_base_marked_p
4985 #define tree_decl_map_eq tree_map_base_eq
4986 extern unsigned int tree_decl_map_hash (const void *);
4987 #define tree_decl_map_marked_p tree_map_base_marked_p
4989 #define tree_int_map_eq tree_map_base_eq
4990 #define tree_int_map_hash tree_map_base_hash
4991 #define tree_int_map_marked_p tree_map_base_marked_p
4993 #define tree_priority_map_eq tree_map_base_eq
4994 #define tree_priority_map_hash tree_map_base_hash
4995 #define tree_priority_map_marked_p tree_map_base_marked_p
4997 #define tree_vec_map_eq tree_map_base_eq
4998 #define tree_vec_map_hash tree_decl_map_hash
4999 #define tree_vec_map_marked_p tree_map_base_marked_p
5002 extern bool ssa_name_nonnegative_p (const_tree
);
5004 /* In tree-object-size.c. */
5005 extern void init_object_sizes (void);
5006 extern void fini_object_sizes (void);
5007 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5011 /* Determine whether the LEN bytes can be moved by using several move
5012 instructions. Return nonzero if a call to move_by_pieces should
5014 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
5016 /* Is it an ADDR_EXPR of a DECL that's not in memory? */
5017 extern bool addr_expr_of_non_mem_decl_p (tree
);
5019 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5020 extern tree
build_personality_function (const char *);
5022 /* In trans-mem.c. */
5023 extern tree
build_tm_abort_call (location_t
, bool);
5024 extern bool is_tm_safe (const_tree
);
5025 extern bool is_tm_pure (const_tree
);
5026 extern bool is_tm_may_cancel_outer (tree
);
5027 extern bool is_tm_ending_fndecl (tree
);
5028 extern void record_tm_replacement (tree
, tree
);
5029 extern void tm_malloc_replacement (tree
);
5032 is_tm_safe_or_pure (const_tree x
)
5034 return is_tm_safe (x
) || is_tm_pure (x
);
5037 /* In tree-inline.c. */
5039 void init_inline_once (void);
5041 /* Initialize the abstract argument list iterator object ITER with the
5042 arguments from CALL_EXPR node EXP. */
5044 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5047 iter
->n
= call_expr_nargs (exp
);
5052 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5055 iter
->n
= call_expr_nargs (exp
);
5059 /* Return the next argument from abstract argument list iterator object ITER,
5060 and advance its state. Return NULL_TREE if there are no more arguments. */
5062 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5065 if (iter
->i
>= iter
->n
)
5067 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5072 static inline const_tree
5073 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5076 if (iter
->i
>= iter
->n
)
5078 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5083 /* Initialize the abstract argument list iterator object ITER, then advance
5084 past and return the first argument. Useful in for expressions, e.g.
5085 for (arg = first_call_expr_arg (exp, &iter); arg;
5086 arg = next_call_expr_arg (&iter)) */
5088 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5090 init_call_expr_arg_iterator (exp
, iter
);
5091 return next_call_expr_arg (iter
);
5094 static inline const_tree
5095 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5097 init_const_call_expr_arg_iterator (exp
, iter
);
5098 return next_const_call_expr_arg (iter
);
5101 /* Test whether there are more arguments in abstract argument list iterator
5102 ITER, without changing its state. */
5104 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5106 return (iter
->i
< iter
->n
);
5110 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5112 return (iter
->i
< iter
->n
);
5115 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5116 (of type call_expr_arg_iterator) to hold the iteration state. */
5117 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5118 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5119 (arg) = next_call_expr_arg (&(iter)))
5121 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5122 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5123 (arg) = next_const_call_expr_arg (&(iter)))
5125 /* Return true if tree node T is a language-specific node. */
5127 is_lang_specific (tree t
)
5129 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5132 /* In vtable-verify.c. */
5133 extern void save_vtable_map_decl (tree
);
5135 /* Valid builtin number. */
5136 #define BUILTIN_VALID_P(FNCODE) \
5137 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5139 /* Return the tree node for an explicit standard builtin function or NULL. */
5141 builtin_decl_explicit (enum built_in_function fncode
)
5143 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5145 return builtin_info
.decl
[(size_t)fncode
];
5148 /* Return the tree node for an implicit builtin function or NULL. */
5150 builtin_decl_implicit (enum built_in_function fncode
)
5152 size_t uns_fncode
= (size_t)fncode
;
5153 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5155 if (!builtin_info
.implicit_p
[uns_fncode
])
5158 return builtin_info
.decl
[uns_fncode
];
5161 /* Set explicit builtin function nodes and whether it is an implicit
5165 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5167 size_t ufncode
= (size_t)fncode
;
5169 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5170 && (decl
!= NULL_TREE
|| !implicit_p
));
5172 builtin_info
.decl
[ufncode
] = decl
;
5173 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
5176 /* Set the implicit flag for a builtin function. */
5179 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5181 size_t uns_fncode
= (size_t)fncode
;
5183 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5184 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
5186 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
5189 /* Return whether the standard builtin function can be used as an explicit
5193 builtin_decl_explicit_p (enum built_in_function fncode
)
5195 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5196 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
5199 /* Return whether the standard builtin function can be used implicitly. */
5202 builtin_decl_implicit_p (enum built_in_function fncode
)
5204 size_t uns_fncode
= (size_t)fncode
;
5206 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5207 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
5208 && builtin_info
.implicit_p
[uns_fncode
]);
5211 /* Return true if T (assumed to be a DECL) is a global variable.
5212 A variable is considered global if its storage is not automatic. */
5215 is_global_var (const_tree t
)
5217 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5220 /* Return true if VAR may be aliased. A variable is considered as
5221 maybe aliased if it has its address taken by the local TU
5222 or possibly by another TU and might be modified through a pointer. */
5225 may_be_aliased (const_tree var
)
5227 return (TREE_CODE (var
) != CONST_DECL
5228 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5229 && TREE_READONLY (var
)
5230 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5231 && (TREE_PUBLIC (var
)
5232 || DECL_EXTERNAL (var
)
5233 || TREE_ADDRESSABLE (var
)));
5236 /* For anonymous aggregate types, we need some sort of name to
5237 hold on to. In practice, this should not appear, but it should
5238 not be harmful if it does. */
5239 #ifndef NO_DOT_IN_LABEL
5240 #define ANON_AGGRNAME_FORMAT "._%d"
5241 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
5242 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5243 #else /* NO_DOT_IN_LABEL */
5244 #ifndef NO_DOLLAR_IN_LABEL
5245 #define ANON_AGGRNAME_FORMAT "$_%d"
5246 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
5247 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5248 #else /* NO_DOLLAR_IN_LABEL */
5249 #define ANON_AGGRNAME_PREFIX "__anon_"
5250 #define ANON_AGGRNAME_P(ID_NODE) \
5251 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
5252 sizeof (ANON_AGGRNAME_PREFIX) - 1))
5253 #define ANON_AGGRNAME_FORMAT "__anon_%d"
5254 #endif /* NO_DOLLAR_IN_LABEL */
5255 #endif /* NO_DOT_IN_LABEL */
5257 /* The tree and const_tree overload templates. */
5261 struct int_traits
<const_tree
>
5263 static const enum precision_type precision_type
= VAR_PRECISION
;
5264 static const bool host_dependent_precision
= false;
5265 static const bool is_sign_extended
= false;
5266 static unsigned int get_precision (const_tree
);
5267 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
5272 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
5281 extended_tree (const_tree
);
5283 unsigned int get_precision () const;
5284 const HOST_WIDE_INT
*get_val () const;
5285 unsigned int get_len () const;
5290 struct int_traits
<extended_tree
<N
> >
5292 static const enum precision_type precision_type
= CONST_PRECISION
;
5293 static const bool host_dependent_precision
= false;
5294 static const bool is_sign_extended
= true;
5295 static const unsigned int precision
= N
;
5298 generic_wide_int
<extended_tree
<MAX_BITSIZE_MODE_ANY_INT
> >
5299 to_widest (const_tree
);
5301 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
5305 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
5307 return TYPE_PRECISION (TREE_TYPE (tcst
));
5310 /* Convert the tree_cst X into a wide_int of PRECISION. */
5311 inline wi::storage_ref
5312 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
5313 unsigned int precision
, const_tree x
)
5315 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
5319 inline generic_wide_int
<wi::extended_tree
<MAX_BITSIZE_MODE_ANY_INT
> >
5320 wi::to_widest (const_tree t
)
5325 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
5326 wi::to_offset (const_tree t
)
5332 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5335 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5340 wi::extended_tree
<N
>::get_precision () const
5346 inline const HOST_WIDE_INT
*
5347 wi::extended_tree
<N
>::get_val () const
5349 return &TREE_INT_CST_ELT (m_t
, 0);
5354 wi::extended_tree
<N
>::get_len () const
5356 if (N
== MAX_BITSIZE_MODE_ANY_INT
5357 || N
> TYPE_PRECISION (TREE_TYPE (m_t
)))
5358 return TREE_INT_CST_EXT_NUNITS (m_t
);
5360 return TREE_INT_CST_NUNITS (m_t
);
5365 template <typename T
>
5366 bool fits_to_tree_p (const T
&x
, const_tree
);
5368 wide_int
min_value (const_tree
);
5369 wide_int
max_value (const_tree
);
5370 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5373 template <typename T
>
5375 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5377 if (TYPE_SIGN (type
) == UNSIGNED
)
5378 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5380 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5383 /* Produce the smallest number that is represented in TYPE. The precision
5384 and sign are taken from TYPE. */
5386 wi::min_value (const_tree type
)
5388 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5391 /* Produce the largest number that is represented in TYPE. The precision
5392 and sign are taken from TYPE. */
5394 wi::max_value (const_tree type
)
5396 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5399 #endif /* GCC_TREE_H */