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 CODE represents an exceptional code. */
96 #define EXCEPTIONAL_CLASS_P(CODE)\
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
99 /* Nonzero if CODE represents a constant. */
101 #define CONSTANT_CLASS_P(CODE)\
102 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
104 /* Nonzero if CODE represents a type. */
106 #define TYPE_P(CODE)\
107 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
109 /* Nonzero if CODE represents a declaration. */
111 #define DECL_P(CODE)\
112 (TREE_CODE_CLASS (TREE_CODE (CODE)) == 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 CODE represents a INDIRECT_REF. Keep these checks in
124 ascending code order. */
126 #define INDIRECT_REF_P(CODE)\
127 (TREE_CODE (CODE) == INDIRECT_REF)
129 /* Nonzero if CODE represents a reference. */
131 #define REFERENCE_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
134 /* Nonzero if CODE represents a comparison. */
136 #define COMPARISON_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
139 /* Nonzero if CODE represents a unary arithmetic expression. */
141 #define UNARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
144 /* Nonzero if CODE represents a binary arithmetic expression. */
146 #define BINARY_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
149 /* Nonzero if CODE represents a statement expression. */
151 #define STATEMENT_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
154 /* Nonzero if CODE represents a function call-like expression with a
155 variable-length operand vector. */
157 #define VL_EXP_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
160 /* Nonzero if CODE represents any other expression. */
162 #define EXPRESSION_CLASS_P(CODE)\
163 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
165 /* Returns nonzero iff CODE represents a type or declaration. */
167 #define IS_TYPE_OR_DECL_P(CODE)\
168 (TYPE_P (CODE) || DECL_P (CODE))
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 the (possibly qualified) void type. */
556 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
558 /* Nonzero if this type is complete or is cv void. */
559 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
560 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
562 /* Nonzero if this type is complete or is an array with unspecified bound. */
563 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
564 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
567 /* Define many boolean fields that all tree nodes have. */
569 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
570 of this is needed. So it cannot be in a register.
571 In a FUNCTION_DECL it has no meaning.
572 In LABEL_DECL nodes, it means a goto for this label has been seen
573 from a place outside all binding contours that restore stack levels.
574 In an artificial SSA_NAME that points to a stack partition with at least
575 two variables, it means that at least one variable has TREE_ADDRESSABLE.
576 In ..._TYPE nodes, it means that objects of this type must be fully
577 addressable. This means that pieces of this object cannot go into
578 register parameters, for example. If this a function type, this
579 means that the value must be returned in memory.
580 In CONSTRUCTOR nodes, it means object constructed must be in memory.
581 In IDENTIFIER_NODEs, this means that some extern decl for this name
582 had its address taken. That matters for inline functions.
583 In a STMT_EXPR, it means we want the result of the enclosed expression. */
584 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
586 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
587 exit of a function. Calls for which this is true are candidates for tail
588 call optimizations. */
589 #define CALL_EXPR_TAILCALL(NODE) \
590 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
592 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
593 CASE_LOW operand has been processed. */
594 #define CASE_LOW_SEEN(NODE) \
595 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
597 #define PREDICT_EXPR_OUTCOME(NODE) \
598 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
599 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
600 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
601 #define PREDICT_EXPR_PREDICTOR(NODE) \
602 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
604 /* In a VAR_DECL, nonzero means allocate static storage.
605 In a FUNCTION_DECL, nonzero if function has been defined.
606 In a CONSTRUCTOR, nonzero means allocate static storage. */
607 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
609 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
610 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
612 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
613 should only be executed if an exception is thrown, not on normal exit
615 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
617 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
618 separate cleanup in honor_protect_cleanup_actions. */
619 #define TRY_CATCH_IS_CLEANUP(NODE) \
620 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
622 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
623 CASE_HIGH operand has been processed. */
624 #define CASE_HIGH_SEEN(NODE) \
625 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
627 /* Used to mark scoped enums. */
628 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
630 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
631 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
633 /* In an expr node (usually a conversion) this means the node was made
634 implicitly and should not lead to any sort of warning. In a decl node,
635 warnings concerning the decl should be suppressed. This is used at
636 least for used-before-set warnings, and it set after one warning is
638 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
640 /* Used to indicate that this TYPE represents a compiler-generated entity. */
641 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
643 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
644 this string as an argument. */
645 #define TREE_SYMBOL_REFERENCED(NODE) \
646 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
648 /* Nonzero in a pointer or reference type means the data pointed to
649 by this type can alias anything. */
650 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
651 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
653 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
654 there was an overflow in folding. */
656 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
658 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
660 #define TREE_OVERFLOW_P(EXPR) \
661 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
663 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
664 nonzero means name is to be accessible from outside this translation unit.
665 In an IDENTIFIER_NODE, nonzero means an external declaration
666 accessible from outside this translation unit was previously seen
667 for this name in an inner scope. */
668 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
670 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
671 of cached values, or is something else. */
672 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
674 /* In a SAVE_EXPR, indicates that the original expression has already
675 been substituted with a VAR_DECL that contains the value. */
676 #define SAVE_EXPR_RESOLVED_P(NODE) \
677 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
679 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
681 #define CALL_EXPR_VA_ARG_PACK(NODE) \
682 (CALL_EXPR_CHECK (NODE)->base.public_flag)
684 /* In any expression, decl, or constant, nonzero means it has side effects or
685 reevaluation of the whole expression could produce a different value.
686 This is set if any subexpression is a function call, a side effect or a
687 reference to a volatile variable. In a ..._DECL, this is set only if the
688 declaration said `volatile'. This will never be set for a constant. */
689 #define TREE_SIDE_EFFECTS(NODE) \
690 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
692 /* In a LABEL_DECL, nonzero means this label had its address taken
693 and therefore can never be deleted and is a jump target for
695 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
697 /* Nonzero means this expression is volatile in the C sense:
698 its address should be of type `volatile WHATEVER *'.
699 In other words, the declared item is volatile qualified.
700 This is used in _DECL nodes and _REF nodes.
701 On a FUNCTION_DECL node, this means the function does not
702 return normally. This is the same effect as setting
703 the attribute noreturn on the function in C.
705 In a ..._TYPE node, means this type is volatile-qualified.
706 But use TYPE_VOLATILE instead of this macro when the node is a type,
707 because eventually we may make that a different bit.
709 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
710 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
712 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
713 accessing the memory pointed to won't generate a trap. However,
714 this only applies to an object when used appropriately: it doesn't
715 mean that writing a READONLY mem won't trap.
717 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
718 (or slice of the array) always belongs to the range of the array.
719 I.e. that the access will not trap, provided that the access to
720 the base to the array will not trap. */
721 #define TREE_THIS_NOTRAP(NODE) \
722 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
723 ARRAY_RANGE_REF)->base.nothrow_flag)
725 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
726 nonzero means it may not be the lhs of an assignment.
727 Nonzero in a FUNCTION_DECL means this function should be treated
728 as "const" function (can only read its arguments). */
729 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
731 /* Value of expression is constant. Always on in all ..._CST nodes. May
732 also appear in an expression or decl where the value is constant. */
733 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
735 /* Nonzero if NODE, a type, has had its sizes gimplified. */
736 #define TYPE_SIZES_GIMPLIFIED(NODE) \
737 (TYPE_CHECK (NODE)->base.constant_flag)
739 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
740 #define DECL_UNSIGNED(NODE) \
741 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
743 /* In integral and pointer types, means an unsigned type. */
744 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
746 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
747 #define TYPE_SIGN(NODE) ((signop)TYPE_UNSIGNED(NODE))
749 /* True if overflow wraps around for the given integral type. That
750 is, TYPE_MAX + 1 == TYPE_MIN. */
751 #define TYPE_OVERFLOW_WRAPS(TYPE) \
752 (TYPE_UNSIGNED (TYPE) || flag_wrapv)
754 /* True if overflow is undefined for the given integral type. We may
755 optimize on the assumption that values in the type never overflow.
757 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
758 must issue a warning based on warn_strict_overflow. In some cases
759 it will be appropriate to issue the warning immediately, and in
760 other cases it will be appropriate to simply set a flag and let the
761 caller decide whether a warning is appropriate or not. */
762 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
763 (!TYPE_UNSIGNED (TYPE) && !flag_wrapv && !flag_trapv && flag_strict_overflow)
765 /* True if overflow for the given integral type should issue a
767 #define TYPE_OVERFLOW_TRAPS(TYPE) \
768 (!TYPE_UNSIGNED (TYPE) && flag_trapv)
770 /* True if pointer types have undefined overflow. */
771 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
773 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
774 Nonzero in a FUNCTION_DECL means that the function has been compiled.
775 This is interesting in an inline function, since it might not need
776 to be compiled separately.
777 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
778 or TYPE_DECL if the debugging info for the type has been written.
779 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
780 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
782 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
784 /* Nonzero in a _DECL if the name is used in its scope.
785 Nonzero in an expr node means inhibit warning if value is unused.
786 In IDENTIFIER_NODEs, this means that some extern decl for this name
788 In a BLOCK, this means that the block contains variables that are used. */
789 #define TREE_USED(NODE) ((NODE)->base.used_flag)
791 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
792 throw an exception. In a CALL_EXPR, nonzero means the call cannot
793 throw. We can't easily check the node type here as the C++
794 frontend also uses this flag (for AGGR_INIT_EXPR). */
795 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
797 /* In a CALL_EXPR, means that it's safe to use the target of the call
798 expansion as the return slot for a call that returns in memory. */
799 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
800 (CALL_EXPR_CHECK (NODE)->base.private_flag)
802 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
803 passed by invisible reference (and the TREE_TYPE is a pointer to the true
805 #define DECL_BY_REFERENCE(NODE) \
806 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
807 RESULT_DECL)->decl_common.decl_by_reference_flag)
809 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
811 #define DECL_READ_P(NODE) \
812 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
814 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
815 attempting to share the stack slot with some other variable. */
816 #define DECL_NONSHAREABLE(NODE) \
817 (TREE_CHECK2 (NODE, VAR_DECL, \
818 RESULT_DECL)->decl_common.decl_nonshareable_flag)
820 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
821 thunked-to function. */
822 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
824 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
825 it has been built for the declaration of a variable-sized object. */
826 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
827 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
829 /* In a type, nonzero means that all objects of the type are guaranteed by the
830 language or front-end to be properly aligned, so we can indicate that a MEM
831 of this type is aligned at least to the alignment of the type, even if it
832 doesn't appear that it is. We see this, for example, in object-oriented
833 languages where a tag field may show this is an object of a more-aligned
834 variant of the more generic type.
836 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
838 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
840 /* Used in classes in C++. */
841 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
842 /* Used in classes in C++. */
843 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
845 /* True if reference type NODE is a C++ rvalue reference. */
846 #define TYPE_REF_IS_RVALUE(NODE) \
847 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
849 /* Nonzero in a _DECL if the use of the name is defined as a
850 deprecated feature by __attribute__((deprecated)). */
851 #define TREE_DEPRECATED(NODE) \
852 ((NODE)->base.deprecated_flag)
854 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
855 uses are to be substituted for uses of the TREE_CHAINed identifier. */
856 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
857 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
859 /* In fixed-point types, means a saturating type. */
860 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
862 /* These flags are available for each language front end to use internally. */
863 #define TREE_LANG_FLAG_0(NODE) \
864 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
865 #define TREE_LANG_FLAG_1(NODE) \
866 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
867 #define TREE_LANG_FLAG_2(NODE) \
868 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
869 #define TREE_LANG_FLAG_3(NODE) \
870 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
871 #define TREE_LANG_FLAG_4(NODE) \
872 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
873 #define TREE_LANG_FLAG_5(NODE) \
874 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
875 #define TREE_LANG_FLAG_6(NODE) \
876 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
878 /* Define additional fields and accessors for nodes representing constants. */
880 #define TREE_INT_CST_NUNITS(NODE) \
881 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
882 #define TREE_INT_CST_EXT_NUNITS(NODE) \
883 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
884 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
886 #define INT_CST_LT(A, B) (wi::lts_p (wi::to_widest (A), wi::to_widest (B)))
887 #define INT_CST_LE(A, B) (wi::les_p (wi::to_widest (A), wi::to_widest (B)))
889 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
890 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
892 #define TREE_FIXED_CST_PTR(NODE) \
893 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
894 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
896 /* In a STRING_CST */
897 /* In C terms, this is sizeof, not strlen. */
898 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
899 #define TREE_STRING_POINTER(NODE) \
900 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
902 /* In a COMPLEX_CST node. */
903 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
904 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
906 /* In a VECTOR_CST node. */
907 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
908 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
909 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
911 /* Define fields and accessors for some special-purpose tree nodes. */
913 #define IDENTIFIER_LENGTH(NODE) \
914 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
915 #define IDENTIFIER_POINTER(NODE) \
916 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
917 #define IDENTIFIER_HASH_VALUE(NODE) \
918 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
920 /* Translate a hash table identifier pointer to a tree_identifier
921 pointer, and vice versa. */
923 #define HT_IDENT_TO_GCC_IDENT(NODE) \
924 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
925 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
927 /* In a TREE_LIST node. */
928 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
929 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
931 /* In a TREE_VEC node. */
932 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
933 #define TREE_VEC_END(NODE) \
934 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
936 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
938 /* In a CONSTRUCTOR node. */
939 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
940 #define CONSTRUCTOR_ELT(NODE,IDX) \
941 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
942 #define CONSTRUCTOR_NELTS(NODE) \
943 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
945 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
946 value of each element (stored within VAL). IX must be a scratch variable
947 of unsigned integer type. */
948 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
949 for (IX = 0; (IX >= vec_safe_length (V)) \
951 : ((VAL = (*(V))[IX].value), \
955 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
956 the value of each element (stored within VAL) and its index (stored
957 within INDEX). IX must be a scratch variable of unsigned integer type. */
958 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
959 for (IX = 0; (IX >= vec_safe_length (V)) \
961 : (((void) (VAL = (*V)[IX].value)), \
962 (INDEX = (*V)[IX].index), \
966 /* Append a new constructor element to V, with the specified INDEX and VAL. */
967 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
969 constructor_elt _ce___ = {INDEX, VALUE}; \
970 vec_safe_push ((V), _ce___); \
973 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
974 constructor output purposes. */
975 #define CONSTRUCTOR_BITFIELD_P(NODE) \
976 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
978 /* True if NODE is a clobber right hand side, an expression of indeterminate
979 value that clobbers the LHS in a copy instruction. We use a volatile
980 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
981 In particular the volatile flag causes us to not prematurely remove
982 such clobber instructions. */
983 #define TREE_CLOBBER_P(NODE) \
984 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
986 /* Define fields and accessors for some nodes that represent expressions. */
988 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
989 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
990 && VOID_TYPE_P (TREE_TYPE (NODE)) \
991 && integer_zerop (TREE_OPERAND (NODE, 0)))
993 /* In ordinary expression nodes. */
994 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
995 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
997 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
998 length. Its value includes the length operand itself; that is,
999 the minimum valid length is 1.
1000 Note that we have to bypass the use of TREE_OPERAND to access
1001 that field to avoid infinite recursion in expanding the macros. */
1002 #define VL_EXP_OPERAND_LENGTH(NODE) \
1003 ((int)tree_to_hwi (VL_EXP_CHECK (NODE)->exp.operands[0]))
1005 /* Nonzero if is_gimple_debug() may possibly hold. */
1006 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1008 /* In a LOOP_EXPR node. */
1009 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1011 /* The source location of this expression. Non-tree_exp nodes such as
1012 decls and constants can be shared among multiple locations, so
1014 #define EXPR_LOCATION(NODE) \
1015 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1016 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1017 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1018 != UNKNOWN_LOCATION)
1019 /* The location to be used in a diagnostic about this expression. Do not
1020 use this macro if the location will be assigned to other expressions. */
1021 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) \
1022 ? (NODE)->exp.locus : input_location)
1023 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1024 ? (NODE)->exp.locus : (LOCUS))
1025 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1026 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1028 /* True if a tree is an expression or statement that can have a
1030 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1032 extern void protected_set_expr_location (tree
, location_t
);
1034 /* In a TARGET_EXPR node. */
1035 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1036 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1037 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1039 /* DECL_EXPR accessor. This gives access to the DECL associated with
1040 the given declaration statement. */
1041 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1043 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1045 /* COMPOUND_LITERAL_EXPR accessors. */
1046 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1047 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1048 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1049 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1051 /* SWITCH_EXPR accessors. These give access to the condition, body and
1052 original condition type (before any compiler conversions)
1053 of the switch statement, respectively. */
1054 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1055 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1056 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1058 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1059 of a case label, respectively. */
1060 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1061 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1062 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1063 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1065 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1066 corresponding MEM_REF operands. */
1067 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1068 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1069 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1070 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1071 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1073 /* The operands of a BIND_EXPR. */
1074 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1075 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1076 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1078 /* GOTO_EXPR accessor. This gives access to the label associated with
1079 a goto statement. */
1080 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1082 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1083 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1084 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1086 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1087 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1088 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1089 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1090 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1091 /* Nonzero if we want to create an ASM_INPUT instead of an
1092 ASM_OPERAND with no operands. */
1093 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1094 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1096 /* COND_EXPR accessors. */
1097 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1098 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1099 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1101 /* Accessors for the chains of recurrences. */
1102 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1103 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1104 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1105 #define CHREC_VARIABLE(NODE) tree_to_hwi (CHREC_VAR (NODE))
1107 /* LABEL_EXPR accessor. This gives access to the label associated with
1108 the given label expression. */
1109 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1111 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1112 accessors for SSA operands. */
1114 /* CATCH_EXPR accessors. */
1115 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1116 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1118 /* EH_FILTER_EXPR accessors. */
1119 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1120 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1122 /* OBJ_TYPE_REF accessors. */
1123 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1124 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1125 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1127 /* ASSERT_EXPR accessors. */
1128 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1129 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1131 /* CALL_EXPR accessors.
1133 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1134 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1135 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1136 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1138 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1139 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1140 the argument count is zero when checking is enabled. Instead, do
1141 the pointer arithmetic to advance past the 3 fixed operands in a
1142 CALL_EXPR. That produces a valid pointer to just past the end of the
1143 operand array, even if it's not valid to dereference it. */
1144 #define CALL_EXPR_ARGP(NODE) \
1145 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1147 /* TM directives and accessors. */
1148 #define TRANSACTION_EXPR_BODY(NODE) \
1149 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1150 #define TRANSACTION_EXPR_OUTER(NODE) \
1151 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1152 #define TRANSACTION_EXPR_RELAXED(NODE) \
1153 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1155 /* OpenMP directive and clause accessors. */
1157 #define OMP_BODY(NODE) \
1158 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1159 #define OMP_CLAUSES(NODE) \
1160 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1162 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1163 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1165 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1166 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1168 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1169 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1170 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1172 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OMP_DISTRIBUTE)
1173 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1174 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1175 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1176 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1177 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1178 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1180 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1181 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1183 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1185 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1186 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1188 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1190 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1192 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1194 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1195 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1197 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1198 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1200 #define OMP_TARGET_DATA_BODY(NODE) \
1201 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1202 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1203 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1205 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1206 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1208 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1209 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1211 #define OMP_CLAUSE_SIZE(NODE) \
1212 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1216 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1217 #define OMP_CLAUSE_DECL(NODE) \
1218 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1219 OMP_CLAUSE_PRIVATE, \
1220 OMP_CLAUSE__LOOPTEMP_), 0)
1221 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1222 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1223 != UNKNOWN_LOCATION)
1224 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1226 /* True on an OMP_SECTION statement that was the last lexical member.
1227 This status is meaningful in the implementation of lastprivate. */
1228 #define OMP_SECTION_LAST(NODE) \
1229 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1231 /* True on an OMP_PARALLEL statement if it represents an explicit
1232 combined parallel work-sharing constructs. */
1233 #define OMP_PARALLEL_COMBINED(NODE) \
1234 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1236 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1237 as opposed to relaxed. */
1238 #define OMP_ATOMIC_SEQ_CST(NODE) \
1239 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1240 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1242 /* True on a PRIVATE clause if its decl is kept around for debugging
1243 information only and its DECL_VALUE_EXPR is supposed to point
1244 to what it has been remapped to. */
1245 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1246 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1248 /* True on a PRIVATE clause if ctor needs access to outer region's
1250 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1251 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1253 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1254 decl is present in the chain. */
1255 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1256 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1257 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1258 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1259 OMP_CLAUSE_LASTPRIVATE),\
1261 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1262 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1264 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1265 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1266 #define OMP_CLAUSE_IF_EXPR(NODE) \
1267 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1268 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1269 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1270 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1271 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1273 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1274 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1276 #define OMP_CLAUSE_MAP_KIND(NODE) \
1277 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1279 /* Nonzero if this map clause is for array (rather than pointer) based array
1280 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1281 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1282 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1283 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1285 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1286 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1288 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1289 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1290 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1291 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1292 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1293 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1295 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1296 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1297 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1298 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1299 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1300 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1301 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1302 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1303 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1304 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1305 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1306 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1308 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1309 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1310 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1311 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1313 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1314 are always initialized inside of the loop construct, false otherwise. */
1315 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1316 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1318 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1319 are declared inside of the simd construct. */
1320 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1321 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1323 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1324 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1326 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1327 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1329 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1330 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1332 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1333 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1334 OMP_CLAUSE_THREAD_LIMIT), 0)
1336 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1337 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1339 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1340 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1341 OMP_CLAUSE_DIST_SCHEDULE), 0)
1343 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1344 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1346 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1347 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1349 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1350 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1352 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1353 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1355 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1356 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1358 /* SSA_NAME accessors. */
1360 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1361 if there is no name associated with it. */
1362 #define SSA_NAME_IDENTIFIER(NODE) \
1363 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1364 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1365 ? (NODE)->ssa_name.var \
1366 : DECL_NAME ((NODE)->ssa_name.var)) \
1369 /* Returns the variable being referenced. This can be NULL_TREE for
1370 temporaries not associated with any user variable.
1371 Once released, this is the only field that can be relied upon. */
1372 #define SSA_NAME_VAR(NODE) \
1373 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1374 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1375 ? NULL_TREE : (NODE)->ssa_name.var)
1377 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1378 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1380 /* Returns the statement which defines this SSA name. */
1381 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1383 /* Returns the SSA version number of this SSA name. Note that in
1384 tree SSA, version numbers are not per variable and may be recycled. */
1385 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1387 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1388 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1390 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1391 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1393 /* Nonzero if this SSA_NAME expression is currently on the free list of
1394 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1395 has no meaning for an SSA_NAME. */
1396 #define SSA_NAME_IN_FREE_LIST(NODE) \
1397 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1399 /* Nonzero if this SSA_NAME is the default definition for the
1400 underlying symbol. A default SSA name is created for symbol S if
1401 the very first reference to S in the function is a read operation.
1402 Default definitions are always created by an empty statement and
1403 belong to no basic block. */
1404 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1405 SSA_NAME_CHECK (NODE)->base.default_def_flag
1407 /* Attributes for SSA_NAMEs for pointer-type variables. */
1408 #define SSA_NAME_PTR_INFO(N) \
1409 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1411 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1412 #define SSA_NAME_RANGE_INFO(N) \
1413 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1415 /* Return the immediate_use information for an SSA_NAME. */
1416 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1418 #define OMP_CLAUSE_CODE(NODE) \
1419 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1421 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1422 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1424 #define OMP_CLAUSE_OPERAND(NODE, I) \
1425 OMP_CLAUSE_ELT_CHECK (NODE, I)
1427 /* In a BLOCK node. */
1428 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1429 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1430 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1431 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1432 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1433 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1434 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1435 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1436 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1437 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1438 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1440 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1441 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1443 /* An index number for this block. These values are not guaranteed to
1444 be unique across functions -- whether or not they are depends on
1445 the debugging output format in use. */
1446 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1448 /* If block reordering splits a lexical block into discontiguous
1449 address ranges, we'll make a copy of the original block.
1451 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1452 In that case, we have one source block that has been replicated
1453 (through inlining or unrolling) into many logical blocks, and that
1454 these logical blocks have different physical variables in them.
1456 In this case, we have one logical block split into several
1457 non-contiguous address ranges. Most debug formats can't actually
1458 represent this idea directly, so we fake it by creating multiple
1459 logical blocks with the same variables in them. However, for those
1460 that do support non-contiguous regions, these allow the original
1461 logical block to be reconstructed, along with the set of address
1464 One of the logical block fragments is arbitrarily chosen to be
1465 the ORIGIN. The other fragments will point to the origin via
1466 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1467 be null. The list of fragments will be chained through
1468 BLOCK_FRAGMENT_CHAIN from the origin. */
1470 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1471 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1473 /* For an inlined function, this gives the location where it was called
1474 from. This is only set in the top level block, which corresponds to the
1475 inlined function scope. This is used in the debug output routines. */
1477 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1479 /* Define fields and accessors for nodes representing data types. */
1481 /* See tree.def for documentation of the use of these fields.
1482 Look at the documentation of the various ..._TYPE tree codes.
1484 Note that the type.values, type.minval, and type.maxval fields are
1485 overloaded and used for different macros in different kinds of types.
1486 Each macro must check to ensure the tree node is of the proper kind of
1487 type. Note also that some of the front-ends also overload these fields,
1488 so they must be checked as well. */
1490 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1491 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1492 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1493 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1494 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1495 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1496 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1497 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1498 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1499 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1501 /* Vector types need to check target flags to determine type. */
1502 extern enum machine_mode
vector_type_mode (const_tree
);
1503 #define TYPE_MODE(NODE) \
1504 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1505 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1506 #define SET_TYPE_MODE(NODE, MODE) \
1507 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1509 /* The "canonical" type for this type node, which is used by frontends to
1510 compare the type for equality with another type. If two types are
1511 equal (based on the semantics of the language), then they will have
1512 equivalent TYPE_CANONICAL entries.
1514 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1515 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1516 be used for comparison against other types. Instead, the type is
1517 said to require structural equality checks, described in
1518 TYPE_STRUCTURAL_EQUALITY_P.
1520 For unqualified aggregate and function types the middle-end relies on
1521 TYPE_CANONICAL to tell whether two variables can be assigned
1522 to each other without a conversion. The middle-end also makes sure
1523 to assign the same alias-sets to the type partition with equal
1524 TYPE_CANONICAL of their unqualified variants. */
1525 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1526 /* Indicates that the type node requires structural equality
1527 checks. The compiler will need to look at the composition of the
1528 type to determine whether it is equal to another type, rather than
1529 just comparing canonical type pointers. For instance, we would need
1530 to look at the return and parameter types of a FUNCTION_TYPE
1532 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1533 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1534 type node requires structural equality. */
1535 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1537 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1538 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1540 /* The (language-specific) typed-based alias set for this type.
1541 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1542 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1543 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1544 type can alias objects of any type. */
1545 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1547 /* Nonzero iff the typed-based alias set for this type has been
1549 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1550 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1552 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1554 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1556 /* The alignment necessary for objects of this type.
1557 The value is an int, measured in bits. */
1558 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1560 /* 1 if the alignment for this type was requested by "aligned" attribute,
1561 0 if it is the default for this type. */
1562 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1564 /* The alignment for NODE, in bytes. */
1565 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1567 /* If your language allows you to declare types, and you want debug info
1568 for them, then you need to generate corresponding TYPE_DECL nodes.
1569 These "stub" TYPE_DECL nodes have no name, and simply point at the
1570 type node. You then set the TYPE_STUB_DECL field of the type node
1571 to point back at the TYPE_DECL node. This allows the debug routines
1572 to know that the two nodes represent the same type, so that we only
1573 get one debug info record for them. */
1574 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1576 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1577 the type has BLKmode only because it lacks the alignment required for
1579 #define TYPE_NO_FORCE_BLK(NODE) \
1580 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1582 /* Nonzero in a type considered volatile as a whole. */
1583 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1585 /* Means this type is const-qualified. */
1586 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1588 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1590 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1592 /* If nonzero, type's name shouldn't be emitted into debug info. */
1593 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1595 /* The address space the type is in. */
1596 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1598 /* Encode/decode the named memory support as part of the qualifier. If more
1599 than 8 qualifiers are added, these macros need to be adjusted. */
1600 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1601 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1603 /* Return all qualifiers except for the address space qualifiers. */
1604 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1606 /* Only keep the address space out of the qualifiers and discard the other
1608 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1610 /* The set of type qualifiers for this type. */
1611 #define TYPE_QUALS(NODE) \
1612 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1613 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1614 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1615 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1617 /* The same as TYPE_QUALS without the address space qualifications. */
1618 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1619 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1620 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1621 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1623 /* These flags are available for each language front end to use internally. */
1624 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1625 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1626 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1627 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1628 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1629 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1630 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1632 /* Used to keep track of visited nodes in tree traversals. This is set to
1633 0 by copy_node and make_node. */
1634 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1636 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1637 that distinguish string from array of char).
1638 If set in a INTEGER_TYPE, indicates a character type. */
1639 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1641 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1642 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1643 (((unsigned HOST_WIDE_INT) 1) \
1644 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1646 /* Set precision to n when we have 2^n sub-parts of the vector. */
1647 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1648 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1650 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1651 about missing conversions to other vector types of the same size. */
1652 #define TYPE_VECTOR_OPAQUE(NODE) \
1653 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1655 /* Indicates that objects of this type must be initialized by calling a
1656 function when they are created. */
1657 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1658 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1660 /* Indicates that a UNION_TYPE object should be passed the same way that
1661 the first union alternative would be passed, or that a RECORD_TYPE
1662 object should be passed the same way that the first (and only) member
1664 #define TYPE_TRANSPARENT_AGGR(NODE) \
1665 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1667 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1668 address of a component of the type. This is the counterpart of
1669 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1670 #define TYPE_NONALIASED_COMPONENT(NODE) \
1671 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1673 /* Indicated that objects of this type should be laid out in as
1674 compact a way as possible. */
1675 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1677 /* Used by type_contains_placeholder_p to avoid recomputation.
1678 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1679 this field directly. */
1680 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1681 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1683 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1684 #define TYPE_FINAL_P(NODE) \
1685 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1687 /* The debug output functions use the symtab union field to store
1688 information specific to the debugging format. The different debug
1689 output hooks store different types in the union field. These three
1690 macros are used to access different fields in the union. The debug
1691 hooks are responsible for consistently using only a specific
1694 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1695 hold the type's number in the generated stabs. */
1696 #define TYPE_SYMTAB_ADDRESS(NODE) \
1697 (TYPE_CHECK (NODE)->type_common.symtab.address)
1699 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1700 hold struct/union type tag names. */
1701 #define TYPE_SYMTAB_POINTER(NODE) \
1702 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1704 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1705 in dwarf2out.c to point to the DIE generated for the type. */
1706 #define TYPE_SYMTAB_DIE(NODE) \
1707 (TYPE_CHECK (NODE)->type_common.symtab.die)
1709 /* The garbage collector needs to know the interpretation of the
1710 symtab field. These constants represent the different types in the
1713 #define TYPE_SYMTAB_IS_ADDRESS (0)
1714 #define TYPE_SYMTAB_IS_POINTER (1)
1715 #define TYPE_SYMTAB_IS_DIE (2)
1717 #define TYPE_LANG_SPECIFIC(NODE) \
1718 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1720 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1721 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1722 #define TYPE_FIELDS(NODE) \
1723 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1724 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1725 #define TYPE_ARG_TYPES(NODE) \
1726 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1727 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1729 #define TYPE_METHODS(NODE) \
1730 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1731 #define TYPE_VFIELD(NODE) \
1732 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1733 #define TYPE_METHOD_BASETYPE(NODE) \
1734 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1735 #define TYPE_OFFSET_BASETYPE(NODE) \
1736 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1737 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1738 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1739 #define TYPE_NEXT_PTR_TO(NODE) \
1740 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1741 #define TYPE_NEXT_REF_TO(NODE) \
1742 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1743 #define TYPE_MIN_VALUE(NODE) \
1744 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1745 #define TYPE_MAX_VALUE(NODE) \
1746 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1748 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1749 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1751 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1752 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1754 /* For record and union types, information about this type, as a base type
1756 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1758 /* For non record and union types, used in a language-dependent way. */
1759 #define TYPE_LANG_SLOT_1(NODE) \
1760 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1762 /* Define accessor macros for information about type inheritance
1765 A "basetype" means a particular usage of a data type for inheritance
1766 in another type. Each such basetype usage has its own "binfo"
1767 object to describe it. The binfo object is a TREE_VEC node.
1769 Inheritance is represented by the binfo nodes allocated for a
1770 given type. For example, given types C and D, such that D is
1771 inherited by C, 3 binfo nodes will be allocated: one for describing
1772 the binfo properties of C, similarly one for D, and one for
1773 describing the binfo properties of D as a base type for C.
1774 Thus, given a pointer to class C, one can get a pointer to the binfo
1775 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1777 /* BINFO specific flags. */
1779 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1780 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1782 /* Flags for language dependent use. */
1783 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1784 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1785 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1786 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1787 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1788 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1789 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1791 /* The actual data type node being inherited in this basetype. */
1792 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1794 /* The offset where this basetype appears in its containing type.
1795 BINFO_OFFSET slot holds the offset (in bytes)
1796 from the base of the complete object to the base of the part of the
1797 object that is allocated on behalf of this `type'.
1798 This is always 0 except when there is multiple inheritance. */
1800 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1801 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1803 /* The virtual function table belonging to this basetype. Virtual
1804 function tables provide a mechanism for run-time method dispatching.
1805 The entries of a virtual function table are language-dependent. */
1807 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1809 /* The virtual functions in the virtual function table. This is
1810 a TREE_LIST that is used as an initial approximation for building
1811 a virtual function table for this basetype. */
1812 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1814 /* A vector of binfos for the direct basetypes inherited by this
1817 If this basetype describes type D as inherited in C, and if the
1818 basetypes of D are E and F, then this vector contains binfos for
1819 inheritance of E and F by C. */
1820 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1822 /* The number of basetypes for NODE. */
1823 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1825 /* Accessor macro to get to the Nth base binfo of this binfo. */
1826 #define BINFO_BASE_BINFO(NODE,N) \
1827 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1828 #define BINFO_BASE_ITERATE(NODE,N,B) \
1829 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1830 #define BINFO_BASE_APPEND(NODE,T) \
1831 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1833 /* For a BINFO record describing a virtual base class, i.e., one where
1834 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1835 base. The actual contents are language-dependent. In the C++
1836 front-end this field is an INTEGER_CST giving an offset into the
1837 vtable where the offset to the virtual base can be found. */
1838 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
1840 /* Indicates the accesses this binfo has to its bases. The values are
1841 access_public_node, access_protected_node or access_private_node.
1842 If this array is not present, public access is implied. */
1843 #define BINFO_BASE_ACCESSES(NODE) \
1844 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
1846 #define BINFO_BASE_ACCESS(NODE,N) \
1847 (*BINFO_BASE_ACCESSES (NODE))[(N)]
1848 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
1849 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
1851 /* The index in the VTT where this subobject's sub-VTT can be found.
1852 NULL_TREE if there is no sub-VTT. */
1853 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
1855 /* The index in the VTT where the vptr for this subobject can be
1856 found. NULL_TREE if there is no secondary vptr in the VTT. */
1857 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
1859 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
1860 inheriting this base for non-virtual bases. For virtual bases it
1861 points either to the binfo for which this is a primary binfo, or to
1862 the binfo of the most derived type. */
1863 #define BINFO_INHERITANCE_CHAIN(NODE) \
1864 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
1867 /* Define fields and accessors for nodes representing declared names. */
1869 /* Nonzero if DECL represents an SSA name or a variable that can possibly
1870 have an associated SSA name. */
1871 #define SSA_VAR_P(DECL) \
1872 (TREE_CODE (DECL) == VAR_DECL \
1873 || TREE_CODE (DECL) == PARM_DECL \
1874 || TREE_CODE (DECL) == RESULT_DECL \
1875 || TREE_CODE (DECL) == SSA_NAME)
1878 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
1880 /* This is the name of the object as written by the user.
1881 It is an IDENTIFIER_NODE. */
1882 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
1884 /* Every ..._DECL node gets a unique number. */
1885 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
1887 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
1889 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
1891 /* Every ..._DECL node gets a unique number that stays the same even
1892 when the decl is copied by the inliner once it is set. */
1893 #define DECL_PT_UID(NODE) \
1894 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
1895 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
1896 /* Initialize the ..._DECL node pt-uid to the decls uid. */
1897 #define SET_DECL_PT_UID(NODE, UID) \
1898 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
1899 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
1900 be preserved when copyin the decl. */
1901 #define DECL_PT_UID_SET_P(NODE) \
1902 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
1904 /* These two fields describe where in the source code the declaration
1905 was. If the declaration appears in several places (as for a C
1906 function that is declared first and then defined later), this
1907 information should refer to the definition. */
1908 #define DECL_SOURCE_LOCATION(NODE) \
1909 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
1910 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
1911 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
1912 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
1913 /* This accessor returns TRUE if the decl it operates on was created
1914 by a front-end or back-end rather than by user code. In this case
1915 builtin-ness is indicated by source location. */
1916 #define DECL_IS_BUILTIN(DECL) \
1917 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
1919 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
1920 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
1921 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
1922 nodes, this points to either the FUNCTION_DECL for the containing
1923 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
1924 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
1925 scope". In particular, for VAR_DECLs which are virtual table pointers
1926 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
1928 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
1929 #define DECL_FIELD_CONTEXT(NODE) \
1930 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
1932 /* If nonzero, decl's name shouldn't be emitted into debug info. */
1933 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
1935 /* For any sort of a ..._DECL node, this points to the original (abstract)
1936 decl node which this decl is an inlined/cloned instance of, or else it
1937 is NULL indicating that this decl is not an instance of some other decl.
1939 The C front-end also uses this in a nested declaration of an inline
1940 function, to point back to the definition. */
1941 #define DECL_ABSTRACT_ORIGIN(NODE) \
1942 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
1944 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
1945 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
1946 #define DECL_ORIGIN(NODE) \
1947 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
1949 /* Nonzero for any sort of ..._DECL node means this decl node represents an
1950 inline instance of some original (abstract) decl from an inline function;
1951 suppress any warnings about shadowing some other variable. FUNCTION_DECL
1952 nodes can also have their abstract origin set to themselves. */
1953 #define DECL_FROM_INLINE(NODE) \
1954 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
1955 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
1957 /* In a DECL this is the field where attributes are stored. */
1958 #define DECL_ATTRIBUTES(NODE) \
1959 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
1961 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
1962 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
1963 For a VAR_DECL, holds the initial value.
1964 For a PARM_DECL, used for DECL_ARG_TYPE--default
1965 values for parameters are encoded in the type of the function,
1966 not in the PARM_DECL slot.
1967 For a FIELD_DECL, this is used for enumeration values and the C
1968 frontend uses it for temporarily storing bitwidth of bitfields.
1970 ??? Need to figure out some way to check this isn't a PARM_DECL. */
1971 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
1973 /* Holds the size of the datum, in bits, as a tree expression.
1974 Need not be constant. */
1975 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
1976 /* Likewise for the size in bytes. */
1977 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
1978 /* Holds the alignment required for the datum, in bits. */
1979 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
1980 /* The alignment of NODE, in bytes. */
1981 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
1982 /* Set if the alignment of this DECL has been set by the user, for
1983 example with an 'aligned' attribute. */
1984 #define DECL_USER_ALIGN(NODE) \
1985 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
1986 /* Holds the machine mode corresponding to the declaration of a variable or
1987 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
1989 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
1991 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
1992 operation it is. Note, however, that this field is overloaded, with
1993 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
1994 checked before any access to the former. */
1995 #define DECL_FUNCTION_CODE(NODE) \
1996 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
1998 #define DECL_FUNCTION_PERSONALITY(NODE) \
1999 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2001 /* Nonzero for a given ..._DECL node means that the name of this node should
2002 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2003 the associated type should be ignored. For a FUNCTION_DECL, the body of
2004 the function should also be ignored. */
2005 #define DECL_IGNORED_P(NODE) \
2006 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2008 /* Nonzero for a given ..._DECL node means that this node represents an
2009 "abstract instance" of the given declaration (e.g. in the original
2010 declaration of an inline function). When generating symbolic debugging
2011 information, we mustn't try to generate any address information for nodes
2012 marked as "abstract instances" because we don't actually generate
2013 any code or allocate any data space for such instances. */
2014 #define DECL_ABSTRACT(NODE) \
2015 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2017 /* Language-specific decl information. */
2018 #define DECL_LANG_SPECIFIC(NODE) \
2019 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2021 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2022 do not allocate storage, and refer to a definition elsewhere. Note that
2023 this does not necessarily imply the entity represented by NODE
2024 has no program source-level definition in this translation unit. For
2025 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2026 DECL_EXTERNAL may be true simultaneously; that can be the case for
2027 a C99 "extern inline" function. */
2028 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2030 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2031 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2033 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2035 Also set in some languages for variables, etc., outside the normal
2036 lexical scope, such as class instance variables. */
2037 #define DECL_NONLOCAL(NODE) \
2038 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2040 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2041 Used in FIELD_DECLs for vtable pointers.
2042 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2043 #define DECL_VIRTUAL_P(NODE) \
2044 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2046 /* Used to indicate that this DECL represents a compiler-generated entity. */
2047 #define DECL_ARTIFICIAL(NODE) \
2048 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2050 /* Additional flags for language-specific uses. */
2051 #define DECL_LANG_FLAG_0(NODE) \
2052 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2053 #define DECL_LANG_FLAG_1(NODE) \
2054 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2055 #define DECL_LANG_FLAG_2(NODE) \
2056 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2057 #define DECL_LANG_FLAG_3(NODE) \
2058 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2059 #define DECL_LANG_FLAG_4(NODE) \
2060 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2061 #define DECL_LANG_FLAG_5(NODE) \
2062 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2063 #define DECL_LANG_FLAG_6(NODE) \
2064 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2065 #define DECL_LANG_FLAG_7(NODE) \
2066 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2067 #define DECL_LANG_FLAG_8(NODE) \
2068 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2070 /* Nonzero for a scope which is equal to file scope. */
2071 #define SCOPE_FILE_SCOPE_P(EXP) \
2072 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2073 /* Nonzero for a decl which is at file scope. */
2074 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2075 /* Nonzero for a type which is at file scope. */
2076 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2078 /* Nonzero for a decl that is decorated using attribute used.
2079 This indicates to compiler tools that this decl needs to be preserved. */
2080 #define DECL_PRESERVE_P(DECL) \
2081 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2083 /* For function local variables of COMPLEX and VECTOR types,
2084 indicates that the variable is not aliased, and that all
2085 modifications to the variable have been adjusted so that
2086 they are killing assignments. Thus the variable may now
2087 be treated as a GIMPLE register, and use real instead of
2088 virtual ops in SSA form. */
2089 #define DECL_GIMPLE_REG_P(DECL) \
2090 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2092 extern tree
decl_value_expr_lookup (tree
);
2093 extern void decl_value_expr_insert (tree
, tree
);
2095 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2096 if transformations have made this more complicated than evaluating the
2097 decl itself. This should only be used for debugging; once this field has
2098 been set, the decl itself may not legitimately appear in the function. */
2099 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2100 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2101 ->decl_common.decl_flag_2)
2102 #define DECL_VALUE_EXPR(NODE) \
2103 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2104 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2105 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2107 /* Holds the RTL expression for the value of a variable or function.
2108 This value can be evaluated lazily for functions, variables with
2109 static storage duration, and labels. */
2110 #define DECL_RTL(NODE) \
2111 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2112 ? (NODE)->decl_with_rtl.rtl \
2113 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2115 /* Set the DECL_RTL for NODE to RTL. */
2116 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2118 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2119 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2121 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2122 #define DECL_RTL_SET_P(NODE) \
2123 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2125 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2126 NODE1, it will not be set for NODE2; this is a lazy copy. */
2127 #define COPY_DECL_RTL(NODE1, NODE2) \
2128 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2129 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2131 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2132 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2134 #if (GCC_VERSION >= 2007)
2135 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2136 ({ tree const __d = (decl); \
2137 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2138 /* Dereference it so the compiler knows it can't be NULL even \
2139 without assertion checking. */ \
2140 &*DECL_RTL_IF_SET (__d); })
2142 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2145 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2146 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2148 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2149 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2150 of the structure. */
2151 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2153 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2154 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2155 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2156 natural alignment of the field's type). */
2157 #define DECL_FIELD_BIT_OFFSET(NODE) \
2158 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2160 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2161 if so, the type that was originally specified for it.
2162 TREE_TYPE may have been modified (in finish_struct). */
2163 #define DECL_BIT_FIELD_TYPE(NODE) \
2164 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2166 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2167 representative FIELD_DECL. */
2168 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2169 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2171 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2172 if nonzero, indicates that the field occupies the type. */
2173 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2175 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2176 DECL_FIELD_OFFSET which are known to be always zero.
2177 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2179 #define DECL_OFFSET_ALIGN(NODE) \
2180 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2182 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2183 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2184 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2186 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2187 which this FIELD_DECL is defined. This information is needed when
2188 writing debugging information about vfield and vbase decls for C++. */
2189 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2191 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2192 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2194 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2196 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2198 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2199 this component. This makes it possible for Type-Based Alias Analysis
2200 to disambiguate accesses to this field with indirect accesses using
2203 struct S { int i; } s;
2206 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2208 From the implementation's viewpoint, the alias set of the type of the
2209 field 'i' (int) will not be recorded as a subset of that of the type of
2210 's' (struct S) in record_component_aliases. The counterpart is that
2211 accesses to s.i must not be given the alias set of the type of 'i'
2212 (int) but instead directly that of the type of 's' (struct S). */
2213 #define DECL_NONADDRESSABLE_P(NODE) \
2214 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2216 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2217 dense, unique within any one function, and may be used to index arrays.
2218 If the value is -1, then no UID has been assigned. */
2219 #define LABEL_DECL_UID(NODE) \
2220 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2222 /* In a LABEL_DECL, the EH region number for which the label is the
2223 post_landing_pad. */
2224 #define EH_LANDING_PAD_NR(NODE) \
2225 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2227 /* For a PARM_DECL, records the data type used to pass the argument,
2228 which may be different from the type seen in the program. */
2229 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2231 /* For PARM_DECL, holds an RTL for the stack slot or register
2232 where the data was actually passed. */
2233 #define DECL_INCOMING_RTL(NODE) \
2234 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2236 /* Nonzero for a given ..._DECL node means that no warnings should be
2237 generated just because this node is unused. */
2238 #define DECL_IN_SYSTEM_HEADER(NODE) \
2239 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2241 /* Used to indicate that the linkage status of this DECL is not yet known,
2242 so it should not be output now. */
2243 #define DECL_DEFER_OUTPUT(NODE) \
2244 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2246 /* In a VAR_DECL that's static,
2247 nonzero if the space is in the text section. */
2248 #define DECL_IN_TEXT_SECTION(NODE) \
2249 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2251 /* In a VAR_DECL that's static,
2252 nonzero if it belongs to the global constant pool. */
2253 #define DECL_IN_CONSTANT_POOL(NODE) \
2254 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2256 /* Nonzero for a given ..._DECL node means that this node should be
2257 put in .common, if possible. If a DECL_INITIAL is given, and it
2258 is not error_mark_node, then the decl cannot be put in .common. */
2259 #define DECL_COMMON(NODE) \
2260 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2262 /* In a VAR_DECL, nonzero if the decl is a register variable with
2263 an explicit asm specification. */
2264 #define DECL_HARD_REGISTER(NODE) \
2265 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2267 /* Used to indicate that this DECL has weak linkage. */
2268 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2270 /* Used to indicate that the DECL is a dllimport. */
2271 #define DECL_DLLIMPORT_P(NODE) \
2272 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2274 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2275 not be put out unless it is needed in this translation unit.
2276 Entities like this are shared across translation units (like weak
2277 entities), but are guaranteed to be generated by any translation
2278 unit that needs them, and therefore need not be put out anywhere
2279 where they are not needed. DECL_COMDAT is just a hint to the
2280 back-end; it is up to front-ends which set this flag to ensure
2281 that there will never be any harm, other than bloat, in putting out
2282 something which is DECL_COMDAT. */
2283 #define DECL_COMDAT(NODE) \
2284 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2286 #define DECL_COMDAT_GROUP(NODE) \
2287 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2289 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2290 multiple translation units should be merged. */
2291 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2293 /* The name of the object as the assembler will see it (but before any
2294 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2295 as DECL_NAME. It is an IDENTIFIER_NODE. */
2296 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2298 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2299 This is true of all DECL nodes except FIELD_DECL. */
2300 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2301 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2303 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2304 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2306 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2307 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2308 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2310 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2311 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2312 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2314 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2315 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2316 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2317 semantics of using this macro, are different than saying:
2319 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2321 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2323 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2324 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2325 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2326 DECL_ASSEMBLER_NAME (DECL1)) \
2329 /* Records the section name in a section attribute. Used to pass
2330 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2331 #define DECL_SECTION_NAME(NODE) \
2332 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2334 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2335 this variable in a BIND_EXPR. */
2336 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2337 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2339 /* Value of the decls's visibility attribute */
2340 #define DECL_VISIBILITY(NODE) \
2341 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2343 /* Nonzero means that the decl had its visibility specified rather than
2345 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2346 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2348 /* In a VAR_DECL, the model to use if the data should be allocated from
2349 thread-local storage. */
2350 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2352 /* In a VAR_DECL, nonzero if the data should be allocated from
2353 thread-local storage. */
2354 #define DECL_THREAD_LOCAL_P(NODE) \
2355 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
2357 /* In a non-local VAR_DECL with static storage duration, true if the
2358 variable has an initialization priority. If false, the variable
2359 will be initialized at the DEFAULT_INIT_PRIORITY. */
2360 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2361 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2363 /* Specify whether the section name was set by user or by
2364 compiler via -ffunction-sections. */
2365 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
2366 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
2368 extern tree
decl_debug_expr_lookup (tree
);
2369 extern void decl_debug_expr_insert (tree
, tree
);
2371 /* For VAR_DECL, this is set to an expression that it was split from. */
2372 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2373 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2374 #define DECL_DEBUG_EXPR(NODE) \
2375 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2377 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2378 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2380 extern priority_type
decl_init_priority_lookup (tree
);
2381 extern priority_type
decl_fini_priority_lookup (tree
);
2382 extern void decl_init_priority_insert (tree
, priority_type
);
2383 extern void decl_fini_priority_insert (tree
, priority_type
);
2385 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2387 #define DECL_INIT_PRIORITY(NODE) \
2388 (decl_init_priority_lookup (NODE))
2389 /* Set the initialization priority for NODE to VAL. */
2390 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2391 (decl_init_priority_insert (NODE, VAL))
2393 /* For a FUNCTION_DECL the finalization priority of NODE. */
2394 #define DECL_FINI_PRIORITY(NODE) \
2395 (decl_fini_priority_lookup (NODE))
2396 /* Set the finalization priority for NODE to VAL. */
2397 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2398 (decl_fini_priority_insert (NODE, VAL))
2400 /* The initialization priority for entities for which no explicit
2401 initialization priority has been specified. */
2402 #define DEFAULT_INIT_PRIORITY 65535
2404 /* The maximum allowed initialization priority. */
2405 #define MAX_INIT_PRIORITY 65535
2407 /* The largest priority value reserved for use by system runtime
2409 #define MAX_RESERVED_INIT_PRIORITY 100
2411 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2412 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2413 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2415 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2416 #define DECL_NONLOCAL_FRAME(NODE) \
2417 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2419 /* This field is used to reference anything in decl.result and is meant only
2420 for use by the garbage collector. */
2421 #define DECL_RESULT_FLD(NODE) \
2422 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2424 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2425 Before the struct containing the FUNCTION_DECL is laid out,
2426 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2427 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2428 function. When the class is laid out, this pointer is changed
2429 to an INTEGER_CST node which is suitable for use as an index
2430 into the virtual function table.
2431 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2432 #define DECL_VINDEX(NODE) \
2433 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2435 /* In FUNCTION_DECL, holds the decl for the return value. */
2436 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2438 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2439 #define DECL_UNINLINABLE(NODE) \
2440 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2442 /* In a FUNCTION_DECL, the saved representation of the body of the
2444 #define DECL_SAVED_TREE(NODE) \
2445 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2447 /* Nonzero in a FUNCTION_DECL means this function should be treated
2448 as if it were a malloc, meaning it returns a pointer that is
2450 #define DECL_IS_MALLOC(NODE) \
2451 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2453 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2454 C++ operator new, meaning that it returns a pointer for which we
2455 should not use type based aliasing. */
2456 #define DECL_IS_OPERATOR_NEW(NODE) \
2457 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2459 /* Nonzero in a FUNCTION_DECL means this function may return more
2461 #define DECL_IS_RETURNS_TWICE(NODE) \
2462 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2464 /* Nonzero in a FUNCTION_DECL means this function should be treated
2465 as "pure" function (like const function, but may read global memory). */
2466 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2468 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2469 the const or pure function may not terminate. When this is nonzero
2470 for a const or pure function, it can be dealt with by cse passes
2471 but cannot be removed by dce passes since you are not allowed to
2472 change an infinite looping program into one that terminates without
2474 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2475 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2477 /* Nonzero in a FUNCTION_DECL means this function should be treated
2478 as "novops" function (function that does not read global memory,
2479 but may have arbitrary side effects). */
2480 #define DECL_IS_NOVOPS(NODE) \
2481 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2483 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2484 at the beginning or end of execution. */
2485 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2486 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2488 #define DECL_STATIC_DESTRUCTOR(NODE) \
2489 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2491 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2492 be instrumented with calls to support routines. */
2493 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2494 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2496 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2497 disabled in this function. */
2498 #define DECL_NO_LIMIT_STACK(NODE) \
2499 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2501 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2502 #define DECL_STATIC_CHAIN(NODE) \
2503 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2505 /* Nonzero for a decl that cgraph has decided should be inlined into
2506 at least one call site. It is not meaningful to look at this
2507 directly; always use cgraph_function_possibly_inlined_p. */
2508 #define DECL_POSSIBLY_INLINED(DECL) \
2509 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2511 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2512 such as via the `inline' keyword in C/C++. This flag controls the linkage
2513 semantics of 'inline' */
2514 #define DECL_DECLARED_INLINE_P(NODE) \
2515 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2517 /* Nonzero in a FUNCTION_DECL means this function should not get
2518 -Winline warnings. */
2519 #define DECL_NO_INLINE_WARNING_P(NODE) \
2520 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2522 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2523 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2524 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2526 /* Nonzero if a FUNCTION_CODE is a TM load. */
2527 #define BUILTIN_TM_LOAD_P(FN) \
2528 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2530 /* Nonzero if a FUNCTION_CODE is a TM store. */
2531 #define BUILTIN_TM_STORE_P(FN) \
2532 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2534 #define CASE_BUILT_IN_TM_LOAD(FN) \
2535 case BUILT_IN_TM_LOAD_##FN: \
2536 case BUILT_IN_TM_LOAD_RAR_##FN: \
2537 case BUILT_IN_TM_LOAD_RAW_##FN: \
2538 case BUILT_IN_TM_LOAD_RFW_##FN
2540 #define CASE_BUILT_IN_TM_STORE(FN) \
2541 case BUILT_IN_TM_STORE_##FN: \
2542 case BUILT_IN_TM_STORE_WAR_##FN: \
2543 case BUILT_IN_TM_STORE_WAW_##FN
2545 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2546 disregarding size and cost heuristics. This is equivalent to using
2547 the always_inline attribute without the required diagnostics if the
2548 function cannot be inlined. */
2549 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2550 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2552 extern vec
<tree
, va_gc
> **decl_debug_args_lookup (tree
);
2553 extern vec
<tree
, va_gc
> **decl_debug_args_insert (tree
);
2555 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2556 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2557 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2559 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2560 that describes the status of this function. */
2561 #define DECL_STRUCT_FUNCTION(NODE) \
2562 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2564 /* In a FUNCTION_DECL, nonzero means a built in function of a
2565 standard library or more generally a built in function that is
2566 recognized by optimizers and expanders.
2568 Note that it is different from the DECL_IS_BUILTIN accessor. For
2569 instance, user declared prototypes of C library functions are not
2570 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2571 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2573 /* For a builtin function, identify which part of the compiler defined it. */
2574 #define DECL_BUILT_IN_CLASS(NODE) \
2575 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2577 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2578 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2580 #define DECL_ARGUMENTS(NODE) \
2581 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2582 #define DECL_ARGUMENT_FLD(NODE) \
2583 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2585 /* In FUNCTION_DECL, the function specific target options to use when compiling
2587 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2588 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2590 /* In FUNCTION_DECL, the function specific optimization options to use when
2591 compiling this function. */
2592 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2593 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2595 /* In FUNCTION_DECL, this is set if this function has other versions generated
2596 using "target" attributes. The default version is the one which does not
2597 have any "target" attribute set. */
2598 #define DECL_FUNCTION_VERSIONED(NODE)\
2599 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2601 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2602 Devirtualization machinery uses this knowledge for determing type of the
2603 object constructed. Also we assume that constructor address is not
2605 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2606 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2608 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2609 Devirtualization machinery uses this to track types in destruction. */
2610 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2611 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2613 /* In FUNCTION_DECL that represent an virtual method this is set when
2614 the method is final. */
2615 #define DECL_FINAL_P(NODE)\
2616 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2618 /* The source language of the translation-unit. */
2619 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2620 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2622 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2624 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2625 #define DECL_ORIGINAL_TYPE(NODE) \
2626 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2628 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2629 into stabs. Instead it will generate cross reference ('x') of names.
2630 This uses the same flag as DECL_EXTERNAL. */
2631 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2632 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2634 /* Getter of the imported declaration associated to the
2635 IMPORTED_DECL node. */
2636 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2637 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2639 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2640 To reduce overhead, the nodes containing the statements are not trees.
2641 This avoids the overhead of tree_common on all linked list elements.
2643 Use the interface in tree-iterator.h to access this node. */
2645 #define STATEMENT_LIST_HEAD(NODE) \
2646 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2647 #define STATEMENT_LIST_TAIL(NODE) \
2648 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2650 #define TREE_OPTIMIZATION(NODE) \
2651 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2653 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2654 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2656 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2657 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2659 /* Return a tree node that encapsulates the optimization options in OPTS. */
2660 extern tree
build_optimization_node (struct gcc_options
*opts
);
2662 extern void init_tree_optimization_optabs (tree
);
2664 #define TREE_TARGET_OPTION(NODE) \
2665 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2667 /* Return a tree node that encapsulates the target options in OPTS. */
2668 extern tree
build_target_option_node (struct gcc_options
*opts
);
2670 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2673 tree_check (tree __t
, const char *__f
, int __l
, const char *__g
, tree_code __c
)
2675 if (TREE_CODE (__t
) != __c
)
2676 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2681 tree_not_check (tree __t
, const char *__f
, int __l
, const char *__g
,
2684 if (TREE_CODE (__t
) == __c
)
2685 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2690 tree_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2691 enum tree_code __c1
, enum tree_code __c2
)
2693 if (TREE_CODE (__t
) != __c1
2694 && TREE_CODE (__t
) != __c2
)
2695 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2700 tree_not_check2 (tree __t
, const char *__f
, int __l
, const char *__g
,
2701 enum tree_code __c1
, enum tree_code __c2
)
2703 if (TREE_CODE (__t
) == __c1
2704 || TREE_CODE (__t
) == __c2
)
2705 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2710 tree_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2711 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2713 if (TREE_CODE (__t
) != __c1
2714 && TREE_CODE (__t
) != __c2
2715 && TREE_CODE (__t
) != __c3
)
2716 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2721 tree_not_check3 (tree __t
, const char *__f
, int __l
, const char *__g
,
2722 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2724 if (TREE_CODE (__t
) == __c1
2725 || TREE_CODE (__t
) == __c2
2726 || TREE_CODE (__t
) == __c3
)
2727 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2732 tree_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2733 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2734 enum tree_code __c4
)
2736 if (TREE_CODE (__t
) != __c1
2737 && TREE_CODE (__t
) != __c2
2738 && TREE_CODE (__t
) != __c3
2739 && TREE_CODE (__t
) != __c4
)
2740 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2745 tree_not_check4 (tree __t
, const char *__f
, int __l
, const char *__g
,
2746 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2747 enum tree_code __c4
)
2749 if (TREE_CODE (__t
) == __c1
2750 || TREE_CODE (__t
) == __c2
2751 || TREE_CODE (__t
) == __c3
2752 || TREE_CODE (__t
) == __c4
)
2753 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2758 tree_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2759 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2760 enum tree_code __c4
, enum tree_code __c5
)
2762 if (TREE_CODE (__t
) != __c1
2763 && TREE_CODE (__t
) != __c2
2764 && TREE_CODE (__t
) != __c3
2765 && TREE_CODE (__t
) != __c4
2766 && TREE_CODE (__t
) != __c5
)
2767 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2772 tree_not_check5 (tree __t
, const char *__f
, int __l
, const char *__g
,
2773 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2774 enum tree_code __c4
, enum tree_code __c5
)
2776 if (TREE_CODE (__t
) == __c1
2777 || TREE_CODE (__t
) == __c2
2778 || TREE_CODE (__t
) == __c3
2779 || TREE_CODE (__t
) == __c4
2780 || TREE_CODE (__t
) == __c5
)
2781 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
2786 contains_struct_check (tree __t
, const enum tree_node_structure_enum __s
,
2787 const char *__f
, int __l
, const char *__g
)
2789 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
2790 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
2795 tree_class_check (tree __t
, const enum tree_code_class __class
,
2796 const char *__f
, int __l
, const char *__g
)
2798 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
2799 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
2804 tree_range_check (tree __t
,
2805 enum tree_code __code1
, enum tree_code __code2
,
2806 const char *__f
, int __l
, const char *__g
)
2808 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
2809 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2814 omp_clause_subcode_check (tree __t
, enum omp_clause_code __code
,
2815 const char *__f
, int __l
, const char *__g
)
2817 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2818 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2819 if (__t
->omp_clause
.code
!= __code
)
2820 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
2825 omp_clause_range_check (tree __t
,
2826 enum omp_clause_code __code1
,
2827 enum omp_clause_code __code2
,
2828 const char *__f
, int __l
, const char *__g
)
2830 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2831 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2832 if ((int) __t
->omp_clause
.code
< (int) __code1
2833 || (int) __t
->omp_clause
.code
> (int) __code2
)
2834 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
2838 /* These checks have to be special cased. */
2841 expr_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2843 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
2844 if (!IS_EXPR_CODE_CLASS (__c
))
2845 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
2849 /* These checks have to be special cased. */
2852 non_type_check (tree __t
, const char *__f
, int __l
, const char *__g
)
2855 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
2859 inline const HOST_WIDE_INT
*
2860 tree_int_cst_elt_check (const_tree __t
, int __i
,
2861 const char *__f
, int __l
, const char *__g
)
2863 if (TREE_CODE (__t
) != INTEGER_CST
)
2864 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2865 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2866 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2868 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2871 inline HOST_WIDE_INT
*
2872 tree_int_cst_elt_check (tree __t
, int __i
,
2873 const char *__f
, int __l
, const char *__g
)
2875 if (TREE_CODE (__t
) != INTEGER_CST
)
2876 tree_check_failed (__t
, __f
, __l
, __g
, INTEGER_CST
, 0);
2877 if (__i
< 0 || __i
>= __t
->base
.u
.int_length
.extended
)
2878 tree_int_cst_elt_check_failed (__i
, __t
->base
.u
.int_length
.extended
,
2880 return &CONST_CAST_TREE (__t
)->int_cst
.val
[__i
];
2884 tree_vec_elt_check (tree __t
, int __i
,
2885 const char *__f
, int __l
, const char *__g
)
2887 if (TREE_CODE (__t
) != TREE_VEC
)
2888 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
2889 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
2890 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
2891 return &CONST_CAST_TREE (__t
)->vec
.a
[__i
];
2895 omp_clause_elt_check (tree __t
, int __i
,
2896 const char *__f
, int __l
, const char *__g
)
2898 if (TREE_CODE (__t
) != OMP_CLAUSE
)
2899 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
2900 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
2901 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
2902 return &__t
->omp_clause
.ops
[__i
];
2906 tree_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2909 if (TREE_CODE (__t
) != __c
)
2910 tree_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2915 tree_not_check (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2918 if (TREE_CODE (__t
) == __c
)
2919 tree_not_check_failed (__t
, __f
, __l
, __g
, __c
, 0);
2924 tree_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2925 enum tree_code __c1
, enum tree_code __c2
)
2927 if (TREE_CODE (__t
) != __c1
2928 && TREE_CODE (__t
) != __c2
)
2929 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2934 tree_not_check2 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2935 enum tree_code __c1
, enum tree_code __c2
)
2937 if (TREE_CODE (__t
) == __c1
2938 || TREE_CODE (__t
) == __c2
)
2939 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, 0);
2944 tree_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2945 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2947 if (TREE_CODE (__t
) != __c1
2948 && TREE_CODE (__t
) != __c2
2949 && TREE_CODE (__t
) != __c3
)
2950 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2955 tree_not_check3 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2956 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
)
2958 if (TREE_CODE (__t
) == __c1
2959 || TREE_CODE (__t
) == __c2
2960 || TREE_CODE (__t
) == __c3
)
2961 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, 0);
2966 tree_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2967 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2968 enum tree_code __c4
)
2970 if (TREE_CODE (__t
) != __c1
2971 && TREE_CODE (__t
) != __c2
2972 && TREE_CODE (__t
) != __c3
2973 && TREE_CODE (__t
) != __c4
)
2974 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2979 tree_not_check4 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2980 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2981 enum tree_code __c4
)
2983 if (TREE_CODE (__t
) == __c1
2984 || TREE_CODE (__t
) == __c2
2985 || TREE_CODE (__t
) == __c3
2986 || TREE_CODE (__t
) == __c4
)
2987 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, 0);
2992 tree_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
2993 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
2994 enum tree_code __c4
, enum tree_code __c5
)
2996 if (TREE_CODE (__t
) != __c1
2997 && TREE_CODE (__t
) != __c2
2998 && TREE_CODE (__t
) != __c3
2999 && TREE_CODE (__t
) != __c4
3000 && TREE_CODE (__t
) != __c5
)
3001 tree_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3006 tree_not_check5 (const_tree __t
, const char *__f
, int __l
, const char *__g
,
3007 enum tree_code __c1
, enum tree_code __c2
, enum tree_code __c3
,
3008 enum tree_code __c4
, enum tree_code __c5
)
3010 if (TREE_CODE (__t
) == __c1
3011 || TREE_CODE (__t
) == __c2
3012 || TREE_CODE (__t
) == __c3
3013 || TREE_CODE (__t
) == __c4
3014 || TREE_CODE (__t
) == __c5
)
3015 tree_not_check_failed (__t
, __f
, __l
, __g
, __c1
, __c2
, __c3
, __c4
, __c5
, 0);
3020 contains_struct_check (const_tree __t
, const enum tree_node_structure_enum __s
,
3021 const char *__f
, int __l
, const char *__g
)
3023 if (tree_contains_struct
[TREE_CODE (__t
)][__s
] != 1)
3024 tree_contains_struct_check_failed (__t
, __s
, __f
, __l
, __g
);
3029 tree_class_check (const_tree __t
, const enum tree_code_class __class
,
3030 const char *__f
, int __l
, const char *__g
)
3032 if (TREE_CODE_CLASS (TREE_CODE (__t
)) != __class
)
3033 tree_class_check_failed (__t
, __class
, __f
, __l
, __g
);
3038 tree_range_check (const_tree __t
,
3039 enum tree_code __code1
, enum tree_code __code2
,
3040 const char *__f
, int __l
, const char *__g
)
3042 if (TREE_CODE (__t
) < __code1
|| TREE_CODE (__t
) > __code2
)
3043 tree_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3048 omp_clause_subcode_check (const_tree __t
, enum omp_clause_code __code
,
3049 const char *__f
, int __l
, const char *__g
)
3051 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3052 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3053 if (__t
->omp_clause
.code
!= __code
)
3054 omp_clause_check_failed (__t
, __f
, __l
, __g
, __code
);
3059 omp_clause_range_check (const_tree __t
,
3060 enum omp_clause_code __code1
,
3061 enum omp_clause_code __code2
,
3062 const char *__f
, int __l
, const char *__g
)
3064 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3065 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3066 if ((int) __t
->omp_clause
.code
< (int) __code1
3067 || (int) __t
->omp_clause
.code
> (int) __code2
)
3068 omp_clause_range_check_failed (__t
, __f
, __l
, __g
, __code1
, __code2
);
3073 expr_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3075 char const __c
= TREE_CODE_CLASS (TREE_CODE (__t
));
3076 if (!IS_EXPR_CODE_CLASS (__c
))
3077 tree_class_check_failed (__t
, tcc_expression
, __f
, __l
, __g
);
3082 non_type_check (const_tree __t
, const char *__f
, int __l
, const char *__g
)
3085 tree_not_class_check_failed (__t
, tcc_type
, __f
, __l
, __g
);
3090 tree_vec_elt_check (const_tree __t
, int __i
,
3091 const char *__f
, int __l
, const char *__g
)
3093 if (TREE_CODE (__t
) != TREE_VEC
)
3094 tree_check_failed (__t
, __f
, __l
, __g
, TREE_VEC
, 0);
3095 if (__i
< 0 || __i
>= __t
->base
.u
.length
)
3096 tree_vec_elt_check_failed (__i
, __t
->base
.u
.length
, __f
, __l
, __g
);
3097 return CONST_CAST (const_tree
*, &__t
->vec
.a
[__i
]);
3098 //return &__t->vec.a[__i];
3102 omp_clause_elt_check (const_tree __t
, int __i
,
3103 const char *__f
, int __l
, const char *__g
)
3105 if (TREE_CODE (__t
) != OMP_CLAUSE
)
3106 tree_check_failed (__t
, __f
, __l
, __g
, OMP_CLAUSE
, 0);
3107 if (__i
< 0 || __i
>= omp_clause_num_ops
[__t
->omp_clause
.code
])
3108 omp_clause_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3109 return CONST_CAST (const_tree
*, &__t
->omp_clause
.ops
[__i
]);
3114 /* Checks that X is integer constant that can be expressed in signed
3115 HOST_WIDE_INT without loss of precision. This function differs
3116 from the tree_fits_* versions in that the signedness of the
3117 type of X is not considered. */
3120 cst_fits_shwi_p (const_tree x
)
3122 if (TREE_CODE (x
) != INTEGER_CST
)
3125 return TREE_INT_CST_NUNITS (x
) == 1;
3128 /* Checks that X is integer constant that can be expressed in signed
3129 HOST_WIDE_INT without loss of precision. This function differs
3130 from the tree_fits_* versions in that the signedness of the
3131 type of X is not considered. */
3134 cst_fits_uhwi_p (const_tree x
)
3136 if (TREE_CODE (x
) != INTEGER_CST
)
3139 return TREE_INT_CST_NUNITS (x
) == 1 && TREE_INT_CST_ELT (x
, 0) >= 0;
3142 /* Return true if T is an INTEGER_CST whose value must be non-negative
3143 and can be represented in a single unsigned HOST_WIDE_INT. This
3144 function differs from the cst_fits versions in that the signedness
3145 of the type of cst is considered. */
3148 tree_fits_uhwi_p (const_tree cst
)
3151 if (cst
== NULL_TREE
)
3154 type
= TREE_TYPE (cst
);
3156 if (TREE_CODE (cst
) != INTEGER_CST
)
3159 if (TREE_INT_CST_NUNITS (cst
) == 1)
3161 if ((TYPE_SIGN (type
) == UNSIGNED
)
3162 && (TYPE_PRECISION (type
) <= HOST_BITS_PER_WIDE_INT
))
3165 /* For numbers of unsigned type that are longer than a HWI, if
3166 the top bit of the bottom word is set, and there is not
3167 another element, then this is too large to fit in a single
3168 hwi. For signed numbers, negative values are not allowed. */
3169 if (TREE_INT_CST_ELT (cst
, 0) >= 0)
3172 else if (TREE_INT_CST_NUNITS (cst
) == 2)
3174 if (TREE_INT_CST_ELT (cst
, 1) == 0)
3180 /* Return true if CST is an INTEGER_CST whose value can be represented
3181 in a single HOST_WIDE_INT. This function differs from the cst_fits
3182 versions in that the signedness of the type of cst is
3186 tree_fits_shwi_p (const_tree cst
)
3188 if (cst
== NULL_TREE
)
3191 if (TREE_CODE (cst
) != INTEGER_CST
)
3194 if (TREE_INT_CST_NUNITS (cst
) != 1)
3197 if (TYPE_SIGN (TREE_TYPE (cst
)) == SIGNED
)
3200 if (TREE_INT_CST_ELT (cst
, 0) >= 0)
3206 /* Return true if T is an INTEGER_CST that can be manipulated
3207 efficiently on the host. If SIGN is SIGNED, the value can be
3208 represented in a single HOST_WIDE_INT. If SIGN is UNSIGNED, the
3209 value must be non-negative and can be represented in a single
3210 unsigned HOST_WIDE_INT. */
3213 tree_fits_hwi_p (const_tree cst
, signop sign
)
3215 return sign
? tree_fits_uhwi_p (cst
) : tree_fits_shwi_p (cst
);
3218 /* Return true if T is an INTEGER_CST that can be manipulated
3219 efficiently on the host. If the sign of CST is SIGNED, the value
3220 can be represented in a single HOST_WIDE_INT. If the sign of CST
3221 is UNSIGNED, the value must be non-negative and can be represented
3222 in a single unsigned HOST_WIDE_INT. */
3225 tree_fits_hwi_p (const_tree cst
)
3227 if (cst
== NULL_TREE
)
3230 if (TREE_CODE (cst
) != INTEGER_CST
)
3233 return TYPE_UNSIGNED (TREE_TYPE (cst
))
3234 ? tree_fits_uhwi_p (cst
) : tree_fits_shwi_p (cst
);
3237 /* Return the unsigned HOST_WIDE_INT least significant bits of CST.
3238 If checking is enabled, this ices if the value does not fit. */
3240 static inline unsigned HOST_WIDE_INT
3241 tree_to_uhwi (const_tree cst
)
3243 gcc_checking_assert (tree_fits_uhwi_p (cst
));
3245 return (unsigned HOST_WIDE_INT
)TREE_INT_CST_ELT (cst
, 0);
3248 /* Return the HOST_WIDE_INT least significant bits of CST. If
3249 checking is enabled, this ices if the value does not fit. */
3251 static inline HOST_WIDE_INT
3252 tree_to_shwi (const_tree cst
)
3254 gcc_checking_assert (tree_fits_shwi_p (cst
));
3256 return (HOST_WIDE_INT
)TREE_INT_CST_ELT (cst
, 0);
3259 /* Return the HOST_WIDE_INT least significant bits of CST. No
3260 checking is done to assure that it fits. It is assumed that one of
3261 tree_fits_uhwi_p or tree_fits_shwi_p was done before this call. */
3263 static inline HOST_WIDE_INT
3264 tree_to_hwi (const_tree cst
)
3266 return TREE_INT_CST_ELT (cst
, 0);
3269 /* Return the HOST_WIDE_INT least significant bits of CST. The sign
3270 of the checking is based on SIGNOP. */
3272 static inline HOST_WIDE_INT
3273 tree_to_hwi (const_tree cst
, signop sgn
)
3276 return tree_to_shwi (cst
);
3278 return tree_to_uhwi (cst
);
3282 /* Compute the number of operands in an expression node NODE. For
3283 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3284 otherwise it is looked up from the node's code. */
3286 tree_operand_length (const_tree node
)
3288 if (VL_EXP_CLASS_P (node
))
3289 return VL_EXP_OPERAND_LENGTH (node
);
3291 return TREE_CODE_LENGTH (TREE_CODE (node
));
3294 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3296 /* Special checks for TREE_OPERANDs. */
3298 tree_operand_check (tree __t
, int __i
,
3299 const char *__f
, int __l
, const char *__g
)
3301 const_tree __u
= EXPR_CHECK (__t
);
3302 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3303 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3304 return &CONST_CAST_TREE (__u
)->exp
.operands
[__i
];
3308 tree_operand_check_code (tree __t
, enum tree_code __code
, int __i
,
3309 const char *__f
, int __l
, const char *__g
)
3311 if (TREE_CODE (__t
) != __code
)
3312 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3313 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3314 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3315 return &__t
->exp
.operands
[__i
];
3319 tree_operand_check (const_tree __t
, int __i
,
3320 const char *__f
, int __l
, const char *__g
)
3322 const_tree __u
= EXPR_CHECK (__t
);
3323 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__u
))
3324 tree_operand_check_failed (__i
, __u
, __f
, __l
, __g
);
3325 return CONST_CAST (const_tree
*, &__u
->exp
.operands
[__i
]);
3329 tree_operand_check_code (const_tree __t
, enum tree_code __code
, int __i
,
3330 const char *__f
, int __l
, const char *__g
)
3332 if (TREE_CODE (__t
) != __code
)
3333 tree_check_failed (__t
, __f
, __l
, __g
, __code
, 0);
3334 if (__i
< 0 || __i
>= TREE_OPERAND_LENGTH (__t
))
3335 tree_operand_check_failed (__i
, __t
, __f
, __l
, __g
);
3336 return CONST_CAST (const_tree
*, &__t
->exp
.operands
[__i
]);
3341 #define error_mark_node global_trees[TI_ERROR_MARK]
3343 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3344 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3345 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3346 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3347 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3349 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3350 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3351 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3352 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3353 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3355 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3356 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3357 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3359 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3360 #define integer_one_node global_trees[TI_INTEGER_ONE]
3361 #define integer_three_node global_trees[TI_INTEGER_THREE]
3362 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3363 #define size_zero_node global_trees[TI_SIZE_ZERO]
3364 #define size_one_node global_trees[TI_SIZE_ONE]
3365 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3366 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3367 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3369 /* Base access nodes. */
3370 #define access_public_node global_trees[TI_PUBLIC]
3371 #define access_protected_node global_trees[TI_PROTECTED]
3372 #define access_private_node global_trees[TI_PRIVATE]
3374 #define null_pointer_node global_trees[TI_NULL_POINTER]
3376 #define float_type_node global_trees[TI_FLOAT_TYPE]
3377 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3378 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3380 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3381 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3382 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3383 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3385 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3386 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3387 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3388 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3390 #define void_type_node global_trees[TI_VOID_TYPE]
3391 /* The C type `void *'. */
3392 #define ptr_type_node global_trees[TI_PTR_TYPE]
3393 /* The C type `const void *'. */
3394 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3395 /* The C type `size_t'. */
3396 #define size_type_node global_trees[TI_SIZE_TYPE]
3397 #define pid_type_node global_trees[TI_PID_TYPE]
3398 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3399 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3400 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3401 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3402 /* The C type `FILE *'. */
3403 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3404 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3406 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3407 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3408 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3410 /* The decimal floating point types. */
3411 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3412 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3413 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3414 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3415 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3416 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3418 /* The fixed-point types. */
3419 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3420 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3421 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3422 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3423 #define sat_unsigned_short_fract_type_node \
3424 global_trees[TI_SAT_USFRACT_TYPE]
3425 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3426 #define sat_unsigned_long_fract_type_node \
3427 global_trees[TI_SAT_ULFRACT_TYPE]
3428 #define sat_unsigned_long_long_fract_type_node \
3429 global_trees[TI_SAT_ULLFRACT_TYPE]
3430 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3431 #define fract_type_node global_trees[TI_FRACT_TYPE]
3432 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3433 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3434 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3435 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3436 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3437 #define unsigned_long_long_fract_type_node \
3438 global_trees[TI_ULLFRACT_TYPE]
3439 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3440 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3441 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3442 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3443 #define sat_unsigned_short_accum_type_node \
3444 global_trees[TI_SAT_USACCUM_TYPE]
3445 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3446 #define sat_unsigned_long_accum_type_node \
3447 global_trees[TI_SAT_ULACCUM_TYPE]
3448 #define sat_unsigned_long_long_accum_type_node \
3449 global_trees[TI_SAT_ULLACCUM_TYPE]
3450 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3451 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3452 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3453 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3454 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3455 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3456 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3457 #define unsigned_long_long_accum_type_node \
3458 global_trees[TI_ULLACCUM_TYPE]
3459 #define qq_type_node global_trees[TI_QQ_TYPE]
3460 #define hq_type_node global_trees[TI_HQ_TYPE]
3461 #define sq_type_node global_trees[TI_SQ_TYPE]
3462 #define dq_type_node global_trees[TI_DQ_TYPE]
3463 #define tq_type_node global_trees[TI_TQ_TYPE]
3464 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3465 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3466 #define usq_type_node global_trees[TI_USQ_TYPE]
3467 #define udq_type_node global_trees[TI_UDQ_TYPE]
3468 #define utq_type_node global_trees[TI_UTQ_TYPE]
3469 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3470 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3471 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3472 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3473 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3474 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3475 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3476 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3477 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3478 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3479 #define ha_type_node global_trees[TI_HA_TYPE]
3480 #define sa_type_node global_trees[TI_SA_TYPE]
3481 #define da_type_node global_trees[TI_DA_TYPE]
3482 #define ta_type_node global_trees[TI_TA_TYPE]
3483 #define uha_type_node global_trees[TI_UHA_TYPE]
3484 #define usa_type_node global_trees[TI_USA_TYPE]
3485 #define uda_type_node global_trees[TI_UDA_TYPE]
3486 #define uta_type_node global_trees[TI_UTA_TYPE]
3487 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3488 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3489 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3490 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3491 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3492 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3493 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3494 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3496 /* The node that should be placed at the end of a parameter list to
3497 indicate that the function does not take a variable number of
3498 arguments. The TREE_VALUE will be void_type_node and there will be
3499 no TREE_CHAIN. Language-independent code should not assume
3500 anything else about this node. */
3501 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3503 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3504 #define MAIN_NAME_P(NODE) \
3505 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3507 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3509 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3510 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3512 /* Default/current target options (TARGET_OPTION_NODE). */
3513 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3514 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3516 /* Default tree list option(), optimize() pragmas to be linked into the
3518 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3519 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3521 #define char_type_node integer_types[itk_char]
3522 #define signed_char_type_node integer_types[itk_signed_char]
3523 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3524 #define short_integer_type_node integer_types[itk_short]
3525 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3526 #define integer_type_node integer_types[itk_int]
3527 #define unsigned_type_node integer_types[itk_unsigned_int]
3528 #define long_integer_type_node integer_types[itk_long]
3529 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3530 #define long_long_integer_type_node integer_types[itk_long_long]
3531 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3532 #define int128_integer_type_node integer_types[itk_int128]
3533 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3535 /* True if NODE is an erroneous expression. */
3537 #define error_operand_p(NODE) \
3538 ((NODE) == error_mark_node \
3539 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3541 extern tree
decl_assembler_name (tree
);
3542 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3543 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3545 /* Compute the number of bytes occupied by 'node'. This routine only
3546 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3548 extern size_t tree_size (const_tree
);
3550 /* Compute the number of bytes occupied by a tree with code CODE.
3551 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3552 which are of variable length. */
3553 extern size_t tree_code_size (enum tree_code
);
3555 /* Allocate and return a new UID from the DECL_UID namespace. */
3556 extern int allocate_decl_uid (void);
3558 /* Lowest level primitive for allocating a node.
3559 The TREE_CODE is the only argument. Contents are initialized
3560 to zero except for a few of the common fields. */
3562 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3563 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3565 /* Make a copy of a node, with all the same contents. */
3567 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3568 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3570 /* Make a copy of a chain of TREE_LIST nodes. */
3572 extern tree
copy_list (tree
);
3574 /* Make a CASE_LABEL_EXPR. */
3576 extern tree
build_case_label (tree
, tree
, tree
);
3579 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3580 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3582 /* Make a INTEGER_CST. */
3584 extern tree
make_int_cst_stat (int, int MEM_STAT_DECL
);
3585 #define make_int_cst(LEN, EXT_LEN) \
3586 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3588 /* Make a TREE_VEC. */
3590 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3591 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3593 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3594 The name is supplied as a char *. */
3596 extern tree
get_identifier (const char *);
3598 #if GCC_VERSION >= 3000
3599 #define get_identifier(str) \
3600 (__builtin_constant_p (str) \
3601 ? get_identifier_with_length ((str), strlen (str)) \
3602 : get_identifier (str))
3606 /* Identical to get_identifier, except that the length is assumed
3609 extern tree
get_identifier_with_length (const char *, size_t);
3611 /* If an identifier with the name TEXT (a null-terminated string) has
3612 previously been referred to, return that node; otherwise return
3615 extern tree
maybe_get_identifier (const char *);
3617 /* Construct various types of nodes. */
3619 extern tree
build_nt (enum tree_code
, ...);
3620 extern tree
build_nt_call_vec (tree
, vec
<tree
, va_gc
> *);
3622 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3623 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3624 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3625 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3626 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3627 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3628 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3629 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3630 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3631 tree MEM_STAT_DECL
);
3632 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3633 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3634 tree MEM_STAT_DECL
);
3635 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3637 /* _loc versions of build[1-5]. */
3640 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
3641 tree arg1 MEM_STAT_DECL
)
3643 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
3644 if (CAN_HAVE_LOCATION_P (t
))
3645 SET_EXPR_LOCATION (t
, loc
);
3648 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3651 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3652 tree arg1 MEM_STAT_DECL
)
3654 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
3655 if (CAN_HAVE_LOCATION_P (t
))
3656 SET_EXPR_LOCATION (t
, loc
);
3659 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3662 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3663 tree arg1
, tree arg2 MEM_STAT_DECL
)
3665 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
3666 if (CAN_HAVE_LOCATION_P (t
))
3667 SET_EXPR_LOCATION (t
, loc
);
3670 #define build3_loc(l,c,t1,t2,t3,t4) \
3671 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3674 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3675 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
3677 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
3678 if (CAN_HAVE_LOCATION_P (t
))
3679 SET_EXPR_LOCATION (t
, loc
);
3682 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3683 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3686 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
3687 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3689 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
3690 arg4 PASS_MEM_STAT
);
3691 if (CAN_HAVE_LOCATION_P (t
))
3692 SET_EXPR_LOCATION (t
, loc
);
3695 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3696 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3698 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
3699 #define build_var_debug_value(t1,t2) \
3700 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3702 /* Constructs double_int from tree CST. */
3704 extern tree
double_int_to_tree (tree
, double_int
);
3706 extern offset_int
mem_ref_offset (const_tree
);
3707 extern tree
wide_int_to_tree (tree type
, const wide_int_ref
&cst
);
3708 extern tree
force_fit_type (tree
, const wide_int_ref
&, int, bool);
3710 /* Create an INT_CST node with a CST value zero extended. */
3713 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3714 extern tree
build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
);
3715 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3716 extern tree
make_vector_stat (unsigned MEM_STAT_DECL
);
3717 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3718 extern tree
build_vector_stat (tree
, tree
* MEM_STAT_DECL
);
3719 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3720 extern tree
build_vector_from_ctor (tree
, vec
<constructor_elt
, va_gc
> *);
3721 extern tree
build_vector_from_val (tree
, tree
);
3722 extern tree
build_constructor (tree
, vec
<constructor_elt
, va_gc
> *);
3723 extern tree
build_constructor_single (tree
, tree
, tree
);
3724 extern tree
build_constructor_from_list (tree
, tree
);
3725 extern tree
build_constructor_va (tree
, int, ...);
3726 extern tree
build_real_from_int_cst (tree
, const_tree
);
3727 extern tree
build_complex (tree
, tree
, tree
);
3728 extern tree
build_one_cst (tree
);
3729 extern tree
build_minus_one_cst (tree
);
3730 extern tree
build_all_ones_cst (tree
);
3731 extern tree
build_zero_cst (tree
);
3732 extern tree
build_string (int, const char *);
3733 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3734 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3735 extern tree
build_tree_list_vec_stat (const vec
<tree
, va_gc
> *MEM_STAT_DECL
);
3736 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3737 extern tree
build_decl_stat (location_t
, enum tree_code
,
3738 tree
, tree MEM_STAT_DECL
);
3739 extern tree
build_fn_decl (const char *, tree
);
3740 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3741 extern tree
build_translation_unit_decl (tree
);
3742 extern tree
build_block (tree
, tree
, tree
, tree
);
3743 extern tree
build_empty_stmt (location_t
);
3744 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3746 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3747 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3749 extern tree
build_call_nary (tree
, tree
, int, ...);
3750 extern tree
build_call_valist (tree
, tree
, int, va_list);
3751 #define build_call_array(T1,T2,N,T3)\
3752 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3753 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
3754 extern tree
build_call_vec (tree
, tree
, vec
<tree
, va_gc
> *);
3756 /* Construct various nodes representing data types. */
3758 extern tree
make_signed_type (int);
3759 extern tree
make_unsigned_type (int);
3760 extern tree
signed_or_unsigned_type_for (int, tree
);
3761 extern tree
signed_type_for (tree
);
3762 extern tree
unsigned_type_for (tree
);
3763 extern tree
truth_type_for (tree
);
3764 extern void initialize_sizetypes (void);
3765 extern void fixup_unsigned_type (tree
);
3766 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3767 extern tree
build_pointer_type (tree
);
3768 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3769 extern tree
build_reference_type (tree
);
3770 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3771 extern tree
build_vector_type (tree innertype
, int nunits
);
3772 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3773 extern tree
build_type_no_quals (tree
);
3774 extern tree
build_index_type (tree
);
3775 extern tree
build_array_type (tree
, tree
);
3776 extern tree
build_nonshared_array_type (tree
, tree
);
3777 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
3778 extern tree
build_function_type (tree
, tree
);
3779 extern tree
build_function_type_list (tree
, ...);
3780 extern tree
build_function_decl_skip_args (tree
, bitmap
, bool);
3781 extern tree
build_varargs_function_type_list (tree
, ...);
3782 extern tree
build_function_type_array (tree
, int, tree
*);
3783 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
3784 #define build_function_type_vec(RET, V) \
3785 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3786 #define build_varargs_function_type_vec(RET, V) \
3787 build_varargs_function_type_array (RET, vec_safe_length (V), \
3788 vec_safe_address (V))
3789 extern tree
build_method_type_directly (tree
, tree
, tree
);
3790 extern tree
build_method_type (tree
, tree
);
3791 extern tree
build_offset_type (tree
, tree
);
3792 extern tree
build_complex_type (tree
);
3793 extern tree
array_type_nelts (const_tree
);
3794 extern bool in_array_bounds_p (tree
);
3795 extern bool range_in_array_bounds_p (tree
);
3797 extern tree
value_member (tree
, tree
);
3798 extern tree
purpose_member (const_tree
, tree
);
3799 extern bool vec_member (const_tree
, vec
<tree
, va_gc
> *);
3800 extern tree
chain_index (int, tree
);
3802 extern int attribute_list_equal (const_tree
, const_tree
);
3803 extern int attribute_list_contained (const_tree
, const_tree
);
3804 extern int tree_int_cst_equal (const_tree
, const_tree
);
3805 extern int tree_int_cst_lt (const_tree
, const_tree
);
3806 extern int tree_int_cst_compare (const_tree
, const_tree
);
3807 extern HOST_WIDE_INT
size_low_cst (const_tree
);
3808 extern int tree_int_cst_sgn (const_tree
);
3809 extern int tree_int_cst_sign_bit (const_tree
);
3810 extern unsigned int tree_int_cst_min_precision (tree
, signop
);
3811 extern bool tree_expr_nonnegative_p (tree
);
3812 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3813 extern bool may_negate_without_overflow_p (const_tree
);
3814 extern tree
strip_array_types (tree
);
3815 extern tree
excess_precision_type (tree
);
3816 extern bool valid_constant_size_p (const_tree
);
3817 extern unsigned int element_precision (const_tree
);
3819 /* Construct various nodes representing fract or accum data types. */
3821 extern tree
make_fract_type (int, int, int);
3822 extern tree
make_accum_type (int, int, int);
3824 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3825 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3826 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3827 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3828 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3829 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3830 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3831 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3833 #define make_or_reuse_signed_fract_type(P) \
3834 make_or_reuse_fract_type (P, 0, 0)
3835 #define make_or_reuse_unsigned_fract_type(P) \
3836 make_or_reuse_fract_type (P, 1, 0)
3837 #define make_or_reuse_sat_signed_fract_type(P) \
3838 make_or_reuse_fract_type (P, 0, 1)
3839 #define make_or_reuse_sat_unsigned_fract_type(P) \
3840 make_or_reuse_fract_type (P, 1, 1)
3841 #define make_or_reuse_signed_accum_type(P) \
3842 make_or_reuse_accum_type (P, 0, 0)
3843 #define make_or_reuse_unsigned_accum_type(P) \
3844 make_or_reuse_accum_type (P, 1, 0)
3845 #define make_or_reuse_sat_signed_accum_type(P) \
3846 make_or_reuse_accum_type (P, 0, 1)
3847 #define make_or_reuse_sat_unsigned_accum_type(P) \
3848 make_or_reuse_accum_type (P, 1, 1)
3850 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3851 put the prototype here. Rtl.h does declare the prototype if
3852 tree.h had been included. */
3854 extern tree
make_tree (tree
, rtx
);
3856 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3859 Such modified types already made are recorded so that duplicates
3862 extern tree
build_type_attribute_variant (tree
, tree
);
3863 extern tree
build_decl_attribute_variant (tree
, tree
);
3864 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
3866 /* Remove redundant "omp declare simd" attributes from fndecl. */
3867 extern void omp_remove_redundant_declare_simd_attrs (tree
);
3869 /* Return 0 if the attributes for two types are incompatible, 1 if they
3870 are compatible, and 2 if they are nearly compatible (which causes a
3871 warning to be generated). */
3872 extern int comp_type_attributes (const_tree
, const_tree
);
3874 /* Default versions of target-overridable functions. */
3875 extern tree
merge_decl_attributes (tree
, tree
);
3876 extern tree
merge_type_attributes (tree
, tree
);
3878 /* This function is a private implementation detail of lookup_attribute()
3879 and you should never call it directly. */
3880 extern tree
private_lookup_attribute (const char *, size_t, tree
);
3882 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3883 return a pointer to the attribute's list element if the attribute
3884 is part of the list, or NULL_TREE if not found. If the attribute
3885 appears more than once, this only returns the first occurrence; the
3886 TREE_CHAIN of the return value should be passed back in if further
3887 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3891 lookup_attribute (const char *attr_name
, tree list
)
3893 gcc_checking_assert (attr_name
[0] != '_');
3894 /* In most cases, list is NULL_TREE. */
3895 if (list
== NULL_TREE
)
3898 /* Do the strlen() before calling the out-of-line implementation.
3899 In most cases attr_name is a string constant, and the compiler
3900 will optimize the strlen() away. */
3901 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
3904 /* This function is a private implementation detail of
3905 is_attribute_p() and you should never call it directly. */
3906 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
3908 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3909 if the identifier node is a valid attribute name for the string.
3910 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3911 be the identifier for 'text' or for '__text__'. */
3914 is_attribute_p (const char *attr_name
, const_tree ident
)
3916 gcc_checking_assert (attr_name
[0] != '_');
3917 /* Do the strlen() before calling the out-of-line implementation.
3918 In most cases attr_name is a string constant, and the compiler
3919 will optimize the strlen() away. */
3920 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
3923 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3924 modified list. ATTR_NAME must be in the form 'text' (not
3927 extern tree
remove_attribute (const char *, tree
);
3929 /* Given two attributes lists, return a list of their union. */
3931 extern tree
merge_attributes (tree
, tree
);
3933 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3934 /* Given two Windows decl attributes lists, possibly including
3935 dllimport, return a list of their union . */
3936 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3938 /* Handle a "dllimport" or "dllexport" attribute. */
3939 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3942 /* Check whether CAND is suitable to be returned from get_qualified_type
3943 (BASE, TYPE_QUALS). */
3945 extern bool check_qualified_type (const_tree
, const_tree
, int);
3947 /* Return a version of the TYPE, qualified as indicated by the
3948 TYPE_QUALS, if one exists. If no qualified version exists yet,
3949 return NULL_TREE. */
3951 extern tree
get_qualified_type (tree
, int);
3953 /* Like get_qualified_type, but creates the type if it does not
3954 exist. This function never returns NULL_TREE. */
3956 extern tree
build_qualified_type (tree
, int);
3958 /* Create a variant of type T with alignment ALIGN. */
3960 extern tree
build_aligned_type (tree
, unsigned int);
3962 /* Like build_qualified_type, but only deals with the `const' and
3963 `volatile' qualifiers. This interface is retained for backwards
3964 compatibility with the various front-ends; new code should use
3965 build_qualified_type instead. */
3967 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3968 build_qualified_type ((TYPE), \
3969 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3970 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3972 /* Make a copy of a type node. */
3974 extern tree
build_distinct_type_copy (tree
);
3975 extern tree
build_variant_type_copy (tree
);
3977 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3978 fields. Optionally specify an alignment, and then lay it out. */
3980 extern void finish_builtin_struct (tree
, const char *,
3983 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3984 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3985 node, does nothing except for the first time. */
3987 extern void layout_type (tree
);
3989 extern record_layout_info
start_record_layout (tree
);
3990 extern tree
bit_from_pos (tree
, tree
);
3991 extern tree
byte_from_pos (tree
, tree
);
3992 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
3993 extern void normalize_offset (tree
*, tree
*, unsigned int);
3994 extern tree
rli_size_unit_so_far (record_layout_info
);
3995 extern tree
rli_size_so_far (record_layout_info
);
3996 extern void normalize_rli (record_layout_info
);
3997 extern void place_field (record_layout_info
, tree
);
3998 extern void compute_record_mode (tree
);
3999 extern void finish_record_layout (record_layout_info
, int);
4001 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4002 return a canonicalized ..._TYPE node, so that duplicates are not made.
4003 How the hash code is computed is up to the caller, as long as any two
4004 callers that could hash identical-looking type nodes agree. */
4006 extern tree
type_hash_canon (unsigned int, tree
);
4008 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4009 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4010 fields. Call this only once for any given decl node.
4012 Second argument is the boundary that this field can be assumed to
4013 be starting at (in bits). Zero means it can be assumed aligned
4014 on any boundary that may be needed. */
4016 extern void layout_decl (tree
, unsigned);
4018 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4019 a previous call to layout_decl and calls it again. */
4021 extern void relayout_decl (tree
);
4023 /* Return the mode for data of a given size SIZE and mode class CLASS.
4024 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4025 The value is BLKmode if no other mode is found. This is like
4026 mode_for_size, but is passed a tree. */
4028 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4030 /* Return an expr equal to X but certainly not valid as an lvalue. */
4032 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4033 extern tree
non_lvalue_loc (location_t
, tree
);
4035 extern tree
convert (tree
, tree
);
4036 extern unsigned int expr_align (const_tree
);
4037 extern tree
expr_first (tree
);
4038 extern tree
expr_last (tree
);
4039 extern tree
size_in_bytes (const_tree
);
4040 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4041 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4042 extern tree
tree_expr_size (const_tree
);
4043 extern tree
bit_position (const_tree
);
4044 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4045 extern tree
byte_position (const_tree
);
4046 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4048 #define sizetype sizetype_tab[(int) stk_sizetype]
4049 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4050 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4051 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4053 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4054 #define size_binop(CODE,T1,T2)\
4055 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4056 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4057 #define size_diffop(T1,T2)\
4058 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4059 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4061 #define size_int(L) size_int_kind (L, stk_sizetype)
4062 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4063 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4064 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4066 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4067 extern tree
round_up_loc (location_t
, tree
, int);
4068 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4069 extern tree
round_down_loc (location_t
, tree
, int);
4070 extern void finalize_size_functions (void);
4072 /* Type for sizes of data-type. */
4074 #define BITS_PER_UNIT_LOG \
4075 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4076 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4077 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4079 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4080 by making the last node in X point to Y.
4081 Returns X, except if X is 0 returns Y. */
4083 extern tree
chainon (tree
, tree
);
4085 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4087 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4088 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4090 /* Return the last tree node in a chain. */
4092 extern tree
tree_last (tree
);
4094 /* Reverse the order of elements in a chain, and return the new head. */
4096 extern tree
nreverse (tree
);
4098 /* Returns the length of a chain of nodes
4099 (number of chain pointers to follow before reaching a null pointer). */
4101 extern int list_length (const_tree
);
4103 /* Returns the number of FIELD_DECLs in a type. */
4105 extern int fields_length (const_tree
);
4107 /* Returns the first FIELD_DECL in a type. */
4109 extern tree
first_field (const_tree
);
4111 /* Given an initializer INIT, return TRUE if INIT is zero or some
4112 aggregate of zeros. Otherwise return FALSE. */
4114 extern bool initializer_zerop (const_tree
);
4116 /* Given a vector VEC, return its first element if all elements are
4117 the same. Otherwise return NULL_TREE. */
4119 extern tree
uniform_vector_p (const_tree
);
4121 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4123 extern vec
<tree
, va_gc
> *ctor_to_vec (tree
);
4125 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
4126 HOST_WIDE_INT
*, bool *);
4128 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4130 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4132 extern int integer_zerop (const_tree
);
4134 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4136 extern int integer_onep (const_tree
);
4138 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4139 all of whose significant bits are 1. */
4141 extern int integer_all_onesp (const_tree
);
4143 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4146 extern int integer_minus_onep (const_tree
);
4148 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4149 exactly one bit 1. */
4151 extern int integer_pow2p (const_tree
);
4153 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4154 with a nonzero value. */
4156 extern int integer_nonzerop (const_tree
);
4158 extern tree
num_ending_zeros (const_tree
);
4160 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4163 extern int fixed_zerop (const_tree
);
4165 /* staticp (tree x) is nonzero if X is a reference to data allocated
4166 at a fixed address in memory. Returns the outermost data. */
4168 extern tree
staticp (tree
);
4170 /* save_expr (EXP) returns an expression equivalent to EXP
4171 but it can be used multiple times within context CTX
4172 and only evaluate EXP once. */
4174 extern tree
save_expr (tree
);
4176 /* Look inside EXPR into any simple arithmetic operations. Return the
4177 outermost non-arithmetic or non-invariant node. */
4179 extern tree
skip_simple_arithmetic (tree
);
4181 /* Look inside EXPR into simple arithmetic operations involving constants.
4182 Return the outermost non-arithmetic or non-constant node. */
4184 extern tree
skip_simple_constant_arithmetic (tree
);
4186 /* Return which tree structure is used by T. */
4188 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4190 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4191 size or offset that depends on a field within a record. */
4193 extern bool contains_placeholder_p (const_tree
);
4195 /* This macro calls the above function but short-circuits the common
4196 case of a constant to save time. Also check for null. */
4198 #define CONTAINS_PLACEHOLDER_P(EXP) \
4199 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4201 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4202 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4205 extern bool type_contains_placeholder_p (tree
);
4207 /* Given a tree EXP, find all occurrences of references to fields
4208 in a PLACEHOLDER_EXPR and place them in vector REFS without
4209 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4210 we assume here that EXP contains only arithmetic expressions
4211 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4214 extern void find_placeholder_in_expr (tree
, vec
<tree
> *);
4216 /* This macro calls the above function but short-circuits the common
4217 case of a constant to save time and also checks for NULL. */
4219 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4221 if((EXP) && !TREE_CONSTANT (EXP)) \
4222 find_placeholder_in_expr (EXP, V); \
4225 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4226 return a tree with all occurrences of references to F in a
4227 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4228 CONST_DECLs. Note that we assume here that EXP contains only
4229 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4230 occurring only in their argument list. */
4232 extern tree
substitute_in_expr (tree
, tree
, tree
);
4234 /* This macro calls the above function but short-circuits the common
4235 case of a constant to save time and also checks for NULL. */
4237 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4238 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4240 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4241 for it within OBJ, a tree that is an object or a chain of references. */
4243 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4245 /* This macro calls the above function but short-circuits the common
4246 case of a constant to save time and also checks for NULL. */
4248 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4249 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4250 : substitute_placeholder_in_expr (EXP, OBJ))
4252 /* variable_size (EXP) is like save_expr (EXP) except that it
4253 is for the special case of something that is part of a
4254 variable size for a data type. It makes special arrangements
4255 to compute the value at the right time when the data type
4256 belongs to a function parameter. */
4258 extern tree
variable_size (tree
);
4260 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4261 but it can be used multiple times
4262 and only evaluate the subexpressions once. */
4264 extern tree
stabilize_reference (tree
);
4266 /* Subroutine of stabilize_reference; this is called for subtrees of
4267 references. Any expression with side-effects must be put in a SAVE_EXPR
4268 to ensure that it is only evaluated once. */
4270 extern tree
stabilize_reference_1 (tree
);
4272 /* Return EXP, stripped of any conversions to wider types
4273 in such a way that the result of converting to type FOR_TYPE
4274 is the same as if EXP were converted to FOR_TYPE.
4275 If FOR_TYPE is 0, it signifies EXP's type. */
4277 extern tree
get_unwidened (tree
, tree
);
4279 /* Return OP or a simpler expression for a narrower value
4280 which can be sign-extended or zero-extended to give back OP.
4281 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4282 or 0 if the value should be sign-extended. */
4284 extern tree
get_narrower (tree
, int *);
4286 /* Return true if T is an expression that get_inner_reference handles. */
4289 handled_component_p (const_tree t
)
4291 switch (TREE_CODE (t
))
4296 case ARRAY_RANGE_REF
:
4299 case VIEW_CONVERT_EXPR
:
4307 /* Given an expression EXP that is a handled_component_p,
4308 look for the ultimate containing object, which is returned and specify
4309 the access position and size. */
4311 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4312 tree
*, enum machine_mode
*, int *, int *,
4315 /* Return a tree of sizetype representing the size, in bytes, of the element
4316 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4318 extern tree
array_ref_element_size (tree
);
4320 bool array_at_struct_end_p (tree
);
4322 /* Return a tree representing the lower bound of the array mentioned in
4323 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4325 extern tree
array_ref_low_bound (tree
);
4327 /* Return a tree representing the upper bound of the array mentioned in
4328 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4330 extern tree
array_ref_up_bound (tree
);
4332 /* Return a tree representing the offset, in bytes, of the field referenced
4333 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4335 extern tree
component_ref_field_offset (tree
);
4337 /* Given a DECL or TYPE, return the scope in which it was declared, or
4338 NUL_TREE if there is no containing scope. */
4340 extern tree
get_containing_scope (const_tree
);
4342 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4344 extern tree
decl_function_context (const_tree
);
4346 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4347 this _DECL with its context, or zero if none. */
4348 extern tree
decl_type_context (const_tree
);
4350 /* Return 1 if EXPR is the real constant zero. */
4351 extern int real_zerop (const_tree
);
4353 /* Initialize the iterator I with arguments from function FNDECL */
4356 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4358 i
->next
= TYPE_ARG_TYPES (fntype
);
4361 /* Return a pointer that holds the next argument if there are more arguments to
4362 handle, otherwise return NULL. */
4364 static inline tree
*
4365 function_args_iter_cond_ptr (function_args_iterator
*i
)
4367 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4370 /* Return the next argument if there are more arguments to handle, otherwise
4374 function_args_iter_cond (function_args_iterator
*i
)
4376 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4379 /* Advance to the next argument. */
4381 function_args_iter_next (function_args_iterator
*i
)
4383 gcc_assert (i
->next
!= NULL_TREE
);
4384 i
->next
= TREE_CHAIN (i
->next
);
4387 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4390 inlined_function_outer_scope_p (const_tree block
)
4392 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block
)) != UNKNOWN_LOCATION
;
4395 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4396 to point to the next tree element. ITER is an instance of
4397 function_args_iterator used to iterate the arguments. */
4398 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4399 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4400 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4401 function_args_iter_next (&(ITER)))
4403 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4404 to the next tree element. ITER is an instance of function_args_iterator
4405 used to iterate the arguments. */
4406 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4407 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4408 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4409 function_args_iter_next (&(ITER)))
4414 extern unsigned crc32_string (unsigned, const char *);
4415 extern unsigned crc32_byte (unsigned, char);
4416 extern unsigned crc32_unsigned (unsigned, unsigned);
4417 extern void clean_symbol_name (char *);
4418 extern tree
get_file_function_name (const char *);
4419 extern tree
get_callee_fndecl (const_tree
);
4420 extern int type_num_arguments (const_tree
);
4421 extern bool associative_tree_code (enum tree_code
);
4422 extern bool commutative_tree_code (enum tree_code
);
4423 extern bool commutative_ternary_tree_code (enum tree_code
);
4424 extern tree
upper_bound_in_type (tree
, tree
);
4425 extern tree
lower_bound_in_type (tree
, tree
);
4426 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4427 extern tree
create_artificial_label (location_t
);
4428 extern const char *get_name (tree
);
4429 extern bool stdarg_p (const_tree
);
4430 extern bool prototype_p (tree
);
4431 extern bool is_typedef_decl (tree x
);
4432 extern bool typedef_variant_p (tree
);
4433 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4434 extern tree
build_low_bits_mask (tree
, unsigned);
4435 extern tree
tree_strip_nop_conversions (tree
);
4436 extern tree
tree_strip_sign_nop_conversions (tree
);
4437 extern const_tree
strip_invariant_refs (const_tree
);
4438 extern tree
lhd_gcc_personality (void);
4439 extern void assign_assembler_name_if_neeeded (tree
);
4440 extern void warn_deprecated_use (tree
, tree
);
4441 extern void cache_integer_cst (tree
);
4445 extern void change_decl_assembler_name (tree
, tree
);
4448 extern tree
unshare_expr (tree
);
4449 extern tree
unshare_expr_without_location (tree
);
4453 extern void expand_label (tree
);
4454 extern void expand_goto (tree
);
4456 extern rtx
expand_stack_save (void);
4457 extern void expand_stack_restore (tree
);
4458 extern void expand_return (tree
);
4460 /* Compare and hash for any structure which begins with a canonical
4461 pointer. Assumes all pointers are interchangeable, which is sort
4462 of already assumed by gcc elsewhere IIRC. */
4465 struct_ptr_eq (const void *a
, const void *b
)
4467 const void * const * x
= (const void * const *) a
;
4468 const void * const * y
= (const void * const *) b
;
4472 static inline hashval_t
4473 struct_ptr_hash (const void *a
)
4475 const void * const * x
= (const void * const *) a
;
4476 return (intptr_t)*x
>> 4;
4479 /* In fold-const.c */
4481 /* Non-zero if we are folding constants inside an initializer; zero
4483 extern int folding_initializer
;
4485 /* Convert between trees and native memory representation. */
4486 extern int native_encode_expr (const_tree
, unsigned char *, int);
4487 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4489 /* Fold constants as much as possible in an expression.
4490 Returns the simplified expression.
4491 Acts only on the top level of the expression;
4492 if the argument itself cannot be simplified, its
4493 subexpressions are not changed. */
4495 extern tree
fold (tree
);
4496 #define fold_unary(CODE,T1,T2)\
4497 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4498 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
4499 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4500 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4501 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
4502 #define fold_binary(CODE,T1,T2,T3)\
4503 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4504 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4505 #define fold_ternary(CODE,T1,T2,T3,T4)\
4506 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4507 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4508 #define fold_build1(c,t1,t2)\
4509 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4510 #define fold_build1_loc(l,c,t1,t2)\
4511 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4512 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
4513 tree MEM_STAT_DECL
);
4514 #define fold_build2(c,t1,t2,t3)\
4515 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4516 #define fold_build2_loc(l,c,t1,t2,t3)\
4517 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4518 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
4519 tree MEM_STAT_DECL
);
4520 #define fold_build3(c,t1,t2,t3,t4)\
4521 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4522 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4523 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4524 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
4525 tree MEM_STAT_DECL
);
4526 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
4527 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4528 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4529 #define fold_build_call_array(T1,T2,N,T4)\
4530 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4531 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
4532 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4533 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4534 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
4535 extern bool fold_convertible_p (const_tree
, const_tree
);
4536 #define fold_convert(T1,T2)\
4537 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
4538 extern tree
fold_convert_loc (location_t
, tree
, tree
);
4539 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
4540 extern tree
fold_ignored_result (tree
);
4541 extern tree
fold_abs_const (tree
, tree
);
4542 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
4543 extern void fold_defer_overflow_warnings (void);
4544 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4545 extern void fold_undefer_and_ignore_overflow_warnings (void);
4546 extern bool fold_deferring_overflow_warnings_p (void);
4547 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
4548 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4549 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4550 #define omit_one_operand(T1,T2,T3)\
4551 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4552 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
4553 #define omit_two_operands(T1,T2,T3,T4)\
4554 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4555 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
4556 #define invert_truthvalue(T)\
4557 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
4558 extern tree
invert_truthvalue_loc (location_t
, tree
);
4559 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4560 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4561 extern tree
fold_read_from_constant_string (tree
);
4562 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
4563 #define build_fold_addr_expr(T)\
4564 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4565 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
4566 #define build_fold_addr_expr_with_type(T,TYPE)\
4567 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4568 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
4569 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4570 extern tree
fold_strip_sign_ops (tree
);
4571 #define build_fold_indirect_ref(T)\
4572 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4573 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
4574 #define fold_indirect_ref(T)\
4575 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4576 extern tree
fold_indirect_ref_loc (location_t
, tree
);
4577 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
4578 #define build_simple_mem_ref(T)\
4579 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4580 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
4581 extern tree
constant_boolean_node (bool, tree
);
4582 extern tree
div_if_zero_remainder (const_tree
, const_tree
);
4584 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4585 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4587 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4588 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4590 extern bool tree_expr_nonzero_p (tree
);
4591 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4592 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4594 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4595 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4596 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4598 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4599 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4600 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4602 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4604 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4605 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
4606 enum tree_code
, tree
, tree
, tree
);
4607 extern void debug_fold_checksum (const_tree
);
4609 /* Return nonzero if CODE is a tree code that represents a truth value. */
4611 truth_value_p (enum tree_code code
)
4613 return (TREE_CODE_CLASS (code
) == tcc_comparison
4614 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4615 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4616 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4619 /* Return whether TYPE is a type suitable for an offset for
4620 a POINTER_PLUS_EXPR. */
4622 ptrofftype_p (tree type
)
4624 return (INTEGRAL_TYPE_P (type
)
4625 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
4626 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
4629 /* Return OFF converted to a pointer offset type suitable as offset for
4630 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4632 convert_to_ptrofftype_loc (location_t loc
, tree off
)
4634 return fold_convert_loc (loc
, sizetype
, off
);
4636 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4638 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4640 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
4642 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4643 ptr
, fold_convert_loc (loc
, sizetype
, off
));
4645 #define fold_build_pointer_plus(p,o) \
4646 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4648 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4650 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
4652 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
4653 ptr
, size_int (off
));
4655 #define fold_build_pointer_plus_hwi(p,o) \
4656 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4660 /* Non-zero if __builtin_constant_p should be folded right away. */
4661 extern bool force_folding_builtin_constant_p
;
4663 extern bool avoid_folding_inline_builtin (tree
);
4664 extern tree
fold_call_expr (location_t
, tree
, bool);
4665 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
4666 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
4667 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
4668 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
4669 enum built_in_function
);
4670 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4671 enum built_in_function
);
4672 extern tree
fold_builtin_stxncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
4673 enum built_in_function
);
4674 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
4675 extern bool fold_builtin_next_arg (tree
, bool);
4676 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4677 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
4678 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
4679 extern tree
build_call_expr_loc_vec (location_t
, tree
, vec
<tree
, va_gc
> *);
4680 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
4681 extern tree
build_call_expr (tree
, int, ...);
4682 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4683 extern tree
c_strlen (tree
, int);
4684 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
4685 extern tree
build_va_arg_indirect_ref (tree
);
4686 extern tree
build_string_literal (int, const char *);
4687 extern bool validate_arglist (const_tree
, ...);
4688 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4689 extern bool is_builtin_fn (tree
);
4690 extern bool get_object_alignment_1 (tree
, unsigned int *,
4691 unsigned HOST_WIDE_INT
*);
4692 extern unsigned int get_object_alignment (tree
);
4693 extern bool get_pointer_alignment_1 (tree
, unsigned int *,
4694 unsigned HOST_WIDE_INT
*);
4695 extern unsigned int get_pointer_alignment (tree
);
4696 extern tree
fold_call_stmt (gimple
, bool);
4697 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4698 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
4699 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
4700 tree
*, tree
*, int *, bool *);
4701 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
4702 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
4704 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
4705 extern bool is_simple_builtin (tree
);
4706 extern bool is_inexpensive_builtin (tree
);
4709 extern tree
strip_float_extensions (tree
);
4712 extern int really_constant_p (const_tree
);
4713 extern bool decl_address_invariant_p (const_tree
);
4714 extern bool decl_address_ip_invariant_p (const_tree
);
4715 extern bool int_fits_type_p (const_tree
, const_tree
);
4716 #ifndef GENERATOR_FILE
4717 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4719 extern bool variably_modified_type_p (tree
, tree
);
4720 extern int tree_log2 (const_tree
);
4721 extern int tree_floor_log2 (const_tree
);
4722 extern int simple_cst_equal (const_tree
, const_tree
);
4723 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4724 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4725 const_tree
, hashval_t
);
4726 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4727 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4728 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
4729 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4730 extern int type_list_equal (const_tree
, const_tree
);
4731 extern int chain_member (const_tree
, const_tree
);
4732 extern int simple_cst_list_equal (const_tree
, const_tree
);
4733 extern void dump_tree_statistics (void);
4734 extern void recompute_tree_invariant_for_addr_expr (tree
);
4735 extern bool needs_to_live_in_memory (const_tree
);
4736 extern tree
reconstruct_complex_type (tree
, tree
);
4738 extern int real_onep (const_tree
);
4739 extern int real_twop (const_tree
);
4740 extern int real_minus_onep (const_tree
);
4741 extern void init_ttree (void);
4742 extern void build_common_tree_nodes (bool, bool);
4743 extern void build_common_builtin_nodes (void);
4744 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4745 extern tree
build_range_type (tree
, tree
, tree
);
4746 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
4747 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4748 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4749 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4751 extern tree
tree_block (tree
);
4752 extern void tree_set_block (tree
, tree
);
4753 extern location_t
*block_nonartificial_location (tree
);
4754 extern location_t
tree_nonartificial_location (tree
);
4756 extern tree
block_ultimate_origin (const_tree
);
4758 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
4759 extern bool virtual_method_call_p (tree
);
4760 extern tree
obj_type_ref_class (tree ref
);
4761 extern bool types_same_for_odr (tree type1
, tree type2
);
4762 extern bool contains_bitfld_component_ref_p (const_tree
);
4763 extern bool type_in_anonymous_namespace_p (tree
);
4764 extern bool block_may_fallthru (const_tree
);
4765 extern void using_eh_for_cleanups (void);
4766 extern bool using_eh_for_cleanups_p (void);
4768 extern const char *get_tree_code_name (enum tree_code
);
4770 /* In tree-nested.c */
4771 extern tree
build_addr (tree
, tree
);
4774 extern void expand_main_function (void);
4775 extern void expand_function_end (void);
4776 extern void expand_function_start (tree
);
4777 extern void stack_protect_prologue (void);
4778 extern void stack_protect_epilogue (void);
4779 extern void init_dummy_function_start (void);
4780 extern void expand_dummy_function_end (void);
4781 extern void allocate_struct_function (tree
, bool);
4782 extern void push_struct_function (tree fndecl
);
4783 extern void init_function_start (tree
);
4784 extern bool use_register_for_decl (const_tree
);
4785 extern void generate_setjmp_warnings (void);
4786 extern void init_temp_slots (void);
4787 extern void free_temp_slots (void);
4788 extern void pop_temp_slots (void);
4789 extern void push_temp_slots (void);
4790 extern void preserve_temp_slots (rtx
);
4791 extern int aggregate_value_p (const_tree
, const_tree
);
4792 extern void push_function_context (void);
4793 extern void pop_function_context (void);
4794 extern gimple_seq
gimplify_parameters (void);
4796 /* In print-rtl.c */
4798 extern void print_rtl (FILE *, const_rtx
);
4801 /* In print-tree.c */
4802 extern void debug_tree (tree
);
4803 extern void debug_raw (const tree_node
&ref
);
4804 extern void debug_raw (const tree_node
*ptr
);
4805 extern void debug (const tree_node
&ref
);
4806 extern void debug (const tree_node
*ptr
);
4807 extern void debug_verbose (const tree_node
&ref
);
4808 extern void debug_verbose (const tree_node
*ptr
);
4809 extern void debug_head (const tree_node
&ref
);
4810 extern void debug_head (const tree_node
*ptr
);
4811 extern void debug_body (const tree_node
&ref
);
4812 extern void debug_body (const tree_node
*ptr
);
4813 extern void debug_vec_tree (vec
<tree
, va_gc
> *);
4814 extern void debug (vec
<tree
, va_gc
> &ref
);
4815 extern void debug (vec
<tree
, va_gc
> *ptr
);
4816 extern void debug_raw (vec
<tree
, va_gc
> &ref
);
4817 extern void debug_raw (vec
<tree
, va_gc
> *ptr
);
4819 extern void dump_addr (FILE*, const char *, const void *);
4820 extern void print_node (FILE *, const char *, tree
, int);
4821 extern void print_vec_tree (FILE *, const char *, vec
<tree
, va_gc
> *, int);
4822 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4823 extern void indent_to (FILE *, int);
4826 /* In tree-inline.c: */
4827 extern bool debug_find_tree (tree
, tree
);
4828 /* This is in tree-inline.c since the routine uses
4829 data structures from the inliner. */
4830 extern tree
build_duplicate_type (tree
);
4833 extern int flags_from_decl_or_type (const_tree
);
4834 extern int call_expr_flags (const_tree
);
4835 extern void set_call_expr_flags (tree
, int);
4837 extern int setjmp_call_p (const_tree
);
4838 extern bool gimple_alloca_call_p (const_gimple
);
4839 extern bool alloca_call_p (const_tree
);
4840 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4841 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4845 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
4846 extern const struct attribute_spec
*lookup_scoped_attribute_spec (const_tree
,
4849 extern void init_attributes (void);
4851 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4852 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4853 it should be modified in place; if a TYPE, a copy should be created
4854 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4855 information, in the form of a bitwise OR of flags in enum attribute_flags
4856 from tree.h. Depending on these flags, some attributes may be
4857 returned to be applied at a later stage (for example, to apply
4858 a decl attribute to the declaration rather than to its type). */
4859 extern tree
decl_attributes (tree
*, tree
, int);
4861 extern bool cxx11_attribute_p (const_tree
);
4863 extern tree
get_attribute_name (const_tree
);
4865 extern tree
get_attribute_namespace (const_tree
);
4867 extern void apply_tm_attr (tree
, tree
);
4869 /* In stor-layout.c */
4870 extern void set_min_and_max_values_for_integral_type (tree
, int, signop
);
4871 extern void fixup_signed_type (tree
);
4872 extern void internal_reference_types (void);
4873 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4876 extern tree
tree_output_constant_def (tree
);
4877 extern void make_decl_rtl (tree
);
4878 extern rtx
make_decl_rtl_for_debug (tree
);
4879 extern void make_decl_one_only (tree
, tree
);
4880 extern int supports_one_only (void);
4881 extern void resolve_unique_section (tree
, int, int);
4882 extern void mark_referenced (tree
);
4883 extern void mark_decl_referenced (tree
);
4884 extern void notice_global_symbol (tree
);
4885 extern void set_user_assembler_name (tree
, const char *);
4886 extern void process_pending_assemble_externals (void);
4887 extern bool decl_replaceable_p (tree
);
4888 extern bool decl_binds_to_current_def_p (tree
);
4889 extern enum tls_model
decl_default_tls_model (const_tree
);
4891 /* Declare DECL to be a weak symbol. */
4892 extern void declare_weak (tree
);
4893 /* Merge weak status. */
4894 extern void merge_weak (tree
, tree
);
4895 /* Make one symbol an alias for another. */
4896 extern void assemble_alias (tree
, tree
);
4898 /* Return nonzero if VALUE is a valid constant-valued expression
4899 for use in initializing a static variable; one that can be an
4900 element of a "constant" initializer.
4902 Return null_pointer_node if the value is absolute;
4903 if it is relocatable, return the variable that determines the relocation.
4904 We assume that VALUE has been folded as much as possible;
4905 therefore, we do not need to check for such things as
4906 arithmetic-combinations of integers. */
4907 extern tree
initializer_constant_valid_p (tree
, tree
);
4909 /* Return true if VALUE is a valid constant-valued expression
4910 for use in initializing a static bit-field; one that can be
4911 an element of a "constant" initializer. */
4912 extern bool initializer_constant_valid_for_bitfield_p (tree
);
4914 /* Whether a constructor CTOR is a valid static constant initializer if all
4915 its elements are. This used to be internal to initializer_constant_valid_p
4916 and has been exposed to let other functions like categorize_ctor_elements
4917 evaluate the property while walking a constructor for other purposes. */
4919 extern bool constructor_static_from_elts_p (const_tree
);
4922 extern void expand_computed_goto (tree
);
4923 extern bool parse_output_constraint (const char **, int, int, int,
4924 bool *, bool *, bool *);
4925 extern bool parse_input_constraint (const char **, int, int, int, int,
4926 const char * const *, bool *, bool *);
4927 extern void expand_asm_stmt (gimple
);
4928 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
4930 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4931 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
4935 /* In tree-inline.c */
4937 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
4939 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
4941 #define walk_tree(a,b,c,d) \
4942 walk_tree_1 (a, b, c, d, NULL)
4943 #define walk_tree_without_duplicates(a,b,c) \
4944 walk_tree_without_duplicates_1 (a, b, c, NULL)
4947 /* Assign the RTX to declaration. */
4949 extern void set_decl_rtl (tree
, rtx
);
4950 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
4953 extern tree
get_base_address (tree t
);
4954 extern void mark_addressable (tree
);
4957 extern int tree_map_base_eq (const void *, const void *);
4958 extern unsigned int tree_map_base_hash (const void *);
4959 extern int tree_map_base_marked_p (const void *);
4960 extern bool list_equal_p (const_tree
, const_tree
);
4962 #define tree_map_eq tree_map_base_eq
4963 extern unsigned int tree_map_hash (const void *);
4964 #define tree_map_marked_p tree_map_base_marked_p
4966 #define tree_decl_map_eq tree_map_base_eq
4967 extern unsigned int tree_decl_map_hash (const void *);
4968 #define tree_decl_map_marked_p tree_map_base_marked_p
4970 #define tree_int_map_eq tree_map_base_eq
4971 #define tree_int_map_hash tree_map_base_hash
4972 #define tree_int_map_marked_p tree_map_base_marked_p
4974 #define tree_priority_map_eq tree_map_base_eq
4975 #define tree_priority_map_hash tree_map_base_hash
4976 #define tree_priority_map_marked_p tree_map_base_marked_p
4978 #define tree_vec_map_eq tree_map_base_eq
4979 #define tree_vec_map_hash tree_decl_map_hash
4980 #define tree_vec_map_marked_p tree_map_base_marked_p
4983 extern bool ssa_name_nonnegative_p (const_tree
);
4985 /* In tree-object-size.c. */
4986 extern void init_object_sizes (void);
4987 extern void fini_object_sizes (void);
4988 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
4992 /* Determine whether the LEN bytes can be moved by using several move
4993 instructions. Return nonzero if a call to move_by_pieces should
4995 extern int can_move_by_pieces (unsigned HOST_WIDE_INT
, unsigned int);
4997 /* Is it an ADDR_EXPR of a DECL that's not in memory? */
4998 extern bool addr_expr_of_non_mem_decl_p (tree
);
5000 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5001 extern tree
build_personality_function (const char *);
5003 /* In trans-mem.c. */
5004 extern tree
build_tm_abort_call (location_t
, bool);
5005 extern bool is_tm_safe (const_tree
);
5006 extern bool is_tm_pure (const_tree
);
5007 extern bool is_tm_may_cancel_outer (tree
);
5008 extern bool is_tm_ending_fndecl (tree
);
5009 extern void record_tm_replacement (tree
, tree
);
5010 extern void tm_malloc_replacement (tree
);
5013 is_tm_safe_or_pure (const_tree x
)
5015 return is_tm_safe (x
) || is_tm_pure (x
);
5018 /* In tree-inline.c. */
5020 void init_inline_once (void);
5022 /* Initialize the abstract argument list iterator object ITER with the
5023 arguments from CALL_EXPR node EXP. */
5025 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5028 iter
->n
= call_expr_nargs (exp
);
5033 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5036 iter
->n
= call_expr_nargs (exp
);
5040 /* Return the next argument from abstract argument list iterator object ITER,
5041 and advance its state. Return NULL_TREE if there are no more arguments. */
5043 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5046 if (iter
->i
>= iter
->n
)
5048 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5053 static inline const_tree
5054 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5057 if (iter
->i
>= iter
->n
)
5059 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5064 /* Initialize the abstract argument list iterator object ITER, then advance
5065 past and return the first argument. Useful in for expressions, e.g.
5066 for (arg = first_call_expr_arg (exp, &iter); arg;
5067 arg = next_call_expr_arg (&iter)) */
5069 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5071 init_call_expr_arg_iterator (exp
, iter
);
5072 return next_call_expr_arg (iter
);
5075 static inline const_tree
5076 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5078 init_const_call_expr_arg_iterator (exp
, iter
);
5079 return next_const_call_expr_arg (iter
);
5082 /* Test whether there are more arguments in abstract argument list iterator
5083 ITER, without changing its state. */
5085 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5087 return (iter
->i
< iter
->n
);
5091 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5093 return (iter
->i
< iter
->n
);
5096 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5097 (of type call_expr_arg_iterator) to hold the iteration state. */
5098 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5099 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5100 (arg) = next_call_expr_arg (&(iter)))
5102 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5103 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5104 (arg) = next_const_call_expr_arg (&(iter)))
5106 /* Return true if tree node T is a language-specific node. */
5108 is_lang_specific (tree t
)
5110 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5113 /* In vtable-verify.c. */
5114 extern void save_vtable_map_decl (tree
);
5116 /* Valid builtin number. */
5117 #define BUILTIN_VALID_P(FNCODE) \
5118 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
5120 /* Return the tree node for an explicit standard builtin function or NULL. */
5122 builtin_decl_explicit (enum built_in_function fncode
)
5124 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5126 return builtin_info
.decl
[(size_t)fncode
];
5129 /* Return the tree node for an implicit builtin function or NULL. */
5131 builtin_decl_implicit (enum built_in_function fncode
)
5133 size_t uns_fncode
= (size_t)fncode
;
5134 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5136 if (!builtin_info
.implicit_p
[uns_fncode
])
5139 return builtin_info
.decl
[uns_fncode
];
5142 /* Set explicit builtin function nodes and whether it is an implicit
5146 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
5148 size_t ufncode
= (size_t)fncode
;
5150 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5151 && (decl
!= NULL_TREE
|| !implicit_p
));
5153 builtin_info
.decl
[ufncode
] = decl
;
5154 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
5157 /* Set the implicit flag for a builtin function. */
5160 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
5162 size_t uns_fncode
= (size_t)fncode
;
5164 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
5165 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
5167 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
5170 /* Return whether the standard builtin function can be used as an explicit
5174 builtin_decl_explicit_p (enum built_in_function fncode
)
5176 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5177 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
5180 /* Return whether the standard builtin function can be used implicitly. */
5183 builtin_decl_implicit_p (enum built_in_function fncode
)
5185 size_t uns_fncode
= (size_t)fncode
;
5187 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
5188 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
5189 && builtin_info
.implicit_p
[uns_fncode
]);
5192 /* Return true if T (assumed to be a DECL) is a global variable.
5193 A variable is considered global if its storage is not automatic. */
5196 is_global_var (const_tree t
)
5198 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5201 /* Return true if VAR may be aliased. A variable is considered as
5202 maybe aliased if it has its address taken by the local TU
5203 or possibly by another TU and might be modified through a pointer. */
5206 may_be_aliased (const_tree var
)
5208 return (TREE_CODE (var
) != CONST_DECL
5209 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
5210 && TREE_READONLY (var
)
5211 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
5212 && (TREE_PUBLIC (var
)
5213 || DECL_EXTERNAL (var
)
5214 || TREE_ADDRESSABLE (var
)));
5217 /* For anonymous aggregate types, we need some sort of name to
5218 hold on to. In practice, this should not appear, but it should
5219 not be harmful if it does. */
5220 #ifndef NO_DOT_IN_LABEL
5221 #define ANON_AGGRNAME_FORMAT "._%d"
5222 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
5223 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5224 #else /* NO_DOT_IN_LABEL */
5225 #ifndef NO_DOLLAR_IN_LABEL
5226 #define ANON_AGGRNAME_FORMAT "$_%d"
5227 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
5228 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
5229 #else /* NO_DOLLAR_IN_LABEL */
5230 #define ANON_AGGRNAME_PREFIX "__anon_"
5231 #define ANON_AGGRNAME_P(ID_NODE) \
5232 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
5233 sizeof (ANON_AGGRNAME_PREFIX) - 1))
5234 #define ANON_AGGRNAME_FORMAT "__anon_%d"
5235 #endif /* NO_DOLLAR_IN_LABEL */
5236 #endif /* NO_DOT_IN_LABEL */
5238 /* The tree and const_tree overload templates. */
5242 struct int_traits
<const_tree
>
5244 static const enum precision_type precision_type
= VAR_PRECISION
;
5245 static const bool host_dependent_precision
= false;
5246 static const bool is_sign_extended
= false;
5247 static unsigned int get_precision (const_tree
);
5248 static wi::storage_ref
decompose (HOST_WIDE_INT
*, unsigned int,
5253 struct int_traits
<tree
> : public int_traits
<const_tree
> {};
5262 extended_tree (const_tree
);
5264 unsigned int get_precision () const;
5265 const HOST_WIDE_INT
*get_val () const;
5266 unsigned int get_len () const;
5271 struct int_traits
<extended_tree
<N
> >
5273 static const enum precision_type precision_type
= CONST_PRECISION
;
5274 static const bool host_dependent_precision
= false;
5275 static const bool is_sign_extended
= true;
5276 static const unsigned int precision
= N
;
5279 generic_wide_int
<extended_tree
<MAX_BITSIZE_MODE_ANY_INT
> >
5280 to_widest (const_tree
);
5282 generic_wide_int
<extended_tree
<ADDR_MAX_PRECISION
> > to_offset (const_tree
);
5286 wi::int_traits
<const_tree
>::get_precision (const_tree tcst
)
5288 return TYPE_PRECISION (TREE_TYPE (tcst
));
5291 /* Convert the tree_cst X into a wide_int of PRECISION. */
5292 inline wi::storage_ref
5293 wi::int_traits
<const_tree
>::decompose (HOST_WIDE_INT
*,
5294 unsigned int precision
, const_tree x
)
5296 return wi::storage_ref (&TREE_INT_CST_ELT (x
, 0), TREE_INT_CST_NUNITS (x
),
5300 inline generic_wide_int
<wi::extended_tree
<MAX_BITSIZE_MODE_ANY_INT
> >
5301 wi::to_widest (const_tree t
)
5306 inline generic_wide_int
<wi::extended_tree
<ADDR_MAX_PRECISION
> >
5307 wi::to_offset (const_tree t
)
5313 inline wi::extended_tree
<N
>::extended_tree (const_tree t
)
5316 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t
)) <= N
);
5321 wi::extended_tree
<N
>::get_precision () const
5327 inline const HOST_WIDE_INT
*
5328 wi::extended_tree
<N
>::get_val () const
5330 return &TREE_INT_CST_ELT (m_t
, 0);
5335 wi::extended_tree
<N
>::get_len () const
5337 if (N
== MAX_BITSIZE_MODE_ANY_INT
5338 || N
> TYPE_PRECISION (TREE_TYPE (m_t
)))
5339 return TREE_INT_CST_EXT_NUNITS (m_t
);
5341 return TREE_INT_CST_NUNITS (m_t
);
5346 template <typename T
>
5347 bool fits_to_tree_p (const T
&x
, const_tree
);
5349 wide_int
min_value (const_tree
);
5350 wide_int
max_value (const_tree
);
5351 wide_int
from_mpz (const_tree
, mpz_t
, bool);
5354 template <typename T
>
5356 wi::fits_to_tree_p (const T
&x
, const_tree type
)
5358 if (TYPE_SIGN (type
) == UNSIGNED
)
5359 return eq_p (x
, zext (x
, TYPE_PRECISION (type
)));
5361 return eq_p (x
, sext (x
, TYPE_PRECISION (type
)));
5364 /* Produce the smallest number that is represented in TYPE. The precision
5365 and sign are taken from TYPE. */
5367 wi::min_value (const_tree type
)
5369 return min_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5372 /* Produce the largest number that is represented in TYPE. The precision
5373 and sign are taken from TYPE. */
5375 wi::max_value (const_tree type
)
5377 return max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
5380 #endif /* GCC_TREE_H */