1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
30 #include "double-int.h"
34 /* Codes of tree nodes */
36 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
40 #include "all-tree.def"
45 #undef END_OF_BASE_TREE_CODES
47 extern unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
50 /* Number of language-independent tree codes. */
51 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
53 /* Tree code classes. */
55 /* Each tree_code has an associated code class represented by a
58 enum tree_code_class
{
59 tcc_exceptional
, /* An exceptional code (fits no category). */
60 tcc_constant
, /* A constant. */
61 /* Order of tcc_type and tcc_declaration is important. */
62 tcc_type
, /* A type object code. */
63 tcc_declaration
, /* A declaration (also serving as variable refs). */
64 tcc_reference
, /* A reference to storage. */
65 tcc_comparison
, /* A comparison expression. */
66 tcc_unary
, /* A unary arithmetic expression. */
67 tcc_binary
, /* A binary arithmetic expression. */
68 tcc_statement
, /* A statement expression, which have side effects
69 but usually no interesting value. */
70 tcc_vl_exp
, /* A function call or other expression with a
71 variable-length operand vector. */
72 tcc_expression
/* Any other expression. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings
[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type
[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
110 #define VAR_OR_FUNCTION_DECL_P(DECL)\
111 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
113 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
114 ascending code order. */
116 #define INDIRECT_REF_P(CODE)\
117 (TREE_CODE (CODE) == INDIRECT_REF \
118 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
119 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
121 /* Nonzero if CODE represents a reference. */
123 #define REFERENCE_CLASS_P(CODE)\
124 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
126 /* Nonzero if CODE represents a comparison. */
128 #define COMPARISON_CLASS_P(CODE)\
129 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
131 /* Nonzero if CODE represents a unary arithmetic expression. */
133 #define UNARY_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
136 /* Nonzero if CODE represents a binary arithmetic expression. */
138 #define BINARY_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
141 /* Nonzero if CODE represents a statement expression. */
143 #define STATEMENT_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
146 /* Nonzero if CODE represents a function call-like expression with a
147 variable-length operand vector. */
149 #define VL_EXP_CLASS_P(CODE)\
150 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
152 /* Nonzero if CODE represents any other expression. */
154 #define EXPRESSION_CLASS_P(CODE)\
155 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
157 /* Returns nonzero iff CODE represents a type or declaration. */
159 #define IS_TYPE_OR_DECL_P(CODE)\
160 (TYPE_P (CODE) || DECL_P (CODE))
162 /* Returns nonzero iff CLASS is the tree-code class of an
165 #define IS_EXPR_CODE_CLASS(CLASS)\
166 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
168 /* Returns nonzero iff NODE is an expression of some kind. */
170 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
172 /* Number of argument-words in each kind of tree-node. */
174 extern const unsigned char tree_code_length
[];
175 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
177 /* Names of tree components. */
179 extern const char *const tree_code_name
[];
181 /* A vectors of trees. */
183 DEF_VEC_ALLOC_P(tree
,gc
);
184 DEF_VEC_ALLOC_P(tree
,heap
);
187 /* Classify which part of the compiler has defined a given builtin function.
188 Note that we assume below that this is no more than two bits. */
197 /* Names for the above. */
198 extern const char *const built_in_class_names
[4];
200 /* Codes that identify the various built in functions
201 so that expand_call can identify them quickly. */
203 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
204 enum built_in_function
206 #include "builtins.def"
208 /* Complex division routines in libgcc. These are done via builtins
209 because emit_library_call_value can't handle complex values. */
210 BUILT_IN_COMPLEX_MUL_MIN
,
211 BUILT_IN_COMPLEX_MUL_MAX
212 = BUILT_IN_COMPLEX_MUL_MIN
213 + MAX_MODE_COMPLEX_FLOAT
214 - MIN_MODE_COMPLEX_FLOAT
,
216 BUILT_IN_COMPLEX_DIV_MIN
,
217 BUILT_IN_COMPLEX_DIV_MAX
218 = BUILT_IN_COMPLEX_DIV_MIN
219 + MAX_MODE_COMPLEX_FLOAT
220 - MIN_MODE_COMPLEX_FLOAT
,
222 /* Upper bound on non-language-specific builtins. */
227 /* Names for the above. */
228 extern const char * built_in_names
[(int) END_BUILTINS
];
230 /* Helper macros for math builtins. */
232 #define BUILTIN_EXP10_P(FN) \
233 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
234 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
236 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
237 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
238 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
240 #define BUILTIN_SQRT_P(FN) \
241 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
243 #define BUILTIN_CBRT_P(FN) \
244 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
246 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
248 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
249 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
250 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
252 /* An array of _DECL trees for the above. */
253 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
254 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
256 /* In an OMP_CLAUSE node. */
258 /* Number of operands and names for each clause. */
259 extern unsigned const char omp_clause_num_ops
[];
260 extern const char * const omp_clause_code_name
[];
262 /* Clause codes. Do not reorder, as this is used to index into the tables
263 omp_clause_num_ops and omp_clause_code_name. */
266 /* Clause zero is special-cased inside the parser
267 (c_parser_omp_variable_list). */
268 OMP_CLAUSE_ERROR
= 0,
270 /* OpenMP clause: private (variable_list). */
273 /* OpenMP clause: shared (variable_list). */
276 /* OpenMP clause: firstprivate (variable_list). */
277 OMP_CLAUSE_FIRSTPRIVATE
,
279 /* OpenMP clause: lastprivate (variable_list). */
280 OMP_CLAUSE_LASTPRIVATE
,
282 /* OpenMP clause: reduction (operator:variable_list).
283 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
284 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
285 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
287 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
288 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
289 OMP_CLAUSE_REDUCTION
,
291 /* OpenMP clause: copyin (variable_list). */
294 /* OpenMP clause: copyprivate (variable_list). */
295 OMP_CLAUSE_COPYPRIVATE
,
297 /* OpenMP clause: if (scalar-expression). */
300 /* OpenMP clause: num_threads (integer-expression). */
301 OMP_CLAUSE_NUM_THREADS
,
303 /* OpenMP clause: schedule. */
306 /* OpenMP clause: nowait. */
309 /* OpenMP clause: ordered. */
312 /* OpenMP clause: default. */
315 /* OpenMP clause: collapse (constant-integer-expression). */
318 /* OpenMP clause: untied. */
322 /* The definition of tree nodes fills the next several pages. */
324 /* A tree node can represent a data type, a variable, an expression
325 or a statement. Each node has a TREE_CODE which says what kind of
326 thing it represents. Some common codes are:
327 INTEGER_TYPE -- represents a type of integers.
328 ARRAY_TYPE -- represents a type of pointer.
329 VAR_DECL -- represents a declared variable.
330 INTEGER_CST -- represents a constant integer value.
331 PLUS_EXPR -- represents a sum (an expression).
333 As for the contents of a tree node: there are some fields
334 that all nodes share. Each TREE_CODE has various special-purpose
335 fields as well. The fields of a node are never accessed directly,
336 always through accessor macros. */
338 /* Every kind of tree node starts with this structure,
339 so all nodes have these fields.
341 See the accessor macros, defined below, for documentation of the
345 struct GTY(()) tree_base
{
346 ENUM_BITFIELD(tree_code
) code
: 16;
348 unsigned side_effects_flag
: 1;
349 unsigned constant_flag
: 1;
350 unsigned addressable_flag
: 1;
351 unsigned volatile_flag
: 1;
352 unsigned readonly_flag
: 1;
353 unsigned unsigned_flag
: 1;
354 unsigned asm_written_flag
: 1;
355 unsigned nowarning_flag
: 1;
357 unsigned used_flag
: 1;
358 unsigned nothrow_flag
: 1;
359 unsigned static_flag
: 1;
360 unsigned public_flag
: 1;
361 unsigned private_flag
: 1;
362 unsigned protected_flag
: 1;
363 unsigned deprecated_flag
: 1;
364 unsigned saturating_flag
: 1;
366 unsigned default_def_flag
: 1;
367 unsigned lang_flag_0
: 1;
368 unsigned lang_flag_1
: 1;
369 unsigned lang_flag_2
: 1;
370 unsigned lang_flag_3
: 1;
371 unsigned lang_flag_4
: 1;
372 unsigned lang_flag_5
: 1;
373 unsigned lang_flag_6
: 1;
375 unsigned visited
: 1;
376 unsigned packed_flag
: 1;
377 unsigned user_align
: 1;
381 union tree_ann_d
*ann
;
384 struct GTY(()) tree_common
{
385 struct tree_base base
;
390 /* The following table lists the uses of each of the above flags and
391 for which types of nodes they are defined.
396 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
398 CONSTRUCTOR, IDENTIFIER_NODE
399 STMT_EXPR, it means we want the result of the enclosed expression
401 CALL_EXPR_TAILCALL in
410 VAR_DECL, FUNCTION_DECL
413 TREE_NO_TRAMPOLINE in
419 TREE_SYMBOL_REFERENCED in
423 TARGET_EXPR, WITH_CLEANUP_EXPR
425 TRY_CATCH_IS_CLEANUP in
431 EH_FILTER_MUST_NOT_THROW in
434 TYPE_REF_CAN_ALIAS_ALL in
435 POINTER_TYPE, REFERENCE_TYPE
443 CALL_CANNOT_INLINE_P in
449 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
452 VAR_DECL, FUNCTION_DECL
458 CALL_EXPR_VA_ARG_PACK in
461 TYPE_CACHED_VALUES_P in
464 SAVE_EXPR_RESOLVED_P in
467 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
468 OMP_CLAUSE_LASTPRIVATE
470 OMP_CLAUSE_PRIVATE_DEBUG in
478 CALL_EXPR_RETURN_SLOT_OPT in
484 OMP_PARALLEL_COMBINED in
486 OMP_CLAUSE_PRIVATE_OUTER_REF in
510 TREE_THIS_VOLATILE in
533 TYPE_SIZES_GIMPLIFIED in
544 REGISTER_DEFS_IN_THIS_STMT in
545 all expressions (tree-into-ssa.c)
550 VAR_DECL, FUNCTION_DECL
551 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
552 BLOCK, SSA_NAME, STRING_CST
555 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
574 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
581 IDENTIFIER_TRANSPARENT_ALIAS in
584 STMT_IN_SSA_EDGE_WORKLIST in
585 all expressions (tree-ssa-propagate.c)
587 TYPE_VECTOR_OPAQUE in
593 all trees (used liberally by many passes)
608 SSA_NAME_IS_DEFAULT_DEF in
613 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
614 enum tree_node_structure_enum
{
615 #include "treestruct.def"
620 /* Define accessors for the fields that all tree nodes have
621 (though some fields are not used for all kinds of nodes). */
623 /* The tree-code says what kind of node it is.
624 Codes are defined in tree.def. */
625 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
626 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
628 /* When checking is enabled, errors will be generated if a tree node
629 is accessed incorrectly. The macros die with a fatal error. */
630 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
632 #define TREE_CHECK(T, CODE) __extension__ \
633 ({ __typeof (T) const __t = (T); \
634 if (TREE_CODE (__t) != (CODE)) \
635 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
639 #define TREE_NOT_CHECK(T, CODE) __extension__ \
640 ({ __typeof (T) const __t = (T); \
641 if (TREE_CODE (__t) == (CODE)) \
642 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
646 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
647 ({ __typeof (T) const __t = (T); \
648 if (TREE_CODE (__t) != (CODE1) \
649 && TREE_CODE (__t) != (CODE2)) \
650 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
651 (CODE1), (CODE2), 0); \
654 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
655 ({ __typeof (T) const __t = (T); \
656 if (TREE_CODE (__t) == (CODE1) \
657 || TREE_CODE (__t) == (CODE2)) \
658 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
659 (CODE1), (CODE2), 0); \
662 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
663 ({ __typeof (T) const __t = (T); \
664 if (TREE_CODE (__t) != (CODE1) \
665 && TREE_CODE (__t) != (CODE2) \
666 && TREE_CODE (__t) != (CODE3)) \
667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
668 (CODE1), (CODE2), (CODE3), 0); \
671 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
672 ({ __typeof (T) const __t = (T); \
673 if (TREE_CODE (__t) == (CODE1) \
674 || TREE_CODE (__t) == (CODE2) \
675 || TREE_CODE (__t) == (CODE3)) \
676 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
677 (CODE1), (CODE2), (CODE3), 0); \
680 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
681 ({ __typeof (T) const __t = (T); \
682 if (TREE_CODE (__t) != (CODE1) \
683 && TREE_CODE (__t) != (CODE2) \
684 && TREE_CODE (__t) != (CODE3) \
685 && TREE_CODE (__t) != (CODE4)) \
686 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
687 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
690 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
691 ({ __typeof (T) const __t = (T); \
692 if (TREE_CODE (__t) == (CODE1) \
693 || TREE_CODE (__t) == (CODE2) \
694 || TREE_CODE (__t) == (CODE3) \
695 || TREE_CODE (__t) == (CODE4)) \
696 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
697 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
700 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
701 ({ __typeof (T) const __t = (T); \
702 if (TREE_CODE (__t) != (CODE1) \
703 && TREE_CODE (__t) != (CODE2) \
704 && TREE_CODE (__t) != (CODE3) \
705 && TREE_CODE (__t) != (CODE4) \
706 && TREE_CODE (__t) != (CODE5)) \
707 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
708 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
711 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
712 ({ __typeof (T) const __t = (T); \
713 if (TREE_CODE (__t) == (CODE1) \
714 || TREE_CODE (__t) == (CODE2) \
715 || TREE_CODE (__t) == (CODE3) \
716 || TREE_CODE (__t) == (CODE4) \
717 || TREE_CODE (__t) == (CODE5)) \
718 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
722 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
723 ({ __typeof (T) const __t = (T); \
724 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
725 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
729 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
730 ({ __typeof (T) const __t = (T); \
731 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
732 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
736 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
737 ({ __typeof (T) const __t = (T); \
738 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
739 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
743 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 if (TREE_CODE (__t) != OMP_CLAUSE) \
746 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
748 if (__t->omp_clause.code != (CODE)) \
749 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
753 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
754 ({ __typeof (T) const __t = (T); \
755 if (TREE_CODE (__t) != OMP_CLAUSE) \
756 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
758 if ((int) __t->omp_clause.code < (int) (CODE1) \
759 || (int) __t->omp_clause.code > (int) (CODE2)) \
760 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
761 __FUNCTION__, (CODE1), (CODE2)); \
764 /* These checks have to be special cased. */
765 #define EXPR_CHECK(T) __extension__ \
766 ({ __typeof (T) const __t = (T); \
767 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
768 if (!IS_EXPR_CODE_CLASS (__c)) \
769 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
773 /* These checks have to be special cased. */
774 #define NON_TYPE_CHECK(T) __extension__ \
775 ({ __typeof (T) const __t = (T); \
777 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
781 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
782 (*({__typeof (T) const __t = (T); \
783 const int __i = (I); \
784 if (TREE_CODE (__t) != TREE_VEC) \
785 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
787 if (__i < 0 || __i >= __t->vec.length) \
788 tree_vec_elt_check_failed (__i, __t->vec.length, \
789 __FILE__, __LINE__, __FUNCTION__); \
790 &__t->vec.a[__i]; }))
792 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
793 (*({__typeof (T) const __t = (T); \
794 const int __i = (I); \
795 if (TREE_CODE (__t) != OMP_CLAUSE) \
796 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
798 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
799 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
801 &__t->omp_clause.ops[__i]; }))
803 /* Special checks for TREE_OPERANDs. */
804 #define TREE_OPERAND_CHECK(T, I) __extension__ \
805 (*({__typeof (T) const __t = EXPR_CHECK (T); \
806 const int __i = (I); \
807 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
808 tree_operand_check_failed (__i, __t, \
809 __FILE__, __LINE__, __FUNCTION__); \
810 &__t->exp.operands[__i]; }))
812 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
813 (*({__typeof (T) const __t = (T); \
814 const int __i = (I); \
815 if (TREE_CODE (__t) != CODE) \
816 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
817 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
818 tree_operand_check_failed (__i, __t, \
819 __FILE__, __LINE__, __FUNCTION__); \
820 &__t->exp.operands[__i]; }))
822 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
824 ({__typeof (T) const __t = (T); \
825 const int __i = (I); \
826 if (TREE_CODE (__t) != (CODE)) \
827 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
828 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
829 tree_operand_check_failed (__i, __t, \
830 __FILE__, __LINE__, __FUNCTION__); \
831 &__t->exp.operands[__i]; }))
833 /* Nodes are chained together for many purposes.
834 Types are chained together to record them for being output to the debugger
835 (see the function `chain_type').
836 Decls in the same scope are chained together to record the contents
838 Statement nodes for successive statements used to be chained together.
839 Often lists of things are represented by TREE_LIST nodes that
840 are chained together. */
842 #define TREE_CHAIN(NODE) __extension__ \
843 (*({__typeof (NODE) const __t = (NODE); \
844 &__t->common.chain; }))
846 /* In all nodes that are expressions, this is the data type of the expression.
847 In POINTER_TYPE nodes, this is the type that the pointer points to.
848 In ARRAY_TYPE nodes, this is the type of the elements.
849 In VECTOR_TYPE nodes, this is the type of the elements. */
850 #define TREE_TYPE(NODE) __extension__ \
851 (*({__typeof (NODE) const __t = (NODE); \
852 &__t->common.type; }))
854 extern void tree_contains_struct_check_failed (const_tree
,
855 const enum tree_node_structure_enum
,
856 const char *, int, const char *)
859 extern void tree_check_failed (const_tree
, const char *, int, const char *,
860 ...) ATTRIBUTE_NORETURN
;
861 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
862 ...) ATTRIBUTE_NORETURN
;
863 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
864 const char *, int, const char *)
866 extern void tree_range_check_failed (const_tree
, const char *, int,
867 const char *, enum tree_code
,
869 extern void tree_not_class_check_failed (const_tree
,
870 const enum tree_code_class
,
871 const char *, int, const char *)
873 extern void tree_vec_elt_check_failed (int, int, const char *,
876 extern void phi_node_elt_check_failed (int, int, const char *,
879 extern void tree_operand_check_failed (int, const_tree
,
880 const char *, int, const char *)
882 extern void omp_clause_check_failed (const_tree
, const char *, int,
883 const char *, enum omp_clause_code
)
885 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
888 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
889 const char *, enum omp_clause_code
,
890 enum omp_clause_code
)
893 #else /* not ENABLE_TREE_CHECKING, or not gcc */
895 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
896 #define TREE_CHECK(T, CODE) (T)
897 #define TREE_NOT_CHECK(T, CODE) (T)
898 #define TREE_CHECK2(T, CODE1, CODE2) (T)
899 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
900 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
901 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
902 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
903 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
904 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
905 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
906 #define TREE_CLASS_CHECK(T, CODE) (T)
907 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
908 #define EXPR_CHECK(T) (T)
909 #define NON_TYPE_CHECK(T) (T)
910 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
911 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
912 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
913 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
914 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
915 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
916 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
918 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
919 #define TREE_TYPE(NODE) ((NODE)->common.type)
923 #define TREE_BLOCK(NODE) *(tree_block (NODE))
925 #include "tree-check.h"
927 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
928 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
929 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
930 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
931 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
932 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
933 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
934 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
935 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
936 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
937 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
939 #define RECORD_OR_UNION_CHECK(T) \
940 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
941 #define NOT_RECORD_OR_UNION_CHECK(T) \
942 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
944 #define NUMERICAL_TYPE_CHECK(T) \
945 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
948 /* Here is how primitive or already-canonicalized types' hash codes
950 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
952 /* A simple hash function for an arbitrary tree node. This must not be
953 used in hash tables which are saved to a PCH. */
954 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
956 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
957 #define CONVERT_EXPR_CODE_P(CODE) \
958 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
960 /* Similarly, but accept an expressions instead of a tree code. */
961 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
963 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
965 #define CASE_CONVERT \
969 /* Given an expression as a tree, strip any conversion that generates
970 no instruction. Accepts both tree and const_tree arguments since
971 we are not modifying the tree itself. */
973 #define STRIP_NOPS(EXP) \
974 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
976 /* Like STRIP_NOPS, but don't let the signedness change either. */
978 #define STRIP_SIGN_NOPS(EXP) \
979 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
981 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
983 #define STRIP_TYPE_NOPS(EXP) \
984 while ((CONVERT_EXPR_P (EXP) \
985 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
986 && TREE_OPERAND (EXP, 0) != error_mark_node \
987 && (TREE_TYPE (EXP) \
988 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
989 (EXP) = TREE_OPERAND (EXP, 0)
991 /* Remove unnecessary type conversions according to
992 tree_ssa_useless_type_conversion. */
994 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
995 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
997 /* Nonzero if TYPE represents an integral type. Note that we do not
998 include COMPLEX types here. Keep these checks in ascending code
1001 #define INTEGRAL_TYPE_P(TYPE) \
1002 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1003 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1004 || TREE_CODE (TYPE) == INTEGER_TYPE)
1006 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1008 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1009 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1011 /* Nonzero if TYPE represents a saturating fixed-point type. */
1013 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1014 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1016 /* Nonzero if TYPE represents a fixed-point type. */
1018 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1020 /* Nonzero if TYPE represents a scalar floating-point type. */
1022 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1024 /* Nonzero if TYPE represents a complex floating-point type. */
1026 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1027 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1028 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1030 /* Nonzero if TYPE represents a vector floating-point type. */
1032 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1033 (TREE_CODE (TYPE) == VECTOR_TYPE \
1034 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1036 /* Nonzero if TYPE represents a floating-point type, including complex
1037 and vector floating-point types. The vector and complex check does
1038 not use the previous two macros to enable early folding. */
1040 #define FLOAT_TYPE_P(TYPE) \
1041 (SCALAR_FLOAT_TYPE_P (TYPE) \
1042 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1043 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1044 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1046 /* Nonzero if TYPE represents a decimal floating-point type. */
1047 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1048 (SCALAR_FLOAT_TYPE_P (TYPE) \
1049 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1051 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1052 Keep these checks in ascending code order. */
1054 #define AGGREGATE_TYPE_P(TYPE) \
1055 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1056 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1058 /* Nonzero if TYPE represents a pointer or reference type.
1059 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1060 ascending code order. */
1062 #define POINTER_TYPE_P(TYPE) \
1063 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1065 /* Nonzero if this type is a complete type. */
1066 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1068 /* Nonzero if this type is the (possibly qualified) void type. */
1069 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1071 /* Nonzero if this type is complete or is cv void. */
1072 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1073 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1075 /* Nonzero if this type is complete or is an array with unspecified bound. */
1076 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1077 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1080 /* Define many boolean fields that all tree nodes have. */
1082 /* In VAR_DECL nodes, nonzero means address of this is needed.
1083 So it cannot be in a register.
1084 In a FUNCTION_DECL, nonzero means its address is needed.
1085 So it must be compiled even if it is an inline function.
1086 In a FIELD_DECL node, it means that the programmer is permitted to
1087 construct the address of this field. This is used for aliasing
1088 purposes: see record_component_aliases.
1089 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1090 In LABEL_DECL nodes, it means a goto for this label has been seen
1091 from a place outside all binding contours that restore stack levels.
1092 In ..._TYPE nodes, it means that objects of this type must
1093 be fully addressable. This means that pieces of this
1094 object cannot go into register parameters, for example.
1095 In IDENTIFIER_NODEs, this means that some extern decl for this name
1096 had its address taken. That matters for inline functions. */
1097 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1099 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1100 exit of a function. Calls for which this is true are candidates for tail
1101 call optimizations. */
1102 #define CALL_EXPR_TAILCALL(NODE) \
1103 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1105 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1106 CASE_LOW operand has been processed. */
1107 #define CASE_LOW_SEEN(NODE) \
1108 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1110 #define PREDICT_EXPR_OUTCOME(NODE) \
1111 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1112 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1113 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1114 #define PREDICT_EXPR_PREDICTOR(NODE) \
1115 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1117 /* In a VAR_DECL, nonzero means allocate static storage.
1118 In a FUNCTION_DECL, nonzero if function has been defined.
1119 In a CONSTRUCTOR, nonzero means allocate static storage. */
1120 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1122 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1123 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1125 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1126 should only be executed if an exception is thrown, not on normal exit
1128 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1130 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1131 separate cleanup in honor_protect_cleanup_actions. */
1132 #define TRY_CATCH_IS_CLEANUP(NODE) \
1133 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1135 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1136 CASE_HIGH operand has been processed. */
1137 #define CASE_HIGH_SEEN(NODE) \
1138 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1140 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1141 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1143 /* In an expr node (usually a conversion) this means the node was made
1144 implicitly and should not lead to any sort of warning. In a decl node,
1145 warnings concerning the decl should be suppressed. This is used at
1146 least for used-before-set warnings, and it set after one warning is
1148 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1150 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1151 this string as an argument. */
1152 #define TREE_SYMBOL_REFERENCED(NODE) \
1153 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1155 /* Nonzero in a pointer or reference type means the data pointed to
1156 by this type can alias anything. */
1157 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1158 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1160 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1161 #define MOVE_NONTEMPORAL(NODE) \
1162 (EXPR_CHECK (NODE)->base.static_flag)
1164 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1165 there was an overflow in folding. */
1167 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1169 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1171 #define TREE_OVERFLOW_P(EXPR) \
1172 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1174 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1175 nonzero means name is to be accessible from outside this translation unit.
1176 In an IDENTIFIER_NODE, nonzero means an external declaration
1177 accessible from outside this translation unit was previously seen
1178 for this name in an inner scope. */
1179 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1181 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1182 of cached values, or is something else. */
1183 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1185 /* In a SAVE_EXPR, indicates that the original expression has already
1186 been substituted with a VAR_DECL that contains the value. */
1187 #define SAVE_EXPR_RESOLVED_P(NODE) \
1188 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1190 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1192 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1193 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1195 /* In any expression, decl, or constant, nonzero means it has side effects or
1196 reevaluation of the whole expression could produce a different value.
1197 This is set if any subexpression is a function call, a side effect or a
1198 reference to a volatile variable. In a ..._DECL, this is set only if the
1199 declaration said `volatile'. This will never be set for a constant. */
1200 #define TREE_SIDE_EFFECTS(NODE) \
1201 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1203 /* In a LABEL_DECL, nonzero means this label had its address taken
1204 and therefore can never be deleted and is a jump target for
1206 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1208 /* Nonzero means this expression is volatile in the C sense:
1209 its address should be of type `volatile WHATEVER *'.
1210 In other words, the declared item is volatile qualified.
1211 This is used in _DECL nodes and _REF nodes.
1212 On a FUNCTION_DECL node, this means the function does not
1213 return normally. This is the same effect as setting
1214 the attribute noreturn on the function in C.
1216 In a ..._TYPE node, means this type is volatile-qualified.
1217 But use TYPE_VOLATILE instead of this macro when the node is a type,
1218 because eventually we may make that a different bit.
1220 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1221 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1223 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1224 accessing the memory pointed to won't generate a trap. However,
1225 this only applies to an object when used appropriately: it doesn't
1226 mean that writing a READONLY mem won't trap. Similarly for
1227 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1229 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1230 (or slice of the array) always belongs to the range of the array.
1231 I.e. that the access will not trap, provided that the access to
1232 the base to the array will not trap. */
1233 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1235 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1236 nonzero means it may not be the lhs of an assignment.
1237 Nonzero in a FUNCTION_DECL means this function should be treated
1238 as "const" function (can only read its arguments). */
1239 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1241 /* Value of expression is constant. Always on in all ..._CST nodes. May
1242 also appear in an expression or decl where the value is constant. */
1243 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1245 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1246 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1247 (TYPE_CHECK (NODE)->base.constant_flag)
1249 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1250 #define DECL_UNSIGNED(NODE) \
1251 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1253 /* In integral and pointer types, means an unsigned type. */
1254 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1256 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1257 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1258 This is interesting in an inline function, since it might not need
1259 to be compiled separately.
1260 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1261 if the sdb debugging info for the type has been written.
1262 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1263 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1265 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1267 /* Nonzero in a _DECL if the name is used in its scope.
1268 Nonzero in an expr node means inhibit warning if value is unused.
1269 In IDENTIFIER_NODEs, this means that some extern decl for this name
1271 In a BLOCK, this means that the block contains variables that are used. */
1272 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1274 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1275 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1276 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1278 /* In a CALL_EXPR, means that it's safe to use the target of the call
1279 expansion as the return slot for a call that returns in memory. */
1280 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1281 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1283 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1284 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1286 #define DECL_BY_REFERENCE(NODE) \
1287 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1288 RESULT_DECL)->decl_common.decl_by_reference_flag)
1290 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1291 thunked-to function. */
1292 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1294 /* In a type, nonzero means that all objects of the type are guaranteed by the
1295 language or front-end to be properly aligned, so we can indicate that a MEM
1296 of this type is aligned at least to the alignment of the type, even if it
1297 doesn't appear that it is. We see this, for example, in object-oriented
1298 languages where a tag field may show this is an object of a more-aligned
1299 variant of the more generic type.
1301 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1303 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1305 /* Used in classes in C++. */
1306 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1307 /* Used in classes in C++. */
1308 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1310 /* Nonzero in a _DECL if the use of the name is defined as a
1311 deprecated feature by __attribute__((deprecated)). */
1312 #define TREE_DEPRECATED(NODE) \
1313 ((NODE)->base.deprecated_flag)
1315 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1316 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1317 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1318 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1320 /* In fixed-point types, means a saturating type. */
1321 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1323 /* These flags are available for each language front end to use internally. */
1324 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1325 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1326 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1327 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1328 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1329 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1330 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1332 /* Define additional fields and accessors for nodes representing constants. */
1334 /* In an INTEGER_CST node. These two together make a 2-word integer.
1335 If the data type is signed, the value is sign-extended to 2 words
1336 even though not all of them may really be in use.
1337 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1338 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1339 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1340 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1342 #define INT_CST_LT(A, B) \
1343 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1344 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1345 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1347 #define INT_CST_LT_UNSIGNED(A, B) \
1348 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1349 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1350 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1351 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1352 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1354 struct GTY(()) tree_int_cst
{
1355 struct tree_common common
;
1359 /* In a REAL_CST node. struct real_value is an opaque entity, with
1360 manipulators defined in real.h. We don't want tree.h depending on
1361 real.h and transitively on tm.h. */
1364 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1365 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1367 struct GTY(()) tree_real_cst
{
1368 struct tree_common common
;
1369 struct real_value
* real_cst_ptr
;
1372 /* In a FIXED_CST node. */
1375 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1376 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1378 struct GTY(()) tree_fixed_cst
{
1379 struct tree_common common
;
1380 struct fixed_value
* fixed_cst_ptr
;
1383 /* In a STRING_CST */
1384 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1385 #define TREE_STRING_POINTER(NODE) \
1386 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1388 struct GTY(()) tree_string
{
1389 struct tree_common common
;
1394 /* In a COMPLEX_CST node. */
1395 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1396 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1398 struct GTY(()) tree_complex
{
1399 struct tree_common common
;
1404 /* In a VECTOR_CST node. */
1405 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1407 struct GTY(()) tree_vector
{
1408 struct tree_common common
;
1414 /* Define fields and accessors for some special-purpose tree nodes. */
1416 #define IDENTIFIER_LENGTH(NODE) \
1417 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1418 #define IDENTIFIER_POINTER(NODE) \
1419 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1420 #define IDENTIFIER_HASH_VALUE(NODE) \
1421 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1423 /* Translate a hash table identifier pointer to a tree_identifier
1424 pointer, and vice versa. */
1426 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1427 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1428 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1430 struct GTY(()) tree_identifier
{
1431 struct tree_common common
;
1432 struct ht_identifier id
;
1435 /* In a TREE_LIST node. */
1436 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1437 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1439 struct GTY(()) tree_list
{
1440 struct tree_common common
;
1445 /* In a TREE_VEC node. */
1446 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1447 #define TREE_VEC_END(NODE) \
1448 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1450 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1452 struct GTY(()) tree_vec
{
1453 struct tree_common common
;
1455 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1458 /* In a CONSTRUCTOR node. */
1459 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1460 #define CONSTRUCTOR_ELT(NODE,IDX) \
1461 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1462 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1464 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1465 value of each element (stored within VAL). IX must be a scratch variable
1466 of unsigned integer type. */
1467 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1468 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1470 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1474 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1475 the value of each element (stored within VAL) and its index (stored
1476 within INDEX). IX must be a scratch variable of unsigned integer type. */
1477 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1478 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1480 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1481 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1485 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1486 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1488 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1489 _ce___->index = INDEX; \
1490 _ce___->value = VALUE; \
1493 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1494 constructor output purposes. */
1495 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1496 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1498 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1499 element. INDEX can optionally design the position of VALUE: in arrays,
1500 it is the index where VALUE has to be placed; in structures, it is the
1501 FIELD_DECL of the member. */
1502 typedef struct GTY(()) constructor_elt_d
{
1507 DEF_VEC_O(constructor_elt
);
1508 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1510 struct GTY(()) tree_constructor
{
1511 struct tree_common common
;
1512 VEC(constructor_elt
,gc
) *elts
;
1515 /* Define fields and accessors for some nodes that represent expressions. */
1517 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1518 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1519 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1520 && integer_zerop (TREE_OPERAND (NODE, 0)))
1522 /* In ordinary expression nodes. */
1523 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1524 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1526 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1527 length. Its value includes the length operand itself; that is,
1528 the minimum valid length is 1.
1529 Note that we have to bypass the use of TREE_OPERAND to access
1530 that field to avoid infinite recursion in expanding the macros. */
1531 #define VL_EXP_OPERAND_LENGTH(NODE) \
1532 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1534 /* In a LOOP_EXPR node. */
1535 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1537 /* The source location of this expression. Non-tree_exp nodes such as
1538 decls and constants can be shared among multiple locations, so
1540 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1541 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1542 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1543 #define EXPR_LOCUS(NODE) (EXPR_P (NODE) \
1544 ? CONST_CAST (source_location *, &(NODE)->exp.locus) \
1545 : (source_location *) NULL)
1546 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1547 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1548 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1550 /* True if a tree is an expression or statement that can have a
1552 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1554 extern void protected_set_expr_location (tree
, location_t
);
1556 /* In a TARGET_EXPR node. */
1557 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1558 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1559 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1561 /* DECL_EXPR accessor. This gives access to the DECL associated with
1562 the given declaration statement. */
1563 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1565 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1567 /* COMPOUND_LITERAL_EXPR accessors. */
1568 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1569 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1570 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1571 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1573 /* SWITCH_EXPR accessors. These give access to the condition, body and
1574 original condition type (before any compiler conversions)
1575 of the switch statement, respectively. */
1576 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1577 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1578 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1580 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1581 of a case label, respectively. */
1582 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1583 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1584 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1586 /* The operands of a TARGET_MEM_REF. */
1587 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1588 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1589 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1590 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1591 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1592 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1594 /* The operands of a BIND_EXPR. */
1595 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1596 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1597 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1599 /* GOTO_EXPR accessor. This gives access to the label associated with
1600 a goto statement. */
1601 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1603 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1604 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1605 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1607 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1608 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1609 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1610 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1611 /* Nonzero if we want to create an ASM_INPUT instead of an
1612 ASM_OPERAND with no operands. */
1613 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1614 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1616 /* COND_EXPR accessors. */
1617 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1618 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1619 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1621 /* Accessors for the chains of recurrences. */
1622 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1623 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1624 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1625 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1627 /* LABEL_EXPR accessor. This gives access to the label associated with
1628 the given label expression. */
1629 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1631 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1632 accessors for SSA operands. */
1634 /* CATCH_EXPR accessors. */
1635 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1636 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1638 /* EH_FILTER_EXPR accessors. */
1639 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1640 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1641 #define EH_FILTER_MUST_NOT_THROW(NODE) \
1642 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
1644 /* OBJ_TYPE_REF accessors. */
1645 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1646 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1647 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1649 /* ASSERT_EXPR accessors. */
1650 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1651 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1653 /* CALL_EXPR accessors.
1655 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1656 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1657 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1658 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1659 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1661 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1662 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1663 the argument count is zero when checking is enabled. Instead, do
1664 the pointer arithmetic to advance past the 3 fixed operands in a
1665 CALL_EXPR. That produces a valid pointer to just past the end of the
1666 operand array, even if it's not valid to dereference it. */
1667 #define CALL_EXPR_ARGP(NODE) \
1668 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1670 /* OpenMP directive and clause accessors. */
1672 #define OMP_BODY(NODE) \
1673 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1674 #define OMP_CLAUSES(NODE) \
1675 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1677 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1678 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1680 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1681 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1683 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1684 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1685 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1687 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1688 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1689 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1690 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1691 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1692 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1694 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1695 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1697 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1699 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1700 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1702 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1704 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1706 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1707 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1709 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1710 #define OMP_CLAUSE_DECL(NODE) \
1711 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1712 OMP_CLAUSE_PRIVATE, \
1713 OMP_CLAUSE_COPYPRIVATE), 0)
1714 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1715 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1716 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1718 /* True on an OMP_SECTION statement that was the last lexical member.
1719 This status is meaningful in the implementation of lastprivate. */
1720 #define OMP_SECTION_LAST(NODE) \
1721 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1723 /* True on an OMP_PARALLEL statement if it represents an explicit
1724 combined parallel work-sharing constructs. */
1725 #define OMP_PARALLEL_COMBINED(NODE) \
1726 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1728 /* True on a PRIVATE clause if its decl is kept around for debugging
1729 information only and its DECL_VALUE_EXPR is supposed to point
1730 to what it has been remapped to. */
1731 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1732 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1734 /* True on a PRIVATE clause if ctor needs access to outer region's
1736 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1737 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1739 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1740 decl is present in the chain. */
1741 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1742 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1743 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1744 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1745 OMP_CLAUSE_LASTPRIVATE),\
1747 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1748 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1750 #define OMP_CLAUSE_IF_EXPR(NODE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1752 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1753 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1754 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1755 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1757 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1759 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1760 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1761 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1762 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1764 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1765 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1766 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1767 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1768 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1769 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1770 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1771 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1772 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1773 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1774 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1775 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1777 enum omp_clause_schedule_kind
1779 OMP_CLAUSE_SCHEDULE_STATIC
,
1780 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1781 OMP_CLAUSE_SCHEDULE_GUIDED
,
1782 OMP_CLAUSE_SCHEDULE_AUTO
,
1783 OMP_CLAUSE_SCHEDULE_RUNTIME
1786 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1787 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1789 enum omp_clause_default_kind
1791 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1792 OMP_CLAUSE_DEFAULT_SHARED
,
1793 OMP_CLAUSE_DEFAULT_NONE
,
1794 OMP_CLAUSE_DEFAULT_PRIVATE
,
1795 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1798 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1799 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1801 struct GTY(()) tree_exp
{
1802 struct tree_common common
;
1805 tree
GTY ((special ("tree_exp"),
1806 desc ("TREE_CODE ((tree) &%0)")))
1810 /* SSA_NAME accessors. */
1812 /* Returns the variable being referenced. Once released, this is the
1813 only field that can be relied upon. */
1814 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1816 /* Returns the statement which defines this SSA name. */
1817 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1819 /* Returns the SSA version number of this SSA name. Note that in
1820 tree SSA, version numbers are not per variable and may be recycled. */
1821 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1823 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1824 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1826 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1827 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1829 /* Nonzero if this SSA_NAME expression is currently on the free list of
1830 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1831 has no meaning for an SSA_NAME. */
1832 #define SSA_NAME_IN_FREE_LIST(NODE) \
1833 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1835 /* Nonzero if this SSA_NAME is the default definition for the
1836 underlying symbol. A default SSA name is created for symbol S if
1837 the very first reference to S in the function is a read operation.
1838 Default definitions are always created by an empty statement and
1839 belong to no basic block. */
1840 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1841 SSA_NAME_CHECK (NODE)->base.default_def_flag
1843 /* Attributes for SSA_NAMEs for pointer-type variables. */
1844 #define SSA_NAME_PTR_INFO(N) \
1845 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1847 #ifndef _TREE_FLOW_H
1848 struct ptr_info_def
;
1853 /* Immediate use linking structure. This structure is used for maintaining
1854 a doubly linked list of uses of an SSA_NAME. */
1855 typedef struct GTY(()) ssa_use_operand_d
{
1856 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1857 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1858 /* Immediate uses for a given SSA name are maintained as a cyclic
1859 list. To recognize the root of this list, the location field
1860 needs to point to the original SSA name. Since statements and
1861 SSA names are of different data types, we need this union. See
1862 the explanation in struct immediate_use_iterator_d. */
1863 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1864 tree
*GTY((skip(""))) use
;
1865 } ssa_use_operand_t
;
1867 /* Return the immediate_use information for an SSA_NAME. */
1868 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1870 struct GTY(()) tree_ssa_name
{
1871 struct tree_common common
;
1873 /* _DECL wrapped by this SSA name. */
1876 /* Statement that defines this SSA name. */
1879 /* SSA version number. */
1880 unsigned int version
;
1882 /* Pointer attributes used for alias analysis. */
1883 struct ptr_info_def
*ptr_info
;
1885 /* Immediate uses list for this SSA_NAME. */
1886 struct ssa_use_operand_d imm_uses
;
1889 struct GTY(()) phi_arg_d
{
1890 /* imm_use MUST be the first element in struct because we do some
1891 pointer arithmetic with it. See phi_arg_index_from_use. */
1892 struct ssa_use_operand_d imm_use
;
1897 #define OMP_CLAUSE_CODE(NODE) \
1898 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1900 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1901 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1903 #define OMP_CLAUSE_CODE(NODE) \
1904 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1906 #define OMP_CLAUSE_OPERAND(NODE, I) \
1907 OMP_CLAUSE_ELT_CHECK (NODE, I)
1909 struct GTY(()) tree_omp_clause
{
1910 struct tree_common common
;
1912 enum omp_clause_code code
;
1913 union omp_clause_subcode
{
1914 enum omp_clause_default_kind default_kind
;
1915 enum omp_clause_schedule_kind schedule_kind
;
1916 enum tree_code reduction_code
;
1917 } GTY ((skip
)) subcode
;
1919 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1921 gimple_seq gimple_reduction_init
;
1922 gimple_seq gimple_reduction_merge
;
1924 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
1928 struct varray_head_tag
;
1930 /* In a BLOCK node. */
1931 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1932 #define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1933 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1934 #define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1935 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1936 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1937 /* Note: when changing this, make sure to find the places
1938 that use chainon or nreverse. */
1939 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1940 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1941 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1943 /* An index number for this block. These values are not guaranteed to
1944 be unique across functions -- whether or not they are depends on
1945 the debugging output format in use. */
1946 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1948 /* If block reordering splits a lexical block into discontiguous
1949 address ranges, we'll make a copy of the original block.
1951 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1952 In that case, we have one source block that has been replicated
1953 (through inlining or unrolling) into many logical blocks, and that
1954 these logical blocks have different physical variables in them.
1956 In this case, we have one logical block split into several
1957 non-contiguous address ranges. Most debug formats can't actually
1958 represent this idea directly, so we fake it by creating multiple
1959 logical blocks with the same variables in them. However, for those
1960 that do support non-contiguous regions, these allow the original
1961 logical block to be reconstructed, along with the set of address
1964 One of the logical block fragments is arbitrarily chosen to be
1965 the ORIGIN. The other fragments will point to the origin via
1966 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
1967 be null. The list of fragments will be chained through
1968 BLOCK_FRAGMENT_CHAIN from the origin. */
1970 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1971 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
1973 /* For an inlined function, this gives the location where it was called
1974 from. This is only set in the top level block, which corresponds to the
1975 inlined function scope. This is used in the debug output routines. */
1977 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1979 struct GTY(()) tree_block
{
1980 struct tree_common common
;
1982 unsigned abstract_flag
: 1;
1983 unsigned block_num
: 31;
1988 VEC(tree
,gc
) *nonlocalized_vars
;
1992 tree abstract_origin
;
1993 tree fragment_origin
;
1994 tree fragment_chain
;
1997 /* Define fields and accessors for nodes representing data types. */
1999 /* See tree.def for documentation of the use of these fields.
2000 Look at the documentation of the various ..._TYPE tree codes.
2002 Note that the type.values, type.minval, and type.maxval fields are
2003 overloaded and used for different macros in different kinds of types.
2004 Each macro must check to ensure the tree node is of the proper kind of
2005 type. Note also that some of the front-ends also overload these fields,
2006 so they must be checked as well. */
2008 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2009 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2010 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2011 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2012 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2013 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2014 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2015 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2016 (INTEGER_TYPE_CHECK (NODE)->type.values \
2017 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2018 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2019 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2020 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2021 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2022 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2023 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2024 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2025 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2026 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2027 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2028 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2029 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2030 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2031 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2032 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2033 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2034 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2035 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2036 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2038 /* Vector types need to check target flags to determine type. */
2039 extern enum machine_mode
vector_type_mode (const_tree
);
2040 #define TYPE_MODE(NODE) \
2041 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2042 ? vector_type_mode (NODE) : (NODE)->type.mode)
2043 #define SET_TYPE_MODE(NODE, MODE) \
2044 (TYPE_CHECK (NODE)->type.mode = (MODE))
2046 /* The "canonical" type for this type node, which can be used to
2047 compare the type for equality with another type. If two types are
2048 equal (based on the semantics of the language), then they will have
2049 equivalent TYPE_CANONICAL entries.
2051 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2052 be used for comparison against other types. Instead, the type is
2053 said to require structural equality checks, described in
2054 TYPE_STRUCTURAL_EQUALITY_P. */
2055 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2056 /* Indicates that the type node requires structural equality
2057 checks. The compiler will need to look at the composition of the
2058 type to determine whether it is equal to another type, rather than
2059 just comparing canonical type pointers. For instance, we would need
2060 to look at the return and parameter types of a FUNCTION_TYPE
2062 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2063 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2064 type node requires structural equality. */
2065 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2066 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2067 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2068 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2070 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2071 in the debugging output. We use this to describe a vector as a
2072 structure containing an array. */
2073 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2075 /* For record and union types, information about this type, as a base type
2077 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2079 /* For non record and union types, used in a language-dependent way. */
2080 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2082 /* The (language-specific) typed-based alias set for this type.
2083 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2084 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2085 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2086 type can alias objects of any type. */
2087 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2089 /* Nonzero iff the typed-based alias set for this type has been
2091 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2093 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2095 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2097 /* The alignment necessary for objects of this type.
2098 The value is an int, measured in bits. */
2099 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2101 /* 1 if the alignment for this type was requested by "aligned" attribute,
2102 0 if it is the default for this type. */
2103 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2105 /* The alignment for NODE, in bytes. */
2106 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2108 /* If your language allows you to declare types, and you want debug info
2109 for them, then you need to generate corresponding TYPE_DECL nodes.
2110 These "stub" TYPE_DECL nodes have no name, and simply point at the
2111 type node. You then set the TYPE_STUB_DECL field of the type node
2112 to point back at the TYPE_DECL node. This allows the debug routines
2113 to know that the two nodes represent the same type, so that we only
2114 get one debug info record for them. */
2115 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2117 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2118 has BLKmode only because it lacks the alignment requirement for
2120 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2122 /* In an INTEGER_TYPE, it means the type represents a size. We use
2123 this both for validity checking and to permit optimizations that
2124 are unsafe for other types. Note that the C `size_t' type should
2125 *not* have this flag set. The `size_t' type is simply a typedef
2126 for an ordinary integer type that happens to be the type of an
2127 expression returned by `sizeof'; `size_t' has no special
2128 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2129 always actual sizes. */
2130 #define TYPE_IS_SIZETYPE(NODE) \
2131 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2133 /* Nonzero in a type considered volatile as a whole. */
2134 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2136 /* Means this type is const-qualified. */
2137 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2139 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2141 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2143 /* There is a TYPE_QUAL value for each type qualifier. They can be
2144 combined by bitwise-or to form the complete set of qualifiers for a
2147 #define TYPE_UNQUALIFIED 0x0
2148 #define TYPE_QUAL_CONST 0x1
2149 #define TYPE_QUAL_VOLATILE 0x2
2150 #define TYPE_QUAL_RESTRICT 0x4
2152 /* The set of type qualifiers for this type. */
2153 #define TYPE_QUALS(NODE) \
2154 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2155 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2156 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2158 /* These flags are available for each language front end to use internally. */
2159 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2160 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2161 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2162 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2163 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2164 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2165 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2167 /* Used to keep track of visited nodes in tree traversals. This is set to
2168 0 by copy_node and make_node. */
2169 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2171 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2172 that distinguish string from array of char).
2173 If set in a INTEGER_TYPE, indicates a character type. */
2174 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2176 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2177 object of the given ARRAY_TYPE. This allows temporaries to be
2179 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2180 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2182 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2183 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2184 (((unsigned HOST_WIDE_INT) 1) \
2185 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2187 /* Set precision to n when we have 2^n sub-parts of the vector. */
2188 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2189 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2191 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2192 about missing conversions to other vector types of the same size. */
2193 #define TYPE_VECTOR_OPAQUE(NODE) \
2194 (VECTOR_TYPE_CHECK (NODE)->base.deprecated_flag)
2196 /* Indicates that objects of this type must be initialized by calling a
2197 function when they are created. */
2198 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2199 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2201 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2202 the same way that the first union alternative would be passed. */
2203 #define TYPE_TRANSPARENT_UNION(NODE) \
2204 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2206 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2207 address of a component of the type. This is the counterpart of
2208 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2209 #define TYPE_NONALIASED_COMPONENT(NODE) \
2210 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2212 /* Indicated that objects of this type should be laid out in as
2213 compact a way as possible. */
2214 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2216 /* Used by type_contains_placeholder_p to avoid recomputation.
2217 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2218 this field directly. */
2219 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2220 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2224 struct GTY(()) tree_type
{
2225 struct tree_common common
;
2232 unsigned int precision
: 10;
2233 unsigned no_force_blk_flag
: 1;
2234 unsigned needs_constructing_flag
: 1;
2235 unsigned transparent_union_flag
: 1;
2236 unsigned restrict_flag
: 1;
2237 unsigned contains_placeholder_bits
: 2;
2239 ENUM_BITFIELD(machine_mode
) mode
: 8;
2241 unsigned string_flag
: 1;
2242 unsigned lang_flag_0
: 1;
2243 unsigned lang_flag_1
: 1;
2244 unsigned lang_flag_2
: 1;
2245 unsigned lang_flag_3
: 1;
2246 unsigned lang_flag_4
: 1;
2247 unsigned lang_flag_5
: 1;
2248 unsigned lang_flag_6
: 1;
2251 alias_set_type alias_set
;
2254 union tree_type_symtab
{
2255 int GTY ((tag ("0"))) address
;
2256 const char * GTY ((tag ("1"))) pointer
;
2257 struct die_struct
* GTY ((tag ("2"))) die
;
2258 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2259 descbits ("2"))) symtab
;
2268 /* Points to a structure whose details depend on the language in use. */
2269 struct lang_type
*lang_specific
;
2272 /* Define accessor macros for information about type inheritance
2275 A "basetype" means a particular usage of a data type for inheritance
2276 in another type. Each such basetype usage has its own "binfo"
2277 object to describe it. The binfo object is a TREE_VEC node.
2279 Inheritance is represented by the binfo nodes allocated for a
2280 given type. For example, given types C and D, such that D is
2281 inherited by C, 3 binfo nodes will be allocated: one for describing
2282 the binfo properties of C, similarly one for D, and one for
2283 describing the binfo properties of D as a base type for C.
2284 Thus, given a pointer to class C, one can get a pointer to the binfo
2285 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2287 /* BINFO specific flags. */
2289 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2290 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2292 /* Flags for language dependent use. */
2293 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2294 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2295 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2296 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2297 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2298 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2299 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2301 /* The actual data type node being inherited in this basetype. */
2302 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2304 /* The offset where this basetype appears in its containing type.
2305 BINFO_OFFSET slot holds the offset (in bytes)
2306 from the base of the complete object to the base of the part of the
2307 object that is allocated on behalf of this `type'.
2308 This is always 0 except when there is multiple inheritance. */
2310 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2311 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2313 /* The virtual function table belonging to this basetype. Virtual
2314 function tables provide a mechanism for run-time method dispatching.
2315 The entries of a virtual function table are language-dependent. */
2317 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2319 /* The virtual functions in the virtual function table. This is
2320 a TREE_LIST that is used as an initial approximation for building
2321 a virtual function table for this basetype. */
2322 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2324 /* A vector of binfos for the direct basetypes inherited by this
2327 If this basetype describes type D as inherited in C, and if the
2328 basetypes of D are E and F, then this vector contains binfos for
2329 inheritance of E and F by C. */
2330 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2332 /* The number of basetypes for NODE. */
2333 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2335 /* Accessor macro to get to the Nth base binfo of this binfo. */
2336 #define BINFO_BASE_BINFO(NODE,N) \
2337 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2338 #define BINFO_BASE_ITERATE(NODE,N,B) \
2339 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2340 #define BINFO_BASE_APPEND(NODE,T) \
2341 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2343 /* For a BINFO record describing a virtual base class, i.e., one where
2344 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2345 base. The actual contents are language-dependent. In the C++
2346 front-end this field is an INTEGER_CST giving an offset into the
2347 vtable where the offset to the virtual base can be found. */
2348 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2350 /* Indicates the accesses this binfo has to its bases. The values are
2351 access_public_node, access_protected_node or access_private_node.
2352 If this array is not present, public access is implied. */
2353 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2355 #define BINFO_BASE_ACCESS(NODE,N) \
2356 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2357 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2358 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2360 /* The index in the VTT where this subobject's sub-VTT can be found.
2361 NULL_TREE if there is no sub-VTT. */
2362 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2364 /* The index in the VTT where the vptr for this subobject can be
2365 found. NULL_TREE if there is no secondary vptr in the VTT. */
2366 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2368 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2369 inheriting this base for non-virtual bases. For virtual bases it
2370 points either to the binfo for which this is a primary binfo, or to
2371 the binfo of the most derived type. */
2372 #define BINFO_INHERITANCE_CHAIN(NODE) \
2373 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2375 struct GTY (()) tree_binfo
{
2376 struct tree_common common
;
2382 VEC(tree
,gc
) *base_accesses
;
2388 VEC(tree
,none
) base_binfos
;
2392 /* Define fields and accessors for nodes representing declared names. */
2394 /* Nonzero if DECL represents a variable for the SSA passes. */
2395 #define SSA_VAR_P(DECL) \
2396 (TREE_CODE (DECL) == VAR_DECL \
2397 || TREE_CODE (DECL) == PARM_DECL \
2398 || TREE_CODE (DECL) == RESULT_DECL \
2399 || (TREE_CODE (DECL) == SSA_NAME \
2400 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2401 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2402 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2407 /* Enumerate visibility settings. */
2408 #ifndef SYMBOL_VISIBILITY_DEFINED
2409 #define SYMBOL_VISIBILITY_DEFINED
2410 enum symbol_visibility
2413 VISIBILITY_PROTECTED
,
2422 /* This is the name of the object as written by the user.
2423 It is an IDENTIFIER_NODE. */
2424 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2426 /* Every ..._DECL node gets a unique number. */
2427 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2429 /* These two fields describe where in the source code the declaration
2430 was. If the declaration appears in several places (as for a C
2431 function that is declared first and then defined later), this
2432 information should refer to the definition. */
2433 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2434 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2435 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2436 #define DECL_IS_BUILTIN(DECL) \
2437 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2439 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2440 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2441 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2442 points to either the FUNCTION_DECL for the containing function,
2443 the RECORD_TYPE or UNION_TYPE for the containing type, or
2444 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2446 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2447 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2448 struct GTY(()) tree_decl_minimal
{
2449 struct tree_common common
;
2457 /* For any sort of a ..._DECL node, this points to the original (abstract)
2458 decl node which this decl is an instance of, or else it is NULL indicating
2459 that this decl is not an instance of some other decl. For example,
2460 in a nested declaration of an inline function, this points back to the
2462 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2464 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2465 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2466 #define DECL_ORIGIN(NODE) \
2467 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2469 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2470 inline instance of some original (abstract) decl from an inline function;
2471 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2472 nodes can also have their abstract origin set to themselves. */
2473 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2474 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2476 /* In a DECL this is the field where attributes are stored. */
2477 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2479 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2480 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2481 For a VAR_DECL, holds the initial value.
2482 For a PARM_DECL, used for DECL_ARG_TYPE--default
2483 values for parameters are encoded in the type of the function,
2484 not in the PARM_DECL slot.
2485 For a FIELD_DECL, this is used for enumeration values and the C
2486 frontend uses it for temporarily storing bitwidth of bitfields.
2488 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2489 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2491 /* Holds the size of the datum, in bits, as a tree expression.
2492 Need not be constant. */
2493 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2494 /* Likewise for the size in bytes. */
2495 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2496 /* Holds the alignment required for the datum, in bits. */
2497 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2498 /* The alignment of NODE, in bytes. */
2499 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2500 /* Set if the alignment of this DECL has been set by the user, for
2501 example with an 'aligned' attribute. */
2502 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2503 /* Holds the machine mode corresponding to the declaration of a variable or
2504 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2506 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2508 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2509 operation it is. Note, however, that this field is overloaded, with
2510 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2511 checked before any access to the former. */
2512 #define DECL_FUNCTION_CODE(NODE) \
2513 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2514 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2515 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2517 /* Nonzero for a given ..._DECL node means that the name of this node should
2518 be ignored for symbolic debug purposes. */
2519 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2521 /* Nonzero for a given ..._DECL node means that this node represents an
2522 "abstract instance" of the given declaration (e.g. in the original
2523 declaration of an inline function). When generating symbolic debugging
2524 information, we mustn't try to generate any address information for nodes
2525 marked as "abstract instances" because we don't actually generate
2526 any code or allocate any data space for such instances. */
2527 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2529 /* Language-specific decl information. */
2530 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2532 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2533 do not allocate storage, and refer to a definition elsewhere. Note that
2534 this does not necessarily imply the entity represented by NODE
2535 has no program source-level definition in this translation unit. For
2536 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2537 DECL_EXTERNAL may be true simultaneously; that can be the case for
2538 a C99 "extern inline" function. */
2539 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2541 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2542 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2544 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2546 Also set in some languages for variables, etc., outside the normal
2547 lexical scope, such as class instance variables. */
2548 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2550 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2551 Used in FIELD_DECLs for vtable pointers.
2552 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2553 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2555 /* Used to indicate that this DECL represents a compiler-generated entity. */
2556 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2558 /* Additional flags for language-specific uses. */
2559 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2560 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2561 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2562 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2563 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2564 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2565 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2566 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2568 /* Nonzero for a decl which is at file scope. */
2569 #define DECL_FILE_SCOPE_P(EXP) \
2570 (! DECL_CONTEXT (EXP) \
2571 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2573 /* Nonzero for a decl that is decorated using attribute used.
2574 This indicates compiler tools that this decl needs to be preserved. */
2575 #define DECL_PRESERVE_P(DECL) \
2576 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2578 /* For function local variables of COMPLEX and VECTOR types,
2579 indicates that the variable is not aliased, and that all
2580 modifications to the variable have been adjusted so that
2581 they are killing assignments. Thus the variable may now
2582 be treated as a GIMPLE register, and use real instead of
2583 virtual ops in SSA form. */
2584 #define DECL_GIMPLE_REG_P(DECL) \
2585 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2587 struct GTY(()) tree_decl_common
{
2588 struct tree_decl_minimal common
;
2591 ENUM_BITFIELD(machine_mode
) mode
: 8;
2593 unsigned nonlocal_flag
: 1;
2594 unsigned virtual_flag
: 1;
2595 unsigned ignored_flag
: 1;
2596 unsigned abstract_flag
: 1;
2597 unsigned artificial_flag
: 1;
2598 unsigned preserve_flag
: 1;
2599 unsigned debug_expr_is_from
: 1;
2601 unsigned lang_flag_0
: 1;
2602 unsigned lang_flag_1
: 1;
2603 unsigned lang_flag_2
: 1;
2604 unsigned lang_flag_3
: 1;
2605 unsigned lang_flag_4
: 1;
2606 unsigned lang_flag_5
: 1;
2607 unsigned lang_flag_6
: 1;
2608 unsigned lang_flag_7
: 1;
2610 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2611 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2612 unsigned decl_flag_0
: 1;
2613 /* In FIELD_DECL, this is DECL_BIT_FIELD
2614 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2615 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2616 unsigned decl_flag_1
: 1;
2617 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2618 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2619 unsigned decl_flag_2
: 1;
2620 /* Logically, these two would go in a theoretical base shared by var and
2622 unsigned gimple_reg_flag
: 1;
2623 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2624 unsigned decl_by_reference_flag
: 1;
2625 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2626 unsigned decl_common_unused
: 4;
2628 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2629 unsigned int off_align
: 8;
2634 tree abstract_origin
;
2636 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2640 /* Points to a structure whose details depend on the language in use. */
2641 struct lang_decl
*lang_specific
;
2644 extern tree
decl_value_expr_lookup (tree
);
2645 extern void decl_value_expr_insert (tree
, tree
);
2647 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2648 if transformations have made this more complicated than evaluating the
2649 decl itself. This should only be used for debugging; once this field has
2650 been set, the decl itself may not legitimately appear in the function. */
2651 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2652 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2653 #define DECL_VALUE_EXPR(NODE) \
2654 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2655 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2656 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2658 /* Holds the RTL expression for the value of a variable or function.
2659 This value can be evaluated lazily for functions, variables with
2660 static storage duration, and labels. */
2661 #define DECL_RTL(NODE) \
2662 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2663 ? (NODE)->decl_with_rtl.rtl \
2664 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2666 /* Set the DECL_RTL for NODE to RTL. */
2667 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2669 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2670 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2672 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2673 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2675 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2676 NODE1, it will not be set for NODE2; this is a lazy copy. */
2677 #define COPY_DECL_RTL(NODE1, NODE2) \
2678 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2680 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2681 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2683 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2684 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2686 struct GTY(()) tree_decl_with_rtl
{
2687 struct tree_decl_common common
;
2691 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2692 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2693 of the structure. */
2694 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2696 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2697 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2698 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2699 natural alignment of the field's type). */
2700 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2702 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2703 if so, the type that was originally specified for it.
2704 TREE_TYPE may have been modified (in finish_struct). */
2705 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2707 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2708 if nonzero, indicates that the field occupies the type. */
2709 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2711 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2712 DECL_FIELD_OFFSET which are known to be always zero.
2713 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2715 #define DECL_OFFSET_ALIGN(NODE) \
2716 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2718 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2719 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2720 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2721 /* 1 if the alignment for this type was requested by "aligned" attribute,
2722 0 if it is the default for this type. */
2724 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2725 which this FIELD_DECL is defined. This information is needed when
2726 writing debugging information about vfield and vbase decls for C++. */
2727 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2729 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2730 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2732 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2734 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2736 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2737 this component. This makes it possible for Type-Based Alias Analysis
2738 to disambiguate accesses to this field with indirect accesses using
2741 struct S { int i; } s;
2744 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2746 From the implementation's viewpoint, the alias set of the type of the
2747 field 'i' (int) will not be recorded as a subset of that of the type of
2748 's' (struct S) in record_component_aliases. The counterpart is that
2749 accesses to s.i must not be given the alias set of the type of 'i'
2750 (int) but instead directly that of the type of 's' (struct S). */
2751 #define DECL_NONADDRESSABLE_P(NODE) \
2752 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2754 struct GTY(()) tree_field_decl
{
2755 struct tree_decl_common common
;
2758 tree bit_field_type
;
2765 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2766 dense, unique within any one function, and may be used to index arrays.
2767 If the value is -1, then no UID has been assigned. */
2768 #define LABEL_DECL_UID(NODE) \
2769 (LABEL_DECL_CHECK (NODE)->decl_common.label_decl_uid)
2771 /* In LABEL_DECL nodes, nonzero means that an error message about
2772 jumping into such a binding contour has been printed for this label. */
2773 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2775 struct GTY(()) tree_label_decl
{
2776 struct tree_decl_with_rtl common
;
2779 struct GTY(()) tree_result_decl
{
2780 struct tree_decl_with_rtl common
;
2783 struct GTY(()) tree_const_decl
{
2784 struct tree_decl_with_rtl common
;
2787 /* For a PARM_DECL, records the data type used to pass the argument,
2788 which may be different from the type seen in the program. */
2789 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2791 /* For PARM_DECL, holds an RTL for the stack slot or register
2792 where the data was actually passed. */
2793 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2795 struct GTY(()) tree_parm_decl
{
2796 struct tree_decl_with_rtl common
;
2801 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2802 this variable in a BIND_EXPR. */
2803 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2804 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2806 /* Used to indicate that the linkage status of this DECL is not yet known,
2807 so it should not be output now. */
2808 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2810 /* Nonzero for a given ..._DECL node means that no warnings should be
2811 generated just because this node is unused. */
2812 #define DECL_IN_SYSTEM_HEADER(NODE) \
2813 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2815 /* Used to indicate that this DECL has weak linkage. */
2816 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2818 /* Used to indicate that the DECL is a dllimport. */
2819 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2821 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2822 not be put out unless it is needed in this translation unit.
2823 Entities like this are shared across translation units (like weak
2824 entities), but are guaranteed to be generated by any translation
2825 unit that needs them, and therefore need not be put out anywhere
2826 where they are not needed. DECL_COMDAT is just a hint to the
2827 back-end; it is up to front-ends which set this flag to ensure
2828 that there will never be any harm, other than bloat, in putting out
2829 something which is DECL_COMDAT. */
2830 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2832 #define DECL_COMDAT_GROUP(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2834 /* A replaceable function is one which may be replaced at link-time
2835 with an entirely different definition, provided that the
2836 replacement has the same type. For example, functions declared
2837 with __attribute__((weak)) on most systems are replaceable.
2839 COMDAT functions are not replaceable, since all definitions of the
2840 function must be equivalent. It is important that COMDAT functions
2841 not be treated as replaceable so that use of C++ template
2842 instantiations is not penalized.
2844 For example, DECL_REPLACEABLE is used to determine whether or not a
2845 function (including a template instantiation) which is not
2846 explicitly declared "inline" can be inlined. If the function is
2847 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2848 implementation chosen at link-time may be different. However, a
2849 function that is not DECL_REPLACEABLE can be inlined, since all
2850 versions of the function will be functionally identical. */
2851 #define DECL_REPLACEABLE_P(NODE) \
2852 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2854 /* The name of the object as the assembler will see it (but before any
2855 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2856 as DECL_NAME. It is an IDENTIFIER_NODE. */
2857 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2859 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2860 This is true of all DECL nodes except FIELD_DECL. */
2861 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2862 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2864 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2865 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2867 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2868 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2870 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2871 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2872 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2874 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2875 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2876 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2877 semantics of using this macro, are different than saying:
2879 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2881 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2883 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2884 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2885 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2886 DECL_ASSEMBLER_NAME (DECL1)) \
2889 /* Records the section name in a section attribute. Used to pass
2890 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2891 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2893 /* Value of the decls's visibility attribute */
2894 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2896 /* Nonzero means that the decl had its visibility specified rather than
2898 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2900 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2901 multiple translation units should be merged. */
2902 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2904 struct GTY(()) tree_decl_with_vis
{
2905 struct tree_decl_with_rtl common
;
2906 tree assembler_name
;
2910 /* Belong to VAR_DECL exclusively. */
2911 unsigned defer_output
: 1;
2912 unsigned hard_register
: 1;
2913 unsigned thread_local
: 1;
2914 unsigned common_flag
: 1;
2915 unsigned in_text_section
: 1;
2916 unsigned dllimport_flag
: 1;
2917 /* Used by C++. Might become a generic decl flag. */
2918 unsigned shadowed_for_var_p
: 1;
2919 /* Don't belong to VAR_DECL exclusively. */
2920 unsigned weak_flag
: 1;
2922 unsigned seen_in_bind_expr
: 1;
2923 unsigned comdat_flag
: 1;
2924 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
2925 unsigned visibility_specified
: 1;
2926 /* Belongs to VAR_DECL exclusively. */
2927 ENUM_BITFIELD(tls_model
) tls_model
: 3;
2929 /* Belong to FUNCTION_DECL exclusively. */
2930 unsigned init_priority_p
: 1;
2931 /* 15 unused bits. */
2934 /* In a VAR_DECL that's static,
2935 nonzero if the space is in the text section. */
2936 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2938 /* Nonzero for a given ..._DECL node means that this node should be
2939 put in .common, if possible. If a DECL_INITIAL is given, and it
2940 is not error_mark_node, then the decl cannot be put in .common. */
2941 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2943 /* In a VAR_DECL, nonzero if the decl is a register variable with
2944 an explicit asm specification. */
2945 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2947 extern tree
decl_debug_expr_lookup (tree
);
2948 extern void decl_debug_expr_insert (tree
, tree
);
2949 /* For VAR_DECL, this is set to either an expression that it was split
2950 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
2951 subexpressions that it was split into. */
2952 #define DECL_DEBUG_EXPR(NODE) \
2953 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
2955 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
2956 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
2958 /* An initialization priority. */
2959 typedef unsigned short priority_type
;
2961 extern priority_type
decl_init_priority_lookup (tree
);
2962 extern priority_type
decl_fini_priority_lookup (tree
);
2963 extern void decl_init_priority_insert (tree
, priority_type
);
2964 extern void decl_fini_priority_insert (tree
, priority_type
);
2966 /* In a non-local VAR_DECL with static storage duration, true if the
2967 variable has an initialization priority. If false, the variable
2968 will be initialized at the DEFAULT_INIT_PRIORITY. */
2969 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
2970 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
2972 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
2974 #define DECL_INIT_PRIORITY(NODE) \
2975 (decl_init_priority_lookup (NODE))
2976 /* Set the initialization priority for NODE to VAL. */
2977 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
2978 (decl_init_priority_insert (NODE, VAL))
2980 /* For a FUNCTION_DECL the finalization priority of NODE. */
2981 #define DECL_FINI_PRIORITY(NODE) \
2982 (decl_fini_priority_lookup (NODE))
2983 /* Set the finalization priority for NODE to VAL. */
2984 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
2985 (decl_fini_priority_insert (NODE, VAL))
2987 /* The initialization priority for entities for which no explicit
2988 initialization priority has been specified. */
2989 #define DEFAULT_INIT_PRIORITY 65535
2991 /* The maximum allowed initialization priority. */
2992 #define MAX_INIT_PRIORITY 65535
2994 /* The largest priority value reserved for use by system runtime
2996 #define MAX_RESERVED_INIT_PRIORITY 100
2998 /* In a VAR_DECL, the model to use if the data should be allocated from
2999 thread-local storage. */
3000 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3002 /* In a VAR_DECL, nonzero if the data should be allocated from
3003 thread-local storage. */
3004 #define DECL_THREAD_LOCAL_P(NODE) \
3005 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3007 struct GTY(()) tree_var_decl
{
3008 struct tree_decl_with_vis common
;
3012 /* This field is used to reference anything in decl.result and is meant only
3013 for use by the garbage collector. */
3014 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3016 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3017 Before the struct containing the FUNCTION_DECL is laid out,
3018 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3019 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3020 function. When the class is laid out, this pointer is changed
3021 to an INTEGER_CST node which is suitable for use as an index
3022 into the virtual function table.
3023 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3024 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3027 tree_decl_non_common
{
3028 struct tree_decl_with_vis common
;
3029 /* C++ uses this in namespaces. */
3031 /* C++ uses this in templates. */
3033 /* Almost all FE's use this. */
3035 /* C++ uses this in namespaces. */
3039 /* In FUNCTION_DECL, holds the decl for the return value. */
3040 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3042 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3043 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3045 /* In a FUNCTION_DECL, the saved representation of the body of the
3047 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3049 /* Nonzero in a FUNCTION_DECL means this function should be treated
3050 as if it were a malloc, meaning it returns a pointer that is
3052 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3054 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3055 C++ operator new, meaning that it returns a pointer for which we
3056 should not use type based aliasing. */
3057 #define DECL_IS_OPERATOR_NEW(NODE) \
3058 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3060 /* Nonzero in a FUNCTION_DECL means this function may return more
3062 #define DECL_IS_RETURNS_TWICE(NODE) \
3063 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3065 /* Nonzero in a FUNCTION_DECL means this function should be treated
3066 as "pure" function (like const function, but may read global memory). */
3067 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3069 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3070 the const or pure function may not terminate. When this is nonzero
3071 for a const or pure function, it can be dealt with by cse passes
3072 but cannot be removed by dce passes since you are not allowed to
3073 change an infinite looping program into one that terminates without
3075 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3076 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3078 /* Nonzero in a FUNCTION_DECL means this function should be treated
3079 as "novops" function (function that does not read global memory,
3080 but may have arbitrary side effects). */
3081 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3083 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3084 at the beginning or end of execution. */
3085 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3086 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3088 #define DECL_STATIC_DESTRUCTOR(NODE) \
3089 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3091 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3092 be instrumented with calls to support routines. */
3093 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3094 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3096 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3097 disabled in this function. */
3098 #define DECL_NO_LIMIT_STACK(NODE) \
3099 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3101 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3102 static chain is not needed. */
3103 #define DECL_NO_STATIC_CHAIN(NODE) \
3104 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3106 /* Nonzero for a decl that cgraph has decided should be inlined into
3107 at least one call site. It is not meaningful to look at this
3108 directly; always use cgraph_function_possibly_inlined_p. */
3109 #define DECL_POSSIBLY_INLINED(DECL) \
3110 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3112 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3113 such as via the `inline' keyword in C/C++. This flag controls the linkage
3114 semantics of 'inline' */
3115 #define DECL_DECLARED_INLINE_P(NODE) \
3116 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3118 /* Nonzero in a FUNCTION_DECL means this function should not get
3119 -Winline warnings. */
3120 #define DECL_NO_INLINE_WARNING_P(NODE) \
3121 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3123 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3124 disregarding size and cost heuristics. This is equivalent to using
3125 the always_inline attribute without the required diagnostics if the
3126 function cannot be inlined. */
3127 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3128 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3130 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3131 that describes the status of this function. */
3132 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3134 /* In a FUNCTION_DECL, nonzero means a built in function. */
3135 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3137 /* For a builtin function, identify which part of the compiler defined it. */
3138 #define DECL_BUILT_IN_CLASS(NODE) \
3139 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3141 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3142 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3144 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3145 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3147 /* In FUNCTION_DECL, the function specific target options to use when compiling
3149 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3150 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3152 /* In FUNCTION_DECL, the function specific optimization options to use when
3153 compiling this function. */
3154 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3155 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3157 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3158 arguments/result/saved_tree fields by front ends. It was either inherit
3159 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3160 which seemed a bit strange. */
3162 struct GTY(()) tree_function_decl
{
3163 struct tree_decl_non_common common
;
3167 /* Function specific options that are used by this function. */
3168 tree function_specific_target
; /* target options */
3169 tree function_specific_optimization
; /* optimization options */
3171 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3172 DECL_FUNCTION_CODE. Otherwise unused.
3173 ??? The bitfield needs to be able to hold all target function
3175 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3176 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3178 unsigned static_ctor_flag
: 1;
3179 unsigned static_dtor_flag
: 1;
3180 unsigned uninlinable
: 1;
3182 unsigned possibly_inlined
: 1;
3183 unsigned novops_flag
: 1;
3184 unsigned returns_twice_flag
: 1;
3185 unsigned malloc_flag
: 1;
3186 unsigned operator_new_flag
: 1;
3187 unsigned declared_inline_flag
: 1;
3188 unsigned regdecl_flag
: 1;
3190 unsigned no_inline_warning_flag
: 1;
3191 unsigned no_instrument_function_entry_exit
: 1;
3192 unsigned no_limit_stack
: 1;
3193 unsigned disregard_inline_limits
: 1;
3194 unsigned pure_flag
: 1;
3195 unsigned looping_const_or_pure_flag
: 1;
3201 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3202 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3204 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3205 into stabs. Instead it will generate cross reference ('x') of names.
3206 This uses the same flag as DECL_EXTERNAL. */
3207 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3208 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3210 /* Getter of the imported declaration associated to the
3211 IMPORTED_DECL node. */
3212 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3213 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3215 struct GTY(()) tree_type_decl
{
3216 struct tree_decl_non_common common
;
3220 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3221 To reduce overhead, the nodes containing the statements are not trees.
3222 This avoids the overhead of tree_common on all linked list elements.
3224 Use the interface in tree-iterator.h to access this node. */
3226 #define STATEMENT_LIST_HEAD(NODE) \
3227 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3228 #define STATEMENT_LIST_TAIL(NODE) \
3229 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3231 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3233 struct tree_statement_list_node
*prev
;
3234 struct tree_statement_list_node
*next
;
3238 struct GTY(()) tree_statement_list
3240 struct tree_common common
;
3241 struct tree_statement_list_node
*head
;
3242 struct tree_statement_list_node
*tail
;
3246 /* Optimization options used by a function. */
3248 struct GTY(()) tree_optimization_option
{
3249 struct tree_common common
;
3251 /* The optimization options used by the user. */
3252 struct cl_optimization opts
;
3255 #define TREE_OPTIMIZATION(NODE) \
3256 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3258 /* Return a tree node that encapsulates the current optimization options. */
3259 extern tree
build_optimization_node (void);
3261 /* Target options used by a function. */
3263 struct GTY(()) tree_target_option
{
3264 struct tree_common common
;
3266 /* The optimization options used by the user. */
3267 struct cl_target_option opts
;
3270 #define TREE_TARGET_OPTION(NODE) \
3271 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3273 /* Return a tree node that encapsulates the current target options. */
3274 extern tree
build_target_option_node (void);
3277 /* Define the overall contents of a tree node.
3278 It may be any of the structures declared above
3279 for various types of node. */
3281 union GTY ((ptr_alias (union lang_tree_node
),
3282 desc ("tree_node_structure (&%h)"))) tree_node
{
3283 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3284 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3285 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3286 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3287 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3288 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3289 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3290 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3291 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3292 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3293 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3294 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3295 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3296 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3297 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3298 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3299 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3300 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3301 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3302 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3303 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3304 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3305 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
3306 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3307 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3308 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3309 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3310 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3311 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3312 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3313 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3314 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3315 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3316 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3319 /* Standard named or nameless data types of the C compiler. */
3341 TI_INTEGER_MINUS_ONE
,
3358 TI_COMPLEX_INTEGER_TYPE
,
3359 TI_COMPLEX_FLOAT_TYPE
,
3360 TI_COMPLEX_DOUBLE_TYPE
,
3361 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3365 TI_LONG_DOUBLE_TYPE
,
3369 TI_LONG_DOUBLE_PTR_TYPE
,
3370 TI_INTEGER_PTR_TYPE
,
3379 TI_VA_LIST_GPR_COUNTER_FIELD
,
3380 TI_VA_LIST_FPR_COUNTER_FIELD
,
3387 TI_DFLOAT32_PTR_TYPE
,
3388 TI_DFLOAT64_PTR_TYPE
,
3389 TI_DFLOAT128_PTR_TYPE
,
3398 TI_SAT_LLFRACT_TYPE
,
3399 TI_SAT_USFRACT_TYPE
,
3401 TI_SAT_ULFRACT_TYPE
,
3402 TI_SAT_ULLFRACT_TYPE
,
3414 TI_SAT_LLACCUM_TYPE
,
3415 TI_SAT_USACCUM_TYPE
,
3417 TI_SAT_ULACCUM_TYPE
,
3418 TI_SAT_ULLACCUM_TYPE
,
3464 TI_OPTIMIZATION_DEFAULT
,
3465 TI_OPTIMIZATION_CURRENT
,
3466 TI_TARGET_OPTION_DEFAULT
,
3467 TI_TARGET_OPTION_CURRENT
,
3468 TI_CURRENT_TARGET_PRAGMA
,
3469 TI_CURRENT_OPTIMIZE_PRAGMA
,
3474 extern GTY(()) tree global_trees
[TI_MAX
];
3476 #define error_mark_node global_trees[TI_ERROR_MARK]
3478 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3479 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3480 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3481 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3482 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3484 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3485 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3486 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3487 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3488 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3490 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3491 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3493 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3494 #define integer_one_node global_trees[TI_INTEGER_ONE]
3495 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3496 #define size_zero_node global_trees[TI_SIZE_ZERO]
3497 #define size_one_node global_trees[TI_SIZE_ONE]
3498 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3499 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3500 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3502 /* Base access nodes. */
3503 #define access_public_node global_trees[TI_PUBLIC]
3504 #define access_protected_node global_trees[TI_PROTECTED]
3505 #define access_private_node global_trees[TI_PRIVATE]
3507 #define null_pointer_node global_trees[TI_NULL_POINTER]
3509 #define float_type_node global_trees[TI_FLOAT_TYPE]
3510 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3511 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3513 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3514 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3515 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3516 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3518 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3519 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3520 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3521 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3523 #define void_type_node global_trees[TI_VOID_TYPE]
3524 /* The C type `void *'. */
3525 #define ptr_type_node global_trees[TI_PTR_TYPE]
3526 /* The C type `const void *'. */
3527 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3528 /* The C type `size_t'. */
3529 #define size_type_node global_trees[TI_SIZE_TYPE]
3530 #define pid_type_node global_trees[TI_PID_TYPE]
3531 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3532 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3533 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3534 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3535 /* The C type `FILE *'. */
3536 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3538 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3539 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3540 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3542 /* The decimal floating point types. */
3543 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3544 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3545 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3546 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3547 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3548 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3550 /* The fixed-point types. */
3551 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3552 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3553 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3554 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3555 #define sat_unsigned_short_fract_type_node \
3556 global_trees[TI_SAT_USFRACT_TYPE]
3557 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3558 #define sat_unsigned_long_fract_type_node \
3559 global_trees[TI_SAT_ULFRACT_TYPE]
3560 #define sat_unsigned_long_long_fract_type_node \
3561 global_trees[TI_SAT_ULLFRACT_TYPE]
3562 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3563 #define fract_type_node global_trees[TI_FRACT_TYPE]
3564 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3565 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3566 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3567 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3568 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3569 #define unsigned_long_long_fract_type_node \
3570 global_trees[TI_ULLFRACT_TYPE]
3571 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3572 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3573 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3574 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3575 #define sat_unsigned_short_accum_type_node \
3576 global_trees[TI_SAT_USACCUM_TYPE]
3577 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3578 #define sat_unsigned_long_accum_type_node \
3579 global_trees[TI_SAT_ULACCUM_TYPE]
3580 #define sat_unsigned_long_long_accum_type_node \
3581 global_trees[TI_SAT_ULLACCUM_TYPE]
3582 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3583 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3584 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3585 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3586 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3587 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3588 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3589 #define unsigned_long_long_accum_type_node \
3590 global_trees[TI_ULLACCUM_TYPE]
3591 #define qq_type_node global_trees[TI_QQ_TYPE]
3592 #define hq_type_node global_trees[TI_HQ_TYPE]
3593 #define sq_type_node global_trees[TI_SQ_TYPE]
3594 #define dq_type_node global_trees[TI_DQ_TYPE]
3595 #define tq_type_node global_trees[TI_TQ_TYPE]
3596 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3597 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3598 #define usq_type_node global_trees[TI_USQ_TYPE]
3599 #define udq_type_node global_trees[TI_UDQ_TYPE]
3600 #define utq_type_node global_trees[TI_UTQ_TYPE]
3601 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3602 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3603 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3604 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3605 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3606 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3607 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3608 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3609 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3610 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3611 #define ha_type_node global_trees[TI_HA_TYPE]
3612 #define sa_type_node global_trees[TI_SA_TYPE]
3613 #define da_type_node global_trees[TI_DA_TYPE]
3614 #define ta_type_node global_trees[TI_TA_TYPE]
3615 #define uha_type_node global_trees[TI_UHA_TYPE]
3616 #define usa_type_node global_trees[TI_USA_TYPE]
3617 #define uda_type_node global_trees[TI_UDA_TYPE]
3618 #define uta_type_node global_trees[TI_UTA_TYPE]
3619 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3620 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3621 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3622 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3623 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3624 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3625 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3626 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3628 /* The node that should be placed at the end of a parameter list to
3629 indicate that the function does not take a variable number of
3630 arguments. The TREE_VALUE will be void_type_node and there will be
3631 no TREE_CHAIN. Language-independent code should not assume
3632 anything else about this node. */
3633 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3635 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3636 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3638 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3640 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3641 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3643 /* Default/current target options (TARGET_OPTION_NODE). */
3644 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3645 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3647 /* Default tree list option(), optimize() pragmas to be linked into the
3649 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3650 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3652 /* An enumeration of the standard C integer types. These must be
3653 ordered so that shorter types appear before longer ones, and so
3654 that signed types appear before unsigned ones, for the correct
3655 functioning of interpret_integer() in c-lex.c. */
3656 enum integer_type_kind
3668 itk_unsigned_long_long
,
3672 typedef enum integer_type_kind integer_type_kind
;
3674 /* The standard C integer types. Use integer_type_kind to index into
3676 extern GTY(()) tree integer_types
[itk_none
];
3678 #define char_type_node integer_types[itk_char]
3679 #define signed_char_type_node integer_types[itk_signed_char]
3680 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3681 #define short_integer_type_node integer_types[itk_short]
3682 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3683 #define integer_type_node integer_types[itk_int]
3684 #define unsigned_type_node integer_types[itk_unsigned_int]
3685 #define long_integer_type_node integer_types[itk_long]
3686 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3687 #define long_long_integer_type_node integer_types[itk_long_long]
3688 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3690 /* Set to the default thread-local storage (tls) model to use. */
3692 extern enum tls_model flag_tls_default
;
3695 /* A pointer-to-function member type looks like:
3702 If __pfn is NULL, it is a NULL pointer-to-member-function.
3704 (Because the vtable is always the first thing in the object, we
3705 don't need its offset.) If the function is virtual, then PFN is
3706 one plus twice the index into the vtable; otherwise, it is just a
3707 pointer to the function.
3709 Unfortunately, using the lowest bit of PFN doesn't work in
3710 architectures that don't impose alignment requirements on function
3711 addresses, or that use the lowest bit to tell one ISA from another,
3712 for example. For such architectures, we use the lowest bit of
3713 DELTA instead of the lowest bit of the PFN, and DELTA will be
3716 enum ptrmemfunc_vbit_where_t
3718 ptrmemfunc_vbit_in_pfn
,
3719 ptrmemfunc_vbit_in_delta
3722 #define NULL_TREE (tree) NULL
3724 extern tree
decl_assembler_name (tree
);
3725 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3726 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3728 /* Compute the number of bytes occupied by 'node'. This routine only
3729 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3731 extern size_t tree_size (const_tree
);
3733 /* Compute the number of bytes occupied by a tree with code CODE. This
3734 function cannot be used for TREE_VEC codes, which are of variable
3736 extern size_t tree_code_size (enum tree_code
);
3738 /* Lowest level primitive for allocating a node.
3739 The TREE_CODE is the only argument. Contents are initialized
3740 to zero except for a few of the common fields. */
3742 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3743 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3745 /* Make a copy of a node, with all the same contents. */
3747 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3748 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3750 /* Make a copy of a chain of TREE_LIST nodes. */
3752 extern tree
copy_list (tree
);
3755 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3756 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3758 /* Make a TREE_VEC. */
3760 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3761 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3763 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3764 The name is supplied as a char *. */
3766 extern tree
get_identifier (const char *);
3768 #if GCC_VERSION >= 3000
3769 #define get_identifier(str) \
3770 (__builtin_constant_p (str) \
3771 ? get_identifier_with_length ((str), strlen (str)) \
3772 : get_identifier (str))
3776 /* Identical to get_identifier, except that the length is assumed
3779 extern tree
get_identifier_with_length (const char *, size_t);
3781 /* If an identifier with the name TEXT (a null-terminated string) has
3782 previously been referred to, return that node; otherwise return
3785 extern tree
maybe_get_identifier (const char *);
3787 /* Construct various types of nodes. */
3789 extern tree
build_nt (enum tree_code
, ...);
3790 extern tree
build_nt_call_list (tree
, tree
);
3791 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
3793 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3794 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3795 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
3796 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3797 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
3798 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3799 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
3800 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3801 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
3802 tree MEM_STAT_DECL
);
3803 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3804 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3805 tree MEM_STAT_DECL
);
3806 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3807 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
3808 tree
, tree MEM_STAT_DECL
);
3809 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3810 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3812 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
3813 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
3814 extern tree
build_int_cstu (tree
, unsigned HOST_WIDE_INT
);
3815 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3816 extern tree
build_int_cst_wide_type (tree
,
3817 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
3818 extern tree
build_vector (tree
, tree
);
3819 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
3820 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
3821 extern tree
build_constructor_single (tree
, tree
, tree
);
3822 extern tree
build_constructor_from_list (tree
, tree
);
3823 extern tree
build_real_from_int_cst (tree
, const_tree
);
3824 extern tree
build_complex (tree
, tree
, tree
);
3825 extern tree
build_one_cst (tree
);
3826 extern tree
build_string (int, const char *);
3827 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
3828 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3829 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
3830 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3831 extern tree
build_decl_stat (location_t
, enum tree_code
,
3832 tree
, tree MEM_STAT_DECL
);
3833 extern tree
build_fn_decl (const char *, tree
);
3834 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
3835 extern tree
build_block (tree
, tree
, tree
, tree
);
3836 extern tree
build_empty_stmt (location_t
);
3837 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
3839 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
3840 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3842 extern tree
build_call_list (tree
, tree
, tree
);
3843 extern tree
build_call_nary (tree
, tree
, int, ...);
3844 extern tree
build_call_valist (tree
, tree
, int, va_list);
3845 extern tree
build_call_array (tree
, tree
, int, const tree
*);
3846 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
3848 /* Construct various nodes representing data types. */
3850 extern tree
make_signed_type (int);
3851 extern tree
make_unsigned_type (int);
3852 extern tree
signed_or_unsigned_type_for (int, tree
);
3853 extern tree
signed_type_for (tree
);
3854 extern tree
unsigned_type_for (tree
);
3855 extern void initialize_sizetypes (bool);
3856 extern void set_sizetype (tree
);
3857 extern void fixup_unsigned_type (tree
);
3858 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
3859 extern tree
build_pointer_type (tree
);
3860 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
3861 extern tree
build_reference_type (tree
);
3862 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
3863 extern tree
build_vector_type (tree innertype
, int nunits
);
3864 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
3865 extern tree
build_type_no_quals (tree
);
3866 extern tree
build_index_type (tree
);
3867 extern tree
build_index_2_type (tree
, tree
);
3868 extern tree
build_array_type (tree
, tree
);
3869 extern tree
build_function_type (tree
, tree
);
3870 extern tree
build_function_type_list (tree
, ...);
3871 extern tree
build_function_type_skip_args (tree
, bitmap
);
3872 extern tree
build_function_decl_skip_args (tree
, bitmap
);
3873 extern tree
build_varargs_function_type_list (tree
, ...);
3874 extern tree
build_method_type_directly (tree
, tree
, tree
);
3875 extern tree
build_method_type (tree
, tree
);
3876 extern tree
build_offset_type (tree
, tree
);
3877 extern tree
build_complex_type (tree
);
3878 extern tree
build_resx (int);
3879 extern tree
array_type_nelts (const_tree
);
3880 extern bool in_array_bounds_p (tree
);
3881 extern bool range_in_array_bounds_p (tree
);
3883 extern tree
value_member (tree
, tree
);
3884 extern tree
purpose_member (const_tree
, tree
);
3886 extern int attribute_list_equal (const_tree
, const_tree
);
3887 extern int attribute_list_contained (const_tree
, const_tree
);
3888 extern int tree_int_cst_equal (const_tree
, const_tree
);
3889 extern int tree_int_cst_lt (const_tree
, const_tree
);
3890 extern int tree_int_cst_compare (const_tree
, const_tree
);
3891 extern int host_integerp (const_tree
, int);
3892 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
3893 extern int tree_int_cst_msb (const_tree
);
3894 extern int tree_int_cst_sgn (const_tree
);
3895 extern int tree_int_cst_sign_bit (const_tree
);
3896 extern unsigned int tree_int_cst_min_precision (tree
, bool);
3897 extern bool tree_expr_nonnegative_p (tree
);
3898 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
3899 extern bool may_negate_without_overflow_p (const_tree
);
3900 extern tree
strip_array_types (tree
);
3901 extern tree
excess_precision_type (tree
);
3903 /* Construct various nodes representing fract or accum data types. */
3905 extern tree
make_fract_type (int, int, int);
3906 extern tree
make_accum_type (int, int, int);
3908 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3909 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3910 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3911 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3912 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3913 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3914 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3915 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3917 #define make_or_reuse_signed_fract_type(P) \
3918 make_or_reuse_fract_type (P, 0, 0)
3919 #define make_or_reuse_unsigned_fract_type(P) \
3920 make_or_reuse_fract_type (P, 1, 0)
3921 #define make_or_reuse_sat_signed_fract_type(P) \
3922 make_or_reuse_fract_type (P, 0, 1)
3923 #define make_or_reuse_sat_unsigned_fract_type(P) \
3924 make_or_reuse_fract_type (P, 1, 1)
3925 #define make_or_reuse_signed_accum_type(P) \
3926 make_or_reuse_accum_type (P, 0, 0)
3927 #define make_or_reuse_unsigned_accum_type(P) \
3928 make_or_reuse_accum_type (P, 1, 0)
3929 #define make_or_reuse_sat_signed_accum_type(P) \
3930 make_or_reuse_accum_type (P, 0, 1)
3931 #define make_or_reuse_sat_unsigned_accum_type(P) \
3932 make_or_reuse_accum_type (P, 1, 1)
3934 /* From expmed.c. Since rtl.h is included after tree.h, we can't
3935 put the prototype here. Rtl.h does declare the prototype if
3936 tree.h had been included. */
3938 extern tree
make_tree (tree
, rtx
);
3940 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3943 Such modified types already made are recorded so that duplicates
3946 extern tree
build_type_attribute_variant (tree
, tree
);
3947 extern tree
build_decl_attribute_variant (tree
, tree
);
3949 /* Structure describing an attribute and a function to handle it. */
3950 struct attribute_spec
3952 /* The name of the attribute (without any leading or trailing __),
3953 or NULL to mark the end of a table of attributes. */
3954 const char *const name
;
3955 /* The minimum length of the list of arguments of the attribute. */
3956 const int min_length
;
3957 /* The maximum length of the list of arguments of the attribute
3958 (-1 for no maximum). */
3959 const int max_length
;
3960 /* Whether this attribute requires a DECL. If it does, it will be passed
3961 from types of DECLs, function return types and array element types to
3962 the DECLs, function types and array types respectively; but when
3963 applied to a type in any other circumstances, it will be ignored with
3964 a warning. (If greater control is desired for a given attribute,
3965 this should be false, and the flags argument to the handler may be
3966 used to gain greater control in that case.) */
3967 const bool decl_required
;
3968 /* Whether this attribute requires a type. If it does, it will be passed
3969 from a DECL to the type of that DECL. */
3970 const bool type_required
;
3971 /* Whether this attribute requires a function (or method) type. If it does,
3972 it will be passed from a function pointer type to the target type,
3973 and from a function return type (which is not itself a function
3974 pointer type) to the function type. */
3975 const bool function_type_required
;
3976 /* Function to handle this attribute. NODE points to the node to which
3977 the attribute is to be applied. If a DECL, it should be modified in
3978 place; if a TYPE, a copy should be created. NAME is the name of the
3979 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
3980 of the arguments (which may be NULL). FLAGS gives further information
3981 about the context of the attribute. Afterwards, the attributes will
3982 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
3983 unless *NO_ADD_ATTRS is set to true (which should be done on error,
3984 as well as in any other cases when the attributes should not be added
3985 to the DECL or TYPE). Depending on FLAGS, any attributes to be
3986 applied to another type or DECL later may be returned;
3987 otherwise the return value should be NULL_TREE. This pointer may be
3988 NULL if no special handling is required beyond the checks implied
3989 by the rest of this structure. */
3990 tree (*const handler
) (tree
*node
, tree name
, tree args
,
3991 int flags
, bool *no_add_attrs
);
3994 /* Flags that may be passed in the third argument of decl_attributes, and
3995 to handler functions for attributes. */
3996 enum attribute_flags
3998 /* The type passed in is the type of a DECL, and any attributes that
3999 should be passed in again to be applied to the DECL rather than the
4000 type should be returned. */
4001 ATTR_FLAG_DECL_NEXT
= 1,
4002 /* The type passed in is a function return type, and any attributes that
4003 should be passed in again to be applied to the function type rather
4004 than the return type should be returned. */
4005 ATTR_FLAG_FUNCTION_NEXT
= 2,
4006 /* The type passed in is an array element type, and any attributes that
4007 should be passed in again to be applied to the array type rather
4008 than the element type should be returned. */
4009 ATTR_FLAG_ARRAY_NEXT
= 4,
4010 /* The type passed in is a structure, union or enumeration type being
4011 created, and should be modified in place. */
4012 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4013 /* The attributes are being applied by default to a library function whose
4014 name indicates known behavior, and should be silently ignored if they
4015 are not in fact compatible with the function type. */
4016 ATTR_FLAG_BUILT_IN
= 16
4019 /* Default versions of target-overridable functions. */
4021 extern tree
merge_decl_attributes (tree
, tree
);
4022 extern tree
merge_type_attributes (tree
, tree
);
4024 /* Given a tree node and a string, return nonzero if the tree node is
4025 a valid attribute name for the string. */
4027 extern int is_attribute_p (const char *, const_tree
);
4029 /* Given an attribute name and a list of attributes, return the list element
4030 of the attribute or NULL_TREE if not found. */
4032 extern tree
lookup_attribute (const char *, tree
);
4034 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4037 extern tree
remove_attribute (const char *, tree
);
4039 /* Given two attributes lists, return a list of their union. */
4041 extern tree
merge_attributes (tree
, tree
);
4043 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4044 /* Given two Windows decl attributes lists, possibly including
4045 dllimport, return a list of their union . */
4046 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4048 /* Handle a "dllimport" or "dllexport" attribute. */
4049 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4052 /* Check whether CAND is suitable to be returned from get_qualified_type
4053 (BASE, TYPE_QUALS). */
4055 extern bool check_qualified_type (const_tree
, const_tree
, int);
4057 /* Return a version of the TYPE, qualified as indicated by the
4058 TYPE_QUALS, if one exists. If no qualified version exists yet,
4059 return NULL_TREE. */
4061 extern tree
get_qualified_type (tree
, int);
4063 /* Like get_qualified_type, but creates the type if it does not
4064 exist. This function never returns NULL_TREE. */
4066 extern tree
build_qualified_type (tree
, int);
4068 /* Like build_qualified_type, but only deals with the `const' and
4069 `volatile' qualifiers. This interface is retained for backwards
4070 compatibility with the various front-ends; new code should use
4071 build_qualified_type instead. */
4073 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4074 build_qualified_type ((TYPE), \
4075 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4076 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4078 /* Make a copy of a type node. */
4080 extern tree
build_distinct_type_copy (tree
);
4081 extern tree
build_variant_type_copy (tree
);
4083 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4084 fields. Optionally specify an alignment, and then lay it out. */
4086 extern void finish_builtin_struct (tree
, const char *,
4089 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4090 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4091 node, does nothing except for the first time. */
4093 extern void layout_type (tree
);
4095 /* These functions allow a front-end to perform a manual layout of a
4096 RECORD_TYPE. (For instance, if the placement of subsequent fields
4097 depends on the placement of fields so far.) Begin by calling
4098 start_record_layout. Then, call place_field for each of the
4099 fields. Then, call finish_record_layout. See layout_type for the
4100 default way in which these functions are used. */
4102 typedef struct record_layout_info_s
4104 /* The RECORD_TYPE that we are laying out. */
4106 /* The offset into the record so far, in bytes, not including bits in
4109 /* The last known alignment of SIZE. */
4110 unsigned int offset_align
;
4111 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4113 /* The alignment of the record so far, in bits. */
4114 unsigned int record_align
;
4115 /* The alignment of the record so far, ignoring #pragma pack and
4116 __attribute__ ((packed)), in bits. */
4117 unsigned int unpacked_align
;
4118 /* The previous field layed out. */
4120 /* The static variables (i.e., class variables, as opposed to
4121 instance variables) encountered in T. */
4122 tree pending_statics
;
4123 /* Bits remaining in the current alignment group */
4124 int remaining_in_alignment
;
4125 /* True if we've seen a packed field that didn't have normal
4126 alignment anyway. */
4127 int packed_maybe_necessary
;
4128 } *record_layout_info
;
4130 extern record_layout_info
start_record_layout (tree
);
4131 extern tree
bit_from_pos (tree
, tree
);
4132 extern tree
byte_from_pos (tree
, tree
);
4133 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4134 extern void normalize_offset (tree
*, tree
*, unsigned int);
4135 extern tree
rli_size_unit_so_far (record_layout_info
);
4136 extern tree
rli_size_so_far (record_layout_info
);
4137 extern void normalize_rli (record_layout_info
);
4138 extern void place_field (record_layout_info
, tree
);
4139 extern void compute_record_mode (tree
);
4140 extern void finish_record_layout (record_layout_info
, int);
4142 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4143 return a canonicalized ..._TYPE node, so that duplicates are not made.
4144 How the hash code is computed is up to the caller, as long as any two
4145 callers that could hash identical-looking type nodes agree. */
4147 extern tree
type_hash_canon (unsigned int, tree
);
4149 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4150 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4151 fields. Call this only once for any given decl node.
4153 Second argument is the boundary that this field can be assumed to
4154 be starting at (in bits). Zero means it can be assumed aligned
4155 on any boundary that may be needed. */
4157 extern void layout_decl (tree
, unsigned);
4159 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4160 a previous call to layout_decl and calls it again. */
4162 extern void relayout_decl (tree
);
4164 /* Return the mode for data of a given size SIZE and mode class CLASS.
4165 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4166 The value is BLKmode if no other mode is found. This is like
4167 mode_for_size, but is passed a tree. */
4169 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4171 /* Return an expr equal to X but certainly not valid as an lvalue. */
4173 extern tree
non_lvalue (tree
);
4175 extern tree
convert (tree
, tree
);
4176 extern unsigned int expr_align (const_tree
);
4177 extern tree
expr_first (tree
);
4178 extern tree
expr_last (tree
);
4179 extern tree
size_in_bytes (const_tree
);
4180 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4181 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4182 extern tree
bit_position (const_tree
);
4183 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4184 extern tree
byte_position (const_tree
);
4185 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4187 /* Define data structures, macros, and functions for handling sizes
4188 and the various types used to represent sizes. */
4192 SIZETYPE
, /* Normal representation of sizes in bytes. */
4193 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4194 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4195 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4198 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4200 #define sizetype sizetype_tab[(int) SIZETYPE]
4201 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4202 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4203 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4205 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4206 extern tree
size_binop (enum tree_code
, tree
, tree
);
4207 extern tree
size_diffop (tree
, tree
);
4209 #define size_int(L) size_int_kind (L, SIZETYPE)
4210 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4211 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4212 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4214 extern tree
round_up (tree
, int);
4215 extern tree
round_down (tree
, int);
4216 extern tree
get_pending_sizes (void);
4217 extern void put_pending_size (tree
);
4218 extern void put_pending_sizes (tree
);
4220 /* Type for sizes of data-type. */
4222 #define BITS_PER_UNIT_LOG \
4223 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4224 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4225 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4227 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4228 extern unsigned int maximum_field_alignment
;
4229 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4230 extern unsigned int initial_max_fld_align
;
4232 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4233 by making the last node in X point to Y.
4234 Returns X, except if X is 0 returns Y. */
4236 extern tree
chainon (tree
, tree
);
4238 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4240 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4241 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4243 /* Return the last tree node in a chain. */
4245 extern tree
tree_last (tree
);
4247 /* Return the node in a chain whose TREE_VALUE is x, NULL if not found. */
4249 extern tree
tree_find_value (tree
, tree
);
4251 /* Reverse the order of elements in a chain, and return the new head. */
4253 extern tree
nreverse (tree
);
4255 /* Returns the length of a chain of nodes
4256 (number of chain pointers to follow before reaching a null pointer). */
4258 extern int list_length (const_tree
);
4260 /* Returns the number of FIELD_DECLs in a type. */
4262 extern int fields_length (const_tree
);
4264 /* Given an initializer INIT, return TRUE if INIT is zero or some
4265 aggregate of zeros. Otherwise return FALSE. */
4267 extern bool initializer_zerop (const_tree
);
4269 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4271 extern tree
ctor_to_list (tree
);
4273 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4275 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4277 /* Examine CTOR to discover:
4278 * how many scalar fields are set to nonzero values,
4279 and place it in *P_NZ_ELTS;
4280 * how many scalar fields in total are in CTOR,
4281 and place it in *P_ELT_COUNT.
4282 * if a type is a union, and the initializer from the constructor
4283 is not the largest element in the union, then set *p_must_clear.
4285 Return whether or not CTOR is a valid static constant initializer, the same
4286 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4288 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4291 extern HOST_WIDE_INT
count_type_elements (const_tree
, bool);
4293 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4295 extern int integer_zerop (const_tree
);
4297 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4299 extern int integer_onep (const_tree
);
4301 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4302 all of whose significant bits are 1. */
4304 extern int integer_all_onesp (const_tree
);
4306 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4307 exactly one bit 1. */
4309 extern int integer_pow2p (const_tree
);
4311 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4312 with a nonzero value. */
4314 extern int integer_nonzerop (const_tree
);
4316 extern bool cst_and_fits_in_hwi (const_tree
);
4317 extern tree
num_ending_zeros (const_tree
);
4319 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4322 extern int fixed_zerop (const_tree
);
4324 /* staticp (tree x) is nonzero if X is a reference to data allocated
4325 at a fixed address in memory. Returns the outermost data. */
4327 extern tree
staticp (tree
);
4329 /* save_expr (EXP) returns an expression equivalent to EXP
4330 but it can be used multiple times within context CTX
4331 and only evaluate EXP once. */
4333 extern tree
save_expr (tree
);
4335 /* Look inside EXPR and into any simple arithmetic operations. Return
4336 the innermost non-arithmetic node. */
4338 extern tree
skip_simple_arithmetic (tree
);
4340 /* Return which tree structure is used by T. */
4342 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4344 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4345 or offset that depends on a field within a record.
4347 Note that we only allow such expressions within simple arithmetic
4350 extern bool contains_placeholder_p (const_tree
);
4352 /* This macro calls the above function but short-circuits the common
4353 case of a constant to save time. Also check for null. */
4355 #define CONTAINS_PLACEHOLDER_P(EXP) \
4356 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4358 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4359 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4362 extern bool type_contains_placeholder_p (tree
);
4364 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4365 return a tree with all occurrences of references to F in a
4366 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4367 contains only arithmetic expressions. */
4369 extern tree
substitute_in_expr (tree
, tree
, tree
);
4371 /* This macro calls the above function but short-circuits the common
4372 case of a constant to save time and also checks for NULL. */
4374 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4375 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4377 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4378 for it within OBJ, a tree that is an object or a chain of references. */
4380 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4382 /* This macro calls the above function but short-circuits the common
4383 case of a constant to save time and also checks for NULL. */
4385 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4386 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4387 : substitute_placeholder_in_expr (EXP, OBJ))
4389 /* variable_size (EXP) is like save_expr (EXP) except that it
4390 is for the special case of something that is part of a
4391 variable size for a data type. It makes special arrangements
4392 to compute the value at the right time when the data type
4393 belongs to a function parameter. */
4395 extern tree
variable_size (tree
);
4397 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4398 but it can be used multiple times
4399 and only evaluate the subexpressions once. */
4401 extern tree
stabilize_reference (tree
);
4403 /* Subroutine of stabilize_reference; this is called for subtrees of
4404 references. Any expression with side-effects must be put in a SAVE_EXPR
4405 to ensure that it is only evaluated once. */
4407 extern tree
stabilize_reference_1 (tree
);
4409 /* Return EXP, stripped of any conversions to wider types
4410 in such a way that the result of converting to type FOR_TYPE
4411 is the same as if EXP were converted to FOR_TYPE.
4412 If FOR_TYPE is 0, it signifies EXP's type. */
4414 extern tree
get_unwidened (tree
, tree
);
4416 /* Return OP or a simpler expression for a narrower value
4417 which can be sign-extended or zero-extended to give back OP.
4418 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4419 or 0 if the value should be sign-extended. */
4421 extern tree
get_narrower (tree
, int *);
4423 /* Return true if T is an expression that get_inner_reference handles. */
4426 handled_component_p (const_tree t
)
4428 switch (TREE_CODE (t
))
4433 case ARRAY_RANGE_REF
:
4434 case VIEW_CONVERT_EXPR
:
4444 /* Given an expression EXP that is a handled_component_p,
4445 look for the ultimate containing object, which is returned and specify
4446 the access position and size. */
4448 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4449 tree
*, enum machine_mode
*, int *, int *,
4452 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4453 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4454 EXP is marked as PACKED. */
4456 extern bool contains_packed_reference (const_tree exp
);
4458 /* Return a tree of sizetype representing the size, in bytes, of the element
4459 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4461 extern tree
array_ref_element_size (tree
);
4463 /* Return a tree representing the lower bound of the array mentioned in
4464 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4466 extern tree
array_ref_low_bound (tree
);
4468 /* Return a tree representing the upper bound of the array mentioned in
4469 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4471 extern tree
array_ref_up_bound (tree
);
4473 /* Return a tree representing the offset, in bytes, of the field referenced
4474 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4476 extern tree
component_ref_field_offset (tree
);
4478 /* Given a DECL or TYPE, return the scope in which it was declared, or
4479 NUL_TREE if there is no containing scope. */
4481 extern tree
get_containing_scope (const_tree
);
4483 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4485 extern tree
decl_function_context (const_tree
);
4487 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4488 this _DECL with its context, or zero if none. */
4489 extern tree
decl_type_context (const_tree
);
4491 /* Return 1 if EXPR is the real constant zero. */
4492 extern int real_zerop (const_tree
);
4494 /* Declare commonly used variables for tree structure. */
4496 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4497 Zero means allow extended lvalues. */
4499 extern int pedantic_lvalues
;
4501 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4503 extern GTY(()) tree current_function_decl
;
4505 /* Nonzero means a FUNC_BEGIN label was emitted. */
4506 extern GTY(()) const char * current_function_func_begin_label
;
4508 /* Iterator for going through the function arguments. */
4510 tree fntype
; /* function type declaration */
4511 tree next
; /* TREE_LIST pointing to the next argument */
4512 } function_args_iterator
;
4514 /* Initialize the iterator I with arguments from function FNDECL */
4517 function_args_iter_init (function_args_iterator
*i
, tree fntype
)
4520 i
->next
= TYPE_ARG_TYPES (fntype
);
4523 /* Return a pointer that holds the next argument if there are more arguments to
4524 handle, otherwise return NULL. */
4526 static inline tree
*
4527 function_args_iter_cond_ptr (function_args_iterator
*i
)
4529 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4532 /* Return the next argument if there are more arguments to handle, otherwise
4536 function_args_iter_cond (function_args_iterator
*i
)
4538 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4541 /* Advance to the next argument. */
4543 function_args_iter_next (function_args_iterator
*i
)
4545 gcc_assert (i
->next
!= NULL_TREE
);
4546 i
->next
= TREE_CHAIN (i
->next
);
4549 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4552 inlined_function_outer_scope_p (const_tree block
)
4554 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
4557 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4558 to point to the next tree element. ITER is an instance of
4559 function_args_iterator used to iterate the arguments. */
4560 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4561 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4562 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4563 function_args_iter_next (&(ITER)))
4565 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4566 to the next tree element. ITER is an instance of function_args_iterator
4567 used to iterate the arguments. */
4568 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4569 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4570 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4571 function_args_iter_next (&(ITER)))
4576 extern unsigned crc32_string (unsigned, const char *);
4577 extern void clean_symbol_name (char *);
4578 extern tree
get_file_function_name (const char *);
4579 extern tree
get_callee_fndecl (const_tree
);
4580 extern int type_num_arguments (const_tree
);
4581 extern bool associative_tree_code (enum tree_code
);
4582 extern bool commutative_tree_code (enum tree_code
);
4583 extern tree
upper_bound_in_type (tree
, tree
);
4584 extern tree
lower_bound_in_type (tree
, tree
);
4585 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4586 extern tree
call_expr_arg (tree
, int);
4587 extern tree
*call_expr_argp (tree
, int);
4588 extern tree
call_expr_arglist (tree
);
4589 extern tree
create_artificial_label (location_t
);
4590 extern const char *get_name (tree
);
4591 extern bool stdarg_p (tree
);
4592 extern bool prototype_p (tree
);
4593 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4594 extern tree
build_low_bits_mask (tree
, unsigned);
4595 extern tree
tree_strip_nop_conversions (tree
);
4596 extern tree
tree_strip_sign_nop_conversions (tree
);
4599 extern void change_decl_assembler_name (tree
, tree
);
4602 extern tree
unshare_expr (tree
);
4606 extern void expand_expr_stmt (tree
);
4607 extern int warn_if_unused_value (const_tree
, location_t
);
4608 extern void expand_label (tree
);
4609 extern void expand_goto (tree
);
4611 extern rtx
expand_stack_save (void);
4612 extern void expand_stack_restore (tree
);
4613 extern void expand_return (tree
);
4616 extern void using_eh_for_cleanups (void);
4618 /* In fold-const.c */
4620 /* Non-zero if we are folding constants inside an initializer; zero
4622 extern int folding_initializer
;
4624 /* Convert between trees and native memory representation. */
4625 extern int native_encode_expr (const_tree
, unsigned char *, int);
4626 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4628 /* Fold constants as much as possible in an expression.
4629 Returns the simplified expression.
4630 Acts only on the top level of the expression;
4631 if the argument itself cannot be simplified, its
4632 subexpressions are not changed. */
4634 extern tree
fold (tree
);
4635 extern tree
fold_unary (enum tree_code
, tree
, tree
);
4636 extern tree
fold_unary_ignore_overflow (enum tree_code
, tree
, tree
);
4637 extern tree
fold_binary (enum tree_code
, tree
, tree
, tree
);
4638 extern tree
fold_ternary (enum tree_code
, tree
, tree
, tree
, tree
);
4639 extern tree
fold_build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4640 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4641 extern tree
fold_build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4642 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4643 extern tree
fold_build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4644 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4645 extern tree
fold_build1_initializer (enum tree_code
, tree
, tree
);
4646 extern tree
fold_build2_initializer (enum tree_code
, tree
, tree
, tree
);
4647 extern tree
fold_build3_initializer (enum tree_code
, tree
, tree
, tree
, tree
);
4648 extern tree
fold_build_call_array (tree
, tree
, int, tree
*);
4649 extern tree
fold_build_call_array_initializer (tree
, tree
, int, tree
*);
4650 extern bool fold_convertible_p (const_tree
, const_tree
);
4651 extern tree
fold_convert (tree
, tree
);
4652 extern tree
fold_single_bit_test (enum tree_code
, tree
, tree
, tree
);
4653 extern tree
fold_ignored_result (tree
);
4654 extern tree
fold_abs_const (tree
, tree
);
4655 extern tree
fold_indirect_ref_1 (tree
, tree
);
4656 extern void fold_defer_overflow_warnings (void);
4657 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4658 extern void fold_undefer_and_ignore_overflow_warnings (void);
4659 extern bool fold_deferring_overflow_warnings_p (void);
4661 extern tree
force_fit_type_double (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4664 extern int fit_double_type (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4665 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, const_tree
);
4666 extern int add_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4667 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4668 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4670 #define add_double(l1,h1,l2,h2,lv,hv) \
4671 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4672 extern int neg_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4673 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4674 extern int mul_double_with_sign (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4675 unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4676 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4678 #define mul_double(l1,h1,l2,h2,lv,hv) \
4679 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4680 extern void lshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4681 HOST_WIDE_INT
, unsigned int,
4682 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4683 extern void rshift_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4684 HOST_WIDE_INT
, unsigned int,
4685 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*, int);
4686 extern void lrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4687 HOST_WIDE_INT
, unsigned int,
4688 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4689 extern void rrotate_double (unsigned HOST_WIDE_INT
, HOST_WIDE_INT
,
4690 HOST_WIDE_INT
, unsigned int,
4691 unsigned HOST_WIDE_INT
*, HOST_WIDE_INT
*);
4693 extern int div_and_round_double (enum tree_code
, int, unsigned HOST_WIDE_INT
,
4694 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
4695 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
*,
4696 HOST_WIDE_INT
*, unsigned HOST_WIDE_INT
*,
4699 enum operand_equal_flag
4705 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4706 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4707 extern tree
omit_one_operand (tree
, tree
, tree
);
4708 extern tree
omit_two_operands (tree
, tree
, tree
, tree
);
4709 extern tree
invert_truthvalue (tree
);
4710 extern tree
fold_truth_not_expr (tree
);
4711 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4712 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4713 extern tree
fold_read_from_constant_string (tree
);
4714 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
, int);
4715 extern tree
build_fold_addr_expr (tree
);
4716 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4717 extern tree
fold_strip_sign_ops (tree
);
4718 extern tree
build_fold_addr_expr_with_type (tree
, tree
);
4719 extern tree
build_fold_indirect_ref (tree
);
4720 extern tree
fold_indirect_ref (tree
);
4721 extern tree
constant_boolean_node (int, tree
);
4722 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
4724 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
4725 extern enum tree_code
swap_tree_comparison (enum tree_code
);
4727 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
4728 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
4730 extern bool tree_expr_nonzero_p (tree
);
4731 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
4732 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
4734 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
4735 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4736 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
4737 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
4739 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4740 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
4741 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
4743 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
4745 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
4746 extern tree
combine_comparisons (enum tree_code
, enum tree_code
,
4747 enum tree_code
, tree
, tree
, tree
);
4748 extern void debug_fold_checksum (const_tree
);
4750 /* Return nonzero if CODE is a tree code that represents a truth value. */
4752 truth_value_p (enum tree_code code
)
4754 return (TREE_CODE_CLASS (code
) == tcc_comparison
4755 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4756 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4757 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
4762 extern tree
fold_call_expr (tree
, bool);
4763 extern tree
fold_builtin_fputs (tree
, tree
, bool, bool, tree
);
4764 extern tree
fold_builtin_strcpy (tree
, tree
, tree
, tree
);
4765 extern tree
fold_builtin_strncpy (tree
, tree
, tree
, tree
, tree
);
4766 extern tree
fold_builtin_memory_chk (tree
, tree
, tree
, tree
, tree
, tree
, bool,
4767 enum built_in_function
);
4768 extern tree
fold_builtin_stxcpy_chk (tree
, tree
, tree
, tree
, tree
, bool,
4769 enum built_in_function
);
4770 extern tree
fold_builtin_strncpy_chk (tree
, tree
, tree
, tree
, tree
);
4771 extern tree
fold_builtin_snprintf_chk (tree
, tree
, enum built_in_function
);
4772 extern bool fold_builtin_next_arg (tree
, bool);
4773 extern enum built_in_function
builtin_mathfn_code (const_tree
);
4774 extern tree
build_function_call_expr (tree
, tree
);
4775 extern tree
fold_builtin_call_array (tree
, tree
, int, tree
*);
4776 extern tree
build_call_expr (tree
, int, ...);
4777 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
4778 extern tree
c_strlen (tree
, int);
4779 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
4780 extern tree
build_va_arg_indirect_ref (tree
);
4781 extern tree
build_string_literal (int, const char *);
4782 extern bool validate_arglist (const_tree
, ...);
4783 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
4784 extern int get_pointer_alignment (tree
, unsigned int);
4785 extern bool is_builtin_name (const char*);
4786 extern int get_object_alignment (tree
, unsigned int, unsigned int);
4787 extern tree
fold_call_stmt (gimple
, bool);
4788 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
4789 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
4790 extern tree
build_range_check (tree
, tree
, int, tree
, tree
);
4791 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
4795 extern tree
strip_float_extensions (tree
);
4798 extern int really_constant_p (const_tree
);
4799 extern bool decl_address_invariant_p (const_tree
);
4800 extern bool decl_address_ip_invariant_p (const_tree
);
4801 extern int int_fits_type_p (const_tree
, const_tree
);
4802 #ifndef GENERATOR_FILE
4803 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
4805 extern bool variably_modified_type_p (tree
, tree
);
4806 extern int tree_log2 (const_tree
);
4807 extern int tree_floor_log2 (const_tree
);
4808 extern int simple_cst_equal (const_tree
, const_tree
);
4809 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
4810 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
4811 const_tree
, hashval_t
);
4812 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
4813 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
4814 extern int type_list_equal (const_tree
, const_tree
);
4815 extern int chain_member (const_tree
, const_tree
);
4816 extern tree
type_hash_lookup (unsigned int, tree
);
4817 extern void type_hash_add (unsigned int, tree
);
4818 extern int simple_cst_list_equal (const_tree
, const_tree
);
4819 extern void dump_tree_statistics (void);
4820 extern void recompute_tree_invariant_for_addr_expr (tree
);
4821 extern bool needs_to_live_in_memory (const_tree
);
4822 extern tree
reconstruct_complex_type (tree
, tree
);
4824 extern int real_onep (const_tree
);
4825 extern int real_twop (const_tree
);
4826 extern int real_minus_onep (const_tree
);
4827 extern void init_ttree (void);
4828 extern void build_common_tree_nodes (bool, bool);
4829 extern void build_common_tree_nodes_2 (int);
4830 extern void build_common_builtin_nodes (void);
4831 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
4832 extern tree
build_range_type (tree
, tree
, tree
);
4833 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
4834 extern HOST_WIDE_INT
int_cst_value (const_tree
);
4835 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
4837 extern bool fields_compatible_p (const_tree
, const_tree
);
4838 extern tree
find_compatible_field (tree
, tree
);
4840 extern void set_expr_locus (tree
, source_location
*);
4842 extern tree
*tree_block (tree
);
4843 extern location_t
*block_nonartificial_location (tree
);
4844 extern location_t
tree_nonartificial_location (tree
);
4846 extern tree
block_ultimate_origin (const_tree
);
4848 /* In tree-nested.c */
4849 extern tree
build_addr (tree
, tree
);
4852 extern void expand_main_function (void);
4853 extern void expand_function_end (void);
4854 extern void expand_function_start (tree
);
4855 extern void stack_protect_prologue (void);
4856 extern void stack_protect_epilogue (void);
4857 extern void init_dummy_function_start (void);
4858 extern void expand_dummy_function_end (void);
4859 extern unsigned int init_function_for_compilation (void);
4860 extern void allocate_struct_function (tree
, bool);
4861 extern void push_struct_function (tree fndecl
);
4862 extern void init_function_start (tree
);
4863 extern bool use_register_for_decl (const_tree
);
4864 extern void generate_setjmp_warnings (void);
4865 extern void init_temp_slots (void);
4866 extern void free_temp_slots (void);
4867 extern void pop_temp_slots (void);
4868 extern void push_temp_slots (void);
4869 extern void preserve_temp_slots (rtx
);
4870 extern int aggregate_value_p (const_tree
, const_tree
);
4871 extern void push_function_context (void);
4872 extern void pop_function_context (void);
4873 extern gimple_seq
gimplify_parameters (void);
4875 /* In print-rtl.c */
4877 extern void print_rtl (FILE *, const_rtx
);
4880 /* In print-tree.c */
4881 extern void debug_tree (tree
);
4883 extern void dump_addr (FILE*, const char *, const void *);
4884 extern void print_node (FILE *, const char *, tree
, int);
4885 extern void print_node_brief (FILE *, const char *, const_tree
, int);
4886 extern void indent_to (FILE *, int);
4889 /* In tree-inline.c: */
4890 extern bool debug_find_tree (tree
, tree
);
4891 /* This is in tree-inline.c since the routine uses
4892 data structures from the inliner. */
4893 extern tree
unsave_expr_now (tree
);
4894 extern tree
build_duplicate_type (tree
);
4898 /* Nonzero if this is a call to a function whose return value depends
4899 solely on its arguments, has no side effects, and does not read
4900 global memory. This corresponds to TREE_READONLY for function
4902 #define ECF_CONST (1 << 0)
4903 /* Nonzero if this is a call to "pure" function (like const function,
4904 but may read memory. This corresponds to DECL_PURE_P for function
4906 #define ECF_PURE (1 << 1)
4907 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
4908 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
4909 for function decls.*/
4910 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
4911 /* Nonzero if this call will never return. */
4912 #define ECF_NORETURN (1 << 3)
4913 /* Nonzero if this is a call to malloc or a related function. */
4914 #define ECF_MALLOC (1 << 4)
4915 /* Nonzero if it is plausible that this is a call to alloca. */
4916 #define ECF_MAY_BE_ALLOCA (1 << 5)
4917 /* Nonzero if this is a call to a function that won't throw an exception. */
4918 #define ECF_NOTHROW (1 << 6)
4919 /* Nonzero if this is a call to setjmp or a related function. */
4920 #define ECF_RETURNS_TWICE (1 << 7)
4921 /* Nonzero if this call replaces the current stack frame. */
4922 #define ECF_SIBCALL (1 << 8)
4923 /* Function does not read or write memory (but may have side effects, so
4924 it does not necessarily fit ECF_CONST). */
4925 #define ECF_NOVOPS (1 << 9)
4927 extern int flags_from_decl_or_type (const_tree
);
4928 extern int call_expr_flags (const_tree
);
4930 extern int setjmp_call_p (const_tree
);
4931 extern bool gimple_alloca_call_p (const_gimple
);
4932 extern bool alloca_call_p (const_tree
);
4933 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
4934 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
4938 extern const struct attribute_spec
*lookup_attribute_spec (tree
);
4940 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4941 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4942 it should be modified in place; if a TYPE, a copy should be created
4943 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4944 information, in the form of a bitwise OR of flags in enum attribute_flags
4945 from tree.h. Depending on these flags, some attributes may be
4946 returned to be applied at a later stage (for example, to apply
4947 a decl attribute to the declaration rather than to its type). */
4948 extern tree
decl_attributes (tree
*, tree
, int);
4950 /* In integrate.c */
4951 extern void set_decl_abstract_flags (tree
, int);
4952 extern void set_decl_origin_self (tree
);
4954 /* In stor-layout.c */
4955 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
4956 extern void fixup_signed_type (tree
);
4957 extern void internal_reference_types (void);
4958 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
4961 extern void make_decl_rtl (tree
);
4962 extern void make_decl_one_only (tree
, tree
);
4963 extern int supports_one_only (void);
4964 extern void resolve_unique_section (tree
, int, int);
4965 extern void mark_referenced (tree
);
4966 extern void mark_decl_referenced (tree
);
4967 extern void notice_global_symbol (tree
);
4968 extern void set_user_assembler_name (tree
, const char *);
4969 extern void process_pending_assemble_externals (void);
4970 extern void finish_aliases_1 (void);
4971 extern void finish_aliases_2 (void);
4972 extern tree
emutls_decl (tree
);
4975 extern void expand_computed_goto (tree
);
4976 extern bool parse_output_constraint (const char **, int, int, int,
4977 bool *, bool *, bool *);
4978 extern bool parse_input_constraint (const char **, int, int, int, int,
4979 const char * const *, bool *, bool *);
4980 extern void expand_asm_expr (tree
);
4981 extern tree
resolve_asm_operand_names (tree
, tree
, tree
);
4982 extern void expand_case (tree
);
4983 extern void expand_decl (tree
);
4985 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4986 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
4990 /* In dwarf2out.c */
4991 /* Interface of the DWARF2 unwind info support. */
4993 /* Generate a new label for the CFI info to refer to. */
4995 extern char *dwarf2out_cfi_label (bool);
4997 /* Entry point to update the canonical frame address (CFA). */
4999 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
5001 /* Add the CFI for saving a register window. */
5003 extern void dwarf2out_window_save (const char *);
5005 /* Add a CFI to update the running total of the size of arguments pushed
5008 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT
);
5010 /* Entry point for saving a register to the stack. */
5012 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
5014 /* Entry point for saving the return address in the stack. */
5016 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
5018 /* Entry point for saving the return address in a register. */
5020 extern void dwarf2out_return_reg (const char *, unsigned);
5022 /* Entry point for saving the first register into the second. */
5024 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
5026 /* In tree-inline.c */
5028 /* The type of a set of already-visited pointers. Functions for creating
5029 and manipulating it are declared in pointer-set.h */
5030 struct pointer_set_t
;
5032 /* The type of a callback function for walking over tree structure. */
5034 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5036 /* The type of a callback function that represents a custom walk_tree. */
5038 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5039 void *, struct pointer_set_t
*);
5041 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5043 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5045 #define walk_tree(a,b,c,d) \
5046 walk_tree_1 (a, b, c, d, NULL)
5047 #define walk_tree_without_duplicates(a,b,c) \
5048 walk_tree_without_duplicates_1 (a, b, c, NULL)
5051 /* Assign the RTX to declaration. */
5053 extern void set_decl_rtl (tree
, rtx
);
5054 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5056 /* Enum and arrays used for tree allocation stats.
5057 Keep in sync with tree.c:tree_node_kind_names. */
5081 extern int tree_node_counts
[];
5082 extern int tree_node_sizes
[];
5084 /* True if we are in gimple form and the actions of the folders need to
5085 be restricted. False if we are not in gimple form and folding is not
5086 restricted to creating gimple expressions. */
5087 extern bool in_gimple_form
;
5090 extern tree
get_base_address (tree t
);
5092 /* In tree-vectorizer.c. */
5093 extern void vect_set_verbosity_level (const char *);
5097 struct GTY(()) tree_map_base
{
5101 extern int tree_map_base_eq (const void *, const void *);
5102 extern unsigned int tree_map_base_hash (const void *);
5103 extern int tree_map_base_marked_p (const void *);
5104 extern bool list_equal_p (const_tree
, const_tree
);
5106 /* Map from a tree to another tree. */
5108 struct GTY(()) tree_map
{
5109 struct tree_map_base base
;
5114 #define tree_map_eq tree_map_base_eq
5115 extern unsigned int tree_map_hash (const void *);
5116 #define tree_map_marked_p tree_map_base_marked_p
5118 /* Map from a tree to an int. */
5120 struct GTY(()) tree_int_map
{
5121 struct tree_map_base base
;
5125 #define tree_int_map_eq tree_map_base_eq
5126 #define tree_int_map_hash tree_map_base_hash
5127 #define tree_int_map_marked_p tree_map_base_marked_p
5129 /* Map from a tree to initialization/finalization priorities. */
5131 struct GTY(()) tree_priority_map
{
5132 struct tree_map_base base
;
5137 #define tree_priority_map_eq tree_map_base_eq
5138 #define tree_priority_map_hash tree_map_base_hash
5139 #define tree_priority_map_marked_p tree_map_base_marked_p
5141 /* In tree-ssa-ccp.c */
5142 extern tree
maybe_fold_offset_to_reference (location_t
, tree
, tree
, tree
);
5143 extern tree
maybe_fold_offset_to_address (location_t
, tree
, tree
, tree
);
5144 extern tree
maybe_fold_stmt_addition (location_t
, tree
, tree
, tree
);
5146 /* In tree-ssa-address.c. */
5147 extern tree
tree_mem_ref_addr (tree
, tree
);
5148 extern void copy_mem_ref_info (tree
, tree
);
5151 extern bool ssa_name_nonnegative_p (const_tree
);
5153 /* In tree-object-size.c. */
5154 extern void init_object_sizes (void);
5155 extern void fini_object_sizes (void);
5156 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5159 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5161 /* In tree-inline.c. */
5163 void init_inline_once (void);
5165 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5166 extern GTY(()) tree memory_identifier_string
;
5168 /* Compute the number of operands in an expression node NODE. For
5169 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5170 otherwise it is looked up from the node's code. */
5172 tree_operand_length (const_tree node
)
5174 if (VL_EXP_CLASS_P (node
))
5175 return VL_EXP_OPERAND_LENGTH (node
);
5177 return TREE_CODE_LENGTH (TREE_CODE (node
));
5180 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5181 have to go towards the end of tree.h so that union tree_node is fully
5182 defined by this point. */
5184 /* Structure containing iterator state. */
5185 typedef struct GTY (()) call_expr_arg_iterator_d
{
5186 tree t
; /* the call_expr */
5187 int n
; /* argument count */
5188 int i
; /* next argument index */
5189 } call_expr_arg_iterator
;
5191 typedef struct GTY (()) const_call_expr_arg_iterator_d
{
5192 const_tree t
; /* the call_expr */
5193 int n
; /* argument count */
5194 int i
; /* next argument index */
5195 } const_call_expr_arg_iterator
;
5197 /* Initialize the abstract argument list iterator object ITER with the
5198 arguments from CALL_EXPR node EXP. */
5200 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5203 iter
->n
= call_expr_nargs (exp
);
5208 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5211 iter
->n
= call_expr_nargs (exp
);
5215 /* Return the next argument from abstract argument list iterator object ITER,
5216 and advance its state. Return NULL_TREE if there are no more arguments. */
5218 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5221 if (iter
->i
>= iter
->n
)
5223 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5228 static inline const_tree
5229 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5232 if (iter
->i
>= iter
->n
)
5234 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5239 /* Initialize the abstract argument list iterator object ITER, then advance
5240 past and return the first argument. Useful in for expressions, e.g.
5241 for (arg = first_call_expr_arg (exp, &iter); arg;
5242 arg = next_call_expr_arg (&iter)) */
5244 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5246 init_call_expr_arg_iterator (exp
, iter
);
5247 return next_call_expr_arg (iter
);
5250 static inline const_tree
5251 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5253 init_const_call_expr_arg_iterator (exp
, iter
);
5254 return next_const_call_expr_arg (iter
);
5257 /* Test whether there are more arguments in abstract argument list iterator
5258 ITER, without changing its state. */
5260 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5262 return (iter
->i
< iter
->n
);
5266 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5268 return (iter
->i
< iter
->n
);
5271 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5272 (of type call_expr_arg_iterator) to hold the iteration state. */
5273 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5274 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5275 (arg) = next_call_expr_arg (&(iter)))
5277 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5278 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5279 (arg) = next_const_call_expr_arg (&(iter)))
5281 #endif /* GCC_TREE_H */