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"
35 /* Codes of tree nodes */
37 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
38 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
41 #include "all-tree.def"
46 #undef END_OF_BASE_TREE_CODES
48 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
49 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
51 /* Number of language-independent tree codes. */
52 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
54 /* Tree code classes. */
56 /* Each tree_code has an associated code class represented by a
59 enum tree_code_class {
60 tcc_exceptional, /* An exceptional code (fits no category). */
61 tcc_constant, /* A constant. */
62 /* Order of tcc_type and tcc_declaration is important. */
63 tcc_type, /* A type object code. */
64 tcc_declaration, /* A declaration (also serving as variable refs). */
65 tcc_reference, /* A reference to storage. */
66 tcc_comparison, /* A comparison expression. */
67 tcc_unary, /* A unary arithmetic expression. */
68 tcc_binary, /* A binary arithmetic expression. */
69 tcc_statement, /* A statement expression, which have side effects
70 but usually no interesting value. */
71 tcc_vl_exp, /* A function call or other expression with a
72 variable-length operand vector. */
73 tcc_expression /* Any other expression. */
76 /* Each tree code class has an associated string representation.
77 These must correspond to the tree_code_class entries. */
79 extern const char *const tree_code_class_strings[];
81 /* Returns the string representing CLASS. */
83 #define TREE_CODE_CLASS_STRING(CLASS)\
84 tree_code_class_strings[(int) (CLASS)]
86 extern const enum tree_code_class tree_code_type[];
87 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
89 /* Nonzero if CODE represents an exceptional code. */
91 #define EXCEPTIONAL_CLASS_P(CODE)\
92 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
94 /* Nonzero if CODE represents a constant. */
96 #define CONSTANT_CLASS_P(CODE)\
97 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
99 /* Nonzero if CODE represents a type. */
101 #define TYPE_P(CODE)\
102 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
104 /* Nonzero if CODE represents a declaration. */
106 #define DECL_P(CODE)\
107 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
109 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
111 #define VAR_OR_FUNCTION_DECL_P(DECL)\
112 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
114 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
115 ascending code order. */
117 #define INDIRECT_REF_P(CODE)\
118 (TREE_CODE (CODE) == INDIRECT_REF \
119 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
120 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
122 /* Nonzero if CODE represents a reference. */
124 #define REFERENCE_CLASS_P(CODE)\
125 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
127 /* Nonzero if CODE represents a comparison. */
129 #define COMPARISON_CLASS_P(CODE)\
130 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
132 /* Nonzero if CODE represents a unary arithmetic expression. */
134 #define UNARY_CLASS_P(CODE)\
135 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
137 /* Nonzero if CODE represents a binary arithmetic expression. */
139 #define BINARY_CLASS_P(CODE)\
140 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
142 /* Nonzero if CODE represents a statement expression. */
144 #define STATEMENT_CLASS_P(CODE)\
145 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
147 /* Nonzero if CODE represents a function call-like expression with a
148 variable-length operand vector. */
150 #define VL_EXP_CLASS_P(CODE)\
151 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
153 /* Nonzero if CODE represents any other expression. */
155 #define EXPRESSION_CLASS_P(CODE)\
156 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
158 /* Returns nonzero iff CODE represents a type or declaration. */
160 #define IS_TYPE_OR_DECL_P(CODE)\
161 (TYPE_P (CODE) || DECL_P (CODE))
163 /* Returns nonzero iff CLASS is the tree-code class of an
166 #define IS_EXPR_CODE_CLASS(CLASS)\
167 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
169 /* Returns nonzero iff NODE is an expression of some kind. */
171 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
173 /* Number of argument-words in each kind of tree-node. */
175 extern const unsigned char tree_code_length[];
176 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
178 /* Names of tree components. */
180 extern const char *const tree_code_name[];
182 /* We have to be able to tell cgraph about the needed-ness of the target
183 of an alias. This requires that the decl have been defined. Aliases
184 that precede their definition have to be queued for later processing. */
186 typedef struct GTY(()) alias_pair
192 /* Define gc'd vector type. */
193 DEF_VEC_O(alias_pair);
194 DEF_VEC_ALLOC_O(alias_pair,gc);
196 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
199 /* Classify which part of the compiler has defined a given builtin function.
200 Note that we assume below that this is no more than two bits. */
209 /* Names for the above. */
210 extern const char *const built_in_class_names[4];
212 /* Codes that identify the various built in functions
213 so that expand_call can identify them quickly. */
215 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
216 enum built_in_function
218 #include "builtins.def"
220 /* Complex division routines in libgcc. These are done via builtins
221 because emit_library_call_value can't handle complex values. */
222 BUILT_IN_COMPLEX_MUL_MIN,
223 BUILT_IN_COMPLEX_MUL_MAX
224 = BUILT_IN_COMPLEX_MUL_MIN
225 + MAX_MODE_COMPLEX_FLOAT
226 - MIN_MODE_COMPLEX_FLOAT,
228 BUILT_IN_COMPLEX_DIV_MIN,
229 BUILT_IN_COMPLEX_DIV_MAX
230 = BUILT_IN_COMPLEX_DIV_MIN
231 + MAX_MODE_COMPLEX_FLOAT
232 - MIN_MODE_COMPLEX_FLOAT,
234 /* Upper bound on non-language-specific builtins. */
239 /* Names for the above. */
240 extern const char * built_in_names[(int) END_BUILTINS];
242 /* Helper macros for math builtins. */
244 #define BUILTIN_EXP10_P(FN) \
245 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
246 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
248 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
249 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
250 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
252 #define BUILTIN_SQRT_P(FN) \
253 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
255 #define BUILTIN_CBRT_P(FN) \
256 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
258 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
260 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
261 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
262 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
264 /* An array of _DECL trees for the above. */
265 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
266 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
268 /* In an OMP_CLAUSE node. */
270 /* Number of operands and names for each clause. */
271 extern unsigned const char omp_clause_num_ops[];
272 extern const char * const omp_clause_code_name[];
274 /* Clause codes. Do not reorder, as this is used to index into the tables
275 omp_clause_num_ops and omp_clause_code_name. */
278 /* Clause zero is special-cased inside the parser
279 (c_parser_omp_variable_list). */
280 OMP_CLAUSE_ERROR = 0,
282 /* OpenMP clause: private (variable_list). */
285 /* OpenMP clause: shared (variable_list). */
288 /* OpenMP clause: firstprivate (variable_list). */
289 OMP_CLAUSE_FIRSTPRIVATE,
291 /* OpenMP clause: lastprivate (variable_list). */
292 OMP_CLAUSE_LASTPRIVATE,
294 /* OpenMP clause: reduction (operator:variable_list).
295 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
296 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
297 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
299 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
300 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
301 OMP_CLAUSE_REDUCTION,
303 /* OpenMP clause: copyin (variable_list). */
306 /* OpenMP clause: copyprivate (variable_list). */
307 OMP_CLAUSE_COPYPRIVATE,
309 /* OpenMP clause: if (scalar-expression). */
312 /* OpenMP clause: num_threads (integer-expression). */
313 OMP_CLAUSE_NUM_THREADS,
315 /* OpenMP clause: schedule. */
318 /* OpenMP clause: nowait. */
321 /* OpenMP clause: ordered. */
324 /* OpenMP clause: default. */
327 /* OpenMP clause: collapse (constant-integer-expression). */
330 /* OpenMP clause: untied. */
334 /* The definition of tree nodes fills the next several pages. */
336 /* A tree node can represent a data type, a variable, an expression
337 or a statement. Each node has a TREE_CODE which says what kind of
338 thing it represents. Some common codes are:
339 INTEGER_TYPE -- represents a type of integers.
340 ARRAY_TYPE -- represents a type of pointer.
341 VAR_DECL -- represents a declared variable.
342 INTEGER_CST -- represents a constant integer value.
343 PLUS_EXPR -- represents a sum (an expression).
345 As for the contents of a tree node: there are some fields
346 that all nodes share. Each TREE_CODE has various special-purpose
347 fields as well. The fields of a node are never accessed directly,
348 always through accessor macros. */
350 /* Every kind of tree node starts with this structure,
351 so all nodes have these fields.
353 See the accessor macros, defined below, for documentation of the
356 struct GTY(()) tree_base {
357 ENUM_BITFIELD(tree_code) code : 16;
359 unsigned side_effects_flag : 1;
360 unsigned constant_flag : 1;
361 unsigned addressable_flag : 1;
362 unsigned volatile_flag : 1;
363 unsigned readonly_flag : 1;
364 unsigned unsigned_flag : 1;
365 unsigned asm_written_flag: 1;
366 unsigned nowarning_flag : 1;
368 unsigned used_flag : 1;
369 unsigned nothrow_flag : 1;
370 unsigned static_flag : 1;
371 unsigned public_flag : 1;
372 unsigned private_flag : 1;
373 unsigned protected_flag : 1;
374 unsigned deprecated_flag : 1;
375 unsigned saturating_flag : 1;
377 unsigned default_def_flag : 1;
378 unsigned lang_flag_0 : 1;
379 unsigned lang_flag_1 : 1;
380 unsigned lang_flag_2 : 1;
381 unsigned lang_flag_3 : 1;
382 unsigned lang_flag_4 : 1;
383 unsigned lang_flag_5 : 1;
384 unsigned lang_flag_6 : 1;
386 unsigned visited : 1;
387 unsigned packed_flag : 1;
388 unsigned user_align : 1;
392 /* This field is only used with type nodes; the only reason it is present
393 in tree_base instead of tree_type is to save space. The size of the
394 field must be large enough to hold addr_space_t values. */
395 unsigned address_space : 8;
398 struct GTY(()) tree_common {
399 struct tree_base base;
404 /* The following table lists the uses of each of the above flags and
405 for which types of nodes they are defined.
410 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
412 CONSTRUCTOR, IDENTIFIER_NODE
413 STMT_EXPR, it means we want the result of the enclosed expression
415 CALL_EXPR_TAILCALL in
424 VAR_DECL, FUNCTION_DECL
427 TREE_NO_TRAMPOLINE in
433 TREE_SYMBOL_REFERENCED in
437 TARGET_EXPR, WITH_CLEANUP_EXPR
439 TRY_CATCH_IS_CLEANUP in
445 TYPE_REF_CAN_ALIAS_ALL in
446 POINTER_TYPE, REFERENCE_TYPE
454 CALL_CANNOT_INLINE_P in
463 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
466 VAR_DECL, FUNCTION_DECL
472 CALL_EXPR_VA_ARG_PACK in
475 TYPE_CACHED_VALUES_P in
478 SAVE_EXPR_RESOLVED_P in
481 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
482 OMP_CLAUSE_LASTPRIVATE
484 OMP_CLAUSE_PRIVATE_DEBUG in
492 CALL_EXPR_RETURN_SLOT_OPT in
498 OMP_PARALLEL_COMBINED in
500 OMP_CLAUSE_PRIVATE_OUTER_REF in
503 TYPE_REF_IS_RVALUE in
527 TREE_THIS_VOLATILE in
550 TYPE_SIZES_GIMPLIFIED in
561 REGISTER_DEFS_IN_THIS_STMT in
562 all expressions (tree-into-ssa.c)
567 VAR_DECL, FUNCTION_DECL
568 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
569 BLOCK, SSA_NAME, STRING_CST
572 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
591 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
599 IDENTIFIER_TRANSPARENT_ALIAS in
602 STMT_IN_SSA_EDGE_WORKLIST in
603 all expressions (tree-ssa-propagate.c)
608 all trees (used liberally by many passes)
623 TYPE_VECTOR_OPAQUE in
626 SSA_NAME_IS_DEFAULT_DEF in
631 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
632 enum tree_node_structure_enum {
633 #include "treestruct.def"
638 /* Define accessors for the fields that all tree nodes have
639 (though some fields are not used for all kinds of nodes). */
641 /* The tree-code says what kind of node it is.
642 Codes are defined in tree.def. */
643 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
644 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
646 /* When checking is enabled, errors will be generated if a tree node
647 is accessed incorrectly. The macros die with a fatal error. */
648 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
650 #define TREE_CHECK(T, CODE) __extension__ \
651 ({ __typeof (T) const __t = (T); \
652 if (TREE_CODE (__t) != (CODE)) \
653 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
657 #define TREE_NOT_CHECK(T, CODE) __extension__ \
658 ({ __typeof (T) const __t = (T); \
659 if (TREE_CODE (__t) == (CODE)) \
660 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
664 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
665 ({ __typeof (T) const __t = (T); \
666 if (TREE_CODE (__t) != (CODE1) \
667 && TREE_CODE (__t) != (CODE2)) \
668 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
669 (CODE1), (CODE2), 0); \
672 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
673 ({ __typeof (T) const __t = (T); \
674 if (TREE_CODE (__t) == (CODE1) \
675 || TREE_CODE (__t) == (CODE2)) \
676 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
677 (CODE1), (CODE2), 0); \
680 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
681 ({ __typeof (T) const __t = (T); \
682 if (TREE_CODE (__t) != (CODE1) \
683 && TREE_CODE (__t) != (CODE2) \
684 && TREE_CODE (__t) != (CODE3)) \
685 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 (CODE1), (CODE2), (CODE3), 0); \
689 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
690 ({ __typeof (T) const __t = (T); \
691 if (TREE_CODE (__t) == (CODE1) \
692 || TREE_CODE (__t) == (CODE2) \
693 || TREE_CODE (__t) == (CODE3)) \
694 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
695 (CODE1), (CODE2), (CODE3), 0); \
698 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
699 ({ __typeof (T) const __t = (T); \
700 if (TREE_CODE (__t) != (CODE1) \
701 && TREE_CODE (__t) != (CODE2) \
702 && TREE_CODE (__t) != (CODE3) \
703 && TREE_CODE (__t) != (CODE4)) \
704 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
705 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
708 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
709 ({ __typeof (T) const __t = (T); \
710 if (TREE_CODE (__t) == (CODE1) \
711 || TREE_CODE (__t) == (CODE2) \
712 || TREE_CODE (__t) == (CODE3) \
713 || TREE_CODE (__t) == (CODE4)) \
714 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
715 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
718 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
719 ({ __typeof (T) const __t = (T); \
720 if (TREE_CODE (__t) != (CODE1) \
721 && TREE_CODE (__t) != (CODE2) \
722 && TREE_CODE (__t) != (CODE3) \
723 && TREE_CODE (__t) != (CODE4) \
724 && TREE_CODE (__t) != (CODE5)) \
725 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
726 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
729 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
730 ({ __typeof (T) const __t = (T); \
731 if (TREE_CODE (__t) == (CODE1) \
732 || TREE_CODE (__t) == (CODE2) \
733 || TREE_CODE (__t) == (CODE3) \
734 || TREE_CODE (__t) == (CODE4) \
735 || TREE_CODE (__t) == (CODE5)) \
736 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
737 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
740 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
741 ({ __typeof (T) const __t = (T); \
742 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
743 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
747 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
748 ({ __typeof (T) const __t = (T); \
749 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
750 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
754 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
755 ({ __typeof (T) const __t = (T); \
756 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
757 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
761 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
762 ({ __typeof (T) const __t = (T); \
763 if (TREE_CODE (__t) != OMP_CLAUSE) \
764 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
766 if (__t->omp_clause.code != (CODE)) \
767 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
771 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
772 ({ __typeof (T) const __t = (T); \
773 if (TREE_CODE (__t) != OMP_CLAUSE) \
774 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
776 if ((int) __t->omp_clause.code < (int) (CODE1) \
777 || (int) __t->omp_clause.code > (int) (CODE2)) \
778 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
779 __FUNCTION__, (CODE1), (CODE2)); \
782 /* These checks have to be special cased. */
783 #define EXPR_CHECK(T) __extension__ \
784 ({ __typeof (T) const __t = (T); \
785 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
786 if (!IS_EXPR_CODE_CLASS (__c)) \
787 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
791 /* These checks have to be special cased. */
792 #define NON_TYPE_CHECK(T) __extension__ \
793 ({ __typeof (T) const __t = (T); \
795 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
799 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
800 (*({__typeof (T) const __t = (T); \
801 const int __i = (I); \
802 if (TREE_CODE (__t) != TREE_VEC) \
803 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
805 if (__i < 0 || __i >= __t->vec.length) \
806 tree_vec_elt_check_failed (__i, __t->vec.length, \
807 __FILE__, __LINE__, __FUNCTION__); \
808 &__t->vec.a[__i]; }))
810 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
811 (*({__typeof (T) const __t = (T); \
812 const int __i = (I); \
813 if (TREE_CODE (__t) != OMP_CLAUSE) \
814 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
816 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
817 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
819 &__t->omp_clause.ops[__i]; }))
821 /* Special checks for TREE_OPERANDs. */
822 #define TREE_OPERAND_CHECK(T, I) __extension__ \
823 (*({__typeof (T) const __t = EXPR_CHECK (T); \
824 const int __i = (I); \
825 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
826 tree_operand_check_failed (__i, __t, \
827 __FILE__, __LINE__, __FUNCTION__); \
828 &__t->exp.operands[__i]; }))
830 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
831 (*({__typeof (T) const __t = (T); \
832 const int __i = (I); \
833 if (TREE_CODE (__t) != CODE) \
834 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
835 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
836 tree_operand_check_failed (__i, __t, \
837 __FILE__, __LINE__, __FUNCTION__); \
838 &__t->exp.operands[__i]; }))
840 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
842 ({__typeof (T) const __t = (T); \
843 const int __i = (I); \
844 if (TREE_CODE (__t) != (CODE)) \
845 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
846 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
847 tree_operand_check_failed (__i, __t, \
848 __FILE__, __LINE__, __FUNCTION__); \
849 &__t->exp.operands[__i]; }))
851 /* Nodes are chained together for many purposes.
852 Types are chained together to record them for being output to the debugger
853 (see the function `chain_type').
854 Decls in the same scope are chained together to record the contents
856 Statement nodes for successive statements used to be chained together.
857 Often lists of things are represented by TREE_LIST nodes that
858 are chained together. */
860 #define TREE_CHAIN(NODE) __extension__ \
861 (*({__typeof (NODE) const __t = (NODE); \
862 &__t->common.chain; }))
864 /* In all nodes that are expressions, this is the data type of the expression.
865 In POINTER_TYPE nodes, this is the type that the pointer points to.
866 In ARRAY_TYPE nodes, this is the type of the elements.
867 In VECTOR_TYPE nodes, this is the type of the elements. */
868 #define TREE_TYPE(NODE) __extension__ \
869 (*({__typeof (NODE) const __t = (NODE); \
870 &__t->common.type; }))
872 extern void tree_contains_struct_check_failed (const_tree,
873 const enum tree_node_structure_enum,
874 const char *, int, const char *)
877 extern void tree_check_failed (const_tree, const char *, int, const char *,
878 ...) ATTRIBUTE_NORETURN;
879 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
880 ...) ATTRIBUTE_NORETURN;
881 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
882 const char *, int, const char *)
884 extern void tree_range_check_failed (const_tree, const char *, int,
885 const char *, enum tree_code,
887 extern void tree_not_class_check_failed (const_tree,
888 const enum tree_code_class,
889 const char *, int, const char *)
891 extern void tree_vec_elt_check_failed (int, int, const char *,
894 extern void phi_node_elt_check_failed (int, int, const char *,
897 extern void tree_operand_check_failed (int, const_tree,
898 const char *, int, const char *)
900 extern void omp_clause_check_failed (const_tree, const char *, int,
901 const char *, enum omp_clause_code)
903 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
906 extern void omp_clause_range_check_failed (const_tree, const char *, int,
907 const char *, enum omp_clause_code,
908 enum omp_clause_code)
911 #else /* not ENABLE_TREE_CHECKING, or not gcc */
913 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
914 #define TREE_CHECK(T, CODE) (T)
915 #define TREE_NOT_CHECK(T, CODE) (T)
916 #define TREE_CHECK2(T, CODE1, CODE2) (T)
917 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
918 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
919 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
920 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
921 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
922 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
923 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
924 #define TREE_CLASS_CHECK(T, CODE) (T)
925 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
926 #define EXPR_CHECK(T) (T)
927 #define NON_TYPE_CHECK(T) (T)
928 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
929 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
930 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
931 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
932 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
933 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
934 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
936 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
937 #define TREE_TYPE(NODE) ((NODE)->common.type)
941 #define TREE_BLOCK(NODE) *(tree_block (NODE))
943 #include "tree-check.h"
945 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
946 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
947 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
948 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
949 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
950 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
951 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
952 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
953 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
954 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
955 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
957 #define RECORD_OR_UNION_CHECK(T) \
958 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
959 #define NOT_RECORD_OR_UNION_CHECK(T) \
960 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
962 #define NUMERICAL_TYPE_CHECK(T) \
963 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
966 /* Here is how primitive or already-canonicalized types' hash codes
968 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
970 /* A simple hash function for an arbitrary tree node. This must not be
971 used in hash tables which are saved to a PCH. */
972 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
974 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
975 #define CONVERT_EXPR_CODE_P(CODE) \
976 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
978 /* Similarly, but accept an expressions instead of a tree code. */
979 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
981 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
983 #define CASE_CONVERT \
987 /* Given an expression as a tree, strip any conversion that generates
988 no instruction. Accepts both tree and const_tree arguments since
989 we are not modifying the tree itself. */
991 #define STRIP_NOPS(EXP) \
992 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
994 /* Like STRIP_NOPS, but don't let the signedness change either. */
996 #define STRIP_SIGN_NOPS(EXP) \
997 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
999 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1001 #define STRIP_TYPE_NOPS(EXP) \
1002 while ((CONVERT_EXPR_P (EXP) \
1003 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1004 && TREE_OPERAND (EXP, 0) != error_mark_node \
1005 && (TREE_TYPE (EXP) \
1006 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1007 (EXP) = TREE_OPERAND (EXP, 0)
1009 /* Remove unnecessary type conversions according to
1010 tree_ssa_useless_type_conversion. */
1012 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1013 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1015 /* Nonzero if TYPE represents an integral type. Note that we do not
1016 include COMPLEX types here. Keep these checks in ascending code
1019 #define INTEGRAL_TYPE_P(TYPE) \
1020 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1021 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1022 || TREE_CODE (TYPE) == INTEGER_TYPE)
1024 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1026 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1027 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1029 /* Nonzero if TYPE represents a saturating fixed-point type. */
1031 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1032 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1034 /* Nonzero if TYPE represents a fixed-point type. */
1036 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1038 /* Nonzero if TYPE represents a scalar floating-point type. */
1040 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1042 /* Nonzero if TYPE represents a complex floating-point type. */
1044 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1045 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1046 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1048 /* Nonzero if TYPE represents a vector floating-point type. */
1050 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1051 (TREE_CODE (TYPE) == VECTOR_TYPE \
1052 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1054 /* Nonzero if TYPE represents a floating-point type, including complex
1055 and vector floating-point types. The vector and complex check does
1056 not use the previous two macros to enable early folding. */
1058 #define FLOAT_TYPE_P(TYPE) \
1059 (SCALAR_FLOAT_TYPE_P (TYPE) \
1060 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1061 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1062 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1064 /* Nonzero if TYPE represents a decimal floating-point type. */
1065 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1066 (SCALAR_FLOAT_TYPE_P (TYPE) \
1067 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1069 /* Nonzero if TYPE is a record or union type. */
1070 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1071 (TREE_CODE (TYPE) == RECORD_TYPE \
1072 || TREE_CODE (TYPE) == UNION_TYPE \
1073 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1075 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1076 Keep these checks in ascending code order. */
1078 #define AGGREGATE_TYPE_P(TYPE) \
1079 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1081 /* Nonzero if TYPE represents a pointer or reference type.
1082 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1083 ascending code order. */
1085 #define POINTER_TYPE_P(TYPE) \
1086 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1088 /* Nonzero if this type is a complete type. */
1089 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1091 /* Nonzero if this type is the (possibly qualified) void type. */
1092 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1094 /* Nonzero if this type is complete or is cv void. */
1095 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1096 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1098 /* Nonzero if this type is complete or is an array with unspecified bound. */
1099 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1100 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1103 /* Define many boolean fields that all tree nodes have. */
1105 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1106 of this is needed. So it cannot be in a register.
1107 In a FUNCTION_DECL, nonzero means its address is needed.
1108 So it must be compiled even if it is an inline function.
1109 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1110 In LABEL_DECL nodes, it means a goto for this label has been seen
1111 from a place outside all binding contours that restore stack levels.
1112 In ..._TYPE nodes, it means that objects of this type must be fully
1113 addressable. This means that pieces of this object cannot go into
1114 register parameters, for example. If this a function type, this
1115 means that the value must be returned in memory.
1116 In IDENTIFIER_NODEs, this means that some extern decl for this name
1117 had its address taken. That matters for inline functions. */
1118 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1120 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1121 exit of a function. Calls for which this is true are candidates for tail
1122 call optimizations. */
1123 #define CALL_EXPR_TAILCALL(NODE) \
1124 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1126 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1127 CASE_LOW operand has been processed. */
1128 #define CASE_LOW_SEEN(NODE) \
1129 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1131 #define PREDICT_EXPR_OUTCOME(NODE) \
1132 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1133 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1134 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1135 #define PREDICT_EXPR_PREDICTOR(NODE) \
1136 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1138 /* In a VAR_DECL, nonzero means allocate static storage.
1139 In a FUNCTION_DECL, nonzero if function has been defined.
1140 In a CONSTRUCTOR, nonzero means allocate static storage. */
1141 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1143 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1144 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1146 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1147 should only be executed if an exception is thrown, not on normal exit
1149 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1151 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1152 separate cleanup in honor_protect_cleanup_actions. */
1153 #define TRY_CATCH_IS_CLEANUP(NODE) \
1154 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1156 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1157 CASE_HIGH operand has been processed. */
1158 #define CASE_HIGH_SEEN(NODE) \
1159 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1161 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1162 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1164 /* Used to mark scoped enums. */
1165 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1167 /* In an expr node (usually a conversion) this means the node was made
1168 implicitly and should not lead to any sort of warning. In a decl node,
1169 warnings concerning the decl should be suppressed. This is used at
1170 least for used-before-set warnings, and it set after one warning is
1172 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1174 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1175 this string as an argument. */
1176 #define TREE_SYMBOL_REFERENCED(NODE) \
1177 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1179 /* Nonzero in a pointer or reference type means the data pointed to
1180 by this type can alias anything. */
1181 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1182 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1184 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1185 #define MOVE_NONTEMPORAL(NODE) \
1186 (EXPR_CHECK (NODE)->base.static_flag)
1188 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1189 there was an overflow in folding. */
1191 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1193 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1195 #define TREE_OVERFLOW_P(EXPR) \
1196 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1198 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1199 nonzero means name is to be accessible from outside this translation unit.
1200 In an IDENTIFIER_NODE, nonzero means an external declaration
1201 accessible from outside this translation unit was previously seen
1202 for this name in an inner scope. */
1203 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1205 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1206 of cached values, or is something else. */
1207 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1209 /* In a SAVE_EXPR, indicates that the original expression has already
1210 been substituted with a VAR_DECL that contains the value. */
1211 #define SAVE_EXPR_RESOLVED_P(NODE) \
1212 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1214 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1216 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1217 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1219 /* In any expression, decl, or constant, nonzero means it has side effects or
1220 reevaluation of the whole expression could produce a different value.
1221 This is set if any subexpression is a function call, a side effect or a
1222 reference to a volatile variable. In a ..._DECL, this is set only if the
1223 declaration said `volatile'. This will never be set for a constant. */
1224 #define TREE_SIDE_EFFECTS(NODE) \
1225 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1227 /* In a LABEL_DECL, nonzero means this label had its address taken
1228 and therefore can never be deleted and is a jump target for
1230 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1232 /* Nonzero means this expression is volatile in the C sense:
1233 its address should be of type `volatile WHATEVER *'.
1234 In other words, the declared item is volatile qualified.
1235 This is used in _DECL nodes and _REF nodes.
1236 On a FUNCTION_DECL node, this means the function does not
1237 return normally. This is the same effect as setting
1238 the attribute noreturn on the function in C.
1240 In a ..._TYPE node, means this type is volatile-qualified.
1241 But use TYPE_VOLATILE instead of this macro when the node is a type,
1242 because eventually we may make that a different bit.
1244 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1245 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1247 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1248 accessing the memory pointed to won't generate a trap. However,
1249 this only applies to an object when used appropriately: it doesn't
1250 mean that writing a READONLY mem won't trap. Similarly for
1251 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1253 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1254 (or slice of the array) always belongs to the range of the array.
1255 I.e. that the access will not trap, provided that the access to
1256 the base to the array will not trap. */
1257 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1259 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1260 nonzero means it may not be the lhs of an assignment.
1261 Nonzero in a FUNCTION_DECL means this function should be treated
1262 as "const" function (can only read its arguments). */
1263 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1265 /* Value of expression is constant. Always on in all ..._CST nodes. May
1266 also appear in an expression or decl where the value is constant. */
1267 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1269 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1270 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1271 (TYPE_CHECK (NODE)->base.constant_flag)
1273 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1274 #define DECL_UNSIGNED(NODE) \
1275 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1277 /* In integral and pointer types, means an unsigned type. */
1278 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1280 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1281 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1282 This is interesting in an inline function, since it might not need
1283 to be compiled separately.
1284 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1285 if the debugging info for the type has been written.
1286 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1287 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1289 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1291 /* Nonzero in a _DECL if the name is used in its scope.
1292 Nonzero in an expr node means inhibit warning if value is unused.
1293 In IDENTIFIER_NODEs, this means that some extern decl for this name
1295 In a BLOCK, this means that the block contains variables that are used. */
1296 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1298 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1299 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1300 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1302 /* In a CALL_EXPR, means that it's safe to use the target of the call
1303 expansion as the return slot for a call that returns in memory. */
1304 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1305 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1307 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1308 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1310 #define DECL_BY_REFERENCE(NODE) \
1311 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1312 RESULT_DECL)->decl_common.decl_by_reference_flag)
1314 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1315 can be used as restricted tag to disambiguate against other restrict
1316 pointers. Used by fortran to capture something like non-addressability
1317 (which it isn't really because the middle-end does take addresses of
1319 #define DECL_RESTRICTED_P(NODE) \
1320 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1321 RESULT_DECL)->decl_common.decl_restricted_flag)
1323 #define DECL_READ_P(NODE) \
1324 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1326 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1327 thunked-to function. */
1328 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1330 /* In a type, nonzero means that all objects of the type are guaranteed by the
1331 language or front-end to be properly aligned, so we can indicate that a MEM
1332 of this type is aligned at least to the alignment of the type, even if it
1333 doesn't appear that it is. We see this, for example, in object-oriented
1334 languages where a tag field may show this is an object of a more-aligned
1335 variant of the more generic type.
1337 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1339 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1341 /* Used in classes in C++. */
1342 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1343 /* Used in classes in C++. */
1344 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1346 /* True if reference type NODE is a C++ rvalue reference. */
1347 #define TYPE_REF_IS_RVALUE(NODE) \
1348 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1350 /* Nonzero in a _DECL if the use of the name is defined as a
1351 deprecated feature by __attribute__((deprecated)). */
1352 #define TREE_DEPRECATED(NODE) \
1353 ((NODE)->base.deprecated_flag)
1355 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1356 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1357 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1358 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1360 /* In fixed-point types, means a saturating type. */
1361 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1363 /* These flags are available for each language front end to use internally. */
1364 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1365 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1366 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1367 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1368 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1369 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1370 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1372 /* Define additional fields and accessors for nodes representing constants. */
1374 /* In an INTEGER_CST node. These two together make a 2-word integer.
1375 If the data type is signed, the value is sign-extended to 2 words
1376 even though not all of them may really be in use.
1377 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1378 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1379 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1380 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1382 #define INT_CST_LT(A, B) \
1383 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1384 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1385 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1387 #define INT_CST_LT_UNSIGNED(A, B) \
1388 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1389 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1390 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1391 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1392 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1394 struct GTY(()) tree_int_cst {
1395 struct tree_common common;
1399 /* In a REAL_CST node. struct real_value is an opaque entity, with
1400 manipulators defined in real.h. We don't want tree.h depending on
1401 real.h and transitively on tm.h. */
1404 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1405 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1407 struct GTY(()) tree_real_cst {
1408 struct tree_common common;
1409 struct real_value * real_cst_ptr;
1412 /* In a FIXED_CST node. */
1415 #define TREE_FIXED_CST_PTR(NODE) \
1416 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1417 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1419 struct GTY(()) tree_fixed_cst {
1420 struct tree_common common;
1421 struct fixed_value * fixed_cst_ptr;
1424 /* In a STRING_CST */
1425 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1426 #define TREE_STRING_POINTER(NODE) \
1427 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1429 struct GTY(()) tree_string {
1430 struct tree_common common;
1435 /* In a COMPLEX_CST node. */
1436 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1437 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1439 struct GTY(()) tree_complex {
1440 struct tree_common common;
1445 /* In a VECTOR_CST node. */
1446 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1448 struct GTY(()) tree_vector {
1449 struct tree_common common;
1455 /* Define fields and accessors for some special-purpose tree nodes. */
1457 #define IDENTIFIER_LENGTH(NODE) \
1458 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1459 #define IDENTIFIER_POINTER(NODE) \
1460 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1461 #define IDENTIFIER_HASH_VALUE(NODE) \
1462 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1464 /* Translate a hash table identifier pointer to a tree_identifier
1465 pointer, and vice versa. */
1467 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1468 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1469 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1471 struct GTY(()) tree_identifier {
1472 struct tree_common common;
1473 struct ht_identifier id;
1476 /* In a TREE_LIST node. */
1477 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1478 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1480 struct GTY(()) tree_list {
1481 struct tree_common common;
1486 /* In a TREE_VEC node. */
1487 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1488 #define TREE_VEC_END(NODE) \
1489 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1491 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1493 struct GTY(()) tree_vec {
1494 struct tree_common common;
1496 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1499 /* In a CONSTRUCTOR node. */
1500 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1501 #define CONSTRUCTOR_ELT(NODE,IDX) \
1502 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1503 #define CONSTRUCTOR_NELTS(NODE) \
1504 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1506 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1507 value of each element (stored within VAL). IX must be a scratch variable
1508 of unsigned integer type. */
1509 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1510 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1512 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1516 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1517 the value of each element (stored within VAL) and its index (stored
1518 within INDEX). IX must be a scratch variable of unsigned integer type. */
1519 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1520 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1522 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1523 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1527 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1528 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1530 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1531 _ce___->index = INDEX; \
1532 _ce___->value = VALUE; \
1535 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1536 constructor output purposes. */
1537 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1538 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1540 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1541 element. INDEX can optionally design the position of VALUE: in arrays,
1542 it is the index where VALUE has to be placed; in structures, it is the
1543 FIELD_DECL of the member. */
1544 typedef struct GTY(()) constructor_elt_d {
1549 DEF_VEC_O(constructor_elt);
1550 DEF_VEC_ALLOC_O(constructor_elt,gc);
1552 struct GTY(()) tree_constructor {
1553 struct tree_common common;
1554 VEC(constructor_elt,gc) *elts;
1557 /* Define fields and accessors for some nodes that represent expressions. */
1559 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1560 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1561 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1562 && integer_zerop (TREE_OPERAND (NODE, 0)))
1564 /* In ordinary expression nodes. */
1565 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1566 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1568 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1569 length. Its value includes the length operand itself; that is,
1570 the minimum valid length is 1.
1571 Note that we have to bypass the use of TREE_OPERAND to access
1572 that field to avoid infinite recursion in expanding the macros. */
1573 #define VL_EXP_OPERAND_LENGTH(NODE) \
1574 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1576 /* Nonzero if is_gimple_debug() may possibly hold. */
1577 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1579 /* In a LOOP_EXPR node. */
1580 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1582 /* The source location of this expression. Non-tree_exp nodes such as
1583 decls and constants can be shared among multiple locations, so
1585 #define EXPR_LOCATION(NODE) \
1586 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1587 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1588 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1589 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1590 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1592 /* True if a tree is an expression or statement that can have a
1594 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1596 extern void protected_set_expr_location (tree, location_t);
1598 /* In a TARGET_EXPR node. */
1599 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1600 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1601 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1603 /* DECL_EXPR accessor. This gives access to the DECL associated with
1604 the given declaration statement. */
1605 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1607 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1609 /* COMPOUND_LITERAL_EXPR accessors. */
1610 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1611 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1612 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1613 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1615 /* SWITCH_EXPR accessors. These give access to the condition, body and
1616 original condition type (before any compiler conversions)
1617 of the switch statement, respectively. */
1618 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1619 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1620 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1622 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1623 of a case label, respectively. */
1624 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1625 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1626 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1628 /* The operands of a TARGET_MEM_REF. */
1629 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1630 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1631 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1632 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1633 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1634 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1636 /* The operands of a BIND_EXPR. */
1637 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1638 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1639 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1641 /* GOTO_EXPR accessor. This gives access to the label associated with
1642 a goto statement. */
1643 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1645 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1646 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1647 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1649 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1650 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1651 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1652 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1653 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1654 /* Nonzero if we want to create an ASM_INPUT instead of an
1655 ASM_OPERAND with no operands. */
1656 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1657 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1659 /* COND_EXPR accessors. */
1660 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1661 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1662 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1664 /* Accessors for the chains of recurrences. */
1665 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1666 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1667 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1668 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1670 /* LABEL_EXPR accessor. This gives access to the label associated with
1671 the given label expression. */
1672 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1674 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1675 accessors for SSA operands. */
1677 /* CATCH_EXPR accessors. */
1678 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1679 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1681 /* EH_FILTER_EXPR accessors. */
1682 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1683 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1685 /* OBJ_TYPE_REF accessors. */
1686 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1687 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1688 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1690 /* ASSERT_EXPR accessors. */
1691 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1692 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1694 /* CALL_EXPR accessors.
1696 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1697 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1698 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1699 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1701 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1702 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1703 the argument count is zero when checking is enabled. Instead, do
1704 the pointer arithmetic to advance past the 3 fixed operands in a
1705 CALL_EXPR. That produces a valid pointer to just past the end of the
1706 operand array, even if it's not valid to dereference it. */
1707 #define CALL_EXPR_ARGP(NODE) \
1708 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1710 /* OpenMP directive and clause accessors. */
1712 #define OMP_BODY(NODE) \
1713 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1714 #define OMP_CLAUSES(NODE) \
1715 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1717 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1718 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1720 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1721 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1723 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1724 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1725 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1727 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1728 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1729 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1730 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1731 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1732 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1734 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1735 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1737 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1739 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1740 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1742 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1744 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1746 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1747 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1749 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1750 #define OMP_CLAUSE_DECL(NODE) \
1751 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1752 OMP_CLAUSE_PRIVATE, \
1753 OMP_CLAUSE_COPYPRIVATE), 0)
1754 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1755 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1756 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1758 /* True on an OMP_SECTION statement that was the last lexical member.
1759 This status is meaningful in the implementation of lastprivate. */
1760 #define OMP_SECTION_LAST(NODE) \
1761 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1763 /* True on an OMP_PARALLEL statement if it represents an explicit
1764 combined parallel work-sharing constructs. */
1765 #define OMP_PARALLEL_COMBINED(NODE) \
1766 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1768 /* True on a PRIVATE clause if its decl is kept around for debugging
1769 information only and its DECL_VALUE_EXPR is supposed to point
1770 to what it has been remapped to. */
1771 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1772 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1774 /* True on a PRIVATE clause if ctor needs access to outer region's
1776 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1777 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1779 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1780 decl is present in the chain. */
1781 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1782 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1783 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1784 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1785 OMP_CLAUSE_LASTPRIVATE),\
1787 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1788 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1790 #define OMP_CLAUSE_IF_EXPR(NODE) \
1791 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1792 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1793 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1794 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1795 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1797 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1798 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1799 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1800 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1801 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1802 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1804 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1805 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1806 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1807 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1808 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1809 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1810 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1811 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1812 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1813 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1814 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1815 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1817 enum omp_clause_schedule_kind
1819 OMP_CLAUSE_SCHEDULE_STATIC,
1820 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1821 OMP_CLAUSE_SCHEDULE_GUIDED,
1822 OMP_CLAUSE_SCHEDULE_AUTO,
1823 OMP_CLAUSE_SCHEDULE_RUNTIME
1826 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1827 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1829 enum omp_clause_default_kind
1831 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1832 OMP_CLAUSE_DEFAULT_SHARED,
1833 OMP_CLAUSE_DEFAULT_NONE,
1834 OMP_CLAUSE_DEFAULT_PRIVATE,
1835 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1838 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1839 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1841 struct GTY(()) tree_exp {
1842 struct tree_common common;
1845 tree GTY ((special ("tree_exp"),
1846 desc ("TREE_CODE ((tree) &%0)")))
1850 /* SSA_NAME accessors. */
1852 /* Returns the variable being referenced. Once released, this is the
1853 only field that can be relied upon. */
1854 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1856 /* Returns the statement which defines this SSA name. */
1857 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1859 /* Returns the SSA version number of this SSA name. Note that in
1860 tree SSA, version numbers are not per variable and may be recycled. */
1861 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1863 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1864 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1866 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1867 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1869 /* Nonzero if this SSA_NAME expression is currently on the free list of
1870 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1871 has no meaning for an SSA_NAME. */
1872 #define SSA_NAME_IN_FREE_LIST(NODE) \
1873 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1875 /* Nonzero if this SSA_NAME is the default definition for the
1876 underlying symbol. A default SSA name is created for symbol S if
1877 the very first reference to S in the function is a read operation.
1878 Default definitions are always created by an empty statement and
1879 belong to no basic block. */
1880 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1881 SSA_NAME_CHECK (NODE)->base.default_def_flag
1883 /* Attributes for SSA_NAMEs for pointer-type variables. */
1884 #define SSA_NAME_PTR_INFO(N) \
1885 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1887 #ifndef _TREE_FLOW_H
1888 struct ptr_info_def;
1893 /* Immediate use linking structure. This structure is used for maintaining
1894 a doubly linked list of uses of an SSA_NAME. */
1895 typedef struct GTY(()) ssa_use_operand_d {
1896 struct ssa_use_operand_d* GTY((skip(""))) prev;
1897 struct ssa_use_operand_d* GTY((skip(""))) next;
1898 /* Immediate uses for a given SSA name are maintained as a cyclic
1899 list. To recognize the root of this list, the location field
1900 needs to point to the original SSA name. Since statements and
1901 SSA names are of different data types, we need this union. See
1902 the explanation in struct immediate_use_iterator_d. */
1903 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1904 tree *GTY((skip(""))) use;
1905 } ssa_use_operand_t;
1907 /* Return the immediate_use information for an SSA_NAME. */
1908 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1910 struct GTY(()) tree_ssa_name {
1911 struct tree_common common;
1913 /* _DECL wrapped by this SSA name. */
1916 /* Statement that defines this SSA name. */
1919 /* SSA version number. */
1920 unsigned int version;
1922 /* Pointer attributes used for alias analysis. */
1923 struct ptr_info_def *ptr_info;
1925 /* Immediate uses list for this SSA_NAME. */
1926 struct ssa_use_operand_d imm_uses;
1929 struct GTY(()) phi_arg_d {
1930 /* imm_use MUST be the first element in struct because we do some
1931 pointer arithmetic with it. See phi_arg_index_from_use. */
1932 struct ssa_use_operand_d imm_use;
1938 #define OMP_CLAUSE_CODE(NODE) \
1939 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1941 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1942 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1944 #define OMP_CLAUSE_CODE(NODE) \
1945 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1947 #define OMP_CLAUSE_OPERAND(NODE, I) \
1948 OMP_CLAUSE_ELT_CHECK (NODE, I)
1950 struct GTY(()) tree_omp_clause {
1951 struct tree_common common;
1953 enum omp_clause_code code;
1954 union omp_clause_subcode {
1955 enum omp_clause_default_kind default_kind;
1956 enum omp_clause_schedule_kind schedule_kind;
1957 enum tree_code reduction_code;
1958 } GTY ((skip)) subcode;
1960 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1962 gimple_seq gimple_reduction_init;
1963 gimple_seq gimple_reduction_merge;
1965 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1969 /* In a BLOCK node. */
1970 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1971 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1972 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1973 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1974 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1975 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
1976 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1977 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1978 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1979 /* Note: when changing this, make sure to find the places
1980 that use chainon or nreverse. */
1981 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1982 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1983 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1985 /* An index number for this block. These values are not guaranteed to
1986 be unique across functions -- whether or not they are depends on
1987 the debugging output format in use. */
1988 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1990 /* If block reordering splits a lexical block into discontiguous
1991 address ranges, we'll make a copy of the original block.
1993 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1994 In that case, we have one source block that has been replicated
1995 (through inlining or unrolling) into many logical blocks, and that
1996 these logical blocks have different physical variables in them.
1998 In this case, we have one logical block split into several
1999 non-contiguous address ranges. Most debug formats can't actually
2000 represent this idea directly, so we fake it by creating multiple
2001 logical blocks with the same variables in them. However, for those
2002 that do support non-contiguous regions, these allow the original
2003 logical block to be reconstructed, along with the set of address
2006 One of the logical block fragments is arbitrarily chosen to be
2007 the ORIGIN. The other fragments will point to the origin via
2008 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2009 be null. The list of fragments will be chained through
2010 BLOCK_FRAGMENT_CHAIN from the origin. */
2012 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2013 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2015 /* For an inlined function, this gives the location where it was called
2016 from. This is only set in the top level block, which corresponds to the
2017 inlined function scope. This is used in the debug output routines. */
2019 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2021 struct GTY(()) tree_block {
2022 struct tree_common common;
2024 unsigned abstract_flag : 1;
2025 unsigned block_num : 31;
2030 VEC(tree,gc) *nonlocalized_vars;
2034 tree abstract_origin;
2035 tree fragment_origin;
2036 tree fragment_chain;
2039 /* Define fields and accessors for nodes representing data types. */
2041 /* See tree.def for documentation of the use of these fields.
2042 Look at the documentation of the various ..._TYPE tree codes.
2044 Note that the type.values, type.minval, and type.maxval fields are
2045 overloaded and used for different macros in different kinds of types.
2046 Each macro must check to ensure the tree node is of the proper kind of
2047 type. Note also that some of the front-ends also overload these fields,
2048 so they must be checked as well. */
2050 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2051 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2052 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2053 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2054 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2055 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2056 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2057 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2058 (INTEGER_TYPE_CHECK (NODE)->type.values \
2059 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2060 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2061 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2062 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2063 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2064 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2065 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2066 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2067 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2068 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2069 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2070 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2071 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2072 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2073 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2074 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2075 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2076 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2077 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2078 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2079 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2080 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2082 /* Vector types need to check target flags to determine type. */
2083 extern enum machine_mode vector_type_mode (const_tree);
2084 #define TYPE_MODE(NODE) \
2085 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2086 ? vector_type_mode (NODE) : (NODE)->type.mode)
2087 #define SET_TYPE_MODE(NODE, MODE) \
2088 (TYPE_CHECK (NODE)->type.mode = (MODE))
2090 /* The "canonical" type for this type node, which can be used to
2091 compare the type for equality with another type. If two types are
2092 equal (based on the semantics of the language), then they will have
2093 equivalent TYPE_CANONICAL entries.
2095 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2096 be used for comparison against other types. Instead, the type is
2097 said to require structural equality checks, described in
2098 TYPE_STRUCTURAL_EQUALITY_P. */
2099 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2100 /* Indicates that the type node requires structural equality
2101 checks. The compiler will need to look at the composition of the
2102 type to determine whether it is equal to another type, rather than
2103 just comparing canonical type pointers. For instance, we would need
2104 to look at the return and parameter types of a FUNCTION_TYPE
2106 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2107 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2108 type node requires structural equality. */
2109 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2110 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2111 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2112 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2114 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2115 in the debugging output. We use this to describe a vector as a
2116 structure containing an array. */
2117 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) \
2118 (VECTOR_TYPE_CHECK (NODE)->type.values)
2120 /* For record and union types, information about this type, as a base type
2122 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2124 /* For non record and union types, used in a language-dependent way. */
2125 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2127 /* The (language-specific) typed-based alias set for this type.
2128 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2129 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2130 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2131 type can alias objects of any type. */
2132 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2134 /* Nonzero iff the typed-based alias set for this type has been
2136 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2138 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2140 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2142 /* The alignment necessary for objects of this type.
2143 The value is an int, measured in bits. */
2144 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2146 /* 1 if the alignment for this type was requested by "aligned" attribute,
2147 0 if it is the default for this type. */
2148 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2150 /* The alignment for NODE, in bytes. */
2151 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2153 /* If your language allows you to declare types, and you want debug info
2154 for them, then you need to generate corresponding TYPE_DECL nodes.
2155 These "stub" TYPE_DECL nodes have no name, and simply point at the
2156 type node. You then set the TYPE_STUB_DECL field of the type node
2157 to point back at the TYPE_DECL node. This allows the debug routines
2158 to know that the two nodes represent the same type, so that we only
2159 get one debug info record for them. */
2160 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2162 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2163 has BLKmode only because it lacks the alignment requirement for
2165 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2167 /* In an INTEGER_TYPE, it means the type represents a size. We use
2168 this both for validity checking and to permit optimizations that
2169 are unsafe for other types. Note that the C `size_t' type should
2170 *not* have this flag set. The `size_t' type is simply a typedef
2171 for an ordinary integer type that happens to be the type of an
2172 expression returned by `sizeof'; `size_t' has no special
2173 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2174 always actual sizes. */
2175 #define TYPE_IS_SIZETYPE(NODE) \
2176 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2178 /* Nonzero in a type considered volatile as a whole. */
2179 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2181 /* Means this type is const-qualified. */
2182 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2184 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2186 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2188 /* The address space the type is in. */
2189 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2191 /* There is a TYPE_QUAL value for each type qualifier. They can be
2192 combined by bitwise-or to form the complete set of qualifiers for a
2195 #define TYPE_UNQUALIFIED 0x0
2196 #define TYPE_QUAL_CONST 0x1
2197 #define TYPE_QUAL_VOLATILE 0x2
2198 #define TYPE_QUAL_RESTRICT 0x4
2200 /* Encode/decode the named memory support as part of the qualifier. If more
2201 than 8 qualifiers are added, these macros need to be adjusted. */
2202 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2203 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2205 /* Return all qualifiers except for the address space qualifiers. */
2206 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2208 /* Only keep the address space out of the qualifiers and discard the other
2210 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2212 /* The set of type qualifiers for this type. */
2213 #define TYPE_QUALS(NODE) \
2214 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2215 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2216 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2217 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2219 /* The same as TYPE_QUALS without the address space qualifications. */
2220 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2221 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2222 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2223 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2225 /* These flags are available for each language front end to use internally. */
2226 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2227 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2228 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2229 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2230 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2231 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2232 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2234 /* Used to keep track of visited nodes in tree traversals. This is set to
2235 0 by copy_node and make_node. */
2236 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2238 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2239 that distinguish string from array of char).
2240 If set in a INTEGER_TYPE, indicates a character type. */
2241 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2243 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2244 object of the given ARRAY_TYPE. This allows temporaries to be
2246 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2247 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2249 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2250 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2251 (((unsigned HOST_WIDE_INT) 1) \
2252 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2254 /* Set precision to n when we have 2^n sub-parts of the vector. */
2255 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2256 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2258 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2259 about missing conversions to other vector types of the same size. */
2260 #define TYPE_VECTOR_OPAQUE(NODE) \
2261 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2263 /* Indicates that objects of this type must be initialized by calling a
2264 function when they are created. */
2265 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2266 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2268 /* Indicates that a UNION_TYPE object should be passed the same way that
2269 the first union alternative would be passed, or that a RECORD_TYPE
2270 object should be passed the same way that the first (and only) member
2272 #define TYPE_TRANSPARENT_AGGR(NODE) \
2273 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2275 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2276 address of a component of the type. This is the counterpart of
2277 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2278 #define TYPE_NONALIASED_COMPONENT(NODE) \
2279 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2281 /* Indicated that objects of this type should be laid out in as
2282 compact a way as possible. */
2283 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2285 /* Used by type_contains_placeholder_p to avoid recomputation.
2286 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2287 this field directly. */
2288 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2289 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2293 struct GTY(()) tree_type {
2294 struct tree_common common;
2301 unsigned int precision : 10;
2302 unsigned no_force_blk_flag : 1;
2303 unsigned needs_constructing_flag : 1;
2304 unsigned transparent_aggr_flag : 1;
2305 unsigned restrict_flag : 1;
2306 unsigned contains_placeholder_bits : 2;
2308 ENUM_BITFIELD(machine_mode) mode : 8;
2310 unsigned string_flag : 1;
2311 unsigned lang_flag_0 : 1;
2312 unsigned lang_flag_1 : 1;
2313 unsigned lang_flag_2 : 1;
2314 unsigned lang_flag_3 : 1;
2315 unsigned lang_flag_4 : 1;
2316 unsigned lang_flag_5 : 1;
2317 unsigned lang_flag_6 : 1;
2320 alias_set_type alias_set;
2323 union tree_type_symtab {
2324 int GTY ((tag ("0"))) address;
2325 const char * GTY ((tag ("1"))) pointer;
2326 struct die_struct * GTY ((tag ("2"))) die;
2327 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2328 descbits ("2"))) symtab;
2337 /* Points to a structure whose details depend on the language in use. */
2338 struct lang_type *lang_specific;
2341 /* Define accessor macros for information about type inheritance
2344 A "basetype" means a particular usage of a data type for inheritance
2345 in another type. Each such basetype usage has its own "binfo"
2346 object to describe it. The binfo object is a TREE_VEC node.
2348 Inheritance is represented by the binfo nodes allocated for a
2349 given type. For example, given types C and D, such that D is
2350 inherited by C, 3 binfo nodes will be allocated: one for describing
2351 the binfo properties of C, similarly one for D, and one for
2352 describing the binfo properties of D as a base type for C.
2353 Thus, given a pointer to class C, one can get a pointer to the binfo
2354 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2356 /* BINFO specific flags. */
2358 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2359 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2361 /* Flags for language dependent use. */
2362 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2363 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2364 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2365 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2366 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2367 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2368 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2370 /* The actual data type node being inherited in this basetype. */
2371 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2373 /* The offset where this basetype appears in its containing type.
2374 BINFO_OFFSET slot holds the offset (in bytes)
2375 from the base of the complete object to the base of the part of the
2376 object that is allocated on behalf of this `type'.
2377 This is always 0 except when there is multiple inheritance. */
2379 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2380 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2382 /* The virtual function table belonging to this basetype. Virtual
2383 function tables provide a mechanism for run-time method dispatching.
2384 The entries of a virtual function table are language-dependent. */
2386 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2388 /* The virtual functions in the virtual function table. This is
2389 a TREE_LIST that is used as an initial approximation for building
2390 a virtual function table for this basetype. */
2391 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2393 /* A vector of binfos for the direct basetypes inherited by this
2396 If this basetype describes type D as inherited in C, and if the
2397 basetypes of D are E and F, then this vector contains binfos for
2398 inheritance of E and F by C. */
2399 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2401 /* The number of basetypes for NODE. */
2402 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2404 /* Accessor macro to get to the Nth base binfo of this binfo. */
2405 #define BINFO_BASE_BINFO(NODE,N) \
2406 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2407 #define BINFO_BASE_ITERATE(NODE,N,B) \
2408 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2409 #define BINFO_BASE_APPEND(NODE,T) \
2410 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2412 /* For a BINFO record describing a virtual base class, i.e., one where
2413 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2414 base. The actual contents are language-dependent. In the C++
2415 front-end this field is an INTEGER_CST giving an offset into the
2416 vtable where the offset to the virtual base can be found. */
2417 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2419 /* Indicates the accesses this binfo has to its bases. The values are
2420 access_public_node, access_protected_node or access_private_node.
2421 If this array is not present, public access is implied. */
2422 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2424 #define BINFO_BASE_ACCESS(NODE,N) \
2425 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2426 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2427 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2429 /* The index in the VTT where this subobject's sub-VTT can be found.
2430 NULL_TREE if there is no sub-VTT. */
2431 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2433 /* The index in the VTT where the vptr for this subobject can be
2434 found. NULL_TREE if there is no secondary vptr in the VTT. */
2435 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2437 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2438 inheriting this base for non-virtual bases. For virtual bases it
2439 points either to the binfo for which this is a primary binfo, or to
2440 the binfo of the most derived type. */
2441 #define BINFO_INHERITANCE_CHAIN(NODE) \
2442 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2444 struct GTY (()) tree_binfo {
2445 struct tree_common common;
2451 VEC(tree,gc) *base_accesses;
2457 VEC(tree,none) base_binfos;
2461 /* Define fields and accessors for nodes representing declared names. */
2463 /* Nonzero if DECL represents a variable for the SSA passes. */
2464 #define SSA_VAR_P(DECL) \
2465 (TREE_CODE (DECL) == VAR_DECL \
2466 || TREE_CODE (DECL) == PARM_DECL \
2467 || TREE_CODE (DECL) == RESULT_DECL \
2468 || (TREE_CODE (DECL) == SSA_NAME \
2469 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2470 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2471 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2476 /* Enumerate visibility settings. */
2477 #ifndef SYMBOL_VISIBILITY_DEFINED
2478 #define SYMBOL_VISIBILITY_DEFINED
2479 enum symbol_visibility
2482 VISIBILITY_PROTECTED,
2491 /* This is the name of the object as written by the user.
2492 It is an IDENTIFIER_NODE. */
2493 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2495 /* Every ..._DECL node gets a unique number. */
2496 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2498 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2500 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2502 /* Every ..._DECL node gets a unique number that stays the same even
2503 when the decl is copied by the inliner once it is set. */
2504 #define DECL_PT_UID(NODE) \
2505 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2506 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2507 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2508 #define SET_DECL_PT_UID(NODE, UID) \
2509 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2510 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2511 be preserved when copyin the decl. */
2512 #define DECL_PT_UID_SET_P(NODE) \
2513 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2515 /* These two fields describe where in the source code the declaration
2516 was. If the declaration appears in several places (as for a C
2517 function that is declared first and then defined later), this
2518 information should refer to the definition. */
2519 #define DECL_SOURCE_LOCATION(NODE) \
2520 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2521 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2522 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2523 #define DECL_IS_BUILTIN(DECL) \
2524 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2526 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2527 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2528 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2529 nodes, this points to either the FUNCTION_DECL for the containing
2530 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2531 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2533 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2534 #define DECL_FIELD_CONTEXT(NODE) \
2535 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2536 struct GTY(()) tree_decl_minimal {
2537 struct tree_common common;
2545 /* For any sort of a ..._DECL node, this points to the original (abstract)
2546 decl node which this decl is an inlined/cloned instance of, or else it
2547 is NULL indicating that this decl is not an instance of some other decl.
2549 The C front-end also uses this in a nested declaration of an inline
2550 function, to point back to the definition. */
2551 #define DECL_ABSTRACT_ORIGIN(NODE) \
2552 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2554 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2555 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2556 #define DECL_ORIGIN(NODE) \
2557 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2559 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2560 inline instance of some original (abstract) decl from an inline function;
2561 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2562 nodes can also have their abstract origin set to themselves. */
2563 #define DECL_FROM_INLINE(NODE) \
2564 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2565 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2567 /* In a DECL this is the field where attributes are stored. */
2568 #define DECL_ATTRIBUTES(NODE) \
2569 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2571 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2572 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2573 For a VAR_DECL, holds the initial value.
2574 For a PARM_DECL, used for DECL_ARG_TYPE--default
2575 values for parameters are encoded in the type of the function,
2576 not in the PARM_DECL slot.
2577 For a FIELD_DECL, this is used for enumeration values and the C
2578 frontend uses it for temporarily storing bitwidth of bitfields.
2580 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2581 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2583 /* Holds the size of the datum, in bits, as a tree expression.
2584 Need not be constant. */
2585 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2586 /* Likewise for the size in bytes. */
2587 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2588 /* Holds the alignment required for the datum, in bits. */
2589 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2590 /* The alignment of NODE, in bytes. */
2591 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2592 /* Set if the alignment of this DECL has been set by the user, for
2593 example with an 'aligned' attribute. */
2594 #define DECL_USER_ALIGN(NODE) \
2595 (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2596 /* Holds the machine mode corresponding to the declaration of a variable or
2597 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2599 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2601 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2602 operation it is. Note, however, that this field is overloaded, with
2603 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2604 checked before any access to the former. */
2605 #define DECL_FUNCTION_CODE(NODE) \
2606 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2607 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2608 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2610 #define DECL_FUNCTION_PERSONALITY(NODE) \
2611 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2613 /* Nonzero for a given ..._DECL node means that the name of this node should
2614 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2615 the body of the function should also be ignored. */
2616 #define DECL_IGNORED_P(NODE) \
2617 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2619 /* Nonzero for a given ..._DECL node means that this node represents an
2620 "abstract instance" of the given declaration (e.g. in the original
2621 declaration of an inline function). When generating symbolic debugging
2622 information, we mustn't try to generate any address information for nodes
2623 marked as "abstract instances" because we don't actually generate
2624 any code or allocate any data space for such instances. */
2625 #define DECL_ABSTRACT(NODE) \
2626 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2628 /* Language-specific decl information. */
2629 #define DECL_LANG_SPECIFIC(NODE) \
2630 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2632 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2633 do not allocate storage, and refer to a definition elsewhere. Note that
2634 this does not necessarily imply the entity represented by NODE
2635 has no program source-level definition in this translation unit. For
2636 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2637 DECL_EXTERNAL may be true simultaneously; that can be the case for
2638 a C99 "extern inline" function. */
2639 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2641 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2642 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2644 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2646 Also set in some languages for variables, etc., outside the normal
2647 lexical scope, such as class instance variables. */
2648 #define DECL_NONLOCAL(NODE) \
2649 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2651 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2652 Used in FIELD_DECLs for vtable pointers.
2653 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2654 #define DECL_VIRTUAL_P(NODE) \
2655 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2657 /* Used to indicate that this DECL represents a compiler-generated entity. */
2658 #define DECL_ARTIFICIAL(NODE) \
2659 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2661 /* Additional flags for language-specific uses. */
2662 #define DECL_LANG_FLAG_0(NODE) \
2663 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2664 #define DECL_LANG_FLAG_1(NODE) \
2665 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2666 #define DECL_LANG_FLAG_2(NODE) \
2667 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2668 #define DECL_LANG_FLAG_3(NODE) \
2669 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2670 #define DECL_LANG_FLAG_4(NODE) \
2671 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2672 #define DECL_LANG_FLAG_5(NODE) \
2673 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2674 #define DECL_LANG_FLAG_6(NODE) \
2675 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2676 #define DECL_LANG_FLAG_7(NODE) \
2677 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2678 #define DECL_LANG_FLAG_8(NODE) \
2679 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2681 /* Nonzero for a decl which is at file scope. */
2682 #define DECL_FILE_SCOPE_P(EXP) \
2683 (! DECL_CONTEXT (EXP) \
2684 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2686 /* Nonzero for a decl that is decorated using attribute used.
2687 This indicates to compiler tools that this decl needs to be preserved. */
2688 #define DECL_PRESERVE_P(DECL) \
2689 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2691 /* For function local variables of COMPLEX and VECTOR types,
2692 indicates that the variable is not aliased, and that all
2693 modifications to the variable have been adjusted so that
2694 they are killing assignments. Thus the variable may now
2695 be treated as a GIMPLE register, and use real instead of
2696 virtual ops in SSA form. */
2697 #define DECL_GIMPLE_REG_P(DECL) \
2698 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2700 struct GTY(()) tree_decl_common {
2701 struct tree_decl_minimal common;
2704 ENUM_BITFIELD(machine_mode) mode : 8;
2706 unsigned nonlocal_flag : 1;
2707 unsigned virtual_flag : 1;
2708 unsigned ignored_flag : 1;
2709 unsigned abstract_flag : 1;
2710 unsigned artificial_flag : 1;
2711 unsigned preserve_flag: 1;
2712 unsigned debug_expr_is_from : 1;
2714 unsigned lang_flag_0 : 1;
2715 unsigned lang_flag_1 : 1;
2716 unsigned lang_flag_2 : 1;
2717 unsigned lang_flag_3 : 1;
2718 unsigned lang_flag_4 : 1;
2719 unsigned lang_flag_5 : 1;
2720 unsigned lang_flag_6 : 1;
2721 unsigned lang_flag_7 : 1;
2722 unsigned lang_flag_8 : 1;
2724 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2725 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2726 unsigned decl_flag_0 : 1;
2727 /* In FIELD_DECL, this is DECL_BIT_FIELD
2728 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2729 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2730 unsigned decl_flag_1 : 1;
2731 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2732 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2733 unsigned decl_flag_2 : 1;
2734 /* Logically, these two would go in a theoretical base shared by var and
2736 unsigned gimple_reg_flag : 1;
2737 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2738 unsigned decl_by_reference_flag : 1;
2739 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2740 unsigned decl_restricted_flag : 1;
2742 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2744 unsigned decl_read_flag : 1;
2746 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2747 unsigned decl_common_unused : 1;
2749 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2750 unsigned int off_align : 8;
2752 /* 24-bits unused. */
2754 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2757 /* UID for points-to sets, stable over copying from inlining. */
2758 unsigned int pt_uid;
2763 tree abstract_origin;
2765 /* Points to a structure whose details depend on the language in use. */
2766 struct lang_decl *lang_specific;
2769 extern tree decl_value_expr_lookup (tree);
2770 extern void decl_value_expr_insert (tree, tree);
2772 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2773 if transformations have made this more complicated than evaluating the
2774 decl itself. This should only be used for debugging; once this field has
2775 been set, the decl itself may not legitimately appear in the function. */
2776 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2777 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2778 #define DECL_VALUE_EXPR(NODE) \
2779 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2780 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2781 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2783 /* Holds the RTL expression for the value of a variable or function.
2784 This value can be evaluated lazily for functions, variables with
2785 static storage duration, and labels. */
2786 #define DECL_RTL(NODE) \
2787 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2788 ? (NODE)->decl_with_rtl.rtl \
2789 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2791 /* Set the DECL_RTL for NODE to RTL. */
2792 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2794 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2795 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2797 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2798 #define DECL_RTL_SET_P(NODE) \
2799 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2801 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2802 NODE1, it will not be set for NODE2; this is a lazy copy. */
2803 #define COPY_DECL_RTL(NODE1, NODE2) \
2804 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2805 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2807 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2808 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2810 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2811 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2813 struct GTY(()) tree_decl_with_rtl {
2814 struct tree_decl_common common;
2818 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2819 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2820 of the structure. */
2821 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2823 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2824 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2825 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2826 natural alignment of the field's type). */
2827 #define DECL_FIELD_BIT_OFFSET(NODE) \
2828 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2830 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2831 if so, the type that was originally specified for it.
2832 TREE_TYPE may have been modified (in finish_struct). */
2833 #define DECL_BIT_FIELD_TYPE(NODE) \
2834 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2836 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2837 if nonzero, indicates that the field occupies the type. */
2838 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2840 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2841 DECL_FIELD_OFFSET which are known to be always zero.
2842 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2844 #define DECL_OFFSET_ALIGN(NODE) \
2845 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2847 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2848 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2849 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2850 /* 1 if the alignment for this type was requested by "aligned" attribute,
2851 0 if it is the default for this type. */
2853 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2854 which this FIELD_DECL is defined. This information is needed when
2855 writing debugging information about vfield and vbase decls for C++. */
2856 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2858 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2859 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2861 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2863 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2865 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2866 this component. This makes it possible for Type-Based Alias Analysis
2867 to disambiguate accesses to this field with indirect accesses using
2870 struct S { int i; } s;
2873 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2875 From the implementation's viewpoint, the alias set of the type of the
2876 field 'i' (int) will not be recorded as a subset of that of the type of
2877 's' (struct S) in record_component_aliases. The counterpart is that
2878 accesses to s.i must not be given the alias set of the type of 'i'
2879 (int) but instead directly that of the type of 's' (struct S). */
2880 #define DECL_NONADDRESSABLE_P(NODE) \
2881 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2883 struct GTY(()) tree_field_decl {
2884 struct tree_decl_common common;
2887 tree bit_field_type;
2893 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2894 dense, unique within any one function, and may be used to index arrays.
2895 If the value is -1, then no UID has been assigned. */
2896 #define LABEL_DECL_UID(NODE) \
2897 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2899 /* In a LABEL_DECL, the EH region number for which the label is the
2900 post_landing_pad. */
2901 #define EH_LANDING_PAD_NR(NODE) \
2902 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2904 /* In LABEL_DECL nodes, nonzero means that an error message about
2905 jumping into such a binding contour has been printed for this label. */
2906 #define DECL_ERROR_ISSUED(NODE) \
2907 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2909 struct GTY(()) tree_label_decl {
2910 struct tree_decl_with_rtl common;
2912 int eh_landing_pad_nr;
2916 struct GTY(()) tree_result_decl {
2917 struct tree_decl_with_rtl common;
2918 struct var_ann_d *ann;
2921 struct GTY(()) tree_const_decl {
2922 struct tree_decl_with_rtl common;
2925 /* For a PARM_DECL, records the data type used to pass the argument,
2926 which may be different from the type seen in the program. */
2927 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2929 /* For PARM_DECL, holds an RTL for the stack slot or register
2930 where the data was actually passed. */
2931 #define DECL_INCOMING_RTL(NODE) \
2932 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2934 struct GTY(()) tree_parm_decl {
2935 struct tree_decl_with_rtl common;
2937 struct var_ann_d *ann;
2941 /* Nonzero for a given ..._DECL node means that no warnings should be
2942 generated just because this node is unused. */
2943 #define DECL_IN_SYSTEM_HEADER(NODE) \
2944 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2946 /* Used to indicate that the linkage status of this DECL is not yet known,
2947 so it should not be output now. */
2948 #define DECL_DEFER_OUTPUT(NODE) \
2949 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2951 /* In a VAR_DECL that's static,
2952 nonzero if the space is in the text section. */
2953 #define DECL_IN_TEXT_SECTION(NODE) \
2954 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2956 /* In a VAR_DECL that's static,
2957 nonzero if it belongs to the global constant pool. */
2958 #define DECL_IN_CONSTANT_POOL(NODE) \
2959 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2961 /* Nonzero for a given ..._DECL node means that this node should be
2962 put in .common, if possible. If a DECL_INITIAL is given, and it
2963 is not error_mark_node, then the decl cannot be put in .common. */
2964 #define DECL_COMMON(NODE) \
2965 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2967 /* In a VAR_DECL, nonzero if the decl is a register variable with
2968 an explicit asm specification. */
2969 #define DECL_HARD_REGISTER(NODE) \
2970 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2972 /* Used to indicate that this DECL has weak linkage. */
2973 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2975 /* Used to indicate that the DECL is a dllimport. */
2976 #define DECL_DLLIMPORT_P(NODE) \
2977 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2979 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2980 not be put out unless it is needed in this translation unit.
2981 Entities like this are shared across translation units (like weak
2982 entities), but are guaranteed to be generated by any translation
2983 unit that needs them, and therefore need not be put out anywhere
2984 where they are not needed. DECL_COMDAT is just a hint to the
2985 back-end; it is up to front-ends which set this flag to ensure
2986 that there will never be any harm, other than bloat, in putting out
2987 something which is DECL_COMDAT. */
2988 #define DECL_COMDAT(NODE) \
2989 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2991 #define DECL_COMDAT_GROUP(NODE) \
2992 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2994 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2995 multiple translation units should be merged. */
2996 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
2998 /* A replaceable function is one which may be replaced at link-time
2999 with an entirely different definition, provided that the
3000 replacement has the same type. For example, functions declared
3001 with __attribute__((weak)) on most systems are replaceable.
3003 COMDAT functions are not replaceable, since all definitions of the
3004 function must be equivalent. It is important that COMDAT functions
3005 not be treated as replaceable so that use of C++ template
3006 instantiations is not penalized.
3008 For example, DECL_REPLACEABLE is used to determine whether or not a
3009 function (including a template instantiation) which is not
3010 explicitly declared "inline" can be inlined. If the function is
3011 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3012 implementation chosen at link-time may be different. However, a
3013 function that is not DECL_REPLACEABLE can be inlined, since all
3014 versions of the function will be functionally identical. */
3015 #define DECL_REPLACEABLE_P(NODE) \
3016 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3018 /* The name of the object as the assembler will see it (but before any
3019 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3020 as DECL_NAME. It is an IDENTIFIER_NODE. */
3021 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3023 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3024 This is true of all DECL nodes except FIELD_DECL. */
3025 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3026 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3028 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3029 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3031 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3032 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3033 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3035 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3036 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3037 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3039 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3040 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3041 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3042 semantics of using this macro, are different than saying:
3044 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3046 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3048 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3049 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3050 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3051 DECL_ASSEMBLER_NAME (DECL1)) \
3054 /* Records the section name in a section attribute. Used to pass
3055 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3056 #define DECL_SECTION_NAME(NODE) \
3057 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3059 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3060 this variable in a BIND_EXPR. */
3061 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3062 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3064 /* Value of the decls's visibility attribute */
3065 #define DECL_VISIBILITY(NODE) \
3066 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3068 /* Nonzero means that the decl had its visibility specified rather than
3070 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3071 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3073 /* In a VAR_DECL, the model to use if the data should be allocated from
3074 thread-local storage. */
3075 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3077 /* In a VAR_DECL, nonzero if the data should be allocated from
3078 thread-local storage. */
3079 #define DECL_THREAD_LOCAL_P(NODE) \
3080 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3082 /* In a non-local VAR_DECL with static storage duration, true if the
3083 variable has an initialization priority. If false, the variable
3084 will be initialized at the DEFAULT_INIT_PRIORITY. */
3085 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3086 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3088 struct GTY(()) tree_decl_with_vis {
3089 struct tree_decl_with_rtl common;
3090 tree assembler_name;
3094 /* Belong to VAR_DECL exclusively. */
3095 unsigned defer_output : 1;
3096 unsigned hard_register : 1;
3097 unsigned thread_local : 1;
3098 unsigned common_flag : 1;
3099 unsigned in_text_section : 1;
3100 unsigned in_constant_pool : 1;
3101 unsigned dllimport_flag : 1;
3102 /* Don't belong to VAR_DECL exclusively. */
3103 unsigned weak_flag : 1;
3105 unsigned seen_in_bind_expr : 1;
3106 unsigned comdat_flag : 1;
3107 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3108 unsigned visibility_specified : 1;
3109 /* Belongs to VAR_DECL exclusively. */
3110 ENUM_BITFIELD(tls_model) tls_model : 3;
3112 /* Belong to FUNCTION_DECL exclusively. */
3113 unsigned init_priority_p : 1;
3114 /* Used by C++ only. Might become a generic decl flag. */
3115 unsigned shadowed_for_var_p : 1;
3116 /* 14 unused bits. */
3119 extern tree decl_debug_expr_lookup (tree);
3120 extern void decl_debug_expr_insert (tree, tree);
3121 /* For VAR_DECL, this is set to either an expression that it was split
3122 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3123 subexpressions that it was split into. */
3124 #define DECL_DEBUG_EXPR(NODE) \
3125 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3127 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3128 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3130 /* An initialization priority. */
3131 typedef unsigned short priority_type;
3133 extern priority_type decl_init_priority_lookup (tree);
3134 extern priority_type decl_fini_priority_lookup (tree);
3135 extern void decl_init_priority_insert (tree, priority_type);
3136 extern void decl_fini_priority_insert (tree, priority_type);
3138 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3140 #define DECL_INIT_PRIORITY(NODE) \
3141 (decl_init_priority_lookup (NODE))
3142 /* Set the initialization priority for NODE to VAL. */
3143 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3144 (decl_init_priority_insert (NODE, VAL))
3146 /* For a FUNCTION_DECL the finalization priority of NODE. */
3147 #define DECL_FINI_PRIORITY(NODE) \
3148 (decl_fini_priority_lookup (NODE))
3149 /* Set the finalization priority for NODE to VAL. */
3150 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3151 (decl_fini_priority_insert (NODE, VAL))
3153 /* The initialization priority for entities for which no explicit
3154 initialization priority has been specified. */
3155 #define DEFAULT_INIT_PRIORITY 65535
3157 /* The maximum allowed initialization priority. */
3158 #define MAX_INIT_PRIORITY 65535
3160 /* The largest priority value reserved for use by system runtime
3162 #define MAX_RESERVED_INIT_PRIORITY 100
3164 #define DECL_VAR_ANN_PTR(NODE) \
3165 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3166 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3167 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3170 struct GTY(()) tree_var_decl {
3171 struct tree_decl_with_vis common;
3172 struct var_ann_d *ann;
3176 /* This field is used to reference anything in decl.result and is meant only
3177 for use by the garbage collector. */
3178 #define DECL_RESULT_FLD(NODE) \
3179 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3181 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3182 Before the struct containing the FUNCTION_DECL is laid out,
3183 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3184 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3185 function. When the class is laid out, this pointer is changed
3186 to an INTEGER_CST node which is suitable for use as an index
3187 into the virtual function table.
3188 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3189 #define DECL_VINDEX(NODE) \
3190 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3193 tree_decl_non_common {
3194 struct tree_decl_with_vis common;
3195 /* C++ uses this in namespaces. */
3197 /* C++ uses this in templates. */
3199 /* Almost all FE's use this. */
3201 /* C++ uses this in namespaces. */
3205 /* In FUNCTION_DECL, holds the decl for the return value. */
3206 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3208 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3209 #define DECL_UNINLINABLE(NODE) \
3210 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3212 /* In a FUNCTION_DECL, the saved representation of the body of the
3214 #define DECL_SAVED_TREE(NODE) \
3215 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3217 /* Nonzero in a FUNCTION_DECL means this function should be treated
3218 as if it were a malloc, meaning it returns a pointer that is
3220 #define DECL_IS_MALLOC(NODE) \
3221 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3223 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3224 C++ operator new, meaning that it returns a pointer for which we
3225 should not use type based aliasing. */
3226 #define DECL_IS_OPERATOR_NEW(NODE) \
3227 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3229 /* Nonzero in a FUNCTION_DECL means this function may return more
3231 #define DECL_IS_RETURNS_TWICE(NODE) \
3232 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3234 /* Nonzero in a FUNCTION_DECL means this function should be treated
3235 as "pure" function (like const function, but may read global memory). */
3236 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3238 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3239 the const or pure function may not terminate. When this is nonzero
3240 for a const or pure function, it can be dealt with by cse passes
3241 but cannot be removed by dce passes since you are not allowed to
3242 change an infinite looping program into one that terminates without
3244 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3245 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3247 /* Nonzero in a FUNCTION_DECL means this function should be treated
3248 as "novops" function (function that does not read global memory,
3249 but may have arbitrary side effects). */
3250 #define DECL_IS_NOVOPS(NODE) \
3251 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3253 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3254 at the beginning or end of execution. */
3255 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3256 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3258 #define DECL_STATIC_DESTRUCTOR(NODE) \
3259 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3261 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3262 be instrumented with calls to support routines. */
3263 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3264 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3266 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3267 disabled in this function. */
3268 #define DECL_NO_LIMIT_STACK(NODE) \
3269 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3271 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3272 #define DECL_STATIC_CHAIN(NODE) \
3273 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3275 /* Nonzero for a decl that cgraph has decided should be inlined into
3276 at least one call site. It is not meaningful to look at this
3277 directly; always use cgraph_function_possibly_inlined_p. */
3278 #define DECL_POSSIBLY_INLINED(DECL) \
3279 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3281 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3282 such as via the `inline' keyword in C/C++. This flag controls the linkage
3283 semantics of 'inline' */
3284 #define DECL_DECLARED_INLINE_P(NODE) \
3285 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3287 /* Nonzero in a FUNCTION_DECL means this function should not get
3288 -Winline warnings. */
3289 #define DECL_NO_INLINE_WARNING_P(NODE) \
3290 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3292 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3293 disregarding size and cost heuristics. This is equivalent to using
3294 the always_inline attribute without the required diagnostics if the
3295 function cannot be inlined. */
3296 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3297 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3299 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3300 that describes the status of this function. */
3301 #define DECL_STRUCT_FUNCTION(NODE) \
3302 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3304 /* In a FUNCTION_DECL, nonzero means a built in function. */
3305 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3307 /* For a builtin function, identify which part of the compiler defined it. */
3308 #define DECL_BUILT_IN_CLASS(NODE) \
3309 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3311 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3312 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3314 #define DECL_ARGUMENTS(NODE) \
3315 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3316 #define DECL_ARGUMENT_FLD(NODE) \
3317 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3319 /* In FUNCTION_DECL, the function specific target options to use when compiling
3321 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3322 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3324 /* In FUNCTION_DECL, the function specific optimization options to use when
3325 compiling this function. */
3326 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3327 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3329 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3330 arguments/result/saved_tree fields by front ends. It was either inherit
3331 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3332 which seemed a bit strange. */
3334 struct GTY(()) tree_function_decl {
3335 struct tree_decl_non_common common;
3339 /* The personality function. Used for stack unwinding. */
3342 /* Function specific options that are used by this function. */
3343 tree function_specific_target; /* target options */
3344 tree function_specific_optimization; /* optimization options */
3346 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3347 DECL_FUNCTION_CODE. Otherwise unused.
3348 ??? The bitfield needs to be able to hold all target function
3350 ENUM_BITFIELD(built_in_function) function_code : 11;
3351 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3353 unsigned static_ctor_flag : 1;
3354 unsigned static_dtor_flag : 1;
3355 unsigned uninlinable : 1;
3357 unsigned possibly_inlined : 1;
3358 unsigned novops_flag : 1;
3359 unsigned returns_twice_flag : 1;
3360 unsigned malloc_flag : 1;
3361 unsigned operator_new_flag : 1;
3362 unsigned declared_inline_flag : 1;
3363 unsigned regdecl_flag : 1;
3365 unsigned no_inline_warning_flag : 1;
3366 unsigned no_instrument_function_entry_exit : 1;
3367 unsigned no_limit_stack : 1;
3368 unsigned disregard_inline_limits : 1;
3369 unsigned pure_flag : 1;
3370 unsigned looping_const_or_pure_flag : 1;
3376 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3377 #define DECL_ORIGINAL_TYPE(NODE) \
3378 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3380 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3381 into stabs. Instead it will generate cross reference ('x') of names.
3382 This uses the same flag as DECL_EXTERNAL. */
3383 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3384 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3386 /* Getter of the imported declaration associated to the
3387 IMPORTED_DECL node. */
3388 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3389 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3391 struct GTY(()) tree_type_decl {
3392 struct tree_decl_non_common common;
3396 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3397 To reduce overhead, the nodes containing the statements are not trees.
3398 This avoids the overhead of tree_common on all linked list elements.
3400 Use the interface in tree-iterator.h to access this node. */
3402 #define STATEMENT_LIST_HEAD(NODE) \
3403 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3404 #define STATEMENT_LIST_TAIL(NODE) \
3405 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3407 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3409 struct tree_statement_list_node *prev;
3410 struct tree_statement_list_node *next;
3414 struct GTY(()) tree_statement_list
3416 struct tree_common common;
3417 struct tree_statement_list_node *head;
3418 struct tree_statement_list_node *tail;
3422 /* Optimization options used by a function. */
3424 struct GTY(()) tree_optimization_option {
3425 struct tree_common common;
3427 /* The optimization options used by the user. */
3428 struct cl_optimization opts;
3431 #define TREE_OPTIMIZATION(NODE) \
3432 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3434 /* Return a tree node that encapsulates the current optimization options. */
3435 extern tree build_optimization_node (void);
3437 /* Target options used by a function. */
3439 struct GTY(()) tree_target_option {
3440 struct tree_common common;
3442 /* The optimization options used by the user. */
3443 struct cl_target_option opts;
3446 #define TREE_TARGET_OPTION(NODE) \
3447 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3449 /* Return a tree node that encapsulates the current target options. */
3450 extern tree build_target_option_node (void);
3453 /* Define the overall contents of a tree node.
3454 It may be any of the structures declared above
3455 for various types of node. */
3457 union GTY ((ptr_alias (union lang_tree_node),
3458 desc ("tree_node_structure (&%h)"))) tree_node {
3459 struct tree_base GTY ((tag ("TS_BASE"))) base;
3460 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3461 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3462 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3463 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3464 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3465 struct tree_string GTY ((tag ("TS_STRING"))) string;
3466 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3467 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3468 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3469 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3470 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3471 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3472 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3473 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3474 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3475 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3476 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3477 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3478 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3479 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3480 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3481 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3482 struct tree_list GTY ((tag ("TS_LIST"))) list;
3483 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3484 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3485 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3486 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3487 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3488 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3489 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3490 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3491 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3492 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3495 /* Standard named or nameless data types of the C compiler. */
3517 TI_INTEGER_MINUS_ONE,
3534 TI_COMPLEX_INTEGER_TYPE,
3535 TI_COMPLEX_FLOAT_TYPE,
3536 TI_COMPLEX_DOUBLE_TYPE,
3537 TI_COMPLEX_LONG_DOUBLE_TYPE,
3541 TI_LONG_DOUBLE_TYPE,
3545 TI_LONG_DOUBLE_PTR_TYPE,
3546 TI_INTEGER_PTR_TYPE,
3555 TI_VA_LIST_GPR_COUNTER_FIELD,
3556 TI_VA_LIST_FPR_COUNTER_FIELD,
3563 TI_DFLOAT32_PTR_TYPE,
3564 TI_DFLOAT64_PTR_TYPE,
3565 TI_DFLOAT128_PTR_TYPE,
3574 TI_SAT_LLFRACT_TYPE,
3575 TI_SAT_USFRACT_TYPE,
3577 TI_SAT_ULFRACT_TYPE,
3578 TI_SAT_ULLFRACT_TYPE,
3590 TI_SAT_LLACCUM_TYPE,
3591 TI_SAT_USACCUM_TYPE,
3593 TI_SAT_ULACCUM_TYPE,
3594 TI_SAT_ULLACCUM_TYPE,
3640 TI_OPTIMIZATION_DEFAULT,
3641 TI_OPTIMIZATION_CURRENT,
3642 TI_TARGET_OPTION_DEFAULT,
3643 TI_TARGET_OPTION_CURRENT,
3644 TI_CURRENT_TARGET_PRAGMA,
3645 TI_CURRENT_OPTIMIZE_PRAGMA,
3650 extern GTY(()) tree global_trees[TI_MAX];
3652 #define error_mark_node global_trees[TI_ERROR_MARK]
3654 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3655 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3656 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3657 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3658 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3660 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3661 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3662 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3663 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3664 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3666 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3667 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3669 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3670 #define integer_one_node global_trees[TI_INTEGER_ONE]
3671 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3672 #define size_zero_node global_trees[TI_SIZE_ZERO]
3673 #define size_one_node global_trees[TI_SIZE_ONE]
3674 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3675 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3676 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3678 /* Base access nodes. */
3679 #define access_public_node global_trees[TI_PUBLIC]
3680 #define access_protected_node global_trees[TI_PROTECTED]
3681 #define access_private_node global_trees[TI_PRIVATE]
3683 #define null_pointer_node global_trees[TI_NULL_POINTER]
3685 #define float_type_node global_trees[TI_FLOAT_TYPE]
3686 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3687 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3689 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3690 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3691 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3692 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3694 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3695 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3696 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3697 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3699 #define void_type_node global_trees[TI_VOID_TYPE]
3700 /* The C type `void *'. */
3701 #define ptr_type_node global_trees[TI_PTR_TYPE]
3702 /* The C type `const void *'. */
3703 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3704 /* The C type `size_t'. */
3705 #define size_type_node global_trees[TI_SIZE_TYPE]
3706 #define pid_type_node global_trees[TI_PID_TYPE]
3707 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3708 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3709 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3710 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3711 /* The C type `FILE *'. */
3712 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3714 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3715 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3716 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3718 /* The decimal floating point types. */
3719 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3720 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3721 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3722 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3723 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3724 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3726 /* The fixed-point types. */
3727 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3728 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3729 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3730 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3731 #define sat_unsigned_short_fract_type_node \
3732 global_trees[TI_SAT_USFRACT_TYPE]
3733 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3734 #define sat_unsigned_long_fract_type_node \
3735 global_trees[TI_SAT_ULFRACT_TYPE]
3736 #define sat_unsigned_long_long_fract_type_node \
3737 global_trees[TI_SAT_ULLFRACT_TYPE]
3738 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3739 #define fract_type_node global_trees[TI_FRACT_TYPE]
3740 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3741 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3742 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3743 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3744 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3745 #define unsigned_long_long_fract_type_node \
3746 global_trees[TI_ULLFRACT_TYPE]
3747 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3748 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3749 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3750 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3751 #define sat_unsigned_short_accum_type_node \
3752 global_trees[TI_SAT_USACCUM_TYPE]
3753 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3754 #define sat_unsigned_long_accum_type_node \
3755 global_trees[TI_SAT_ULACCUM_TYPE]
3756 #define sat_unsigned_long_long_accum_type_node \
3757 global_trees[TI_SAT_ULLACCUM_TYPE]
3758 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3759 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3760 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3761 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3762 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3763 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3764 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3765 #define unsigned_long_long_accum_type_node \
3766 global_trees[TI_ULLACCUM_TYPE]
3767 #define qq_type_node global_trees[TI_QQ_TYPE]
3768 #define hq_type_node global_trees[TI_HQ_TYPE]
3769 #define sq_type_node global_trees[TI_SQ_TYPE]
3770 #define dq_type_node global_trees[TI_DQ_TYPE]
3771 #define tq_type_node global_trees[TI_TQ_TYPE]
3772 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3773 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3774 #define usq_type_node global_trees[TI_USQ_TYPE]
3775 #define udq_type_node global_trees[TI_UDQ_TYPE]
3776 #define utq_type_node global_trees[TI_UTQ_TYPE]
3777 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3778 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3779 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3780 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3781 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3782 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3783 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3784 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3785 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3786 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3787 #define ha_type_node global_trees[TI_HA_TYPE]
3788 #define sa_type_node global_trees[TI_SA_TYPE]
3789 #define da_type_node global_trees[TI_DA_TYPE]
3790 #define ta_type_node global_trees[TI_TA_TYPE]
3791 #define uha_type_node global_trees[TI_UHA_TYPE]
3792 #define usa_type_node global_trees[TI_USA_TYPE]
3793 #define uda_type_node global_trees[TI_UDA_TYPE]
3794 #define uta_type_node global_trees[TI_UTA_TYPE]
3795 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3796 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3797 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3798 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3799 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3800 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3801 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3802 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3804 /* The node that should be placed at the end of a parameter list to
3805 indicate that the function does not take a variable number of
3806 arguments. The TREE_VALUE will be void_type_node and there will be
3807 no TREE_CHAIN. Language-independent code should not assume
3808 anything else about this node. */
3809 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3811 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3812 #define MAIN_NAME_P(NODE) \
3813 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3815 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3817 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3818 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3820 /* Default/current target options (TARGET_OPTION_NODE). */
3821 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3822 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3824 /* Default tree list option(), optimize() pragmas to be linked into the
3826 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3827 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3829 /* An enumeration of the standard C integer types. These must be
3830 ordered so that shorter types appear before longer ones, and so
3831 that signed types appear before unsigned ones, for the correct
3832 functioning of interpret_integer() in c-lex.c. */
3833 enum integer_type_kind
3845 itk_unsigned_long_long,
3849 typedef enum integer_type_kind integer_type_kind;
3851 /* The standard C integer types. Use integer_type_kind to index into
3853 extern GTY(()) tree integer_types[itk_none];
3855 #define char_type_node integer_types[itk_char]
3856 #define signed_char_type_node integer_types[itk_signed_char]
3857 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3858 #define short_integer_type_node integer_types[itk_short]
3859 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3860 #define integer_type_node integer_types[itk_int]
3861 #define unsigned_type_node integer_types[itk_unsigned_int]
3862 #define long_integer_type_node integer_types[itk_long]
3863 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3864 #define long_long_integer_type_node integer_types[itk_long_long]
3865 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3867 /* Set to the default thread-local storage (tls) model to use. */
3869 extern enum tls_model flag_tls_default;
3872 /* A pointer-to-function member type looks like:
3879 If __pfn is NULL, it is a NULL pointer-to-member-function.
3881 (Because the vtable is always the first thing in the object, we
3882 don't need its offset.) If the function is virtual, then PFN is
3883 one plus twice the index into the vtable; otherwise, it is just a
3884 pointer to the function.
3886 Unfortunately, using the lowest bit of PFN doesn't work in
3887 architectures that don't impose alignment requirements on function
3888 addresses, or that use the lowest bit to tell one ISA from another,
3889 for example. For such architectures, we use the lowest bit of
3890 DELTA instead of the lowest bit of the PFN, and DELTA will be
3893 enum ptrmemfunc_vbit_where_t
3895 ptrmemfunc_vbit_in_pfn,
3896 ptrmemfunc_vbit_in_delta
3899 #define NULL_TREE (tree) NULL
3901 extern tree decl_assembler_name (tree);
3902 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3903 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3905 /* Compute the number of bytes occupied by 'node'. This routine only
3906 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3908 extern size_t tree_size (const_tree);
3910 /* Compute the number of bytes occupied by a tree with code CODE. This
3911 function cannot be used for TREE_VEC codes, which are of variable
3913 extern size_t tree_code_size (enum tree_code);
3915 /* Lowest level primitive for allocating a node.
3916 The TREE_CODE is the only argument. Contents are initialized
3917 to zero except for a few of the common fields. */
3919 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3920 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3922 /* Make a copy of a node, with all the same contents. */
3924 extern tree copy_node_stat (tree MEM_STAT_DECL);
3925 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3927 /* Make a copy of a chain of TREE_LIST nodes. */
3929 extern tree copy_list (tree);
3932 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3933 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3935 /* Make a TREE_VEC. */
3937 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3938 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3940 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3941 The name is supplied as a char *. */
3943 extern tree get_identifier (const char *);
3945 #if GCC_VERSION >= 3000
3946 #define get_identifier(str) \
3947 (__builtin_constant_p (str) \
3948 ? get_identifier_with_length ((str), strlen (str)) \
3949 : get_identifier (str))
3953 /* Identical to get_identifier, except that the length is assumed
3956 extern tree get_identifier_with_length (const char *, size_t);
3958 /* If an identifier with the name TEXT (a null-terminated string) has
3959 previously been referred to, return that node; otherwise return
3962 extern tree maybe_get_identifier (const char *);
3964 /* Construct various types of nodes. */
3966 extern tree build_nt (enum tree_code, ...);
3967 extern tree build_nt_call_list (tree, tree);
3968 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3970 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3971 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3972 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3973 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3974 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3975 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3976 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3977 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3978 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3979 tree MEM_STAT_DECL);
3980 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3981 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3982 tree MEM_STAT_DECL);
3983 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3984 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3985 tree, tree MEM_STAT_DECL);
3986 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3987 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3989 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3990 #define build_var_debug_value(t1,t2) \
3991 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3993 /* Constructs double_int from tree CST. */
3995 static inline double_int
3996 tree_to_double_int (const_tree cst)
3998 return TREE_INT_CST (cst);
4001 extern tree double_int_to_tree (tree, double_int);
4002 extern bool double_int_fits_to_tree_p (const_tree, double_int);
4004 extern tree build_int_cst (tree, HOST_WIDE_INT);
4005 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
4006 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
4007 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4008 extern tree build_int_cst_wide_type (tree,
4009 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4010 extern tree build_vector (tree, tree);
4011 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
4012 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
4013 extern tree build_constructor_single (tree, tree, tree);
4014 extern tree build_constructor_from_list (tree, tree);
4015 extern tree build_real_from_int_cst (tree, const_tree);
4016 extern tree build_complex (tree, tree, tree);
4017 extern tree build_one_cst (tree);
4018 extern tree build_string (int, const char *);
4019 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
4020 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4021 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
4022 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4023 extern tree build_decl_stat (location_t, enum tree_code,
4024 tree, tree MEM_STAT_DECL);
4025 extern tree build_fn_decl (const char *, tree);
4026 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4027 extern tree build_block (tree, tree, tree, tree);
4028 extern tree build_empty_stmt (location_t);
4029 extern tree build_omp_clause (location_t, enum omp_clause_code);
4031 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
4032 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4034 extern tree build_call_list (tree, tree, tree);
4035 extern tree build_call_nary (tree, tree, int, ...);
4036 extern tree build_call_valist (tree, tree, int, va_list);
4037 #define build_call_array(T1,T2,N,T3)\
4038 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4039 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4040 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
4042 /* Construct various nodes representing data types. */
4044 extern tree make_signed_type (int);
4045 extern tree make_unsigned_type (int);
4046 extern tree signed_or_unsigned_type_for (int, tree);
4047 extern tree signed_type_for (tree);
4048 extern tree unsigned_type_for (tree);
4049 extern void initialize_sizetypes (void);
4050 extern void set_sizetype (tree);
4051 extern void fixup_unsigned_type (tree);
4052 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4053 extern tree build_pointer_type (tree);
4054 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4055 extern tree build_reference_type (tree);
4056 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4057 extern tree build_vector_type (tree innertype, int nunits);
4058 extern tree build_opaque_vector_type (tree innertype, int nunits);
4059 extern tree build_type_no_quals (tree);
4060 extern tree build_index_type (tree);
4061 extern tree build_index_2_type (tree, tree);
4062 extern tree build_array_type (tree, tree);
4063 extern tree build_function_type (tree, tree);
4064 extern tree build_function_type_list (tree, ...);
4065 extern tree build_function_type_skip_args (tree, bitmap);
4066 extern tree build_function_decl_skip_args (tree, bitmap);
4067 extern tree build_varargs_function_type_list (tree, ...);
4068 extern tree build_method_type_directly (tree, tree, tree);
4069 extern tree build_method_type (tree, tree);
4070 extern tree build_offset_type (tree, tree);
4071 extern tree build_complex_type (tree);
4072 extern tree array_type_nelts (const_tree);
4073 extern bool in_array_bounds_p (tree);
4074 extern bool range_in_array_bounds_p (tree);
4076 extern tree value_member (tree, tree);
4077 extern tree purpose_member (const_tree, tree);
4078 extern tree chain_index (int, tree);
4080 extern int attribute_list_equal (const_tree, const_tree);
4081 extern int attribute_list_contained (const_tree, const_tree);
4082 extern int tree_int_cst_equal (const_tree, const_tree);
4083 extern int tree_int_cst_lt (const_tree, const_tree);
4084 extern int tree_int_cst_compare (const_tree, const_tree);
4085 extern int host_integerp (const_tree, int);
4086 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4087 extern int tree_int_cst_msb (const_tree);
4088 extern int tree_int_cst_sgn (const_tree);
4089 extern int tree_int_cst_sign_bit (const_tree);
4090 extern unsigned int tree_int_cst_min_precision (tree, bool);
4091 extern bool tree_expr_nonnegative_p (tree);
4092 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4093 extern bool may_negate_without_overflow_p (const_tree);
4094 extern tree strip_array_types (tree);
4095 extern tree excess_precision_type (tree);
4097 /* Construct various nodes representing fract or accum data types. */
4099 extern tree make_fract_type (int, int, int);
4100 extern tree make_accum_type (int, int, int);
4102 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4103 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4104 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4105 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4106 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4107 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4108 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4109 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4111 #define make_or_reuse_signed_fract_type(P) \
4112 make_or_reuse_fract_type (P, 0, 0)
4113 #define make_or_reuse_unsigned_fract_type(P) \
4114 make_or_reuse_fract_type (P, 1, 0)
4115 #define make_or_reuse_sat_signed_fract_type(P) \
4116 make_or_reuse_fract_type (P, 0, 1)
4117 #define make_or_reuse_sat_unsigned_fract_type(P) \
4118 make_or_reuse_fract_type (P, 1, 1)
4119 #define make_or_reuse_signed_accum_type(P) \
4120 make_or_reuse_accum_type (P, 0, 0)
4121 #define make_or_reuse_unsigned_accum_type(P) \
4122 make_or_reuse_accum_type (P, 1, 0)
4123 #define make_or_reuse_sat_signed_accum_type(P) \
4124 make_or_reuse_accum_type (P, 0, 1)
4125 #define make_or_reuse_sat_unsigned_accum_type(P) \
4126 make_or_reuse_accum_type (P, 1, 1)
4128 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4129 put the prototype here. Rtl.h does declare the prototype if
4130 tree.h had been included. */
4132 extern tree make_tree (tree, rtx);
4134 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4137 Such modified types already made are recorded so that duplicates
4140 extern tree build_type_attribute_variant (tree, tree);
4141 extern tree build_decl_attribute_variant (tree, tree);
4142 extern tree build_type_attribute_qual_variant (tree, tree, int);
4144 /* Structure describing an attribute and a function to handle it. */
4145 struct attribute_spec
4147 /* The name of the attribute (without any leading or trailing __),
4148 or NULL to mark the end of a table of attributes. */
4149 const char *const name;
4150 /* The minimum length of the list of arguments of the attribute. */
4151 const int min_length;
4152 /* The maximum length of the list of arguments of the attribute
4153 (-1 for no maximum). */
4154 const int max_length;
4155 /* Whether this attribute requires a DECL. If it does, it will be passed
4156 from types of DECLs, function return types and array element types to
4157 the DECLs, function types and array types respectively; but when
4158 applied to a type in any other circumstances, it will be ignored with
4159 a warning. (If greater control is desired for a given attribute,
4160 this should be false, and the flags argument to the handler may be
4161 used to gain greater control in that case.) */
4162 const bool decl_required;
4163 /* Whether this attribute requires a type. If it does, it will be passed
4164 from a DECL to the type of that DECL. */
4165 const bool type_required;
4166 /* Whether this attribute requires a function (or method) type. If it does,
4167 it will be passed from a function pointer type to the target type,
4168 and from a function return type (which is not itself a function
4169 pointer type) to the function type. */
4170 const bool function_type_required;
4171 /* Function to handle this attribute. NODE points to the node to which
4172 the attribute is to be applied. If a DECL, it should be modified in
4173 place; if a TYPE, a copy should be created. NAME is the name of the
4174 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4175 of the arguments (which may be NULL). FLAGS gives further information
4176 about the context of the attribute. Afterwards, the attributes will
4177 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4178 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4179 as well as in any other cases when the attributes should not be added
4180 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4181 applied to another type or DECL later may be returned;
4182 otherwise the return value should be NULL_TREE. This pointer may be
4183 NULL if no special handling is required beyond the checks implied
4184 by the rest of this structure. */
4185 tree (*const handler) (tree *node, tree name, tree args,
4186 int flags, bool *no_add_attrs);
4189 /* Flags that may be passed in the third argument of decl_attributes, and
4190 to handler functions for attributes. */
4191 enum attribute_flags
4193 /* The type passed in is the type of a DECL, and any attributes that
4194 should be passed in again to be applied to the DECL rather than the
4195 type should be returned. */
4196 ATTR_FLAG_DECL_NEXT = 1,
4197 /* The type passed in is a function return type, and any attributes that
4198 should be passed in again to be applied to the function type rather
4199 than the return type should be returned. */
4200 ATTR_FLAG_FUNCTION_NEXT = 2,
4201 /* The type passed in is an array element type, and any attributes that
4202 should be passed in again to be applied to the array type rather
4203 than the element type should be returned. */
4204 ATTR_FLAG_ARRAY_NEXT = 4,
4205 /* The type passed in is a structure, union or enumeration type being
4206 created, and should be modified in place. */
4207 ATTR_FLAG_TYPE_IN_PLACE = 8,
4208 /* The attributes are being applied by default to a library function whose
4209 name indicates known behavior, and should be silently ignored if they
4210 are not in fact compatible with the function type. */
4211 ATTR_FLAG_BUILT_IN = 16
4214 /* Default versions of target-overridable functions. */
4216 extern tree merge_decl_attributes (tree, tree);
4217 extern tree merge_type_attributes (tree, tree);
4219 /* Given a tree node and a string, return nonzero if the tree node is
4220 a valid attribute name for the string. */
4222 extern int is_attribute_p (const char *, const_tree);
4224 /* Given an attribute name and a list of attributes, return the list element
4225 of the attribute or NULL_TREE if not found. */
4227 extern tree lookup_attribute (const char *, tree);
4229 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4232 extern tree remove_attribute (const char *, tree);
4234 /* Given two attributes lists, return a list of their union. */
4236 extern tree merge_attributes (tree, tree);
4238 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4239 /* Given two Windows decl attributes lists, possibly including
4240 dllimport, return a list of their union . */
4241 extern tree merge_dllimport_decl_attributes (tree, tree);
4243 /* Handle a "dllimport" or "dllexport" attribute. */
4244 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4247 /* Check whether CAND is suitable to be returned from get_qualified_type
4248 (BASE, TYPE_QUALS). */
4250 extern bool check_qualified_type (const_tree, const_tree, int);
4252 /* Return a version of the TYPE, qualified as indicated by the
4253 TYPE_QUALS, if one exists. If no qualified version exists yet,
4254 return NULL_TREE. */
4256 extern tree get_qualified_type (tree, int);
4258 /* Like get_qualified_type, but creates the type if it does not
4259 exist. This function never returns NULL_TREE. */
4261 extern tree build_qualified_type (tree, int);
4263 /* Like build_qualified_type, but only deals with the `const' and
4264 `volatile' qualifiers. This interface is retained for backwards
4265 compatibility with the various front-ends; new code should use
4266 build_qualified_type instead. */
4268 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4269 build_qualified_type ((TYPE), \
4270 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4271 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4273 /* Make a copy of a type node. */
4275 extern tree build_distinct_type_copy (tree);
4276 extern tree build_variant_type_copy (tree);
4278 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4279 fields. Optionally specify an alignment, and then lay it out. */
4281 extern void finish_builtin_struct (tree, const char *,
4284 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4285 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4286 node, does nothing except for the first time. */
4288 extern void layout_type (tree);
4290 /* These functions allow a front-end to perform a manual layout of a
4291 RECORD_TYPE. (For instance, if the placement of subsequent fields
4292 depends on the placement of fields so far.) Begin by calling
4293 start_record_layout. Then, call place_field for each of the
4294 fields. Then, call finish_record_layout. See layout_type for the
4295 default way in which these functions are used. */
4297 typedef struct record_layout_info_s
4299 /* The RECORD_TYPE that we are laying out. */
4301 /* The offset into the record so far, in bytes, not including bits in
4304 /* The last known alignment of SIZE. */
4305 unsigned int offset_align;
4306 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4308 /* The alignment of the record so far, in bits. */
4309 unsigned int record_align;
4310 /* The alignment of the record so far, ignoring #pragma pack and
4311 __attribute__ ((packed)), in bits. */
4312 unsigned int unpacked_align;
4313 /* The previous field layed out. */
4315 /* The static variables (i.e., class variables, as opposed to
4316 instance variables) encountered in T. */
4317 tree pending_statics;
4318 /* Bits remaining in the current alignment group */
4319 int remaining_in_alignment;
4320 /* True if we've seen a packed field that didn't have normal
4321 alignment anyway. */
4322 int packed_maybe_necessary;
4323 } *record_layout_info;
4325 extern record_layout_info start_record_layout (tree);
4326 extern tree bit_from_pos (tree, tree);
4327 extern tree byte_from_pos (tree, tree);
4328 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4329 extern void normalize_offset (tree *, tree *, unsigned int);
4330 extern tree rli_size_unit_so_far (record_layout_info);
4331 extern tree rli_size_so_far (record_layout_info);
4332 extern void normalize_rli (record_layout_info);
4333 extern void place_field (record_layout_info, tree);
4334 extern void compute_record_mode (tree);
4335 extern void finish_record_layout (record_layout_info, int);
4337 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4338 return a canonicalized ..._TYPE node, so that duplicates are not made.
4339 How the hash code is computed is up to the caller, as long as any two
4340 callers that could hash identical-looking type nodes agree. */
4342 extern tree type_hash_canon (unsigned int, tree);
4344 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4345 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4346 fields. Call this only once for any given decl node.
4348 Second argument is the boundary that this field can be assumed to
4349 be starting at (in bits). Zero means it can be assumed aligned
4350 on any boundary that may be needed. */
4352 extern void layout_decl (tree, unsigned);
4354 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4355 a previous call to layout_decl and calls it again. */
4357 extern void relayout_decl (tree);
4359 /* Return the mode for data of a given size SIZE and mode class CLASS.
4360 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4361 The value is BLKmode if no other mode is found. This is like
4362 mode_for_size, but is passed a tree. */
4364 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4366 /* Return an expr equal to X but certainly not valid as an lvalue. */
4368 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4369 extern tree non_lvalue_loc (location_t, tree);
4371 extern tree convert (tree, tree);
4372 extern unsigned int expr_align (const_tree);
4373 extern tree expr_first (tree);
4374 extern tree expr_last (tree);
4375 extern tree size_in_bytes (const_tree);
4376 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4377 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4378 extern tree tree_expr_size (const_tree);
4379 extern tree bit_position (const_tree);
4380 extern HOST_WIDE_INT int_bit_position (const_tree);
4381 extern tree byte_position (const_tree);
4382 extern HOST_WIDE_INT int_byte_position (const_tree);
4384 /* Define data structures, macros, and functions for handling sizes
4385 and the various types used to represent sizes. */
4389 SIZETYPE, /* Normal representation of sizes in bytes. */
4390 SSIZETYPE, /* Signed representation of sizes in bytes. */
4391 BITSIZETYPE, /* Normal representation of sizes in bits. */
4392 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4395 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4397 #define sizetype sizetype_tab[(int) SIZETYPE]
4398 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4399 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4400 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4402 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4403 #define size_binop(CODE,T1,T2)\
4404 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4405 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4406 #define size_diffop(T1,T2)\
4407 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4408 extern tree size_diffop_loc (location_t, tree, tree);
4410 #define size_int(L) size_int_kind (L, SIZETYPE)
4411 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4412 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4413 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4415 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4416 extern tree round_up_loc (location_t, tree, int);
4417 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4418 extern tree round_down_loc (location_t, tree, int);
4419 extern VEC(tree,gc) *get_pending_sizes (void);
4420 extern void put_pending_size (tree);
4421 extern void put_pending_sizes (VEC(tree,gc) *);
4422 extern void finalize_size_functions (void);
4424 /* Type for sizes of data-type. */
4426 #define BITS_PER_UNIT_LOG \
4427 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4428 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4429 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4431 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4432 extern unsigned int maximum_field_alignment;
4433 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4434 extern unsigned int initial_max_fld_align;
4436 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4437 by making the last node in X point to Y.
4438 Returns X, except if X is 0 returns Y. */
4440 extern tree chainon (tree, tree);
4442 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4444 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4445 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4447 /* Return the last tree node in a chain. */
4449 extern tree tree_last (tree);
4451 /* Reverse the order of elements in a chain, and return the new head. */
4453 extern tree nreverse (tree);
4455 /* Returns the length of a chain of nodes
4456 (number of chain pointers to follow before reaching a null pointer). */
4458 extern int list_length (const_tree);
4460 /* Returns the number of FIELD_DECLs in a type. */
4462 extern int fields_length (const_tree);
4464 /* Returns the first FIELD_DECL in a type. */
4466 extern tree first_field (const_tree);
4468 /* Given an initializer INIT, return TRUE if INIT is zero or some
4469 aggregate of zeros. Otherwise return FALSE. */
4471 extern bool initializer_zerop (const_tree);
4473 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4475 extern VEC(tree,gc) *ctor_to_vec (tree);
4477 /* Examine CTOR to discover:
4478 * how many scalar fields are set to nonzero values,
4479 and place it in *P_NZ_ELTS;
4480 * how many scalar fields in total are in CTOR,
4481 and place it in *P_ELT_COUNT.
4482 * if a type is a union, and the initializer from the constructor
4483 is not the largest element in the union, then set *p_must_clear.
4485 Return whether or not CTOR is a valid static constant initializer, the same
4486 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4488 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4491 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4493 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4495 extern int integer_zerop (const_tree);
4497 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4499 extern int integer_onep (const_tree);
4501 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4502 all of whose significant bits are 1. */
4504 extern int integer_all_onesp (const_tree);
4506 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4507 exactly one bit 1. */
4509 extern int integer_pow2p (const_tree);
4511 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4512 with a nonzero value. */
4514 extern int integer_nonzerop (const_tree);
4516 extern bool cst_and_fits_in_hwi (const_tree);
4517 extern tree num_ending_zeros (const_tree);
4519 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4522 extern int fixed_zerop (const_tree);
4524 /* staticp (tree x) is nonzero if X is a reference to data allocated
4525 at a fixed address in memory. Returns the outermost data. */
4527 extern tree staticp (tree);
4529 /* save_expr (EXP) returns an expression equivalent to EXP
4530 but it can be used multiple times within context CTX
4531 and only evaluate EXP once. */
4533 extern tree save_expr (tree);
4535 /* Look inside EXPR and into any simple arithmetic operations. Return
4536 the innermost non-arithmetic node. */
4538 extern tree skip_simple_arithmetic (tree);
4540 /* Return which tree structure is used by T. */
4542 enum tree_node_structure_enum tree_node_structure (const_tree);
4544 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4545 or offset that depends on a field within a record.
4547 Note that we only allow such expressions within simple arithmetic
4550 extern bool contains_placeholder_p (const_tree);
4552 /* This macro calls the above function but short-circuits the common
4553 case of a constant to save time. Also check for null. */
4555 #define CONTAINS_PLACEHOLDER_P(EXP) \
4556 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4558 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4559 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4562 extern bool type_contains_placeholder_p (tree);
4564 /* Given a tree EXP, find all occurences of references to fields
4565 in a PLACEHOLDER_EXPR and place them in vector REFS without
4566 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4567 we assume here that EXP contains only arithmetic expressions
4568 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4571 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4573 /* This macro calls the above function but short-circuits the common
4574 case of a constant to save time and also checks for NULL. */
4576 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4578 if((EXP) && !TREE_CONSTANT (EXP)) \
4579 find_placeholder_in_expr (EXP, V); \
4582 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4583 return a tree with all occurrences of references to F in a
4584 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4585 CONST_DECLs. Note that we assume here that EXP contains only
4586 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4587 occurring only in their argument list. */
4589 extern tree substitute_in_expr (tree, tree, tree);
4591 /* This macro calls the above function but short-circuits the common
4592 case of a constant to save time and also checks for NULL. */
4594 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4595 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4597 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4598 for it within OBJ, a tree that is an object or a chain of references. */
4600 extern tree substitute_placeholder_in_expr (tree, tree);
4602 /* This macro calls the above function but short-circuits the common
4603 case of a constant to save time and also checks for NULL. */
4605 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4606 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4607 : substitute_placeholder_in_expr (EXP, OBJ))
4609 /* variable_size (EXP) is like save_expr (EXP) except that it
4610 is for the special case of something that is part of a
4611 variable size for a data type. It makes special arrangements
4612 to compute the value at the right time when the data type
4613 belongs to a function parameter. */
4615 extern tree variable_size (tree);
4617 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4618 but it can be used multiple times
4619 and only evaluate the subexpressions once. */
4621 extern tree stabilize_reference (tree);
4623 /* Subroutine of stabilize_reference; this is called for subtrees of
4624 references. Any expression with side-effects must be put in a SAVE_EXPR
4625 to ensure that it is only evaluated once. */
4627 extern tree stabilize_reference_1 (tree);
4629 /* Return EXP, stripped of any conversions to wider types
4630 in such a way that the result of converting to type FOR_TYPE
4631 is the same as if EXP were converted to FOR_TYPE.
4632 If FOR_TYPE is 0, it signifies EXP's type. */
4634 extern tree get_unwidened (tree, tree);
4636 /* Return OP or a simpler expression for a narrower value
4637 which can be sign-extended or zero-extended to give back OP.
4638 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4639 or 0 if the value should be sign-extended. */
4641 extern tree get_narrower (tree, int *);
4643 /* Return true if T is an expression that get_inner_reference handles. */
4646 handled_component_p (const_tree t)
4648 switch (TREE_CODE (t))
4653 case ARRAY_RANGE_REF:
4654 case VIEW_CONVERT_EXPR:
4664 /* Given an expression EXP that is a handled_component_p,
4665 look for the ultimate containing object, which is returned and specify
4666 the access position and size. */
4668 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4669 tree *, enum machine_mode *, int *, int *,
4672 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4673 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4674 EXP is marked as PACKED. */
4676 extern bool contains_packed_reference (const_tree exp);
4678 /* Return a tree of sizetype representing the size, in bytes, of the element
4679 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4681 extern tree array_ref_element_size (tree);
4683 /* Return a tree representing the lower bound of the array mentioned in
4684 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4686 extern tree array_ref_low_bound (tree);
4688 /* Return a tree representing the upper bound of the array mentioned in
4689 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4691 extern tree array_ref_up_bound (tree);
4693 /* Return a tree representing the offset, in bytes, of the field referenced
4694 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4696 extern tree component_ref_field_offset (tree);
4698 /* Given a DECL or TYPE, return the scope in which it was declared, or
4699 NUL_TREE if there is no containing scope. */
4701 extern tree get_containing_scope (const_tree);
4703 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4705 extern tree decl_function_context (const_tree);
4707 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4708 this _DECL with its context, or zero if none. */
4709 extern tree decl_type_context (const_tree);
4711 /* Return 1 if EXPR is the real constant zero. */
4712 extern int real_zerop (const_tree);
4714 /* Declare commonly used variables for tree structure. */
4716 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4717 Zero means allow extended lvalues. */
4719 extern int pedantic_lvalues;
4721 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4723 extern GTY(()) tree current_function_decl;
4725 /* Nonzero means a FUNC_BEGIN label was emitted. */
4726 extern GTY(()) const char * current_function_func_begin_label;
4728 /* Iterator for going through the function arguments. */
4730 tree fntype; /* function type declaration */
4731 tree next; /* TREE_LIST pointing to the next argument */
4732 } function_args_iterator;
4734 /* Initialize the iterator I with arguments from function FNDECL */
4737 function_args_iter_init (function_args_iterator *i, tree fntype)
4740 i->next = TYPE_ARG_TYPES (fntype);
4743 /* Return a pointer that holds the next argument if there are more arguments to
4744 handle, otherwise return NULL. */
4746 static inline tree *
4747 function_args_iter_cond_ptr (function_args_iterator *i)
4749 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4752 /* Return the next argument if there are more arguments to handle, otherwise
4756 function_args_iter_cond (function_args_iterator *i)
4758 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4761 /* Advance to the next argument. */
4763 function_args_iter_next (function_args_iterator *i)
4765 gcc_assert (i->next != NULL_TREE);
4766 i->next = TREE_CHAIN (i->next);
4769 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4772 inlined_function_outer_scope_p (const_tree block)
4774 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4777 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4778 to point to the next tree element. ITER is an instance of
4779 function_args_iterator used to iterate the arguments. */
4780 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4781 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4782 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4783 function_args_iter_next (&(ITER)))
4785 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4786 to the next tree element. ITER is an instance of function_args_iterator
4787 used to iterate the arguments. */
4788 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4789 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4790 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4791 function_args_iter_next (&(ITER)))
4796 extern unsigned crc32_string (unsigned, const char *);
4797 extern void clean_symbol_name (char *);
4798 extern tree get_file_function_name (const char *);
4799 extern tree get_callee_fndecl (const_tree);
4800 extern int type_num_arguments (const_tree);
4801 extern bool associative_tree_code (enum tree_code);
4802 extern bool commutative_tree_code (enum tree_code);
4803 extern tree upper_bound_in_type (tree, tree);
4804 extern tree lower_bound_in_type (tree, tree);
4805 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4806 extern tree call_expr_arg (tree, int);
4807 extern tree *call_expr_argp (tree, int);
4808 extern tree create_artificial_label (location_t);
4809 extern const char *get_name (tree);
4810 extern bool stdarg_p (tree);
4811 extern bool prototype_p (tree);
4812 extern bool auto_var_in_fn_p (const_tree, const_tree);
4813 extern tree build_low_bits_mask (tree, unsigned);
4814 extern tree tree_strip_nop_conversions (tree);
4815 extern tree tree_strip_sign_nop_conversions (tree);
4816 extern tree lhd_gcc_personality (void);
4817 extern void assign_assembler_name_if_neeeded (tree);
4821 extern void change_decl_assembler_name (tree, tree);
4824 extern tree unshare_expr (tree);
4828 extern void expand_expr_stmt (tree);
4829 extern int warn_if_unused_value (const_tree, location_t);
4830 extern void expand_label (tree);
4831 extern void expand_goto (tree);
4833 extern rtx expand_stack_save (void);
4834 extern void expand_stack_restore (tree);
4835 extern void expand_return (tree);
4838 extern void using_eh_for_cleanups (void);
4840 /* In fold-const.c */
4842 /* Non-zero if we are folding constants inside an initializer; zero
4844 extern int folding_initializer;
4846 /* Convert between trees and native memory representation. */
4847 extern int native_encode_expr (const_tree, unsigned char *, int);
4848 extern tree native_interpret_expr (tree, const unsigned char *, int);
4850 /* Fold constants as much as possible in an expression.
4851 Returns the simplified expression.
4852 Acts only on the top level of the expression;
4853 if the argument itself cannot be simplified, its
4854 subexpressions are not changed. */
4856 extern tree fold (tree);
4857 #define fold_unary(CODE,T1,T2)\
4858 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4859 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4860 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4861 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4862 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4863 #define fold_binary(CODE,T1,T2,T3)\
4864 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4865 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4866 #define fold_ternary(CODE,T1,T2,T3,T4)\
4867 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4868 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4869 #define fold_build1(c,t1,t2)\
4870 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4871 #define fold_build1_loc(l,c,t1,t2)\
4872 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4873 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4874 tree MEM_STAT_DECL);
4875 #define fold_build2(c,t1,t2,t3)\
4876 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4877 #define fold_build2_loc(l,c,t1,t2,t3)\
4878 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4879 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4880 tree MEM_STAT_DECL);
4881 #define fold_build3(c,t1,t2,t3,t4)\
4882 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4883 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4884 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4885 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4886 tree MEM_STAT_DECL);
4887 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4888 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4889 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4890 #define fold_build_call_array(T1,T2,N,T4)\
4891 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4892 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4893 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4894 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4895 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4896 extern bool fold_convertible_p (const_tree, const_tree);
4897 #define fold_convert(T1,T2)\
4898 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4899 extern tree fold_convert_loc (location_t, tree, tree);
4900 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4901 extern tree fold_ignored_result (tree);
4902 extern tree fold_abs_const (tree, tree);
4903 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4904 extern void fold_defer_overflow_warnings (void);
4905 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4906 extern void fold_undefer_and_ignore_overflow_warnings (void);
4907 extern bool fold_deferring_overflow_warnings_p (void);
4909 enum operand_equal_flag
4915 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4916 extern int multiple_of_p (tree, const_tree, const_tree);
4917 #define omit_one_operand(T1,T2,T3)\
4918 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4919 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4920 #define omit_two_operands(T1,T2,T3,T4)\
4921 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4922 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4923 #define invert_truthvalue(T)\
4924 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4925 extern tree invert_truthvalue_loc (location_t, tree);
4926 extern tree fold_truth_not_expr (location_t, tree);
4927 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4928 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4929 extern tree fold_read_from_constant_string (tree);
4930 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4931 #define build_fold_addr_expr(T)\
4932 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4933 extern tree build_fold_addr_expr_loc (location_t, tree);
4934 #define build_fold_addr_expr_with_type(T,TYPE)\
4935 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4936 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4937 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4938 extern tree fold_strip_sign_ops (tree);
4939 #define build_fold_indirect_ref(T)\
4940 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4941 extern tree build_fold_indirect_ref_loc (location_t, tree);
4942 #define fold_indirect_ref(T)\
4943 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4944 extern tree fold_indirect_ref_loc (location_t, tree);
4945 extern tree constant_boolean_node (int, tree);
4946 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
4948 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4949 extern enum tree_code swap_tree_comparison (enum tree_code);
4951 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4952 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4954 extern bool tree_expr_nonzero_p (tree);
4955 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4956 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4958 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4959 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4960 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4962 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4963 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4964 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
4966 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4968 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4969 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
4970 enum tree_code, tree, tree, tree);
4971 extern void debug_fold_checksum (const_tree);
4973 /* Return nonzero if CODE is a tree code that represents a truth value. */
4975 truth_value_p (enum tree_code code)
4977 return (TREE_CODE_CLASS (code) == tcc_comparison
4978 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4979 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4980 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4985 extern tree fold_call_expr (location_t, tree, bool);
4986 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4987 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4988 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4989 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4990 enum built_in_function);
4991 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4992 enum built_in_function);
4993 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
4994 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
4995 extern bool fold_builtin_next_arg (tree, bool);
4996 extern enum built_in_function builtin_mathfn_code (const_tree);
4997 extern tree build_function_call_expr (location_t, tree, tree);
4998 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4999 #define build_call_expr(...)\
5000 build_call_expr_loc (UNKNOWN_LOCATION, __VA_ARGS__)
5001 extern tree build_call_expr_loc (location_t, tree, int, ...);
5002 extern tree mathfn_built_in (tree, enum built_in_function fn);
5003 extern tree c_strlen (tree, int);
5004 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
5005 extern tree build_va_arg_indirect_ref (tree);
5006 extern tree build_string_literal (int, const char *);
5007 extern bool validate_arglist (const_tree, ...);
5008 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
5009 extern bool can_trust_pointer_alignment (void);
5010 extern int get_pointer_alignment (tree, unsigned int);
5011 extern bool is_builtin_name (const char *);
5012 extern bool is_builtin_fn (tree);
5013 extern int get_object_alignment (tree, unsigned int, unsigned int);
5014 extern tree fold_call_stmt (gimple, bool);
5015 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
5016 extern tree make_range (tree, int *, tree *, tree *, bool *);
5017 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
5018 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
5020 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
5023 extern tree strip_float_extensions (tree);
5026 extern int really_constant_p (const_tree);
5027 extern bool decl_address_invariant_p (const_tree);
5028 extern bool decl_address_ip_invariant_p (const_tree);
5029 extern int int_fits_type_p (const_tree, const_tree);
5030 #ifndef GENERATOR_FILE
5031 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5033 extern bool variably_modified_type_p (tree, tree);
5034 extern int tree_log2 (const_tree);
5035 extern int tree_floor_log2 (const_tree);
5036 extern int simple_cst_equal (const_tree, const_tree);
5037 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
5038 extern hashval_t iterative_hash_exprs_commutative (const_tree,
5039 const_tree, hashval_t);
5040 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5041 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
5042 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5043 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5044 extern int type_list_equal (const_tree, const_tree);
5045 extern int chain_member (const_tree, const_tree);
5046 extern tree type_hash_lookup (unsigned int, tree);
5047 extern void type_hash_add (unsigned int, tree);
5048 extern int simple_cst_list_equal (const_tree, const_tree);
5049 extern void dump_tree_statistics (void);
5050 extern void recompute_tree_invariant_for_addr_expr (tree);
5051 extern bool needs_to_live_in_memory (const_tree);
5052 extern tree reconstruct_complex_type (tree, tree);
5054 extern int real_onep (const_tree);
5055 extern int real_twop (const_tree);
5056 extern int real_minus_onep (const_tree);
5057 extern void init_ttree (void);
5058 extern void build_common_tree_nodes (bool);
5059 extern void build_common_tree_nodes_2 (int);
5060 extern void build_common_builtin_nodes (void);
5061 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5062 extern tree build_range_type (tree, tree, tree);
5063 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5064 extern HOST_WIDE_INT int_cst_value (const_tree);
5065 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
5067 extern bool fields_compatible_p (const_tree, const_tree);
5068 extern tree find_compatible_field (tree, tree);
5070 extern tree *tree_block (tree);
5071 extern location_t *block_nonartificial_location (tree);
5072 extern location_t tree_nonartificial_location (tree);
5074 extern tree block_ultimate_origin (const_tree);
5076 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
5078 /* In tree-nested.c */
5079 extern tree build_addr (tree, tree);
5082 extern void expand_main_function (void);
5083 extern void expand_function_end (void);
5084 extern void expand_function_start (tree);
5085 extern void stack_protect_prologue (void);
5086 extern void stack_protect_epilogue (void);
5087 extern void init_dummy_function_start (void);
5088 extern void expand_dummy_function_end (void);
5089 extern unsigned int init_function_for_compilation (void);
5090 extern void allocate_struct_function (tree, bool);
5091 extern void push_struct_function (tree fndecl);
5092 extern void init_function_start (tree);
5093 extern bool use_register_for_decl (const_tree);
5094 extern void generate_setjmp_warnings (void);
5095 extern void init_temp_slots (void);
5096 extern void free_temp_slots (void);
5097 extern void pop_temp_slots (void);
5098 extern void push_temp_slots (void);
5099 extern void preserve_temp_slots (rtx);
5100 extern int aggregate_value_p (const_tree, const_tree);
5101 extern void push_function_context (void);
5102 extern void pop_function_context (void);
5103 extern gimple_seq gimplify_parameters (void);
5105 /* In print-rtl.c */
5107 extern void print_rtl (FILE *, const_rtx);
5110 /* In print-tree.c */
5111 extern void debug_tree (tree);
5113 extern void dump_addr (FILE*, const char *, const void *);
5114 extern void print_node (FILE *, const char *, tree, int);
5115 extern void print_node_brief (FILE *, const char *, const_tree, int);
5116 extern void indent_to (FILE *, int);
5119 /* In tree-inline.c: */
5120 extern bool debug_find_tree (tree, tree);
5121 /* This is in tree-inline.c since the routine uses
5122 data structures from the inliner. */
5123 extern tree unsave_expr_now (tree);
5124 extern tree build_duplicate_type (tree);
5128 /* Nonzero if this is a call to a function whose return value depends
5129 solely on its arguments, has no side effects, and does not read
5130 global memory. This corresponds to TREE_READONLY for function
5132 #define ECF_CONST (1 << 0)
5133 /* Nonzero if this is a call to "pure" function (like const function,
5134 but may read memory. This corresponds to DECL_PURE_P for function
5136 #define ECF_PURE (1 << 1)
5137 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5138 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5139 for function decls.*/
5140 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5141 /* Nonzero if this call will never return. */
5142 #define ECF_NORETURN (1 << 3)
5143 /* Nonzero if this is a call to malloc or a related function. */
5144 #define ECF_MALLOC (1 << 4)
5145 /* Nonzero if it is plausible that this is a call to alloca. */
5146 #define ECF_MAY_BE_ALLOCA (1 << 5)
5147 /* Nonzero if this is a call to a function that won't throw an exception. */
5148 #define ECF_NOTHROW (1 << 6)
5149 /* Nonzero if this is a call to setjmp or a related function. */
5150 #define ECF_RETURNS_TWICE (1 << 7)
5151 /* Nonzero if this call replaces the current stack frame. */
5152 #define ECF_SIBCALL (1 << 8)
5153 /* Function does not read or write memory (but may have side effects, so
5154 it does not necessarily fit ECF_CONST). */
5155 #define ECF_NOVOPS (1 << 9)
5157 extern int flags_from_decl_or_type (const_tree);
5158 extern int call_expr_flags (const_tree);
5160 /* Call argument flags. */
5162 /* Nonzero if the argument is not dereferenced recursively, thus only
5163 directly reachable memory is read or written. */
5164 #define EAF_DIRECT (1 << 0)
5165 /* Nonzero if memory reached by the argument is not clobbered. */
5166 #define EAF_NOCLOBBER (1 << 1)
5167 /* Nonzero if the argument does not escape. */
5168 #define EAF_NOESCAPE (1 << 2)
5169 /* Nonzero if the argument is not used by the function. */
5170 #define EAF_UNUSED (1 << 3)
5172 /* Call return flags. */
5174 /* Mask for the argument number that is returned. Lower two bits of
5175 the return flags, encodes argument slots zero to three. */
5176 #define ERF_RETURN_ARG_MASK (3)
5177 /* Nonzero if the return value is equal to the argument number
5178 flags & ERF_RETURN_ARG_MASK. */
5179 #define ERF_RETURNS_ARG (1 << 2)
5180 /* Nonzero if the return value does not alias with anything. Functions
5181 with the malloc attribute have this set on their return value. */
5182 #define ERF_NOALIAS (1 << 3)
5184 extern int setjmp_call_p (const_tree);
5185 extern bool gimple_alloca_call_p (const_gimple);
5186 extern bool alloca_call_p (const_tree);
5187 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5188 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5192 extern const struct attribute_spec *lookup_attribute_spec (tree);
5194 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5195 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5196 it should be modified in place; if a TYPE, a copy should be created
5197 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5198 information, in the form of a bitwise OR of flags in enum attribute_flags
5199 from tree.h. Depending on these flags, some attributes may be
5200 returned to be applied at a later stage (for example, to apply
5201 a decl attribute to the declaration rather than to its type). */
5202 extern tree decl_attributes (tree *, tree, int);
5204 /* In integrate.c */
5205 extern void set_decl_abstract_flags (tree, int);
5206 extern void set_decl_origin_self (tree);
5208 /* In stor-layout.c */
5209 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5210 extern void fixup_signed_type (tree);
5211 extern void internal_reference_types (void);
5212 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5215 extern tree tree_output_constant_def (tree);
5216 extern void make_decl_rtl (tree);
5217 extern rtx make_decl_rtl_for_debug (tree);
5218 extern void make_decl_one_only (tree, tree);
5219 extern int supports_one_only (void);
5220 extern void resolve_unique_section (tree, int, int);
5221 extern void mark_referenced (tree);
5222 extern void mark_decl_referenced (tree);
5223 extern void notice_global_symbol (tree);
5224 extern void set_user_assembler_name (tree, const char *);
5225 extern void process_pending_assemble_externals (void);
5226 extern void finish_aliases_1 (void);
5227 extern void finish_aliases_2 (void);
5228 extern tree emutls_decl (tree);
5229 extern void remove_unreachable_alias_pairs (void);
5232 extern void expand_computed_goto (tree);
5233 extern bool parse_output_constraint (const char **, int, int, int,
5234 bool *, bool *, bool *);
5235 extern bool parse_input_constraint (const char **, int, int, int, int,
5236 const char * const *, bool *, bool *);
5237 extern void expand_asm_stmt (gimple);
5238 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5239 extern void expand_case (gimple);
5240 extern void expand_decl (tree);
5242 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5243 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5247 /* In dwarf2out.c */
5248 /* Interface of the DWARF2 unwind info support. */
5250 /* Generate a new label for the CFI info to refer to. */
5252 extern char *dwarf2out_cfi_label (bool);
5254 /* Entry point to update the canonical frame address (CFA). */
5256 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5258 /* Add the CFI for saving a register window. */
5260 extern void dwarf2out_window_save (const char *);
5262 /* Entry point for saving a register to the stack. */
5264 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5266 /* Entry point for saving the return address in the stack. */
5268 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5270 /* Entry point for saving the return address in a register. */
5272 extern void dwarf2out_return_reg (const char *, unsigned);
5274 /* Entry point for saving the first register into the second. */
5276 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5278 /* In tree-inline.c */
5280 /* The type of a set of already-visited pointers. Functions for creating
5281 and manipulating it are declared in pointer-set.h */
5282 struct pointer_set_t;
5284 /* The type of a callback function for walking over tree structure. */
5286 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5288 /* The type of a callback function that represents a custom walk_tree. */
5290 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5291 void *, struct pointer_set_t*);
5293 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5295 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5297 #define walk_tree(a,b,c,d) \
5298 walk_tree_1 (a, b, c, d, NULL)
5299 #define walk_tree_without_duplicates(a,b,c) \
5300 walk_tree_without_duplicates_1 (a, b, c, NULL)
5303 /* Assign the RTX to declaration. */
5305 extern void set_decl_rtl (tree, rtx);
5306 extern void set_decl_incoming_rtl (tree, rtx, bool);
5308 /* Enum and arrays used for tree allocation stats.
5309 Keep in sync with tree.c:tree_node_kind_names. */
5333 extern int tree_node_counts[];
5334 extern int tree_node_sizes[];
5336 /* True if we are in gimple form and the actions of the folders need to
5337 be restricted. False if we are not in gimple form and folding is not
5338 restricted to creating gimple expressions. */
5339 extern bool in_gimple_form;
5342 extern tree get_base_address (tree t);
5343 extern void mark_addressable (tree);
5345 /* In tree-vectorizer.c. */
5346 extern void vect_set_verbosity_level (const char *);
5350 struct GTY(()) tree_map_base {
5354 extern int tree_map_base_eq (const void *, const void *);
5355 extern unsigned int tree_map_base_hash (const void *);
5356 extern int tree_map_base_marked_p (const void *);
5357 extern bool list_equal_p (const_tree, const_tree);
5359 /* Map from a tree to another tree. */
5361 struct GTY(()) tree_map {
5362 struct tree_map_base base;
5367 #define tree_map_eq tree_map_base_eq
5368 extern unsigned int tree_map_hash (const void *);
5369 #define tree_map_marked_p tree_map_base_marked_p
5371 /* Map from a tree to an int. */
5373 struct GTY(()) tree_int_map {
5374 struct tree_map_base base;
5378 #define tree_int_map_eq tree_map_base_eq
5379 #define tree_int_map_hash tree_map_base_hash
5380 #define tree_int_map_marked_p tree_map_base_marked_p
5382 /* Map from a tree to initialization/finalization priorities. */
5384 struct GTY(()) tree_priority_map {
5385 struct tree_map_base base;
5390 #define tree_priority_map_eq tree_map_base_eq
5391 #define tree_priority_map_hash tree_map_base_hash
5392 #define tree_priority_map_marked_p tree_map_base_marked_p
5396 tree target_for_debug_bind (tree);
5398 /* In tree-ssa-address.c. */
5399 extern tree tree_mem_ref_addr (tree, tree);
5400 extern void copy_mem_ref_info (tree, tree);
5403 extern bool ssa_name_nonnegative_p (const_tree);
5405 /* In tree-object-size.c. */
5406 extern void init_object_sizes (void);
5407 extern void fini_object_sizes (void);
5408 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5411 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5412 extern tree build_personality_function (const char *);
5414 /* In tree-inline.c. */
5416 void init_inline_once (void);
5418 /* Compute the number of operands in an expression node NODE. For
5419 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5420 otherwise it is looked up from the node's code. */
5422 tree_operand_length (const_tree node)
5424 if (VL_EXP_CLASS_P (node))
5425 return VL_EXP_OPERAND_LENGTH (node);
5427 return TREE_CODE_LENGTH (TREE_CODE (node));
5430 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5431 have to go towards the end of tree.h so that union tree_node is fully
5432 defined by this point. */
5434 /* Structure containing iterator state. */
5435 typedef struct GTY (()) call_expr_arg_iterator_d {
5436 tree t; /* the call_expr */
5437 int n; /* argument count */
5438 int i; /* next argument index */
5439 } call_expr_arg_iterator;
5441 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5442 const_tree t; /* the call_expr */
5443 int n; /* argument count */
5444 int i; /* next argument index */
5445 } const_call_expr_arg_iterator;
5447 /* Initialize the abstract argument list iterator object ITER with the
5448 arguments from CALL_EXPR node EXP. */
5450 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5453 iter->n = call_expr_nargs (exp);
5458 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5461 iter->n = call_expr_nargs (exp);
5465 /* Return the next argument from abstract argument list iterator object ITER,
5466 and advance its state. Return NULL_TREE if there are no more arguments. */
5468 next_call_expr_arg (call_expr_arg_iterator *iter)
5471 if (iter->i >= iter->n)
5473 result = CALL_EXPR_ARG (iter->t, iter->i);
5478 static inline const_tree
5479 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5482 if (iter->i >= iter->n)
5484 result = CALL_EXPR_ARG (iter->t, iter->i);
5489 /* Initialize the abstract argument list iterator object ITER, then advance
5490 past and return the first argument. Useful in for expressions, e.g.
5491 for (arg = first_call_expr_arg (exp, &iter); arg;
5492 arg = next_call_expr_arg (&iter)) */
5494 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5496 init_call_expr_arg_iterator (exp, iter);
5497 return next_call_expr_arg (iter);
5500 static inline const_tree
5501 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5503 init_const_call_expr_arg_iterator (exp, iter);
5504 return next_const_call_expr_arg (iter);
5507 /* Test whether there are more arguments in abstract argument list iterator
5508 ITER, without changing its state. */
5510 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5512 return (iter->i < iter->n);
5516 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5518 return (iter->i < iter->n);
5521 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5522 (of type call_expr_arg_iterator) to hold the iteration state. */
5523 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5524 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5525 (arg) = next_call_expr_arg (&(iter)))
5527 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5528 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5529 (arg) = next_const_call_expr_arg (&(iter)))
5531 /* Return true if tree node T is a language-specific node. */
5533 is_lang_specific (tree t)
5535 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5538 #endif /* GCC_TREE_H */