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
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 CODE represents a memory tag. */
110 #define MTAG_P(CODE) \
111 (TREE_CODE (CODE) == NAME_MEMORY_TAG \
112 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
113 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
116 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
118 #define VAR_OR_FUNCTION_DECL_P(DECL)\
119 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
121 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
122 ascending code order. */
124 #define INDIRECT_REF_P(CODE)\
125 (TREE_CODE (CODE) == INDIRECT_REF \
126 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
127 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
129 /* Nonzero if CODE represents a reference. */
131 #define REFERENCE_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
134 /* Nonzero if CODE represents a comparison. */
136 #define COMPARISON_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
139 /* Nonzero if CODE represents a unary arithmetic expression. */
141 #define UNARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
144 /* Nonzero if CODE represents a binary arithmetic expression. */
146 #define BINARY_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
149 /* Nonzero if CODE represents a statement expression. */
151 #define STATEMENT_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
154 /* Nonzero if CODE represents a function call-like expression with a
155 variable-length operand vector. */
157 #define VL_EXP_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
160 /* Nonzero if CODE represents any other expression. */
162 #define EXPRESSION_CLASS_P(CODE)\
163 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
165 /* Returns nonzero iff CODE represents a type or declaration. */
167 #define IS_TYPE_OR_DECL_P(CODE)\
168 (TYPE_P (CODE) || DECL_P (CODE))
170 /* Returns nonzero iff CLASS is the tree-code class of an
173 #define IS_EXPR_CODE_CLASS(CLASS)\
174 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
176 /* Returns nonzero iff NODE is an expression of some kind. */
178 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
180 /* Number of argument-words in each kind of tree-node. */
182 extern const unsigned char tree_code_length
[];
183 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
185 /* Names of tree components. */
187 extern const char *const tree_code_name
[];
189 /* A vectors of trees. */
191 DEF_VEC_ALLOC_P(tree
,gc
);
192 DEF_VEC_ALLOC_P(tree
,heap
);
195 /* Classify which part of the compiler has defined a given builtin function.
196 Note that we assume below that this is no more than two bits. */
205 /* Names for the above. */
206 extern const char *const built_in_class_names
[4];
208 /* Codes that identify the various built in functions
209 so that expand_call can identify them quickly. */
211 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
212 enum built_in_function
214 #include "builtins.def"
216 /* Complex division routines in libgcc. These are done via builtins
217 because emit_library_call_value can't handle complex values. */
218 BUILT_IN_COMPLEX_MUL_MIN
,
219 BUILT_IN_COMPLEX_MUL_MAX
220 = BUILT_IN_COMPLEX_MUL_MIN
221 + MAX_MODE_COMPLEX_FLOAT
222 - MIN_MODE_COMPLEX_FLOAT
,
224 BUILT_IN_COMPLEX_DIV_MIN
,
225 BUILT_IN_COMPLEX_DIV_MAX
226 = BUILT_IN_COMPLEX_DIV_MIN
227 + MAX_MODE_COMPLEX_FLOAT
228 - MIN_MODE_COMPLEX_FLOAT
,
230 /* Upper bound on non-language-specific builtins. */
235 /* Names for the above. */
236 extern const char * built_in_names
[(int) END_BUILTINS
];
238 /* Helper macros for math builtins. */
240 #define BUILTIN_EXP10_P(FN) \
241 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
242 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
244 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
245 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
246 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
248 #define BUILTIN_SQRT_P(FN) \
249 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
251 #define BUILTIN_CBRT_P(FN) \
252 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
254 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
256 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
257 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
258 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
260 /* An array of _DECL trees for the above. */
261 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
262 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
264 /* In an OMP_CLAUSE node. */
266 /* Number of operands and names for each clause. */
267 extern unsigned const char omp_clause_num_ops
[];
268 extern const char * const omp_clause_code_name
[];
270 /* Clause codes. Do not reorder, as this is used to index into the tables
271 omp_clause_num_ops and omp_clause_code_name. */
274 /* Clause zero is special-cased inside the parser
275 (c_parser_omp_variable_list). */
276 OMP_CLAUSE_ERROR
= 0,
278 /* OpenMP clause: private (variable_list). */
281 /* OpenMP clause: shared (variable_list). */
284 /* OpenMP clause: firstprivate (variable_list). */
285 OMP_CLAUSE_FIRSTPRIVATE
,
287 /* OpenMP clause: lastprivate (variable_list). */
288 OMP_CLAUSE_LASTPRIVATE
,
290 /* OpenMP clause: reduction (operator:variable_list).
291 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
292 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
293 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
295 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
296 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
297 OMP_CLAUSE_REDUCTION
,
299 /* OpenMP clause: copyin (variable_list). */
302 /* OpenMP clause: copyprivate (variable_list). */
303 OMP_CLAUSE_COPYPRIVATE
,
305 /* OpenMP clause: if (scalar-expression). */
308 /* OpenMP clause: num_threads (integer-expression). */
309 OMP_CLAUSE_NUM_THREADS
,
311 /* OpenMP clause: schedule. */
314 /* OpenMP clause: nowait. */
317 /* OpenMP clause: ordered. */
320 /* OpenMP clause: default. */
323 /* OpenMP clause: collapse (constant-integer-expression). */
326 /* OpenMP clause: untied. */
330 /* The definition of tree nodes fills the next several pages. */
332 /* A tree node can represent a data type, a variable, an expression
333 or a statement. Each node has a TREE_CODE which says what kind of
334 thing it represents. Some common codes are:
335 INTEGER_TYPE -- represents a type of integers.
336 ARRAY_TYPE -- represents a type of pointer.
337 VAR_DECL -- represents a declared variable.
338 INTEGER_CST -- represents a constant integer value.
339 PLUS_EXPR -- represents a sum (an expression).
341 As for the contents of a tree node: there are some fields
342 that all nodes share. Each TREE_CODE has various special-purpose
343 fields as well. The fields of a node are never accessed directly,
344 always through accessor macros. */
346 /* Every kind of tree node starts with this structure,
347 so all nodes have these fields.
349 See the accessor macros, defined below, for documentation of the
353 struct tree_base
GTY(())
355 ENUM_BITFIELD(tree_code
) code
: 16;
357 unsigned side_effects_flag
: 1;
358 unsigned constant_flag
: 1;
359 unsigned addressable_flag
: 1;
360 unsigned volatile_flag
: 1;
361 unsigned readonly_flag
: 1;
362 unsigned unsigned_flag
: 1;
363 unsigned asm_written_flag
: 1;
364 unsigned nowarning_flag
: 1;
366 unsigned used_flag
: 1;
367 unsigned nothrow_flag
: 1;
368 unsigned static_flag
: 1;
369 unsigned public_flag
: 1;
370 unsigned private_flag
: 1;
371 unsigned protected_flag
: 1;
372 unsigned deprecated_flag
: 1;
373 unsigned saturating_flag
: 1;
374 unsigned default_def_flag
: 1;
376 unsigned lang_flag_0
: 1;
377 unsigned lang_flag_1
: 1;
378 unsigned lang_flag_2
: 1;
379 unsigned lang_flag_3
: 1;
380 unsigned lang_flag_4
: 1;
381 unsigned lang_flag_5
: 1;
382 unsigned lang_flag_6
: 1;
383 unsigned visited
: 1;
387 union tree_ann_d
*ann
;
390 struct tree_common
GTY(())
392 struct tree_base base
;
397 /* The following table lists the uses of each of the above flags and
398 for which types of nodes they are defined.
403 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
405 CONSTRUCTOR, IDENTIFIER_NODE
406 STMT_EXPR, it means we want the result of the enclosed expression
408 CALL_EXPR_TAILCALL in
417 VAR_DECL, FUNCTION_DECL
420 TREE_NO_TRAMPOLINE in
426 TREE_SYMBOL_REFERENCED in
430 TARGET_EXPR, WITH_CLEANUP_EXPR
432 TRY_CATCH_IS_CLEANUP in
438 EH_FILTER_MUST_NOT_THROW in
441 TYPE_REF_CAN_ALIAS_ALL in
442 POINTER_TYPE, REFERENCE_TYPE
450 CALL_CANNOT_INLINE_P in
456 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
459 VAR_DECL, FUNCTION_DECL
465 CALL_EXPR_VA_ARG_PACK in
468 TYPE_CACHED_VALUES_P in
471 SAVE_EXPR_RESOLVED_P in
474 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
475 OMP_CLAUSE_LASTPRIVATE
477 OMP_CLAUSE_PRIVATE_DEBUG in
485 CALL_EXPR_RETURN_SLOT_OPT in
489 PARM_DECL, RESULT_DECL
494 OMP_PARALLEL_COMBINED in
496 OMP_CLAUSE_PRIVATE_OUTER_REF in
520 TREE_THIS_VOLATILE in
543 TYPE_SIZES_GIMPLIFIED in
554 REGISTER_DEFS_IN_THIS_STMT in
555 all expressions (tree-into-ssa.c)
560 VAR_DECL, FUNCTION_DECL
561 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
562 BLOCK, SSA_NAME, STRING_CST
565 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
584 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
591 IDENTIFIER_TRANSPARENT_ALIAS in
594 STMT_IN_SSA_EDGE_WORKLIST in
595 all expressions (tree-ssa-propagate.c)
600 all trees (used liberally by many passes)
615 SSA_NAME_IS_DEFAULT_DEF in
620 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
621 enum tree_node_structure_enum
{
622 #include "treestruct.def"
627 /* Define accessors for the fields that all tree nodes have
628 (though some fields are not used for all kinds of nodes). */
630 /* The tree-code says what kind of node it is.
631 Codes are defined in tree.def. */
632 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
633 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
635 /* When checking is enabled, errors will be generated if a tree node
636 is accessed incorrectly. The macros die with a fatal error. */
637 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
639 #define TREE_CHECK(T, CODE) __extension__ \
640 ({ __typeof (T) const __t = (T); \
641 if (TREE_CODE (__t) != (CODE)) \
642 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
646 #define TREE_NOT_CHECK(T, CODE) __extension__ \
647 ({ __typeof (T) const __t = (T); \
648 if (TREE_CODE (__t) == (CODE)) \
649 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
653 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
654 ({ __typeof (T) const __t = (T); \
655 if (TREE_CODE (__t) != (CODE1) \
656 && TREE_CODE (__t) != (CODE2)) \
657 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
658 (CODE1), (CODE2), 0); \
661 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
662 ({ __typeof (T) const __t = (T); \
663 if (TREE_CODE (__t) == (CODE1) \
664 || TREE_CODE (__t) == (CODE2)) \
665 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
666 (CODE1), (CODE2), 0); \
669 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
670 ({ __typeof (T) const __t = (T); \
671 if (TREE_CODE (__t) != (CODE1) \
672 && TREE_CODE (__t) != (CODE2) \
673 && TREE_CODE (__t) != (CODE3)) \
674 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
675 (CODE1), (CODE2), (CODE3), 0); \
678 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) == (CODE1) \
681 || TREE_CODE (__t) == (CODE2) \
682 || TREE_CODE (__t) == (CODE3)) \
683 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
684 (CODE1), (CODE2), (CODE3), 0); \
687 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
688 ({ __typeof (T) const __t = (T); \
689 if (TREE_CODE (__t) != (CODE1) \
690 && TREE_CODE (__t) != (CODE2) \
691 && TREE_CODE (__t) != (CODE3) \
692 && TREE_CODE (__t) != (CODE4)) \
693 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
694 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
697 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
698 ({ __typeof (T) const __t = (T); \
699 if (TREE_CODE (__t) == (CODE1) \
700 || TREE_CODE (__t) == (CODE2) \
701 || TREE_CODE (__t) == (CODE3) \
702 || TREE_CODE (__t) == (CODE4)) \
703 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
704 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
707 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
708 ({ __typeof (T) const __t = (T); \
709 if (TREE_CODE (__t) != (CODE1) \
710 && TREE_CODE (__t) != (CODE2) \
711 && TREE_CODE (__t) != (CODE3) \
712 && TREE_CODE (__t) != (CODE4) \
713 && TREE_CODE (__t) != (CODE5)) \
714 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
715 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
718 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
719 ({ __typeof (T) const __t = (T); \
720 if (TREE_CODE (__t) == (CODE1) \
721 || TREE_CODE (__t) == (CODE2) \
722 || TREE_CODE (__t) == (CODE3) \
723 || TREE_CODE (__t) == (CODE4) \
724 || TREE_CODE (__t) == (CODE5)) \
725 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
726 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
729 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
730 ({ __typeof (T) const __t = (T); \
731 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
732 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
736 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
737 ({ __typeof (T) const __t = (T); \
738 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
739 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
743 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
746 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
750 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
751 ({ __typeof (T) const __t = (T); \
752 if (TREE_CODE (__t) != OMP_CLAUSE) \
753 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
755 if (__t->omp_clause.code != (CODE)) \
756 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
760 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
761 ({ __typeof (T) const __t = (T); \
762 if (TREE_CODE (__t) != OMP_CLAUSE) \
763 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
765 if ((int) __t->omp_clause.code < (int) (CODE1) \
766 || (int) __t->omp_clause.code > (int) (CODE2)) \
767 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
768 __FUNCTION__, (CODE1), (CODE2)); \
771 /* These checks have to be special cased. */
772 #define EXPR_CHECK(T) __extension__ \
773 ({ __typeof (T) const __t = (T); \
774 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
775 if (!IS_EXPR_CODE_CLASS (__c)) \
776 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
780 /* These checks have to be special cased. */
781 #define NON_TYPE_CHECK(T) __extension__ \
782 ({ __typeof (T) const __t = (T); \
784 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
788 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
789 (*({__typeof (T) const __t = (T); \
790 const int __i = (I); \
791 if (TREE_CODE (__t) != TREE_VEC) \
792 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
794 if (__i < 0 || __i >= __t->vec.length) \
795 tree_vec_elt_check_failed (__i, __t->vec.length, \
796 __FILE__, __LINE__, __FUNCTION__); \
797 &__t->vec.a[__i]; }))
799 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
800 (*({__typeof (T) const __t = (T); \
801 const int __i = (I); \
802 if (TREE_CODE (__t) != OMP_CLAUSE) \
803 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
805 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
806 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
808 &__t->omp_clause.ops[__i]; }))
810 /* Special checks for TREE_OPERANDs. */
811 #define TREE_OPERAND_CHECK(T, I) __extension__ \
812 (*({__typeof (T) const __t = EXPR_CHECK (T); \
813 const int __i = (I); \
814 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
815 tree_operand_check_failed (__i, __t, \
816 __FILE__, __LINE__, __FUNCTION__); \
817 &__t->exp.operands[__i]; }))
819 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
820 (*({__typeof (T) const __t = (T); \
821 const int __i = (I); \
822 if (TREE_CODE (__t) != CODE) \
823 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
824 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
825 tree_operand_check_failed (__i, __t, \
826 __FILE__, __LINE__, __FUNCTION__); \
827 &__t->exp.operands[__i]; }))
829 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
831 ({__typeof (T) const __t = (T); \
832 const int __i = (I); \
833 if (TREE_CODE (__t) != (CODE)) \
834 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
835 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
836 tree_operand_check_failed (__i, __t, \
837 __FILE__, __LINE__, __FUNCTION__); \
838 &__t->exp.operands[__i]; }))
840 /* Nodes are chained together for many purposes.
841 Types are chained together to record them for being output to the debugger
842 (see the function `chain_type').
843 Decls in the same scope are chained together to record the contents
845 Statement nodes for successive statements used to be chained together.
846 Often lists of things are represented by TREE_LIST nodes that
847 are chained together. */
849 #define TREE_CHAIN(NODE) __extension__ \
850 (*({__typeof (NODE) const __t = (NODE); \
851 &__t->common.chain; }))
853 /* In all nodes that are expressions, this is the data type of the expression.
854 In POINTER_TYPE nodes, this is the type that the pointer points to.
855 In ARRAY_TYPE nodes, this is the type of the elements.
856 In VECTOR_TYPE nodes, this is the type of the elements. */
857 #define TREE_TYPE(NODE) __extension__ \
858 (*({__typeof (NODE) const __t = (NODE); \
859 &__t->common.type; }))
861 extern void tree_contains_struct_check_failed (const_tree
,
862 const enum tree_node_structure_enum
,
863 const char *, int, const char *)
866 extern void tree_check_failed (const_tree
, const char *, int, const char *,
867 ...) ATTRIBUTE_NORETURN
;
868 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
869 ...) ATTRIBUTE_NORETURN
;
870 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
871 const char *, int, const char *)
873 extern void tree_range_check_failed (const_tree
, const char *, int,
874 const char *, enum tree_code
,
876 extern void tree_not_class_check_failed (const_tree
,
877 const enum tree_code_class
,
878 const char *, int, const char *)
880 extern void tree_vec_elt_check_failed (int, int, const char *,
883 extern void phi_node_elt_check_failed (int, int, const char *,
886 extern void tree_operand_check_failed (int, const_tree
,
887 const char *, int, const char *)
889 extern void omp_clause_check_failed (const_tree
, const char *, int,
890 const char *, enum omp_clause_code
)
892 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
895 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
896 const char *, enum omp_clause_code
,
897 enum omp_clause_code
)
900 #else /* not ENABLE_TREE_CHECKING, or not gcc */
902 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
903 #define TREE_CHECK(T, CODE) (T)
904 #define TREE_NOT_CHECK(T, CODE) (T)
905 #define TREE_CHECK2(T, CODE1, CODE2) (T)
906 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
907 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
908 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
909 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
910 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
911 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
912 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
913 #define TREE_CLASS_CHECK(T, CODE) (T)
914 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
915 #define EXPR_CHECK(T) (T)
916 #define NON_TYPE_CHECK(T) (T)
917 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
918 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
919 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
920 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
921 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
922 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
923 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
925 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
926 #define TREE_TYPE(NODE) ((NODE)->common.type)
930 #define TREE_BLOCK(NODE) *(tree_block (NODE))
932 #include "tree-check.h"
934 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
935 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
936 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
937 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
938 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
939 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
940 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
941 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
942 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
943 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
944 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
945 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
947 #define RECORD_OR_UNION_CHECK(T) \
948 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
949 #define NOT_RECORD_OR_UNION_CHECK(T) \
950 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
952 #define NUMERICAL_TYPE_CHECK(T) \
953 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
956 /* Here is how primitive or already-canonicalized types' hash codes
958 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
960 /* A simple hash function for an arbitrary tree node. This must not be
961 used in hash tables which are saved to a PCH. */
962 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
964 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
965 #define CONVERT_EXPR_CODE_P(CODE) \
966 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
968 /* Similarly, but accept an expressions instead of a tree code. */
969 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
971 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
973 #define CASE_CONVERT \
977 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
978 that don't change the machine mode. */
980 #define STRIP_NOPS(EXP) \
981 while ((CONVERT_EXPR_P (EXP) \
982 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
983 && TREE_OPERAND (EXP, 0) != error_mark_node \
984 && (TYPE_MODE (TREE_TYPE (EXP)) \
985 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
986 (EXP) = TREE_OPERAND (EXP, 0)
988 /* Like STRIP_NOPS, but don't let the signedness change either. */
990 #define STRIP_SIGN_NOPS(EXP) \
991 while ((CONVERT_EXPR_P (EXP) \
992 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
993 && TREE_OPERAND (EXP, 0) != error_mark_node \
994 && (TYPE_MODE (TREE_TYPE (EXP)) \
995 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
996 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
997 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
998 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
999 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1000 (EXP) = TREE_OPERAND (EXP, 0)
1002 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1004 #define STRIP_TYPE_NOPS(EXP) \
1005 while ((CONVERT_EXPR_P (EXP) \
1006 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1007 && TREE_OPERAND (EXP, 0) != error_mark_node \
1008 && (TREE_TYPE (EXP) \
1009 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1010 (EXP) = TREE_OPERAND (EXP, 0)
1012 /* Remove unnecessary type conversions according to
1013 tree_ssa_useless_type_conversion. */
1015 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1016 while (tree_ssa_useless_type_conversion (EXP)) \
1017 EXP = TREE_OPERAND (EXP, 0)
1019 /* Nonzero if TYPE represents an integral type. Note that we do not
1020 include COMPLEX types here. Keep these checks in ascending code
1023 #define INTEGRAL_TYPE_P(TYPE) \
1024 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1025 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1026 || TREE_CODE (TYPE) == INTEGER_TYPE)
1028 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1030 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1031 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1033 /* Nonzero if TYPE represents a saturating fixed-point type. */
1035 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1036 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1038 /* Nonzero if TYPE represents a fixed-point type. */
1040 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1042 /* Nonzero if TYPE represents a scalar floating-point type. */
1044 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1046 /* Nonzero if TYPE represents a complex floating-point type. */
1048 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1050 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1052 /* Nonzero if TYPE represents a vector floating-point type. */
1054 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1055 (TREE_CODE (TYPE) == VECTOR_TYPE \
1056 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1058 /* Nonzero if TYPE represents a floating-point type, including complex
1059 and vector floating-point types. The vector and complex check does
1060 not use the previous two macros to enable early folding. */
1062 #define FLOAT_TYPE_P(TYPE) \
1063 (SCALAR_FLOAT_TYPE_P (TYPE) \
1064 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1065 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1066 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1068 /* Nonzero if TYPE represents a decimal floating-point type. */
1069 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1070 (SCALAR_FLOAT_TYPE_P (TYPE) \
1071 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1073 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1074 Keep these checks in ascending code order. */
1076 #define AGGREGATE_TYPE_P(TYPE) \
1077 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1078 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1080 /* Nonzero if TYPE represents a pointer or reference type.
1081 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1082 ascending code order. */
1084 #define POINTER_TYPE_P(TYPE) \
1085 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1087 /* Nonzero if this type is a complete type. */
1088 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1090 /* Nonzero if this type is the (possibly qualified) void type. */
1091 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1093 /* Nonzero if this type is complete or is cv void. */
1094 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1095 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1097 /* Nonzero if this type is complete or is an array with unspecified bound. */
1098 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1099 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1102 /* Define many boolean fields that all tree nodes have. */
1104 /* In VAR_DECL nodes, nonzero means address of this is needed.
1105 So it cannot be in a register.
1106 In a FUNCTION_DECL, nonzero means its address is needed.
1107 So it must be compiled even if it is an inline function.
1108 In a FIELD_DECL node, it means that the programmer is permitted to
1109 construct the address of this field. This is used for aliasing
1110 purposes: see record_component_aliases.
1111 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1112 In LABEL_DECL nodes, it means a goto for this label has been seen
1113 from a place outside all binding contours that restore stack levels.
1114 In ..._TYPE nodes, it means that objects of this type must
1115 be fully addressable. This means that pieces of this
1116 object cannot go into register parameters, for example.
1117 In IDENTIFIER_NODEs, this means that some extern decl for this name
1118 had its address taken. That matters for inline functions. */
1119 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1121 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1122 exit of a function. Calls for which this is true are candidates for tail
1123 call optimizations. */
1124 #define CALL_EXPR_TAILCALL(NODE) \
1125 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1127 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1128 CASE_LOW operand has been processed. */
1129 #define CASE_LOW_SEEN(NODE) \
1130 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1132 #define PREDICT_EXPR_OUTCOME(NODE) \
1133 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)
1134 #define PREDICT_EXPR_PREDICTOR(NODE) \
1135 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1137 /* In a VAR_DECL, nonzero means allocate static storage.
1138 In a FUNCTION_DECL, nonzero if function has been defined.
1139 In a CONSTRUCTOR, nonzero means allocate static storage. */
1140 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1142 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1143 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1145 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1146 should only be executed if an exception is thrown, not on normal exit
1148 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1150 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1151 separate cleanup in honor_protect_cleanup_actions. */
1152 #define TRY_CATCH_IS_CLEANUP(NODE) \
1153 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1155 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1156 CASE_HIGH operand has been processed. */
1157 #define CASE_HIGH_SEEN(NODE) \
1158 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1160 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1161 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1163 /* In an expr node (usually a conversion) this means the node was made
1164 implicitly and should not lead to any sort of warning. In a decl node,
1165 warnings concerning the decl should be suppressed. This is used at
1166 least for used-before-set warnings, and it set after one warning is
1168 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1170 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1171 this string as an argument. */
1172 #define TREE_SYMBOL_REFERENCED(NODE) \
1173 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1175 /* Nonzero in a pointer or reference type means the data pointed to
1176 by this type can alias anything. */
1177 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1178 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1180 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1181 #define MOVE_NONTEMPORAL(NODE) \
1182 (EXPR_CHECK (NODE)->base.static_flag)
1184 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1185 there was an overflow in folding. */
1187 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1189 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1190 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1192 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1194 #define TREE_OVERFLOW_P(EXPR) \
1195 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1197 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1198 nonzero means name is to be accessible from outside this module.
1199 In an IDENTIFIER_NODE, nonzero means an external declaration
1200 accessible from outside this module was previously seen
1201 for this name in an inner scope. */
1202 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1204 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1205 of cached values, or is something else. */
1206 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1208 /* In a SAVE_EXPR, indicates that the original expression has already
1209 been substituted with a VAR_DECL that contains the value. */
1210 #define SAVE_EXPR_RESOLVED_P(NODE) \
1211 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1213 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1215 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1216 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1218 /* In any expression, decl, or constant, nonzero means it has side effects or
1219 reevaluation of the whole expression could produce a different value.
1220 This is set if any subexpression is a function call, a side effect or a
1221 reference to a volatile variable. In a ..._DECL, this is set only if the
1222 declaration said `volatile'. This will never be set for a constant. */
1223 #define TREE_SIDE_EFFECTS(NODE) \
1224 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1226 /* In a LABEL_DECL, nonzero means this label had its address taken
1227 and therefore can never be deleted and is a jump target for
1229 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1231 /* Nonzero means this expression is volatile in the C sense:
1232 its address should be of type `volatile WHATEVER *'.
1233 In other words, the declared item is volatile qualified.
1234 This is used in _DECL nodes and _REF nodes.
1235 On a FUNCTION_DECL node, this means the function does not
1236 return normally. This is the same effect as setting
1237 the attribute noreturn on the function in C.
1239 In a ..._TYPE node, means this type is volatile-qualified.
1240 But use TYPE_VOLATILE instead of this macro when the node is a type,
1241 because eventually we may make that a different bit.
1243 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1244 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1246 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1247 accessing the memory pointed to won't generate a trap. However,
1248 this only applies to an object when used appropriately: it doesn't
1249 mean that writing a READONLY mem won't trap. Similarly for
1250 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1252 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1253 (or slice of the array) always belongs to the range of the array.
1254 I.e. that the access will not trap, provided that the access to
1255 the base to the array will not trap. */
1256 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1258 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1259 nonzero means it may not be the lhs of an assignment.
1260 Nonzero in a FUNCTION_DECL means this function should be treated
1261 as "const" function (can only read its arguments). */
1262 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1264 /* Value of expression is constant. Always on in all ..._CST nodes. May
1265 also appear in an expression or decl where the value is constant. */
1266 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1268 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1269 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1270 (TYPE_CHECK (NODE)->base.constant_flag)
1272 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1273 #define DECL_UNSIGNED(NODE) \
1274 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1276 /* In integral and pointer types, means an unsigned type. */
1277 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1279 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1280 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1281 This is interesting in an inline function, since it might not need
1282 to be compiled separately.
1283 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1284 if the sdb debugging info for the type has been written.
1285 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1286 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1288 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1290 /* Nonzero in a _DECL if the name is used in its scope.
1291 Nonzero in an expr node means inhibit warning if value is unused.
1292 In IDENTIFIER_NODEs, this means that some extern decl for this name
1294 In a BLOCK, this means that the block contains variables that are used. */
1295 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1297 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1298 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1299 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1301 /* In a CALL_EXPR, means that it's safe to use the target of the call
1302 expansion as the return slot for a call that returns in memory. */
1303 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1304 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1306 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1307 reference (and the TREE_TYPE is a pointer to the true type). */
1308 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->base.private_flag)
1310 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1311 thunked-to function. */
1312 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1314 /* In a type, nonzero means that all objects of the type are guaranteed by the
1315 language or front-end to be properly aligned, so we can indicate that a MEM
1316 of this type is aligned at least to the alignment of the type, even if it
1317 doesn't appear that it is. We see this, for example, in object-oriented
1318 languages where a tag field may show this is an object of a more-aligned
1319 variant of the more generic type.
1321 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1323 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1325 /* Used in classes in C++. */
1326 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1327 /* Used in classes in C++.
1328 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1329 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1331 /* Nonzero in a _DECL if the use of the name is defined as a
1332 deprecated feature by __attribute__((deprecated)). */
1333 #define TREE_DEPRECATED(NODE) \
1334 ((NODE)->base.deprecated_flag)
1336 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1337 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1338 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1339 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1341 /* In fixed-point types, means a saturating type. */
1342 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1344 /* These flags are available for each language front end to use internally. */
1345 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1346 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1347 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1348 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1349 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1350 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1351 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1353 /* Define additional fields and accessors for nodes representing constants. */
1355 /* In an INTEGER_CST node. These two together make a 2-word integer.
1356 If the data type is signed, the value is sign-extended to 2 words
1357 even though not all of them may really be in use.
1358 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1359 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1360 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1361 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1363 #define INT_CST_LT(A, B) \
1364 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1365 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1366 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1368 #define INT_CST_LT_UNSIGNED(A, B) \
1369 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1370 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1371 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1372 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1373 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1375 struct tree_int_cst
GTY(())
1377 struct tree_common common
;
1381 /* In a REAL_CST node. struct real_value is an opaque entity, with
1382 manipulators defined in real.h. We don't want tree.h depending on
1383 real.h and transitively on tm.h. */
1386 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1387 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1389 struct tree_real_cst
GTY(())
1391 struct tree_common common
;
1392 struct real_value
* real_cst_ptr
;
1395 /* In a FIXED_CST node. */
1398 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1399 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1401 struct tree_fixed_cst
GTY(())
1403 struct tree_common common
;
1404 struct fixed_value
* fixed_cst_ptr
;
1407 /* In a STRING_CST */
1408 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1409 #define TREE_STRING_POINTER(NODE) \
1410 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1412 struct tree_string
GTY(())
1414 struct tree_common common
;
1419 /* In a COMPLEX_CST node. */
1420 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1421 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1423 struct tree_complex
GTY(())
1425 struct tree_common common
;
1430 /* In a VECTOR_CST node. */
1431 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1433 struct tree_vector
GTY(())
1435 struct tree_common common
;
1441 /* Define fields and accessors for some special-purpose tree nodes. */
1443 #define IDENTIFIER_LENGTH(NODE) \
1444 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1445 #define IDENTIFIER_POINTER(NODE) \
1446 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1447 #define IDENTIFIER_HASH_VALUE(NODE) \
1448 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1450 /* Translate a hash table identifier pointer to a tree_identifier
1451 pointer, and vice versa. */
1453 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1454 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1455 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1457 struct tree_identifier
GTY(())
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 tree_list
GTY(())
1469 struct tree_common common
;
1474 /* In a TREE_VEC node. */
1475 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1476 #define TREE_VEC_END(NODE) \
1477 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1479 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1481 struct tree_vec
GTY(())
1483 struct tree_common common
;
1485 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1488 /* In a CONSTRUCTOR node. */
1489 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1490 #define CONSTRUCTOR_ELT(NODE,IDX) \
1491 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1492 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1494 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1495 value of each element (stored within VAL). IX must be a scratch variable
1496 of unsigned integer type. */
1497 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1498 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1500 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1504 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1505 the value of each element (stored within VAL) and its index (stored
1506 within INDEX). IX must be a scratch variable of unsigned integer type. */
1507 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1508 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1510 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1511 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1515 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1516 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1518 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1519 _ce___->index = INDEX; \
1520 _ce___->value = VALUE; \
1523 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1524 element. INDEX can optionally design the position of VALUE: in arrays,
1525 it is the index where VALUE has to be placed; in structures, it is the
1526 FIELD_DECL of the member. */
1527 typedef struct constructor_elt_d
GTY(())
1533 DEF_VEC_O(constructor_elt
);
1534 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1536 struct tree_constructor
GTY(())
1538 struct tree_common common
;
1539 VEC(constructor_elt
,gc
) *elts
;
1542 /* Define fields and accessors for some nodes that represent expressions. */
1544 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1545 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1546 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1547 && integer_zerop (TREE_OPERAND (NODE, 0)))
1549 /* In ordinary expression nodes. */
1550 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1551 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1553 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1554 length. Its value includes the length operand itself; that is,
1555 the minimum valid length is 1.
1556 Note that we have to bypass the use of TREE_OPERAND to access
1557 that field to avoid infinite recursion in expanding the macros. */
1558 #define VL_EXP_OPERAND_LENGTH(NODE) \
1559 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1561 /* In a LOOP_EXPR node. */
1562 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1564 /* The source location of this expression. Non-tree_exp nodes such as
1565 decls and constants can be shared among multiple locations, so
1567 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1568 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1569 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1570 #define EXPR_LOCUS(NODE) (EXPR_P (NODE) \
1571 ? CONST_CAST (source_location *, &(NODE)->exp.locus) \
1572 : (source_location *) NULL)
1573 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
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) (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 /* SWITCH_EXPR accessors. These give access to the condition, body and
1595 original condition type (before any compiler conversions)
1596 of the switch statement, respectively. */
1597 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1598 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1599 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1601 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1602 of a case label, respectively. */
1603 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1604 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1605 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1607 /* The operands of a TARGET_MEM_REF. */
1608 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1609 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1610 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1611 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1612 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1613 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1614 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1616 /* The operands of a BIND_EXPR. */
1617 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1618 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1619 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1621 /* GOTO_EXPR accessor. This gives access to the label associated with
1622 a goto statement. */
1623 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1625 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1626 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1627 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1629 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1630 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1631 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1632 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1633 /* Nonzero if we want to create an ASM_INPUT instead of an
1634 ASM_OPERAND with no operands. */
1635 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1636 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1638 /* COND_EXPR accessors. */
1639 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1640 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1641 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1643 /* Accessors for the chains of recurrences. */
1644 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1645 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1646 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1647 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1649 /* LABEL_EXPR accessor. This gives access to the label associated with
1650 the given label expression. */
1651 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1653 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1654 accessors for SSA operands. */
1656 /* CATCH_EXPR accessors. */
1657 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1658 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1660 /* EH_FILTER_EXPR accessors. */
1661 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1662 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1663 #define EH_FILTER_MUST_NOT_THROW(NODE) \
1664 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
1666 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1667 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1668 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1669 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1670 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1672 /* OBJ_TYPE_REF accessors. */
1673 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1674 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1675 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1677 /* ASSERT_EXPR accessors. */
1678 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1679 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1681 /* CALL_EXPR accessors.
1683 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1684 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1685 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1686 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1687 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1689 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1690 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1691 the argument count is zero when checking is enabled. Instead, do
1692 the pointer arithmetic to advance past the 3 fixed operands in a
1693 CALL_EXPR. That produces a valid pointer to just past the end of the
1694 operand array, even if it's not valid to dereference it. */
1695 #define CALL_EXPR_ARGP(NODE) \
1696 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1698 /* OpenMP directive and clause accessors. */
1700 #define OMP_BODY(NODE) \
1701 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1702 #define OMP_CLAUSES(NODE) \
1703 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1705 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1706 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1708 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1709 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1711 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1712 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1713 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1715 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1716 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1717 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1718 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1719 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1720 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1722 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1723 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1725 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1727 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1728 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1730 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1732 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1734 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1735 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1737 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1738 #define OMP_CLAUSE_DECL(NODE) \
1739 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1740 OMP_CLAUSE_PRIVATE, \
1741 OMP_CLAUSE_COPYPRIVATE), 0)
1743 /* True on an OMP_SECTION statement that was the last lexical member.
1744 This status is meaningful in the implementation of lastprivate. */
1745 #define OMP_SECTION_LAST(NODE) \
1746 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1748 /* True on an OMP_PARALLEL statement if it represents an explicit
1749 combined parallel work-sharing constructs. */
1750 #define OMP_PARALLEL_COMBINED(NODE) \
1751 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1753 /* True on a PRIVATE clause if its decl is kept around for debugging
1754 information only and its DECL_VALUE_EXPR is supposed to point
1755 to what it has been remapped to. */
1756 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1757 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1759 /* True on a PRIVATE clause if ctor needs access to outer region's
1761 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1762 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1764 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1765 decl is present in the chain. */
1766 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1767 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1768 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1769 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1770 OMP_CLAUSE_LASTPRIVATE),\
1772 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1773 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1775 #define OMP_CLAUSE_IF_EXPR(NODE) \
1776 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1777 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1778 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1779 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1780 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1782 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1783 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1784 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1785 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1786 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1787 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1789 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1790 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1791 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1792 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1793 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1794 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1795 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1796 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1797 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1798 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1799 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1802 enum omp_clause_schedule_kind
1804 OMP_CLAUSE_SCHEDULE_STATIC
,
1805 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1806 OMP_CLAUSE_SCHEDULE_GUIDED
,
1807 OMP_CLAUSE_SCHEDULE_AUTO
,
1808 OMP_CLAUSE_SCHEDULE_RUNTIME
1811 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1812 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1814 enum omp_clause_default_kind
1816 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1817 OMP_CLAUSE_DEFAULT_SHARED
,
1818 OMP_CLAUSE_DEFAULT_NONE
,
1819 OMP_CLAUSE_DEFAULT_PRIVATE
,
1820 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1823 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1824 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1826 struct tree_exp
GTY(())
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 /* Get the value of this SSA_NAME, if available. */
1874 #define SSA_NAME_VALUE(N) \
1875 SSA_NAME_CHECK (N)->ssa_name.value_handle
1877 #ifndef _TREE_FLOW_H
1878 struct ptr_info_def
;
1883 /* Immediate use linking structure. This structure is used for maintaining
1884 a doubly linked list of uses of an SSA_NAME. */
1885 typedef struct ssa_use_operand_d
GTY(())
1887 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1888 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1889 /* Immediate uses for a given SSA name are maintained as a cyclic
1890 list. To recognize the root of this list, the location field
1891 needs to point to the original SSA name. Since statements and
1892 SSA names are of different data types, we need this union. See
1893 the explanation in struct immediate_use_iterator_d. */
1894 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1895 tree
*GTY((skip(""))) use
;
1896 } ssa_use_operand_t
;
1898 /* Return the immediate_use information for an SSA_NAME. */
1899 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1901 struct tree_ssa_name
GTY(())
1903 struct tree_common common
;
1905 /* _DECL wrapped by this SSA name. */
1908 /* Statement that defines this SSA name. */
1911 /* SSA version number. */
1912 unsigned int version
;
1914 /* Pointer attributes used for alias analysis. */
1915 struct ptr_info_def
*ptr_info
;
1917 /* Value for SSA name used by various passes.
1919 Right now only invariants are allowed to persist beyond a pass in
1920 this field; in the future we will allow VALUE_HANDLEs to persist
1924 /* Immediate uses list for this SSA_NAME. */
1925 struct ssa_use_operand_d imm_uses
;
1928 struct phi_arg_d
GTY(())
1930 /* imm_use MUST be the first element in struct because we do some
1931 pointer arithmetic with it. See phi_arg_index_from_use. */
1932 struct ssa_use_operand_d imm_use
;
1937 #define OMP_CLAUSE_CODE(NODE) \
1938 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1940 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1941 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1943 #define OMP_CLAUSE_CODE(NODE) \
1944 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1946 #define OMP_CLAUSE_OPERAND(NODE, I) \
1947 OMP_CLAUSE_ELT_CHECK (NODE, I)
1949 struct tree_omp_clause
GTY(())
1951 struct tree_common common
;
1952 enum omp_clause_code code
;
1953 union omp_clause_subcode
{
1954 enum omp_clause_default_kind default_kind
;
1955 enum omp_clause_schedule_kind schedule_kind
;
1956 enum tree_code reduction_code
;
1957 } GTY ((skip
)) subcode
;
1959 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1961 gimple_seq gimple_reduction_init
;
1962 gimple_seq gimple_reduction_merge
;
1964 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
1968 struct varray_head_tag
;
1970 /* In a BLOCK node. */
1971 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1972 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1973 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1974 /* Note: when changing this, make sure to find the places
1975 that use chainon or nreverse. */
1976 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1977 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1978 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1980 /* Nonzero means that this block is prepared to handle exceptions
1981 listed in the BLOCK_VARS slot. */
1982 #define BLOCK_HANDLER_BLOCK(NODE) \
1983 (BLOCK_CHECK (NODE)->block.handler_block_flag)
1985 /* An index number for this block. These values are not guaranteed to
1986 be unique across functions -- whether or not they are depends on
1987 the debugging output format in use. */
1988 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1990 /* If block reordering splits a lexical block into discontiguous
1991 address ranges, we'll make a copy of the original block.
1993 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1994 In that case, we have one source block that has been replicated
1995 (through inlining or unrolling) into many logical blocks, and that
1996 these logical blocks have different physical variables in them.
1998 In this case, we have one logical block split into several
1999 non-contiguous address ranges. Most debug formats can't actually
2000 represent this idea directly, so we fake it by creating multiple
2001 logical blocks with the same variables in them. However, for those
2002 that do support non-contiguous regions, these allow the original
2003 logical block to be reconstructed, along with the set of address
2006 One of the logical block fragments is arbitrarily chosen to be
2007 the ORIGIN. The other fragments will point to the origin via
2008 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2009 be null. The list of fragments will be chained through
2010 BLOCK_FRAGMENT_CHAIN from the origin. */
2012 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2013 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2015 /* For an inlined function, this gives the location where it was called
2016 from. This is only set in the top level block, which corresponds to the
2017 inlined function scope. This is used in the debug output routines. */
2019 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2021 struct tree_block
GTY(())
2023 struct tree_common common
;
2025 unsigned handler_block_flag
: 1;
2026 unsigned abstract_flag
: 1;
2027 unsigned block_num
: 30;
2034 tree abstract_origin
;
2035 tree fragment_origin
;
2036 tree fragment_chain
;
2039 /* Define fields and accessors for nodes representing data types. */
2041 /* See tree.def for documentation of the use of these fields.
2042 Look at the documentation of the various ..._TYPE tree codes.
2044 Note that the type.values, type.minval, and type.maxval fields are
2045 overloaded and used for different macros in different kinds of types.
2046 Each macro must check to ensure the tree node is of the proper kind of
2047 type. Note also that some of the front-ends also overload these fields,
2048 so they must be checked as well. */
2050 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2051 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2052 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2053 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2054 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2055 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2056 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2057 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2058 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2059 (INTEGER_TYPE_CHECK (NODE)->type.values \
2060 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2061 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2062 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2063 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2064 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2065 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2066 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2067 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2068 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2069 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2070 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2071 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2072 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2073 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2074 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2075 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2076 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2077 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2078 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2079 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2081 /* The "canonical" type for this type node, which can be used to
2082 compare the type for equality with another type. If two types are
2083 equal (based on the semantics of the language), then they will have
2084 equivalent TYPE_CANONICAL entries.
2086 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2087 be used for comparison against other types. Instead, the type is
2088 said to require structural equality checks, described in
2089 TYPE_STRUCTURAL_EQUALITY_P. */
2090 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2091 /* Indicates that the type node requires structural equality
2092 checks. The compiler will need to look at the composition of the
2093 type to determine whether it is equal to another type, rather than
2094 just comparing canonical type pointers. For instance, we would need
2095 to look at the return and parameter types of a FUNCTION_TYPE
2097 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2098 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2099 type node requires structural equality. */
2100 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2101 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2102 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2103 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2105 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2106 in the debugging output. We use this to describe a vector as a
2107 structure containing an array. */
2108 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2110 /* For record and union types, information about this type, as a base type
2112 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2114 /* For non record and union types, used in a language-dependent way. */
2115 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2117 /* The (language-specific) typed-based alias set for this type.
2118 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2119 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2120 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2121 type can alias objects of any type. */
2122 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2124 /* Nonzero iff the typed-based alias set for this type has been
2126 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2128 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2130 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2132 /* The alignment necessary for objects of this type.
2133 The value is an int, measured in bits. */
2134 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2136 /* 1 if the alignment for this type was requested by "aligned" attribute,
2137 0 if it is the default for this type. */
2138 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2140 /* The alignment for NODE, in bytes. */
2141 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2143 /* If your language allows you to declare types, and you want debug info
2144 for them, then you need to generate corresponding TYPE_DECL nodes.
2145 These "stub" TYPE_DECL nodes have no name, and simply point at the
2146 type node. You then set the TYPE_STUB_DECL field of the type node
2147 to point back at the TYPE_DECL node. This allows the debug routines
2148 to know that the two nodes represent the same type, so that we only
2149 get one debug info record for them. */
2150 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2152 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2153 has BLKmode only because it lacks the alignment requirement for
2155 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2157 /* In an INTEGER_TYPE, it means the type represents a size. We use
2158 this both for validity checking and to permit optimizations that
2159 are unsafe for other types. Note that the C `size_t' type should
2160 *not* have this flag set. The `size_t' type is simply a typedef
2161 for an ordinary integer type that happens to be the type of an
2162 expression returned by `sizeof'; `size_t' has no special
2163 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2164 always actual sizes. */
2165 #define TYPE_IS_SIZETYPE(NODE) \
2166 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2168 /* Nonzero in a type considered volatile as a whole. */
2169 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2171 /* Means this type is const-qualified. */
2172 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2174 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2176 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2178 /* There is a TYPE_QUAL value for each type qualifier. They can be
2179 combined by bitwise-or to form the complete set of qualifiers for a
2182 #define TYPE_UNQUALIFIED 0x0
2183 #define TYPE_QUAL_CONST 0x1
2184 #define TYPE_QUAL_VOLATILE 0x2
2185 #define TYPE_QUAL_RESTRICT 0x4
2187 /* The set of type qualifiers for this type. */
2188 #define TYPE_QUALS(NODE) \
2189 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2190 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2191 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2193 /* These flags are available for each language front end to use internally. */
2194 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2195 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2196 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2197 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2198 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2199 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2200 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2202 /* Used to keep track of visited nodes in tree traversals. This is set to
2203 0 by copy_node and make_node. */
2204 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2206 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2207 that distinguish string from array of char).
2208 If set in a INTEGER_TYPE, indicates a character type. */
2209 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2211 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2212 object of the given ARRAY_TYPE. This allows temporaries to be
2214 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2215 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2217 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2218 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2219 (((unsigned HOST_WIDE_INT) 1) \
2220 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2222 /* Set precision to n when we have 2^n sub-parts of the vector. */
2223 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2224 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2226 /* Indicates that objects of this type must be initialized by calling a
2227 function when they are created. */
2228 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2229 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2231 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2232 the same way that the first union alternative would be passed. */
2233 #define TYPE_TRANSPARENT_UNION(NODE) \
2234 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2236 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2237 address of a component of the type. This is the counterpart of
2238 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2239 #define TYPE_NONALIASED_COMPONENT(NODE) \
2240 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2242 /* Indicated that objects of this type should be laid out in as
2243 compact a way as possible. */
2244 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2246 /* Used by type_contains_placeholder_p to avoid recomputation.
2247 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2248 this field directly. */
2249 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2250 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2254 struct tree_type
GTY(())
2256 struct tree_common common
;
2263 unsigned int precision
: 9;
2264 ENUM_BITFIELD(machine_mode
) mode
: 7;
2266 unsigned string_flag
: 1;
2267 unsigned no_force_blk_flag
: 1;
2268 unsigned needs_constructing_flag
: 1;
2269 unsigned transparent_union_flag
: 1;
2270 unsigned packed_flag
: 1;
2271 unsigned restrict_flag
: 1;
2272 unsigned contains_placeholder_bits
: 2;
2274 unsigned lang_flag_0
: 1;
2275 unsigned lang_flag_1
: 1;
2276 unsigned lang_flag_2
: 1;
2277 unsigned lang_flag_3
: 1;
2278 unsigned lang_flag_4
: 1;
2279 unsigned lang_flag_5
: 1;
2280 unsigned lang_flag_6
: 1;
2281 unsigned user_align
: 1;
2286 union tree_type_symtab
{
2287 int GTY ((tag ("0"))) address
;
2288 const char * GTY ((tag ("1"))) pointer
;
2289 struct die_struct
* GTY ((tag ("2"))) die
;
2290 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2291 descbits ("2"))) symtab
;
2300 alias_set_type alias_set
;
2301 /* Points to a structure whose details depend on the language in use. */
2302 struct lang_type
*lang_specific
;
2305 /* Define accessor macros for information about type inheritance
2308 A "basetype" means a particular usage of a data type for inheritance
2309 in another type. Each such basetype usage has its own "binfo"
2310 object to describe it. The binfo object is a TREE_VEC node.
2312 Inheritance is represented by the binfo nodes allocated for a
2313 given type. For example, given types C and D, such that D is
2314 inherited by C, 3 binfo nodes will be allocated: one for describing
2315 the binfo properties of C, similarly one for D, and one for
2316 describing the binfo properties of D as a base type for C.
2317 Thus, given a pointer to class C, one can get a pointer to the binfo
2318 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2320 /* BINFO specific flags. */
2322 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2323 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2325 /* Flags for language dependent use. */
2326 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2327 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2328 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2329 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2330 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2331 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2332 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2334 /* The actual data type node being inherited in this basetype. */
2335 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2337 /* The offset where this basetype appears in its containing type.
2338 BINFO_OFFSET slot holds the offset (in bytes)
2339 from the base of the complete object to the base of the part of the
2340 object that is allocated on behalf of this `type'.
2341 This is always 0 except when there is multiple inheritance. */
2343 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2344 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2346 /* The virtual function table belonging to this basetype. Virtual
2347 function tables provide a mechanism for run-time method dispatching.
2348 The entries of a virtual function table are language-dependent. */
2350 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2352 /* The virtual functions in the virtual function table. This is
2353 a TREE_LIST that is used as an initial approximation for building
2354 a virtual function table for this basetype. */
2355 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2357 /* A vector of binfos for the direct basetypes inherited by this
2360 If this basetype describes type D as inherited in C, and if the
2361 basetypes of D are E and F, then this vector contains binfos for
2362 inheritance of E and F by C. */
2363 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2365 /* The number of basetypes for NODE. */
2366 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2368 /* Accessor macro to get to the Nth base binfo of this binfo. */
2369 #define BINFO_BASE_BINFO(NODE,N) \
2370 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2371 #define BINFO_BASE_ITERATE(NODE,N,B) \
2372 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2373 #define BINFO_BASE_APPEND(NODE,T) \
2374 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2376 /* For a BINFO record describing a virtual base class, i.e., one where
2377 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2378 base. The actual contents are language-dependent. In the C++
2379 front-end this field is an INTEGER_CST giving an offset into the
2380 vtable where the offset to the virtual base can be found. */
2381 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2383 /* Indicates the accesses this binfo has to its bases. The values are
2384 access_public_node, access_protected_node or access_private_node.
2385 If this array is not present, public access is implied. */
2386 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2388 #define BINFO_BASE_ACCESS(NODE,N) \
2389 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2390 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2391 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2393 /* The index in the VTT where this subobject's sub-VTT can be found.
2394 NULL_TREE if there is no sub-VTT. */
2395 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2397 /* The index in the VTT where the vptr for this subobject can be
2398 found. NULL_TREE if there is no secondary vptr in the VTT. */
2399 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2401 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2402 inheriting this base for non-virtual bases. For virtual bases it
2403 points either to the binfo for which this is a primary binfo, or to
2404 the binfo of the most derived type. */
2405 #define BINFO_INHERITANCE_CHAIN(NODE) \
2406 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2408 struct tree_binfo
GTY (())
2410 struct tree_common common
;
2416 VEC(tree
,gc
) *base_accesses
;
2422 VEC(tree
,none
) base_binfos
;
2426 /* Define fields and accessors for nodes representing declared names. */
2428 /* Nonzero if DECL represents a variable for the SSA passes. */
2429 #define SSA_VAR_P(DECL) \
2430 (TREE_CODE (DECL) == VAR_DECL \
2431 || TREE_CODE (DECL) == PARM_DECL \
2432 || TREE_CODE (DECL) == RESULT_DECL \
2434 || (TREE_CODE (DECL) == SSA_NAME \
2435 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2436 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2437 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2438 || MTAG_P (SSA_NAME_VAR (DECL)))))
2443 /* Enumerate visibility settings. */
2444 #ifndef SYMBOL_VISIBILITY_DEFINED
2445 #define SYMBOL_VISIBILITY_DEFINED
2446 enum symbol_visibility
2449 VISIBILITY_PROTECTED
,
2458 /* This is the name of the object as written by the user.
2459 It is an IDENTIFIER_NODE. */
2460 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2462 /* Every ..._DECL node gets a unique number. */
2463 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2465 /* These two fields describe where in the source code the declaration
2466 was. If the declaration appears in several places (as for a C
2467 function that is declared first and then defined later), this
2468 information should refer to the definition. */
2469 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2470 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2471 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2472 #define DECL_IS_BUILTIN(DECL) \
2473 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2475 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2476 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2477 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2478 points to either the FUNCTION_DECL for the containing function,
2479 the RECORD_TYPE or UNION_TYPE for the containing type, or
2480 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2482 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2483 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2484 struct tree_decl_minimal
GTY(())
2486 struct tree_common common
;
2493 /* When computing aliasing information, we represent the memory pointed-to
2494 by pointers with artificial variables called "memory tags" (MT). There
2495 are two kinds of tags, namely symbol and name:
2497 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2498 represent all the pointed-to locations and variables pointed-to by
2499 the same pointer symbol. Usually, this set is computed using
2500 type-based analysis (i.e., alias set classes), but this may not
2503 Name tags (NMT) are used in flow-sensitive points-to alias
2504 analysis, they represent the variables and memory locations
2505 pointed-to by a specific SSA_NAME pointer.
2507 In general, given a pointer P with a symbol tag SMT, the alias set
2508 of SMT should be the union of all the alias sets of the NMTs of
2509 every SSA_NAME for P. */
2510 struct tree_memory_tag
GTY(())
2512 struct tree_decl_minimal common
;
2514 bitmap
GTY ((skip
)) aliases
;
2516 /* True if this tag has global scope. */
2517 unsigned int is_global
: 1;
2520 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2521 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2523 /* Memory Partition Tags (MPTs) group memory symbols under one
2524 common name for the purposes of placing memory PHI nodes. */
2526 struct tree_memory_partition_tag
GTY(())
2528 struct tree_memory_tag common
;
2530 /* Set of symbols grouped under this MPT. */
2534 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2537 /* For any sort of a ..._DECL node, this points to the original (abstract)
2538 decl node which this decl is an instance of, or else it is NULL indicating
2539 that this decl is not an instance of some other decl. For example,
2540 in a nested declaration of an inline function, this points back to the
2542 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2544 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2545 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2546 #define DECL_ORIGIN(NODE) \
2547 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2549 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2550 inline instance of some original (abstract) decl from an inline function;
2551 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2552 nodes can also have their abstract origin set to themselves. */
2553 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2554 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2556 /* In a DECL this is the field where attributes are stored. */
2557 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2559 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2560 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2561 For a VAR_DECL, holds the initial value.
2562 For a PARM_DECL, not used--default
2563 values for parameters are encoded in the type of the function,
2564 not in the PARM_DECL slot.
2565 For a FIELD_DECL, this is used for enumeration values and the C
2566 frontend uses it for temporarily storing bitwidth of bitfields.
2568 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2569 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2571 /* Holds the size of the datum, in bits, as a tree expression.
2572 Need not be constant. */
2573 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2574 /* Likewise for the size in bytes. */
2575 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2576 /* Holds the alignment required for the datum, in bits. */
2577 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2578 /* The alignment of NODE, in bytes. */
2579 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2580 /* Set if the alignment of this DECL has been set by the user, for
2581 example with an 'aligned' attribute. */
2582 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2583 /* Holds the machine mode corresponding to the declaration of a variable or
2584 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2586 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2588 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2589 operation it is. Note, however, that this field is overloaded, with
2590 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2591 checked before any access to the former. */
2592 #define DECL_FUNCTION_CODE(NODE) \
2593 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2594 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2595 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2597 /* Nonzero for a given ..._DECL node means that the name of this node should
2598 be ignored for symbolic debug purposes. */
2599 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2601 /* Nonzero for a given ..._DECL node means that this node represents an
2602 "abstract instance" of the given declaration (e.g. in the original
2603 declaration of an inline function). When generating symbolic debugging
2604 information, we mustn't try to generate any address information for nodes
2605 marked as "abstract instances" because we don't actually generate
2606 any code or allocate any data space for such instances. */
2607 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2609 /* Language-specific decl information. */
2610 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2612 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2613 do not allocate storage, and refer to a definition elsewhere. Note that
2614 this does not necessarily imply the entity represented by NODE
2615 has no program source-level definition in this translation unit. For
2616 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2617 DECL_EXTERNAL may be true simultaneously; that can be the case for
2618 a C99 "extern inline" function. */
2619 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2621 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2622 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2624 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2626 Also set in some languages for variables, etc., outside the normal
2627 lexical scope, such as class instance variables. */
2628 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2630 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2631 Used in FIELD_DECLs for vtable pointers.
2632 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2633 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2635 /* Used to indicate that this DECL represents a compiler-generated entity. */
2636 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2638 /* Additional flags for language-specific uses. */
2639 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2640 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2641 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2642 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2643 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2644 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2645 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2646 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2648 /* Used to indicate an alias set for the memory pointed to by this
2649 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2650 pointer (or reference) type. */
2651 #define DECL_POINTER_ALIAS_SET(NODE) \
2652 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2654 /* Nonzero if an alias set has been assigned to this declaration. */
2655 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2656 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2658 /* Nonzero for a decl which is at file scope. */
2659 #define DECL_FILE_SCOPE_P(EXP) \
2660 (! DECL_CONTEXT (EXP) \
2661 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2663 /* Nonzero for a decl that is decorated using attribute used.
2664 This indicates compiler tools that this decl needs to be preserved. */
2665 #define DECL_PRESERVE_P(DECL) \
2666 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2668 /* For function local variables of COMPLEX and VECTOR types,
2669 indicates that the variable is not aliased, and that all
2670 modifications to the variable have been adjusted so that
2671 they are killing assignments. Thus the variable may now
2672 be treated as a GIMPLE register, and use real instead of
2673 virtual ops in SSA form. */
2674 #define DECL_GIMPLE_REG_P(DECL) \
2675 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2677 /* For a DECL with pointer type, this is set if Type Based Alias
2678 Analysis should not be applied to this DECL. */
2679 #define DECL_NO_TBAA_P(DECL) \
2680 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2682 struct tree_decl_common
GTY(())
2684 struct tree_decl_minimal common
;
2687 ENUM_BITFIELD(machine_mode
) mode
: 8;
2689 unsigned nonlocal_flag
: 1;
2690 unsigned virtual_flag
: 1;
2691 unsigned ignored_flag
: 1;
2692 unsigned abstract_flag
: 1;
2693 unsigned artificial_flag
: 1;
2694 unsigned user_align
: 1;
2695 unsigned preserve_flag
: 1;
2696 unsigned debug_expr_is_from
: 1;
2698 unsigned lang_flag_0
: 1;
2699 unsigned lang_flag_1
: 1;
2700 unsigned lang_flag_2
: 1;
2701 unsigned lang_flag_3
: 1;
2702 unsigned lang_flag_4
: 1;
2703 unsigned lang_flag_5
: 1;
2704 unsigned lang_flag_6
: 1;
2705 unsigned lang_flag_7
: 1;
2707 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2708 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2709 unsigned decl_flag_0
: 1;
2710 /* In FIELD_DECL, this is DECL_PACKED. */
2711 unsigned decl_flag_1
: 1;
2712 /* In FIELD_DECL, this is DECL_BIT_FIELD
2713 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2714 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2715 unsigned decl_flag_2
: 1;
2716 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2717 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2718 unsigned decl_flag_3
: 1;
2719 /* Logically, these two would go in a theoretical base shared by var and
2721 unsigned gimple_reg_flag
: 1;
2722 /* In a DECL with pointer type, set if no TBAA should be done. */
2723 unsigned no_tbaa_flag
: 1;
2724 /* Padding so that 'align' can be on a 32-bit boundary. */
2725 unsigned decl_common_unused
: 2;
2727 unsigned int align
: 24;
2728 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2729 unsigned int off_align
: 8;
2734 tree abstract_origin
;
2736 alias_set_type pointer_alias_set
;
2737 /* Points to a structure whose details depend on the language in use. */
2738 struct lang_decl
*lang_specific
;
2741 extern tree
decl_value_expr_lookup (tree
);
2742 extern void decl_value_expr_insert (tree
, tree
);
2744 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2745 if transformations have made this more complicated than evaluating the
2746 decl itself. This should only be used for debugging; once this field has
2747 been set, the decl itself may not legitimately appear in the function. */
2748 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2749 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2750 #define DECL_VALUE_EXPR(NODE) \
2751 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2752 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2753 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2755 /* Holds the RTL expression for the value of a variable or function.
2756 This value can be evaluated lazily for functions, variables with
2757 static storage duration, and labels. */
2758 #define DECL_RTL(NODE) \
2759 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2760 ? (NODE)->decl_with_rtl.rtl \
2761 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2763 /* Set the DECL_RTL for NODE to RTL. */
2764 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2766 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2767 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2769 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2770 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2772 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2773 NODE1, it will not be set for NODE2; this is a lazy copy. */
2774 #define COPY_DECL_RTL(NODE1, NODE2) \
2775 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2777 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2778 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2780 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2781 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2783 struct tree_decl_with_rtl
GTY(())
2785 struct tree_decl_common common
;
2789 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2790 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2791 of the structure. */
2792 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2794 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2795 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2796 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2797 natural alignment of the field's type). */
2798 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2800 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2801 if so, the type that was originally specified for it.
2802 TREE_TYPE may have been modified (in finish_struct). */
2803 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2805 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2806 if nonzero, indicates that the field occupies the type. */
2807 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2809 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2810 DECL_FIELD_OFFSET which are known to be always zero.
2811 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2813 #define DECL_OFFSET_ALIGN(NODE) \
2814 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2816 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2817 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2818 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2819 /* 1 if the alignment for this type was requested by "aligned" attribute,
2820 0 if it is the default for this type. */
2822 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2823 which this FIELD_DECL is defined. This information is needed when
2824 writing debugging information about vfield and vbase decls for C++. */
2825 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2827 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2828 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2830 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2832 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2834 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2835 this component. This makes it possible for Type-Based Alias Analysis
2836 to disambiguate accesses to this field with indirect accesses using
2839 struct S { int i; } s;
2842 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2844 From the implementation's viewpoint, the alias set of the type of the
2845 field 'i' (int) will not be recorded as a subset of that of the type of
2846 's' (struct S) in record_component_aliases. The counterpart is that
2847 accesses to s.i must not be given the alias set of the type of 'i'
2848 (int) but instead directly that of the type of 's' (struct S). */
2849 #define DECL_NONADDRESSABLE_P(NODE) \
2850 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2852 struct tree_field_decl
GTY(())
2854 struct tree_decl_common common
;
2857 tree bit_field_type
;
2864 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2865 dense, unique within any one function, and may be used to index arrays.
2866 If the value is -1, then no UID has been assigned. */
2867 #define LABEL_DECL_UID(NODE) \
2868 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2870 /* In LABEL_DECL nodes, nonzero means that an error message about
2871 jumping into such a binding contour has been printed for this label. */
2872 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2874 struct tree_label_decl
GTY(())
2876 struct tree_decl_with_rtl common
;
2879 struct tree_result_decl
GTY(())
2881 struct tree_decl_with_rtl common
;
2884 struct tree_const_decl
GTY(())
2886 struct tree_decl_with_rtl common
;
2889 /* For a PARM_DECL, records the data type used to pass the argument,
2890 which may be different from the type seen in the program. */
2891 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2893 /* For PARM_DECL, holds an RTL for the stack slot or register
2894 where the data was actually passed. */
2895 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2897 struct tree_parm_decl
GTY(())
2899 struct tree_decl_with_rtl common
;
2904 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2905 this variable in a BIND_EXPR. */
2906 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2907 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2909 /* Used to indicate that the linkage status of this DECL is not yet known,
2910 so it should not be output now. */
2911 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2913 /* Nonzero for a given ..._DECL node means that no warnings should be
2914 generated just because this node is unused. */
2915 #define DECL_IN_SYSTEM_HEADER(NODE) \
2916 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2918 /* Used to indicate that this DECL has weak linkage. */
2919 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2921 /* Internal to the gimplifier. Indicates that the value is a formal
2922 temporary controlled by the gimplifier. */
2923 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2924 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2926 /* Used to indicate that the DECL is a dllimport. */
2927 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2929 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2930 based on a variable with a restrict qualified type. If it is,
2931 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2934 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2935 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2936 #define DECL_GET_RESTRICT_BASE(NODE) \
2937 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2938 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2939 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2941 extern tree
decl_restrict_base_lookup (tree
);
2942 extern void decl_restrict_base_insert (tree
, tree
);
2944 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2945 not be put out unless it is needed in this translation unit.
2946 Entities like this are shared across translation units (like weak
2947 entities), but are guaranteed to be generated by any translation
2948 unit that needs them, and therefore need not be put out anywhere
2949 where they are not needed. DECL_COMDAT is just a hint to the
2950 back-end; it is up to front-ends which set this flag to ensure
2951 that there will never be any harm, other than bloat, in putting out
2952 something which is DECL_COMDAT. */
2953 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2955 /* A replaceable function is one which may be replaced at link-time
2956 with an entirely different definition, provided that the
2957 replacement has the same type. For example, functions declared
2958 with __attribute__((weak)) on most systems are replaceable.
2960 COMDAT functions are not replaceable, since all definitions of the
2961 function must be equivalent. It is important that COMDAT functions
2962 not be treated as replaceable so that use of C++ template
2963 instantiations is not penalized.
2965 For example, DECL_REPLACEABLE is used to determine whether or not a
2966 function (including a template instantiation) which is not
2967 explicitly declared "inline" can be inlined. If the function is
2968 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2969 implementation chosen at link-time may be different. However, a
2970 function that is not DECL_REPLACEABLE can be inlined, since all
2971 versions of the function will be functionally identical. */
2972 #define DECL_REPLACEABLE_P(NODE) \
2973 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2975 /* The name of the object as the assembler will see it (but before any
2976 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2977 as DECL_NAME. It is an IDENTIFIER_NODE. */
2978 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2980 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2981 This is true of all DECL nodes except FIELD_DECL. */
2982 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2983 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2985 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2986 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2988 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2989 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2991 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2992 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2993 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2995 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2996 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2997 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2998 semantics of using this macro, are different than saying:
3000 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3002 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3004 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3005 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3006 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3007 DECL_ASSEMBLER_NAME (DECL1)) \
3010 /* Records the section name in a section attribute. Used to pass
3011 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3012 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3014 /* Value of the decls's visibility attribute */
3015 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3017 /* Nonzero means that the decl had its visibility specified rather than
3019 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3021 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3022 multiple translation units should be merged. */
3023 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3025 struct tree_decl_with_vis
GTY(())
3027 struct tree_decl_with_rtl common
;
3028 tree assembler_name
;
3031 /* Belong to VAR_DECL exclusively. */
3032 unsigned defer_output
:1;
3033 unsigned hard_register
:1;
3034 unsigned thread_local
:1;
3035 unsigned common_flag
:1;
3036 unsigned in_text_section
: 1;
3037 unsigned gimple_formal_temp
: 1;
3038 unsigned dllimport_flag
: 1;
3039 unsigned based_on_restrict_p
: 1;
3040 /* Used by C++. Might become a generic decl flag. */
3041 unsigned shadowed_for_var_p
: 1;
3043 /* Don't belong to VAR_DECL exclusively. */
3044 unsigned weak_flag
:1;
3045 unsigned seen_in_bind_expr
: 1;
3046 unsigned comdat_flag
: 1;
3047 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3048 unsigned visibility_specified
: 1;
3049 /* Belong to FUNCTION_DECL exclusively. */
3050 unsigned one_only
: 1;
3051 unsigned init_priority_p
:1;
3053 /* Belongs to VAR_DECL exclusively. */
3054 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3055 /* 12 unused bits. */
3058 /* In a VAR_DECL that's static,
3059 nonzero if the space is in the text section. */
3060 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3062 /* Nonzero for a given ..._DECL node means that this node should be
3063 put in .common, if possible. If a DECL_INITIAL is given, and it
3064 is not error_mark_node, then the decl cannot be put in .common. */
3065 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3067 /* In a VAR_DECL, nonzero if the decl is a register variable with
3068 an explicit asm specification. */
3069 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3071 extern tree
decl_debug_expr_lookup (tree
);
3072 extern void decl_debug_expr_insert (tree
, tree
);
3073 /* For VAR_DECL, this is set to either an expression that it was split
3074 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3075 subexpressions that it was split into. */
3076 #define DECL_DEBUG_EXPR(NODE) \
3077 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3079 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3080 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3082 /* An initialization priority. */
3083 typedef unsigned short priority_type
;
3085 extern priority_type
decl_init_priority_lookup (tree
);
3086 extern priority_type
decl_fini_priority_lookup (tree
);
3087 extern void decl_init_priority_insert (tree
, priority_type
);
3088 extern void decl_fini_priority_insert (tree
, priority_type
);
3090 /* In a non-local VAR_DECL with static storage duration, true if the
3091 variable has an initialization priority. If false, the variable
3092 will be initialized at the DEFAULT_INIT_PRIORITY. */
3093 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3094 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3096 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3098 #define DECL_INIT_PRIORITY(NODE) \
3099 (decl_init_priority_lookup (NODE))
3100 /* Set the initialization priority for NODE to VAL. */
3101 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3102 (decl_init_priority_insert (NODE, VAL))
3104 /* For a FUNCTION_DECL the finalization priority of NODE. */
3105 #define DECL_FINI_PRIORITY(NODE) \
3106 (decl_fini_priority_lookup (NODE))
3107 /* Set the finalization priority for NODE to VAL. */
3108 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3109 (decl_fini_priority_insert (NODE, VAL))
3111 /* The initialization priority for entities for which no explicit
3112 initialization priority has been specified. */
3113 #define DEFAULT_INIT_PRIORITY 65535
3115 /* The maximum allowed initialization priority. */
3116 #define MAX_INIT_PRIORITY 65535
3118 /* The largest priority value reserved for use by system runtime
3120 #define MAX_RESERVED_INIT_PRIORITY 100
3122 /* In a VAR_DECL, the model to use if the data should be allocated from
3123 thread-local storage. */
3124 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3126 /* In a VAR_DECL, nonzero if the data should be allocated from
3127 thread-local storage. */
3128 #define DECL_THREAD_LOCAL_P(NODE) \
3129 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3131 struct tree_var_decl
GTY(())
3133 struct tree_decl_with_vis common
;
3137 /* This field is used to reference anything in decl.result and is meant only
3138 for use by the garbage collector. */
3139 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3141 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3142 Before the struct containing the FUNCTION_DECL is laid out,
3143 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3144 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3145 function. When the class is laid out, this pointer is changed
3146 to an INTEGER_CST node which is suitable for use as an index
3147 into the virtual function table.
3148 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3149 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3151 struct tree_decl_non_common
GTY(())
3154 struct tree_decl_with_vis common
;
3155 /* C++ uses this in namespaces. */
3157 /* C++ uses this in templates. */
3159 /* Almost all FE's use this. */
3161 /* C++ uses this in namespaces. */
3165 /* In FUNCTION_DECL, holds the decl for the return value. */
3166 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3168 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3169 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3171 /* In a FUNCTION_DECL, the saved representation of the body of the
3173 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3175 /* Nonzero in a FUNCTION_DECL means this function should be treated
3176 as if it were a malloc, meaning it returns a pointer that is
3178 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3180 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3181 C++ operator new, meaning that it returns a pointer for which we
3182 should not use type based aliasing. */
3183 #define DECL_IS_OPERATOR_NEW(NODE) \
3184 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3186 /* Nonzero in a FUNCTION_DECL means this function may return more
3188 #define DECL_IS_RETURNS_TWICE(NODE) \
3189 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3191 /* Nonzero in a FUNCTION_DECL means this function should be treated
3192 as "pure" function (like const function, but may read global memory). */
3193 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3195 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3196 the const or pure function may not terminate. When this is nonzero
3197 for a const or pure function, it can be dealt with by cse passes
3198 but cannot be removed by dce passes since you are not allowed to
3199 change an infinite looping program into one that terminates without
3201 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3202 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3204 /* Nonzero in a FUNCTION_DECL means this function should be treated
3205 as "novops" function (function that does not read global memory,
3206 but may have arbitrary side effects). */
3207 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3209 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3210 at the beginning or end of execution. */
3211 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3212 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3214 #define DECL_STATIC_DESTRUCTOR(NODE) \
3215 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3217 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3218 be instrumented with calls to support routines. */
3219 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3220 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3222 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3223 disabled in this function. */
3224 #define DECL_NO_LIMIT_STACK(NODE) \
3225 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3227 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3228 static chain is not needed. */
3229 #define DECL_NO_STATIC_CHAIN(NODE) \
3230 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3232 /* Nonzero for a decl that cgraph has decided should be inlined into
3233 at least one call site. It is not meaningful to look at this
3234 directly; always use cgraph_function_possibly_inlined_p. */
3235 #define DECL_POSSIBLY_INLINED(DECL) \
3236 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3238 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3239 where it is called. */
3240 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3242 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3243 such as via the `inline' keyword in C/C++. This flag controls the linkage
3244 semantics of 'inline'; whether or not the function is inlined is
3245 controlled by DECL_INLINE. */
3246 #define DECL_DECLARED_INLINE_P(NODE) \
3247 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3249 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3250 disregarding size and cost heuristics. This is equivalent to using
3251 the always_inline attribute without the required diagnostics if the
3252 function cannot be inlined. */
3253 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3254 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3256 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3257 that describes the status of this function. */
3258 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3260 /* In a FUNCTION_DECL, nonzero means a built in function. */
3261 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3263 /* For a builtin function, identify which part of the compiler defined it. */
3264 #define DECL_BUILT_IN_CLASS(NODE) \
3265 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3267 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3268 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3270 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3271 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3273 /* In FUNCTION_DECL, the function specific target options to use when compiling
3275 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3276 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3278 /* In FUNCTION_DECL, the function specific optimization options to use when
3279 compiling this function. */
3280 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3281 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3283 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3284 arguments/result/saved_tree fields by front ends. It was either inherit
3285 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3286 which seemed a bit strange. */
3288 struct tree_function_decl
GTY(())
3290 struct tree_decl_non_common common
;
3294 /* Function specific options that are used by this function. */
3295 tree function_specific_target
; /* target options */
3296 tree function_specific_optimization
; /* optimization options */
3298 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3299 DECL_FUNCTION_CODE. Otherwise unused.
3300 ??? The bitfield needs to be able to hold all target function
3302 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3303 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3305 unsigned static_ctor_flag
: 1;
3306 unsigned static_dtor_flag
: 1;
3307 unsigned uninlinable
: 1;
3309 unsigned possibly_inlined
: 1;
3310 unsigned novops_flag
: 1;
3311 unsigned returns_twice_flag
: 1;
3312 unsigned malloc_flag
: 1;
3313 unsigned operator_new_flag
: 1;
3314 unsigned declared_inline_flag
: 1;
3315 unsigned regdecl_flag
: 1;
3317 unsigned inline_flag
: 1;
3318 unsigned no_instrument_function_entry_exit
: 1;
3319 unsigned no_limit_stack
: 1;
3320 unsigned disregard_inline_limits
: 1;
3321 unsigned pure_flag
: 1;
3322 unsigned looping_const_or_pure_flag
: 1;
3328 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3329 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3331 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3332 into stabs. Instead it will generate cross reference ('x') of names.
3333 This uses the same flag as DECL_EXTERNAL. */
3334 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3335 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3337 struct tree_type_decl
GTY(())
3339 struct tree_decl_non_common common
;
3343 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3344 To reduce overhead, the nodes containing the statements are not trees.
3345 This avoids the overhead of tree_common on all linked list elements.
3347 Use the interface in tree-iterator.h to access this node. */
3349 #define STATEMENT_LIST_HEAD(NODE) \
3350 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3351 #define STATEMENT_LIST_TAIL(NODE) \
3352 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3354 struct tree_statement_list_node
3355 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3357 struct tree_statement_list_node
*prev
;
3358 struct tree_statement_list_node
*next
;
3362 struct tree_statement_list
3365 struct tree_common common
;
3366 struct tree_statement_list_node
*head
;
3367 struct tree_statement_list_node
*tail
;
3371 /* Optimization options used by a function. */
3373 struct tree_optimization_option
GTY(())
3375 struct tree_common common
;
3377 /* The optimization options used by the user. */
3378 struct cl_optimization opts
;
3381 #define TREE_OPTIMIZATION(NODE) \
3382 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3384 /* Return a tree node that encapsulates the current optimization options. */
3385 extern tree
build_optimization_node (void);
3387 /* Target options used by a function. */
3389 struct tree_target_option
GTY(())
3391 struct tree_common common
;
3393 /* The optimization options used by the user. */
3394 struct cl_target_option opts
;
3397 #define TREE_TARGET_OPTION(NODE) \
3398 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3400 /* Return a tree node that encapsulates the current target options. */
3401 extern tree
build_target_option_node (void);
3404 /* Define the overall contents of a tree node.
3405 It may be any of the structures declared above
3406 for various types of node. */
3408 union tree_node
GTY ((ptr_alias (union lang_tree_node
),
3409 desc ("tree_node_structure (&%h)")))
3411 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3412 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3413 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3414 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3415 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3416 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3417 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3418 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3419 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3420 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3421 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3422 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3423 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3424 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3425 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3426 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3427 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3428 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3429 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3430 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3431 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3432 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3433 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
3434 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3435 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3436 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3437 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3438 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3439 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3440 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3441 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3442 struct tree_memory_tag
GTY ((tag ("TS_MEMORY_TAG"))) mtag
;
3443 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3444 struct tree_memory_partition_tag
GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt
;
3445 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3446 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3449 /* Standard named or nameless data types of the C compiler. */
3471 TI_INTEGER_MINUS_ONE
,
3488 TI_COMPLEX_INTEGER_TYPE
,
3489 TI_COMPLEX_FLOAT_TYPE
,
3490 TI_COMPLEX_DOUBLE_TYPE
,
3491 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3495 TI_LONG_DOUBLE_TYPE
,
3499 TI_LONG_DOUBLE_PTR_TYPE
,
3500 TI_INTEGER_PTR_TYPE
,
3509 TI_VA_LIST_GPR_COUNTER_FIELD
,
3510 TI_VA_LIST_FPR_COUNTER_FIELD
,
3517 TI_DFLOAT32_PTR_TYPE
,
3518 TI_DFLOAT64_PTR_TYPE
,
3519 TI_DFLOAT128_PTR_TYPE
,
3528 TI_SAT_LLFRACT_TYPE
,
3529 TI_SAT_USFRACT_TYPE
,
3531 TI_SAT_ULFRACT_TYPE
,
3532 TI_SAT_ULLFRACT_TYPE
,
3544 TI_SAT_LLACCUM_TYPE
,
3545 TI_SAT_USACCUM_TYPE
,
3547 TI_SAT_ULACCUM_TYPE
,
3548 TI_SAT_ULLACCUM_TYPE
,
3594 TI_OPTIMIZATION_DEFAULT
,
3595 TI_OPTIMIZATION_CURRENT
,
3596 TI_TARGET_OPTION_DEFAULT
,
3597 TI_TARGET_OPTION_CURRENT
,
3598 TI_CURRENT_TARGET_PRAGMA
,
3599 TI_CURRENT_OPTIMIZE_PRAGMA
,
3604 extern GTY(()) tree global_trees
[TI_MAX
];
3606 #define error_mark_node global_trees[TI_ERROR_MARK]
3608 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3609 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3610 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3611 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3612 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3614 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3615 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3616 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3617 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3618 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3620 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3621 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3623 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3624 #define integer_one_node global_trees[TI_INTEGER_ONE]
3625 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3626 #define size_zero_node global_trees[TI_SIZE_ZERO]
3627 #define size_one_node global_trees[TI_SIZE_ONE]
3628 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3629 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3630 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3632 /* Base access nodes. */
3633 #define access_public_node global_trees[TI_PUBLIC]
3634 #define access_protected_node global_trees[TI_PROTECTED]
3635 #define access_private_node global_trees[TI_PRIVATE]
3637 #define null_pointer_node global_trees[TI_NULL_POINTER]
3639 #define float_type_node global_trees[TI_FLOAT_TYPE]
3640 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3641 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3643 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3644 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3645 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3646 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3648 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3649 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3650 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3651 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3653 #define void_type_node global_trees[TI_VOID_TYPE]
3654 /* The C type `void *'. */
3655 #define ptr_type_node global_trees[TI_PTR_TYPE]
3656 /* The C type `const void *'. */
3657 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3658 /* The C type `size_t'. */
3659 #define size_type_node global_trees[TI_SIZE_TYPE]
3660 #define pid_type_node global_trees[TI_PID_TYPE]
3661 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3662 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3663 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3664 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3665 /* The C type `FILE *'. */
3666 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3668 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3669 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3670 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3672 /* The decimal floating point types. */
3673 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3674 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3675 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3676 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3677 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3678 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3680 /* The fixed-point types. */
3681 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3682 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3683 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3684 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3685 #define sat_unsigned_short_fract_type_node \
3686 global_trees[TI_SAT_USFRACT_TYPE]
3687 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3688 #define sat_unsigned_long_fract_type_node \
3689 global_trees[TI_SAT_ULFRACT_TYPE]
3690 #define sat_unsigned_long_long_fract_type_node \
3691 global_trees[TI_SAT_ULLFRACT_TYPE]
3692 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3693 #define fract_type_node global_trees[TI_FRACT_TYPE]
3694 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3695 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3696 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3697 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3698 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3699 #define unsigned_long_long_fract_type_node \
3700 global_trees[TI_ULLFRACT_TYPE]
3701 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3702 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3703 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3704 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3705 #define sat_unsigned_short_accum_type_node \
3706 global_trees[TI_SAT_USACCUM_TYPE]
3707 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3708 #define sat_unsigned_long_accum_type_node \
3709 global_trees[TI_SAT_ULACCUM_TYPE]
3710 #define sat_unsigned_long_long_accum_type_node \
3711 global_trees[TI_SAT_ULLACCUM_TYPE]
3712 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3713 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3714 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3715 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3716 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3717 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3718 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3719 #define unsigned_long_long_accum_type_node \
3720 global_trees[TI_ULLACCUM_TYPE]
3721 #define qq_type_node global_trees[TI_QQ_TYPE]
3722 #define hq_type_node global_trees[TI_HQ_TYPE]
3723 #define sq_type_node global_trees[TI_SQ_TYPE]
3724 #define dq_type_node global_trees[TI_DQ_TYPE]
3725 #define tq_type_node global_trees[TI_TQ_TYPE]
3726 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3727 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3728 #define usq_type_node global_trees[TI_USQ_TYPE]
3729 #define udq_type_node global_trees[TI_UDQ_TYPE]
3730 #define utq_type_node global_trees[TI_UTQ_TYPE]
3731 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3732 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3733 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3734 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3735 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3736 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3737 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3738 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3739 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3740 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3741 #define ha_type_node global_trees[TI_HA_TYPE]
3742 #define sa_type_node global_trees[TI_SA_TYPE]
3743 #define da_type_node global_trees[TI_DA_TYPE]
3744 #define ta_type_node global_trees[TI_TA_TYPE]
3745 #define uha_type_node global_trees[TI_UHA_TYPE]
3746 #define usa_type_node global_trees[TI_USA_TYPE]
3747 #define uda_type_node global_trees[TI_UDA_TYPE]
3748 #define uta_type_node global_trees[TI_UTA_TYPE]
3749 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3750 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3751 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3752 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3753 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3754 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3755 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3756 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3758 /* The node that should be placed at the end of a parameter list to
3759 indicate that the function does not take a variable number of
3760 arguments. The TREE_VALUE will be void_type_node and there will be
3761 no TREE_CHAIN. Language-independent code should not assume
3762 anything else about this node. */
3763 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3765 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3766 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3768 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3770 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3771 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3773 /* Default/current target options (TARGET_OPTION_NODE). */
3774 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3775 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3777 /* Default tree list option(), optimize() pragmas to be linked into the
3779 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3780 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3782 /* An enumeration of the standard C integer types. These must be
3783 ordered so that shorter types appear before longer ones, and so
3784 that signed types appear before unsigned ones, for the correct
3785 functioning of interpret_integer() in c-lex.c. */
3786 enum integer_type_kind
3798 itk_unsigned_long_long
,
3802 typedef enum integer_type_kind integer_type_kind
;
3804 /* The standard C integer types. Use integer_type_kind to index into
3806 extern GTY(()) tree integer_types
[itk_none
];
3808 #define char_type_node integer_types[itk_char]
3809 #define signed_char_type_node integer_types[itk_signed_char]
3810 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3811 #define short_integer_type_node integer_types[itk_short]
3812 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3813 #define integer_type_node integer_types[itk_int]
3814 #define unsigned_type_node integer_types[itk_unsigned_int]
3815 #define long_integer_type_node integer_types[itk_long]
3816 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3817 #define long_long_integer_type_node integer_types[itk_long_long]
3818 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3820 /* Set to the default thread-local storage (tls) model to use. */
3822 extern enum tls_model flag_tls_default
;
3825 /* A pointer-to-function member type looks like:
3832 If __pfn is NULL, it is a NULL pointer-to-member-function.
3834 (Because the vtable is always the first thing in the object, we
3835 don't need its offset.) If the function is virtual, then PFN is
3836 one plus twice the index into the vtable; otherwise, it is just a
3837 pointer to the function.
3839 Unfortunately, using the lowest bit of PFN doesn't work in
3840 architectures that don't impose alignment requirements on function
3841 addresses, or that use the lowest bit to tell one ISA from another,
3842 for example. For such architectures, we use the lowest bit of
3843 DELTA instead of the lowest bit of the PFN, and DELTA will be
3846 enum ptrmemfunc_vbit_where_t
3848 ptrmemfunc_vbit_in_pfn
,
3849 ptrmemfunc_vbit_in_delta
3852 #define NULL_TREE (tree) NULL
3854 extern tree
decl_assembler_name (tree
);
3855 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3856 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3858 /* Compute the number of bytes occupied by 'node'. This routine only
3859 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3861 extern size_t tree_size (const_tree
);
3863 /* Compute the number of bytes occupied by a tree with code CODE. This
3864 function cannot be used for TREE_VEC codes, which are of variable
3866 extern size_t tree_code_size (enum tree_code
);
3868 /* Lowest level primitive for allocating a node.
3869 The TREE_CODE is the only argument. Contents are initialized
3870 to zero except for a few of the common fields. */
3872 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3873 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3875 /* Make a copy of a node, with all the same contents. */
3877 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3878 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3880 /* Make a copy of a chain of TREE_LIST nodes. */
3882 extern tree
copy_list (tree
);
3885 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3886 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3888 /* Make a TREE_VEC. */
3890 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3891 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3893 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3894 The name is supplied as a char *. */
3896 extern tree
get_identifier (const char *);
3898 #if GCC_VERSION >= 3000
3899 #define get_identifier(str) \
3900 (__builtin_constant_p (str) \
3901 ? get_identifier_with_length ((str), strlen (str)) \
3902 : get_identifier (str))
3906 /* Identical to get_identifier, except that the length is assumed
3909 extern tree
get_identifier_with_length (const char *, size_t);
3911 /* If an identifier with the name TEXT (a null-terminated string) has
3912 previously been referred to, return that node; otherwise return
3915 extern tree
maybe_get_identifier (const char *);
3917 /* Construct various types of nodes. */
3919 extern tree
build_nt (enum tree_code
, ...);
3920 extern tree
build_nt_call_list (tree
, tree
);
3922 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3923 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3924 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3925 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3926 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3927 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3928 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3929 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3930 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3931 tree MEM_STAT_DECL
);
3932 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3933 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3934 tree MEM_STAT_DECL
);
3935 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3936 extern tree
build7_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3937 tree
, tree
, tree MEM_STAT_DECL
);
3938 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3939 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3941 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3942 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3943 extern tree
build_int_cstu (tree
, unsigned HOST_WIDE_INT
);
3944 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3945 extern tree
build_int_cst_wide_type (tree
,
3946 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3947 extern tree
build_vector (tree
, tree
);
3948 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
3949 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
3950 extern tree
build_constructor_single (tree
, tree
, tree
);
3951 extern tree
build_constructor_from_list (tree
, tree
);
3952 extern tree
build_real_from_int_cst (tree
, const_tree
);
3953 extern tree
build_complex (tree
, tree
, tree
);
3954 extern tree
build_one_cst (tree
);
3955 extern tree
build_string (int, const char *);
3956 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3957 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3958 extern tree
build_decl_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3959 extern tree
build_fn_decl (const char *, tree
);
3960 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3961 extern tree
build_block (tree
, tree
, tree
, tree
);
3962 extern tree
build_empty_stmt (void);
3963 extern tree
build_omp_clause (enum omp_clause_code
);
3965 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3966 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3968 extern tree
build_call_list (tree
, tree
, tree
);
3969 extern tree
build_call_nary (tree
, tree
, int, ...);
3970 extern tree
build_call_valist (tree
, tree
, int, va_list);
3971 extern tree
build_call_array (tree
, tree
, int, tree
*);
3973 /* Construct various nodes representing data types. */
3975 extern tree
make_signed_type (int);
3976 extern tree
make_unsigned_type (int);
3977 extern tree
signed_or_unsigned_type_for (int, tree
);
3978 extern tree
signed_type_for (tree
);
3979 extern tree
unsigned_type_for (tree
);
3980 extern void initialize_sizetypes (bool);
3981 extern void set_sizetype (tree
);
3982 extern void fixup_unsigned_type (tree
);
3983 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3984 extern tree
build_pointer_type (tree
);
3985 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3986 extern tree
build_reference_type (tree
);
3987 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3988 extern tree
build_vector_type (tree innertype
, int nunits
);
3989 extern tree
build_type_no_quals (tree
);
3990 extern tree
build_index_type (tree
);
3991 extern tree
build_index_2_type (tree
, tree
);
3992 extern tree
build_array_type (tree
, tree
);
3993 extern tree
build_function_type (tree
, tree
);
3994 extern tree
build_function_type_list (tree
, ...);
3995 extern tree
build_function_type_skip_args (tree
, bitmap
);
3996 extern tree
build_function_decl_skip_args (tree
, bitmap
);
3997 extern tree
build_varargs_function_type_list (tree
, ...);
3998 extern tree
build_method_type_directly (tree
, tree
, tree
);
3999 extern tree
build_method_type (tree
, tree
);
4000 extern tree
build_offset_type (tree
, tree
);
4001 extern tree
build_complex_type (tree
);
4002 extern tree
build_resx (int);
4003 extern tree
array_type_nelts (const_tree
);
4004 extern bool in_array_bounds_p (tree
);
4005 extern bool range_in_array_bounds_p (tree
);
4007 extern tree
value_member (tree
, tree
);
4008 extern tree
purpose_member (const_tree
, tree
);
4010 extern int attribute_list_equal (const_tree
, const_tree
);
4011 extern int attribute_list_contained (const_tree
, const_tree
);
4012 extern int tree_int_cst_equal (const_tree
, const_tree
);
4013 extern int tree_int_cst_lt (const_tree
, const_tree
);
4014 extern int tree_int_cst_compare (const_tree
, const_tree
);
4015 extern int host_integerp (const_tree
, int);
4016 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4017 extern int tree_int_cst_msb (const_tree
);
4018 extern int tree_int_cst_sgn (const_tree
);
4019 extern int tree_int_cst_sign_bit (const_tree
);
4020 extern bool tree_expr_nonnegative_p (tree
);
4021 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4022 extern bool may_negate_without_overflow_p (const_tree
);
4023 extern tree
strip_array_types (tree
);
4025 /* Construct various nodes representing fract or accum data types. */
4027 extern tree
make_fract_type (int, int, int);
4028 extern tree
make_accum_type (int, int, int);
4030 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4031 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4032 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4033 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4034 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4035 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4036 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4037 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4039 #define make_or_reuse_signed_fract_type(P) \
4040 make_or_reuse_fract_type (P, 0, 0)
4041 #define make_or_reuse_unsigned_fract_type(P) \
4042 make_or_reuse_fract_type (P, 1, 0)
4043 #define make_or_reuse_sat_signed_fract_type(P) \
4044 make_or_reuse_fract_type (P, 0, 1)
4045 #define make_or_reuse_sat_unsigned_fract_type(P) \
4046 make_or_reuse_fract_type (P, 1, 1)
4047 #define make_or_reuse_signed_accum_type(P) \
4048 make_or_reuse_accum_type (P, 0, 0)
4049 #define make_or_reuse_unsigned_accum_type(P) \
4050 make_or_reuse_accum_type (P, 1, 0)
4051 #define make_or_reuse_sat_signed_accum_type(P) \
4052 make_or_reuse_accum_type (P, 0, 1)
4053 #define make_or_reuse_sat_unsigned_accum_type(P) \
4054 make_or_reuse_accum_type (P, 1, 1)
4056 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4057 put the prototype here. Rtl.h does declare the prototype if
4058 tree.h had been included. */
4060 extern tree
make_tree (tree
, rtx
);
4062 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4065 Such modified types already made are recorded so that duplicates
4068 extern tree
build_type_attribute_variant (tree
, tree
);
4069 extern tree
build_decl_attribute_variant (tree
, tree
);
4071 /* Structure describing an attribute and a function to handle it. */
4072 struct attribute_spec
4074 /* The name of the attribute (without any leading or trailing __),
4075 or NULL to mark the end of a table of attributes. */
4076 const char *const name
;
4077 /* The minimum length of the list of arguments of the attribute. */
4078 const int min_length
;
4079 /* The maximum length of the list of arguments of the attribute
4080 (-1 for no maximum). */
4081 const int max_length
;
4082 /* Whether this attribute requires a DECL. If it does, it will be passed
4083 from types of DECLs, function return types and array element types to
4084 the DECLs, function types and array types respectively; but when
4085 applied to a type in any other circumstances, it will be ignored with
4086 a warning. (If greater control is desired for a given attribute,
4087 this should be false, and the flags argument to the handler may be
4088 used to gain greater control in that case.) */
4089 const bool decl_required
;
4090 /* Whether this attribute requires a type. If it does, it will be passed
4091 from a DECL to the type of that DECL. */
4092 const bool type_required
;
4093 /* Whether this attribute requires a function (or method) type. If it does,
4094 it will be passed from a function pointer type to the target type,
4095 and from a function return type (which is not itself a function
4096 pointer type) to the function type. */
4097 const bool function_type_required
;
4098 /* Function to handle this attribute. NODE points to the node to which
4099 the attribute is to be applied. If a DECL, it should be modified in
4100 place; if a TYPE, a copy should be created. NAME is the name of the
4101 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4102 of the arguments (which may be NULL). FLAGS gives further information
4103 about the context of the attribute. Afterwards, the attributes will
4104 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4105 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4106 as well as in any other cases when the attributes should not be added
4107 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4108 applied to another type or DECL later may be returned;
4109 otherwise the return value should be NULL_TREE. This pointer may be
4110 NULL if no special handling is required beyond the checks implied
4111 by the rest of this structure. */
4112 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4113 int flags
, bool *no_add_attrs
);
4116 /* Flags that may be passed in the third argument of decl_attributes, and
4117 to handler functions for attributes. */
4118 enum attribute_flags
4120 /* The type passed in is the type of a DECL, and any attributes that
4121 should be passed in again to be applied to the DECL rather than the
4122 type should be returned. */
4123 ATTR_FLAG_DECL_NEXT
= 1,
4124 /* The type passed in is a function return type, and any attributes that
4125 should be passed in again to be applied to the function type rather
4126 than the return type should be returned. */
4127 ATTR_FLAG_FUNCTION_NEXT
= 2,
4128 /* The type passed in is an array element type, and any attributes that
4129 should be passed in again to be applied to the array type rather
4130 than the element type should be returned. */
4131 ATTR_FLAG_ARRAY_NEXT
= 4,
4132 /* The type passed in is a structure, union or enumeration type being
4133 created, and should be modified in place. */
4134 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4135 /* The attributes are being applied by default to a library function whose
4136 name indicates known behavior, and should be silently ignored if they
4137 are not in fact compatible with the function type. */
4138 ATTR_FLAG_BUILT_IN
= 16
4141 /* Default versions of target-overridable functions. */
4143 extern tree
merge_decl_attributes (tree
, tree
);
4144 extern tree
merge_type_attributes (tree
, tree
);
4146 /* Given a tree node and a string, return nonzero if the tree node is
4147 a valid attribute name for the string. */
4149 extern int is_attribute_p (const char *, const_tree
);
4151 /* Given an attribute name and a list of attributes, return the list element
4152 of the attribute or NULL_TREE if not found. */
4154 extern tree
lookup_attribute (const char *, tree
);
4156 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4159 extern tree
remove_attribute (const char *, tree
);
4161 /* Given two attributes lists, return a list of their union. */
4163 extern tree
merge_attributes (tree
, tree
);
4165 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4166 /* Given two Windows decl attributes lists, possibly including
4167 dllimport, return a list of their union . */
4168 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4170 /* Handle a "dllimport" or "dllexport" attribute. */
4171 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4174 /* Check whether CAND is suitable to be returned from get_qualified_type
4175 (BASE, TYPE_QUALS). */
4177 extern bool check_qualified_type (const_tree
, const_tree
, int);
4179 /* Return a version of the TYPE, qualified as indicated by the
4180 TYPE_QUALS, if one exists. If no qualified version exists yet,
4181 return NULL_TREE. */
4183 extern tree
get_qualified_type (tree
, int);
4185 /* Like get_qualified_type, but creates the type if it does not
4186 exist. This function never returns NULL_TREE. */
4188 extern tree
build_qualified_type (tree
, int);
4190 /* Like build_qualified_type, but only deals with the `const' and
4191 `volatile' qualifiers. This interface is retained for backwards
4192 compatibility with the various front-ends; new code should use
4193 build_qualified_type instead. */
4195 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4196 build_qualified_type ((TYPE), \
4197 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4198 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4200 /* Make a copy of a type node. */
4202 extern tree
build_distinct_type_copy (tree
);
4203 extern tree
build_variant_type_copy (tree
);
4205 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4206 fields. Optionally specify an alignment, and then lay it out. */
4208 extern void finish_builtin_struct (tree
, const char *,
4211 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4212 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4213 node, does nothing except for the first time. */
4215 extern void layout_type (tree
);
4217 /* These functions allow a front-end to perform a manual layout of a
4218 RECORD_TYPE. (For instance, if the placement of subsequent fields
4219 depends on the placement of fields so far.) Begin by calling
4220 start_record_layout. Then, call place_field for each of the
4221 fields. Then, call finish_record_layout. See layout_type for the
4222 default way in which these functions are used. */
4224 typedef struct record_layout_info_s
4226 /* The RECORD_TYPE that we are laying out. */
4228 /* The offset into the record so far, in bytes, not including bits in
4231 /* The last known alignment of SIZE. */
4232 unsigned int offset_align
;
4233 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4235 /* The alignment of the record so far, in bits. */
4236 unsigned int record_align
;
4237 /* The alignment of the record so far, ignoring #pragma pack and
4238 __attribute__ ((packed)), in bits. */
4239 unsigned int unpacked_align
;
4240 /* The previous field layed out. */
4242 /* The static variables (i.e., class variables, as opposed to
4243 instance variables) encountered in T. */
4244 tree pending_statics
;
4245 /* Bits remaining in the current alignment group */
4246 int remaining_in_alignment
;
4247 /* True if we've seen a packed field that didn't have normal
4248 alignment anyway. */
4249 int packed_maybe_necessary
;
4250 } *record_layout_info
;
4252 extern record_layout_info
start_record_layout (tree
);
4253 extern tree
bit_from_pos (tree
, tree
);
4254 extern tree
byte_from_pos (tree
, tree
);
4255 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4256 extern void normalize_offset (tree
*, tree
*, unsigned int);
4257 extern tree
rli_size_unit_so_far (record_layout_info
);
4258 extern tree
rli_size_so_far (record_layout_info
);
4259 extern void normalize_rli (record_layout_info
);
4260 extern void place_field (record_layout_info
, tree
);
4261 extern void compute_record_mode (tree
);
4262 extern void finish_record_layout (record_layout_info
, int);
4264 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4265 return a canonicalized ..._TYPE node, so that duplicates are not made.
4266 How the hash code is computed is up to the caller, as long as any two
4267 callers that could hash identical-looking type nodes agree. */
4269 extern tree
type_hash_canon (unsigned int, tree
);
4271 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4272 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4273 fields. Call this only once for any given decl node.
4275 Second argument is the boundary that this field can be assumed to
4276 be starting at (in bits). Zero means it can be assumed aligned
4277 on any boundary that may be needed. */
4279 extern void layout_decl (tree
, unsigned);
4281 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4282 a previous call to layout_decl and calls it again. */
4284 extern void relayout_decl (tree
);
4286 /* Return the mode for data of a given size SIZE and mode class CLASS.
4287 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4288 The value is BLKmode if no other mode is found. This is like
4289 mode_for_size, but is passed a tree. */
4291 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4293 /* Return an expr equal to X but certainly not valid as an lvalue. */
4295 extern tree
non_lvalue (tree
);
4297 extern tree
convert (tree
, tree
);
4298 extern unsigned int expr_align (const_tree
);
4299 extern tree
expr_first (tree
);
4300 extern tree
expr_last (tree
);
4301 extern tree
expr_only (tree
);
4302 extern tree
size_in_bytes (const_tree
);
4303 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4304 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4305 extern tree
bit_position (const_tree
);
4306 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4307 extern tree
byte_position (const_tree
);
4308 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4310 /* Define data structures, macros, and functions for handling sizes
4311 and the various types used to represent sizes. */
4315 SIZETYPE
, /* Normal representation of sizes in bytes. */
4316 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4317 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4318 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4321 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4323 #define sizetype sizetype_tab[(int) SIZETYPE]
4324 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4325 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4326 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4328 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4329 extern tree
size_binop (enum tree_code
, tree
, tree
);
4330 extern tree
size_diffop (tree
, tree
);
4332 #define size_int(L) size_int_kind (L, SIZETYPE)
4333 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4334 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4335 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4337 extern tree
round_up (tree
, int);
4338 extern tree
round_down (tree
, int);
4339 extern tree
get_pending_sizes (void);
4340 extern void put_pending_size (tree
);
4341 extern void put_pending_sizes (tree
);
4343 /* Type for sizes of data-type. */
4345 #define BITS_PER_UNIT_LOG \
4346 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4347 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4348 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4350 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4351 extern unsigned int maximum_field_alignment
;
4352 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4353 extern unsigned int initial_max_fld_align
;
4355 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4356 by making the last node in X point to Y.
4357 Returns X, except if X is 0 returns Y. */
4359 extern tree
chainon (tree
, tree
);
4361 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4363 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4364 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4366 /* Return the last tree node in a chain. */
4368 extern tree
tree_last (tree
);
4370 /* Reverse the order of elements in a chain, and return the new head. */
4372 extern tree
nreverse (tree
);
4374 /* Returns the length of a chain of nodes
4375 (number of chain pointers to follow before reaching a null pointer). */
4377 extern int list_length (const_tree
);
4379 /* Returns the number of FIELD_DECLs in a type. */
4381 extern int fields_length (const_tree
);
4383 /* Given an initializer INIT, return TRUE if INIT is zero or some
4384 aggregate of zeros. Otherwise return FALSE. */
4386 extern bool initializer_zerop (const_tree
);
4388 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4390 extern tree
ctor_to_list (tree
);
4392 /* Examine CTOR to discover:
4393 * how many scalar fields are set to nonzero values,
4394 and place it in *P_NZ_ELTS;
4395 * how many scalar fields in total are in CTOR,
4396 and place it in *P_ELT_COUNT.
4397 * if a type is a union, and the initializer from the constructor
4398 is not the largest element in the union, then set *p_must_clear.
4400 Return whether or not CTOR is a valid static constant initializer, the same
4401 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4403 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4406 extern HOST_WIDE_INT
count_type_elements (const_tree
, bool);
4408 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4410 extern int integer_zerop (const_tree
);
4412 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4414 extern int integer_onep (const_tree
);
4416 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4417 all of whose significant bits are 1. */
4419 extern int integer_all_onesp (const_tree
);
4421 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4422 exactly one bit 1. */
4424 extern int integer_pow2p (const_tree
);
4426 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4427 with a nonzero value. */
4429 extern int integer_nonzerop (const_tree
);
4431 extern bool cst_and_fits_in_hwi (const_tree
);
4432 extern tree
num_ending_zeros (const_tree
);
4434 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4437 extern int fixed_zerop (const_tree
);
4439 /* staticp (tree x) is nonzero if X is a reference to data allocated
4440 at a fixed address in memory. Returns the outermost data. */
4442 extern tree
staticp (tree
);
4444 /* save_expr (EXP) returns an expression equivalent to EXP
4445 but it can be used multiple times within context CTX
4446 and only evaluate EXP once. */
4448 extern tree
save_expr (tree
);
4450 /* Look inside EXPR and into any simple arithmetic operations. Return
4451 the innermost non-arithmetic node. */
4453 extern tree
skip_simple_arithmetic (tree
);
4455 /* Return which tree structure is used by T. */
4457 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4459 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4460 or offset that depends on a field within a record.
4462 Note that we only allow such expressions within simple arithmetic
4465 extern bool contains_placeholder_p (const_tree
);
4467 /* This macro calls the above function but short-circuits the common
4468 case of a constant to save time. Also check for null. */
4470 #define CONTAINS_PLACEHOLDER_P(EXP) \
4471 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4473 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4474 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4477 extern bool type_contains_placeholder_p (tree
);
4479 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4480 return a tree with all occurrences of references to F in a
4481 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4482 contains only arithmetic expressions. */
4484 extern tree
substitute_in_expr (tree
, tree
, tree
);
4486 /* This macro calls the above function but short-circuits the common
4487 case of a constant to save time and also checks for NULL. */
4489 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4490 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4492 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4493 for it within OBJ, a tree that is an object or a chain of references. */
4495 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4497 /* This macro calls the above function but short-circuits the common
4498 case of a constant to save time and also checks for NULL. */
4500 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4501 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4502 : substitute_placeholder_in_expr (EXP, OBJ))
4504 /* variable_size (EXP) is like save_expr (EXP) except that it
4505 is for the special case of something that is part of a
4506 variable size for a data type. It makes special arrangements
4507 to compute the value at the right time when the data type
4508 belongs to a function parameter. */
4510 extern tree
variable_size (tree
);
4512 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4513 but it can be used multiple times
4514 and only evaluate the subexpressions once. */
4516 extern tree
stabilize_reference (tree
);
4518 /* Subroutine of stabilize_reference; this is called for subtrees of
4519 references. Any expression with side-effects must be put in a SAVE_EXPR
4520 to ensure that it is only evaluated once. */
4522 extern tree
stabilize_reference_1 (tree
);
4524 /* Return EXP, stripped of any conversions to wider types
4525 in such a way that the result of converting to type FOR_TYPE
4526 is the same as if EXP were converted to FOR_TYPE.
4527 If FOR_TYPE is 0, it signifies EXP's type. */
4529 extern tree
get_unwidened (tree
, tree
);
4531 /* Return OP or a simpler expression for a narrower value
4532 which can be sign-extended or zero-extended to give back OP.
4533 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4534 or 0 if the value should be sign-extended. */
4536 extern tree
get_narrower (tree
, int *);
4538 /* Return true if T is an expression that get_inner_reference handles. */
4540 extern int handled_component_p (const_tree
);
4542 /* Given an expression EXP that is a handled_component_p,
4543 look for the ultimate containing object, which is returned and specify
4544 the access position and size. */
4546 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4547 tree
*, enum machine_mode
*, int *, int *,
4550 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4551 look for whether EXP or any nested component-refs within EXP is marked
4554 extern bool contains_packed_reference (const_tree exp
);
4556 /* Return a tree of sizetype representing the size, in bytes, of the element
4557 of EXP, an ARRAY_REF. */
4559 extern tree
array_ref_element_size (tree
);
4561 /* Return a tree representing the lower bound of the array mentioned in
4562 EXP, an ARRAY_REF. */
4564 extern tree
array_ref_low_bound (tree
);
4566 /* Return a tree representing the upper bound of the array mentioned in
4567 EXP, an ARRAY_REF. */
4569 extern tree
array_ref_up_bound (tree
);
4571 /* Return a tree representing the offset, in bytes, of the field referenced
4572 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4574 extern tree
component_ref_field_offset (tree
);
4576 /* Given a DECL or TYPE, return the scope in which it was declared, or
4577 NUL_TREE if there is no containing scope. */
4579 extern tree
get_containing_scope (const_tree
);
4581 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4583 extern tree
decl_function_context (const_tree
);
4585 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4586 this _DECL with its context, or zero if none. */
4587 extern tree
decl_type_context (const_tree
);
4589 /* Return 1 if EXPR is the real constant zero. */
4590 extern int real_zerop (const_tree
);
4592 /* Declare commonly used variables for tree structure. */
4594 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4595 Zero means allow extended lvalues. */
4597 extern int pedantic_lvalues
;
4599 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4601 extern GTY(()) tree current_function_decl
;
4603 /* Nonzero means a FUNC_BEGIN label was emitted. */
4604 extern GTY(()) const char * current_function_func_begin_label
;
4606 /* Iterator for going through the function arguments. */
4608 tree fntype
; /* function type declaration */
4609 tree next
; /* TREE_LIST pointing to the next argument */
4610 } function_args_iterator
;
4612 /* Initialize the iterator I with arguments from function FNDECL */
4615 function_args_iter_init (function_args_iterator
*i
, tree fntype
)
4618 i
->next
= TYPE_ARG_TYPES (fntype
);
4621 /* Return a pointer that holds the next argument if there are more arguments to
4622 handle, otherwise return NULL. */
4624 static inline tree
*
4625 function_args_iter_cond_ptr (function_args_iterator
*i
)
4627 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4630 /* Return the next argument if there are more arguments to handle, otherwise
4634 function_args_iter_cond (function_args_iterator
*i
)
4636 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4639 /* Advance to the next argument. */
4641 function_args_iter_next (function_args_iterator
*i
)
4643 gcc_assert (i
->next
!= NULL_TREE
);
4644 i
->next
= TREE_CHAIN (i
->next
);
4647 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4648 to point to the next tree element. ITER is an instance of
4649 function_args_iterator used to iterate the arguments. */
4650 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4651 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4652 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4653 function_args_iter_next (&(ITER)))
4655 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4656 to the next tree element. ITER is an instance of function_args_iterator
4657 used to iterate the arguments. */
4658 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4659 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4660 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4661 function_args_iter_next (&(ITER)))
4666 extern unsigned crc32_string (unsigned, const char *);
4667 extern void clean_symbol_name (char *);
4668 extern tree
get_file_function_name (const char *);
4669 extern tree
get_callee_fndecl (const_tree
);
4670 extern void change_decl_assembler_name (tree
, tree
);
4671 extern int type_num_arguments (const_tree
);
4672 extern bool associative_tree_code (enum tree_code
);
4673 extern bool commutative_tree_code (enum tree_code
);
4674 extern tree
upper_bound_in_type (tree
, tree
);
4675 extern tree
lower_bound_in_type (tree
, tree
);
4676 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4677 extern tree
call_expr_arg (tree
, int);
4678 extern tree
*call_expr_argp (tree
, int);
4679 extern tree
call_expr_arglist (tree
);
4680 extern tree
create_artificial_label (void);
4681 extern const char *get_name (tree
);
4682 extern bool stdarg_p (tree
);
4683 extern bool prototype_p (tree
);
4684 extern int function_args_count (tree
);
4685 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4688 extern tree
unshare_expr (tree
);
4692 extern void expand_expr_stmt (tree
);
4693 extern int warn_if_unused_value (const_tree
, location_t
);
4694 extern void expand_label (tree
);
4695 extern void expand_goto (tree
);
4697 extern rtx
expand_stack_save (void);
4698 extern void expand_stack_restore (tree
);
4699 extern void expand_return (tree
);
4700 extern int is_body_block (const_tree
);
4703 extern void using_eh_for_cleanups (void);
4705 /* In fold-const.c */
4707 /* Non-zero if we are folding constants inside an initializer; zero
4709 extern int folding_initializer
;
4711 /* Convert between trees and native memory representation. */
4712 extern int native_encode_expr (const_tree
, unsigned char *, int);
4713 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4715 /* Fold constants as much as possible in an expression.
4716 Returns the simplified expression.
4717 Acts only on the top level of the expression;
4718 if the argument itself cannot be simplified, its
4719 subexpressions are not changed. */
4721 extern tree
fold (tree
);
4722 extern tree
fold_unary (enum tree_code
, tree
, tree
);
4723 extern tree
fold_binary (enum tree_code
, tree
, tree
, tree
);
4724 extern tree
fold_ternary (enum tree_code
, tree
, tree
, tree
, tree
);
4725 extern tree
fold_build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4726 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4727 extern tree
fold_build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4728 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4729 extern tree
fold_build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4730 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4731 extern tree
fold_build1_initializer (enum tree_code
, tree
, tree
);
4732 extern tree
fold_build2_initializer (enum tree_code
, tree
, tree
, tree
);
4733 extern tree
fold_build3_initializer (enum tree_code
, tree
, tree
, tree
, tree
);
4734 extern tree
fold_build_call_array (tree
, tree
, int, tree
*);
4735 extern tree
fold_build_call_array_initializer (tree
, tree
, int, tree
*);
4736 extern bool fold_convertible_p (const_tree
, const_tree
);
4737 extern tree
fold_convert (tree
, tree
);
4738 extern tree
fold_single_bit_test (enum tree_code
, tree
, tree
, tree
);
4739 extern tree
fold_ignored_result (tree
);
4740 extern tree
fold_abs_const (tree
, tree
);
4741 extern tree
fold_indirect_ref_1 (tree
, tree
);
4742 extern void fold_defer_overflow_warnings (void);
4743 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4744 extern void fold_undefer_and_ignore_overflow_warnings (void);
4745 extern bool fold_deferring_overflow_warnings_p (void);
4746 extern tree
maybe_fold_offset_to_reference (tree
, tree
, tree
);
4747 extern tree
maybe_fold_offset_to_address (tree
, tree
, tree
);
4748 extern tree
maybe_fold_stmt_addition (tree
, tree
, tree
);
4750 extern tree
force_fit_type_double (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4753 extern int fit_double_type (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4754 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, const_tree
);
4755 extern int add_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4756 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4757 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4759 #define add_double(l1,h1,l2,h2,lv,hv) \
4760 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4761 extern int neg_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4762 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4763 extern int mul_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4764 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4765 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4767 #define mul_double(l1,h1,l2,h2,lv,hv) \
4768 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4769 extern void lshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4770 HOST_WIDE_INT
, unsigned int,
4771 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4772 extern void rshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4773 HOST_WIDE_INT
, unsigned int,
4774 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4775 extern void lrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4776 HOST_WIDE_INT
, unsigned int,
4777 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4778 extern void rrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4779 HOST_WIDE_INT
, unsigned int,
4780 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4782 extern int div_and_round_double (enum tree_code
, int, unsigned HOST_WIDE_INT
,
4783 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
4784 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
*,
4785 HOST_WIDE_INT
*, unsigned HOST_WIDE_INT
*,
4788 enum operand_equal_flag
4794 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4795 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4796 extern tree
omit_one_operand (tree
, tree
, tree
);
4797 extern tree
omit_two_operands (tree
, tree
, tree
, tree
);
4798 extern tree
invert_truthvalue (tree
);
4799 extern tree
fold_truth_not_expr (tree
);
4800 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4801 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4802 extern tree
fold_read_from_constant_string (tree
);
4803 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
, int);
4804 extern tree
build_fold_addr_expr (tree
);
4805 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4806 extern tree
fold_strip_sign_ops (tree
);
4807 extern tree
build_fold_addr_expr_with_type (tree
, tree
);
4808 extern tree
build_fold_indirect_ref (tree
);
4809 extern tree
fold_indirect_ref (tree
);
4810 extern tree
constant_boolean_node (int, tree
);
4811 extern tree
build_low_bits_mask (tree
, unsigned);
4813 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4814 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4816 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4817 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4819 extern bool tree_expr_nonzero_p (tree
);
4820 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4821 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4823 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4824 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4825 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4826 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4828 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4829 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4830 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4832 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4834 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4837 extern tree
fold_call_expr (tree
, bool);
4838 extern tree
fold_builtin_fputs (tree
, tree
, bool, bool, tree
);
4839 extern tree
fold_builtin_strcpy (tree
, tree
, tree
, tree
);
4840 extern tree
fold_builtin_strncpy (tree
, tree
, tree
, tree
, tree
);
4841 extern tree
fold_builtin_memory_chk (tree
, tree
, tree
, tree
, tree
, tree
, bool,
4842 enum built_in_function
);
4843 extern tree
fold_builtin_stxcpy_chk (tree
, tree
, tree
, tree
, tree
, bool,
4844 enum built_in_function
);
4845 extern tree
fold_builtin_strncpy_chk (tree
, tree
, tree
, tree
, tree
);
4846 extern tree
fold_builtin_snprintf_chk (tree
, tree
, enum built_in_function
);
4847 extern bool fold_builtin_next_arg (tree
, bool);
4848 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4849 extern tree
build_function_call_expr (tree
, tree
);
4850 extern tree
fold_builtin_call_array (tree
, tree
, int, tree
*);
4851 extern void debug_fold_checksum (const_tree
);
4852 extern tree
build_call_expr (tree
, int, ...);
4853 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4854 extern tree
strip_float_extensions (tree
);
4855 extern tree
c_strlen (tree
, int);
4856 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
4857 extern tree
build_va_arg_indirect_ref (tree
);
4858 extern tree
build_string_literal (int, const char *);
4859 extern bool validate_arglist (const_tree
, ...);
4860 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4861 extern int get_pointer_alignment (tree
, unsigned int);
4862 extern tree
fold_call_stmt (gimple
, bool);
4863 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4866 extern tree
strip_float_extensions (tree
);
4869 extern int really_constant_p (const_tree
);
4870 extern bool decl_address_invariant_p (const_tree
);
4871 extern bool decl_address_ip_invariant_p (const_tree
);
4872 extern int int_fits_type_p (const_tree
, const_tree
);
4873 #ifndef GENERATOR_FILE
4874 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4876 extern bool variably_modified_type_p (tree
, tree
);
4877 extern int tree_log2 (const_tree
);
4878 extern int tree_floor_log2 (const_tree
);
4879 extern int simple_cst_equal (const_tree
, const_tree
);
4880 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4881 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4882 const_tree
, hashval_t
);
4883 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4884 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4885 extern int type_list_equal (const_tree
, const_tree
);
4886 extern int chain_member (const_tree
, const_tree
);
4887 extern tree
type_hash_lookup (unsigned int, tree
);
4888 extern void type_hash_add (unsigned int, tree
);
4889 extern int simple_cst_list_equal (const_tree
, const_tree
);
4890 extern void dump_tree_statistics (void);
4891 extern void expand_function_end (void);
4892 extern void expand_function_start (tree
);
4893 extern void stack_protect_prologue (void);
4894 extern void stack_protect_epilogue (void);
4895 extern void recompute_tree_invariant_for_addr_expr (tree
);
4896 extern bool needs_to_live_in_memory (const_tree
);
4897 extern tree
reconstruct_complex_type (tree
, tree
);
4899 extern int real_onep (const_tree
);
4900 extern int real_twop (const_tree
);
4901 extern int real_minus_onep (const_tree
);
4902 extern void init_ttree (void);
4903 extern void build_common_tree_nodes (bool, bool);
4904 extern void build_common_tree_nodes_2 (int);
4905 extern void build_common_builtin_nodes (void);
4906 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4907 extern tree
build_range_type (tree
, tree
, tree
);
4908 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4909 extern tree
build_addr (tree
, tree
);
4911 extern bool fields_compatible_p (const_tree
, const_tree
);
4912 extern tree
find_compatible_field (tree
, tree
);
4914 extern void set_expr_locus (tree
, source_location
*);
4916 extern tree
*tree_block (tree
);
4917 extern location_t
*block_nonartificial_location (tree
);
4920 extern void expand_main_function (void);
4921 extern void init_dummy_function_start (void);
4922 extern void expand_dummy_function_end (void);
4923 extern unsigned int init_function_for_compilation (void);
4924 extern void allocate_struct_function (tree
, bool);
4925 extern void push_struct_function (tree fndecl
);
4926 extern void init_function_start (tree
);
4927 extern bool use_register_for_decl (const_tree
);
4928 extern void generate_setjmp_warnings (void);
4929 extern void init_temp_slots (void);
4930 extern void free_temp_slots (void);
4931 extern void pop_temp_slots (void);
4932 extern void push_temp_slots (void);
4933 extern void preserve_temp_slots (rtx
);
4934 extern int aggregate_value_p (const_tree
, const_tree
);
4935 extern void push_function_context (void);
4936 extern void pop_function_context (void);
4937 extern gimple_seq
gimplify_parameters (void);
4939 /* In print-rtl.c */
4941 extern void print_rtl (FILE *, const_rtx
);
4944 /* In print-tree.c */
4945 extern void debug_tree (tree
);
4947 extern void dump_addr (FILE*, const char *, const void *);
4948 extern void print_node (FILE *, const char *, tree
, int);
4949 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4950 extern void indent_to (FILE *, int);
4953 /* In tree-inline.c: */
4954 extern bool debug_find_tree (tree
, tree
);
4955 /* This is in tree-inline.c since the routine uses
4956 data structures from the inliner. */
4957 extern tree
unsave_expr_now (tree
);
4958 extern tree
build_duplicate_type (tree
);
4962 /* Nonzero if this is a call to a function whose return value depends
4963 solely on its arguments, has no side effects, and does not read
4964 global memory. This corresponds to TREE_READONLY for function
4966 #define ECF_CONST (1 << 0)
4967 /* Nonzero if this is a call to "pure" function (like const function,
4968 but may read memory. This corresponds to DECL_PURE_P for function
4970 #define ECF_PURE (1 << 1)
4971 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
4972 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
4973 for function decls.*/
4974 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
4975 /* Nonzero if this call will never return. */
4976 #define ECF_NORETURN (1 << 3)
4977 /* Nonzero if this is a call to malloc or a related function. */
4978 #define ECF_MALLOC (1 << 4)
4979 /* Nonzero if it is plausible that this is a call to alloca. */
4980 #define ECF_MAY_BE_ALLOCA (1 << 5)
4981 /* Nonzero if this is a call to a function that won't throw an exception. */
4982 #define ECF_NOTHROW (1 << 6)
4983 /* Nonzero if this is a call to setjmp or a related function. */
4984 #define ECF_RETURNS_TWICE (1 << 7)
4985 /* Nonzero if this call replaces the current stack frame. */
4986 #define ECF_SIBCALL (1 << 8)
4987 /* Function does not read or write memory (but may have side effects, so
4988 it does not necessarily fit ECF_CONST). */
4989 #define ECF_NOVOPS (1 << 9)
4991 extern int flags_from_decl_or_type (const_tree
);
4992 extern int call_expr_flags (const_tree
);
4994 extern int setjmp_call_p (const_tree
);
4995 extern bool gimple_alloca_call_p (const_gimple
);
4996 extern bool alloca_call_p (const_tree
);
4997 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4998 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5002 extern const struct attribute_spec
*lookup_attribute_spec (tree
);
5004 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5005 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5006 it should be modified in place; if a TYPE, a copy should be created
5007 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5008 information, in the form of a bitwise OR of flags in enum attribute_flags
5009 from tree.h. Depending on these flags, some attributes may be
5010 returned to be applied at a later stage (for example, to apply
5011 a decl attribute to the declaration rather than to its type). */
5012 extern tree
decl_attributes (tree
*, tree
, int);
5014 /* In integrate.c */
5015 extern void set_decl_abstract_flags (tree
, int);
5016 extern void set_decl_origin_self (tree
);
5018 /* In stor-layout.c */
5019 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5020 extern void fixup_signed_type (tree
);
5021 extern void internal_reference_types (void);
5022 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5025 extern void make_decl_rtl (tree
);
5026 extern void make_decl_one_only (tree
);
5027 extern int supports_one_only (void);
5028 extern void resolve_unique_section (tree
, int, int);
5029 extern void mark_referenced (tree
);
5030 extern void mark_decl_referenced (tree
);
5031 extern void notice_global_symbol (tree
);
5032 extern void set_user_assembler_name (tree
, const char *);
5033 extern void process_pending_assemble_externals (void);
5034 extern void finish_aliases_1 (void);
5035 extern void finish_aliases_2 (void);
5036 extern tree
emutls_decl (tree
);
5039 extern void expand_computed_goto (tree
);
5040 extern bool parse_output_constraint (const char **, int, int, int,
5041 bool *, bool *, bool *);
5042 extern bool parse_input_constraint (const char **, int, int, int, int,
5043 const char * const *, bool *, bool *);
5044 extern void expand_asm_expr (tree
);
5045 extern tree
resolve_asm_operand_names (tree
, tree
, tree
);
5046 extern void expand_case (tree
);
5047 extern void expand_decl (tree
);
5048 extern void expand_anon_union_decl (tree
, tree
, tree
);
5050 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5051 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5055 /* Interface of the DWARF2 unwind info support. */
5057 /* Generate a new label for the CFI info to refer to. */
5059 extern char *dwarf2out_cfi_label (void);
5061 /* Entry point to update the canonical frame address (CFA). */
5063 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
5065 /* Add the CFI for saving a register window. */
5067 extern void dwarf2out_window_save (const char *);
5069 /* Add a CFI to update the running total of the size of arguments pushed
5072 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT
);
5074 /* Entry point for saving a register to the stack. */
5076 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
5078 /* Entry point for saving the return address in the stack. */
5080 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
5082 /* Entry point for saving the return address in a register. */
5084 extern void dwarf2out_return_reg (const char *, unsigned);
5086 /* Entry point for saving the first register into the second. */
5088 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
5090 /* In tree-inline.c */
5092 /* The type of a set of already-visited pointers. Functions for creating
5093 and manipulating it are declared in pointer-set.h */
5094 struct pointer_set_t
;
5096 /* The type of a callback function for walking over tree structure. */
5098 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5100 /* The type of a callback function that represents a custom walk_tree. */
5102 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5103 void *, struct pointer_set_t
*);
5105 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5107 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5109 #define walk_tree(a,b,c,d) \
5110 walk_tree_1 (a, b, c, d, NULL)
5111 #define walk_tree_without_duplicates(a,b,c) \
5112 walk_tree_without_duplicates_1 (a, b, c, NULL)
5114 /* Assign the RTX to declaration. */
5116 extern void set_decl_rtl (tree
, rtx
);
5117 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5119 /* Enum and arrays used for tree allocation stats.
5120 Keep in sync with tree.c:tree_node_kind_names. */
5144 extern int tree_node_counts
[];
5145 extern int tree_node_sizes
[];
5147 /* True if we are in gimple form and the actions of the folders need to
5148 be restricted. False if we are not in gimple form and folding is not
5149 restricted to creating gimple expressions. */
5150 extern bool in_gimple_form
;
5152 /* In tree-gimple.c. */
5153 extern tree
get_base_address (tree t
);
5155 /* In tree-vectorizer.c. */
5156 extern void vect_set_verbosity_level (const char *);
5160 struct tree_map_base
GTY(())
5165 extern int tree_map_base_eq (const void *, const void *);
5166 extern unsigned int tree_map_base_hash (const void *);
5167 extern int tree_map_base_marked_p (const void *);
5169 /* Map from a tree to another tree. */
5171 struct tree_map
GTY(())
5173 struct tree_map_base base
;
5178 #define tree_map_eq tree_map_base_eq
5179 extern unsigned int tree_map_hash (const void *);
5180 #define tree_map_marked_p tree_map_base_marked_p
5182 /* Map from a tree to an int. */
5184 struct tree_int_map
GTY(())
5186 struct tree_map_base base
;
5190 #define tree_int_map_eq tree_map_base_eq
5191 #define tree_int_map_hash tree_map_base_hash
5192 #define tree_int_map_marked_p tree_map_base_marked_p
5194 /* Map from a tree to initialization/finalization priorities. */
5196 struct tree_priority_map
GTY(())
5198 struct tree_map_base base
;
5203 #define tree_priority_map_eq tree_map_base_eq
5204 #define tree_priority_map_hash tree_map_base_hash
5205 #define tree_priority_map_marked_p tree_map_base_marked_p
5207 /* In tree-ssa-address.c. */
5208 extern tree
tree_mem_ref_addr (tree
, tree
);
5209 extern void copy_mem_ref_info (tree
, tree
);
5212 extern bool ssa_name_nonzero_p (const_tree
);
5213 extern bool ssa_name_nonnegative_p (const_tree
);
5215 /* In tree-object-size.c. */
5216 extern void init_object_sizes (void);
5217 extern void fini_object_sizes (void);
5218 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5221 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5223 /* In tree-inline.c. */
5225 void init_inline_once (void);
5227 /* Compute the number of operands in an expression node NODE. For
5228 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5229 otherwise it is looked up from the node's code. */
5231 tree_operand_length (const_tree node
)
5233 if (VL_EXP_CLASS_P (node
))
5234 return VL_EXP_OPERAND_LENGTH (node
);
5236 return TREE_CODE_LENGTH (TREE_CODE (node
));
5239 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5240 have to go towards the end of tree.h so that union tree_node is fully
5241 defined by this point. */
5243 /* Structure containing iterator state. */
5244 typedef struct call_expr_arg_iterator_d
GTY (())
5246 tree t
; /* the call_expr */
5247 int n
; /* argument count */
5248 int i
; /* next argument index */
5249 } call_expr_arg_iterator
;
5251 typedef struct const_call_expr_arg_iterator_d
GTY (())
5253 const_tree t
; /* the call_expr */
5254 int n
; /* argument count */
5255 int i
; /* next argument index */
5256 } const_call_expr_arg_iterator
;
5258 /* Initialize the abstract argument list iterator object ITER with the
5259 arguments from CALL_EXPR node EXP. */
5261 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5264 iter
->n
= call_expr_nargs (exp
);
5269 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5272 iter
->n
= call_expr_nargs (exp
);
5276 /* Return the next argument from abstract argument list iterator object ITER,
5277 and advance its state. Return NULL_TREE if there are no more arguments. */
5279 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5282 if (iter
->i
>= iter
->n
)
5284 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5289 static inline const_tree
5290 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5293 if (iter
->i
>= iter
->n
)
5295 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5300 /* Initialize the abstract argument list iterator object ITER, then advance
5301 past and return the first argument. Useful in for expressions, e.g.
5302 for (arg = first_call_expr_arg (exp, &iter); arg;
5303 arg = next_call_expr_arg (&iter)) */
5305 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5307 init_call_expr_arg_iterator (exp
, iter
);
5308 return next_call_expr_arg (iter
);
5311 static inline const_tree
5312 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5314 init_const_call_expr_arg_iterator (exp
, iter
);
5315 return next_const_call_expr_arg (iter
);
5318 /* Test whether there are more arguments in abstract argument list iterator
5319 ITER, without changing its state. */
5321 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5323 return (iter
->i
< iter
->n
);
5327 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5329 return (iter
->i
< iter
->n
);
5332 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5333 (of type call_expr_arg_iterator) to hold the iteration state. */
5334 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5335 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5336 (arg) = next_call_expr_arg (&(iter)))
5338 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5339 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5340 (arg) = next_const_call_expr_arg (&(iter)))
5342 #endif /* GCC_TREE_H */