svn merge -r 217500:218679 svn+ssh://gcc.gnu.org/svn/gcc/trunk
[official-gcc.git] / gcc / tree.h
blob0e6e76891f3366724ab4baa2ab3cc1eaa96fc6f7
1 /* Definitions for the ubiquitous 'tree' type for GNU compilers.
2 Copyright (C) 1989-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #ifndef GCC_TREE_H
21 #define GCC_TREE_H
23 #include "tree-core.h"
24 #include "hash-set.h"
25 #include "wide-int.h"
26 #include "inchash.h"
28 /* These includes are required here because they provide declarations
29 used by inline functions in this file.
31 FIXME - Move these users elsewhere? */
32 #include "fold-const.h"
34 /* Macros for initializing `tree_contains_struct'. */
35 #define MARK_TS_BASE(C) \
36 do { \
37 tree_contains_struct[C][TS_BASE] = 1; \
38 } while (0)
40 #define MARK_TS_TYPED(C) \
41 do { \
42 MARK_TS_BASE (C); \
43 tree_contains_struct[C][TS_TYPED] = 1; \
44 } while (0)
46 #define MARK_TS_COMMON(C) \
47 do { \
48 MARK_TS_TYPED (C); \
49 tree_contains_struct[C][TS_COMMON] = 1; \
50 } while (0)
52 #define MARK_TS_TYPE_COMMON(C) \
53 do { \
54 MARK_TS_COMMON (C); \
55 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
56 } while (0)
58 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
59 do { \
60 MARK_TS_TYPE_COMMON (C); \
61 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
62 } while (0)
64 #define MARK_TS_DECL_MINIMAL(C) \
65 do { \
66 MARK_TS_COMMON (C); \
67 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
68 } while (0)
70 #define MARK_TS_DECL_COMMON(C) \
71 do { \
72 MARK_TS_DECL_MINIMAL (C); \
73 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
74 } while (0)
76 #define MARK_TS_DECL_WRTL(C) \
77 do { \
78 MARK_TS_DECL_COMMON (C); \
79 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
80 } while (0)
82 #define MARK_TS_DECL_WITH_VIS(C) \
83 do { \
84 MARK_TS_DECL_WRTL (C); \
85 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
86 } while (0)
88 #define MARK_TS_DECL_NON_COMMON(C) \
89 do { \
90 MARK_TS_DECL_WITH_VIS (C); \
91 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
92 } while (0)
95 /* Returns the string representing CLASS. */
97 #define TREE_CODE_CLASS_STRING(CLASS)\
98 tree_code_class_strings[(int) (CLASS)]
100 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
102 /* Nonzero if NODE represents an exceptional code. */
104 #define EXCEPTIONAL_CLASS_P(NODE)\
105 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
107 /* Nonzero if NODE represents a constant. */
109 #define CONSTANT_CLASS_P(NODE)\
110 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
112 /* Nonzero if NODE represents a type. */
114 #define TYPE_P(NODE)\
115 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_type)
117 /* Nonzero if NODE represents a declaration. */
119 #define DECL_P(NODE)\
120 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_declaration)
122 /* True if NODE designates a variable declaration. */
123 #define VAR_P(NODE) \
124 (TREE_CODE (NODE) == VAR_DECL)
126 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
128 #define VAR_OR_FUNCTION_DECL_P(DECL)\
129 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
131 /* Nonzero if NODE represents a INDIRECT_REF. Keep these checks in
132 ascending code order. */
134 #define INDIRECT_REF_P(NODE)\
135 (TREE_CODE (NODE) == INDIRECT_REF)
137 /* Nonzero if NODE represents a reference. */
139 #define REFERENCE_CLASS_P(NODE)\
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_reference)
142 /* Nonzero if NODE represents a comparison. */
144 #define COMPARISON_CLASS_P(NODE)\
145 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_comparison)
147 /* Nonzero if NODE represents a unary arithmetic expression. */
149 #define UNARY_CLASS_P(NODE)\
150 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_unary)
152 /* Nonzero if NODE represents a binary arithmetic expression. */
154 #define BINARY_CLASS_P(NODE)\
155 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_binary)
157 /* Nonzero if NODE represents a statement expression. */
159 #define STATEMENT_CLASS_P(NODE)\
160 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_statement)
162 /* Nonzero if NODE represents a function call-like expression with a
163 variable-length operand vector. */
165 #define VL_EXP_CLASS_P(NODE)\
166 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_vl_exp)
168 /* Nonzero if NODE represents any other expression. */
170 #define EXPRESSION_CLASS_P(NODE)\
171 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_expression)
173 /* Returns nonzero iff NODE represents a type or declaration. */
175 #define IS_TYPE_OR_DECL_P(NODE)\
176 (TYPE_P (NODE) || DECL_P (NODE))
178 /* Returns nonzero iff CLASS is the tree-code class of an
179 expression. */
181 #define IS_EXPR_CODE_CLASS(CLASS)\
182 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
184 /* Returns nonzero iff NODE is an expression of some kind. */
186 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
188 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
191 /* Helper macros for math builtins. */
193 #define BUILTIN_EXP10_P(FN) \
194 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
195 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
197 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
198 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
199 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
201 #define BUILTIN_SQRT_P(FN) \
202 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
204 #define BUILTIN_CBRT_P(FN) \
205 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
207 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
209 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
210 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
211 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL: case FN##IMAX
213 #define NULL_TREE (tree) NULL
215 /* Define accessors for the fields that all tree nodes have
216 (though some fields are not used for all kinds of nodes). */
218 /* The tree-code says what kind of node it is.
219 Codes are defined in tree.def. */
220 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
221 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
223 /* When checking is enabled, errors will be generated if a tree node
224 is accessed incorrectly. The macros die with a fatal error. */
225 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
227 #define TREE_CHECK(T, CODE) \
228 (tree_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
230 #define TREE_NOT_CHECK(T, CODE) \
231 (tree_not_check ((T), __FILE__, __LINE__, __FUNCTION__, (CODE)))
233 #define TREE_CHECK2(T, CODE1, CODE2) \
234 (tree_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
236 #define TREE_NOT_CHECK2(T, CODE1, CODE2) \
237 (tree_not_check2 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2)))
239 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) \
240 (tree_check3 ((T), __FILE__, __LINE__, __FUNCTION__, (CODE1), (CODE2), (CODE3)))
242 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) \
243 (tree_not_check3 ((T), __FILE__, __LINE__, __FUNCTION__, \
244 (CODE1), (CODE2), (CODE3)))
246 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
247 (tree_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
248 (CODE1), (CODE2), (CODE3), (CODE4)))
250 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) \
251 (tree_not_check4 ((T), __FILE__, __LINE__, __FUNCTION__, \
252 (CODE1), (CODE2), (CODE3), (CODE4)))
254 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
255 (tree_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
256 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
258 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) \
259 (tree_not_check5 ((T), __FILE__, __LINE__, __FUNCTION__, \
260 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5)))
262 #define CONTAINS_STRUCT_CHECK(T, STRUCT) \
263 (contains_struct_check ((T), (STRUCT), __FILE__, __LINE__, __FUNCTION__))
265 #define TREE_CLASS_CHECK(T, CLASS) \
266 (tree_class_check ((T), (CLASS), __FILE__, __LINE__, __FUNCTION__))
268 #define TREE_RANGE_CHECK(T, CODE1, CODE2) \
269 (tree_range_check ((T), (CODE1), (CODE2), __FILE__, __LINE__, __FUNCTION__))
271 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) \
272 (omp_clause_subcode_check ((T), (CODE), __FILE__, __LINE__, __FUNCTION__))
274 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) \
275 (omp_clause_range_check ((T), (CODE1), (CODE2), \
276 __FILE__, __LINE__, __FUNCTION__))
278 /* These checks have to be special cased. */
279 #define EXPR_CHECK(T) \
280 (expr_check ((T), __FILE__, __LINE__, __FUNCTION__))
282 /* These checks have to be special cased. */
283 #define NON_TYPE_CHECK(T) \
284 (non_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
286 /* These checks have to be special cased. */
287 #define ANY_INTEGRAL_TYPE_CHECK(T) \
288 (any_integral_type_check ((T), __FILE__, __LINE__, __FUNCTION__))
290 #define TREE_INT_CST_ELT_CHECK(T, I) \
291 (*tree_int_cst_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))
293 #define TREE_VEC_ELT_CHECK(T, I) \
294 (*(CONST_CAST2 (tree *, typeof (T)*, \
295 tree_vec_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
297 #define OMP_CLAUSE_ELT_CHECK(T, I) \
298 (*(omp_clause_elt_check ((T), (I), __FILE__, __LINE__, __FUNCTION__)))
300 /* Special checks for TREE_OPERANDs. */
301 #define TREE_OPERAND_CHECK(T, I) \
302 (*(CONST_CAST2 (tree*, typeof (T)*, \
303 tree_operand_check ((T), (I), __FILE__, __LINE__, __FUNCTION__))))
305 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) \
306 (*(tree_operand_check_code ((T), (CODE), (I), \
307 __FILE__, __LINE__, __FUNCTION__)))
309 /* Nodes are chained together for many purposes.
310 Types are chained together to record them for being output to the debugger
311 (see the function `chain_type').
312 Decls in the same scope are chained together to record the contents
313 of the scope.
314 Statement nodes for successive statements used to be chained together.
315 Often lists of things are represented by TREE_LIST nodes that
316 are chained together. */
318 #define TREE_CHAIN(NODE) \
319 (CONTAINS_STRUCT_CHECK (NODE, TS_COMMON)->common.chain)
321 /* In all nodes that are expressions, this is the data type of the expression.
322 In POINTER_TYPE nodes, this is the type that the pointer points to.
323 In ARRAY_TYPE nodes, this is the type of the elements.
324 In VECTOR_TYPE nodes, this is the type of the elements. */
325 #define TREE_TYPE(NODE) \
326 (CONTAINS_STRUCT_CHECK (NODE, TS_TYPED)->typed.type)
328 extern void tree_contains_struct_check_failed (const_tree,
329 const enum tree_node_structure_enum,
330 const char *, int, const char *)
331 ATTRIBUTE_NORETURN;
333 extern void tree_check_failed (const_tree, const char *, int, const char *,
334 ...) ATTRIBUTE_NORETURN;
335 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
336 ...) ATTRIBUTE_NORETURN;
337 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
338 const char *, int, const char *)
339 ATTRIBUTE_NORETURN;
340 extern void tree_range_check_failed (const_tree, const char *, int,
341 const char *, enum tree_code,
342 enum tree_code)
343 ATTRIBUTE_NORETURN;
344 extern void tree_not_class_check_failed (const_tree,
345 const enum tree_code_class,
346 const char *, int, const char *)
347 ATTRIBUTE_NORETURN;
348 extern void tree_int_cst_elt_check_failed (int, int, const char *,
349 int, const char *)
350 ATTRIBUTE_NORETURN;
351 extern void tree_vec_elt_check_failed (int, int, const char *,
352 int, const char *)
353 ATTRIBUTE_NORETURN;
354 extern void phi_node_elt_check_failed (int, int, const char *,
355 int, const char *)
356 ATTRIBUTE_NORETURN;
357 extern void tree_operand_check_failed (int, const_tree,
358 const char *, int, const char *)
359 ATTRIBUTE_NORETURN;
360 extern void omp_clause_check_failed (const_tree, const char *, int,
361 const char *, enum omp_clause_code)
362 ATTRIBUTE_NORETURN;
363 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
364 int, const char *)
365 ATTRIBUTE_NORETURN;
366 extern void omp_clause_range_check_failed (const_tree, const char *, int,
367 const char *, enum omp_clause_code,
368 enum omp_clause_code)
369 ATTRIBUTE_NORETURN;
371 #else /* not ENABLE_TREE_CHECKING, or not gcc */
373 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
374 #define TREE_CHECK(T, CODE) (T)
375 #define TREE_NOT_CHECK(T, CODE) (T)
376 #define TREE_CHECK2(T, CODE1, CODE2) (T)
377 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
378 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
379 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
380 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
381 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
382 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
383 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
384 #define TREE_CLASS_CHECK(T, CODE) (T)
385 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
386 #define EXPR_CHECK(T) (T)
387 #define NON_TYPE_CHECK(T) (T)
388 #define TREE_INT_CST_ELT_CHECK(T, I) ((T)->int_cst.val[I])
389 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
390 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
391 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
392 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
393 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
394 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
395 #define ANY_INTEGRAL_TYPE_CHECK(T) (T)
397 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
398 #define TREE_TYPE(NODE) ((NODE)->typed.type)
400 #endif
402 #define TREE_BLOCK(NODE) (tree_block (NODE))
403 #define TREE_SET_BLOCK(T, B) (tree_set_block ((T), (B)))
405 #include "tree-check.h"
407 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
408 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
409 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
410 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
411 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
412 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
413 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
414 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
415 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
416 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
417 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
419 #define RECORD_OR_UNION_CHECK(T) \
420 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
421 #define NOT_RECORD_OR_UNION_CHECK(T) \
422 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
424 #define NUMERICAL_TYPE_CHECK(T) \
425 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
426 FIXED_POINT_TYPE)
428 /* Here is how primitive or already-canonicalized types' hash codes
429 are made. */
430 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
432 /* A simple hash function for an arbitrary tree node. This must not be
433 used in hash tables which are saved to a PCH. */
434 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
436 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
437 #define CONVERT_EXPR_CODE_P(CODE) \
438 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
440 /* Similarly, but accept an expressions instead of a tree code. */
441 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
443 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
445 #define CASE_CONVERT \
446 case NOP_EXPR: \
447 case CONVERT_EXPR
449 /* Given an expression as a tree, strip any conversion that generates
450 no instruction. Accepts both tree and const_tree arguments since
451 we are not modifying the tree itself. */
453 #define STRIP_NOPS(EXP) \
454 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
456 /* Like STRIP_NOPS, but don't let the signedness change either. */
458 #define STRIP_SIGN_NOPS(EXP) \
459 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
461 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
463 #define STRIP_TYPE_NOPS(EXP) \
464 while ((CONVERT_EXPR_P (EXP) \
465 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
466 && TREE_OPERAND (EXP, 0) != error_mark_node \
467 && (TREE_TYPE (EXP) \
468 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
469 (EXP) = TREE_OPERAND (EXP, 0)
471 /* Remove unnecessary type conversions according to
472 tree_ssa_useless_type_conversion. */
474 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
475 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
477 /* Nonzero if TYPE represents a vector type. */
479 #define VECTOR_TYPE_P(TYPE) (TREE_CODE (TYPE) == VECTOR_TYPE)
481 /* Nonzero if TYPE represents an integral type. Note that we do not
482 include COMPLEX types here. Keep these checks in ascending code
483 order. */
485 #define INTEGRAL_TYPE_P(TYPE) \
486 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
487 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
488 || TREE_CODE (TYPE) == INTEGER_TYPE)
490 /* Nonzero if TYPE represents an integral type, including complex
491 and vector integer types. */
493 #define ANY_INTEGRAL_TYPE_P(TYPE) \
494 (INTEGRAL_TYPE_P (TYPE) \
495 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
496 || VECTOR_TYPE_P (TYPE)) \
497 && INTEGRAL_TYPE_P (TREE_TYPE (TYPE))))
499 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
501 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
502 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
504 /* Nonzero if TYPE represents a saturating fixed-point type. */
506 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
507 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
509 /* Nonzero if TYPE represents a fixed-point type. */
511 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
513 /* Nonzero if TYPE represents a scalar floating-point type. */
515 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
517 /* Nonzero if TYPE represents a complex floating-point type. */
519 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
520 (TREE_CODE (TYPE) == COMPLEX_TYPE \
521 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
523 /* Nonzero if TYPE represents a vector integer type. */
525 #define VECTOR_INTEGER_TYPE_P(TYPE) \
526 (VECTOR_TYPE_P (TYPE) \
527 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
530 /* Nonzero if TYPE represents a vector floating-point type. */
532 #define VECTOR_FLOAT_TYPE_P(TYPE) \
533 (VECTOR_TYPE_P (TYPE) \
534 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
536 /* Nonzero if TYPE represents a floating-point type, including complex
537 and vector floating-point types. The vector and complex check does
538 not use the previous two macros to enable early folding. */
540 #define FLOAT_TYPE_P(TYPE) \
541 (SCALAR_FLOAT_TYPE_P (TYPE) \
542 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
543 || VECTOR_TYPE_P (TYPE)) \
544 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
546 /* Nonzero if TYPE represents a decimal floating-point type. */
547 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
548 (SCALAR_FLOAT_TYPE_P (TYPE) \
549 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
551 /* Nonzero if TYPE is a record or union type. */
552 #define RECORD_OR_UNION_TYPE_P(TYPE) \
553 (TREE_CODE (TYPE) == RECORD_TYPE \
554 || TREE_CODE (TYPE) == UNION_TYPE \
555 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
557 /* Nonzero if TYPE represents an aggregate (multi-component) type.
558 Keep these checks in ascending code order. */
560 #define AGGREGATE_TYPE_P(TYPE) \
561 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
563 /* Nonzero if TYPE represents a pointer or reference type.
564 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
565 ascending code order. */
567 #define POINTER_TYPE_P(TYPE) \
568 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
570 /* Nonzero if TYPE represents a pointer to function. */
571 #define FUNCTION_POINTER_TYPE_P(TYPE) \
572 (POINTER_TYPE_P (TYPE) && TREE_CODE (TREE_TYPE (TYPE)) == FUNCTION_TYPE)
574 /* Nonzero if this type is a complete type. */
575 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
577 /* Nonzero if this type is a pointer bounds type. */
578 #define POINTER_BOUNDS_TYPE_P(NODE) \
579 (TREE_CODE (NODE) == POINTER_BOUNDS_TYPE)
581 /* Nonzero if this node has a pointer bounds type. */
582 #define POINTER_BOUNDS_P(NODE) \
583 (POINTER_BOUNDS_TYPE_P (TREE_TYPE (NODE)))
585 /* Nonzero if this type supposes bounds existence. */
586 #define BOUNDED_TYPE_P(type) (POINTER_TYPE_P (type))
588 /* Nonzero for objects with bounded type. */
589 #define BOUNDED_P(node) \
590 BOUNDED_TYPE_P (TREE_TYPE (node))
592 /* Nonzero if this type is the (possibly qualified) void type. */
593 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
595 /* Nonzero if this type is complete or is cv void. */
596 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
597 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
599 /* Nonzero if this type is complete or is an array with unspecified bound. */
600 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
601 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
603 /* Define many boolean fields that all tree nodes have. */
605 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
606 of this is needed. So it cannot be in a register.
607 In a FUNCTION_DECL it has no meaning.
608 In LABEL_DECL nodes, it means a goto for this label has been seen
609 from a place outside all binding contours that restore stack levels.
610 In an artificial SSA_NAME that points to a stack partition with at least
611 two variables, it means that at least one variable has TREE_ADDRESSABLE.
612 In ..._TYPE nodes, it means that objects of this type must be fully
613 addressable. This means that pieces of this object cannot go into
614 register parameters, for example. If this a function type, this
615 means that the value must be returned in memory.
616 In CONSTRUCTOR nodes, it means object constructed must be in memory.
617 In IDENTIFIER_NODEs, this means that some extern decl for this name
618 had its address taken. That matters for inline functions.
619 In a STMT_EXPR, it means we want the result of the enclosed expression. */
620 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
622 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
623 exit of a function. Calls for which this is true are candidates for tail
624 call optimizations. */
625 #define CALL_EXPR_TAILCALL(NODE) \
626 (CALL_EXPR_CHECK (NODE)->base.addressable_flag)
628 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
629 CASE_LOW operand has been processed. */
630 #define CASE_LOW_SEEN(NODE) \
631 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
633 #define PREDICT_EXPR_OUTCOME(NODE) \
634 ((enum prediction) (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag))
635 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
636 (PREDICT_EXPR_CHECK (NODE)->base.addressable_flag = (int) OUTCOME)
637 #define PREDICT_EXPR_PREDICTOR(NODE) \
638 ((enum br_predictor)tree_to_shwi (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0)))
640 /* In a VAR_DECL, nonzero means allocate static storage.
641 In a FUNCTION_DECL, nonzero if function has been defined.
642 In a CONSTRUCTOR, nonzero means allocate static storage. */
643 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
645 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
646 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
648 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
649 should only be executed if an exception is thrown, not on normal exit
650 of its scope. */
651 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
653 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
654 separate cleanup in honor_protect_cleanup_actions. */
655 #define TRY_CATCH_IS_CLEANUP(NODE) \
656 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
658 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
659 CASE_HIGH operand has been processed. */
660 #define CASE_HIGH_SEEN(NODE) \
661 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
663 /* Used to mark scoped enums. */
664 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
666 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
667 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
669 /* In an expr node (usually a conversion) this means the node was made
670 implicitly and should not lead to any sort of warning. In a decl node,
671 warnings concerning the decl should be suppressed. This is used at
672 least for used-before-set warnings, and it set after one warning is
673 emitted. */
674 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
676 /* Used to indicate that this TYPE represents a compiler-generated entity. */
677 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
679 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
680 this string as an argument. */
681 #define TREE_SYMBOL_REFERENCED(NODE) \
682 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
684 /* Nonzero in a pointer or reference type means the data pointed to
685 by this type can alias anything. */
686 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
687 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
689 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
690 there was an overflow in folding. */
692 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
694 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
696 #define TREE_OVERFLOW_P(EXPR) \
697 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
699 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
700 nonzero means name is to be accessible from outside this translation unit.
701 In an IDENTIFIER_NODE, nonzero means an external declaration
702 accessible from outside this translation unit was previously seen
703 for this name in an inner scope. */
704 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
706 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
707 of cached values, or is something else. */
708 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK (NODE)->base.public_flag)
710 /* In a SAVE_EXPR, indicates that the original expression has already
711 been substituted with a VAR_DECL that contains the value. */
712 #define SAVE_EXPR_RESOLVED_P(NODE) \
713 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
715 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
716 pack. */
717 #define CALL_EXPR_VA_ARG_PACK(NODE) \
718 (CALL_EXPR_CHECK (NODE)->base.public_flag)
720 /* In any expression, decl, or constant, nonzero means it has side effects or
721 reevaluation of the whole expression could produce a different value.
722 This is set if any subexpression is a function call, a side effect or a
723 reference to a volatile variable. In a ..._DECL, this is set only if the
724 declaration said `volatile'. This will never be set for a constant. */
725 #define TREE_SIDE_EFFECTS(NODE) \
726 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
728 /* In a LABEL_DECL, nonzero means this label had its address taken
729 and therefore can never be deleted and is a jump target for
730 computed gotos. */
731 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
733 /* Nonzero means this expression is volatile in the C sense:
734 its address should be of type `volatile WHATEVER *'.
735 In other words, the declared item is volatile qualified.
736 This is used in _DECL nodes and _REF nodes.
737 On a FUNCTION_DECL node, this means the function does not
738 return normally. This is the same effect as setting
739 the attribute noreturn on the function in C.
741 In a ..._TYPE node, means this type is volatile-qualified.
742 But use TYPE_VOLATILE instead of this macro when the node is a type,
743 because eventually we may make that a different bit.
745 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
746 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
748 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
749 accessing the memory pointed to won't generate a trap. However,
750 this only applies to an object when used appropriately: it doesn't
751 mean that writing a READONLY mem won't trap.
753 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
754 (or slice of the array) always belongs to the range of the array.
755 I.e. that the access will not trap, provided that the access to
756 the base to the array will not trap. */
757 #define TREE_THIS_NOTRAP(NODE) \
758 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
759 ARRAY_RANGE_REF)->base.nothrow_flag)
761 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
762 nonzero means it may not be the lhs of an assignment.
763 Nonzero in a FUNCTION_DECL means this function should be treated
764 as "const" function (can only read its arguments). */
765 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
767 /* Value of expression is constant. Always on in all ..._CST nodes. May
768 also appear in an expression or decl where the value is constant. */
769 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
771 /* Nonzero if NODE, a type, has had its sizes gimplified. */
772 #define TYPE_SIZES_GIMPLIFIED(NODE) \
773 (TYPE_CHECK (NODE)->base.constant_flag)
775 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
776 #define DECL_UNSIGNED(NODE) \
777 (DECL_COMMON_CHECK (NODE)->base.u.bits.unsigned_flag)
779 /* In integral and pointer types, means an unsigned type. */
780 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.u.bits.unsigned_flag)
782 /* Same as TYPE_UNSIGNED but converted to SIGNOP. */
783 #define TYPE_SIGN(NODE) ((signop) TYPE_UNSIGNED (NODE))
785 /* True if overflow wraps around for the given integral type. That
786 is, TYPE_MAX + 1 == TYPE_MIN. */
787 #define TYPE_OVERFLOW_WRAPS(TYPE) \
788 (ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag || flag_wrapv)
790 /* True if overflow is undefined for the given integral type. We may
791 optimize on the assumption that values in the type never overflow.
793 IMPORTANT NOTE: Any optimization based on TYPE_OVERFLOW_UNDEFINED
794 must issue a warning based on warn_strict_overflow. In some cases
795 it will be appropriate to issue the warning immediately, and in
796 other cases it will be appropriate to simply set a flag and let the
797 caller decide whether a warning is appropriate or not. */
798 #define TYPE_OVERFLOW_UNDEFINED(TYPE) \
799 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag \
800 && !flag_wrapv && !flag_trapv && flag_strict_overflow)
802 /* True if overflow for the given integral type should issue a
803 trap. */
804 #define TYPE_OVERFLOW_TRAPS(TYPE) \
805 (!ANY_INTEGRAL_TYPE_CHECK(TYPE)->base.u.bits.unsigned_flag && flag_trapv)
807 /* True if an overflow is to be preserved for sanitization. */
808 #define TYPE_OVERFLOW_SANITIZED(TYPE) \
809 (INTEGRAL_TYPE_P (TYPE) \
810 && !TYPE_OVERFLOW_WRAPS (TYPE) \
811 && (flag_sanitize & SANITIZE_SI_OVERFLOW))
813 /* True if pointer types have undefined overflow. */
814 #define POINTER_TYPE_OVERFLOW_UNDEFINED (flag_strict_overflow)
816 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
817 Nonzero in a FUNCTION_DECL means that the function has been compiled.
818 This is interesting in an inline function, since it might not need
819 to be compiled separately.
820 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE, ENUMERAL_TYPE
821 or TYPE_DECL if the debugging info for the type has been written.
822 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
823 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
824 PHI node. */
825 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
827 /* Nonzero in a _DECL if the name is used in its scope.
828 Nonzero in an expr node means inhibit warning if value is unused.
829 In IDENTIFIER_NODEs, this means that some extern decl for this name
830 was used.
831 In a BLOCK, this means that the block contains variables that are used. */
832 #define TREE_USED(NODE) ((NODE)->base.used_flag)
834 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
835 throw an exception. In a CALL_EXPR, nonzero means the call cannot
836 throw. We can't easily check the node type here as the C++
837 frontend also uses this flag (for AGGR_INIT_EXPR). */
838 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
840 /* In a CALL_EXPR, means that it's safe to use the target of the call
841 expansion as the return slot for a call that returns in memory. */
842 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
843 (CALL_EXPR_CHECK (NODE)->base.private_flag)
845 /* Cilk keywords accessors. */
846 #define CILK_SPAWN_FN(NODE) TREE_OPERAND (CILK_SPAWN_STMT_CHECK (NODE), 0)
848 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
849 passed by invisible reference (and the TREE_TYPE is a pointer to the true
850 type). */
851 #define DECL_BY_REFERENCE(NODE) \
852 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
853 RESULT_DECL)->decl_common.decl_by_reference_flag)
855 /* In VAR_DECL and PARM_DECL, set when the decl has been used except for
856 being set. */
857 #define DECL_READ_P(NODE) \
858 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
860 /* In VAR_DECL or RESULT_DECL, set when significant code movement precludes
861 attempting to share the stack slot with some other variable. */
862 #define DECL_NONSHAREABLE(NODE) \
863 (TREE_CHECK2 (NODE, VAR_DECL, \
864 RESULT_DECL)->decl_common.decl_nonshareable_flag)
866 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
867 thunked-to function. */
868 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
870 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
871 it has been built for the declaration of a variable-sized object. */
872 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
873 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
875 /* In a CALL_EXPR, means call was instrumented by Pointer Bounds Checker. */
876 #define CALL_WITH_BOUNDS_P(NODE) (CALL_EXPR_CHECK (NODE)->base.deprecated_flag)
878 /* In a type, nonzero means that all objects of the type are guaranteed by the
879 language or front-end to be properly aligned, so we can indicate that a MEM
880 of this type is aligned at least to the alignment of the type, even if it
881 doesn't appear that it is. We see this, for example, in object-oriented
882 languages where a tag field may show this is an object of a more-aligned
883 variant of the more generic type.
885 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
886 freelist. */
887 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
889 /* Used in classes in C++. */
890 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
891 /* Used in classes in C++. */
892 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
894 /* True if reference type NODE is a C++ rvalue reference. */
895 #define TYPE_REF_IS_RVALUE(NODE) \
896 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
898 /* Nonzero in a _DECL if the use of the name is defined as a
899 deprecated feature by __attribute__((deprecated)). */
900 #define TREE_DEPRECATED(NODE) \
901 ((NODE)->base.deprecated_flag)
903 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
904 uses are to be substituted for uses of the TREE_CHAINed identifier. */
905 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
906 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
908 /* In fixed-point types, means a saturating type. */
909 #define TYPE_SATURATING(NODE) (TYPE_CHECK (NODE)->base.u.bits.saturating_flag)
911 /* These flags are available for each language front end to use internally. */
912 #define TREE_LANG_FLAG_0(NODE) \
913 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_0)
914 #define TREE_LANG_FLAG_1(NODE) \
915 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_1)
916 #define TREE_LANG_FLAG_2(NODE) \
917 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_2)
918 #define TREE_LANG_FLAG_3(NODE) \
919 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_3)
920 #define TREE_LANG_FLAG_4(NODE) \
921 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_4)
922 #define TREE_LANG_FLAG_5(NODE) \
923 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_5)
924 #define TREE_LANG_FLAG_6(NODE) \
925 (TREE_NOT_CHECK2 (NODE, TREE_VEC, SSA_NAME)->base.u.bits.lang_flag_6)
927 /* Define additional fields and accessors for nodes representing constants. */
929 #define TREE_INT_CST_NUNITS(NODE) \
930 (INTEGER_CST_CHECK (NODE)->base.u.int_length.unextended)
931 #define TREE_INT_CST_EXT_NUNITS(NODE) \
932 (INTEGER_CST_CHECK (NODE)->base.u.int_length.extended)
933 #define TREE_INT_CST_OFFSET_NUNITS(NODE) \
934 (INTEGER_CST_CHECK (NODE)->base.u.int_length.offset)
935 #define TREE_INT_CST_ELT(NODE, I) TREE_INT_CST_ELT_CHECK (NODE, I)
936 #define TREE_INT_CST_LOW(NODE) \
937 ((unsigned HOST_WIDE_INT) TREE_INT_CST_ELT (NODE, 0))
939 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
940 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
942 #define TREE_FIXED_CST_PTR(NODE) \
943 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
944 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
946 /* In a STRING_CST */
947 /* In C terms, this is sizeof, not strlen. */
948 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
949 #define TREE_STRING_POINTER(NODE) \
950 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
952 /* In a COMPLEX_CST node. */
953 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
954 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
956 /* In a VECTOR_CST node. */
957 #define VECTOR_CST_NELTS(NODE) (TYPE_VECTOR_SUBPARTS (TREE_TYPE (NODE)))
958 #define VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elts)
959 #define VECTOR_CST_ELT(NODE,IDX) (VECTOR_CST_CHECK (NODE)->vector.elts[IDX])
961 /* Define fields and accessors for some special-purpose tree nodes. */
963 #define IDENTIFIER_LENGTH(NODE) \
964 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
965 #define IDENTIFIER_POINTER(NODE) \
966 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
967 #define IDENTIFIER_HASH_VALUE(NODE) \
968 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
970 /* Translate a hash table identifier pointer to a tree_identifier
971 pointer, and vice versa. */
973 #define HT_IDENT_TO_GCC_IDENT(NODE) \
974 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
975 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
977 /* In a TREE_LIST node. */
978 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
979 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
981 /* In a TREE_VEC node. */
982 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->base.u.length)
983 #define TREE_VEC_END(NODE) \
984 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.base.u.length]))
986 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
988 /* In a CONSTRUCTOR node. */
989 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
990 #define CONSTRUCTOR_ELT(NODE,IDX) \
991 (&(*CONSTRUCTOR_ELTS (NODE))[IDX])
992 #define CONSTRUCTOR_NELTS(NODE) \
993 (vec_safe_length (CONSTRUCTOR_ELTS (NODE)))
994 #define CONSTRUCTOR_NO_CLEARING(NODE) \
995 (CONSTRUCTOR_CHECK (NODE)->base.public_flag)
997 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
998 value of each element (stored within VAL). IX must be a scratch variable
999 of unsigned integer type. */
1000 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1001 for (IX = 0; (IX >= vec_safe_length (V)) \
1002 ? false \
1003 : ((VAL = (*(V))[IX].value), \
1004 true); \
1005 (IX)++)
1007 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1008 the value of each element (stored within VAL) and its index (stored
1009 within INDEX). IX must be a scratch variable of unsigned integer type. */
1010 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1011 for (IX = 0; (IX >= vec_safe_length (V)) \
1012 ? false \
1013 : (((void) (VAL = (*V)[IX].value)), \
1014 (INDEX = (*V)[IX].index), \
1015 true); \
1016 (IX)++)
1018 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1019 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1020 do { \
1021 constructor_elt _ce___ = {INDEX, VALUE}; \
1022 vec_safe_push ((V), _ce___); \
1023 } while (0)
1025 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1026 constructor output purposes. */
1027 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1028 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1030 /* True if NODE is a clobber right hand side, an expression of indeterminate
1031 value that clobbers the LHS in a copy instruction. We use a volatile
1032 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1033 In particular the volatile flag causes us to not prematurely remove
1034 such clobber instructions. */
1035 #define TREE_CLOBBER_P(NODE) \
1036 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1038 /* Define fields and accessors for some nodes that represent expressions. */
1040 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1041 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1042 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1043 && integer_zerop (TREE_OPERAND (NODE, 0)))
1045 /* In ordinary expression nodes. */
1046 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1047 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1049 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1050 length. Its value includes the length operand itself; that is,
1051 the minimum valid length is 1.
1052 Note that we have to bypass the use of TREE_OPERAND to access
1053 that field to avoid infinite recursion in expanding the macros. */
1054 #define VL_EXP_OPERAND_LENGTH(NODE) \
1055 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1057 /* Nonzero if is_gimple_debug() may possibly hold. */
1058 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1060 /* In a LOOP_EXPR node. */
1061 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1063 /* The source location of this expression. Non-tree_exp nodes such as
1064 decls and constants can be shared among multiple locations, so
1065 return nothing. */
1066 #define EXPR_LOCATION(NODE) \
1067 (CAN_HAVE_LOCATION_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1068 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1069 #define EXPR_HAS_LOCATION(NODE) (LOCATION_LOCUS (EXPR_LOCATION (NODE)) \
1070 != UNKNOWN_LOCATION)
1071 /* The location to be used in a diagnostic about this expression. Do not
1072 use this macro if the location will be assigned to other expressions. */
1073 #define EXPR_LOC_OR_LOC(NODE, LOCUS) (EXPR_HAS_LOCATION (NODE) \
1074 ? (NODE)->exp.locus : (LOCUS))
1075 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1076 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1078 /* True if a tree is an expression or statement that can have a
1079 location. */
1080 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1082 extern void protected_set_expr_location (tree, location_t);
1084 /* In a TARGET_EXPR node. */
1085 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1086 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1087 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1089 /* DECL_EXPR accessor. This gives access to the DECL associated with
1090 the given declaration statement. */
1091 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1093 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1095 /* COMPOUND_LITERAL_EXPR accessors. */
1096 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1097 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1098 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1099 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1101 /* SWITCH_EXPR accessors. These give access to the condition, body and
1102 original condition type (before any compiler conversions)
1103 of the switch statement, respectively. */
1104 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1105 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1106 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1108 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1109 of a case label, respectively. */
1110 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1111 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1112 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1113 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1115 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1116 corresponding MEM_REF operands. */
1117 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1118 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1119 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1120 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1121 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1123 #define MR_DEPENDENCE_CLIQUE(NODE) \
1124 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.clique)
1125 #define MR_DEPENDENCE_BASE(NODE) \
1126 (TREE_CHECK2 (NODE, MEM_REF, TARGET_MEM_REF)->base.u.dependence_info.base)
1128 /* The operands of a BIND_EXPR. */
1129 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1130 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1131 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1133 /* GOTO_EXPR accessor. This gives access to the label associated with
1134 a goto statement. */
1135 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1137 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1138 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1139 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1140 statement. */
1141 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1142 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1143 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1144 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1145 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1146 /* Nonzero if we want to create an ASM_INPUT instead of an
1147 ASM_OPERAND with no operands. */
1148 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1149 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1151 /* COND_EXPR accessors. */
1152 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1153 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1154 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1156 /* Accessors for the chains of recurrences. */
1157 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1158 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1159 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1160 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1162 /* LABEL_EXPR accessor. This gives access to the label associated with
1163 the given label expression. */
1164 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1166 /* CATCH_EXPR accessors. */
1167 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1168 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1170 /* EH_FILTER_EXPR accessors. */
1171 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1172 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1174 /* OBJ_TYPE_REF accessors. */
1175 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1176 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1177 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1179 /* ASSERT_EXPR accessors. */
1180 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1181 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1183 /* CALL_EXPR accessors. */
1184 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1185 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1186 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1187 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH (NODE) - 3)
1188 #define CALL_EXPR_IFN(NODE) (CALL_EXPR_CHECK (NODE)->base.u.ifn)
1190 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1191 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1192 the argument count is zero when checking is enabled. Instead, do
1193 the pointer arithmetic to advance past the 3 fixed operands in a
1194 CALL_EXPR. That produces a valid pointer to just past the end of the
1195 operand array, even if it's not valid to dereference it. */
1196 #define CALL_EXPR_ARGP(NODE) \
1197 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1199 /* TM directives and accessors. */
1200 #define TRANSACTION_EXPR_BODY(NODE) \
1201 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1202 #define TRANSACTION_EXPR_OUTER(NODE) \
1203 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1204 #define TRANSACTION_EXPR_RELAXED(NODE) \
1205 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1207 /* OpenMP and OpenACC directive and clause accessors. */
1209 #define OMP_BODY(NODE) \
1210 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_CRITICAL), 0)
1211 #define OMP_CLAUSES(NODE) \
1212 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OACC_PARALLEL, OMP_SINGLE), 1)
1214 #define OACC_PARALLEL_BODY(NODE) \
1215 TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 0)
1216 #define OACC_PARALLEL_CLAUSES(NODE) \
1217 TREE_OPERAND (OACC_PARALLEL_CHECK (NODE), 1)
1219 #define OACC_KERNELS_BODY(NODE) \
1220 TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 0)
1221 #define OACC_KERNELS_CLAUSES(NODE) \
1222 TREE_OPERAND (OACC_KERNELS_CHECK(NODE), 1)
1224 #define OACC_DATA_BODY(NODE) \
1225 TREE_OPERAND (OACC_DATA_CHECK (NODE), 0)
1226 #define OACC_DATA_CLAUSES(NODE) \
1227 TREE_OPERAND (OACC_DATA_CHECK (NODE), 1)
1229 #define OACC_HOST_DATA_BODY(NODE) \
1230 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 0)
1231 #define OACC_HOST_DATA_CLAUSES(NODE) \
1232 TREE_OPERAND (OACC_HOST_DATA_CHECK (NODE), 1)
1234 #define OACC_DECLARE_CLAUSES(NODE) \
1235 TREE_OPERAND (OACC_DECLARE_CHECK (NODE), 0)
1237 #define OACC_ENTER_DATA_CLAUSES(NODE) \
1238 TREE_OPERAND (OACC_ENTER_DATA_CHECK (NODE), 0)
1240 #define OACC_EXIT_DATA_CLAUSES(NODE) \
1241 TREE_OPERAND (OACC_EXIT_DATA_CHECK (NODE), 0)
1243 #define OACC_UPDATE_CLAUSES(NODE) \
1244 TREE_OPERAND (OACC_UPDATE_CHECK (NODE), 0)
1246 #define OACC_CACHE_CLAUSES(NODE) \
1247 TREE_OPERAND (OACC_CACHE_CHECK (NODE), 0)
1249 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1250 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1252 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1253 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1255 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1256 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1257 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1259 #define OMP_LOOP_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_FOR, OACC_LOOP)
1260 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 0)
1261 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 1)
1262 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 2)
1263 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 3)
1264 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 4)
1265 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_LOOP_CHECK (NODE), 5)
1267 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1268 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1270 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1272 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1273 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1275 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1277 #define OMP_TASKGROUP_BODY(NODE) TREE_OPERAND (OMP_TASKGROUP_CHECK (NODE), 0)
1279 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1281 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1282 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1284 #define OMP_TEAMS_BODY(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 0)
1285 #define OMP_TEAMS_CLAUSES(NODE) TREE_OPERAND (OMP_TEAMS_CHECK (NODE), 1)
1287 #define OMP_TARGET_DATA_BODY(NODE) \
1288 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 0)
1289 #define OMP_TARGET_DATA_CLAUSES(NODE)\
1290 TREE_OPERAND (OMP_TARGET_DATA_CHECK (NODE), 1)
1292 #define OMP_TARGET_BODY(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 0)
1293 #define OMP_TARGET_CLAUSES(NODE) TREE_OPERAND (OMP_TARGET_CHECK (NODE), 1)
1295 #define OMP_TARGET_UPDATE_CLAUSES(NODE)\
1296 TREE_OPERAND (OMP_TARGET_UPDATE_CHECK (NODE), 0)
1298 #define OMP_CLAUSE_SIZE(NODE) \
1299 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1300 OMP_CLAUSE_FROM, \
1301 OMP_CLAUSE__CACHE_), 1)
1303 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1304 #define OMP_CLAUSE_DECL(NODE) \
1305 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1306 OMP_CLAUSE_PRIVATE, \
1307 OMP_CLAUSE__LOOPTEMP_), 0)
1308 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1309 (LOCATION_LOCUS ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus) \
1310 != UNKNOWN_LOCATION)
1311 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1313 /* True on an OMP_SECTION statement that was the last lexical member.
1314 This status is meaningful in the implementation of lastprivate. */
1315 #define OMP_SECTION_LAST(NODE) \
1316 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1318 /* True on an OACC_KERNELS statement if is represents combined kernels loop
1319 directive. */
1320 #define OACC_KERNELS_COMBINED(NODE) \
1321 (OACC_KERNELS_CHECK (NODE)->base.private_flag)
1323 /* Like OACC_KERNELS_COMBINED, but for parallel loop directive. */
1324 #define OACC_PARALLEL_COMBINED(NODE) \
1325 (OACC_PARALLEL_CHECK (NODE)->base.private_flag)
1327 /* True on an OMP_PARALLEL statement if it represents an explicit
1328 combined parallel work-sharing constructs. */
1329 #define OMP_PARALLEL_COMBINED(NODE) \
1330 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1332 /* True if OMP_ATOMIC* is supposed to be sequentially consistent
1333 as opposed to relaxed. */
1334 #define OMP_ATOMIC_SEQ_CST(NODE) \
1335 (TREE_RANGE_CHECK (NODE, OMP_ATOMIC, \
1336 OMP_ATOMIC_CAPTURE_NEW)->base.private_flag)
1338 /* True on a PRIVATE clause if its decl is kept around for debugging
1339 information only and its DECL_VALUE_EXPR is supposed to point
1340 to what it has been remapped to. */
1341 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1342 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1344 /* True on a PRIVATE clause if ctor needs access to outer region's
1345 variable. */
1346 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1347 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1349 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1350 decl is present in the chain. */
1351 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1352 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1353 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1354 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1355 OMP_CLAUSE_LASTPRIVATE),\
1357 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1358 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1360 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1361 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1362 #define OMP_CLAUSE_IF_EXPR(NODE) \
1363 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1364 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1365 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1366 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1367 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1369 /* OpenACC clause expressions */
1370 #define OMP_CLAUSE_GANG_EXPR(NODE) \
1371 OMP_CLAUSE_OPERAND ( \
1372 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_GANG), 0)
1373 #define OMP_CLAUSE_ASYNC_EXPR(NODE) \
1374 OMP_CLAUSE_OPERAND ( \
1375 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ASYNC), 0)
1376 #define OMP_CLAUSE_WAIT_EXPR(NODE) \
1377 OMP_CLAUSE_OPERAND ( \
1378 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WAIT), 0)
1379 #define OMP_CLAUSE_VECTOR_EXPR(NODE) \
1380 OMP_CLAUSE_OPERAND ( \
1381 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR), 0)
1382 #define OMP_CLAUSE_WORKER_EXPR(NODE) \
1383 OMP_CLAUSE_OPERAND ( \
1384 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_WORKER), 0)
1385 #define OMP_CLAUSE_NUM_GANGS_EXPR(NODE) \
1386 OMP_CLAUSE_OPERAND ( \
1387 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_GANGS), 0)
1388 #define OMP_CLAUSE_NUM_WORKERS_EXPR(NODE) \
1389 OMP_CLAUSE_OPERAND ( \
1390 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_WORKERS), 0)
1391 #define OMP_CLAUSE_VECTOR_LENGTH_EXPR(NODE) \
1392 OMP_CLAUSE_OPERAND ( \
1393 OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_VECTOR_LENGTH), 0)
1395 #define OMP_CLAUSE_DEPEND_KIND(NODE) \
1396 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEPEND)->omp_clause.subcode.depend_kind)
1398 #define OMP_CLAUSE_MAP_KIND(NODE) \
1399 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->omp_clause.subcode.map_kind)
1401 /* Nonzero if this map clause is for array (rather than pointer) based array
1402 section with zero bias. Both the non-decl OMP_CLAUSE_MAP and
1403 correspoidng OMP_CLAUSE_MAP_POINTER clause are marked with this flag. */
1404 #define OMP_CLAUSE_MAP_ZERO_BIAS_ARRAY_SECTION(NODE) \
1405 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_MAP)->base.public_flag)
1407 #define OMP_CLAUSE_PROC_BIND_KIND(NODE) \
1408 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PROC_BIND)->omp_clause.subcode.proc_bind_kind)
1410 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1411 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1412 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1413 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1414 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1415 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1417 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1418 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1419 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1420 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1421 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1422 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1423 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1424 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1425 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1426 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1427 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1428 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1430 /* True if a REDUCTION clause may reference the original list item (omp_orig)
1431 in its OMP_CLAUSE_REDUCTION_{,GIMPLE_}INIT. */
1432 #define OMP_CLAUSE_REDUCTION_OMP_ORIG_REF(NODE) \
1433 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->base.public_flag)
1435 /* True if a LINEAR clause doesn't need copy in. True for iterator vars which
1436 are always initialized inside of the loop construct, false otherwise. */
1437 #define OMP_CLAUSE_LINEAR_NO_COPYIN(NODE) \
1438 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.public_flag)
1440 /* True if a LINEAR clause doesn't need copy out. True for iterator vars which
1441 are declared inside of the simd construct. */
1442 #define OMP_CLAUSE_LINEAR_NO_COPYOUT(NODE) \
1443 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1445 /* True if a LINEAR clause has a stride that is variable. */
1446 #define OMP_CLAUSE_LINEAR_VARIABLE_STRIDE(NODE) \
1447 TREE_PROTECTED (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR))
1449 /* True if a LINEAR clause is for an array or allocatable variable that
1450 needs special handling by the frontend. */
1451 #define OMP_CLAUSE_LINEAR_ARRAY(NODE) \
1452 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR)->base.deprecated_flag)
1454 #define OMP_CLAUSE_LINEAR_STEP(NODE) \
1455 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 1)
1457 #define OMP_CLAUSE_LINEAR_STMT(NODE) \
1458 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LINEAR), 2)
1460 #define OMP_CLAUSE_LINEAR_GIMPLE_SEQ(NODE) \
1461 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1463 #define OMP_CLAUSE_ALIGNED_ALIGNMENT(NODE) \
1464 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_ALIGNED), 1)
1466 #define OMP_CLAUSE_NUM_TEAMS_EXPR(NODE) \
1467 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_TEAMS), 0)
1469 #define OMP_CLAUSE_THREAD_LIMIT_EXPR(NODE) \
1470 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1471 OMP_CLAUSE_THREAD_LIMIT), 0)
1473 #define OMP_CLAUSE_DEVICE_ID(NODE) \
1474 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEVICE), 0)
1476 #define OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR(NODE) \
1477 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1478 OMP_CLAUSE_DIST_SCHEDULE), 0)
1480 #define OMP_CLAUSE_SAFELEN_EXPR(NODE) \
1481 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SAFELEN), 0)
1483 #define OMP_CLAUSE_SIMDLEN_EXPR(NODE) \
1484 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SIMDLEN), 0)
1486 #define OMP_CLAUSE__SIMDUID__DECL(NODE) \
1487 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE__SIMDUID_), 0)
1489 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1490 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1492 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1493 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1495 /* SSA_NAME accessors. */
1497 /* Returns the IDENTIFIER_NODE giving the SSA name a name or NULL_TREE
1498 if there is no name associated with it. */
1499 #define SSA_NAME_IDENTIFIER(NODE) \
1500 (SSA_NAME_CHECK (NODE)->ssa_name.var != NULL_TREE \
1501 ? (TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1502 ? (NODE)->ssa_name.var \
1503 : DECL_NAME ((NODE)->ssa_name.var)) \
1504 : NULL_TREE)
1506 /* Returns the variable being referenced. This can be NULL_TREE for
1507 temporaries not associated with any user variable.
1508 Once released, this is the only field that can be relied upon. */
1509 #define SSA_NAME_VAR(NODE) \
1510 (SSA_NAME_CHECK (NODE)->ssa_name.var == NULL_TREE \
1511 || TREE_CODE ((NODE)->ssa_name.var) == IDENTIFIER_NODE \
1512 ? NULL_TREE : (NODE)->ssa_name.var)
1514 #define SET_SSA_NAME_VAR_OR_IDENTIFIER(NODE,VAR) \
1515 do { SSA_NAME_CHECK (NODE)->ssa_name.var = (VAR); } while (0)
1517 /* Returns the statement which defines this SSA name. */
1518 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1520 /* Returns the SSA version number of this SSA name. Note that in
1521 tree SSA, version numbers are not per variable and may be recycled. */
1522 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->base.u.version
1524 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1525 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1526 status bit. */
1527 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1528 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1530 /* Nonzero if this SSA_NAME expression is currently on the free list of
1531 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1532 has no meaning for an SSA_NAME. */
1533 #define SSA_NAME_IN_FREE_LIST(NODE) \
1534 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1536 /* Nonzero if this SSA_NAME is the default definition for the
1537 underlying symbol. A default SSA name is created for symbol S if
1538 the very first reference to S in the function is a read operation.
1539 Default definitions are always created by an empty statement and
1540 belong to no basic block. */
1541 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1542 SSA_NAME_CHECK (NODE)->base.default_def_flag
1544 /* Attributes for SSA_NAMEs for pointer-type variables. */
1545 #define SSA_NAME_PTR_INFO(N) \
1546 SSA_NAME_CHECK (N)->ssa_name.info.ptr_info
1548 /* True if SSA_NAME_RANGE_INFO describes an anti-range. */
1549 #define SSA_NAME_ANTI_RANGE_P(N) \
1550 SSA_NAME_CHECK (N)->base.static_flag
1552 /* The type of range described by SSA_NAME_RANGE_INFO. */
1553 #define SSA_NAME_RANGE_TYPE(N) \
1554 (SSA_NAME_ANTI_RANGE_P (N) ? VR_ANTI_RANGE : VR_RANGE)
1556 /* Value range info attributes for SSA_NAMEs of non pointer-type variables. */
1557 #define SSA_NAME_RANGE_INFO(N) \
1558 SSA_NAME_CHECK (N)->ssa_name.info.range_info
1560 /* Return the immediate_use information for an SSA_NAME. */
1561 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1563 #define OMP_CLAUSE_CODE(NODE) \
1564 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1566 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1567 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1569 #define OMP_CLAUSE_OPERAND(NODE, I) \
1570 OMP_CLAUSE_ELT_CHECK (NODE, I)
1572 /* In a BLOCK node. */
1573 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1574 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1575 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1576 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1577 vec_safe_length (BLOCK_NONLOCALIZED_VARS (NODE))
1578 #define BLOCK_NONLOCALIZED_VAR(NODE,N) (*BLOCK_NONLOCALIZED_VARS (NODE))[N]
1579 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1580 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1581 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
1582 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1583 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1585 /* True if BLOCK has the same ranges as its BLOCK_SUPERCONTEXT. */
1586 #define BLOCK_SAME_RANGE(NODE) (BLOCK_CHECK (NODE)->base.u.bits.nameless_flag)
1588 /* An index number for this block. These values are not guaranteed to
1589 be unique across functions -- whether or not they are depends on
1590 the debugging output format in use. */
1591 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1593 /* If block reordering splits a lexical block into discontiguous
1594 address ranges, we'll make a copy of the original block.
1596 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1597 In that case, we have one source block that has been replicated
1598 (through inlining or unrolling) into many logical blocks, and that
1599 these logical blocks have different physical variables in them.
1601 In this case, we have one logical block split into several
1602 non-contiguous address ranges. Most debug formats can't actually
1603 represent this idea directly, so we fake it by creating multiple
1604 logical blocks with the same variables in them. However, for those
1605 that do support non-contiguous regions, these allow the original
1606 logical block to be reconstructed, along with the set of address
1607 ranges.
1609 One of the logical block fragments is arbitrarily chosen to be
1610 the ORIGIN. The other fragments will point to the origin via
1611 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1612 be null. The list of fragments will be chained through
1613 BLOCK_FRAGMENT_CHAIN from the origin. */
1615 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1616 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1618 /* For an inlined function, this gives the location where it was called
1619 from. This is only set in the top level block, which corresponds to the
1620 inlined function scope. This is used in the debug output routines. */
1622 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1624 /* This gives the location of the end of the block, useful to attach
1625 code implicitly generated for outgoing paths. */
1627 #define BLOCK_SOURCE_END_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.end_locus)
1629 /* Define fields and accessors for nodes representing data types. */
1631 /* See tree.def for documentation of the use of these fields.
1632 Look at the documentation of the various ..._TYPE tree codes.
1634 Note that the type.values, type.minval, and type.maxval fields are
1635 overloaded and used for different macros in different kinds of types.
1636 Each macro must check to ensure the tree node is of the proper kind of
1637 type. Note also that some of the front-ends also overload these fields,
1638 so they must be checked as well. */
1640 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
1641 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
1642 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
1643 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
1644 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
1645 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
1646 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
1647 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
1648 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
1649 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
1651 #define TYPE_MODE(NODE) \
1652 (VECTOR_TYPE_P (TYPE_CHECK (NODE)) \
1653 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
1654 #define SET_TYPE_MODE(NODE, MODE) \
1655 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
1657 extern machine_mode element_mode (const_tree t);
1659 /* The "canonical" type for this type node, which is used by frontends to
1660 compare the type for equality with another type. If two types are
1661 equal (based on the semantics of the language), then they will have
1662 equivalent TYPE_CANONICAL entries.
1664 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
1665 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
1666 be used for comparison against other types. Instead, the type is
1667 said to require structural equality checks, described in
1668 TYPE_STRUCTURAL_EQUALITY_P.
1670 For unqualified aggregate and function types the middle-end relies on
1671 TYPE_CANONICAL to tell whether two variables can be assigned
1672 to each other without a conversion. The middle-end also makes sure
1673 to assign the same alias-sets to the type partition with equal
1674 TYPE_CANONICAL of their unqualified variants. */
1675 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
1676 /* Indicates that the type node requires structural equality
1677 checks. The compiler will need to look at the composition of the
1678 type to determine whether it is equal to another type, rather than
1679 just comparing canonical type pointers. For instance, we would need
1680 to look at the return and parameter types of a FUNCTION_TYPE
1681 node. */
1682 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
1683 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
1684 type node requires structural equality. */
1685 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
1687 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
1688 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
1690 /* The (language-specific) typed-based alias set for this type.
1691 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1692 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1693 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1694 type can alias objects of any type. */
1695 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
1697 /* Nonzero iff the typed-based alias set for this type has been
1698 calculated. */
1699 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
1700 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
1702 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1703 to this type. */
1704 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
1706 /* The alignment necessary for objects of this type.
1707 The value is an int, measured in bits. */
1708 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
1710 /* 1 if the alignment for this type was requested by "aligned" attribute,
1711 0 if it is the default for this type. */
1712 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.u.bits.user_align)
1714 /* The alignment for NODE, in bytes. */
1715 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1717 /* If your language allows you to declare types, and you want debug info
1718 for them, then you need to generate corresponding TYPE_DECL nodes.
1719 These "stub" TYPE_DECL nodes have no name, and simply point at the
1720 type node. You then set the TYPE_STUB_DECL field of the type node
1721 to point back at the TYPE_DECL node. This allows the debug routines
1722 to know that the two nodes represent the same type, so that we only
1723 get one debug info record for them. */
1724 #define TYPE_STUB_DECL(NODE) (TREE_CHAIN (TYPE_CHECK (NODE)))
1726 /* In a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ARRAY_TYPE, it means
1727 the type has BLKmode only because it lacks the alignment required for
1728 its size. */
1729 #define TYPE_NO_FORCE_BLK(NODE) \
1730 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
1732 /* Nonzero in a type considered volatile as a whole. */
1733 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
1735 /* Nonzero in a type considered atomic as a whole. */
1736 #define TYPE_ATOMIC(NODE) (TYPE_CHECK (NODE)->base.u.bits.atomic_flag)
1738 /* Means this type is const-qualified. */
1739 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
1741 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1742 the term. */
1743 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
1745 /* If nonzero, type's name shouldn't be emitted into debug info. */
1746 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.u.bits.nameless_flag)
1748 /* The address space the type is in. */
1749 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.u.bits.address_space)
1751 /* Encode/decode the named memory support as part of the qualifier. If more
1752 than 8 qualifiers are added, these macros need to be adjusted. */
1753 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
1754 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
1756 /* Return all qualifiers except for the address space qualifiers. */
1757 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
1759 /* Only keep the address space out of the qualifiers and discard the other
1760 qualifiers. */
1761 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
1763 /* The set of type qualifiers for this type. */
1764 #define TYPE_QUALS(NODE) \
1765 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1766 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1767 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1768 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
1769 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE)))))
1771 /* The same as TYPE_QUALS without the address space qualifications. */
1772 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
1773 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1774 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1775 | (TYPE_ATOMIC (NODE) * TYPE_QUAL_ATOMIC) \
1776 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1778 /* The same as TYPE_QUALS without the address space and atomic
1779 qualifications. */
1780 #define TYPE_QUALS_NO_ADDR_SPACE_NO_ATOMIC(NODE) \
1781 ((int) ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1782 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1783 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT)))
1785 /* These flags are available for each language front end to use internally. */
1786 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
1787 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
1788 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
1789 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
1790 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
1791 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
1792 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
1794 /* Used to keep track of visited nodes in tree traversals. This is set to
1795 0 by copy_node and make_node. */
1796 #define TREE_VISITED(NODE) ((NODE)->base.visited)
1798 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1799 that distinguish string from array of char).
1800 If set in a INTEGER_TYPE, indicates a character type. */
1801 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
1803 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1804 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1805 (((unsigned HOST_WIDE_INT) 1) \
1806 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
1808 /* Set precision to n when we have 2^n sub-parts of the vector. */
1809 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1810 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
1812 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
1813 about missing conversions to other vector types of the same size. */
1814 #define TYPE_VECTOR_OPAQUE(NODE) \
1815 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
1817 /* Indicates that objects of this type must be initialized by calling a
1818 function when they are created. */
1819 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1820 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
1822 /* Indicates that a UNION_TYPE object should be passed the same way that
1823 the first union alternative would be passed, or that a RECORD_TYPE
1824 object should be passed the same way that the first (and only) member
1825 would be passed. */
1826 #define TYPE_TRANSPARENT_AGGR(NODE) \
1827 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
1829 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
1830 address of a component of the type. This is the counterpart of
1831 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
1832 #define TYPE_NONALIASED_COMPONENT(NODE) \
1833 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
1835 /* Indicated that objects of this type should be laid out in as
1836 compact a way as possible. */
1837 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.u.bits.packed_flag)
1839 /* Used by type_contains_placeholder_p to avoid recomputation.
1840 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1841 this field directly. */
1842 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1843 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
1845 /* Nonzero if RECORD_TYPE represents a final derivation of class. */
1846 #define TYPE_FINAL_P(NODE) \
1847 (RECORD_OR_UNION_CHECK (NODE)->base.default_def_flag)
1849 /* The debug output functions use the symtab union field to store
1850 information specific to the debugging format. The different debug
1851 output hooks store different types in the union field. These three
1852 macros are used to access different fields in the union. The debug
1853 hooks are responsible for consistently using only a specific
1854 macro. */
1856 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
1857 hold the type's number in the generated stabs. */
1858 #define TYPE_SYMTAB_ADDRESS(NODE) \
1859 (TYPE_CHECK (NODE)->type_common.symtab.address)
1861 /* Symtab field as a string. Used by COFF generator in sdbout.c to
1862 hold struct/union type tag names. */
1863 #define TYPE_SYMTAB_POINTER(NODE) \
1864 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
1866 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
1867 in dwarf2out.c to point to the DIE generated for the type. */
1868 #define TYPE_SYMTAB_DIE(NODE) \
1869 (TYPE_CHECK (NODE)->type_common.symtab.die)
1871 /* The garbage collector needs to know the interpretation of the
1872 symtab field. These constants represent the different types in the
1873 union. */
1875 #define TYPE_SYMTAB_IS_ADDRESS (0)
1876 #define TYPE_SYMTAB_IS_POINTER (1)
1877 #define TYPE_SYMTAB_IS_DIE (2)
1879 #define TYPE_LANG_SPECIFIC(NODE) \
1880 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
1882 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
1883 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
1884 #define TYPE_FIELDS(NODE) \
1885 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
1886 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1887 #define TYPE_ARG_TYPES(NODE) \
1888 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
1889 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK (NODE)->type_non_common.values)
1891 #define TYPE_METHODS(NODE) \
1892 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
1893 #define TYPE_VFIELD(NODE) \
1894 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
1895 #define TYPE_METHOD_BASETYPE(NODE) \
1896 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
1897 #define TYPE_OFFSET_BASETYPE(NODE) \
1898 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
1899 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
1900 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
1901 #define TYPE_NEXT_PTR_TO(NODE) \
1902 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
1903 #define TYPE_NEXT_REF_TO(NODE) \
1904 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
1905 #define TYPE_MIN_VALUE(NODE) \
1906 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
1907 #define TYPE_MAX_VALUE(NODE) \
1908 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
1910 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1911 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
1912 allocated. */
1913 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1914 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
1916 /* For record and union types, information about this type, as a base type
1917 for itself. */
1918 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1920 /* For non record and union types, used in a language-dependent way. */
1921 #define TYPE_LANG_SLOT_1(NODE) \
1922 (NOT_RECORD_OR_UNION_CHECK (NODE)->type_non_common.binfo)
1924 /* Define accessor macros for information about type inheritance
1925 and basetypes.
1927 A "basetype" means a particular usage of a data type for inheritance
1928 in another type. Each such basetype usage has its own "binfo"
1929 object to describe it. The binfo object is a TREE_VEC node.
1931 Inheritance is represented by the binfo nodes allocated for a
1932 given type. For example, given types C and D, such that D is
1933 inherited by C, 3 binfo nodes will be allocated: one for describing
1934 the binfo properties of C, similarly one for D, and one for
1935 describing the binfo properties of D as a base type for C.
1936 Thus, given a pointer to class C, one can get a pointer to the binfo
1937 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1939 /* BINFO specific flags. */
1941 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
1942 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
1944 /* Flags for language dependent use. */
1945 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0 (TREE_BINFO_CHECK (NODE))
1946 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1 (TREE_BINFO_CHECK (NODE))
1947 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2 (TREE_BINFO_CHECK (NODE))
1948 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3 (TREE_BINFO_CHECK (NODE))
1949 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4 (TREE_BINFO_CHECK (NODE))
1950 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5 (TREE_BINFO_CHECK (NODE))
1951 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6 (TREE_BINFO_CHECK (NODE))
1953 /* The actual data type node being inherited in this basetype. */
1954 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK (NODE))
1956 /* The offset where this basetype appears in its containing type.
1957 BINFO_OFFSET slot holds the offset (in bytes)
1958 from the base of the complete object to the base of the part of the
1959 object that is allocated on behalf of this `type'.
1960 This is always 0 except when there is multiple inheritance. */
1962 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK (NODE)->binfo.offset)
1963 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
1965 /* The virtual function table belonging to this basetype. Virtual
1966 function tables provide a mechanism for run-time method dispatching.
1967 The entries of a virtual function table are language-dependent. */
1969 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtable)
1971 /* The virtual functions in the virtual function table. This is
1972 a TREE_LIST that is used as an initial approximation for building
1973 a virtual function table for this basetype. */
1974 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK (NODE)->binfo.virtuals)
1976 /* A vector of binfos for the direct basetypes inherited by this
1977 basetype.
1979 If this basetype describes type D as inherited in C, and if the
1980 basetypes of D are E and F, then this vector contains binfos for
1981 inheritance of E and F by C. */
1982 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK (NODE)->binfo.base_binfos)
1984 /* The number of basetypes for NODE. */
1985 #define BINFO_N_BASE_BINFOS(NODE) (BINFO_BASE_BINFOS (NODE)->length ())
1987 /* Accessor macro to get to the Nth base binfo of this binfo. */
1988 #define BINFO_BASE_BINFO(NODE,N) \
1989 ((*BINFO_BASE_BINFOS (NODE))[(N)])
1990 #define BINFO_BASE_ITERATE(NODE,N,B) \
1991 (BINFO_BASE_BINFOS (NODE)->iterate ((N), &(B)))
1992 #define BINFO_BASE_APPEND(NODE,T) \
1993 (BINFO_BASE_BINFOS (NODE)->quick_push ((T)))
1995 /* For a BINFO record describing a virtual base class, i.e., one where
1996 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1997 base. The actual contents are language-dependent. In the C++
1998 front-end this field is an INTEGER_CST giving an offset into the
1999 vtable where the offset to the virtual base can be found. */
2000 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vptr_field)
2002 /* Indicates the accesses this binfo has to its bases. The values are
2003 access_public_node, access_protected_node or access_private_node.
2004 If this array is not present, public access is implied. */
2005 #define BINFO_BASE_ACCESSES(NODE) \
2006 (TREE_BINFO_CHECK (NODE)->binfo.base_accesses)
2008 #define BINFO_BASE_ACCESS(NODE,N) \
2009 (*BINFO_BASE_ACCESSES (NODE))[(N)]
2010 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2011 BINFO_BASE_ACCESSES (NODE)->quick_push ((T))
2013 /* The index in the VTT where this subobject's sub-VTT can be found.
2014 NULL_TREE if there is no sub-VTT. */
2015 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_subvtt)
2017 /* The index in the VTT where the vptr for this subobject can be
2018 found. NULL_TREE if there is no secondary vptr in the VTT. */
2019 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK (NODE)->binfo.vtt_vptr)
2021 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2022 inheriting this base for non-virtual bases. For virtual bases it
2023 points either to the binfo for which this is a primary binfo, or to
2024 the binfo of the most derived type. */
2025 #define BINFO_INHERITANCE_CHAIN(NODE) \
2026 (TREE_BINFO_CHECK (NODE)->binfo.inheritance)
2029 /* Define fields and accessors for nodes representing declared names. */
2031 /* Nonzero if DECL represents an SSA name or a variable that can possibly
2032 have an associated SSA name. */
2033 #define SSA_VAR_P(DECL) \
2034 (TREE_CODE (DECL) == VAR_DECL \
2035 || TREE_CODE (DECL) == PARM_DECL \
2036 || TREE_CODE (DECL) == RESULT_DECL \
2037 || TREE_CODE (DECL) == SSA_NAME)
2040 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2042 /* This is the name of the object as written by the user.
2043 It is an IDENTIFIER_NODE. */
2044 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2046 /* The IDENTIFIER_NODE associated with the TYPE_NAME field. */
2047 #define TYPE_IDENTIFIER(NODE) \
2048 (TYPE_NAME (NODE) && DECL_P (TYPE_NAME (NODE)) \
2049 ? DECL_NAME (TYPE_NAME (NODE)) : TYPE_NAME (NODE))
2051 /* Every ..._DECL node gets a unique number. */
2052 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2054 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2055 uses. */
2056 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2058 /* Every ..._DECL node gets a unique number that stays the same even
2059 when the decl is copied by the inliner once it is set. */
2060 #define DECL_PT_UID(NODE) \
2061 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2062 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2063 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2064 #define SET_DECL_PT_UID(NODE, UID) \
2065 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2066 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2067 be preserved when copyin the decl. */
2068 #define DECL_PT_UID_SET_P(NODE) \
2069 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2071 /* These two fields describe where in the source code the declaration
2072 was. If the declaration appears in several places (as for a C
2073 function that is declared first and then defined later), this
2074 information should refer to the definition. */
2075 #define DECL_SOURCE_LOCATION(NODE) \
2076 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2077 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2078 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2079 #define DECL_SOURCE_COLUMN(NODE) LOCATION_COLUMN (DECL_SOURCE_LOCATION (NODE))
2080 /* This accessor returns TRUE if the decl it operates on was created
2081 by a front-end or back-end rather than by user code. In this case
2082 builtin-ness is indicated by source location. */
2083 #define DECL_IS_BUILTIN(DECL) \
2084 (LOCATION_LOCUS (DECL_SOURCE_LOCATION (DECL)) <= BUILTINS_LOCATION)
2086 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2087 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2088 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2089 nodes, this points to either the FUNCTION_DECL for the containing
2090 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2091 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2092 scope". In particular, for VAR_DECLs which are virtual table pointers
2093 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2094 they belong to. */
2095 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2096 #define DECL_FIELD_CONTEXT(NODE) \
2097 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2099 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2100 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.u.bits.nameless_flag)
2102 /* For any sort of a ..._DECL node, this points to the original (abstract)
2103 decl node which this decl is an inlined/cloned instance of, or else it
2104 is NULL indicating that this decl is not an instance of some other decl.
2106 The C front-end also uses this in a nested declaration of an inline
2107 function, to point back to the definition. */
2108 #define DECL_ABSTRACT_ORIGIN(NODE) \
2109 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2111 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2112 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2113 #define DECL_ORIGIN(NODE) \
2114 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2116 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2117 inline instance of some original (abstract) decl from an inline function;
2118 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2119 nodes can also have their abstract origin set to themselves. */
2120 #define DECL_FROM_INLINE(NODE) \
2121 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2122 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2124 /* In a DECL this is the field where attributes are stored. */
2125 #define DECL_ATTRIBUTES(NODE) \
2126 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2128 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2129 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2130 For a VAR_DECL, holds the initial value.
2131 For a PARM_DECL, used for DECL_ARG_TYPE--default
2132 values for parameters are encoded in the type of the function,
2133 not in the PARM_DECL slot.
2134 For a FIELD_DECL, this is used for enumeration values and the C
2135 frontend uses it for temporarily storing bitwidth of bitfields.
2137 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2138 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2140 /* Holds the size of the datum, in bits, as a tree expression.
2141 Need not be constant. */
2142 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2143 /* Likewise for the size in bytes. */
2144 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2145 /* Holds the alignment required for the datum, in bits. */
2146 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2147 /* The alignment of NODE, in bytes. */
2148 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2149 /* Set if the alignment of this DECL has been set by the user, for
2150 example with an 'aligned' attribute. */
2151 #define DECL_USER_ALIGN(NODE) \
2152 (DECL_COMMON_CHECK (NODE)->base.u.bits.user_align)
2153 /* Holds the machine mode corresponding to the declaration of a variable or
2154 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2155 FIELD_DECL. */
2156 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2158 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2159 operation it is. Note, however, that this field is overloaded, with
2160 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2161 checked before any access to the former. */
2162 #define DECL_FUNCTION_CODE(NODE) \
2163 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2165 #define DECL_FUNCTION_PERSONALITY(NODE) \
2166 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2168 /* Nonzero for a given ..._DECL node means that the name of this node should
2169 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2170 the associated type should be ignored. For a FUNCTION_DECL, the body of
2171 the function should also be ignored. */
2172 #define DECL_IGNORED_P(NODE) \
2173 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2175 /* Nonzero for a given ..._DECL node means that this node represents an
2176 "abstract instance" of the given declaration (e.g. in the original
2177 declaration of an inline function). When generating symbolic debugging
2178 information, we mustn't try to generate any address information for nodes
2179 marked as "abstract instances" because we don't actually generate
2180 any code or allocate any data space for such instances. */
2181 #define DECL_ABSTRACT_P(NODE) \
2182 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2184 /* Language-specific decl information. */
2185 #define DECL_LANG_SPECIFIC(NODE) \
2186 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2188 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2189 do not allocate storage, and refer to a definition elsewhere. Note that
2190 this does not necessarily imply the entity represented by NODE
2191 has no program source-level definition in this translation unit. For
2192 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2193 DECL_EXTERNAL may be true simultaneously; that can be the case for
2194 a C99 "extern inline" function. */
2195 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2197 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2198 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2200 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2202 Also set in some languages for variables, etc., outside the normal
2203 lexical scope, such as class instance variables. */
2204 #define DECL_NONLOCAL(NODE) \
2205 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2207 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2208 Used in FIELD_DECLs for vtable pointers.
2209 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2210 #define DECL_VIRTUAL_P(NODE) \
2211 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2213 /* Used to indicate that this DECL represents a compiler-generated entity. */
2214 #define DECL_ARTIFICIAL(NODE) \
2215 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2217 /* Additional flags for language-specific uses. */
2218 #define DECL_LANG_FLAG_0(NODE) \
2219 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2220 #define DECL_LANG_FLAG_1(NODE) \
2221 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2222 #define DECL_LANG_FLAG_2(NODE) \
2223 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2224 #define DECL_LANG_FLAG_3(NODE) \
2225 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2226 #define DECL_LANG_FLAG_4(NODE) \
2227 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2228 #define DECL_LANG_FLAG_5(NODE) \
2229 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2230 #define DECL_LANG_FLAG_6(NODE) \
2231 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2232 #define DECL_LANG_FLAG_7(NODE) \
2233 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2234 #define DECL_LANG_FLAG_8(NODE) \
2235 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2237 /* Nonzero for a scope which is equal to file scope. */
2238 #define SCOPE_FILE_SCOPE_P(EXP) \
2239 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2240 /* Nonzero for a decl which is at file scope. */
2241 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2242 /* Nonzero for a type which is at file scope. */
2243 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2245 /* Nonzero for a decl that is decorated using attribute used.
2246 This indicates to compiler tools that this decl needs to be preserved. */
2247 #define DECL_PRESERVE_P(DECL) \
2248 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2250 /* For function local variables of COMPLEX and VECTOR types,
2251 indicates that the variable is not aliased, and that all
2252 modifications to the variable have been adjusted so that
2253 they are killing assignments. Thus the variable may now
2254 be treated as a GIMPLE register, and use real instead of
2255 virtual ops in SSA form. */
2256 #define DECL_GIMPLE_REG_P(DECL) \
2257 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2259 extern tree decl_value_expr_lookup (tree);
2260 extern void decl_value_expr_insert (tree, tree);
2262 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2263 if transformations have made this more complicated than evaluating the
2264 decl itself. This should only be used for debugging; once this field has
2265 been set, the decl itself may not legitimately appear in the function. */
2266 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2267 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2268 ->decl_common.decl_flag_2)
2269 #define DECL_VALUE_EXPR(NODE) \
2270 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2271 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2272 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2274 /* Holds the RTL expression for the value of a variable or function.
2275 This value can be evaluated lazily for functions, variables with
2276 static storage duration, and labels. */
2277 #define DECL_RTL(NODE) \
2278 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2279 ? (NODE)->decl_with_rtl.rtl \
2280 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2282 /* Set the DECL_RTL for NODE to RTL. */
2283 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2285 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2286 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2288 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2289 #define DECL_RTL_SET_P(NODE) \
2290 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2292 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2293 NODE1, it will not be set for NODE2; this is a lazy copy. */
2294 #define COPY_DECL_RTL(NODE1, NODE2) \
2295 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2296 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2298 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2299 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2301 #if (GCC_VERSION >= 2007)
2302 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
2303 ({ tree const __d = (decl); \
2304 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
2305 /* Dereference it so the compiler knows it can't be NULL even \
2306 without assertion checking. */ \
2307 &*DECL_RTL_IF_SET (__d); })
2308 #else
2309 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
2310 #endif
2312 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2313 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2315 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2316 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2317 of the structure. */
2318 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2320 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2321 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2322 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2323 natural alignment of the field's type). */
2324 #define DECL_FIELD_BIT_OFFSET(NODE) \
2325 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2327 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2328 if so, the type that was originally specified for it.
2329 TREE_TYPE may have been modified (in finish_struct). */
2330 #define DECL_BIT_FIELD_TYPE(NODE) \
2331 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2333 /* In a FIELD_DECL of a RECORD_TYPE, this is a pointer to the storage
2334 representative FIELD_DECL. */
2335 #define DECL_BIT_FIELD_REPRESENTATIVE(NODE) \
2336 (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2338 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2339 if nonzero, indicates that the field occupies the type. */
2340 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2342 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2343 DECL_FIELD_OFFSET which are known to be always zero.
2344 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2345 has. */
2346 #define DECL_OFFSET_ALIGN(NODE) \
2347 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2349 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2350 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2351 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2353 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2354 which this FIELD_DECL is defined. This information is needed when
2355 writing debugging information about vfield and vbase decls for C++. */
2356 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2358 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2359 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.u.bits.packed_flag)
2361 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2362 specially. */
2363 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2365 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2366 this component. This makes it possible for Type-Based Alias Analysis
2367 to disambiguate accesses to this field with indirect accesses using
2368 the field's type:
2370 struct S { int i; } s;
2371 int *p;
2373 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2375 From the implementation's viewpoint, the alias set of the type of the
2376 field 'i' (int) will not be recorded as a subset of that of the type of
2377 's' (struct S) in record_component_aliases. The counterpart is that
2378 accesses to s.i must not be given the alias set of the type of 'i'
2379 (int) but instead directly that of the type of 's' (struct S). */
2380 #define DECL_NONADDRESSABLE_P(NODE) \
2381 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2383 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2384 dense, unique within any one function, and may be used to index arrays.
2385 If the value is -1, then no UID has been assigned. */
2386 #define LABEL_DECL_UID(NODE) \
2387 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2389 /* In a LABEL_DECL, the EH region number for which the label is the
2390 post_landing_pad. */
2391 #define EH_LANDING_PAD_NR(NODE) \
2392 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2394 /* For a PARM_DECL, records the data type used to pass the argument,
2395 which may be different from the type seen in the program. */
2396 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2398 /* For PARM_DECL, holds an RTL for the stack slot or register
2399 where the data was actually passed. */
2400 #define DECL_INCOMING_RTL(NODE) \
2401 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2403 /* Nonzero for a given ..._DECL node means that no warnings should be
2404 generated just because this node is unused. */
2405 #define DECL_IN_SYSTEM_HEADER(NODE) \
2406 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2408 /* Used to indicate that the linkage status of this DECL is not yet known,
2409 so it should not be output now. */
2410 #define DECL_DEFER_OUTPUT(NODE) \
2411 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2413 /* In a VAR_DECL that's static,
2414 nonzero if the space is in the text section. */
2415 #define DECL_IN_TEXT_SECTION(NODE) \
2416 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2418 /* In a VAR_DECL that's static,
2419 nonzero if it belongs to the global constant pool. */
2420 #define DECL_IN_CONSTANT_POOL(NODE) \
2421 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2423 /* Nonzero for a given ..._DECL node means that this node should be
2424 put in .common, if possible. If a DECL_INITIAL is given, and it
2425 is not error_mark_node, then the decl cannot be put in .common. */
2426 #define DECL_COMMON(NODE) \
2427 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2429 /* In a VAR_DECL, nonzero if the decl is a register variable with
2430 an explicit asm specification. */
2431 #define DECL_HARD_REGISTER(NODE) \
2432 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2434 /* Used to indicate that this DECL has weak linkage. */
2435 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2437 /* Used to indicate that the DECL is a dllimport. */
2438 #define DECL_DLLIMPORT_P(NODE) \
2439 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2441 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2442 not be put out unless it is needed in this translation unit.
2443 Entities like this are shared across translation units (like weak
2444 entities), but are guaranteed to be generated by any translation
2445 unit that needs them, and therefore need not be put out anywhere
2446 where they are not needed. DECL_COMDAT is just a hint to the
2447 back-end; it is up to front-ends which set this flag to ensure
2448 that there will never be any harm, other than bloat, in putting out
2449 something which is DECL_COMDAT. */
2450 #define DECL_COMDAT(NODE) \
2451 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2453 #define DECL_COMDAT_GROUP(NODE) \
2454 decl_comdat_group (NODE)
2456 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2457 multiple translation units should be merged. */
2458 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE \
2459 && (TREE_PUBLIC (NODE) || DECL_EXTERNAL (NODE)))
2461 /* The name of the object as the assembler will see it (but before any
2462 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2463 as DECL_NAME. It is an IDENTIFIER_NODE.
2465 ASSEMBLER_NAME of TYPE_DECLS may store global name of type used for
2466 One Definition Rule based type merging at LTO. It is computed only for
2467 LTO compilation and C++. */
2468 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2470 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2471 This is true of all DECL nodes except FIELD_DECL. */
2472 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2473 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2475 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2476 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2477 yet. */
2478 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2479 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
2480 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2482 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2483 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2484 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2486 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2487 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2488 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2489 semantics of using this macro, are different than saying:
2491 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2493 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2495 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2496 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2497 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2498 DECL_ASSEMBLER_NAME (DECL1)) \
2499 : (void) 0)
2501 /* Records the section name in a section attribute. Used to pass
2502 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2503 #define DECL_SECTION_NAME(NODE) decl_section_name (NODE)
2505 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2506 this variable in a BIND_EXPR. */
2507 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2508 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2510 /* Value of the decls's visibility attribute */
2511 #define DECL_VISIBILITY(NODE) \
2512 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2514 /* Nonzero means that the decl had its visibility specified rather than
2515 being inferred. */
2516 #define DECL_VISIBILITY_SPECIFIED(NODE) \
2517 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2519 /* In a VAR_DECL, the model to use if the data should be allocated from
2520 thread-local storage. */
2521 #define DECL_TLS_MODEL(NODE) decl_tls_model (NODE)
2523 /* In a VAR_DECL, nonzero if the data should be allocated from
2524 thread-local storage. */
2525 #define DECL_THREAD_LOCAL_P(NODE) \
2526 ((TREE_STATIC (NODE) || DECL_EXTERNAL (NODE)) && decl_tls_model (NODE) >= TLS_MODEL_REAL)
2528 /* In a non-local VAR_DECL with static storage duration, true if the
2529 variable has an initialization priority. If false, the variable
2530 will be initialized at the DEFAULT_INIT_PRIORITY. */
2531 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2532 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2534 extern tree decl_debug_expr_lookup (tree);
2535 extern void decl_debug_expr_insert (tree, tree);
2537 /* For VAR_DECL, this is set to an expression that it was split from. */
2538 #define DECL_HAS_DEBUG_EXPR_P(NODE) \
2539 (VAR_DECL_CHECK (NODE)->decl_common.debug_expr_is_from)
2540 #define DECL_DEBUG_EXPR(NODE) \
2541 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2543 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2544 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2546 extern priority_type decl_init_priority_lookup (tree);
2547 extern priority_type decl_fini_priority_lookup (tree);
2548 extern void decl_init_priority_insert (tree, priority_type);
2549 extern void decl_fini_priority_insert (tree, priority_type);
2551 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2552 NODE. */
2553 #define DECL_INIT_PRIORITY(NODE) \
2554 (decl_init_priority_lookup (NODE))
2555 /* Set the initialization priority for NODE to VAL. */
2556 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2557 (decl_init_priority_insert (NODE, VAL))
2559 /* For a FUNCTION_DECL the finalization priority of NODE. */
2560 #define DECL_FINI_PRIORITY(NODE) \
2561 (decl_fini_priority_lookup (NODE))
2562 /* Set the finalization priority for NODE to VAL. */
2563 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2564 (decl_fini_priority_insert (NODE, VAL))
2566 /* The initialization priority for entities for which no explicit
2567 initialization priority has been specified. */
2568 #define DEFAULT_INIT_PRIORITY 65535
2570 /* The maximum allowed initialization priority. */
2571 #define MAX_INIT_PRIORITY 65535
2573 /* The largest priority value reserved for use by system runtime
2574 libraries. */
2575 #define MAX_RESERVED_INIT_PRIORITY 100
2577 /* In a VAR_DECL, nonzero if this is a global variable for VOPs. */
2578 #define VAR_DECL_IS_VIRTUAL_OPERAND(NODE) \
2579 (VAR_DECL_CHECK (NODE)->base.u.bits.saturating_flag)
2581 /* In a VAR_DECL, nonzero if this is a non-local frame structure. */
2582 #define DECL_NONLOCAL_FRAME(NODE) \
2583 (VAR_DECL_CHECK (NODE)->base.default_def_flag)
2585 /* In a VAR_DECL, nonzero if this variable is not aliased by any pointer. */
2586 #define DECL_NONALIASED(NODE) \
2587 (VAR_DECL_CHECK (NODE)->base.nothrow_flag)
2589 /* This field is used to reference anything in decl.result and is meant only
2590 for use by the garbage collector. */
2591 #define DECL_RESULT_FLD(NODE) \
2592 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2594 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2595 Before the struct containing the FUNCTION_DECL is laid out,
2596 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2597 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2598 function. When the class is laid out, this pointer is changed
2599 to an INTEGER_CST node which is suitable for use as an index
2600 into the virtual function table. */
2601 #define DECL_VINDEX(NODE) \
2602 (FUNCTION_DECL_CHECK (NODE)->function_decl.vindex)
2604 /* In FUNCTION_DECL, holds the decl for the return value. */
2605 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2607 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2608 #define DECL_UNINLINABLE(NODE) \
2609 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2611 /* In a FUNCTION_DECL, the saved representation of the body of the
2612 entire function. */
2613 #define DECL_SAVED_TREE(NODE) \
2614 (FUNCTION_DECL_CHECK (NODE)->function_decl.saved_tree)
2616 /* Nonzero in a FUNCTION_DECL means this function should be treated
2617 as if it were a malloc, meaning it returns a pointer that is
2618 not an alias. */
2619 #define DECL_IS_MALLOC(NODE) \
2620 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2622 /* Nonzero in a FUNCTION_DECL means this function should be treated as
2623 C++ operator new, meaning that it returns a pointer for which we
2624 should not use type based aliasing. */
2625 #define DECL_IS_OPERATOR_NEW(NODE) \
2626 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
2628 /* Nonzero in a FUNCTION_DECL means this function may return more
2629 than once. */
2630 #define DECL_IS_RETURNS_TWICE(NODE) \
2631 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2633 /* Nonzero in a FUNCTION_DECL means this function should be treated
2634 as "pure" function (like const function, but may read global memory). */
2635 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2637 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
2638 the const or pure function may not terminate. When this is nonzero
2639 for a const or pure function, it can be dealt with by cse passes
2640 but cannot be removed by dce passes since you are not allowed to
2641 change an infinite looping program into one that terminates without
2642 error. */
2643 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
2644 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
2646 /* Nonzero in a FUNCTION_DECL means this function should be treated
2647 as "novops" function (function that does not read global memory,
2648 but may have arbitrary side effects). */
2649 #define DECL_IS_NOVOPS(NODE) \
2650 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2652 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2653 at the beginning or end of execution. */
2654 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2655 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2657 #define DECL_STATIC_DESTRUCTOR(NODE) \
2658 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2660 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2661 be instrumented with calls to support routines. */
2662 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2663 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2665 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2666 disabled in this function. */
2667 #define DECL_NO_LIMIT_STACK(NODE) \
2668 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2670 /* In a FUNCTION_DECL indicates that a static chain is needed. */
2671 #define DECL_STATIC_CHAIN(NODE) \
2672 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.regdecl_flag)
2674 /* Nonzero for a decl that cgraph has decided should be inlined into
2675 at least one call site. It is not meaningful to look at this
2676 directly; always use cgraph_function_possibly_inlined_p. */
2677 #define DECL_POSSIBLY_INLINED(DECL) \
2678 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2680 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2681 such as via the `inline' keyword in C/C++. This flag controls the linkage
2682 semantics of 'inline' */
2683 #define DECL_DECLARED_INLINE_P(NODE) \
2684 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2686 /* Nonzero in a FUNCTION_DECL means this function should not get
2687 -Winline warnings. */
2688 #define DECL_NO_INLINE_WARNING_P(NODE) \
2689 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
2691 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
2692 #define BUILTIN_TM_LOAD_STORE_P(FN) \
2693 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2695 /* Nonzero if a FUNCTION_CODE is a TM load. */
2696 #define BUILTIN_TM_LOAD_P(FN) \
2697 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
2699 /* Nonzero if a FUNCTION_CODE is a TM store. */
2700 #define BUILTIN_TM_STORE_P(FN) \
2701 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
2703 #define CASE_BUILT_IN_TM_LOAD(FN) \
2704 case BUILT_IN_TM_LOAD_##FN: \
2705 case BUILT_IN_TM_LOAD_RAR_##FN: \
2706 case BUILT_IN_TM_LOAD_RAW_##FN: \
2707 case BUILT_IN_TM_LOAD_RFW_##FN
2709 #define CASE_BUILT_IN_TM_STORE(FN) \
2710 case BUILT_IN_TM_STORE_##FN: \
2711 case BUILT_IN_TM_STORE_WAR_##FN: \
2712 case BUILT_IN_TM_STORE_WAW_##FN
2714 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
2715 disregarding size and cost heuristics. This is equivalent to using
2716 the always_inline attribute without the required diagnostics if the
2717 function cannot be inlined. */
2718 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
2719 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
2721 extern vec<tree, va_gc> **decl_debug_args_lookup (tree);
2722 extern vec<tree, va_gc> **decl_debug_args_insert (tree);
2724 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
2725 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
2726 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
2728 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2729 that describes the status of this function. */
2730 #define DECL_STRUCT_FUNCTION(NODE) \
2731 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2733 /* In a FUNCTION_DECL, nonzero means a built in function of a
2734 standard library or more generally a built in function that is
2735 recognized by optimizers and expanders.
2737 Note that it is different from the DECL_IS_BUILTIN accessor. For
2738 instance, user declared prototypes of C library functions are not
2739 DECL_IS_BUILTIN but may be DECL_BUILT_IN. */
2740 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2742 /* For a builtin function, identify which part of the compiler defined it. */
2743 #define DECL_BUILT_IN_CLASS(NODE) \
2744 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2746 /* In FUNCTION_DECL, a chain of ..._DECL nodes. */
2747 #define DECL_ARGUMENTS(NODE) \
2748 (FUNCTION_DECL_CHECK (NODE)->function_decl.arguments)
2750 /* In FUNCTION_DECL, the function specific target options to use when compiling
2751 this function. */
2752 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
2753 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
2755 /* In FUNCTION_DECL, the function specific optimization options to use when
2756 compiling this function. */
2757 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
2758 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
2760 /* In FUNCTION_DECL, this is set if this function has other versions generated
2761 using "target" attributes. The default version is the one which does not
2762 have any "target" attribute set. */
2763 #define DECL_FUNCTION_VERSIONED(NODE)\
2764 (FUNCTION_DECL_CHECK (NODE)->function_decl.versioned_function)
2766 /* In FUNCTION_DECL, this is set if this function is a C++ constructor.
2767 Devirtualization machinery uses this knowledge for determing type of the
2768 object constructed. Also we assume that constructor address is not
2769 important. */
2770 #define DECL_CXX_CONSTRUCTOR_P(NODE)\
2771 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_constructor)
2773 /* In FUNCTION_DECL, this is set if this function is a C++ destructor.
2774 Devirtualization machinery uses this to track types in destruction. */
2775 #define DECL_CXX_DESTRUCTOR_P(NODE)\
2776 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.cxx_destructor)
2778 /* In FUNCTION_DECL that represent an virtual method this is set when
2779 the method is final. */
2780 #define DECL_FINAL_P(NODE)\
2781 (FUNCTION_DECL_CHECK (NODE)->decl_with_vis.final)
2783 /* The source language of the translation-unit. */
2784 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
2785 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
2787 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
2789 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2790 #define DECL_ORIGINAL_TYPE(NODE) \
2791 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2793 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2794 into stabs. Instead it will generate cross reference ('x') of names.
2795 This uses the same flag as DECL_EXTERNAL. */
2796 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2797 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2799 /* Getter of the imported declaration associated to the
2800 IMPORTED_DECL node. */
2801 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
2802 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
2804 /* Getter of the symbol declaration associated with the
2805 NAMELIST_DECL node. */
2806 #define NAMELIST_DECL_ASSOCIATED_DECL(NODE) \
2807 (DECL_INITIAL (NODE))
2809 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2810 To reduce overhead, the nodes containing the statements are not trees.
2811 This avoids the overhead of tree_common on all linked list elements.
2813 Use the interface in tree-iterator.h to access this node. */
2815 #define STATEMENT_LIST_HEAD(NODE) \
2816 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2817 #define STATEMENT_LIST_TAIL(NODE) \
2818 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2820 #define TREE_OPTIMIZATION(NODE) \
2821 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
2823 #define TREE_OPTIMIZATION_OPTABS(NODE) \
2824 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.optabs)
2826 #define TREE_OPTIMIZATION_BASE_OPTABS(NODE) \
2827 (OPTIMIZATION_NODE_CHECK (NODE)->optimization.base_optabs)
2829 /* Return a tree node that encapsulates the optimization options in OPTS. */
2830 extern tree build_optimization_node (struct gcc_options *opts);
2832 #define TREE_TARGET_OPTION(NODE) \
2833 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
2835 #define TREE_TARGET_GLOBALS(NODE) \
2836 (TARGET_OPTION_NODE_CHECK (NODE)->target_option.globals)
2838 /* Return a tree node that encapsulates the target options in OPTS. */
2839 extern tree build_target_option_node (struct gcc_options *opts);
2841 extern void prepare_target_option_nodes_for_pch (void);
2843 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
2845 inline tree
2846 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
2848 if (TREE_CODE (__t) != __c)
2849 tree_check_failed (__t, __f, __l, __g, __c, 0);
2850 return __t;
2853 inline tree
2854 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
2855 enum tree_code __c)
2857 if (TREE_CODE (__t) == __c)
2858 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
2859 return __t;
2862 inline tree
2863 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
2864 enum tree_code __c1, enum tree_code __c2)
2866 if (TREE_CODE (__t) != __c1
2867 && TREE_CODE (__t) != __c2)
2868 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2869 return __t;
2872 inline tree
2873 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
2874 enum tree_code __c1, enum tree_code __c2)
2876 if (TREE_CODE (__t) == __c1
2877 || TREE_CODE (__t) == __c2)
2878 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
2879 return __t;
2882 inline tree
2883 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
2884 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2886 if (TREE_CODE (__t) != __c1
2887 && TREE_CODE (__t) != __c2
2888 && TREE_CODE (__t) != __c3)
2889 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2890 return __t;
2893 inline tree
2894 tree_not_check3 (tree __t, const char *__f, int __l, const char *__g,
2895 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
2897 if (TREE_CODE (__t) == __c1
2898 || TREE_CODE (__t) == __c2
2899 || TREE_CODE (__t) == __c3)
2900 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
2901 return __t;
2904 inline tree
2905 tree_check4 (tree __t, const char *__f, int __l, const char *__g,
2906 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2907 enum tree_code __c4)
2909 if (TREE_CODE (__t) != __c1
2910 && TREE_CODE (__t) != __c2
2911 && TREE_CODE (__t) != __c3
2912 && TREE_CODE (__t) != __c4)
2913 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2914 return __t;
2917 inline tree
2918 tree_not_check4 (tree __t, const char *__f, int __l, const char *__g,
2919 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2920 enum tree_code __c4)
2922 if (TREE_CODE (__t) == __c1
2923 || TREE_CODE (__t) == __c2
2924 || TREE_CODE (__t) == __c3
2925 || TREE_CODE (__t) == __c4)
2926 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
2927 return __t;
2930 inline tree
2931 tree_check5 (tree __t, const char *__f, int __l, const char *__g,
2932 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2933 enum tree_code __c4, enum tree_code __c5)
2935 if (TREE_CODE (__t) != __c1
2936 && TREE_CODE (__t) != __c2
2937 && TREE_CODE (__t) != __c3
2938 && TREE_CODE (__t) != __c4
2939 && TREE_CODE (__t) != __c5)
2940 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2941 return __t;
2944 inline tree
2945 tree_not_check5 (tree __t, const char *__f, int __l, const char *__g,
2946 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
2947 enum tree_code __c4, enum tree_code __c5)
2949 if (TREE_CODE (__t) == __c1
2950 || TREE_CODE (__t) == __c2
2951 || TREE_CODE (__t) == __c3
2952 || TREE_CODE (__t) == __c4
2953 || TREE_CODE (__t) == __c5)
2954 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
2955 return __t;
2958 inline tree
2959 contains_struct_check (tree __t, const enum tree_node_structure_enum __s,
2960 const char *__f, int __l, const char *__g)
2962 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
2963 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
2964 return __t;
2967 inline tree
2968 tree_class_check (tree __t, const enum tree_code_class __class,
2969 const char *__f, int __l, const char *__g)
2971 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
2972 tree_class_check_failed (__t, __class, __f, __l, __g);
2973 return __t;
2976 inline tree
2977 tree_range_check (tree __t,
2978 enum tree_code __code1, enum tree_code __code2,
2979 const char *__f, int __l, const char *__g)
2981 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
2982 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
2983 return __t;
2986 inline tree
2987 omp_clause_subcode_check (tree __t, enum omp_clause_code __code,
2988 const char *__f, int __l, const char *__g)
2990 if (TREE_CODE (__t) != OMP_CLAUSE)
2991 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
2992 if (__t->omp_clause.code != __code)
2993 omp_clause_check_failed (__t, __f, __l, __g, __code);
2994 return __t;
2997 inline tree
2998 omp_clause_range_check (tree __t,
2999 enum omp_clause_code __code1,
3000 enum omp_clause_code __code2,
3001 const char *__f, int __l, const char *__g)
3003 if (TREE_CODE (__t) != OMP_CLAUSE)
3004 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3005 if ((int) __t->omp_clause.code < (int) __code1
3006 || (int) __t->omp_clause.code > (int) __code2)
3007 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3008 return __t;
3011 /* These checks have to be special cased. */
3013 inline tree
3014 expr_check (tree __t, const char *__f, int __l, const char *__g)
3016 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3017 if (!IS_EXPR_CODE_CLASS (__c))
3018 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3019 return __t;
3022 /* These checks have to be special cased. */
3024 inline tree
3025 non_type_check (tree __t, const char *__f, int __l, const char *__g)
3027 if (TYPE_P (__t))
3028 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3029 return __t;
3032 inline const HOST_WIDE_INT *
3033 tree_int_cst_elt_check (const_tree __t, int __i,
3034 const char *__f, int __l, const char *__g)
3036 if (TREE_CODE (__t) != INTEGER_CST)
3037 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3038 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3039 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3040 __f, __l, __g);
3041 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3044 inline HOST_WIDE_INT *
3045 tree_int_cst_elt_check (tree __t, int __i,
3046 const char *__f, int __l, const char *__g)
3048 if (TREE_CODE (__t) != INTEGER_CST)
3049 tree_check_failed (__t, __f, __l, __g, INTEGER_CST, 0);
3050 if (__i < 0 || __i >= __t->base.u.int_length.extended)
3051 tree_int_cst_elt_check_failed (__i, __t->base.u.int_length.extended,
3052 __f, __l, __g);
3053 return &CONST_CAST_TREE (__t)->int_cst.val[__i];
3056 inline tree *
3057 tree_vec_elt_check (tree __t, int __i,
3058 const char *__f, int __l, const char *__g)
3060 if (TREE_CODE (__t) != TREE_VEC)
3061 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3062 if (__i < 0 || __i >= __t->base.u.length)
3063 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3064 return &CONST_CAST_TREE (__t)->vec.a[__i];
3067 inline tree *
3068 omp_clause_elt_check (tree __t, int __i,
3069 const char *__f, int __l, const char *__g)
3071 if (TREE_CODE (__t) != OMP_CLAUSE)
3072 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3073 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3074 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3075 return &__t->omp_clause.ops[__i];
3078 /* These checks have to be special cased. */
3080 inline tree
3081 any_integral_type_check (tree __t, const char *__f, int __l, const char *__g)
3083 if (!ANY_INTEGRAL_TYPE_P (__t))
3084 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3085 INTEGER_TYPE, 0);
3086 return __t;
3089 inline const_tree
3090 tree_check (const_tree __t, const char *__f, int __l, const char *__g,
3091 tree_code __c)
3093 if (TREE_CODE (__t) != __c)
3094 tree_check_failed (__t, __f, __l, __g, __c, 0);
3095 return __t;
3098 inline const_tree
3099 tree_not_check (const_tree __t, const char *__f, int __l, const char *__g,
3100 enum tree_code __c)
3102 if (TREE_CODE (__t) == __c)
3103 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3104 return __t;
3107 inline const_tree
3108 tree_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3109 enum tree_code __c1, enum tree_code __c2)
3111 if (TREE_CODE (__t) != __c1
3112 && TREE_CODE (__t) != __c2)
3113 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3114 return __t;
3117 inline const_tree
3118 tree_not_check2 (const_tree __t, const char *__f, int __l, const char *__g,
3119 enum tree_code __c1, enum tree_code __c2)
3121 if (TREE_CODE (__t) == __c1
3122 || TREE_CODE (__t) == __c2)
3123 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3124 return __t;
3127 inline const_tree
3128 tree_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3129 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3131 if (TREE_CODE (__t) != __c1
3132 && TREE_CODE (__t) != __c2
3133 && TREE_CODE (__t) != __c3)
3134 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3135 return __t;
3138 inline const_tree
3139 tree_not_check3 (const_tree __t, const char *__f, int __l, const char *__g,
3140 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3)
3142 if (TREE_CODE (__t) == __c1
3143 || TREE_CODE (__t) == __c2
3144 || TREE_CODE (__t) == __c3)
3145 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0);
3146 return __t;
3149 inline const_tree
3150 tree_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3151 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3152 enum tree_code __c4)
3154 if (TREE_CODE (__t) != __c1
3155 && TREE_CODE (__t) != __c2
3156 && TREE_CODE (__t) != __c3
3157 && TREE_CODE (__t) != __c4)
3158 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3159 return __t;
3162 inline const_tree
3163 tree_not_check4 (const_tree __t, const char *__f, int __l, const char *__g,
3164 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3165 enum tree_code __c4)
3167 if (TREE_CODE (__t) == __c1
3168 || TREE_CODE (__t) == __c2
3169 || TREE_CODE (__t) == __c3
3170 || TREE_CODE (__t) == __c4)
3171 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, 0);
3172 return __t;
3175 inline const_tree
3176 tree_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3177 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3178 enum tree_code __c4, enum tree_code __c5)
3180 if (TREE_CODE (__t) != __c1
3181 && TREE_CODE (__t) != __c2
3182 && TREE_CODE (__t) != __c3
3183 && TREE_CODE (__t) != __c4
3184 && TREE_CODE (__t) != __c5)
3185 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3186 return __t;
3189 inline const_tree
3190 tree_not_check5 (const_tree __t, const char *__f, int __l, const char *__g,
3191 enum tree_code __c1, enum tree_code __c2, enum tree_code __c3,
3192 enum tree_code __c4, enum tree_code __c5)
3194 if (TREE_CODE (__t) == __c1
3195 || TREE_CODE (__t) == __c2
3196 || TREE_CODE (__t) == __c3
3197 || TREE_CODE (__t) == __c4
3198 || TREE_CODE (__t) == __c5)
3199 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, __c4, __c5, 0);
3200 return __t;
3203 inline const_tree
3204 contains_struct_check (const_tree __t, const enum tree_node_structure_enum __s,
3205 const char *__f, int __l, const char *__g)
3207 if (tree_contains_struct[TREE_CODE (__t)][__s] != 1)
3208 tree_contains_struct_check_failed (__t, __s, __f, __l, __g);
3209 return __t;
3212 inline const_tree
3213 tree_class_check (const_tree __t, const enum tree_code_class __class,
3214 const char *__f, int __l, const char *__g)
3216 if (TREE_CODE_CLASS (TREE_CODE (__t)) != __class)
3217 tree_class_check_failed (__t, __class, __f, __l, __g);
3218 return __t;
3221 inline const_tree
3222 tree_range_check (const_tree __t,
3223 enum tree_code __code1, enum tree_code __code2,
3224 const char *__f, int __l, const char *__g)
3226 if (TREE_CODE (__t) < __code1 || TREE_CODE (__t) > __code2)
3227 tree_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3228 return __t;
3231 inline const_tree
3232 omp_clause_subcode_check (const_tree __t, enum omp_clause_code __code,
3233 const char *__f, int __l, const char *__g)
3235 if (TREE_CODE (__t) != OMP_CLAUSE)
3236 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3237 if (__t->omp_clause.code != __code)
3238 omp_clause_check_failed (__t, __f, __l, __g, __code);
3239 return __t;
3242 inline const_tree
3243 omp_clause_range_check (const_tree __t,
3244 enum omp_clause_code __code1,
3245 enum omp_clause_code __code2,
3246 const char *__f, int __l, const char *__g)
3248 if (TREE_CODE (__t) != OMP_CLAUSE)
3249 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3250 if ((int) __t->omp_clause.code < (int) __code1
3251 || (int) __t->omp_clause.code > (int) __code2)
3252 omp_clause_range_check_failed (__t, __f, __l, __g, __code1, __code2);
3253 return __t;
3256 inline const_tree
3257 expr_check (const_tree __t, const char *__f, int __l, const char *__g)
3259 char const __c = TREE_CODE_CLASS (TREE_CODE (__t));
3260 if (!IS_EXPR_CODE_CLASS (__c))
3261 tree_class_check_failed (__t, tcc_expression, __f, __l, __g);
3262 return __t;
3265 inline const_tree
3266 non_type_check (const_tree __t, const char *__f, int __l, const char *__g)
3268 if (TYPE_P (__t))
3269 tree_not_class_check_failed (__t, tcc_type, __f, __l, __g);
3270 return __t;
3273 inline const_tree *
3274 tree_vec_elt_check (const_tree __t, int __i,
3275 const char *__f, int __l, const char *__g)
3277 if (TREE_CODE (__t) != TREE_VEC)
3278 tree_check_failed (__t, __f, __l, __g, TREE_VEC, 0);
3279 if (__i < 0 || __i >= __t->base.u.length)
3280 tree_vec_elt_check_failed (__i, __t->base.u.length, __f, __l, __g);
3281 return CONST_CAST (const_tree *, &__t->vec.a[__i]);
3282 //return &__t->vec.a[__i];
3285 inline const_tree *
3286 omp_clause_elt_check (const_tree __t, int __i,
3287 const char *__f, int __l, const char *__g)
3289 if (TREE_CODE (__t) != OMP_CLAUSE)
3290 tree_check_failed (__t, __f, __l, __g, OMP_CLAUSE, 0);
3291 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code])
3292 omp_clause_operand_check_failed (__i, __t, __f, __l, __g);
3293 return CONST_CAST (const_tree *, &__t->omp_clause.ops[__i]);
3296 inline const_tree
3297 any_integral_type_check (const_tree __t, const char *__f, int __l,
3298 const char *__g)
3300 if (!ANY_INTEGRAL_TYPE_P (__t))
3301 tree_check_failed (__t, __f, __l, __g, BOOLEAN_TYPE, ENUMERAL_TYPE,
3302 INTEGER_TYPE, 0);
3303 return __t;
3306 #endif
3308 /* Compute the number of operands in an expression node NODE. For
3309 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
3310 otherwise it is looked up from the node's code. */
3311 static inline int
3312 tree_operand_length (const_tree node)
3314 if (VL_EXP_CLASS_P (node))
3315 return VL_EXP_OPERAND_LENGTH (node);
3316 else
3317 return TREE_CODE_LENGTH (TREE_CODE (node));
3320 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3322 /* Special checks for TREE_OPERANDs. */
3323 inline tree *
3324 tree_operand_check (tree __t, int __i,
3325 const char *__f, int __l, const char *__g)
3327 const_tree __u = EXPR_CHECK (__t);
3328 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3329 tree_operand_check_failed (__i, __u, __f, __l, __g);
3330 return &CONST_CAST_TREE (__u)->exp.operands[__i];
3333 inline tree *
3334 tree_operand_check_code (tree __t, enum tree_code __code, int __i,
3335 const char *__f, int __l, const char *__g)
3337 if (TREE_CODE (__t) != __code)
3338 tree_check_failed (__t, __f, __l, __g, __code, 0);
3339 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3340 tree_operand_check_failed (__i, __t, __f, __l, __g);
3341 return &__t->exp.operands[__i];
3344 inline const_tree *
3345 tree_operand_check (const_tree __t, int __i,
3346 const char *__f, int __l, const char *__g)
3348 const_tree __u = EXPR_CHECK (__t);
3349 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__u))
3350 tree_operand_check_failed (__i, __u, __f, __l, __g);
3351 return CONST_CAST (const_tree *, &__u->exp.operands[__i]);
3354 inline const_tree *
3355 tree_operand_check_code (const_tree __t, enum tree_code __code, int __i,
3356 const char *__f, int __l, const char *__g)
3358 if (TREE_CODE (__t) != __code)
3359 tree_check_failed (__t, __f, __l, __g, __code, 0);
3360 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t))
3361 tree_operand_check_failed (__i, __t, __f, __l, __g);
3362 return CONST_CAST (const_tree *, &__t->exp.operands[__i]);
3365 #endif
3367 #define error_mark_node global_trees[TI_ERROR_MARK]
3369 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3370 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3371 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3372 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3373 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3375 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3376 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3377 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3378 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3379 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3381 #define atomicQI_type_node global_trees[TI_ATOMICQI_TYPE]
3382 #define atomicHI_type_node global_trees[TI_ATOMICHI_TYPE]
3383 #define atomicSI_type_node global_trees[TI_ATOMICSI_TYPE]
3384 #define atomicDI_type_node global_trees[TI_ATOMICDI_TYPE]
3385 #define atomicTI_type_node global_trees[TI_ATOMICTI_TYPE]
3387 #define uint16_type_node global_trees[TI_UINT16_TYPE]
3388 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3389 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3391 #define void_node global_trees[TI_VOID]
3393 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3394 #define integer_one_node global_trees[TI_INTEGER_ONE]
3395 #define integer_three_node global_trees[TI_INTEGER_THREE]
3396 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3397 #define size_zero_node global_trees[TI_SIZE_ZERO]
3398 #define size_one_node global_trees[TI_SIZE_ONE]
3399 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3400 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3401 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3403 /* Base access nodes. */
3404 #define access_public_node global_trees[TI_PUBLIC]
3405 #define access_protected_node global_trees[TI_PROTECTED]
3406 #define access_private_node global_trees[TI_PRIVATE]
3408 #define null_pointer_node global_trees[TI_NULL_POINTER]
3410 #define float_type_node global_trees[TI_FLOAT_TYPE]
3411 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3412 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3414 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3415 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3416 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3417 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3419 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3420 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3421 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3422 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3424 #define pointer_bounds_type_node global_trees[TI_POINTER_BOUNDS_TYPE]
3426 #define void_type_node global_trees[TI_VOID_TYPE]
3427 /* The C type `void *'. */
3428 #define ptr_type_node global_trees[TI_PTR_TYPE]
3429 /* The C type `const void *'. */
3430 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3431 /* The C type `size_t'. */
3432 #define size_type_node global_trees[TI_SIZE_TYPE]
3433 #define pid_type_node global_trees[TI_PID_TYPE]
3434 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3435 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3436 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3437 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3438 /* The C type `FILE *'. */
3439 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3440 #define pointer_sized_int_node global_trees[TI_POINTER_SIZED_TYPE]
3442 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3443 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3444 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3446 /* The decimal floating point types. */
3447 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3448 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3449 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3450 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3451 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3452 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3454 /* The fixed-point types. */
3455 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3456 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3457 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3458 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3459 #define sat_unsigned_short_fract_type_node \
3460 global_trees[TI_SAT_USFRACT_TYPE]
3461 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3462 #define sat_unsigned_long_fract_type_node \
3463 global_trees[TI_SAT_ULFRACT_TYPE]
3464 #define sat_unsigned_long_long_fract_type_node \
3465 global_trees[TI_SAT_ULLFRACT_TYPE]
3466 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3467 #define fract_type_node global_trees[TI_FRACT_TYPE]
3468 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3469 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3470 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3471 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3472 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3473 #define unsigned_long_long_fract_type_node \
3474 global_trees[TI_ULLFRACT_TYPE]
3475 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3476 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3477 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3478 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3479 #define sat_unsigned_short_accum_type_node \
3480 global_trees[TI_SAT_USACCUM_TYPE]
3481 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3482 #define sat_unsigned_long_accum_type_node \
3483 global_trees[TI_SAT_ULACCUM_TYPE]
3484 #define sat_unsigned_long_long_accum_type_node \
3485 global_trees[TI_SAT_ULLACCUM_TYPE]
3486 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3487 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3488 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3489 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3490 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3491 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3492 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3493 #define unsigned_long_long_accum_type_node \
3494 global_trees[TI_ULLACCUM_TYPE]
3495 #define qq_type_node global_trees[TI_QQ_TYPE]
3496 #define hq_type_node global_trees[TI_HQ_TYPE]
3497 #define sq_type_node global_trees[TI_SQ_TYPE]
3498 #define dq_type_node global_trees[TI_DQ_TYPE]
3499 #define tq_type_node global_trees[TI_TQ_TYPE]
3500 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3501 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3502 #define usq_type_node global_trees[TI_USQ_TYPE]
3503 #define udq_type_node global_trees[TI_UDQ_TYPE]
3504 #define utq_type_node global_trees[TI_UTQ_TYPE]
3505 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3506 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3507 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3508 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3509 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3510 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3511 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3512 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3513 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3514 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3515 #define ha_type_node global_trees[TI_HA_TYPE]
3516 #define sa_type_node global_trees[TI_SA_TYPE]
3517 #define da_type_node global_trees[TI_DA_TYPE]
3518 #define ta_type_node global_trees[TI_TA_TYPE]
3519 #define uha_type_node global_trees[TI_UHA_TYPE]
3520 #define usa_type_node global_trees[TI_USA_TYPE]
3521 #define uda_type_node global_trees[TI_UDA_TYPE]
3522 #define uta_type_node global_trees[TI_UTA_TYPE]
3523 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3524 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3525 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3526 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3527 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3528 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3529 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3530 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3532 /* The node that should be placed at the end of a parameter list to
3533 indicate that the function does not take a variable number of
3534 arguments. The TREE_VALUE will be void_type_node and there will be
3535 no TREE_CHAIN. Language-independent code should not assume
3536 anything else about this node. */
3537 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3539 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3540 #define MAIN_NAME_P(NODE) \
3541 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3543 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3544 functions. */
3545 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3546 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3548 /* Default/current target options (TARGET_OPTION_NODE). */
3549 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3550 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3552 /* Default tree list option(), optimize() pragmas to be linked into the
3553 attribute list. */
3554 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3555 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3557 #define char_type_node integer_types[itk_char]
3558 #define signed_char_type_node integer_types[itk_signed_char]
3559 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3560 #define short_integer_type_node integer_types[itk_short]
3561 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3562 #define integer_type_node integer_types[itk_int]
3563 #define unsigned_type_node integer_types[itk_unsigned_int]
3564 #define long_integer_type_node integer_types[itk_long]
3565 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3566 #define long_long_integer_type_node integer_types[itk_long_long]
3567 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3569 /* True if NODE is an erroneous expression. */
3571 #define error_operand_p(NODE) \
3572 ((NODE) == error_mark_node \
3573 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
3575 extern tree decl_assembler_name (tree);
3576 extern tree decl_comdat_group (const_tree);
3577 extern tree decl_comdat_group_id (const_tree);
3578 extern const char *decl_section_name (const_tree);
3579 extern void set_decl_section_name (tree, const char *);
3580 extern enum tls_model decl_tls_model (const_tree);
3581 extern void set_decl_tls_model (tree, enum tls_model);
3583 /* Compute the number of bytes occupied by 'node'. This routine only
3584 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3586 extern size_t tree_size (const_tree);
3588 /* Compute the number of bytes occupied by a tree with code CODE.
3589 This function cannot be used for TREE_VEC or INTEGER_CST nodes,
3590 which are of variable length. */
3591 extern size_t tree_code_size (enum tree_code);
3593 /* Allocate and return a new UID from the DECL_UID namespace. */
3594 extern int allocate_decl_uid (void);
3596 /* Lowest level primitive for allocating a node.
3597 The TREE_CODE is the only argument. Contents are initialized
3598 to zero except for a few of the common fields. */
3600 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3601 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3603 /* Make a copy of a node, with all the same contents. */
3605 extern tree copy_node_stat (tree MEM_STAT_DECL);
3606 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3608 /* Make a copy of a chain of TREE_LIST nodes. */
3610 extern tree copy_list (tree);
3612 /* Make a CASE_LABEL_EXPR. */
3614 extern tree build_case_label (tree, tree, tree);
3616 /* Make a BINFO. */
3617 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3618 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3620 /* Make an INTEGER_CST. */
3622 extern tree make_int_cst_stat (int, int MEM_STAT_DECL);
3623 #define make_int_cst(LEN, EXT_LEN) \
3624 make_int_cst_stat (LEN, EXT_LEN MEM_STAT_INFO)
3626 /* Make a TREE_VEC. */
3628 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3629 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3631 /* Grow a TREE_VEC. */
3633 extern tree grow_tree_vec_stat (tree v, int MEM_STAT_DECL);
3634 #define grow_tree_vec(v, t) grow_tree_vec_stat (v, t MEM_STAT_INFO)
3636 /* Construct various types of nodes. */
3638 extern tree build_nt (enum tree_code, ...);
3639 extern tree build_nt_call_vec (tree, vec<tree, va_gc> *);
3641 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3642 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3643 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3644 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3645 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3646 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3647 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3648 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3649 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3650 tree MEM_STAT_DECL);
3651 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3652 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3653 tree MEM_STAT_DECL);
3654 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3656 /* _loc versions of build[1-5]. */
3658 static inline tree
3659 build1_stat_loc (location_t loc, enum tree_code code, tree type,
3660 tree arg1 MEM_STAT_DECL)
3662 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
3663 if (CAN_HAVE_LOCATION_P (t))
3664 SET_EXPR_LOCATION (t, loc);
3665 return t;
3667 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
3669 static inline tree
3670 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3671 tree arg1 MEM_STAT_DECL)
3673 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
3674 if (CAN_HAVE_LOCATION_P (t))
3675 SET_EXPR_LOCATION (t, loc);
3676 return t;
3678 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
3680 static inline tree
3681 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3682 tree arg1, tree arg2 MEM_STAT_DECL)
3684 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
3685 if (CAN_HAVE_LOCATION_P (t))
3686 SET_EXPR_LOCATION (t, loc);
3687 return t;
3689 #define build3_loc(l,c,t1,t2,t3,t4) \
3690 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
3692 static inline tree
3693 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3694 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
3696 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
3697 if (CAN_HAVE_LOCATION_P (t))
3698 SET_EXPR_LOCATION (t, loc);
3699 return t;
3701 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
3702 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3704 static inline tree
3705 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
3706 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3708 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
3709 arg4 PASS_MEM_STAT);
3710 if (CAN_HAVE_LOCATION_P (t))
3711 SET_EXPR_LOCATION (t, loc);
3712 return t;
3714 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
3715 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3717 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3718 #define build_var_debug_value(t1,t2) \
3719 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3721 /* Constructs double_int from tree CST. */
3723 extern tree double_int_to_tree (tree, double_int);
3725 extern tree wide_int_to_tree (tree type, const wide_int_ref &cst);
3726 extern tree force_fit_type (tree, const wide_int_ref &, int, bool);
3728 /* Create an INT_CST node with a CST value zero extended. */
3730 /* static inline */
3731 extern tree build_int_cst (tree, HOST_WIDE_INT);
3732 extern tree build_int_cstu (tree type, unsigned HOST_WIDE_INT cst);
3733 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3734 extern tree make_vector_stat (unsigned MEM_STAT_DECL);
3735 #define make_vector(n) make_vector_stat (n MEM_STAT_INFO)
3736 extern tree build_vector_stat (tree, tree * MEM_STAT_DECL);
3737 #define build_vector(t,v) build_vector_stat (t, v MEM_STAT_INFO)
3738 extern tree build_vector_from_ctor (tree, vec<constructor_elt, va_gc> *);
3739 extern tree build_vector_from_val (tree, tree);
3740 extern tree build_constructor (tree, vec<constructor_elt, va_gc> *);
3741 extern tree build_constructor_single (tree, tree, tree);
3742 extern tree build_constructor_from_list (tree, tree);
3743 extern tree build_constructor_va (tree, int, ...);
3744 extern tree build_real_from_int_cst (tree, const_tree);
3745 extern tree build_complex (tree, tree, tree);
3746 extern tree build_one_cst (tree);
3747 extern tree build_minus_one_cst (tree);
3748 extern tree build_all_ones_cst (tree);
3749 extern tree build_zero_cst (tree);
3750 extern tree build_string (int, const char *);
3751 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3752 #define build_tree_list(t, q) build_tree_list_stat (t, q MEM_STAT_INFO)
3753 extern tree build_tree_list_vec_stat (const vec<tree, va_gc> *MEM_STAT_DECL);
3754 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3755 extern tree build_decl_stat (location_t, enum tree_code,
3756 tree, tree MEM_STAT_DECL);
3757 extern tree build_fn_decl (const char *, tree);
3758 #define build_decl(l,c,t,q) build_decl_stat (l, c, t, q MEM_STAT_INFO)
3759 extern tree build_translation_unit_decl (tree);
3760 extern tree build_block (tree, tree, tree, tree);
3761 extern tree build_empty_stmt (location_t);
3762 extern tree build_omp_clause (location_t, enum omp_clause_code);
3764 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3765 #define build_vl_exp(c, n) build_vl_exp_stat (c, n MEM_STAT_INFO)
3767 extern tree build_call_nary (tree, tree, int, ...);
3768 extern tree build_call_valist (tree, tree, int, va_list);
3769 #define build_call_array(T1,T2,N,T3)\
3770 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3771 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3772 extern tree build_call_vec (tree, tree, vec<tree, va_gc> *);
3773 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
3774 extern tree build_call_expr_loc_vec (location_t, tree, vec<tree, va_gc> *);
3775 extern tree build_call_expr_loc (location_t, tree, int, ...);
3776 extern tree build_call_expr (tree, int, ...);
3777 extern tree build_call_expr_internal_loc (location_t, enum internal_fn,
3778 tree, int, ...);
3779 extern tree build_string_literal (int, const char *);
3781 /* Construct various nodes representing data types. */
3783 extern tree signed_or_unsigned_type_for (int, tree);
3784 extern tree signed_type_for (tree);
3785 extern tree unsigned_type_for (tree);
3786 extern tree truth_type_for (tree);
3787 extern tree build_pointer_type_for_mode (tree, machine_mode, bool);
3788 extern tree build_pointer_type (tree);
3789 extern tree build_reference_type_for_mode (tree, machine_mode, bool);
3790 extern tree build_reference_type (tree);
3791 extern tree build_vector_type_for_mode (tree, machine_mode);
3792 extern tree build_vector_type (tree innertype, int nunits);
3793 extern tree build_opaque_vector_type (tree innertype, int nunits);
3794 extern tree build_index_type (tree);
3795 extern tree build_array_type (tree, tree);
3796 extern tree build_nonshared_array_type (tree, tree);
3797 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
3798 extern tree build_function_type (tree, tree);
3799 extern tree build_function_type_list (tree, ...);
3800 extern tree build_varargs_function_type_list (tree, ...);
3801 extern tree build_function_type_array (tree, int, tree *);
3802 extern tree build_varargs_function_type_array (tree, int, tree *);
3803 #define build_function_type_vec(RET, V) \
3804 build_function_type_array (RET, vec_safe_length (V), vec_safe_address (V))
3805 #define build_varargs_function_type_vec(RET, V) \
3806 build_varargs_function_type_array (RET, vec_safe_length (V), \
3807 vec_safe_address (V))
3808 extern tree build_method_type_directly (tree, tree, tree);
3809 extern tree build_method_type (tree, tree);
3810 extern tree build_offset_type (tree, tree);
3811 extern tree build_complex_type (tree);
3812 extern tree array_type_nelts (const_tree);
3814 extern tree value_member (tree, tree);
3815 extern tree purpose_member (const_tree, tree);
3816 extern bool vec_member (const_tree, vec<tree, va_gc> *);
3817 extern tree chain_index (int, tree);
3819 extern int attribute_list_equal (const_tree, const_tree);
3820 extern int attribute_list_contained (const_tree, const_tree);
3821 extern int tree_int_cst_equal (const_tree, const_tree);
3823 extern bool tree_fits_shwi_p (const_tree)
3824 #ifndef ENABLE_TREE_CHECKING
3825 ATTRIBUTE_PURE /* tree_fits_shwi_p is pure only when checking is disabled. */
3826 #endif
3828 extern bool tree_fits_uhwi_p (const_tree)
3829 #ifndef ENABLE_TREE_CHECKING
3830 ATTRIBUTE_PURE /* tree_fits_uhwi_p is pure only when checking is disabled. */
3831 #endif
3833 extern HOST_WIDE_INT tree_to_shwi (const_tree);
3834 extern unsigned HOST_WIDE_INT tree_to_uhwi (const_tree);
3835 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
3836 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
3837 tree_to_shwi (const_tree t)
3839 gcc_assert (tree_fits_shwi_p (t));
3840 return TREE_INT_CST_LOW (t);
3843 extern inline __attribute__ ((__gnu_inline__)) unsigned HOST_WIDE_INT
3844 tree_to_uhwi (const_tree t)
3846 gcc_assert (tree_fits_uhwi_p (t));
3847 return TREE_INT_CST_LOW (t);
3849 #endif
3850 extern int tree_int_cst_sgn (const_tree);
3851 extern int tree_int_cst_sign_bit (const_tree);
3852 extern unsigned int tree_int_cst_min_precision (tree, signop);
3853 extern tree strip_array_types (tree);
3854 extern tree excess_precision_type (tree);
3855 extern bool valid_constant_size_p (const_tree);
3858 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3859 put the prototype here. Rtl.h does declare the prototype if
3860 tree.h had been included. */
3862 extern tree make_tree (tree, rtx);
3864 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3865 is ATTRIBUTE.
3867 Such modified types already made are recorded so that duplicates
3868 are not made. */
3870 extern tree build_type_attribute_variant (tree, tree);
3871 extern tree build_decl_attribute_variant (tree, tree);
3872 extern tree build_type_attribute_qual_variant (tree, tree, int);
3874 /* Return 0 if the attributes for two types are incompatible, 1 if they
3875 are compatible, and 2 if they are nearly compatible (which causes a
3876 warning to be generated). */
3877 extern int comp_type_attributes (const_tree, const_tree);
3879 /* Default versions of target-overridable functions. */
3880 extern tree merge_decl_attributes (tree, tree);
3881 extern tree merge_type_attributes (tree, tree);
3883 /* This function is a private implementation detail of lookup_attribute()
3884 and you should never call it directly. */
3885 extern tree private_lookup_attribute (const char *, size_t, tree);
3887 /* This function is a private implementation detail
3888 of lookup_attribute_by_prefix() and you should never call it directly. */
3889 extern tree private_lookup_attribute_by_prefix (const char *, size_t, tree);
3891 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3892 return a pointer to the attribute's list element if the attribute
3893 is part of the list, or NULL_TREE if not found. If the attribute
3894 appears more than once, this only returns the first occurrence; the
3895 TREE_CHAIN of the return value should be passed back in if further
3896 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
3897 '__text__'). */
3899 static inline tree
3900 lookup_attribute (const char *attr_name, tree list)
3902 gcc_checking_assert (attr_name[0] != '_');
3903 /* In most cases, list is NULL_TREE. */
3904 if (list == NULL_TREE)
3905 return NULL_TREE;
3906 else
3907 /* Do the strlen() before calling the out-of-line implementation.
3908 In most cases attr_name is a string constant, and the compiler
3909 will optimize the strlen() away. */
3910 return private_lookup_attribute (attr_name, strlen (attr_name), list);
3913 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
3914 return a pointer to the attribute's list first element if the attribute
3915 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
3916 '__text__'). */
3918 static inline tree
3919 lookup_attribute_by_prefix (const char *attr_name, tree list)
3921 gcc_checking_assert (attr_name[0] != '_');
3922 /* In most cases, list is NULL_TREE. */
3923 if (list == NULL_TREE)
3924 return NULL_TREE;
3925 else
3926 return private_lookup_attribute_by_prefix (attr_name, strlen (attr_name),
3927 list);
3931 /* This function is a private implementation detail of
3932 is_attribute_p() and you should never call it directly. */
3933 extern bool private_is_attribute_p (const char *, size_t, const_tree);
3935 /* Given an identifier node IDENT and a string ATTR_NAME, return true
3936 if the identifier node is a valid attribute name for the string.
3937 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
3938 be the identifier for 'text' or for '__text__'. */
3940 static inline bool
3941 is_attribute_p (const char *attr_name, const_tree ident)
3943 gcc_checking_assert (attr_name[0] != '_');
3944 /* Do the strlen() before calling the out-of-line implementation.
3945 In most cases attr_name is a string constant, and the compiler
3946 will optimize the strlen() away. */
3947 return private_is_attribute_p (attr_name, strlen (attr_name), ident);
3950 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3951 modified list. ATTR_NAME must be in the form 'text' (not
3952 '__text__'). */
3954 extern tree remove_attribute (const char *, tree);
3956 /* Given two attributes lists, return a list of their union. */
3958 extern tree merge_attributes (tree, tree);
3960 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3961 /* Given two Windows decl attributes lists, possibly including
3962 dllimport, return a list of their union . */
3963 extern tree merge_dllimport_decl_attributes (tree, tree);
3965 /* Handle a "dllimport" or "dllexport" attribute. */
3966 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
3967 #endif
3969 /* Returns true iff unqualified CAND and BASE are equivalent. */
3971 extern bool check_base_type (const_tree cand, const_tree base);
3973 /* Check whether CAND is suitable to be returned from get_qualified_type
3974 (BASE, TYPE_QUALS). */
3976 extern bool check_qualified_type (const_tree, const_tree, int);
3978 /* Return a version of the TYPE, qualified as indicated by the
3979 TYPE_QUALS, if one exists. If no qualified version exists yet,
3980 return NULL_TREE. */
3982 extern tree get_qualified_type (tree, int);
3984 /* Like get_qualified_type, but creates the type if it does not
3985 exist. This function never returns NULL_TREE. */
3987 extern tree build_qualified_type (tree, int);
3989 /* Create a variant of type T with alignment ALIGN. */
3991 extern tree build_aligned_type (tree, unsigned int);
3993 /* Like build_qualified_type, but only deals with the `const' and
3994 `volatile' qualifiers. This interface is retained for backwards
3995 compatibility with the various front-ends; new code should use
3996 build_qualified_type instead. */
3998 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3999 build_qualified_type ((TYPE), \
4000 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4001 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4003 /* Make a copy of a type node. */
4005 extern tree build_distinct_type_copy (tree);
4006 extern tree build_variant_type_copy (tree);
4008 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4009 return a canonicalized ..._TYPE node, so that duplicates are not made.
4010 How the hash code is computed is up to the caller, as long as any two
4011 callers that could hash identical-looking type nodes agree. */
4013 extern tree type_hash_canon (unsigned int, tree);
4015 extern tree convert (tree, tree);
4016 extern unsigned int expr_align (const_tree);
4017 extern tree size_in_bytes (const_tree);
4018 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4019 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4020 extern tree bit_position (const_tree);
4021 extern tree byte_position (const_tree);
4022 extern HOST_WIDE_INT int_byte_position (const_tree);
4024 #define sizetype sizetype_tab[(int) stk_sizetype]
4025 #define bitsizetype sizetype_tab[(int) stk_bitsizetype]
4026 #define ssizetype sizetype_tab[(int) stk_ssizetype]
4027 #define sbitsizetype sizetype_tab[(int) stk_sbitsizetype]
4028 #define size_int(L) size_int_kind (L, stk_sizetype)
4029 #define ssize_int(L) size_int_kind (L, stk_ssizetype)
4030 #define bitsize_int(L) size_int_kind (L, stk_bitsizetype)
4031 #define sbitsize_int(L) size_int_kind (L, stk_sbitsizetype)
4033 /* Type for sizes of data-type. */
4035 #define BITS_PER_UNIT_LOG \
4036 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4037 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4038 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4040 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4041 by making the last node in X point to Y.
4042 Returns X, except if X is 0 returns Y. */
4044 extern tree chainon (tree, tree);
4046 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4048 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4049 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4051 /* Return the last tree node in a chain. */
4053 extern tree tree_last (tree);
4055 /* Reverse the order of elements in a chain, and return the new head. */
4057 extern tree nreverse (tree);
4059 /* Returns the length of a chain of nodes
4060 (number of chain pointers to follow before reaching a null pointer). */
4062 extern int list_length (const_tree);
4064 /* Returns the first FIELD_DECL in a type. */
4066 extern tree first_field (const_tree);
4068 /* Given an initializer INIT, return TRUE if INIT is zero or some
4069 aggregate of zeros. Otherwise return FALSE. */
4071 extern bool initializer_zerop (const_tree);
4073 /* Given a vector VEC, return its first element if all elements are
4074 the same. Otherwise return NULL_TREE. */
4076 extern tree uniform_vector_p (const_tree);
4078 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4080 extern vec<tree, va_gc> *ctor_to_vec (tree);
4082 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4084 extern int integer_zerop (const_tree);
4086 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4088 extern int integer_onep (const_tree);
4090 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1, or
4091 a vector or complex where each part is 1. */
4093 extern int integer_each_onep (const_tree);
4095 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4096 all of whose significant bits are 1. */
4098 extern int integer_all_onesp (const_tree);
4100 /* integer_minus_onep (tree x) is nonzero if X is an integer constant of
4101 value -1. */
4103 extern int integer_minus_onep (const_tree);
4105 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4106 exactly one bit 1. */
4108 extern int integer_pow2p (const_tree);
4110 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4111 with a nonzero value. */
4113 extern int integer_nonzerop (const_tree);
4115 /* integer_truep (tree x) is nonzero if X is an integer constant of value 1 or
4116 a vector where each element is an integer constant of value -1. */
4118 extern int integer_truep (const_tree);
4120 extern bool cst_and_fits_in_hwi (const_tree);
4121 extern tree num_ending_zeros (const_tree);
4123 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4124 value 0. */
4126 extern int fixed_zerop (const_tree);
4128 /* staticp (tree x) is nonzero if X is a reference to data allocated
4129 at a fixed address in memory. Returns the outermost data. */
4131 extern tree staticp (tree);
4133 /* save_expr (EXP) returns an expression equivalent to EXP
4134 but it can be used multiple times within context CTX
4135 and only evaluate EXP once. */
4137 extern tree save_expr (tree);
4139 /* Look inside EXPR into any simple arithmetic operations. Return the
4140 outermost non-arithmetic or non-invariant node. */
4142 extern tree skip_simple_arithmetic (tree);
4144 /* Look inside EXPR into simple arithmetic operations involving constants.
4145 Return the outermost non-arithmetic or non-constant node. */
4147 extern tree skip_simple_constant_arithmetic (tree);
4149 /* Return which tree structure is used by T. */
4151 enum tree_node_structure_enum tree_node_structure (const_tree);
4153 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4154 size or offset that depends on a field within a record. */
4156 extern bool contains_placeholder_p (const_tree);
4158 /* This macro calls the above function but short-circuits the common
4159 case of a constant to save time. Also check for null. */
4161 #define CONTAINS_PLACEHOLDER_P(EXP) \
4162 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4164 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4165 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4166 field positions. */
4168 extern bool type_contains_placeholder_p (tree);
4170 /* Given a tree EXP, find all occurrences of references to fields
4171 in a PLACEHOLDER_EXPR and place them in vector REFS without
4172 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4173 we assume here that EXP contains only arithmetic expressions
4174 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4175 argument list. */
4177 extern void find_placeholder_in_expr (tree, vec<tree> *);
4179 /* This macro calls the above function but short-circuits the common
4180 case of a constant to save time and also checks for NULL. */
4182 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4183 do { \
4184 if((EXP) && !TREE_CONSTANT (EXP)) \
4185 find_placeholder_in_expr (EXP, V); \
4186 } while (0)
4188 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4189 return a tree with all occurrences of references to F in a
4190 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4191 CONST_DECLs. Note that we assume here that EXP contains only
4192 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4193 occurring only in their argument list. */
4195 extern tree substitute_in_expr (tree, tree, tree);
4197 /* This macro calls the above function but short-circuits the common
4198 case of a constant to save time and also checks for NULL. */
4200 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4201 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4203 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4204 for it within OBJ, a tree that is an object or a chain of references. */
4206 extern tree substitute_placeholder_in_expr (tree, tree);
4208 /* This macro calls the above function but short-circuits the common
4209 case of a constant to save time and also checks for NULL. */
4211 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4212 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4213 : substitute_placeholder_in_expr (EXP, OBJ))
4216 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4217 but it can be used multiple times
4218 and only evaluate the subexpressions once. */
4220 extern tree stabilize_reference (tree);
4222 /* Return EXP, stripped of any conversions to wider types
4223 in such a way that the result of converting to type FOR_TYPE
4224 is the same as if EXP were converted to FOR_TYPE.
4225 If FOR_TYPE is 0, it signifies EXP's type. */
4227 extern tree get_unwidened (tree, tree);
4229 /* Return OP or a simpler expression for a narrower value
4230 which can be sign-extended or zero-extended to give back OP.
4231 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4232 or 0 if the value should be sign-extended. */
4234 extern tree get_narrower (tree, int *);
4236 /* Return true if T is an expression that get_inner_reference handles. */
4238 static inline bool
4239 handled_component_p (const_tree t)
4241 switch (TREE_CODE (t))
4243 case COMPONENT_REF:
4244 case BIT_FIELD_REF:
4245 case ARRAY_REF:
4246 case ARRAY_RANGE_REF:
4247 case REALPART_EXPR:
4248 case IMAGPART_EXPR:
4249 case VIEW_CONVERT_EXPR:
4250 return true;
4252 default:
4253 return false;
4257 /* Given a DECL or TYPE, return the scope in which it was declared, or
4258 NUL_TREE if there is no containing scope. */
4260 extern tree get_containing_scope (const_tree);
4262 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4263 or zero if none. */
4264 extern tree decl_function_context (const_tree);
4266 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4267 this _DECL with its context, or zero if none. */
4268 extern tree decl_type_context (const_tree);
4270 /* Return 1 if EXPR is the real constant zero. */
4271 extern int real_zerop (const_tree);
4273 /* Initialize the iterator I with arguments from function FNDECL */
4275 static inline void
4276 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4278 i->next = TYPE_ARG_TYPES (fntype);
4281 /* Return a pointer that holds the next argument if there are more arguments to
4282 handle, otherwise return NULL. */
4284 static inline tree *
4285 function_args_iter_cond_ptr (function_args_iterator *i)
4287 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4290 /* Return the next argument if there are more arguments to handle, otherwise
4291 return NULL. */
4293 static inline tree
4294 function_args_iter_cond (function_args_iterator *i)
4296 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4299 /* Advance to the next argument. */
4300 static inline void
4301 function_args_iter_next (function_args_iterator *i)
4303 gcc_assert (i->next != NULL_TREE);
4304 i->next = TREE_CHAIN (i->next);
4307 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4309 static inline bool
4310 inlined_function_outer_scope_p (const_tree block)
4312 return LOCATION_LOCUS (BLOCK_SOURCE_LOCATION (block)) != UNKNOWN_LOCATION;
4315 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4316 to point to the next tree element. ITER is an instance of
4317 function_args_iterator used to iterate the arguments. */
4318 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4319 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4320 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4321 function_args_iter_next (&(ITER)))
4323 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4324 to the next tree element. ITER is an instance of function_args_iterator
4325 used to iterate the arguments. */
4326 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4327 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4328 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4329 function_args_iter_next (&(ITER)))
4331 /* In tree.c */
4332 extern unsigned crc32_string (unsigned, const char *);
4333 extern unsigned crc32_byte (unsigned, char);
4334 extern unsigned crc32_unsigned (unsigned, unsigned);
4335 extern void clean_symbol_name (char *);
4336 extern tree get_file_function_name (const char *);
4337 extern tree get_callee_fndecl (const_tree);
4338 extern int type_num_arguments (const_tree);
4339 extern bool associative_tree_code (enum tree_code);
4340 extern bool commutative_tree_code (enum tree_code);
4341 extern bool commutative_ternary_tree_code (enum tree_code);
4342 extern tree upper_bound_in_type (tree, tree);
4343 extern tree lower_bound_in_type (tree, tree);
4344 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4345 extern tree create_artificial_label (location_t);
4346 extern const char *get_name (tree);
4347 extern bool stdarg_p (const_tree);
4348 extern bool prototype_p (tree);
4349 extern bool is_typedef_decl (tree x);
4350 extern bool typedef_variant_p (tree);
4351 extern bool auto_var_in_fn_p (const_tree, const_tree);
4352 extern tree build_low_bits_mask (tree, unsigned);
4353 extern bool tree_nop_conversion_p (const_tree, const_tree);
4354 extern tree tree_strip_nop_conversions (tree);
4355 extern tree tree_strip_sign_nop_conversions (tree);
4356 extern const_tree strip_invariant_refs (const_tree);
4357 extern tree lhd_gcc_personality (void);
4358 extern void assign_assembler_name_if_neeeded (tree);
4359 extern void warn_deprecated_use (tree, tree);
4360 extern void cache_integer_cst (tree);
4362 /* Compare and hash for any structure which begins with a canonical
4363 pointer. Assumes all pointers are interchangeable, which is sort
4364 of already assumed by gcc elsewhere IIRC. */
4366 static inline int
4367 struct_ptr_eq (const void *a, const void *b)
4369 const void * const * x = (const void * const *) a;
4370 const void * const * y = (const void * const *) b;
4371 return *x == *y;
4374 static inline hashval_t
4375 struct_ptr_hash (const void *a)
4377 const void * const * x = (const void * const *) a;
4378 return (intptr_t)*x >> 4;
4381 /* Return nonzero if CODE is a tree code that represents a truth value. */
4382 static inline bool
4383 truth_value_p (enum tree_code code)
4385 return (TREE_CODE_CLASS (code) == tcc_comparison
4386 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4387 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4388 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4391 /* Return whether TYPE is a type suitable for an offset for
4392 a POINTER_PLUS_EXPR. */
4393 static inline bool
4394 ptrofftype_p (tree type)
4396 return (INTEGRAL_TYPE_P (type)
4397 && TYPE_PRECISION (type) == TYPE_PRECISION (sizetype)
4398 && TYPE_UNSIGNED (type) == TYPE_UNSIGNED (sizetype));
4401 /* Return OFF converted to a pointer offset type suitable as offset for
4402 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
4403 static inline tree
4404 convert_to_ptrofftype_loc (location_t loc, tree off)
4406 return fold_convert_loc (loc, sizetype, off);
4408 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
4410 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4411 static inline tree
4412 fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off)
4414 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4415 ptr, convert_to_ptrofftype_loc (loc, off));
4417 #define fold_build_pointer_plus(p,o) \
4418 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
4420 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
4421 static inline tree
4422 fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off)
4424 return fold_build2_loc (loc, POINTER_PLUS_EXPR, TREE_TYPE (ptr),
4425 ptr, size_int (off));
4427 #define fold_build_pointer_plus_hwi(p,o) \
4428 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
4430 extern tree strip_float_extensions (tree);
4431 extern int really_constant_p (const_tree);
4432 extern bool decl_address_invariant_p (const_tree);
4433 extern bool decl_address_ip_invariant_p (const_tree);
4434 extern bool int_fits_type_p (const_tree, const_tree);
4435 #ifndef GENERATOR_FILE
4436 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4437 #endif
4438 extern bool variably_modified_type_p (tree, tree);
4439 extern int tree_log2 (const_tree);
4440 extern int tree_floor_log2 (const_tree);
4441 extern unsigned int tree_ctz (const_tree);
4442 extern int simple_cst_equal (const_tree, const_tree);
4444 namespace inchash
4447 extern void add_expr (const_tree, hash &);
4451 /* Compat version until all callers are converted. Return hash for
4452 TREE with SEED. */
4453 static inline hashval_t iterative_hash_expr(const_tree tree, hashval_t seed)
4455 inchash::hash hstate (seed);
4456 inchash::add_expr (tree, hstate);
4457 return hstate.end ();
4460 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4461 extern int type_list_equal (const_tree, const_tree);
4462 extern int chain_member (const_tree, const_tree);
4463 extern void dump_tree_statistics (void);
4464 extern void recompute_tree_invariant_for_addr_expr (tree);
4465 extern bool needs_to_live_in_memory (const_tree);
4466 extern tree reconstruct_complex_type (tree, tree);
4467 extern int real_onep (const_tree);
4468 extern int real_minus_onep (const_tree);
4469 extern void init_ttree (void);
4470 extern void build_common_tree_nodes (bool, bool);
4471 extern void build_common_builtin_nodes (void);
4472 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4473 extern tree build_range_type (tree, tree, tree);
4474 extern tree build_nonshared_range_type (tree, tree, tree);
4475 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4476 extern HOST_WIDE_INT int_cst_value (const_tree);
4477 extern tree tree_block (tree);
4478 extern void tree_set_block (tree, tree);
4479 extern location_t *block_nonartificial_location (tree);
4480 extern location_t tree_nonartificial_location (tree);
4481 extern tree block_ultimate_origin (const_tree);
4482 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
4483 extern bool virtual_method_call_p (tree);
4484 extern tree obj_type_ref_class (tree ref);
4485 extern bool types_same_for_odr (const_tree type1, const_tree type2);
4486 extern bool contains_bitfld_component_ref_p (const_tree);
4487 extern bool type_in_anonymous_namespace_p (const_tree);
4488 extern bool block_may_fallthru (const_tree);
4489 extern void using_eh_for_cleanups (void);
4490 extern bool using_eh_for_cleanups_p (void);
4491 extern const char *get_tree_code_name (enum tree_code);
4492 extern void set_call_expr_flags (tree, int);
4493 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, hash_set<tree>*,
4494 walk_tree_lh);
4495 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
4496 walk_tree_lh);
4497 #define walk_tree(a,b,c,d) \
4498 walk_tree_1 (a, b, c, d, NULL)
4499 #define walk_tree_without_duplicates(a,b,c) \
4500 walk_tree_without_duplicates_1 (a, b, c, NULL)
4502 extern tree get_base_address (tree t);
4503 extern tree drop_tree_overflow (tree);
4504 extern int tree_map_base_eq (const void *, const void *);
4505 extern unsigned int tree_map_base_hash (const void *);
4506 extern int tree_map_base_marked_p (const void *);
4508 #define tree_map_eq tree_map_base_eq
4509 extern unsigned int tree_map_hash (const void *);
4510 #define tree_map_marked_p tree_map_base_marked_p
4512 #define tree_decl_map_eq tree_map_base_eq
4513 extern unsigned int tree_decl_map_hash (const void *);
4514 #define tree_decl_map_marked_p tree_map_base_marked_p
4516 struct tree_decl_map_cache_hasher : ggc_cache_hasher<tree_decl_map *>
4518 static hashval_t hash (tree_decl_map *m) { return tree_decl_map_hash (m); }
4519 static bool
4520 equal (tree_decl_map *a, tree_decl_map *b)
4522 return tree_decl_map_eq (a, b);
4525 static void
4526 handle_cache_entry (tree_decl_map *&m)
4528 extern void gt_ggc_mx (tree_decl_map *&);
4529 if (m == HTAB_EMPTY_ENTRY || m == HTAB_DELETED_ENTRY)
4530 return;
4531 else if (ggc_marked_p (m->base.from))
4532 gt_ggc_mx (m);
4533 else
4534 m = static_cast<tree_decl_map *> (HTAB_DELETED_ENTRY);
4538 #define tree_int_map_eq tree_map_base_eq
4539 #define tree_int_map_hash tree_map_base_hash
4540 #define tree_int_map_marked_p tree_map_base_marked_p
4542 #define tree_vec_map_eq tree_map_base_eq
4543 #define tree_vec_map_hash tree_decl_map_hash
4544 #define tree_vec_map_marked_p tree_map_base_marked_p
4546 /* Initialize the abstract argument list iterator object ITER with the
4547 arguments from CALL_EXPR node EXP. */
4548 static inline void
4549 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
4551 iter->t = exp;
4552 iter->n = call_expr_nargs (exp);
4553 iter->i = 0;
4556 static inline void
4557 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
4559 iter->t = exp;
4560 iter->n = call_expr_nargs (exp);
4561 iter->i = 0;
4564 /* Return the next argument from abstract argument list iterator object ITER,
4565 and advance its state. Return NULL_TREE if there are no more arguments. */
4566 static inline tree
4567 next_call_expr_arg (call_expr_arg_iterator *iter)
4569 tree result;
4570 if (iter->i >= iter->n)
4571 return NULL_TREE;
4572 result = CALL_EXPR_ARG (iter->t, iter->i);
4573 iter->i++;
4574 return result;
4577 static inline const_tree
4578 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
4580 const_tree result;
4581 if (iter->i >= iter->n)
4582 return NULL_TREE;
4583 result = CALL_EXPR_ARG (iter->t, iter->i);
4584 iter->i++;
4585 return result;
4588 /* Initialize the abstract argument list iterator object ITER, then advance
4589 past and return the first argument. Useful in for expressions, e.g.
4590 for (arg = first_call_expr_arg (exp, &iter); arg;
4591 arg = next_call_expr_arg (&iter)) */
4592 static inline tree
4593 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
4595 init_call_expr_arg_iterator (exp, iter);
4596 return next_call_expr_arg (iter);
4599 static inline const_tree
4600 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
4602 init_const_call_expr_arg_iterator (exp, iter);
4603 return next_const_call_expr_arg (iter);
4606 /* Test whether there are more arguments in abstract argument list iterator
4607 ITER, without changing its state. */
4608 static inline bool
4609 more_call_expr_args_p (const call_expr_arg_iterator *iter)
4611 return (iter->i < iter->n);
4614 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
4615 (of type call_expr_arg_iterator) to hold the iteration state. */
4616 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
4617 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
4618 (arg) = next_call_expr_arg (&(iter)))
4620 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
4621 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
4622 (arg) = next_const_call_expr_arg (&(iter)))
4624 /* Return true if tree node T is a language-specific node. */
4625 static inline bool
4626 is_lang_specific (tree t)
4628 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
4631 /* Valid builtin number. */
4632 #define BUILTIN_VALID_P(FNCODE) \
4633 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
4635 /* Return the tree node for an explicit standard builtin function or NULL. */
4636 static inline tree
4637 builtin_decl_explicit (enum built_in_function fncode)
4639 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4641 return builtin_info.decl[(size_t)fncode];
4644 /* Return the tree node for an implicit builtin function or NULL. */
4645 static inline tree
4646 builtin_decl_implicit (enum built_in_function fncode)
4648 size_t uns_fncode = (size_t)fncode;
4649 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4651 if (!builtin_info.implicit_p[uns_fncode])
4652 return NULL_TREE;
4654 return builtin_info.decl[uns_fncode];
4657 /* Set explicit builtin function nodes and whether it is an implicit
4658 function. */
4660 static inline void
4661 set_builtin_decl (enum built_in_function fncode, tree decl, bool implicit_p)
4663 size_t ufncode = (size_t)fncode;
4665 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4666 && (decl != NULL_TREE || !implicit_p));
4668 builtin_info.decl[ufncode] = decl;
4669 builtin_info.implicit_p[ufncode] = implicit_p;
4672 /* Set the implicit flag for a builtin function. */
4674 static inline void
4675 set_builtin_decl_implicit_p (enum built_in_function fncode, bool implicit_p)
4677 size_t uns_fncode = (size_t)fncode;
4679 gcc_checking_assert (BUILTIN_VALID_P (fncode)
4680 && builtin_info.decl[uns_fncode] != NULL_TREE);
4682 builtin_info.implicit_p[uns_fncode] = implicit_p;
4685 /* Return whether the standard builtin function can be used as an explicit
4686 function. */
4688 static inline bool
4689 builtin_decl_explicit_p (enum built_in_function fncode)
4691 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4692 return (builtin_info.decl[(size_t)fncode] != NULL_TREE);
4695 /* Return whether the standard builtin function can be used implicitly. */
4697 static inline bool
4698 builtin_decl_implicit_p (enum built_in_function fncode)
4700 size_t uns_fncode = (size_t)fncode;
4702 gcc_checking_assert (BUILTIN_VALID_P (fncode));
4703 return (builtin_info.decl[uns_fncode] != NULL_TREE
4704 && builtin_info.implicit_p[uns_fncode]);
4707 /* Return true if T (assumed to be a DECL) is a global variable.
4708 A variable is considered global if its storage is not automatic. */
4710 static inline bool
4711 is_global_var (const_tree t)
4713 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
4716 /* Return true if VAR may be aliased. A variable is considered as
4717 maybe aliased if it has its address taken by the local TU
4718 or possibly by another TU and might be modified through a pointer. */
4720 static inline bool
4721 may_be_aliased (const_tree var)
4723 return (TREE_CODE (var) != CONST_DECL
4724 && (TREE_PUBLIC (var)
4725 || DECL_EXTERNAL (var)
4726 || TREE_ADDRESSABLE (var))
4727 && !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
4728 && ((TREE_READONLY (var)
4729 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
4730 || (TREE_CODE (var) == VAR_DECL
4731 && DECL_NONALIASED (var)))));
4734 /* Return pointer to optimization flags of FNDECL. */
4735 static inline struct cl_optimization *
4736 opts_for_fn (const_tree fndecl)
4738 tree fn_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl);
4739 if (fn_opts == NULL_TREE)
4740 fn_opts = optimization_default_node;
4741 return TREE_OPTIMIZATION (fn_opts);
4744 /* opt flag for function FNDECL, e.g. opts_for_fn (fndecl, optimize) is
4745 the optimization level of function fndecl. */
4746 #define opt_for_fn(fndecl, opt) (opts_for_fn (fndecl)->x_##opt)
4748 /* For anonymous aggregate types, we need some sort of name to
4749 hold on to. In practice, this should not appear, but it should
4750 not be harmful if it does. */
4751 #ifndef NO_DOT_IN_LABEL
4752 #define ANON_AGGRNAME_FORMAT "._%d"
4753 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '.' \
4754 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4755 #else /* NO_DOT_IN_LABEL */
4756 #ifndef NO_DOLLAR_IN_LABEL
4757 #define ANON_AGGRNAME_FORMAT "$_%d"
4758 #define ANON_AGGRNAME_P(ID_NODE) (IDENTIFIER_POINTER (ID_NODE)[0] == '$' \
4759 && IDENTIFIER_POINTER (ID_NODE)[1] == '_')
4760 #else /* NO_DOLLAR_IN_LABEL */
4761 #define ANON_AGGRNAME_PREFIX "__anon_"
4762 #define ANON_AGGRNAME_P(ID_NODE) \
4763 (!strncmp (IDENTIFIER_POINTER (ID_NODE), ANON_AGGRNAME_PREFIX, \
4764 sizeof (ANON_AGGRNAME_PREFIX) - 1))
4765 #define ANON_AGGRNAME_FORMAT "__anon_%d"
4766 #endif /* NO_DOLLAR_IN_LABEL */
4767 #endif /* NO_DOT_IN_LABEL */
4769 /* The tree and const_tree overload templates. */
4770 namespace wi
4772 template <>
4773 struct int_traits <const_tree>
4775 static const enum precision_type precision_type = VAR_PRECISION;
4776 static const bool host_dependent_precision = false;
4777 static const bool is_sign_extended = false;
4778 static unsigned int get_precision (const_tree);
4779 static wi::storage_ref decompose (HOST_WIDE_INT *, unsigned int,
4780 const_tree);
4783 template <>
4784 struct int_traits <tree> : public int_traits <const_tree> {};
4786 template <int N>
4787 class extended_tree
4789 private:
4790 const_tree m_t;
4792 public:
4793 extended_tree (const_tree);
4795 unsigned int get_precision () const;
4796 const HOST_WIDE_INT *get_val () const;
4797 unsigned int get_len () const;
4800 template <int N>
4801 struct int_traits <extended_tree <N> >
4803 static const enum precision_type precision_type = CONST_PRECISION;
4804 static const bool host_dependent_precision = false;
4805 static const bool is_sign_extended = true;
4806 static const unsigned int precision = N;
4809 generic_wide_int <extended_tree <WIDE_INT_MAX_PRECISION> >
4810 to_widest (const_tree);
4812 generic_wide_int <extended_tree <ADDR_MAX_PRECISION> > to_offset (const_tree);
4815 inline unsigned int
4816 wi::int_traits <const_tree>::get_precision (const_tree tcst)
4818 return TYPE_PRECISION (TREE_TYPE (tcst));
4821 /* Convert the tree_cst X into a wide_int of PRECISION. */
4822 inline wi::storage_ref
4823 wi::int_traits <const_tree>::decompose (HOST_WIDE_INT *,
4824 unsigned int precision, const_tree x)
4826 return wi::storage_ref (&TREE_INT_CST_ELT (x, 0), TREE_INT_CST_NUNITS (x),
4827 precision);
4830 inline generic_wide_int <wi::extended_tree <WIDE_INT_MAX_PRECISION> >
4831 wi::to_widest (const_tree t)
4833 return t;
4836 inline generic_wide_int <wi::extended_tree <ADDR_MAX_PRECISION> >
4837 wi::to_offset (const_tree t)
4839 return t;
4842 template <int N>
4843 inline wi::extended_tree <N>::extended_tree (const_tree t)
4844 : m_t (t)
4846 gcc_checking_assert (TYPE_PRECISION (TREE_TYPE (t)) <= N);
4849 template <int N>
4850 inline unsigned int
4851 wi::extended_tree <N>::get_precision () const
4853 return N;
4856 template <int N>
4857 inline const HOST_WIDE_INT *
4858 wi::extended_tree <N>::get_val () const
4860 return &TREE_INT_CST_ELT (m_t, 0);
4863 template <int N>
4864 inline unsigned int
4865 wi::extended_tree <N>::get_len () const
4867 if (N == ADDR_MAX_PRECISION)
4868 return TREE_INT_CST_OFFSET_NUNITS (m_t);
4869 else if (N >= WIDE_INT_MAX_PRECISION)
4870 return TREE_INT_CST_EXT_NUNITS (m_t);
4871 else
4872 /* This class is designed to be used for specific output precisions
4873 and needs to be as fast as possible, so there is no fallback for
4874 other casees. */
4875 gcc_unreachable ();
4878 namespace wi
4880 template <typename T>
4881 bool fits_to_tree_p (const T &x, const_tree);
4883 wide_int min_value (const_tree);
4884 wide_int max_value (const_tree);
4885 wide_int from_mpz (const_tree, mpz_t, bool);
4888 template <typename T>
4889 bool
4890 wi::fits_to_tree_p (const T &x, const_tree type)
4892 if (TYPE_SIGN (type) == UNSIGNED)
4893 return eq_p (x, zext (x, TYPE_PRECISION (type)));
4894 else
4895 return eq_p (x, sext (x, TYPE_PRECISION (type)));
4898 /* Produce the smallest number that is represented in TYPE. The precision
4899 and sign are taken from TYPE. */
4900 inline wide_int
4901 wi::min_value (const_tree type)
4903 return min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
4906 /* Produce the largest number that is represented in TYPE. The precision
4907 and sign are taken from TYPE. */
4908 inline wide_int
4909 wi::max_value (const_tree type)
4911 return max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
4914 /* Return true if INTEGER_CST T1 is less than INTEGER_CST T2,
4915 extending both according to their respective TYPE_SIGNs. */
4917 inline bool
4918 tree_int_cst_lt (const_tree t1, const_tree t2)
4920 return wi::lts_p (wi::to_widest (t1), wi::to_widest (t2));
4923 /* Return true if INTEGER_CST T1 is less than or equal to INTEGER_CST T2,
4924 extending both according to their respective TYPE_SIGNs. */
4926 inline bool
4927 tree_int_cst_le (const_tree t1, const_tree t2)
4929 return wi::les_p (wi::to_widest (t1), wi::to_widest (t2));
4932 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. T1 and T2
4933 are both INTEGER_CSTs and their values are extended according to their
4934 respective TYPE_SIGNs. */
4936 inline int
4937 tree_int_cst_compare (const_tree t1, const_tree t2)
4939 return wi::cmps (wi::to_widest (t1), wi::to_widest (t2));
4942 /* FIXME - These declarations belong in builtins.h, expr.h and emit-rtl.h,
4943 but none of these files are allowed to be included from front ends.
4944 They should be split in two. One suitable for the FEs, the other suitable
4945 for the BE. */
4947 /* Assign the RTX to declaration. */
4948 extern void set_decl_rtl (tree, rtx);
4949 extern bool complete_ctor_at_level_p (const_tree, HOST_WIDE_INT, const_tree);
4951 /* Return a tree representing the upper bound of the array mentioned in
4952 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4953 extern tree array_ref_up_bound (tree);
4955 extern tree build_personality_function (const char *);
4957 /* Given an expression EXP that is a handled_component_p,
4958 look for the ultimate containing object, which is returned and specify
4959 the access position and size. */
4960 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4961 tree *, machine_mode *, int *, int *,
4962 bool);
4964 /* Return a tree representing the lower bound of the array mentioned in
4965 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4966 extern tree array_ref_low_bound (tree);
4969 struct GTY(()) int_n_trees_t {
4970 /* These parts are initialized at runtime */
4971 tree signed_type;
4972 tree unsigned_type;
4975 /* This is also in machmode.h */
4976 extern bool int_n_enabled_p[NUM_INT_N_ENTS];
4977 extern GTY(()) struct int_n_trees_t int_n_trees[NUM_INT_N_ENTS];
4979 /* Like bit_position, but return as an integer. It must be representable in
4980 that way (since it could be a signed value, we don't have the
4981 option of returning -1 like int_size_in_byte can. */
4983 inline HOST_WIDE_INT
4984 int_bit_position (const_tree field)
4986 return (wi::lshift (wi::to_offset (DECL_FIELD_OFFSET (field)), BITS_PER_UNIT_LOG)
4987 + wi::to_offset (DECL_FIELD_BIT_OFFSET (field))).to_shwi ();
4990 extern void gt_ggc_mx (tree &);
4991 extern void gt_pch_nx (tree &);
4992 extern void gt_pch_nx (tree &, gt_pointer_operator, void *);
4994 #endif /* GCC_TREE_H */