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 TYPE_REF_CAN_ALIAS_ALL in
448 POINTER_TYPE, REFERENCE_TYPE
456 CALL_CANNOT_INLINE_P in
462 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
465 VAR_DECL, FUNCTION_DECL
471 CALL_EXPR_VA_ARG_PACK in
474 TYPE_CACHED_VALUES_P in
477 SAVE_EXPR_RESOLVED_P in
480 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
481 OMP_CLAUSE_LASTPRIVATE
483 OMP_CLAUSE_PRIVATE_DEBUG in
491 CALL_EXPR_RETURN_SLOT_OPT in
497 OMP_PARALLEL_COMBINED in
499 OMP_CLAUSE_PRIVATE_OUTER_REF in
523 TREE_THIS_VOLATILE in
546 TYPE_SIZES_GIMPLIFIED in
557 REGISTER_DEFS_IN_THIS_STMT in
558 all expressions (tree-into-ssa.c)
563 VAR_DECL, FUNCTION_DECL
564 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
565 BLOCK, SSA_NAME, STRING_CST
568 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
587 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
595 IDENTIFIER_TRANSPARENT_ALIAS in
598 STMT_IN_SSA_EDGE_WORKLIST in
599 all expressions (tree-ssa-propagate.c)
604 all trees (used liberally by many passes)
619 TYPE_VECTOR_OPAQUE in
622 SSA_NAME_IS_DEFAULT_DEF in
627 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
628 enum tree_node_structure_enum {
629 #include "treestruct.def"
634 /* Define accessors for the fields that all tree nodes have
635 (though some fields are not used for all kinds of nodes). */
637 /* The tree-code says what kind of node it is.
638 Codes are defined in tree.def. */
639 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
640 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
642 /* When checking is enabled, errors will be generated if a tree node
643 is accessed incorrectly. The macros die with a fatal error. */
644 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
646 #define TREE_CHECK(T, CODE) __extension__ \
647 ({ __typeof (T) const __t = (T); \
648 if (TREE_CODE (__t) != (CODE)) \
649 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
653 #define TREE_NOT_CHECK(T, CODE) __extension__ \
654 ({ __typeof (T) const __t = (T); \
655 if (TREE_CODE (__t) == (CODE)) \
656 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
660 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
661 ({ __typeof (T) const __t = (T); \
662 if (TREE_CODE (__t) != (CODE1) \
663 && TREE_CODE (__t) != (CODE2)) \
664 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
665 (CODE1), (CODE2), 0); \
668 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
669 ({ __typeof (T) const __t = (T); \
670 if (TREE_CODE (__t) == (CODE1) \
671 || TREE_CODE (__t) == (CODE2)) \
672 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
673 (CODE1), (CODE2), 0); \
676 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
677 ({ __typeof (T) const __t = (T); \
678 if (TREE_CODE (__t) != (CODE1) \
679 && TREE_CODE (__t) != (CODE2) \
680 && TREE_CODE (__t) != (CODE3)) \
681 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
682 (CODE1), (CODE2), (CODE3), 0); \
685 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
686 ({ __typeof (T) const __t = (T); \
687 if (TREE_CODE (__t) == (CODE1) \
688 || TREE_CODE (__t) == (CODE2) \
689 || TREE_CODE (__t) == (CODE3)) \
690 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
691 (CODE1), (CODE2), (CODE3), 0); \
694 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
695 ({ __typeof (T) const __t = (T); \
696 if (TREE_CODE (__t) != (CODE1) \
697 && TREE_CODE (__t) != (CODE2) \
698 && TREE_CODE (__t) != (CODE3) \
699 && TREE_CODE (__t) != (CODE4)) \
700 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
701 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
704 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
705 ({ __typeof (T) const __t = (T); \
706 if (TREE_CODE (__t) == (CODE1) \
707 || TREE_CODE (__t) == (CODE2) \
708 || TREE_CODE (__t) == (CODE3) \
709 || TREE_CODE (__t) == (CODE4)) \
710 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
711 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
714 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
715 ({ __typeof (T) const __t = (T); \
716 if (TREE_CODE (__t) != (CODE1) \
717 && TREE_CODE (__t) != (CODE2) \
718 && TREE_CODE (__t) != (CODE3) \
719 && TREE_CODE (__t) != (CODE4) \
720 && TREE_CODE (__t) != (CODE5)) \
721 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
722 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
725 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
726 ({ __typeof (T) const __t = (T); \
727 if (TREE_CODE (__t) == (CODE1) \
728 || TREE_CODE (__t) == (CODE2) \
729 || TREE_CODE (__t) == (CODE3) \
730 || TREE_CODE (__t) == (CODE4) \
731 || TREE_CODE (__t) == (CODE5)) \
732 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
733 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
736 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
737 ({ __typeof (T) const __t = (T); \
738 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
739 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
743 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
746 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
750 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
751 ({ __typeof (T) const __t = (T); \
752 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
753 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
757 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
758 ({ __typeof (T) const __t = (T); \
759 if (TREE_CODE (__t) != OMP_CLAUSE) \
760 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
762 if (__t->omp_clause.code != (CODE)) \
763 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
767 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
768 ({ __typeof (T) const __t = (T); \
769 if (TREE_CODE (__t) != OMP_CLAUSE) \
770 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
772 if ((int) __t->omp_clause.code < (int) (CODE1) \
773 || (int) __t->omp_clause.code > (int) (CODE2)) \
774 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
775 __FUNCTION__, (CODE1), (CODE2)); \
778 /* These checks have to be special cased. */
779 #define EXPR_CHECK(T) __extension__ \
780 ({ __typeof (T) const __t = (T); \
781 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
782 if (!IS_EXPR_CODE_CLASS (__c)) \
783 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
787 /* These checks have to be special cased. */
788 #define NON_TYPE_CHECK(T) __extension__ \
789 ({ __typeof (T) const __t = (T); \
791 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
795 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
796 (*({__typeof (T) const __t = (T); \
797 const int __i = (I); \
798 if (TREE_CODE (__t) != TREE_VEC) \
799 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
801 if (__i < 0 || __i >= __t->vec.length) \
802 tree_vec_elt_check_failed (__i, __t->vec.length, \
803 __FILE__, __LINE__, __FUNCTION__); \
804 &__t->vec.a[__i]; }))
806 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
807 (*({__typeof (T) const __t = (T); \
808 const int __i = (I); \
809 if (TREE_CODE (__t) != OMP_CLAUSE) \
810 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
812 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
813 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
815 &__t->omp_clause.ops[__i]; }))
817 /* Special checks for TREE_OPERANDs. */
818 #define TREE_OPERAND_CHECK(T, I) __extension__ \
819 (*({__typeof (T) const __t = EXPR_CHECK (T); \
820 const int __i = (I); \
821 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
822 tree_operand_check_failed (__i, __t, \
823 __FILE__, __LINE__, __FUNCTION__); \
824 &__t->exp.operands[__i]; }))
826 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
827 (*({__typeof (T) const __t = (T); \
828 const int __i = (I); \
829 if (TREE_CODE (__t) != CODE) \
830 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
831 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
832 tree_operand_check_failed (__i, __t, \
833 __FILE__, __LINE__, __FUNCTION__); \
834 &__t->exp.operands[__i]; }))
836 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
838 ({__typeof (T) const __t = (T); \
839 const int __i = (I); \
840 if (TREE_CODE (__t) != (CODE)) \
841 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
842 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
843 tree_operand_check_failed (__i, __t, \
844 __FILE__, __LINE__, __FUNCTION__); \
845 &__t->exp.operands[__i]; }))
847 /* Nodes are chained together for many purposes.
848 Types are chained together to record them for being output to the debugger
849 (see the function `chain_type').
850 Decls in the same scope are chained together to record the contents
852 Statement nodes for successive statements used to be chained together.
853 Often lists of things are represented by TREE_LIST nodes that
854 are chained together. */
856 #define TREE_CHAIN(NODE) __extension__ \
857 (*({__typeof (NODE) const __t = (NODE); \
858 &__t->common.chain; }))
860 /* In all nodes that are expressions, this is the data type of the expression.
861 In POINTER_TYPE nodes, this is the type that the pointer points to.
862 In ARRAY_TYPE nodes, this is the type of the elements.
863 In VECTOR_TYPE nodes, this is the type of the elements. */
864 #define TREE_TYPE(NODE) __extension__ \
865 (*({__typeof (NODE) const __t = (NODE); \
866 &__t->common.type; }))
868 extern void tree_contains_struct_check_failed (const_tree,
869 const enum tree_node_structure_enum,
870 const char *, int, const char *)
873 extern void tree_check_failed (const_tree, const char *, int, const char *,
874 ...) ATTRIBUTE_NORETURN;
875 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
876 ...) ATTRIBUTE_NORETURN;
877 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
878 const char *, int, const char *)
880 extern void tree_range_check_failed (const_tree, const char *, int,
881 const char *, enum tree_code,
883 extern void tree_not_class_check_failed (const_tree,
884 const enum tree_code_class,
885 const char *, int, const char *)
887 extern void tree_vec_elt_check_failed (int, int, const char *,
890 extern void phi_node_elt_check_failed (int, int, const char *,
893 extern void tree_operand_check_failed (int, const_tree,
894 const char *, int, const char *)
896 extern void omp_clause_check_failed (const_tree, const char *, int,
897 const char *, enum omp_clause_code)
899 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
902 extern void omp_clause_range_check_failed (const_tree, const char *, int,
903 const char *, enum omp_clause_code,
904 enum omp_clause_code)
907 #else /* not ENABLE_TREE_CHECKING, or not gcc */
909 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
910 #define TREE_CHECK(T, CODE) (T)
911 #define TREE_NOT_CHECK(T, CODE) (T)
912 #define TREE_CHECK2(T, CODE1, CODE2) (T)
913 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
914 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
915 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
916 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
917 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
918 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
919 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
920 #define TREE_CLASS_CHECK(T, CODE) (T)
921 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
922 #define EXPR_CHECK(T) (T)
923 #define NON_TYPE_CHECK(T) (T)
924 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
925 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
926 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
927 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
928 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
929 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
930 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
932 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
933 #define TREE_TYPE(NODE) ((NODE)->common.type)
937 #define TREE_BLOCK(NODE) *(tree_block (NODE))
939 #include "tree-check.h"
941 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
942 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
943 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
944 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
945 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
946 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
947 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
948 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
949 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
950 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
951 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
953 #define RECORD_OR_UNION_CHECK(T) \
954 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
955 #define NOT_RECORD_OR_UNION_CHECK(T) \
956 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
958 #define NUMERICAL_TYPE_CHECK(T) \
959 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
962 /* Here is how primitive or already-canonicalized types' hash codes
964 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
966 /* A simple hash function for an arbitrary tree node. This must not be
967 used in hash tables which are saved to a PCH. */
968 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
970 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
971 #define CONVERT_EXPR_CODE_P(CODE) \
972 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
974 /* Similarly, but accept an expressions instead of a tree code. */
975 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
977 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
979 #define CASE_CONVERT \
983 /* Given an expression as a tree, strip any conversion that generates
984 no instruction. Accepts both tree and const_tree arguments since
985 we are not modifying the tree itself. */
987 #define STRIP_NOPS(EXP) \
988 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
990 /* Like STRIP_NOPS, but don't let the signedness change either. */
992 #define STRIP_SIGN_NOPS(EXP) \
993 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
995 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
997 #define STRIP_TYPE_NOPS(EXP) \
998 while ((CONVERT_EXPR_P (EXP) \
999 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1000 && TREE_OPERAND (EXP, 0) != error_mark_node \
1001 && (TREE_TYPE (EXP) \
1002 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1003 (EXP) = TREE_OPERAND (EXP, 0)
1005 /* Remove unnecessary type conversions according to
1006 tree_ssa_useless_type_conversion. */
1008 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1009 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1011 /* Nonzero if TYPE represents an integral type. Note that we do not
1012 include COMPLEX types here. Keep these checks in ascending code
1015 #define INTEGRAL_TYPE_P(TYPE) \
1016 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1017 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1018 || TREE_CODE (TYPE) == INTEGER_TYPE)
1020 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1022 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1023 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1025 /* Nonzero if TYPE represents a saturating fixed-point type. */
1027 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1028 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1030 /* Nonzero if TYPE represents a fixed-point type. */
1032 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1034 /* Nonzero if TYPE represents a scalar floating-point type. */
1036 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1038 /* Nonzero if TYPE represents a complex floating-point type. */
1040 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1041 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1042 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1044 /* Nonzero if TYPE represents a vector floating-point type. */
1046 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1047 (TREE_CODE (TYPE) == VECTOR_TYPE \
1048 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1050 /* Nonzero if TYPE represents a floating-point type, including complex
1051 and vector floating-point types. The vector and complex check does
1052 not use the previous two macros to enable early folding. */
1054 #define FLOAT_TYPE_P(TYPE) \
1055 (SCALAR_FLOAT_TYPE_P (TYPE) \
1056 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1057 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1058 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1060 /* Nonzero if TYPE represents a decimal floating-point type. */
1061 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1062 (SCALAR_FLOAT_TYPE_P (TYPE) \
1063 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1065 /* Nonzero if TYPE is a record or union type. */
1066 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1067 (TREE_CODE (TYPE) == RECORD_TYPE \
1068 || TREE_CODE (TYPE) == UNION_TYPE \
1069 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1071 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1072 Keep these checks in ascending code order. */
1074 #define AGGREGATE_TYPE_P(TYPE) \
1075 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1077 /* Nonzero if TYPE represents a pointer or reference type.
1078 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1079 ascending code order. */
1081 #define POINTER_TYPE_P(TYPE) \
1082 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1084 /* Nonzero if this type is a complete type. */
1085 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1087 /* Nonzero if this type is the (possibly qualified) void type. */
1088 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1090 /* Nonzero if this type is complete or is cv void. */
1091 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1092 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1094 /* Nonzero if this type is complete or is an array with unspecified bound. */
1095 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1096 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1099 /* Define many boolean fields that all tree nodes have. */
1101 /* In VAR_DECL nodes, nonzero means address of this is needed.
1102 So it cannot be in a register.
1103 In a FUNCTION_DECL, nonzero means its address is needed.
1104 So it must be compiled even if it is an inline function.
1105 In a FIELD_DECL node, it means that the programmer is permitted to
1106 construct the address of this field. This is used for aliasing
1107 purposes: see record_component_aliases.
1108 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1109 In LABEL_DECL nodes, it means a goto for this label has been seen
1110 from a place outside all binding contours that restore stack levels.
1111 In ..._TYPE nodes, it means that objects of this type must
1112 be fully addressable. This means that pieces of this
1113 object cannot go into register parameters, for example.
1114 In IDENTIFIER_NODEs, this means that some extern decl for this name
1115 had its address taken. That matters for inline functions. */
1116 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1118 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1119 exit of a function. Calls for which this is true are candidates for tail
1120 call optimizations. */
1121 #define CALL_EXPR_TAILCALL(NODE) \
1122 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1124 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1125 CASE_LOW operand has been processed. */
1126 #define CASE_LOW_SEEN(NODE) \
1127 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1129 #define PREDICT_EXPR_OUTCOME(NODE) \
1130 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1131 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1132 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1133 #define PREDICT_EXPR_PREDICTOR(NODE) \
1134 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1136 /* In a VAR_DECL, nonzero means allocate static storage.
1137 In a FUNCTION_DECL, nonzero if function has been defined.
1138 In a CONSTRUCTOR, nonzero means allocate static storage. */
1139 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1141 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1142 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1144 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1145 should only be executed if an exception is thrown, not on normal exit
1147 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1149 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1150 separate cleanup in honor_protect_cleanup_actions. */
1151 #define TRY_CATCH_IS_CLEANUP(NODE) \
1152 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1154 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1155 CASE_HIGH operand has been processed. */
1156 #define CASE_HIGH_SEEN(NODE) \
1157 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1159 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1160 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1162 /* In an expr node (usually a conversion) this means the node was made
1163 implicitly and should not lead to any sort of warning. In a decl node,
1164 warnings concerning the decl should be suppressed. This is used at
1165 least for used-before-set warnings, and it set after one warning is
1167 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1169 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1170 this string as an argument. */
1171 #define TREE_SYMBOL_REFERENCED(NODE) \
1172 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1174 /* Nonzero in a pointer or reference type means the data pointed to
1175 by this type can alias anything. */
1176 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1177 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1179 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1180 #define MOVE_NONTEMPORAL(NODE) \
1181 (EXPR_CHECK (NODE)->base.static_flag)
1183 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1184 there was an overflow in folding. */
1186 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1188 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1190 #define TREE_OVERFLOW_P(EXPR) \
1191 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1193 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1194 nonzero means name is to be accessible from outside this translation unit.
1195 In an IDENTIFIER_NODE, nonzero means an external declaration
1196 accessible from outside this translation unit was previously seen
1197 for this name in an inner scope. */
1198 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1200 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1201 of cached values, or is something else. */
1202 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1204 /* In a SAVE_EXPR, indicates that the original expression has already
1205 been substituted with a VAR_DECL that contains the value. */
1206 #define SAVE_EXPR_RESOLVED_P(NODE) \
1207 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1209 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1211 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1212 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1214 /* In any expression, decl, or constant, nonzero means it has side effects or
1215 reevaluation of the whole expression could produce a different value.
1216 This is set if any subexpression is a function call, a side effect or a
1217 reference to a volatile variable. In a ..._DECL, this is set only if the
1218 declaration said `volatile'. This will never be set for a constant. */
1219 #define TREE_SIDE_EFFECTS(NODE) \
1220 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1222 /* In a LABEL_DECL, nonzero means this label had its address taken
1223 and therefore can never be deleted and is a jump target for
1225 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1227 /* Nonzero means this expression is volatile in the C sense:
1228 its address should be of type `volatile WHATEVER *'.
1229 In other words, the declared item is volatile qualified.
1230 This is used in _DECL nodes and _REF nodes.
1231 On a FUNCTION_DECL node, this means the function does not
1232 return normally. This is the same effect as setting
1233 the attribute noreturn on the function in C.
1235 In a ..._TYPE node, means this type is volatile-qualified.
1236 But use TYPE_VOLATILE instead of this macro when the node is a type,
1237 because eventually we may make that a different bit.
1239 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1240 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1242 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1243 accessing the memory pointed to won't generate a trap. However,
1244 this only applies to an object when used appropriately: it doesn't
1245 mean that writing a READONLY mem won't trap. Similarly for
1246 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1248 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1249 (or slice of the array) always belongs to the range of the array.
1250 I.e. that the access will not trap, provided that the access to
1251 the base to the array will not trap. */
1252 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1254 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1255 nonzero means it may not be the lhs of an assignment.
1256 Nonzero in a FUNCTION_DECL means this function should be treated
1257 as "const" function (can only read its arguments). */
1258 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1260 /* Value of expression is constant. Always on in all ..._CST nodes. May
1261 also appear in an expression or decl where the value is constant. */
1262 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1264 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1265 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1266 (TYPE_CHECK (NODE)->base.constant_flag)
1268 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1269 #define DECL_UNSIGNED(NODE) \
1270 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1272 /* In integral and pointer types, means an unsigned type. */
1273 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1275 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1276 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1277 This is interesting in an inline function, since it might not need
1278 to be compiled separately.
1279 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1280 if the debugging info for the type has been written.
1281 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1282 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1284 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1286 /* Nonzero in a _DECL if the name is used in its scope.
1287 Nonzero in an expr node means inhibit warning if value is unused.
1288 In IDENTIFIER_NODEs, this means that some extern decl for this name
1290 In a BLOCK, this means that the block contains variables that are used. */
1291 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1293 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1294 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1295 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1297 /* In a CALL_EXPR, means that it's safe to use the target of the call
1298 expansion as the return slot for a call that returns in memory. */
1299 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1300 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1302 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1303 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1305 #define DECL_BY_REFERENCE(NODE) \
1306 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1307 RESULT_DECL)->decl_common.decl_by_reference_flag)
1309 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1310 can be used as restricted tag to disambiguate against other restrict
1311 pointers. Used by fortran to capture something like non-addressability
1312 (which it isn't really because the middle-end does take addresses of
1314 #define DECL_RESTRICTED_P(NODE) \
1315 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1316 RESULT_DECL)->decl_common.decl_restricted_flag)
1318 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1319 thunked-to function. */
1320 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1322 /* In a type, nonzero means that all objects of the type are guaranteed by the
1323 language or front-end to be properly aligned, so we can indicate that a MEM
1324 of this type is aligned at least to the alignment of the type, even if it
1325 doesn't appear that it is. We see this, for example, in object-oriented
1326 languages where a tag field may show this is an object of a more-aligned
1327 variant of the more generic type.
1329 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1331 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1333 /* Used in classes in C++. */
1334 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1335 /* Used in classes in C++. */
1336 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1338 /* Nonzero in a _DECL if the use of the name is defined as a
1339 deprecated feature by __attribute__((deprecated)). */
1340 #define TREE_DEPRECATED(NODE) \
1341 ((NODE)->base.deprecated_flag)
1343 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1344 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1345 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1346 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1348 /* In fixed-point types, means a saturating type. */
1349 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1351 /* These flags are available for each language front end to use internally. */
1352 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1353 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1354 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1355 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1356 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1357 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1358 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1360 /* Define additional fields and accessors for nodes representing constants. */
1362 /* In an INTEGER_CST node. These two together make a 2-word integer.
1363 If the data type is signed, the value is sign-extended to 2 words
1364 even though not all of them may really be in use.
1365 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1366 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1367 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1368 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1370 #define INT_CST_LT(A, B) \
1371 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1372 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1373 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1375 #define INT_CST_LT_UNSIGNED(A, B) \
1376 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1377 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1378 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1379 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1380 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1382 struct GTY(()) tree_int_cst {
1383 struct tree_common common;
1387 /* In a REAL_CST node. struct real_value is an opaque entity, with
1388 manipulators defined in real.h. We don't want tree.h depending on
1389 real.h and transitively on tm.h. */
1392 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1393 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1395 struct GTY(()) tree_real_cst {
1396 struct tree_common common;
1397 struct real_value * real_cst_ptr;
1400 /* In a FIXED_CST node. */
1403 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1404 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1406 struct GTY(()) tree_fixed_cst {
1407 struct tree_common common;
1408 struct fixed_value * fixed_cst_ptr;
1411 /* In a STRING_CST */
1412 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1413 #define TREE_STRING_POINTER(NODE) \
1414 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1416 struct GTY(()) tree_string {
1417 struct tree_common common;
1422 /* In a COMPLEX_CST node. */
1423 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1424 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1426 struct GTY(()) tree_complex {
1427 struct tree_common common;
1432 /* In a VECTOR_CST node. */
1433 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1435 struct GTY(()) tree_vector {
1436 struct tree_common common;
1442 /* Define fields and accessors for some special-purpose tree nodes. */
1444 #define IDENTIFIER_LENGTH(NODE) \
1445 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1446 #define IDENTIFIER_POINTER(NODE) \
1447 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1448 #define IDENTIFIER_HASH_VALUE(NODE) \
1449 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1451 /* Translate a hash table identifier pointer to a tree_identifier
1452 pointer, and vice versa. */
1454 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1455 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1456 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1458 struct GTY(()) tree_identifier {
1459 struct tree_common common;
1460 struct ht_identifier id;
1463 /* In a TREE_LIST node. */
1464 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1465 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1467 struct GTY(()) tree_list {
1468 struct tree_common common;
1473 /* In a TREE_VEC node. */
1474 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1475 #define TREE_VEC_END(NODE) \
1476 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1478 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1480 struct GTY(()) tree_vec {
1481 struct tree_common common;
1483 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1486 /* In a CONSTRUCTOR node. */
1487 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1488 #define CONSTRUCTOR_ELT(NODE,IDX) \
1489 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1490 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1492 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1493 value of each element (stored within VAL). IX must be a scratch variable
1494 of unsigned integer type. */
1495 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1496 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1498 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1502 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1503 the value of each element (stored within VAL) and its index (stored
1504 within INDEX). IX must be a scratch variable of unsigned integer type. */
1505 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1506 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1508 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1509 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1513 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1514 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1516 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1517 _ce___->index = INDEX; \
1518 _ce___->value = VALUE; \
1521 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1522 constructor output purposes. */
1523 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1524 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1526 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1527 element. INDEX can optionally design the position of VALUE: in arrays,
1528 it is the index where VALUE has to be placed; in structures, it is the
1529 FIELD_DECL of the member. */
1530 typedef struct GTY(()) constructor_elt_d {
1535 DEF_VEC_O(constructor_elt);
1536 DEF_VEC_ALLOC_O(constructor_elt,gc);
1538 struct GTY(()) tree_constructor {
1539 struct tree_common common;
1540 VEC(constructor_elt,gc) *elts;
1543 /* Define fields and accessors for some nodes that represent expressions. */
1545 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1546 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1547 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1548 && integer_zerop (TREE_OPERAND (NODE, 0)))
1550 /* In ordinary expression nodes. */
1551 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1552 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1554 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1555 length. Its value includes the length operand itself; that is,
1556 the minimum valid length is 1.
1557 Note that we have to bypass the use of TREE_OPERAND to access
1558 that field to avoid infinite recursion in expanding the macros. */
1559 #define VL_EXP_OPERAND_LENGTH(NODE) \
1560 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1562 /* Nonzero if is_gimple_debug() may possibly hold. */
1563 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1565 /* In a LOOP_EXPR node. */
1566 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1568 /* The source location of this expression. Non-tree_exp nodes such as
1569 decls and constants can be shared among multiple locations, so
1571 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1572 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1573 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1574 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1575 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1577 /* True if a tree is an expression or statement that can have a
1579 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1581 extern void protected_set_expr_location (tree, location_t);
1583 /* In a TARGET_EXPR node. */
1584 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1585 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1586 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1588 /* DECL_EXPR accessor. This gives access to the DECL associated with
1589 the given declaration statement. */
1590 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1592 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1594 /* COMPOUND_LITERAL_EXPR accessors. */
1595 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1596 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1597 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1598 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1600 /* SWITCH_EXPR accessors. These give access to the condition, body and
1601 original condition type (before any compiler conversions)
1602 of the switch statement, respectively. */
1603 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1604 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1605 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1607 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1608 of a case label, respectively. */
1609 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1610 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1611 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1613 /* The operands of a TARGET_MEM_REF. */
1614 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1615 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1616 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1617 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1618 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1619 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1621 /* The operands of a BIND_EXPR. */
1622 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1623 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1624 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1626 /* GOTO_EXPR accessor. This gives access to the label associated with
1627 a goto statement. */
1628 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1630 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1631 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1632 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1634 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1635 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1636 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1637 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1638 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1639 /* Nonzero if we want to create an ASM_INPUT instead of an
1640 ASM_OPERAND with no operands. */
1641 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1642 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1644 /* COND_EXPR accessors. */
1645 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1646 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1647 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1649 /* Accessors for the chains of recurrences. */
1650 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1651 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1652 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1653 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1655 /* LABEL_EXPR accessor. This gives access to the label associated with
1656 the given label expression. */
1657 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1659 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1660 accessors for SSA operands. */
1662 /* CATCH_EXPR accessors. */
1663 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1664 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1666 /* EH_FILTER_EXPR accessors. */
1667 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1668 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1670 /* OBJ_TYPE_REF accessors. */
1671 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1672 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1673 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1675 /* ASSERT_EXPR accessors. */
1676 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1677 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1679 /* CALL_EXPR accessors.
1681 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1682 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1683 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1684 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1685 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1687 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1688 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1689 the argument count is zero when checking is enabled. Instead, do
1690 the pointer arithmetic to advance past the 3 fixed operands in a
1691 CALL_EXPR. That produces a valid pointer to just past the end of the
1692 operand array, even if it's not valid to dereference it. */
1693 #define CALL_EXPR_ARGP(NODE) \
1694 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1696 /* OpenMP directive and clause accessors. */
1698 #define OMP_BODY(NODE) \
1699 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1700 #define OMP_CLAUSES(NODE) \
1701 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1703 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1704 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1706 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1707 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1709 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1710 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1711 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1713 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1714 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1715 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1716 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1717 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1718 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1720 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1721 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1723 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1725 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1726 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1728 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1730 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1732 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1733 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1735 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1736 #define OMP_CLAUSE_DECL(NODE) \
1737 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1738 OMP_CLAUSE_PRIVATE, \
1739 OMP_CLAUSE_COPYPRIVATE), 0)
1740 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1741 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1742 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1744 /* True on an OMP_SECTION statement that was the last lexical member.
1745 This status is meaningful in the implementation of lastprivate. */
1746 #define OMP_SECTION_LAST(NODE) \
1747 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1749 /* True on an OMP_PARALLEL statement if it represents an explicit
1750 combined parallel work-sharing constructs. */
1751 #define OMP_PARALLEL_COMBINED(NODE) \
1752 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1754 /* True on a PRIVATE clause if its decl is kept around for debugging
1755 information only and its DECL_VALUE_EXPR is supposed to point
1756 to what it has been remapped to. */
1757 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1758 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1760 /* True on a PRIVATE clause if ctor needs access to outer region's
1762 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1763 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1765 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1766 decl is present in the chain. */
1767 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1768 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1769 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1770 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1771 OMP_CLAUSE_LASTPRIVATE),\
1773 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1774 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1776 #define OMP_CLAUSE_IF_EXPR(NODE) \
1777 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1778 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1779 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1780 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1781 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1783 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1784 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1785 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1786 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1787 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1788 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1790 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1791 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1792 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1793 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1794 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1795 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1796 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1797 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1798 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1799 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1800 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1801 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1803 enum omp_clause_schedule_kind
1805 OMP_CLAUSE_SCHEDULE_STATIC,
1806 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1807 OMP_CLAUSE_SCHEDULE_GUIDED,
1808 OMP_CLAUSE_SCHEDULE_AUTO,
1809 OMP_CLAUSE_SCHEDULE_RUNTIME
1812 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1813 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1815 enum omp_clause_default_kind
1817 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1818 OMP_CLAUSE_DEFAULT_SHARED,
1819 OMP_CLAUSE_DEFAULT_NONE,
1820 OMP_CLAUSE_DEFAULT_PRIVATE,
1821 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1824 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1825 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1827 struct GTY(()) tree_exp {
1828 struct tree_common common;
1831 tree GTY ((special ("tree_exp"),
1832 desc ("TREE_CODE ((tree) &%0)")))
1836 /* SSA_NAME accessors. */
1838 /* Returns the variable being referenced. Once released, this is the
1839 only field that can be relied upon. */
1840 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1842 /* Returns the statement which defines this SSA name. */
1843 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1845 /* Returns the SSA version number of this SSA name. Note that in
1846 tree SSA, version numbers are not per variable and may be recycled. */
1847 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1849 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1850 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1852 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1853 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1855 /* Nonzero if this SSA_NAME expression is currently on the free list of
1856 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1857 has no meaning for an SSA_NAME. */
1858 #define SSA_NAME_IN_FREE_LIST(NODE) \
1859 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1861 /* Nonzero if this SSA_NAME is the default definition for the
1862 underlying symbol. A default SSA name is created for symbol S if
1863 the very first reference to S in the function is a read operation.
1864 Default definitions are always created by an empty statement and
1865 belong to no basic block. */
1866 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1867 SSA_NAME_CHECK (NODE)->base.default_def_flag
1869 /* Attributes for SSA_NAMEs for pointer-type variables. */
1870 #define SSA_NAME_PTR_INFO(N) \
1871 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1873 #ifndef _TREE_FLOW_H
1874 struct ptr_info_def;
1879 /* Immediate use linking structure. This structure is used for maintaining
1880 a doubly linked list of uses of an SSA_NAME. */
1881 typedef struct GTY(()) ssa_use_operand_d {
1882 struct ssa_use_operand_d* GTY((skip(""))) prev;
1883 struct ssa_use_operand_d* GTY((skip(""))) next;
1884 /* Immediate uses for a given SSA name are maintained as a cyclic
1885 list. To recognize the root of this list, the location field
1886 needs to point to the original SSA name. Since statements and
1887 SSA names are of different data types, we need this union. See
1888 the explanation in struct immediate_use_iterator_d. */
1889 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1890 tree *GTY((skip(""))) use;
1891 } ssa_use_operand_t;
1893 /* Return the immediate_use information for an SSA_NAME. */
1894 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1896 struct GTY(()) tree_ssa_name {
1897 struct tree_common common;
1899 /* _DECL wrapped by this SSA name. */
1902 /* Statement that defines this SSA name. */
1905 /* SSA version number. */
1906 unsigned int version;
1908 /* Pointer attributes used for alias analysis. */
1909 struct ptr_info_def *ptr_info;
1911 /* Immediate uses list for this SSA_NAME. */
1912 struct ssa_use_operand_d imm_uses;
1915 struct GTY(()) phi_arg_d {
1916 /* imm_use MUST be the first element in struct because we do some
1917 pointer arithmetic with it. See phi_arg_index_from_use. */
1918 struct ssa_use_operand_d imm_use;
1924 #define OMP_CLAUSE_CODE(NODE) \
1925 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1927 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1928 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1930 #define OMP_CLAUSE_CODE(NODE) \
1931 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1933 #define OMP_CLAUSE_OPERAND(NODE, I) \
1934 OMP_CLAUSE_ELT_CHECK (NODE, I)
1936 struct GTY(()) tree_omp_clause {
1937 struct tree_common common;
1939 enum omp_clause_code code;
1940 union omp_clause_subcode {
1941 enum omp_clause_default_kind default_kind;
1942 enum omp_clause_schedule_kind schedule_kind;
1943 enum tree_code reduction_code;
1944 } GTY ((skip)) subcode;
1946 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1948 gimple_seq gimple_reduction_init;
1949 gimple_seq gimple_reduction_merge;
1951 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1955 struct varray_head_tag;
1957 /* In a BLOCK node. */
1958 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1959 #define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1960 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1961 #define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1962 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1963 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1964 /* Note: when changing this, make sure to find the places
1965 that use chainon or nreverse. */
1966 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1967 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1968 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1970 /* An index number for this block. These values are not guaranteed to
1971 be unique across functions -- whether or not they are depends on
1972 the debugging output format in use. */
1973 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1975 /* If block reordering splits a lexical block into discontiguous
1976 address ranges, we'll make a copy of the original block.
1978 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1979 In that case, we have one source block that has been replicated
1980 (through inlining or unrolling) into many logical blocks, and that
1981 these logical blocks have different physical variables in them.
1983 In this case, we have one logical block split into several
1984 non-contiguous address ranges. Most debug formats can't actually
1985 represent this idea directly, so we fake it by creating multiple
1986 logical blocks with the same variables in them. However, for those
1987 that do support non-contiguous regions, these allow the original
1988 logical block to be reconstructed, along with the set of address
1991 One of the logical block fragments is arbitrarily chosen to be
1992 the ORIGIN. The other fragments will point to the origin via
1993 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1994 be null. The list of fragments will be chained through
1995 BLOCK_FRAGMENT_CHAIN from the origin. */
1997 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1998 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2000 /* For an inlined function, this gives the location where it was called
2001 from. This is only set in the top level block, which corresponds to the
2002 inlined function scope. This is used in the debug output routines. */
2004 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2006 struct GTY(()) tree_block {
2007 struct tree_common common;
2009 unsigned abstract_flag : 1;
2010 unsigned block_num : 31;
2015 VEC(tree,gc) *nonlocalized_vars;
2019 tree abstract_origin;
2020 tree fragment_origin;
2021 tree fragment_chain;
2024 /* Define fields and accessors for nodes representing data types. */
2026 /* See tree.def for documentation of the use of these fields.
2027 Look at the documentation of the various ..._TYPE tree codes.
2029 Note that the type.values, type.minval, and type.maxval fields are
2030 overloaded and used for different macros in different kinds of types.
2031 Each macro must check to ensure the tree node is of the proper kind of
2032 type. Note also that some of the front-ends also overload these fields,
2033 so they must be checked as well. */
2035 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2036 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2037 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2038 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2039 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2040 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2041 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2042 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2043 (INTEGER_TYPE_CHECK (NODE)->type.values \
2044 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2045 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2046 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2047 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2048 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2049 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2050 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2051 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2052 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2053 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2054 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2055 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2056 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2057 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2058 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2059 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2060 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2061 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2062 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2063 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2064 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2065 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2067 /* Vector types need to check target flags to determine type. */
2068 extern enum machine_mode vector_type_mode (const_tree);
2069 #define TYPE_MODE(NODE) \
2070 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2071 ? vector_type_mode (NODE) : (NODE)->type.mode)
2072 #define SET_TYPE_MODE(NODE, MODE) \
2073 (TYPE_CHECK (NODE)->type.mode = (MODE))
2075 /* The "canonical" type for this type node, which can be used to
2076 compare the type for equality with another type. If two types are
2077 equal (based on the semantics of the language), then they will have
2078 equivalent TYPE_CANONICAL entries.
2080 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2081 be used for comparison against other types. Instead, the type is
2082 said to require structural equality checks, described in
2083 TYPE_STRUCTURAL_EQUALITY_P. */
2084 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2085 /* Indicates that the type node requires structural equality
2086 checks. The compiler will need to look at the composition of the
2087 type to determine whether it is equal to another type, rather than
2088 just comparing canonical type pointers. For instance, we would need
2089 to look at the return and parameter types of a FUNCTION_TYPE
2091 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2092 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2093 type node requires structural equality. */
2094 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2095 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2096 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2097 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2099 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2100 in the debugging output. We use this to describe a vector as a
2101 structure containing an array. */
2102 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2104 /* For record and union types, information about this type, as a base type
2106 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2108 /* For non record and union types, used in a language-dependent way. */
2109 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2111 /* The (language-specific) typed-based alias set for this type.
2112 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2113 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2114 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2115 type can alias objects of any type. */
2116 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2118 /* Nonzero iff the typed-based alias set for this type has been
2120 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2122 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2124 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2126 /* The alignment necessary for objects of this type.
2127 The value is an int, measured in bits. */
2128 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2130 /* 1 if the alignment for this type was requested by "aligned" attribute,
2131 0 if it is the default for this type. */
2132 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2134 /* The alignment for NODE, in bytes. */
2135 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2137 /* If your language allows you to declare types, and you want debug info
2138 for them, then you need to generate corresponding TYPE_DECL nodes.
2139 These "stub" TYPE_DECL nodes have no name, and simply point at the
2140 type node. You then set the TYPE_STUB_DECL field of the type node
2141 to point back at the TYPE_DECL node. This allows the debug routines
2142 to know that the two nodes represent the same type, so that we only
2143 get one debug info record for them. */
2144 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2146 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2147 has BLKmode only because it lacks the alignment requirement for
2149 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2151 /* In an INTEGER_TYPE, it means the type represents a size. We use
2152 this both for validity checking and to permit optimizations that
2153 are unsafe for other types. Note that the C `size_t' type should
2154 *not* have this flag set. The `size_t' type is simply a typedef
2155 for an ordinary integer type that happens to be the type of an
2156 expression returned by `sizeof'; `size_t' has no special
2157 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2158 always actual sizes. */
2159 #define TYPE_IS_SIZETYPE(NODE) \
2160 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2162 /* Nonzero in a type considered volatile as a whole. */
2163 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2165 /* Means this type is const-qualified. */
2166 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2168 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2170 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2172 /* There is a TYPE_QUAL value for each type qualifier. They can be
2173 combined by bitwise-or to form the complete set of qualifiers for a
2176 #define TYPE_UNQUALIFIED 0x0
2177 #define TYPE_QUAL_CONST 0x1
2178 #define TYPE_QUAL_VOLATILE 0x2
2179 #define TYPE_QUAL_RESTRICT 0x4
2181 /* The set of type qualifiers for this type. */
2182 #define TYPE_QUALS(NODE) \
2183 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2184 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2185 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2187 /* These flags are available for each language front end to use internally. */
2188 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2189 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2190 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2191 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2192 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2193 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2194 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2196 /* Used to keep track of visited nodes in tree traversals. This is set to
2197 0 by copy_node and make_node. */
2198 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2200 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2201 that distinguish string from array of char).
2202 If set in a INTEGER_TYPE, indicates a character type. */
2203 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2205 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2206 object of the given ARRAY_TYPE. This allows temporaries to be
2208 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2209 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2211 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2212 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2213 (((unsigned HOST_WIDE_INT) 1) \
2214 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2216 /* Set precision to n when we have 2^n sub-parts of the vector. */
2217 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2218 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2220 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2221 about missing conversions to other vector types of the same size. */
2222 #define TYPE_VECTOR_OPAQUE(NODE) \
2223 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2225 /* Indicates that objects of this type must be initialized by calling a
2226 function when they are created. */
2227 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2228 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2230 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2231 the same way that the first union alternative would be passed. */
2232 #define TYPE_TRANSPARENT_UNION(NODE) \
2233 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2235 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2236 address of a component of the type. This is the counterpart of
2237 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2238 #define TYPE_NONALIASED_COMPONENT(NODE) \
2239 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2241 /* Indicated that objects of this type should be laid out in as
2242 compact a way as possible. */
2243 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2245 /* Used by type_contains_placeholder_p to avoid recomputation.
2246 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2247 this field directly. */
2248 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2249 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2253 struct GTY(()) tree_type {
2254 struct tree_common common;
2261 unsigned int precision : 10;
2262 unsigned no_force_blk_flag : 1;
2263 unsigned needs_constructing_flag : 1;
2264 unsigned transparent_union_flag : 1;
2265 unsigned restrict_flag : 1;
2266 unsigned contains_placeholder_bits : 2;
2268 ENUM_BITFIELD(machine_mode) mode : 8;
2270 unsigned string_flag : 1;
2271 unsigned lang_flag_0 : 1;
2272 unsigned lang_flag_1 : 1;
2273 unsigned lang_flag_2 : 1;
2274 unsigned lang_flag_3 : 1;
2275 unsigned lang_flag_4 : 1;
2276 unsigned lang_flag_5 : 1;
2277 unsigned lang_flag_6 : 1;
2280 alias_set_type alias_set;
2283 union tree_type_symtab {
2284 int GTY ((tag ("0"))) address;
2285 const char * GTY ((tag ("1"))) pointer;
2286 struct die_struct * GTY ((tag ("2"))) die;
2287 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2288 descbits ("2"))) symtab;
2297 /* Points to a structure whose details depend on the language in use. */
2298 struct lang_type *lang_specific;
2301 /* Define accessor macros for information about type inheritance
2304 A "basetype" means a particular usage of a data type for inheritance
2305 in another type. Each such basetype usage has its own "binfo"
2306 object to describe it. The binfo object is a TREE_VEC node.
2308 Inheritance is represented by the binfo nodes allocated for a
2309 given type. For example, given types C and D, such that D is
2310 inherited by C, 3 binfo nodes will be allocated: one for describing
2311 the binfo properties of C, similarly one for D, and one for
2312 describing the binfo properties of D as a base type for C.
2313 Thus, given a pointer to class C, one can get a pointer to the binfo
2314 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2316 /* BINFO specific flags. */
2318 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2319 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2321 /* Flags for language dependent use. */
2322 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2323 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2324 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2325 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2326 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2327 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2328 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2330 /* The actual data type node being inherited in this basetype. */
2331 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2333 /* The offset where this basetype appears in its containing type.
2334 BINFO_OFFSET slot holds the offset (in bytes)
2335 from the base of the complete object to the base of the part of the
2336 object that is allocated on behalf of this `type'.
2337 This is always 0 except when there is multiple inheritance. */
2339 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2340 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2342 /* The virtual function table belonging to this basetype. Virtual
2343 function tables provide a mechanism for run-time method dispatching.
2344 The entries of a virtual function table are language-dependent. */
2346 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2348 /* The virtual functions in the virtual function table. This is
2349 a TREE_LIST that is used as an initial approximation for building
2350 a virtual function table for this basetype. */
2351 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2353 /* A vector of binfos for the direct basetypes inherited by this
2356 If this basetype describes type D as inherited in C, and if the
2357 basetypes of D are E and F, then this vector contains binfos for
2358 inheritance of E and F by C. */
2359 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2361 /* The number of basetypes for NODE. */
2362 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2364 /* Accessor macro to get to the Nth base binfo of this binfo. */
2365 #define BINFO_BASE_BINFO(NODE,N) \
2366 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2367 #define BINFO_BASE_ITERATE(NODE,N,B) \
2368 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2369 #define BINFO_BASE_APPEND(NODE,T) \
2370 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2372 /* For a BINFO record describing a virtual base class, i.e., one where
2373 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2374 base. The actual contents are language-dependent. In the C++
2375 front-end this field is an INTEGER_CST giving an offset into the
2376 vtable where the offset to the virtual base can be found. */
2377 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2379 /* Indicates the accesses this binfo has to its bases. The values are
2380 access_public_node, access_protected_node or access_private_node.
2381 If this array is not present, public access is implied. */
2382 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2384 #define BINFO_BASE_ACCESS(NODE,N) \
2385 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2386 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2387 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2389 /* The index in the VTT where this subobject's sub-VTT can be found.
2390 NULL_TREE if there is no sub-VTT. */
2391 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2393 /* The index in the VTT where the vptr for this subobject can be
2394 found. NULL_TREE if there is no secondary vptr in the VTT. */
2395 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2397 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2398 inheriting this base for non-virtual bases. For virtual bases it
2399 points either to the binfo for which this is a primary binfo, or to
2400 the binfo of the most derived type. */
2401 #define BINFO_INHERITANCE_CHAIN(NODE) \
2402 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2404 struct GTY (()) tree_binfo {
2405 struct tree_common common;
2411 VEC(tree,gc) *base_accesses;
2417 VEC(tree,none) base_binfos;
2421 /* Define fields and accessors for nodes representing declared names. */
2423 /* Nonzero if DECL represents a variable for the SSA passes. */
2424 #define SSA_VAR_P(DECL) \
2425 (TREE_CODE (DECL) == VAR_DECL \
2426 || TREE_CODE (DECL) == PARM_DECL \
2427 || TREE_CODE (DECL) == RESULT_DECL \
2428 || (TREE_CODE (DECL) == SSA_NAME \
2429 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2430 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2431 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2436 /* Enumerate visibility settings. */
2437 #ifndef SYMBOL_VISIBILITY_DEFINED
2438 #define SYMBOL_VISIBILITY_DEFINED
2439 enum symbol_visibility
2442 VISIBILITY_PROTECTED,
2451 /* This is the name of the object as written by the user.
2452 It is an IDENTIFIER_NODE. */
2453 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2455 /* Every ..._DECL node gets a unique number. */
2456 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2458 /* These two fields describe where in the source code the declaration
2459 was. If the declaration appears in several places (as for a C
2460 function that is declared first and then defined later), this
2461 information should refer to the definition. */
2462 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2463 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2464 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2465 #define DECL_IS_BUILTIN(DECL) \
2466 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2468 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2469 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2470 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2471 nodes, this points to either the FUNCTION_DECL for the containing
2472 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2473 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2475 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2476 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2477 struct GTY(()) tree_decl_minimal {
2478 struct tree_common common;
2486 /* For any sort of a ..._DECL node, this points to the original (abstract)
2487 decl node which this decl is an inlined/cloned instance of, or else it
2488 is NULL indicating that this decl is not an instance of some other decl.
2490 The C front-end also uses this in a nested declaration of an inline
2491 function, to point back to the definition. */
2492 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2494 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2495 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2496 #define DECL_ORIGIN(NODE) \
2497 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2499 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2500 inline instance of some original (abstract) decl from an inline function;
2501 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2502 nodes can also have their abstract origin set to themselves. */
2503 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2504 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2506 /* In a DECL this is the field where attributes are stored. */
2507 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2509 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2510 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2511 For a VAR_DECL, holds the initial value.
2512 For a PARM_DECL, used for DECL_ARG_TYPE--default
2513 values for parameters are encoded in the type of the function,
2514 not in the PARM_DECL slot.
2515 For a FIELD_DECL, this is used for enumeration values and the C
2516 frontend uses it for temporarily storing bitwidth of bitfields.
2518 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2519 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2521 /* Holds the size of the datum, in bits, as a tree expression.
2522 Need not be constant. */
2523 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2524 /* Likewise for the size in bytes. */
2525 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2526 /* Holds the alignment required for the datum, in bits. */
2527 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2528 /* The alignment of NODE, in bytes. */
2529 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2530 /* Set if the alignment of this DECL has been set by the user, for
2531 example with an 'aligned' attribute. */
2532 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2533 /* Holds the machine mode corresponding to the declaration of a variable or
2534 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2536 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2538 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2539 operation it is. Note, however, that this field is overloaded, with
2540 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2541 checked before any access to the former. */
2542 #define DECL_FUNCTION_CODE(NODE) \
2543 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2544 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2545 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2547 #define DECL_FUNCTION_PERSONALITY(NODE) \
2548 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2550 /* Nonzero for a given ..._DECL node means that the name of this node should
2551 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2552 the body of the function should also be ignored. */
2553 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2555 /* Nonzero for a given ..._DECL node means that this node represents an
2556 "abstract instance" of the given declaration (e.g. in the original
2557 declaration of an inline function). When generating symbolic debugging
2558 information, we mustn't try to generate any address information for nodes
2559 marked as "abstract instances" because we don't actually generate
2560 any code or allocate any data space for such instances. */
2561 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2563 /* Language-specific decl information. */
2564 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2566 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2567 do not allocate storage, and refer to a definition elsewhere. Note that
2568 this does not necessarily imply the entity represented by NODE
2569 has no program source-level definition in this translation unit. For
2570 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2571 DECL_EXTERNAL may be true simultaneously; that can be the case for
2572 a C99 "extern inline" function. */
2573 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2575 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2576 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2578 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2580 Also set in some languages for variables, etc., outside the normal
2581 lexical scope, such as class instance variables. */
2582 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2584 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2585 Used in FIELD_DECLs for vtable pointers.
2586 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2587 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2589 /* Used to indicate that this DECL represents a compiler-generated entity. */
2590 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2592 /* Additional flags for language-specific uses. */
2593 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2594 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2595 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2596 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2597 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2598 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2599 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2600 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2601 #define DECL_LANG_FLAG_8(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2603 /* Nonzero for a decl which is at file scope. */
2604 #define DECL_FILE_SCOPE_P(EXP) \
2605 (! DECL_CONTEXT (EXP) \
2606 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2608 /* Nonzero for a decl that is decorated using attribute used.
2609 This indicates compiler tools that this decl needs to be preserved. */
2610 #define DECL_PRESERVE_P(DECL) \
2611 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2613 /* For function local variables of COMPLEX and VECTOR types,
2614 indicates that the variable is not aliased, and that all
2615 modifications to the variable have been adjusted so that
2616 they are killing assignments. Thus the variable may now
2617 be treated as a GIMPLE register, and use real instead of
2618 virtual ops in SSA form. */
2619 #define DECL_GIMPLE_REG_P(DECL) \
2620 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2622 struct GTY(()) tree_decl_common {
2623 struct tree_decl_minimal common;
2626 ENUM_BITFIELD(machine_mode) mode : 8;
2628 unsigned nonlocal_flag : 1;
2629 unsigned virtual_flag : 1;
2630 unsigned ignored_flag : 1;
2631 unsigned abstract_flag : 1;
2632 unsigned artificial_flag : 1;
2633 unsigned preserve_flag: 1;
2634 unsigned debug_expr_is_from : 1;
2636 unsigned lang_flag_0 : 1;
2637 unsigned lang_flag_1 : 1;
2638 unsigned lang_flag_2 : 1;
2639 unsigned lang_flag_3 : 1;
2640 unsigned lang_flag_4 : 1;
2641 unsigned lang_flag_5 : 1;
2642 unsigned lang_flag_6 : 1;
2643 unsigned lang_flag_7 : 1;
2644 unsigned lang_flag_8 : 1;
2646 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2647 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2648 unsigned decl_flag_0 : 1;
2649 /* In FIELD_DECL, this is DECL_BIT_FIELD
2650 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2651 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2652 unsigned decl_flag_1 : 1;
2653 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2654 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2655 unsigned decl_flag_2 : 1;
2656 /* Logically, these two would go in a theoretical base shared by var and
2658 unsigned gimple_reg_flag : 1;
2659 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2660 unsigned decl_by_reference_flag : 1;
2661 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2662 unsigned decl_restricted_flag : 1;
2664 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2665 unsigned decl_common_unused : 2;
2667 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2668 unsigned int off_align : 8;
2670 /* 24-bits unused. */
2672 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2678 tree abstract_origin;
2680 /* Points to a structure whose details depend on the language in use. */
2681 struct lang_decl *lang_specific;
2684 extern tree decl_value_expr_lookup (tree);
2685 extern void decl_value_expr_insert (tree, tree);
2687 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2688 if transformations have made this more complicated than evaluating the
2689 decl itself. This should only be used for debugging; once this field has
2690 been set, the decl itself may not legitimately appear in the function. */
2691 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2692 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2693 #define DECL_VALUE_EXPR(NODE) \
2694 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2695 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2696 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2698 /* Holds the RTL expression for the value of a variable or function.
2699 This value can be evaluated lazily for functions, variables with
2700 static storage duration, and labels. */
2701 #define DECL_RTL(NODE) \
2702 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2703 ? (NODE)->decl_with_rtl.rtl \
2704 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2706 /* Set the DECL_RTL for NODE to RTL. */
2707 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2709 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2710 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2712 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2713 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2715 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2716 NODE1, it will not be set for NODE2; this is a lazy copy. */
2717 #define COPY_DECL_RTL(NODE1, NODE2) \
2718 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2720 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2721 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2723 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2724 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2726 struct GTY(()) tree_decl_with_rtl {
2727 struct tree_decl_common common;
2731 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2732 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2733 of the structure. */
2734 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2736 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2737 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2738 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2739 natural alignment of the field's type). */
2740 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2742 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2743 if so, the type that was originally specified for it.
2744 TREE_TYPE may have been modified (in finish_struct). */
2745 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2747 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2748 if nonzero, indicates that the field occupies the type. */
2749 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2751 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2752 DECL_FIELD_OFFSET which are known to be always zero.
2753 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2755 #define DECL_OFFSET_ALIGN(NODE) \
2756 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2758 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2759 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2760 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2761 /* 1 if the alignment for this type was requested by "aligned" attribute,
2762 0 if it is the default for this type. */
2764 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2765 which this FIELD_DECL is defined. This information is needed when
2766 writing debugging information about vfield and vbase decls for C++. */
2767 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2769 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2770 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2772 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2774 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2776 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2777 this component. This makes it possible for Type-Based Alias Analysis
2778 to disambiguate accesses to this field with indirect accesses using
2781 struct S { int i; } s;
2784 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2786 From the implementation's viewpoint, the alias set of the type of the
2787 field 'i' (int) will not be recorded as a subset of that of the type of
2788 's' (struct S) in record_component_aliases. The counterpart is that
2789 accesses to s.i must not be given the alias set of the type of 'i'
2790 (int) but instead directly that of the type of 's' (struct S). */
2791 #define DECL_NONADDRESSABLE_P(NODE) \
2792 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2794 struct GTY(()) tree_field_decl {
2795 struct tree_decl_common common;
2798 tree bit_field_type;
2804 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2805 dense, unique within any one function, and may be used to index arrays.
2806 If the value is -1, then no UID has been assigned. */
2807 #define LABEL_DECL_UID(NODE) \
2808 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2810 /* In a LABEL_DECL, the EH region number for which the label is the
2811 post_landing_pad. */
2812 #define EH_LANDING_PAD_NR(NODE) \
2813 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2815 /* In LABEL_DECL nodes, nonzero means that an error message about
2816 jumping into such a binding contour has been printed for this label. */
2817 #define DECL_ERROR_ISSUED(NODE) \
2818 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2820 struct GTY(()) tree_label_decl {
2821 struct tree_decl_with_rtl common;
2823 int eh_landing_pad_nr;
2826 struct GTY(()) tree_result_decl {
2827 struct tree_decl_with_rtl common;
2830 struct GTY(()) tree_const_decl {
2831 struct tree_decl_with_rtl common;
2834 /* For a PARM_DECL, records the data type used to pass the argument,
2835 which may be different from the type seen in the program. */
2836 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2838 /* For PARM_DECL, holds an RTL for the stack slot or register
2839 where the data was actually passed. */
2840 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2842 struct GTY(()) tree_parm_decl {
2843 struct tree_decl_with_rtl common;
2848 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2849 this variable in a BIND_EXPR. */
2850 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2851 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2853 /* Used to indicate that the linkage status of this DECL is not yet known,
2854 so it should not be output now. */
2855 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2857 /* Nonzero for a given ..._DECL node means that no warnings should be
2858 generated just because this node is unused. */
2859 #define DECL_IN_SYSTEM_HEADER(NODE) \
2860 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2862 /* Used to indicate that this DECL has weak linkage. */
2863 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2865 /* Used to indicate that the DECL is a dllimport. */
2866 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2868 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2869 not be put out unless it is needed in this translation unit.
2870 Entities like this are shared across translation units (like weak
2871 entities), but are guaranteed to be generated by any translation
2872 unit that needs them, and therefore need not be put out anywhere
2873 where they are not needed. DECL_COMDAT is just a hint to the
2874 back-end; it is up to front-ends which set this flag to ensure
2875 that there will never be any harm, other than bloat, in putting out
2876 something which is DECL_COMDAT. */
2877 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2879 #define DECL_COMDAT_GROUP(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2881 /* A replaceable function is one which may be replaced at link-time
2882 with an entirely different definition, provided that the
2883 replacement has the same type. For example, functions declared
2884 with __attribute__((weak)) on most systems are replaceable.
2886 COMDAT functions are not replaceable, since all definitions of the
2887 function must be equivalent. It is important that COMDAT functions
2888 not be treated as replaceable so that use of C++ template
2889 instantiations is not penalized.
2891 For example, DECL_REPLACEABLE is used to determine whether or not a
2892 function (including a template instantiation) which is not
2893 explicitly declared "inline" can be inlined. If the function is
2894 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2895 implementation chosen at link-time may be different. However, a
2896 function that is not DECL_REPLACEABLE can be inlined, since all
2897 versions of the function will be functionally identical. */
2898 #define DECL_REPLACEABLE_P(NODE) \
2899 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2901 /* The name of the object as the assembler will see it (but before any
2902 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2903 as DECL_NAME. It is an IDENTIFIER_NODE. */
2904 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2906 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2907 This is true of all DECL nodes except FIELD_DECL. */
2908 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2909 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2911 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2912 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2914 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2915 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2917 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2918 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2919 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2921 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2922 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2923 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2924 semantics of using this macro, are different than saying:
2926 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2928 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2930 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2931 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2932 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2933 DECL_ASSEMBLER_NAME (DECL1)) \
2936 /* Records the section name in a section attribute. Used to pass
2937 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2938 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2940 /* Value of the decls's visibility attribute */
2941 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2943 /* Nonzero means that the decl had its visibility specified rather than
2945 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2947 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2948 multiple translation units should be merged. */
2949 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2951 struct GTY(()) tree_decl_with_vis {
2952 struct tree_decl_with_rtl common;
2953 tree assembler_name;
2957 /* Belong to VAR_DECL exclusively. */
2958 unsigned defer_output : 1;
2959 unsigned hard_register : 1;
2960 unsigned thread_local : 1;
2961 unsigned common_flag : 1;
2962 unsigned in_text_section : 1;
2963 unsigned dllimport_flag : 1;
2964 /* Used by C++. Might become a generic decl flag. */
2965 unsigned shadowed_for_var_p : 1;
2966 /* Don't belong to VAR_DECL exclusively. */
2967 unsigned weak_flag : 1;
2969 unsigned seen_in_bind_expr : 1;
2970 unsigned comdat_flag : 1;
2971 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2972 unsigned visibility_specified : 1;
2973 /* Belongs to VAR_DECL exclusively. */
2974 ENUM_BITFIELD(tls_model) tls_model : 3;
2976 /* Belong to FUNCTION_DECL exclusively. */
2977 unsigned init_priority_p : 1;
2978 /* 15 unused bits. */
2981 /* In a VAR_DECL that's static,
2982 nonzero if the space is in the text section. */
2983 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2985 /* Nonzero for a given ..._DECL node means that this node should be
2986 put in .common, if possible. If a DECL_INITIAL is given, and it
2987 is not error_mark_node, then the decl cannot be put in .common. */
2988 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2990 /* In a VAR_DECL, nonzero if the decl is a register variable with
2991 an explicit asm specification. */
2992 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2994 extern tree decl_debug_expr_lookup (tree);
2995 extern void decl_debug_expr_insert (tree, tree);
2996 /* For VAR_DECL, this is set to either an expression that it was split
2997 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2998 subexpressions that it was split into. */
2999 #define DECL_DEBUG_EXPR(NODE) \
3000 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3002 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3003 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3005 /* An initialization priority. */
3006 typedef unsigned short priority_type;
3008 extern priority_type decl_init_priority_lookup (tree);
3009 extern priority_type decl_fini_priority_lookup (tree);
3010 extern void decl_init_priority_insert (tree, priority_type);
3011 extern void decl_fini_priority_insert (tree, priority_type);
3013 /* In a non-local VAR_DECL with static storage duration, true if the
3014 variable has an initialization priority. If false, the variable
3015 will be initialized at the DEFAULT_INIT_PRIORITY. */
3016 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3017 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3019 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3021 #define DECL_INIT_PRIORITY(NODE) \
3022 (decl_init_priority_lookup (NODE))
3023 /* Set the initialization priority for NODE to VAL. */
3024 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3025 (decl_init_priority_insert (NODE, VAL))
3027 /* For a FUNCTION_DECL the finalization priority of NODE. */
3028 #define DECL_FINI_PRIORITY(NODE) \
3029 (decl_fini_priority_lookup (NODE))
3030 /* Set the finalization priority for NODE to VAL. */
3031 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3032 (decl_fini_priority_insert (NODE, VAL))
3034 /* The initialization priority for entities for which no explicit
3035 initialization priority has been specified. */
3036 #define DEFAULT_INIT_PRIORITY 65535
3038 /* The maximum allowed initialization priority. */
3039 #define MAX_INIT_PRIORITY 65535
3041 /* The largest priority value reserved for use by system runtime
3043 #define MAX_RESERVED_INIT_PRIORITY 100
3045 /* In a VAR_DECL, the model to use if the data should be allocated from
3046 thread-local storage. */
3047 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3049 /* In a VAR_DECL, nonzero if the data should be allocated from
3050 thread-local storage. */
3051 #define DECL_THREAD_LOCAL_P(NODE) \
3052 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3054 struct GTY(()) tree_var_decl {
3055 struct tree_decl_with_vis common;
3059 /* This field is used to reference anything in decl.result and is meant only
3060 for use by the garbage collector. */
3061 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3063 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3064 Before the struct containing the FUNCTION_DECL is laid out,
3065 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3066 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3067 function. When the class is laid out, this pointer is changed
3068 to an INTEGER_CST node which is suitable for use as an index
3069 into the virtual function table.
3070 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3071 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3074 tree_decl_non_common {
3075 struct tree_decl_with_vis common;
3076 /* C++ uses this in namespaces. */
3078 /* C++ uses this in templates. */
3080 /* Almost all FE's use this. */
3082 /* C++ uses this in namespaces. */
3086 /* In FUNCTION_DECL, holds the decl for the return value. */
3087 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3089 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3090 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3092 /* In a FUNCTION_DECL, the saved representation of the body of the
3094 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3096 /* Nonzero in a FUNCTION_DECL means this function should be treated
3097 as if it were a malloc, meaning it returns a pointer that is
3099 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3101 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3102 C++ operator new, meaning that it returns a pointer for which we
3103 should not use type based aliasing. */
3104 #define DECL_IS_OPERATOR_NEW(NODE) \
3105 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3107 /* Nonzero in a FUNCTION_DECL means this function may return more
3109 #define DECL_IS_RETURNS_TWICE(NODE) \
3110 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3112 /* Nonzero in a FUNCTION_DECL means this function should be treated
3113 as "pure" function (like const function, but may read global memory). */
3114 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3116 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3117 the const or pure function may not terminate. When this is nonzero
3118 for a const or pure function, it can be dealt with by cse passes
3119 but cannot be removed by dce passes since you are not allowed to
3120 change an infinite looping program into one that terminates without
3122 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3123 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3125 /* Nonzero in a FUNCTION_DECL means this function should be treated
3126 as "novops" function (function that does not read global memory,
3127 but may have arbitrary side effects). */
3128 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3130 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3131 at the beginning or end of execution. */
3132 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3133 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3135 #define DECL_STATIC_DESTRUCTOR(NODE) \
3136 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3138 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3139 be instrumented with calls to support routines. */
3140 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3141 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3143 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3144 disabled in this function. */
3145 #define DECL_NO_LIMIT_STACK(NODE) \
3146 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3148 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3149 #define DECL_STATIC_CHAIN(NODE) \
3150 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3152 /* Nonzero for a decl that cgraph has decided should be inlined into
3153 at least one call site. It is not meaningful to look at this
3154 directly; always use cgraph_function_possibly_inlined_p. */
3155 #define DECL_POSSIBLY_INLINED(DECL) \
3156 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3158 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3159 such as via the `inline' keyword in C/C++. This flag controls the linkage
3160 semantics of 'inline' */
3161 #define DECL_DECLARED_INLINE_P(NODE) \
3162 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3164 /* Nonzero in a FUNCTION_DECL means this function should not get
3165 -Winline warnings. */
3166 #define DECL_NO_INLINE_WARNING_P(NODE) \
3167 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3169 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3170 disregarding size and cost heuristics. This is equivalent to using
3171 the always_inline attribute without the required diagnostics if the
3172 function cannot be inlined. */
3173 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3174 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3176 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3177 that describes the status of this function. */
3178 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3180 /* In a FUNCTION_DECL, nonzero means a built in function. */
3181 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3183 /* For a builtin function, identify which part of the compiler defined it. */
3184 #define DECL_BUILT_IN_CLASS(NODE) \
3185 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3187 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3188 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3190 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3191 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3193 /* In FUNCTION_DECL, the function specific target options to use when compiling
3195 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3196 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3198 /* In FUNCTION_DECL, the function specific optimization options to use when
3199 compiling this function. */
3200 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3201 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3203 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3204 arguments/result/saved_tree fields by front ends. It was either inherit
3205 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3206 which seemed a bit strange. */
3208 struct GTY(()) tree_function_decl {
3209 struct tree_decl_non_common common;
3213 /* The personality function. Used for stack unwinding. */
3216 /* Function specific options that are used by this function. */
3217 tree function_specific_target; /* target options */
3218 tree function_specific_optimization; /* optimization options */
3220 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3221 DECL_FUNCTION_CODE. Otherwise unused.
3222 ??? The bitfield needs to be able to hold all target function
3224 ENUM_BITFIELD(built_in_function) function_code : 11;
3225 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3227 unsigned static_ctor_flag : 1;
3228 unsigned static_dtor_flag : 1;
3229 unsigned uninlinable : 1;
3231 unsigned possibly_inlined : 1;
3232 unsigned novops_flag : 1;
3233 unsigned returns_twice_flag : 1;
3234 unsigned malloc_flag : 1;
3235 unsigned operator_new_flag : 1;
3236 unsigned declared_inline_flag : 1;
3237 unsigned regdecl_flag : 1;
3239 unsigned no_inline_warning_flag : 1;
3240 unsigned no_instrument_function_entry_exit : 1;
3241 unsigned no_limit_stack : 1;
3242 unsigned disregard_inline_limits : 1;
3243 unsigned pure_flag : 1;
3244 unsigned looping_const_or_pure_flag : 1;
3250 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3251 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3253 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3254 into stabs. Instead it will generate cross reference ('x') of names.
3255 This uses the same flag as DECL_EXTERNAL. */
3256 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3257 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3259 /* Getter of the imported declaration associated to the
3260 IMPORTED_DECL node. */
3261 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3262 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3264 struct GTY(()) tree_type_decl {
3265 struct tree_decl_non_common common;
3269 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3270 To reduce overhead, the nodes containing the statements are not trees.
3271 This avoids the overhead of tree_common on all linked list elements.
3273 Use the interface in tree-iterator.h to access this node. */
3275 #define STATEMENT_LIST_HEAD(NODE) \
3276 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3277 #define STATEMENT_LIST_TAIL(NODE) \
3278 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3280 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3282 struct tree_statement_list_node *prev;
3283 struct tree_statement_list_node *next;
3287 struct GTY(()) tree_statement_list
3289 struct tree_common common;
3290 struct tree_statement_list_node *head;
3291 struct tree_statement_list_node *tail;
3295 /* Optimization options used by a function. */
3297 struct GTY(()) tree_optimization_option {
3298 struct tree_common common;
3300 /* The optimization options used by the user. */
3301 struct cl_optimization opts;
3304 #define TREE_OPTIMIZATION(NODE) \
3305 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3307 /* Return a tree node that encapsulates the current optimization options. */
3308 extern tree build_optimization_node (void);
3310 /* Target options used by a function. */
3312 struct GTY(()) tree_target_option {
3313 struct tree_common common;
3315 /* The optimization options used by the user. */
3316 struct cl_target_option opts;
3319 #define TREE_TARGET_OPTION(NODE) \
3320 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3322 /* Return a tree node that encapsulates the current target options. */
3323 extern tree build_target_option_node (void);
3326 /* Define the overall contents of a tree node.
3327 It may be any of the structures declared above
3328 for various types of node. */
3330 union GTY ((ptr_alias (union lang_tree_node),
3331 desc ("tree_node_structure (&%h)"))) tree_node {
3332 struct tree_base GTY ((tag ("TS_BASE"))) base;
3333 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3334 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3335 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3336 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3337 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3338 struct tree_string GTY ((tag ("TS_STRING"))) string;
3339 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3340 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3341 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3342 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3343 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3344 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3345 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3346 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3347 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3348 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3349 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3350 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3351 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3352 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3353 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3354 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3355 struct tree_list GTY ((tag ("TS_LIST"))) list;
3356 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3357 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3358 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3359 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3360 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3361 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3362 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3363 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3364 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3365 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3368 /* Standard named or nameless data types of the C compiler. */
3390 TI_INTEGER_MINUS_ONE,
3407 TI_COMPLEX_INTEGER_TYPE,
3408 TI_COMPLEX_FLOAT_TYPE,
3409 TI_COMPLEX_DOUBLE_TYPE,
3410 TI_COMPLEX_LONG_DOUBLE_TYPE,
3414 TI_LONG_DOUBLE_TYPE,
3418 TI_LONG_DOUBLE_PTR_TYPE,
3419 TI_INTEGER_PTR_TYPE,
3428 TI_VA_LIST_GPR_COUNTER_FIELD,
3429 TI_VA_LIST_FPR_COUNTER_FIELD,
3436 TI_DFLOAT32_PTR_TYPE,
3437 TI_DFLOAT64_PTR_TYPE,
3438 TI_DFLOAT128_PTR_TYPE,
3447 TI_SAT_LLFRACT_TYPE,
3448 TI_SAT_USFRACT_TYPE,
3450 TI_SAT_ULFRACT_TYPE,
3451 TI_SAT_ULLFRACT_TYPE,
3463 TI_SAT_LLACCUM_TYPE,
3464 TI_SAT_USACCUM_TYPE,
3466 TI_SAT_ULACCUM_TYPE,
3467 TI_SAT_ULLACCUM_TYPE,
3513 TI_OPTIMIZATION_DEFAULT,
3514 TI_OPTIMIZATION_CURRENT,
3515 TI_TARGET_OPTION_DEFAULT,
3516 TI_TARGET_OPTION_CURRENT,
3517 TI_CURRENT_TARGET_PRAGMA,
3518 TI_CURRENT_OPTIMIZE_PRAGMA,
3523 extern GTY(()) tree global_trees[TI_MAX];
3525 #define error_mark_node global_trees[TI_ERROR_MARK]
3527 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3528 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3529 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3530 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3531 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3533 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3534 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3535 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3536 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3537 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3539 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3540 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3542 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3543 #define integer_one_node global_trees[TI_INTEGER_ONE]
3544 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3545 #define size_zero_node global_trees[TI_SIZE_ZERO]
3546 #define size_one_node global_trees[TI_SIZE_ONE]
3547 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3548 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3549 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3551 /* Base access nodes. */
3552 #define access_public_node global_trees[TI_PUBLIC]
3553 #define access_protected_node global_trees[TI_PROTECTED]
3554 #define access_private_node global_trees[TI_PRIVATE]
3556 #define null_pointer_node global_trees[TI_NULL_POINTER]
3558 #define float_type_node global_trees[TI_FLOAT_TYPE]
3559 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3560 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3562 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3563 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3564 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3565 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3567 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3568 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3569 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3570 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3572 #define void_type_node global_trees[TI_VOID_TYPE]
3573 /* The C type `void *'. */
3574 #define ptr_type_node global_trees[TI_PTR_TYPE]
3575 /* The C type `const void *'. */
3576 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3577 /* The C type `size_t'. */
3578 #define size_type_node global_trees[TI_SIZE_TYPE]
3579 #define pid_type_node global_trees[TI_PID_TYPE]
3580 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3581 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3582 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3583 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3584 /* The C type `FILE *'. */
3585 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3587 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3588 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3589 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3591 /* The decimal floating point types. */
3592 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3593 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3594 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3595 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3596 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3597 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3599 /* The fixed-point types. */
3600 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3601 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3602 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3603 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3604 #define sat_unsigned_short_fract_type_node \
3605 global_trees[TI_SAT_USFRACT_TYPE]
3606 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3607 #define sat_unsigned_long_fract_type_node \
3608 global_trees[TI_SAT_ULFRACT_TYPE]
3609 #define sat_unsigned_long_long_fract_type_node \
3610 global_trees[TI_SAT_ULLFRACT_TYPE]
3611 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3612 #define fract_type_node global_trees[TI_FRACT_TYPE]
3613 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3614 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3615 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3616 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3617 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3618 #define unsigned_long_long_fract_type_node \
3619 global_trees[TI_ULLFRACT_TYPE]
3620 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3621 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3622 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3623 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3624 #define sat_unsigned_short_accum_type_node \
3625 global_trees[TI_SAT_USACCUM_TYPE]
3626 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3627 #define sat_unsigned_long_accum_type_node \
3628 global_trees[TI_SAT_ULACCUM_TYPE]
3629 #define sat_unsigned_long_long_accum_type_node \
3630 global_trees[TI_SAT_ULLACCUM_TYPE]
3631 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3632 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3633 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3634 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3635 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3636 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3637 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3638 #define unsigned_long_long_accum_type_node \
3639 global_trees[TI_ULLACCUM_TYPE]
3640 #define qq_type_node global_trees[TI_QQ_TYPE]
3641 #define hq_type_node global_trees[TI_HQ_TYPE]
3642 #define sq_type_node global_trees[TI_SQ_TYPE]
3643 #define dq_type_node global_trees[TI_DQ_TYPE]
3644 #define tq_type_node global_trees[TI_TQ_TYPE]
3645 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3646 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3647 #define usq_type_node global_trees[TI_USQ_TYPE]
3648 #define udq_type_node global_trees[TI_UDQ_TYPE]
3649 #define utq_type_node global_trees[TI_UTQ_TYPE]
3650 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3651 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3652 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3653 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3654 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3655 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3656 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3657 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3658 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3659 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3660 #define ha_type_node global_trees[TI_HA_TYPE]
3661 #define sa_type_node global_trees[TI_SA_TYPE]
3662 #define da_type_node global_trees[TI_DA_TYPE]
3663 #define ta_type_node global_trees[TI_TA_TYPE]
3664 #define uha_type_node global_trees[TI_UHA_TYPE]
3665 #define usa_type_node global_trees[TI_USA_TYPE]
3666 #define uda_type_node global_trees[TI_UDA_TYPE]
3667 #define uta_type_node global_trees[TI_UTA_TYPE]
3668 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3669 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3670 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3671 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3672 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3673 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3674 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3675 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3677 /* The node that should be placed at the end of a parameter list to
3678 indicate that the function does not take a variable number of
3679 arguments. The TREE_VALUE will be void_type_node and there will be
3680 no TREE_CHAIN. Language-independent code should not assume
3681 anything else about this node. */
3682 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3684 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3685 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3687 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3689 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3690 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3692 /* Default/current target options (TARGET_OPTION_NODE). */
3693 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3694 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3696 /* Default tree list option(), optimize() pragmas to be linked into the
3698 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3699 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3701 /* An enumeration of the standard C integer types. These must be
3702 ordered so that shorter types appear before longer ones, and so
3703 that signed types appear before unsigned ones, for the correct
3704 functioning of interpret_integer() in c-lex.c. */
3705 enum integer_type_kind
3717 itk_unsigned_long_long,
3721 typedef enum integer_type_kind integer_type_kind;
3723 /* The standard C integer types. Use integer_type_kind to index into
3725 extern GTY(()) tree integer_types[itk_none];
3727 #define char_type_node integer_types[itk_char]
3728 #define signed_char_type_node integer_types[itk_signed_char]
3729 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3730 #define short_integer_type_node integer_types[itk_short]
3731 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3732 #define integer_type_node integer_types[itk_int]
3733 #define unsigned_type_node integer_types[itk_unsigned_int]
3734 #define long_integer_type_node integer_types[itk_long]
3735 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3736 #define long_long_integer_type_node integer_types[itk_long_long]
3737 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3739 /* Set to the default thread-local storage (tls) model to use. */
3741 extern enum tls_model flag_tls_default;
3744 /* A pointer-to-function member type looks like:
3751 If __pfn is NULL, it is a NULL pointer-to-member-function.
3753 (Because the vtable is always the first thing in the object, we
3754 don't need its offset.) If the function is virtual, then PFN is
3755 one plus twice the index into the vtable; otherwise, it is just a
3756 pointer to the function.
3758 Unfortunately, using the lowest bit of PFN doesn't work in
3759 architectures that don't impose alignment requirements on function
3760 addresses, or that use the lowest bit to tell one ISA from another,
3761 for example. For such architectures, we use the lowest bit of
3762 DELTA instead of the lowest bit of the PFN, and DELTA will be
3765 enum ptrmemfunc_vbit_where_t
3767 ptrmemfunc_vbit_in_pfn,
3768 ptrmemfunc_vbit_in_delta
3771 #define NULL_TREE (tree) NULL
3773 extern tree decl_assembler_name (tree);
3774 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3775 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3777 /* Compute the number of bytes occupied by 'node'. This routine only
3778 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3780 extern size_t tree_size (const_tree);
3782 /* Compute the number of bytes occupied by a tree with code CODE. This
3783 function cannot be used for TREE_VEC codes, which are of variable
3785 extern size_t tree_code_size (enum tree_code);
3787 /* Lowest level primitive for allocating a node.
3788 The TREE_CODE is the only argument. Contents are initialized
3789 to zero except for a few of the common fields. */
3791 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3792 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3794 /* Make a copy of a node, with all the same contents. */
3796 extern tree copy_node_stat (tree MEM_STAT_DECL);
3797 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3799 /* Make a copy of a chain of TREE_LIST nodes. */
3801 extern tree copy_list (tree);
3804 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3805 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3807 /* Make a TREE_VEC. */
3809 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3810 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3812 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3813 The name is supplied as a char *. */
3815 extern tree get_identifier (const char *);
3817 #if GCC_VERSION >= 3000
3818 #define get_identifier(str) \
3819 (__builtin_constant_p (str) \
3820 ? get_identifier_with_length ((str), strlen (str)) \
3821 : get_identifier (str))
3825 /* Identical to get_identifier, except that the length is assumed
3828 extern tree get_identifier_with_length (const char *, size_t);
3830 /* If an identifier with the name TEXT (a null-terminated string) has
3831 previously been referred to, return that node; otherwise return
3834 extern tree maybe_get_identifier (const char *);
3836 /* Construct various types of nodes. */
3838 extern tree build_nt (enum tree_code, ...);
3839 extern tree build_nt_call_list (tree, tree);
3840 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3842 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3843 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3844 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3845 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3846 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3847 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3848 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3849 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3850 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3851 tree MEM_STAT_DECL);
3852 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3853 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3854 tree MEM_STAT_DECL);
3855 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3856 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3857 tree, tree MEM_STAT_DECL);
3858 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3859 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3861 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3862 #define build_var_debug_value(t1,t2) \
3863 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3865 extern tree build_int_cst (tree, HOST_WIDE_INT);
3866 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3867 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3868 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3869 extern tree build_int_cst_wide_type (tree,
3870 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3871 extern tree build_vector (tree, tree);
3872 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3873 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3874 extern tree build_constructor_single (tree, tree, tree);
3875 extern tree build_constructor_from_list (tree, tree);
3876 extern tree build_real_from_int_cst (tree, const_tree);
3877 extern tree build_complex (tree, tree, tree);
3878 extern tree build_one_cst (tree);
3879 extern tree build_string (int, const char *);
3880 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3881 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3882 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
3883 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3884 extern tree build_decl_stat (location_t, enum tree_code,
3885 tree, tree MEM_STAT_DECL);
3886 extern tree build_fn_decl (const char *, tree);
3887 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
3888 extern tree build_block (tree, tree, tree, tree);
3889 extern tree build_empty_stmt (location_t);
3890 extern tree build_omp_clause (location_t, enum omp_clause_code);
3892 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3893 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3895 extern tree build_call_list (tree, tree, tree);
3896 extern tree build_call_nary (tree, tree, int, ...);
3897 extern tree build_call_valist (tree, tree, int, va_list);
3898 #define build_call_array(T1,T2,N,T3)\
3899 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3900 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3901 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
3903 /* Construct various nodes representing data types. */
3905 extern tree make_signed_type (int);
3906 extern tree make_unsigned_type (int);
3907 extern tree signed_or_unsigned_type_for (int, tree);
3908 extern tree signed_type_for (tree);
3909 extern tree unsigned_type_for (tree);
3910 extern void initialize_sizetypes (bool);
3911 extern void set_sizetype (tree);
3912 extern void fixup_unsigned_type (tree);
3913 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3914 extern tree build_pointer_type (tree);
3915 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3916 extern tree build_reference_type (tree);
3917 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3918 extern tree build_vector_type (tree innertype, int nunits);
3919 extern tree build_opaque_vector_type (tree innertype, int nunits);
3920 extern tree build_type_no_quals (tree);
3921 extern tree build_index_type (tree);
3922 extern tree build_index_2_type (tree, tree);
3923 extern tree build_array_type (tree, tree);
3924 extern tree build_function_type (tree, tree);
3925 extern tree build_function_type_list (tree, ...);
3926 extern tree build_function_type_skip_args (tree, bitmap);
3927 extern tree build_function_decl_skip_args (tree, bitmap);
3928 extern tree build_varargs_function_type_list (tree, ...);
3929 extern tree build_method_type_directly (tree, tree, tree);
3930 extern tree build_method_type (tree, tree);
3931 extern tree build_offset_type (tree, tree);
3932 extern tree build_complex_type (tree);
3933 extern tree array_type_nelts (const_tree);
3934 extern bool in_array_bounds_p (tree);
3935 extern bool range_in_array_bounds_p (tree);
3937 extern tree value_member (tree, tree);
3938 extern tree purpose_member (const_tree, tree);
3939 extern tree chain_index (int, tree);
3941 extern int attribute_list_equal (const_tree, const_tree);
3942 extern int attribute_list_contained (const_tree, const_tree);
3943 extern int tree_int_cst_equal (const_tree, const_tree);
3944 extern int tree_int_cst_lt (const_tree, const_tree);
3945 extern int tree_int_cst_compare (const_tree, const_tree);
3946 extern int host_integerp (const_tree, int);
3947 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
3948 extern int tree_int_cst_msb (const_tree);
3949 extern int tree_int_cst_sgn (const_tree);
3950 extern int tree_int_cst_sign_bit (const_tree);
3951 extern unsigned int tree_int_cst_min_precision (tree, bool);
3952 extern bool tree_expr_nonnegative_p (tree);
3953 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
3954 extern bool may_negate_without_overflow_p (const_tree);
3955 extern tree strip_array_types (tree);
3956 extern tree excess_precision_type (tree);
3958 /* Construct various nodes representing fract or accum data types. */
3960 extern tree make_fract_type (int, int, int);
3961 extern tree make_accum_type (int, int, int);
3963 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3964 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3965 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3966 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3967 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3968 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3969 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3970 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3972 #define make_or_reuse_signed_fract_type(P) \
3973 make_or_reuse_fract_type (P, 0, 0)
3974 #define make_or_reuse_unsigned_fract_type(P) \
3975 make_or_reuse_fract_type (P, 1, 0)
3976 #define make_or_reuse_sat_signed_fract_type(P) \
3977 make_or_reuse_fract_type (P, 0, 1)
3978 #define make_or_reuse_sat_unsigned_fract_type(P) \
3979 make_or_reuse_fract_type (P, 1, 1)
3980 #define make_or_reuse_signed_accum_type(P) \
3981 make_or_reuse_accum_type (P, 0, 0)
3982 #define make_or_reuse_unsigned_accum_type(P) \
3983 make_or_reuse_accum_type (P, 1, 0)
3984 #define make_or_reuse_sat_signed_accum_type(P) \
3985 make_or_reuse_accum_type (P, 0, 1)
3986 #define make_or_reuse_sat_unsigned_accum_type(P) \
3987 make_or_reuse_accum_type (P, 1, 1)
3989 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3990 put the prototype here. Rtl.h does declare the prototype if
3991 tree.h had been included. */
3993 extern tree make_tree (tree, rtx);
3995 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3998 Such modified types already made are recorded so that duplicates
4001 extern tree build_type_attribute_variant (tree, tree);
4002 extern tree build_decl_attribute_variant (tree, tree);
4003 extern tree build_type_attribute_qual_variant (tree, tree, int);
4005 /* Structure describing an attribute and a function to handle it. */
4006 struct attribute_spec
4008 /* The name of the attribute (without any leading or trailing __),
4009 or NULL to mark the end of a table of attributes. */
4010 const char *const name;
4011 /* The minimum length of the list of arguments of the attribute. */
4012 const int min_length;
4013 /* The maximum length of the list of arguments of the attribute
4014 (-1 for no maximum). */
4015 const int max_length;
4016 /* Whether this attribute requires a DECL. If it does, it will be passed
4017 from types of DECLs, function return types and array element types to
4018 the DECLs, function types and array types respectively; but when
4019 applied to a type in any other circumstances, it will be ignored with
4020 a warning. (If greater control is desired for a given attribute,
4021 this should be false, and the flags argument to the handler may be
4022 used to gain greater control in that case.) */
4023 const bool decl_required;
4024 /* Whether this attribute requires a type. If it does, it will be passed
4025 from a DECL to the type of that DECL. */
4026 const bool type_required;
4027 /* Whether this attribute requires a function (or method) type. If it does,
4028 it will be passed from a function pointer type to the target type,
4029 and from a function return type (which is not itself a function
4030 pointer type) to the function type. */
4031 const bool function_type_required;
4032 /* Function to handle this attribute. NODE points to the node to which
4033 the attribute is to be applied. If a DECL, it should be modified in
4034 place; if a TYPE, a copy should be created. NAME is the name of the
4035 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4036 of the arguments (which may be NULL). FLAGS gives further information
4037 about the context of the attribute. Afterwards, the attributes will
4038 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4039 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4040 as well as in any other cases when the attributes should not be added
4041 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4042 applied to another type or DECL later may be returned;
4043 otherwise the return value should be NULL_TREE. This pointer may be
4044 NULL if no special handling is required beyond the checks implied
4045 by the rest of this structure. */
4046 tree (*const handler) (tree *node, tree name, tree args,
4047 int flags, bool *no_add_attrs);
4050 /* Flags that may be passed in the third argument of decl_attributes, and
4051 to handler functions for attributes. */
4052 enum attribute_flags
4054 /* The type passed in is the type of a DECL, and any attributes that
4055 should be passed in again to be applied to the DECL rather than the
4056 type should be returned. */
4057 ATTR_FLAG_DECL_NEXT = 1,
4058 /* The type passed in is a function return type, and any attributes that
4059 should be passed in again to be applied to the function type rather
4060 than the return type should be returned. */
4061 ATTR_FLAG_FUNCTION_NEXT = 2,
4062 /* The type passed in is an array element type, and any attributes that
4063 should be passed in again to be applied to the array type rather
4064 than the element type should be returned. */
4065 ATTR_FLAG_ARRAY_NEXT = 4,
4066 /* The type passed in is a structure, union or enumeration type being
4067 created, and should be modified in place. */
4068 ATTR_FLAG_TYPE_IN_PLACE = 8,
4069 /* The attributes are being applied by default to a library function whose
4070 name indicates known behavior, and should be silently ignored if they
4071 are not in fact compatible with the function type. */
4072 ATTR_FLAG_BUILT_IN = 16
4075 /* Default versions of target-overridable functions. */
4077 extern tree merge_decl_attributes (tree, tree);
4078 extern tree merge_type_attributes (tree, tree);
4080 /* Given a tree node and a string, return nonzero if the tree node is
4081 a valid attribute name for the string. */
4083 extern int is_attribute_p (const char *, const_tree);
4085 /* Given an attribute name and a list of attributes, return the list element
4086 of the attribute or NULL_TREE if not found. */
4088 extern tree lookup_attribute (const char *, tree);
4090 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4093 extern tree remove_attribute (const char *, tree);
4095 /* Given two attributes lists, return a list of their union. */
4097 extern tree merge_attributes (tree, tree);
4099 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4100 /* Given two Windows decl attributes lists, possibly including
4101 dllimport, return a list of their union . */
4102 extern tree merge_dllimport_decl_attributes (tree, tree);
4104 /* Handle a "dllimport" or "dllexport" attribute. */
4105 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4108 /* Check whether CAND is suitable to be returned from get_qualified_type
4109 (BASE, TYPE_QUALS). */
4111 extern bool check_qualified_type (const_tree, const_tree, int);
4113 /* Return a version of the TYPE, qualified as indicated by the
4114 TYPE_QUALS, if one exists. If no qualified version exists yet,
4115 return NULL_TREE. */
4117 extern tree get_qualified_type (tree, int);
4119 /* Like get_qualified_type, but creates the type if it does not
4120 exist. This function never returns NULL_TREE. */
4122 extern tree build_qualified_type (tree, int);
4124 /* Like build_qualified_type, but only deals with the `const' and
4125 `volatile' qualifiers. This interface is retained for backwards
4126 compatibility with the various front-ends; new code should use
4127 build_qualified_type instead. */
4129 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4130 build_qualified_type ((TYPE), \
4131 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4132 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4134 /* Make a copy of a type node. */
4136 extern tree build_distinct_type_copy (tree);
4137 extern tree build_variant_type_copy (tree);
4139 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4140 fields. Optionally specify an alignment, and then lay it out. */
4142 extern void finish_builtin_struct (tree, const char *,
4145 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4146 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4147 node, does nothing except for the first time. */
4149 extern void layout_type (tree);
4151 /* These functions allow a front-end to perform a manual layout of a
4152 RECORD_TYPE. (For instance, if the placement of subsequent fields
4153 depends on the placement of fields so far.) Begin by calling
4154 start_record_layout. Then, call place_field for each of the
4155 fields. Then, call finish_record_layout. See layout_type for the
4156 default way in which these functions are used. */
4158 typedef struct record_layout_info_s
4160 /* The RECORD_TYPE that we are laying out. */
4162 /* The offset into the record so far, in bytes, not including bits in
4165 /* The last known alignment of SIZE. */
4166 unsigned int offset_align;
4167 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4169 /* The alignment of the record so far, in bits. */
4170 unsigned int record_align;
4171 /* The alignment of the record so far, ignoring #pragma pack and
4172 __attribute__ ((packed)), in bits. */
4173 unsigned int unpacked_align;
4174 /* The previous field layed out. */
4176 /* The static variables (i.e., class variables, as opposed to
4177 instance variables) encountered in T. */
4178 tree pending_statics;
4179 /* Bits remaining in the current alignment group */
4180 int remaining_in_alignment;
4181 /* True if we've seen a packed field that didn't have normal
4182 alignment anyway. */
4183 int packed_maybe_necessary;
4184 } *record_layout_info;
4186 extern record_layout_info start_record_layout (tree);
4187 extern tree bit_from_pos (tree, tree);
4188 extern tree byte_from_pos (tree, tree);
4189 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4190 extern void normalize_offset (tree *, tree *, unsigned int);
4191 extern tree rli_size_unit_so_far (record_layout_info);
4192 extern tree rli_size_so_far (record_layout_info);
4193 extern void normalize_rli (record_layout_info);
4194 extern void place_field (record_layout_info, tree);
4195 extern void compute_record_mode (tree);
4196 extern void finish_record_layout (record_layout_info, int);
4198 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4199 return a canonicalized ..._TYPE node, so that duplicates are not made.
4200 How the hash code is computed is up to the caller, as long as any two
4201 callers that could hash identical-looking type nodes agree. */
4203 extern tree type_hash_canon (unsigned int, tree);
4205 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4206 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4207 fields. Call this only once for any given decl node.
4209 Second argument is the boundary that this field can be assumed to
4210 be starting at (in bits). Zero means it can be assumed aligned
4211 on any boundary that may be needed. */
4213 extern void layout_decl (tree, unsigned);
4215 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4216 a previous call to layout_decl and calls it again. */
4218 extern void relayout_decl (tree);
4220 /* Return the mode for data of a given size SIZE and mode class CLASS.
4221 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4222 The value is BLKmode if no other mode is found. This is like
4223 mode_for_size, but is passed a tree. */
4225 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4227 /* Return an expr equal to X but certainly not valid as an lvalue. */
4229 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4230 extern tree non_lvalue_loc (location_t, tree);
4232 extern tree convert (tree, tree);
4233 extern unsigned int expr_align (const_tree);
4234 extern tree expr_first (tree);
4235 extern tree expr_last (tree);
4236 extern tree size_in_bytes (const_tree);
4237 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4238 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4239 extern tree tree_expr_size (const_tree);
4240 extern tree bit_position (const_tree);
4241 extern HOST_WIDE_INT int_bit_position (const_tree);
4242 extern tree byte_position (const_tree);
4243 extern HOST_WIDE_INT int_byte_position (const_tree);
4245 /* Define data structures, macros, and functions for handling sizes
4246 and the various types used to represent sizes. */
4250 SIZETYPE, /* Normal representation of sizes in bytes. */
4251 SSIZETYPE, /* Signed representation of sizes in bytes. */
4252 BITSIZETYPE, /* Normal representation of sizes in bits. */
4253 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4256 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4258 #define sizetype sizetype_tab[(int) SIZETYPE]
4259 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4260 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4261 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4263 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4264 #define size_binop(CODE,T1,T2)\
4265 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4266 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4267 #define size_diffop(T1,T2)\
4268 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4269 extern tree size_diffop_loc (location_t, tree, tree);
4271 #define size_int(L) size_int_kind (L, SIZETYPE)
4272 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4273 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4274 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4276 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4277 extern tree round_up_loc (location_t, tree, int);
4278 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4279 extern tree round_down_loc (location_t, tree, int);
4280 extern tree get_pending_sizes (void);
4281 extern void put_pending_size (tree);
4282 extern void put_pending_sizes (tree);
4283 extern void finalize_size_functions (void);
4285 /* Type for sizes of data-type. */
4287 #define BITS_PER_UNIT_LOG \
4288 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4289 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4290 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4292 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4293 extern unsigned int maximum_field_alignment;
4294 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4295 extern unsigned int initial_max_fld_align;
4297 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4298 by making the last node in X point to Y.
4299 Returns X, except if X is 0 returns Y. */
4301 extern tree chainon (tree, tree);
4303 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4305 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4306 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4308 /* Return the last tree node in a chain. */
4310 extern tree tree_last (tree);
4312 /* Reverse the order of elements in a chain, and return the new head. */
4314 extern tree nreverse (tree);
4316 /* Returns the length of a chain of nodes
4317 (number of chain pointers to follow before reaching a null pointer). */
4319 extern int list_length (const_tree);
4321 /* Returns the number of FIELD_DECLs in a type. */
4323 extern int fields_length (const_tree);
4325 /* Given an initializer INIT, return TRUE if INIT is zero or some
4326 aggregate of zeros. Otherwise return FALSE. */
4328 extern bool initializer_zerop (const_tree);
4330 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4332 extern tree ctor_to_list (tree);
4334 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4336 extern VEC(tree,gc) *ctor_to_vec (tree);
4338 /* Examine CTOR to discover:
4339 * how many scalar fields are set to nonzero values,
4340 and place it in *P_NZ_ELTS;
4341 * how many scalar fields in total are in CTOR,
4342 and place it in *P_ELT_COUNT.
4343 * if a type is a union, and the initializer from the constructor
4344 is not the largest element in the union, then set *p_must_clear.
4346 Return whether or not CTOR is a valid static constant initializer, the same
4347 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4349 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4352 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4354 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4356 extern int integer_zerop (const_tree);
4358 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4360 extern int integer_onep (const_tree);
4362 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4363 all of whose significant bits are 1. */
4365 extern int integer_all_onesp (const_tree);
4367 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4368 exactly one bit 1. */
4370 extern int integer_pow2p (const_tree);
4372 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4373 with a nonzero value. */
4375 extern int integer_nonzerop (const_tree);
4377 extern bool cst_and_fits_in_hwi (const_tree);
4378 extern tree num_ending_zeros (const_tree);
4380 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4383 extern int fixed_zerop (const_tree);
4385 /* staticp (tree x) is nonzero if X is a reference to data allocated
4386 at a fixed address in memory. Returns the outermost data. */
4388 extern tree staticp (tree);
4390 /* save_expr (EXP) returns an expression equivalent to EXP
4391 but it can be used multiple times within context CTX
4392 and only evaluate EXP once. */
4394 extern tree save_expr (tree);
4396 /* Look inside EXPR and into any simple arithmetic operations. Return
4397 the innermost non-arithmetic node. */
4399 extern tree skip_simple_arithmetic (tree);
4401 /* Return which tree structure is used by T. */
4403 enum tree_node_structure_enum tree_node_structure (const_tree);
4405 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4406 or offset that depends on a field within a record.
4408 Note that we only allow such expressions within simple arithmetic
4411 extern bool contains_placeholder_p (const_tree);
4413 /* This macro calls the above function but short-circuits the common
4414 case of a constant to save time. Also check for null. */
4416 #define CONTAINS_PLACEHOLDER_P(EXP) \
4417 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4419 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4420 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4423 extern bool type_contains_placeholder_p (tree);
4425 /* Given a tree EXP, find all occurences of references to fields
4426 in a PLACEHOLDER_EXPR and place them in vector REFS without
4427 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4428 we assume here that EXP contains only arithmetic expressions
4429 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4432 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4434 /* This macro calls the above function but short-circuits the common
4435 case of a constant to save time and also checks for NULL. */
4437 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4439 if((EXP) && !TREE_CONSTANT (EXP)) \
4440 find_placeholder_in_expr (EXP, V); \
4443 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4444 return a tree with all occurrences of references to F in a
4445 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4446 CONST_DECLs. Note that we assume here that EXP contains only
4447 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4448 occurring only in their argument list. */
4450 extern tree substitute_in_expr (tree, tree, tree);
4452 /* This macro calls the above function but short-circuits the common
4453 case of a constant to save time and also checks for NULL. */
4455 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4456 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4458 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4459 for it within OBJ, a tree that is an object or a chain of references. */
4461 extern tree substitute_placeholder_in_expr (tree, tree);
4463 /* This macro calls the above function but short-circuits the common
4464 case of a constant to save time and also checks for NULL. */
4466 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4467 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4468 : substitute_placeholder_in_expr (EXP, OBJ))
4470 /* variable_size (EXP) is like save_expr (EXP) except that it
4471 is for the special case of something that is part of a
4472 variable size for a data type. It makes special arrangements
4473 to compute the value at the right time when the data type
4474 belongs to a function parameter. */
4476 extern tree variable_size (tree);
4478 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4479 but it can be used multiple times
4480 and only evaluate the subexpressions once. */
4482 extern tree stabilize_reference (tree);
4484 /* Subroutine of stabilize_reference; this is called for subtrees of
4485 references. Any expression with side-effects must be put in a SAVE_EXPR
4486 to ensure that it is only evaluated once. */
4488 extern tree stabilize_reference_1 (tree);
4490 /* Return EXP, stripped of any conversions to wider types
4491 in such a way that the result of converting to type FOR_TYPE
4492 is the same as if EXP were converted to FOR_TYPE.
4493 If FOR_TYPE is 0, it signifies EXP's type. */
4495 extern tree get_unwidened (tree, tree);
4497 /* Return OP or a simpler expression for a narrower value
4498 which can be sign-extended or zero-extended to give back OP.
4499 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4500 or 0 if the value should be sign-extended. */
4502 extern tree get_narrower (tree, int *);
4504 /* Return true if T is an expression that get_inner_reference handles. */
4507 handled_component_p (const_tree t)
4509 switch (TREE_CODE (t))
4514 case ARRAY_RANGE_REF:
4515 case VIEW_CONVERT_EXPR:
4525 /* Given an expression EXP that is a handled_component_p,
4526 look for the ultimate containing object, which is returned and specify
4527 the access position and size. */
4529 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4530 tree *, enum machine_mode *, int *, int *,
4533 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4534 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4535 EXP is marked as PACKED. */
4537 extern bool contains_packed_reference (const_tree exp);
4539 /* Return a tree of sizetype representing the size, in bytes, of the element
4540 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4542 extern tree array_ref_element_size (tree);
4544 /* Return a tree representing the lower bound of the array mentioned in
4545 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4547 extern tree array_ref_low_bound (tree);
4549 /* Return a tree representing the upper bound of the array mentioned in
4550 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4552 extern tree array_ref_up_bound (tree);
4554 /* Return a tree representing the offset, in bytes, of the field referenced
4555 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4557 extern tree component_ref_field_offset (tree);
4559 /* Given a DECL or TYPE, return the scope in which it was declared, or
4560 NUL_TREE if there is no containing scope. */
4562 extern tree get_containing_scope (const_tree);
4564 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4566 extern tree decl_function_context (const_tree);
4568 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4569 this _DECL with its context, or zero if none. */
4570 extern tree decl_type_context (const_tree);
4572 /* Return 1 if EXPR is the real constant zero. */
4573 extern int real_zerop (const_tree);
4575 /* Declare commonly used variables for tree structure. */
4577 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4578 Zero means allow extended lvalues. */
4580 extern int pedantic_lvalues;
4582 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4584 extern GTY(()) tree current_function_decl;
4586 /* Nonzero means a FUNC_BEGIN label was emitted. */
4587 extern GTY(()) const char * current_function_func_begin_label;
4589 /* Iterator for going through the function arguments. */
4591 tree fntype; /* function type declaration */
4592 tree next; /* TREE_LIST pointing to the next argument */
4593 } function_args_iterator;
4595 /* Initialize the iterator I with arguments from function FNDECL */
4598 function_args_iter_init (function_args_iterator *i, tree fntype)
4601 i->next = TYPE_ARG_TYPES (fntype);
4604 /* Return a pointer that holds the next argument if there are more arguments to
4605 handle, otherwise return NULL. */
4607 static inline tree *
4608 function_args_iter_cond_ptr (function_args_iterator *i)
4610 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4613 /* Return the next argument if there are more arguments to handle, otherwise
4617 function_args_iter_cond (function_args_iterator *i)
4619 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4622 /* Advance to the next argument. */
4624 function_args_iter_next (function_args_iterator *i)
4626 gcc_assert (i->next != NULL_TREE);
4627 i->next = TREE_CHAIN (i->next);
4630 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4633 inlined_function_outer_scope_p (const_tree block)
4635 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4638 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4639 to point to the next tree element. ITER is an instance of
4640 function_args_iterator used to iterate the arguments. */
4641 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4642 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4643 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4644 function_args_iter_next (&(ITER)))
4646 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4647 to the next tree element. ITER is an instance of function_args_iterator
4648 used to iterate the arguments. */
4649 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4650 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4651 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4652 function_args_iter_next (&(ITER)))
4657 extern unsigned crc32_string (unsigned, const char *);
4658 extern void clean_symbol_name (char *);
4659 extern tree get_file_function_name (const char *);
4660 extern tree get_callee_fndecl (const_tree);
4661 extern int type_num_arguments (const_tree);
4662 extern bool associative_tree_code (enum tree_code);
4663 extern bool commutative_tree_code (enum tree_code);
4664 extern tree upper_bound_in_type (tree, tree);
4665 extern tree lower_bound_in_type (tree, tree);
4666 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4667 extern tree call_expr_arg (tree, int);
4668 extern tree *call_expr_argp (tree, int);
4669 extern tree call_expr_arglist (tree);
4670 extern tree create_artificial_label (location_t);
4671 extern const char *get_name (tree);
4672 extern bool stdarg_p (tree);
4673 extern bool prototype_p (tree);
4674 extern bool auto_var_in_fn_p (const_tree, const_tree);
4675 extern tree build_low_bits_mask (tree, unsigned);
4676 extern tree tree_strip_nop_conversions (tree);
4677 extern tree tree_strip_sign_nop_conversions (tree);
4678 extern tree lhd_gcc_personality (void);
4681 extern void change_decl_assembler_name (tree, tree);
4684 extern tree unshare_expr (tree);
4688 extern void expand_expr_stmt (tree);
4689 extern int warn_if_unused_value (const_tree, location_t);
4690 extern void expand_label (tree);
4691 extern void expand_goto (tree);
4693 extern rtx expand_stack_save (void);
4694 extern void expand_stack_restore (tree);
4695 extern void expand_return (tree);
4698 extern void using_eh_for_cleanups (void);
4700 /* In fold-const.c */
4702 /* Non-zero if we are folding constants inside an initializer; zero
4704 extern int folding_initializer;
4706 /* Convert between trees and native memory representation. */
4707 extern int native_encode_expr (const_tree, unsigned char *, int);
4708 extern tree native_interpret_expr (tree, const unsigned char *, int);
4710 /* Fold constants as much as possible in an expression.
4711 Returns the simplified expression.
4712 Acts only on the top level of the expression;
4713 if the argument itself cannot be simplified, its
4714 subexpressions are not changed. */
4716 extern tree fold (tree);
4717 #define fold_unary(CODE,T1,T2)\
4718 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4719 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4720 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4721 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4722 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4723 #define fold_binary(CODE,T1,T2,T3)\
4724 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4725 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4726 #define fold_ternary(CODE,T1,T2,T3,T4)\
4727 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4728 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4729 #define fold_build1(c,t1,t2)\
4730 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4731 #define fold_build1_loc(l,c,t1,t2)\
4732 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4733 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4734 tree MEM_STAT_DECL);
4735 #define fold_build2(c,t1,t2,t3)\
4736 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4737 #define fold_build2_loc(l,c,t1,t2,t3)\
4738 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4739 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4740 tree MEM_STAT_DECL);
4741 #define fold_build3(c,t1,t2,t3,t4)\
4742 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4743 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4744 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4745 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4746 tree MEM_STAT_DECL);
4747 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4748 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4749 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4750 #define fold_build_call_array(T1,T2,N,T4)\
4751 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4752 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4753 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4754 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4755 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4756 extern bool fold_convertible_p (const_tree, const_tree);
4757 #define fold_convert(T1,T2)\
4758 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4759 extern tree fold_convert_loc (location_t, tree, tree);
4760 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4761 extern tree fold_ignored_result (tree);
4762 extern tree fold_abs_const (tree, tree);
4763 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4764 extern void fold_defer_overflow_warnings (void);
4765 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4766 extern void fold_undefer_and_ignore_overflow_warnings (void);
4767 extern bool fold_deferring_overflow_warnings_p (void);
4769 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4772 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4773 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4774 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4775 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4776 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4778 #define add_double(l1,h1,l2,h2,lv,hv) \
4779 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4780 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4781 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4782 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4783 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4784 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4786 #define mul_double(l1,h1,l2,h2,lv,hv) \
4787 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4788 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4789 HOST_WIDE_INT, unsigned int,
4790 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4791 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4792 HOST_WIDE_INT, unsigned int,
4793 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4794 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4795 HOST_WIDE_INT, unsigned int,
4796 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4797 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4798 HOST_WIDE_INT, unsigned int,
4799 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4801 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4802 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4803 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4804 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4807 enum operand_equal_flag
4813 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4814 extern int multiple_of_p (tree, const_tree, const_tree);
4815 #define omit_one_operand(T1,T2,T3)\
4816 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4817 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4818 #define omit_two_operands(T1,T2,T3,T4)\
4819 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4820 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4821 #define invert_truthvalue(T)\
4822 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4823 extern tree invert_truthvalue_loc (location_t, tree);
4824 extern tree fold_truth_not_expr (location_t, tree);
4825 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4826 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4827 extern tree fold_read_from_constant_string (tree);
4828 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4829 #define build_fold_addr_expr(T)\
4830 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4831 extern tree build_fold_addr_expr_loc (location_t, tree);
4832 #define build_fold_addr_expr_with_type(T,TYPE)\
4833 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4834 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4835 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4836 extern tree fold_strip_sign_ops (tree);
4837 #define build_fold_indirect_ref(T)\
4838 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4839 extern tree build_fold_indirect_ref_loc (location_t, tree);
4840 #define fold_indirect_ref(T)\
4841 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4842 extern tree fold_indirect_ref_loc (location_t, tree);
4843 extern tree constant_boolean_node (int, tree);
4844 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
4846 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4847 extern enum tree_code swap_tree_comparison (enum tree_code);
4849 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4850 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4852 extern bool tree_expr_nonzero_p (tree);
4853 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4854 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4856 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4857 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4858 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4860 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4861 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4862 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
4864 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4866 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4867 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
4868 enum tree_code, tree, tree, tree);
4869 extern void debug_fold_checksum (const_tree);
4871 /* Return nonzero if CODE is a tree code that represents a truth value. */
4873 truth_value_p (enum tree_code code)
4875 return (TREE_CODE_CLASS (code) == tcc_comparison
4876 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4877 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4878 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4883 extern tree fold_call_expr (location_t, tree, bool);
4884 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4885 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4886 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4887 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4888 enum built_in_function);
4889 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4890 enum built_in_function);
4891 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
4892 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
4893 extern bool fold_builtin_next_arg (tree, bool);
4894 extern enum built_in_function builtin_mathfn_code (const_tree);
4895 extern tree build_function_call_expr (location_t, tree, tree);
4896 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4897 #define build_call_expr(...)\
4898 build_call_expr_loc (UNKNOWN_LOCATION, __VA_ARGS__)
4899 extern tree build_call_expr_loc (location_t, tree, int, ...);
4900 extern tree mathfn_built_in (tree, enum built_in_function fn);
4901 extern tree c_strlen (tree, int);
4902 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
4903 extern tree build_va_arg_indirect_ref (tree);
4904 extern tree build_string_literal (int, const char *);
4905 extern bool validate_arglist (const_tree, ...);
4906 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4907 extern bool can_trust_pointer_alignment (void);
4908 extern int get_pointer_alignment (tree, unsigned int);
4909 extern bool is_builtin_name (const char *);
4910 extern bool is_builtin_fn (tree);
4911 extern int get_object_alignment (tree, unsigned int, unsigned int);
4912 extern tree fold_call_stmt (gimple, bool);
4913 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
4914 extern tree make_range (tree, int *, tree *, tree *, bool *);
4915 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
4916 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
4918 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
4921 extern tree strip_float_extensions (tree);
4924 extern int really_constant_p (const_tree);
4925 extern bool decl_address_invariant_p (const_tree);
4926 extern bool decl_address_ip_invariant_p (const_tree);
4927 extern int int_fits_type_p (const_tree, const_tree);
4928 #ifndef GENERATOR_FILE
4929 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4931 extern bool variably_modified_type_p (tree, tree);
4932 extern int tree_log2 (const_tree);
4933 extern int tree_floor_log2 (const_tree);
4934 extern int simple_cst_equal (const_tree, const_tree);
4935 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4936 extern hashval_t iterative_hash_exprs_commutative (const_tree,
4937 const_tree, hashval_t);
4938 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4939 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
4940 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4941 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4942 extern int type_list_equal (const_tree, const_tree);
4943 extern int chain_member (const_tree, const_tree);
4944 extern tree type_hash_lookup (unsigned int, tree);
4945 extern void type_hash_add (unsigned int, tree);
4946 extern int simple_cst_list_equal (const_tree, const_tree);
4947 extern void dump_tree_statistics (void);
4948 extern void recompute_tree_invariant_for_addr_expr (tree);
4949 extern bool needs_to_live_in_memory (const_tree);
4950 extern tree reconstruct_complex_type (tree, tree);
4952 extern int real_onep (const_tree);
4953 extern int real_twop (const_tree);
4954 extern int real_minus_onep (const_tree);
4955 extern void init_ttree (void);
4956 extern void build_common_tree_nodes (bool, bool);
4957 extern void build_common_tree_nodes_2 (int);
4958 extern void build_common_builtin_nodes (void);
4959 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4960 extern tree build_range_type (tree, tree, tree);
4961 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4962 extern HOST_WIDE_INT int_cst_value (const_tree);
4963 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
4965 extern bool fields_compatible_p (const_tree, const_tree);
4966 extern tree find_compatible_field (tree, tree);
4968 extern tree *tree_block (tree);
4969 extern location_t *block_nonartificial_location (tree);
4970 extern location_t tree_nonartificial_location (tree);
4972 extern tree block_ultimate_origin (const_tree);
4974 /* In tree-nested.c */
4975 extern tree build_addr (tree, tree);
4978 extern void expand_main_function (void);
4979 extern void expand_function_end (void);
4980 extern void expand_function_start (tree);
4981 extern void stack_protect_prologue (void);
4982 extern void stack_protect_epilogue (void);
4983 extern void init_dummy_function_start (void);
4984 extern void expand_dummy_function_end (void);
4985 extern unsigned int init_function_for_compilation (void);
4986 extern void allocate_struct_function (tree, bool);
4987 extern void push_struct_function (tree fndecl);
4988 extern void init_function_start (tree);
4989 extern bool use_register_for_decl (const_tree);
4990 extern void generate_setjmp_warnings (void);
4991 extern void init_temp_slots (void);
4992 extern void free_temp_slots (void);
4993 extern void pop_temp_slots (void);
4994 extern void push_temp_slots (void);
4995 extern void preserve_temp_slots (rtx);
4996 extern int aggregate_value_p (const_tree, const_tree);
4997 extern void push_function_context (void);
4998 extern void pop_function_context (void);
4999 extern gimple_seq gimplify_parameters (void);
5001 /* In print-rtl.c */
5003 extern void print_rtl (FILE *, const_rtx);
5006 /* In print-tree.c */
5007 extern void debug_tree (tree);
5009 extern void dump_addr (FILE*, const char *, const void *);
5010 extern void print_node (FILE *, const char *, tree, int);
5011 extern void print_node_brief (FILE *, const char *, const_tree, int);
5012 extern void indent_to (FILE *, int);
5015 /* In tree-inline.c: */
5016 extern bool debug_find_tree (tree, tree);
5017 /* This is in tree-inline.c since the routine uses
5018 data structures from the inliner. */
5019 extern tree unsave_expr_now (tree);
5020 extern tree build_duplicate_type (tree);
5024 /* Nonzero if this is a call to a function whose return value depends
5025 solely on its arguments, has no side effects, and does not read
5026 global memory. This corresponds to TREE_READONLY for function
5028 #define ECF_CONST (1 << 0)
5029 /* Nonzero if this is a call to "pure" function (like const function,
5030 but may read memory. This corresponds to DECL_PURE_P for function
5032 #define ECF_PURE (1 << 1)
5033 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5034 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5035 for function decls.*/
5036 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5037 /* Nonzero if this call will never return. */
5038 #define ECF_NORETURN (1 << 3)
5039 /* Nonzero if this is a call to malloc or a related function. */
5040 #define ECF_MALLOC (1 << 4)
5041 /* Nonzero if it is plausible that this is a call to alloca. */
5042 #define ECF_MAY_BE_ALLOCA (1 << 5)
5043 /* Nonzero if this is a call to a function that won't throw an exception. */
5044 #define ECF_NOTHROW (1 << 6)
5045 /* Nonzero if this is a call to setjmp or a related function. */
5046 #define ECF_RETURNS_TWICE (1 << 7)
5047 /* Nonzero if this call replaces the current stack frame. */
5048 #define ECF_SIBCALL (1 << 8)
5049 /* Function does not read or write memory (but may have side effects, so
5050 it does not necessarily fit ECF_CONST). */
5051 #define ECF_NOVOPS (1 << 9)
5053 extern int flags_from_decl_or_type (const_tree);
5054 extern int call_expr_flags (const_tree);
5056 extern int setjmp_call_p (const_tree);
5057 extern bool gimple_alloca_call_p (const_gimple);
5058 extern bool alloca_call_p (const_tree);
5059 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5060 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5064 extern const struct attribute_spec *lookup_attribute_spec (tree);
5066 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5067 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5068 it should be modified in place; if a TYPE, a copy should be created
5069 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5070 information, in the form of a bitwise OR of flags in enum attribute_flags
5071 from tree.h. Depending on these flags, some attributes may be
5072 returned to be applied at a later stage (for example, to apply
5073 a decl attribute to the declaration rather than to its type). */
5074 extern tree decl_attributes (tree *, tree, int);
5076 /* In integrate.c */
5077 extern void set_decl_abstract_flags (tree, int);
5078 extern void set_decl_origin_self (tree);
5080 /* In stor-layout.c */
5081 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5082 extern void fixup_signed_type (tree);
5083 extern void internal_reference_types (void);
5084 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5087 extern void make_decl_rtl (tree);
5088 extern void make_decl_one_only (tree, tree);
5089 extern int supports_one_only (void);
5090 extern void resolve_unique_section (tree, int, int);
5091 extern void mark_referenced (tree);
5092 extern void mark_decl_referenced (tree);
5093 extern void notice_global_symbol (tree);
5094 extern void set_user_assembler_name (tree, const char *);
5095 extern void process_pending_assemble_externals (void);
5096 extern void finish_aliases_1 (void);
5097 extern void finish_aliases_2 (void);
5098 extern tree emutls_decl (tree);
5099 extern void remove_unreachable_alias_pairs (void);
5102 extern void expand_computed_goto (tree);
5103 extern bool parse_output_constraint (const char **, int, int, int,
5104 bool *, bool *, bool *);
5105 extern bool parse_input_constraint (const char **, int, int, int, int,
5106 const char * const *, bool *, bool *);
5107 extern void expand_asm_stmt (gimple);
5108 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5109 extern void expand_case (gimple);
5110 extern void expand_decl (tree);
5112 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5113 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5117 /* In dwarf2out.c */
5118 /* Interface of the DWARF2 unwind info support. */
5120 /* Generate a new label for the CFI info to refer to. */
5122 extern char *dwarf2out_cfi_label (bool);
5124 /* Entry point to update the canonical frame address (CFA). */
5126 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5128 /* Add the CFI for saving a register window. */
5130 extern void dwarf2out_window_save (const char *);
5132 /* Add a CFI to update the running total of the size of arguments pushed
5135 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5137 /* Entry point for saving a register to the stack. */
5139 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5141 /* Entry point for saving the return address in the stack. */
5143 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5145 /* Entry point for saving the return address in a register. */
5147 extern void dwarf2out_return_reg (const char *, unsigned);
5149 /* Entry point for saving the first register into the second. */
5151 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5153 /* In tree-inline.c */
5155 /* The type of a set of already-visited pointers. Functions for creating
5156 and manipulating it are declared in pointer-set.h */
5157 struct pointer_set_t;
5159 /* The type of a callback function for walking over tree structure. */
5161 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5163 /* The type of a callback function that represents a custom walk_tree. */
5165 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5166 void *, struct pointer_set_t*);
5168 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5170 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5172 #define walk_tree(a,b,c,d) \
5173 walk_tree_1 (a, b, c, d, NULL)
5174 #define walk_tree_without_duplicates(a,b,c) \
5175 walk_tree_without_duplicates_1 (a, b, c, NULL)
5178 /* Assign the RTX to declaration. */
5180 extern void set_decl_rtl (tree, rtx);
5181 extern void set_decl_incoming_rtl (tree, rtx, bool);
5183 /* Enum and arrays used for tree allocation stats.
5184 Keep in sync with tree.c:tree_node_kind_names. */
5208 extern int tree_node_counts[];
5209 extern int tree_node_sizes[];
5211 /* True if we are in gimple form and the actions of the folders need to
5212 be restricted. False if we are not in gimple form and folding is not
5213 restricted to creating gimple expressions. */
5214 extern bool in_gimple_form;
5217 extern tree get_base_address (tree t);
5218 extern void mark_addressable (tree);
5220 /* In tree-vectorizer.c. */
5221 extern void vect_set_verbosity_level (const char *);
5225 struct GTY(()) tree_map_base {
5229 extern int tree_map_base_eq (const void *, const void *);
5230 extern unsigned int tree_map_base_hash (const void *);
5231 extern int tree_map_base_marked_p (const void *);
5232 extern bool list_equal_p (const_tree, const_tree);
5234 /* Map from a tree to another tree. */
5236 struct GTY(()) tree_map {
5237 struct tree_map_base base;
5242 #define tree_map_eq tree_map_base_eq
5243 extern unsigned int tree_map_hash (const void *);
5244 #define tree_map_marked_p tree_map_base_marked_p
5246 /* Map from a tree to an int. */
5248 struct GTY(()) tree_int_map {
5249 struct tree_map_base base;
5253 #define tree_int_map_eq tree_map_base_eq
5254 #define tree_int_map_hash tree_map_base_hash
5255 #define tree_int_map_marked_p tree_map_base_marked_p
5257 /* Map from a tree to initialization/finalization priorities. */
5259 struct GTY(()) tree_priority_map {
5260 struct tree_map_base base;
5265 #define tree_priority_map_eq tree_map_base_eq
5266 #define tree_priority_map_hash tree_map_base_hash
5267 #define tree_priority_map_marked_p tree_map_base_marked_p
5271 tree target_for_debug_bind (tree);
5273 /* In tree-ssa-ccp.c */
5274 extern tree maybe_fold_offset_to_reference (location_t, tree, tree, tree);
5275 extern tree maybe_fold_offset_to_address (location_t, tree, tree, tree);
5276 extern tree maybe_fold_stmt_addition (location_t, tree, tree, tree);
5278 /* In tree-ssa-address.c. */
5279 extern tree tree_mem_ref_addr (tree, tree);
5280 extern void copy_mem_ref_info (tree, tree);
5283 extern bool ssa_name_nonnegative_p (const_tree);
5285 /* In tree-object-size.c. */
5286 extern void init_object_sizes (void);
5287 extern void fini_object_sizes (void);
5288 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5291 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5292 extern tree build_personality_function (const char *);
5294 /* In tree-inline.c. */
5296 void init_inline_once (void);
5298 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5299 extern GTY(()) tree memory_identifier_string;
5301 /* Compute the number of operands in an expression node NODE. For
5302 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5303 otherwise it is looked up from the node's code. */
5305 tree_operand_length (const_tree node)
5307 if (VL_EXP_CLASS_P (node))
5308 return VL_EXP_OPERAND_LENGTH (node);
5310 return TREE_CODE_LENGTH (TREE_CODE (node));
5313 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5314 have to go towards the end of tree.h so that union tree_node is fully
5315 defined by this point. */
5317 /* Structure containing iterator state. */
5318 typedef struct GTY (()) call_expr_arg_iterator_d {
5319 tree t; /* the call_expr */
5320 int n; /* argument count */
5321 int i; /* next argument index */
5322 } call_expr_arg_iterator;
5324 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5325 const_tree t; /* the call_expr */
5326 int n; /* argument count */
5327 int i; /* next argument index */
5328 } const_call_expr_arg_iterator;
5330 /* Initialize the abstract argument list iterator object ITER with the
5331 arguments from CALL_EXPR node EXP. */
5333 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5336 iter->n = call_expr_nargs (exp);
5341 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5344 iter->n = call_expr_nargs (exp);
5348 /* Return the next argument from abstract argument list iterator object ITER,
5349 and advance its state. Return NULL_TREE if there are no more arguments. */
5351 next_call_expr_arg (call_expr_arg_iterator *iter)
5354 if (iter->i >= iter->n)
5356 result = CALL_EXPR_ARG (iter->t, iter->i);
5361 static inline const_tree
5362 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5365 if (iter->i >= iter->n)
5367 result = CALL_EXPR_ARG (iter->t, iter->i);
5372 /* Initialize the abstract argument list iterator object ITER, then advance
5373 past and return the first argument. Useful in for expressions, e.g.
5374 for (arg = first_call_expr_arg (exp, &iter); arg;
5375 arg = next_call_expr_arg (&iter)) */
5377 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5379 init_call_expr_arg_iterator (exp, iter);
5380 return next_call_expr_arg (iter);
5383 static inline const_tree
5384 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5386 init_const_call_expr_arg_iterator (exp, iter);
5387 return next_const_call_expr_arg (iter);
5390 /* Test whether there are more arguments in abstract argument list iterator
5391 ITER, without changing its state. */
5393 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5395 return (iter->i < iter->n);
5399 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5401 return (iter->i < iter->n);
5404 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5405 (of type call_expr_arg_iterator) to hold the iteration state. */
5406 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5407 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5408 (arg) = next_call_expr_arg (&(iter)))
5410 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5411 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5412 (arg) = next_const_call_expr_arg (&(iter)))
5414 /* Return true if tree node T is a language-specific node. */
5416 is_lang_specific (tree t)
5418 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5421 #endif /* GCC_TREE_H */