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"
31 #include "double-int.h"
33 #include "fixed-value.h"
37 /* Codes of tree nodes */
39 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
40 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
43 #include "all-tree.def"
48 #undef END_OF_BASE_TREE_CODES
50 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
51 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
53 /* Number of language-independent tree codes. */
54 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
56 /* Tree code classes. */
58 /* Each tree_code has an associated code class represented by a
61 enum tree_code_class {
62 tcc_exceptional, /* An exceptional code (fits no category). */
63 tcc_constant, /* A constant. */
64 /* Order of tcc_type and tcc_declaration is important. */
65 tcc_type, /* A type object code. */
66 tcc_declaration, /* A declaration (also serving as variable refs). */
67 tcc_reference, /* A reference to storage. */
68 tcc_comparison, /* A comparison expression. */
69 tcc_unary, /* A unary arithmetic expression. */
70 tcc_binary, /* A binary arithmetic expression. */
71 tcc_statement, /* A statement expression, which have side effects
72 but usually no interesting value. */
73 tcc_vl_exp, /* A function call or other expression with a
74 variable-length operand vector. */
75 tcc_expression /* Any other expression. */
78 /* Each tree code class has an associated string representation.
79 These must correspond to the tree_code_class entries. */
81 extern const char *const tree_code_class_strings[];
83 /* Returns the string representing CLASS. */
85 #define TREE_CODE_CLASS_STRING(CLASS)\
86 tree_code_class_strings[(int) (CLASS)]
88 extern const enum tree_code_class tree_code_type[];
89 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
91 /* Nonzero if CODE represents an exceptional code. */
93 #define EXCEPTIONAL_CLASS_P(CODE)\
94 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
96 /* Nonzero if CODE represents a constant. */
98 #define CONSTANT_CLASS_P(CODE)\
99 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
101 /* Nonzero if CODE represents a type. */
103 #define TYPE_P(CODE)\
104 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
106 /* Nonzero if CODE represents a declaration. */
108 #define DECL_P(CODE)\
109 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
111 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
113 #define VAR_OR_FUNCTION_DECL_P(DECL)\
114 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
116 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
117 ascending code order. */
119 #define INDIRECT_REF_P(CODE)\
120 (TREE_CODE (CODE) == INDIRECT_REF \
121 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
123 /* Nonzero if CODE represents a reference. */
125 #define REFERENCE_CLASS_P(CODE)\
126 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
128 /* Nonzero if CODE represents a comparison. */
130 #define COMPARISON_CLASS_P(CODE)\
131 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
133 /* Nonzero if CODE represents a unary arithmetic expression. */
135 #define UNARY_CLASS_P(CODE)\
136 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
138 /* Nonzero if CODE represents a binary arithmetic expression. */
140 #define BINARY_CLASS_P(CODE)\
141 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
143 /* Nonzero if CODE represents a statement expression. */
145 #define STATEMENT_CLASS_P(CODE)\
146 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
148 /* Nonzero if CODE represents a function call-like expression with a
149 variable-length operand vector. */
151 #define VL_EXP_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
154 /* Nonzero if CODE represents any other expression. */
156 #define EXPRESSION_CLASS_P(CODE)\
157 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
159 /* Returns nonzero iff CODE represents a type or declaration. */
161 #define IS_TYPE_OR_DECL_P(CODE)\
162 (TYPE_P (CODE) || DECL_P (CODE))
164 /* Returns nonzero iff CLASS is the tree-code class of an
167 #define IS_EXPR_CODE_CLASS(CLASS)\
168 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
170 /* Returns nonzero iff NODE is an expression of some kind. */
172 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
174 /* Number of argument-words in each kind of tree-node. */
176 extern const unsigned char tree_code_length[];
177 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
179 /* Names of tree components. */
181 extern const char *const tree_code_name[];
183 /* We have to be able to tell cgraph about the needed-ness of the target
184 of an alias. This requires that the decl have been defined. Aliases
185 that precede their definition have to be queued for later processing. */
187 /* The deferred processing proceeds in several passes. We memorize the
188 diagnostics emitted for a pair to prevent repeating messages when the
189 queue gets re-scanned after possible updates. */
192 ALIAS_DIAG_NONE = 0x0,
193 ALIAS_DIAG_TO_UNDEF = 0x1,
194 ALIAS_DIAG_TO_EXTERN = 0x2
197 typedef struct GTY(()) alias_pair
201 int emitted_diags; /* alias_diags already emitted for this pair. */
204 /* Define gc'd vector type. */
205 DEF_VEC_O(alias_pair);
206 DEF_VEC_ALLOC_O(alias_pair,gc);
208 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
211 /* Classify which part of the compiler has defined a given builtin function.
212 Note that we assume below that this is no more than two bits. */
221 /* Names for the above. */
222 extern const char *const built_in_class_names[4];
224 /* Codes that identify the various built in functions
225 so that expand_call can identify them quickly. */
227 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
228 enum built_in_function
230 #include "builtins.def"
232 /* Complex division routines in libgcc. These are done via builtins
233 because emit_library_call_value can't handle complex values. */
234 BUILT_IN_COMPLEX_MUL_MIN,
235 BUILT_IN_COMPLEX_MUL_MAX
236 = BUILT_IN_COMPLEX_MUL_MIN
237 + MAX_MODE_COMPLEX_FLOAT
238 - MIN_MODE_COMPLEX_FLOAT,
240 BUILT_IN_COMPLEX_DIV_MIN,
241 BUILT_IN_COMPLEX_DIV_MAX
242 = BUILT_IN_COMPLEX_DIV_MIN
243 + MAX_MODE_COMPLEX_FLOAT
244 - MIN_MODE_COMPLEX_FLOAT,
246 /* Upper bound on non-language-specific builtins. */
251 /* Names for the above. */
252 extern const char * built_in_names[(int) END_BUILTINS];
254 /* Helper macros for math builtins. */
256 #define BUILTIN_EXP10_P(FN) \
257 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
258 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
260 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
261 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
262 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
264 #define BUILTIN_SQRT_P(FN) \
265 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
267 #define BUILTIN_CBRT_P(FN) \
268 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
270 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
272 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
273 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
274 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
276 /* An array of _DECL trees for the above. */
277 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
278 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
280 /* In an OMP_CLAUSE node. */
282 /* Number of operands and names for each clause. */
283 extern unsigned const char omp_clause_num_ops[];
284 extern const char * const omp_clause_code_name[];
286 /* Clause codes. Do not reorder, as this is used to index into the tables
287 omp_clause_num_ops and omp_clause_code_name. */
290 /* Clause zero is special-cased inside the parser
291 (c_parser_omp_variable_list). */
292 OMP_CLAUSE_ERROR = 0,
294 /* OpenMP clause: private (variable_list). */
297 /* OpenMP clause: shared (variable_list). */
300 /* OpenMP clause: firstprivate (variable_list). */
301 OMP_CLAUSE_FIRSTPRIVATE,
303 /* OpenMP clause: lastprivate (variable_list). */
304 OMP_CLAUSE_LASTPRIVATE,
306 /* OpenMP clause: reduction (operator:variable_list).
307 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
308 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
309 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
311 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
312 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
313 OMP_CLAUSE_REDUCTION,
315 /* OpenMP clause: copyin (variable_list). */
318 /* OpenMP clause: copyprivate (variable_list). */
319 OMP_CLAUSE_COPYPRIVATE,
321 /* OpenMP clause: if (scalar-expression). */
324 /* OpenMP clause: num_threads (integer-expression). */
325 OMP_CLAUSE_NUM_THREADS,
327 /* OpenMP clause: schedule. */
330 /* OpenMP clause: nowait. */
333 /* OpenMP clause: ordered. */
336 /* OpenMP clause: default. */
339 /* OpenMP clause: collapse (constant-integer-expression). */
342 /* OpenMP clause: untied. */
346 /* The definition of tree nodes fills the next several pages. */
348 /* A tree node can represent a data type, a variable, an expression
349 or a statement. Each node has a TREE_CODE which says what kind of
350 thing it represents. Some common codes are:
351 INTEGER_TYPE -- represents a type of integers.
352 ARRAY_TYPE -- represents a type of pointer.
353 VAR_DECL -- represents a declared variable.
354 INTEGER_CST -- represents a constant integer value.
355 PLUS_EXPR -- represents a sum (an expression).
357 As for the contents of a tree node: there are some fields
358 that all nodes share. Each TREE_CODE has various special-purpose
359 fields as well. The fields of a node are never accessed directly,
360 always through accessor macros. */
362 /* Every kind of tree node starts with this structure,
363 so all nodes have these fields.
365 See the accessor macros, defined below, for documentation of the
368 struct GTY(()) tree_base {
369 ENUM_BITFIELD(tree_code) code : 16;
371 unsigned side_effects_flag : 1;
372 unsigned constant_flag : 1;
373 unsigned addressable_flag : 1;
374 unsigned volatile_flag : 1;
375 unsigned readonly_flag : 1;
376 unsigned unsigned_flag : 1;
377 unsigned asm_written_flag: 1;
378 unsigned nowarning_flag : 1;
380 unsigned used_flag : 1;
381 unsigned nothrow_flag : 1;
382 unsigned static_flag : 1;
383 unsigned public_flag : 1;
384 unsigned private_flag : 1;
385 unsigned protected_flag : 1;
386 unsigned deprecated_flag : 1;
387 unsigned saturating_flag : 1;
389 unsigned default_def_flag : 1;
390 unsigned lang_flag_0 : 1;
391 unsigned lang_flag_1 : 1;
392 unsigned lang_flag_2 : 1;
393 unsigned lang_flag_3 : 1;
394 unsigned lang_flag_4 : 1;
395 unsigned lang_flag_5 : 1;
396 unsigned lang_flag_6 : 1;
398 unsigned visited : 1;
399 unsigned packed_flag : 1;
400 unsigned user_align : 1;
401 unsigned nameless_flag : 1;
405 /* This field is only used with type nodes; the only reason it is present
406 in tree_base instead of tree_type is to save space. The size of the
407 field must be large enough to hold addr_space_t values. */
408 unsigned address_space : 8;
411 struct GTY(()) tree_common {
412 struct tree_base base;
417 /* The following table lists the uses of each of the above flags and
418 for which types of nodes they are defined.
423 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
425 CONSTRUCTOR, IDENTIFIER_NODE
426 STMT_EXPR, it means we want the result of the enclosed expression
428 CALL_EXPR_TAILCALL in
437 VAR_DECL, FUNCTION_DECL
440 TREE_NO_TRAMPOLINE in
446 TREE_SYMBOL_REFERENCED in
450 TARGET_EXPR, WITH_CLEANUP_EXPR
452 TRY_CATCH_IS_CLEANUP in
458 TYPE_REF_CAN_ALIAS_ALL in
459 POINTER_TYPE, REFERENCE_TYPE
467 CALL_CANNOT_INLINE_P in
476 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
479 VAR_DECL, FUNCTION_DECL
485 CALL_EXPR_VA_ARG_PACK in
488 TYPE_CACHED_VALUES_P in
491 SAVE_EXPR_RESOLVED_P in
494 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
495 OMP_CLAUSE_LASTPRIVATE
497 OMP_CLAUSE_PRIVATE_DEBUG in
505 CALL_EXPR_RETURN_SLOT_OPT in
511 OMP_PARALLEL_COMBINED in
513 OMP_CLAUSE_PRIVATE_OUTER_REF in
516 TYPE_REF_IS_RVALUE in
525 CALL_FROM_THUNK_P and
541 TREE_THIS_VOLATILE in
564 TYPE_SIZES_GIMPLIFIED in
575 REGISTER_DEFS_IN_THIS_STMT in
576 all expressions (tree-into-ssa.c)
581 VAR_DECL, FUNCTION_DECL
582 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
583 BLOCK, SSA_NAME, STRING_CST
586 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
605 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
613 IDENTIFIER_TRANSPARENT_ALIAS in
616 STMT_IN_SSA_EDGE_WORKLIST in
617 all expressions (tree-ssa-propagate.c)
622 all trees (used liberally by many passes)
637 TYPE_VECTOR_OPAQUE in
640 SSA_NAME_IS_DEFAULT_DEF in
645 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
646 enum tree_node_structure_enum {
647 #include "treestruct.def"
652 /* Define accessors for the fields that all tree nodes have
653 (though some fields are not used for all kinds of nodes). */
655 /* The tree-code says what kind of node it is.
656 Codes are defined in tree.def. */
657 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
658 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
660 /* When checking is enabled, errors will be generated if a tree node
661 is accessed incorrectly. The macros die with a fatal error. */
662 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
664 #define TREE_CHECK(T, CODE) __extension__ \
665 ({ __typeof (T) const __t = (T); \
666 if (TREE_CODE (__t) != (CODE)) \
667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
671 #define TREE_NOT_CHECK(T, CODE) __extension__ \
672 ({ __typeof (T) const __t = (T); \
673 if (TREE_CODE (__t) == (CODE)) \
674 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
678 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) != (CODE1) \
681 && TREE_CODE (__t) != (CODE2)) \
682 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
683 (CODE1), (CODE2), 0); \
686 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
687 ({ __typeof (T) const __t = (T); \
688 if (TREE_CODE (__t) == (CODE1) \
689 || TREE_CODE (__t) == (CODE2)) \
690 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
691 (CODE1), (CODE2), 0); \
694 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
695 ({ __typeof (T) const __t = (T); \
696 if (TREE_CODE (__t) != (CODE1) \
697 && TREE_CODE (__t) != (CODE2) \
698 && TREE_CODE (__t) != (CODE3)) \
699 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
700 (CODE1), (CODE2), (CODE3), 0); \
703 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
704 ({ __typeof (T) const __t = (T); \
705 if (TREE_CODE (__t) == (CODE1) \
706 || TREE_CODE (__t) == (CODE2) \
707 || TREE_CODE (__t) == (CODE3)) \
708 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
709 (CODE1), (CODE2), (CODE3), 0); \
712 #define 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_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
722 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __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_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
729 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
732 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
733 ({ __typeof (T) const __t = (T); \
734 if (TREE_CODE (__t) != (CODE1) \
735 && TREE_CODE (__t) != (CODE2) \
736 && TREE_CODE (__t) != (CODE3) \
737 && TREE_CODE (__t) != (CODE4) \
738 && TREE_CODE (__t) != (CODE5)) \
739 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
740 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
743 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 if (TREE_CODE (__t) == (CODE1) \
746 || TREE_CODE (__t) == (CODE2) \
747 || TREE_CODE (__t) == (CODE3) \
748 || TREE_CODE (__t) == (CODE4) \
749 || TREE_CODE (__t) == (CODE5)) \
750 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
751 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
754 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
755 ({ __typeof (T) const __t = (T); \
756 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
757 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
761 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
762 ({ __typeof (T) const __t = (T); \
763 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
764 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
768 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
769 ({ __typeof (T) const __t = (T); \
770 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
771 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
775 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
776 ({ __typeof (T) const __t = (T); \
777 if (TREE_CODE (__t) != OMP_CLAUSE) \
778 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
780 if (__t->omp_clause.code != (CODE)) \
781 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
786 ({ __typeof (T) const __t = (T); \
787 if (TREE_CODE (__t) != OMP_CLAUSE) \
788 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
790 if ((int) __t->omp_clause.code < (int) (CODE1) \
791 || (int) __t->omp_clause.code > (int) (CODE2)) \
792 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
793 __FUNCTION__, (CODE1), (CODE2)); \
796 /* These checks have to be special cased. */
797 #define EXPR_CHECK(T) __extension__ \
798 ({ __typeof (T) const __t = (T); \
799 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
800 if (!IS_EXPR_CODE_CLASS (__c)) \
801 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
805 /* These checks have to be special cased. */
806 #define NON_TYPE_CHECK(T) __extension__ \
807 ({ __typeof (T) const __t = (T); \
809 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
813 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
814 (*({__typeof (T) const __t = (T); \
815 const int __i = (I); \
816 if (TREE_CODE (__t) != TREE_VEC) \
817 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
819 if (__i < 0 || __i >= __t->vec.length) \
820 tree_vec_elt_check_failed (__i, __t->vec.length, \
821 __FILE__, __LINE__, __FUNCTION__); \
822 &__t->vec.a[__i]; }))
824 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
825 (*({__typeof (T) const __t = (T); \
826 const int __i = (I); \
827 if (TREE_CODE (__t) != OMP_CLAUSE) \
828 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
830 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
831 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
833 &__t->omp_clause.ops[__i]; }))
835 /* Special checks for TREE_OPERANDs. */
836 #define TREE_OPERAND_CHECK(T, I) __extension__ \
837 (*({__typeof (T) const __t = EXPR_CHECK (T); \
838 const int __i = (I); \
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_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
845 (*({__typeof (T) const __t = (T); \
846 const int __i = (I); \
847 if (TREE_CODE (__t) != CODE) \
848 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
849 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
850 tree_operand_check_failed (__i, __t, \
851 __FILE__, __LINE__, __FUNCTION__); \
852 &__t->exp.operands[__i]; }))
854 /* Nodes are chained together for many purposes.
855 Types are chained together to record them for being output to the debugger
856 (see the function `chain_type').
857 Decls in the same scope are chained together to record the contents
859 Statement nodes for successive statements used to be chained together.
860 Often lists of things are represented by TREE_LIST nodes that
861 are chained together. */
863 #define TREE_CHAIN(NODE) __extension__ \
864 (*({__typeof (NODE) const __t = (NODE); \
865 &__t->common.chain; }))
867 /* In all nodes that are expressions, this is the data type of the expression.
868 In POINTER_TYPE nodes, this is the type that the pointer points to.
869 In ARRAY_TYPE nodes, this is the type of the elements.
870 In VECTOR_TYPE nodes, this is the type of the elements. */
871 #define TREE_TYPE(NODE) __extension__ \
872 (*({__typeof (NODE) const __t = (NODE); \
873 &__t->common.type; }))
875 extern void tree_contains_struct_check_failed (const_tree,
876 const enum tree_node_structure_enum,
877 const char *, int, const char *)
880 extern void tree_check_failed (const_tree, const char *, int, const char *,
881 ...) ATTRIBUTE_NORETURN;
882 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
883 ...) ATTRIBUTE_NORETURN;
884 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
885 const char *, int, const char *)
887 extern void tree_range_check_failed (const_tree, const char *, int,
888 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 OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
936 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
937 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
939 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
940 #define TREE_TYPE(NODE) ((NODE)->common.type)
944 #define TREE_BLOCK(NODE) *(tree_block (NODE))
946 #include "tree-check.h"
948 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
949 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
950 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
951 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
952 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
953 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
954 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
955 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
956 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
957 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
958 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
960 #define RECORD_OR_UNION_CHECK(T) \
961 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
962 #define NOT_RECORD_OR_UNION_CHECK(T) \
963 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
965 #define NUMERICAL_TYPE_CHECK(T) \
966 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
969 /* Here is how primitive or already-canonicalized types' hash codes
971 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
973 /* A simple hash function for an arbitrary tree node. This must not be
974 used in hash tables which are saved to a PCH. */
975 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
977 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
978 #define CONVERT_EXPR_CODE_P(CODE) \
979 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
981 /* Similarly, but accept an expressions instead of a tree code. */
982 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
984 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
986 #define CASE_CONVERT \
990 /* Given an expression as a tree, strip any conversion that generates
991 no instruction. Accepts both tree and const_tree arguments since
992 we are not modifying the tree itself. */
994 #define STRIP_NOPS(EXP) \
995 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
997 /* Like STRIP_NOPS, but don't let the signedness change either. */
999 #define STRIP_SIGN_NOPS(EXP) \
1000 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1002 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1004 #define STRIP_TYPE_NOPS(EXP) \
1005 while ((CONVERT_EXPR_P (EXP) \
1006 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1007 && TREE_OPERAND (EXP, 0) != error_mark_node \
1008 && (TREE_TYPE (EXP) \
1009 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1010 (EXP) = TREE_OPERAND (EXP, 0)
1012 /* Remove unnecessary type conversions according to
1013 tree_ssa_useless_type_conversion. */
1015 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1016 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1018 /* Nonzero if TYPE represents an integral type. Note that we do not
1019 include COMPLEX types here. Keep these checks in ascending code
1022 #define INTEGRAL_TYPE_P(TYPE) \
1023 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1024 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1025 || TREE_CODE (TYPE) == INTEGER_TYPE)
1027 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1029 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1030 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1032 /* Nonzero if TYPE represents a saturating fixed-point type. */
1034 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1035 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1037 /* Nonzero if TYPE represents a fixed-point type. */
1039 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1041 /* Nonzero if TYPE represents a scalar floating-point type. */
1043 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1045 /* Nonzero if TYPE represents a complex floating-point type. */
1047 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1048 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1049 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1051 /* Nonzero if TYPE represents a vector floating-point type. */
1053 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1054 (TREE_CODE (TYPE) == VECTOR_TYPE \
1055 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1057 /* Nonzero if TYPE represents a floating-point type, including complex
1058 and vector floating-point types. The vector and complex check does
1059 not use the previous two macros to enable early folding. */
1061 #define FLOAT_TYPE_P(TYPE) \
1062 (SCALAR_FLOAT_TYPE_P (TYPE) \
1063 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1064 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1065 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1067 /* Nonzero if TYPE represents a decimal floating-point type. */
1068 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1069 (SCALAR_FLOAT_TYPE_P (TYPE) \
1070 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1072 /* Nonzero if TYPE is a record or union type. */
1073 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1074 (TREE_CODE (TYPE) == RECORD_TYPE \
1075 || TREE_CODE (TYPE) == UNION_TYPE \
1076 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1078 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1079 Keep these checks in ascending code order. */
1081 #define AGGREGATE_TYPE_P(TYPE) \
1082 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1084 /* Nonzero if TYPE represents a pointer or reference type.
1085 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1086 ascending code order. */
1088 #define POINTER_TYPE_P(TYPE) \
1089 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1091 /* Nonzero if this type is a complete type. */
1092 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1094 /* Nonzero if this type is the (possibly qualified) void type. */
1095 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1097 /* Nonzero if this type is complete or is cv void. */
1098 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1099 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1101 /* Nonzero if this type is complete or is an array with unspecified bound. */
1102 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1103 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1106 /* Define many boolean fields that all tree nodes have. */
1108 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1109 of this is needed. So it cannot be in a register.
1110 In a FUNCTION_DECL, nonzero means its address is needed.
1111 So it must be compiled even if it is an inline function.
1112 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1113 In LABEL_DECL nodes, it means a goto for this label has been seen
1114 from a place outside all binding contours that restore stack levels.
1115 In ..._TYPE nodes, it means that objects of this type must be fully
1116 addressable. This means that pieces of this object cannot go into
1117 register parameters, for example. If this a function type, this
1118 means that the value must be returned in memory.
1119 In IDENTIFIER_NODEs, this means that some extern decl for this name
1120 had its address taken. That matters for inline functions. */
1121 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1123 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1124 exit of a function. Calls for which this is true are candidates for tail
1125 call optimizations. */
1126 #define CALL_EXPR_TAILCALL(NODE) \
1127 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1129 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1130 CASE_LOW operand has been processed. */
1131 #define CASE_LOW_SEEN(NODE) \
1132 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1134 #define PREDICT_EXPR_OUTCOME(NODE) \
1135 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1136 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1137 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1138 #define PREDICT_EXPR_PREDICTOR(NODE) \
1139 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1141 /* In a VAR_DECL, nonzero means allocate static storage.
1142 In a FUNCTION_DECL, nonzero if function has been defined.
1143 In a CONSTRUCTOR, nonzero means allocate static storage. */
1144 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1146 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1147 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1149 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1150 should only be executed if an exception is thrown, not on normal exit
1152 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1154 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1155 separate cleanup in honor_protect_cleanup_actions. */
1156 #define TRY_CATCH_IS_CLEANUP(NODE) \
1157 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1159 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1160 CASE_HIGH operand has been processed. */
1161 #define CASE_HIGH_SEEN(NODE) \
1162 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1164 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1165 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1167 /* Used to mark scoped enums. */
1168 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1170 /* In an expr node (usually a conversion) this means the node was made
1171 implicitly and should not lead to any sort of warning. In a decl node,
1172 warnings concerning the decl should be suppressed. This is used at
1173 least for used-before-set warnings, and it set after one warning is
1175 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1177 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1178 this string as an argument. */
1179 #define TREE_SYMBOL_REFERENCED(NODE) \
1180 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1182 /* Nonzero in a pointer or reference type means the data pointed to
1183 by this type can alias anything. */
1184 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1185 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1187 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1188 #define MOVE_NONTEMPORAL(NODE) \
1189 (EXPR_CHECK (NODE)->base.static_flag)
1191 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1192 there was an overflow in folding. */
1194 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1196 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1198 #define TREE_OVERFLOW_P(EXPR) \
1199 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1201 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1202 nonzero means name is to be accessible from outside this translation unit.
1203 In an IDENTIFIER_NODE, nonzero means an external declaration
1204 accessible from outside this translation unit was previously seen
1205 for this name in an inner scope. */
1206 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1208 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1209 of cached values, or is something else. */
1210 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1212 /* In a SAVE_EXPR, indicates that the original expression has already
1213 been substituted with a VAR_DECL that contains the value. */
1214 #define SAVE_EXPR_RESOLVED_P(NODE) \
1215 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1217 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1219 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1220 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1222 /* In any expression, decl, or constant, nonzero means it has side effects or
1223 reevaluation of the whole expression could produce a different value.
1224 This is set if any subexpression is a function call, a side effect or a
1225 reference to a volatile variable. In a ..._DECL, this is set only if the
1226 declaration said `volatile'. This will never be set for a constant. */
1227 #define TREE_SIDE_EFFECTS(NODE) \
1228 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1230 /* In a LABEL_DECL, nonzero means this label had its address taken
1231 and therefore can never be deleted and is a jump target for
1233 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1235 /* Nonzero means this expression is volatile in the C sense:
1236 its address should be of type `volatile WHATEVER *'.
1237 In other words, the declared item is volatile qualified.
1238 This is used in _DECL nodes and _REF nodes.
1239 On a FUNCTION_DECL node, this means the function does not
1240 return normally. This is the same effect as setting
1241 the attribute noreturn on the function in C.
1243 In a ..._TYPE node, means this type is volatile-qualified.
1244 But use TYPE_VOLATILE instead of this macro when the node is a type,
1245 because eventually we may make that a different bit.
1247 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1248 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1250 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1251 accessing the memory pointed to won't generate a trap. However,
1252 this only applies to an object when used appropriately: it doesn't
1253 mean that writing a READONLY mem won't trap. Similarly for
1254 MISALIGNED_INDIRECT_REF.
1256 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1257 (or slice of the array) always belongs to the range of the array.
1258 I.e. that the access will not trap, provided that the access to
1259 the base to the array will not trap. */
1260 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1262 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1263 nonzero means it may not be the lhs of an assignment.
1264 Nonzero in a FUNCTION_DECL means this function should be treated
1265 as "const" function (can only read its arguments). */
1266 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1268 /* Value of expression is constant. Always on in all ..._CST nodes. May
1269 also appear in an expression or decl where the value is constant. */
1270 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1272 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1273 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1274 (TYPE_CHECK (NODE)->base.constant_flag)
1276 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1277 #define DECL_UNSIGNED(NODE) \
1278 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1280 /* In integral and pointer types, means an unsigned type. */
1281 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1283 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1284 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1285 This is interesting in an inline function, since it might not need
1286 to be compiled separately.
1287 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1288 if the debugging info for the type has been written.
1289 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1290 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1292 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1294 /* Nonzero in a _DECL if the name is used in its scope.
1295 Nonzero in an expr node means inhibit warning if value is unused.
1296 In IDENTIFIER_NODEs, this means that some extern decl for this name
1298 In a BLOCK, this means that the block contains variables that are used. */
1299 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1301 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1302 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1303 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1305 /* In a CALL_EXPR, means that it's safe to use the target of the call
1306 expansion as the return slot for a call that returns in memory. */
1307 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1308 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1310 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1311 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1313 #define DECL_BY_REFERENCE(NODE) \
1314 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1315 RESULT_DECL)->decl_common.decl_by_reference_flag)
1317 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1318 can be used as restricted tag to disambiguate against other restrict
1319 pointers. Used by fortran to capture something like non-addressability
1320 (which it isn't really because the middle-end does take addresses of
1322 #define DECL_RESTRICTED_P(NODE) \
1323 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1324 RESULT_DECL)->decl_common.decl_restricted_flag)
1326 #define DECL_READ_P(NODE) \
1327 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1329 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1330 thunked-to function. */
1331 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1333 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1334 it has been built for the declaration of a variable-sized object. */
1335 #define ALLOCA_FOR_VAR_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. Operands 0 and 1 have to match
1636 corresponding MEM_REF operands. */
1637 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1638 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1639 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1640 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1641 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
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_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1706 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1708 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1709 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1710 the argument count is zero when checking is enabled. Instead, do
1711 the pointer arithmetic to advance past the 3 fixed operands in a
1712 CALL_EXPR. That produces a valid pointer to just past the end of the
1713 operand array, even if it's not valid to dereference it. */
1714 #define CALL_EXPR_ARGP(NODE) \
1715 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1717 /* OpenMP directive and clause accessors. */
1719 #define OMP_BODY(NODE) \
1720 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1721 #define OMP_CLAUSES(NODE) \
1722 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1724 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1725 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1727 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1728 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1730 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1731 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1732 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1734 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1735 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1736 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1737 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1738 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1739 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1741 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1742 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1744 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1746 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1747 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1749 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1751 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1753 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1754 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1756 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1757 #define OMP_CLAUSE_DECL(NODE) \
1758 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1759 OMP_CLAUSE_PRIVATE, \
1760 OMP_CLAUSE_COPYPRIVATE), 0)
1761 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1762 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1763 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1765 /* True on an OMP_SECTION statement that was the last lexical member.
1766 This status is meaningful in the implementation of lastprivate. */
1767 #define OMP_SECTION_LAST(NODE) \
1768 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1770 /* True on an OMP_PARALLEL statement if it represents an explicit
1771 combined parallel work-sharing constructs. */
1772 #define OMP_PARALLEL_COMBINED(NODE) \
1773 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1775 /* True on a PRIVATE clause if its decl is kept around for debugging
1776 information only and its DECL_VALUE_EXPR is supposed to point
1777 to what it has been remapped to. */
1778 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1779 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1781 /* True on a PRIVATE clause if ctor needs access to outer region's
1783 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1784 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1786 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1787 decl is present in the chain. */
1788 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1789 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1790 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1791 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1792 OMP_CLAUSE_LASTPRIVATE),\
1794 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1795 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1797 #define OMP_CLAUSE_IF_EXPR(NODE) \
1798 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1799 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1801 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1802 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1804 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1805 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1806 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1807 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1808 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1809 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1811 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1812 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1813 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1814 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1815 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1816 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1817 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1818 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1819 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1820 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1821 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1822 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1824 enum omp_clause_schedule_kind
1826 OMP_CLAUSE_SCHEDULE_STATIC,
1827 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1828 OMP_CLAUSE_SCHEDULE_GUIDED,
1829 OMP_CLAUSE_SCHEDULE_AUTO,
1830 OMP_CLAUSE_SCHEDULE_RUNTIME
1833 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1834 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1836 enum omp_clause_default_kind
1838 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1839 OMP_CLAUSE_DEFAULT_SHARED,
1840 OMP_CLAUSE_DEFAULT_NONE,
1841 OMP_CLAUSE_DEFAULT_PRIVATE,
1842 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1845 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1846 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1848 struct GTY(()) tree_exp {
1849 struct tree_common common;
1852 tree GTY ((special ("tree_exp"),
1853 desc ("TREE_CODE ((tree) &%0)")))
1857 /* SSA_NAME accessors. */
1859 /* Returns the variable being referenced. Once released, this is the
1860 only field that can be relied upon. */
1861 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1863 /* Returns the statement which defines this SSA name. */
1864 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1866 /* Returns the SSA version number of this SSA name. Note that in
1867 tree SSA, version numbers are not per variable and may be recycled. */
1868 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1870 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1871 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1873 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1874 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1876 /* Nonzero if this SSA_NAME expression is currently on the free list of
1877 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1878 has no meaning for an SSA_NAME. */
1879 #define SSA_NAME_IN_FREE_LIST(NODE) \
1880 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1882 /* Nonzero if this SSA_NAME is the default definition for the
1883 underlying symbol. A default SSA name is created for symbol S if
1884 the very first reference to S in the function is a read operation.
1885 Default definitions are always created by an empty statement and
1886 belong to no basic block. */
1887 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1888 SSA_NAME_CHECK (NODE)->base.default_def_flag
1890 /* Attributes for SSA_NAMEs for pointer-type variables. */
1891 #define SSA_NAME_PTR_INFO(N) \
1892 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1894 /* Defined in tree-flow.h. */
1895 struct ptr_info_def;
1897 /* Immediate use linking structure. This structure is used for maintaining
1898 a doubly linked list of uses of an SSA_NAME. */
1899 typedef struct GTY(()) ssa_use_operand_d {
1900 struct ssa_use_operand_d* GTY((skip(""))) prev;
1901 struct ssa_use_operand_d* GTY((skip(""))) next;
1902 /* Immediate uses for a given SSA name are maintained as a cyclic
1903 list. To recognize the root of this list, the location field
1904 needs to point to the original SSA name. Since statements and
1905 SSA names are of different data types, we need this union. See
1906 the explanation in struct immediate_use_iterator_d. */
1907 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1908 tree *GTY((skip(""))) use;
1909 } ssa_use_operand_t;
1911 /* Return the immediate_use information for an SSA_NAME. */
1912 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1914 struct GTY(()) tree_ssa_name {
1915 struct tree_common common;
1917 /* _DECL wrapped by this SSA name. */
1920 /* Statement that defines this SSA name. */
1923 /* SSA version number. */
1924 unsigned int version;
1926 /* Pointer attributes used for alias analysis. */
1927 struct ptr_info_def *ptr_info;
1929 /* Immediate uses list for this SSA_NAME. */
1930 struct ssa_use_operand_d imm_uses;
1933 struct GTY(()) phi_arg_d {
1934 /* imm_use MUST be the first element in struct because we do some
1935 pointer arithmetic with it. See phi_arg_index_from_use. */
1936 struct ssa_use_operand_d imm_use;
1942 #define OMP_CLAUSE_CODE(NODE) \
1943 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1945 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1946 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1948 #define OMP_CLAUSE_CODE(NODE) \
1949 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1951 #define OMP_CLAUSE_OPERAND(NODE, I) \
1952 OMP_CLAUSE_ELT_CHECK (NODE, I)
1954 struct GTY(()) tree_omp_clause {
1955 struct tree_common common;
1957 enum omp_clause_code code;
1958 union omp_clause_subcode {
1959 enum omp_clause_default_kind default_kind;
1960 enum omp_clause_schedule_kind schedule_kind;
1961 enum tree_code reduction_code;
1962 } GTY ((skip)) subcode;
1964 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1966 gimple_seq gimple_reduction_init;
1967 gimple_seq gimple_reduction_merge;
1969 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1973 /* In a BLOCK node. */
1974 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1975 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1976 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1977 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1978 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1979 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
1980 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1981 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1982 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1983 /* Note: when changing this, make sure to find the places
1984 that use chainon or nreverse. */
1985 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1986 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1987 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1989 /* An index number for this block. These values are not guaranteed to
1990 be unique across functions -- whether or not they are depends on
1991 the debugging output format in use. */
1992 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1994 /* If block reordering splits a lexical block into discontiguous
1995 address ranges, we'll make a copy of the original block.
1997 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1998 In that case, we have one source block that has been replicated
1999 (through inlining or unrolling) into many logical blocks, and that
2000 these logical blocks have different physical variables in them.
2002 In this case, we have one logical block split into several
2003 non-contiguous address ranges. Most debug formats can't actually
2004 represent this idea directly, so we fake it by creating multiple
2005 logical blocks with the same variables in them. However, for those
2006 that do support non-contiguous regions, these allow the original
2007 logical block to be reconstructed, along with the set of address
2010 One of the logical block fragments is arbitrarily chosen to be
2011 the ORIGIN. The other fragments will point to the origin via
2012 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2013 be null. The list of fragments will be chained through
2014 BLOCK_FRAGMENT_CHAIN from the origin. */
2016 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2017 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2019 /* For an inlined function, this gives the location where it was called
2020 from. This is only set in the top level block, which corresponds to the
2021 inlined function scope. This is used in the debug output routines. */
2023 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2025 struct GTY(()) tree_block {
2026 struct tree_common common;
2028 unsigned abstract_flag : 1;
2029 unsigned block_num : 31;
2034 VEC(tree,gc) *nonlocalized_vars;
2038 tree abstract_origin;
2039 tree fragment_origin;
2040 tree fragment_chain;
2043 /* Define fields and accessors for nodes representing data types. */
2045 /* See tree.def for documentation of the use of these fields.
2046 Look at the documentation of the various ..._TYPE tree codes.
2048 Note that the type.values, type.minval, and type.maxval fields are
2049 overloaded and used for different macros in different kinds of types.
2050 Each macro must check to ensure the tree node is of the proper kind of
2051 type. Note also that some of the front-ends also overload these fields,
2052 so they must be checked as well. */
2054 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2055 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2056 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2057 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2058 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2059 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2060 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2061 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2062 (INTEGER_TYPE_CHECK (NODE)->type.values \
2063 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2064 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2065 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2066 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2067 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2068 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2069 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2070 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2071 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2072 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2073 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2074 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2075 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2076 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2077 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2078 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2079 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2080 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2081 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2082 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2083 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2084 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2086 /* Vector types need to check target flags to determine type. */
2087 extern enum machine_mode vector_type_mode (const_tree);
2088 #define TYPE_MODE(NODE) \
2089 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2090 ? vector_type_mode (NODE) : (NODE)->type.mode)
2091 #define SET_TYPE_MODE(NODE, MODE) \
2092 (TYPE_CHECK (NODE)->type.mode = (MODE))
2094 /* The "canonical" type for this type node, which is used by frontends to
2095 compare the type for equality with another type. If two types are
2096 equal (based on the semantics of the language), then they will have
2097 equivalent TYPE_CANONICAL entries.
2099 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2100 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2101 be used for comparison against other types. Instead, the type is
2102 said to require structural equality checks, described in
2103 TYPE_STRUCTURAL_EQUALITY_P.
2105 For unqualified aggregate and function types the middle-end relies on
2106 TYPE_CANONICAL to tell whether two variables can be assigned
2107 to each other without a conversion. The middle-end also makes sure
2108 to assign the same alias-sets to the type partition with equal
2109 TYPE_CANONICAL of their unqualified variants. */
2110 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2111 /* Indicates that the type node requires structural equality
2112 checks. The compiler will need to look at the composition of the
2113 type to determine whether it is equal to another type, rather than
2114 just comparing canonical type pointers. For instance, we would need
2115 to look at the return and parameter types of a FUNCTION_TYPE
2117 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2118 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2119 type node requires structural equality. */
2120 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2122 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2123 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2124 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2126 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2127 in the debugging output. We use this to describe a vector as a
2128 structure containing an array. */
2129 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) \
2130 (VECTOR_TYPE_CHECK (NODE)->type.values)
2132 /* For record and union types, information about this type, as a base type
2134 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2136 /* For non record and union types, used in a language-dependent way. */
2137 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2139 /* The (language-specific) typed-based alias set for this type.
2140 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2141 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2142 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2143 type can alias objects of any type. */
2144 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2146 /* Nonzero iff the typed-based alias set for this type has been
2148 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2150 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2152 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2154 /* The alignment necessary for objects of this type.
2155 The value is an int, measured in bits. */
2156 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2158 /* 1 if the alignment for this type was requested by "aligned" attribute,
2159 0 if it is the default for this type. */
2160 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2162 /* The alignment for NODE, in bytes. */
2163 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2165 /* If your language allows you to declare types, and you want debug info
2166 for them, then you need to generate corresponding TYPE_DECL nodes.
2167 These "stub" TYPE_DECL nodes have no name, and simply point at the
2168 type node. You then set the TYPE_STUB_DECL field of the type node
2169 to point back at the TYPE_DECL node. This allows the debug routines
2170 to know that the two nodes represent the same type, so that we only
2171 get one debug info record for them. */
2172 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2174 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2175 has BLKmode only because it lacks the alignment requirement for
2177 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2179 /* In an INTEGER_TYPE, it means the type represents a size. We use
2180 this both for validity checking and to permit optimizations that
2181 are unsafe for other types. Note that the C `size_t' type should
2182 *not* have this flag set. The `size_t' type is simply a typedef
2183 for an ordinary integer type that happens to be the type of an
2184 expression returned by `sizeof'; `size_t' has no special
2185 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2186 always actual sizes. */
2187 #define TYPE_IS_SIZETYPE(NODE) \
2188 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2190 /* Nonzero in a type considered volatile as a whole. */
2191 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2193 /* Means this type is const-qualified. */
2194 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2196 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2198 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2200 /* If nonzero, type's name shouldn't be emitted into debug info. */
2201 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2203 /* The address space the type is in. */
2204 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2206 /* There is a TYPE_QUAL value for each type qualifier. They can be
2207 combined by bitwise-or to form the complete set of qualifiers for a
2210 #define TYPE_UNQUALIFIED 0x0
2211 #define TYPE_QUAL_CONST 0x1
2212 #define TYPE_QUAL_VOLATILE 0x2
2213 #define TYPE_QUAL_RESTRICT 0x4
2215 /* Encode/decode the named memory support as part of the qualifier. If more
2216 than 8 qualifiers are added, these macros need to be adjusted. */
2217 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2218 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2220 /* Return all qualifiers except for the address space qualifiers. */
2221 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2223 /* Only keep the address space out of the qualifiers and discard the other
2225 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2227 /* The set of type qualifiers for this type. */
2228 #define TYPE_QUALS(NODE) \
2229 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2230 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2231 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2232 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2234 /* The same as TYPE_QUALS without the address space qualifications. */
2235 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2236 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2237 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2238 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2240 /* These flags are available for each language front end to use internally. */
2241 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2242 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2243 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2244 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2245 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2246 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2247 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2249 /* Used to keep track of visited nodes in tree traversals. This is set to
2250 0 by copy_node and make_node. */
2251 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2253 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2254 that distinguish string from array of char).
2255 If set in a INTEGER_TYPE, indicates a character type. */
2256 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2258 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2259 object of the given ARRAY_TYPE. This allows temporaries to be
2261 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2262 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2264 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2265 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2266 (((unsigned HOST_WIDE_INT) 1) \
2267 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2269 /* Set precision to n when we have 2^n sub-parts of the vector. */
2270 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2271 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2273 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2274 about missing conversions to other vector types of the same size. */
2275 #define TYPE_VECTOR_OPAQUE(NODE) \
2276 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2278 /* Indicates that objects of this type must be initialized by calling a
2279 function when they are created. */
2280 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2281 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2283 /* Indicates that a UNION_TYPE object should be passed the same way that
2284 the first union alternative would be passed, or that a RECORD_TYPE
2285 object should be passed the same way that the first (and only) member
2287 #define TYPE_TRANSPARENT_AGGR(NODE) \
2288 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2290 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2291 address of a component of the type. This is the counterpart of
2292 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2293 #define TYPE_NONALIASED_COMPONENT(NODE) \
2294 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2296 /* Indicated that objects of this type should be laid out in as
2297 compact a way as possible. */
2298 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2300 /* Used by type_contains_placeholder_p to avoid recomputation.
2301 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2302 this field directly. */
2303 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2304 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2308 struct GTY(()) tree_type {
2309 struct tree_common common;
2316 unsigned int precision : 10;
2317 unsigned no_force_blk_flag : 1;
2318 unsigned needs_constructing_flag : 1;
2319 unsigned transparent_aggr_flag : 1;
2320 unsigned restrict_flag : 1;
2321 unsigned contains_placeholder_bits : 2;
2323 ENUM_BITFIELD(machine_mode) mode : 8;
2325 unsigned string_flag : 1;
2326 unsigned lang_flag_0 : 1;
2327 unsigned lang_flag_1 : 1;
2328 unsigned lang_flag_2 : 1;
2329 unsigned lang_flag_3 : 1;
2330 unsigned lang_flag_4 : 1;
2331 unsigned lang_flag_5 : 1;
2332 unsigned lang_flag_6 : 1;
2335 alias_set_type alias_set;
2338 union tree_type_symtab {
2339 int GTY ((tag ("0"))) address;
2340 const char * GTY ((tag ("1"))) pointer;
2341 struct die_struct * GTY ((tag ("2"))) die;
2342 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2343 descbits ("2"))) symtab;
2352 /* Points to a structure whose details depend on the language in use. */
2353 struct lang_type *lang_specific;
2356 /* Define accessor macros for information about type inheritance
2359 A "basetype" means a particular usage of a data type for inheritance
2360 in another type. Each such basetype usage has its own "binfo"
2361 object to describe it. The binfo object is a TREE_VEC node.
2363 Inheritance is represented by the binfo nodes allocated for a
2364 given type. For example, given types C and D, such that D is
2365 inherited by C, 3 binfo nodes will be allocated: one for describing
2366 the binfo properties of C, similarly one for D, and one for
2367 describing the binfo properties of D as a base type for C.
2368 Thus, given a pointer to class C, one can get a pointer to the binfo
2369 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2371 /* BINFO specific flags. */
2373 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2374 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2376 /* Flags for language dependent use. */
2377 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2378 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2379 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2380 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2381 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2382 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2383 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2385 /* The actual data type node being inherited in this basetype. */
2386 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2388 /* The offset where this basetype appears in its containing type.
2389 BINFO_OFFSET slot holds the offset (in bytes)
2390 from the base of the complete object to the base of the part of the
2391 object that is allocated on behalf of this `type'.
2392 This is always 0 except when there is multiple inheritance. */
2394 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2395 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2397 /* The virtual function table belonging to this basetype. Virtual
2398 function tables provide a mechanism for run-time method dispatching.
2399 The entries of a virtual function table are language-dependent. */
2401 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2403 /* The virtual functions in the virtual function table. This is
2404 a TREE_LIST that is used as an initial approximation for building
2405 a virtual function table for this basetype. */
2406 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2408 /* A vector of binfos for the direct basetypes inherited by this
2411 If this basetype describes type D as inherited in C, and if the
2412 basetypes of D are E and F, then this vector contains binfos for
2413 inheritance of E and F by C. */
2414 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2416 /* The number of basetypes for NODE. */
2417 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2419 /* Accessor macro to get to the Nth base binfo of this binfo. */
2420 #define BINFO_BASE_BINFO(NODE,N) \
2421 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2422 #define BINFO_BASE_ITERATE(NODE,N,B) \
2423 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2424 #define BINFO_BASE_APPEND(NODE,T) \
2425 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2427 /* For a BINFO record describing a virtual base class, i.e., one where
2428 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2429 base. The actual contents are language-dependent. In the C++
2430 front-end this field is an INTEGER_CST giving an offset into the
2431 vtable where the offset to the virtual base can be found. */
2432 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2434 /* Indicates the accesses this binfo has to its bases. The values are
2435 access_public_node, access_protected_node or access_private_node.
2436 If this array is not present, public access is implied. */
2437 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2439 #define BINFO_BASE_ACCESS(NODE,N) \
2440 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2441 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2442 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2444 /* The index in the VTT where this subobject's sub-VTT can be found.
2445 NULL_TREE if there is no sub-VTT. */
2446 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2448 /* The index in the VTT where the vptr for this subobject can be
2449 found. NULL_TREE if there is no secondary vptr in the VTT. */
2450 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2452 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2453 inheriting this base for non-virtual bases. For virtual bases it
2454 points either to the binfo for which this is a primary binfo, or to
2455 the binfo of the most derived type. */
2456 #define BINFO_INHERITANCE_CHAIN(NODE) \
2457 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2459 struct GTY (()) tree_binfo {
2460 struct tree_common common;
2466 VEC(tree,gc) *base_accesses;
2472 VEC(tree,none) base_binfos;
2476 /* Define fields and accessors for nodes representing declared names. */
2478 /* Nonzero if DECL represents a variable for the SSA passes. */
2479 #define SSA_VAR_P(DECL) \
2480 (TREE_CODE (DECL) == VAR_DECL \
2481 || TREE_CODE (DECL) == PARM_DECL \
2482 || TREE_CODE (DECL) == RESULT_DECL \
2483 || (TREE_CODE (DECL) == SSA_NAME \
2484 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2485 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2486 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2491 /* Enumerate visibility settings. */
2492 #ifndef SYMBOL_VISIBILITY_DEFINED
2493 #define SYMBOL_VISIBILITY_DEFINED
2494 enum symbol_visibility
2497 VISIBILITY_PROTECTED,
2505 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2507 /* This is the name of the object as written by the user.
2508 It is an IDENTIFIER_NODE. */
2509 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2511 /* Every ..._DECL node gets a unique number. */
2512 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2514 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2516 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2518 /* Every ..._DECL node gets a unique number that stays the same even
2519 when the decl is copied by the inliner once it is set. */
2520 #define DECL_PT_UID(NODE) \
2521 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2522 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2523 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2524 #define SET_DECL_PT_UID(NODE, UID) \
2525 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2526 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2527 be preserved when copyin the decl. */
2528 #define DECL_PT_UID_SET_P(NODE) \
2529 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2531 /* These two fields describe where in the source code the declaration
2532 was. If the declaration appears in several places (as for a C
2533 function that is declared first and then defined later), this
2534 information should refer to the definition. */
2535 #define DECL_SOURCE_LOCATION(NODE) \
2536 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2537 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2538 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2539 #define DECL_IS_BUILTIN(DECL) \
2540 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2542 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2543 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2544 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2545 nodes, this points to either the FUNCTION_DECL for the containing
2546 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2547 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2549 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2550 #define DECL_FIELD_CONTEXT(NODE) \
2551 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2553 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2554 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2556 struct GTY(()) tree_decl_minimal {
2557 struct tree_common common;
2565 /* For any sort of a ..._DECL node, this points to the original (abstract)
2566 decl node which this decl is an inlined/cloned instance of, or else it
2567 is NULL indicating that this decl is not an instance of some other decl.
2569 The C front-end also uses this in a nested declaration of an inline
2570 function, to point back to the definition. */
2571 #define DECL_ABSTRACT_ORIGIN(NODE) \
2572 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2574 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2575 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2576 #define DECL_ORIGIN(NODE) \
2577 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2579 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2580 inline instance of some original (abstract) decl from an inline function;
2581 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2582 nodes can also have their abstract origin set to themselves. */
2583 #define DECL_FROM_INLINE(NODE) \
2584 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2585 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2587 /* In a DECL this is the field where attributes are stored. */
2588 #define DECL_ATTRIBUTES(NODE) \
2589 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2591 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2592 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2593 For a VAR_DECL, holds the initial value.
2594 For a PARM_DECL, used for DECL_ARG_TYPE--default
2595 values for parameters are encoded in the type of the function,
2596 not in the PARM_DECL slot.
2597 For a FIELD_DECL, this is used for enumeration values and the C
2598 frontend uses it for temporarily storing bitwidth of bitfields.
2600 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2601 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2603 /* Holds the size of the datum, in bits, as a tree expression.
2604 Need not be constant. */
2605 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2606 /* Likewise for the size in bytes. */
2607 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2608 /* Holds the alignment required for the datum, in bits. */
2609 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2610 /* The alignment of NODE, in bytes. */
2611 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2612 /* Set if the alignment of this DECL has been set by the user, for
2613 example with an 'aligned' attribute. */
2614 #define DECL_USER_ALIGN(NODE) \
2615 (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2616 /* Holds the machine mode corresponding to the declaration of a variable or
2617 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2619 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2621 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2622 operation it is. Note, however, that this field is overloaded, with
2623 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2624 checked before any access to the former. */
2625 #define DECL_FUNCTION_CODE(NODE) \
2626 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2627 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2628 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2630 #define DECL_FUNCTION_PERSONALITY(NODE) \
2631 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2633 /* Nonzero for a given ..._DECL node means that the name of this node should
2634 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2635 the body of the function should also be ignored. */
2636 #define DECL_IGNORED_P(NODE) \
2637 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2639 /* Nonzero for a given ..._DECL node means that this node represents an
2640 "abstract instance" of the given declaration (e.g. in the original
2641 declaration of an inline function). When generating symbolic debugging
2642 information, we mustn't try to generate any address information for nodes
2643 marked as "abstract instances" because we don't actually generate
2644 any code or allocate any data space for such instances. */
2645 #define DECL_ABSTRACT(NODE) \
2646 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2648 /* Language-specific decl information. */
2649 #define DECL_LANG_SPECIFIC(NODE) \
2650 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2652 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2653 do not allocate storage, and refer to a definition elsewhere. Note that
2654 this does not necessarily imply the entity represented by NODE
2655 has no program source-level definition in this translation unit. For
2656 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2657 DECL_EXTERNAL may be true simultaneously; that can be the case for
2658 a C99 "extern inline" function. */
2659 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2661 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2662 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2664 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2666 Also set in some languages for variables, etc., outside the normal
2667 lexical scope, such as class instance variables. */
2668 #define DECL_NONLOCAL(NODE) \
2669 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2671 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2672 Used in FIELD_DECLs for vtable pointers.
2673 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2674 #define DECL_VIRTUAL_P(NODE) \
2675 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2677 /* Used to indicate that this DECL represents a compiler-generated entity. */
2678 #define DECL_ARTIFICIAL(NODE) \
2679 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2681 /* Additional flags for language-specific uses. */
2682 #define DECL_LANG_FLAG_0(NODE) \
2683 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2684 #define DECL_LANG_FLAG_1(NODE) \
2685 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2686 #define DECL_LANG_FLAG_2(NODE) \
2687 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2688 #define DECL_LANG_FLAG_3(NODE) \
2689 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2690 #define DECL_LANG_FLAG_4(NODE) \
2691 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2692 #define DECL_LANG_FLAG_5(NODE) \
2693 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2694 #define DECL_LANG_FLAG_6(NODE) \
2695 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2696 #define DECL_LANG_FLAG_7(NODE) \
2697 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2698 #define DECL_LANG_FLAG_8(NODE) \
2699 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2701 /* Nonzero for a decl which is at file scope. */
2702 #define DECL_FILE_SCOPE_P(EXP) \
2703 (! DECL_CONTEXT (EXP) \
2704 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2706 /* Nonzero for a decl that is decorated using attribute used.
2707 This indicates to compiler tools that this decl needs to be preserved. */
2708 #define DECL_PRESERVE_P(DECL) \
2709 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2711 /* For function local variables of COMPLEX and VECTOR types,
2712 indicates that the variable is not aliased, and that all
2713 modifications to the variable have been adjusted so that
2714 they are killing assignments. Thus the variable may now
2715 be treated as a GIMPLE register, and use real instead of
2716 virtual ops in SSA form. */
2717 #define DECL_GIMPLE_REG_P(DECL) \
2718 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2720 struct GTY(()) tree_decl_common {
2721 struct tree_decl_minimal common;
2724 ENUM_BITFIELD(machine_mode) mode : 8;
2726 unsigned nonlocal_flag : 1;
2727 unsigned virtual_flag : 1;
2728 unsigned ignored_flag : 1;
2729 unsigned abstract_flag : 1;
2730 unsigned artificial_flag : 1;
2731 unsigned preserve_flag: 1;
2732 unsigned debug_expr_is_from : 1;
2734 unsigned lang_flag_0 : 1;
2735 unsigned lang_flag_1 : 1;
2736 unsigned lang_flag_2 : 1;
2737 unsigned lang_flag_3 : 1;
2738 unsigned lang_flag_4 : 1;
2739 unsigned lang_flag_5 : 1;
2740 unsigned lang_flag_6 : 1;
2741 unsigned lang_flag_7 : 1;
2742 unsigned lang_flag_8 : 1;
2744 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2745 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2746 unsigned decl_flag_0 : 1;
2747 /* In FIELD_DECL, this is DECL_BIT_FIELD
2748 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2749 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2750 unsigned decl_flag_1 : 1;
2751 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2752 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2753 unsigned decl_flag_2 : 1;
2754 /* Logically, these two would go in a theoretical base shared by var and
2756 unsigned gimple_reg_flag : 1;
2757 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2758 unsigned decl_by_reference_flag : 1;
2759 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2760 unsigned decl_restricted_flag : 1;
2762 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2764 unsigned decl_read_flag : 1;
2766 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2767 unsigned decl_common_unused : 1;
2769 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2770 unsigned int off_align : 8;
2772 /* 24-bits unused. */
2774 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2777 /* UID for points-to sets, stable over copying from inlining. */
2778 unsigned int pt_uid;
2783 tree abstract_origin;
2785 /* Points to a structure whose details depend on the language in use. */
2786 struct lang_decl *lang_specific;
2789 extern tree decl_value_expr_lookup (tree);
2790 extern void decl_value_expr_insert (tree, tree);
2792 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2793 if transformations have made this more complicated than evaluating the
2794 decl itself. This should only be used for debugging; once this field has
2795 been set, the decl itself may not legitimately appear in the function. */
2796 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2797 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2798 #define DECL_VALUE_EXPR(NODE) \
2799 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2800 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2801 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2803 /* Holds the RTL expression for the value of a variable or function.
2804 This value can be evaluated lazily for functions, variables with
2805 static storage duration, and labels. */
2806 #define DECL_RTL(NODE) \
2807 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2808 ? (NODE)->decl_with_rtl.rtl \
2809 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2811 /* Set the DECL_RTL for NODE to RTL. */
2812 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2814 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2815 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2817 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2818 #define DECL_RTL_SET_P(NODE) \
2819 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2821 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2822 NODE1, it will not be set for NODE2; this is a lazy copy. */
2823 #define COPY_DECL_RTL(NODE1, NODE2) \
2824 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2825 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2827 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2828 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2830 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2831 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2833 struct GTY(()) tree_decl_with_rtl {
2834 struct tree_decl_common common;
2838 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2839 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2840 of the structure. */
2841 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2843 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2844 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2845 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2846 natural alignment of the field's type). */
2847 #define DECL_FIELD_BIT_OFFSET(NODE) \
2848 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2850 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2851 if so, the type that was originally specified for it.
2852 TREE_TYPE may have been modified (in finish_struct). */
2853 #define DECL_BIT_FIELD_TYPE(NODE) \
2854 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2856 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2857 if nonzero, indicates that the field occupies the type. */
2858 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2860 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2861 DECL_FIELD_OFFSET which are known to be always zero.
2862 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2864 #define DECL_OFFSET_ALIGN(NODE) \
2865 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2867 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2868 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2869 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2871 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2872 which this FIELD_DECL is defined. This information is needed when
2873 writing debugging information about vfield and vbase decls for C++. */
2874 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2876 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2877 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2879 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2881 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2883 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2884 this component. This makes it possible for Type-Based Alias Analysis
2885 to disambiguate accesses to this field with indirect accesses using
2888 struct S { int i; } s;
2891 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2893 From the implementation's viewpoint, the alias set of the type of the
2894 field 'i' (int) will not be recorded as a subset of that of the type of
2895 's' (struct S) in record_component_aliases. The counterpart is that
2896 accesses to s.i must not be given the alias set of the type of 'i'
2897 (int) but instead directly that of the type of 's' (struct S). */
2898 #define DECL_NONADDRESSABLE_P(NODE) \
2899 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2901 struct GTY(()) tree_field_decl {
2902 struct tree_decl_common common;
2905 tree bit_field_type;
2911 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2912 dense, unique within any one function, and may be used to index arrays.
2913 If the value is -1, then no UID has been assigned. */
2914 #define LABEL_DECL_UID(NODE) \
2915 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2917 /* In a LABEL_DECL, the EH region number for which the label is the
2918 post_landing_pad. */
2919 #define EH_LANDING_PAD_NR(NODE) \
2920 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2922 /* In LABEL_DECL nodes, nonzero means that an error message about
2923 jumping into such a binding contour has been printed for this label. */
2924 #define DECL_ERROR_ISSUED(NODE) \
2925 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2927 struct GTY(()) tree_label_decl {
2928 struct tree_decl_with_rtl common;
2930 int eh_landing_pad_nr;
2934 struct GTY(()) tree_result_decl {
2935 struct tree_decl_with_rtl common;
2936 struct var_ann_d *ann;
2939 struct GTY(()) tree_const_decl {
2940 struct tree_decl_with_rtl common;
2943 /* For a PARM_DECL, records the data type used to pass the argument,
2944 which may be different from the type seen in the program. */
2945 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2947 /* For PARM_DECL, holds an RTL for the stack slot or register
2948 where the data was actually passed. */
2949 #define DECL_INCOMING_RTL(NODE) \
2950 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2952 struct GTY(()) tree_parm_decl {
2953 struct tree_decl_with_rtl common;
2955 struct var_ann_d *ann;
2959 /* Nonzero for a given ..._DECL node means that no warnings should be
2960 generated just because this node is unused. */
2961 #define DECL_IN_SYSTEM_HEADER(NODE) \
2962 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2964 /* Used to indicate that the linkage status of this DECL is not yet known,
2965 so it should not be output now. */
2966 #define DECL_DEFER_OUTPUT(NODE) \
2967 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2969 /* In a VAR_DECL that's static,
2970 nonzero if the space is in the text section. */
2971 #define DECL_IN_TEXT_SECTION(NODE) \
2972 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2974 /* In a VAR_DECL that's static,
2975 nonzero if it belongs to the global constant pool. */
2976 #define DECL_IN_CONSTANT_POOL(NODE) \
2977 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2979 /* Nonzero for a given ..._DECL node means that this node should be
2980 put in .common, if possible. If a DECL_INITIAL is given, and it
2981 is not error_mark_node, then the decl cannot be put in .common. */
2982 #define DECL_COMMON(NODE) \
2983 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2985 /* In a VAR_DECL, nonzero if the decl is a register variable with
2986 an explicit asm specification. */
2987 #define DECL_HARD_REGISTER(NODE) \
2988 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2990 /* Used to indicate that this DECL has weak linkage. */
2991 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2993 /* Used to indicate that the DECL is a dllimport. */
2994 #define DECL_DLLIMPORT_P(NODE) \
2995 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2997 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2998 not be put out unless it is needed in this translation unit.
2999 Entities like this are shared across translation units (like weak
3000 entities), but are guaranteed to be generated by any translation
3001 unit that needs them, and therefore need not be put out anywhere
3002 where they are not needed. DECL_COMDAT is just a hint to the
3003 back-end; it is up to front-ends which set this flag to ensure
3004 that there will never be any harm, other than bloat, in putting out
3005 something which is DECL_COMDAT. */
3006 #define DECL_COMDAT(NODE) \
3007 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3009 #define DECL_COMDAT_GROUP(NODE) \
3010 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3012 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3013 multiple translation units should be merged. */
3014 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3016 /* A replaceable function is one which may be replaced at link-time
3017 with an entirely different definition, provided that the
3018 replacement has the same type. For example, functions declared
3019 with __attribute__((weak)) on most systems are replaceable.
3021 COMDAT functions are not replaceable, since all definitions of the
3022 function must be equivalent. It is important that COMDAT functions
3023 not be treated as replaceable so that use of C++ template
3024 instantiations is not penalized.
3026 In other respects, the condition is usually equivalent to whether
3027 the function binds to the current module (shared library or executable).
3028 However, weak functions can always be overridden by earlier TUs
3029 in the same module, even if they bind locally to that module.
3031 For example, DECL_REPLACEABLE is used to determine whether or not a
3032 function (including a template instantiation) which is not
3033 explicitly declared "inline" can be inlined. If the function is
3034 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3035 implementation chosen at link-time may be different. However, a
3036 function that is not DECL_REPLACEABLE can be inlined, since all
3037 versions of the function will be functionally identical. */
3038 #define DECL_REPLACEABLE_P(NODE) \
3039 (!DECL_COMDAT (NODE) && (DECL_WEAK (NODE) || !targetm.binds_local_p (NODE)))
3041 /* The name of the object as the assembler will see it (but before any
3042 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3043 as DECL_NAME. It is an IDENTIFIER_NODE. */
3044 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3046 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3047 This is true of all DECL nodes except FIELD_DECL. */
3048 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3049 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3051 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3052 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3054 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3055 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3056 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3058 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3059 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3060 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3062 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3063 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3064 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3065 semantics of using this macro, are different than saying:
3067 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3069 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3071 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3072 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3073 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3074 DECL_ASSEMBLER_NAME (DECL1)) \
3077 /* Records the section name in a section attribute. Used to pass
3078 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3079 #define DECL_SECTION_NAME(NODE) \
3080 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3082 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3083 this variable in a BIND_EXPR. */
3084 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3085 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3087 /* Value of the decls's visibility attribute */
3088 #define DECL_VISIBILITY(NODE) \
3089 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3091 /* Nonzero means that the decl had its visibility specified rather than
3093 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3094 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3096 /* In a VAR_DECL, the model to use if the data should be allocated from
3097 thread-local storage. */
3098 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3100 /* In a VAR_DECL, nonzero if the data should be allocated from
3101 thread-local storage. */
3102 #define DECL_THREAD_LOCAL_P(NODE) \
3103 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3105 /* In a non-local VAR_DECL with static storage duration, true if the
3106 variable has an initialization priority. If false, the variable
3107 will be initialized at the DEFAULT_INIT_PRIORITY. */
3108 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3109 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3111 struct GTY(()) tree_decl_with_vis {
3112 struct tree_decl_with_rtl common;
3113 tree assembler_name;
3117 /* Belong to VAR_DECL exclusively. */
3118 unsigned defer_output : 1;
3119 unsigned hard_register : 1;
3120 unsigned thread_local : 1;
3121 unsigned common_flag : 1;
3122 unsigned in_text_section : 1;
3123 unsigned in_constant_pool : 1;
3124 unsigned dllimport_flag : 1;
3125 /* Don't belong to VAR_DECL exclusively. */
3126 unsigned weak_flag : 1;
3128 unsigned seen_in_bind_expr : 1;
3129 unsigned comdat_flag : 1;
3130 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3131 unsigned visibility_specified : 1;
3132 /* Belongs to VAR_DECL exclusively. */
3133 ENUM_BITFIELD(tls_model) tls_model : 3;
3135 /* Belong to FUNCTION_DECL exclusively. */
3136 unsigned init_priority_p : 1;
3137 /* Used by C++ only. Might become a generic decl flag. */
3138 unsigned shadowed_for_var_p : 1;
3139 /* 14 unused bits. */
3142 extern tree decl_debug_expr_lookup (tree);
3143 extern void decl_debug_expr_insert (tree, tree);
3144 /* For VAR_DECL, this is set to either an expression that it was split
3145 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3146 subexpressions that it was split into. */
3147 #define DECL_DEBUG_EXPR(NODE) \
3148 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3150 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3151 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3153 /* An initialization priority. */
3154 typedef unsigned short priority_type;
3156 extern priority_type decl_init_priority_lookup (tree);
3157 extern priority_type decl_fini_priority_lookup (tree);
3158 extern void decl_init_priority_insert (tree, priority_type);
3159 extern void decl_fini_priority_insert (tree, priority_type);
3161 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3163 #define DECL_INIT_PRIORITY(NODE) \
3164 (decl_init_priority_lookup (NODE))
3165 /* Set the initialization priority for NODE to VAL. */
3166 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3167 (decl_init_priority_insert (NODE, VAL))
3169 /* For a FUNCTION_DECL the finalization priority of NODE. */
3170 #define DECL_FINI_PRIORITY(NODE) \
3171 (decl_fini_priority_lookup (NODE))
3172 /* Set the finalization priority for NODE to VAL. */
3173 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3174 (decl_fini_priority_insert (NODE, VAL))
3176 /* The initialization priority for entities for which no explicit
3177 initialization priority has been specified. */
3178 #define DEFAULT_INIT_PRIORITY 65535
3180 /* The maximum allowed initialization priority. */
3181 #define MAX_INIT_PRIORITY 65535
3183 /* The largest priority value reserved for use by system runtime
3185 #define MAX_RESERVED_INIT_PRIORITY 100
3187 #define DECL_VAR_ANN_PTR(NODE) \
3188 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3189 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3190 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3193 struct GTY(()) tree_var_decl {
3194 struct tree_decl_with_vis common;
3195 struct var_ann_d *ann;
3199 /* This field is used to reference anything in decl.result and is meant only
3200 for use by the garbage collector. */
3201 #define DECL_RESULT_FLD(NODE) \
3202 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3204 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3205 Before the struct containing the FUNCTION_DECL is laid out,
3206 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3207 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3208 function. When the class is laid out, this pointer is changed
3209 to an INTEGER_CST node which is suitable for use as an index
3210 into the virtual function table.
3211 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3212 #define DECL_VINDEX(NODE) \
3213 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3216 tree_decl_non_common {
3217 struct tree_decl_with_vis common;
3218 /* C++ uses this in namespaces. */
3220 /* C++ uses this in templates. */
3222 /* Almost all FE's use this. */
3224 /* C++ uses this in namespaces. */
3228 /* In FUNCTION_DECL, holds the decl for the return value. */
3229 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3231 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3232 #define DECL_UNINLINABLE(NODE) \
3233 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3235 /* In a FUNCTION_DECL, the saved representation of the body of the
3237 #define DECL_SAVED_TREE(NODE) \
3238 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3240 /* Nonzero in a FUNCTION_DECL means this function should be treated
3241 as if it were a malloc, meaning it returns a pointer that is
3243 #define DECL_IS_MALLOC(NODE) \
3244 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3246 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3247 C++ operator new, meaning that it returns a pointer for which we
3248 should not use type based aliasing. */
3249 #define DECL_IS_OPERATOR_NEW(NODE) \
3250 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3252 /* Nonzero in a FUNCTION_DECL means this function may return more
3254 #define DECL_IS_RETURNS_TWICE(NODE) \
3255 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3257 /* Nonzero in a FUNCTION_DECL means this function should be treated
3258 as "pure" function (like const function, but may read global memory). */
3259 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3261 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3262 the const or pure function may not terminate. When this is nonzero
3263 for a const or pure function, it can be dealt with by cse passes
3264 but cannot be removed by dce passes since you are not allowed to
3265 change an infinite looping program into one that terminates without
3267 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3268 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3270 /* Nonzero in a FUNCTION_DECL means this function should be treated
3271 as "novops" function (function that does not read global memory,
3272 but may have arbitrary side effects). */
3273 #define DECL_IS_NOVOPS(NODE) \
3274 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3276 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3277 at the beginning or end of execution. */
3278 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3279 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3281 #define DECL_STATIC_DESTRUCTOR(NODE) \
3282 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3284 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3285 be instrumented with calls to support routines. */
3286 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3287 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3289 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3290 disabled in this function. */
3291 #define DECL_NO_LIMIT_STACK(NODE) \
3292 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3294 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3295 #define DECL_STATIC_CHAIN(NODE) \
3296 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3298 /* Nonzero for a decl that cgraph has decided should be inlined into
3299 at least one call site. It is not meaningful to look at this
3300 directly; always use cgraph_function_possibly_inlined_p. */
3301 #define DECL_POSSIBLY_INLINED(DECL) \
3302 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3304 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3305 such as via the `inline' keyword in C/C++. This flag controls the linkage
3306 semantics of 'inline' */
3307 #define DECL_DECLARED_INLINE_P(NODE) \
3308 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3310 /* Nonzero in a FUNCTION_DECL means this function should not get
3311 -Winline warnings. */
3312 #define DECL_NO_INLINE_WARNING_P(NODE) \
3313 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3315 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3316 disregarding size and cost heuristics. This is equivalent to using
3317 the always_inline attribute without the required diagnostics if the
3318 function cannot be inlined. */
3319 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3320 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3322 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3323 that describes the status of this function. */
3324 #define DECL_STRUCT_FUNCTION(NODE) \
3325 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3327 /* In a FUNCTION_DECL, nonzero means a built in function. */
3328 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3330 /* For a builtin function, identify which part of the compiler defined it. */
3331 #define DECL_BUILT_IN_CLASS(NODE) \
3332 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3334 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3335 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3337 #define DECL_ARGUMENTS(NODE) \
3338 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3339 #define DECL_ARGUMENT_FLD(NODE) \
3340 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3342 /* In FUNCTION_DECL, the function specific target options to use when compiling
3344 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3345 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3347 /* In FUNCTION_DECL, the function specific optimization options to use when
3348 compiling this function. */
3349 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3350 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3352 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3353 arguments/result/saved_tree fields by front ends. It was either inherit
3354 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3355 which seemed a bit strange. */
3357 struct GTY(()) tree_function_decl {
3358 struct tree_decl_non_common common;
3362 /* The personality function. Used for stack unwinding. */
3365 /* Function specific options that are used by this function. */
3366 tree function_specific_target; /* target options */
3367 tree function_specific_optimization; /* optimization options */
3369 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3370 DECL_FUNCTION_CODE. Otherwise unused.
3371 ??? The bitfield needs to be able to hold all target function
3373 ENUM_BITFIELD(built_in_function) function_code : 11;
3374 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3376 unsigned static_ctor_flag : 1;
3377 unsigned static_dtor_flag : 1;
3378 unsigned uninlinable : 1;
3380 unsigned possibly_inlined : 1;
3381 unsigned novops_flag : 1;
3382 unsigned returns_twice_flag : 1;
3383 unsigned malloc_flag : 1;
3384 unsigned operator_new_flag : 1;
3385 unsigned declared_inline_flag : 1;
3386 unsigned regdecl_flag : 1;
3388 unsigned no_inline_warning_flag : 1;
3389 unsigned no_instrument_function_entry_exit : 1;
3390 unsigned no_limit_stack : 1;
3391 unsigned disregard_inline_limits : 1;
3392 unsigned pure_flag : 1;
3393 unsigned looping_const_or_pure_flag : 1;
3399 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3400 #define DECL_ORIGINAL_TYPE(NODE) \
3401 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3403 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3404 into stabs. Instead it will generate cross reference ('x') of names.
3405 This uses the same flag as DECL_EXTERNAL. */
3406 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3407 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3409 /* Getter of the imported declaration associated to the
3410 IMPORTED_DECL node. */
3411 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3412 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3414 struct GTY(()) tree_type_decl {
3415 struct tree_decl_non_common common;
3419 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3420 To reduce overhead, the nodes containing the statements are not trees.
3421 This avoids the overhead of tree_common on all linked list elements.
3423 Use the interface in tree-iterator.h to access this node. */
3425 #define STATEMENT_LIST_HEAD(NODE) \
3426 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3427 #define STATEMENT_LIST_TAIL(NODE) \
3428 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3430 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3432 struct tree_statement_list_node *prev;
3433 struct tree_statement_list_node *next;
3437 struct GTY(()) tree_statement_list
3439 struct tree_common common;
3440 struct tree_statement_list_node *head;
3441 struct tree_statement_list_node *tail;
3445 /* Optimization options used by a function. */
3447 struct GTY(()) tree_optimization_option {
3448 struct tree_common common;
3450 /* The optimization options used by the user. */
3451 struct cl_optimization opts;
3454 #define TREE_OPTIMIZATION(NODE) \
3455 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3457 /* Return a tree node that encapsulates the current optimization options. */
3458 extern tree build_optimization_node (void);
3460 /* Target options used by a function. */
3462 struct GTY(()) tree_target_option {
3463 struct tree_common common;
3465 /* The optimization options used by the user. */
3466 struct cl_target_option opts;
3469 #define TREE_TARGET_OPTION(NODE) \
3470 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3472 /* Return a tree node that encapsulates the current target options. */
3473 extern tree build_target_option_node (void);
3476 /* Define the overall contents of a tree node.
3477 It may be any of the structures declared above
3478 for various types of node. */
3480 union GTY ((ptr_alias (union lang_tree_node),
3481 desc ("tree_node_structure (&%h)"), variable_size)) tree_node {
3482 struct tree_base GTY ((tag ("TS_BASE"))) base;
3483 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3484 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3485 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3486 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3487 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3488 struct tree_string GTY ((tag ("TS_STRING"))) string;
3489 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3490 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3491 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3492 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3493 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3494 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3495 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3496 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3497 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3498 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3499 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3500 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3501 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3502 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3503 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3504 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3505 struct tree_list GTY ((tag ("TS_LIST"))) list;
3506 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3507 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3508 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3509 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3510 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3511 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3512 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3513 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3514 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3515 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3518 /* Standard named or nameless data types of the C compiler. */
3541 TI_INTEGER_MINUS_ONE,
3558 TI_COMPLEX_INTEGER_TYPE,
3559 TI_COMPLEX_FLOAT_TYPE,
3560 TI_COMPLEX_DOUBLE_TYPE,
3561 TI_COMPLEX_LONG_DOUBLE_TYPE,
3565 TI_LONG_DOUBLE_TYPE,
3569 TI_LONG_DOUBLE_PTR_TYPE,
3570 TI_INTEGER_PTR_TYPE,
3579 TI_VA_LIST_GPR_COUNTER_FIELD,
3580 TI_VA_LIST_FPR_COUNTER_FIELD,
3587 TI_DFLOAT32_PTR_TYPE,
3588 TI_DFLOAT64_PTR_TYPE,
3589 TI_DFLOAT128_PTR_TYPE,
3598 TI_SAT_LLFRACT_TYPE,
3599 TI_SAT_USFRACT_TYPE,
3601 TI_SAT_ULFRACT_TYPE,
3602 TI_SAT_ULLFRACT_TYPE,
3614 TI_SAT_LLACCUM_TYPE,
3615 TI_SAT_USACCUM_TYPE,
3617 TI_SAT_ULACCUM_TYPE,
3618 TI_SAT_ULLACCUM_TYPE,
3664 TI_OPTIMIZATION_DEFAULT,
3665 TI_OPTIMIZATION_CURRENT,
3666 TI_TARGET_OPTION_DEFAULT,
3667 TI_TARGET_OPTION_CURRENT,
3668 TI_CURRENT_TARGET_PRAGMA,
3669 TI_CURRENT_OPTIMIZE_PRAGMA,
3674 extern GTY(()) tree global_trees[TI_MAX];
3676 #define error_mark_node global_trees[TI_ERROR_MARK]
3678 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3679 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3680 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3681 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3682 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3684 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3685 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3686 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3687 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3688 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3690 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3691 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3693 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3694 #define integer_one_node global_trees[TI_INTEGER_ONE]
3695 #define integer_three_node global_trees[TI_INTEGER_THREE]
3696 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3697 #define size_zero_node global_trees[TI_SIZE_ZERO]
3698 #define size_one_node global_trees[TI_SIZE_ONE]
3699 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3700 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3701 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3703 /* Base access nodes. */
3704 #define access_public_node global_trees[TI_PUBLIC]
3705 #define access_protected_node global_trees[TI_PROTECTED]
3706 #define access_private_node global_trees[TI_PRIVATE]
3708 #define null_pointer_node global_trees[TI_NULL_POINTER]
3710 #define float_type_node global_trees[TI_FLOAT_TYPE]
3711 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3712 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3714 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3715 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3716 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3717 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3719 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3720 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3721 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3722 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3724 #define void_type_node global_trees[TI_VOID_TYPE]
3725 /* The C type `void *'. */
3726 #define ptr_type_node global_trees[TI_PTR_TYPE]
3727 /* The C type `const void *'. */
3728 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3729 /* The C type `size_t'. */
3730 #define size_type_node global_trees[TI_SIZE_TYPE]
3731 #define pid_type_node global_trees[TI_PID_TYPE]
3732 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3733 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3734 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3735 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3736 /* The C type `FILE *'. */
3737 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3739 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3740 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3741 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3743 /* The decimal floating point types. */
3744 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3745 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3746 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3747 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3748 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3749 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3751 /* The fixed-point types. */
3752 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3753 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3754 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3755 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3756 #define sat_unsigned_short_fract_type_node \
3757 global_trees[TI_SAT_USFRACT_TYPE]
3758 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3759 #define sat_unsigned_long_fract_type_node \
3760 global_trees[TI_SAT_ULFRACT_TYPE]
3761 #define sat_unsigned_long_long_fract_type_node \
3762 global_trees[TI_SAT_ULLFRACT_TYPE]
3763 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3764 #define fract_type_node global_trees[TI_FRACT_TYPE]
3765 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3766 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3767 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3768 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3769 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3770 #define unsigned_long_long_fract_type_node \
3771 global_trees[TI_ULLFRACT_TYPE]
3772 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3773 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3774 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3775 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3776 #define sat_unsigned_short_accum_type_node \
3777 global_trees[TI_SAT_USACCUM_TYPE]
3778 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3779 #define sat_unsigned_long_accum_type_node \
3780 global_trees[TI_SAT_ULACCUM_TYPE]
3781 #define sat_unsigned_long_long_accum_type_node \
3782 global_trees[TI_SAT_ULLACCUM_TYPE]
3783 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3784 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3785 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3786 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3787 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3788 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3789 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3790 #define unsigned_long_long_accum_type_node \
3791 global_trees[TI_ULLACCUM_TYPE]
3792 #define qq_type_node global_trees[TI_QQ_TYPE]
3793 #define hq_type_node global_trees[TI_HQ_TYPE]
3794 #define sq_type_node global_trees[TI_SQ_TYPE]
3795 #define dq_type_node global_trees[TI_DQ_TYPE]
3796 #define tq_type_node global_trees[TI_TQ_TYPE]
3797 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3798 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3799 #define usq_type_node global_trees[TI_USQ_TYPE]
3800 #define udq_type_node global_trees[TI_UDQ_TYPE]
3801 #define utq_type_node global_trees[TI_UTQ_TYPE]
3802 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3803 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3804 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3805 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3806 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3807 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3808 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3809 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3810 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3811 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3812 #define ha_type_node global_trees[TI_HA_TYPE]
3813 #define sa_type_node global_trees[TI_SA_TYPE]
3814 #define da_type_node global_trees[TI_DA_TYPE]
3815 #define ta_type_node global_trees[TI_TA_TYPE]
3816 #define uha_type_node global_trees[TI_UHA_TYPE]
3817 #define usa_type_node global_trees[TI_USA_TYPE]
3818 #define uda_type_node global_trees[TI_UDA_TYPE]
3819 #define uta_type_node global_trees[TI_UTA_TYPE]
3820 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3821 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3822 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3823 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3824 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3825 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3826 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3827 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3829 /* The node that should be placed at the end of a parameter list to
3830 indicate that the function does not take a variable number of
3831 arguments. The TREE_VALUE will be void_type_node and there will be
3832 no TREE_CHAIN. Language-independent code should not assume
3833 anything else about this node. */
3834 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3836 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3837 #define MAIN_NAME_P(NODE) \
3838 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3840 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3842 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3843 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3845 /* Default/current target options (TARGET_OPTION_NODE). */
3846 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3847 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3849 /* Default tree list option(), optimize() pragmas to be linked into the
3851 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3852 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3854 /* An enumeration of the standard C integer types. These must be
3855 ordered so that shorter types appear before longer ones, and so
3856 that signed types appear before unsigned ones, for the correct
3857 functioning of interpret_integer() in c-lex.c. */
3858 enum integer_type_kind
3870 itk_unsigned_long_long,
3872 itk_unsigned_int128,
3876 typedef enum integer_type_kind integer_type_kind;
3878 /* The standard C integer types. Use integer_type_kind to index into
3880 extern GTY(()) tree integer_types[itk_none];
3882 #define char_type_node integer_types[itk_char]
3883 #define signed_char_type_node integer_types[itk_signed_char]
3884 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3885 #define short_integer_type_node integer_types[itk_short]
3886 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3887 #define integer_type_node integer_types[itk_int]
3888 #define unsigned_type_node integer_types[itk_unsigned_int]
3889 #define long_integer_type_node integer_types[itk_long]
3890 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3891 #define long_long_integer_type_node integer_types[itk_long_long]
3892 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3893 #define int128_integer_type_node integer_types[itk_int128]
3894 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3896 /* Set to the default thread-local storage (tls) model to use. */
3898 extern enum tls_model flag_tls_default;
3901 /* A pointer-to-function member type looks like:
3908 If __pfn is NULL, it is a NULL pointer-to-member-function.
3910 (Because the vtable is always the first thing in the object, we
3911 don't need its offset.) If the function is virtual, then PFN is
3912 one plus twice the index into the vtable; otherwise, it is just a
3913 pointer to the function.
3915 Unfortunately, using the lowest bit of PFN doesn't work in
3916 architectures that don't impose alignment requirements on function
3917 addresses, or that use the lowest bit to tell one ISA from another,
3918 for example. For such architectures, we use the lowest bit of
3919 DELTA instead of the lowest bit of the PFN, and DELTA will be
3922 enum ptrmemfunc_vbit_where_t
3924 ptrmemfunc_vbit_in_pfn,
3925 ptrmemfunc_vbit_in_delta
3928 #define NULL_TREE (tree) NULL
3930 extern tree decl_assembler_name (tree);
3931 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3932 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3934 /* Compute the number of bytes occupied by 'node'. This routine only
3935 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3937 extern size_t tree_size (const_tree);
3939 /* Compute the number of bytes occupied by a tree with code CODE. This
3940 function cannot be used for TREE_VEC codes, which are of variable
3942 extern size_t tree_code_size (enum tree_code);
3944 /* Lowest level primitive for allocating a node.
3945 The TREE_CODE is the only argument. Contents are initialized
3946 to zero except for a few of the common fields. */
3948 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3949 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3951 /* Make a copy of a node, with all the same contents. */
3953 extern tree copy_node_stat (tree MEM_STAT_DECL);
3954 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3956 /* Make a copy of a chain of TREE_LIST nodes. */
3958 extern tree copy_list (tree);
3961 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3962 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3964 /* Make a TREE_VEC. */
3966 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3967 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3969 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3970 The name is supplied as a char *. */
3972 extern tree get_identifier (const char *);
3974 #if GCC_VERSION >= 3000
3975 #define get_identifier(str) \
3976 (__builtin_constant_p (str) \
3977 ? get_identifier_with_length ((str), strlen (str)) \
3978 : get_identifier (str))
3982 /* Identical to get_identifier, except that the length is assumed
3985 extern tree get_identifier_with_length (const char *, size_t);
3987 /* If an identifier with the name TEXT (a null-terminated string) has
3988 previously been referred to, return that node; otherwise return
3991 extern tree maybe_get_identifier (const char *);
3993 /* Construct various types of nodes. */
3995 extern tree build_nt (enum tree_code, ...);
3996 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3998 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3999 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4000 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4001 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4002 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4003 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4004 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4005 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4006 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
4007 tree MEM_STAT_DECL);
4008 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4009 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
4010 tree MEM_STAT_DECL);
4011 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4012 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
4013 tree, tree MEM_STAT_DECL);
4014 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4015 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4017 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
4018 #define build_var_debug_value(t1,t2) \
4019 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4021 /* Constructs double_int from tree CST. */
4023 static inline double_int
4024 tree_to_double_int (const_tree cst)
4026 return TREE_INT_CST (cst);
4029 extern tree double_int_to_tree (tree, double_int);
4030 extern bool double_int_fits_to_tree_p (const_tree, double_int);
4031 extern tree force_fit_type_double (tree, double_int, int, bool);
4033 /* Create an INT_CST node with a CST value zero extended. */
4036 build_int_cstu (tree type, unsigned HOST_WIDE_INT cst)
4038 return double_int_to_tree (type, uhwi_to_double_int (cst));
4041 extern tree build_int_cst (tree, HOST_WIDE_INT);
4042 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
4043 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4044 extern tree build_vector (tree, tree);
4045 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
4046 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
4047 extern tree build_constructor_single (tree, tree, tree);
4048 extern tree build_constructor_from_list (tree, tree);
4049 extern tree build_real_from_int_cst (tree, const_tree);
4050 extern tree build_complex (tree, tree, tree);
4051 extern tree build_one_cst (tree);
4052 extern tree build_string (int, const char *);
4053 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
4054 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4055 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
4056 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4057 extern tree build_decl_stat (location_t, enum tree_code,
4058 tree, tree MEM_STAT_DECL);
4059 extern tree build_fn_decl (const char *, tree);
4060 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4061 extern tree build_block (tree, tree, tree, tree);
4062 extern tree build_empty_stmt (location_t);
4063 extern tree build_omp_clause (location_t, enum omp_clause_code);
4065 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
4066 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4068 extern tree build_call_nary (tree, tree, int, ...);
4069 extern tree build_call_valist (tree, tree, int, va_list);
4070 #define build_call_array(T1,T2,N,T3)\
4071 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4072 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4073 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
4075 /* Construct various nodes representing data types. */
4077 extern tree make_signed_type (int);
4078 extern tree make_unsigned_type (int);
4079 extern tree signed_or_unsigned_type_for (int, tree);
4080 extern tree signed_type_for (tree);
4081 extern tree unsigned_type_for (tree);
4082 extern void initialize_sizetypes (void);
4083 extern void set_sizetype (tree);
4084 extern void fixup_unsigned_type (tree);
4085 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4086 extern tree build_pointer_type (tree);
4087 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4088 extern tree build_reference_type (tree);
4089 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4090 extern tree build_vector_type (tree innertype, int nunits);
4091 extern tree build_opaque_vector_type (tree innertype, int nunits);
4092 extern tree build_type_no_quals (tree);
4093 extern tree build_index_type (tree);
4094 extern tree build_index_2_type (tree, tree);
4095 extern tree build_array_type (tree, tree);
4096 extern tree build_function_type (tree, tree);
4097 extern tree build_function_type_list (tree, ...);
4098 extern tree build_function_type_skip_args (tree, bitmap);
4099 extern tree build_function_decl_skip_args (tree, bitmap);
4100 extern tree build_varargs_function_type_list (tree, ...);
4101 extern tree build_method_type_directly (tree, tree, tree);
4102 extern tree build_method_type (tree, tree);
4103 extern tree build_offset_type (tree, tree);
4104 extern tree build_complex_type (tree);
4105 extern tree array_type_nelts (const_tree);
4106 extern bool in_array_bounds_p (tree);
4107 extern bool range_in_array_bounds_p (tree);
4109 extern tree value_member (tree, tree);
4110 extern tree purpose_member (const_tree, tree);
4111 extern bool vec_member (const_tree, VEC(tree,gc) *);
4112 extern tree chain_index (int, tree);
4114 extern int attribute_list_equal (const_tree, const_tree);
4115 extern int attribute_list_contained (const_tree, const_tree);
4116 extern int tree_int_cst_equal (const_tree, const_tree);
4117 extern int tree_int_cst_lt (const_tree, const_tree);
4118 extern int tree_int_cst_compare (const_tree, const_tree);
4119 extern int host_integerp (const_tree, int)
4120 #ifndef ENABLE_TREE_CHECKING
4121 ATTRIBUTE_PURE /* host_integerp is pure only when checking is disabled. */
4124 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4125 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4126 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4127 tree_low_cst (const_tree t, int pos)
4129 gcc_assert (host_integerp (t, pos));
4130 return TREE_INT_CST_LOW (t);
4133 extern int tree_int_cst_msb (const_tree);
4134 extern int tree_int_cst_sgn (const_tree);
4135 extern int tree_int_cst_sign_bit (const_tree);
4136 extern unsigned int tree_int_cst_min_precision (tree, bool);
4137 extern bool tree_expr_nonnegative_p (tree);
4138 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4139 extern bool may_negate_without_overflow_p (const_tree);
4140 extern tree strip_array_types (tree);
4141 extern tree excess_precision_type (tree);
4143 /* Construct various nodes representing fract or accum data types. */
4145 extern tree make_fract_type (int, int, int);
4146 extern tree make_accum_type (int, int, int);
4148 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4149 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4150 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4151 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4152 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4153 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4154 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4155 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4157 #define make_or_reuse_signed_fract_type(P) \
4158 make_or_reuse_fract_type (P, 0, 0)
4159 #define make_or_reuse_unsigned_fract_type(P) \
4160 make_or_reuse_fract_type (P, 1, 0)
4161 #define make_or_reuse_sat_signed_fract_type(P) \
4162 make_or_reuse_fract_type (P, 0, 1)
4163 #define make_or_reuse_sat_unsigned_fract_type(P) \
4164 make_or_reuse_fract_type (P, 1, 1)
4165 #define make_or_reuse_signed_accum_type(P) \
4166 make_or_reuse_accum_type (P, 0, 0)
4167 #define make_or_reuse_unsigned_accum_type(P) \
4168 make_or_reuse_accum_type (P, 1, 0)
4169 #define make_or_reuse_sat_signed_accum_type(P) \
4170 make_or_reuse_accum_type (P, 0, 1)
4171 #define make_or_reuse_sat_unsigned_accum_type(P) \
4172 make_or_reuse_accum_type (P, 1, 1)
4174 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4175 put the prototype here. Rtl.h does declare the prototype if
4176 tree.h had been included. */
4178 extern tree make_tree (tree, rtx);
4180 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4183 Such modified types already made are recorded so that duplicates
4186 extern tree build_type_attribute_variant (tree, tree);
4187 extern tree build_decl_attribute_variant (tree, tree);
4188 extern tree build_type_attribute_qual_variant (tree, tree, int);
4190 /* Structure describing an attribute and a function to handle it. */
4191 struct attribute_spec
4193 /* The name of the attribute (without any leading or trailing __),
4194 or NULL to mark the end of a table of attributes. */
4195 const char *const name;
4196 /* The minimum length of the list of arguments of the attribute. */
4197 const int min_length;
4198 /* The maximum length of the list of arguments of the attribute
4199 (-1 for no maximum). */
4200 const int max_length;
4201 /* Whether this attribute requires a DECL. If it does, it will be passed
4202 from types of DECLs, function return types and array element types to
4203 the DECLs, function types and array types respectively; but when
4204 applied to a type in any other circumstances, it will be ignored with
4205 a warning. (If greater control is desired for a given attribute,
4206 this should be false, and the flags argument to the handler may be
4207 used to gain greater control in that case.) */
4208 const bool decl_required;
4209 /* Whether this attribute requires a type. If it does, it will be passed
4210 from a DECL to the type of that DECL. */
4211 const bool type_required;
4212 /* Whether this attribute requires a function (or method) type. If it does,
4213 it will be passed from a function pointer type to the target type,
4214 and from a function return type (which is not itself a function
4215 pointer type) to the function type. */
4216 const bool function_type_required;
4217 /* Function to handle this attribute. NODE points to the node to which
4218 the attribute is to be applied. If a DECL, it should be modified in
4219 place; if a TYPE, a copy should be created. NAME is the name of the
4220 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4221 of the arguments (which may be NULL). FLAGS gives further information
4222 about the context of the attribute. Afterwards, the attributes will
4223 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4224 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4225 as well as in any other cases when the attributes should not be added
4226 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4227 applied to another type or DECL later may be returned;
4228 otherwise the return value should be NULL_TREE. This pointer may be
4229 NULL if no special handling is required beyond the checks implied
4230 by the rest of this structure. */
4231 tree (*const handler) (tree *node, tree name, tree args,
4232 int flags, bool *no_add_attrs);
4235 /* Flags that may be passed in the third argument of decl_attributes, and
4236 to handler functions for attributes. */
4237 enum attribute_flags
4239 /* The type passed in is the type of a DECL, and any attributes that
4240 should be passed in again to be applied to the DECL rather than the
4241 type should be returned. */
4242 ATTR_FLAG_DECL_NEXT = 1,
4243 /* The type passed in is a function return type, and any attributes that
4244 should be passed in again to be applied to the function type rather
4245 than the return type should be returned. */
4246 ATTR_FLAG_FUNCTION_NEXT = 2,
4247 /* The type passed in is an array element type, and any attributes that
4248 should be passed in again to be applied to the array type rather
4249 than the element type should be returned. */
4250 ATTR_FLAG_ARRAY_NEXT = 4,
4251 /* The type passed in is a structure, union or enumeration type being
4252 created, and should be modified in place. */
4253 ATTR_FLAG_TYPE_IN_PLACE = 8,
4254 /* The attributes are being applied by default to a library function whose
4255 name indicates known behavior, and should be silently ignored if they
4256 are not in fact compatible with the function type. */
4257 ATTR_FLAG_BUILT_IN = 16
4260 /* Default versions of target-overridable functions. */
4262 extern tree merge_decl_attributes (tree, tree);
4263 extern tree merge_type_attributes (tree, tree);
4265 /* Given a tree node and a string, return nonzero if the tree node is
4266 a valid attribute name for the string. */
4268 extern int is_attribute_p (const char *, const_tree);
4270 /* Given an attribute name and a list of attributes, return the list element
4271 of the attribute or NULL_TREE if not found. */
4273 extern tree lookup_attribute (const char *, tree);
4275 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4278 extern tree remove_attribute (const char *, tree);
4280 /* Given two attributes lists, return a list of their union. */
4282 extern tree merge_attributes (tree, tree);
4284 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4285 /* Given two Windows decl attributes lists, possibly including
4286 dllimport, return a list of their union . */
4287 extern tree merge_dllimport_decl_attributes (tree, tree);
4289 /* Handle a "dllimport" or "dllexport" attribute. */
4290 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4293 /* Check whether CAND is suitable to be returned from get_qualified_type
4294 (BASE, TYPE_QUALS). */
4296 extern bool check_qualified_type (const_tree, const_tree, int);
4298 /* Return a version of the TYPE, qualified as indicated by the
4299 TYPE_QUALS, if one exists. If no qualified version exists yet,
4300 return NULL_TREE. */
4302 extern tree get_qualified_type (tree, int);
4304 /* Like get_qualified_type, but creates the type if it does not
4305 exist. This function never returns NULL_TREE. */
4307 extern tree build_qualified_type (tree, int);
4309 /* Like build_qualified_type, but only deals with the `const' and
4310 `volatile' qualifiers. This interface is retained for backwards
4311 compatibility with the various front-ends; new code should use
4312 build_qualified_type instead. */
4314 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4315 build_qualified_type ((TYPE), \
4316 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4317 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4319 /* Make a copy of a type node. */
4321 extern tree build_distinct_type_copy (tree);
4322 extern tree build_variant_type_copy (tree);
4324 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4325 fields. Optionally specify an alignment, and then lay it out. */
4327 extern void finish_builtin_struct (tree, const char *,
4330 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4331 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4332 node, does nothing except for the first time. */
4334 extern void layout_type (tree);
4336 /* These functions allow a front-end to perform a manual layout of a
4337 RECORD_TYPE. (For instance, if the placement of subsequent fields
4338 depends on the placement of fields so far.) Begin by calling
4339 start_record_layout. Then, call place_field for each of the
4340 fields. Then, call finish_record_layout. See layout_type for the
4341 default way in which these functions are used. */
4343 typedef struct record_layout_info_s
4345 /* The RECORD_TYPE that we are laying out. */
4347 /* The offset into the record so far, in bytes, not including bits in
4350 /* The last known alignment of SIZE. */
4351 unsigned int offset_align;
4352 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4354 /* The alignment of the record so far, in bits. */
4355 unsigned int record_align;
4356 /* The alignment of the record so far, ignoring #pragma pack and
4357 __attribute__ ((packed)), in bits. */
4358 unsigned int unpacked_align;
4359 /* The previous field layed out. */
4361 /* The static variables (i.e., class variables, as opposed to
4362 instance variables) encountered in T. */
4363 VEC(tree,gc) *pending_statics;
4364 /* Bits remaining in the current alignment group */
4365 int remaining_in_alignment;
4366 /* True if we've seen a packed field that didn't have normal
4367 alignment anyway. */
4368 int packed_maybe_necessary;
4369 } *record_layout_info;
4371 extern record_layout_info start_record_layout (tree);
4372 extern tree bit_from_pos (tree, tree);
4373 extern tree byte_from_pos (tree, tree);
4374 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4375 extern void normalize_offset (tree *, tree *, unsigned int);
4376 extern tree rli_size_unit_so_far (record_layout_info);
4377 extern tree rli_size_so_far (record_layout_info);
4378 extern void normalize_rli (record_layout_info);
4379 extern void place_field (record_layout_info, tree);
4380 extern void compute_record_mode (tree);
4381 extern void finish_record_layout (record_layout_info, int);
4383 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4384 return a canonicalized ..._TYPE node, so that duplicates are not made.
4385 How the hash code is computed is up to the caller, as long as any two
4386 callers that could hash identical-looking type nodes agree. */
4388 extern tree type_hash_canon (unsigned int, tree);
4390 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4391 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4392 fields. Call this only once for any given decl node.
4394 Second argument is the boundary that this field can be assumed to
4395 be starting at (in bits). Zero means it can be assumed aligned
4396 on any boundary that may be needed. */
4398 extern void layout_decl (tree, unsigned);
4400 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4401 a previous call to layout_decl and calls it again. */
4403 extern void relayout_decl (tree);
4405 /* Return the mode for data of a given size SIZE and mode class CLASS.
4406 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4407 The value is BLKmode if no other mode is found. This is like
4408 mode_for_size, but is passed a tree. */
4410 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4412 /* Return an expr equal to X but certainly not valid as an lvalue. */
4414 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4415 extern tree non_lvalue_loc (location_t, tree);
4417 extern tree convert (tree, tree);
4418 extern unsigned int expr_align (const_tree);
4419 extern tree expr_first (tree);
4420 extern tree expr_last (tree);
4421 extern tree size_in_bytes (const_tree);
4422 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4423 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4424 extern tree tree_expr_size (const_tree);
4425 extern tree bit_position (const_tree);
4426 extern HOST_WIDE_INT int_bit_position (const_tree);
4427 extern tree byte_position (const_tree);
4428 extern HOST_WIDE_INT int_byte_position (const_tree);
4430 /* Define data structures, macros, and functions for handling sizes
4431 and the various types used to represent sizes. */
4435 SIZETYPE, /* Normal representation of sizes in bytes. */
4436 SSIZETYPE, /* Signed representation of sizes in bytes. */
4437 BITSIZETYPE, /* Normal representation of sizes in bits. */
4438 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4441 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4443 #define sizetype sizetype_tab[(int) SIZETYPE]
4444 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4445 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4446 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4448 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4449 #define size_binop(CODE,T1,T2)\
4450 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4451 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4452 #define size_diffop(T1,T2)\
4453 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4454 extern tree size_diffop_loc (location_t, tree, tree);
4456 #define size_int(L) size_int_kind (L, SIZETYPE)
4457 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4458 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4459 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4461 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4462 extern tree round_up_loc (location_t, tree, int);
4463 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4464 extern tree round_down_loc (location_t, tree, int);
4465 extern VEC(tree,gc) *get_pending_sizes (void);
4466 extern void put_pending_size (tree);
4467 extern void put_pending_sizes (VEC(tree,gc) *);
4468 extern void finalize_size_functions (void);
4470 /* Type for sizes of data-type. */
4472 #define BITS_PER_UNIT_LOG \
4473 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4474 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4475 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4477 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4478 extern unsigned int maximum_field_alignment;
4479 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4480 extern unsigned int initial_max_fld_align;
4482 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4483 by making the last node in X point to Y.
4484 Returns X, except if X is 0 returns Y. */
4486 extern tree chainon (tree, tree);
4488 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4490 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4491 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4493 /* Return the last tree node in a chain. */
4495 extern tree tree_last (tree);
4497 /* Reverse the order of elements in a chain, and return the new head. */
4499 extern tree nreverse (tree);
4501 /* Returns the length of a chain of nodes
4502 (number of chain pointers to follow before reaching a null pointer). */
4504 extern int list_length (const_tree);
4506 /* Returns the number of FIELD_DECLs in a type. */
4508 extern int fields_length (const_tree);
4510 /* Returns the first FIELD_DECL in a type. */
4512 extern tree first_field (const_tree);
4514 /* Given an initializer INIT, return TRUE if INIT is zero or some
4515 aggregate of zeros. Otherwise return FALSE. */
4517 extern bool initializer_zerop (const_tree);
4519 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4521 extern VEC(tree,gc) *ctor_to_vec (tree);
4523 /* Examine CTOR to discover:
4524 * how many scalar fields are set to nonzero values,
4525 and place it in *P_NZ_ELTS;
4526 * how many scalar fields in total are in CTOR,
4527 and place it in *P_ELT_COUNT.
4528 * if a type is a union, and the initializer from the constructor
4529 is not the largest element in the union, then set *p_must_clear.
4531 Return whether or not CTOR is a valid static constant initializer, the same
4532 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4534 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4537 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4539 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4541 extern int integer_zerop (const_tree);
4543 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4545 extern int integer_onep (const_tree);
4547 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4548 all of whose significant bits are 1. */
4550 extern int integer_all_onesp (const_tree);
4552 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4553 exactly one bit 1. */
4555 extern int integer_pow2p (const_tree);
4557 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4558 with a nonzero value. */
4560 extern int integer_nonzerop (const_tree);
4562 extern bool cst_and_fits_in_hwi (const_tree);
4563 extern tree num_ending_zeros (const_tree);
4565 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4568 extern int fixed_zerop (const_tree);
4570 /* staticp (tree x) is nonzero if X is a reference to data allocated
4571 at a fixed address in memory. Returns the outermost data. */
4573 extern tree staticp (tree);
4575 /* save_expr (EXP) returns an expression equivalent to EXP
4576 but it can be used multiple times within context CTX
4577 and only evaluate EXP once. */
4579 extern tree save_expr (tree);
4581 /* Look inside EXPR and into any simple arithmetic operations. Return
4582 the innermost non-arithmetic node. */
4584 extern tree skip_simple_arithmetic (tree);
4586 /* Return which tree structure is used by T. */
4588 enum tree_node_structure_enum tree_node_structure (const_tree);
4590 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4591 or offset that depends on a field within a record.
4593 Note that we only allow such expressions within simple arithmetic
4596 extern bool contains_placeholder_p (const_tree);
4598 /* This macro calls the above function but short-circuits the common
4599 case of a constant to save time. Also check for null. */
4601 #define CONTAINS_PLACEHOLDER_P(EXP) \
4602 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4604 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4605 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4608 extern bool type_contains_placeholder_p (tree);
4610 /* Given a tree EXP, find all occurences of references to fields
4611 in a PLACEHOLDER_EXPR and place them in vector REFS without
4612 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4613 we assume here that EXP contains only arithmetic expressions
4614 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4617 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4619 /* This macro calls the above function but short-circuits the common
4620 case of a constant to save time and also checks for NULL. */
4622 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4624 if((EXP) && !TREE_CONSTANT (EXP)) \
4625 find_placeholder_in_expr (EXP, V); \
4628 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4629 return a tree with all occurrences of references to F in a
4630 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4631 CONST_DECLs. Note that we assume here that EXP contains only
4632 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4633 occurring only in their argument list. */
4635 extern tree substitute_in_expr (tree, tree, tree);
4637 /* This macro calls the above function but short-circuits the common
4638 case of a constant to save time and also checks for NULL. */
4640 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4641 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4643 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4644 for it within OBJ, a tree that is an object or a chain of references. */
4646 extern tree substitute_placeholder_in_expr (tree, tree);
4648 /* This macro calls the above function but short-circuits the common
4649 case of a constant to save time and also checks for NULL. */
4651 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4652 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4653 : substitute_placeholder_in_expr (EXP, OBJ))
4655 /* variable_size (EXP) is like save_expr (EXP) except that it
4656 is for the special case of something that is part of a
4657 variable size for a data type. It makes special arrangements
4658 to compute the value at the right time when the data type
4659 belongs to a function parameter. */
4661 extern tree variable_size (tree);
4663 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4664 but it can be used multiple times
4665 and only evaluate the subexpressions once. */
4667 extern tree stabilize_reference (tree);
4669 /* Subroutine of stabilize_reference; this is called for subtrees of
4670 references. Any expression with side-effects must be put in a SAVE_EXPR
4671 to ensure that it is only evaluated once. */
4673 extern tree stabilize_reference_1 (tree);
4675 /* Return EXP, stripped of any conversions to wider types
4676 in such a way that the result of converting to type FOR_TYPE
4677 is the same as if EXP were converted to FOR_TYPE.
4678 If FOR_TYPE is 0, it signifies EXP's type. */
4680 extern tree get_unwidened (tree, tree);
4682 /* Return OP or a simpler expression for a narrower value
4683 which can be sign-extended or zero-extended to give back OP.
4684 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4685 or 0 if the value should be sign-extended. */
4687 extern tree get_narrower (tree, int *);
4689 /* Return true if T is an expression that get_inner_reference handles. */
4692 handled_component_p (const_tree t)
4694 switch (TREE_CODE (t))
4699 case ARRAY_RANGE_REF:
4700 case VIEW_CONVERT_EXPR:
4710 /* Given an expression EXP that is a handled_component_p,
4711 look for the ultimate containing object, which is returned and specify
4712 the access position and size. */
4714 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4715 tree *, enum machine_mode *, int *, int *,
4718 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4719 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4720 EXP is marked as PACKED. */
4722 extern bool contains_packed_reference (const_tree exp);
4724 /* Return a tree of sizetype representing the size, in bytes, of the element
4725 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4727 extern tree array_ref_element_size (tree);
4729 /* Return a tree representing the lower bound of the array mentioned in
4730 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4732 extern tree array_ref_low_bound (tree);
4734 /* Return a tree representing the upper bound of the array mentioned in
4735 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4737 extern tree array_ref_up_bound (tree);
4739 /* Return a tree representing the offset, in bytes, of the field referenced
4740 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4742 extern tree component_ref_field_offset (tree);
4744 /* Given a DECL or TYPE, return the scope in which it was declared, or
4745 NUL_TREE if there is no containing scope. */
4747 extern tree get_containing_scope (const_tree);
4749 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4751 extern tree decl_function_context (const_tree);
4753 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4754 this _DECL with its context, or zero if none. */
4755 extern tree decl_type_context (const_tree);
4757 /* Return 1 if EXPR is the real constant zero. */
4758 extern int real_zerop (const_tree);
4760 /* Declare commonly used variables for tree structure. */
4762 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4763 Zero means allow extended lvalues. */
4765 extern int pedantic_lvalues;
4767 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4769 extern GTY(()) tree current_function_decl;
4771 /* Nonzero means a FUNC_BEGIN label was emitted. */
4772 extern GTY(()) const char * current_function_func_begin_label;
4774 /* Iterator for going through the function arguments. */
4776 tree next; /* TREE_LIST pointing to the next argument */
4777 } function_args_iterator;
4779 /* Initialize the iterator I with arguments from function FNDECL */
4782 function_args_iter_init (function_args_iterator *i, const_tree fntype)
4784 i->next = TYPE_ARG_TYPES (fntype);
4787 /* Return a pointer that holds the next argument if there are more arguments to
4788 handle, otherwise return NULL. */
4790 static inline tree *
4791 function_args_iter_cond_ptr (function_args_iterator *i)
4793 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4796 /* Return the next argument if there are more arguments to handle, otherwise
4800 function_args_iter_cond (function_args_iterator *i)
4802 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4805 /* Advance to the next argument. */
4807 function_args_iter_next (function_args_iterator *i)
4809 gcc_assert (i->next != NULL_TREE);
4810 i->next = TREE_CHAIN (i->next);
4813 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4816 inlined_function_outer_scope_p (const_tree block)
4818 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4821 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4822 to point to the next tree element. ITER is an instance of
4823 function_args_iterator used to iterate the arguments. */
4824 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4825 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4826 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4827 function_args_iter_next (&(ITER)))
4829 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4830 to the next tree element. ITER is an instance of function_args_iterator
4831 used to iterate the arguments. */
4832 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4833 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4834 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4835 function_args_iter_next (&(ITER)))
4840 extern unsigned crc32_string (unsigned, const char *);
4841 extern void clean_symbol_name (char *);
4842 extern tree get_file_function_name (const char *);
4843 extern tree get_callee_fndecl (const_tree);
4844 extern int type_num_arguments (const_tree);
4845 extern bool associative_tree_code (enum tree_code);
4846 extern bool commutative_tree_code (enum tree_code);
4847 extern bool commutative_ternary_tree_code (enum tree_code);
4848 extern tree upper_bound_in_type (tree, tree);
4849 extern tree lower_bound_in_type (tree, tree);
4850 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4851 extern tree call_expr_arg (tree, int);
4852 extern tree *call_expr_argp (tree, int);
4853 extern tree create_artificial_label (location_t);
4854 extern const char *get_name (tree);
4855 extern bool stdarg_p (const_tree);
4856 extern bool prototype_p (tree);
4857 extern bool is_typedef_decl (tree x);
4858 extern bool typedef_variant_p (tree);
4859 extern bool auto_var_in_fn_p (const_tree, const_tree);
4860 extern tree build_low_bits_mask (tree, unsigned);
4861 extern tree tree_strip_nop_conversions (tree);
4862 extern tree tree_strip_sign_nop_conversions (tree);
4863 extern tree lhd_gcc_personality (void);
4864 extern void assign_assembler_name_if_neeeded (tree);
4868 extern void change_decl_assembler_name (tree, tree);
4871 extern tree unshare_expr (tree);
4875 extern void expand_expr_stmt (tree);
4876 extern int warn_if_unused_value (const_tree, location_t);
4877 extern void expand_label (tree);
4878 extern void expand_goto (tree);
4880 extern rtx expand_stack_save (void);
4881 extern void expand_stack_restore (tree);
4882 extern void expand_return (tree);
4885 extern void using_eh_for_cleanups (void);
4887 /* In fold-const.c */
4889 /* Non-zero if we are folding constants inside an initializer; zero
4891 extern int folding_initializer;
4893 /* Convert between trees and native memory representation. */
4894 extern int native_encode_expr (const_tree, unsigned char *, int);
4895 extern tree native_interpret_expr (tree, const unsigned char *, int);
4897 /* Fold constants as much as possible in an expression.
4898 Returns the simplified expression.
4899 Acts only on the top level of the expression;
4900 if the argument itself cannot be simplified, its
4901 subexpressions are not changed. */
4903 extern tree fold (tree);
4904 #define fold_unary(CODE,T1,T2)\
4905 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4906 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4907 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4908 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4909 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4910 #define fold_binary(CODE,T1,T2,T3)\
4911 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4912 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4913 #define fold_ternary(CODE,T1,T2,T3,T4)\
4914 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4915 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4916 #define fold_build1(c,t1,t2)\
4917 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4918 #define fold_build1_loc(l,c,t1,t2)\
4919 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4920 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4921 tree MEM_STAT_DECL);
4922 #define fold_build2(c,t1,t2,t3)\
4923 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4924 #define fold_build2_loc(l,c,t1,t2,t3)\
4925 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4926 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4927 tree MEM_STAT_DECL);
4928 #define fold_build3(c,t1,t2,t3,t4)\
4929 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4930 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4931 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4932 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4933 tree MEM_STAT_DECL);
4934 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4935 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4936 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4937 #define fold_build_call_array(T1,T2,N,T4)\
4938 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4939 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4940 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4941 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4942 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4943 extern bool fold_convertible_p (const_tree, const_tree);
4944 #define fold_convert(T1,T2)\
4945 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4946 extern tree fold_convert_loc (location_t, tree, tree);
4947 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4948 extern tree fold_ignored_result (tree);
4949 extern tree fold_abs_const (tree, tree);
4950 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4951 extern void fold_defer_overflow_warnings (void);
4952 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4953 extern void fold_undefer_and_ignore_overflow_warnings (void);
4954 extern bool fold_deferring_overflow_warnings_p (void);
4956 enum operand_equal_flag
4962 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4963 extern int multiple_of_p (tree, const_tree, const_tree);
4964 #define omit_one_operand(T1,T2,T3)\
4965 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4966 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4967 #define omit_two_operands(T1,T2,T3,T4)\
4968 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4969 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4970 #define invert_truthvalue(T)\
4971 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4972 extern tree invert_truthvalue_loc (location_t, tree);
4973 extern tree fold_truth_not_expr (location_t, tree);
4974 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4975 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4976 extern tree fold_read_from_constant_string (tree);
4977 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4978 #define build_fold_addr_expr(T)\
4979 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4980 extern tree build_fold_addr_expr_loc (location_t, tree);
4981 #define build_fold_addr_expr_with_type(T,TYPE)\
4982 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4983 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4984 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4985 extern tree fold_strip_sign_ops (tree);
4986 #define build_fold_indirect_ref(T)\
4987 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4988 extern tree build_fold_indirect_ref_loc (location_t, tree);
4989 #define fold_indirect_ref(T)\
4990 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4991 extern tree fold_indirect_ref_loc (location_t, tree);
4992 extern tree build_simple_mem_ref_loc (location_t, tree);
4993 #define build_simple_mem_ref(T)\
4994 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4995 extern double_int mem_ref_offset (const_tree);
4996 extern tree reference_alias_ptr_type (const_tree);
4997 extern tree constant_boolean_node (int, tree);
4998 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
5000 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
5001 extern enum tree_code swap_tree_comparison (enum tree_code);
5003 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
5004 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
5006 extern bool tree_expr_nonzero_p (tree);
5007 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
5008 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
5010 extern bool tree_single_nonzero_warnv_p (tree, bool *);
5011 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
5012 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
5014 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
5015 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
5016 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
5018 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
5020 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
5021 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
5022 enum tree_code, tree, tree, tree);
5023 extern void debug_fold_checksum (const_tree);
5025 /* Return nonzero if CODE is a tree code that represents a truth value. */
5027 truth_value_p (enum tree_code code)
5029 return (TREE_CODE_CLASS (code) == tcc_comparison
5030 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5031 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5032 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5037 extern tree fold_call_expr (location_t, tree, bool);
5038 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
5039 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
5040 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
5041 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
5042 enum built_in_function);
5043 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
5044 enum built_in_function);
5045 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
5046 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
5047 extern bool fold_builtin_next_arg (tree, bool);
5048 extern enum built_in_function builtin_mathfn_code (const_tree);
5049 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
5050 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
5051 extern tree build_call_expr_loc_vec (location_t, tree, VEC(tree,gc) *);
5052 extern tree build_call_expr_loc (location_t, tree, int, ...);
5053 extern tree build_call_expr (tree, int, ...);
5054 extern tree mathfn_built_in (tree, enum built_in_function fn);
5055 extern tree c_strlen (tree, int);
5056 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
5057 extern tree build_va_arg_indirect_ref (tree);
5058 extern tree build_string_literal (int, const char *);
5059 extern bool validate_arglist (const_tree, ...);
5060 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
5061 extern bool can_trust_pointer_alignment (void);
5062 extern unsigned int get_pointer_alignment (tree, unsigned int);
5063 extern bool is_builtin_name (const char *);
5064 extern bool is_builtin_fn (tree);
5065 extern unsigned int get_object_alignment (tree, unsigned int);
5066 extern tree fold_call_stmt (gimple, bool);
5067 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
5068 extern tree make_range (tree, int *, tree *, tree *, bool *);
5069 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
5070 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
5072 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
5073 extern bool is_simple_builtin (tree);
5074 extern bool is_inexpensive_builtin (tree);
5077 extern tree strip_float_extensions (tree);
5080 extern int really_constant_p (const_tree);
5081 extern bool decl_address_invariant_p (const_tree);
5082 extern bool decl_address_ip_invariant_p (const_tree);
5083 extern bool int_fits_type_p (const_tree, const_tree);
5084 #ifndef GENERATOR_FILE
5085 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5087 extern bool variably_modified_type_p (tree, tree);
5088 extern int tree_log2 (const_tree);
5089 extern int tree_floor_log2 (const_tree);
5090 extern int simple_cst_equal (const_tree, const_tree);
5091 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
5092 extern hashval_t iterative_hash_exprs_commutative (const_tree,
5093 const_tree, hashval_t);
5094 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5095 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
5096 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5097 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5098 extern int type_list_equal (const_tree, const_tree);
5099 extern int chain_member (const_tree, const_tree);
5100 extern tree type_hash_lookup (unsigned int, tree);
5101 extern void type_hash_add (unsigned int, tree);
5102 extern int simple_cst_list_equal (const_tree, const_tree);
5103 extern void dump_tree_statistics (void);
5104 extern void recompute_tree_invariant_for_addr_expr (tree);
5105 extern bool needs_to_live_in_memory (const_tree);
5106 extern tree reconstruct_complex_type (tree, tree);
5108 extern int real_onep (const_tree);
5109 extern int real_twop (const_tree);
5110 extern int real_minus_onep (const_tree);
5111 extern void init_ttree (void);
5112 extern void build_common_tree_nodes (bool);
5113 extern void build_common_tree_nodes_2 (int);
5114 extern void build_common_builtin_nodes (void);
5115 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5116 extern tree build_range_type (tree, tree, tree);
5117 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5118 extern HOST_WIDE_INT int_cst_value (const_tree);
5119 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
5121 extern bool fields_compatible_p (const_tree, const_tree);
5122 extern tree find_compatible_field (tree, tree);
5124 extern tree *tree_block (tree);
5125 extern location_t *block_nonartificial_location (tree);
5126 extern location_t tree_nonartificial_location (tree);
5128 extern tree block_ultimate_origin (const_tree);
5130 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
5132 /* In tree-nested.c */
5133 extern tree build_addr (tree, tree);
5136 extern void expand_main_function (void);
5137 extern void expand_function_end (void);
5138 extern void expand_function_start (tree);
5139 extern void stack_protect_prologue (void);
5140 extern void stack_protect_epilogue (void);
5141 extern void init_dummy_function_start (void);
5142 extern void expand_dummy_function_end (void);
5143 extern unsigned int init_function_for_compilation (void);
5144 extern void allocate_struct_function (tree, bool);
5145 extern void push_struct_function (tree fndecl);
5146 extern void init_function_start (tree);
5147 extern bool use_register_for_decl (const_tree);
5148 extern void generate_setjmp_warnings (void);
5149 extern void init_temp_slots (void);
5150 extern void free_temp_slots (void);
5151 extern void pop_temp_slots (void);
5152 extern void push_temp_slots (void);
5153 extern void preserve_temp_slots (rtx);
5154 extern int aggregate_value_p (const_tree, const_tree);
5155 extern void push_function_context (void);
5156 extern void pop_function_context (void);
5157 extern gimple_seq gimplify_parameters (void);
5159 /* In print-rtl.c */
5161 extern void print_rtl (FILE *, const_rtx);
5164 /* In print-tree.c */
5165 extern void debug_tree (tree);
5166 extern void debug_vec_tree (VEC(tree,gc) *);
5168 extern void dump_addr (FILE*, const char *, const void *);
5169 extern void print_node (FILE *, const char *, tree, int);
5170 extern void print_vec_tree (FILE *, const char *, VEC(tree,gc) *, int);
5171 extern void print_node_brief (FILE *, const char *, const_tree, int);
5172 extern void indent_to (FILE *, int);
5175 /* In tree-inline.c: */
5176 extern bool debug_find_tree (tree, tree);
5177 /* This is in tree-inline.c since the routine uses
5178 data structures from the inliner. */
5179 extern tree unsave_expr_now (tree);
5180 extern tree build_duplicate_type (tree);
5184 /* Nonzero if this is a call to a function whose return value depends
5185 solely on its arguments, has no side effects, and does not read
5186 global memory. This corresponds to TREE_READONLY for function
5188 #define ECF_CONST (1 << 0)
5189 /* Nonzero if this is a call to "pure" function (like const function,
5190 but may read memory. This corresponds to DECL_PURE_P for function
5192 #define ECF_PURE (1 << 1)
5193 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5194 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5195 for function decls.*/
5196 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5197 /* Nonzero if this call will never return. */
5198 #define ECF_NORETURN (1 << 3)
5199 /* Nonzero if this is a call to malloc or a related function. */
5200 #define ECF_MALLOC (1 << 4)
5201 /* Nonzero if it is plausible that this is a call to alloca. */
5202 #define ECF_MAY_BE_ALLOCA (1 << 5)
5203 /* Nonzero if this is a call to a function that won't throw an exception. */
5204 #define ECF_NOTHROW (1 << 6)
5205 /* Nonzero if this is a call to setjmp or a related function. */
5206 #define ECF_RETURNS_TWICE (1 << 7)
5207 /* Nonzero if this call replaces the current stack frame. */
5208 #define ECF_SIBCALL (1 << 8)
5209 /* Function does not read or write memory (but may have side effects, so
5210 it does not necessarily fit ECF_CONST). */
5211 #define ECF_NOVOPS (1 << 9)
5213 extern int flags_from_decl_or_type (const_tree);
5214 extern int call_expr_flags (const_tree);
5216 /* Call argument flags. */
5218 /* Nonzero if the argument is not dereferenced recursively, thus only
5219 directly reachable memory is read or written. */
5220 #define EAF_DIRECT (1 << 0)
5221 /* Nonzero if memory reached by the argument is not clobbered. */
5222 #define EAF_NOCLOBBER (1 << 1)
5223 /* Nonzero if the argument does not escape. */
5224 #define EAF_NOESCAPE (1 << 2)
5225 /* Nonzero if the argument is not used by the function. */
5226 #define EAF_UNUSED (1 << 3)
5228 /* Call return flags. */
5230 /* Mask for the argument number that is returned. Lower two bits of
5231 the return flags, encodes argument slots zero to three. */
5232 #define ERF_RETURN_ARG_MASK (3)
5233 /* Nonzero if the return value is equal to the argument number
5234 flags & ERF_RETURN_ARG_MASK. */
5235 #define ERF_RETURNS_ARG (1 << 2)
5236 /* Nonzero if the return value does not alias with anything. Functions
5237 with the malloc attribute have this set on their return value. */
5238 #define ERF_NOALIAS (1 << 3)
5240 extern int setjmp_call_p (const_tree);
5241 extern bool gimple_alloca_call_p (const_gimple);
5242 extern bool alloca_call_p (const_tree);
5243 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5244 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5248 extern const struct attribute_spec *lookup_attribute_spec (tree);
5250 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5251 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5252 it should be modified in place; if a TYPE, a copy should be created
5253 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5254 information, in the form of a bitwise OR of flags in enum attribute_flags
5255 from tree.h. Depending on these flags, some attributes may be
5256 returned to be applied at a later stage (for example, to apply
5257 a decl attribute to the declaration rather than to its type). */
5258 extern tree decl_attributes (tree *, tree, int);
5260 /* In integrate.c */
5261 extern void set_decl_abstract_flags (tree, int);
5262 extern void set_decl_origin_self (tree);
5264 /* In stor-layout.c */
5265 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5266 extern void fixup_signed_type (tree);
5267 extern void internal_reference_types (void);
5268 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5271 extern tree tree_output_constant_def (tree);
5272 extern void make_decl_rtl (tree);
5273 extern rtx make_decl_rtl_for_debug (tree);
5274 extern void make_decl_one_only (tree, tree);
5275 extern int supports_one_only (void);
5276 extern void resolve_unique_section (tree, int, int);
5277 extern void mark_referenced (tree);
5278 extern void mark_decl_referenced (tree);
5279 extern void notice_global_symbol (tree);
5280 extern void set_user_assembler_name (tree, const char *);
5281 extern void process_pending_assemble_externals (void);
5282 extern void finish_aliases_1 (void);
5283 extern void finish_aliases_2 (void);
5284 extern void remove_unreachable_alias_pairs (void);
5287 extern void expand_computed_goto (tree);
5288 extern bool parse_output_constraint (const char **, int, int, int,
5289 bool *, bool *, bool *);
5290 extern bool parse_input_constraint (const char **, int, int, int, int,
5291 const char * const *, bool *, bool *);
5292 extern void expand_asm_stmt (gimple);
5293 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5294 extern void expand_case (gimple);
5295 extern void expand_decl (tree);
5297 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5298 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5302 /* In dwarf2out.c */
5303 /* Interface of the DWARF2 unwind info support. */
5305 /* Generate a new label for the CFI info to refer to. */
5307 extern char *dwarf2out_cfi_label (bool);
5309 /* Entry point to update the canonical frame address (CFA). */
5311 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5313 /* Add the CFI for saving a register window. */
5315 extern void dwarf2out_window_save (const char *);
5317 /* Entry point for saving a register to the stack. */
5319 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5321 /* Entry point for saving the return address in the stack. */
5323 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5325 /* Entry point for saving the return address in a register. */
5327 extern void dwarf2out_return_reg (const char *, unsigned);
5329 /* Entry point for saving the first register into the second. */
5331 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5333 /* In tree-inline.c */
5335 /* The type of a set of already-visited pointers. Functions for creating
5336 and manipulating it are declared in pointer-set.h */
5337 struct pointer_set_t;
5339 /* The type of a callback function for walking over tree structure. */
5341 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5343 /* The type of a callback function that represents a custom walk_tree. */
5345 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5346 void *, struct pointer_set_t*);
5348 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5350 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5352 #define walk_tree(a,b,c,d) \
5353 walk_tree_1 (a, b, c, d, NULL)
5354 #define walk_tree_without_duplicates(a,b,c) \
5355 walk_tree_without_duplicates_1 (a, b, c, NULL)
5358 /* Assign the RTX to declaration. */
5360 extern void set_decl_rtl (tree, rtx);
5361 extern void set_decl_incoming_rtl (tree, rtx, bool);
5363 /* Enum and arrays used for tree allocation stats.
5364 Keep in sync with tree.c:tree_node_kind_names. */
5386 extern int tree_node_counts[];
5387 extern int tree_node_sizes[];
5389 /* True if we are in gimple form and the actions of the folders need to
5390 be restricted. False if we are not in gimple form and folding is not
5391 restricted to creating gimple expressions. */
5392 extern bool in_gimple_form;
5395 extern tree get_base_address (tree t);
5396 extern void mark_addressable (tree);
5398 /* In tree-vectorizer.c. */
5399 extern void vect_set_verbosity_level (const char *);
5403 struct GTY(()) tree_map_base {
5407 extern int tree_map_base_eq (const void *, const void *);
5408 extern unsigned int tree_map_base_hash (const void *);
5409 extern int tree_map_base_marked_p (const void *);
5410 extern bool list_equal_p (const_tree, const_tree);
5412 /* Map from a tree to another tree. */
5414 struct GTY(()) tree_map {
5415 struct tree_map_base base;
5420 #define tree_map_eq tree_map_base_eq
5421 extern unsigned int tree_map_hash (const void *);
5422 #define tree_map_marked_p tree_map_base_marked_p
5424 /* Map from a decl tree to another tree. */
5426 struct GTY(()) tree_decl_map {
5427 struct tree_map_base base;
5431 #define tree_decl_map_eq tree_map_base_eq
5432 extern unsigned int tree_decl_map_hash (const void *);
5433 #define tree_decl_map_marked_p tree_map_base_marked_p
5435 /* Map from a tree to an int. */
5437 struct GTY(()) tree_int_map {
5438 struct tree_map_base base;
5442 #define tree_int_map_eq tree_map_base_eq
5443 #define tree_int_map_hash tree_map_base_hash
5444 #define tree_int_map_marked_p tree_map_base_marked_p
5446 /* Map from a tree to initialization/finalization priorities. */
5448 struct GTY(()) tree_priority_map {
5449 struct tree_map_base base;
5454 #define tree_priority_map_eq tree_map_base_eq
5455 #define tree_priority_map_hash tree_map_base_hash
5456 #define tree_priority_map_marked_p tree_map_base_marked_p
5460 tree target_for_debug_bind (tree);
5462 /* In tree-ssa-address.c. */
5463 extern tree tree_mem_ref_addr (tree, tree);
5464 extern void copy_mem_ref_info (tree, tree);
5467 extern bool ssa_name_nonnegative_p (const_tree);
5469 /* In tree-object-size.c. */
5470 extern void init_object_sizes (void);
5471 extern void fini_object_sizes (void);
5472 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5475 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5476 extern tree build_personality_function (const char *);
5478 /* In tree-inline.c. */
5480 void init_inline_once (void);
5482 /* Compute the number of operands in an expression node NODE. For
5483 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5484 otherwise it is looked up from the node's code. */
5486 tree_operand_length (const_tree node)
5488 if (VL_EXP_CLASS_P (node))
5489 return VL_EXP_OPERAND_LENGTH (node);
5491 return TREE_CODE_LENGTH (TREE_CODE (node));
5494 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5495 have to go towards the end of tree.h so that union tree_node is fully
5496 defined by this point. */
5498 /* Structure containing iterator state. */
5499 typedef struct GTY (()) call_expr_arg_iterator_d {
5500 tree t; /* the call_expr */
5501 int n; /* argument count */
5502 int i; /* next argument index */
5503 } call_expr_arg_iterator;
5505 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5506 const_tree t; /* the call_expr */
5507 int n; /* argument count */
5508 int i; /* next argument index */
5509 } const_call_expr_arg_iterator;
5511 /* Initialize the abstract argument list iterator object ITER with the
5512 arguments from CALL_EXPR node EXP. */
5514 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5517 iter->n = call_expr_nargs (exp);
5522 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5525 iter->n = call_expr_nargs (exp);
5529 /* Return the next argument from abstract argument list iterator object ITER,
5530 and advance its state. Return NULL_TREE if there are no more arguments. */
5532 next_call_expr_arg (call_expr_arg_iterator *iter)
5535 if (iter->i >= iter->n)
5537 result = CALL_EXPR_ARG (iter->t, iter->i);
5542 static inline const_tree
5543 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5546 if (iter->i >= iter->n)
5548 result = CALL_EXPR_ARG (iter->t, iter->i);
5553 /* Initialize the abstract argument list iterator object ITER, then advance
5554 past and return the first argument. Useful in for expressions, e.g.
5555 for (arg = first_call_expr_arg (exp, &iter); arg;
5556 arg = next_call_expr_arg (&iter)) */
5558 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5560 init_call_expr_arg_iterator (exp, iter);
5561 return next_call_expr_arg (iter);
5564 static inline const_tree
5565 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5567 init_const_call_expr_arg_iterator (exp, iter);
5568 return next_const_call_expr_arg (iter);
5571 /* Test whether there are more arguments in abstract argument list iterator
5572 ITER, without changing its state. */
5574 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5576 return (iter->i < iter->n);
5580 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5582 return (iter->i < iter->n);
5585 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5586 (of type call_expr_arg_iterator) to hold the iteration state. */
5587 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5588 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5589 (arg) = next_call_expr_arg (&(iter)))
5591 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5592 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5593 (arg) = next_const_call_expr_arg (&(iter)))
5595 /* Return true if tree node T is a language-specific node. */
5597 is_lang_specific (tree t)
5599 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5602 /* In gimple-low.c. */
5603 extern bool block_may_fallthru (const_tree);
5605 #endif /* GCC_TREE_H */