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, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
30 #include "double-int.h"
34 /* Codes of tree nodes */
36 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
40 #include "all-tree.def"
45 #undef END_OF_BASE_TREE_CODES
47 extern unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
50 /* Number of language-independent tree codes. */
51 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
53 /* Tree code classes. */
55 /* Each tree_code has an associated code class represented by a
58 enum tree_code_class
{
59 tcc_exceptional
, /* An exceptional code (fits no category). */
60 tcc_constant
, /* A constant. */
61 /* Order of tcc_type and tcc_declaration is important. */
62 tcc_type
, /* A type object code. */
63 tcc_declaration
, /* A declaration (also serving as variable refs). */
64 tcc_reference
, /* A reference to storage. */
65 tcc_comparison
, /* A comparison expression. */
66 tcc_unary
, /* A unary arithmetic expression. */
67 tcc_binary
, /* A binary arithmetic expression. */
68 tcc_statement
, /* A statement expression, which have side effects
69 but usually no interesting value. */
70 tcc_vl_exp
, /* A function call or other expression with a
71 variable-length operand vector. */
72 tcc_expression
/* Any other expression. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings
[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type
[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
110 #define VAR_OR_FUNCTION_DECL_P(DECL)\
111 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
113 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
114 ascending code order. */
116 #define INDIRECT_REF_P(CODE)\
117 (TREE_CODE (CODE) == INDIRECT_REF \
118 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
119 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
121 /* Nonzero if CODE represents a reference. */
123 #define REFERENCE_CLASS_P(CODE)\
124 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
126 /* Nonzero if CODE represents a comparison. */
128 #define COMPARISON_CLASS_P(CODE)\
129 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
131 /* Nonzero if CODE represents a unary arithmetic expression. */
133 #define UNARY_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
136 /* Nonzero if CODE represents a binary arithmetic expression. */
138 #define BINARY_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
141 /* Nonzero if CODE represents a statement expression. */
143 #define STATEMENT_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
146 /* Nonzero if CODE represents a function call-like expression with a
147 variable-length operand vector. */
149 #define VL_EXP_CLASS_P(CODE)\
150 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
152 /* Nonzero if CODE represents any other expression. */
154 #define EXPRESSION_CLASS_P(CODE)\
155 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
157 /* Returns nonzero iff CODE represents a type or declaration. */
159 #define IS_TYPE_OR_DECL_P(CODE)\
160 (TYPE_P (CODE) || DECL_P (CODE))
162 /* Returns nonzero iff CLASS is the tree-code class of an
165 #define IS_EXPR_CODE_CLASS(CLASS)\
166 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
168 /* Returns nonzero iff NODE is an expression of some kind. */
170 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
172 /* Number of argument-words in each kind of tree-node. */
174 extern const unsigned char tree_code_length
[];
175 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
177 /* Names of tree components. */
179 extern const char *const tree_code_name
[];
181 /* A vectors of trees. */
183 DEF_VEC_ALLOC_P(tree
,gc
);
184 DEF_VEC_ALLOC_P(tree
,heap
);
187 /* Classify which part of the compiler has defined a given builtin function.
188 Note that we assume below that this is no more than two bits. */
197 /* Names for the above. */
198 extern const char *const built_in_class_names
[4];
200 /* Codes that identify the various built in functions
201 so that expand_call can identify them quickly. */
203 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
204 enum built_in_function
206 #include "builtins.def"
208 /* Complex division routines in libgcc. These are done via builtins
209 because emit_library_call_value can't handle complex values. */
210 BUILT_IN_COMPLEX_MUL_MIN
,
211 BUILT_IN_COMPLEX_MUL_MAX
212 = BUILT_IN_COMPLEX_MUL_MIN
213 + MAX_MODE_COMPLEX_FLOAT
214 - MIN_MODE_COMPLEX_FLOAT
,
216 BUILT_IN_COMPLEX_DIV_MIN
,
217 BUILT_IN_COMPLEX_DIV_MAX
218 = BUILT_IN_COMPLEX_DIV_MIN
219 + MAX_MODE_COMPLEX_FLOAT
220 - MIN_MODE_COMPLEX_FLOAT
,
222 /* Upper bound on non-language-specific builtins. */
227 /* Names for the above. */
228 extern const char * built_in_names
[(int) END_BUILTINS
];
230 /* Helper macros for math builtins. */
232 #define BUILTIN_EXP10_P(FN) \
233 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
234 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
236 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
237 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
238 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
240 #define BUILTIN_SQRT_P(FN) \
241 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
243 #define BUILTIN_CBRT_P(FN) \
244 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
246 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
248 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
249 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
250 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
252 /* An array of _DECL trees for the above. */
253 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
254 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
256 /* In an OMP_CLAUSE node. */
258 /* Number of operands and names for each clause. */
259 extern unsigned const char omp_clause_num_ops
[];
260 extern const char * const omp_clause_code_name
[];
262 /* Clause codes. Do not reorder, as this is used to index into the tables
263 omp_clause_num_ops and omp_clause_code_name. */
266 /* Clause zero is special-cased inside the parser
267 (c_parser_omp_variable_list). */
268 OMP_CLAUSE_ERROR
= 0,
270 /* OpenMP clause: private (variable_list). */
273 /* OpenMP clause: shared (variable_list). */
276 /* OpenMP clause: firstprivate (variable_list). */
277 OMP_CLAUSE_FIRSTPRIVATE
,
279 /* OpenMP clause: lastprivate (variable_list). */
280 OMP_CLAUSE_LASTPRIVATE
,
282 /* OpenMP clause: reduction (operator:variable_list).
283 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
284 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
285 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
287 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
288 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
289 OMP_CLAUSE_REDUCTION
,
291 /* OpenMP clause: copyin (variable_list). */
294 /* OpenMP clause: copyprivate (variable_list). */
295 OMP_CLAUSE_COPYPRIVATE
,
297 /* OpenMP clause: if (scalar-expression). */
300 /* OpenMP clause: num_threads (integer-expression). */
301 OMP_CLAUSE_NUM_THREADS
,
303 /* OpenMP clause: schedule. */
306 /* OpenMP clause: nowait. */
309 /* OpenMP clause: ordered. */
312 /* OpenMP clause: default. */
315 /* OpenMP clause: collapse (constant-integer-expression). */
318 /* OpenMP clause: untied. */
322 /* The definition of tree nodes fills the next several pages. */
324 /* A tree node can represent a data type, a variable, an expression
325 or a statement. Each node has a TREE_CODE which says what kind of
326 thing it represents. Some common codes are:
327 INTEGER_TYPE -- represents a type of integers.
328 ARRAY_TYPE -- represents a type of pointer.
329 VAR_DECL -- represents a declared variable.
330 INTEGER_CST -- represents a constant integer value.
331 PLUS_EXPR -- represents a sum (an expression).
333 As for the contents of a tree node: there are some fields
334 that all nodes share. Each TREE_CODE has various special-purpose
335 fields as well. The fields of a node are never accessed directly,
336 always through accessor macros. */
338 /* Every kind of tree node starts with this structure,
339 so all nodes have these fields.
341 See the accessor macros, defined below, for documentation of the
345 struct GTY(()) tree_base
{
346 ENUM_BITFIELD(tree_code
) code
: 16;
348 unsigned side_effects_flag
: 1;
349 unsigned constant_flag
: 1;
350 unsigned addressable_flag
: 1;
351 unsigned volatile_flag
: 1;
352 unsigned readonly_flag
: 1;
353 unsigned unsigned_flag
: 1;
354 unsigned asm_written_flag
: 1;
355 unsigned nowarning_flag
: 1;
357 unsigned used_flag
: 1;
358 unsigned nothrow_flag
: 1;
359 unsigned static_flag
: 1;
360 unsigned public_flag
: 1;
361 unsigned private_flag
: 1;
362 unsigned protected_flag
: 1;
363 unsigned deprecated_flag
: 1;
364 unsigned saturating_flag
: 1;
366 unsigned default_def_flag
: 1;
367 unsigned lang_flag_0
: 1;
368 unsigned lang_flag_1
: 1;
369 unsigned lang_flag_2
: 1;
370 unsigned lang_flag_3
: 1;
371 unsigned lang_flag_4
: 1;
372 unsigned lang_flag_5
: 1;
373 unsigned lang_flag_6
: 1;
375 unsigned visited
: 1;
379 union tree_ann_d
*ann
;
382 struct GTY(()) tree_common
{
383 struct tree_base base
;
388 /* The following table lists the uses of each of the above flags and
389 for which types of nodes they are defined.
394 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
396 CONSTRUCTOR, IDENTIFIER_NODE
397 STMT_EXPR, it means we want the result of the enclosed expression
399 CALL_EXPR_TAILCALL in
408 VAR_DECL, FUNCTION_DECL
411 TREE_NO_TRAMPOLINE in
417 TREE_SYMBOL_REFERENCED in
421 TARGET_EXPR, WITH_CLEANUP_EXPR
423 TRY_CATCH_IS_CLEANUP in
429 EH_FILTER_MUST_NOT_THROW in
432 TYPE_REF_CAN_ALIAS_ALL in
433 POINTER_TYPE, REFERENCE_TYPE
441 CALL_CANNOT_INLINE_P in
447 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
450 VAR_DECL, FUNCTION_DECL
456 CALL_EXPR_VA_ARG_PACK in
459 TYPE_CACHED_VALUES_P in
462 SAVE_EXPR_RESOLVED_P in
465 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
466 OMP_CLAUSE_LASTPRIVATE
468 OMP_CLAUSE_PRIVATE_DEBUG in
476 CALL_EXPR_RETURN_SLOT_OPT in
482 OMP_PARALLEL_COMBINED in
484 OMP_CLAUSE_PRIVATE_OUTER_REF in
508 TREE_THIS_VOLATILE in
531 TYPE_SIZES_GIMPLIFIED in
542 REGISTER_DEFS_IN_THIS_STMT in
543 all expressions (tree-into-ssa.c)
548 VAR_DECL, FUNCTION_DECL
549 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
550 BLOCK, SSA_NAME, STRING_CST
553 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
572 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
579 IDENTIFIER_TRANSPARENT_ALIAS in
582 STMT_IN_SSA_EDGE_WORKLIST in
583 all expressions (tree-ssa-propagate.c)
585 TYPE_VECTOR_OPAQUE in
591 all trees (used liberally by many passes)
606 SSA_NAME_IS_DEFAULT_DEF in
611 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
612 enum tree_node_structure_enum
{
613 #include "treestruct.def"
618 /* Define accessors for the fields that all tree nodes have
619 (though some fields are not used for all kinds of nodes). */
621 /* The tree-code says what kind of node it is.
622 Codes are defined in tree.def. */
623 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
624 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
626 /* When checking is enabled, errors will be generated if a tree node
627 is accessed incorrectly. The macros die with a fatal error. */
628 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
630 #define TREE_CHECK(T, CODE) __extension__ \
631 ({ __typeof (T) const __t = (T); \
632 if (TREE_CODE (__t) != (CODE)) \
633 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
637 #define TREE_NOT_CHECK(T, CODE) __extension__ \
638 ({ __typeof (T) const __t = (T); \
639 if (TREE_CODE (__t) == (CODE)) \
640 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
644 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
645 ({ __typeof (T) const __t = (T); \
646 if (TREE_CODE (__t) != (CODE1) \
647 && TREE_CODE (__t) != (CODE2)) \
648 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
649 (CODE1), (CODE2), 0); \
652 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
653 ({ __typeof (T) const __t = (T); \
654 if (TREE_CODE (__t) == (CODE1) \
655 || TREE_CODE (__t) == (CODE2)) \
656 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
657 (CODE1), (CODE2), 0); \
660 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
661 ({ __typeof (T) const __t = (T); \
662 if (TREE_CODE (__t) != (CODE1) \
663 && TREE_CODE (__t) != (CODE2) \
664 && TREE_CODE (__t) != (CODE3)) \
665 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
666 (CODE1), (CODE2), (CODE3), 0); \
669 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
670 ({ __typeof (T) const __t = (T); \
671 if (TREE_CODE (__t) == (CODE1) \
672 || TREE_CODE (__t) == (CODE2) \
673 || TREE_CODE (__t) == (CODE3)) \
674 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
675 (CODE1), (CODE2), (CODE3), 0); \
678 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) != (CODE1) \
681 && TREE_CODE (__t) != (CODE2) \
682 && TREE_CODE (__t) != (CODE3) \
683 && TREE_CODE (__t) != (CODE4)) \
684 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
685 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
688 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
689 ({ __typeof (T) const __t = (T); \
690 if (TREE_CODE (__t) == (CODE1) \
691 || TREE_CODE (__t) == (CODE2) \
692 || TREE_CODE (__t) == (CODE3) \
693 || TREE_CODE (__t) == (CODE4)) \
694 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
695 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
698 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
699 ({ __typeof (T) const __t = (T); \
700 if (TREE_CODE (__t) != (CODE1) \
701 && TREE_CODE (__t) != (CODE2) \
702 && TREE_CODE (__t) != (CODE3) \
703 && TREE_CODE (__t) != (CODE4) \
704 && TREE_CODE (__t) != (CODE5)) \
705 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
706 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
709 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
710 ({ __typeof (T) const __t = (T); \
711 if (TREE_CODE (__t) == (CODE1) \
712 || TREE_CODE (__t) == (CODE2) \
713 || TREE_CODE (__t) == (CODE3) \
714 || TREE_CODE (__t) == (CODE4) \
715 || TREE_CODE (__t) == (CODE5)) \
716 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
717 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
720 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
721 ({ __typeof (T) const __t = (T); \
722 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
723 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
727 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
728 ({ __typeof (T) const __t = (T); \
729 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
730 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
734 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
735 ({ __typeof (T) const __t = (T); \
736 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
737 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
741 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
742 ({ __typeof (T) const __t = (T); \
743 if (TREE_CODE (__t) != OMP_CLAUSE) \
744 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
746 if (__t->omp_clause.code != (CODE)) \
747 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
751 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
752 ({ __typeof (T) const __t = (T); \
753 if (TREE_CODE (__t) != OMP_CLAUSE) \
754 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
756 if ((int) __t->omp_clause.code < (int) (CODE1) \
757 || (int) __t->omp_clause.code > (int) (CODE2)) \
758 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
759 __FUNCTION__, (CODE1), (CODE2)); \
762 /* These checks have to be special cased. */
763 #define EXPR_CHECK(T) __extension__ \
764 ({ __typeof (T) const __t = (T); \
765 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
766 if (!IS_EXPR_CODE_CLASS (__c)) \
767 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
771 /* These checks have to be special cased. */
772 #define NON_TYPE_CHECK(T) __extension__ \
773 ({ __typeof (T) const __t = (T); \
775 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
779 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
780 (*({__typeof (T) const __t = (T); \
781 const int __i = (I); \
782 if (TREE_CODE (__t) != TREE_VEC) \
783 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 if (__i < 0 || __i >= __t->vec.length) \
786 tree_vec_elt_check_failed (__i, __t->vec.length, \
787 __FILE__, __LINE__, __FUNCTION__); \
788 &__t->vec.a[__i]; }))
790 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
791 (*({__typeof (T) const __t = (T); \
792 const int __i = (I); \
793 if (TREE_CODE (__t) != OMP_CLAUSE) \
794 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
796 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
797 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
799 &__t->omp_clause.ops[__i]; }))
801 /* Special checks for TREE_OPERANDs. */
802 #define TREE_OPERAND_CHECK(T, I) __extension__ \
803 (*({__typeof (T) const __t = EXPR_CHECK (T); \
804 const int __i = (I); \
805 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
806 tree_operand_check_failed (__i, __t, \
807 __FILE__, __LINE__, __FUNCTION__); \
808 &__t->exp.operands[__i]; }))
810 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
811 (*({__typeof (T) const __t = (T); \
812 const int __i = (I); \
813 if (TREE_CODE (__t) != CODE) \
814 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
815 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
816 tree_operand_check_failed (__i, __t, \
817 __FILE__, __LINE__, __FUNCTION__); \
818 &__t->exp.operands[__i]; }))
820 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
822 ({__typeof (T) const __t = (T); \
823 const int __i = (I); \
824 if (TREE_CODE (__t) != (CODE)) \
825 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
826 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
827 tree_operand_check_failed (__i, __t, \
828 __FILE__, __LINE__, __FUNCTION__); \
829 &__t->exp.operands[__i]; }))
831 /* Nodes are chained together for many purposes.
832 Types are chained together to record them for being output to the debugger
833 (see the function `chain_type').
834 Decls in the same scope are chained together to record the contents
836 Statement nodes for successive statements used to be chained together.
837 Often lists of things are represented by TREE_LIST nodes that
838 are chained together. */
840 #define TREE_CHAIN(NODE) __extension__ \
841 (*({__typeof (NODE) const __t = (NODE); \
842 &__t->common.chain; }))
844 /* In all nodes that are expressions, this is the data type of the expression.
845 In POINTER_TYPE nodes, this is the type that the pointer points to.
846 In ARRAY_TYPE nodes, this is the type of the elements.
847 In VECTOR_TYPE nodes, this is the type of the elements. */
848 #define TREE_TYPE(NODE) __extension__ \
849 (*({__typeof (NODE) const __t = (NODE); \
850 &__t->common.type; }))
852 extern void tree_contains_struct_check_failed (const_tree
,
853 const enum tree_node_structure_enum
,
854 const char *, int, const char *)
857 extern void tree_check_failed (const_tree
, const char *, int, const char *,
858 ...) ATTRIBUTE_NORETURN
;
859 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
860 ...) ATTRIBUTE_NORETURN
;
861 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
862 const char *, int, const char *)
864 extern void tree_range_check_failed (const_tree
, const char *, int,
865 const char *, enum tree_code
,
867 extern void tree_not_class_check_failed (const_tree
,
868 const enum tree_code_class
,
869 const char *, int, const char *)
871 extern void tree_vec_elt_check_failed (int, int, const char *,
874 extern void phi_node_elt_check_failed (int, int, const char *,
877 extern void tree_operand_check_failed (int, const_tree
,
878 const char *, int, const char *)
880 extern void omp_clause_check_failed (const_tree
, const char *, int,
881 const char *, enum omp_clause_code
)
883 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
886 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
887 const char *, enum omp_clause_code
,
888 enum omp_clause_code
)
891 #else /* not ENABLE_TREE_CHECKING, or not gcc */
893 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
894 #define TREE_CHECK(T, CODE) (T)
895 #define TREE_NOT_CHECK(T, CODE) (T)
896 #define TREE_CHECK2(T, CODE1, CODE2) (T)
897 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
898 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
899 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
900 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
901 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
902 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
903 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
904 #define TREE_CLASS_CHECK(T, CODE) (T)
905 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
906 #define EXPR_CHECK(T) (T)
907 #define NON_TYPE_CHECK(T) (T)
908 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
909 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
910 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
911 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
912 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
913 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
914 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
916 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
917 #define TREE_TYPE(NODE) ((NODE)->common.type)
921 #define TREE_BLOCK(NODE) *(tree_block (NODE))
923 #include "tree-check.h"
925 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
926 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
927 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
928 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
929 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
930 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
931 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
932 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
933 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
934 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
935 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
937 #define RECORD_OR_UNION_CHECK(T) \
938 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
939 #define NOT_RECORD_OR_UNION_CHECK(T) \
940 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
942 #define NUMERICAL_TYPE_CHECK(T) \
943 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
946 /* Here is how primitive or already-canonicalized types' hash codes
948 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
950 /* A simple hash function for an arbitrary tree node. This must not be
951 used in hash tables which are saved to a PCH. */
952 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
954 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
955 #define CONVERT_EXPR_CODE_P(CODE) \
956 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
958 /* Similarly, but accept an expressions instead of a tree code. */
959 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
961 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
963 #define CASE_CONVERT \
967 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
968 that don't change the machine mode. */
970 #define STRIP_NOPS(EXP) \
971 while ((CONVERT_EXPR_P (EXP) \
972 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
973 && TREE_OPERAND (EXP, 0) != error_mark_node \
974 && (TYPE_MODE (TREE_TYPE (EXP)) \
975 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
976 (EXP) = TREE_OPERAND (EXP, 0)
978 /* Like STRIP_NOPS, but don't let the signedness change either. */
980 #define STRIP_SIGN_NOPS(EXP) \
981 while ((CONVERT_EXPR_P (EXP) \
982 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
983 && TREE_OPERAND (EXP, 0) != error_mark_node \
984 && (TYPE_MODE (TREE_TYPE (EXP)) \
985 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
986 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
987 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
988 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
989 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
990 (EXP) = TREE_OPERAND (EXP, 0)
992 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
994 #define STRIP_TYPE_NOPS(EXP) \
995 while ((CONVERT_EXPR_P (EXP) \
996 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
997 && TREE_OPERAND (EXP, 0) != error_mark_node \
998 && (TREE_TYPE (EXP) \
999 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1000 (EXP) = TREE_OPERAND (EXP, 0)
1002 /* Remove unnecessary type conversions according to
1003 tree_ssa_useless_type_conversion. */
1005 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1006 while (tree_ssa_useless_type_conversion (EXP)) \
1007 EXP = TREE_OPERAND (EXP, 0)
1009 /* Nonzero if TYPE represents an integral type. Note that we do not
1010 include COMPLEX types here. Keep these checks in ascending code
1013 #define INTEGRAL_TYPE_P(TYPE) \
1014 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1015 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1016 || TREE_CODE (TYPE) == INTEGER_TYPE)
1018 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1020 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1021 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1023 /* Nonzero if TYPE represents a saturating fixed-point type. */
1025 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1026 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1028 /* Nonzero if TYPE represents a fixed-point type. */
1030 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1032 /* Nonzero if TYPE represents a scalar floating-point type. */
1034 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1036 /* Nonzero if TYPE represents a complex floating-point type. */
1038 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1039 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1040 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1042 /* Nonzero if TYPE represents a vector floating-point type. */
1044 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1045 (TREE_CODE (TYPE) == VECTOR_TYPE \
1046 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1048 /* Nonzero if TYPE represents a floating-point type, including complex
1049 and vector floating-point types. The vector and complex check does
1050 not use the previous two macros to enable early folding. */
1052 #define FLOAT_TYPE_P(TYPE) \
1053 (SCALAR_FLOAT_TYPE_P (TYPE) \
1054 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1055 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1056 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1058 /* Nonzero if TYPE represents a decimal floating-point type. */
1059 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1060 (SCALAR_FLOAT_TYPE_P (TYPE) \
1061 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1063 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1064 Keep these checks in ascending code order. */
1066 #define AGGREGATE_TYPE_P(TYPE) \
1067 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1068 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1070 /* Nonzero if TYPE represents a pointer or reference type.
1071 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1072 ascending code order. */
1074 #define POINTER_TYPE_P(TYPE) \
1075 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1077 /* Nonzero if this type is a complete type. */
1078 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1080 /* Nonzero if this type is the (possibly qualified) void type. */
1081 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1083 /* Nonzero if this type is complete or is cv void. */
1084 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1085 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1087 /* Nonzero if this type is complete or is an array with unspecified bound. */
1088 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1089 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1092 /* Define many boolean fields that all tree nodes have. */
1094 /* In VAR_DECL nodes, nonzero means address of this is needed.
1095 So it cannot be in a register.
1096 In a FUNCTION_DECL, nonzero means its address is needed.
1097 So it must be compiled even if it is an inline function.
1098 In a FIELD_DECL node, it means that the programmer is permitted to
1099 construct the address of this field. This is used for aliasing
1100 purposes: see record_component_aliases.
1101 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1102 In LABEL_DECL nodes, it means a goto for this label has been seen
1103 from a place outside all binding contours that restore stack levels.
1104 In ..._TYPE nodes, it means that objects of this type must
1105 be fully addressable. This means that pieces of this
1106 object cannot go into register parameters, for example.
1107 In IDENTIFIER_NODEs, this means that some extern decl for this name
1108 had its address taken. That matters for inline functions. */
1109 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1111 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1112 exit of a function. Calls for which this is true are candidates for tail
1113 call optimizations. */
1114 #define CALL_EXPR_TAILCALL(NODE) \
1115 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1117 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1118 CASE_LOW operand has been processed. */
1119 #define CASE_LOW_SEEN(NODE) \
1120 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1122 #define PREDICT_EXPR_OUTCOME(NODE) \
1123 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1124 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1125 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1126 #define PREDICT_EXPR_PREDICTOR(NODE) \
1127 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1129 /* In a VAR_DECL, nonzero means allocate static storage.
1130 In a FUNCTION_DECL, nonzero if function has been defined.
1131 In a CONSTRUCTOR, nonzero means allocate static storage. */
1132 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1134 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1135 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1137 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1138 should only be executed if an exception is thrown, not on normal exit
1140 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1142 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1143 separate cleanup in honor_protect_cleanup_actions. */
1144 #define TRY_CATCH_IS_CLEANUP(NODE) \
1145 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1147 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1148 CASE_HIGH operand has been processed. */
1149 #define CASE_HIGH_SEEN(NODE) \
1150 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1152 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1153 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1155 /* In an expr node (usually a conversion) this means the node was made
1156 implicitly and should not lead to any sort of warning. In a decl node,
1157 warnings concerning the decl should be suppressed. This is used at
1158 least for used-before-set warnings, and it set after one warning is
1160 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1162 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1163 this string as an argument. */
1164 #define TREE_SYMBOL_REFERENCED(NODE) \
1165 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1167 /* Nonzero in a pointer or reference type means the data pointed to
1168 by this type can alias anything. */
1169 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1170 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1172 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1173 #define MOVE_NONTEMPORAL(NODE) \
1174 (EXPR_CHECK (NODE)->base.static_flag)
1176 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1177 there was an overflow in folding. */
1179 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1181 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1183 #define TREE_OVERFLOW_P(EXPR) \
1184 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1186 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1187 nonzero means name is to be accessible from outside this translation unit.
1188 In an IDENTIFIER_NODE, nonzero means an external declaration
1189 accessible from outside this translation unit was previously seen
1190 for this name in an inner scope. */
1191 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1193 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1194 of cached values, or is something else. */
1195 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1197 /* In a SAVE_EXPR, indicates that the original expression has already
1198 been substituted with a VAR_DECL that contains the value. */
1199 #define SAVE_EXPR_RESOLVED_P(NODE) \
1200 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1202 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1204 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1205 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1207 /* In any expression, decl, or constant, nonzero means it has side effects or
1208 reevaluation of the whole expression could produce a different value.
1209 This is set if any subexpression is a function call, a side effect or a
1210 reference to a volatile variable. In a ..._DECL, this is set only if the
1211 declaration said `volatile'. This will never be set for a constant. */
1212 #define TREE_SIDE_EFFECTS(NODE) \
1213 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1215 /* In a LABEL_DECL, nonzero means this label had its address taken
1216 and therefore can never be deleted and is a jump target for
1218 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1220 /* Nonzero means this expression is volatile in the C sense:
1221 its address should be of type `volatile WHATEVER *'.
1222 In other words, the declared item is volatile qualified.
1223 This is used in _DECL nodes and _REF nodes.
1224 On a FUNCTION_DECL node, this means the function does not
1225 return normally. This is the same effect as setting
1226 the attribute noreturn on the function in C.
1228 In a ..._TYPE node, means this type is volatile-qualified.
1229 But use TYPE_VOLATILE instead of this macro when the node is a type,
1230 because eventually we may make that a different bit.
1232 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1233 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1235 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1236 accessing the memory pointed to won't generate a trap. However,
1237 this only applies to an object when used appropriately: it doesn't
1238 mean that writing a READONLY mem won't trap. Similarly for
1239 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1241 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1242 (or slice of the array) always belongs to the range of the array.
1243 I.e. that the access will not trap, provided that the access to
1244 the base to the array will not trap. */
1245 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1247 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1248 nonzero means it may not be the lhs of an assignment.
1249 Nonzero in a FUNCTION_DECL means this function should be treated
1250 as "const" function (can only read its arguments). */
1251 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1253 /* Value of expression is constant. Always on in all ..._CST nodes. May
1254 also appear in an expression or decl where the value is constant. */
1255 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1257 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1258 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1259 (TYPE_CHECK (NODE)->base.constant_flag)
1261 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1262 #define DECL_UNSIGNED(NODE) \
1263 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1265 /* In integral and pointer types, means an unsigned type. */
1266 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1268 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1269 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1270 This is interesting in an inline function, since it might not need
1271 to be compiled separately.
1272 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1273 if the sdb debugging info for the type has been written.
1274 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1275 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1277 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1279 /* Nonzero in a _DECL if the name is used in its scope.
1280 Nonzero in an expr node means inhibit warning if value is unused.
1281 In IDENTIFIER_NODEs, this means that some extern decl for this name
1283 In a BLOCK, this means that the block contains variables that are used. */
1284 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1286 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1287 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1288 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1290 /* In a CALL_EXPR, means that it's safe to use the target of the call
1291 expansion as the return slot for a call that returns in memory. */
1292 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1293 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1295 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1296 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1298 #define DECL_BY_REFERENCE(NODE) \
1299 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1300 RESULT_DECL)->decl_common.decl_by_reference_flag)
1302 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1303 thunked-to function. */
1304 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1306 /* In a type, nonzero means that all objects of the type are guaranteed by the
1307 language or front-end to be properly aligned, so we can indicate that a MEM
1308 of this type is aligned at least to the alignment of the type, even if it
1309 doesn't appear that it is. We see this, for example, in object-oriented
1310 languages where a tag field may show this is an object of a more-aligned
1311 variant of the more generic type.
1313 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1315 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1317 /* Used in classes in C++. */
1318 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1319 /* Used in classes in C++. */
1320 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1322 /* Nonzero in a _DECL if the use of the name is defined as a
1323 deprecated feature by __attribute__((deprecated)). */
1324 #define TREE_DEPRECATED(NODE) \
1325 ((NODE)->base.deprecated_flag)
1327 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1328 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1329 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1330 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1332 /* In fixed-point types, means a saturating type. */
1333 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1335 /* These flags are available for each language front end to use internally. */
1336 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1337 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1338 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1339 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1340 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1341 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1342 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1344 /* Define additional fields and accessors for nodes representing constants. */
1346 /* In an INTEGER_CST node. These two together make a 2-word integer.
1347 If the data type is signed, the value is sign-extended to 2 words
1348 even though not all of them may really be in use.
1349 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1350 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1351 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1352 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1354 #define INT_CST_LT(A, B) \
1355 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1356 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1357 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1359 #define INT_CST_LT_UNSIGNED(A, B) \
1360 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1361 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1362 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1363 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1364 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1366 struct GTY(()) tree_int_cst
{
1367 struct tree_common common
;
1371 /* In a REAL_CST node. struct real_value is an opaque entity, with
1372 manipulators defined in real.h. We don't want tree.h depending on
1373 real.h and transitively on tm.h. */
1376 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1377 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1379 struct GTY(()) tree_real_cst
{
1380 struct tree_common common
;
1381 struct real_value
* real_cst_ptr
;
1384 /* In a FIXED_CST node. */
1387 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1388 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1390 struct GTY(()) tree_fixed_cst
{
1391 struct tree_common common
;
1392 struct fixed_value
* fixed_cst_ptr
;
1395 /* In a STRING_CST */
1396 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1397 #define TREE_STRING_POINTER(NODE) \
1398 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1400 struct GTY(()) tree_string
{
1401 struct tree_common common
;
1406 /* In a COMPLEX_CST node. */
1407 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1408 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1410 struct GTY(()) tree_complex
{
1411 struct tree_common common
;
1416 /* In a VECTOR_CST node. */
1417 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1419 struct GTY(()) tree_vector
{
1420 struct tree_common common
;
1426 /* Define fields and accessors for some special-purpose tree nodes. */
1428 #define IDENTIFIER_LENGTH(NODE) \
1429 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1430 #define IDENTIFIER_POINTER(NODE) \
1431 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1432 #define IDENTIFIER_HASH_VALUE(NODE) \
1433 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1435 /* Translate a hash table identifier pointer to a tree_identifier
1436 pointer, and vice versa. */
1438 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1439 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1440 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1442 struct GTY(()) tree_identifier
{
1443 struct tree_common common
;
1444 struct ht_identifier id
;
1447 /* In a TREE_LIST node. */
1448 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1449 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1451 struct GTY(()) tree_list
{
1452 struct tree_common common
;
1457 /* In a TREE_VEC node. */
1458 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1459 #define TREE_VEC_END(NODE) \
1460 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1462 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1464 struct GTY(()) tree_vec
{
1465 struct tree_common common
;
1467 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1470 /* In a CONSTRUCTOR node. */
1471 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1472 #define CONSTRUCTOR_ELT(NODE,IDX) \
1473 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1474 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1476 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1477 value of each element (stored within VAL). IX must be a scratch variable
1478 of unsigned integer type. */
1479 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1480 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1482 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1486 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1487 the value of each element (stored within VAL) and its index (stored
1488 within INDEX). IX must be a scratch variable of unsigned integer type. */
1489 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1490 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1492 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1493 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1497 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1498 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1500 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1501 _ce___->index = INDEX; \
1502 _ce___->value = VALUE; \
1505 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1506 element. INDEX can optionally design the position of VALUE: in arrays,
1507 it is the index where VALUE has to be placed; in structures, it is the
1508 FIELD_DECL of the member. */
1509 typedef struct GTY(()) constructor_elt_d
{
1514 DEF_VEC_O(constructor_elt
);
1515 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1517 struct GTY(()) tree_constructor
{
1518 struct tree_common common
;
1519 VEC(constructor_elt
,gc
) *elts
;
1522 /* Define fields and accessors for some nodes that represent expressions. */
1524 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1525 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1526 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1527 && integer_zerop (TREE_OPERAND (NODE, 0)))
1529 /* In ordinary expression nodes. */
1530 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1531 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1533 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1534 length. Its value includes the length operand itself; that is,
1535 the minimum valid length is 1.
1536 Note that we have to bypass the use of TREE_OPERAND to access
1537 that field to avoid infinite recursion in expanding the macros. */
1538 #define VL_EXP_OPERAND_LENGTH(NODE) \
1539 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1541 /* In a LOOP_EXPR node. */
1542 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1544 /* The source location of this expression. Non-tree_exp nodes such as
1545 decls and constants can be shared among multiple locations, so
1547 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1548 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1549 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1550 #define EXPR_LOCUS(NODE) (EXPR_P (NODE) \
1551 ? CONST_CAST (source_location *, &(NODE)->exp.locus) \
1552 : (source_location *) NULL)
1553 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1554 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1555 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1557 /* True if a tree is an expression or statement that can have a
1559 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE))
1561 extern void protected_set_expr_location (tree
, location_t
);
1563 /* In a TARGET_EXPR node. */
1564 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1565 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1566 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1568 /* DECL_EXPR accessor. This gives access to the DECL associated with
1569 the given declaration statement. */
1570 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1572 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1574 /* COMPOUND_LITERAL_EXPR accessors. */
1575 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1576 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1577 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1578 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1580 /* SWITCH_EXPR accessors. These give access to the condition, body and
1581 original condition type (before any compiler conversions)
1582 of the switch statement, respectively. */
1583 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1584 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1585 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1587 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1588 of a case label, respectively. */
1589 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1590 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1591 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1593 /* The operands of a TARGET_MEM_REF. */
1594 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1595 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1596 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1597 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1598 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1599 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1601 /* The operands of a BIND_EXPR. */
1602 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1603 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1604 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1606 /* GOTO_EXPR accessor. This gives access to the label associated with
1607 a goto statement. */
1608 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1610 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1611 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1612 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1614 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1615 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1616 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1617 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1618 /* Nonzero if we want to create an ASM_INPUT instead of an
1619 ASM_OPERAND with no operands. */
1620 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1621 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1623 /* COND_EXPR accessors. */
1624 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1625 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1626 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1628 /* Accessors for the chains of recurrences. */
1629 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1630 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1631 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1632 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1634 /* LABEL_EXPR accessor. This gives access to the label associated with
1635 the given label expression. */
1636 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1638 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1639 accessors for SSA operands. */
1641 /* CATCH_EXPR accessors. */
1642 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1643 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1645 /* EH_FILTER_EXPR accessors. */
1646 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1647 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1648 #define EH_FILTER_MUST_NOT_THROW(NODE) \
1649 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
1651 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1652 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1653 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1654 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1655 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1657 /* OBJ_TYPE_REF accessors. */
1658 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1659 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1660 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1662 /* ASSERT_EXPR accessors. */
1663 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1664 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1666 /* CALL_EXPR accessors.
1668 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1669 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1670 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1671 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1672 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1674 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1675 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1676 the argument count is zero when checking is enabled. Instead, do
1677 the pointer arithmetic to advance past the 3 fixed operands in a
1678 CALL_EXPR. That produces a valid pointer to just past the end of the
1679 operand array, even if it's not valid to dereference it. */
1680 #define CALL_EXPR_ARGP(NODE) \
1681 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1683 /* OpenMP directive and clause accessors. */
1685 #define OMP_BODY(NODE) \
1686 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1687 #define OMP_CLAUSES(NODE) \
1688 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1690 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1691 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1693 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1694 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1696 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1697 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1698 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1700 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1701 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1702 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1703 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1704 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1705 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1707 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1708 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1710 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1712 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1713 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1715 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1717 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1719 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1720 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1722 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1723 #define OMP_CLAUSE_DECL(NODE) \
1724 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1725 OMP_CLAUSE_PRIVATE, \
1726 OMP_CLAUSE_COPYPRIVATE), 0)
1728 /* True on an OMP_SECTION statement that was the last lexical member.
1729 This status is meaningful in the implementation of lastprivate. */
1730 #define OMP_SECTION_LAST(NODE) \
1731 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1733 /* True on an OMP_PARALLEL statement if it represents an explicit
1734 combined parallel work-sharing constructs. */
1735 #define OMP_PARALLEL_COMBINED(NODE) \
1736 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1738 /* True on a PRIVATE clause if its decl is kept around for debugging
1739 information only and its DECL_VALUE_EXPR is supposed to point
1740 to what it has been remapped to. */
1741 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1742 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1744 /* True on a PRIVATE clause if ctor needs access to outer region's
1746 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1747 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1749 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1750 decl is present in the chain. */
1751 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1752 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1753 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1754 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1755 OMP_CLAUSE_LASTPRIVATE),\
1757 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1758 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1760 #define OMP_CLAUSE_IF_EXPR(NODE) \
1761 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1762 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1763 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1764 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1765 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1767 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1768 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1769 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1770 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1771 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1772 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1774 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1775 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1776 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1777 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1778 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1779 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1780 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1781 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1782 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1783 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1784 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1785 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1787 enum omp_clause_schedule_kind
1789 OMP_CLAUSE_SCHEDULE_STATIC
,
1790 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1791 OMP_CLAUSE_SCHEDULE_GUIDED
,
1792 OMP_CLAUSE_SCHEDULE_AUTO
,
1793 OMP_CLAUSE_SCHEDULE_RUNTIME
1796 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1797 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1799 enum omp_clause_default_kind
1801 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1802 OMP_CLAUSE_DEFAULT_SHARED
,
1803 OMP_CLAUSE_DEFAULT_NONE
,
1804 OMP_CLAUSE_DEFAULT_PRIVATE
,
1805 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1808 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1809 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1811 struct GTY(()) tree_exp
{
1812 struct tree_common common
;
1815 tree
GTY ((special ("tree_exp"),
1816 desc ("TREE_CODE ((tree) &%0)")))
1820 /* SSA_NAME accessors. */
1822 /* Returns the variable being referenced. Once released, this is the
1823 only field that can be relied upon. */
1824 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1826 /* Returns the statement which defines this SSA name. */
1827 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1829 /* Returns the SSA version number of this SSA name. Note that in
1830 tree SSA, version numbers are not per variable and may be recycled. */
1831 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1833 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1834 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1836 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1837 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1839 /* Nonzero if this SSA_NAME expression is currently on the free list of
1840 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1841 has no meaning for an SSA_NAME. */
1842 #define SSA_NAME_IN_FREE_LIST(NODE) \
1843 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1845 /* Nonzero if this SSA_NAME is the default definition for the
1846 underlying symbol. A default SSA name is created for symbol S if
1847 the very first reference to S in the function is a read operation.
1848 Default definitions are always created by an empty statement and
1849 belong to no basic block. */
1850 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1851 SSA_NAME_CHECK (NODE)->base.default_def_flag
1853 /* Attributes for SSA_NAMEs for pointer-type variables. */
1854 #define SSA_NAME_PTR_INFO(N) \
1855 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1857 #ifndef _TREE_FLOW_H
1858 struct ptr_info_def
;
1863 /* Immediate use linking structure. This structure is used for maintaining
1864 a doubly linked list of uses of an SSA_NAME. */
1865 typedef struct GTY(()) ssa_use_operand_d
{
1866 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1867 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1868 /* Immediate uses for a given SSA name are maintained as a cyclic
1869 list. To recognize the root of this list, the location field
1870 needs to point to the original SSA name. Since statements and
1871 SSA names are of different data types, we need this union. See
1872 the explanation in struct immediate_use_iterator_d. */
1873 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1874 tree
*GTY((skip(""))) use
;
1875 } ssa_use_operand_t
;
1877 /* Return the immediate_use information for an SSA_NAME. */
1878 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1880 struct GTY(()) tree_ssa_name
{
1881 struct tree_common common
;
1883 /* _DECL wrapped by this SSA name. */
1886 /* Statement that defines this SSA name. */
1889 /* SSA version number. */
1890 unsigned int version
;
1892 /* Pointer attributes used for alias analysis. */
1893 struct ptr_info_def
*ptr_info
;
1895 /* Immediate uses list for this SSA_NAME. */
1896 struct ssa_use_operand_d imm_uses
;
1899 struct GTY(()) phi_arg_d
{
1900 /* imm_use MUST be the first element in struct because we do some
1901 pointer arithmetic with it. See phi_arg_index_from_use. */
1902 struct ssa_use_operand_d imm_use
;
1907 #define OMP_CLAUSE_CODE(NODE) \
1908 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1910 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1911 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1913 #define OMP_CLAUSE_CODE(NODE) \
1914 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1916 #define OMP_CLAUSE_OPERAND(NODE, I) \
1917 OMP_CLAUSE_ELT_CHECK (NODE, I)
1919 struct GTY(()) tree_omp_clause
{
1920 struct tree_common common
;
1921 enum omp_clause_code code
;
1922 union omp_clause_subcode
{
1923 enum omp_clause_default_kind default_kind
;
1924 enum omp_clause_schedule_kind schedule_kind
;
1925 enum tree_code reduction_code
;
1926 } GTY ((skip
)) subcode
;
1928 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1930 gimple_seq gimple_reduction_init
;
1931 gimple_seq gimple_reduction_merge
;
1933 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
1937 struct varray_head_tag
;
1939 /* In a BLOCK node. */
1940 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1941 #define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1942 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1943 #define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1944 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1945 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1946 /* Note: when changing this, make sure to find the places
1947 that use chainon or nreverse. */
1948 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1949 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1950 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1952 /* An index number for this block. These values are not guaranteed to
1953 be unique across functions -- whether or not they are depends on
1954 the debugging output format in use. */
1955 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1957 /* If block reordering splits a lexical block into discontiguous
1958 address ranges, we'll make a copy of the original block.
1960 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1961 In that case, we have one source block that has been replicated
1962 (through inlining or unrolling) into many logical blocks, and that
1963 these logical blocks have different physical variables in them.
1965 In this case, we have one logical block split into several
1966 non-contiguous address ranges. Most debug formats can't actually
1967 represent this idea directly, so we fake it by creating multiple
1968 logical blocks with the same variables in them. However, for those
1969 that do support non-contiguous regions, these allow the original
1970 logical block to be reconstructed, along with the set of address
1973 One of the logical block fragments is arbitrarily chosen to be
1974 the ORIGIN. The other fragments will point to the origin via
1975 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1976 be null. The list of fragments will be chained through
1977 BLOCK_FRAGMENT_CHAIN from the origin. */
1979 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1980 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1982 /* For an inlined function, this gives the location where it was called
1983 from. This is only set in the top level block, which corresponds to the
1984 inlined function scope. This is used in the debug output routines. */
1986 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1988 struct GTY(()) tree_block
{
1989 struct tree_common common
;
1991 unsigned abstract_flag
: 1;
1992 unsigned block_num
: 31;
1997 VEC(tree
,gc
) *nonlocalized_vars
;
2001 tree abstract_origin
;
2002 tree fragment_origin
;
2003 tree fragment_chain
;
2006 /* Define fields and accessors for nodes representing data types. */
2008 /* See tree.def for documentation of the use of these fields.
2009 Look at the documentation of the various ..._TYPE tree codes.
2011 Note that the type.values, type.minval, and type.maxval fields are
2012 overloaded and used for different macros in different kinds of types.
2013 Each macro must check to ensure the tree node is of the proper kind of
2014 type. Note also that some of the front-ends also overload these fields,
2015 so they must be checked as well. */
2017 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2018 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2019 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2020 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2021 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2022 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2023 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2024 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2025 (INTEGER_TYPE_CHECK (NODE)->type.values \
2026 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2027 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2028 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2029 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2030 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2031 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2032 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2033 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2034 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2035 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2036 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2037 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2038 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2039 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2040 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2041 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2042 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2043 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2044 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2045 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2047 /* Vector types need to check target flags to determine type. */
2048 extern enum machine_mode
vector_type_mode (const_tree
);
2049 #define TYPE_MODE(NODE) \
2050 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2051 ? vector_type_mode (NODE) : (NODE)->type.mode)
2052 #define SET_TYPE_MODE(NODE, MODE) \
2053 (TYPE_CHECK (NODE)->type.mode = (MODE))
2055 /* The "canonical" type for this type node, which can be used to
2056 compare the type for equality with another type. If two types are
2057 equal (based on the semantics of the language), then they will have
2058 equivalent TYPE_CANONICAL entries.
2060 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2061 be used for comparison against other types. Instead, the type is
2062 said to require structural equality checks, described in
2063 TYPE_STRUCTURAL_EQUALITY_P. */
2064 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2065 /* Indicates that the type node requires structural equality
2066 checks. The compiler will need to look at the composition of the
2067 type to determine whether it is equal to another type, rather than
2068 just comparing canonical type pointers. For instance, we would need
2069 to look at the return and parameter types of a FUNCTION_TYPE
2071 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2072 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2073 type node requires structural equality. */
2074 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2075 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2076 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2077 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2079 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2080 in the debugging output. We use this to describe a vector as a
2081 structure containing an array. */
2082 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2084 /* For record and union types, information about this type, as a base type
2086 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2088 /* For non record and union types, used in a language-dependent way. */
2089 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2091 /* The (language-specific) typed-based alias set for this type.
2092 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2093 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2094 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2095 type can alias objects of any type. */
2096 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2098 /* Nonzero iff the typed-based alias set for this type has been
2100 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2102 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2104 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2106 /* The alignment necessary for objects of this type.
2107 The value is an int, measured in bits. */
2108 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2110 /* 1 if the alignment for this type was requested by "aligned" attribute,
2111 0 if it is the default for this type. */
2112 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2114 /* The alignment for NODE, in bytes. */
2115 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2117 /* If your language allows you to declare types, and you want debug info
2118 for them, then you need to generate corresponding TYPE_DECL nodes.
2119 These "stub" TYPE_DECL nodes have no name, and simply point at the
2120 type node. You then set the TYPE_STUB_DECL field of the type node
2121 to point back at the TYPE_DECL node. This allows the debug routines
2122 to know that the two nodes represent the same type, so that we only
2123 get one debug info record for them. */
2124 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2126 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2127 has BLKmode only because it lacks the alignment requirement for
2129 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2131 /* In an INTEGER_TYPE, it means the type represents a size. We use
2132 this both for validity checking and to permit optimizations that
2133 are unsafe for other types. Note that the C `size_t' type should
2134 *not* have this flag set. The `size_t' type is simply a typedef
2135 for an ordinary integer type that happens to be the type of an
2136 expression returned by `sizeof'; `size_t' has no special
2137 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2138 always actual sizes. */
2139 #define TYPE_IS_SIZETYPE(NODE) \
2140 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2142 /* Nonzero in a type considered volatile as a whole. */
2143 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2145 /* Means this type is const-qualified. */
2146 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2148 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2150 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2152 /* There is a TYPE_QUAL value for each type qualifier. They can be
2153 combined by bitwise-or to form the complete set of qualifiers for a
2156 #define TYPE_UNQUALIFIED 0x0
2157 #define TYPE_QUAL_CONST 0x1
2158 #define TYPE_QUAL_VOLATILE 0x2
2159 #define TYPE_QUAL_RESTRICT 0x4
2161 /* The set of type qualifiers for this type. */
2162 #define TYPE_QUALS(NODE) \
2163 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2164 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2165 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2167 /* These flags are available for each language front end to use internally. */
2168 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2169 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2170 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2171 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2172 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2173 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2174 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2176 /* Used to keep track of visited nodes in tree traversals. This is set to
2177 0 by copy_node and make_node. */
2178 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2180 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2181 that distinguish string from array of char).
2182 If set in a INTEGER_TYPE, indicates a character type. */
2183 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2185 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2186 object of the given ARRAY_TYPE. This allows temporaries to be
2188 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2189 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2191 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2192 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2193 (((unsigned HOST_WIDE_INT) 1) \
2194 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2196 /* Set precision to n when we have 2^n sub-parts of the vector. */
2197 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2198 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2200 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2201 about missing conversions to other vector types of the same size. */
2202 #define TYPE_VECTOR_OPAQUE(NODE) \
2203 (VECTOR_TYPE_CHECK (NODE)->base.deprecated_flag)
2205 /* Indicates that objects of this type must be initialized by calling a
2206 function when they are created. */
2207 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2208 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2210 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2211 the same way that the first union alternative would be passed. */
2212 #define TYPE_TRANSPARENT_UNION(NODE) \
2213 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2215 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2216 address of a component of the type. This is the counterpart of
2217 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2218 #define TYPE_NONALIASED_COMPONENT(NODE) \
2219 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2221 /* Indicated that objects of this type should be laid out in as
2222 compact a way as possible. */
2223 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2225 /* Used by type_contains_placeholder_p to avoid recomputation.
2226 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2227 this field directly. */
2228 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2229 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2233 struct GTY(()) tree_type
{
2234 struct tree_common common
;
2241 unsigned int precision
: 9;
2242 ENUM_BITFIELD(machine_mode
) mode
: 7;
2244 unsigned string_flag
: 1;
2245 unsigned no_force_blk_flag
: 1;
2246 unsigned needs_constructing_flag
: 1;
2247 unsigned transparent_union_flag
: 1;
2248 unsigned packed_flag
: 1;
2249 unsigned restrict_flag
: 1;
2250 unsigned contains_placeholder_bits
: 2;
2252 unsigned lang_flag_0
: 1;
2253 unsigned lang_flag_1
: 1;
2254 unsigned lang_flag_2
: 1;
2255 unsigned lang_flag_3
: 1;
2256 unsigned lang_flag_4
: 1;
2257 unsigned lang_flag_5
: 1;
2258 unsigned lang_flag_6
: 1;
2259 unsigned user_align
: 1;
2262 alias_set_type alias_set
;
2265 union tree_type_symtab
{
2266 int GTY ((tag ("0"))) address
;
2267 const char * GTY ((tag ("1"))) pointer
;
2268 struct die_struct
* GTY ((tag ("2"))) die
;
2269 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2270 descbits ("2"))) symtab
;
2279 /* Points to a structure whose details depend on the language in use. */
2280 struct lang_type
*lang_specific
;
2283 /* Define accessor macros for information about type inheritance
2286 A "basetype" means a particular usage of a data type for inheritance
2287 in another type. Each such basetype usage has its own "binfo"
2288 object to describe it. The binfo object is a TREE_VEC node.
2290 Inheritance is represented by the binfo nodes allocated for a
2291 given type. For example, given types C and D, such that D is
2292 inherited by C, 3 binfo nodes will be allocated: one for describing
2293 the binfo properties of C, similarly one for D, and one for
2294 describing the binfo properties of D as a base type for C.
2295 Thus, given a pointer to class C, one can get a pointer to the binfo
2296 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2298 /* BINFO specific flags. */
2300 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2301 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2303 /* Flags for language dependent use. */
2304 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2305 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2306 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2307 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2308 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2309 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2310 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2312 /* The actual data type node being inherited in this basetype. */
2313 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2315 /* The offset where this basetype appears in its containing type.
2316 BINFO_OFFSET slot holds the offset (in bytes)
2317 from the base of the complete object to the base of the part of the
2318 object that is allocated on behalf of this `type'.
2319 This is always 0 except when there is multiple inheritance. */
2321 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2322 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2324 /* The virtual function table belonging to this basetype. Virtual
2325 function tables provide a mechanism for run-time method dispatching.
2326 The entries of a virtual function table are language-dependent. */
2328 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2330 /* The virtual functions in the virtual function table. This is
2331 a TREE_LIST that is used as an initial approximation for building
2332 a virtual function table for this basetype. */
2333 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2335 /* A vector of binfos for the direct basetypes inherited by this
2338 If this basetype describes type D as inherited in C, and if the
2339 basetypes of D are E and F, then this vector contains binfos for
2340 inheritance of E and F by C. */
2341 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2343 /* The number of basetypes for NODE. */
2344 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2346 /* Accessor macro to get to the Nth base binfo of this binfo. */
2347 #define BINFO_BASE_BINFO(NODE,N) \
2348 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2349 #define BINFO_BASE_ITERATE(NODE,N,B) \
2350 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2351 #define BINFO_BASE_APPEND(NODE,T) \
2352 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2354 /* For a BINFO record describing a virtual base class, i.e., one where
2355 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2356 base. The actual contents are language-dependent. In the C++
2357 front-end this field is an INTEGER_CST giving an offset into the
2358 vtable where the offset to the virtual base can be found. */
2359 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2361 /* Indicates the accesses this binfo has to its bases. The values are
2362 access_public_node, access_protected_node or access_private_node.
2363 If this array is not present, public access is implied. */
2364 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2366 #define BINFO_BASE_ACCESS(NODE,N) \
2367 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2368 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2369 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2371 /* The index in the VTT where this subobject's sub-VTT can be found.
2372 NULL_TREE if there is no sub-VTT. */
2373 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2375 /* The index in the VTT where the vptr for this subobject can be
2376 found. NULL_TREE if there is no secondary vptr in the VTT. */
2377 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2379 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2380 inheriting this base for non-virtual bases. For virtual bases it
2381 points either to the binfo for which this is a primary binfo, or to
2382 the binfo of the most derived type. */
2383 #define BINFO_INHERITANCE_CHAIN(NODE) \
2384 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2386 struct GTY (()) tree_binfo
{
2387 struct tree_common common
;
2393 VEC(tree
,gc
) *base_accesses
;
2399 VEC(tree
,none
) base_binfos
;
2403 /* Define fields and accessors for nodes representing declared names. */
2405 /* Nonzero if DECL represents a variable for the SSA passes. */
2406 #define SSA_VAR_P(DECL) \
2407 (TREE_CODE (DECL) == VAR_DECL \
2408 || TREE_CODE (DECL) == PARM_DECL \
2409 || TREE_CODE (DECL) == RESULT_DECL \
2410 || (TREE_CODE (DECL) == SSA_NAME \
2411 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2412 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2413 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2418 /* Enumerate visibility settings. */
2419 #ifndef SYMBOL_VISIBILITY_DEFINED
2420 #define SYMBOL_VISIBILITY_DEFINED
2421 enum symbol_visibility
2424 VISIBILITY_PROTECTED
,
2433 /* This is the name of the object as written by the user.
2434 It is an IDENTIFIER_NODE. */
2435 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2437 /* Every ..._DECL node gets a unique number. */
2438 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2440 /* These two fields describe where in the source code the declaration
2441 was. If the declaration appears in several places (as for a C
2442 function that is declared first and then defined later), this
2443 information should refer to the definition. */
2444 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2445 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2446 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2447 #define DECL_IS_BUILTIN(DECL) \
2448 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2450 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2451 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2452 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2453 points to either the FUNCTION_DECL for the containing function,
2454 the RECORD_TYPE or UNION_TYPE for the containing type, or
2455 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2457 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2458 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2459 struct GTY(()) tree_decl_minimal
{
2460 struct tree_common common
;
2468 /* For any sort of a ..._DECL node, this points to the original (abstract)
2469 decl node which this decl is an instance of, or else it is NULL indicating
2470 that this decl is not an instance of some other decl. For example,
2471 in a nested declaration of an inline function, this points back to the
2473 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2475 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2476 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2477 #define DECL_ORIGIN(NODE) \
2478 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2480 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2481 inline instance of some original (abstract) decl from an inline function;
2482 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2483 nodes can also have their abstract origin set to themselves. */
2484 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2485 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2487 /* In a DECL this is the field where attributes are stored. */
2488 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2490 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2491 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2492 For a VAR_DECL, holds the initial value.
2493 For a PARM_DECL, used for DECL_ARG_TYPE--default
2494 values for parameters are encoded in the type of the function,
2495 not in the PARM_DECL slot.
2496 For a FIELD_DECL, this is used for enumeration values and the C
2497 frontend uses it for temporarily storing bitwidth of bitfields.
2499 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2500 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2502 /* Holds the size of the datum, in bits, as a tree expression.
2503 Need not be constant. */
2504 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2505 /* Likewise for the size in bytes. */
2506 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2507 /* Holds the alignment required for the datum, in bits. */
2508 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2509 /* The alignment of NODE, in bytes. */
2510 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2511 /* Set if the alignment of this DECL has been set by the user, for
2512 example with an 'aligned' attribute. */
2513 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2514 /* Holds the machine mode corresponding to the declaration of a variable or
2515 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2517 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2519 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2520 operation it is. Note, however, that this field is overloaded, with
2521 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2522 checked before any access to the former. */
2523 #define DECL_FUNCTION_CODE(NODE) \
2524 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2525 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2526 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2528 /* Nonzero for a given ..._DECL node means that the name of this node should
2529 be ignored for symbolic debug purposes. */
2530 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2532 /* Nonzero for a given ..._DECL node means that this node represents an
2533 "abstract instance" of the given declaration (e.g. in the original
2534 declaration of an inline function). When generating symbolic debugging
2535 information, we mustn't try to generate any address information for nodes
2536 marked as "abstract instances" because we don't actually generate
2537 any code or allocate any data space for such instances. */
2538 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2540 /* Language-specific decl information. */
2541 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2543 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2544 do not allocate storage, and refer to a definition elsewhere. Note that
2545 this does not necessarily imply the entity represented by NODE
2546 has no program source-level definition in this translation unit. For
2547 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2548 DECL_EXTERNAL may be true simultaneously; that can be the case for
2549 a C99 "extern inline" function. */
2550 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2552 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2553 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2555 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2557 Also set in some languages for variables, etc., outside the normal
2558 lexical scope, such as class instance variables. */
2559 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2561 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2562 Used in FIELD_DECLs for vtable pointers.
2563 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2564 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2566 /* Used to indicate that this DECL represents a compiler-generated entity. */
2567 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2569 /* Additional flags for language-specific uses. */
2570 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2571 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2572 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2573 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2574 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2575 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2576 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2577 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2579 /* Used to indicate an alias set for the memory pointed to by this
2580 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2581 pointer (or reference) type. */
2582 #define DECL_POINTER_ALIAS_SET(NODE) \
2583 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2585 /* Nonzero if an alias set has been assigned to this declaration. */
2586 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2587 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2589 /* Nonzero for a decl which is at file scope. */
2590 #define DECL_FILE_SCOPE_P(EXP) \
2591 (! DECL_CONTEXT (EXP) \
2592 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2594 /* Nonzero for a decl that is decorated using attribute used.
2595 This indicates compiler tools that this decl needs to be preserved. */
2596 #define DECL_PRESERVE_P(DECL) \
2597 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2599 /* For function local variables of COMPLEX and VECTOR types,
2600 indicates that the variable is not aliased, and that all
2601 modifications to the variable have been adjusted so that
2602 they are killing assignments. Thus the variable may now
2603 be treated as a GIMPLE register, and use real instead of
2604 virtual ops in SSA form. */
2605 #define DECL_GIMPLE_REG_P(DECL) \
2606 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2608 /* For a DECL with pointer type, this is set if Type Based Alias
2609 Analysis should not be applied to this DECL. */
2610 #define DECL_NO_TBAA_P(DECL) \
2611 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2613 struct GTY(()) tree_decl_common
{
2614 struct tree_decl_minimal common
;
2617 ENUM_BITFIELD(machine_mode
) mode
: 8;
2619 unsigned nonlocal_flag
: 1;
2620 unsigned virtual_flag
: 1;
2621 unsigned ignored_flag
: 1;
2622 unsigned abstract_flag
: 1;
2623 unsigned artificial_flag
: 1;
2624 unsigned user_align
: 1;
2625 unsigned preserve_flag
: 1;
2626 unsigned debug_expr_is_from
: 1;
2628 unsigned lang_flag_0
: 1;
2629 unsigned lang_flag_1
: 1;
2630 unsigned lang_flag_2
: 1;
2631 unsigned lang_flag_3
: 1;
2632 unsigned lang_flag_4
: 1;
2633 unsigned lang_flag_5
: 1;
2634 unsigned lang_flag_6
: 1;
2635 unsigned lang_flag_7
: 1;
2637 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2638 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2639 unsigned decl_flag_0
: 1;
2640 /* In FIELD_DECL, this is DECL_PACKED. */
2641 unsigned decl_flag_1
: 1;
2642 /* In FIELD_DECL, this is DECL_BIT_FIELD
2643 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2644 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2645 unsigned decl_flag_2
: 1;
2646 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2647 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2648 unsigned decl_flag_3
: 1;
2649 /* Logically, these two would go in a theoretical base shared by var and
2651 unsigned gimple_reg_flag
: 1;
2652 /* In a DECL with pointer type, set if no TBAA should be done. */
2653 unsigned no_tbaa_flag
: 1;
2654 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2655 unsigned decl_by_reference_flag
: 1;
2656 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2657 unsigned decl_common_unused
: 1;
2659 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2660 unsigned int off_align
: 8;
2665 tree abstract_origin
;
2667 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2670 alias_set_type pointer_alias_set
;
2671 /* Points to a structure whose details depend on the language in use. */
2672 struct lang_decl
*lang_specific
;
2675 extern tree
decl_value_expr_lookup (tree
);
2676 extern void decl_value_expr_insert (tree
, tree
);
2678 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2679 if transformations have made this more complicated than evaluating the
2680 decl itself. This should only be used for debugging; once this field has
2681 been set, the decl itself may not legitimately appear in the function. */
2682 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2683 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2684 #define DECL_VALUE_EXPR(NODE) \
2685 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2686 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2687 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2689 /* Holds the RTL expression for the value of a variable or function.
2690 This value can be evaluated lazily for functions, variables with
2691 static storage duration, and labels. */
2692 #define DECL_RTL(NODE) \
2693 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2694 ? (NODE)->decl_with_rtl.rtl \
2695 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2697 /* Set the DECL_RTL for NODE to RTL. */
2698 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2700 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2701 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2703 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2704 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2706 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2707 NODE1, it will not be set for NODE2; this is a lazy copy. */
2708 #define COPY_DECL_RTL(NODE1, NODE2) \
2709 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2711 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2712 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2714 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2715 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2717 struct GTY(()) tree_decl_with_rtl
{
2718 struct tree_decl_common common
;
2722 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2723 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2724 of the structure. */
2725 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2727 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2728 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2729 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2730 natural alignment of the field's type). */
2731 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2733 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2734 if so, the type that was originally specified for it.
2735 TREE_TYPE may have been modified (in finish_struct). */
2736 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2738 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2739 if nonzero, indicates that the field occupies the type. */
2740 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2742 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2743 DECL_FIELD_OFFSET which are known to be always zero.
2744 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2746 #define DECL_OFFSET_ALIGN(NODE) \
2747 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2749 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2750 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2751 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2752 /* 1 if the alignment for this type was requested by "aligned" attribute,
2753 0 if it is the default for this type. */
2755 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2756 which this FIELD_DECL is defined. This information is needed when
2757 writing debugging information about vfield and vbase decls for C++. */
2758 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2760 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2761 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2763 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2765 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2767 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2768 this component. This makes it possible for Type-Based Alias Analysis
2769 to disambiguate accesses to this field with indirect accesses using
2772 struct S { int i; } s;
2775 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2777 From the implementation's viewpoint, the alias set of the type of the
2778 field 'i' (int) will not be recorded as a subset of that of the type of
2779 's' (struct S) in record_component_aliases. The counterpart is that
2780 accesses to s.i must not be given the alias set of the type of 'i'
2781 (int) but instead directly that of the type of 's' (struct S). */
2782 #define DECL_NONADDRESSABLE_P(NODE) \
2783 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2785 struct GTY(()) tree_field_decl
{
2786 struct tree_decl_common common
;
2789 tree bit_field_type
;
2796 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2797 dense, unique within any one function, and may be used to index arrays.
2798 If the value is -1, then no UID has been assigned. */
2799 #define LABEL_DECL_UID(NODE) \
2800 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2802 /* In LABEL_DECL nodes, nonzero means that an error message about
2803 jumping into such a binding contour has been printed for this label. */
2804 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2806 struct GTY(()) tree_label_decl
{
2807 struct tree_decl_with_rtl common
;
2810 struct GTY(()) tree_result_decl
{
2811 struct tree_decl_with_rtl common
;
2814 struct GTY(()) tree_const_decl
{
2815 struct tree_decl_with_rtl common
;
2818 /* For a PARM_DECL, records the data type used to pass the argument,
2819 which may be different from the type seen in the program. */
2820 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2822 /* For PARM_DECL, holds an RTL for the stack slot or register
2823 where the data was actually passed. */
2824 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2826 struct GTY(()) tree_parm_decl
{
2827 struct tree_decl_with_rtl common
;
2832 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2833 this variable in a BIND_EXPR. */
2834 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2835 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2837 /* Used to indicate that the linkage status of this DECL is not yet known,
2838 so it should not be output now. */
2839 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2841 /* Nonzero for a given ..._DECL node means that no warnings should be
2842 generated just because this node is unused. */
2843 #define DECL_IN_SYSTEM_HEADER(NODE) \
2844 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2846 /* Used to indicate that this DECL has weak linkage. */
2847 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2849 /* Used to indicate that the DECL is a dllimport. */
2850 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2852 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2853 based on a variable with a restrict qualified type. If it is,
2854 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2857 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2858 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2859 #define DECL_GET_RESTRICT_BASE(NODE) \
2860 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2861 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2862 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2864 extern tree
decl_restrict_base_lookup (tree
);
2865 extern void decl_restrict_base_insert (tree
, tree
);
2867 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2868 not be put out unless it is needed in this translation unit.
2869 Entities like this are shared across translation units (like weak
2870 entities), but are guaranteed to be generated by any translation
2871 unit that needs them, and therefore need not be put out anywhere
2872 where they are not needed. DECL_COMDAT is just a hint to the
2873 back-end; it is up to front-ends which set this flag to ensure
2874 that there will never be any harm, other than bloat, in putting out
2875 something which is DECL_COMDAT. */
2876 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2878 /* A replaceable function is one which may be replaced at link-time
2879 with an entirely different definition, provided that the
2880 replacement has the same type. For example, functions declared
2881 with __attribute__((weak)) on most systems are replaceable.
2883 COMDAT functions are not replaceable, since all definitions of the
2884 function must be equivalent. It is important that COMDAT functions
2885 not be treated as replaceable so that use of C++ template
2886 instantiations is not penalized.
2888 For example, DECL_REPLACEABLE is used to determine whether or not a
2889 function (including a template instantiation) which is not
2890 explicitly declared "inline" can be inlined. If the function is
2891 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2892 implementation chosen at link-time may be different. However, a
2893 function that is not DECL_REPLACEABLE can be inlined, since all
2894 versions of the function will be functionally identical. */
2895 #define DECL_REPLACEABLE_P(NODE) \
2896 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2898 /* The name of the object as the assembler will see it (but before any
2899 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2900 as DECL_NAME. It is an IDENTIFIER_NODE. */
2901 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2903 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2904 This is true of all DECL nodes except FIELD_DECL. */
2905 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2906 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2908 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2909 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2911 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2912 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2914 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2915 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2916 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2918 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2919 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2920 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2921 semantics of using this macro, are different than saying:
2923 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2925 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2927 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2928 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2929 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2930 DECL_ASSEMBLER_NAME (DECL1)) \
2933 /* Records the section name in a section attribute. Used to pass
2934 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2935 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2937 /* Value of the decls's visibility attribute */
2938 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2940 /* Nonzero means that the decl had its visibility specified rather than
2942 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2944 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2945 multiple translation units should be merged. */
2946 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2948 struct GTY(()) tree_decl_with_vis
{
2949 struct tree_decl_with_rtl common
;
2950 tree assembler_name
;
2953 /* Belong to VAR_DECL exclusively. */
2954 unsigned defer_output
:1;
2955 unsigned hard_register
:1;
2956 unsigned thread_local
:1;
2957 unsigned common_flag
:1;
2958 unsigned in_text_section
: 1;
2959 unsigned dllimport_flag
: 1;
2960 unsigned based_on_restrict_p
: 1;
2961 /* Used by C++. Might become a generic decl flag. */
2962 unsigned shadowed_for_var_p
: 1;
2964 /* Don't belong to VAR_DECL exclusively. */
2965 unsigned weak_flag
:1;
2966 unsigned seen_in_bind_expr
: 1;
2967 unsigned comdat_flag
: 1;
2968 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
2969 unsigned visibility_specified
: 1;
2970 /* Belong to FUNCTION_DECL exclusively. */
2971 unsigned one_only
: 1;
2972 unsigned init_priority_p
:1;
2974 /* Belongs to VAR_DECL exclusively. */
2975 ENUM_BITFIELD(tls_model
) tls_model
: 3;
2976 /* 13 unused bits. */
2979 /* In a VAR_DECL that's static,
2980 nonzero if the space is in the text section. */
2981 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2983 /* Nonzero for a given ..._DECL node means that this node should be
2984 put in .common, if possible. If a DECL_INITIAL is given, and it
2985 is not error_mark_node, then the decl cannot be put in .common. */
2986 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2988 /* In a VAR_DECL, nonzero if the decl is a register variable with
2989 an explicit asm specification. */
2990 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2992 extern tree
decl_debug_expr_lookup (tree
);
2993 extern void decl_debug_expr_insert (tree
, tree
);
2994 /* For VAR_DECL, this is set to either an expression that it was split
2995 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2996 subexpressions that it was split into. */
2997 #define DECL_DEBUG_EXPR(NODE) \
2998 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3000 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3001 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3003 /* An initialization priority. */
3004 typedef unsigned short priority_type
;
3006 extern priority_type
decl_init_priority_lookup (tree
);
3007 extern priority_type
decl_fini_priority_lookup (tree
);
3008 extern void decl_init_priority_insert (tree
, priority_type
);
3009 extern void decl_fini_priority_insert (tree
, priority_type
);
3011 /* In a non-local VAR_DECL with static storage duration, true if the
3012 variable has an initialization priority. If false, the variable
3013 will be initialized at the DEFAULT_INIT_PRIORITY. */
3014 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3015 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3017 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3019 #define DECL_INIT_PRIORITY(NODE) \
3020 (decl_init_priority_lookup (NODE))
3021 /* Set the initialization priority for NODE to VAL. */
3022 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3023 (decl_init_priority_insert (NODE, VAL))
3025 /* For a FUNCTION_DECL the finalization priority of NODE. */
3026 #define DECL_FINI_PRIORITY(NODE) \
3027 (decl_fini_priority_lookup (NODE))
3028 /* Set the finalization priority for NODE to VAL. */
3029 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3030 (decl_fini_priority_insert (NODE, VAL))
3032 /* The initialization priority for entities for which no explicit
3033 initialization priority has been specified. */
3034 #define DEFAULT_INIT_PRIORITY 65535
3036 /* The maximum allowed initialization priority. */
3037 #define MAX_INIT_PRIORITY 65535
3039 /* The largest priority value reserved for use by system runtime
3041 #define MAX_RESERVED_INIT_PRIORITY 100
3043 /* In a VAR_DECL, the model to use if the data should be allocated from
3044 thread-local storage. */
3045 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3047 /* In a VAR_DECL, nonzero if the data should be allocated from
3048 thread-local storage. */
3049 #define DECL_THREAD_LOCAL_P(NODE) \
3050 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3052 struct GTY(()) tree_var_decl
{
3053 struct tree_decl_with_vis common
;
3057 /* This field is used to reference anything in decl.result and is meant only
3058 for use by the garbage collector. */
3059 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3061 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3062 Before the struct containing the FUNCTION_DECL is laid out,
3063 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3064 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3065 function. When the class is laid out, this pointer is changed
3066 to an INTEGER_CST node which is suitable for use as an index
3067 into the virtual function table.
3068 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3069 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3072 tree_decl_non_common
{
3073 struct tree_decl_with_vis common
;
3074 /* C++ uses this in namespaces. */
3076 /* C++ uses this in templates. */
3078 /* Almost all FE's use this. */
3080 /* C++ uses this in namespaces. */
3084 /* In FUNCTION_DECL, holds the decl for the return value. */
3085 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3087 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3088 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3090 /* In a FUNCTION_DECL, the saved representation of the body of the
3092 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3094 /* Nonzero in a FUNCTION_DECL means this function should be treated
3095 as if it were a malloc, meaning it returns a pointer that is
3097 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3099 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3100 C++ operator new, meaning that it returns a pointer for which we
3101 should not use type based aliasing. */
3102 #define DECL_IS_OPERATOR_NEW(NODE) \
3103 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3105 /* Nonzero in a FUNCTION_DECL means this function may return more
3107 #define DECL_IS_RETURNS_TWICE(NODE) \
3108 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3110 /* Nonzero in a FUNCTION_DECL means this function should be treated
3111 as "pure" function (like const function, but may read global memory). */
3112 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3114 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3115 the const or pure function may not terminate. When this is nonzero
3116 for a const or pure function, it can be dealt with by cse passes
3117 but cannot be removed by dce passes since you are not allowed to
3118 change an infinite looping program into one that terminates without
3120 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3121 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3123 /* Nonzero in a FUNCTION_DECL means this function should be treated
3124 as "novops" function (function that does not read global memory,
3125 but may have arbitrary side effects). */
3126 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3128 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3129 at the beginning or end of execution. */
3130 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3131 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3133 #define DECL_STATIC_DESTRUCTOR(NODE) \
3134 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3136 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3137 be instrumented with calls to support routines. */
3138 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3139 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3141 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3142 disabled in this function. */
3143 #define DECL_NO_LIMIT_STACK(NODE) \
3144 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3146 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3147 static chain is not needed. */
3148 #define DECL_NO_STATIC_CHAIN(NODE) \
3149 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3151 /* Nonzero for a decl that cgraph has decided should be inlined into
3152 at least one call site. It is not meaningful to look at this
3153 directly; always use cgraph_function_possibly_inlined_p. */
3154 #define DECL_POSSIBLY_INLINED(DECL) \
3155 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3157 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3158 such as via the `inline' keyword in C/C++. This flag controls the linkage
3159 semantics of 'inline' */
3160 #define DECL_DECLARED_INLINE_P(NODE) \
3161 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3163 /* Nonzero in a FUNCTION_DECL means this function should not get
3164 -Winline warnings. */
3165 #define DECL_NO_INLINE_WARNING_P(NODE) \
3166 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3168 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3169 disregarding size and cost heuristics. This is equivalent to using
3170 the always_inline attribute without the required diagnostics if the
3171 function cannot be inlined. */
3172 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3173 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3175 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3176 that describes the status of this function. */
3177 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3179 /* In a FUNCTION_DECL, nonzero means a built in function. */
3180 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3182 /* For a builtin function, identify which part of the compiler defined it. */
3183 #define DECL_BUILT_IN_CLASS(NODE) \
3184 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3186 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3187 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3189 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3190 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3192 /* In FUNCTION_DECL, the function specific target options to use when compiling
3194 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3195 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3197 /* In FUNCTION_DECL, the function specific optimization options to use when
3198 compiling this function. */
3199 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3200 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3202 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3203 arguments/result/saved_tree fields by front ends. It was either inherit
3204 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3205 which seemed a bit strange. */
3207 struct GTY(()) tree_function_decl
{
3208 struct tree_decl_non_common common
;
3212 /* Function specific options that are used by this function. */
3213 tree function_specific_target
; /* target options */
3214 tree function_specific_optimization
; /* optimization options */
3216 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3217 DECL_FUNCTION_CODE. Otherwise unused.
3218 ??? The bitfield needs to be able to hold all target function
3220 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3221 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3223 unsigned static_ctor_flag
: 1;
3224 unsigned static_dtor_flag
: 1;
3225 unsigned uninlinable
: 1;
3227 unsigned possibly_inlined
: 1;
3228 unsigned novops_flag
: 1;
3229 unsigned returns_twice_flag
: 1;
3230 unsigned malloc_flag
: 1;
3231 unsigned operator_new_flag
: 1;
3232 unsigned declared_inline_flag
: 1;
3233 unsigned regdecl_flag
: 1;
3235 unsigned no_inline_warning_flag
: 1;
3236 unsigned no_instrument_function_entry_exit
: 1;
3237 unsigned no_limit_stack
: 1;
3238 unsigned disregard_inline_limits
: 1;
3239 unsigned pure_flag
: 1;
3240 unsigned looping_const_or_pure_flag
: 1;
3246 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3247 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3249 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3250 into stabs. Instead it will generate cross reference ('x') of names.
3251 This uses the same flag as DECL_EXTERNAL. */
3252 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3253 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3255 /* Getter of the imported declaration associated to the
3256 IMPORTED_DECL node. */
3257 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3258 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3260 struct GTY(()) tree_type_decl
{
3261 struct tree_decl_non_common common
;
3265 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3266 To reduce overhead, the nodes containing the statements are not trees.
3267 This avoids the overhead of tree_common on all linked list elements.
3269 Use the interface in tree-iterator.h to access this node. */
3271 #define STATEMENT_LIST_HEAD(NODE) \
3272 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3273 #define STATEMENT_LIST_TAIL(NODE) \
3274 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3276 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3278 struct tree_statement_list_node
*prev
;
3279 struct tree_statement_list_node
*next
;
3283 struct GTY(()) tree_statement_list
3285 struct tree_common common
;
3286 struct tree_statement_list_node
*head
;
3287 struct tree_statement_list_node
*tail
;
3291 /* Optimization options used by a function. */
3293 struct GTY(()) tree_optimization_option
{
3294 struct tree_common common
;
3296 /* The optimization options used by the user. */
3297 struct cl_optimization opts
;
3300 #define TREE_OPTIMIZATION(NODE) \
3301 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3303 /* Return a tree node that encapsulates the current optimization options. */
3304 extern tree
build_optimization_node (void);
3306 /* Target options used by a function. */
3308 struct GTY(()) tree_target_option
{
3309 struct tree_common common
;
3311 /* The optimization options used by the user. */
3312 struct cl_target_option opts
;
3315 #define TREE_TARGET_OPTION(NODE) \
3316 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3318 /* Return a tree node that encapsulates the current target options. */
3319 extern tree
build_target_option_node (void);
3322 /* Define the overall contents of a tree node.
3323 It may be any of the structures declared above
3324 for various types of node. */
3326 union GTY ((ptr_alias (union lang_tree_node
),
3327 desc ("tree_node_structure (&%h)"))) tree_node
{
3328 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3329 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3330 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3331 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3332 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3333 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3334 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3335 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3336 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3337 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3338 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3339 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3340 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3341 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3342 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3343 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3344 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3345 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3346 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3347 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3348 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3349 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3350 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
3351 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3352 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3353 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3354 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3355 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3356 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3357 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3358 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3359 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3360 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3361 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3364 /* Standard named or nameless data types of the C compiler. */
3386 TI_INTEGER_MINUS_ONE
,
3403 TI_COMPLEX_INTEGER_TYPE
,
3404 TI_COMPLEX_FLOAT_TYPE
,
3405 TI_COMPLEX_DOUBLE_TYPE
,
3406 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3410 TI_LONG_DOUBLE_TYPE
,
3414 TI_LONG_DOUBLE_PTR_TYPE
,
3415 TI_INTEGER_PTR_TYPE
,
3424 TI_VA_LIST_GPR_COUNTER_FIELD
,
3425 TI_VA_LIST_FPR_COUNTER_FIELD
,
3432 TI_DFLOAT32_PTR_TYPE
,
3433 TI_DFLOAT64_PTR_TYPE
,
3434 TI_DFLOAT128_PTR_TYPE
,
3443 TI_SAT_LLFRACT_TYPE
,
3444 TI_SAT_USFRACT_TYPE
,
3446 TI_SAT_ULFRACT_TYPE
,
3447 TI_SAT_ULLFRACT_TYPE
,
3459 TI_SAT_LLACCUM_TYPE
,
3460 TI_SAT_USACCUM_TYPE
,
3462 TI_SAT_ULACCUM_TYPE
,
3463 TI_SAT_ULLACCUM_TYPE
,
3509 TI_OPTIMIZATION_DEFAULT
,
3510 TI_OPTIMIZATION_CURRENT
,
3511 TI_TARGET_OPTION_DEFAULT
,
3512 TI_TARGET_OPTION_CURRENT
,
3513 TI_CURRENT_TARGET_PRAGMA
,
3514 TI_CURRENT_OPTIMIZE_PRAGMA
,
3519 extern GTY(()) tree global_trees
[TI_MAX
];
3521 #define error_mark_node global_trees[TI_ERROR_MARK]
3523 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3524 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3525 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3526 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3527 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3529 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3530 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3531 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3532 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3533 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3535 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3536 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3538 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3539 #define integer_one_node global_trees[TI_INTEGER_ONE]
3540 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3541 #define size_zero_node global_trees[TI_SIZE_ZERO]
3542 #define size_one_node global_trees[TI_SIZE_ONE]
3543 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3544 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3545 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3547 /* Base access nodes. */
3548 #define access_public_node global_trees[TI_PUBLIC]
3549 #define access_protected_node global_trees[TI_PROTECTED]
3550 #define access_private_node global_trees[TI_PRIVATE]
3552 #define null_pointer_node global_trees[TI_NULL_POINTER]
3554 #define float_type_node global_trees[TI_FLOAT_TYPE]
3555 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3556 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3558 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3559 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3560 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3561 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3563 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3564 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3565 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3566 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3568 #define void_type_node global_trees[TI_VOID_TYPE]
3569 /* The C type `void *'. */
3570 #define ptr_type_node global_trees[TI_PTR_TYPE]
3571 /* The C type `const void *'. */
3572 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3573 /* The C type `size_t'. */
3574 #define size_type_node global_trees[TI_SIZE_TYPE]
3575 #define pid_type_node global_trees[TI_PID_TYPE]
3576 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3577 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3578 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3579 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3580 /* The C type `FILE *'. */
3581 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3583 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3584 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3585 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3587 /* The decimal floating point types. */
3588 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3589 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3590 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3591 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3592 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3593 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3595 /* The fixed-point types. */
3596 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3597 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3598 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3599 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3600 #define sat_unsigned_short_fract_type_node \
3601 global_trees[TI_SAT_USFRACT_TYPE]
3602 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3603 #define sat_unsigned_long_fract_type_node \
3604 global_trees[TI_SAT_ULFRACT_TYPE]
3605 #define sat_unsigned_long_long_fract_type_node \
3606 global_trees[TI_SAT_ULLFRACT_TYPE]
3607 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3608 #define fract_type_node global_trees[TI_FRACT_TYPE]
3609 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3610 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3611 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3612 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3613 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3614 #define unsigned_long_long_fract_type_node \
3615 global_trees[TI_ULLFRACT_TYPE]
3616 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3617 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3618 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3619 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3620 #define sat_unsigned_short_accum_type_node \
3621 global_trees[TI_SAT_USACCUM_TYPE]
3622 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3623 #define sat_unsigned_long_accum_type_node \
3624 global_trees[TI_SAT_ULACCUM_TYPE]
3625 #define sat_unsigned_long_long_accum_type_node \
3626 global_trees[TI_SAT_ULLACCUM_TYPE]
3627 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3628 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3629 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3630 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3631 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3632 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3633 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3634 #define unsigned_long_long_accum_type_node \
3635 global_trees[TI_ULLACCUM_TYPE]
3636 #define qq_type_node global_trees[TI_QQ_TYPE]
3637 #define hq_type_node global_trees[TI_HQ_TYPE]
3638 #define sq_type_node global_trees[TI_SQ_TYPE]
3639 #define dq_type_node global_trees[TI_DQ_TYPE]
3640 #define tq_type_node global_trees[TI_TQ_TYPE]
3641 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3642 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3643 #define usq_type_node global_trees[TI_USQ_TYPE]
3644 #define udq_type_node global_trees[TI_UDQ_TYPE]
3645 #define utq_type_node global_trees[TI_UTQ_TYPE]
3646 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3647 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3648 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3649 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3650 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3651 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3652 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3653 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3654 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3655 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3656 #define ha_type_node global_trees[TI_HA_TYPE]
3657 #define sa_type_node global_trees[TI_SA_TYPE]
3658 #define da_type_node global_trees[TI_DA_TYPE]
3659 #define ta_type_node global_trees[TI_TA_TYPE]
3660 #define uha_type_node global_trees[TI_UHA_TYPE]
3661 #define usa_type_node global_trees[TI_USA_TYPE]
3662 #define uda_type_node global_trees[TI_UDA_TYPE]
3663 #define uta_type_node global_trees[TI_UTA_TYPE]
3664 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3665 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3666 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3667 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3668 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3669 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3670 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3671 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3673 /* The node that should be placed at the end of a parameter list to
3674 indicate that the function does not take a variable number of
3675 arguments. The TREE_VALUE will be void_type_node and there will be
3676 no TREE_CHAIN. Language-independent code should not assume
3677 anything else about this node. */
3678 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3680 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3681 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3683 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3685 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3686 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3688 /* Default/current target options (TARGET_OPTION_NODE). */
3689 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3690 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3692 /* Default tree list option(), optimize() pragmas to be linked into the
3694 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3695 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3697 /* An enumeration of the standard C integer types. These must be
3698 ordered so that shorter types appear before longer ones, and so
3699 that signed types appear before unsigned ones, for the correct
3700 functioning of interpret_integer() in c-lex.c. */
3701 enum integer_type_kind
3713 itk_unsigned_long_long
,
3717 typedef enum integer_type_kind integer_type_kind
;
3719 /* The standard C integer types. Use integer_type_kind to index into
3721 extern GTY(()) tree integer_types
[itk_none
];
3723 #define char_type_node integer_types[itk_char]
3724 #define signed_char_type_node integer_types[itk_signed_char]
3725 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3726 #define short_integer_type_node integer_types[itk_short]
3727 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3728 #define integer_type_node integer_types[itk_int]
3729 #define unsigned_type_node integer_types[itk_unsigned_int]
3730 #define long_integer_type_node integer_types[itk_long]
3731 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3732 #define long_long_integer_type_node integer_types[itk_long_long]
3733 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3735 /* Set to the default thread-local storage (tls) model to use. */
3737 extern enum tls_model flag_tls_default
;
3740 /* A pointer-to-function member type looks like:
3747 If __pfn is NULL, it is a NULL pointer-to-member-function.
3749 (Because the vtable is always the first thing in the object, we
3750 don't need its offset.) If the function is virtual, then PFN is
3751 one plus twice the index into the vtable; otherwise, it is just a
3752 pointer to the function.
3754 Unfortunately, using the lowest bit of PFN doesn't work in
3755 architectures that don't impose alignment requirements on function
3756 addresses, or that use the lowest bit to tell one ISA from another,
3757 for example. For such architectures, we use the lowest bit of
3758 DELTA instead of the lowest bit of the PFN, and DELTA will be
3761 enum ptrmemfunc_vbit_where_t
3763 ptrmemfunc_vbit_in_pfn
,
3764 ptrmemfunc_vbit_in_delta
3767 #define NULL_TREE (tree) NULL
3769 extern tree
decl_assembler_name (tree
);
3770 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3771 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3773 /* Compute the number of bytes occupied by 'node'. This routine only
3774 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3776 extern size_t tree_size (const_tree
);
3778 /* Compute the number of bytes occupied by a tree with code CODE. This
3779 function cannot be used for TREE_VEC codes, which are of variable
3781 extern size_t tree_code_size (enum tree_code
);
3783 /* Lowest level primitive for allocating a node.
3784 The TREE_CODE is the only argument. Contents are initialized
3785 to zero except for a few of the common fields. */
3787 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3788 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3790 /* Make a copy of a node, with all the same contents. */
3792 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3793 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3795 /* Make a copy of a chain of TREE_LIST nodes. */
3797 extern tree
copy_list (tree
);
3800 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3801 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3803 /* Make a TREE_VEC. */
3805 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3806 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3808 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3809 The name is supplied as a char *. */
3811 extern tree
get_identifier (const char *);
3813 #if GCC_VERSION >= 3000
3814 #define get_identifier(str) \
3815 (__builtin_constant_p (str) \
3816 ? get_identifier_with_length ((str), strlen (str)) \
3817 : get_identifier (str))
3821 /* Identical to get_identifier, except that the length is assumed
3824 extern tree
get_identifier_with_length (const char *, size_t);
3826 /* If an identifier with the name TEXT (a null-terminated string) has
3827 previously been referred to, return that node; otherwise return
3830 extern tree
maybe_get_identifier (const char *);
3832 /* Construct various types of nodes. */
3834 extern tree
build_nt (enum tree_code
, ...);
3835 extern tree
build_nt_call_list (tree
, tree
);
3837 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3838 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3839 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3840 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3841 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3842 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3843 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3844 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3845 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3846 tree MEM_STAT_DECL
);
3847 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3848 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3849 tree MEM_STAT_DECL
);
3850 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3851 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3852 tree
, tree MEM_STAT_DECL
);
3853 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3854 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3856 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3857 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3858 extern tree
build_int_cstu (tree
, unsigned HOST_WIDE_INT
);
3859 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3860 extern tree
build_int_cst_wide_type (tree
,
3861 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3862 extern tree
build_vector (tree
, tree
);
3863 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
3864 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
3865 extern tree
build_constructor_single (tree
, tree
, tree
);
3866 extern tree
build_constructor_from_list (tree
, tree
);
3867 extern tree
build_real_from_int_cst (tree
, const_tree
);
3868 extern tree
build_complex (tree
, tree
, tree
);
3869 extern tree
build_one_cst (tree
);
3870 extern tree
build_string (int, const char *);
3871 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3872 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3873 extern tree
build_decl_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3874 extern tree
build_fn_decl (const char *, tree
);
3875 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3876 extern tree
build_block (tree
, tree
, tree
, tree
);
3877 extern tree
build_empty_stmt (void);
3878 extern tree
build_omp_clause (enum omp_clause_code
);
3880 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3881 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3883 extern tree
build_call_list (tree
, tree
, tree
);
3884 extern tree
build_call_nary (tree
, tree
, int, ...);
3885 extern tree
build_call_valist (tree
, tree
, int, va_list);
3886 extern tree
build_call_array (tree
, tree
, int, tree
*);
3888 /* Construct various nodes representing data types. */
3890 extern tree
make_signed_type (int);
3891 extern tree
make_unsigned_type (int);
3892 extern tree
signed_or_unsigned_type_for (int, tree
);
3893 extern tree
signed_type_for (tree
);
3894 extern tree
unsigned_type_for (tree
);
3895 extern void initialize_sizetypes (bool);
3896 extern void set_sizetype (tree
);
3897 extern void fixup_unsigned_type (tree
);
3898 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3899 extern tree
build_pointer_type (tree
);
3900 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3901 extern tree
build_reference_type (tree
);
3902 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3903 extern tree
build_vector_type (tree innertype
, int nunits
);
3904 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3905 extern tree
build_type_no_quals (tree
);
3906 extern tree
build_index_type (tree
);
3907 extern tree
build_index_2_type (tree
, tree
);
3908 extern tree
build_array_type (tree
, tree
);
3909 extern tree
build_function_type (tree
, tree
);
3910 extern tree
build_function_type_list (tree
, ...);
3911 extern tree
build_function_type_skip_args (tree
, bitmap
);
3912 extern tree
build_function_decl_skip_args (tree
, bitmap
);
3913 extern tree
build_varargs_function_type_list (tree
, ...);
3914 extern tree
build_method_type_directly (tree
, tree
, tree
);
3915 extern tree
build_method_type (tree
, tree
);
3916 extern tree
build_offset_type (tree
, tree
);
3917 extern tree
build_complex_type (tree
);
3918 extern tree
build_resx (int);
3919 extern tree
array_type_nelts (const_tree
);
3920 extern bool in_array_bounds_p (tree
);
3921 extern bool range_in_array_bounds_p (tree
);
3923 extern tree
value_member (tree
, tree
);
3924 extern tree
purpose_member (const_tree
, tree
);
3926 extern int attribute_list_equal (const_tree
, const_tree
);
3927 extern int attribute_list_contained (const_tree
, const_tree
);
3928 extern int tree_int_cst_equal (const_tree
, const_tree
);
3929 extern int tree_int_cst_lt (const_tree
, const_tree
);
3930 extern int tree_int_cst_compare (const_tree
, const_tree
);
3931 extern int host_integerp (const_tree
, int);
3932 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
3933 extern int tree_int_cst_msb (const_tree
);
3934 extern int tree_int_cst_sgn (const_tree
);
3935 extern int tree_int_cst_sign_bit (const_tree
);
3936 extern unsigned int tree_int_cst_min_precision (tree
, bool);
3937 extern bool tree_expr_nonnegative_p (tree
);
3938 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3939 extern bool may_negate_without_overflow_p (const_tree
);
3940 extern tree
strip_array_types (tree
);
3941 extern tree
excess_precision_type (tree
);
3943 /* Construct various nodes representing fract or accum data types. */
3945 extern tree
make_fract_type (int, int, int);
3946 extern tree
make_accum_type (int, int, int);
3948 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3949 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3950 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3951 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3952 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3953 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3954 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3955 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3957 #define make_or_reuse_signed_fract_type(P) \
3958 make_or_reuse_fract_type (P, 0, 0)
3959 #define make_or_reuse_unsigned_fract_type(P) \
3960 make_or_reuse_fract_type (P, 1, 0)
3961 #define make_or_reuse_sat_signed_fract_type(P) \
3962 make_or_reuse_fract_type (P, 0, 1)
3963 #define make_or_reuse_sat_unsigned_fract_type(P) \
3964 make_or_reuse_fract_type (P, 1, 1)
3965 #define make_or_reuse_signed_accum_type(P) \
3966 make_or_reuse_accum_type (P, 0, 0)
3967 #define make_or_reuse_unsigned_accum_type(P) \
3968 make_or_reuse_accum_type (P, 1, 0)
3969 #define make_or_reuse_sat_signed_accum_type(P) \
3970 make_or_reuse_accum_type (P, 0, 1)
3971 #define make_or_reuse_sat_unsigned_accum_type(P) \
3972 make_or_reuse_accum_type (P, 1, 1)
3974 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3975 put the prototype here. Rtl.h does declare the prototype if
3976 tree.h had been included. */
3978 extern tree
make_tree (tree
, rtx
);
3980 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3983 Such modified types already made are recorded so that duplicates
3986 extern tree
build_type_attribute_variant (tree
, tree
);
3987 extern tree
build_decl_attribute_variant (tree
, tree
);
3989 /* Structure describing an attribute and a function to handle it. */
3990 struct attribute_spec
3992 /* The name of the attribute (without any leading or trailing __),
3993 or NULL to mark the end of a table of attributes. */
3994 const char *const name
;
3995 /* The minimum length of the list of arguments of the attribute. */
3996 const int min_length
;
3997 /* The maximum length of the list of arguments of the attribute
3998 (-1 for no maximum). */
3999 const int max_length
;
4000 /* Whether this attribute requires a DECL. If it does, it will be passed
4001 from types of DECLs, function return types and array element types to
4002 the DECLs, function types and array types respectively; but when
4003 applied to a type in any other circumstances, it will be ignored with
4004 a warning. (If greater control is desired for a given attribute,
4005 this should be false, and the flags argument to the handler may be
4006 used to gain greater control in that case.) */
4007 const bool decl_required
;
4008 /* Whether this attribute requires a type. If it does, it will be passed
4009 from a DECL to the type of that DECL. */
4010 const bool type_required
;
4011 /* Whether this attribute requires a function (or method) type. If it does,
4012 it will be passed from a function pointer type to the target type,
4013 and from a function return type (which is not itself a function
4014 pointer type) to the function type. */
4015 const bool function_type_required
;
4016 /* Function to handle this attribute. NODE points to the node to which
4017 the attribute is to be applied. If a DECL, it should be modified in
4018 place; if a TYPE, a copy should be created. NAME is the name of the
4019 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4020 of the arguments (which may be NULL). FLAGS gives further information
4021 about the context of the attribute. Afterwards, the attributes will
4022 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4023 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4024 as well as in any other cases when the attributes should not be added
4025 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4026 applied to another type or DECL later may be returned;
4027 otherwise the return value should be NULL_TREE. This pointer may be
4028 NULL if no special handling is required beyond the checks implied
4029 by the rest of this structure. */
4030 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4031 int flags
, bool *no_add_attrs
);
4034 /* Flags that may be passed in the third argument of decl_attributes, and
4035 to handler functions for attributes. */
4036 enum attribute_flags
4038 /* The type passed in is the type of a DECL, and any attributes that
4039 should be passed in again to be applied to the DECL rather than the
4040 type should be returned. */
4041 ATTR_FLAG_DECL_NEXT
= 1,
4042 /* The type passed in is a function return type, and any attributes that
4043 should be passed in again to be applied to the function type rather
4044 than the return type should be returned. */
4045 ATTR_FLAG_FUNCTION_NEXT
= 2,
4046 /* The type passed in is an array element type, and any attributes that
4047 should be passed in again to be applied to the array type rather
4048 than the element type should be returned. */
4049 ATTR_FLAG_ARRAY_NEXT
= 4,
4050 /* The type passed in is a structure, union or enumeration type being
4051 created, and should be modified in place. */
4052 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4053 /* The attributes are being applied by default to a library function whose
4054 name indicates known behavior, and should be silently ignored if they
4055 are not in fact compatible with the function type. */
4056 ATTR_FLAG_BUILT_IN
= 16
4059 /* Default versions of target-overridable functions. */
4061 extern tree
merge_decl_attributes (tree
, tree
);
4062 extern tree
merge_type_attributes (tree
, tree
);
4064 /* Given a tree node and a string, return nonzero if the tree node is
4065 a valid attribute name for the string. */
4067 extern int is_attribute_p (const char *, const_tree
);
4069 /* Given an attribute name and a list of attributes, return the list element
4070 of the attribute or NULL_TREE if not found. */
4072 extern tree
lookup_attribute (const char *, tree
);
4074 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4077 extern tree
remove_attribute (const char *, tree
);
4079 /* Given two attributes lists, return a list of their union. */
4081 extern tree
merge_attributes (tree
, tree
);
4083 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4084 /* Given two Windows decl attributes lists, possibly including
4085 dllimport, return a list of their union . */
4086 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4088 /* Handle a "dllimport" or "dllexport" attribute. */
4089 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4092 /* Check whether CAND is suitable to be returned from get_qualified_type
4093 (BASE, TYPE_QUALS). */
4095 extern bool check_qualified_type (const_tree
, const_tree
, int);
4097 /* Return a version of the TYPE, qualified as indicated by the
4098 TYPE_QUALS, if one exists. If no qualified version exists yet,
4099 return NULL_TREE. */
4101 extern tree
get_qualified_type (tree
, int);
4103 /* Like get_qualified_type, but creates the type if it does not
4104 exist. This function never returns NULL_TREE. */
4106 extern tree
build_qualified_type (tree
, int);
4108 /* Like build_qualified_type, but only deals with the `const' and
4109 `volatile' qualifiers. This interface is retained for backwards
4110 compatibility with the various front-ends; new code should use
4111 build_qualified_type instead. */
4113 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4114 build_qualified_type ((TYPE), \
4115 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4116 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4118 /* Make a copy of a type node. */
4120 extern tree
build_distinct_type_copy (tree
);
4121 extern tree
build_variant_type_copy (tree
);
4123 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4124 fields. Optionally specify an alignment, and then lay it out. */
4126 extern void finish_builtin_struct (tree
, const char *,
4129 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4130 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4131 node, does nothing except for the first time. */
4133 extern void layout_type (tree
);
4135 /* These functions allow a front-end to perform a manual layout of a
4136 RECORD_TYPE. (For instance, if the placement of subsequent fields
4137 depends on the placement of fields so far.) Begin by calling
4138 start_record_layout. Then, call place_field for each of the
4139 fields. Then, call finish_record_layout. See layout_type for the
4140 default way in which these functions are used. */
4142 typedef struct record_layout_info_s
4144 /* The RECORD_TYPE that we are laying out. */
4146 /* The offset into the record so far, in bytes, not including bits in
4149 /* The last known alignment of SIZE. */
4150 unsigned int offset_align
;
4151 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4153 /* The alignment of the record so far, in bits. */
4154 unsigned int record_align
;
4155 /* The alignment of the record so far, ignoring #pragma pack and
4156 __attribute__ ((packed)), in bits. */
4157 unsigned int unpacked_align
;
4158 /* The previous field layed out. */
4160 /* The static variables (i.e., class variables, as opposed to
4161 instance variables) encountered in T. */
4162 tree pending_statics
;
4163 /* Bits remaining in the current alignment group */
4164 int remaining_in_alignment
;
4165 /* True if we've seen a packed field that didn't have normal
4166 alignment anyway. */
4167 int packed_maybe_necessary
;
4168 } *record_layout_info
;
4170 extern record_layout_info
start_record_layout (tree
);
4171 extern tree
bit_from_pos (tree
, tree
);
4172 extern tree
byte_from_pos (tree
, tree
);
4173 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4174 extern void normalize_offset (tree
*, tree
*, unsigned int);
4175 extern tree
rli_size_unit_so_far (record_layout_info
);
4176 extern tree
rli_size_so_far (record_layout_info
);
4177 extern void normalize_rli (record_layout_info
);
4178 extern void place_field (record_layout_info
, tree
);
4179 extern void compute_record_mode (tree
);
4180 extern void finish_record_layout (record_layout_info
, int);
4182 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4183 return a canonicalized ..._TYPE node, so that duplicates are not made.
4184 How the hash code is computed is up to the caller, as long as any two
4185 callers that could hash identical-looking type nodes agree. */
4187 extern tree
type_hash_canon (unsigned int, tree
);
4189 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4190 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4191 fields. Call this only once for any given decl node.
4193 Second argument is the boundary that this field can be assumed to
4194 be starting at (in bits). Zero means it can be assumed aligned
4195 on any boundary that may be needed. */
4197 extern void layout_decl (tree
, unsigned);
4199 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4200 a previous call to layout_decl and calls it again. */
4202 extern void relayout_decl (tree
);
4204 /* Return the mode for data of a given size SIZE and mode class CLASS.
4205 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4206 The value is BLKmode if no other mode is found. This is like
4207 mode_for_size, but is passed a tree. */
4209 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4211 /* Return an expr equal to X but certainly not valid as an lvalue. */
4213 extern tree
non_lvalue (tree
);
4215 extern tree
convert (tree
, tree
);
4216 extern unsigned int expr_align (const_tree
);
4217 extern tree
expr_first (tree
);
4218 extern tree
expr_last (tree
);
4219 extern tree
size_in_bytes (const_tree
);
4220 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4221 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4222 extern tree
bit_position (const_tree
);
4223 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4224 extern tree
byte_position (const_tree
);
4225 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4227 /* Define data structures, macros, and functions for handling sizes
4228 and the various types used to represent sizes. */
4232 SIZETYPE
, /* Normal representation of sizes in bytes. */
4233 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4234 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4235 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4238 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4240 #define sizetype sizetype_tab[(int) SIZETYPE]
4241 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4242 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4243 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4245 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4246 extern tree
size_binop (enum tree_code
, tree
, tree
);
4247 extern tree
size_diffop (tree
, tree
);
4249 #define size_int(L) size_int_kind (L, SIZETYPE)
4250 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4251 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4252 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4254 extern tree
round_up (tree
, int);
4255 extern tree
round_down (tree
, int);
4256 extern tree
get_pending_sizes (void);
4257 extern void put_pending_size (tree
);
4258 extern void put_pending_sizes (tree
);
4260 /* Type for sizes of data-type. */
4262 #define BITS_PER_UNIT_LOG \
4263 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4264 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4265 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4267 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4268 extern unsigned int maximum_field_alignment
;
4269 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4270 extern unsigned int initial_max_fld_align
;
4272 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4273 by making the last node in X point to Y.
4274 Returns X, except if X is 0 returns Y. */
4276 extern tree
chainon (tree
, tree
);
4278 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4280 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4281 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4283 /* Return the last tree node in a chain. */
4285 extern tree
tree_last (tree
);
4287 /* Return the node in a chain whose TREE_VALUE is x, NULL if not found. */
4289 extern tree
tree_find_value (tree
, tree
);
4291 /* Reverse the order of elements in a chain, and return the new head. */
4293 extern tree
nreverse (tree
);
4295 /* Returns the length of a chain of nodes
4296 (number of chain pointers to follow before reaching a null pointer). */
4298 extern int list_length (const_tree
);
4300 /* Returns the number of FIELD_DECLs in a type. */
4302 extern int fields_length (const_tree
);
4304 /* Given an initializer INIT, return TRUE if INIT is zero or some
4305 aggregate of zeros. Otherwise return FALSE. */
4307 extern bool initializer_zerop (const_tree
);
4309 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4311 extern tree
ctor_to_list (tree
);
4313 /* Examine CTOR to discover:
4314 * how many scalar fields are set to nonzero values,
4315 and place it in *P_NZ_ELTS;
4316 * how many scalar fields in total are in CTOR,
4317 and place it in *P_ELT_COUNT.
4318 * if a type is a union, and the initializer from the constructor
4319 is not the largest element in the union, then set *p_must_clear.
4321 Return whether or not CTOR is a valid static constant initializer, the same
4322 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4324 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4327 extern HOST_WIDE_INT
count_type_elements (const_tree
, bool);
4329 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4331 extern int integer_zerop (const_tree
);
4333 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4335 extern int integer_onep (const_tree
);
4337 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4338 all of whose significant bits are 1. */
4340 extern int integer_all_onesp (const_tree
);
4342 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4343 exactly one bit 1. */
4345 extern int integer_pow2p (const_tree
);
4347 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4348 with a nonzero value. */
4350 extern int integer_nonzerop (const_tree
);
4352 extern bool cst_and_fits_in_hwi (const_tree
);
4353 extern tree
num_ending_zeros (const_tree
);
4355 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4358 extern int fixed_zerop (const_tree
);
4360 /* staticp (tree x) is nonzero if X is a reference to data allocated
4361 at a fixed address in memory. Returns the outermost data. */
4363 extern tree
staticp (tree
);
4365 /* save_expr (EXP) returns an expression equivalent to EXP
4366 but it can be used multiple times within context CTX
4367 and only evaluate EXP once. */
4369 extern tree
save_expr (tree
);
4371 /* Look inside EXPR and into any simple arithmetic operations. Return
4372 the innermost non-arithmetic node. */
4374 extern tree
skip_simple_arithmetic (tree
);
4376 /* Return which tree structure is used by T. */
4378 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4380 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4381 or offset that depends on a field within a record.
4383 Note that we only allow such expressions within simple arithmetic
4386 extern bool contains_placeholder_p (const_tree
);
4388 /* This macro calls the above function but short-circuits the common
4389 case of a constant to save time. Also check for null. */
4391 #define CONTAINS_PLACEHOLDER_P(EXP) \
4392 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4394 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4395 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4398 extern bool type_contains_placeholder_p (tree
);
4400 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4401 return a tree with all occurrences of references to F in a
4402 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4403 contains only arithmetic expressions. */
4405 extern tree
substitute_in_expr (tree
, tree
, tree
);
4407 /* This macro calls the above function but short-circuits the common
4408 case of a constant to save time and also checks for NULL. */
4410 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4411 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4413 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4414 for it within OBJ, a tree that is an object or a chain of references. */
4416 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4418 /* This macro calls the above function but short-circuits the common
4419 case of a constant to save time and also checks for NULL. */
4421 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4422 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4423 : substitute_placeholder_in_expr (EXP, OBJ))
4425 /* variable_size (EXP) is like save_expr (EXP) except that it
4426 is for the special case of something that is part of a
4427 variable size for a data type. It makes special arrangements
4428 to compute the value at the right time when the data type
4429 belongs to a function parameter. */
4431 extern tree
variable_size (tree
);
4433 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4434 but it can be used multiple times
4435 and only evaluate the subexpressions once. */
4437 extern tree
stabilize_reference (tree
);
4439 /* Subroutine of stabilize_reference; this is called for subtrees of
4440 references. Any expression with side-effects must be put in a SAVE_EXPR
4441 to ensure that it is only evaluated once. */
4443 extern tree
stabilize_reference_1 (tree
);
4445 /* Return EXP, stripped of any conversions to wider types
4446 in such a way that the result of converting to type FOR_TYPE
4447 is the same as if EXP were converted to FOR_TYPE.
4448 If FOR_TYPE is 0, it signifies EXP's type. */
4450 extern tree
get_unwidened (tree
, tree
);
4452 /* Return OP or a simpler expression for a narrower value
4453 which can be sign-extended or zero-extended to give back OP.
4454 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4455 or 0 if the value should be sign-extended. */
4457 extern tree
get_narrower (tree
, int *);
4459 /* Return true if T is an expression that get_inner_reference handles. */
4462 handled_component_p (const_tree t
)
4464 switch (TREE_CODE (t
))
4469 case ARRAY_RANGE_REF
:
4470 case VIEW_CONVERT_EXPR
:
4480 /* Given an expression EXP that is a handled_component_p,
4481 look for the ultimate containing object, which is returned and specify
4482 the access position and size. */
4484 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4485 tree
*, enum machine_mode
*, int *, int *,
4488 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4489 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4490 EXP is marked as PACKED. */
4492 extern bool contains_packed_reference (const_tree exp
);
4494 /* Return a tree of sizetype representing the size, in bytes, of the element
4495 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4497 extern tree
array_ref_element_size (tree
);
4499 /* Return a tree representing the lower bound of the array mentioned in
4500 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4502 extern tree
array_ref_low_bound (tree
);
4504 /* Return a tree representing the upper bound of the array mentioned in
4505 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4507 extern tree
array_ref_up_bound (tree
);
4509 /* Return a tree representing the offset, in bytes, of the field referenced
4510 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4512 extern tree
component_ref_field_offset (tree
);
4514 /* Given a DECL or TYPE, return the scope in which it was declared, or
4515 NUL_TREE if there is no containing scope. */
4517 extern tree
get_containing_scope (const_tree
);
4519 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4521 extern tree
decl_function_context (const_tree
);
4523 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4524 this _DECL with its context, or zero if none. */
4525 extern tree
decl_type_context (const_tree
);
4527 /* Return 1 if EXPR is the real constant zero. */
4528 extern int real_zerop (const_tree
);
4530 /* Declare commonly used variables for tree structure. */
4532 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4533 Zero means allow extended lvalues. */
4535 extern int pedantic_lvalues
;
4537 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4539 extern GTY(()) tree current_function_decl
;
4541 /* Nonzero means a FUNC_BEGIN label was emitted. */
4542 extern GTY(()) const char * current_function_func_begin_label
;
4544 /* Iterator for going through the function arguments. */
4546 tree fntype
; /* function type declaration */
4547 tree next
; /* TREE_LIST pointing to the next argument */
4548 } function_args_iterator
;
4550 /* Initialize the iterator I with arguments from function FNDECL */
4553 function_args_iter_init (function_args_iterator
*i
, tree fntype
)
4556 i
->next
= TYPE_ARG_TYPES (fntype
);
4559 /* Return a pointer that holds the next argument if there are more arguments to
4560 handle, otherwise return NULL. */
4562 static inline tree
*
4563 function_args_iter_cond_ptr (function_args_iterator
*i
)
4565 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4568 /* Return the next argument if there are more arguments to handle, otherwise
4572 function_args_iter_cond (function_args_iterator
*i
)
4574 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4577 /* Advance to the next argument. */
4579 function_args_iter_next (function_args_iterator
*i
)
4581 gcc_assert (i
->next
!= NULL_TREE
);
4582 i
->next
= TREE_CHAIN (i
->next
);
4585 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4588 inlined_function_outer_scope_p (const_tree block
)
4590 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
4593 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4594 to point to the next tree element. ITER is an instance of
4595 function_args_iterator used to iterate the arguments. */
4596 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4597 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4598 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4599 function_args_iter_next (&(ITER)))
4601 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4602 to the next tree element. ITER is an instance of function_args_iterator
4603 used to iterate the arguments. */
4604 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4605 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4606 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4607 function_args_iter_next (&(ITER)))
4612 extern unsigned crc32_string (unsigned, const char *);
4613 extern void clean_symbol_name (char *);
4614 extern tree
get_file_function_name (const char *);
4615 extern tree
get_callee_fndecl (const_tree
);
4616 extern int type_num_arguments (const_tree
);
4617 extern bool associative_tree_code (enum tree_code
);
4618 extern bool commutative_tree_code (enum tree_code
);
4619 extern tree
upper_bound_in_type (tree
, tree
);
4620 extern tree
lower_bound_in_type (tree
, tree
);
4621 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4622 extern tree
call_expr_arg (tree
, int);
4623 extern tree
*call_expr_argp (tree
, int);
4624 extern tree
call_expr_arglist (tree
);
4625 extern tree
create_artificial_label (void);
4626 extern const char *get_name (tree
);
4627 extern bool stdarg_p (tree
);
4628 extern bool prototype_p (tree
);
4629 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4630 extern tree
build_low_bits_mask (tree
, unsigned);
4633 extern void change_decl_assembler_name (tree
, tree
);
4636 extern tree
unshare_expr (tree
);
4640 extern void expand_expr_stmt (tree
);
4641 extern int warn_if_unused_value (const_tree
, location_t
);
4642 extern void expand_label (tree
);
4643 extern void expand_goto (tree
);
4645 extern rtx
expand_stack_save (void);
4646 extern void expand_stack_restore (tree
);
4647 extern void expand_return (tree
);
4650 extern void using_eh_for_cleanups (void);
4652 /* In fold-const.c */
4654 /* Non-zero if we are folding constants inside an initializer; zero
4656 extern int folding_initializer
;
4658 /* Convert between trees and native memory representation. */
4659 extern int native_encode_expr (const_tree
, unsigned char *, int);
4660 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4662 /* Fold constants as much as possible in an expression.
4663 Returns the simplified expression.
4664 Acts only on the top level of the expression;
4665 if the argument itself cannot be simplified, its
4666 subexpressions are not changed. */
4668 extern tree
fold (tree
);
4669 extern tree
fold_unary (enum tree_code
, tree
, tree
);
4670 extern tree
fold_unary_ignore_overflow (enum tree_code
, tree
, tree
);
4671 extern tree
fold_binary (enum tree_code
, tree
, tree
, tree
);
4672 extern tree
fold_ternary (enum tree_code
, tree
, tree
, tree
, tree
);
4673 extern tree
fold_build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4674 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4675 extern tree
fold_build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4676 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4677 extern tree
fold_build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4678 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4679 extern tree
fold_build1_initializer (enum tree_code
, tree
, tree
);
4680 extern tree
fold_build2_initializer (enum tree_code
, tree
, tree
, tree
);
4681 extern tree
fold_build3_initializer (enum tree_code
, tree
, tree
, tree
, tree
);
4682 extern tree
fold_build_call_array (tree
, tree
, int, tree
*);
4683 extern tree
fold_build_call_array_initializer (tree
, tree
, int, tree
*);
4684 extern bool fold_convertible_p (const_tree
, const_tree
);
4685 extern tree
fold_convert (tree
, tree
);
4686 extern tree
fold_single_bit_test (enum tree_code
, tree
, tree
, tree
);
4687 extern tree
fold_ignored_result (tree
);
4688 extern tree
fold_abs_const (tree
, tree
);
4689 extern tree
fold_indirect_ref_1 (tree
, tree
);
4690 extern void fold_defer_overflow_warnings (void);
4691 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4692 extern void fold_undefer_and_ignore_overflow_warnings (void);
4693 extern bool fold_deferring_overflow_warnings_p (void);
4695 extern tree
force_fit_type_double (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4698 extern int fit_double_type (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4699 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, const_tree
);
4700 extern int add_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4701 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4702 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4704 #define add_double(l1,h1,l2,h2,lv,hv) \
4705 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4706 extern int neg_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4707 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4708 extern int mul_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4709 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4710 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4712 #define mul_double(l1,h1,l2,h2,lv,hv) \
4713 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4714 extern void lshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4715 HOST_WIDE_INT
, unsigned int,
4716 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4717 extern void rshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4718 HOST_WIDE_INT
, unsigned int,
4719 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4720 extern void lrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4721 HOST_WIDE_INT
, unsigned int,
4722 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4723 extern void rrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4724 HOST_WIDE_INT
, unsigned int,
4725 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4727 extern int div_and_round_double (enum tree_code
, int, unsigned HOST_WIDE_INT
,
4728 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
4729 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
*,
4730 HOST_WIDE_INT
*, unsigned HOST_WIDE_INT
*,
4733 enum operand_equal_flag
4739 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4740 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4741 extern tree
omit_one_operand (tree
, tree
, tree
);
4742 extern tree
omit_two_operands (tree
, tree
, tree
, tree
);
4743 extern tree
invert_truthvalue (tree
);
4744 extern tree
fold_truth_not_expr (tree
);
4745 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4746 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4747 extern tree
fold_read_from_constant_string (tree
);
4748 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
, int);
4749 extern tree
build_fold_addr_expr (tree
);
4750 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4751 extern tree
fold_strip_sign_ops (tree
);
4752 extern tree
build_fold_addr_expr_with_type (tree
, tree
);
4753 extern tree
build_fold_indirect_ref (tree
);
4754 extern tree
fold_indirect_ref (tree
);
4755 extern tree
constant_boolean_node (int, tree
);
4756 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
4758 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4759 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4761 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4762 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4764 extern bool tree_expr_nonzero_p (tree
);
4765 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4766 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4768 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4769 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4770 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4771 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4773 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4774 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4775 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4777 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4779 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4780 extern tree
combine_comparisons (enum tree_code
, enum tree_code
,
4781 enum tree_code
, tree
, tree
, tree
);
4782 extern void debug_fold_checksum (const_tree
);
4784 /* Return nonzero if CODE is a tree code that represents a truth value. */
4786 truth_value_p (enum tree_code code
)
4788 return (TREE_CODE_CLASS (code
) == tcc_comparison
4789 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4790 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4791 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4796 extern tree
fold_call_expr (tree
, bool);
4797 extern tree
fold_builtin_fputs (tree
, tree
, bool, bool, tree
);
4798 extern tree
fold_builtin_strcpy (tree
, tree
, tree
, tree
);
4799 extern tree
fold_builtin_strncpy (tree
, tree
, tree
, tree
, tree
);
4800 extern tree
fold_builtin_memory_chk (tree
, tree
, tree
, tree
, tree
, tree
, bool,
4801 enum built_in_function
);
4802 extern tree
fold_builtin_stxcpy_chk (tree
, tree
, tree
, tree
, tree
, bool,
4803 enum built_in_function
);
4804 extern tree
fold_builtin_strncpy_chk (tree
, tree
, tree
, tree
, tree
);
4805 extern tree
fold_builtin_snprintf_chk (tree
, tree
, enum built_in_function
);
4806 extern bool fold_builtin_next_arg (tree
, bool);
4807 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4808 extern tree
build_function_call_expr (tree
, tree
);
4809 extern tree
fold_builtin_call_array (tree
, tree
, int, tree
*);
4810 extern tree
build_call_expr (tree
, int, ...);
4811 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4812 extern tree
c_strlen (tree
, int);
4813 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
4814 extern tree
build_va_arg_indirect_ref (tree
);
4815 extern tree
build_string_literal (int, const char *);
4816 extern bool validate_arglist (const_tree
, ...);
4817 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4818 extern int get_pointer_alignment (tree
, unsigned int);
4819 extern bool is_builtin_name (const char*);
4820 extern int get_object_alignment (tree
, unsigned int, unsigned int);
4821 extern tree
fold_call_stmt (gimple
, bool);
4822 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4825 extern tree
strip_float_extensions (tree
);
4828 extern int really_constant_p (const_tree
);
4829 extern bool decl_address_invariant_p (const_tree
);
4830 extern bool decl_address_ip_invariant_p (const_tree
);
4831 extern int int_fits_type_p (const_tree
, const_tree
);
4832 #ifndef GENERATOR_FILE
4833 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4835 extern bool variably_modified_type_p (tree
, tree
);
4836 extern int tree_log2 (const_tree
);
4837 extern int tree_floor_log2 (const_tree
);
4838 extern int simple_cst_equal (const_tree
, const_tree
);
4839 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4840 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4841 const_tree
, hashval_t
);
4842 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4843 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4844 extern int type_list_equal (const_tree
, const_tree
);
4845 extern int chain_member (const_tree
, const_tree
);
4846 extern tree
type_hash_lookup (unsigned int, tree
);
4847 extern void type_hash_add (unsigned int, tree
);
4848 extern int simple_cst_list_equal (const_tree
, const_tree
);
4849 extern void dump_tree_statistics (void);
4850 extern void recompute_tree_invariant_for_addr_expr (tree
);
4851 extern bool needs_to_live_in_memory (const_tree
);
4852 extern tree
reconstruct_complex_type (tree
, tree
);
4854 extern int real_onep (const_tree
);
4855 extern int real_twop (const_tree
);
4856 extern int real_minus_onep (const_tree
);
4857 extern void init_ttree (void);
4858 extern void build_common_tree_nodes (bool, bool);
4859 extern void build_common_tree_nodes_2 (int);
4860 extern void build_common_builtin_nodes (void);
4861 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4862 extern tree
build_range_type (tree
, tree
, tree
);
4863 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4865 extern bool fields_compatible_p (const_tree
, const_tree
);
4866 extern tree
find_compatible_field (tree
, tree
);
4868 extern void set_expr_locus (tree
, source_location
*);
4870 extern tree
*tree_block (tree
);
4871 extern location_t
*block_nonartificial_location (tree
);
4872 extern location_t
tree_nonartificial_location (tree
);
4874 extern tree
block_ultimate_origin (const_tree
);
4876 /* In tree-nested.c */
4877 extern tree
build_addr (tree
, tree
);
4880 extern void expand_main_function (void);
4881 extern void expand_function_end (void);
4882 extern void expand_function_start (tree
);
4883 extern void stack_protect_prologue (void);
4884 extern void stack_protect_epilogue (void);
4885 extern void init_dummy_function_start (void);
4886 extern void expand_dummy_function_end (void);
4887 extern unsigned int init_function_for_compilation (void);
4888 extern void allocate_struct_function (tree
, bool);
4889 extern void push_struct_function (tree fndecl
);
4890 extern void init_function_start (tree
);
4891 extern bool use_register_for_decl (const_tree
);
4892 extern void generate_setjmp_warnings (void);
4893 extern void init_temp_slots (void);
4894 extern void free_temp_slots (void);
4895 extern void pop_temp_slots (void);
4896 extern void push_temp_slots (void);
4897 extern void preserve_temp_slots (rtx
);
4898 extern int aggregate_value_p (const_tree
, const_tree
);
4899 extern void push_function_context (void);
4900 extern void pop_function_context (void);
4901 extern gimple_seq
gimplify_parameters (void);
4903 /* In print-rtl.c */
4905 extern void print_rtl (FILE *, const_rtx
);
4908 /* In print-tree.c */
4909 extern void debug_tree (tree
);
4911 extern void dump_addr (FILE*, const char *, const void *);
4912 extern void print_node (FILE *, const char *, tree
, int);
4913 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4914 extern void indent_to (FILE *, int);
4917 /* In tree-inline.c: */
4918 extern bool debug_find_tree (tree
, tree
);
4919 /* This is in tree-inline.c since the routine uses
4920 data structures from the inliner. */
4921 extern tree
unsave_expr_now (tree
);
4922 extern tree
build_duplicate_type (tree
);
4926 /* Nonzero if this is a call to a function whose return value depends
4927 solely on its arguments, has no side effects, and does not read
4928 global memory. This corresponds to TREE_READONLY for function
4930 #define ECF_CONST (1 << 0)
4931 /* Nonzero if this is a call to "pure" function (like const function,
4932 but may read memory. This corresponds to DECL_PURE_P for function
4934 #define ECF_PURE (1 << 1)
4935 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
4936 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
4937 for function decls.*/
4938 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
4939 /* Nonzero if this call will never return. */
4940 #define ECF_NORETURN (1 << 3)
4941 /* Nonzero if this is a call to malloc or a related function. */
4942 #define ECF_MALLOC (1 << 4)
4943 /* Nonzero if it is plausible that this is a call to alloca. */
4944 #define ECF_MAY_BE_ALLOCA (1 << 5)
4945 /* Nonzero if this is a call to a function that won't throw an exception. */
4946 #define ECF_NOTHROW (1 << 6)
4947 /* Nonzero if this is a call to setjmp or a related function. */
4948 #define ECF_RETURNS_TWICE (1 << 7)
4949 /* Nonzero if this call replaces the current stack frame. */
4950 #define ECF_SIBCALL (1 << 8)
4951 /* Function does not read or write memory (but may have side effects, so
4952 it does not necessarily fit ECF_CONST). */
4953 #define ECF_NOVOPS (1 << 9)
4955 extern int flags_from_decl_or_type (const_tree
);
4956 extern int call_expr_flags (const_tree
);
4958 extern int setjmp_call_p (const_tree
);
4959 extern bool gimple_alloca_call_p (const_gimple
);
4960 extern bool alloca_call_p (const_tree
);
4961 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4962 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4966 extern const struct attribute_spec
*lookup_attribute_spec (tree
);
4968 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4969 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4970 it should be modified in place; if a TYPE, a copy should be created
4971 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4972 information, in the form of a bitwise OR of flags in enum attribute_flags
4973 from tree.h. Depending on these flags, some attributes may be
4974 returned to be applied at a later stage (for example, to apply
4975 a decl attribute to the declaration rather than to its type). */
4976 extern tree
decl_attributes (tree
*, tree
, int);
4978 /* In integrate.c */
4979 extern void set_decl_abstract_flags (tree
, int);
4980 extern void set_decl_origin_self (tree
);
4982 /* In stor-layout.c */
4983 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
4984 extern void fixup_signed_type (tree
);
4985 extern void internal_reference_types (void);
4986 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4989 extern void make_decl_rtl (tree
);
4990 extern void make_decl_one_only (tree
);
4991 extern int supports_one_only (void);
4992 extern void resolve_unique_section (tree
, int, int);
4993 extern void mark_referenced (tree
);
4994 extern void mark_decl_referenced (tree
);
4995 extern void notice_global_symbol (tree
);
4996 extern void set_user_assembler_name (tree
, const char *);
4997 extern void process_pending_assemble_externals (void);
4998 extern void finish_aliases_1 (void);
4999 extern void finish_aliases_2 (void);
5000 extern tree
emutls_decl (tree
);
5003 extern void expand_computed_goto (tree
);
5004 extern bool parse_output_constraint (const char **, int, int, int,
5005 bool *, bool *, bool *);
5006 extern bool parse_input_constraint (const char **, int, int, int, int,
5007 const char * const *, bool *, bool *);
5008 extern void expand_asm_expr (tree
);
5009 extern tree
resolve_asm_operand_names (tree
, tree
, tree
);
5010 extern void expand_case (tree
);
5011 extern void expand_decl (tree
);
5013 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5014 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5018 /* In dwarf2out.c */
5019 /* Interface of the DWARF2 unwind info support. */
5021 /* Generate a new label for the CFI info to refer to. */
5023 extern char *dwarf2out_cfi_label (void);
5025 /* Entry point to update the canonical frame address (CFA). */
5027 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
5029 /* Add the CFI for saving a register window. */
5031 extern void dwarf2out_window_save (const char *);
5033 /* Add a CFI to update the running total of the size of arguments pushed
5036 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT
);
5038 /* Entry point for saving a register to the stack. */
5040 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
5042 /* Entry point for saving the return address in the stack. */
5044 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
5046 /* Entry point for saving the return address in a register. */
5048 extern void dwarf2out_return_reg (const char *, unsigned);
5050 /* Entry point for saving the first register into the second. */
5052 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
5054 /* In tree-inline.c */
5056 /* The type of a set of already-visited pointers. Functions for creating
5057 and manipulating it are declared in pointer-set.h */
5058 struct pointer_set_t
;
5060 /* The type of a callback function for walking over tree structure. */
5062 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5064 /* The type of a callback function that represents a custom walk_tree. */
5066 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5067 void *, struct pointer_set_t
*);
5069 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5071 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5073 #define walk_tree(a,b,c,d) \
5074 walk_tree_1 (a, b, c, d, NULL)
5075 #define walk_tree_without_duplicates(a,b,c) \
5076 walk_tree_without_duplicates_1 (a, b, c, NULL)
5079 /* Assign the RTX to declaration. */
5081 extern void set_decl_rtl (tree
, rtx
);
5082 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5084 /* Enum and arrays used for tree allocation stats.
5085 Keep in sync with tree.c:tree_node_kind_names. */
5109 extern int tree_node_counts
[];
5110 extern int tree_node_sizes
[];
5112 /* True if we are in gimple form and the actions of the folders need to
5113 be restricted. False if we are not in gimple form and folding is not
5114 restricted to creating gimple expressions. */
5115 extern bool in_gimple_form
;
5118 extern tree
get_base_address (tree t
);
5120 /* In tree-vectorizer.c. */
5121 extern void vect_set_verbosity_level (const char *);
5125 struct GTY(()) tree_map_base
{
5129 extern int tree_map_base_eq (const void *, const void *);
5130 extern unsigned int tree_map_base_hash (const void *);
5131 extern int tree_map_base_marked_p (const void *);
5132 extern bool list_equal_p (const_tree
, const_tree
);
5134 /* Map from a tree to another tree. */
5136 struct GTY(()) tree_map
{
5137 struct tree_map_base base
;
5142 #define tree_map_eq tree_map_base_eq
5143 extern unsigned int tree_map_hash (const void *);
5144 #define tree_map_marked_p tree_map_base_marked_p
5146 /* Map from a tree to an int. */
5148 struct GTY(()) tree_int_map
{
5149 struct tree_map_base base
;
5153 #define tree_int_map_eq tree_map_base_eq
5154 #define tree_int_map_hash tree_map_base_hash
5155 #define tree_int_map_marked_p tree_map_base_marked_p
5157 /* Map from a tree to initialization/finalization priorities. */
5159 struct GTY(()) tree_priority_map
{
5160 struct tree_map_base base
;
5165 #define tree_priority_map_eq tree_map_base_eq
5166 #define tree_priority_map_hash tree_map_base_hash
5167 #define tree_priority_map_marked_p tree_map_base_marked_p
5169 /* In tree-ssa-ccp.c */
5170 extern tree
maybe_fold_offset_to_reference (tree
, tree
, tree
);
5171 extern tree
maybe_fold_offset_to_address (tree
, tree
, tree
);
5172 extern tree
maybe_fold_stmt_addition (tree
, tree
, tree
);
5174 /* In tree-ssa-address.c. */
5175 extern tree
tree_mem_ref_addr (tree
, tree
);
5176 extern void copy_mem_ref_info (tree
, tree
);
5179 extern bool ssa_name_nonnegative_p (const_tree
);
5181 /* In tree-object-size.c. */
5182 extern void init_object_sizes (void);
5183 extern void fini_object_sizes (void);
5184 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5187 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5189 /* In tree-inline.c. */
5191 void init_inline_once (void);
5193 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5194 extern GTY(()) tree memory_identifier_string
;
5196 /* Compute the number of operands in an expression node NODE. For
5197 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5198 otherwise it is looked up from the node's code. */
5200 tree_operand_length (const_tree node
)
5202 if (VL_EXP_CLASS_P (node
))
5203 return VL_EXP_OPERAND_LENGTH (node
);
5205 return TREE_CODE_LENGTH (TREE_CODE (node
));
5208 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5209 have to go towards the end of tree.h so that union tree_node is fully
5210 defined by this point. */
5212 /* Structure containing iterator state. */
5213 typedef struct GTY (()) call_expr_arg_iterator_d
{
5214 tree t
; /* the call_expr */
5215 int n
; /* argument count */
5216 int i
; /* next argument index */
5217 } call_expr_arg_iterator
;
5219 typedef struct GTY (()) const_call_expr_arg_iterator_d
{
5220 const_tree t
; /* the call_expr */
5221 int n
; /* argument count */
5222 int i
; /* next argument index */
5223 } const_call_expr_arg_iterator
;
5225 /* Initialize the abstract argument list iterator object ITER with the
5226 arguments from CALL_EXPR node EXP. */
5228 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5231 iter
->n
= call_expr_nargs (exp
);
5236 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5239 iter
->n
= call_expr_nargs (exp
);
5243 /* Return the next argument from abstract argument list iterator object ITER,
5244 and advance its state. Return NULL_TREE if there are no more arguments. */
5246 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5249 if (iter
->i
>= iter
->n
)
5251 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5256 static inline const_tree
5257 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5260 if (iter
->i
>= iter
->n
)
5262 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5267 /* Initialize the abstract argument list iterator object ITER, then advance
5268 past and return the first argument. Useful in for expressions, e.g.
5269 for (arg = first_call_expr_arg (exp, &iter); arg;
5270 arg = next_call_expr_arg (&iter)) */
5272 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5274 init_call_expr_arg_iterator (exp
, iter
);
5275 return next_call_expr_arg (iter
);
5278 static inline const_tree
5279 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5281 init_const_call_expr_arg_iterator (exp
, iter
);
5282 return next_const_call_expr_arg (iter
);
5285 /* Test whether there are more arguments in abstract argument list iterator
5286 ITER, without changing its state. */
5288 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5290 return (iter
->i
< iter
->n
);
5294 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5296 return (iter
->i
< iter
->n
);
5299 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5300 (of type call_expr_arg_iterator) to hold the iteration state. */
5301 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5302 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5303 (arg) = next_call_expr_arg (&(iter)))
5305 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5306 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5307 (arg) = next_const_call_expr_arg (&(iter)))
5309 #endif /* GCC_TREE_H */