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);
186 /* We have to be able to tell cgraph about the needed-ness of the target
187 of an alias. This requires that the decl have been defined. Aliases
188 that precede their definition have to be queued for later processing. */
190 typedef struct GTY(()) alias_pair
196 /* Define gc'd vector type. */
197 DEF_VEC_O(alias_pair);
198 DEF_VEC_ALLOC_O(alias_pair,gc);
200 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
203 /* Classify which part of the compiler has defined a given builtin function.
204 Note that we assume below that this is no more than two bits. */
213 /* Names for the above. */
214 extern const char *const built_in_class_names[4];
216 /* Codes that identify the various built in functions
217 so that expand_call can identify them quickly. */
219 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
220 enum built_in_function
222 #include "builtins.def"
224 /* Complex division routines in libgcc. These are done via builtins
225 because emit_library_call_value can't handle complex values. */
226 BUILT_IN_COMPLEX_MUL_MIN,
227 BUILT_IN_COMPLEX_MUL_MAX
228 = BUILT_IN_COMPLEX_MUL_MIN
229 + MAX_MODE_COMPLEX_FLOAT
230 - MIN_MODE_COMPLEX_FLOAT,
232 BUILT_IN_COMPLEX_DIV_MIN,
233 BUILT_IN_COMPLEX_DIV_MAX
234 = BUILT_IN_COMPLEX_DIV_MIN
235 + MAX_MODE_COMPLEX_FLOAT
236 - MIN_MODE_COMPLEX_FLOAT,
238 /* Upper bound on non-language-specific builtins. */
243 /* Names for the above. */
244 extern const char * built_in_names[(int) END_BUILTINS];
246 /* Helper macros for math builtins. */
248 #define BUILTIN_EXP10_P(FN) \
249 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
250 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
252 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
253 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
254 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
256 #define BUILTIN_SQRT_P(FN) \
257 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
259 #define BUILTIN_CBRT_P(FN) \
260 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
262 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
264 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
265 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
266 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
268 /* An array of _DECL trees for the above. */
269 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
270 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
272 /* In an OMP_CLAUSE node. */
274 /* Number of operands and names for each clause. */
275 extern unsigned const char omp_clause_num_ops[];
276 extern const char * const omp_clause_code_name[];
278 /* Clause codes. Do not reorder, as this is used to index into the tables
279 omp_clause_num_ops and omp_clause_code_name. */
282 /* Clause zero is special-cased inside the parser
283 (c_parser_omp_variable_list). */
284 OMP_CLAUSE_ERROR = 0,
286 /* OpenMP clause: private (variable_list). */
289 /* OpenMP clause: shared (variable_list). */
292 /* OpenMP clause: firstprivate (variable_list). */
293 OMP_CLAUSE_FIRSTPRIVATE,
295 /* OpenMP clause: lastprivate (variable_list). */
296 OMP_CLAUSE_LASTPRIVATE,
298 /* OpenMP clause: reduction (operator:variable_list).
299 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
300 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
301 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
303 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
304 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
305 OMP_CLAUSE_REDUCTION,
307 /* OpenMP clause: copyin (variable_list). */
310 /* OpenMP clause: copyprivate (variable_list). */
311 OMP_CLAUSE_COPYPRIVATE,
313 /* OpenMP clause: if (scalar-expression). */
316 /* OpenMP clause: num_threads (integer-expression). */
317 OMP_CLAUSE_NUM_THREADS,
319 /* OpenMP clause: schedule. */
322 /* OpenMP clause: nowait. */
325 /* OpenMP clause: ordered. */
328 /* OpenMP clause: default. */
331 /* OpenMP clause: collapse (constant-integer-expression). */
334 /* OpenMP clause: untied. */
338 /* The definition of tree nodes fills the next several pages. */
340 /* A tree node can represent a data type, a variable, an expression
341 or a statement. Each node has a TREE_CODE which says what kind of
342 thing it represents. Some common codes are:
343 INTEGER_TYPE -- represents a type of integers.
344 ARRAY_TYPE -- represents a type of pointer.
345 VAR_DECL -- represents a declared variable.
346 INTEGER_CST -- represents a constant integer value.
347 PLUS_EXPR -- represents a sum (an expression).
349 As for the contents of a tree node: there are some fields
350 that all nodes share. Each TREE_CODE has various special-purpose
351 fields as well. The fields of a node are never accessed directly,
352 always through accessor macros. */
354 /* Every kind of tree node starts with this structure,
355 so all nodes have these fields.
357 See the accessor macros, defined below, for documentation of the
361 struct GTY(()) tree_base {
362 ENUM_BITFIELD(tree_code) code : 16;
364 unsigned side_effects_flag : 1;
365 unsigned constant_flag : 1;
366 unsigned addressable_flag : 1;
367 unsigned volatile_flag : 1;
368 unsigned readonly_flag : 1;
369 unsigned unsigned_flag : 1;
370 unsigned asm_written_flag: 1;
371 unsigned nowarning_flag : 1;
373 unsigned used_flag : 1;
374 unsigned nothrow_flag : 1;
375 unsigned static_flag : 1;
376 unsigned public_flag : 1;
377 unsigned private_flag : 1;
378 unsigned protected_flag : 1;
379 unsigned deprecated_flag : 1;
380 unsigned saturating_flag : 1;
382 unsigned default_def_flag : 1;
383 unsigned lang_flag_0 : 1;
384 unsigned lang_flag_1 : 1;
385 unsigned lang_flag_2 : 1;
386 unsigned lang_flag_3 : 1;
387 unsigned lang_flag_4 : 1;
388 unsigned lang_flag_5 : 1;
389 unsigned lang_flag_6 : 1;
391 unsigned visited : 1;
392 unsigned packed_flag : 1;
393 unsigned user_align : 1;
397 union tree_ann_d *ann;
400 struct GTY(()) tree_common {
401 struct tree_base base;
406 /* The following table lists the uses of each of the above flags and
407 for which types of nodes they are defined.
412 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
414 CONSTRUCTOR, IDENTIFIER_NODE
415 STMT_EXPR, it means we want the result of the enclosed expression
417 CALL_EXPR_TAILCALL in
426 VAR_DECL, FUNCTION_DECL
429 TREE_NO_TRAMPOLINE in
435 TREE_SYMBOL_REFERENCED in
439 TARGET_EXPR, WITH_CLEANUP_EXPR
441 TRY_CATCH_IS_CLEANUP in
447 EH_FILTER_MUST_NOT_THROW in
450 TYPE_REF_CAN_ALIAS_ALL in
451 POINTER_TYPE, REFERENCE_TYPE
459 CALL_CANNOT_INLINE_P in
465 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
468 VAR_DECL, FUNCTION_DECL
474 CALL_EXPR_VA_ARG_PACK in
477 TYPE_CACHED_VALUES_P in
480 SAVE_EXPR_RESOLVED_P in
483 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
484 OMP_CLAUSE_LASTPRIVATE
486 OMP_CLAUSE_PRIVATE_DEBUG in
494 CALL_EXPR_RETURN_SLOT_OPT in
500 OMP_PARALLEL_COMBINED in
502 OMP_CLAUSE_PRIVATE_OUTER_REF in
526 TREE_THIS_VOLATILE in
549 TYPE_SIZES_GIMPLIFIED in
560 REGISTER_DEFS_IN_THIS_STMT in
561 all expressions (tree-into-ssa.c)
566 VAR_DECL, FUNCTION_DECL
567 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
568 BLOCK, SSA_NAME, STRING_CST
571 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
590 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
598 IDENTIFIER_TRANSPARENT_ALIAS in
601 STMT_IN_SSA_EDGE_WORKLIST in
602 all expressions (tree-ssa-propagate.c)
607 all trees (used liberally by many passes)
622 TYPE_VECTOR_OPAQUE in
625 SSA_NAME_IS_DEFAULT_DEF in
630 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
631 enum tree_node_structure_enum {
632 #include "treestruct.def"
637 /* Define accessors for the fields that all tree nodes have
638 (though some fields are not used for all kinds of nodes). */
640 /* The tree-code says what kind of node it is.
641 Codes are defined in tree.def. */
642 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
643 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
645 /* When checking is enabled, errors will be generated if a tree node
646 is accessed incorrectly. The macros die with a fatal error. */
647 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
649 #define TREE_CHECK(T, CODE) __extension__ \
650 ({ __typeof (T) const __t = (T); \
651 if (TREE_CODE (__t) != (CODE)) \
652 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
656 #define TREE_NOT_CHECK(T, CODE) __extension__ \
657 ({ __typeof (T) const __t = (T); \
658 if (TREE_CODE (__t) == (CODE)) \
659 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
663 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
664 ({ __typeof (T) const __t = (T); \
665 if (TREE_CODE (__t) != (CODE1) \
666 && TREE_CODE (__t) != (CODE2)) \
667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
668 (CODE1), (CODE2), 0); \
671 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
672 ({ __typeof (T) const __t = (T); \
673 if (TREE_CODE (__t) == (CODE1) \
674 || TREE_CODE (__t) == (CODE2)) \
675 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
676 (CODE1), (CODE2), 0); \
679 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
680 ({ __typeof (T) const __t = (T); \
681 if (TREE_CODE (__t) != (CODE1) \
682 && TREE_CODE (__t) != (CODE2) \
683 && TREE_CODE (__t) != (CODE3)) \
684 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
685 (CODE1), (CODE2), (CODE3), 0); \
688 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __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_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
694 (CODE1), (CODE2), (CODE3), 0); \
697 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
698 ({ __typeof (T) const __t = (T); \
699 if (TREE_CODE (__t) != (CODE1) \
700 && TREE_CODE (__t) != (CODE2) \
701 && TREE_CODE (__t) != (CODE3) \
702 && TREE_CODE (__t) != (CODE4)) \
703 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
704 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
707 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
708 ({ __typeof (T) const __t = (T); \
709 if (TREE_CODE (__t) == (CODE1) \
710 || TREE_CODE (__t) == (CODE2) \
711 || TREE_CODE (__t) == (CODE3) \
712 || TREE_CODE (__t) == (CODE4)) \
713 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
714 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
717 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
718 ({ __typeof (T) const __t = (T); \
719 if (TREE_CODE (__t) != (CODE1) \
720 && TREE_CODE (__t) != (CODE2) \
721 && TREE_CODE (__t) != (CODE3) \
722 && TREE_CODE (__t) != (CODE4) \
723 && TREE_CODE (__t) != (CODE5)) \
724 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
725 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
728 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
729 ({ __typeof (T) const __t = (T); \
730 if (TREE_CODE (__t) == (CODE1) \
731 || TREE_CODE (__t) == (CODE2) \
732 || TREE_CODE (__t) == (CODE3) \
733 || TREE_CODE (__t) == (CODE4) \
734 || TREE_CODE (__t) == (CODE5)) \
735 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
736 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
739 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
740 ({ __typeof (T) const __t = (T); \
741 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
742 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
746 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
747 ({ __typeof (T) const __t = (T); \
748 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
749 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
753 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
754 ({ __typeof (T) const __t = (T); \
755 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
756 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
760 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
761 ({ __typeof (T) const __t = (T); \
762 if (TREE_CODE (__t) != OMP_CLAUSE) \
763 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
765 if (__t->omp_clause.code != (CODE)) \
766 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
770 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
771 ({ __typeof (T) const __t = (T); \
772 if (TREE_CODE (__t) != OMP_CLAUSE) \
773 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
775 if ((int) __t->omp_clause.code < (int) (CODE1) \
776 || (int) __t->omp_clause.code > (int) (CODE2)) \
777 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
778 __FUNCTION__, (CODE1), (CODE2)); \
781 /* These checks have to be special cased. */
782 #define EXPR_CHECK(T) __extension__ \
783 ({ __typeof (T) const __t = (T); \
784 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
785 if (!IS_EXPR_CODE_CLASS (__c)) \
786 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
790 /* These checks have to be special cased. */
791 #define NON_TYPE_CHECK(T) __extension__ \
792 ({ __typeof (T) const __t = (T); \
794 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
798 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
799 (*({__typeof (T) const __t = (T); \
800 const int __i = (I); \
801 if (TREE_CODE (__t) != TREE_VEC) \
802 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
804 if (__i < 0 || __i >= __t->vec.length) \
805 tree_vec_elt_check_failed (__i, __t->vec.length, \
806 __FILE__, __LINE__, __FUNCTION__); \
807 &__t->vec.a[__i]; }))
809 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
810 (*({__typeof (T) const __t = (T); \
811 const int __i = (I); \
812 if (TREE_CODE (__t) != OMP_CLAUSE) \
813 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
815 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
816 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
818 &__t->omp_clause.ops[__i]; }))
820 /* Special checks for TREE_OPERANDs. */
821 #define TREE_OPERAND_CHECK(T, I) __extension__ \
822 (*({__typeof (T) const __t = EXPR_CHECK (T); \
823 const int __i = (I); \
824 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
825 tree_operand_check_failed (__i, __t, \
826 __FILE__, __LINE__, __FUNCTION__); \
827 &__t->exp.operands[__i]; }))
829 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
830 (*({__typeof (T) const __t = (T); \
831 const int __i = (I); \
832 if (TREE_CODE (__t) != CODE) \
833 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
834 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
835 tree_operand_check_failed (__i, __t, \
836 __FILE__, __LINE__, __FUNCTION__); \
837 &__t->exp.operands[__i]; }))
839 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
841 ({__typeof (T) const __t = (T); \
842 const int __i = (I); \
843 if (TREE_CODE (__t) != (CODE)) \
844 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
845 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
846 tree_operand_check_failed (__i, __t, \
847 __FILE__, __LINE__, __FUNCTION__); \
848 &__t->exp.operands[__i]; }))
850 /* Nodes are chained together for many purposes.
851 Types are chained together to record them for being output to the debugger
852 (see the function `chain_type').
853 Decls in the same scope are chained together to record the contents
855 Statement nodes for successive statements used to be chained together.
856 Often lists of things are represented by TREE_LIST nodes that
857 are chained together. */
859 #define TREE_CHAIN(NODE) __extension__ \
860 (*({__typeof (NODE) const __t = (NODE); \
861 &__t->common.chain; }))
863 /* In all nodes that are expressions, this is the data type of the expression.
864 In POINTER_TYPE nodes, this is the type that the pointer points to.
865 In ARRAY_TYPE nodes, this is the type of the elements.
866 In VECTOR_TYPE nodes, this is the type of the elements. */
867 #define TREE_TYPE(NODE) __extension__ \
868 (*({__typeof (NODE) const __t = (NODE); \
869 &__t->common.type; }))
871 extern void tree_contains_struct_check_failed (const_tree,
872 const enum tree_node_structure_enum,
873 const char *, int, const char *)
876 extern void tree_check_failed (const_tree, const char *, int, const char *,
877 ...) ATTRIBUTE_NORETURN;
878 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
879 ...) ATTRIBUTE_NORETURN;
880 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
881 const char *, int, const char *)
883 extern void tree_range_check_failed (const_tree, const char *, int,
884 const char *, enum tree_code,
886 extern void tree_not_class_check_failed (const_tree,
887 const enum tree_code_class,
888 const char *, int, const char *)
890 extern void tree_vec_elt_check_failed (int, int, const char *,
893 extern void phi_node_elt_check_failed (int, int, const char *,
896 extern void tree_operand_check_failed (int, const_tree,
897 const char *, int, const char *)
899 extern void omp_clause_check_failed (const_tree, const char *, int,
900 const char *, enum omp_clause_code)
902 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
905 extern void omp_clause_range_check_failed (const_tree, const char *, int,
906 const char *, enum omp_clause_code,
907 enum omp_clause_code)
910 #else /* not ENABLE_TREE_CHECKING, or not gcc */
912 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
913 #define TREE_CHECK(T, CODE) (T)
914 #define TREE_NOT_CHECK(T, CODE) (T)
915 #define TREE_CHECK2(T, CODE1, CODE2) (T)
916 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
917 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
918 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
919 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
920 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
921 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
922 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
923 #define TREE_CLASS_CHECK(T, CODE) (T)
924 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
925 #define EXPR_CHECK(T) (T)
926 #define NON_TYPE_CHECK(T) (T)
927 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
928 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
929 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
930 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
931 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
932 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
933 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
935 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
936 #define TREE_TYPE(NODE) ((NODE)->common.type)
940 #define TREE_BLOCK(NODE) *(tree_block (NODE))
942 #include "tree-check.h"
944 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
945 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
946 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
947 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
948 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
949 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
950 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
951 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
952 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
953 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
954 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
956 #define RECORD_OR_UNION_CHECK(T) \
957 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
958 #define NOT_RECORD_OR_UNION_CHECK(T) \
959 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
961 #define NUMERICAL_TYPE_CHECK(T) \
962 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
965 /* Here is how primitive or already-canonicalized types' hash codes
967 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
969 /* A simple hash function for an arbitrary tree node. This must not be
970 used in hash tables which are saved to a PCH. */
971 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
973 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
974 #define CONVERT_EXPR_CODE_P(CODE) \
975 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
977 /* Similarly, but accept an expressions instead of a tree code. */
978 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
980 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
982 #define CASE_CONVERT \
986 /* Given an expression as a tree, strip any conversion that generates
987 no instruction. Accepts both tree and const_tree arguments since
988 we are not modifying the tree itself. */
990 #define STRIP_NOPS(EXP) \
991 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
993 /* Like STRIP_NOPS, but don't let the signedness change either. */
995 #define STRIP_SIGN_NOPS(EXP) \
996 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
998 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1000 #define STRIP_TYPE_NOPS(EXP) \
1001 while ((CONVERT_EXPR_P (EXP) \
1002 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1003 && TREE_OPERAND (EXP, 0) != error_mark_node \
1004 && (TREE_TYPE (EXP) \
1005 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1006 (EXP) = TREE_OPERAND (EXP, 0)
1008 /* Remove unnecessary type conversions according to
1009 tree_ssa_useless_type_conversion. */
1011 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1012 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1014 /* Nonzero if TYPE represents an integral type. Note that we do not
1015 include COMPLEX types here. Keep these checks in ascending code
1018 #define INTEGRAL_TYPE_P(TYPE) \
1019 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1020 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1021 || TREE_CODE (TYPE) == INTEGER_TYPE)
1023 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1025 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1026 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1028 /* Nonzero if TYPE represents a saturating fixed-point type. */
1030 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1031 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1033 /* Nonzero if TYPE represents a fixed-point type. */
1035 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1037 /* Nonzero if TYPE represents a scalar floating-point type. */
1039 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1041 /* Nonzero if TYPE represents a complex floating-point type. */
1043 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1044 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1045 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1047 /* Nonzero if TYPE represents a vector floating-point type. */
1049 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1050 (TREE_CODE (TYPE) == VECTOR_TYPE \
1051 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1053 /* Nonzero if TYPE represents a floating-point type, including complex
1054 and vector floating-point types. The vector and complex check does
1055 not use the previous two macros to enable early folding. */
1057 #define FLOAT_TYPE_P(TYPE) \
1058 (SCALAR_FLOAT_TYPE_P (TYPE) \
1059 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1060 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1061 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1063 /* Nonzero if TYPE represents a decimal floating-point type. */
1064 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1065 (SCALAR_FLOAT_TYPE_P (TYPE) \
1066 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1068 /* Nonzero if TYPE is a record or union type. */
1069 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1070 (TREE_CODE (TYPE) == RECORD_TYPE \
1071 || TREE_CODE (TYPE) == UNION_TYPE \
1072 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1074 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1075 Keep these checks in ascending code order. */
1077 #define AGGREGATE_TYPE_P(TYPE) \
1078 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1080 /* Nonzero if TYPE represents a pointer or reference type.
1081 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1082 ascending code order. */
1084 #define POINTER_TYPE_P(TYPE) \
1085 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1087 /* Nonzero if this type is a complete type. */
1088 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1090 /* Nonzero if this type is the (possibly qualified) void type. */
1091 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1093 /* Nonzero if this type is complete or is cv void. */
1094 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1095 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1097 /* Nonzero if this type is complete or is an array with unspecified bound. */
1098 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1099 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1102 /* Define many boolean fields that all tree nodes have. */
1104 /* In VAR_DECL nodes, nonzero means address of this is needed.
1105 So it cannot be in a register.
1106 In a FUNCTION_DECL, nonzero means its address is needed.
1107 So it must be compiled even if it is an inline function.
1108 In a FIELD_DECL node, it means that the programmer is permitted to
1109 construct the address of this field. This is used for aliasing
1110 purposes: see record_component_aliases.
1111 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1112 In LABEL_DECL nodes, it means a goto for this label has been seen
1113 from a place outside all binding contours that restore stack levels.
1114 In ..._TYPE nodes, it means that objects of this type must
1115 be fully addressable. This means that pieces of this
1116 object cannot go into register parameters, for example.
1117 In IDENTIFIER_NODEs, this means that some extern decl for this name
1118 had its address taken. That matters for inline functions. */
1119 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1121 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1122 exit of a function. Calls for which this is true are candidates for tail
1123 call optimizations. */
1124 #define CALL_EXPR_TAILCALL(NODE) \
1125 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1127 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1128 CASE_LOW operand has been processed. */
1129 #define CASE_LOW_SEEN(NODE) \
1130 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1132 #define PREDICT_EXPR_OUTCOME(NODE) \
1133 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1134 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1135 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1136 #define PREDICT_EXPR_PREDICTOR(NODE) \
1137 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1139 /* In a VAR_DECL, nonzero means allocate static storage.
1140 In a FUNCTION_DECL, nonzero if function has been defined.
1141 In a CONSTRUCTOR, nonzero means allocate static storage. */
1142 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1144 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1145 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1147 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1148 should only be executed if an exception is thrown, not on normal exit
1150 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1152 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1153 separate cleanup in honor_protect_cleanup_actions. */
1154 #define TRY_CATCH_IS_CLEANUP(NODE) \
1155 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1157 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1158 CASE_HIGH operand has been processed. */
1159 #define CASE_HIGH_SEEN(NODE) \
1160 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1162 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1163 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1165 /* In an expr node (usually a conversion) this means the node was made
1166 implicitly and should not lead to any sort of warning. In a decl node,
1167 warnings concerning the decl should be suppressed. This is used at
1168 least for used-before-set warnings, and it set after one warning is
1170 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1172 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1173 this string as an argument. */
1174 #define TREE_SYMBOL_REFERENCED(NODE) \
1175 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1177 /* Nonzero in a pointer or reference type means the data pointed to
1178 by this type can alias anything. */
1179 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1180 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1182 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1183 #define MOVE_NONTEMPORAL(NODE) \
1184 (EXPR_CHECK (NODE)->base.static_flag)
1186 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1187 there was an overflow in folding. */
1189 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1191 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1193 #define TREE_OVERFLOW_P(EXPR) \
1194 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1196 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1197 nonzero means name is to be accessible from outside this translation unit.
1198 In an IDENTIFIER_NODE, nonzero means an external declaration
1199 accessible from outside this translation unit was previously seen
1200 for this name in an inner scope. */
1201 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1203 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1204 of cached values, or is something else. */
1205 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1207 /* In a SAVE_EXPR, indicates that the original expression has already
1208 been substituted with a VAR_DECL that contains the value. */
1209 #define SAVE_EXPR_RESOLVED_P(NODE) \
1210 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1212 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1214 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1215 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1217 /* In any expression, decl, or constant, nonzero means it has side effects or
1218 reevaluation of the whole expression could produce a different value.
1219 This is set if any subexpression is a function call, a side effect or a
1220 reference to a volatile variable. In a ..._DECL, this is set only if the
1221 declaration said `volatile'. This will never be set for a constant. */
1222 #define TREE_SIDE_EFFECTS(NODE) \
1223 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1225 /* In a LABEL_DECL, nonzero means this label had its address taken
1226 and therefore can never be deleted and is a jump target for
1228 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1230 /* Nonzero means this expression is volatile in the C sense:
1231 its address should be of type `volatile WHATEVER *'.
1232 In other words, the declared item is volatile qualified.
1233 This is used in _DECL nodes and _REF nodes.
1234 On a FUNCTION_DECL node, this means the function does not
1235 return normally. This is the same effect as setting
1236 the attribute noreturn on the function in C.
1238 In a ..._TYPE node, means this type is volatile-qualified.
1239 But use TYPE_VOLATILE instead of this macro when the node is a type,
1240 because eventually we may make that a different bit.
1242 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1243 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1245 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1246 accessing the memory pointed to won't generate a trap. However,
1247 this only applies to an object when used appropriately: it doesn't
1248 mean that writing a READONLY mem won't trap. Similarly for
1249 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1251 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1252 (or slice of the array) always belongs to the range of the array.
1253 I.e. that the access will not trap, provided that the access to
1254 the base to the array will not trap. */
1255 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1257 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1258 nonzero means it may not be the lhs of an assignment.
1259 Nonzero in a FUNCTION_DECL means this function should be treated
1260 as "const" function (can only read its arguments). */
1261 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1263 /* Value of expression is constant. Always on in all ..._CST nodes. May
1264 also appear in an expression or decl where the value is constant. */
1265 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1267 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1268 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1269 (TYPE_CHECK (NODE)->base.constant_flag)
1271 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1272 #define DECL_UNSIGNED(NODE) \
1273 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1275 /* In integral and pointer types, means an unsigned type. */
1276 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1278 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1279 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1280 This is interesting in an inline function, since it might not need
1281 to be compiled separately.
1282 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1283 if the debugging info for the type has been written.
1284 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1285 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1287 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1289 /* Nonzero in a _DECL if the name is used in its scope.
1290 Nonzero in an expr node means inhibit warning if value is unused.
1291 In IDENTIFIER_NODEs, this means that some extern decl for this name
1293 In a BLOCK, this means that the block contains variables that are used. */
1294 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1296 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1297 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1298 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1300 /* In a CALL_EXPR, means that it's safe to use the target of the call
1301 expansion as the return slot for a call that returns in memory. */
1302 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1303 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1305 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1306 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1308 #define DECL_BY_REFERENCE(NODE) \
1309 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1310 RESULT_DECL)->decl_common.decl_by_reference_flag)
1312 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1313 thunked-to function. */
1314 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1316 /* In a type, nonzero means that all objects of the type are guaranteed by the
1317 language or front-end to be properly aligned, so we can indicate that a MEM
1318 of this type is aligned at least to the alignment of the type, even if it
1319 doesn't appear that it is. We see this, for example, in object-oriented
1320 languages where a tag field may show this is an object of a more-aligned
1321 variant of the more generic type.
1323 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1325 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1327 /* Used in classes in C++. */
1328 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1329 /* Used in classes in C++. */
1330 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1332 /* Nonzero in a _DECL if the use of the name is defined as a
1333 deprecated feature by __attribute__((deprecated)). */
1334 #define TREE_DEPRECATED(NODE) \
1335 ((NODE)->base.deprecated_flag)
1337 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1338 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1339 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1340 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1342 /* In fixed-point types, means a saturating type. */
1343 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1345 /* These flags are available for each language front end to use internally. */
1346 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1347 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1348 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1349 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1350 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1351 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1352 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1354 /* Define additional fields and accessors for nodes representing constants. */
1356 /* In an INTEGER_CST node. These two together make a 2-word integer.
1357 If the data type is signed, the value is sign-extended to 2 words
1358 even though not all of them may really be in use.
1359 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1360 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1361 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1362 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1364 #define INT_CST_LT(A, B) \
1365 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1366 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1367 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1369 #define INT_CST_LT_UNSIGNED(A, B) \
1370 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1371 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1372 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1373 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1374 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1376 struct GTY(()) tree_int_cst {
1377 struct tree_common common;
1381 /* In a REAL_CST node. struct real_value is an opaque entity, with
1382 manipulators defined in real.h. We don't want tree.h depending on
1383 real.h and transitively on tm.h. */
1386 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1387 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1389 struct GTY(()) tree_real_cst {
1390 struct tree_common common;
1391 struct real_value * real_cst_ptr;
1394 /* In a FIXED_CST node. */
1397 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1398 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1400 struct GTY(()) tree_fixed_cst {
1401 struct tree_common common;
1402 struct fixed_value * fixed_cst_ptr;
1405 /* In a STRING_CST */
1406 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1407 #define TREE_STRING_POINTER(NODE) \
1408 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1410 struct GTY(()) tree_string {
1411 struct tree_common common;
1416 /* In a COMPLEX_CST node. */
1417 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1418 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1420 struct GTY(()) tree_complex {
1421 struct tree_common common;
1426 /* In a VECTOR_CST node. */
1427 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1429 struct GTY(()) tree_vector {
1430 struct tree_common common;
1436 /* Define fields and accessors for some special-purpose tree nodes. */
1438 #define IDENTIFIER_LENGTH(NODE) \
1439 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1440 #define IDENTIFIER_POINTER(NODE) \
1441 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1442 #define IDENTIFIER_HASH_VALUE(NODE) \
1443 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1445 /* Translate a hash table identifier pointer to a tree_identifier
1446 pointer, and vice versa. */
1448 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1449 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1450 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1452 struct GTY(()) tree_identifier {
1453 struct tree_common common;
1454 struct ht_identifier id;
1457 /* In a TREE_LIST node. */
1458 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1459 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1461 struct GTY(()) tree_list {
1462 struct tree_common common;
1467 /* In a TREE_VEC node. */
1468 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1469 #define TREE_VEC_END(NODE) \
1470 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1472 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1474 struct GTY(()) tree_vec {
1475 struct tree_common common;
1477 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1480 /* In a CONSTRUCTOR node. */
1481 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1482 #define CONSTRUCTOR_ELT(NODE,IDX) \
1483 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1484 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1486 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1487 value of each element (stored within VAL). IX must be a scratch variable
1488 of unsigned integer type. */
1489 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1490 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1492 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1496 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1497 the value of each element (stored within VAL) and its index (stored
1498 within INDEX). IX must be a scratch variable of unsigned integer type. */
1499 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1500 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1502 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1503 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1507 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1508 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1510 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1511 _ce___->index = INDEX; \
1512 _ce___->value = VALUE; \
1515 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1516 constructor output purposes. */
1517 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1518 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1520 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1521 element. INDEX can optionally design the position of VALUE: in arrays,
1522 it is the index where VALUE has to be placed; in structures, it is the
1523 FIELD_DECL of the member. */
1524 typedef struct GTY(()) constructor_elt_d {
1529 DEF_VEC_O(constructor_elt);
1530 DEF_VEC_ALLOC_O(constructor_elt,gc);
1532 struct GTY(()) tree_constructor {
1533 struct tree_common common;
1534 VEC(constructor_elt,gc) *elts;
1537 /* Define fields and accessors for some nodes that represent expressions. */
1539 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1540 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1541 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1542 && integer_zerop (TREE_OPERAND (NODE, 0)))
1544 /* In ordinary expression nodes. */
1545 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1546 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1548 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1549 length. Its value includes the length operand itself; that is,
1550 the minimum valid length is 1.
1551 Note that we have to bypass the use of TREE_OPERAND to access
1552 that field to avoid infinite recursion in expanding the macros. */
1553 #define VL_EXP_OPERAND_LENGTH(NODE) \
1554 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1556 /* Nonzero if is_gimple_debug() may possibly hold. */
1557 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1559 /* In a LOOP_EXPR node. */
1560 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1562 /* The source location of this expression. Non-tree_exp nodes such as
1563 decls and constants can be shared among multiple locations, so
1565 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1566 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1567 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1568 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1569 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1571 /* True if a tree is an expression or statement that can have a
1573 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1575 extern void protected_set_expr_location (tree, location_t);
1577 /* In a TARGET_EXPR node. */
1578 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1579 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1580 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1582 /* DECL_EXPR accessor. This gives access to the DECL associated with
1583 the given declaration statement. */
1584 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1586 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1588 /* COMPOUND_LITERAL_EXPR accessors. */
1589 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1590 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1591 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1592 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1594 /* SWITCH_EXPR accessors. These give access to the condition, body and
1595 original condition type (before any compiler conversions)
1596 of the switch statement, respectively. */
1597 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1598 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1599 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1601 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1602 of a case label, respectively. */
1603 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1604 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1605 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1607 /* The operands of a TARGET_MEM_REF. */
1608 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1609 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1610 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1611 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1612 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1613 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1615 /* The operands of a BIND_EXPR. */
1616 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1617 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1618 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1620 /* GOTO_EXPR accessor. This gives access to the label associated with
1621 a goto statement. */
1622 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1624 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1625 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1626 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1628 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1629 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1630 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1631 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1632 /* Nonzero if we want to create an ASM_INPUT instead of an
1633 ASM_OPERAND with no operands. */
1634 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1635 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1637 /* COND_EXPR accessors. */
1638 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1639 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1640 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1642 /* Accessors for the chains of recurrences. */
1643 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1644 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1645 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1646 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1648 /* LABEL_EXPR accessor. This gives access to the label associated with
1649 the given label expression. */
1650 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1652 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1653 accessors for SSA operands. */
1655 /* CATCH_EXPR accessors. */
1656 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1657 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1659 /* EH_FILTER_EXPR accessors. */
1660 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1661 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1662 #define EH_FILTER_MUST_NOT_THROW(NODE) \
1663 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
1665 /* OBJ_TYPE_REF accessors. */
1666 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1667 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1668 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1670 /* ASSERT_EXPR accessors. */
1671 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1672 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1674 /* CALL_EXPR accessors.
1676 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1677 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1678 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1679 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1680 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1682 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1683 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1684 the argument count is zero when checking is enabled. Instead, do
1685 the pointer arithmetic to advance past the 3 fixed operands in a
1686 CALL_EXPR. That produces a valid pointer to just past the end of the
1687 operand array, even if it's not valid to dereference it. */
1688 #define CALL_EXPR_ARGP(NODE) \
1689 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1691 /* OpenMP directive and clause accessors. */
1693 #define OMP_BODY(NODE) \
1694 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1695 #define OMP_CLAUSES(NODE) \
1696 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1698 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1699 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1701 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1702 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1704 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1705 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1706 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1708 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1709 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1710 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1711 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1712 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1713 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1715 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1716 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1718 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1720 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1721 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1723 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1725 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1727 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1728 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1730 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1731 #define OMP_CLAUSE_DECL(NODE) \
1732 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1733 OMP_CLAUSE_PRIVATE, \
1734 OMP_CLAUSE_COPYPRIVATE), 0)
1735 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1736 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1737 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1739 /* True on an OMP_SECTION statement that was the last lexical member.
1740 This status is meaningful in the implementation of lastprivate. */
1741 #define OMP_SECTION_LAST(NODE) \
1742 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1744 /* True on an OMP_PARALLEL statement if it represents an explicit
1745 combined parallel work-sharing constructs. */
1746 #define OMP_PARALLEL_COMBINED(NODE) \
1747 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1749 /* True on a PRIVATE clause if its decl is kept around for debugging
1750 information only and its DECL_VALUE_EXPR is supposed to point
1751 to what it has been remapped to. */
1752 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1753 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1755 /* True on a PRIVATE clause if ctor needs access to outer region's
1757 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1758 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1760 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1761 decl is present in the chain. */
1762 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1763 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1764 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1765 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1766 OMP_CLAUSE_LASTPRIVATE),\
1768 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1769 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1771 #define OMP_CLAUSE_IF_EXPR(NODE) \
1772 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1773 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1774 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1775 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1776 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1778 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1779 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1780 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1781 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1782 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1783 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1785 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1786 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1787 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1788 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1789 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1790 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1791 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1792 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1793 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1794 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1795 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1796 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1798 enum omp_clause_schedule_kind
1800 OMP_CLAUSE_SCHEDULE_STATIC,
1801 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1802 OMP_CLAUSE_SCHEDULE_GUIDED,
1803 OMP_CLAUSE_SCHEDULE_AUTO,
1804 OMP_CLAUSE_SCHEDULE_RUNTIME
1807 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1808 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1810 enum omp_clause_default_kind
1812 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1813 OMP_CLAUSE_DEFAULT_SHARED,
1814 OMP_CLAUSE_DEFAULT_NONE,
1815 OMP_CLAUSE_DEFAULT_PRIVATE,
1816 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1819 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1820 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1822 struct GTY(()) tree_exp {
1823 struct tree_common common;
1826 tree GTY ((special ("tree_exp"),
1827 desc ("TREE_CODE ((tree) &%0)")))
1831 /* SSA_NAME accessors. */
1833 /* Returns the variable being referenced. Once released, this is the
1834 only field that can be relied upon. */
1835 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1837 /* Returns the statement which defines this SSA name. */
1838 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1840 /* Returns the SSA version number of this SSA name. Note that in
1841 tree SSA, version numbers are not per variable and may be recycled. */
1842 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1844 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1845 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1847 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1848 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1850 /* Nonzero if this SSA_NAME expression is currently on the free list of
1851 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1852 has no meaning for an SSA_NAME. */
1853 #define SSA_NAME_IN_FREE_LIST(NODE) \
1854 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1856 /* Nonzero if this SSA_NAME is the default definition for the
1857 underlying symbol. A default SSA name is created for symbol S if
1858 the very first reference to S in the function is a read operation.
1859 Default definitions are always created by an empty statement and
1860 belong to no basic block. */
1861 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1862 SSA_NAME_CHECK (NODE)->base.default_def_flag
1864 /* Attributes for SSA_NAMEs for pointer-type variables. */
1865 #define SSA_NAME_PTR_INFO(N) \
1866 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1868 #ifndef _TREE_FLOW_H
1869 struct ptr_info_def;
1874 /* Immediate use linking structure. This structure is used for maintaining
1875 a doubly linked list of uses of an SSA_NAME. */
1876 typedef struct GTY(()) ssa_use_operand_d {
1877 struct ssa_use_operand_d* GTY((skip(""))) prev;
1878 struct ssa_use_operand_d* GTY((skip(""))) next;
1879 /* Immediate uses for a given SSA name are maintained as a cyclic
1880 list. To recognize the root of this list, the location field
1881 needs to point to the original SSA name. Since statements and
1882 SSA names are of different data types, we need this union. See
1883 the explanation in struct immediate_use_iterator_d. */
1884 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1885 tree *GTY((skip(""))) use;
1886 } ssa_use_operand_t;
1888 /* Return the immediate_use information for an SSA_NAME. */
1889 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1891 struct GTY(()) tree_ssa_name {
1892 struct tree_common common;
1894 /* _DECL wrapped by this SSA name. */
1897 /* Statement that defines this SSA name. */
1900 /* SSA version number. */
1901 unsigned int version;
1903 /* Pointer attributes used for alias analysis. */
1904 struct ptr_info_def *ptr_info;
1906 /* Immediate uses list for this SSA_NAME. */
1907 struct ssa_use_operand_d imm_uses;
1910 struct GTY(()) phi_arg_d {
1911 /* imm_use MUST be the first element in struct because we do some
1912 pointer arithmetic with it. See phi_arg_index_from_use. */
1913 struct ssa_use_operand_d imm_use;
1919 #define OMP_CLAUSE_CODE(NODE) \
1920 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1922 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1923 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1925 #define OMP_CLAUSE_CODE(NODE) \
1926 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1928 #define OMP_CLAUSE_OPERAND(NODE, I) \
1929 OMP_CLAUSE_ELT_CHECK (NODE, I)
1931 struct GTY(()) tree_omp_clause {
1932 struct tree_common common;
1934 enum omp_clause_code code;
1935 union omp_clause_subcode {
1936 enum omp_clause_default_kind default_kind;
1937 enum omp_clause_schedule_kind schedule_kind;
1938 enum tree_code reduction_code;
1939 } GTY ((skip)) subcode;
1941 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1943 gimple_seq gimple_reduction_init;
1944 gimple_seq gimple_reduction_merge;
1946 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1950 struct varray_head_tag;
1952 /* In a BLOCK node. */
1953 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1954 #define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1955 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1956 #define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1957 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1958 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1959 /* Note: when changing this, make sure to find the places
1960 that use chainon or nreverse. */
1961 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1962 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1963 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1965 /* An index number for this block. These values are not guaranteed to
1966 be unique across functions -- whether or not they are depends on
1967 the debugging output format in use. */
1968 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1970 /* If block reordering splits a lexical block into discontiguous
1971 address ranges, we'll make a copy of the original block.
1973 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1974 In that case, we have one source block that has been replicated
1975 (through inlining or unrolling) into many logical blocks, and that
1976 these logical blocks have different physical variables in them.
1978 In this case, we have one logical block split into several
1979 non-contiguous address ranges. Most debug formats can't actually
1980 represent this idea directly, so we fake it by creating multiple
1981 logical blocks with the same variables in them. However, for those
1982 that do support non-contiguous regions, these allow the original
1983 logical block to be reconstructed, along with the set of address
1986 One of the logical block fragments is arbitrarily chosen to be
1987 the ORIGIN. The other fragments will point to the origin via
1988 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1989 be null. The list of fragments will be chained through
1990 BLOCK_FRAGMENT_CHAIN from the origin. */
1992 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1993 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1995 /* For an inlined function, this gives the location where it was called
1996 from. This is only set in the top level block, which corresponds to the
1997 inlined function scope. This is used in the debug output routines. */
1999 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2001 struct GTY(()) tree_block {
2002 struct tree_common common;
2004 unsigned abstract_flag : 1;
2005 unsigned block_num : 31;
2010 VEC(tree,gc) *nonlocalized_vars;
2014 tree abstract_origin;
2015 tree fragment_origin;
2016 tree fragment_chain;
2019 /* Define fields and accessors for nodes representing data types. */
2021 /* See tree.def for documentation of the use of these fields.
2022 Look at the documentation of the various ..._TYPE tree codes.
2024 Note that the type.values, type.minval, and type.maxval fields are
2025 overloaded and used for different macros in different kinds of types.
2026 Each macro must check to ensure the tree node is of the proper kind of
2027 type. Note also that some of the front-ends also overload these fields,
2028 so they must be checked as well. */
2030 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2031 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2032 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2033 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2034 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2035 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2036 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2037 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2038 (INTEGER_TYPE_CHECK (NODE)->type.values \
2039 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2040 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2041 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2042 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2043 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2044 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2045 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2046 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2047 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2048 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2049 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2050 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2051 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2052 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2053 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2054 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2055 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2056 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2057 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2058 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2059 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2060 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2062 /* Vector types need to check target flags to determine type. */
2063 extern enum machine_mode vector_type_mode (const_tree);
2064 #define TYPE_MODE(NODE) \
2065 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2066 ? vector_type_mode (NODE) : (NODE)->type.mode)
2067 #define SET_TYPE_MODE(NODE, MODE) \
2068 (TYPE_CHECK (NODE)->type.mode = (MODE))
2070 /* The "canonical" type for this type node, which can be used to
2071 compare the type for equality with another type. If two types are
2072 equal (based on the semantics of the language), then they will have
2073 equivalent TYPE_CANONICAL entries.
2075 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2076 be used for comparison against other types. Instead, the type is
2077 said to require structural equality checks, described in
2078 TYPE_STRUCTURAL_EQUALITY_P. */
2079 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2080 /* Indicates that the type node requires structural equality
2081 checks. The compiler will need to look at the composition of the
2082 type to determine whether it is equal to another type, rather than
2083 just comparing canonical type pointers. For instance, we would need
2084 to look at the return and parameter types of a FUNCTION_TYPE
2086 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2087 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2088 type node requires structural equality. */
2089 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2090 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2091 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2092 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2094 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2095 in the debugging output. We use this to describe a vector as a
2096 structure containing an array. */
2097 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2099 /* For record and union types, information about this type, as a base type
2101 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2103 /* For non record and union types, used in a language-dependent way. */
2104 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2106 /* The (language-specific) typed-based alias set for this type.
2107 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2108 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2109 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2110 type can alias objects of any type. */
2111 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2113 /* Nonzero iff the typed-based alias set for this type has been
2115 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2117 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2119 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2121 /* The alignment necessary for objects of this type.
2122 The value is an int, measured in bits. */
2123 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2125 /* 1 if the alignment for this type was requested by "aligned" attribute,
2126 0 if it is the default for this type. */
2127 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2129 /* The alignment for NODE, in bytes. */
2130 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2132 /* If your language allows you to declare types, and you want debug info
2133 for them, then you need to generate corresponding TYPE_DECL nodes.
2134 These "stub" TYPE_DECL nodes have no name, and simply point at the
2135 type node. You then set the TYPE_STUB_DECL field of the type node
2136 to point back at the TYPE_DECL node. This allows the debug routines
2137 to know that the two nodes represent the same type, so that we only
2138 get one debug info record for them. */
2139 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2141 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2142 has BLKmode only because it lacks the alignment requirement for
2144 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2146 /* In an INTEGER_TYPE, it means the type represents a size. We use
2147 this both for validity checking and to permit optimizations that
2148 are unsafe for other types. Note that the C `size_t' type should
2149 *not* have this flag set. The `size_t' type is simply a typedef
2150 for an ordinary integer type that happens to be the type of an
2151 expression returned by `sizeof'; `size_t' has no special
2152 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2153 always actual sizes. */
2154 #define TYPE_IS_SIZETYPE(NODE) \
2155 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2157 /* Nonzero in a type considered volatile as a whole. */
2158 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2160 /* Means this type is const-qualified. */
2161 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2163 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2165 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2167 /* There is a TYPE_QUAL value for each type qualifier. They can be
2168 combined by bitwise-or to form the complete set of qualifiers for a
2171 #define TYPE_UNQUALIFIED 0x0
2172 #define TYPE_QUAL_CONST 0x1
2173 #define TYPE_QUAL_VOLATILE 0x2
2174 #define TYPE_QUAL_RESTRICT 0x4
2176 /* The set of type qualifiers for this type. */
2177 #define TYPE_QUALS(NODE) \
2178 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2179 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2180 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2182 /* These flags are available for each language front end to use internally. */
2183 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2184 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2185 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2186 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2187 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2188 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2189 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2191 /* Used to keep track of visited nodes in tree traversals. This is set to
2192 0 by copy_node and make_node. */
2193 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2195 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2196 that distinguish string from array of char).
2197 If set in a INTEGER_TYPE, indicates a character type. */
2198 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2200 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2201 object of the given ARRAY_TYPE. This allows temporaries to be
2203 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2204 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2206 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2207 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2208 (((unsigned HOST_WIDE_INT) 1) \
2209 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2211 /* Set precision to n when we have 2^n sub-parts of the vector. */
2212 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2213 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2215 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2216 about missing conversions to other vector types of the same size. */
2217 #define TYPE_VECTOR_OPAQUE(NODE) \
2218 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2220 /* Indicates that objects of this type must be initialized by calling a
2221 function when they are created. */
2222 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2223 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2225 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2226 the same way that the first union alternative would be passed. */
2227 #define TYPE_TRANSPARENT_UNION(NODE) \
2228 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2230 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2231 address of a component of the type. This is the counterpart of
2232 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2233 #define TYPE_NONALIASED_COMPONENT(NODE) \
2234 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2236 /* Indicated that objects of this type should be laid out in as
2237 compact a way as possible. */
2238 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2240 /* Used by type_contains_placeholder_p to avoid recomputation.
2241 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2242 this field directly. */
2243 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2244 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2248 struct GTY(()) tree_type {
2249 struct tree_common common;
2256 unsigned int precision : 10;
2257 unsigned no_force_blk_flag : 1;
2258 unsigned needs_constructing_flag : 1;
2259 unsigned transparent_union_flag : 1;
2260 unsigned restrict_flag : 1;
2261 unsigned contains_placeholder_bits : 2;
2263 ENUM_BITFIELD(machine_mode) mode : 8;
2265 unsigned string_flag : 1;
2266 unsigned lang_flag_0 : 1;
2267 unsigned lang_flag_1 : 1;
2268 unsigned lang_flag_2 : 1;
2269 unsigned lang_flag_3 : 1;
2270 unsigned lang_flag_4 : 1;
2271 unsigned lang_flag_5 : 1;
2272 unsigned lang_flag_6 : 1;
2275 alias_set_type alias_set;
2278 union tree_type_symtab {
2279 int GTY ((tag ("0"))) address;
2280 const char * GTY ((tag ("1"))) pointer;
2281 struct die_struct * GTY ((tag ("2"))) die;
2282 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2283 descbits ("2"))) symtab;
2292 /* Points to a structure whose details depend on the language in use. */
2293 struct lang_type *lang_specific;
2296 /* Define accessor macros for information about type inheritance
2299 A "basetype" means a particular usage of a data type for inheritance
2300 in another type. Each such basetype usage has its own "binfo"
2301 object to describe it. The binfo object is a TREE_VEC node.
2303 Inheritance is represented by the binfo nodes allocated for a
2304 given type. For example, given types C and D, such that D is
2305 inherited by C, 3 binfo nodes will be allocated: one for describing
2306 the binfo properties of C, similarly one for D, and one for
2307 describing the binfo properties of D as a base type for C.
2308 Thus, given a pointer to class C, one can get a pointer to the binfo
2309 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2311 /* BINFO specific flags. */
2313 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2314 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2316 /* Flags for language dependent use. */
2317 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2318 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2319 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2320 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2321 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2322 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2323 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2325 /* The actual data type node being inherited in this basetype. */
2326 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2328 /* The offset where this basetype appears in its containing type.
2329 BINFO_OFFSET slot holds the offset (in bytes)
2330 from the base of the complete object to the base of the part of the
2331 object that is allocated on behalf of this `type'.
2332 This is always 0 except when there is multiple inheritance. */
2334 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2335 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2337 /* The virtual function table belonging to this basetype. Virtual
2338 function tables provide a mechanism for run-time method dispatching.
2339 The entries of a virtual function table are language-dependent. */
2341 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2343 /* The virtual functions in the virtual function table. This is
2344 a TREE_LIST that is used as an initial approximation for building
2345 a virtual function table for this basetype. */
2346 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2348 /* A vector of binfos for the direct basetypes inherited by this
2351 If this basetype describes type D as inherited in C, and if the
2352 basetypes of D are E and F, then this vector contains binfos for
2353 inheritance of E and F by C. */
2354 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2356 /* The number of basetypes for NODE. */
2357 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2359 /* Accessor macro to get to the Nth base binfo of this binfo. */
2360 #define BINFO_BASE_BINFO(NODE,N) \
2361 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2362 #define BINFO_BASE_ITERATE(NODE,N,B) \
2363 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2364 #define BINFO_BASE_APPEND(NODE,T) \
2365 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2367 /* For a BINFO record describing a virtual base class, i.e., one where
2368 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2369 base. The actual contents are language-dependent. In the C++
2370 front-end this field is an INTEGER_CST giving an offset into the
2371 vtable where the offset to the virtual base can be found. */
2372 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2374 /* Indicates the accesses this binfo has to its bases. The values are
2375 access_public_node, access_protected_node or access_private_node.
2376 If this array is not present, public access is implied. */
2377 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2379 #define BINFO_BASE_ACCESS(NODE,N) \
2380 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2381 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2382 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2384 /* The index in the VTT where this subobject's sub-VTT can be found.
2385 NULL_TREE if there is no sub-VTT. */
2386 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2388 /* The index in the VTT where the vptr for this subobject can be
2389 found. NULL_TREE if there is no secondary vptr in the VTT. */
2390 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2392 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2393 inheriting this base for non-virtual bases. For virtual bases it
2394 points either to the binfo for which this is a primary binfo, or to
2395 the binfo of the most derived type. */
2396 #define BINFO_INHERITANCE_CHAIN(NODE) \
2397 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2399 struct GTY (()) tree_binfo {
2400 struct tree_common common;
2406 VEC(tree,gc) *base_accesses;
2412 VEC(tree,none) base_binfos;
2416 /* Define fields and accessors for nodes representing declared names. */
2418 /* Nonzero if DECL represents a variable for the SSA passes. */
2419 #define SSA_VAR_P(DECL) \
2420 (TREE_CODE (DECL) == VAR_DECL \
2421 || TREE_CODE (DECL) == PARM_DECL \
2422 || TREE_CODE (DECL) == RESULT_DECL \
2423 || (TREE_CODE (DECL) == SSA_NAME \
2424 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2425 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2426 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2431 /* Enumerate visibility settings. */
2432 #ifndef SYMBOL_VISIBILITY_DEFINED
2433 #define SYMBOL_VISIBILITY_DEFINED
2434 enum symbol_visibility
2437 VISIBILITY_PROTECTED,
2446 /* This is the name of the object as written by the user.
2447 It is an IDENTIFIER_NODE. */
2448 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2450 /* Every ..._DECL node gets a unique number. */
2451 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2453 /* These two fields describe where in the source code the declaration
2454 was. If the declaration appears in several places (as for a C
2455 function that is declared first and then defined later), this
2456 information should refer to the definition. */
2457 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2458 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2459 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2460 #define DECL_IS_BUILTIN(DECL) \
2461 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2463 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2464 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2465 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2466 nodes, this points to either the FUNCTION_DECL for the containing
2467 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2468 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2470 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2471 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2472 struct GTY(()) tree_decl_minimal {
2473 struct tree_common common;
2481 /* For any sort of a ..._DECL node, this points to the original (abstract)
2482 decl node which this decl is an instance of, or else it is NULL indicating
2483 that this decl is not an instance of some other decl. For example,
2484 in a nested declaration of an inline function, this points back to the
2486 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2488 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2489 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2490 #define DECL_ORIGIN(NODE) \
2491 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2493 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2494 inline instance of some original (abstract) decl from an inline function;
2495 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2496 nodes can also have their abstract origin set to themselves. */
2497 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2498 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2500 /* In a DECL this is the field where attributes are stored. */
2501 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2503 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2504 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2505 For a VAR_DECL, holds the initial value.
2506 For a PARM_DECL, used for DECL_ARG_TYPE--default
2507 values for parameters are encoded in the type of the function,
2508 not in the PARM_DECL slot.
2509 For a FIELD_DECL, this is used for enumeration values and the C
2510 frontend uses it for temporarily storing bitwidth of bitfields.
2512 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2513 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2515 /* Holds the size of the datum, in bits, as a tree expression.
2516 Need not be constant. */
2517 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2518 /* Likewise for the size in bytes. */
2519 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2520 /* Holds the alignment required for the datum, in bits. */
2521 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2522 /* The alignment of NODE, in bytes. */
2523 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2524 /* Set if the alignment of this DECL has been set by the user, for
2525 example with an 'aligned' attribute. */
2526 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2527 /* Holds the machine mode corresponding to the declaration of a variable or
2528 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2530 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2532 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2533 operation it is. Note, however, that this field is overloaded, with
2534 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2535 checked before any access to the former. */
2536 #define DECL_FUNCTION_CODE(NODE) \
2537 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2538 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2539 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2541 /* Nonzero for a given ..._DECL node means that the name of this node should
2542 be ignored for symbolic debug purposes. */
2543 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2545 /* Nonzero for a given ..._DECL node means that this node represents an
2546 "abstract instance" of the given declaration (e.g. in the original
2547 declaration of an inline function). When generating symbolic debugging
2548 information, we mustn't try to generate any address information for nodes
2549 marked as "abstract instances" because we don't actually generate
2550 any code or allocate any data space for such instances. */
2551 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2553 /* Language-specific decl information. */
2554 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2556 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2557 do not allocate storage, and refer to a definition elsewhere. Note that
2558 this does not necessarily imply the entity represented by NODE
2559 has no program source-level definition in this translation unit. For
2560 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2561 DECL_EXTERNAL may be true simultaneously; that can be the case for
2562 a C99 "extern inline" function. */
2563 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2565 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2566 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2568 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2570 Also set in some languages for variables, etc., outside the normal
2571 lexical scope, such as class instance variables. */
2572 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2574 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2575 Used in FIELD_DECLs for vtable pointers.
2576 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2577 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2579 /* Used to indicate that this DECL represents a compiler-generated entity. */
2580 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2582 /* Additional flags for language-specific uses. */
2583 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2584 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2585 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2586 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2587 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2588 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2589 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2590 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2592 /* Nonzero for a decl which is at file scope. */
2593 #define DECL_FILE_SCOPE_P(EXP) \
2594 (! DECL_CONTEXT (EXP) \
2595 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2597 /* Nonzero for a decl that is decorated using attribute used.
2598 This indicates compiler tools that this decl needs to be preserved. */
2599 #define DECL_PRESERVE_P(DECL) \
2600 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2602 /* For function local variables of COMPLEX and VECTOR types,
2603 indicates that the variable is not aliased, and that all
2604 modifications to the variable have been adjusted so that
2605 they are killing assignments. Thus the variable may now
2606 be treated as a GIMPLE register, and use real instead of
2607 virtual ops in SSA form. */
2608 #define DECL_GIMPLE_REG_P(DECL) \
2609 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2611 struct GTY(()) tree_decl_common {
2612 struct tree_decl_minimal common;
2615 ENUM_BITFIELD(machine_mode) mode : 8;
2617 unsigned nonlocal_flag : 1;
2618 unsigned virtual_flag : 1;
2619 unsigned ignored_flag : 1;
2620 unsigned abstract_flag : 1;
2621 unsigned artificial_flag : 1;
2622 unsigned preserve_flag: 1;
2623 unsigned debug_expr_is_from : 1;
2625 unsigned lang_flag_0 : 1;
2626 unsigned lang_flag_1 : 1;
2627 unsigned lang_flag_2 : 1;
2628 unsigned lang_flag_3 : 1;
2629 unsigned lang_flag_4 : 1;
2630 unsigned lang_flag_5 : 1;
2631 unsigned lang_flag_6 : 1;
2632 unsigned lang_flag_7 : 1;
2634 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2635 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2636 unsigned decl_flag_0 : 1;
2637 /* In FIELD_DECL, this is DECL_BIT_FIELD
2638 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2639 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2640 unsigned decl_flag_1 : 1;
2641 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2642 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2643 unsigned decl_flag_2 : 1;
2644 /* Logically, these two would go in a theoretical base shared by var and
2646 unsigned gimple_reg_flag : 1;
2647 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2648 unsigned decl_by_reference_flag : 1;
2649 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2650 unsigned decl_common_unused : 4;
2652 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2653 unsigned int off_align : 8;
2655 /* 24-bits unused. */
2657 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2663 tree abstract_origin;
2665 /* Points to a structure whose details depend on the language in use. */
2666 struct lang_decl *lang_specific;
2669 extern tree decl_value_expr_lookup (tree);
2670 extern void decl_value_expr_insert (tree, tree);
2672 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2673 if transformations have made this more complicated than evaluating the
2674 decl itself. This should only be used for debugging; once this field has
2675 been set, the decl itself may not legitimately appear in the function. */
2676 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2677 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2678 #define DECL_VALUE_EXPR(NODE) \
2679 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2680 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2681 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2683 /* Holds the RTL expression for the value of a variable or function.
2684 This value can be evaluated lazily for functions, variables with
2685 static storage duration, and labels. */
2686 #define DECL_RTL(NODE) \
2687 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2688 ? (NODE)->decl_with_rtl.rtl \
2689 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2691 /* Set the DECL_RTL for NODE to RTL. */
2692 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2694 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2695 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2697 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2698 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2700 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2701 NODE1, it will not be set for NODE2; this is a lazy copy. */
2702 #define COPY_DECL_RTL(NODE1, NODE2) \
2703 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2705 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2706 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2708 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2709 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2711 struct GTY(()) tree_decl_with_rtl {
2712 struct tree_decl_common common;
2716 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2717 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2718 of the structure. */
2719 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2721 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2722 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2723 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2724 natural alignment of the field's type). */
2725 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2727 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2728 if so, the type that was originally specified for it.
2729 TREE_TYPE may have been modified (in finish_struct). */
2730 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2732 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2733 if nonzero, indicates that the field occupies the type. */
2734 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2736 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2737 DECL_FIELD_OFFSET which are known to be always zero.
2738 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2740 #define DECL_OFFSET_ALIGN(NODE) \
2741 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2743 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2744 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2745 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2746 /* 1 if the alignment for this type was requested by "aligned" attribute,
2747 0 if it is the default for this type. */
2749 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2750 which this FIELD_DECL is defined. This information is needed when
2751 writing debugging information about vfield and vbase decls for C++. */
2752 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2754 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2755 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2757 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2759 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2761 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2762 this component. This makes it possible for Type-Based Alias Analysis
2763 to disambiguate accesses to this field with indirect accesses using
2766 struct S { int i; } s;
2769 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2771 From the implementation's viewpoint, the alias set of the type of the
2772 field 'i' (int) will not be recorded as a subset of that of the type of
2773 's' (struct S) in record_component_aliases. The counterpart is that
2774 accesses to s.i must not be given the alias set of the type of 'i'
2775 (int) but instead directly that of the type of 's' (struct S). */
2776 #define DECL_NONADDRESSABLE_P(NODE) \
2777 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2779 struct GTY(()) tree_field_decl {
2780 struct tree_decl_common common;
2783 tree bit_field_type;
2789 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2790 dense, unique within any one function, and may be used to index arrays.
2791 If the value is -1, then no UID has been assigned. */
2792 #define LABEL_DECL_UID(NODE) \
2793 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2795 /* In LABEL_DECL nodes, nonzero means that an error message about
2796 jumping into such a binding contour has been printed for this label. */
2797 #define DECL_ERROR_ISSUED(NODE) \
2798 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2800 struct GTY(()) tree_label_decl {
2801 struct tree_decl_with_rtl common;
2805 struct GTY(()) tree_result_decl {
2806 struct tree_decl_with_rtl common;
2809 struct GTY(()) tree_const_decl {
2810 struct tree_decl_with_rtl common;
2813 /* For a PARM_DECL, records the data type used to pass the argument,
2814 which may be different from the type seen in the program. */
2815 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2817 /* For PARM_DECL, holds an RTL for the stack slot or register
2818 where the data was actually passed. */
2819 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2821 struct GTY(()) tree_parm_decl {
2822 struct tree_decl_with_rtl common;
2827 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2828 this variable in a BIND_EXPR. */
2829 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2830 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2832 /* Used to indicate that the linkage status of this DECL is not yet known,
2833 so it should not be output now. */
2834 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2836 /* Nonzero for a given ..._DECL node means that no warnings should be
2837 generated just because this node is unused. */
2838 #define DECL_IN_SYSTEM_HEADER(NODE) \
2839 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2841 /* Used to indicate that this DECL has weak linkage. */
2842 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2844 /* Used to indicate that the DECL is a dllimport. */
2845 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2847 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2848 not be put out unless it is needed in this translation unit.
2849 Entities like this are shared across translation units (like weak
2850 entities), but are guaranteed to be generated by any translation
2851 unit that needs them, and therefore need not be put out anywhere
2852 where they are not needed. DECL_COMDAT is just a hint to the
2853 back-end; it is up to front-ends which set this flag to ensure
2854 that there will never be any harm, other than bloat, in putting out
2855 something which is DECL_COMDAT. */
2856 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2858 #define DECL_COMDAT_GROUP(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2860 /* A replaceable function is one which may be replaced at link-time
2861 with an entirely different definition, provided that the
2862 replacement has the same type. For example, functions declared
2863 with __attribute__((weak)) on most systems are replaceable.
2865 COMDAT functions are not replaceable, since all definitions of the
2866 function must be equivalent. It is important that COMDAT functions
2867 not be treated as replaceable so that use of C++ template
2868 instantiations is not penalized.
2870 For example, DECL_REPLACEABLE is used to determine whether or not a
2871 function (including a template instantiation) which is not
2872 explicitly declared "inline" can be inlined. If the function is
2873 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2874 implementation chosen at link-time may be different. However, a
2875 function that is not DECL_REPLACEABLE can be inlined, since all
2876 versions of the function will be functionally identical. */
2877 #define DECL_REPLACEABLE_P(NODE) \
2878 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2880 /* The name of the object as the assembler will see it (but before any
2881 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2882 as DECL_NAME. It is an IDENTIFIER_NODE. */
2883 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2885 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2886 This is true of all DECL nodes except FIELD_DECL. */
2887 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2888 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2890 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2891 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2893 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2894 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2896 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2897 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2898 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2900 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2901 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2902 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2903 semantics of using this macro, are different than saying:
2905 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2907 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2909 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2910 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2911 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2912 DECL_ASSEMBLER_NAME (DECL1)) \
2915 /* Records the section name in a section attribute. Used to pass
2916 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2917 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2919 /* Value of the decls's visibility attribute */
2920 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2922 /* Nonzero means that the decl had its visibility specified rather than
2924 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2926 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2927 multiple translation units should be merged. */
2928 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2930 struct GTY(()) tree_decl_with_vis {
2931 struct tree_decl_with_rtl common;
2932 tree assembler_name;
2936 /* Belong to VAR_DECL exclusively. */
2937 unsigned defer_output : 1;
2938 unsigned hard_register : 1;
2939 unsigned thread_local : 1;
2940 unsigned common_flag : 1;
2941 unsigned in_text_section : 1;
2942 unsigned dllimport_flag : 1;
2943 /* Used by C++. Might become a generic decl flag. */
2944 unsigned shadowed_for_var_p : 1;
2945 /* Don't belong to VAR_DECL exclusively. */
2946 unsigned weak_flag : 1;
2948 unsigned seen_in_bind_expr : 1;
2949 unsigned comdat_flag : 1;
2950 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2951 unsigned visibility_specified : 1;
2952 /* Belongs to VAR_DECL exclusively. */
2953 ENUM_BITFIELD(tls_model) tls_model : 3;
2955 /* Belong to FUNCTION_DECL exclusively. */
2956 unsigned init_priority_p : 1;
2957 /* 15 unused bits. */
2960 /* In a VAR_DECL that's static,
2961 nonzero if the space is in the text section. */
2962 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2964 /* Nonzero for a given ..._DECL node means that this node should be
2965 put in .common, if possible. If a DECL_INITIAL is given, and it
2966 is not error_mark_node, then the decl cannot be put in .common. */
2967 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2969 /* In a VAR_DECL, nonzero if the decl is a register variable with
2970 an explicit asm specification. */
2971 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2973 extern tree decl_debug_expr_lookup (tree);
2974 extern void decl_debug_expr_insert (tree, tree);
2975 /* For VAR_DECL, this is set to either an expression that it was split
2976 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2977 subexpressions that it was split into. */
2978 #define DECL_DEBUG_EXPR(NODE) \
2979 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2981 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2982 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2984 /* An initialization priority. */
2985 typedef unsigned short priority_type;
2987 extern priority_type decl_init_priority_lookup (tree);
2988 extern priority_type decl_fini_priority_lookup (tree);
2989 extern void decl_init_priority_insert (tree, priority_type);
2990 extern void decl_fini_priority_insert (tree, priority_type);
2992 /* In a non-local VAR_DECL with static storage duration, true if the
2993 variable has an initialization priority. If false, the variable
2994 will be initialized at the DEFAULT_INIT_PRIORITY. */
2995 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2996 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2998 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3000 #define DECL_INIT_PRIORITY(NODE) \
3001 (decl_init_priority_lookup (NODE))
3002 /* Set the initialization priority for NODE to VAL. */
3003 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3004 (decl_init_priority_insert (NODE, VAL))
3006 /* For a FUNCTION_DECL the finalization priority of NODE. */
3007 #define DECL_FINI_PRIORITY(NODE) \
3008 (decl_fini_priority_lookup (NODE))
3009 /* Set the finalization priority for NODE to VAL. */
3010 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3011 (decl_fini_priority_insert (NODE, VAL))
3013 /* The initialization priority for entities for which no explicit
3014 initialization priority has been specified. */
3015 #define DEFAULT_INIT_PRIORITY 65535
3017 /* The maximum allowed initialization priority. */
3018 #define MAX_INIT_PRIORITY 65535
3020 /* The largest priority value reserved for use by system runtime
3022 #define MAX_RESERVED_INIT_PRIORITY 100
3024 /* In a VAR_DECL, the model to use if the data should be allocated from
3025 thread-local storage. */
3026 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3028 /* In a VAR_DECL, nonzero if the data should be allocated from
3029 thread-local storage. */
3030 #define DECL_THREAD_LOCAL_P(NODE) \
3031 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3033 struct GTY(()) tree_var_decl {
3034 struct tree_decl_with_vis common;
3038 /* This field is used to reference anything in decl.result and is meant only
3039 for use by the garbage collector. */
3040 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3042 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3043 Before the struct containing the FUNCTION_DECL is laid out,
3044 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3045 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3046 function. When the class is laid out, this pointer is changed
3047 to an INTEGER_CST node which is suitable for use as an index
3048 into the virtual function table.
3049 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3050 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3053 tree_decl_non_common {
3054 struct tree_decl_with_vis common;
3055 /* C++ uses this in namespaces. */
3057 /* C++ uses this in templates. */
3059 /* Almost all FE's use this. */
3061 /* C++ uses this in namespaces. */
3065 /* In FUNCTION_DECL, holds the decl for the return value. */
3066 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3068 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3069 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3071 /* In a FUNCTION_DECL, the saved representation of the body of the
3073 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3075 /* Nonzero in a FUNCTION_DECL means this function should be treated
3076 as if it were a malloc, meaning it returns a pointer that is
3078 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3080 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3081 C++ operator new, meaning that it returns a pointer for which we
3082 should not use type based aliasing. */
3083 #define DECL_IS_OPERATOR_NEW(NODE) \
3084 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3086 /* Nonzero in a FUNCTION_DECL means this function may return more
3088 #define DECL_IS_RETURNS_TWICE(NODE) \
3089 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3091 /* Nonzero in a FUNCTION_DECL means this function should be treated
3092 as "pure" function (like const function, but may read global memory). */
3093 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3095 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3096 the const or pure function may not terminate. When this is nonzero
3097 for a const or pure function, it can be dealt with by cse passes
3098 but cannot be removed by dce passes since you are not allowed to
3099 change an infinite looping program into one that terminates without
3101 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3102 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3104 /* Nonzero in a FUNCTION_DECL means this function should be treated
3105 as "novops" function (function that does not read global memory,
3106 but may have arbitrary side effects). */
3107 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3109 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3110 at the beginning or end of execution. */
3111 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3112 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3114 #define DECL_STATIC_DESTRUCTOR(NODE) \
3115 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3117 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3118 be instrumented with calls to support routines. */
3119 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3120 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3122 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3123 disabled in this function. */
3124 #define DECL_NO_LIMIT_STACK(NODE) \
3125 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3127 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3128 static chain is not needed. */
3129 #define DECL_NO_STATIC_CHAIN(NODE) \
3130 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3132 /* Nonzero for a decl that cgraph has decided should be inlined into
3133 at least one call site. It is not meaningful to look at this
3134 directly; always use cgraph_function_possibly_inlined_p. */
3135 #define DECL_POSSIBLY_INLINED(DECL) \
3136 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3138 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3139 such as via the `inline' keyword in C/C++. This flag controls the linkage
3140 semantics of 'inline' */
3141 #define DECL_DECLARED_INLINE_P(NODE) \
3142 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3144 /* Nonzero in a FUNCTION_DECL means this function should not get
3145 -Winline warnings. */
3146 #define DECL_NO_INLINE_WARNING_P(NODE) \
3147 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3149 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3150 disregarding size and cost heuristics. This is equivalent to using
3151 the always_inline attribute without the required diagnostics if the
3152 function cannot be inlined. */
3153 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3154 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3156 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3157 that describes the status of this function. */
3158 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3160 /* In a FUNCTION_DECL, nonzero means a built in function. */
3161 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3163 /* For a builtin function, identify which part of the compiler defined it. */
3164 #define DECL_BUILT_IN_CLASS(NODE) \
3165 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3167 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3168 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3170 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3171 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3173 /* In FUNCTION_DECL, the function specific target options to use when compiling
3175 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3176 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3178 /* In FUNCTION_DECL, the function specific optimization options to use when
3179 compiling this function. */
3180 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3181 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3183 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3184 arguments/result/saved_tree fields by front ends. It was either inherit
3185 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3186 which seemed a bit strange. */
3188 struct GTY(()) tree_function_decl {
3189 struct tree_decl_non_common common;
3193 /* Function specific options that are used by this function. */
3194 tree function_specific_target; /* target options */
3195 tree function_specific_optimization; /* optimization options */
3197 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3198 DECL_FUNCTION_CODE. Otherwise unused.
3199 ??? The bitfield needs to be able to hold all target function
3201 ENUM_BITFIELD(built_in_function) function_code : 11;
3202 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3204 unsigned static_ctor_flag : 1;
3205 unsigned static_dtor_flag : 1;
3206 unsigned uninlinable : 1;
3208 unsigned possibly_inlined : 1;
3209 unsigned novops_flag : 1;
3210 unsigned returns_twice_flag : 1;
3211 unsigned malloc_flag : 1;
3212 unsigned operator_new_flag : 1;
3213 unsigned declared_inline_flag : 1;
3214 unsigned regdecl_flag : 1;
3216 unsigned no_inline_warning_flag : 1;
3217 unsigned no_instrument_function_entry_exit : 1;
3218 unsigned no_limit_stack : 1;
3219 unsigned disregard_inline_limits : 1;
3220 unsigned pure_flag : 1;
3221 unsigned looping_const_or_pure_flag : 1;
3227 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3228 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3230 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3231 into stabs. Instead it will generate cross reference ('x') of names.
3232 This uses the same flag as DECL_EXTERNAL. */
3233 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3234 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3236 /* Getter of the imported declaration associated to the
3237 IMPORTED_DECL node. */
3238 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3239 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3241 struct GTY(()) tree_type_decl {
3242 struct tree_decl_non_common common;
3246 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3247 To reduce overhead, the nodes containing the statements are not trees.
3248 This avoids the overhead of tree_common on all linked list elements.
3250 Use the interface in tree-iterator.h to access this node. */
3252 #define STATEMENT_LIST_HEAD(NODE) \
3253 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3254 #define STATEMENT_LIST_TAIL(NODE) \
3255 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3257 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3259 struct tree_statement_list_node *prev;
3260 struct tree_statement_list_node *next;
3264 struct GTY(()) tree_statement_list
3266 struct tree_common common;
3267 struct tree_statement_list_node *head;
3268 struct tree_statement_list_node *tail;
3272 /* Optimization options used by a function. */
3274 struct GTY(()) tree_optimization_option {
3275 struct tree_common common;
3277 /* The optimization options used by the user. */
3278 struct cl_optimization opts;
3281 #define TREE_OPTIMIZATION(NODE) \
3282 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3284 /* Return a tree node that encapsulates the current optimization options. */
3285 extern tree build_optimization_node (void);
3287 /* Target options used by a function. */
3289 struct GTY(()) tree_target_option {
3290 struct tree_common common;
3292 /* The optimization options used by the user. */
3293 struct cl_target_option opts;
3296 #define TREE_TARGET_OPTION(NODE) \
3297 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3299 /* Return a tree node that encapsulates the current target options. */
3300 extern tree build_target_option_node (void);
3303 /* Define the overall contents of a tree node.
3304 It may be any of the structures declared above
3305 for various types of node. */
3307 union GTY ((ptr_alias (union lang_tree_node),
3308 desc ("tree_node_structure (&%h)"))) tree_node {
3309 struct tree_base GTY ((tag ("TS_BASE"))) base;
3310 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3311 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3312 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3313 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3314 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3315 struct tree_string GTY ((tag ("TS_STRING"))) string;
3316 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3317 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3318 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3319 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3320 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3321 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3322 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3323 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3324 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3325 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3326 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3327 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3328 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3329 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3330 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3331 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3332 struct tree_list GTY ((tag ("TS_LIST"))) list;
3333 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3334 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3335 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3336 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3337 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3338 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3339 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3340 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3341 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3342 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3345 /* Standard named or nameless data types of the C compiler. */
3367 TI_INTEGER_MINUS_ONE,
3384 TI_COMPLEX_INTEGER_TYPE,
3385 TI_COMPLEX_FLOAT_TYPE,
3386 TI_COMPLEX_DOUBLE_TYPE,
3387 TI_COMPLEX_LONG_DOUBLE_TYPE,
3391 TI_LONG_DOUBLE_TYPE,
3395 TI_LONG_DOUBLE_PTR_TYPE,
3396 TI_INTEGER_PTR_TYPE,
3405 TI_VA_LIST_GPR_COUNTER_FIELD,
3406 TI_VA_LIST_FPR_COUNTER_FIELD,
3413 TI_DFLOAT32_PTR_TYPE,
3414 TI_DFLOAT64_PTR_TYPE,
3415 TI_DFLOAT128_PTR_TYPE,
3424 TI_SAT_LLFRACT_TYPE,
3425 TI_SAT_USFRACT_TYPE,
3427 TI_SAT_ULFRACT_TYPE,
3428 TI_SAT_ULLFRACT_TYPE,
3440 TI_SAT_LLACCUM_TYPE,
3441 TI_SAT_USACCUM_TYPE,
3443 TI_SAT_ULACCUM_TYPE,
3444 TI_SAT_ULLACCUM_TYPE,
3490 TI_OPTIMIZATION_DEFAULT,
3491 TI_OPTIMIZATION_CURRENT,
3492 TI_TARGET_OPTION_DEFAULT,
3493 TI_TARGET_OPTION_CURRENT,
3494 TI_CURRENT_TARGET_PRAGMA,
3495 TI_CURRENT_OPTIMIZE_PRAGMA,
3500 extern GTY(()) tree global_trees[TI_MAX];
3502 #define error_mark_node global_trees[TI_ERROR_MARK]
3504 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3505 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3506 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3507 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3508 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3510 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3511 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3512 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3513 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3514 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3516 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3517 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3519 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3520 #define integer_one_node global_trees[TI_INTEGER_ONE]
3521 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3522 #define size_zero_node global_trees[TI_SIZE_ZERO]
3523 #define size_one_node global_trees[TI_SIZE_ONE]
3524 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3525 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3526 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3528 /* Base access nodes. */
3529 #define access_public_node global_trees[TI_PUBLIC]
3530 #define access_protected_node global_trees[TI_PROTECTED]
3531 #define access_private_node global_trees[TI_PRIVATE]
3533 #define null_pointer_node global_trees[TI_NULL_POINTER]
3535 #define float_type_node global_trees[TI_FLOAT_TYPE]
3536 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3537 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3539 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3540 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3541 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3542 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3544 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3545 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3546 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3547 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3549 #define void_type_node global_trees[TI_VOID_TYPE]
3550 /* The C type `void *'. */
3551 #define ptr_type_node global_trees[TI_PTR_TYPE]
3552 /* The C type `const void *'. */
3553 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3554 /* The C type `size_t'. */
3555 #define size_type_node global_trees[TI_SIZE_TYPE]
3556 #define pid_type_node global_trees[TI_PID_TYPE]
3557 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3558 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3559 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3560 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3561 /* The C type `FILE *'. */
3562 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3564 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3565 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3566 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3568 /* The decimal floating point types. */
3569 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3570 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3571 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3572 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3573 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3574 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3576 /* The fixed-point types. */
3577 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3578 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3579 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3580 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3581 #define sat_unsigned_short_fract_type_node \
3582 global_trees[TI_SAT_USFRACT_TYPE]
3583 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3584 #define sat_unsigned_long_fract_type_node \
3585 global_trees[TI_SAT_ULFRACT_TYPE]
3586 #define sat_unsigned_long_long_fract_type_node \
3587 global_trees[TI_SAT_ULLFRACT_TYPE]
3588 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3589 #define fract_type_node global_trees[TI_FRACT_TYPE]
3590 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3591 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3592 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3593 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3594 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3595 #define unsigned_long_long_fract_type_node \
3596 global_trees[TI_ULLFRACT_TYPE]
3597 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3598 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3599 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3600 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3601 #define sat_unsigned_short_accum_type_node \
3602 global_trees[TI_SAT_USACCUM_TYPE]
3603 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3604 #define sat_unsigned_long_accum_type_node \
3605 global_trees[TI_SAT_ULACCUM_TYPE]
3606 #define sat_unsigned_long_long_accum_type_node \
3607 global_trees[TI_SAT_ULLACCUM_TYPE]
3608 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3609 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3610 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3611 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3612 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3613 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3614 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3615 #define unsigned_long_long_accum_type_node \
3616 global_trees[TI_ULLACCUM_TYPE]
3617 #define qq_type_node global_trees[TI_QQ_TYPE]
3618 #define hq_type_node global_trees[TI_HQ_TYPE]
3619 #define sq_type_node global_trees[TI_SQ_TYPE]
3620 #define dq_type_node global_trees[TI_DQ_TYPE]
3621 #define tq_type_node global_trees[TI_TQ_TYPE]
3622 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3623 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3624 #define usq_type_node global_trees[TI_USQ_TYPE]
3625 #define udq_type_node global_trees[TI_UDQ_TYPE]
3626 #define utq_type_node global_trees[TI_UTQ_TYPE]
3627 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3628 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3629 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3630 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3631 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3632 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3633 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3634 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3635 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3636 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3637 #define ha_type_node global_trees[TI_HA_TYPE]
3638 #define sa_type_node global_trees[TI_SA_TYPE]
3639 #define da_type_node global_trees[TI_DA_TYPE]
3640 #define ta_type_node global_trees[TI_TA_TYPE]
3641 #define uha_type_node global_trees[TI_UHA_TYPE]
3642 #define usa_type_node global_trees[TI_USA_TYPE]
3643 #define uda_type_node global_trees[TI_UDA_TYPE]
3644 #define uta_type_node global_trees[TI_UTA_TYPE]
3645 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3646 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3647 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3648 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3649 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3650 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3651 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3652 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3654 /* The node that should be placed at the end of a parameter list to
3655 indicate that the function does not take a variable number of
3656 arguments. The TREE_VALUE will be void_type_node and there will be
3657 no TREE_CHAIN. Language-independent code should not assume
3658 anything else about this node. */
3659 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3661 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3662 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3664 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3666 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3667 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3669 /* Default/current target options (TARGET_OPTION_NODE). */
3670 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3671 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3673 /* Default tree list option(), optimize() pragmas to be linked into the
3675 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3676 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3678 /* An enumeration of the standard C integer types. These must be
3679 ordered so that shorter types appear before longer ones, and so
3680 that signed types appear before unsigned ones, for the correct
3681 functioning of interpret_integer() in c-lex.c. */
3682 enum integer_type_kind
3694 itk_unsigned_long_long,
3698 typedef enum integer_type_kind integer_type_kind;
3700 /* The standard C integer types. Use integer_type_kind to index into
3702 extern GTY(()) tree integer_types[itk_none];
3704 #define char_type_node integer_types[itk_char]
3705 #define signed_char_type_node integer_types[itk_signed_char]
3706 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3707 #define short_integer_type_node integer_types[itk_short]
3708 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3709 #define integer_type_node integer_types[itk_int]
3710 #define unsigned_type_node integer_types[itk_unsigned_int]
3711 #define long_integer_type_node integer_types[itk_long]
3712 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3713 #define long_long_integer_type_node integer_types[itk_long_long]
3714 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3716 /* Set to the default thread-local storage (tls) model to use. */
3718 extern enum tls_model flag_tls_default;
3721 /* A pointer-to-function member type looks like:
3728 If __pfn is NULL, it is a NULL pointer-to-member-function.
3730 (Because the vtable is always the first thing in the object, we
3731 don't need its offset.) If the function is virtual, then PFN is
3732 one plus twice the index into the vtable; otherwise, it is just a
3733 pointer to the function.
3735 Unfortunately, using the lowest bit of PFN doesn't work in
3736 architectures that don't impose alignment requirements on function
3737 addresses, or that use the lowest bit to tell one ISA from another,
3738 for example. For such architectures, we use the lowest bit of
3739 DELTA instead of the lowest bit of the PFN, and DELTA will be
3742 enum ptrmemfunc_vbit_where_t
3744 ptrmemfunc_vbit_in_pfn,
3745 ptrmemfunc_vbit_in_delta
3748 #define NULL_TREE (tree) NULL
3750 extern tree decl_assembler_name (tree);
3751 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3752 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3754 /* Compute the number of bytes occupied by 'node'. This routine only
3755 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3757 extern size_t tree_size (const_tree);
3759 /* Compute the number of bytes occupied by a tree with code CODE. This
3760 function cannot be used for TREE_VEC codes, which are of variable
3762 extern size_t tree_code_size (enum tree_code);
3764 /* Lowest level primitive for allocating a node.
3765 The TREE_CODE is the only argument. Contents are initialized
3766 to zero except for a few of the common fields. */
3768 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3769 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3771 /* Make a copy of a node, with all the same contents. */
3773 extern tree copy_node_stat (tree MEM_STAT_DECL);
3774 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3776 /* Make a copy of a chain of TREE_LIST nodes. */
3778 extern tree copy_list (tree);
3781 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3782 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3784 /* Make a TREE_VEC. */
3786 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3787 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3789 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3790 The name is supplied as a char *. */
3792 extern tree get_identifier (const char *);
3794 #if GCC_VERSION >= 3000
3795 #define get_identifier(str) \
3796 (__builtin_constant_p (str) \
3797 ? get_identifier_with_length ((str), strlen (str)) \
3798 : get_identifier (str))
3802 /* Identical to get_identifier, except that the length is assumed
3805 extern tree get_identifier_with_length (const char *, size_t);
3807 /* If an identifier with the name TEXT (a null-terminated string) has
3808 previously been referred to, return that node; otherwise return
3811 extern tree maybe_get_identifier (const char *);
3813 /* Construct various types of nodes. */
3815 extern tree build_nt (enum tree_code, ...);
3816 extern tree build_nt_call_list (tree, tree);
3817 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3819 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3820 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3821 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3822 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3823 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3824 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3825 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3826 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3827 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3828 tree MEM_STAT_DECL);
3829 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3830 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3831 tree MEM_STAT_DECL);
3832 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3833 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3834 tree, tree MEM_STAT_DECL);
3835 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3836 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3838 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3839 #define build_var_debug_value(t1,t2) \
3840 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3842 extern tree build_int_cst (tree, HOST_WIDE_INT);
3843 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3844 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3845 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3846 extern tree build_int_cst_wide_type (tree,
3847 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3848 extern tree build_vector (tree, tree);
3849 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3850 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3851 extern tree build_constructor_single (tree, tree, tree);
3852 extern tree build_constructor_from_list (tree, tree);
3853 extern tree build_real_from_int_cst (tree, const_tree);
3854 extern tree build_complex (tree, tree, tree);
3855 extern tree build_one_cst (tree);
3856 extern tree build_string (int, const char *);
3857 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3858 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3859 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
3860 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3861 extern tree build_decl_stat (location_t, enum tree_code,
3862 tree, tree MEM_STAT_DECL);
3863 extern tree build_fn_decl (const char *, tree);
3864 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
3865 extern tree build_block (tree, tree, tree, tree);
3866 extern tree build_empty_stmt (location_t);
3867 extern tree build_omp_clause (location_t, enum omp_clause_code);
3869 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3870 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3872 extern tree build_call_list (tree, tree, tree);
3873 extern tree build_call_nary (tree, tree, int, ...);
3874 extern tree build_call_valist (tree, tree, int, va_list);
3875 #define build_call_array(T1,T2,N,T3)\
3876 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3877 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3878 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
3880 /* Construct various nodes representing data types. */
3882 extern tree make_signed_type (int);
3883 extern tree make_unsigned_type (int);
3884 extern tree signed_or_unsigned_type_for (int, tree);
3885 extern tree signed_type_for (tree);
3886 extern tree unsigned_type_for (tree);
3887 extern void initialize_sizetypes (bool);
3888 extern void set_sizetype (tree);
3889 extern void fixup_unsigned_type (tree);
3890 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3891 extern tree build_pointer_type (tree);
3892 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3893 extern tree build_reference_type (tree);
3894 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3895 extern tree build_vector_type (tree innertype, int nunits);
3896 extern tree build_opaque_vector_type (tree innertype, int nunits);
3897 extern tree build_type_no_quals (tree);
3898 extern tree build_index_type (tree);
3899 extern tree build_index_2_type (tree, tree);
3900 extern tree build_array_type (tree, tree);
3901 extern tree build_function_type (tree, tree);
3902 extern tree build_function_type_list (tree, ...);
3903 extern tree build_function_type_skip_args (tree, bitmap);
3904 extern tree build_function_decl_skip_args (tree, bitmap);
3905 extern tree build_varargs_function_type_list (tree, ...);
3906 extern tree build_method_type_directly (tree, tree, tree);
3907 extern tree build_method_type (tree, tree);
3908 extern tree build_offset_type (tree, tree);
3909 extern tree build_complex_type (tree);
3910 extern tree build_resx (int);
3911 extern tree array_type_nelts (const_tree);
3912 extern bool in_array_bounds_p (tree);
3913 extern bool range_in_array_bounds_p (tree);
3915 extern tree value_member (tree, tree);
3916 extern tree purpose_member (const_tree, tree);
3918 extern int attribute_list_equal (const_tree, const_tree);
3919 extern int attribute_list_contained (const_tree, const_tree);
3920 extern int tree_int_cst_equal (const_tree, const_tree);
3921 extern int tree_int_cst_lt (const_tree, const_tree);
3922 extern int tree_int_cst_compare (const_tree, const_tree);
3923 extern int host_integerp (const_tree, int);
3924 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
3925 extern int tree_int_cst_msb (const_tree);
3926 extern int tree_int_cst_sgn (const_tree);
3927 extern int tree_int_cst_sign_bit (const_tree);
3928 extern unsigned int tree_int_cst_min_precision (tree, bool);
3929 extern bool tree_expr_nonnegative_p (tree);
3930 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3931 extern bool may_negate_without_overflow_p (const_tree);
3932 extern tree strip_array_types (tree);
3933 extern tree excess_precision_type (tree);
3935 /* Construct various nodes representing fract or accum data types. */
3937 extern tree make_fract_type (int, int, int);
3938 extern tree make_accum_type (int, int, int);
3940 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3941 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3942 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3943 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3944 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3945 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3946 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3947 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3949 #define make_or_reuse_signed_fract_type(P) \
3950 make_or_reuse_fract_type (P, 0, 0)
3951 #define make_or_reuse_unsigned_fract_type(P) \
3952 make_or_reuse_fract_type (P, 1, 0)
3953 #define make_or_reuse_sat_signed_fract_type(P) \
3954 make_or_reuse_fract_type (P, 0, 1)
3955 #define make_or_reuse_sat_unsigned_fract_type(P) \
3956 make_or_reuse_fract_type (P, 1, 1)
3957 #define make_or_reuse_signed_accum_type(P) \
3958 make_or_reuse_accum_type (P, 0, 0)
3959 #define make_or_reuse_unsigned_accum_type(P) \
3960 make_or_reuse_accum_type (P, 1, 0)
3961 #define make_or_reuse_sat_signed_accum_type(P) \
3962 make_or_reuse_accum_type (P, 0, 1)
3963 #define make_or_reuse_sat_unsigned_accum_type(P) \
3964 make_or_reuse_accum_type (P, 1, 1)
3966 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3967 put the prototype here. Rtl.h does declare the prototype if
3968 tree.h had been included. */
3970 extern tree make_tree (tree, rtx);
3972 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3975 Such modified types already made are recorded so that duplicates
3978 extern tree build_type_attribute_variant (tree, tree);
3979 extern tree build_decl_attribute_variant (tree, tree);
3981 /* Structure describing an attribute and a function to handle it. */
3982 struct attribute_spec
3984 /* The name of the attribute (without any leading or trailing __),
3985 or NULL to mark the end of a table of attributes. */
3986 const char *const name;
3987 /* The minimum length of the list of arguments of the attribute. */
3988 const int min_length;
3989 /* The maximum length of the list of arguments of the attribute
3990 (-1 for no maximum). */
3991 const int max_length;
3992 /* Whether this attribute requires a DECL. If it does, it will be passed
3993 from types of DECLs, function return types and array element types to
3994 the DECLs, function types and array types respectively; but when
3995 applied to a type in any other circumstances, it will be ignored with
3996 a warning. (If greater control is desired for a given attribute,
3997 this should be false, and the flags argument to the handler may be
3998 used to gain greater control in that case.) */
3999 const bool decl_required;
4000 /* Whether this attribute requires a type. If it does, it will be passed
4001 from a DECL to the type of that DECL. */
4002 const bool type_required;
4003 /* Whether this attribute requires a function (or method) type. If it does,
4004 it will be passed from a function pointer type to the target type,
4005 and from a function return type (which is not itself a function
4006 pointer type) to the function type. */
4007 const bool function_type_required;
4008 /* Function to handle this attribute. NODE points to the node to which
4009 the attribute is to be applied. If a DECL, it should be modified in
4010 place; if a TYPE, a copy should be created. NAME is the name of the
4011 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4012 of the arguments (which may be NULL). FLAGS gives further information
4013 about the context of the attribute. Afterwards, the attributes will
4014 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4015 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4016 as well as in any other cases when the attributes should not be added
4017 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4018 applied to another type or DECL later may be returned;
4019 otherwise the return value should be NULL_TREE. This pointer may be
4020 NULL if no special handling is required beyond the checks implied
4021 by the rest of this structure. */
4022 tree (*const handler) (tree *node, tree name, tree args,
4023 int flags, bool *no_add_attrs);
4026 /* Flags that may be passed in the third argument of decl_attributes, and
4027 to handler functions for attributes. */
4028 enum attribute_flags
4030 /* The type passed in is the type of a DECL, and any attributes that
4031 should be passed in again to be applied to the DECL rather than the
4032 type should be returned. */
4033 ATTR_FLAG_DECL_NEXT = 1,
4034 /* The type passed in is a function return type, and any attributes that
4035 should be passed in again to be applied to the function type rather
4036 than the return type should be returned. */
4037 ATTR_FLAG_FUNCTION_NEXT = 2,
4038 /* The type passed in is an array element type, and any attributes that
4039 should be passed in again to be applied to the array type rather
4040 than the element type should be returned. */
4041 ATTR_FLAG_ARRAY_NEXT = 4,
4042 /* The type passed in is a structure, union or enumeration type being
4043 created, and should be modified in place. */
4044 ATTR_FLAG_TYPE_IN_PLACE = 8,
4045 /* The attributes are being applied by default to a library function whose
4046 name indicates known behavior, and should be silently ignored if they
4047 are not in fact compatible with the function type. */
4048 ATTR_FLAG_BUILT_IN = 16
4051 /* Default versions of target-overridable functions. */
4053 extern tree merge_decl_attributes (tree, tree);
4054 extern tree merge_type_attributes (tree, tree);
4056 /* Given a tree node and a string, return nonzero if the tree node is
4057 a valid attribute name for the string. */
4059 extern int is_attribute_p (const char *, const_tree);
4061 /* Given an attribute name and a list of attributes, return the list element
4062 of the attribute or NULL_TREE if not found. */
4064 extern tree lookup_attribute (const char *, tree);
4066 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4069 extern tree remove_attribute (const char *, tree);
4071 /* Given two attributes lists, return a list of their union. */
4073 extern tree merge_attributes (tree, tree);
4075 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4076 /* Given two Windows decl attributes lists, possibly including
4077 dllimport, return a list of their union . */
4078 extern tree merge_dllimport_decl_attributes (tree, tree);
4080 /* Handle a "dllimport" or "dllexport" attribute. */
4081 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4084 /* Check whether CAND is suitable to be returned from get_qualified_type
4085 (BASE, TYPE_QUALS). */
4087 extern bool check_qualified_type (const_tree, const_tree, int);
4089 /* Return a version of the TYPE, qualified as indicated by the
4090 TYPE_QUALS, if one exists. If no qualified version exists yet,
4091 return NULL_TREE. */
4093 extern tree get_qualified_type (tree, int);
4095 /* Like get_qualified_type, but creates the type if it does not
4096 exist. This function never returns NULL_TREE. */
4098 extern tree build_qualified_type (tree, int);
4100 /* Like build_qualified_type, but only deals with the `const' and
4101 `volatile' qualifiers. This interface is retained for backwards
4102 compatibility with the various front-ends; new code should use
4103 build_qualified_type instead. */
4105 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4106 build_qualified_type ((TYPE), \
4107 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4108 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4110 /* Make a copy of a type node. */
4112 extern tree build_distinct_type_copy (tree);
4113 extern tree build_variant_type_copy (tree);
4115 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4116 fields. Optionally specify an alignment, and then lay it out. */
4118 extern void finish_builtin_struct (tree, const char *,
4121 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4122 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4123 node, does nothing except for the first time. */
4125 extern void layout_type (tree);
4127 /* These functions allow a front-end to perform a manual layout of a
4128 RECORD_TYPE. (For instance, if the placement of subsequent fields
4129 depends on the placement of fields so far.) Begin by calling
4130 start_record_layout. Then, call place_field for each of the
4131 fields. Then, call finish_record_layout. See layout_type for the
4132 default way in which these functions are used. */
4134 typedef struct record_layout_info_s
4136 /* The RECORD_TYPE that we are laying out. */
4138 /* The offset into the record so far, in bytes, not including bits in
4141 /* The last known alignment of SIZE. */
4142 unsigned int offset_align;
4143 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4145 /* The alignment of the record so far, in bits. */
4146 unsigned int record_align;
4147 /* The alignment of the record so far, ignoring #pragma pack and
4148 __attribute__ ((packed)), in bits. */
4149 unsigned int unpacked_align;
4150 /* The previous field layed out. */
4152 /* The static variables (i.e., class variables, as opposed to
4153 instance variables) encountered in T. */
4154 tree pending_statics;
4155 /* Bits remaining in the current alignment group */
4156 int remaining_in_alignment;
4157 /* True if we've seen a packed field that didn't have normal
4158 alignment anyway. */
4159 int packed_maybe_necessary;
4160 } *record_layout_info;
4162 extern record_layout_info start_record_layout (tree);
4163 extern tree bit_from_pos (tree, tree);
4164 extern tree byte_from_pos (tree, tree);
4165 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4166 extern void normalize_offset (tree *, tree *, unsigned int);
4167 extern tree rli_size_unit_so_far (record_layout_info);
4168 extern tree rli_size_so_far (record_layout_info);
4169 extern void normalize_rli (record_layout_info);
4170 extern void place_field (record_layout_info, tree);
4171 extern void compute_record_mode (tree);
4172 extern void finish_record_layout (record_layout_info, int);
4174 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4175 return a canonicalized ..._TYPE node, so that duplicates are not made.
4176 How the hash code is computed is up to the caller, as long as any two
4177 callers that could hash identical-looking type nodes agree. */
4179 extern tree type_hash_canon (unsigned int, tree);
4181 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4182 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4183 fields. Call this only once for any given decl node.
4185 Second argument is the boundary that this field can be assumed to
4186 be starting at (in bits). Zero means it can be assumed aligned
4187 on any boundary that may be needed. */
4189 extern void layout_decl (tree, unsigned);
4191 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4192 a previous call to layout_decl and calls it again. */
4194 extern void relayout_decl (tree);
4196 /* Return the mode for data of a given size SIZE and mode class CLASS.
4197 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4198 The value is BLKmode if no other mode is found. This is like
4199 mode_for_size, but is passed a tree. */
4201 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4203 /* Return an expr equal to X but certainly not valid as an lvalue. */
4205 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4206 extern tree non_lvalue_loc (location_t, tree);
4208 extern tree convert (tree, tree);
4209 extern unsigned int expr_align (const_tree);
4210 extern tree expr_first (tree);
4211 extern tree expr_last (tree);
4212 extern tree size_in_bytes (const_tree);
4213 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4214 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4215 extern tree tree_expr_size (const_tree);
4216 extern tree bit_position (const_tree);
4217 extern HOST_WIDE_INT int_bit_position (const_tree);
4218 extern tree byte_position (const_tree);
4219 extern HOST_WIDE_INT int_byte_position (const_tree);
4221 /* Define data structures, macros, and functions for handling sizes
4222 and the various types used to represent sizes. */
4226 SIZETYPE, /* Normal representation of sizes in bytes. */
4227 SSIZETYPE, /* Signed representation of sizes in bytes. */
4228 BITSIZETYPE, /* Normal representation of sizes in bits. */
4229 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4232 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4234 #define sizetype sizetype_tab[(int) SIZETYPE]
4235 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4236 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4237 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4239 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4240 #define size_binop(CODE,T1,T2)\
4241 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4242 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4243 #define size_diffop(T1,T2)\
4244 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4245 extern tree size_diffop_loc (location_t, tree, tree);
4247 #define size_int(L) size_int_kind (L, SIZETYPE)
4248 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4249 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4250 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4252 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4253 extern tree round_up_loc (location_t, tree, int);
4254 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4255 extern tree round_down_loc (location_t, tree, int);
4256 extern tree get_pending_sizes (void);
4257 extern void put_pending_size (tree);
4258 extern void put_pending_sizes (tree);
4259 extern void finalize_size_functions (void);
4261 /* Type for sizes of data-type. */
4263 #define BITS_PER_UNIT_LOG \
4264 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4265 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4266 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4268 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4269 extern unsigned int maximum_field_alignment;
4270 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4271 extern unsigned int initial_max_fld_align;
4273 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4274 by making the last node in X point to Y.
4275 Returns X, except if X is 0 returns Y. */
4277 extern tree chainon (tree, tree);
4279 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4281 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4282 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4284 /* Return the last tree node in a chain. */
4286 extern tree tree_last (tree);
4288 /* Reverse the order of elements in a chain, and return the new head. */
4290 extern tree nreverse (tree);
4292 /* Returns the length of a chain of nodes
4293 (number of chain pointers to follow before reaching a null pointer). */
4295 extern int list_length (const_tree);
4297 /* Returns the number of FIELD_DECLs in a type. */
4299 extern int fields_length (const_tree);
4301 /* Given an initializer INIT, return TRUE if INIT is zero or some
4302 aggregate of zeros. Otherwise return FALSE. */
4304 extern bool initializer_zerop (const_tree);
4306 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4308 extern tree ctor_to_list (tree);
4310 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4312 extern VEC(tree,gc) *ctor_to_vec (tree);
4314 /* Examine CTOR to discover:
4315 * how many scalar fields are set to nonzero values,
4316 and place it in *P_NZ_ELTS;
4317 * how many scalar fields in total are in CTOR,
4318 and place it in *P_ELT_COUNT.
4319 * if a type is a union, and the initializer from the constructor
4320 is not the largest element in the union, then set *p_must_clear.
4322 Return whether or not CTOR is a valid static constant initializer, the same
4323 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4325 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4328 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4330 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4332 extern int integer_zerop (const_tree);
4334 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4336 extern int integer_onep (const_tree);
4338 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4339 all of whose significant bits are 1. */
4341 extern int integer_all_onesp (const_tree);
4343 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4344 exactly one bit 1. */
4346 extern int integer_pow2p (const_tree);
4348 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4349 with a nonzero value. */
4351 extern int integer_nonzerop (const_tree);
4353 extern bool cst_and_fits_in_hwi (const_tree);
4354 extern tree num_ending_zeros (const_tree);
4356 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4359 extern int fixed_zerop (const_tree);
4361 /* staticp (tree x) is nonzero if X is a reference to data allocated
4362 at a fixed address in memory. Returns the outermost data. */
4364 extern tree staticp (tree);
4366 /* save_expr (EXP) returns an expression equivalent to EXP
4367 but it can be used multiple times within context CTX
4368 and only evaluate EXP once. */
4370 extern tree save_expr (tree);
4372 /* Look inside EXPR and into any simple arithmetic operations. Return
4373 the innermost non-arithmetic node. */
4375 extern tree skip_simple_arithmetic (tree);
4377 /* Return which tree structure is used by T. */
4379 enum tree_node_structure_enum tree_node_structure (const_tree);
4381 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4382 or offset that depends on a field within a record.
4384 Note that we only allow such expressions within simple arithmetic
4387 extern bool contains_placeholder_p (const_tree);
4389 /* This macro calls the above function but short-circuits the common
4390 case of a constant to save time. Also check for null. */
4392 #define CONTAINS_PLACEHOLDER_P(EXP) \
4393 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4395 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4396 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4399 extern bool type_contains_placeholder_p (tree);
4401 /* Given a tree EXP, find all occurences of references to fields
4402 in a PLACEHOLDER_EXPR and place them in vector REFS without
4403 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4404 we assume here that EXP contains only arithmetic expressions
4405 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4408 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4410 /* This macro calls the above function but short-circuits the common
4411 case of a constant to save time and also checks for NULL. */
4413 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4415 if((EXP) && !TREE_CONSTANT (EXP)) \
4416 find_placeholder_in_expr (EXP, V); \
4419 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4420 return a tree with all occurrences of references to F in a
4421 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4422 CONST_DECLs. Note that we assume here that EXP contains only
4423 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4424 occurring only in their argument list. */
4426 extern tree substitute_in_expr (tree, tree, tree);
4428 /* This macro calls the above function but short-circuits the common
4429 case of a constant to save time and also checks for NULL. */
4431 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4432 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4434 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4435 for it within OBJ, a tree that is an object or a chain of references. */
4437 extern tree substitute_placeholder_in_expr (tree, tree);
4439 /* This macro calls the above function but short-circuits the common
4440 case of a constant to save time and also checks for NULL. */
4442 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4443 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4444 : substitute_placeholder_in_expr (EXP, OBJ))
4446 /* variable_size (EXP) is like save_expr (EXP) except that it
4447 is for the special case of something that is part of a
4448 variable size for a data type. It makes special arrangements
4449 to compute the value at the right time when the data type
4450 belongs to a function parameter. */
4452 extern tree variable_size (tree);
4454 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4455 but it can be used multiple times
4456 and only evaluate the subexpressions once. */
4458 extern tree stabilize_reference (tree);
4460 /* Subroutine of stabilize_reference; this is called for subtrees of
4461 references. Any expression with side-effects must be put in a SAVE_EXPR
4462 to ensure that it is only evaluated once. */
4464 extern tree stabilize_reference_1 (tree);
4466 /* Return EXP, stripped of any conversions to wider types
4467 in such a way that the result of converting to type FOR_TYPE
4468 is the same as if EXP were converted to FOR_TYPE.
4469 If FOR_TYPE is 0, it signifies EXP's type. */
4471 extern tree get_unwidened (tree, tree);
4473 /* Return OP or a simpler expression for a narrower value
4474 which can be sign-extended or zero-extended to give back OP.
4475 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4476 or 0 if the value should be sign-extended. */
4478 extern tree get_narrower (tree, int *);
4480 /* Return true if T is an expression that get_inner_reference handles. */
4483 handled_component_p (const_tree t)
4485 switch (TREE_CODE (t))
4490 case ARRAY_RANGE_REF:
4491 case VIEW_CONVERT_EXPR:
4501 /* Given an expression EXP that is a handled_component_p,
4502 look for the ultimate containing object, which is returned and specify
4503 the access position and size. */
4505 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4506 tree *, enum machine_mode *, int *, int *,
4509 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4510 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4511 EXP is marked as PACKED. */
4513 extern bool contains_packed_reference (const_tree exp);
4515 /* Return a tree of sizetype representing the size, in bytes, of the element
4516 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4518 extern tree array_ref_element_size (tree);
4520 /* Return a tree representing the lower bound of the array mentioned in
4521 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4523 extern tree array_ref_low_bound (tree);
4525 /* Return a tree representing the upper bound of the array mentioned in
4526 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4528 extern tree array_ref_up_bound (tree);
4530 /* Return a tree representing the offset, in bytes, of the field referenced
4531 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4533 extern tree component_ref_field_offset (tree);
4535 /* Given a DECL or TYPE, return the scope in which it was declared, or
4536 NUL_TREE if there is no containing scope. */
4538 extern tree get_containing_scope (const_tree);
4540 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4542 extern tree decl_function_context (const_tree);
4544 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4545 this _DECL with its context, or zero if none. */
4546 extern tree decl_type_context (const_tree);
4548 /* Return 1 if EXPR is the real constant zero. */
4549 extern int real_zerop (const_tree);
4551 /* Declare commonly used variables for tree structure. */
4553 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4554 Zero means allow extended lvalues. */
4556 extern int pedantic_lvalues;
4558 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4560 extern GTY(()) tree current_function_decl;
4562 /* Nonzero means a FUNC_BEGIN label was emitted. */
4563 extern GTY(()) const char * current_function_func_begin_label;
4565 /* Iterator for going through the function arguments. */
4567 tree fntype; /* function type declaration */
4568 tree next; /* TREE_LIST pointing to the next argument */
4569 } function_args_iterator;
4571 /* Initialize the iterator I with arguments from function FNDECL */
4574 function_args_iter_init (function_args_iterator *i, tree fntype)
4577 i->next = TYPE_ARG_TYPES (fntype);
4580 /* Return a pointer that holds the next argument if there are more arguments to
4581 handle, otherwise return NULL. */
4583 static inline tree *
4584 function_args_iter_cond_ptr (function_args_iterator *i)
4586 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4589 /* Return the next argument if there are more arguments to handle, otherwise
4593 function_args_iter_cond (function_args_iterator *i)
4595 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4598 /* Advance to the next argument. */
4600 function_args_iter_next (function_args_iterator *i)
4602 gcc_assert (i->next != NULL_TREE);
4603 i->next = TREE_CHAIN (i->next);
4606 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4609 inlined_function_outer_scope_p (const_tree block)
4611 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4614 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4615 to point to the next tree element. ITER is an instance of
4616 function_args_iterator used to iterate the arguments. */
4617 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4618 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4619 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4620 function_args_iter_next (&(ITER)))
4622 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4623 to the next tree element. ITER is an instance of function_args_iterator
4624 used to iterate the arguments. */
4625 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4626 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4627 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4628 function_args_iter_next (&(ITER)))
4633 extern unsigned crc32_string (unsigned, const char *);
4634 extern void clean_symbol_name (char *);
4635 extern tree get_file_function_name (const char *);
4636 extern tree get_callee_fndecl (const_tree);
4637 extern int type_num_arguments (const_tree);
4638 extern bool associative_tree_code (enum tree_code);
4639 extern bool commutative_tree_code (enum tree_code);
4640 extern tree upper_bound_in_type (tree, tree);
4641 extern tree lower_bound_in_type (tree, tree);
4642 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4643 extern tree call_expr_arg (tree, int);
4644 extern tree *call_expr_argp (tree, int);
4645 extern tree call_expr_arglist (tree);
4646 extern tree create_artificial_label (location_t);
4647 extern const char *get_name (tree);
4648 extern bool stdarg_p (tree);
4649 extern bool prototype_p (tree);
4650 extern bool auto_var_in_fn_p (const_tree, const_tree);
4651 extern tree build_low_bits_mask (tree, unsigned);
4652 extern tree tree_strip_nop_conversions (tree);
4653 extern tree tree_strip_sign_nop_conversions (tree);
4656 extern void change_decl_assembler_name (tree, tree);
4659 extern tree unshare_expr (tree);
4663 extern void expand_expr_stmt (tree);
4664 extern int warn_if_unused_value (const_tree, location_t);
4665 extern void expand_label (tree);
4666 extern void expand_goto (tree);
4668 extern rtx expand_stack_save (void);
4669 extern void expand_stack_restore (tree);
4670 extern void expand_return (tree);
4673 extern void using_eh_for_cleanups (void);
4675 /* In fold-const.c */
4677 /* Non-zero if we are folding constants inside an initializer; zero
4679 extern int folding_initializer;
4681 /* Convert between trees and native memory representation. */
4682 extern int native_encode_expr (const_tree, unsigned char *, int);
4683 extern tree native_interpret_expr (tree, const unsigned char *, int);
4685 /* Fold constants as much as possible in an expression.
4686 Returns the simplified expression.
4687 Acts only on the top level of the expression;
4688 if the argument itself cannot be simplified, its
4689 subexpressions are not changed. */
4691 extern tree fold (tree);
4692 #define fold_unary(CODE,T1,T2)\
4693 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4694 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4695 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4696 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4697 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4698 #define fold_binary(CODE,T1,T2,T3)\
4699 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4700 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4701 #define fold_ternary(CODE,T1,T2,T3,T4)\
4702 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4703 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4704 #define fold_build1(c,t1,t2)\
4705 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4706 #define fold_build1_loc(l,c,t1,t2)\
4707 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4708 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4709 tree MEM_STAT_DECL);
4710 #define fold_build2(c,t1,t2,t3)\
4711 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4712 #define fold_build2_loc(l,c,t1,t2,t3)\
4713 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4714 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4715 tree MEM_STAT_DECL);
4716 #define fold_build3(c,t1,t2,t3,t4)\
4717 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4718 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4719 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4720 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4721 tree MEM_STAT_DECL);
4722 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4723 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4724 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4725 #define fold_build_call_array(T1,T2,N,T4)\
4726 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4727 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4728 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4729 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4730 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4731 extern bool fold_convertible_p (const_tree, const_tree);
4732 #define fold_convert(T1,T2)\
4733 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4734 extern tree fold_convert_loc (location_t, tree, tree);
4735 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4736 extern tree fold_ignored_result (tree);
4737 extern tree fold_abs_const (tree, tree);
4738 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4739 extern void fold_defer_overflow_warnings (void);
4740 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4741 extern void fold_undefer_and_ignore_overflow_warnings (void);
4742 extern bool fold_deferring_overflow_warnings_p (void);
4744 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4747 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4748 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4749 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4750 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4751 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4753 #define add_double(l1,h1,l2,h2,lv,hv) \
4754 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4755 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4756 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4757 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4758 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4759 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4761 #define mul_double(l1,h1,l2,h2,lv,hv) \
4762 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4763 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4764 HOST_WIDE_INT, unsigned int,
4765 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4766 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4767 HOST_WIDE_INT, unsigned int,
4768 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4769 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4770 HOST_WIDE_INT, unsigned int,
4771 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4772 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4773 HOST_WIDE_INT, unsigned int,
4774 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4776 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4777 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4778 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4779 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4782 enum operand_equal_flag
4788 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4789 extern int multiple_of_p (tree, const_tree, const_tree);
4790 #define omit_one_operand(T1,T2,T3)\
4791 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4792 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4793 #define omit_two_operands(T1,T2,T3,T4)\
4794 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4795 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4796 #define invert_truthvalue(T)\
4797 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4798 extern tree invert_truthvalue_loc (location_t, tree);
4799 extern tree fold_truth_not_expr (location_t, tree);
4800 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4801 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4802 extern tree fold_read_from_constant_string (tree);
4803 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4804 #define build_fold_addr_expr(T)\
4805 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4806 extern tree build_fold_addr_expr_loc (location_t, tree);
4807 #define build_fold_addr_expr_with_type(T,TYPE)\
4808 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4809 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4810 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4811 extern tree fold_strip_sign_ops (tree);
4812 #define build_fold_indirect_ref(T)\
4813 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4814 extern tree build_fold_indirect_ref_loc (location_t, tree);
4815 #define fold_indirect_ref(T)\
4816 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4817 extern tree fold_indirect_ref_loc (location_t, tree);
4818 extern tree constant_boolean_node (int, tree);
4819 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
4821 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4822 extern enum tree_code swap_tree_comparison (enum tree_code);
4824 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4825 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4827 extern bool tree_expr_nonzero_p (tree);
4828 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4829 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4831 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4832 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4833 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4835 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4836 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4837 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
4839 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4841 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4842 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
4843 enum tree_code, tree, tree, tree);
4844 extern void debug_fold_checksum (const_tree);
4846 /* Return nonzero if CODE is a tree code that represents a truth value. */
4848 truth_value_p (enum tree_code code)
4850 return (TREE_CODE_CLASS (code) == tcc_comparison
4851 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4852 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4853 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4858 extern tree fold_call_expr (location_t, tree, bool);
4859 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4860 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4861 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4862 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4863 enum built_in_function);
4864 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4865 enum built_in_function);
4866 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
4867 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
4868 extern bool fold_builtin_next_arg (tree, bool);
4869 extern enum built_in_function builtin_mathfn_code (const_tree);
4870 extern tree build_function_call_expr (location_t, tree, tree);
4871 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4872 #define build_call_expr(...)\
4873 build_call_expr_loc (UNKNOWN_LOCATION, __VA_ARGS__)
4874 extern tree build_call_expr_loc (location_t, tree, int, ...);
4875 extern tree mathfn_built_in (tree, enum built_in_function fn);
4876 extern tree c_strlen (tree, int);
4877 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
4878 extern tree build_va_arg_indirect_ref (tree);
4879 extern tree build_string_literal (int, const char *);
4880 extern bool validate_arglist (const_tree, ...);
4881 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4882 extern bool can_trust_pointer_alignment (void);
4883 extern int get_pointer_alignment (tree, unsigned int);
4884 extern bool is_builtin_name (const char*);
4885 extern int get_object_alignment (tree, unsigned int, unsigned int);
4886 extern tree fold_call_stmt (gimple, bool);
4887 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
4888 extern tree make_range (tree, int *, tree *, tree *, bool *);
4889 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
4890 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
4894 extern tree strip_float_extensions (tree);
4897 extern int really_constant_p (const_tree);
4898 extern bool decl_address_invariant_p (const_tree);
4899 extern bool decl_address_ip_invariant_p (const_tree);
4900 extern int int_fits_type_p (const_tree, const_tree);
4901 #ifndef GENERATOR_FILE
4902 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4904 extern bool variably_modified_type_p (tree, tree);
4905 extern int tree_log2 (const_tree);
4906 extern int tree_floor_log2 (const_tree);
4907 extern int simple_cst_equal (const_tree, const_tree);
4908 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4909 extern hashval_t iterative_hash_exprs_commutative (const_tree,
4910 const_tree, hashval_t);
4911 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4912 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
4913 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4914 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4915 extern int type_list_equal (const_tree, const_tree);
4916 extern int chain_member (const_tree, const_tree);
4917 extern tree type_hash_lookup (unsigned int, tree);
4918 extern void type_hash_add (unsigned int, tree);
4919 extern int simple_cst_list_equal (const_tree, const_tree);
4920 extern void dump_tree_statistics (void);
4921 extern void recompute_tree_invariant_for_addr_expr (tree);
4922 extern bool needs_to_live_in_memory (const_tree);
4923 extern tree reconstruct_complex_type (tree, tree);
4925 extern int real_onep (const_tree);
4926 extern int real_twop (const_tree);
4927 extern int real_minus_onep (const_tree);
4928 extern void init_ttree (void);
4929 extern void build_common_tree_nodes (bool, bool);
4930 extern void build_common_tree_nodes_2 (int);
4931 extern void build_common_builtin_nodes (void);
4932 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4933 extern tree build_range_type (tree, tree, tree);
4934 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4935 extern HOST_WIDE_INT int_cst_value (const_tree);
4936 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
4938 extern bool fields_compatible_p (const_tree, const_tree);
4939 extern tree find_compatible_field (tree, tree);
4941 extern tree *tree_block (tree);
4942 extern location_t *block_nonartificial_location (tree);
4943 extern location_t tree_nonartificial_location (tree);
4945 extern tree block_ultimate_origin (const_tree);
4947 /* In tree-nested.c */
4948 extern tree build_addr (tree, tree);
4951 extern void expand_main_function (void);
4952 extern void expand_function_end (void);
4953 extern void expand_function_start (tree);
4954 extern void stack_protect_prologue (void);
4955 extern void stack_protect_epilogue (void);
4956 extern void init_dummy_function_start (void);
4957 extern void expand_dummy_function_end (void);
4958 extern unsigned int init_function_for_compilation (void);
4959 extern void allocate_struct_function (tree, bool);
4960 extern void push_struct_function (tree fndecl);
4961 extern void init_function_start (tree);
4962 extern bool use_register_for_decl (const_tree);
4963 extern void generate_setjmp_warnings (void);
4964 extern void init_temp_slots (void);
4965 extern void free_temp_slots (void);
4966 extern void pop_temp_slots (void);
4967 extern void push_temp_slots (void);
4968 extern void preserve_temp_slots (rtx);
4969 extern int aggregate_value_p (const_tree, const_tree);
4970 extern void push_function_context (void);
4971 extern void pop_function_context (void);
4972 extern gimple_seq gimplify_parameters (void);
4974 /* In print-rtl.c */
4976 extern void print_rtl (FILE *, const_rtx);
4979 /* In print-tree.c */
4980 extern void debug_tree (tree);
4982 extern void dump_addr (FILE*, const char *, const void *);
4983 extern void print_node (FILE *, const char *, tree, int);
4984 extern void print_node_brief (FILE *, const char *, const_tree, int);
4985 extern void indent_to (FILE *, int);
4988 /* In tree-inline.c: */
4989 extern bool debug_find_tree (tree, tree);
4990 /* This is in tree-inline.c since the routine uses
4991 data structures from the inliner. */
4992 extern tree unsave_expr_now (tree);
4993 extern tree build_duplicate_type (tree);
4997 /* Nonzero if this is a call to a function whose return value depends
4998 solely on its arguments, has no side effects, and does not read
4999 global memory. This corresponds to TREE_READONLY for function
5001 #define ECF_CONST (1 << 0)
5002 /* Nonzero if this is a call to "pure" function (like const function,
5003 but may read memory. This corresponds to DECL_PURE_P for function
5005 #define ECF_PURE (1 << 1)
5006 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5007 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5008 for function decls.*/
5009 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5010 /* Nonzero if this call will never return. */
5011 #define ECF_NORETURN (1 << 3)
5012 /* Nonzero if this is a call to malloc or a related function. */
5013 #define ECF_MALLOC (1 << 4)
5014 /* Nonzero if it is plausible that this is a call to alloca. */
5015 #define ECF_MAY_BE_ALLOCA (1 << 5)
5016 /* Nonzero if this is a call to a function that won't throw an exception. */
5017 #define ECF_NOTHROW (1 << 6)
5018 /* Nonzero if this is a call to setjmp or a related function. */
5019 #define ECF_RETURNS_TWICE (1 << 7)
5020 /* Nonzero if this call replaces the current stack frame. */
5021 #define ECF_SIBCALL (1 << 8)
5022 /* Function does not read or write memory (but may have side effects, so
5023 it does not necessarily fit ECF_CONST). */
5024 #define ECF_NOVOPS (1 << 9)
5026 extern int flags_from_decl_or_type (const_tree);
5027 extern int call_expr_flags (const_tree);
5029 extern int setjmp_call_p (const_tree);
5030 extern bool gimple_alloca_call_p (const_gimple);
5031 extern bool alloca_call_p (const_tree);
5032 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5033 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5037 extern const struct attribute_spec *lookup_attribute_spec (tree);
5039 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5040 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5041 it should be modified in place; if a TYPE, a copy should be created
5042 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5043 information, in the form of a bitwise OR of flags in enum attribute_flags
5044 from tree.h. Depending on these flags, some attributes may be
5045 returned to be applied at a later stage (for example, to apply
5046 a decl attribute to the declaration rather than to its type). */
5047 extern tree decl_attributes (tree *, tree, int);
5049 /* In integrate.c */
5050 extern void set_decl_abstract_flags (tree, int);
5051 extern void set_decl_origin_self (tree);
5053 /* In stor-layout.c */
5054 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5055 extern void fixup_signed_type (tree);
5056 extern void internal_reference_types (void);
5057 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5060 extern void make_decl_rtl (tree);
5061 extern void make_decl_one_only (tree, tree);
5062 extern int supports_one_only (void);
5063 extern void resolve_unique_section (tree, int, int);
5064 extern void mark_referenced (tree);
5065 extern void mark_decl_referenced (tree);
5066 extern void notice_global_symbol (tree);
5067 extern void set_user_assembler_name (tree, const char *);
5068 extern void process_pending_assemble_externals (void);
5069 extern void finish_aliases_1 (void);
5070 extern void finish_aliases_2 (void);
5071 extern tree emutls_decl (tree);
5072 extern void remove_unreachable_alias_pairs (void);
5075 extern void expand_computed_goto (tree);
5076 extern bool parse_output_constraint (const char **, int, int, int,
5077 bool *, bool *, bool *);
5078 extern bool parse_input_constraint (const char **, int, int, int, int,
5079 const char * const *, bool *, bool *);
5080 extern void expand_asm_stmt (gimple);
5081 extern tree resolve_asm_operand_names (tree, tree, tree);
5082 extern void expand_case (gimple);
5083 extern void expand_decl (tree);
5085 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5086 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5090 /* In dwarf2out.c */
5091 /* Interface of the DWARF2 unwind info support. */
5093 /* Generate a new label for the CFI info to refer to. */
5095 extern char *dwarf2out_cfi_label (bool);
5097 /* Entry point to update the canonical frame address (CFA). */
5099 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5101 /* Add the CFI for saving a register window. */
5103 extern void dwarf2out_window_save (const char *);
5105 /* Add a CFI to update the running total of the size of arguments pushed
5108 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5110 /* Entry point for saving a register to the stack. */
5112 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5114 /* Entry point for saving the return address in the stack. */
5116 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5118 /* Entry point for saving the return address in a register. */
5120 extern void dwarf2out_return_reg (const char *, unsigned);
5122 /* Entry point for saving the first register into the second. */
5124 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5126 /* In tree-inline.c */
5128 /* The type of a set of already-visited pointers. Functions for creating
5129 and manipulating it are declared in pointer-set.h */
5130 struct pointer_set_t;
5132 /* The type of a callback function for walking over tree structure. */
5134 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5136 /* The type of a callback function that represents a custom walk_tree. */
5138 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5139 void *, struct pointer_set_t*);
5141 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5143 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5145 #define walk_tree(a,b,c,d) \
5146 walk_tree_1 (a, b, c, d, NULL)
5147 #define walk_tree_without_duplicates(a,b,c) \
5148 walk_tree_without_duplicates_1 (a, b, c, NULL)
5151 /* Assign the RTX to declaration. */
5153 extern void set_decl_rtl (tree, rtx);
5154 extern void set_decl_incoming_rtl (tree, rtx, bool);
5156 /* Enum and arrays used for tree allocation stats.
5157 Keep in sync with tree.c:tree_node_kind_names. */
5181 extern int tree_node_counts[];
5182 extern int tree_node_sizes[];
5184 /* True if we are in gimple form and the actions of the folders need to
5185 be restricted. False if we are not in gimple form and folding is not
5186 restricted to creating gimple expressions. */
5187 extern bool in_gimple_form;
5190 extern tree get_base_address (tree t);
5191 extern void mark_addressable (tree);
5193 /* In tree-vectorizer.c. */
5194 extern void vect_set_verbosity_level (const char *);
5198 struct GTY(()) tree_map_base {
5202 extern int tree_map_base_eq (const void *, const void *);
5203 extern unsigned int tree_map_base_hash (const void *);
5204 extern int tree_map_base_marked_p (const void *);
5205 extern bool list_equal_p (const_tree, const_tree);
5207 /* Map from a tree to another tree. */
5209 struct GTY(()) tree_map {
5210 struct tree_map_base base;
5215 #define tree_map_eq tree_map_base_eq
5216 extern unsigned int tree_map_hash (const void *);
5217 #define tree_map_marked_p tree_map_base_marked_p
5219 /* Map from a tree to an int. */
5221 struct GTY(()) tree_int_map {
5222 struct tree_map_base base;
5226 #define tree_int_map_eq tree_map_base_eq
5227 #define tree_int_map_hash tree_map_base_hash
5228 #define tree_int_map_marked_p tree_map_base_marked_p
5230 /* Map from a tree to initialization/finalization priorities. */
5232 struct GTY(()) tree_priority_map {
5233 struct tree_map_base base;
5238 #define tree_priority_map_eq tree_map_base_eq
5239 #define tree_priority_map_hash tree_map_base_hash
5240 #define tree_priority_map_marked_p tree_map_base_marked_p
5244 tree target_for_debug_bind (tree);
5246 /* In tree-ssa-ccp.c */
5247 extern tree maybe_fold_offset_to_reference (location_t, tree, tree, tree);
5248 extern tree maybe_fold_offset_to_address (location_t, tree, tree, tree);
5249 extern tree maybe_fold_stmt_addition (location_t, tree, tree, tree);
5251 /* In tree-ssa-address.c. */
5252 extern tree tree_mem_ref_addr (tree, tree);
5253 extern void copy_mem_ref_info (tree, tree);
5256 extern bool ssa_name_nonnegative_p (const_tree);
5258 /* In tree-object-size.c. */
5259 extern void init_object_sizes (void);
5260 extern void fini_object_sizes (void);
5261 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5264 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5266 /* In tree-inline.c. */
5268 void init_inline_once (void);
5270 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5271 extern GTY(()) tree memory_identifier_string;
5273 /* Compute the number of operands in an expression node NODE. For
5274 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5275 otherwise it is looked up from the node's code. */
5277 tree_operand_length (const_tree node)
5279 if (VL_EXP_CLASS_P (node))
5280 return VL_EXP_OPERAND_LENGTH (node);
5282 return TREE_CODE_LENGTH (TREE_CODE (node));
5285 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5286 have to go towards the end of tree.h so that union tree_node is fully
5287 defined by this point. */
5289 /* Structure containing iterator state. */
5290 typedef struct GTY (()) call_expr_arg_iterator_d {
5291 tree t; /* the call_expr */
5292 int n; /* argument count */
5293 int i; /* next argument index */
5294 } call_expr_arg_iterator;
5296 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5297 const_tree t; /* the call_expr */
5298 int n; /* argument count */
5299 int i; /* next argument index */
5300 } const_call_expr_arg_iterator;
5302 /* Initialize the abstract argument list iterator object ITER with the
5303 arguments from CALL_EXPR node EXP. */
5305 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5308 iter->n = call_expr_nargs (exp);
5313 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5316 iter->n = call_expr_nargs (exp);
5320 /* Return the next argument from abstract argument list iterator object ITER,
5321 and advance its state. Return NULL_TREE if there are no more arguments. */
5323 next_call_expr_arg (call_expr_arg_iterator *iter)
5326 if (iter->i >= iter->n)
5328 result = CALL_EXPR_ARG (iter->t, iter->i);
5333 static inline const_tree
5334 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5337 if (iter->i >= iter->n)
5339 result = CALL_EXPR_ARG (iter->t, iter->i);
5344 /* Initialize the abstract argument list iterator object ITER, then advance
5345 past and return the first argument. Useful in for expressions, e.g.
5346 for (arg = first_call_expr_arg (exp, &iter); arg;
5347 arg = next_call_expr_arg (&iter)) */
5349 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5351 init_call_expr_arg_iterator (exp, iter);
5352 return next_call_expr_arg (iter);
5355 static inline const_tree
5356 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5358 init_const_call_expr_arg_iterator (exp, iter);
5359 return next_const_call_expr_arg (iter);
5362 /* Test whether there are more arguments in abstract argument list iterator
5363 ITER, without changing its state. */
5365 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5367 return (iter->i < iter->n);
5371 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5373 return (iter->i < iter->n);
5376 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5377 (of type call_expr_arg_iterator) to hold the iteration state. */
5378 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5379 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5380 (arg) = next_call_expr_arg (&(iter)))
5382 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5383 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5384 (arg) = next_const_call_expr_arg (&(iter)))
5386 #endif /* GCC_TREE_H */