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, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
30 #include "double-int.h"
34 /* Codes of tree nodes */
36 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
40 #include "all-tree.def"
45 #undef END_OF_BASE_TREE_CODES
47 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
50 /* Number of language-independent tree codes. */
51 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
53 /* Tree code classes. */
55 /* Each tree_code has an associated code class represented by a
58 enum tree_code_class {
59 tcc_exceptional, /* An exceptional code (fits no category). */
60 tcc_constant, /* A constant. */
61 /* Order of tcc_type and tcc_declaration is important. */
62 tcc_type, /* A type object code. */
63 tcc_declaration, /* A declaration (also serving as variable refs). */
64 tcc_reference, /* A reference to storage. */
65 tcc_comparison, /* A comparison expression. */
66 tcc_unary, /* A unary arithmetic expression. */
67 tcc_binary, /* A binary arithmetic expression. */
68 tcc_statement, /* A statement expression, which have side effects
69 but usually no interesting value. */
70 tcc_vl_exp, /* A function call or other expression with a
71 variable-length operand vector. */
72 tcc_expression /* Any other expression. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
110 #define VAR_OR_FUNCTION_DECL_P(DECL)\
111 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
113 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
114 ascending code order. */
116 #define INDIRECT_REF_P(CODE)\
117 (TREE_CODE (CODE) == INDIRECT_REF \
118 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
119 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
121 /* Nonzero if CODE represents a reference. */
123 #define REFERENCE_CLASS_P(CODE)\
124 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
126 /* Nonzero if CODE represents a comparison. */
128 #define COMPARISON_CLASS_P(CODE)\
129 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
131 /* Nonzero if CODE represents a unary arithmetic expression. */
133 #define UNARY_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
136 /* Nonzero if CODE represents a binary arithmetic expression. */
138 #define BINARY_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
141 /* Nonzero if CODE represents a statement expression. */
143 #define STATEMENT_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
146 /* Nonzero if CODE represents a function call-like expression with a
147 variable-length operand vector. */
149 #define VL_EXP_CLASS_P(CODE)\
150 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
152 /* Nonzero if CODE represents any other expression. */
154 #define EXPRESSION_CLASS_P(CODE)\
155 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
157 /* Returns nonzero iff CODE represents a type or declaration. */
159 #define IS_TYPE_OR_DECL_P(CODE)\
160 (TYPE_P (CODE) || DECL_P (CODE))
162 /* Returns nonzero iff CLASS is the tree-code class of an
165 #define IS_EXPR_CODE_CLASS(CLASS)\
166 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
168 /* Returns nonzero iff NODE is an expression of some kind. */
170 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
172 /* Number of argument-words in each kind of tree-node. */
174 extern const unsigned char tree_code_length[];
175 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
177 /* Names of tree components. */
179 extern const char *const tree_code_name[];
181 /* A vectors of trees. */
183 DEF_VEC_ALLOC_P(tree,gc);
184 DEF_VEC_ALLOC_P(tree,heap);
186 /* We have to be able to tell cgraph about the needed-ness of the target
187 of an alias. This requires that the decl have been defined. Aliases
188 that precede their definition have to be queued for later processing. */
190 typedef struct GTY(()) alias_pair
196 /* Define gc'd vector type. */
197 DEF_VEC_O(alias_pair);
198 DEF_VEC_ALLOC_O(alias_pair,gc);
200 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
203 /* Classify which part of the compiler has defined a given builtin function.
204 Note that we assume below that this is no more than two bits. */
213 /* Names for the above. */
214 extern const char *const built_in_class_names[4];
216 /* Codes that identify the various built in functions
217 so that expand_call can identify them quickly. */
219 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
220 enum built_in_function
222 #include "builtins.def"
224 /* Complex division routines in libgcc. These are done via builtins
225 because emit_library_call_value can't handle complex values. */
226 BUILT_IN_COMPLEX_MUL_MIN,
227 BUILT_IN_COMPLEX_MUL_MAX
228 = BUILT_IN_COMPLEX_MUL_MIN
229 + MAX_MODE_COMPLEX_FLOAT
230 - MIN_MODE_COMPLEX_FLOAT,
232 BUILT_IN_COMPLEX_DIV_MIN,
233 BUILT_IN_COMPLEX_DIV_MAX
234 = BUILT_IN_COMPLEX_DIV_MIN
235 + MAX_MODE_COMPLEX_FLOAT
236 - MIN_MODE_COMPLEX_FLOAT,
238 /* Upper bound on non-language-specific builtins. */
243 /* Names for the above. */
244 extern const char * built_in_names[(int) END_BUILTINS];
246 /* Helper macros for math builtins. */
248 #define BUILTIN_EXP10_P(FN) \
249 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
250 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
252 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
253 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
254 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
256 #define BUILTIN_SQRT_P(FN) \
257 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
259 #define BUILTIN_CBRT_P(FN) \
260 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
262 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
264 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
265 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
266 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
268 /* An array of _DECL trees for the above. */
269 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
270 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
272 /* In an OMP_CLAUSE node. */
274 /* Number of operands and names for each clause. */
275 extern unsigned const char omp_clause_num_ops[];
276 extern const char * const omp_clause_code_name[];
278 /* Clause codes. Do not reorder, as this is used to index into the tables
279 omp_clause_num_ops and omp_clause_code_name. */
282 /* Clause zero is special-cased inside the parser
283 (c_parser_omp_variable_list). */
284 OMP_CLAUSE_ERROR = 0,
286 /* OpenMP clause: private (variable_list). */
289 /* OpenMP clause: shared (variable_list). */
292 /* OpenMP clause: firstprivate (variable_list). */
293 OMP_CLAUSE_FIRSTPRIVATE,
295 /* OpenMP clause: lastprivate (variable_list). */
296 OMP_CLAUSE_LASTPRIVATE,
298 /* OpenMP clause: reduction (operator:variable_list).
299 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
300 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
301 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
303 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
304 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
305 OMP_CLAUSE_REDUCTION,
307 /* OpenMP clause: copyin (variable_list). */
310 /* OpenMP clause: copyprivate (variable_list). */
311 OMP_CLAUSE_COPYPRIVATE,
313 /* OpenMP clause: if (scalar-expression). */
316 /* OpenMP clause: num_threads (integer-expression). */
317 OMP_CLAUSE_NUM_THREADS,
319 /* OpenMP clause: schedule. */
322 /* OpenMP clause: nowait. */
325 /* OpenMP clause: ordered. */
328 /* OpenMP clause: default. */
331 /* OpenMP clause: collapse (constant-integer-expression). */
334 /* OpenMP clause: untied. */
338 /* The definition of tree nodes fills the next several pages. */
340 /* A tree node can represent a data type, a variable, an expression
341 or a statement. Each node has a TREE_CODE which says what kind of
342 thing it represents. Some common codes are:
343 INTEGER_TYPE -- represents a type of integers.
344 ARRAY_TYPE -- represents a type of pointer.
345 VAR_DECL -- represents a declared variable.
346 INTEGER_CST -- represents a constant integer value.
347 PLUS_EXPR -- represents a sum (an expression).
349 As for the contents of a tree node: there are some fields
350 that all nodes share. Each TREE_CODE has various special-purpose
351 fields as well. The fields of a node are never accessed directly,
352 always through accessor macros. */
354 /* Every kind of tree node starts with this structure,
355 so all nodes have these fields.
357 See the accessor macros, defined below, for documentation of the
360 struct GTY(()) tree_base {
361 ENUM_BITFIELD(tree_code) code : 16;
363 unsigned side_effects_flag : 1;
364 unsigned constant_flag : 1;
365 unsigned addressable_flag : 1;
366 unsigned volatile_flag : 1;
367 unsigned readonly_flag : 1;
368 unsigned unsigned_flag : 1;
369 unsigned asm_written_flag: 1;
370 unsigned nowarning_flag : 1;
372 unsigned used_flag : 1;
373 unsigned nothrow_flag : 1;
374 unsigned static_flag : 1;
375 unsigned public_flag : 1;
376 unsigned private_flag : 1;
377 unsigned protected_flag : 1;
378 unsigned deprecated_flag : 1;
379 unsigned saturating_flag : 1;
381 unsigned default_def_flag : 1;
382 unsigned lang_flag_0 : 1;
383 unsigned lang_flag_1 : 1;
384 unsigned lang_flag_2 : 1;
385 unsigned lang_flag_3 : 1;
386 unsigned lang_flag_4 : 1;
387 unsigned lang_flag_5 : 1;
388 unsigned lang_flag_6 : 1;
390 unsigned visited : 1;
391 unsigned packed_flag : 1;
392 unsigned user_align : 1;
396 /* This field is only used with type nodes; the only reason it is present
397 in tree_base instead of tree_type is to save space. The size of the
398 field must be large enough to hold addr_space_t values. */
399 unsigned address_space : 8;
402 struct GTY(()) tree_common {
403 struct tree_base base;
408 /* The following table lists the uses of each of the above flags and
409 for which types of nodes they are defined.
414 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
416 CONSTRUCTOR, IDENTIFIER_NODE
417 STMT_EXPR, it means we want the result of the enclosed expression
419 CALL_EXPR_TAILCALL in
428 VAR_DECL, FUNCTION_DECL
431 TREE_NO_TRAMPOLINE in
437 TREE_SYMBOL_REFERENCED in
441 TARGET_EXPR, WITH_CLEANUP_EXPR
443 TRY_CATCH_IS_CLEANUP in
449 TYPE_REF_CAN_ALIAS_ALL in
450 POINTER_TYPE, REFERENCE_TYPE
458 CALL_CANNOT_INLINE_P in
467 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
470 VAR_DECL, FUNCTION_DECL
476 CALL_EXPR_VA_ARG_PACK in
479 TYPE_CACHED_VALUES_P in
482 SAVE_EXPR_RESOLVED_P in
485 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
486 OMP_CLAUSE_LASTPRIVATE
488 OMP_CLAUSE_PRIVATE_DEBUG in
496 CALL_EXPR_RETURN_SLOT_OPT in
502 OMP_PARALLEL_COMBINED in
504 OMP_CLAUSE_PRIVATE_OUTER_REF in
507 TYPE_REF_IS_RVALUE in
531 TREE_THIS_VOLATILE in
554 TYPE_SIZES_GIMPLIFIED in
565 REGISTER_DEFS_IN_THIS_STMT in
566 all expressions (tree-into-ssa.c)
571 VAR_DECL, FUNCTION_DECL
572 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
573 BLOCK, SSA_NAME, STRING_CST
576 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
595 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
603 IDENTIFIER_TRANSPARENT_ALIAS in
606 STMT_IN_SSA_EDGE_WORKLIST in
607 all expressions (tree-ssa-propagate.c)
612 all trees (used liberally by many passes)
627 TYPE_VECTOR_OPAQUE in
630 SSA_NAME_IS_DEFAULT_DEF in
635 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
636 enum tree_node_structure_enum {
637 #include "treestruct.def"
642 /* Define accessors for the fields that all tree nodes have
643 (though some fields are not used for all kinds of nodes). */
645 /* The tree-code says what kind of node it is.
646 Codes are defined in tree.def. */
647 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
648 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
650 /* When checking is enabled, errors will be generated if a tree node
651 is accessed incorrectly. The macros die with a fatal error. */
652 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
654 #define TREE_CHECK(T, CODE) __extension__ \
655 ({ __typeof (T) const __t = (T); \
656 if (TREE_CODE (__t) != (CODE)) \
657 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
661 #define TREE_NOT_CHECK(T, CODE) __extension__ \
662 ({ __typeof (T) const __t = (T); \
663 if (TREE_CODE (__t) == (CODE)) \
664 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
668 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
669 ({ __typeof (T) const __t = (T); \
670 if (TREE_CODE (__t) != (CODE1) \
671 && TREE_CODE (__t) != (CODE2)) \
672 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
673 (CODE1), (CODE2), 0); \
676 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
677 ({ __typeof (T) const __t = (T); \
678 if (TREE_CODE (__t) == (CODE1) \
679 || TREE_CODE (__t) == (CODE2)) \
680 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
681 (CODE1), (CODE2), 0); \
684 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
685 ({ __typeof (T) const __t = (T); \
686 if (TREE_CODE (__t) != (CODE1) \
687 && TREE_CODE (__t) != (CODE2) \
688 && TREE_CODE (__t) != (CODE3)) \
689 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 (CODE1), (CODE2), (CODE3), 0); \
693 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
694 ({ __typeof (T) const __t = (T); \
695 if (TREE_CODE (__t) == (CODE1) \
696 || TREE_CODE (__t) == (CODE2) \
697 || TREE_CODE (__t) == (CODE3)) \
698 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
699 (CODE1), (CODE2), (CODE3), 0); \
702 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
703 ({ __typeof (T) const __t = (T); \
704 if (TREE_CODE (__t) != (CODE1) \
705 && TREE_CODE (__t) != (CODE2) \
706 && TREE_CODE (__t) != (CODE3) \
707 && TREE_CODE (__t) != (CODE4)) \
708 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
709 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
712 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
713 ({ __typeof (T) const __t = (T); \
714 if (TREE_CODE (__t) == (CODE1) \
715 || TREE_CODE (__t) == (CODE2) \
716 || TREE_CODE (__t) == (CODE3) \
717 || TREE_CODE (__t) == (CODE4)) \
718 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
722 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
723 ({ __typeof (T) const __t = (T); \
724 if (TREE_CODE (__t) != (CODE1) \
725 && TREE_CODE (__t) != (CODE2) \
726 && TREE_CODE (__t) != (CODE3) \
727 && TREE_CODE (__t) != (CODE4) \
728 && TREE_CODE (__t) != (CODE5)) \
729 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
730 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
733 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
734 ({ __typeof (T) const __t = (T); \
735 if (TREE_CODE (__t) == (CODE1) \
736 || TREE_CODE (__t) == (CODE2) \
737 || TREE_CODE (__t) == (CODE3) \
738 || TREE_CODE (__t) == (CODE4) \
739 || TREE_CODE (__t) == (CODE5)) \
740 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
741 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
744 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
745 ({ __typeof (T) const __t = (T); \
746 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
747 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
751 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
752 ({ __typeof (T) const __t = (T); \
753 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
754 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
758 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
759 ({ __typeof (T) const __t = (T); \
760 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
761 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
765 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
766 ({ __typeof (T) const __t = (T); \
767 if (TREE_CODE (__t) != OMP_CLAUSE) \
768 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
770 if (__t->omp_clause.code != (CODE)) \
771 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
775 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
776 ({ __typeof (T) const __t = (T); \
777 if (TREE_CODE (__t) != OMP_CLAUSE) \
778 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
780 if ((int) __t->omp_clause.code < (int) (CODE1) \
781 || (int) __t->omp_clause.code > (int) (CODE2)) \
782 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
783 __FUNCTION__, (CODE1), (CODE2)); \
786 /* These checks have to be special cased. */
787 #define EXPR_CHECK(T) __extension__ \
788 ({ __typeof (T) const __t = (T); \
789 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
790 if (!IS_EXPR_CODE_CLASS (__c)) \
791 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
795 /* These checks have to be special cased. */
796 #define NON_TYPE_CHECK(T) __extension__ \
797 ({ __typeof (T) const __t = (T); \
799 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
803 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
804 (*({__typeof (T) const __t = (T); \
805 const int __i = (I); \
806 if (TREE_CODE (__t) != TREE_VEC) \
807 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
809 if (__i < 0 || __i >= __t->vec.length) \
810 tree_vec_elt_check_failed (__i, __t->vec.length, \
811 __FILE__, __LINE__, __FUNCTION__); \
812 &__t->vec.a[__i]; }))
814 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
815 (*({__typeof (T) const __t = (T); \
816 const int __i = (I); \
817 if (TREE_CODE (__t) != OMP_CLAUSE) \
818 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
820 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
821 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
823 &__t->omp_clause.ops[__i]; }))
825 /* Special checks for TREE_OPERANDs. */
826 #define TREE_OPERAND_CHECK(T, I) __extension__ \
827 (*({__typeof (T) const __t = EXPR_CHECK (T); \
828 const int __i = (I); \
829 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
830 tree_operand_check_failed (__i, __t, \
831 __FILE__, __LINE__, __FUNCTION__); \
832 &__t->exp.operands[__i]; }))
834 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
835 (*({__typeof (T) const __t = (T); \
836 const int __i = (I); \
837 if (TREE_CODE (__t) != CODE) \
838 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
839 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
840 tree_operand_check_failed (__i, __t, \
841 __FILE__, __LINE__, __FUNCTION__); \
842 &__t->exp.operands[__i]; }))
844 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
846 ({__typeof (T) const __t = (T); \
847 const int __i = (I); \
848 if (TREE_CODE (__t) != (CODE)) \
849 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
850 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
851 tree_operand_check_failed (__i, __t, \
852 __FILE__, __LINE__, __FUNCTION__); \
853 &__t->exp.operands[__i]; }))
855 /* Nodes are chained together for many purposes.
856 Types are chained together to record them for being output to the debugger
857 (see the function `chain_type').
858 Decls in the same scope are chained together to record the contents
860 Statement nodes for successive statements used to be chained together.
861 Often lists of things are represented by TREE_LIST nodes that
862 are chained together. */
864 #define TREE_CHAIN(NODE) __extension__ \
865 (*({__typeof (NODE) const __t = (NODE); \
866 &__t->common.chain; }))
868 /* In all nodes that are expressions, this is the data type of the expression.
869 In POINTER_TYPE nodes, this is the type that the pointer points to.
870 In ARRAY_TYPE nodes, this is the type of the elements.
871 In VECTOR_TYPE nodes, this is the type of the elements. */
872 #define TREE_TYPE(NODE) __extension__ \
873 (*({__typeof (NODE) const __t = (NODE); \
874 &__t->common.type; }))
876 extern void tree_contains_struct_check_failed (const_tree,
877 const enum tree_node_structure_enum,
878 const char *, int, const char *)
881 extern void tree_check_failed (const_tree, const char *, int, const char *,
882 ...) ATTRIBUTE_NORETURN;
883 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
884 ...) ATTRIBUTE_NORETURN;
885 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
886 const char *, int, const char *)
888 extern void tree_range_check_failed (const_tree, const char *, int,
889 const char *, enum tree_code,
891 extern void tree_not_class_check_failed (const_tree,
892 const enum tree_code_class,
893 const char *, int, const char *)
895 extern void tree_vec_elt_check_failed (int, int, const char *,
898 extern void phi_node_elt_check_failed (int, int, const char *,
901 extern void tree_operand_check_failed (int, const_tree,
902 const char *, int, const char *)
904 extern void omp_clause_check_failed (const_tree, const char *, int,
905 const char *, enum omp_clause_code)
907 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
910 extern void omp_clause_range_check_failed (const_tree, const char *, int,
911 const char *, enum omp_clause_code,
912 enum omp_clause_code)
915 #else /* not ENABLE_TREE_CHECKING, or not gcc */
917 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
918 #define TREE_CHECK(T, CODE) (T)
919 #define TREE_NOT_CHECK(T, CODE) (T)
920 #define TREE_CHECK2(T, CODE1, CODE2) (T)
921 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
922 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
923 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
924 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
925 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
926 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
927 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
928 #define TREE_CLASS_CHECK(T, CODE) (T)
929 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
930 #define EXPR_CHECK(T) (T)
931 #define NON_TYPE_CHECK(T) (T)
932 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
933 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
934 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
935 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
936 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
937 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
938 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
940 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
941 #define TREE_TYPE(NODE) ((NODE)->common.type)
945 #define TREE_BLOCK(NODE) *(tree_block (NODE))
947 #include "tree-check.h"
949 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
950 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
951 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
952 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
953 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
954 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
955 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
956 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
957 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
958 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
959 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
961 #define RECORD_OR_UNION_CHECK(T) \
962 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
963 #define NOT_RECORD_OR_UNION_CHECK(T) \
964 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
966 #define NUMERICAL_TYPE_CHECK(T) \
967 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
970 /* Here is how primitive or already-canonicalized types' hash codes
972 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
974 /* A simple hash function for an arbitrary tree node. This must not be
975 used in hash tables which are saved to a PCH. */
976 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
978 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
979 #define CONVERT_EXPR_CODE_P(CODE) \
980 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
982 /* Similarly, but accept an expressions instead of a tree code. */
983 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
985 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
987 #define CASE_CONVERT \
991 /* Given an expression as a tree, strip any conversion that generates
992 no instruction. Accepts both tree and const_tree arguments since
993 we are not modifying the tree itself. */
995 #define STRIP_NOPS(EXP) \
996 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
998 /* Like STRIP_NOPS, but don't let the signedness change either. */
1000 #define STRIP_SIGN_NOPS(EXP) \
1001 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1003 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1005 #define STRIP_TYPE_NOPS(EXP) \
1006 while ((CONVERT_EXPR_P (EXP) \
1007 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1008 && TREE_OPERAND (EXP, 0) != error_mark_node \
1009 && (TREE_TYPE (EXP) \
1010 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1011 (EXP) = TREE_OPERAND (EXP, 0)
1013 /* Remove unnecessary type conversions according to
1014 tree_ssa_useless_type_conversion. */
1016 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1017 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1019 /* Nonzero if TYPE represents an integral type. Note that we do not
1020 include COMPLEX types here. Keep these checks in ascending code
1023 #define INTEGRAL_TYPE_P(TYPE) \
1024 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1025 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1026 || TREE_CODE (TYPE) == INTEGER_TYPE)
1028 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1030 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1031 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1033 /* Nonzero if TYPE represents a saturating fixed-point type. */
1035 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1036 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1038 /* Nonzero if TYPE represents a fixed-point type. */
1040 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1042 /* Nonzero if TYPE represents a scalar floating-point type. */
1044 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1046 /* Nonzero if TYPE represents a complex floating-point type. */
1048 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1050 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1052 /* Nonzero if TYPE represents a vector floating-point type. */
1054 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1055 (TREE_CODE (TYPE) == VECTOR_TYPE \
1056 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1058 /* Nonzero if TYPE represents a floating-point type, including complex
1059 and vector floating-point types. The vector and complex check does
1060 not use the previous two macros to enable early folding. */
1062 #define FLOAT_TYPE_P(TYPE) \
1063 (SCALAR_FLOAT_TYPE_P (TYPE) \
1064 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1065 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1066 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1068 /* Nonzero if TYPE represents a decimal floating-point type. */
1069 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1070 (SCALAR_FLOAT_TYPE_P (TYPE) \
1071 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1073 /* Nonzero if TYPE is a record or union type. */
1074 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1075 (TREE_CODE (TYPE) == RECORD_TYPE \
1076 || TREE_CODE (TYPE) == UNION_TYPE \
1077 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1079 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1080 Keep these checks in ascending code order. */
1082 #define AGGREGATE_TYPE_P(TYPE) \
1083 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1085 /* Nonzero if TYPE represents a pointer or reference type.
1086 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1087 ascending code order. */
1089 #define POINTER_TYPE_P(TYPE) \
1090 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1092 /* Nonzero if this type is a complete type. */
1093 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1095 /* Nonzero if this type is the (possibly qualified) void type. */
1096 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1098 /* Nonzero if this type is complete or is cv void. */
1099 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1100 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1102 /* Nonzero if this type is complete or is an array with unspecified bound. */
1103 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1104 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1107 /* Define many boolean fields that all tree nodes have. */
1109 /* In VAR_DECL nodes, nonzero means address of this is needed.
1110 So it cannot be in a register.
1111 In a FUNCTION_DECL, nonzero means its address is needed.
1112 So it must be compiled even if it is an inline function.
1113 In a FIELD_DECL node, it means that the programmer is permitted to
1114 construct the address of this field. This is used for aliasing
1115 purposes: see record_component_aliases.
1116 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1117 In LABEL_DECL nodes, it means a goto for this label has been seen
1118 from a place outside all binding contours that restore stack levels.
1119 In ..._TYPE nodes, it means that objects of this type must be fully
1120 addressable. This means that pieces of this object cannot go into
1121 register parameters, for example. If this a function type, this
1122 means that the value must be returned in memory.
1123 In IDENTIFIER_NODEs, this means that some extern decl for this name
1124 had its address taken. That matters for inline functions. */
1125 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1127 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1128 exit of a function. Calls for which this is true are candidates for tail
1129 call optimizations. */
1130 #define CALL_EXPR_TAILCALL(NODE) \
1131 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1133 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1134 CASE_LOW operand has been processed. */
1135 #define CASE_LOW_SEEN(NODE) \
1136 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1138 #define PREDICT_EXPR_OUTCOME(NODE) \
1139 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1140 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1141 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1142 #define PREDICT_EXPR_PREDICTOR(NODE) \
1143 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1145 /* In a VAR_DECL, nonzero means allocate static storage.
1146 In a FUNCTION_DECL, nonzero if function has been defined.
1147 In a CONSTRUCTOR, nonzero means allocate static storage. */
1148 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1150 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1151 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1153 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1154 should only be executed if an exception is thrown, not on normal exit
1156 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1158 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1159 separate cleanup in honor_protect_cleanup_actions. */
1160 #define TRY_CATCH_IS_CLEANUP(NODE) \
1161 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1163 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1164 CASE_HIGH operand has been processed. */
1165 #define CASE_HIGH_SEEN(NODE) \
1166 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1168 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1169 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1171 /* Used to mark scoped enums. */
1172 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1174 /* In an expr node (usually a conversion) this means the node was made
1175 implicitly and should not lead to any sort of warning. In a decl node,
1176 warnings concerning the decl should be suppressed. This is used at
1177 least for used-before-set warnings, and it set after one warning is
1179 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1181 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1182 this string as an argument. */
1183 #define TREE_SYMBOL_REFERENCED(NODE) \
1184 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1186 /* Nonzero in a pointer or reference type means the data pointed to
1187 by this type can alias anything. */
1188 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1189 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1191 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1192 #define MOVE_NONTEMPORAL(NODE) \
1193 (EXPR_CHECK (NODE)->base.static_flag)
1195 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1196 there was an overflow in folding. */
1198 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1200 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1202 #define TREE_OVERFLOW_P(EXPR) \
1203 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1205 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1206 nonzero means name is to be accessible from outside this translation unit.
1207 In an IDENTIFIER_NODE, nonzero means an external declaration
1208 accessible from outside this translation unit was previously seen
1209 for this name in an inner scope. */
1210 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1212 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1213 of cached values, or is something else. */
1214 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1216 /* In a SAVE_EXPR, indicates that the original expression has already
1217 been substituted with a VAR_DECL that contains the value. */
1218 #define SAVE_EXPR_RESOLVED_P(NODE) \
1219 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1221 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1223 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1224 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1226 /* In any expression, decl, or constant, nonzero means it has side effects or
1227 reevaluation of the whole expression could produce a different value.
1228 This is set if any subexpression is a function call, a side effect or a
1229 reference to a volatile variable. In a ..._DECL, this is set only if the
1230 declaration said `volatile'. This will never be set for a constant. */
1231 #define TREE_SIDE_EFFECTS(NODE) \
1232 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1234 /* In a LABEL_DECL, nonzero means this label had its address taken
1235 and therefore can never be deleted and is a jump target for
1237 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1239 /* Nonzero means this expression is volatile in the C sense:
1240 its address should be of type `volatile WHATEVER *'.
1241 In other words, the declared item is volatile qualified.
1242 This is used in _DECL nodes and _REF nodes.
1243 On a FUNCTION_DECL node, this means the function does not
1244 return normally. This is the same effect as setting
1245 the attribute noreturn on the function in C.
1247 In a ..._TYPE node, means this type is volatile-qualified.
1248 But use TYPE_VOLATILE instead of this macro when the node is a type,
1249 because eventually we may make that a different bit.
1251 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1252 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1254 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1255 accessing the memory pointed to won't generate a trap. However,
1256 this only applies to an object when used appropriately: it doesn't
1257 mean that writing a READONLY mem won't trap. Similarly for
1258 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1260 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1261 (or slice of the array) always belongs to the range of the array.
1262 I.e. that the access will not trap, provided that the access to
1263 the base to the array will not trap. */
1264 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1266 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1267 nonzero means it may not be the lhs of an assignment.
1268 Nonzero in a FUNCTION_DECL means this function should be treated
1269 as "const" function (can only read its arguments). */
1270 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1272 /* Value of expression is constant. Always on in all ..._CST nodes. May
1273 also appear in an expression or decl where the value is constant. */
1274 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1276 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1277 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1278 (TYPE_CHECK (NODE)->base.constant_flag)
1280 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1281 #define DECL_UNSIGNED(NODE) \
1282 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1284 /* In integral and pointer types, means an unsigned type. */
1285 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1287 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1288 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1289 This is interesting in an inline function, since it might not need
1290 to be compiled separately.
1291 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1292 if the debugging info for the type has been written.
1293 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1294 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1296 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1298 /* Nonzero in a _DECL if the name is used in its scope.
1299 Nonzero in an expr node means inhibit warning if value is unused.
1300 In IDENTIFIER_NODEs, this means that some extern decl for this name
1302 In a BLOCK, this means that the block contains variables that are used. */
1303 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1305 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1306 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1307 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1309 /* In a CALL_EXPR, means that it's safe to use the target of the call
1310 expansion as the return slot for a call that returns in memory. */
1311 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1312 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1314 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1315 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1317 #define DECL_BY_REFERENCE(NODE) \
1318 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1319 RESULT_DECL)->decl_common.decl_by_reference_flag)
1321 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1322 can be used as restricted tag to disambiguate against other restrict
1323 pointers. Used by fortran to capture something like non-addressability
1324 (which it isn't really because the middle-end does take addresses of
1326 #define DECL_RESTRICTED_P(NODE) \
1327 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1328 RESULT_DECL)->decl_common.decl_restricted_flag)
1330 #define DECL_READ_P(NODE) \
1331 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1333 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1334 thunked-to function. */
1335 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1337 /* In a type, nonzero means that all objects of the type are guaranteed by the
1338 language or front-end to be properly aligned, so we can indicate that a MEM
1339 of this type is aligned at least to the alignment of the type, even if it
1340 doesn't appear that it is. We see this, for example, in object-oriented
1341 languages where a tag field may show this is an object of a more-aligned
1342 variant of the more generic type.
1344 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1346 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1348 /* Used in classes in C++. */
1349 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1350 /* Used in classes in C++. */
1351 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1353 /* True if reference type NODE is a C++ rvalue reference. */
1354 #define TYPE_REF_IS_RVALUE(NODE) \
1355 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1357 /* Nonzero in a _DECL if the use of the name is defined as a
1358 deprecated feature by __attribute__((deprecated)). */
1359 #define TREE_DEPRECATED(NODE) \
1360 ((NODE)->base.deprecated_flag)
1362 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1363 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1364 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1365 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1367 /* In fixed-point types, means a saturating type. */
1368 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1370 /* These flags are available for each language front end to use internally. */
1371 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1372 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1373 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1374 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1375 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1376 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1377 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1379 /* Define additional fields and accessors for nodes representing constants. */
1381 /* In an INTEGER_CST node. These two together make a 2-word integer.
1382 If the data type is signed, the value is sign-extended to 2 words
1383 even though not all of them may really be in use.
1384 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1385 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1386 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1387 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1389 #define INT_CST_LT(A, B) \
1390 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1391 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1392 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1394 #define INT_CST_LT_UNSIGNED(A, B) \
1395 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1396 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1397 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1398 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1399 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1401 struct GTY(()) tree_int_cst {
1402 struct tree_common common;
1406 /* In a REAL_CST node. struct real_value is an opaque entity, with
1407 manipulators defined in real.h. We don't want tree.h depending on
1408 real.h and transitively on tm.h. */
1411 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1412 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1414 struct GTY(()) tree_real_cst {
1415 struct tree_common common;
1416 struct real_value * real_cst_ptr;
1419 /* In a FIXED_CST node. */
1422 #define TREE_FIXED_CST_PTR(NODE) \
1423 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1424 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1426 struct GTY(()) tree_fixed_cst {
1427 struct tree_common common;
1428 struct fixed_value * fixed_cst_ptr;
1431 /* In a STRING_CST */
1432 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1433 #define TREE_STRING_POINTER(NODE) \
1434 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1436 struct GTY(()) tree_string {
1437 struct tree_common common;
1442 /* In a COMPLEX_CST node. */
1443 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1444 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1446 struct GTY(()) tree_complex {
1447 struct tree_common common;
1452 /* In a VECTOR_CST node. */
1453 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1455 struct GTY(()) tree_vector {
1456 struct tree_common common;
1462 /* Define fields and accessors for some special-purpose tree nodes. */
1464 #define IDENTIFIER_LENGTH(NODE) \
1465 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1466 #define IDENTIFIER_POINTER(NODE) \
1467 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1468 #define IDENTIFIER_HASH_VALUE(NODE) \
1469 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1471 /* Translate a hash table identifier pointer to a tree_identifier
1472 pointer, and vice versa. */
1474 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1475 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1476 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1478 struct GTY(()) tree_identifier {
1479 struct tree_common common;
1480 struct ht_identifier id;
1483 /* In a TREE_LIST node. */
1484 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1485 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1487 struct GTY(()) tree_list {
1488 struct tree_common common;
1493 /* In a TREE_VEC node. */
1494 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1495 #define TREE_VEC_END(NODE) \
1496 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1498 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1500 struct GTY(()) tree_vec {
1501 struct tree_common common;
1503 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1506 /* In a CONSTRUCTOR node. */
1507 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1508 #define CONSTRUCTOR_ELT(NODE,IDX) \
1509 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1510 #define CONSTRUCTOR_NELTS(NODE) \
1511 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1513 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1514 value of each element (stored within VAL). IX must be a scratch variable
1515 of unsigned integer type. */
1516 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1517 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1519 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1523 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1524 the value of each element (stored within VAL) and its index (stored
1525 within INDEX). IX must be a scratch variable of unsigned integer type. */
1526 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1527 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1529 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1530 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1534 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1535 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1537 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1538 _ce___->index = INDEX; \
1539 _ce___->value = VALUE; \
1542 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1543 constructor output purposes. */
1544 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1545 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1547 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1548 element. INDEX can optionally design the position of VALUE: in arrays,
1549 it is the index where VALUE has to be placed; in structures, it is the
1550 FIELD_DECL of the member. */
1551 typedef struct GTY(()) constructor_elt_d {
1556 DEF_VEC_O(constructor_elt);
1557 DEF_VEC_ALLOC_O(constructor_elt,gc);
1559 struct GTY(()) tree_constructor {
1560 struct tree_common common;
1561 VEC(constructor_elt,gc) *elts;
1564 /* Define fields and accessors for some nodes that represent expressions. */
1566 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1567 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1568 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1569 && integer_zerop (TREE_OPERAND (NODE, 0)))
1571 /* In ordinary expression nodes. */
1572 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1573 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1575 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1576 length. Its value includes the length operand itself; that is,
1577 the minimum valid length is 1.
1578 Note that we have to bypass the use of TREE_OPERAND to access
1579 that field to avoid infinite recursion in expanding the macros. */
1580 #define VL_EXP_OPERAND_LENGTH(NODE) \
1581 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1583 /* Nonzero if is_gimple_debug() may possibly hold. */
1584 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1586 /* In a LOOP_EXPR node. */
1587 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1589 /* The source location of this expression. Non-tree_exp nodes such as
1590 decls and constants can be shared among multiple locations, so
1592 #define EXPR_LOCATION(NODE) \
1593 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1594 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1595 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1596 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1597 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1599 /* True if a tree is an expression or statement that can have a
1601 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1603 extern void protected_set_expr_location (tree, location_t);
1605 /* In a TARGET_EXPR node. */
1606 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1607 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1608 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1610 /* DECL_EXPR accessor. This gives access to the DECL associated with
1611 the given declaration statement. */
1612 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1614 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1616 /* COMPOUND_LITERAL_EXPR accessors. */
1617 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1618 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1619 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1620 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1622 /* SWITCH_EXPR accessors. These give access to the condition, body and
1623 original condition type (before any compiler conversions)
1624 of the switch statement, respectively. */
1625 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1626 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1627 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1629 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1630 of a case label, respectively. */
1631 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1632 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1633 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1635 /* The operands of a TARGET_MEM_REF. */
1636 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1637 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1638 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1639 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1640 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1641 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1643 /* The operands of a BIND_EXPR. */
1644 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1645 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1646 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1648 /* GOTO_EXPR accessor. This gives access to the label associated with
1649 a goto statement. */
1650 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1652 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1653 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1654 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1656 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1657 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1658 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1659 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1660 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1661 /* Nonzero if we want to create an ASM_INPUT instead of an
1662 ASM_OPERAND with no operands. */
1663 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1664 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1666 /* COND_EXPR accessors. */
1667 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1668 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1669 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1671 /* Accessors for the chains of recurrences. */
1672 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1673 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1674 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1675 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1677 /* LABEL_EXPR accessor. This gives access to the label associated with
1678 the given label expression. */
1679 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1681 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1682 accessors for SSA operands. */
1684 /* CATCH_EXPR accessors. */
1685 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1686 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1688 /* EH_FILTER_EXPR accessors. */
1689 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1690 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1692 /* OBJ_TYPE_REF accessors. */
1693 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1694 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1695 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1697 /* ASSERT_EXPR accessors. */
1698 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1699 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1701 /* CALL_EXPR accessors.
1703 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1704 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1705 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1706 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1707 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1709 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1710 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1711 the argument count is zero when checking is enabled. Instead, do
1712 the pointer arithmetic to advance past the 3 fixed operands in a
1713 CALL_EXPR. That produces a valid pointer to just past the end of the
1714 operand array, even if it's not valid to dereference it. */
1715 #define CALL_EXPR_ARGP(NODE) \
1716 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1718 /* OpenMP directive and clause accessors. */
1720 #define OMP_BODY(NODE) \
1721 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1722 #define OMP_CLAUSES(NODE) \
1723 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1725 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1726 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1728 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1729 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1731 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1732 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1733 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1735 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1736 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1737 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1738 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1739 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1740 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1742 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1743 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1745 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1747 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1748 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1750 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1752 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1754 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1755 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1757 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1758 #define OMP_CLAUSE_DECL(NODE) \
1759 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1760 OMP_CLAUSE_PRIVATE, \
1761 OMP_CLAUSE_COPYPRIVATE), 0)
1762 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1763 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1764 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1766 /* True on an OMP_SECTION statement that was the last lexical member.
1767 This status is meaningful in the implementation of lastprivate. */
1768 #define OMP_SECTION_LAST(NODE) \
1769 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1771 /* True on an OMP_PARALLEL statement if it represents an explicit
1772 combined parallel work-sharing constructs. */
1773 #define OMP_PARALLEL_COMBINED(NODE) \
1774 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1776 /* True on a PRIVATE clause if its decl is kept around for debugging
1777 information only and its DECL_VALUE_EXPR is supposed to point
1778 to what it has been remapped to. */
1779 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1780 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1782 /* True on a PRIVATE clause if ctor needs access to outer region's
1784 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1785 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1787 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1788 decl is present in the chain. */
1789 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1790 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1791 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1792 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1793 OMP_CLAUSE_LASTPRIVATE),\
1795 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1796 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1798 #define OMP_CLAUSE_IF_EXPR(NODE) \
1799 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1800 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1801 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1802 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1803 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1805 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1806 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1807 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1808 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1809 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1810 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1812 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1813 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1814 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1815 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1816 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1817 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1818 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1819 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1820 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1821 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1822 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1823 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1825 enum omp_clause_schedule_kind
1827 OMP_CLAUSE_SCHEDULE_STATIC,
1828 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1829 OMP_CLAUSE_SCHEDULE_GUIDED,
1830 OMP_CLAUSE_SCHEDULE_AUTO,
1831 OMP_CLAUSE_SCHEDULE_RUNTIME
1834 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1835 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1837 enum omp_clause_default_kind
1839 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1840 OMP_CLAUSE_DEFAULT_SHARED,
1841 OMP_CLAUSE_DEFAULT_NONE,
1842 OMP_CLAUSE_DEFAULT_PRIVATE,
1843 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1846 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1847 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1849 struct GTY(()) tree_exp {
1850 struct tree_common common;
1853 tree GTY ((special ("tree_exp"),
1854 desc ("TREE_CODE ((tree) &%0)")))
1858 /* SSA_NAME accessors. */
1860 /* Returns the variable being referenced. Once released, this is the
1861 only field that can be relied upon. */
1862 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1864 /* Returns the statement which defines this SSA name. */
1865 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1867 /* Returns the SSA version number of this SSA name. Note that in
1868 tree SSA, version numbers are not per variable and may be recycled. */
1869 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1871 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1872 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1874 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1875 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1877 /* Nonzero if this SSA_NAME expression is currently on the free list of
1878 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1879 has no meaning for an SSA_NAME. */
1880 #define SSA_NAME_IN_FREE_LIST(NODE) \
1881 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1883 /* Nonzero if this SSA_NAME is the default definition for the
1884 underlying symbol. A default SSA name is created for symbol S if
1885 the very first reference to S in the function is a read operation.
1886 Default definitions are always created by an empty statement and
1887 belong to no basic block. */
1888 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1889 SSA_NAME_CHECK (NODE)->base.default_def_flag
1891 /* Attributes for SSA_NAMEs for pointer-type variables. */
1892 #define SSA_NAME_PTR_INFO(N) \
1893 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1895 #ifndef _TREE_FLOW_H
1896 struct ptr_info_def;
1901 /* Immediate use linking structure. This structure is used for maintaining
1902 a doubly linked list of uses of an SSA_NAME. */
1903 typedef struct GTY(()) ssa_use_operand_d {
1904 struct ssa_use_operand_d* GTY((skip(""))) prev;
1905 struct ssa_use_operand_d* GTY((skip(""))) next;
1906 /* Immediate uses for a given SSA name are maintained as a cyclic
1907 list. To recognize the root of this list, the location field
1908 needs to point to the original SSA name. Since statements and
1909 SSA names are of different data types, we need this union. See
1910 the explanation in struct immediate_use_iterator_d. */
1911 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1912 tree *GTY((skip(""))) use;
1913 } ssa_use_operand_t;
1915 /* Return the immediate_use information for an SSA_NAME. */
1916 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1918 struct GTY(()) tree_ssa_name {
1919 struct tree_common common;
1921 /* _DECL wrapped by this SSA name. */
1924 /* Statement that defines this SSA name. */
1927 /* SSA version number. */
1928 unsigned int version;
1930 /* Pointer attributes used for alias analysis. */
1931 struct ptr_info_def *ptr_info;
1933 /* Immediate uses list for this SSA_NAME. */
1934 struct ssa_use_operand_d imm_uses;
1937 struct GTY(()) phi_arg_d {
1938 /* imm_use MUST be the first element in struct because we do some
1939 pointer arithmetic with it. See phi_arg_index_from_use. */
1940 struct ssa_use_operand_d imm_use;
1946 #define OMP_CLAUSE_CODE(NODE) \
1947 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1949 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1950 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1952 #define OMP_CLAUSE_CODE(NODE) \
1953 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1955 #define OMP_CLAUSE_OPERAND(NODE, I) \
1956 OMP_CLAUSE_ELT_CHECK (NODE, I)
1958 struct GTY(()) tree_omp_clause {
1959 struct tree_common common;
1961 enum omp_clause_code code;
1962 union omp_clause_subcode {
1963 enum omp_clause_default_kind default_kind;
1964 enum omp_clause_schedule_kind schedule_kind;
1965 enum tree_code reduction_code;
1966 } GTY ((skip)) subcode;
1968 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1970 gimple_seq gimple_reduction_init;
1971 gimple_seq gimple_reduction_merge;
1973 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1977 struct varray_head_tag;
1979 /* In a BLOCK node. */
1980 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1981 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1982 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1983 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1984 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1985 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
1986 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1987 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1988 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1989 /* Note: when changing this, make sure to find the places
1990 that use chainon or nreverse. */
1991 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1992 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1993 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1995 /* An index number for this block. These values are not guaranteed to
1996 be unique across functions -- whether or not they are depends on
1997 the debugging output format in use. */
1998 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2000 /* If block reordering splits a lexical block into discontiguous
2001 address ranges, we'll make a copy of the original block.
2003 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2004 In that case, we have one source block that has been replicated
2005 (through inlining or unrolling) into many logical blocks, and that
2006 these logical blocks have different physical variables in them.
2008 In this case, we have one logical block split into several
2009 non-contiguous address ranges. Most debug formats can't actually
2010 represent this idea directly, so we fake it by creating multiple
2011 logical blocks with the same variables in them. However, for those
2012 that do support non-contiguous regions, these allow the original
2013 logical block to be reconstructed, along with the set of address
2016 One of the logical block fragments is arbitrarily chosen to be
2017 the ORIGIN. The other fragments will point to the origin via
2018 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2019 be null. The list of fragments will be chained through
2020 BLOCK_FRAGMENT_CHAIN from the origin. */
2022 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2023 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2025 /* For an inlined function, this gives the location where it was called
2026 from. This is only set in the top level block, which corresponds to the
2027 inlined function scope. This is used in the debug output routines. */
2029 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2031 struct GTY(()) tree_block {
2032 struct tree_common common;
2034 unsigned abstract_flag : 1;
2035 unsigned block_num : 31;
2040 VEC(tree,gc) *nonlocalized_vars;
2044 tree abstract_origin;
2045 tree fragment_origin;
2046 tree fragment_chain;
2049 /* Define fields and accessors for nodes representing data types. */
2051 /* See tree.def for documentation of the use of these fields.
2052 Look at the documentation of the various ..._TYPE tree codes.
2054 Note that the type.values, type.minval, and type.maxval fields are
2055 overloaded and used for different macros in different kinds of types.
2056 Each macro must check to ensure the tree node is of the proper kind of
2057 type. Note also that some of the front-ends also overload these fields,
2058 so they must be checked as well. */
2060 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2061 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2062 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2063 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2064 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2065 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2066 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2067 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2068 (INTEGER_TYPE_CHECK (NODE)->type.values \
2069 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2070 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2071 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2072 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2073 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2074 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2075 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2076 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2077 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2078 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2079 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2080 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2081 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2082 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2083 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2084 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2085 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2086 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2087 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2088 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2089 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2090 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2092 /* Vector types need to check target flags to determine type. */
2093 extern enum machine_mode vector_type_mode (const_tree);
2094 #define TYPE_MODE(NODE) \
2095 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2096 ? vector_type_mode (NODE) : (NODE)->type.mode)
2097 #define SET_TYPE_MODE(NODE, MODE) \
2098 (TYPE_CHECK (NODE)->type.mode = (MODE))
2100 /* The "canonical" type for this type node, which can be used to
2101 compare the type for equality with another type. If two types are
2102 equal (based on the semantics of the language), then they will have
2103 equivalent TYPE_CANONICAL entries.
2105 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2106 be used for comparison against other types. Instead, the type is
2107 said to require structural equality checks, described in
2108 TYPE_STRUCTURAL_EQUALITY_P. */
2109 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2110 /* Indicates that the type node requires structural equality
2111 checks. The compiler will need to look at the composition of the
2112 type to determine whether it is equal to another type, rather than
2113 just comparing canonical type pointers. For instance, we would need
2114 to look at the return and parameter types of a FUNCTION_TYPE
2116 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2117 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2118 type node requires structural equality. */
2119 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2120 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2121 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2122 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2124 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2125 in the debugging output. We use this to describe a vector as a
2126 structure containing an array. */
2127 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) \
2128 (VECTOR_TYPE_CHECK (NODE)->type.values)
2130 /* For record and union types, information about this type, as a base type
2132 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2134 /* For non record and union types, used in a language-dependent way. */
2135 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2137 /* The (language-specific) typed-based alias set for this type.
2138 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2139 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2140 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2141 type can alias objects of any type. */
2142 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2144 /* Nonzero iff the typed-based alias set for this type has been
2146 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2148 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2150 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2152 /* The alignment necessary for objects of this type.
2153 The value is an int, measured in bits. */
2154 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2156 /* 1 if the alignment for this type was requested by "aligned" attribute,
2157 0 if it is the default for this type. */
2158 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2160 /* The alignment for NODE, in bytes. */
2161 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2163 /* If your language allows you to declare types, and you want debug info
2164 for them, then you need to generate corresponding TYPE_DECL nodes.
2165 These "stub" TYPE_DECL nodes have no name, and simply point at the
2166 type node. You then set the TYPE_STUB_DECL field of the type node
2167 to point back at the TYPE_DECL node. This allows the debug routines
2168 to know that the two nodes represent the same type, so that we only
2169 get one debug info record for them. */
2170 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2172 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2173 has BLKmode only because it lacks the alignment requirement for
2175 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2177 /* In an INTEGER_TYPE, it means the type represents a size. We use
2178 this both for validity checking and to permit optimizations that
2179 are unsafe for other types. Note that the C `size_t' type should
2180 *not* have this flag set. The `size_t' type is simply a typedef
2181 for an ordinary integer type that happens to be the type of an
2182 expression returned by `sizeof'; `size_t' has no special
2183 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2184 always actual sizes. */
2185 #define TYPE_IS_SIZETYPE(NODE) \
2186 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2188 /* Nonzero in a type considered volatile as a whole. */
2189 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2191 /* Means this type is const-qualified. */
2192 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2194 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2196 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2198 /* The address space the type is in. */
2199 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2201 /* There is a TYPE_QUAL value for each type qualifier. They can be
2202 combined by bitwise-or to form the complete set of qualifiers for a
2205 #define TYPE_UNQUALIFIED 0x0
2206 #define TYPE_QUAL_CONST 0x1
2207 #define TYPE_QUAL_VOLATILE 0x2
2208 #define TYPE_QUAL_RESTRICT 0x4
2210 /* Encode/decode the named memory support as part of the qualifier. If more
2211 than 8 qualifiers are added, these macros need to be adjusted. */
2212 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2213 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2215 /* Return all qualifiers except for the address space qualifiers. */
2216 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2218 /* Only keep the address space out of the qualifiers and discard the other
2220 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2222 /* The set of type qualifiers for this type. */
2223 #define TYPE_QUALS(NODE) \
2224 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2225 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2226 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2227 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2229 /* The same as TYPE_QUALS without the address space qualifications. */
2230 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2231 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2232 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2233 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2235 /* These flags are available for each language front end to use internally. */
2236 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2237 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2238 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2239 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2240 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2241 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2242 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2244 /* Used to keep track of visited nodes in tree traversals. This is set to
2245 0 by copy_node and make_node. */
2246 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2248 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2249 that distinguish string from array of char).
2250 If set in a INTEGER_TYPE, indicates a character type. */
2251 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2253 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2254 object of the given ARRAY_TYPE. This allows temporaries to be
2256 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2257 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2259 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2260 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2261 (((unsigned HOST_WIDE_INT) 1) \
2262 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2264 /* Set precision to n when we have 2^n sub-parts of the vector. */
2265 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2266 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2268 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2269 about missing conversions to other vector types of the same size. */
2270 #define TYPE_VECTOR_OPAQUE(NODE) \
2271 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2273 /* Indicates that objects of this type must be initialized by calling a
2274 function when they are created. */
2275 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2276 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2278 /* Indicates that a UNION_TYPE object should be passed the same way that
2279 the first union alternative would be passed, or that a RECORD_TYPE
2280 object should be passed the same way that the first (and only) member
2282 #define TYPE_TRANSPARENT_AGGR(NODE) \
2283 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2285 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2286 address of a component of the type. This is the counterpart of
2287 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2288 #define TYPE_NONALIASED_COMPONENT(NODE) \
2289 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2291 /* Indicated that objects of this type should be laid out in as
2292 compact a way as possible. */
2293 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2295 /* Used by type_contains_placeholder_p to avoid recomputation.
2296 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2297 this field directly. */
2298 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2299 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2303 struct GTY(()) tree_type {
2304 struct tree_common common;
2311 unsigned int precision : 10;
2312 unsigned no_force_blk_flag : 1;
2313 unsigned needs_constructing_flag : 1;
2314 unsigned transparent_aggr_flag : 1;
2315 unsigned restrict_flag : 1;
2316 unsigned contains_placeholder_bits : 2;
2318 ENUM_BITFIELD(machine_mode) mode : 8;
2320 unsigned string_flag : 1;
2321 unsigned lang_flag_0 : 1;
2322 unsigned lang_flag_1 : 1;
2323 unsigned lang_flag_2 : 1;
2324 unsigned lang_flag_3 : 1;
2325 unsigned lang_flag_4 : 1;
2326 unsigned lang_flag_5 : 1;
2327 unsigned lang_flag_6 : 1;
2330 alias_set_type alias_set;
2333 union tree_type_symtab {
2334 int GTY ((tag ("0"))) address;
2335 const char * GTY ((tag ("1"))) pointer;
2336 struct die_struct * GTY ((tag ("2"))) die;
2337 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2338 descbits ("2"))) symtab;
2347 /* Points to a structure whose details depend on the language in use. */
2348 struct lang_type *lang_specific;
2351 /* Define accessor macros for information about type inheritance
2354 A "basetype" means a particular usage of a data type for inheritance
2355 in another type. Each such basetype usage has its own "binfo"
2356 object to describe it. The binfo object is a TREE_VEC node.
2358 Inheritance is represented by the binfo nodes allocated for a
2359 given type. For example, given types C and D, such that D is
2360 inherited by C, 3 binfo nodes will be allocated: one for describing
2361 the binfo properties of C, similarly one for D, and one for
2362 describing the binfo properties of D as a base type for C.
2363 Thus, given a pointer to class C, one can get a pointer to the binfo
2364 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2366 /* BINFO specific flags. */
2368 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2369 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2371 /* Flags for language dependent use. */
2372 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2373 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2374 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2375 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2376 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2377 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2378 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2380 /* The actual data type node being inherited in this basetype. */
2381 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2383 /* The offset where this basetype appears in its containing type.
2384 BINFO_OFFSET slot holds the offset (in bytes)
2385 from the base of the complete object to the base of the part of the
2386 object that is allocated on behalf of this `type'.
2387 This is always 0 except when there is multiple inheritance. */
2389 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2390 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2392 /* The virtual function table belonging to this basetype. Virtual
2393 function tables provide a mechanism for run-time method dispatching.
2394 The entries of a virtual function table are language-dependent. */
2396 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2398 /* The virtual functions in the virtual function table. This is
2399 a TREE_LIST that is used as an initial approximation for building
2400 a virtual function table for this basetype. */
2401 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2403 /* A vector of binfos for the direct basetypes inherited by this
2406 If this basetype describes type D as inherited in C, and if the
2407 basetypes of D are E and F, then this vector contains binfos for
2408 inheritance of E and F by C. */
2409 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2411 /* The number of basetypes for NODE. */
2412 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2414 /* Accessor macro to get to the Nth base binfo of this binfo. */
2415 #define BINFO_BASE_BINFO(NODE,N) \
2416 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2417 #define BINFO_BASE_ITERATE(NODE,N,B) \
2418 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2419 #define BINFO_BASE_APPEND(NODE,T) \
2420 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2422 /* For a BINFO record describing a virtual base class, i.e., one where
2423 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2424 base. The actual contents are language-dependent. In the C++
2425 front-end this field is an INTEGER_CST giving an offset into the
2426 vtable where the offset to the virtual base can be found. */
2427 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2429 /* Indicates the accesses this binfo has to its bases. The values are
2430 access_public_node, access_protected_node or access_private_node.
2431 If this array is not present, public access is implied. */
2432 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2434 #define BINFO_BASE_ACCESS(NODE,N) \
2435 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2436 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2437 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2439 /* The index in the VTT where this subobject's sub-VTT can be found.
2440 NULL_TREE if there is no sub-VTT. */
2441 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2443 /* The index in the VTT where the vptr for this subobject can be
2444 found. NULL_TREE if there is no secondary vptr in the VTT. */
2445 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2447 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2448 inheriting this base for non-virtual bases. For virtual bases it
2449 points either to the binfo for which this is a primary binfo, or to
2450 the binfo of the most derived type. */
2451 #define BINFO_INHERITANCE_CHAIN(NODE) \
2452 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2454 struct GTY (()) tree_binfo {
2455 struct tree_common common;
2461 VEC(tree,gc) *base_accesses;
2467 VEC(tree,none) base_binfos;
2471 /* Define fields and accessors for nodes representing declared names. */
2473 /* Nonzero if DECL represents a variable for the SSA passes. */
2474 #define SSA_VAR_P(DECL) \
2475 (TREE_CODE (DECL) == VAR_DECL \
2476 || TREE_CODE (DECL) == PARM_DECL \
2477 || TREE_CODE (DECL) == RESULT_DECL \
2478 || (TREE_CODE (DECL) == SSA_NAME \
2479 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2480 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2481 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2486 /* Enumerate visibility settings. */
2487 #ifndef SYMBOL_VISIBILITY_DEFINED
2488 #define SYMBOL_VISIBILITY_DEFINED
2489 enum symbol_visibility
2492 VISIBILITY_PROTECTED,
2501 /* This is the name of the object as written by the user.
2502 It is an IDENTIFIER_NODE. */
2503 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2505 /* Every ..._DECL node gets a unique number. */
2506 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2508 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2510 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2512 /* Every ..._DECL node gets a unique number that stays the same even
2513 when the decl is copied by the inliner once it is set. */
2514 #define DECL_PT_UID(NODE) \
2515 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2516 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2517 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2518 #define SET_DECL_PT_UID(NODE, UID) \
2519 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2520 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2521 be preserved when copyin the decl. */
2522 #define DECL_PT_UID_SET_P(NODE) \
2523 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2525 /* These two fields describe where in the source code the declaration
2526 was. If the declaration appears in several places (as for a C
2527 function that is declared first and then defined later), this
2528 information should refer to the definition. */
2529 #define DECL_SOURCE_LOCATION(NODE) \
2530 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2531 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2532 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2533 #define DECL_IS_BUILTIN(DECL) \
2534 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2536 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2537 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2538 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2539 nodes, this points to either the FUNCTION_DECL for the containing
2540 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2541 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2543 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2544 #define DECL_FIELD_CONTEXT(NODE) \
2545 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2546 struct GTY(()) tree_decl_minimal {
2547 struct tree_common common;
2555 /* For any sort of a ..._DECL node, this points to the original (abstract)
2556 decl node which this decl is an inlined/cloned instance of, or else it
2557 is NULL indicating that this decl is not an instance of some other decl.
2559 The C front-end also uses this in a nested declaration of an inline
2560 function, to point back to the definition. */
2561 #define DECL_ABSTRACT_ORIGIN(NODE) \
2562 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2564 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2565 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2566 #define DECL_ORIGIN(NODE) \
2567 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2569 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2570 inline instance of some original (abstract) decl from an inline function;
2571 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2572 nodes can also have their abstract origin set to themselves. */
2573 #define DECL_FROM_INLINE(NODE) \
2574 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2575 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2577 /* In a DECL this is the field where attributes are stored. */
2578 #define DECL_ATTRIBUTES(NODE) \
2579 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2581 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2582 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2583 For a VAR_DECL, holds the initial value.
2584 For a PARM_DECL, used for DECL_ARG_TYPE--default
2585 values for parameters are encoded in the type of the function,
2586 not in the PARM_DECL slot.
2587 For a FIELD_DECL, this is used for enumeration values and the C
2588 frontend uses it for temporarily storing bitwidth of bitfields.
2590 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2591 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2593 /* Holds the size of the datum, in bits, as a tree expression.
2594 Need not be constant. */
2595 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2596 /* Likewise for the size in bytes. */
2597 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2598 /* Holds the alignment required for the datum, in bits. */
2599 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2600 /* The alignment of NODE, in bytes. */
2601 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2602 /* Set if the alignment of this DECL has been set by the user, for
2603 example with an 'aligned' attribute. */
2604 #define DECL_USER_ALIGN(NODE) \
2605 (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2606 /* Holds the machine mode corresponding to the declaration of a variable or
2607 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2609 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2611 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2612 operation it is. Note, however, that this field is overloaded, with
2613 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2614 checked before any access to the former. */
2615 #define DECL_FUNCTION_CODE(NODE) \
2616 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2617 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2618 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2620 #define DECL_FUNCTION_PERSONALITY(NODE) \
2621 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2623 /* Nonzero for a given ..._DECL node means that the name of this node should
2624 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2625 the body of the function should also be ignored. */
2626 #define DECL_IGNORED_P(NODE) \
2627 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2629 /* Nonzero for a given ..._DECL node means that this node represents an
2630 "abstract instance" of the given declaration (e.g. in the original
2631 declaration of an inline function). When generating symbolic debugging
2632 information, we mustn't try to generate any address information for nodes
2633 marked as "abstract instances" because we don't actually generate
2634 any code or allocate any data space for such instances. */
2635 #define DECL_ABSTRACT(NODE) \
2636 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2638 /* Language-specific decl information. */
2639 #define DECL_LANG_SPECIFIC(NODE) \
2640 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2642 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2643 do not allocate storage, and refer to a definition elsewhere. Note that
2644 this does not necessarily imply the entity represented by NODE
2645 has no program source-level definition in this translation unit. For
2646 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2647 DECL_EXTERNAL may be true simultaneously; that can be the case for
2648 a C99 "extern inline" function. */
2649 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2651 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2652 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2654 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2656 Also set in some languages for variables, etc., outside the normal
2657 lexical scope, such as class instance variables. */
2658 #define DECL_NONLOCAL(NODE) \
2659 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2661 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2662 Used in FIELD_DECLs for vtable pointers.
2663 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2664 #define DECL_VIRTUAL_P(NODE) \
2665 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2667 /* Used to indicate that this DECL represents a compiler-generated entity. */
2668 #define DECL_ARTIFICIAL(NODE) \
2669 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2671 /* Additional flags for language-specific uses. */
2672 #define DECL_LANG_FLAG_0(NODE) \
2673 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2674 #define DECL_LANG_FLAG_1(NODE) \
2675 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2676 #define DECL_LANG_FLAG_2(NODE) \
2677 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2678 #define DECL_LANG_FLAG_3(NODE) \
2679 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2680 #define DECL_LANG_FLAG_4(NODE) \
2681 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2682 #define DECL_LANG_FLAG_5(NODE) \
2683 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2684 #define DECL_LANG_FLAG_6(NODE) \
2685 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2686 #define DECL_LANG_FLAG_7(NODE) \
2687 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2688 #define DECL_LANG_FLAG_8(NODE) \
2689 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2691 /* Nonzero for a decl which is at file scope. */
2692 #define DECL_FILE_SCOPE_P(EXP) \
2693 (! DECL_CONTEXT (EXP) \
2694 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2696 /* Nonzero for a decl that is decorated using attribute used.
2697 This indicates to compiler tools that this decl needs to be preserved. */
2698 #define DECL_PRESERVE_P(DECL) \
2699 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2701 /* For function local variables of COMPLEX and VECTOR types,
2702 indicates that the variable is not aliased, and that all
2703 modifications to the variable have been adjusted so that
2704 they are killing assignments. Thus the variable may now
2705 be treated as a GIMPLE register, and use real instead of
2706 virtual ops in SSA form. */
2707 #define DECL_GIMPLE_REG_P(DECL) \
2708 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2710 struct GTY(()) tree_decl_common {
2711 struct tree_decl_minimal common;
2714 ENUM_BITFIELD(machine_mode) mode : 8;
2716 unsigned nonlocal_flag : 1;
2717 unsigned virtual_flag : 1;
2718 unsigned ignored_flag : 1;
2719 unsigned abstract_flag : 1;
2720 unsigned artificial_flag : 1;
2721 unsigned preserve_flag: 1;
2722 unsigned debug_expr_is_from : 1;
2724 unsigned lang_flag_0 : 1;
2725 unsigned lang_flag_1 : 1;
2726 unsigned lang_flag_2 : 1;
2727 unsigned lang_flag_3 : 1;
2728 unsigned lang_flag_4 : 1;
2729 unsigned lang_flag_5 : 1;
2730 unsigned lang_flag_6 : 1;
2731 unsigned lang_flag_7 : 1;
2732 unsigned lang_flag_8 : 1;
2734 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2735 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2736 unsigned decl_flag_0 : 1;
2737 /* In FIELD_DECL, this is DECL_BIT_FIELD
2738 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2739 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2740 unsigned decl_flag_1 : 1;
2741 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2742 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2743 unsigned decl_flag_2 : 1;
2744 /* Logically, these two would go in a theoretical base shared by var and
2746 unsigned gimple_reg_flag : 1;
2747 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2748 unsigned decl_by_reference_flag : 1;
2749 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2750 unsigned decl_restricted_flag : 1;
2752 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2754 unsigned decl_read_flag : 1;
2756 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2757 unsigned decl_common_unused : 1;
2759 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2760 unsigned int off_align : 8;
2762 /* 24-bits unused. */
2764 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2767 /* UID for points-to sets, stable over copying from inlining. */
2768 unsigned int pt_uid;
2773 tree abstract_origin;
2775 /* Points to a structure whose details depend on the language in use. */
2776 struct lang_decl *lang_specific;
2779 extern tree decl_value_expr_lookup (tree);
2780 extern void decl_value_expr_insert (tree, tree);
2782 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2783 if transformations have made this more complicated than evaluating the
2784 decl itself. This should only be used for debugging; once this field has
2785 been set, the decl itself may not legitimately appear in the function. */
2786 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2787 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2788 #define DECL_VALUE_EXPR(NODE) \
2789 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2790 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2791 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2793 /* Holds the RTL expression for the value of a variable or function.
2794 This value can be evaluated lazily for functions, variables with
2795 static storage duration, and labels. */
2796 #define DECL_RTL(NODE) \
2797 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2798 ? (NODE)->decl_with_rtl.rtl \
2799 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2801 /* Set the DECL_RTL for NODE to RTL. */
2802 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2804 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2805 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2807 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2808 #define DECL_RTL_SET_P(NODE) \
2809 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2811 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2812 NODE1, it will not be set for NODE2; this is a lazy copy. */
2813 #define COPY_DECL_RTL(NODE1, NODE2) \
2814 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2815 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2817 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2818 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2820 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2821 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2823 struct GTY(()) tree_decl_with_rtl {
2824 struct tree_decl_common common;
2828 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2829 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2830 of the structure. */
2831 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2833 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2834 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2835 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2836 natural alignment of the field's type). */
2837 #define DECL_FIELD_BIT_OFFSET(NODE) \
2838 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2840 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2841 if so, the type that was originally specified for it.
2842 TREE_TYPE may have been modified (in finish_struct). */
2843 #define DECL_BIT_FIELD_TYPE(NODE) \
2844 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2846 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2847 if nonzero, indicates that the field occupies the type. */
2848 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2850 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2851 DECL_FIELD_OFFSET which are known to be always zero.
2852 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2854 #define DECL_OFFSET_ALIGN(NODE) \
2855 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2857 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2858 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2859 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2860 /* 1 if the alignment for this type was requested by "aligned" attribute,
2861 0 if it is the default for this type. */
2863 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2864 which this FIELD_DECL is defined. This information is needed when
2865 writing debugging information about vfield and vbase decls for C++. */
2866 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2868 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2869 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2871 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2873 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2875 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2876 this component. This makes it possible for Type-Based Alias Analysis
2877 to disambiguate accesses to this field with indirect accesses using
2880 struct S { int i; } s;
2883 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2885 From the implementation's viewpoint, the alias set of the type of the
2886 field 'i' (int) will not be recorded as a subset of that of the type of
2887 's' (struct S) in record_component_aliases. The counterpart is that
2888 accesses to s.i must not be given the alias set of the type of 'i'
2889 (int) but instead directly that of the type of 's' (struct S). */
2890 #define DECL_NONADDRESSABLE_P(NODE) \
2891 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2893 struct GTY(()) tree_field_decl {
2894 struct tree_decl_common common;
2897 tree bit_field_type;
2903 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2904 dense, unique within any one function, and may be used to index arrays.
2905 If the value is -1, then no UID has been assigned. */
2906 #define LABEL_DECL_UID(NODE) \
2907 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2909 /* In a LABEL_DECL, the EH region number for which the label is the
2910 post_landing_pad. */
2911 #define EH_LANDING_PAD_NR(NODE) \
2912 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2914 /* In LABEL_DECL nodes, nonzero means that an error message about
2915 jumping into such a binding contour has been printed for this label. */
2916 #define DECL_ERROR_ISSUED(NODE) \
2917 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2919 struct GTY(()) tree_label_decl {
2920 struct tree_decl_with_rtl common;
2922 int eh_landing_pad_nr;
2926 struct GTY(()) tree_result_decl {
2927 struct tree_decl_with_rtl common;
2928 struct var_ann_d *ann;
2931 struct GTY(()) tree_const_decl {
2932 struct tree_decl_with_rtl common;
2935 /* For a PARM_DECL, records the data type used to pass the argument,
2936 which may be different from the type seen in the program. */
2937 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2939 /* For PARM_DECL, holds an RTL for the stack slot or register
2940 where the data was actually passed. */
2941 #define DECL_INCOMING_RTL(NODE) \
2942 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2944 struct GTY(()) tree_parm_decl {
2945 struct tree_decl_with_rtl common;
2947 struct var_ann_d *ann;
2951 /* Nonzero for a given ..._DECL node means that no warnings should be
2952 generated just because this node is unused. */
2953 #define DECL_IN_SYSTEM_HEADER(NODE) \
2954 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2956 /* Used to indicate that the linkage status of this DECL is not yet known,
2957 so it should not be output now. */
2958 #define DECL_DEFER_OUTPUT(NODE) \
2959 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2961 /* In a VAR_DECL that's static,
2962 nonzero if the space is in the text section. */
2963 #define DECL_IN_TEXT_SECTION(NODE) \
2964 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2966 /* Nonzero for a given ..._DECL node means that this node should be
2967 put in .common, if possible. If a DECL_INITIAL is given, and it
2968 is not error_mark_node, then the decl cannot be put in .common. */
2969 #define DECL_COMMON(NODE) \
2970 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2972 /* In a VAR_DECL, nonzero if the decl is a register variable with
2973 an explicit asm specification. */
2974 #define DECL_HARD_REGISTER(NODE) \
2975 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2977 /* Used to indicate that this DECL has weak linkage. */
2978 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2980 /* Used to indicate that the DECL is a dllimport. */
2981 #define DECL_DLLIMPORT_P(NODE) \
2982 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2984 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2985 not be put out unless it is needed in this translation unit.
2986 Entities like this are shared across translation units (like weak
2987 entities), but are guaranteed to be generated by any translation
2988 unit that needs them, and therefore need not be put out anywhere
2989 where they are not needed. DECL_COMDAT is just a hint to the
2990 back-end; it is up to front-ends which set this flag to ensure
2991 that there will never be any harm, other than bloat, in putting out
2992 something which is DECL_COMDAT. */
2993 #define DECL_COMDAT(NODE) \
2994 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2996 #define DECL_COMDAT_GROUP(NODE) \
2997 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2999 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3000 multiple translation units should be merged. */
3001 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3003 /* A replaceable function is one which may be replaced at link-time
3004 with an entirely different definition, provided that the
3005 replacement has the same type. For example, functions declared
3006 with __attribute__((weak)) on most systems are replaceable.
3008 COMDAT functions are not replaceable, since all definitions of the
3009 function must be equivalent. It is important that COMDAT functions
3010 not be treated as replaceable so that use of C++ template
3011 instantiations is not penalized.
3013 For example, DECL_REPLACEABLE is used to determine whether or not a
3014 function (including a template instantiation) which is not
3015 explicitly declared "inline" can be inlined. If the function is
3016 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3017 implementation chosen at link-time may be different. However, a
3018 function that is not DECL_REPLACEABLE can be inlined, since all
3019 versions of the function will be functionally identical. */
3020 #define DECL_REPLACEABLE_P(NODE) \
3021 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3023 /* The name of the object as the assembler will see it (but before any
3024 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3025 as DECL_NAME. It is an IDENTIFIER_NODE. */
3026 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3028 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3029 This is true of all DECL nodes except FIELD_DECL. */
3030 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3031 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3033 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3034 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3036 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3037 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3038 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3040 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3041 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3042 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3044 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3045 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3046 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3047 semantics of using this macro, are different than saying:
3049 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3051 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3053 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3054 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3055 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3056 DECL_ASSEMBLER_NAME (DECL1)) \
3059 /* Records the section name in a section attribute. Used to pass
3060 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3061 #define DECL_SECTION_NAME(NODE) \
3062 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3064 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3065 this variable in a BIND_EXPR. */
3066 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3067 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3069 /* Value of the decls's visibility attribute */
3070 #define DECL_VISIBILITY(NODE) \
3071 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3073 /* Nonzero means that the decl had its visibility specified rather than
3075 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3076 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3078 /* In a VAR_DECL, the model to use if the data should be allocated from
3079 thread-local storage. */
3080 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3082 /* In a VAR_DECL, nonzero if the data should be allocated from
3083 thread-local storage. */
3084 #define DECL_THREAD_LOCAL_P(NODE) \
3085 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3087 /* In a non-local VAR_DECL with static storage duration, true if the
3088 variable has an initialization priority. If false, the variable
3089 will be initialized at the DEFAULT_INIT_PRIORITY. */
3090 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3091 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3093 struct GTY(()) tree_decl_with_vis {
3094 struct tree_decl_with_rtl common;
3095 tree assembler_name;
3099 /* Belong to VAR_DECL exclusively. */
3100 unsigned defer_output : 1;
3101 unsigned hard_register : 1;
3102 unsigned thread_local : 1;
3103 unsigned common_flag : 1;
3104 unsigned in_text_section : 1;
3105 unsigned dllimport_flag : 1;
3106 /* Used by C++. Might become a generic decl flag. */
3107 unsigned shadowed_for_var_p : 1;
3108 /* Don't belong to VAR_DECL exclusively. */
3109 unsigned weak_flag : 1;
3111 unsigned seen_in_bind_expr : 1;
3112 unsigned comdat_flag : 1;
3113 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3114 unsigned visibility_specified : 1;
3115 /* Belongs to VAR_DECL exclusively. */
3116 ENUM_BITFIELD(tls_model) tls_model : 3;
3118 /* Belong to FUNCTION_DECL exclusively. */
3119 unsigned init_priority_p : 1;
3120 /* 15 unused bits. */
3123 extern tree decl_debug_expr_lookup (tree);
3124 extern void decl_debug_expr_insert (tree, tree);
3125 /* For VAR_DECL, this is set to either an expression that it was split
3126 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3127 subexpressions that it was split into. */
3128 #define DECL_DEBUG_EXPR(NODE) \
3129 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3131 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3132 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3134 /* An initialization priority. */
3135 typedef unsigned short priority_type;
3137 extern priority_type decl_init_priority_lookup (tree);
3138 extern priority_type decl_fini_priority_lookup (tree);
3139 extern void decl_init_priority_insert (tree, priority_type);
3140 extern void decl_fini_priority_insert (tree, priority_type);
3142 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3144 #define DECL_INIT_PRIORITY(NODE) \
3145 (decl_init_priority_lookup (NODE))
3146 /* Set the initialization priority for NODE to VAL. */
3147 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3148 (decl_init_priority_insert (NODE, VAL))
3150 /* For a FUNCTION_DECL the finalization priority of NODE. */
3151 #define DECL_FINI_PRIORITY(NODE) \
3152 (decl_fini_priority_lookup (NODE))
3153 /* Set the finalization priority for NODE to VAL. */
3154 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3155 (decl_fini_priority_insert (NODE, VAL))
3157 /* The initialization priority for entities for which no explicit
3158 initialization priority has been specified. */
3159 #define DEFAULT_INIT_PRIORITY 65535
3161 /* The maximum allowed initialization priority. */
3162 #define MAX_INIT_PRIORITY 65535
3164 /* The largest priority value reserved for use by system runtime
3166 #define MAX_RESERVED_INIT_PRIORITY 100
3168 #define DECL_VAR_ANN_PTR(NODE) \
3169 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3170 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3171 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3174 struct GTY(()) tree_var_decl {
3175 struct tree_decl_with_vis common;
3176 struct var_ann_d *ann;
3180 /* This field is used to reference anything in decl.result and is meant only
3181 for use by the garbage collector. */
3182 #define DECL_RESULT_FLD(NODE) \
3183 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3185 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3186 Before the struct containing the FUNCTION_DECL is laid out,
3187 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3188 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3189 function. When the class is laid out, this pointer is changed
3190 to an INTEGER_CST node which is suitable for use as an index
3191 into the virtual function table.
3192 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3193 #define DECL_VINDEX(NODE) \
3194 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3197 tree_decl_non_common {
3198 struct tree_decl_with_vis common;
3199 /* C++ uses this in namespaces. */
3201 /* C++ uses this in templates. */
3203 /* Almost all FE's use this. */
3205 /* C++ uses this in namespaces. */
3209 /* In FUNCTION_DECL, holds the decl for the return value. */
3210 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3212 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3213 #define DECL_UNINLINABLE(NODE) \
3214 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3216 /* In a FUNCTION_DECL, the saved representation of the body of the
3218 #define DECL_SAVED_TREE(NODE) \
3219 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3221 /* Nonzero in a FUNCTION_DECL means this function should be treated
3222 as if it were a malloc, meaning it returns a pointer that is
3224 #define DECL_IS_MALLOC(NODE) \
3225 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3227 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3228 C++ operator new, meaning that it returns a pointer for which we
3229 should not use type based aliasing. */
3230 #define DECL_IS_OPERATOR_NEW(NODE) \
3231 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3233 /* Nonzero in a FUNCTION_DECL means this function may return more
3235 #define DECL_IS_RETURNS_TWICE(NODE) \
3236 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3238 /* Nonzero in a FUNCTION_DECL means this function should be treated
3239 as "pure" function (like const function, but may read global memory). */
3240 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3242 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3243 the const or pure function may not terminate. When this is nonzero
3244 for a const or pure function, it can be dealt with by cse passes
3245 but cannot be removed by dce passes since you are not allowed to
3246 change an infinite looping program into one that terminates without
3248 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3249 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3251 /* Nonzero in a FUNCTION_DECL means this function should be treated
3252 as "novops" function (function that does not read global memory,
3253 but may have arbitrary side effects). */
3254 #define DECL_IS_NOVOPS(NODE) \
3255 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3257 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3258 at the beginning or end of execution. */
3259 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3260 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3262 #define DECL_STATIC_DESTRUCTOR(NODE) \
3263 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3265 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3266 be instrumented with calls to support routines. */
3267 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3268 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3270 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3271 disabled in this function. */
3272 #define DECL_NO_LIMIT_STACK(NODE) \
3273 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3275 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3276 #define DECL_STATIC_CHAIN(NODE) \
3277 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3279 /* Nonzero for a decl that cgraph has decided should be inlined into
3280 at least one call site. It is not meaningful to look at this
3281 directly; always use cgraph_function_possibly_inlined_p. */
3282 #define DECL_POSSIBLY_INLINED(DECL) \
3283 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3285 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3286 such as via the `inline' keyword in C/C++. This flag controls the linkage
3287 semantics of 'inline' */
3288 #define DECL_DECLARED_INLINE_P(NODE) \
3289 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3291 /* Nonzero in a FUNCTION_DECL means this function should not get
3292 -Winline warnings. */
3293 #define DECL_NO_INLINE_WARNING_P(NODE) \
3294 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3296 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3297 disregarding size and cost heuristics. This is equivalent to using
3298 the always_inline attribute without the required diagnostics if the
3299 function cannot be inlined. */
3300 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3301 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3303 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3304 that describes the status of this function. */
3305 #define DECL_STRUCT_FUNCTION(NODE) \
3306 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3308 /* In a FUNCTION_DECL, nonzero means a built in function. */
3309 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3311 /* For a builtin function, identify which part of the compiler defined it. */
3312 #define DECL_BUILT_IN_CLASS(NODE) \
3313 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3315 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3316 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3318 #define DECL_ARGUMENTS(NODE) \
3319 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3320 #define DECL_ARGUMENT_FLD(NODE) \
3321 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3323 /* In FUNCTION_DECL, the function specific target options to use when compiling
3325 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3326 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3328 /* In FUNCTION_DECL, the function specific optimization options to use when
3329 compiling this function. */
3330 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3331 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3333 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3334 arguments/result/saved_tree fields by front ends. It was either inherit
3335 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3336 which seemed a bit strange. */
3338 struct GTY(()) tree_function_decl {
3339 struct tree_decl_non_common common;
3343 /* The personality function. Used for stack unwinding. */
3346 /* Function specific options that are used by this function. */
3347 tree function_specific_target; /* target options */
3348 tree function_specific_optimization; /* optimization options */
3350 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3351 DECL_FUNCTION_CODE. Otherwise unused.
3352 ??? The bitfield needs to be able to hold all target function
3354 ENUM_BITFIELD(built_in_function) function_code : 11;
3355 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3357 unsigned static_ctor_flag : 1;
3358 unsigned static_dtor_flag : 1;
3359 unsigned uninlinable : 1;
3361 unsigned possibly_inlined : 1;
3362 unsigned novops_flag : 1;
3363 unsigned returns_twice_flag : 1;
3364 unsigned malloc_flag : 1;
3365 unsigned operator_new_flag : 1;
3366 unsigned declared_inline_flag : 1;
3367 unsigned regdecl_flag : 1;
3369 unsigned no_inline_warning_flag : 1;
3370 unsigned no_instrument_function_entry_exit : 1;
3371 unsigned no_limit_stack : 1;
3372 unsigned disregard_inline_limits : 1;
3373 unsigned pure_flag : 1;
3374 unsigned looping_const_or_pure_flag : 1;
3380 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3381 #define DECL_ORIGINAL_TYPE(NODE) \
3382 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3384 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3385 into stabs. Instead it will generate cross reference ('x') of names.
3386 This uses the same flag as DECL_EXTERNAL. */
3387 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3388 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3390 /* Getter of the imported declaration associated to the
3391 IMPORTED_DECL node. */
3392 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3393 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3395 struct GTY(()) tree_type_decl {
3396 struct tree_decl_non_common common;
3400 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3401 To reduce overhead, the nodes containing the statements are not trees.
3402 This avoids the overhead of tree_common on all linked list elements.
3404 Use the interface in tree-iterator.h to access this node. */
3406 #define STATEMENT_LIST_HEAD(NODE) \
3407 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3408 #define STATEMENT_LIST_TAIL(NODE) \
3409 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3411 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3413 struct tree_statement_list_node *prev;
3414 struct tree_statement_list_node *next;
3418 struct GTY(()) tree_statement_list
3420 struct tree_common common;
3421 struct tree_statement_list_node *head;
3422 struct tree_statement_list_node *tail;
3426 /* Optimization options used by a function. */
3428 struct GTY(()) tree_optimization_option {
3429 struct tree_common common;
3431 /* The optimization options used by the user. */
3432 struct cl_optimization opts;
3435 #define TREE_OPTIMIZATION(NODE) \
3436 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3438 /* Return a tree node that encapsulates the current optimization options. */
3439 extern tree build_optimization_node (void);
3441 /* Target options used by a function. */
3443 struct GTY(()) tree_target_option {
3444 struct tree_common common;
3446 /* The optimization options used by the user. */
3447 struct cl_target_option opts;
3450 #define TREE_TARGET_OPTION(NODE) \
3451 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3453 /* Return a tree node that encapsulates the current target options. */
3454 extern tree build_target_option_node (void);
3457 /* Define the overall contents of a tree node.
3458 It may be any of the structures declared above
3459 for various types of node. */
3461 union GTY ((ptr_alias (union lang_tree_node),
3462 desc ("tree_node_structure (&%h)"))) tree_node {
3463 struct tree_base GTY ((tag ("TS_BASE"))) base;
3464 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3465 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3466 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3467 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3468 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3469 struct tree_string GTY ((tag ("TS_STRING"))) string;
3470 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3471 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3472 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3473 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3474 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3475 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3476 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3477 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3478 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3479 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3480 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3481 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3482 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3483 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3484 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3485 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3486 struct tree_list GTY ((tag ("TS_LIST"))) list;
3487 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3488 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3489 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3490 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3491 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3492 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3493 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3494 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3495 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3496 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3499 /* Standard named or nameless data types of the C compiler. */
3521 TI_INTEGER_MINUS_ONE,
3538 TI_COMPLEX_INTEGER_TYPE,
3539 TI_COMPLEX_FLOAT_TYPE,
3540 TI_COMPLEX_DOUBLE_TYPE,
3541 TI_COMPLEX_LONG_DOUBLE_TYPE,
3545 TI_LONG_DOUBLE_TYPE,
3549 TI_LONG_DOUBLE_PTR_TYPE,
3550 TI_INTEGER_PTR_TYPE,
3559 TI_VA_LIST_GPR_COUNTER_FIELD,
3560 TI_VA_LIST_FPR_COUNTER_FIELD,
3567 TI_DFLOAT32_PTR_TYPE,
3568 TI_DFLOAT64_PTR_TYPE,
3569 TI_DFLOAT128_PTR_TYPE,
3578 TI_SAT_LLFRACT_TYPE,
3579 TI_SAT_USFRACT_TYPE,
3581 TI_SAT_ULFRACT_TYPE,
3582 TI_SAT_ULLFRACT_TYPE,
3594 TI_SAT_LLACCUM_TYPE,
3595 TI_SAT_USACCUM_TYPE,
3597 TI_SAT_ULACCUM_TYPE,
3598 TI_SAT_ULLACCUM_TYPE,
3644 TI_OPTIMIZATION_DEFAULT,
3645 TI_OPTIMIZATION_CURRENT,
3646 TI_TARGET_OPTION_DEFAULT,
3647 TI_TARGET_OPTION_CURRENT,
3648 TI_CURRENT_TARGET_PRAGMA,
3649 TI_CURRENT_OPTIMIZE_PRAGMA,
3654 extern GTY(()) tree global_trees[TI_MAX];
3656 #define error_mark_node global_trees[TI_ERROR_MARK]
3658 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3659 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3660 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3661 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3662 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3664 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3665 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3666 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3667 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3668 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3670 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3671 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3673 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3674 #define integer_one_node global_trees[TI_INTEGER_ONE]
3675 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3676 #define size_zero_node global_trees[TI_SIZE_ZERO]
3677 #define size_one_node global_trees[TI_SIZE_ONE]
3678 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3679 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3680 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3682 /* Base access nodes. */
3683 #define access_public_node global_trees[TI_PUBLIC]
3684 #define access_protected_node global_trees[TI_PROTECTED]
3685 #define access_private_node global_trees[TI_PRIVATE]
3687 #define null_pointer_node global_trees[TI_NULL_POINTER]
3689 #define float_type_node global_trees[TI_FLOAT_TYPE]
3690 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3691 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3693 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3694 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3695 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3696 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3698 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3699 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3700 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3701 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3703 #define void_type_node global_trees[TI_VOID_TYPE]
3704 /* The C type `void *'. */
3705 #define ptr_type_node global_trees[TI_PTR_TYPE]
3706 /* The C type `const void *'. */
3707 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3708 /* The C type `size_t'. */
3709 #define size_type_node global_trees[TI_SIZE_TYPE]
3710 #define pid_type_node global_trees[TI_PID_TYPE]
3711 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3712 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3713 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3714 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3715 /* The C type `FILE *'. */
3716 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3718 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3719 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3720 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3722 /* The decimal floating point types. */
3723 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3724 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3725 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3726 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3727 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3728 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3730 /* The fixed-point types. */
3731 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3732 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3733 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3734 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3735 #define sat_unsigned_short_fract_type_node \
3736 global_trees[TI_SAT_USFRACT_TYPE]
3737 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3738 #define sat_unsigned_long_fract_type_node \
3739 global_trees[TI_SAT_ULFRACT_TYPE]
3740 #define sat_unsigned_long_long_fract_type_node \
3741 global_trees[TI_SAT_ULLFRACT_TYPE]
3742 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3743 #define fract_type_node global_trees[TI_FRACT_TYPE]
3744 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3745 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3746 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3747 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3748 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3749 #define unsigned_long_long_fract_type_node \
3750 global_trees[TI_ULLFRACT_TYPE]
3751 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3752 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3753 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3754 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3755 #define sat_unsigned_short_accum_type_node \
3756 global_trees[TI_SAT_USACCUM_TYPE]
3757 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3758 #define sat_unsigned_long_accum_type_node \
3759 global_trees[TI_SAT_ULACCUM_TYPE]
3760 #define sat_unsigned_long_long_accum_type_node \
3761 global_trees[TI_SAT_ULLACCUM_TYPE]
3762 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3763 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3764 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3765 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3766 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3767 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3768 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3769 #define unsigned_long_long_accum_type_node \
3770 global_trees[TI_ULLACCUM_TYPE]
3771 #define qq_type_node global_trees[TI_QQ_TYPE]
3772 #define hq_type_node global_trees[TI_HQ_TYPE]
3773 #define sq_type_node global_trees[TI_SQ_TYPE]
3774 #define dq_type_node global_trees[TI_DQ_TYPE]
3775 #define tq_type_node global_trees[TI_TQ_TYPE]
3776 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3777 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3778 #define usq_type_node global_trees[TI_USQ_TYPE]
3779 #define udq_type_node global_trees[TI_UDQ_TYPE]
3780 #define utq_type_node global_trees[TI_UTQ_TYPE]
3781 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3782 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3783 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3784 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3785 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3786 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3787 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3788 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3789 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3790 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3791 #define ha_type_node global_trees[TI_HA_TYPE]
3792 #define sa_type_node global_trees[TI_SA_TYPE]
3793 #define da_type_node global_trees[TI_DA_TYPE]
3794 #define ta_type_node global_trees[TI_TA_TYPE]
3795 #define uha_type_node global_trees[TI_UHA_TYPE]
3796 #define usa_type_node global_trees[TI_USA_TYPE]
3797 #define uda_type_node global_trees[TI_UDA_TYPE]
3798 #define uta_type_node global_trees[TI_UTA_TYPE]
3799 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3800 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3801 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3802 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3803 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3804 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3805 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3806 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3808 /* The node that should be placed at the end of a parameter list to
3809 indicate that the function does not take a variable number of
3810 arguments. The TREE_VALUE will be void_type_node and there will be
3811 no TREE_CHAIN. Language-independent code should not assume
3812 anything else about this node. */
3813 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3815 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3816 #define MAIN_NAME_P(NODE) \
3817 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3819 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3821 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3822 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3824 /* Default/current target options (TARGET_OPTION_NODE). */
3825 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3826 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3828 /* Default tree list option(), optimize() pragmas to be linked into the
3830 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3831 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3833 /* An enumeration of the standard C integer types. These must be
3834 ordered so that shorter types appear before longer ones, and so
3835 that signed types appear before unsigned ones, for the correct
3836 functioning of interpret_integer() in c-lex.c. */
3837 enum integer_type_kind
3849 itk_unsigned_long_long,
3853 typedef enum integer_type_kind integer_type_kind;
3855 /* The standard C integer types. Use integer_type_kind to index into
3857 extern GTY(()) tree integer_types[itk_none];
3859 #define char_type_node integer_types[itk_char]
3860 #define signed_char_type_node integer_types[itk_signed_char]
3861 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3862 #define short_integer_type_node integer_types[itk_short]
3863 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3864 #define integer_type_node integer_types[itk_int]
3865 #define unsigned_type_node integer_types[itk_unsigned_int]
3866 #define long_integer_type_node integer_types[itk_long]
3867 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3868 #define long_long_integer_type_node integer_types[itk_long_long]
3869 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3871 /* Set to the default thread-local storage (tls) model to use. */
3873 extern enum tls_model flag_tls_default;
3876 /* A pointer-to-function member type looks like:
3883 If __pfn is NULL, it is a NULL pointer-to-member-function.
3885 (Because the vtable is always the first thing in the object, we
3886 don't need its offset.) If the function is virtual, then PFN is
3887 one plus twice the index into the vtable; otherwise, it is just a
3888 pointer to the function.
3890 Unfortunately, using the lowest bit of PFN doesn't work in
3891 architectures that don't impose alignment requirements on function
3892 addresses, or that use the lowest bit to tell one ISA from another,
3893 for example. For such architectures, we use the lowest bit of
3894 DELTA instead of the lowest bit of the PFN, and DELTA will be
3897 enum ptrmemfunc_vbit_where_t
3899 ptrmemfunc_vbit_in_pfn,
3900 ptrmemfunc_vbit_in_delta
3903 #define NULL_TREE (tree) NULL
3905 extern tree decl_assembler_name (tree);
3906 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3907 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3909 /* Compute the number of bytes occupied by 'node'. This routine only
3910 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3912 extern size_t tree_size (const_tree);
3914 /* Compute the number of bytes occupied by a tree with code CODE. This
3915 function cannot be used for TREE_VEC codes, which are of variable
3917 extern size_t tree_code_size (enum tree_code);
3919 /* Lowest level primitive for allocating a node.
3920 The TREE_CODE is the only argument. Contents are initialized
3921 to zero except for a few of the common fields. */
3923 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3924 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3926 /* Make a copy of a node, with all the same contents. */
3928 extern tree copy_node_stat (tree MEM_STAT_DECL);
3929 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3931 /* Make a copy of a chain of TREE_LIST nodes. */
3933 extern tree copy_list (tree);
3936 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3937 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3939 /* Make a TREE_VEC. */
3941 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3942 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3944 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3945 The name is supplied as a char *. */
3947 extern tree get_identifier (const char *);
3949 #if GCC_VERSION >= 3000
3950 #define get_identifier(str) \
3951 (__builtin_constant_p (str) \
3952 ? get_identifier_with_length ((str), strlen (str)) \
3953 : get_identifier (str))
3957 /* Identical to get_identifier, except that the length is assumed
3960 extern tree get_identifier_with_length (const char *, size_t);
3962 /* If an identifier with the name TEXT (a null-terminated string) has
3963 previously been referred to, return that node; otherwise return
3966 extern tree maybe_get_identifier (const char *);
3968 /* Construct various types of nodes. */
3970 extern tree build_nt (enum tree_code, ...);
3971 extern tree build_nt_call_list (tree, tree);
3972 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3974 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3975 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3976 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3977 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3978 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3979 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3980 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3981 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3982 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3983 tree MEM_STAT_DECL);
3984 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3985 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3986 tree MEM_STAT_DECL);
3987 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3988 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3989 tree, tree MEM_STAT_DECL);
3990 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3991 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3993 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3994 #define build_var_debug_value(t1,t2) \
3995 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3997 extern tree build_int_cst (tree, HOST_WIDE_INT);
3998 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3999 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
4000 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4001 extern tree build_int_cst_wide_type (tree,
4002 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4003 extern tree build_vector (tree, tree);
4004 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
4005 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
4006 extern tree build_constructor_single (tree, tree, tree);
4007 extern tree build_constructor_from_list (tree, tree);
4008 extern tree build_real_from_int_cst (tree, const_tree);
4009 extern tree build_complex (tree, tree, tree);
4010 extern tree build_one_cst (tree);
4011 extern tree build_string (int, const char *);
4012 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
4013 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4014 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
4015 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4016 extern tree build_decl_stat (location_t, enum tree_code,
4017 tree, tree MEM_STAT_DECL);
4018 extern tree build_fn_decl (const char *, tree);
4019 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4020 extern tree build_block (tree, tree, tree, tree);
4021 extern tree build_empty_stmt (location_t);
4022 extern tree build_omp_clause (location_t, enum omp_clause_code);
4024 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
4025 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4027 extern tree build_call_list (tree, tree, tree);
4028 extern tree build_call_nary (tree, tree, int, ...);
4029 extern tree build_call_valist (tree, tree, int, va_list);
4030 #define build_call_array(T1,T2,N,T3)\
4031 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4032 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4033 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
4035 /* Construct various nodes representing data types. */
4037 extern tree make_signed_type (int);
4038 extern tree make_unsigned_type (int);
4039 extern tree signed_or_unsigned_type_for (int, tree);
4040 extern tree signed_type_for (tree);
4041 extern tree unsigned_type_for (tree);
4042 extern void initialize_sizetypes (void);
4043 extern void set_sizetype (tree);
4044 extern void fixup_unsigned_type (tree);
4045 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4046 extern tree build_pointer_type (tree);
4047 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4048 extern tree build_reference_type (tree);
4049 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4050 extern tree build_vector_type (tree innertype, int nunits);
4051 extern tree build_opaque_vector_type (tree innertype, int nunits);
4052 extern tree build_type_no_quals (tree);
4053 extern tree build_index_type (tree);
4054 extern tree build_index_2_type (tree, tree);
4055 extern tree build_array_type (tree, tree);
4056 extern tree build_function_type (tree, tree);
4057 extern tree build_function_type_list (tree, ...);
4058 extern tree build_function_type_skip_args (tree, bitmap);
4059 extern tree build_function_decl_skip_args (tree, bitmap);
4060 extern tree build_varargs_function_type_list (tree, ...);
4061 extern tree build_method_type_directly (tree, tree, tree);
4062 extern tree build_method_type (tree, tree);
4063 extern tree build_offset_type (tree, tree);
4064 extern tree build_complex_type (tree);
4065 extern tree array_type_nelts (const_tree);
4066 extern bool in_array_bounds_p (tree);
4067 extern bool range_in_array_bounds_p (tree);
4069 extern tree value_member (tree, tree);
4070 extern tree purpose_member (const_tree, tree);
4071 extern tree chain_index (int, tree);
4073 extern int attribute_list_equal (const_tree, const_tree);
4074 extern int attribute_list_contained (const_tree, const_tree);
4075 extern int tree_int_cst_equal (const_tree, const_tree);
4076 extern int tree_int_cst_lt (const_tree, const_tree);
4077 extern int tree_int_cst_compare (const_tree, const_tree);
4078 extern int host_integerp (const_tree, int);
4079 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4080 extern int tree_int_cst_msb (const_tree);
4081 extern int tree_int_cst_sgn (const_tree);
4082 extern int tree_int_cst_sign_bit (const_tree);
4083 extern unsigned int tree_int_cst_min_precision (tree, bool);
4084 extern bool tree_expr_nonnegative_p (tree);
4085 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4086 extern bool may_negate_without_overflow_p (const_tree);
4087 extern tree strip_array_types (tree);
4088 extern tree excess_precision_type (tree);
4090 /* Construct various nodes representing fract or accum data types. */
4092 extern tree make_fract_type (int, int, int);
4093 extern tree make_accum_type (int, int, int);
4095 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4096 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4097 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4098 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4099 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4100 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4101 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4102 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4104 #define make_or_reuse_signed_fract_type(P) \
4105 make_or_reuse_fract_type (P, 0, 0)
4106 #define make_or_reuse_unsigned_fract_type(P) \
4107 make_or_reuse_fract_type (P, 1, 0)
4108 #define make_or_reuse_sat_signed_fract_type(P) \
4109 make_or_reuse_fract_type (P, 0, 1)
4110 #define make_or_reuse_sat_unsigned_fract_type(P) \
4111 make_or_reuse_fract_type (P, 1, 1)
4112 #define make_or_reuse_signed_accum_type(P) \
4113 make_or_reuse_accum_type (P, 0, 0)
4114 #define make_or_reuse_unsigned_accum_type(P) \
4115 make_or_reuse_accum_type (P, 1, 0)
4116 #define make_or_reuse_sat_signed_accum_type(P) \
4117 make_or_reuse_accum_type (P, 0, 1)
4118 #define make_or_reuse_sat_unsigned_accum_type(P) \
4119 make_or_reuse_accum_type (P, 1, 1)
4121 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4122 put the prototype here. Rtl.h does declare the prototype if
4123 tree.h had been included. */
4125 extern tree make_tree (tree, rtx);
4127 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4130 Such modified types already made are recorded so that duplicates
4133 extern tree build_type_attribute_variant (tree, tree);
4134 extern tree build_decl_attribute_variant (tree, tree);
4135 extern tree build_type_attribute_qual_variant (tree, tree, int);
4137 /* Structure describing an attribute and a function to handle it. */
4138 struct attribute_spec
4140 /* The name of the attribute (without any leading or trailing __),
4141 or NULL to mark the end of a table of attributes. */
4142 const char *const name;
4143 /* The minimum length of the list of arguments of the attribute. */
4144 const int min_length;
4145 /* The maximum length of the list of arguments of the attribute
4146 (-1 for no maximum). */
4147 const int max_length;
4148 /* Whether this attribute requires a DECL. If it does, it will be passed
4149 from types of DECLs, function return types and array element types to
4150 the DECLs, function types and array types respectively; but when
4151 applied to a type in any other circumstances, it will be ignored with
4152 a warning. (If greater control is desired for a given attribute,
4153 this should be false, and the flags argument to the handler may be
4154 used to gain greater control in that case.) */
4155 const bool decl_required;
4156 /* Whether this attribute requires a type. If it does, it will be passed
4157 from a DECL to the type of that DECL. */
4158 const bool type_required;
4159 /* Whether this attribute requires a function (or method) type. If it does,
4160 it will be passed from a function pointer type to the target type,
4161 and from a function return type (which is not itself a function
4162 pointer type) to the function type. */
4163 const bool function_type_required;
4164 /* Function to handle this attribute. NODE points to the node to which
4165 the attribute is to be applied. If a DECL, it should be modified in
4166 place; if a TYPE, a copy should be created. NAME is the name of the
4167 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4168 of the arguments (which may be NULL). FLAGS gives further information
4169 about the context of the attribute. Afterwards, the attributes will
4170 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4171 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4172 as well as in any other cases when the attributes should not be added
4173 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4174 applied to another type or DECL later may be returned;
4175 otherwise the return value should be NULL_TREE. This pointer may be
4176 NULL if no special handling is required beyond the checks implied
4177 by the rest of this structure. */
4178 tree (*const handler) (tree *node, tree name, tree args,
4179 int flags, bool *no_add_attrs);
4182 /* Flags that may be passed in the third argument of decl_attributes, and
4183 to handler functions for attributes. */
4184 enum attribute_flags
4186 /* The type passed in is the type of a DECL, and any attributes that
4187 should be passed in again to be applied to the DECL rather than the
4188 type should be returned. */
4189 ATTR_FLAG_DECL_NEXT = 1,
4190 /* The type passed in is a function return type, and any attributes that
4191 should be passed in again to be applied to the function type rather
4192 than the return type should be returned. */
4193 ATTR_FLAG_FUNCTION_NEXT = 2,
4194 /* The type passed in is an array element type, and any attributes that
4195 should be passed in again to be applied to the array type rather
4196 than the element type should be returned. */
4197 ATTR_FLAG_ARRAY_NEXT = 4,
4198 /* The type passed in is a structure, union or enumeration type being
4199 created, and should be modified in place. */
4200 ATTR_FLAG_TYPE_IN_PLACE = 8,
4201 /* The attributes are being applied by default to a library function whose
4202 name indicates known behavior, and should be silently ignored if they
4203 are not in fact compatible with the function type. */
4204 ATTR_FLAG_BUILT_IN = 16
4207 /* Default versions of target-overridable functions. */
4209 extern tree merge_decl_attributes (tree, tree);
4210 extern tree merge_type_attributes (tree, tree);
4212 /* Given a tree node and a string, return nonzero if the tree node is
4213 a valid attribute name for the string. */
4215 extern int is_attribute_p (const char *, const_tree);
4217 /* Given an attribute name and a list of attributes, return the list element
4218 of the attribute or NULL_TREE if not found. */
4220 extern tree lookup_attribute (const char *, tree);
4222 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4225 extern tree remove_attribute (const char *, tree);
4227 /* Given two attributes lists, return a list of their union. */
4229 extern tree merge_attributes (tree, tree);
4231 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4232 /* Given two Windows decl attributes lists, possibly including
4233 dllimport, return a list of their union . */
4234 extern tree merge_dllimport_decl_attributes (tree, tree);
4236 /* Handle a "dllimport" or "dllexport" attribute. */
4237 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4240 /* Check whether CAND is suitable to be returned from get_qualified_type
4241 (BASE, TYPE_QUALS). */
4243 extern bool check_qualified_type (const_tree, const_tree, int);
4245 /* Return a version of the TYPE, qualified as indicated by the
4246 TYPE_QUALS, if one exists. If no qualified version exists yet,
4247 return NULL_TREE. */
4249 extern tree get_qualified_type (tree, int);
4251 /* Like get_qualified_type, but creates the type if it does not
4252 exist. This function never returns NULL_TREE. */
4254 extern tree build_qualified_type (tree, int);
4256 /* Like build_qualified_type, but only deals with the `const' and
4257 `volatile' qualifiers. This interface is retained for backwards
4258 compatibility with the various front-ends; new code should use
4259 build_qualified_type instead. */
4261 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4262 build_qualified_type ((TYPE), \
4263 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4264 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4266 /* Make a copy of a type node. */
4268 extern tree build_distinct_type_copy (tree);
4269 extern tree build_variant_type_copy (tree);
4271 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4272 fields. Optionally specify an alignment, and then lay it out. */
4274 extern void finish_builtin_struct (tree, const char *,
4277 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4278 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4279 node, does nothing except for the first time. */
4281 extern void layout_type (tree);
4283 /* These functions allow a front-end to perform a manual layout of a
4284 RECORD_TYPE. (For instance, if the placement of subsequent fields
4285 depends on the placement of fields so far.) Begin by calling
4286 start_record_layout. Then, call place_field for each of the
4287 fields. Then, call finish_record_layout. See layout_type for the
4288 default way in which these functions are used. */
4290 typedef struct record_layout_info_s
4292 /* The RECORD_TYPE that we are laying out. */
4294 /* The offset into the record so far, in bytes, not including bits in
4297 /* The last known alignment of SIZE. */
4298 unsigned int offset_align;
4299 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4301 /* The alignment of the record so far, in bits. */
4302 unsigned int record_align;
4303 /* The alignment of the record so far, ignoring #pragma pack and
4304 __attribute__ ((packed)), in bits. */
4305 unsigned int unpacked_align;
4306 /* The previous field layed out. */
4308 /* The static variables (i.e., class variables, as opposed to
4309 instance variables) encountered in T. */
4310 tree pending_statics;
4311 /* Bits remaining in the current alignment group */
4312 int remaining_in_alignment;
4313 /* True if we've seen a packed field that didn't have normal
4314 alignment anyway. */
4315 int packed_maybe_necessary;
4316 } *record_layout_info;
4318 extern record_layout_info start_record_layout (tree);
4319 extern tree bit_from_pos (tree, tree);
4320 extern tree byte_from_pos (tree, tree);
4321 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4322 extern void normalize_offset (tree *, tree *, unsigned int);
4323 extern tree rli_size_unit_so_far (record_layout_info);
4324 extern tree rli_size_so_far (record_layout_info);
4325 extern void normalize_rli (record_layout_info);
4326 extern void place_field (record_layout_info, tree);
4327 extern void compute_record_mode (tree);
4328 extern void finish_record_layout (record_layout_info, int);
4330 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4331 return a canonicalized ..._TYPE node, so that duplicates are not made.
4332 How the hash code is computed is up to the caller, as long as any two
4333 callers that could hash identical-looking type nodes agree. */
4335 extern tree type_hash_canon (unsigned int, tree);
4337 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4338 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4339 fields. Call this only once for any given decl node.
4341 Second argument is the boundary that this field can be assumed to
4342 be starting at (in bits). Zero means it can be assumed aligned
4343 on any boundary that may be needed. */
4345 extern void layout_decl (tree, unsigned);
4347 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4348 a previous call to layout_decl and calls it again. */
4350 extern void relayout_decl (tree);
4352 /* Return the mode for data of a given size SIZE and mode class CLASS.
4353 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4354 The value is BLKmode if no other mode is found. This is like
4355 mode_for_size, but is passed a tree. */
4357 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4359 /* Return an expr equal to X but certainly not valid as an lvalue. */
4361 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4362 extern tree non_lvalue_loc (location_t, tree);
4364 extern tree convert (tree, tree);
4365 extern unsigned int expr_align (const_tree);
4366 extern tree expr_first (tree);
4367 extern tree expr_last (tree);
4368 extern tree size_in_bytes (const_tree);
4369 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4370 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4371 extern tree tree_expr_size (const_tree);
4372 extern tree bit_position (const_tree);
4373 extern HOST_WIDE_INT int_bit_position (const_tree);
4374 extern tree byte_position (const_tree);
4375 extern HOST_WIDE_INT int_byte_position (const_tree);
4377 /* Define data structures, macros, and functions for handling sizes
4378 and the various types used to represent sizes. */
4382 SIZETYPE, /* Normal representation of sizes in bytes. */
4383 SSIZETYPE, /* Signed representation of sizes in bytes. */
4384 BITSIZETYPE, /* Normal representation of sizes in bits. */
4385 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4388 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4390 #define sizetype sizetype_tab[(int) SIZETYPE]
4391 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4392 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4393 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4395 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4396 #define size_binop(CODE,T1,T2)\
4397 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4398 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4399 #define size_diffop(T1,T2)\
4400 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4401 extern tree size_diffop_loc (location_t, tree, tree);
4403 #define size_int(L) size_int_kind (L, SIZETYPE)
4404 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4405 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4406 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4408 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4409 extern tree round_up_loc (location_t, tree, int);
4410 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4411 extern tree round_down_loc (location_t, tree, int);
4412 extern tree get_pending_sizes (void);
4413 extern void put_pending_size (tree);
4414 extern void put_pending_sizes (tree);
4415 extern void finalize_size_functions (void);
4417 /* Type for sizes of data-type. */
4419 #define BITS_PER_UNIT_LOG \
4420 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4421 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4422 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4424 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4425 extern unsigned int maximum_field_alignment;
4426 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4427 extern unsigned int initial_max_fld_align;
4429 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4430 by making the last node in X point to Y.
4431 Returns X, except if X is 0 returns Y. */
4433 extern tree chainon (tree, tree);
4435 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4437 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4438 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4440 /* Return the last tree node in a chain. */
4442 extern tree tree_last (tree);
4444 /* Reverse the order of elements in a chain, and return the new head. */
4446 extern tree nreverse (tree);
4448 /* Returns the length of a chain of nodes
4449 (number of chain pointers to follow before reaching a null pointer). */
4451 extern int list_length (const_tree);
4453 /* Returns the number of FIELD_DECLs in a type. */
4455 extern int fields_length (const_tree);
4457 /* Returns the first FIELD_DECL in a type. */
4459 extern tree first_field (const_tree);
4461 /* Given an initializer INIT, return TRUE if INIT is zero or some
4462 aggregate of zeros. Otherwise return FALSE. */
4464 extern bool initializer_zerop (const_tree);
4466 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4468 extern tree ctor_to_list (tree);
4470 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4472 extern VEC(tree,gc) *ctor_to_vec (tree);
4474 /* Examine CTOR to discover:
4475 * how many scalar fields are set to nonzero values,
4476 and place it in *P_NZ_ELTS;
4477 * how many scalar fields in total are in CTOR,
4478 and place it in *P_ELT_COUNT.
4479 * if a type is a union, and the initializer from the constructor
4480 is not the largest element in the union, then set *p_must_clear.
4482 Return whether or not CTOR is a valid static constant initializer, the same
4483 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4485 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4488 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4490 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4492 extern int integer_zerop (const_tree);
4494 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4496 extern int integer_onep (const_tree);
4498 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4499 all of whose significant bits are 1. */
4501 extern int integer_all_onesp (const_tree);
4503 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4504 exactly one bit 1. */
4506 extern int integer_pow2p (const_tree);
4508 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4509 with a nonzero value. */
4511 extern int integer_nonzerop (const_tree);
4513 extern bool cst_and_fits_in_hwi (const_tree);
4514 extern tree num_ending_zeros (const_tree);
4516 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4519 extern int fixed_zerop (const_tree);
4521 /* staticp (tree x) is nonzero if X is a reference to data allocated
4522 at a fixed address in memory. Returns the outermost data. */
4524 extern tree staticp (tree);
4526 /* save_expr (EXP) returns an expression equivalent to EXP
4527 but it can be used multiple times within context CTX
4528 and only evaluate EXP once. */
4530 extern tree save_expr (tree);
4532 /* Look inside EXPR and into any simple arithmetic operations. Return
4533 the innermost non-arithmetic node. */
4535 extern tree skip_simple_arithmetic (tree);
4537 /* Return which tree structure is used by T. */
4539 enum tree_node_structure_enum tree_node_structure (const_tree);
4541 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4542 or offset that depends on a field within a record.
4544 Note that we only allow such expressions within simple arithmetic
4547 extern bool contains_placeholder_p (const_tree);
4549 /* This macro calls the above function but short-circuits the common
4550 case of a constant to save time. Also check for null. */
4552 #define CONTAINS_PLACEHOLDER_P(EXP) \
4553 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4555 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4556 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4559 extern bool type_contains_placeholder_p (tree);
4561 /* Given a tree EXP, find all occurences of references to fields
4562 in a PLACEHOLDER_EXPR and place them in vector REFS without
4563 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4564 we assume here that EXP contains only arithmetic expressions
4565 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4568 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4570 /* This macro calls the above function but short-circuits the common
4571 case of a constant to save time and also checks for NULL. */
4573 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4575 if((EXP) && !TREE_CONSTANT (EXP)) \
4576 find_placeholder_in_expr (EXP, V); \
4579 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4580 return a tree with all occurrences of references to F in a
4581 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4582 CONST_DECLs. Note that we assume here that EXP contains only
4583 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4584 occurring only in their argument list. */
4586 extern tree substitute_in_expr (tree, tree, tree);
4588 /* This macro calls the above function but short-circuits the common
4589 case of a constant to save time and also checks for NULL. */
4591 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4592 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4594 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4595 for it within OBJ, a tree that is an object or a chain of references. */
4597 extern tree substitute_placeholder_in_expr (tree, tree);
4599 /* This macro calls the above function but short-circuits the common
4600 case of a constant to save time and also checks for NULL. */
4602 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4603 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4604 : substitute_placeholder_in_expr (EXP, OBJ))
4606 /* variable_size (EXP) is like save_expr (EXP) except that it
4607 is for the special case of something that is part of a
4608 variable size for a data type. It makes special arrangements
4609 to compute the value at the right time when the data type
4610 belongs to a function parameter. */
4612 extern tree variable_size (tree);
4614 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4615 but it can be used multiple times
4616 and only evaluate the subexpressions once. */
4618 extern tree stabilize_reference (tree);
4620 /* Subroutine of stabilize_reference; this is called for subtrees of
4621 references. Any expression with side-effects must be put in a SAVE_EXPR
4622 to ensure that it is only evaluated once. */
4624 extern tree stabilize_reference_1 (tree);
4626 /* Return EXP, stripped of any conversions to wider types
4627 in such a way that the result of converting to type FOR_TYPE
4628 is the same as if EXP were converted to FOR_TYPE.
4629 If FOR_TYPE is 0, it signifies EXP's type. */
4631 extern tree get_unwidened (tree, tree);
4633 /* Return OP or a simpler expression for a narrower value
4634 which can be sign-extended or zero-extended to give back OP.
4635 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4636 or 0 if the value should be sign-extended. */
4638 extern tree get_narrower (tree, int *);
4640 /* Return true if T is an expression that get_inner_reference handles. */
4643 handled_component_p (const_tree t)
4645 switch (TREE_CODE (t))
4650 case ARRAY_RANGE_REF:
4651 case VIEW_CONVERT_EXPR:
4661 /* Given an expression EXP that is a handled_component_p,
4662 look for the ultimate containing object, which is returned and specify
4663 the access position and size. */
4665 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4666 tree *, enum machine_mode *, int *, int *,
4669 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4670 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4671 EXP is marked as PACKED. */
4673 extern bool contains_packed_reference (const_tree exp);
4675 /* Return a tree of sizetype representing the size, in bytes, of the element
4676 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4678 extern tree array_ref_element_size (tree);
4680 /* Return a tree representing the lower bound of the array mentioned in
4681 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4683 extern tree array_ref_low_bound (tree);
4685 /* Return a tree representing the upper bound of the array mentioned in
4686 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4688 extern tree array_ref_up_bound (tree);
4690 /* Return a tree representing the offset, in bytes, of the field referenced
4691 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4693 extern tree component_ref_field_offset (tree);
4695 /* Given a DECL or TYPE, return the scope in which it was declared, or
4696 NUL_TREE if there is no containing scope. */
4698 extern tree get_containing_scope (const_tree);
4700 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4702 extern tree decl_function_context (const_tree);
4704 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4705 this _DECL with its context, or zero if none. */
4706 extern tree decl_type_context (const_tree);
4708 /* Return 1 if EXPR is the real constant zero. */
4709 extern int real_zerop (const_tree);
4711 /* Declare commonly used variables for tree structure. */
4713 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4714 Zero means allow extended lvalues. */
4716 extern int pedantic_lvalues;
4718 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4720 extern GTY(()) tree current_function_decl;
4722 /* Nonzero means a FUNC_BEGIN label was emitted. */
4723 extern GTY(()) const char * current_function_func_begin_label;
4725 /* Iterator for going through the function arguments. */
4727 tree fntype; /* function type declaration */
4728 tree next; /* TREE_LIST pointing to the next argument */
4729 } function_args_iterator;
4731 /* Initialize the iterator I with arguments from function FNDECL */
4734 function_args_iter_init (function_args_iterator *i, tree fntype)
4737 i->next = TYPE_ARG_TYPES (fntype);
4740 /* Return a pointer that holds the next argument if there are more arguments to
4741 handle, otherwise return NULL. */
4743 static inline tree *
4744 function_args_iter_cond_ptr (function_args_iterator *i)
4746 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4749 /* Return the next argument if there are more arguments to handle, otherwise
4753 function_args_iter_cond (function_args_iterator *i)
4755 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4758 /* Advance to the next argument. */
4760 function_args_iter_next (function_args_iterator *i)
4762 gcc_assert (i->next != NULL_TREE);
4763 i->next = TREE_CHAIN (i->next);
4766 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4769 inlined_function_outer_scope_p (const_tree block)
4771 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4774 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4775 to point to the next tree element. ITER is an instance of
4776 function_args_iterator used to iterate the arguments. */
4777 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4778 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4779 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4780 function_args_iter_next (&(ITER)))
4782 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4783 to the next tree element. ITER is an instance of function_args_iterator
4784 used to iterate the arguments. */
4785 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4786 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4787 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4788 function_args_iter_next (&(ITER)))
4793 extern unsigned crc32_string (unsigned, const char *);
4794 extern void clean_symbol_name (char *);
4795 extern tree get_file_function_name (const char *);
4796 extern tree get_callee_fndecl (const_tree);
4797 extern int type_num_arguments (const_tree);
4798 extern bool associative_tree_code (enum tree_code);
4799 extern bool commutative_tree_code (enum tree_code);
4800 extern tree upper_bound_in_type (tree, tree);
4801 extern tree lower_bound_in_type (tree, tree);
4802 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4803 extern tree call_expr_arg (tree, int);
4804 extern tree *call_expr_argp (tree, int);
4805 extern tree call_expr_arglist (tree);
4806 extern tree create_artificial_label (location_t);
4807 extern const char *get_name (tree);
4808 extern bool stdarg_p (tree);
4809 extern bool prototype_p (tree);
4810 extern bool auto_var_in_fn_p (const_tree, const_tree);
4811 extern tree build_low_bits_mask (tree, unsigned);
4812 extern tree tree_strip_nop_conversions (tree);
4813 extern tree tree_strip_sign_nop_conversions (tree);
4814 extern tree lhd_gcc_personality (void);
4815 extern void assign_assembler_name_if_neeeded (tree);
4819 extern void change_decl_assembler_name (tree, tree);
4822 extern tree unshare_expr (tree);
4826 extern void expand_expr_stmt (tree);
4827 extern int warn_if_unused_value (const_tree, location_t);
4828 extern void expand_label (tree);
4829 extern void expand_goto (tree);
4831 extern rtx expand_stack_save (void);
4832 extern void expand_stack_restore (tree);
4833 extern void expand_return (tree);
4836 extern void using_eh_for_cleanups (void);
4838 /* In fold-const.c */
4840 /* Non-zero if we are folding constants inside an initializer; zero
4842 extern int folding_initializer;
4844 /* Convert between trees and native memory representation. */
4845 extern int native_encode_expr (const_tree, unsigned char *, int);
4846 extern tree native_interpret_expr (tree, const unsigned char *, int);
4848 /* Fold constants as much as possible in an expression.
4849 Returns the simplified expression.
4850 Acts only on the top level of the expression;
4851 if the argument itself cannot be simplified, its
4852 subexpressions are not changed. */
4854 extern tree fold (tree);
4855 #define fold_unary(CODE,T1,T2)\
4856 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4857 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4858 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4859 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4860 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4861 #define fold_binary(CODE,T1,T2,T3)\
4862 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4863 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4864 #define fold_ternary(CODE,T1,T2,T3,T4)\
4865 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4866 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4867 #define fold_build1(c,t1,t2)\
4868 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4869 #define fold_build1_loc(l,c,t1,t2)\
4870 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4871 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4872 tree MEM_STAT_DECL);
4873 #define fold_build2(c,t1,t2,t3)\
4874 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4875 #define fold_build2_loc(l,c,t1,t2,t3)\
4876 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4877 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4878 tree MEM_STAT_DECL);
4879 #define fold_build3(c,t1,t2,t3,t4)\
4880 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4881 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4882 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4883 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4884 tree MEM_STAT_DECL);
4885 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4886 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4887 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4888 #define fold_build_call_array(T1,T2,N,T4)\
4889 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4890 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4891 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4892 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4893 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4894 extern bool fold_convertible_p (const_tree, const_tree);
4895 #define fold_convert(T1,T2)\
4896 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4897 extern tree fold_convert_loc (location_t, tree, tree);
4898 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4899 extern tree fold_ignored_result (tree);
4900 extern tree fold_abs_const (tree, tree);
4901 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4902 extern void fold_defer_overflow_warnings (void);
4903 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4904 extern void fold_undefer_and_ignore_overflow_warnings (void);
4905 extern bool fold_deferring_overflow_warnings_p (void);
4907 enum operand_equal_flag
4913 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4914 extern int multiple_of_p (tree, const_tree, const_tree);
4915 #define omit_one_operand(T1,T2,T3)\
4916 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4917 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4918 #define omit_two_operands(T1,T2,T3,T4)\
4919 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4920 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4921 #define invert_truthvalue(T)\
4922 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4923 extern tree invert_truthvalue_loc (location_t, tree);
4924 extern tree fold_truth_not_expr (location_t, tree);
4925 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4926 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4927 extern tree fold_read_from_constant_string (tree);
4928 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4929 #define build_fold_addr_expr(T)\
4930 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4931 extern tree build_fold_addr_expr_loc (location_t, tree);
4932 #define build_fold_addr_expr_with_type(T,TYPE)\
4933 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4934 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4935 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4936 extern tree fold_strip_sign_ops (tree);
4937 #define build_fold_indirect_ref(T)\
4938 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4939 extern tree build_fold_indirect_ref_loc (location_t, tree);
4940 #define fold_indirect_ref(T)\
4941 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4942 extern tree fold_indirect_ref_loc (location_t, tree);
4943 extern tree constant_boolean_node (int, tree);
4944 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
4946 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4947 extern enum tree_code swap_tree_comparison (enum tree_code);
4949 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4950 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4952 extern bool tree_expr_nonzero_p (tree);
4953 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4954 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4956 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4957 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4958 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4960 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4961 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4962 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
4964 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4966 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4967 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
4968 enum tree_code, tree, tree, tree);
4969 extern void debug_fold_checksum (const_tree);
4971 /* Return nonzero if CODE is a tree code that represents a truth value. */
4973 truth_value_p (enum tree_code code)
4975 return (TREE_CODE_CLASS (code) == tcc_comparison
4976 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4977 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4978 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4983 extern tree fold_call_expr (location_t, tree, bool);
4984 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4985 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4986 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4987 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4988 enum built_in_function);
4989 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4990 enum built_in_function);
4991 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
4992 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
4993 extern bool fold_builtin_next_arg (tree, bool);
4994 extern enum built_in_function builtin_mathfn_code (const_tree);
4995 extern tree build_function_call_expr (location_t, tree, tree);
4996 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4997 #define build_call_expr(...)\
4998 build_call_expr_loc (UNKNOWN_LOCATION, __VA_ARGS__)
4999 extern tree build_call_expr_loc (location_t, tree, int, ...);
5000 extern tree mathfn_built_in (tree, enum built_in_function fn);
5001 extern tree c_strlen (tree, int);
5002 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
5003 extern tree build_va_arg_indirect_ref (tree);
5004 extern tree build_string_literal (int, const char *);
5005 extern bool validate_arglist (const_tree, ...);
5006 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
5007 extern bool can_trust_pointer_alignment (void);
5008 extern int get_pointer_alignment (tree, unsigned int);
5009 extern bool is_builtin_name (const char *);
5010 extern bool is_builtin_fn (tree);
5011 extern int get_object_alignment (tree, unsigned int, unsigned int);
5012 extern tree fold_call_stmt (gimple, bool);
5013 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
5014 extern tree make_range (tree, int *, tree *, tree *, bool *);
5015 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
5016 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
5018 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
5021 extern tree strip_float_extensions (tree);
5024 extern int really_constant_p (const_tree);
5025 extern bool decl_address_invariant_p (const_tree);
5026 extern bool decl_address_ip_invariant_p (const_tree);
5027 extern int int_fits_type_p (const_tree, const_tree);
5028 #ifndef GENERATOR_FILE
5029 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5031 extern bool variably_modified_type_p (tree, tree);
5032 extern int tree_log2 (const_tree);
5033 extern int tree_floor_log2 (const_tree);
5034 extern int simple_cst_equal (const_tree, const_tree);
5035 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
5036 extern hashval_t iterative_hash_exprs_commutative (const_tree,
5037 const_tree, hashval_t);
5038 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5039 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
5040 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5041 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5042 extern int type_list_equal (const_tree, const_tree);
5043 extern int chain_member (const_tree, const_tree);
5044 extern tree type_hash_lookup (unsigned int, tree);
5045 extern void type_hash_add (unsigned int, tree);
5046 extern int simple_cst_list_equal (const_tree, const_tree);
5047 extern void dump_tree_statistics (void);
5048 extern void recompute_tree_invariant_for_addr_expr (tree);
5049 extern bool needs_to_live_in_memory (const_tree);
5050 extern tree reconstruct_complex_type (tree, tree);
5052 extern int real_onep (const_tree);
5053 extern int real_twop (const_tree);
5054 extern int real_minus_onep (const_tree);
5055 extern void init_ttree (void);
5056 extern void build_common_tree_nodes (bool);
5057 extern void build_common_tree_nodes_2 (int);
5058 extern void build_common_builtin_nodes (void);
5059 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5060 extern tree build_range_type (tree, tree, tree);
5061 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5062 extern HOST_WIDE_INT int_cst_value (const_tree);
5063 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
5065 extern bool fields_compatible_p (const_tree, const_tree);
5066 extern tree find_compatible_field (tree, tree);
5068 extern tree *tree_block (tree);
5069 extern location_t *block_nonartificial_location (tree);
5070 extern location_t tree_nonartificial_location (tree);
5072 extern tree block_ultimate_origin (const_tree);
5074 /* In tree-nested.c */
5075 extern tree build_addr (tree, tree);
5078 extern void expand_main_function (void);
5079 extern void expand_function_end (void);
5080 extern void expand_function_start (tree);
5081 extern void stack_protect_prologue (void);
5082 extern void stack_protect_epilogue (void);
5083 extern void init_dummy_function_start (void);
5084 extern void expand_dummy_function_end (void);
5085 extern unsigned int init_function_for_compilation (void);
5086 extern void allocate_struct_function (tree, bool);
5087 extern void push_struct_function (tree fndecl);
5088 extern void init_function_start (tree);
5089 extern bool use_register_for_decl (const_tree);
5090 extern void generate_setjmp_warnings (void);
5091 extern void init_temp_slots (void);
5092 extern void free_temp_slots (void);
5093 extern void pop_temp_slots (void);
5094 extern void push_temp_slots (void);
5095 extern void preserve_temp_slots (rtx);
5096 extern int aggregate_value_p (const_tree, const_tree);
5097 extern void push_function_context (void);
5098 extern void pop_function_context (void);
5099 extern gimple_seq gimplify_parameters (void);
5101 /* In print-rtl.c */
5103 extern void print_rtl (FILE *, const_rtx);
5106 /* In print-tree.c */
5107 extern void debug_tree (tree);
5109 extern void dump_addr (FILE*, const char *, const void *);
5110 extern void print_node (FILE *, const char *, tree, int);
5111 extern void print_node_brief (FILE *, const char *, const_tree, int);
5112 extern void indent_to (FILE *, int);
5115 /* In tree-inline.c: */
5116 extern bool debug_find_tree (tree, tree);
5117 /* This is in tree-inline.c since the routine uses
5118 data structures from the inliner. */
5119 extern tree unsave_expr_now (tree);
5120 extern tree build_duplicate_type (tree);
5124 /* Nonzero if this is a call to a function whose return value depends
5125 solely on its arguments, has no side effects, and does not read
5126 global memory. This corresponds to TREE_READONLY for function
5128 #define ECF_CONST (1 << 0)
5129 /* Nonzero if this is a call to "pure" function (like const function,
5130 but may read memory. This corresponds to DECL_PURE_P for function
5132 #define ECF_PURE (1 << 1)
5133 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5134 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5135 for function decls.*/
5136 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5137 /* Nonzero if this call will never return. */
5138 #define ECF_NORETURN (1 << 3)
5139 /* Nonzero if this is a call to malloc or a related function. */
5140 #define ECF_MALLOC (1 << 4)
5141 /* Nonzero if it is plausible that this is a call to alloca. */
5142 #define ECF_MAY_BE_ALLOCA (1 << 5)
5143 /* Nonzero if this is a call to a function that won't throw an exception. */
5144 #define ECF_NOTHROW (1 << 6)
5145 /* Nonzero if this is a call to setjmp or a related function. */
5146 #define ECF_RETURNS_TWICE (1 << 7)
5147 /* Nonzero if this call replaces the current stack frame. */
5148 #define ECF_SIBCALL (1 << 8)
5149 /* Function does not read or write memory (but may have side effects, so
5150 it does not necessarily fit ECF_CONST). */
5151 #define ECF_NOVOPS (1 << 9)
5153 extern int flags_from_decl_or_type (const_tree);
5154 extern int call_expr_flags (const_tree);
5156 extern int setjmp_call_p (const_tree);
5157 extern bool gimple_alloca_call_p (const_gimple);
5158 extern bool alloca_call_p (const_tree);
5159 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5160 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5164 extern const struct attribute_spec *lookup_attribute_spec (tree);
5166 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5167 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5168 it should be modified in place; if a TYPE, a copy should be created
5169 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5170 information, in the form of a bitwise OR of flags in enum attribute_flags
5171 from tree.h. Depending on these flags, some attributes may be
5172 returned to be applied at a later stage (for example, to apply
5173 a decl attribute to the declaration rather than to its type). */
5174 extern tree decl_attributes (tree *, tree, int);
5176 /* In integrate.c */
5177 extern void set_decl_abstract_flags (tree, int);
5178 extern void set_decl_origin_self (tree);
5180 /* In stor-layout.c */
5181 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5182 extern void fixup_signed_type (tree);
5183 extern void internal_reference_types (void);
5184 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5187 extern void make_decl_rtl (tree);
5188 extern rtx make_decl_rtl_for_debug (tree);
5189 extern void make_decl_one_only (tree, tree);
5190 extern int supports_one_only (void);
5191 extern void resolve_unique_section (tree, int, int);
5192 extern void mark_referenced (tree);
5193 extern void mark_decl_referenced (tree);
5194 extern void notice_global_symbol (tree);
5195 extern void set_user_assembler_name (tree, const char *);
5196 extern void process_pending_assemble_externals (void);
5197 extern void finish_aliases_1 (void);
5198 extern void finish_aliases_2 (void);
5199 extern tree emutls_decl (tree);
5200 extern void remove_unreachable_alias_pairs (void);
5203 extern void expand_computed_goto (tree);
5204 extern bool parse_output_constraint (const char **, int, int, int,
5205 bool *, bool *, bool *);
5206 extern bool parse_input_constraint (const char **, int, int, int, int,
5207 const char * const *, bool *, bool *);
5208 extern void expand_asm_stmt (gimple);
5209 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5210 extern void expand_case (gimple);
5211 extern void expand_decl (tree);
5213 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5214 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5218 /* In dwarf2out.c */
5219 /* Interface of the DWARF2 unwind info support. */
5221 /* Generate a new label for the CFI info to refer to. */
5223 extern char *dwarf2out_cfi_label (bool);
5225 /* Entry point to update the canonical frame address (CFA). */
5227 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5229 /* Add the CFI for saving a register window. */
5231 extern void dwarf2out_window_save (const char *);
5233 /* Entry point for saving a register to the stack. */
5235 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5237 /* Entry point for saving the return address in the stack. */
5239 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5241 /* Entry point for saving the return address in a register. */
5243 extern void dwarf2out_return_reg (const char *, unsigned);
5245 /* Entry point for saving the first register into the second. */
5247 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5249 /* In tree-inline.c */
5251 /* The type of a set of already-visited pointers. Functions for creating
5252 and manipulating it are declared in pointer-set.h */
5253 struct pointer_set_t;
5255 /* The type of a callback function for walking over tree structure. */
5257 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5259 /* The type of a callback function that represents a custom walk_tree. */
5261 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5262 void *, struct pointer_set_t*);
5264 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5266 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5268 #define walk_tree(a,b,c,d) \
5269 walk_tree_1 (a, b, c, d, NULL)
5270 #define walk_tree_without_duplicates(a,b,c) \
5271 walk_tree_without_duplicates_1 (a, b, c, NULL)
5274 /* Assign the RTX to declaration. */
5276 extern void set_decl_rtl (tree, rtx);
5277 extern void set_decl_incoming_rtl (tree, rtx, bool);
5279 /* Enum and arrays used for tree allocation stats.
5280 Keep in sync with tree.c:tree_node_kind_names. */
5304 extern int tree_node_counts[];
5305 extern int tree_node_sizes[];
5307 /* True if we are in gimple form and the actions of the folders need to
5308 be restricted. False if we are not in gimple form and folding is not
5309 restricted to creating gimple expressions. */
5310 extern bool in_gimple_form;
5313 extern tree get_base_address (tree t);
5314 extern void mark_addressable (tree);
5316 /* In tree-vectorizer.c. */
5317 extern void vect_set_verbosity_level (const char *);
5321 struct GTY(()) tree_map_base {
5325 extern int tree_map_base_eq (const void *, const void *);
5326 extern unsigned int tree_map_base_hash (const void *);
5327 extern int tree_map_base_marked_p (const void *);
5328 extern bool list_equal_p (const_tree, const_tree);
5330 /* Map from a tree to another tree. */
5332 struct GTY(()) tree_map {
5333 struct tree_map_base base;
5338 #define tree_map_eq tree_map_base_eq
5339 extern unsigned int tree_map_hash (const void *);
5340 #define tree_map_marked_p tree_map_base_marked_p
5342 /* Map from a tree to an int. */
5344 struct GTY(()) tree_int_map {
5345 struct tree_map_base base;
5349 #define tree_int_map_eq tree_map_base_eq
5350 #define tree_int_map_hash tree_map_base_hash
5351 #define tree_int_map_marked_p tree_map_base_marked_p
5353 /* Map from a tree to initialization/finalization priorities. */
5355 struct GTY(()) tree_priority_map {
5356 struct tree_map_base base;
5361 #define tree_priority_map_eq tree_map_base_eq
5362 #define tree_priority_map_hash tree_map_base_hash
5363 #define tree_priority_map_marked_p tree_map_base_marked_p
5367 tree target_for_debug_bind (tree);
5369 /* In tree-ssa-address.c. */
5370 extern tree tree_mem_ref_addr (tree, tree);
5371 extern void copy_mem_ref_info (tree, tree);
5374 extern bool ssa_name_nonnegative_p (const_tree);
5376 /* In tree-object-size.c. */
5377 extern void init_object_sizes (void);
5378 extern void fini_object_sizes (void);
5379 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5382 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5383 extern tree build_personality_function (const char *);
5385 /* In tree-inline.c. */
5387 void init_inline_once (void);
5389 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5390 extern GTY(()) tree memory_identifier_string;
5392 /* Compute the number of operands in an expression node NODE. For
5393 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5394 otherwise it is looked up from the node's code. */
5396 tree_operand_length (const_tree node)
5398 if (VL_EXP_CLASS_P (node))
5399 return VL_EXP_OPERAND_LENGTH (node);
5401 return TREE_CODE_LENGTH (TREE_CODE (node));
5404 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5405 have to go towards the end of tree.h so that union tree_node is fully
5406 defined by this point. */
5408 /* Structure containing iterator state. */
5409 typedef struct GTY (()) call_expr_arg_iterator_d {
5410 tree t; /* the call_expr */
5411 int n; /* argument count */
5412 int i; /* next argument index */
5413 } call_expr_arg_iterator;
5415 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5416 const_tree t; /* the call_expr */
5417 int n; /* argument count */
5418 int i; /* next argument index */
5419 } const_call_expr_arg_iterator;
5421 /* Initialize the abstract argument list iterator object ITER with the
5422 arguments from CALL_EXPR node EXP. */
5424 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5427 iter->n = call_expr_nargs (exp);
5432 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5435 iter->n = call_expr_nargs (exp);
5439 /* Return the next argument from abstract argument list iterator object ITER,
5440 and advance its state. Return NULL_TREE if there are no more arguments. */
5442 next_call_expr_arg (call_expr_arg_iterator *iter)
5445 if (iter->i >= iter->n)
5447 result = CALL_EXPR_ARG (iter->t, iter->i);
5452 static inline const_tree
5453 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5456 if (iter->i >= iter->n)
5458 result = CALL_EXPR_ARG (iter->t, iter->i);
5463 /* Initialize the abstract argument list iterator object ITER, then advance
5464 past and return the first argument. Useful in for expressions, e.g.
5465 for (arg = first_call_expr_arg (exp, &iter); arg;
5466 arg = next_call_expr_arg (&iter)) */
5468 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5470 init_call_expr_arg_iterator (exp, iter);
5471 return next_call_expr_arg (iter);
5474 static inline const_tree
5475 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5477 init_const_call_expr_arg_iterator (exp, iter);
5478 return next_const_call_expr_arg (iter);
5481 /* Test whether there are more arguments in abstract argument list iterator
5482 ITER, without changing its state. */
5484 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5486 return (iter->i < iter->n);
5490 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5492 return (iter->i < iter->n);
5495 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5496 (of type call_expr_arg_iterator) to hold the iteration state. */
5497 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5498 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5499 (arg) = next_call_expr_arg (&(iter)))
5501 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5502 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5503 (arg) = next_const_call_expr_arg (&(iter)))
5505 /* Return true if tree node T is a language-specific node. */
5507 is_lang_specific (tree t)
5509 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5512 #endif /* GCC_TREE_H */