1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
27 #include "statistics.h"
30 /* Codes of tree nodes */
32 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 LAST_AND_UNUSED_TREE_CODE
/* A convenient way to get a value for
43 extern unsigned char tree_contains_struct
[256][64];
44 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
46 /* Number of language-independent tree codes. */
47 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
49 /* Tree code classes. */
51 /* Each tree_code has an associated code class represented by a
54 enum tree_code_class
{
55 tcc_exceptional
, /* An exceptional code (fits no category). */
56 tcc_constant
, /* A constant. */
57 /* Order of tcc_type and tcc_declaration is important. */
58 tcc_type
, /* A type object code. */
59 tcc_declaration
, /* A declaration (also serving as variable refs). */
60 tcc_reference
, /* A reference to storage. */
61 tcc_comparison
, /* A comparison expression. */
62 tcc_unary
, /* A unary arithmetic expression. */
63 tcc_binary
, /* A binary arithmetic expression. */
64 tcc_statement
, /* A statement expression, which have side effects
65 but usually no interesting value. */
66 tcc_expression
/* Any other expression. */
69 /* Each tree code class has an associated string representation.
70 These must correspond to the tree_code_class entries. */
72 extern const char *const tree_code_class_strings
[];
74 /* Returns the string representing CLASS. */
76 #define TREE_CODE_CLASS_STRING(CLASS)\
77 tree_code_class_strings[(int) (CLASS)]
79 #define MAX_TREE_CODES 256
80 extern const enum tree_code_class tree_code_type
[];
81 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
83 /* Nonzero if CODE represents an exceptional code. */
85 #define EXCEPTIONAL_CLASS_P(CODE)\
86 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
88 /* Nonzero if CODE represents a constant. */
90 #define CONSTANT_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
93 /* Nonzero if CODE represents a type. */
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
98 /* Nonzero if CODE represents a declaration. */
100 #define DECL_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
103 /* Nonzero if CODE represents a memory tag. */
105 #define MTAG_P(CODE) \
106 (TREE_CODE (CODE) == STRUCT_FIELD_TAG \
107 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
108 || TREE_CODE (CODE) == TYPE_MEMORY_TAG)
111 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
113 #define VAR_OR_FUNCTION_DECL_P(DECL)\
114 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
116 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
117 ascending code order. */
119 #define INDIRECT_REF_P(CODE)\
120 (TREE_CODE (CODE) == INDIRECT_REF \
121 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
122 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
124 /* Nonzero if CODE represents a reference. */
126 #define REFERENCE_CLASS_P(CODE)\
127 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
129 /* Nonzero if CODE represents a comparison. */
131 #define COMPARISON_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
134 /* Nonzero if CODE represents a unary arithmetic expression. */
136 #define UNARY_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
139 /* Nonzero if CODE represents a binary arithmetic expression. */
141 #define BINARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
144 /* Nonzero if CODE represents a statement expression. */
146 #define STATEMENT_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
149 /* Nonzero if CODE represents any other expression. */
151 #define EXPRESSION_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
154 /* Returns nonzero iff CODE represents a type or declaration. */
156 #define IS_TYPE_OR_DECL_P(CODE)\
157 (TYPE_P (CODE) || DECL_P (CODE))
159 /* Returns nonzero iff CLASS is the tree-code class of an
162 #define IS_EXPR_CODE_CLASS(CLASS)\
163 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
165 /* Returns nonzero iff NODE is an expression of some kind. */
167 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
169 /* Returns nonzero iff NODE is an OpenMP directive. */
171 #define OMP_DIRECTIVE_P(NODE) \
172 (TREE_CODE (NODE) == OMP_PARALLEL \
173 || TREE_CODE (NODE) == OMP_SECTIONS \
174 || TREE_CODE (NODE) == OMP_SECTION \
175 || TREE_CODE (NODE) == OMP_FOR \
176 || TREE_CODE (NODE) == OMP_RETURN_EXPR \
177 || TREE_CODE (NODE) == OMP_SINGLE \
178 || TREE_CODE (NODE) == OMP_MASTER \
179 || TREE_CODE (NODE) == OMP_ORDERED \
180 || TREE_CODE (NODE) == OMP_CRITICAL)
182 /* Number of argument-words in each kind of tree-node. */
184 extern const unsigned char tree_code_length
[];
185 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
187 /* Names of tree components. */
189 extern const char *const tree_code_name
[];
191 /* A vectors of trees. */
193 DEF_VEC_ALLOC_P(tree
,gc
);
194 DEF_VEC_ALLOC_P(tree
,heap
);
197 /* Classify which part of the compiler has defined a given builtin function.
198 Note that we assume below that this is no more than two bits. */
207 /* Names for the above. */
208 extern const char *const built_in_class_names
[4];
210 /* Codes that identify the various built in functions
211 so that expand_call can identify them quickly. */
213 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
214 enum built_in_function
216 #include "builtins.def"
218 /* Complex division routines in libgcc. These are done via builtins
219 because emit_library_call_value can't handle complex values. */
220 BUILT_IN_COMPLEX_MUL_MIN
,
221 BUILT_IN_COMPLEX_MUL_MAX
222 = BUILT_IN_COMPLEX_MUL_MIN
223 + MAX_MODE_COMPLEX_FLOAT
224 - MIN_MODE_COMPLEX_FLOAT
,
226 BUILT_IN_COMPLEX_DIV_MIN
,
227 BUILT_IN_COMPLEX_DIV_MAX
228 = BUILT_IN_COMPLEX_DIV_MIN
229 + MAX_MODE_COMPLEX_FLOAT
230 - MIN_MODE_COMPLEX_FLOAT
,
232 /* Upper bound on non-language-specific builtins. */
237 /* Names for the above. */
238 extern const char * built_in_names
[(int) END_BUILTINS
];
240 /* Helper macros for math builtins. */
242 #define BUILTIN_EXP10_P(FN) \
243 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
244 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
246 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
247 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
248 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
250 #define BUILTIN_SQRT_P(FN) \
251 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
253 #define BUILTIN_CBRT_P(FN) \
254 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
256 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
258 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
259 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
261 /* An array of _DECL trees for the above. */
262 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
263 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
265 /* The definition of tree nodes fills the next several pages. */
267 /* A tree node can represent a data type, a variable, an expression
268 or a statement. Each node has a TREE_CODE which says what kind of
269 thing it represents. Some common codes are:
270 INTEGER_TYPE -- represents a type of integers.
271 ARRAY_TYPE -- represents a type of pointer.
272 VAR_DECL -- represents a declared variable.
273 INTEGER_CST -- represents a constant integer value.
274 PLUS_EXPR -- represents a sum (an expression).
276 As for the contents of a tree node: there are some fields
277 that all nodes share. Each TREE_CODE has various special-purpose
278 fields as well. The fields of a node are never accessed directly,
279 always through accessor macros. */
281 /* Every kind of tree node starts with this structure,
282 so all nodes have these fields.
284 See the accessor macros, defined below, for documentation of the
288 struct tree_common
GTY(())
292 union tree_ann_d
*ann
;
294 ENUM_BITFIELD(tree_code
) code
: 8;
296 unsigned side_effects_flag
: 1;
297 unsigned constant_flag
: 1;
298 unsigned addressable_flag
: 1;
299 unsigned volatile_flag
: 1;
300 unsigned readonly_flag
: 1;
301 unsigned unsigned_flag
: 1;
302 unsigned asm_written_flag
: 1;
303 unsigned nowarning_flag
: 1;
305 unsigned used_flag
: 1;
306 unsigned nothrow_flag
: 1;
307 unsigned static_flag
: 1;
308 unsigned public_flag
: 1;
309 unsigned private_flag
: 1;
310 unsigned protected_flag
: 1;
311 unsigned deprecated_flag
: 1;
312 unsigned invariant_flag
: 1;
314 unsigned lang_flag_0
: 1;
315 unsigned lang_flag_1
: 1;
316 unsigned lang_flag_2
: 1;
317 unsigned lang_flag_3
: 1;
318 unsigned lang_flag_4
: 1;
319 unsigned lang_flag_5
: 1;
320 unsigned lang_flag_6
: 1;
321 unsigned visited
: 1;
324 /* The following table lists the uses of each of the above flags and
325 for which types of nodes they are defined. Note that expressions
331 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
332 ..._TYPE, IDENTIFIER_NODE.
333 In a STMT_EXPR, it means we want the result of the enclosed
335 CALL_EXPR_TAILCALL in CALL_EXPR
340 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
343 TREE_CONSTANT_OVERFLOW in
344 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
345 TREE_SYMBOL_REFERENCED in
348 TARGET_EXPR, WITH_CLEANUP_EXPR
351 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
352 TYPE_REF_CAN_ALIAS_ALL in
353 POINTER_TYPE, REFERENCE_TYPE
358 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
360 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
363 TYPE_CACHED_VALUES_P in
365 SAVE_EXPR_RESOLVED_P in
367 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
368 OMP_CLAUSE_LASTPRIVATE
369 OMP_CLAUSE_PRIVATE_DEBUG in
376 CALL_EXPR_RETURN_SLOT_OPT in
379 PARM_DECL, RESULT_DECL
401 TREE_THIS_VOLATILE in
419 TYPE_SIZES_GIMPLIFIED
428 BIT_FIELD_REF_UNSIGNED in
434 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
440 expressions, IDENTIFIER_NODE
445 CALL_EXPR, FUNCTION_DECL
451 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
458 IDENTIFIER_TRANSPARENT_ALIAS in
463 Used in tree traversals to mark visited nodes.
473 ... any expr or decl node
476 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
477 enum tree_node_structure_enum
{
478 #include "treestruct.def"
483 /* Define accessors for the fields that all tree nodes have
484 (though some fields are not used for all kinds of nodes). */
486 /* The tree-code says what kind of node it is.
487 Codes are defined in tree.def. */
488 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->common.code)
489 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->common.code = (VALUE))
491 /* When checking is enabled, errors will be generated if a tree node
492 is accessed incorrectly. The macros die with a fatal error. */
493 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
495 #define TREE_CHECK(T, CODE) __extension__ \
496 ({ const tree __t = (T); \
497 if (TREE_CODE (__t) != (CODE)) \
498 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
502 #define TREE_NOT_CHECK(T, CODE) __extension__ \
503 ({ const tree __t = (T); \
504 if (TREE_CODE (__t) == (CODE)) \
505 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
509 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
510 ({ const tree __t = (T); \
511 if (TREE_CODE (__t) != (CODE1) \
512 && TREE_CODE (__t) != (CODE2)) \
513 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
514 (CODE1), (CODE2), 0); \
517 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
518 ({ const tree __t = (T); \
519 if (TREE_CODE (__t) == (CODE1) \
520 || TREE_CODE (__t) == (CODE2)) \
521 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
522 (CODE1), (CODE2), 0); \
525 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
526 ({ const tree __t = (T); \
527 if (TREE_CODE (__t) != (CODE1) \
528 && TREE_CODE (__t) != (CODE2) \
529 && TREE_CODE (__t) != (CODE3)) \
530 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
531 (CODE1), (CODE2), (CODE3), 0); \
534 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
535 ({ const tree __t = (T); \
536 if (TREE_CODE (__t) == (CODE1) \
537 || TREE_CODE (__t) == (CODE2) \
538 || TREE_CODE (__t) == (CODE3)) \
539 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
540 (CODE1), (CODE2), (CODE3), 0); \
543 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
544 ({ const tree __t = (T); \
545 if (TREE_CODE (__t) != (CODE1) \
546 && TREE_CODE (__t) != (CODE2) \
547 && TREE_CODE (__t) != (CODE3) \
548 && TREE_CODE (__t) != (CODE4)) \
549 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
550 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
553 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
554 ({ const tree __t = (T); \
555 if (TREE_CODE (__t) == (CODE1) \
556 || TREE_CODE (__t) == (CODE2) \
557 || TREE_CODE (__t) == (CODE3) \
558 || TREE_CODE (__t) == (CODE4)) \
559 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
560 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
563 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
564 ({ const tree __t = (T); \
565 if (TREE_CODE (__t) != (CODE1) \
566 && TREE_CODE (__t) != (CODE2) \
567 && TREE_CODE (__t) != (CODE3) \
568 && TREE_CODE (__t) != (CODE4) \
569 && TREE_CODE (__t) != (CODE5)) \
570 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
571 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
574 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
575 ({ const tree __t = (T); \
576 if (TREE_CODE (__t) == (CODE1) \
577 || TREE_CODE (__t) == (CODE2) \
578 || TREE_CODE (__t) == (CODE3) \
579 || TREE_CODE (__t) == (CODE4) \
580 || TREE_CODE (__t) == (CODE5)) \
581 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
582 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
585 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
586 ({ const tree __t = (T); \
587 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
588 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
592 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
593 ({ const tree __t = (T); \
594 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
595 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
599 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
600 ({ const tree __t = (T); \
601 if (TREE_CODE (__t) < (CODE1) && TREE_CODE (__t) > (CODE2)) \
602 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
606 /* These checks have to be special cased. */
607 #define EXPR_CHECK(T) __extension__ \
608 ({ const tree __t = (T); \
609 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
610 if (!IS_EXPR_CODE_CLASS (__c)) \
611 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
615 /* These checks have to be special cased. */
616 #define NON_TYPE_CHECK(T) __extension__ \
617 ({ const tree __t = (T); \
619 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
623 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
624 (*({const tree __t = (T); \
625 const int __i = (I); \
626 if (TREE_CODE (__t) != TREE_VEC) \
627 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
629 if (__i < 0 || __i >= __t->vec.length) \
630 tree_vec_elt_check_failed (__i, __t->vec.length, \
631 __FILE__, __LINE__, __FUNCTION__); \
632 &__t->vec.a[__i]; }))
634 #define PHI_NODE_ELT_CHECK(t, i) __extension__ \
635 (*({const tree __t = t; \
636 const int __i = (i); \
637 if (TREE_CODE (__t) != PHI_NODE) \
638 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
640 if (__i < 0 || __i >= __t->phi.capacity) \
641 phi_node_elt_check_failed (__i, __t->phi.num_args, \
642 __FILE__, __LINE__, __FUNCTION__); \
643 &__t->phi.a[__i]; }))
645 /* Special checks for TREE_OPERANDs. */
646 #define TREE_OPERAND_CHECK(T, I) __extension__ \
647 (*({const tree __t = EXPR_CHECK (T); \
648 const int __i = (I); \
649 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
650 tree_operand_check_failed (__i, TREE_CODE (__t), \
651 __FILE__, __LINE__, __FUNCTION__); \
652 &__t->exp.operands[__i]; }))
654 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
655 (*({const tree __t = (T); \
656 const int __i = (I); \
657 if (TREE_CODE (__t) != CODE) \
658 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
659 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
660 tree_operand_check_failed (__i, (CODE), \
661 __FILE__, __LINE__, __FUNCTION__); \
662 &__t->exp.operands[__i]; }))
664 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
666 ({const tree __t = (T); \
667 const int __i = (I); \
668 if (TREE_CODE (__t) != (CODE)) \
669 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
670 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
671 tree_operand_check_failed (__i, (CODE), \
672 __FILE__, __LINE__, __FUNCTION__); \
673 &__t->exp.operands[__i]; }))
675 extern void tree_contains_struct_check_failed (const tree
,
676 const enum tree_node_structure_enum
,
677 const char *, int, const char *)
680 extern void tree_check_failed (const tree
, const char *, int, const char *,
681 ...) ATTRIBUTE_NORETURN
;
682 extern void tree_not_check_failed (const tree
, const char *, int, const char *,
683 ...) ATTRIBUTE_NORETURN
;
684 extern void tree_class_check_failed (const tree
, const enum tree_code_class
,
685 const char *, int, const char *)
687 extern void tree_range_check_failed (const tree
, const char *, int,
688 const char *, enum tree_code
,
690 extern void tree_not_class_check_failed (const tree
,
691 const enum tree_code_class
,
692 const char *, int, const char *)
694 extern void tree_vec_elt_check_failed (int, int, const char *,
697 extern void phi_node_elt_check_failed (int, int, const char *,
700 extern void tree_operand_check_failed (int, enum tree_code
,
701 const char *, int, const char *)
704 #else /* not ENABLE_TREE_CHECKING, or not gcc */
706 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
707 #define TREE_CHECK(T, CODE) (T)
708 #define TREE_NOT_CHECK(T, CODE) (T)
709 #define TREE_CHECK2(T, CODE1, CODE2) (T)
710 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
711 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
712 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
713 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
714 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
715 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
716 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
717 #define TREE_CLASS_CHECK(T, CODE) (T)
718 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
719 #define EXPR_CHECK(T) (T)
720 #define NON_TYPE_CHECK(T) (T)
721 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
722 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
723 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
724 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
725 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
729 #define TREE_BLOCK(NODE) ((NODE)->exp.block)
731 #include "tree-check.h"
733 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
734 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
735 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
736 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
737 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
738 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
739 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
740 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
741 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
742 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
743 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
745 #define RECORD_OR_UNION_CHECK(T) \
746 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
747 #define NOT_RECORD_OR_UNION_CHECK(T) \
748 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
750 #define NUMERICAL_TYPE_CHECK(T) \
751 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, \
752 CHAR_TYPE, REAL_TYPE)
754 /* In all nodes that are expressions, this is the data type of the expression.
755 In POINTER_TYPE nodes, this is the type that the pointer points to.
756 In ARRAY_TYPE nodes, this is the type of the elements.
757 In VECTOR_TYPE nodes, this is the type of the elements. */
758 #define TREE_TYPE(NODE) ((NODE)->common.type)
760 /* Here is how primitive or already-canonicalized types' hash codes
762 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
764 /* A simple hash function for an arbitrary tree node. This must not be
765 used in hash tables which are saved to a PCH. */
766 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
768 /* Nodes are chained together for many purposes.
769 Types are chained together to record them for being output to the debugger
770 (see the function `chain_type').
771 Decls in the same scope are chained together to record the contents
773 Statement nodes for successive statements used to be chained together.
774 Often lists of things are represented by TREE_LIST nodes that
775 are chained together. */
777 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
779 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
780 that don't change the machine mode. */
782 #define STRIP_NOPS(EXP) \
783 while ((TREE_CODE (EXP) == NOP_EXPR \
784 || TREE_CODE (EXP) == CONVERT_EXPR \
785 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
786 && TREE_OPERAND (EXP, 0) != error_mark_node \
787 && (TYPE_MODE (TREE_TYPE (EXP)) \
788 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
789 (EXP) = TREE_OPERAND (EXP, 0)
791 /* Like STRIP_NOPS, but don't let the signedness change either. */
793 #define STRIP_SIGN_NOPS(EXP) \
794 while ((TREE_CODE (EXP) == NOP_EXPR \
795 || TREE_CODE (EXP) == CONVERT_EXPR \
796 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
797 && TREE_OPERAND (EXP, 0) != error_mark_node \
798 && (TYPE_MODE (TREE_TYPE (EXP)) \
799 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
800 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
801 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
802 (EXP) = TREE_OPERAND (EXP, 0)
804 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
806 #define STRIP_TYPE_NOPS(EXP) \
807 while ((TREE_CODE (EXP) == NOP_EXPR \
808 || TREE_CODE (EXP) == CONVERT_EXPR \
809 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
810 && TREE_OPERAND (EXP, 0) != error_mark_node \
811 && (TREE_TYPE (EXP) \
812 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
813 (EXP) = TREE_OPERAND (EXP, 0)
815 /* Remove unnecessary type conversions according to
816 tree_ssa_useless_type_conversion. */
818 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
819 while (tree_ssa_useless_type_conversion (EXP)) \
820 EXP = TREE_OPERAND (EXP, 0)
822 /* Nonzero if TYPE represents an integral type. Note that we do not
823 include COMPLEX types here. Keep these checks in ascending code
826 #define INTEGRAL_TYPE_P(TYPE) \
827 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
828 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
829 || TREE_CODE (TYPE) == CHAR_TYPE \
830 || TREE_CODE (TYPE) == INTEGER_TYPE)
832 /* Nonzero if TYPE represents a scalar floating-point type. */
834 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
836 /* Nonzero if TYPE represents a complex floating-point type. */
838 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
839 (TREE_CODE (TYPE) == COMPLEX_TYPE \
840 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
842 /* Nonzero if TYPE represents a vector floating-point type. */
844 #define VECTOR_FLOAT_TYPE_P(TYPE) \
845 (TREE_CODE (TYPE) == VECTOR_TYPE \
846 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
848 /* Nonzero if TYPE represents a floating-point type, including complex
849 and vector floating-point types. The vector and complex check does
850 not use the previous two macros to enable early folding. */
852 #define FLOAT_TYPE_P(TYPE) \
853 (SCALAR_FLOAT_TYPE_P (TYPE) \
854 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
855 || TREE_CODE (TYPE) == VECTOR_TYPE) \
856 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
858 /* Nonzero if TYPE represents an aggregate (multi-component) type.
859 Keep these checks in ascending code order. */
861 #define AGGREGATE_TYPE_P(TYPE) \
862 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
863 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
865 /* Nonzero if TYPE represents a pointer or reference type.
866 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
867 ascending code order. */
869 #define POINTER_TYPE_P(TYPE) \
870 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
872 /* Nonzero if this type is a complete type. */
873 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
875 /* Nonzero if this type is the (possibly qualified) void type. */
876 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
878 /* Nonzero if this type is complete or is cv void. */
879 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
880 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
882 /* Nonzero if this type is complete or is an array with unspecified bound. */
883 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
884 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
887 /* Define many boolean fields that all tree nodes have. */
889 /* In VAR_DECL nodes, nonzero means address of this is needed.
890 So it cannot be in a register.
891 In a FUNCTION_DECL, nonzero means its address is needed.
892 So it must be compiled even if it is an inline function.
893 In a FIELD_DECL node, it means that the programmer is permitted to
894 construct the address of this field. This is used for aliasing
895 purposes: see record_component_aliases.
896 In CONSTRUCTOR nodes, it means object constructed must be in memory.
897 In LABEL_DECL nodes, it means a goto for this label has been seen
898 from a place outside all binding contours that restore stack levels.
899 In ..._TYPE nodes, it means that objects of this type must
900 be fully addressable. This means that pieces of this
901 object cannot go into register parameters, for example.
902 In IDENTIFIER_NODEs, this means that some extern decl for this name
903 had its address taken. That matters for inline functions. */
904 #define TREE_ADDRESSABLE(NODE) ((NODE)->common.addressable_flag)
906 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
907 exit of a function. Calls for which this is true are candidates for tail
908 call optimizations. */
909 #define CALL_EXPR_TAILCALL(NODE) (CALL_EXPR_CHECK(NODE)->common.addressable_flag)
911 /* In a VAR_DECL, nonzero means allocate static storage.
912 In a FUNCTION_DECL, nonzero if function has been defined.
913 In a CONSTRUCTOR, nonzero means allocate static storage.
915 ??? This is also used in lots of other nodes in unclear ways which
916 should be cleaned up some day. */
917 #define TREE_STATIC(NODE) ((NODE)->common.static_flag)
919 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
920 should only be executed if an exception is thrown, not on normal exit
922 #define CLEANUP_EH_ONLY(NODE) ((NODE)->common.static_flag)
924 /* In an expr node (usually a conversion) this means the node was made
925 implicitly and should not lead to any sort of warning. In a decl node,
926 warnings concerning the decl should be suppressed. This is used at
927 least for used-before-set warnings, and it set after one warning is
929 #define TREE_NO_WARNING(NODE) ((NODE)->common.nowarning_flag)
931 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST this means
932 there was an overflow in folding. This is distinct from
933 TREE_OVERFLOW because ANSI C requires a diagnostic when overflows
934 occur in constant expressions. */
935 #define TREE_CONSTANT_OVERFLOW(NODE) (CST_CHECK (NODE)->common.static_flag)
937 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
938 this string as an argument. */
939 #define TREE_SYMBOL_REFERENCED(NODE) \
940 (IDENTIFIER_NODE_CHECK (NODE)->common.static_flag)
942 /* Nonzero in a pointer or reference type means the data pointed to
943 by this type can alias anything. */
944 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
945 (PTR_OR_REF_CHECK (NODE)->common.static_flag)
947 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
948 there was an overflow in folding, and no warning has been issued
949 for this subexpression. TREE_OVERFLOW implies TREE_CONSTANT_OVERFLOW,
950 but not vice versa. */
952 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->common.public_flag)
954 /* In a VAR_DECL or FUNCTION_DECL,
955 nonzero means name is to be accessible from outside this module.
956 In an IDENTIFIER_NODE, nonzero means an external declaration
957 accessible from outside this module was previously seen
958 for this name in an inner scope. */
959 #define TREE_PUBLIC(NODE) ((NODE)->common.public_flag)
961 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
962 of cached values, or is something else. */
963 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->common.public_flag)
965 /* In a SAVE_EXPR, indicates that the original expression has already
966 been substituted with a VAR_DECL that contains the value. */
967 #define SAVE_EXPR_RESOLVED_P(NODE) \
968 (TREE_CHECK (NODE, SAVE_EXPR)->common.public_flag)
970 /* In any expression, decl, or constant, nonzero means it has side effects or
971 reevaluation of the whole expression could produce a different value.
972 This is set if any subexpression is a function call, a side effect or a
973 reference to a volatile variable. In a ..._DECL, this is set only if the
974 declaration said `volatile'. This will never be set for a constant. */
975 #define TREE_SIDE_EFFECTS(NODE) \
976 (NON_TYPE_CHECK (NODE)->common.side_effects_flag)
978 /* In a LABEL_DECL, nonzero means this label had its address taken
979 and therefore can never be deleted and is a jump target for
981 #define FORCED_LABEL(NODE) ((NODE)->common.side_effects_flag)
983 /* Nonzero means this expression is volatile in the C sense:
984 its address should be of type `volatile WHATEVER *'.
985 In other words, the declared item is volatile qualified.
986 This is used in _DECL nodes and _REF nodes.
987 On a FUNCTION_DECL node, this means the function does not
988 return normally. This is the same effect as setting
989 the attribute noreturn on the function in C.
991 In a ..._TYPE node, means this type is volatile-qualified.
992 But use TYPE_VOLATILE instead of this macro when the node is a type,
993 because eventually we may make that a different bit.
995 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
996 #define TREE_THIS_VOLATILE(NODE) ((NODE)->common.volatile_flag)
998 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
999 accessing the memory pointed to won't generate a trap. However,
1000 this only applies to an object when used appropriately: it doesn't
1001 mean that writing a READONLY mem won't trap. Similarly for
1002 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1004 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1005 (or slice of the array) always belongs to the range of the array.
1006 I.e. that the access will not trap, provided that the access to
1007 the base to the array will not trap. */
1008 #define TREE_THIS_NOTRAP(NODE) ((NODE)->common.nothrow_flag)
1010 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1011 nonzero means it may not be the lhs of an assignment. */
1012 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->common.readonly_flag)
1014 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1015 #define TREE_READONLY_DECL_P(NODE)\
1016 (DECL_P (NODE) && TREE_READONLY (NODE))
1018 /* Value of expression is constant. Always on in all ..._CST nodes. May
1019 also appear in an expression or decl where the value is constant. */
1020 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->common.constant_flag)
1022 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1023 #define TYPE_SIZES_GIMPLIFIED(NODE) (TYPE_CHECK (NODE)->common.constant_flag)
1025 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1026 #define DECL_UNSIGNED(NODE) (DECL_COMMON_CHECK (NODE)->common.unsigned_flag)
1028 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1029 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1030 (BIT_FIELD_REF_CHECK (NODE)->common.unsigned_flag)
1032 /* In integral and pointer types, means an unsigned type. */
1033 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->common.unsigned_flag)
1035 #define TYPE_TRAP_SIGNED(NODE) \
1036 (flag_trapv && ! TYPE_UNSIGNED (NODE))
1038 /* Nonzero in a VAR_DECL means assembler code has been written.
1039 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1040 This is interesting in an inline function, since it might not need
1041 to be compiled separately.
1042 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1043 if the sdb debugging info for the type has been written.
1044 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1045 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1047 #define TREE_ASM_WRITTEN(NODE) ((NODE)->common.asm_written_flag)
1049 /* Nonzero in a _DECL if the name is used in its scope.
1050 Nonzero in an expr node means inhibit warning if value is unused.
1051 In IDENTIFIER_NODEs, this means that some extern decl for this name
1053 In a BLOCK, this means that the block contains variables that are used. */
1054 #define TREE_USED(NODE) ((NODE)->common.used_flag)
1056 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1057 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1058 #define TREE_NOTHROW(NODE) ((NODE)->common.nothrow_flag)
1060 /* In a CALL_EXPR, means that it's safe to use the target of the call
1061 expansion as the return slot for a call that returns in memory. */
1062 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->common.private_flag)
1064 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1065 reference (and the TREE_TYPE is a pointer to the true type). */
1066 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->common.private_flag)
1068 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1069 thunked-to function. */
1070 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->common.protected_flag)
1072 /* In a type, nonzero means that all objects of the type are guaranteed by the
1073 language or front-end to be properly aligned, so we can indicate that a MEM
1074 of this type is aligned at least to the alignment of the type, even if it
1075 doesn't appear that it is. We see this, for example, in object-oriented
1076 languages where a tag field may show this is an object of a more-aligned
1077 variant of the more generic type.
1079 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1081 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->common.nothrow_flag)
1083 /* Used in classes in C++. */
1084 #define TREE_PRIVATE(NODE) ((NODE)->common.private_flag)
1085 /* Used in classes in C++.
1086 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1087 #define TREE_PROTECTED(NODE) ((NODE)->common.protected_flag)
1089 /* Nonzero in a _DECL if the use of the name is defined as a
1090 deprecated feature by __attribute__((deprecated)). */
1091 #define TREE_DEPRECATED(NODE) \
1092 ((NODE)->common.deprecated_flag)
1094 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1095 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1096 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1097 (IDENTIFIER_NODE_CHECK (NODE)->common.deprecated_flag)
1099 /* Value of expression is function invariant. A strict subset of
1100 TREE_CONSTANT, such an expression is constant over any one function
1101 invocation, though not across different invocations. May appear in
1102 any expression node. */
1103 #define TREE_INVARIANT(NODE) ((NODE)->common.invariant_flag)
1105 /* These flags are available for each language front end to use internally. */
1106 #define TREE_LANG_FLAG_0(NODE) ((NODE)->common.lang_flag_0)
1107 #define TREE_LANG_FLAG_1(NODE) ((NODE)->common.lang_flag_1)
1108 #define TREE_LANG_FLAG_2(NODE) ((NODE)->common.lang_flag_2)
1109 #define TREE_LANG_FLAG_3(NODE) ((NODE)->common.lang_flag_3)
1110 #define TREE_LANG_FLAG_4(NODE) ((NODE)->common.lang_flag_4)
1111 #define TREE_LANG_FLAG_5(NODE) ((NODE)->common.lang_flag_5)
1112 #define TREE_LANG_FLAG_6(NODE) ((NODE)->common.lang_flag_6)
1114 /* Define additional fields and accessors for nodes representing constants. */
1116 /* In an INTEGER_CST node. These two together make a 2-word integer.
1117 If the data type is signed, the value is sign-extended to 2 words
1118 even though not all of them may really be in use.
1119 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1120 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1121 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1122 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1124 #define INT_CST_LT(A, B) \
1125 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1126 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1127 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1129 #define INT_CST_LT_UNSIGNED(A, B) \
1130 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1131 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1132 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1133 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1134 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1136 struct tree_int_cst
GTY(())
1138 struct tree_common common
;
1139 /* A sub-struct is necessary here because the function `const_hash'
1140 wants to scan both words as a unit and taking the address of the
1141 sub-struct yields the properly inclusive bounded pointer. */
1142 struct tree_int_cst_lowhi
{
1143 unsigned HOST_WIDE_INT low
;
1148 /* In a REAL_CST node. struct real_value is an opaque entity, with
1149 manipulators defined in real.h. We don't want tree.h depending on
1150 real.h and transitively on tm.h. */
1153 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1154 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1156 struct tree_real_cst
GTY(())
1158 struct tree_common common
;
1159 struct real_value
* real_cst_ptr
;
1162 /* In a STRING_CST */
1163 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1164 #define TREE_STRING_POINTER(NODE) \
1165 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1167 struct tree_string
GTY(())
1169 struct tree_common common
;
1174 /* In a COMPLEX_CST node. */
1175 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1176 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1178 struct tree_complex
GTY(())
1180 struct tree_common common
;
1185 /* In a VECTOR_CST node. */
1186 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1188 struct tree_vector
GTY(())
1190 struct tree_common common
;
1196 /* Define fields and accessors for some special-purpose tree nodes. */
1198 #define IDENTIFIER_LENGTH(NODE) \
1199 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1200 #define IDENTIFIER_POINTER(NODE) \
1201 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1202 #define IDENTIFIER_HASH_VALUE(NODE) \
1203 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1205 /* Translate a hash table identifier pointer to a tree_identifier
1206 pointer, and vice versa. */
1208 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1209 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1210 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1212 struct tree_identifier
GTY(())
1214 struct tree_common common
;
1215 struct ht_identifier id
;
1218 /* In a TREE_LIST node. */
1219 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1220 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1222 struct tree_list
GTY(())
1224 struct tree_common common
;
1229 /* In a TREE_VEC node. */
1230 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1231 #define TREE_VEC_END(NODE) \
1232 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1234 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1236 struct tree_vec
GTY(())
1238 struct tree_common common
;
1240 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1243 /* In a CONSTRUCTOR node. */
1244 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1246 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1247 value of each element (stored within VAL). IX must be a scratch variable
1248 of unsigned integer type. */
1249 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1250 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1252 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1256 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1257 the value of each element (stored within VAL) and its index (stored
1258 within INDEX). IX must be a scratch variable of unsigned integer type. */
1259 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1260 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1262 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1263 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1267 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1268 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1270 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1271 _ce___->index = INDEX; \
1272 _ce___->value = VALUE; \
1275 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1276 element. INDEX can optionally design the position of VALUE: in arrays,
1277 it is the index where VALUE has to be placed; in structures, it is the
1278 FIELD_DECL of the member. */
1279 typedef struct constructor_elt_d
GTY(())
1285 DEF_VEC_O(constructor_elt
);
1286 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1288 struct tree_constructor
GTY(())
1290 struct tree_common common
;
1291 VEC(constructor_elt
,gc
) *elts
;
1294 /* Define fields and accessors for some nodes that represent expressions. */
1296 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1297 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1298 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1299 && integer_zerop (TREE_OPERAND (NODE, 0)))
1301 /* In ordinary expression nodes. */
1302 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1303 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1305 /* In a LOOP_EXPR node. */
1306 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1308 #ifdef USE_MAPPED_LOCATION
1309 /* The source location of this expression. Non-tree_exp nodes such as
1310 decls and constants can be shared among multiple locations, so
1312 #define EXPR_LOCATION(NODE) \
1313 (EXPR_P (NODE) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1314 #define SET_EXPR_LOCATION(NODE, FROM) \
1315 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1316 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1317 /* EXPR_LOCUS and SET_EXPR_LOCUS are deprecated. */
1318 #define EXPR_LOCUS(NODE) \
1319 (EXPR_P (NODE) ? &(NODE)->exp.locus : (location_t *)NULL)
1320 #define SET_EXPR_LOCUS(NODE, FROM) \
1321 do { source_location *loc_tmp = FROM; \
1322 EXPR_CHECK (NODE)->exp.locus \
1323 = loc_tmp == NULL ? UNKNOWN_LOCATION : *loc_tmp; } while (0)
1324 #define EXPR_FILENAME(NODE) \
1325 LOCATION_FILE (EXPR_CHECK (NODE)->exp.locus)
1326 #define EXPR_LINENO(NODE) \
1327 LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1329 /* The source location of this expression. Non-tree_exp nodes such as
1330 decls and constants can be shared among multiple locations, so
1332 #define EXPR_LOCUS(NODE) \
1333 (EXPR_P (NODE) ? (NODE)->exp.locus : (location_t *)NULL)
1334 #define SET_EXPR_LOCUS(NODE, FROM) \
1335 (EXPR_CHECK (NODE)->exp.locus = (FROM))
1336 #define SET_EXPR_LOCATION(NODE, FROM) annotate_with_locus (NODE, FROM)
1337 #define EXPR_FILENAME(NODE) \
1338 (EXPR_CHECK (NODE)->exp.locus->file)
1339 #define EXPR_LINENO(NODE) \
1340 (EXPR_CHECK (NODE)->exp.locus->line)
1341 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCUS (NODE) != NULL)
1342 #define EXPR_LOCATION(NODE) \
1343 (EXPR_HAS_LOCATION(NODE) ? *(NODE)->exp.locus : UNKNOWN_LOCATION)
1346 /* In a TARGET_EXPR node. */
1347 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1348 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1349 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1351 /* DECL_EXPR accessor. This gives access to the DECL associated with
1352 the given declaration statement. */
1353 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1355 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1357 /* SWITCH_EXPR accessors. These give access to the condition, body and
1358 original condition type (before any compiler conversions)
1359 of the switch statement, respectively. */
1360 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1361 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1362 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1364 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1365 of a case label, respectively. */
1366 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1367 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1368 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1370 /* The operands of a TARGET_MEM_REF. */
1371 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1372 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1373 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1374 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1375 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1376 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1377 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1379 /* The operands of a BIND_EXPR. */
1380 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1381 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1382 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1384 /* GOTO_EXPR accessor. This gives access to the label associated with
1385 a goto statement. */
1386 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1388 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1389 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1390 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1392 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1393 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1394 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1395 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1396 /* Nonzero if we want to create an ASM_INPUT instead of an
1397 ASM_OPERAND with no operands. */
1398 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1399 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1401 /* COND_EXPR accessors. */
1402 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1403 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1404 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1406 /* LABEL_EXPR accessor. This gives access to the label associated with
1407 the given label expression. */
1408 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1410 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1411 accessors for SSA operands. */
1413 /* CATCH_EXPR accessors. */
1414 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1415 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1417 /* EH_FILTER_EXPR accessors. */
1418 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1419 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1420 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1422 /* OBJ_TYPE_REF accessors. */
1423 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1424 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1425 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1427 /* ASSERT_EXPR accessors. */
1428 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1429 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1431 /* OpenMP directive and clause accessors. */
1433 #define OMP_BODY(NODE) \
1434 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1435 #define OMP_CLAUSES(NODE) \
1436 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1438 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1439 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1440 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1441 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1443 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1444 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1445 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1446 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1447 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1448 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1450 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1451 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1452 #define OMP_SECTIONS_SECTIONS(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 2)
1454 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1456 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1457 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1459 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1461 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1463 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1464 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1466 #define OMP_CLAUSE_CHAIN(NODE) \
1467 TREE_CHAIN (TREE_RANGE_CHECK (NODE, OMP_CLAUSE_PRIVATE, OMP_CLAUSE_DEFAULT))
1468 #define OMP_CLAUSE_DECL(NODE) \
1469 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_CLAUSE_PRIVATE, \
1470 OMP_CLAUSE_COPYPRIVATE), 0)
1472 /* True on a PRIVATE clause if its decl is kept around for debugging
1473 information only and its DECL_VALUE_EXPR is supposed to point
1474 to what it has been remapped to. */
1475 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1476 TREE_PUBLIC (OMP_CLAUSE_PRIVATE_CHECK (NODE))
1478 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1479 decl is present in the chain. */
1480 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1481 TREE_PUBLIC (OMP_CLAUSE_LASTPRIVATE_CHECK (NODE))
1483 #define OMP_CLAUSE_IF_EXPR(NODE) \
1484 TREE_OPERAND (OMP_CLAUSE_IF_CHECK (NODE), 0)
1485 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1486 TREE_OPERAND (OMP_CLAUSE_NUM_THREADS_CHECK (NODE), 0)
1487 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1488 TREE_OPERAND (OMP_CLAUSE_SCHEDULE_CHECK (NODE), 0)
1490 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1491 (OMP_CLAUSE_REDUCTION_CHECK (NODE)->exp.complexity)
1492 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1493 TREE_OPERAND (OMP_CLAUSE_REDUCTION_CHECK (NODE), 1)
1494 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1495 TREE_OPERAND (OMP_CLAUSE_REDUCTION_CHECK (NODE), 2)
1496 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1497 TREE_OPERAND (OMP_CLAUSE_REDUCTION_CHECK (NODE), 3)
1499 enum omp_clause_schedule_kind
1501 OMP_CLAUSE_SCHEDULE_STATIC
,
1502 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1503 OMP_CLAUSE_SCHEDULE_GUIDED
,
1504 OMP_CLAUSE_SCHEDULE_RUNTIME
1507 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1508 (OMP_CLAUSE_SCHEDULE_CHECK (NODE)->exp.complexity)
1510 enum omp_clause_default_kind
1512 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1513 OMP_CLAUSE_DEFAULT_SHARED
,
1514 OMP_CLAUSE_DEFAULT_NONE
,
1515 OMP_CLAUSE_DEFAULT_PRIVATE
1518 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1519 (OMP_CLAUSE_DEFAULT_CHECK (NODE)->exp.complexity)
1521 struct tree_exp
GTY(())
1523 struct tree_common common
;
1527 tree
GTY ((special ("tree_exp"),
1528 desc ("TREE_CODE ((tree) &%0)")))
1532 /* SSA_NAME accessors. */
1534 /* Returns the variable being referenced. Once released, this is the
1535 only field that can be relied upon. */
1536 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1538 /* Returns the statement which defines this reference. Note that
1539 we use the same field when chaining SSA_NAME nodes together on
1540 the SSA_NAME freelist. */
1541 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1543 /* Returns the SSA version number of this SSA name. Note that in
1544 tree SSA, version numbers are not per variable and may be recycled. */
1545 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1547 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1548 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1550 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1551 SSA_NAME_CHECK (NODE)->common.asm_written_flag
1553 /* Nonzero if this SSA_NAME expression is currently on the free list of
1554 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1555 has no meaning for an SSA_NAME. */
1556 #define SSA_NAME_IN_FREE_LIST(NODE) \
1557 SSA_NAME_CHECK (NODE)->common.nothrow_flag
1559 /* Attributes for SSA_NAMEs for pointer-type variables. */
1560 #define SSA_NAME_PTR_INFO(N) \
1561 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1563 /* Get the value of this SSA_NAME, if available. */
1564 #define SSA_NAME_VALUE(N) \
1565 SSA_NAME_CHECK (N)->ssa_name.value_handle
1567 /* Auxiliary pass-specific data. */
1568 #define SSA_NAME_AUX(N) \
1569 SSA_NAME_CHECK (N)->ssa_name.aux
1571 #ifndef _TREE_FLOW_H
1572 struct ptr_info_def
;
1577 /* Immediate use linking structure. This structure is used for maintaining
1578 a doubly linked list of uses of an SSA_NAME. */
1579 typedef struct ssa_use_operand_d
GTY(())
1581 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1582 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1583 tree
GTY((skip(""))) stmt
;
1584 tree
*GTY((skip(""))) use
;
1585 } ssa_use_operand_t
;
1587 /* Return the immediate_use information for an SSA_NAME. */
1588 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1590 struct tree_ssa_name
GTY(())
1592 struct tree_common common
;
1594 /* _DECL wrapped by this SSA name. */
1597 /* SSA version number. */
1598 unsigned int version
;
1600 /* Pointer attributes used for alias analysis. */
1601 struct ptr_info_def
*ptr_info
;
1603 /* Value for SSA name used by various passes.
1605 Right now only invariants are allowed to persist beyond a pass in
1606 this field; in the future we will allow VALUE_HANDLEs to persist
1610 /* Auxiliary information stored with the ssa name. */
1611 PTR
GTY((skip
)) aux
;
1613 /* Immediate uses list for this SSA_NAME. */
1614 struct ssa_use_operand_d imm_uses
;
1617 /* In a PHI_NODE node. */
1619 /* These 2 macros should be considered off limits for use by developers. If
1620 you wish to access the use or def fields of a PHI_NODE in the SSA
1621 optimizers, use the accessor macros found in tree-ssa-operands.h.
1622 These two macros are to be used only by those accessor macros, and other
1623 select places where we *absolutely* must take the address of the tree. */
1625 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1626 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1628 /* PHI_NODEs for each basic block are chained together in a single linked
1629 list. The head of the list is linked from the block annotation, and
1630 the link to the next PHI is in PHI_CHAIN. */
1631 #define PHI_CHAIN(NODE) TREE_CHAIN (PHI_NODE_CHECK (NODE))
1633 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1634 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1635 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1636 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1637 #define PHI_ARG_NONZERO(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).nonzero
1638 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1639 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1641 struct phi_arg_d
GTY(())
1643 /* imm_use MUST be the first element in struct because we do some
1644 pointer arithmetic with it. See phi_arg_index_from_use. */
1645 struct ssa_use_operand_d imm_use
;
1650 struct tree_phi_node
GTY(())
1652 struct tree_common common
;
1657 /* Basic block to that the phi node belongs. */
1658 struct basic_block_def
*bb
;
1660 /* Arguments of the PHI node. These are maintained in the same
1661 order as predecessor edge vector BB->PREDS. */
1662 struct phi_arg_d
GTY ((length ("((tree)&%h)->phi.num_args"))) a
[1];
1666 struct varray_head_tag
;
1668 /* In a BLOCK node. */
1669 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1670 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1671 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1672 /* Note: when changing this, make sure to find the places
1673 that use chainon or nreverse. */
1674 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1675 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1676 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1678 /* Nonzero means that this block is prepared to handle exceptions
1679 listed in the BLOCK_VARS slot. */
1680 #define BLOCK_HANDLER_BLOCK(NODE) \
1681 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1683 /* An index number for this block. These values are not guaranteed to
1684 be unique across functions -- whether or not they are depends on
1685 the debugging output format in use. */
1686 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1688 /* If block reordering splits a lexical block into discontiguous
1689 address ranges, we'll make a copy of the original block.
1691 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1692 In that case, we have one source block that has been replicated
1693 (through inlining or unrolling) into many logical blocks, and that
1694 these logical blocks have different physical variables in them.
1696 In this case, we have one logical block split into several
1697 non-contiguous address ranges. Most debug formats can't actually
1698 represent this idea directly, so we fake it by creating multiple
1699 logical blocks with the same variables in them. However, for those
1700 that do support non-contiguous regions, these allow the original
1701 logical block to be reconstructed, along with the set of address
1704 One of the logical block fragments is arbitrarily chosen to be
1705 the ORIGIN. The other fragments will point to the origin via
1706 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1707 be null. The list of fragments will be chained through
1708 BLOCK_FRAGMENT_CHAIN from the origin. */
1710 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1711 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1713 /* For an inlined function, this gives the location where it was called
1714 from. This is only set in the top level block, which corresponds to the
1715 inlined function scope. This is used in the debug output routines. */
1717 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1719 struct tree_block
GTY(())
1721 struct tree_common common
;
1723 unsigned handler_block_flag
: 1;
1724 unsigned abstract_flag
: 1;
1725 unsigned block_num
: 30;
1730 tree abstract_origin
;
1731 tree fragment_origin
;
1732 tree fragment_chain
;
1736 /* Define fields and accessors for nodes representing data types. */
1738 /* See tree.def for documentation of the use of these fields.
1739 Look at the documentation of the various ..._TYPE tree codes.
1741 Note that the type.values, type.minval, and type.maxval fields are
1742 overloaded and used for different macros in different kinds of types.
1743 Each macro must check to ensure the tree node is of the proper kind of
1744 type. Note also that some of the front-ends also overload these fields,
1745 so they must be checked as well. */
1747 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
1748 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
1749 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
1750 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
1751 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
1752 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
1753 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
1754 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
1755 #define TYPE_ORIG_SIZE_TYPE(NODE) \
1756 (INTEGER_TYPE_CHECK (NODE)->type.values \
1757 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
1758 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
1759 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
1760 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
1761 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
1762 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
1763 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
1764 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
1765 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
1766 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
1767 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
1768 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
1769 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
1770 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
1771 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
1772 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
1773 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
1774 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
1775 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
1776 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
1777 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
1779 /* For a VECTOR_TYPE node, this describes a different type which is emitted
1780 in the debugging output. We use this to describe a vector as a
1781 structure containing an array. */
1782 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
1784 /* For record and union types, information about this type, as a base type
1786 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1788 /* For non record and union types, used in a language-dependent way. */
1789 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
1791 /* The (language-specific) typed-based alias set for this type.
1792 Objects whose TYPE_ALIAS_SETs are different cannot alias each
1793 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
1794 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
1795 type can alias objects of any type. */
1796 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
1798 /* Nonzero iff the typed-based alias set for this type has been
1800 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
1802 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
1804 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
1806 /* The alignment necessary for objects of this type.
1807 The value is an int, measured in bits. */
1808 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
1810 /* 1 if the alignment for this type was requested by "aligned" attribute,
1811 0 if it is the default for this type. */
1812 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
1814 /* The alignment for NODE, in bytes. */
1815 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
1817 /* If your language allows you to declare types, and you want debug info
1818 for them, then you need to generate corresponding TYPE_DECL nodes.
1819 These "stub" TYPE_DECL nodes have no name, and simply point at the
1820 type node. You then set the TYPE_STUB_DECL field of the type node
1821 to point back at the TYPE_DECL node. This allows the debug routines
1822 to know that the two nodes represent the same type, so that we only
1823 get one debug info record for them. */
1824 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
1826 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
1827 has BLKmode only because it lacks the alignment requirement for
1829 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
1831 /* In an INTEGER_TYPE, it means the type represents a size. We use
1832 this both for validity checking and to permit optimizations that
1833 are unsafe for other types. Note that the C `size_t' type should
1834 *not* have this flag set. The `size_t' type is simply a typedef
1835 for an ordinary integer type that happens to be the type of an
1836 expression returned by `sizeof'; `size_t' has no special
1837 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
1838 always actual sizes. */
1839 #define TYPE_IS_SIZETYPE(NODE) \
1840 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1842 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
1843 pointer depressed. */
1844 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
1845 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
1847 /* Nonzero in a type considered volatile as a whole. */
1848 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->common.volatile_flag)
1850 /* Means this type is const-qualified. */
1851 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->common.readonly_flag)
1853 /* If nonzero, this type is `restrict'-qualified, in the C sense of
1855 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
1857 /* There is a TYPE_QUAL value for each type qualifier. They can be
1858 combined by bitwise-or to form the complete set of qualifiers for a
1861 #define TYPE_UNQUALIFIED 0x0
1862 #define TYPE_QUAL_CONST 0x1
1863 #define TYPE_QUAL_VOLATILE 0x2
1864 #define TYPE_QUAL_RESTRICT 0x4
1866 /* The set of type qualifiers for this type. */
1867 #define TYPE_QUALS(NODE) \
1868 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
1869 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
1870 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
1872 /* These flags are available for each language front end to use internally. */
1873 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
1874 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
1875 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
1876 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
1877 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
1878 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
1879 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
1881 /* Used to keep track of visited nodes in tree traversals. This is set to
1882 0 by copy_node and make_node. */
1883 #define TREE_VISITED(NODE) ((NODE)->common.visited)
1885 /* If set in an ARRAY_TYPE, indicates a string type (for languages
1886 that distinguish string from array of char).
1887 If set in a SET_TYPE, indicates a bitstring type. */
1888 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
1890 /* If non-NULL, this is an upper bound of the size (in bytes) of an
1891 object of the given ARRAY_TYPE. This allows temporaries to be
1893 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
1894 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
1896 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
1897 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
1898 (((unsigned HOST_WIDE_INT) 1) \
1899 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
1901 /* Set precision to n when we have 2^n sub-parts of the vector. */
1902 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
1903 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
1905 /* Indicates that objects of this type must be initialized by calling a
1906 function when they are created. */
1907 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
1908 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
1910 /* Indicates that objects of this type (a UNION_TYPE), should be passed
1911 the same way that the first union alternative would be passed. */
1912 #define TYPE_TRANSPARENT_UNION(NODE) \
1913 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
1915 /* For an ARRAY_TYPE, indicates that it is not permitted to
1916 take the address of a component of the type. */
1917 #define TYPE_NONALIASED_COMPONENT(NODE) \
1918 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
1920 /* Indicated that objects of this type should be laid out in as
1921 compact a way as possible. */
1922 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
1924 /* Used by type_contains_placeholder_p to avoid recomputation.
1925 Values are: 0 (unknown), 1 (false), 2 (true). Never access
1926 this field directly. */
1927 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
1928 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
1932 struct tree_type
GTY(())
1934 struct tree_common common
;
1941 unsigned int precision
: 9;
1942 ENUM_BITFIELD(machine_mode
) mode
: 7;
1944 unsigned string_flag
: 1;
1945 unsigned no_force_blk_flag
: 1;
1946 unsigned needs_constructing_flag
: 1;
1947 unsigned transparent_union_flag
: 1;
1948 unsigned packed_flag
: 1;
1949 unsigned restrict_flag
: 1;
1950 unsigned contains_placeholder_bits
: 2;
1952 unsigned lang_flag_0
: 1;
1953 unsigned lang_flag_1
: 1;
1954 unsigned lang_flag_2
: 1;
1955 unsigned lang_flag_3
: 1;
1956 unsigned lang_flag_4
: 1;
1957 unsigned lang_flag_5
: 1;
1958 unsigned lang_flag_6
: 1;
1959 unsigned user_align
: 1;
1964 union tree_type_symtab
{
1965 int GTY ((tag ("0"))) address
;
1966 char * GTY ((tag ("1"))) pointer
;
1967 struct die_struct
* GTY ((tag ("2"))) die
;
1968 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
1969 descbits ("2"))) symtab
;
1977 HOST_WIDE_INT alias_set
;
1978 /* Points to a structure whose details depend on the language in use. */
1979 struct lang_type
*lang_specific
;
1982 /* Define accessor macros for information about type inheritance
1985 A "basetype" means a particular usage of a data type for inheritance
1986 in another type. Each such basetype usage has its own "binfo"
1987 object to describe it. The binfo object is a TREE_VEC node.
1989 Inheritance is represented by the binfo nodes allocated for a
1990 given type. For example, given types C and D, such that D is
1991 inherited by C, 3 binfo nodes will be allocated: one for describing
1992 the binfo properties of C, similarly one for D, and one for
1993 describing the binfo properties of D as a base type for C.
1994 Thus, given a pointer to class C, one can get a pointer to the binfo
1995 of D acting as a basetype for C by looking at C's binfo's basetypes. */
1997 /* BINFO specific flags. */
1999 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2000 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->common.static_flag)
2002 /* Flags for language dependent use. */
2003 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2004 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2005 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2006 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2007 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2008 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2009 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2011 /* The actual data type node being inherited in this basetype. */
2012 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2014 /* The offset where this basetype appears in its containing type.
2015 BINFO_OFFSET slot holds the offset (in bytes)
2016 from the base of the complete object to the base of the part of the
2017 object that is allocated on behalf of this `type'.
2018 This is always 0 except when there is multiple inheritance. */
2020 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2021 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2023 /* The virtual function table belonging to this basetype. Virtual
2024 function tables provide a mechanism for run-time method dispatching.
2025 The entries of a virtual function table are language-dependent. */
2027 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2029 /* The virtual functions in the virtual function table. This is
2030 a TREE_LIST that is used as an initial approximation for building
2031 a virtual function table for this basetype. */
2032 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2034 /* A vector of binfos for the direct basetypes inherited by this
2037 If this basetype describes type D as inherited in C, and if the
2038 basetypes of D are E and F, then this vector contains binfos for
2039 inheritance of E and F by C. */
2040 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2042 /* The number of basetypes for NODE. */
2043 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2045 /* Accessor macro to get to the Nth base binfo of this binfo. */
2046 #define BINFO_BASE_BINFO(NODE,N) \
2047 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2048 #define BINFO_BASE_ITERATE(NODE,N,B) \
2049 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2050 #define BINFO_BASE_APPEND(NODE,T) \
2051 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2053 /* For a BINFO record describing a virtual base class, i.e., one where
2054 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2055 base. The actual contents are language-dependent. In the C++
2056 front-end this field is an INTEGER_CST giving an offset into the
2057 vtable where the offset to the virtual base can be found. */
2058 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2060 /* Indicates the accesses this binfo has to its bases. The values are
2061 access_public_node, access_protected_node or access_private_node.
2062 If this array is not present, public access is implied. */
2063 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2065 #define BINFO_BASE_ACCESS(NODE,N) \
2066 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2067 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2068 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2070 /* The index in the VTT where this subobject's sub-VTT can be found.
2071 NULL_TREE if there is no sub-VTT. */
2072 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2074 /* The index in the VTT where the vptr for this subobject can be
2075 found. NULL_TREE if there is no secondary vptr in the VTT. */
2076 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2078 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2079 inheriting this base for non-virtual bases. For virtual bases it
2080 points either to the binfo for which this is a primary binfo, or to
2081 the binfo of the most derived type. */
2082 #define BINFO_INHERITANCE_CHAIN(NODE) \
2083 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2085 struct tree_binfo
GTY (())
2087 struct tree_common common
;
2093 VEC(tree
,gc
) *base_accesses
;
2099 VEC(tree
,none
) base_binfos
;
2103 /* Define fields and accessors for nodes representing declared names. */
2105 /* Nonzero if DECL represents a variable for the SSA passes. */
2106 #define SSA_VAR_P(DECL) \
2107 (TREE_CODE (DECL) == VAR_DECL \
2108 || TREE_CODE (DECL) == PARM_DECL \
2109 || TREE_CODE (DECL) == RESULT_DECL \
2111 || (TREE_CODE (DECL) == SSA_NAME \
2112 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2113 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2114 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2115 || MTAG_P (SSA_NAME_VAR (DECL)))))
2120 /* Enumerate visibility settings. */
2121 #ifndef SYMBOL_VISIBILITY_DEFINED
2122 #define SYMBOL_VISIBILITY_DEFINED
2123 enum symbol_visibility
2126 VISIBILITY_INTERNAL
,
2128 VISIBILITY_PROTECTED
2135 /* This is the name of the object as written by the user.
2136 It is an IDENTIFIER_NODE. */
2137 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2139 /* Every ..._DECL node gets a unique number. */
2140 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2142 /* These two fields describe where in the source code the declaration
2143 was. If the declaration appears in several places (as for a C
2144 function that is declared first and then defined later), this
2145 information should refer to the definition. */
2146 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2147 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2148 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2149 #ifdef USE_MAPPED_LOCATION
2150 #define DECL_IS_BUILTIN(DECL) \
2151 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2153 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2156 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2157 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2158 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2159 points to either the FUNCTION_DECL for the containing function,
2160 the RECORD_TYPE or UNION_TYPE for the containing type, or
2161 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2163 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2164 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2165 struct tree_decl_minimal
GTY(())
2167 struct tree_common common
;
2174 /* When computing aliasing information, we represent the memory pointed-to
2175 by pointers with artificial variables called "memory tags" (MT). There
2176 are two kinds of tags: type and name. Type tags (TMT) are used in
2177 type-based alias analysis, they represent all the pointed-to locations
2178 and variables of the same alias set class. Name tags (NMT) are used in
2179 flow-sensitive points-to alias analysis, they represent the variables
2180 and memory locations pointed-to by a specific SSA_NAME pointer. */
2182 struct tree_memory_tag
GTY(())
2184 struct tree_decl_minimal common
;
2186 unsigned int is_global
:1;
2189 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2190 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->mtag.parent_var)
2192 /* For any sort of a ..._DECL node, this points to the original (abstract)
2193 decl node which this decl is an instance of, or else it is NULL indicating
2194 that this decl is not an instance of some other decl. For example,
2195 in a nested declaration of an inline function, this points back to the
2197 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2199 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2200 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2201 #define DECL_ORIGIN(NODE) \
2202 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2204 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2205 inline instance of some original (abstract) decl from an inline function;
2206 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2207 nodes can also have their abstract origin set to themselves. */
2208 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2209 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2211 /* In a DECL this is the field where attributes are stored. */
2212 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2214 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2215 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2216 For a VAR_DECL, holds the initial value.
2217 For a PARM_DECL, not used--default
2218 values for parameters are encoded in the type of the function,
2219 not in the PARM_DECL slot.
2220 For a FIELD_DECL, this is used for enumeration values and the C
2221 frontend uses it for temporarily storing bitwidth of bitfields.
2223 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2224 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2226 /* Holds the size of the datum, in bits, as a tree expression.
2227 Need not be constant. */
2228 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2229 /* Likewise for the size in bytes. */
2230 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2231 /* Holds the alignment required for the datum, in bits. */
2232 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.u1.a.align)
2233 /* The alignment of NODE, in bytes. */
2234 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2235 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2236 DECL_FIELD_OFFSET which are known to be always zero.
2237 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2239 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2240 /* Holds the machine mode corresponding to the declaration of a variable or
2241 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2243 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2245 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2246 operation it is. Note, however, that this field is overloaded, with
2247 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2248 checked before any access to the former. */
2249 #define DECL_FUNCTION_CODE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_common.u1.f)
2250 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2251 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2253 /* Nonzero for a given ..._DECL node means that the name of this node should
2254 be ignored for symbolic debug purposes. */
2255 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2257 /* Nonzero for a given ..._DECL node means that this node represents an
2258 "abstract instance" of the given declaration (e.g. in the original
2259 declaration of an inline function). When generating symbolic debugging
2260 information, we mustn't try to generate any address information for nodes
2261 marked as "abstract instances" because we don't actually generate
2262 any code or allocate any data space for such instances. */
2263 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2265 /* Language-specific decl information. */
2266 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2268 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2269 do not allocate storage, and refer to a definition elsewhere. Note that
2270 this does not necessarily imply the entity represented by NODE
2271 has no program source-level definition in this translation unit. For
2272 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2273 DECL_EXTERNAL may be true simultaneously; that can be the case for
2274 a C99 "extern inline" function. */
2275 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2277 /* In a VAR_DECL for a RECORD_TYPE, sets number for non-init_priority
2279 #define DEFAULT_INIT_PRIORITY 65535
2280 #define MAX_INIT_PRIORITY 65535
2281 #define MAX_RESERVED_INIT_PRIORITY 100
2284 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2285 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2287 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2289 Also set in some languages for variables, etc., outside the normal
2290 lexical scope, such as class instance variables. */
2291 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2293 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2294 Used in FIELD_DECLs for vtable pointers.
2295 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2296 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2298 /* Used to indicate that this DECL represents a compiler-generated entity. */
2299 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2301 /* Additional flags for language-specific uses. */
2302 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2303 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2304 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2305 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2306 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2307 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2308 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2309 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2311 /* Used to indicate an alias set for the memory pointed to by this
2312 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2313 pointer (or reference) type. */
2314 #define DECL_POINTER_ALIAS_SET(NODE) \
2315 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2317 /* Nonzero if an alias set has been assigned to this declaration. */
2318 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2319 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2321 /* Nonzero for a decl which is at file scope. */
2322 #define DECL_FILE_SCOPE_P(EXP) \
2323 (! DECL_CONTEXT (EXP) \
2324 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2326 /* Nonzero for a decl that is decorated using attribute used.
2327 This indicates compiler tools that this decl needs to be preserved. */
2328 #define DECL_PRESERVE_P(DECL) \
2329 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2331 /* For function local variables of COMPLEX type, indicates that the
2332 variable is not aliased, and that all modifications to the variable
2333 have been adjusted so that they are killing assignments. Thus the
2334 variable may now be treated as a GIMPLE register, and use real
2335 instead of virtual ops in SSA form. */
2336 #define DECL_COMPLEX_GIMPLE_REG_P(DECL) \
2337 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2339 struct tree_decl_common
GTY(())
2341 struct tree_decl_minimal common
;
2344 ENUM_BITFIELD(machine_mode
) mode
: 8;
2346 unsigned nonlocal_flag
: 1;
2347 unsigned virtual_flag
: 1;
2348 unsigned ignored_flag
: 1;
2349 unsigned abstract_flag
: 1;
2350 unsigned artificial_flag
: 1;
2351 unsigned user_align
: 1;
2352 unsigned preserve_flag
: 1;
2353 unsigned debug_expr_is_from
: 1;
2355 unsigned lang_flag_0
: 1;
2356 unsigned lang_flag_1
: 1;
2357 unsigned lang_flag_2
: 1;
2358 unsigned lang_flag_3
: 1;
2359 unsigned lang_flag_4
: 1;
2360 unsigned lang_flag_5
: 1;
2361 unsigned lang_flag_6
: 1;
2362 unsigned lang_flag_7
: 1;
2364 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2365 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2366 unsigned decl_flag_0
: 1;
2367 /* In FIELD_DECL, this is DECL_PACKED. */
2368 unsigned decl_flag_1
: 1;
2369 /* In FIELD_DECL, this is DECL_BIT_FIELD
2370 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2371 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2372 unsigned decl_flag_2
: 1;
2373 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2374 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2375 unsigned decl_flag_3
: 1;
2376 /* Logically, this would go in a theoretical base shared by var and parm
2378 unsigned gimple_reg_flag
: 1;
2380 union tree_decl_u1
{
2381 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
2382 DECL_FUNCTION_CODE. */
2383 enum built_in_function f
;
2384 /* In a FUNCTION_DECL for which DECL_BUILT_IN does not hold, this
2385 is used by language-dependent code. */
2387 /* DECL_ALIGN and DECL_OFFSET_ALIGN. (These are not used for
2389 struct tree_decl_u1_a
{
2390 unsigned int align
: 24;
2391 unsigned int off_align
: 8;
2398 tree abstract_origin
;
2400 HOST_WIDE_INT pointer_alias_set
;
2401 /* Points to a structure whose details depend on the language in use. */
2402 struct lang_decl
*lang_specific
;
2405 extern tree
decl_value_expr_lookup (tree
);
2406 extern void decl_value_expr_insert (tree
, tree
);
2408 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2409 if transformations have made this more complicated than evaluating the
2410 decl itself. This should only be used for debugging; once this field has
2411 been set, the decl itself may not legitimately appear in the function. */
2412 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2413 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2414 #define DECL_VALUE_EXPR(NODE) \
2415 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2416 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2417 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2419 /* Holds the RTL expression for the value of a variable or function.
2420 This value can be evaluated lazily for functions, variables with
2421 static storage duration, and labels. */
2422 #define DECL_RTL(NODE) \
2423 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2424 ? (NODE)->decl_with_rtl.rtl \
2425 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2427 /* Set the DECL_RTL for NODE to RTL. */
2428 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2430 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2431 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2433 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2434 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2436 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2437 NODE1, it will not be set for NODE2; this is a lazy copy. */
2438 #define COPY_DECL_RTL(NODE1, NODE2) \
2439 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2441 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2442 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2444 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2445 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2447 struct tree_decl_with_rtl
GTY(())
2449 struct tree_decl_common common
;
2453 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2454 byte containing the bit closest to the beginning of the structure. */
2455 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2457 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2458 field from DECL_FIELD_OFFSET. */
2459 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2461 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2462 if so, the type that was originally specified for it.
2463 TREE_TYPE may have been modified (in finish_struct). */
2464 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2466 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2467 if nonzero, indicates that the field occupies the type. */
2468 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2470 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2471 DECL_FIELD_OFFSET which are known to be always zero.
2472 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2474 #define DECL_OFFSET_ALIGN(NODE) \
2475 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align)
2477 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2478 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2479 (FIELD_DECL_CHECK (NODE)->decl_common.u1.a.off_align = exact_log2 ((X) & -(X)))
2480 /* 1 if the alignment for this type was requested by "aligned" attribute,
2481 0 if it is the default for this type. */
2483 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2484 which this FIELD_DECL is defined. This information is needed when
2485 writing debugging information about vfield and vbase decls for C++. */
2486 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2488 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2489 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2491 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2493 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2495 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2497 #define DECL_NONADDRESSABLE_P(NODE) \
2498 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2500 struct tree_field_decl
GTY(())
2502 struct tree_decl_common common
;
2505 tree bit_field_type
;
2512 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2513 dense, unique within any one function, and may be used to index arrays.
2514 If the value is -1, then no UID has been assigned. */
2515 #define LABEL_DECL_UID(NODE) \
2516 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2518 /* In LABEL_DECL nodes, nonzero means that an error message about
2519 jumping into such a binding contour has been printed for this label. */
2520 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2522 struct tree_label_decl
GTY(())
2524 struct tree_decl_with_rtl common
;
2525 /* Java's verifier has some need to store information about labels,
2526 and was using fields that no longer exist on labels.
2527 Once the verifier doesn't need these anymore, they should be removed. */
2531 unsigned int java_field_4
;
2535 struct tree_result_decl
GTY(())
2537 struct tree_decl_with_rtl common
;
2540 struct tree_const_decl
GTY(())
2542 struct tree_decl_with_rtl common
;
2545 /* For a PARM_DECL, records the data type used to pass the argument,
2546 which may be different from the type seen in the program. */
2547 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2549 /* For PARM_DECL, holds an RTL for the stack slot or register
2550 where the data was actually passed. */
2551 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2553 struct tree_parm_decl
GTY(())
2555 struct tree_decl_with_rtl common
;
2560 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2561 this variable in a BIND_EXPR. */
2562 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2563 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2565 /* Used to indicate that the linkage status of this DECL is not yet known,
2566 so it should not be output now. */
2567 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2569 /* Nonzero for a given ..._DECL node means that no warnings should be
2570 generated just because this node is unused. */
2571 #define DECL_IN_SYSTEM_HEADER(NODE) \
2572 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2574 /* Used to indicate that this DECL has weak linkage. */
2575 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2577 /* Internal to the gimplifier. Indicates that the value is a formal
2578 temporary controlled by the gimplifier. */
2579 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2580 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2582 /* Used to indicate that the DECL is a dllimport. */
2583 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2585 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2586 based on a variable with a restrict qualified type. If it is,
2587 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2590 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2591 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2592 #define DECL_GET_RESTRICT_BASE(NODE) \
2593 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2594 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2595 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2597 extern tree
decl_restrict_base_lookup (tree
);
2598 extern void decl_restrict_base_insert (tree
, tree
);
2600 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2601 not be put out unless it is needed in this translation unit.
2602 Entities like this are shared across translation units (like weak
2603 entities), but are guaranteed to be generated by any translation
2604 unit that needs them, and therefore need not be put out anywhere
2605 where they are not needed. DECL_COMDAT is just a hint to the
2606 back-end; it is up to front-ends which set this flag to ensure
2607 that there will never be any harm, other than bloat, in putting out
2608 something which is DECL_COMDAT. */
2609 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2611 /* The name of the object as the assembler will see it (but before any
2612 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2613 as DECL_NAME. It is an IDENTIFIER_NODE. */
2614 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2616 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2617 This is true of all DECL nodes except FIELD_DECL. */
2618 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2619 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2621 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2622 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2624 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2625 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2627 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2628 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2629 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2631 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2632 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2633 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2634 semantics of using this macro, are different than saying:
2636 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2638 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2640 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2641 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2642 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2643 DECL_ASSEMBLER_NAME (DECL1)) \
2646 /* Records the section name in a section attribute. Used to pass
2647 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2648 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2650 /* Value of the decls's visibility attribute */
2651 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2653 /* Nonzero means that the decl had its visibility specified rather than
2655 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2657 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2658 multiple translation units should be merged. */
2659 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2661 struct tree_decl_with_vis
GTY(())
2663 struct tree_decl_with_rtl common
;
2664 tree assembler_name
;
2667 /* Belong to VAR_DECL exclusively. */
2668 unsigned defer_output
:1;
2669 unsigned hard_register
:1;
2670 unsigned thread_local
:1;
2671 unsigned common_flag
:1;
2672 unsigned in_text_section
: 1;
2673 unsigned gimple_formal_temp
: 1;
2674 unsigned dllimport_flag
: 1;
2675 unsigned based_on_restrict_p
: 1;
2676 /* Used by C++. Might become a generic decl flag. */
2677 unsigned shadowed_for_var_p
: 1;
2679 /* Don't belong to VAR_DECL exclusively. */
2680 unsigned in_system_header_flag
: 1;
2681 unsigned weak_flag
:1;
2682 unsigned seen_in_bind_expr
: 1;
2683 unsigned comdat_flag
: 1;
2684 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
2685 unsigned visibility_specified
: 1;
2686 /* Belong to FUNCTION_DECL exclusively. */
2687 unsigned one_only
: 1;
2688 unsigned init_priority_p
:1;
2690 /* Belongs to VAR_DECL exclusively. */
2691 ENUM_BITFIELD(tls_model
) tls_model
: 3;
2692 /* 11 unused bits. */
2695 /* In a VAR_DECL that's static,
2696 nonzero if the space is in the text section. */
2697 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2699 /* Nonzero for a given ..._DECL node means that this node should be
2700 put in .common, if possible. If a DECL_INITIAL is given, and it
2701 is not error_mark_node, then the decl cannot be put in .common. */
2702 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2704 /* In a VAR_DECL, nonzero if the decl is a register variable with
2705 an explicit asm specification. */
2706 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2708 extern tree
decl_debug_expr_lookup (tree
);
2709 extern void decl_debug_expr_insert (tree
, tree
);
2710 /* For VAR_DECL, this is set to either an expression that it was split
2711 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2712 subexpressions that it was split into. */
2713 #define DECL_DEBUG_EXPR(NODE) \
2714 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2716 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2717 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2720 extern unsigned short decl_init_priority_lookup (tree
);
2721 extern void decl_init_priority_insert (tree
, unsigned short);
2723 /* In a non-local VAR_DECL with static storage duration, this is the
2724 initialization priority. If this value is zero, the NODE will be
2725 initialized at the DEFAULT_INIT_PRIORITY. Only used by C++ FE*/
2727 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2728 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2729 #define DECL_INIT_PRIORITY(NODE) \
2730 (decl_init_priority_lookup (VAR_DECL_CHECK (NODE)))
2731 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2732 (decl_init_priority_insert (VAR_DECL_CHECK (NODE), VAL))
2734 /* In a VAR_DECL, the model to use if the data should be allocated from
2735 thread-local storage. */
2736 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
2738 /* In a VAR_DECL, nonzero if the data should be allocated from
2739 thread-local storage. */
2740 #define DECL_THREAD_LOCAL_P(NODE) \
2741 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
2743 struct tree_var_decl
GTY(())
2745 struct tree_decl_with_vis common
;
2749 /* This field is used to reference anything in decl.result and is meant only
2750 for use by the garbage collector. */
2751 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
2753 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
2754 Before the struct containing the FUNCTION_DECL is laid out,
2755 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
2756 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
2757 function. When the class is laid out, this pointer is changed
2758 to an INTEGER_CST node which is suitable for use as an index
2759 into the virtual function table.
2760 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
2761 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
2763 struct tree_decl_non_common
GTY(())
2766 struct tree_decl_with_vis common
;
2767 /* C++ uses this in namespaces. */
2769 /* C++ uses this in templates. */
2771 /* Almost all FE's use this. */
2773 /* C++ uses this in namespaces. */
2777 /* In FUNCTION_DECL, holds the decl for the return value. */
2778 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
2780 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
2781 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
2783 /* In a FUNCTION_DECL, the saved representation of the body of the
2785 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
2787 /* Nonzero in a FUNCTION_DECL means this function should be treated
2788 as if it were a malloc, meaning it returns a pointer that is
2790 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
2792 /* Nonzero in a FUNCTION_DECL means this function may return more
2794 #define DECL_IS_RETURNS_TWICE(NODE) \
2795 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
2797 /* Nonzero in a FUNCTION_DECL means this function should be treated
2798 as "pure" function (like const function, but may read global memory). */
2799 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
2801 /* Nonzero in a FUNCTION_DECL means this function should be treated
2802 as "novops" function (function that does not read global memory,
2803 but may have arbitrary side effects). */
2804 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
2806 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
2807 at the beginning or end of execution. */
2808 #define DECL_STATIC_CONSTRUCTOR(NODE) \
2809 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
2811 #define DECL_STATIC_DESTRUCTOR(NODE) \
2812 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
2814 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
2815 be instrumented with calls to support routines. */
2816 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
2817 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
2819 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
2820 disabled in this function. */
2821 #define DECL_NO_LIMIT_STACK(NODE) \
2822 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
2824 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
2825 static chain is not needed. */
2826 #define DECL_NO_STATIC_CHAIN(NODE) \
2827 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
2829 /* Nonzero for a decl that cgraph has decided should be inlined into
2830 at least one call site. It is not meaningful to look at this
2831 directly; always use cgraph_function_possibly_inlined_p. */
2832 #define DECL_POSSIBLY_INLINED(DECL) \
2833 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
2835 /* Nonzero in a FUNCTION_DECL means this function can be substituted
2836 where it is called. */
2837 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
2839 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
2840 such as via the `inline' keyword in C/C++. This flag controls the linkage
2841 semantics of 'inline'; whether or not the function is inlined is
2842 controlled by DECL_INLINE. */
2843 #define DECL_DECLARED_INLINE_P(NODE) \
2844 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
2846 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
2847 that describes the status of this function. */
2848 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
2850 /* In a FUNCTION_DECL, nonzero means a built in function. */
2851 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
2853 /* For a builtin function, identify which part of the compiler defined it. */
2854 #define DECL_BUILT_IN_CLASS(NODE) \
2855 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
2857 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
2858 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
2860 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
2861 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
2863 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
2864 arguments/result/saved_tree fields by front ends. It was either inherit
2865 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
2866 which seemed a bit strange. */
2868 struct tree_function_decl
GTY(())
2870 struct tree_decl_non_common common
;
2872 unsigned static_ctor_flag
: 1;
2873 unsigned static_dtor_flag
: 1;
2874 unsigned uninlinable
: 1;
2875 unsigned possibly_inlined
: 1;
2876 unsigned novops_flag
: 1;
2877 unsigned returns_twice_flag
: 1;
2878 unsigned malloc_flag
: 1;
2879 unsigned pure_flag
: 1;
2881 unsigned declared_inline_flag
: 1;
2882 unsigned regdecl_flag
: 1;
2883 unsigned inline_flag
: 1;
2884 unsigned no_instrument_function_entry_exit
: 1;
2885 unsigned no_limit_stack
: 1;
2886 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
2891 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
2892 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
2894 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
2895 into stabs. Instead it will generate cross reference ('x') of names.
2896 This uses the same flag as DECL_EXTERNAL. */
2897 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
2898 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2900 struct tree_type_decl
GTY(())
2902 struct tree_decl_non_common common
;
2906 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
2907 To reduce overhead, the nodes containing the statements are not trees.
2908 This avoids the overhead of tree_common on all linked list elements.
2910 Use the interface in tree-iterator.h to access this node. */
2912 #define STATEMENT_LIST_HEAD(NODE) \
2913 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
2914 #define STATEMENT_LIST_TAIL(NODE) \
2915 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
2917 struct tree_statement_list_node
2918 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
2920 struct tree_statement_list_node
*prev
;
2921 struct tree_statement_list_node
*next
;
2925 struct tree_statement_list
2928 struct tree_common common
;
2929 struct tree_statement_list_node
*head
;
2930 struct tree_statement_list_node
*tail
;
2933 #define VALUE_HANDLE_ID(NODE) \
2934 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
2936 #define VALUE_HANDLE_EXPR_SET(NODE) \
2937 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
2939 #define VALUE_HANDLE_VUSES(NODE) \
2940 (VALUE_HANDLE_CHECK (NODE)->value_handle.vuses)
2942 /* Defined and used in tree-ssa-pre.c. */
2945 struct tree_value_handle
GTY(())
2947 struct tree_common common
;
2949 /* The set of expressions represented by this handle. */
2950 struct value_set
* GTY ((skip
)) expr_set
;
2952 /* Unique ID for this value handle. IDs are handed out in a
2953 conveniently dense form starting at 0, so that we can make
2954 bitmaps of value handles. */
2957 /* Set of virtual uses represented by this handle. */
2958 VEC (tree
, gc
) *vuses
;
2961 /* Define the overall contents of a tree node.
2962 It may be any of the structures declared above
2963 for various types of node. */
2965 union tree_node
GTY ((ptr_alias (union lang_tree_node
),
2966 desc ("tree_node_structure (&%h)")))
2968 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
2969 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
2970 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
2971 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
2972 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
2973 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
2974 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
2975 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
2976 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
2977 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
2978 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
2979 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
2980 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
2981 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
2982 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
2983 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
2984 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
2985 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
2986 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
2987 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
2988 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
2989 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
2990 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
2991 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
2992 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
2993 struct tree_phi_node
GTY ((tag ("TS_PHI_NODE"))) phi
;
2994 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
2995 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
2996 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
2997 struct tree_value_handle
GTY ((tag ("TS_VALUE_HANDLE"))) value_handle
;
2998 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
2999 struct tree_memory_tag
GTY ((tag ("TS_MEMORY_TAG"))) mtag
;
3002 /* Standard named or nameless data types of the C compiler. */
3021 TI_INTEGER_MINUS_ONE
,
3038 TI_COMPLEX_INTEGER_TYPE
,
3039 TI_COMPLEX_FLOAT_TYPE
,
3040 TI_COMPLEX_DOUBLE_TYPE
,
3041 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3045 TI_LONG_DOUBLE_TYPE
,
3049 TI_LONG_DOUBLE_PTR_TYPE
,
3050 TI_INTEGER_PTR_TYPE
,
3059 TI_VA_LIST_GPR_COUNTER_FIELD
,
3060 TI_VA_LIST_FPR_COUNTER_FIELD
,
3067 TI_DFLOAT32_PTR_TYPE
,
3068 TI_DFLOAT64_PTR_TYPE
,
3069 TI_DFLOAT128_PTR_TYPE
,
3078 extern GTY(()) tree global_trees
[TI_MAX
];
3080 #define error_mark_node global_trees[TI_ERROR_MARK]
3082 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3083 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3084 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3085 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3086 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3088 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3089 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3090 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3091 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3092 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3094 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3095 #define integer_one_node global_trees[TI_INTEGER_ONE]
3096 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3097 #define size_zero_node global_trees[TI_SIZE_ZERO]
3098 #define size_one_node global_trees[TI_SIZE_ONE]
3099 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3100 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3101 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3103 /* Base access nodes. */
3104 #define access_public_node global_trees[TI_PUBLIC]
3105 #define access_protected_node global_trees[TI_PROTECTED]
3106 #define access_private_node global_trees[TI_PRIVATE]
3108 #define null_pointer_node global_trees[TI_NULL_POINTER]
3110 #define float_type_node global_trees[TI_FLOAT_TYPE]
3111 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3112 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3114 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3115 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3116 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3117 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3119 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3120 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3121 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3122 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3124 #define void_type_node global_trees[TI_VOID_TYPE]
3125 /* The C type `void *'. */
3126 #define ptr_type_node global_trees[TI_PTR_TYPE]
3127 /* The C type `const void *'. */
3128 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3129 /* The C type `size_t'. */
3130 #define size_type_node global_trees[TI_SIZE_TYPE]
3131 #define pid_type_node global_trees[TI_PID_TYPE]
3132 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3133 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3134 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3135 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3136 /* The C type `FILE *'. */
3137 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3139 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3140 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3141 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3143 /* The decimal floating point types. */
3144 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3145 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3146 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3147 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3148 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3149 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3151 /* The node that should be placed at the end of a parameter list to
3152 indicate that the function does not take a variable number of
3153 arguments. The TREE_VALUE will be void_type_node and there will be
3154 no TREE_CHAIN. Language-independent code should not assume
3155 anything else about this node. */
3156 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3158 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3159 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3161 /* An enumeration of the standard C integer types. These must be
3162 ordered so that shorter types appear before longer ones, and so
3163 that signed types appear before unsigned ones, for the correct
3164 functioning of interpret_integer() in c-lex.c. */
3165 enum integer_type_kind
3177 itk_unsigned_long_long
,
3181 typedef enum integer_type_kind integer_type_kind
;
3183 /* The standard C integer types. Use integer_type_kind to index into
3185 extern GTY(()) tree integer_types
[itk_none
];
3187 #define char_type_node integer_types[itk_char]
3188 #define signed_char_type_node integer_types[itk_signed_char]
3189 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3190 #define short_integer_type_node integer_types[itk_short]
3191 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3192 #define integer_type_node integer_types[itk_int]
3193 #define unsigned_type_node integer_types[itk_unsigned_int]
3194 #define long_integer_type_node integer_types[itk_long]
3195 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3196 #define long_long_integer_type_node integer_types[itk_long_long]
3197 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3199 /* Set to the default thread-local storage (tls) model to use. */
3201 extern enum tls_model flag_tls_default
;
3204 /* A pointer-to-function member type looks like:
3211 If __pfn is NULL, it is a NULL pointer-to-member-function.
3213 (Because the vtable is always the first thing in the object, we
3214 don't need its offset.) If the function is virtual, then PFN is
3215 one plus twice the index into the vtable; otherwise, it is just a
3216 pointer to the function.
3218 Unfortunately, using the lowest bit of PFN doesn't work in
3219 architectures that don't impose alignment requirements on function
3220 addresses, or that use the lowest bit to tell one ISA from another,
3221 for example. For such architectures, we use the lowest bit of
3222 DELTA instead of the lowest bit of the PFN, and DELTA will be
3225 enum ptrmemfunc_vbit_where_t
3227 ptrmemfunc_vbit_in_pfn
,
3228 ptrmemfunc_vbit_in_delta
3231 #define NULL_TREE (tree) NULL
3233 extern tree
decl_assembler_name (tree
);
3235 /* Compute the number of bytes occupied by 'node'. This routine only
3236 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3238 extern size_t tree_size (tree
);
3240 /* Compute the number of bytes occupied by a tree with code CODE. This
3241 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3243 extern size_t tree_code_size (enum tree_code
);
3245 /* Lowest level primitive for allocating a node.
3246 The TREE_CODE is the only argument. Contents are initialized
3247 to zero except for a few of the common fields. */
3249 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3250 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3252 /* Make a copy of a node, with all the same contents. */
3254 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3255 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3257 /* Make a copy of a chain of TREE_LIST nodes. */
3259 extern tree
copy_list (tree
);
3262 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3263 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3265 /* Make a TREE_VEC. */
3267 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3268 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3270 /* Tree nodes for SSA analysis. */
3272 extern void init_phinodes (void);
3273 extern void fini_phinodes (void);
3274 extern void release_phi_node (tree
);
3275 #ifdef GATHER_STATISTICS
3276 extern void phinodes_print_statistics (void);
3279 extern void init_ssanames (void);
3280 extern void fini_ssanames (void);
3281 extern tree
make_ssa_name (tree
, tree
);
3282 extern tree
duplicate_ssa_name (tree
, tree
);
3283 extern void duplicate_ssa_name_ptr_info (tree
, struct ptr_info_def
*);
3284 extern void release_ssa_name (tree
);
3285 extern void release_defs (tree
);
3286 extern void replace_ssa_name_symbol (tree
, tree
);
3288 #ifdef GATHER_STATISTICS
3289 extern void ssanames_print_statistics (void);
3292 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3293 The name is supplied as a char *. */
3295 extern tree
get_identifier (const char *);
3297 #if GCC_VERSION >= 3000
3298 #define get_identifier(str) \
3299 (__builtin_constant_p (str) \
3300 ? get_identifier_with_length ((str), strlen (str)) \
3301 : get_identifier (str))
3305 /* Identical to get_identifier, except that the length is assumed
3308 extern tree
get_identifier_with_length (const char *, size_t);
3310 /* If an identifier with the name TEXT (a null-terminated string) has
3311 previously been referred to, return that node; otherwise return
3314 extern tree
maybe_get_identifier (const char *);
3316 /* Construct various types of nodes. */
3318 extern tree
build_nt (enum tree_code
, ...);
3320 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3321 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3322 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3323 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3324 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3325 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3326 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3327 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3328 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3329 tree MEM_STAT_DECL
);
3330 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3331 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3332 tree MEM_STAT_DECL
);
3333 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3334 extern tree
build7_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3335 tree
, tree
, tree MEM_STAT_DECL
);
3336 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3337 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3339 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3340 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3341 extern tree
build_int_cstu (tree
, unsigned HOST_WIDE_INT
);
3342 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3343 extern tree
build_vector (tree
, tree
);
3344 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
3345 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
3346 extern tree
build_constructor_single (tree
, tree
, tree
);
3347 extern tree
build_constructor_from_list (tree
, tree
);
3348 extern tree
build_real_from_int_cst (tree
, tree
);
3349 extern tree
build_complex (tree
, tree
, tree
);
3350 extern tree
build_string (int, const char *);
3351 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3352 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3353 extern tree
build_decl_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3354 extern tree
build_fn_decl (const char *, tree
);
3355 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3356 extern tree
build_block (tree
, tree
, tree
, tree
);
3357 #ifndef USE_MAPPED_LOCATION
3358 extern void annotate_with_file_line (tree
, const char *, int);
3359 extern void annotate_with_locus (tree
, location_t
);
3361 extern tree
build_empty_stmt (void);
3363 /* Construct various nodes representing data types. */
3365 extern tree
make_signed_type (int);
3366 extern tree
make_unsigned_type (int);
3367 extern tree
signed_type_for (tree
);
3368 extern tree
unsigned_type_for (tree
);
3369 extern void initialize_sizetypes (bool);
3370 extern void set_sizetype (tree
);
3371 extern void fixup_unsigned_type (tree
);
3372 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3373 extern tree
build_pointer_type (tree
);
3374 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3375 extern tree
build_reference_type (tree
);
3376 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3377 extern tree
build_vector_type (tree innertype
, int nunits
);
3378 extern tree
build_type_no_quals (tree
);
3379 extern tree
build_index_type (tree
);
3380 extern tree
build_index_2_type (tree
, tree
);
3381 extern tree
build_array_type (tree
, tree
);
3382 extern tree
build_function_type (tree
, tree
);
3383 extern tree
build_function_type_list (tree
, ...);
3384 extern tree
build_method_type_directly (tree
, tree
, tree
);
3385 extern tree
build_method_type (tree
, tree
);
3386 extern tree
build_offset_type (tree
, tree
);
3387 extern tree
build_complex_type (tree
);
3388 extern tree
build_resx (int);
3389 extern tree
array_type_nelts (tree
);
3390 extern bool in_array_bounds_p (tree
);
3392 extern tree
value_member (tree
, tree
);
3393 extern tree
purpose_member (tree
, tree
);
3395 extern int attribute_list_equal (tree
, tree
);
3396 extern int attribute_list_contained (tree
, tree
);
3397 extern int tree_int_cst_equal (tree
, tree
);
3398 extern int tree_int_cst_lt (tree
, tree
);
3399 extern int tree_int_cst_compare (tree
, tree
);
3400 extern int host_integerp (tree
, int);
3401 extern HOST_WIDE_INT
tree_low_cst (tree
, int);
3402 extern int tree_int_cst_msb (tree
);
3403 extern int tree_int_cst_sgn (tree
);
3404 extern int tree_int_cst_sign_bit (tree
);
3405 extern int tree_expr_nonnegative_p (tree
);
3406 extern bool may_negate_without_overflow_p (tree
);
3407 extern tree
get_inner_array_type (tree
);
3409 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3410 put the prototype here. Rtl.h does declare the prototype if
3411 tree.h had been included. */
3413 extern tree
make_tree (tree
, rtx
);
3415 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3418 Such modified types already made are recorded so that duplicates
3421 extern tree
build_type_attribute_variant (tree
, tree
);
3422 extern tree
build_decl_attribute_variant (tree
, tree
);
3424 /* Structure describing an attribute and a function to handle it. */
3425 struct attribute_spec
3427 /* The name of the attribute (without any leading or trailing __),
3428 or NULL to mark the end of a table of attributes. */
3429 const char *const name
;
3430 /* The minimum length of the list of arguments of the attribute. */
3431 const int min_length
;
3432 /* The maximum length of the list of arguments of the attribute
3433 (-1 for no maximum). */
3434 const int max_length
;
3435 /* Whether this attribute requires a DECL. If it does, it will be passed
3436 from types of DECLs, function return types and array element types to
3437 the DECLs, function types and array types respectively; but when
3438 applied to a type in any other circumstances, it will be ignored with
3439 a warning. (If greater control is desired for a given attribute,
3440 this should be false, and the flags argument to the handler may be
3441 used to gain greater control in that case.) */
3442 const bool decl_required
;
3443 /* Whether this attribute requires a type. If it does, it will be passed
3444 from a DECL to the type of that DECL. */
3445 const bool type_required
;
3446 /* Whether this attribute requires a function (or method) type. If it does,
3447 it will be passed from a function pointer type to the target type,
3448 and from a function return type (which is not itself a function
3449 pointer type) to the function type. */
3450 const bool function_type_required
;
3451 /* Function to handle this attribute. NODE points to the node to which
3452 the attribute is to be applied. If a DECL, it should be modified in
3453 place; if a TYPE, a copy should be created. NAME is the name of the
3454 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3455 of the arguments (which may be NULL). FLAGS gives further information
3456 about the context of the attribute. Afterwards, the attributes will
3457 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3458 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3459 as well as in any other cases when the attributes should not be added
3460 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3461 applied to another type or DECL later may be returned;
3462 otherwise the return value should be NULL_TREE. This pointer may be
3463 NULL if no special handling is required beyond the checks implied
3464 by the rest of this structure. */
3465 tree (*const handler
) (tree
*node
, tree name
, tree args
,
3466 int flags
, bool *no_add_attrs
);
3469 /* Flags that may be passed in the third argument of decl_attributes, and
3470 to handler functions for attributes. */
3471 enum attribute_flags
3473 /* The type passed in is the type of a DECL, and any attributes that
3474 should be passed in again to be applied to the DECL rather than the
3475 type should be returned. */
3476 ATTR_FLAG_DECL_NEXT
= 1,
3477 /* The type passed in is a function return type, and any attributes that
3478 should be passed in again to be applied to the function type rather
3479 than the return type should be returned. */
3480 ATTR_FLAG_FUNCTION_NEXT
= 2,
3481 /* The type passed in is an array element type, and any attributes that
3482 should be passed in again to be applied to the array type rather
3483 than the element type should be returned. */
3484 ATTR_FLAG_ARRAY_NEXT
= 4,
3485 /* The type passed in is a structure, union or enumeration type being
3486 created, and should be modified in place. */
3487 ATTR_FLAG_TYPE_IN_PLACE
= 8,
3488 /* The attributes are being applied by default to a library function whose
3489 name indicates known behavior, and should be silently ignored if they
3490 are not in fact compatible with the function type. */
3491 ATTR_FLAG_BUILT_IN
= 16
3494 /* Default versions of target-overridable functions. */
3496 extern tree
merge_decl_attributes (tree
, tree
);
3497 extern tree
merge_type_attributes (tree
, tree
);
3499 /* Given a tree node and a string, return nonzero if the tree node is
3500 a valid attribute name for the string. */
3502 extern int is_attribute_p (const char *, tree
);
3504 /* Given an attribute name and a list of attributes, return the list element
3505 of the attribute or NULL_TREE if not found. */
3507 extern tree
lookup_attribute (const char *, tree
);
3509 /* Given two attributes lists, return a list of their union. */
3511 extern tree
merge_attributes (tree
, tree
);
3513 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3514 /* Given two Windows decl attributes lists, possibly including
3515 dllimport, return a list of their union . */
3516 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
3518 /* Handle a "dllimport" or "dllexport" attribute. */
3519 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
3522 /* Check whether CAND is suitable to be returned from get_qualified_type
3523 (BASE, TYPE_QUALS). */
3525 extern bool check_qualified_type (tree
, tree
, int);
3527 /* Return a version of the TYPE, qualified as indicated by the
3528 TYPE_QUALS, if one exists. If no qualified version exists yet,
3529 return NULL_TREE. */
3531 extern tree
get_qualified_type (tree
, int);
3533 /* Like get_qualified_type, but creates the type if it does not
3534 exist. This function never returns NULL_TREE. */
3536 extern tree
build_qualified_type (tree
, int);
3538 /* Like build_qualified_type, but only deals with the `const' and
3539 `volatile' qualifiers. This interface is retained for backwards
3540 compatibility with the various front-ends; new code should use
3541 build_qualified_type instead. */
3543 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
3544 build_qualified_type ((TYPE), \
3545 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
3546 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
3548 /* Make a copy of a type node. */
3550 extern tree
build_distinct_type_copy (tree
);
3551 extern tree
build_variant_type_copy (tree
);
3553 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
3554 fields. Optionally specify an alignment, and then lay it out. */
3556 extern void finish_builtin_struct (tree
, const char *,
3559 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
3560 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
3561 node, does nothing except for the first time. */
3563 extern void layout_type (tree
);
3565 /* These functions allow a front-end to perform a manual layout of a
3566 RECORD_TYPE. (For instance, if the placement of subsequent fields
3567 depends on the placement of fields so far.) Begin by calling
3568 start_record_layout. Then, call place_field for each of the
3569 fields. Then, call finish_record_layout. See layout_type for the
3570 default way in which these functions are used. */
3572 typedef struct record_layout_info_s
3574 /* The RECORD_TYPE that we are laying out. */
3576 /* The offset into the record so far, in bytes, not including bits in
3579 /* The last known alignment of SIZE. */
3580 unsigned int offset_align
;
3581 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
3583 /* The alignment of the record so far, in bits. */
3584 unsigned int record_align
;
3585 /* The alignment of the record so far, ignoring #pragma pack and
3586 __attribute__ ((packed)), in bits. */
3587 unsigned int unpacked_align
;
3588 /* The previous field layed out. */
3590 /* The static variables (i.e., class variables, as opposed to
3591 instance variables) encountered in T. */
3592 tree pending_statics
;
3593 /* Bits remaining in the current alignment group */
3594 int remaining_in_alignment
;
3595 /* True if prev_field was packed and we haven't found any non-packed
3596 fields that we have put in the same alignment group. */
3598 /* True if we've seen a packed field that didn't have normal
3599 alignment anyway. */
3600 int packed_maybe_necessary
;
3601 } *record_layout_info
;
3603 extern void set_lang_adjust_rli (void (*) (record_layout_info
));
3604 extern record_layout_info
start_record_layout (tree
);
3605 extern tree
bit_from_pos (tree
, tree
);
3606 extern tree
byte_from_pos (tree
, tree
);
3607 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
3608 extern void normalize_offset (tree
*, tree
*, unsigned int);
3609 extern tree
rli_size_unit_so_far (record_layout_info
);
3610 extern tree
rli_size_so_far (record_layout_info
);
3611 extern void normalize_rli (record_layout_info
);
3612 extern void place_field (record_layout_info
, tree
);
3613 extern void compute_record_mode (tree
);
3614 extern void finish_record_layout (record_layout_info
, int);
3616 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
3617 return a canonicalized ..._TYPE node, so that duplicates are not made.
3618 How the hash code is computed is up to the caller, as long as any two
3619 callers that could hash identical-looking type nodes agree. */
3621 extern tree
type_hash_canon (unsigned int, tree
);
3623 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
3624 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
3625 fields. Call this only once for any given decl node.
3627 Second argument is the boundary that this field can be assumed to
3628 be starting at (in bits). Zero means it can be assumed aligned
3629 on any boundary that may be needed. */
3631 extern void layout_decl (tree
, unsigned);
3633 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
3634 a previous call to layout_decl and calls it again. */
3636 extern void relayout_decl (tree
);
3638 /* Return the mode for data of a given size SIZE and mode class CLASS.
3639 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
3640 The value is BLKmode if no other mode is found. This is like
3641 mode_for_size, but is passed a tree. */
3643 extern enum machine_mode
mode_for_size_tree (tree
, enum mode_class
, int);
3645 /* Return an expr equal to X but certainly not valid as an lvalue. */
3647 extern tree
non_lvalue (tree
);
3649 extern tree
convert (tree
, tree
);
3650 extern unsigned int expr_align (tree
);
3651 extern tree
expr_first (tree
);
3652 extern tree
expr_last (tree
);
3653 extern tree
expr_only (tree
);
3654 extern tree
size_in_bytes (tree
);
3655 extern HOST_WIDE_INT
int_size_in_bytes (tree
);
3656 extern tree
bit_position (tree
);
3657 extern HOST_WIDE_INT
int_bit_position (tree
);
3658 extern tree
byte_position (tree
);
3659 extern HOST_WIDE_INT
int_byte_position (tree
);
3661 /* Define data structures, macros, and functions for handling sizes
3662 and the various types used to represent sizes. */
3666 SIZETYPE
, /* Normal representation of sizes in bytes. */
3667 SSIZETYPE
, /* Signed representation of sizes in bytes. */
3668 BITSIZETYPE
, /* Normal representation of sizes in bits. */
3669 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
3672 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
3674 #define sizetype sizetype_tab[(int) SIZETYPE]
3675 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
3676 #define ssizetype sizetype_tab[(int) SSIZETYPE]
3677 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
3679 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
3680 extern tree
size_binop (enum tree_code
, tree
, tree
);
3681 extern tree
size_diffop (tree
, tree
);
3683 #define size_int(L) size_int_kind (L, SIZETYPE)
3684 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
3685 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
3686 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
3688 extern tree
round_up (tree
, int);
3689 extern tree
round_down (tree
, int);
3690 extern tree
get_pending_sizes (void);
3691 extern void put_pending_size (tree
);
3692 extern void put_pending_sizes (tree
);
3694 /* Type for sizes of data-type. */
3696 #define BITS_PER_UNIT_LOG \
3697 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
3698 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
3699 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
3701 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
3702 extern unsigned int maximum_field_alignment
;
3703 /* and its original value in bytes, specified via -fpack-struct=<value>. */
3704 extern unsigned int initial_max_fld_align
;
3706 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
3707 by making the last node in X point to Y.
3708 Returns X, except if X is 0 returns Y. */
3710 extern tree
chainon (tree
, tree
);
3712 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
3714 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
3715 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
3717 /* Return the last tree node in a chain. */
3719 extern tree
tree_last (tree
);
3721 /* Reverse the order of elements in a chain, and return the new head. */
3723 extern tree
nreverse (tree
);
3725 /* Returns the length of a chain of nodes
3726 (number of chain pointers to follow before reaching a null pointer). */
3728 extern int list_length (tree
);
3730 /* Returns the number of FIELD_DECLs in a type. */
3732 extern int fields_length (tree
);
3734 /* Given an initializer INIT, return TRUE if INIT is zero or some
3735 aggregate of zeros. Otherwise return FALSE. */
3737 extern bool initializer_zerop (tree
);
3739 extern void categorize_ctor_elements (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
3740 HOST_WIDE_INT
*, bool *);
3741 extern HOST_WIDE_INT
count_type_elements (tree
, bool);
3743 /* add_var_to_bind_expr (bind_expr, var) binds var to bind_expr. */
3745 extern void add_var_to_bind_expr (tree
, tree
);
3747 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
3749 extern int integer_zerop (tree
);
3751 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
3753 extern int integer_onep (tree
);
3755 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
3756 all of whose significant bits are 1. */
3758 extern int integer_all_onesp (tree
);
3760 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
3761 exactly one bit 1. */
3763 extern int integer_pow2p (tree
);
3765 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
3766 with a nonzero value. */
3768 extern int integer_nonzerop (tree
);
3770 extern bool zero_p (tree
);
3771 extern bool cst_and_fits_in_hwi (tree
);
3772 extern tree
num_ending_zeros (tree
);
3774 /* staticp (tree x) is nonzero if X is a reference to data allocated
3775 at a fixed address in memory. Returns the outermost data. */
3777 extern tree
staticp (tree
);
3779 /* save_expr (EXP) returns an expression equivalent to EXP
3780 but it can be used multiple times within context CTX
3781 and only evaluate EXP once. */
3783 extern tree
save_expr (tree
);
3785 /* Look inside EXPR and into any simple arithmetic operations. Return
3786 the innermost non-arithmetic node. */
3788 extern tree
skip_simple_arithmetic (tree
);
3790 /* Return which tree structure is used by T. */
3792 enum tree_node_structure_enum
tree_node_structure (tree
);
3794 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
3795 or offset that depends on a field within a record.
3797 Note that we only allow such expressions within simple arithmetic
3800 extern bool contains_placeholder_p (tree
);
3802 /* This macro calls the above function but short-circuits the common
3803 case of a constant to save time. Also check for null. */
3805 #define CONTAINS_PLACEHOLDER_P(EXP) \
3806 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
3808 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
3809 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
3812 extern bool type_contains_placeholder_p (tree
);
3814 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3815 return a tree with all occurrences of references to F in a
3816 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
3817 contains only arithmetic expressions. */
3819 extern tree
substitute_in_expr (tree
, tree
, tree
);
3821 /* This macro calls the above function but short-circuits the common
3822 case of a constant to save time and also checks for NULL. */
3824 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
3825 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
3827 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3828 for it within OBJ, a tree that is an object or a chain of references. */
3830 extern tree
substitute_placeholder_in_expr (tree
, tree
);
3832 /* This macro calls the above function but short-circuits the common
3833 case of a constant to save time and also checks for NULL. */
3835 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
3836 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
3837 : substitute_placeholder_in_expr (EXP, OBJ))
3839 /* variable_size (EXP) is like save_expr (EXP) except that it
3840 is for the special case of something that is part of a
3841 variable size for a data type. It makes special arrangements
3842 to compute the value at the right time when the data type
3843 belongs to a function parameter. */
3845 extern tree
variable_size (tree
);
3847 /* stabilize_reference (EXP) returns a reference equivalent to EXP
3848 but it can be used multiple times
3849 and only evaluate the subexpressions once. */
3851 extern tree
stabilize_reference (tree
);
3853 /* Subroutine of stabilize_reference; this is called for subtrees of
3854 references. Any expression with side-effects must be put in a SAVE_EXPR
3855 to ensure that it is only evaluated once. */
3857 extern tree
stabilize_reference_1 (tree
);
3859 /* Return EXP, stripped of any conversions to wider types
3860 in such a way that the result of converting to type FOR_TYPE
3861 is the same as if EXP were converted to FOR_TYPE.
3862 If FOR_TYPE is 0, it signifies EXP's type. */
3864 extern tree
get_unwidened (tree
, tree
);
3866 /* Return OP or a simpler expression for a narrower value
3867 which can be sign-extended or zero-extended to give back OP.
3868 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3869 or 0 if the value should be sign-extended. */
3871 extern tree
get_narrower (tree
, int *);
3873 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
3874 look for nested component-refs or array-refs at constant positions
3875 and find the ultimate containing object, which is returned. */
3877 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
3878 tree
*, enum machine_mode
*, int *, int *,
3881 /* Return 1 if T is an expression that get_inner_reference handles. */
3883 extern int handled_component_p (tree
);
3885 /* Return a tree of sizetype representing the size, in bytes, of the element
3886 of EXP, an ARRAY_REF. */
3888 extern tree
array_ref_element_size (tree
);
3890 /* Return a tree representing the lower bound of the array mentioned in
3891 EXP, an ARRAY_REF. */
3893 extern tree
array_ref_low_bound (tree
);
3895 /* Return a tree representing the upper bound of the array mentioned in
3896 EXP, an ARRAY_REF. */
3898 extern tree
array_ref_up_bound (tree
);
3900 /* Return a tree representing the offset, in bytes, of the field referenced
3901 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
3903 extern tree
component_ref_field_offset (tree
);
3905 /* Given a DECL or TYPE, return the scope in which it was declared, or
3906 NUL_TREE if there is no containing scope. */
3908 extern tree
get_containing_scope (tree
);
3910 /* Return the FUNCTION_DECL which provides this _DECL with its context,
3912 extern tree
decl_function_context (tree
);
3914 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
3915 this _DECL with its context, or zero if none. */
3916 extern tree
decl_type_context (tree
);
3918 /* Return 1 if EXPR is the real constant zero. */
3919 extern int real_zerop (tree
);
3921 /* Declare commonly used variables for tree structure. */
3923 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
3924 Zero means allow extended lvalues. */
3926 extern int pedantic_lvalues
;
3928 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
3930 extern GTY(()) tree current_function_decl
;
3932 /* Nonzero means a FUNC_BEGIN label was emitted. */
3933 extern GTY(()) const char * current_function_func_begin_label
;
3936 extern unsigned crc32_string (unsigned, const char *);
3937 extern void clean_symbol_name (char *);
3938 extern tree
get_file_function_name_long (const char *);
3939 extern tree
get_callee_fndecl (tree
);
3940 extern void change_decl_assembler_name (tree
, tree
);
3941 extern int type_num_arguments (tree
);
3942 extern bool associative_tree_code (enum tree_code
);
3943 extern bool commutative_tree_code (enum tree_code
);
3944 extern tree
upper_bound_in_type (tree
, tree
);
3945 extern tree
lower_bound_in_type (tree
, tree
);
3946 extern int operand_equal_for_phi_arg_p (tree
, tree
);
3947 extern bool empty_body_p (tree
);
3951 extern void expand_expr_stmt (tree
);
3952 extern int warn_if_unused_value (tree
, location_t
);
3953 extern void expand_label (tree
);
3954 extern void expand_goto (tree
);
3956 extern rtx
expand_stack_save (void);
3957 extern void expand_stack_restore (tree
);
3958 extern void expand_return (tree
);
3959 extern int is_body_block (tree
);
3962 extern void using_eh_for_cleanups (void);
3964 /* In fold-const.c */
3966 /* Fold constants as much as possible in an expression.
3967 Returns the simplified expression.
3968 Acts only on the top level of the expression;
3969 if the argument itself cannot be simplified, its
3970 subexpressions are not changed. */
3972 extern tree
fold (tree
);
3973 extern tree
fold_unary (enum tree_code
, tree
, tree
);
3974 extern tree
fold_binary (enum tree_code
, tree
, tree
, tree
);
3975 extern tree
fold_ternary (enum tree_code
, tree
, tree
, tree
, tree
);
3976 extern tree
fold_build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3977 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
3978 extern tree
fold_build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3979 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
3980 extern tree
fold_build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3981 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
3982 extern tree
fold_build1_initializer (enum tree_code
, tree
, tree
);
3983 extern tree
fold_build2_initializer (enum tree_code
, tree
, tree
, tree
);
3984 extern tree
fold_build3_initializer (enum tree_code
, tree
, tree
, tree
, tree
);
3985 extern tree
fold_convert (tree
, tree
);
3986 extern tree
fold_single_bit_test (enum tree_code
, tree
, tree
, tree
);
3987 extern tree
fold_ignored_result (tree
);
3988 extern tree
fold_abs_const (tree
, tree
);
3989 extern tree
fold_indirect_ref_1 (tree
, tree
);
3991 extern tree
force_fit_type (tree
, int, bool, bool);
3993 extern int add_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
3994 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
3995 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
3996 extern int neg_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
3997 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
3998 extern int mul_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
3999 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4000 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4001 extern void lshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4002 HOST_WIDE_INT
, unsigned int,
4003 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4004 extern void rshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4005 HOST_WIDE_INT
, unsigned int,
4006 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4007 extern void lrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4008 HOST_WIDE_INT
, unsigned int,
4009 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4010 extern void rrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4011 HOST_WIDE_INT
, unsigned int,
4012 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4014 extern int div_and_round_double (enum tree_code
, int, unsigned HOST_WIDE_INT
,
4015 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
4016 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
*,
4017 HOST_WIDE_INT
*, unsigned HOST_WIDE_INT
*,
4020 enum operand_equal_flag
4026 extern int operand_equal_p (tree
, tree
, unsigned int);
4028 extern tree
omit_one_operand (tree
, tree
, tree
);
4029 extern tree
omit_two_operands (tree
, tree
, tree
, tree
);
4030 extern tree
invert_truthvalue (tree
);
4031 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4032 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4033 extern tree
fold_read_from_constant_string (tree
);
4034 extern tree
int_const_binop (enum tree_code
, tree
, tree
, int);
4035 extern tree
build_fold_addr_expr (tree
);
4036 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4037 extern tree
fold_strip_sign_ops (tree
);
4038 extern tree
build_fold_addr_expr_with_type (tree
, tree
);
4039 extern tree
build_fold_indirect_ref (tree
);
4040 extern tree
fold_indirect_ref (tree
);
4041 extern tree
constant_boolean_node (int, tree
);
4042 extern tree
build_low_bits_mask (tree
, unsigned);
4044 extern bool tree_swap_operands_p (tree
, tree
, bool);
4045 extern void swap_tree_operands (tree
, tree
*, tree
*);
4046 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4048 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4049 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4051 extern bool tree_expr_nonzero_p (tree
);
4054 extern tree
fold_builtin (tree
, tree
, bool);
4055 extern tree
fold_builtin_fputs (tree
, bool, bool, tree
);
4056 extern tree
fold_builtin_strcpy (tree
, tree
, tree
);
4057 extern tree
fold_builtin_strncpy (tree
, tree
, tree
);
4058 extern tree
fold_builtin_memory_chk (tree
, tree
, tree
, bool,
4059 enum built_in_function
);
4060 extern tree
fold_builtin_stxcpy_chk (tree
, tree
, tree
, bool,
4061 enum built_in_function
);
4062 extern tree
fold_builtin_strncpy_chk (tree
, tree
);
4063 extern tree
fold_builtin_snprintf_chk (tree
, tree
, enum built_in_function
);
4064 extern bool fold_builtin_next_arg (tree
);
4065 extern enum built_in_function
builtin_mathfn_code (tree
);
4066 extern tree
build_function_call_expr (tree
, tree
);
4067 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4068 extern tree
strip_float_extensions (tree
);
4069 extern tree
c_strlen (tree
, int);
4070 extern tree
std_gimplify_va_arg_expr (tree
, tree
, tree
*, tree
*);
4071 extern tree
build_va_arg_indirect_ref (tree
);
4072 tree
build_string_literal (int, const char *);
4075 extern tree
strip_float_extensions (tree
);
4078 extern void record_component_aliases (tree
);
4079 extern HOST_WIDE_INT
get_alias_set (tree
);
4080 extern int alias_sets_conflict_p (HOST_WIDE_INT
, HOST_WIDE_INT
);
4081 extern int alias_sets_might_conflict_p (HOST_WIDE_INT
, HOST_WIDE_INT
);
4082 extern int objects_must_conflict_p (tree
, tree
);
4085 extern int really_constant_p (tree
);
4086 extern int int_fits_type_p (tree
, tree
);
4087 extern bool variably_modified_type_p (tree
, tree
);
4088 extern int tree_log2 (tree
);
4089 extern int tree_floor_log2 (tree
);
4090 extern int simple_cst_equal (tree
, tree
);
4091 extern unsigned int iterative_hash_expr (tree
, unsigned int);
4092 extern int compare_tree_int (tree
, unsigned HOST_WIDE_INT
);
4093 extern int type_list_equal (tree
, tree
);
4094 extern int chain_member (tree
, tree
);
4095 extern tree
type_hash_lookup (unsigned int, tree
);
4096 extern void type_hash_add (unsigned int, tree
);
4097 extern int simple_cst_list_equal (tree
, tree
);
4098 extern void dump_tree_statistics (void);
4099 extern void expand_function_end (void);
4100 extern void expand_function_start (tree
);
4101 extern void stack_protect_prologue (void);
4102 extern void stack_protect_epilogue (void);
4103 extern void recompute_tree_invariant_for_addr_expr (tree
);
4104 extern bool is_global_var (tree t
);
4105 extern bool needs_to_live_in_memory (tree
);
4106 extern tree
reconstruct_complex_type (tree
, tree
);
4108 extern int real_onep (tree
);
4109 extern int real_twop (tree
);
4110 extern int real_minus_onep (tree
);
4111 extern void init_ttree (void);
4112 extern void build_common_tree_nodes (bool, bool);
4113 extern void build_common_tree_nodes_2 (int);
4114 extern void build_common_builtin_nodes (void);
4115 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4116 extern tree
build_range_type (tree
, tree
, tree
);
4117 extern HOST_WIDE_INT
int_cst_value (tree
);
4118 extern tree
tree_fold_gcd (tree
, tree
);
4119 extern tree
build_addr (tree
, tree
);
4121 extern bool fields_compatible_p (tree
, tree
);
4122 extern tree
find_compatible_field (tree
, tree
);
4125 extern void expand_main_function (void);
4126 extern void init_dummy_function_start (void);
4127 extern void expand_dummy_function_end (void);
4128 extern void init_function_for_compilation (void);
4129 extern void allocate_struct_function (tree
);
4130 extern void init_function_start (tree
);
4131 extern bool use_register_for_decl (tree
);
4132 extern void setjmp_vars_warning (tree
);
4133 extern void setjmp_args_warning (void);
4134 extern void init_temp_slots (void);
4135 extern void free_temp_slots (void);
4136 extern void pop_temp_slots (void);
4137 extern void push_temp_slots (void);
4138 extern void preserve_temp_slots (rtx
);
4139 extern int aggregate_value_p (tree
, tree
);
4140 extern void push_function_context (void);
4141 extern void pop_function_context (void);
4142 extern void push_function_context_to (tree
);
4143 extern void pop_function_context_from (tree
);
4144 extern tree
gimplify_parameters (void);
4146 /* In print-rtl.c */
4148 extern void print_rtl (FILE *, rtx
);
4151 /* In print-tree.c */
4152 extern void debug_tree (tree
);
4154 extern void print_node (FILE *, const char *, tree
, int);
4155 extern void print_node_brief (FILE *, const char *, tree
, int);
4156 extern void indent_to (FILE *, int);
4159 /* In tree-inline.c: */
4160 extern bool debug_find_tree (tree
, tree
);
4161 /* This is in tree-inline.c since the routine uses
4162 data structures from the inliner. */
4163 extern tree
unsave_expr_now (tree
);
4164 extern tree
build_duplicate_type (tree
);
4167 extern rtx
emit_line_note (location_t
);
4171 /* Nonzero if this is a call to a function whose return value depends
4172 solely on its arguments, has no side effects, and does not read
4175 /* Nonzero if this call will never return. */
4176 #define ECF_NORETURN 2
4177 /* Nonzero if this is a call to malloc or a related function. */
4178 #define ECF_MALLOC 4
4179 /* Nonzero if it is plausible that this is a call to alloca. */
4180 #define ECF_MAY_BE_ALLOCA 8
4181 /* Nonzero if this is a call to a function that won't throw an exception. */
4182 #define ECF_NOTHROW 16
4183 /* Nonzero if this is a call to setjmp or a related function. */
4184 #define ECF_RETURNS_TWICE 32
4185 /* Nonzero if this call replaces the current stack frame. */
4186 #define ECF_SIBCALL 64
4187 /* Nonzero if this is a call to "pure" function (like const function,
4188 but may read memory. */
4189 #define ECF_PURE 128
4190 /* Nonzero if this is a call to a function that returns with the stack
4191 pointer depressed. */
4192 #define ECF_SP_DEPRESSED 256
4193 /* Create libcall block around the call. */
4194 #define ECF_LIBCALL_BLOCK 512
4195 /* Function does not read or write memory (but may have side effects, so
4196 it does not necessarily fit ECF_CONST). */
4197 #define ECF_NOVOPS 1024
4199 extern int flags_from_decl_or_type (tree
);
4200 extern int call_expr_flags (tree
);
4202 extern int setjmp_call_p (tree
);
4203 extern bool alloca_call_p (tree
);
4204 extern bool must_pass_in_stack_var_size (enum machine_mode
, tree
);
4205 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, tree
);
4209 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4210 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4211 it should be modified in place; if a TYPE, a copy should be created
4212 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4213 information, in the form of a bitwise OR of flags in enum attribute_flags
4214 from tree.h. Depending on these flags, some attributes may be
4215 returned to be applied at a later stage (for example, to apply
4216 a decl attribute to the declaration rather than to its type). */
4217 extern tree
decl_attributes (tree
*, tree
, int);
4219 /* In integrate.c */
4220 extern void set_decl_abstract_flags (tree
, int);
4221 extern void set_decl_origin_self (tree
);
4223 /* In stor-layout.c */
4224 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
4225 extern void fixup_signed_type (tree
);
4226 extern void internal_reference_types (void);
4227 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4230 extern void make_decl_rtl (tree
);
4231 extern void make_decl_one_only (tree
);
4232 extern int supports_one_only (void);
4233 extern void variable_section (tree
, int);
4234 extern void resolve_unique_section (tree
, int, int);
4235 extern void mark_referenced (tree
);
4236 extern void mark_decl_referenced (tree
);
4237 extern void notice_global_symbol (tree
);
4238 extern void set_user_assembler_name (tree
, const char *);
4239 extern void process_pending_assemble_externals (void);
4240 extern void finish_aliases_1 (void);
4241 extern void finish_aliases_2 (void);
4244 extern void expand_computed_goto (tree
);
4245 extern bool parse_output_constraint (const char **, int, int, int,
4246 bool *, bool *, bool *);
4247 extern bool parse_input_constraint (const char **, int, int, int, int,
4248 const char * const *, bool *, bool *);
4249 extern void expand_asm_expr (tree
);
4250 extern tree
resolve_asm_operand_names (tree
, tree
, tree
);
4251 extern void expand_case (tree
);
4252 extern void expand_decl (tree
);
4253 extern void expand_anon_union_decl (tree
, tree
, tree
);
4255 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4256 extern bool decl_overlaps_hard_reg_set_p (tree
, const HARD_REG_SET
);
4259 /* In gimplify.c. */
4260 extern tree
create_artificial_label (void);
4261 extern void gimplify_function_tree (tree
);
4262 extern const char *get_name (tree
);
4263 extern tree
unshare_expr (tree
);
4264 extern void sort_case_labels (tree
);
4266 /* If KIND=='I', return a suitable global initializer (constructor) name.
4267 If KIND=='D', return a suitable global clean-up (destructor) name. */
4268 extern tree
get_file_function_name (int);
4270 /* Interface of the DWARF2 unwind info support. */
4272 /* Generate a new label for the CFI info to refer to. */
4274 extern char *dwarf2out_cfi_label (void);
4276 /* Entry point to update the canonical frame address (CFA). */
4278 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
4280 /* Add the CFI for saving a register window. */
4282 extern void dwarf2out_window_save (const char *);
4284 /* Add a CFI to update the running total of the size of arguments pushed
4287 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT
);
4289 /* Entry point for saving a register to the stack. */
4291 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
4293 /* Entry point for saving the return address in the stack. */
4295 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
4297 /* Entry point for saving the return address in a register. */
4299 extern void dwarf2out_return_reg (const char *, unsigned);
4301 /* Entry point for saving the first register into the second. */
4303 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
4305 /* In tree-inline.c */
4307 /* The type of a set of already-visited pointers. Functions for creating
4308 and manipulating it are declared in pointer-set.h */
4309 struct pointer_set_t
;
4311 /* The type of a callback function for walking over tree structure. */
4313 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
4314 extern tree
walk_tree (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*);
4315 extern tree
walk_tree_without_duplicates (tree
*, walk_tree_fn
, void*);
4317 /* Assign the RTX to declaration. */
4319 extern void set_decl_rtl (tree
, rtx
);
4320 extern void set_decl_incoming_rtl (tree
, rtx
);
4322 /* Enum and arrays used for tree allocation stats.
4323 Keep in sync with tree.c:tree_node_kind_names. */
4347 extern int tree_node_counts
[];
4348 extern int tree_node_sizes
[];
4350 /* True if we are in gimple form and the actions of the folders need to
4351 be restricted. False if we are not in gimple form and folding is not
4352 restricted to creating gimple expressions. */
4353 extern bool in_gimple_form
;
4355 /* In tree-gimple.c. */
4356 extern tree
get_base_address (tree t
);
4358 /* In tree-vectorizer.c. */
4359 extern void vect_set_verbosity_level (const char *);
4361 struct tree_map
GTY(())
4368 extern unsigned int tree_map_hash (const void *);
4369 extern int tree_map_marked_p (const void *);
4370 extern int tree_map_eq (const void *, const void *);
4372 /* In tree-ssa-address.c. */
4373 extern tree
tree_mem_ref_addr (tree
, tree
);
4374 extern void copy_mem_ref_info (tree
, tree
);
4376 /* In tree-object-size.c. */
4377 extern void init_object_sizes (void);
4378 extern void fini_object_sizes (void);
4379 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
4382 extern unsigned HOST_WIDE_INT
highest_pow2_factor (tree
);
4384 #endif /* GCC_TREE_H */