1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
30 #include "double-int.h"
34 /* Codes of tree nodes */
36 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
37 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
40 #include "all-tree.def"
45 #undef END_OF_BASE_TREE_CODES
47 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
48 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
50 /* Number of language-independent tree codes. */
51 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
53 /* Tree code classes. */
55 /* Each tree_code has an associated code class represented by a
58 enum tree_code_class {
59 tcc_exceptional, /* An exceptional code (fits no category). */
60 tcc_constant, /* A constant. */
61 /* Order of tcc_type and tcc_declaration is important. */
62 tcc_type, /* A type object code. */
63 tcc_declaration, /* A declaration (also serving as variable refs). */
64 tcc_reference, /* A reference to storage. */
65 tcc_comparison, /* A comparison expression. */
66 tcc_unary, /* A unary arithmetic expression. */
67 tcc_binary, /* A binary arithmetic expression. */
68 tcc_statement, /* A statement expression, which have side effects
69 but usually no interesting value. */
70 tcc_vl_exp, /* A function call or other expression with a
71 variable-length operand vector. */
72 tcc_expression /* Any other expression. */
75 /* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
78 extern const char *const tree_code_class_strings[];
80 /* Returns the string representing CLASS. */
82 #define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
85 extern const enum tree_code_class tree_code_type[];
86 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
88 /* Nonzero if CODE represents an exceptional code. */
90 #define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
93 /* Nonzero if CODE represents a constant. */
95 #define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
98 /* Nonzero if CODE represents a type. */
100 #define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
103 /* Nonzero if CODE represents a declaration. */
105 #define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
108 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
110 #define VAR_OR_FUNCTION_DECL_P(DECL)\
111 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
113 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
114 ascending code order. */
116 #define INDIRECT_REF_P(CODE)\
117 (TREE_CODE (CODE) == INDIRECT_REF \
118 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
119 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
121 /* Nonzero if CODE represents a reference. */
123 #define REFERENCE_CLASS_P(CODE)\
124 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
126 /* Nonzero if CODE represents a comparison. */
128 #define COMPARISON_CLASS_P(CODE)\
129 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
131 /* Nonzero if CODE represents a unary arithmetic expression. */
133 #define UNARY_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
136 /* Nonzero if CODE represents a binary arithmetic expression. */
138 #define BINARY_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
141 /* Nonzero if CODE represents a statement expression. */
143 #define STATEMENT_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
146 /* Nonzero if CODE represents a function call-like expression with a
147 variable-length operand vector. */
149 #define VL_EXP_CLASS_P(CODE)\
150 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
152 /* Nonzero if CODE represents any other expression. */
154 #define EXPRESSION_CLASS_P(CODE)\
155 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
157 /* Returns nonzero iff CODE represents a type or declaration. */
159 #define IS_TYPE_OR_DECL_P(CODE)\
160 (TYPE_P (CODE) || DECL_P (CODE))
162 /* Returns nonzero iff CLASS is the tree-code class of an
165 #define IS_EXPR_CODE_CLASS(CLASS)\
166 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
168 /* Returns nonzero iff NODE is an expression of some kind. */
170 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
172 /* Number of argument-words in each kind of tree-node. */
174 extern const unsigned char tree_code_length[];
175 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
177 /* Names of tree components. */
179 extern const char *const tree_code_name[];
181 /* A vectors of trees. */
183 DEF_VEC_ALLOC_P(tree,gc);
184 DEF_VEC_ALLOC_P(tree,heap);
186 /* We have to be able to tell cgraph about the needed-ness of the target
187 of an alias. This requires that the decl have been defined. Aliases
188 that precede their definition have to be queued for later processing. */
190 typedef struct GTY(()) alias_pair
196 /* Define gc'd vector type. */
197 DEF_VEC_O(alias_pair);
198 DEF_VEC_ALLOC_O(alias_pair,gc);
200 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
203 /* Classify which part of the compiler has defined a given builtin function.
204 Note that we assume below that this is no more than two bits. */
213 /* Names for the above. */
214 extern const char *const built_in_class_names[4];
216 /* Codes that identify the various built in functions
217 so that expand_call can identify them quickly. */
219 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
220 enum built_in_function
222 #include "builtins.def"
224 /* Complex division routines in libgcc. These are done via builtins
225 because emit_library_call_value can't handle complex values. */
226 BUILT_IN_COMPLEX_MUL_MIN,
227 BUILT_IN_COMPLEX_MUL_MAX
228 = BUILT_IN_COMPLEX_MUL_MIN
229 + MAX_MODE_COMPLEX_FLOAT
230 - MIN_MODE_COMPLEX_FLOAT,
232 BUILT_IN_COMPLEX_DIV_MIN,
233 BUILT_IN_COMPLEX_DIV_MAX
234 = BUILT_IN_COMPLEX_DIV_MIN
235 + MAX_MODE_COMPLEX_FLOAT
236 - MIN_MODE_COMPLEX_FLOAT,
238 /* Upper bound on non-language-specific builtins. */
243 /* Names for the above. */
244 extern const char * built_in_names[(int) END_BUILTINS];
246 /* Helper macros for math builtins. */
248 #define BUILTIN_EXP10_P(FN) \
249 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
250 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
252 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
253 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
254 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
256 #define BUILTIN_SQRT_P(FN) \
257 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
259 #define BUILTIN_CBRT_P(FN) \
260 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
262 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
264 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
265 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
266 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
268 /* An array of _DECL trees for the above. */
269 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
270 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
272 /* In an OMP_CLAUSE node. */
274 /* Number of operands and names for each clause. */
275 extern unsigned const char omp_clause_num_ops[];
276 extern const char * const omp_clause_code_name[];
278 /* Clause codes. Do not reorder, as this is used to index into the tables
279 omp_clause_num_ops and omp_clause_code_name. */
282 /* Clause zero is special-cased inside the parser
283 (c_parser_omp_variable_list). */
284 OMP_CLAUSE_ERROR = 0,
286 /* OpenMP clause: private (variable_list). */
289 /* OpenMP clause: shared (variable_list). */
292 /* OpenMP clause: firstprivate (variable_list). */
293 OMP_CLAUSE_FIRSTPRIVATE,
295 /* OpenMP clause: lastprivate (variable_list). */
296 OMP_CLAUSE_LASTPRIVATE,
298 /* OpenMP clause: reduction (operator:variable_list).
299 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
300 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
301 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
303 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
304 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
305 OMP_CLAUSE_REDUCTION,
307 /* OpenMP clause: copyin (variable_list). */
310 /* OpenMP clause: copyprivate (variable_list). */
311 OMP_CLAUSE_COPYPRIVATE,
313 /* OpenMP clause: if (scalar-expression). */
316 /* OpenMP clause: num_threads (integer-expression). */
317 OMP_CLAUSE_NUM_THREADS,
319 /* OpenMP clause: schedule. */
322 /* OpenMP clause: nowait. */
325 /* OpenMP clause: ordered. */
328 /* OpenMP clause: default. */
331 /* OpenMP clause: collapse (constant-integer-expression). */
334 /* OpenMP clause: untied. */
338 /* The definition of tree nodes fills the next several pages. */
340 /* A tree node can represent a data type, a variable, an expression
341 or a statement. Each node has a TREE_CODE which says what kind of
342 thing it represents. Some common codes are:
343 INTEGER_TYPE -- represents a type of integers.
344 ARRAY_TYPE -- represents a type of pointer.
345 VAR_DECL -- represents a declared variable.
346 INTEGER_CST -- represents a constant integer value.
347 PLUS_EXPR -- represents a sum (an expression).
349 As for the contents of a tree node: there are some fields
350 that all nodes share. Each TREE_CODE has various special-purpose
351 fields as well. The fields of a node are never accessed directly,
352 always through accessor macros. */
354 /* Every kind of tree node starts with this structure,
355 so all nodes have these fields.
357 See the accessor macros, defined below, for documentation of the
360 struct GTY(()) tree_base {
361 ENUM_BITFIELD(tree_code) code : 16;
363 unsigned side_effects_flag : 1;
364 unsigned constant_flag : 1;
365 unsigned addressable_flag : 1;
366 unsigned volatile_flag : 1;
367 unsigned readonly_flag : 1;
368 unsigned unsigned_flag : 1;
369 unsigned asm_written_flag: 1;
370 unsigned nowarning_flag : 1;
372 unsigned used_flag : 1;
373 unsigned nothrow_flag : 1;
374 unsigned static_flag : 1;
375 unsigned public_flag : 1;
376 unsigned private_flag : 1;
377 unsigned protected_flag : 1;
378 unsigned deprecated_flag : 1;
379 unsigned saturating_flag : 1;
381 unsigned default_def_flag : 1;
382 unsigned lang_flag_0 : 1;
383 unsigned lang_flag_1 : 1;
384 unsigned lang_flag_2 : 1;
385 unsigned lang_flag_3 : 1;
386 unsigned lang_flag_4 : 1;
387 unsigned lang_flag_5 : 1;
388 unsigned lang_flag_6 : 1;
390 unsigned visited : 1;
391 unsigned packed_flag : 1;
392 unsigned user_align : 1;
396 /* This field is only used with type nodes; the only reason it is present
397 in tree_base instead of tree_type is to save space. The size of the
398 field must be large enough to hold addr_space_t values. */
399 unsigned address_space : 8;
402 struct GTY(()) tree_common {
403 struct tree_base base;
408 /* The following table lists the uses of each of the above flags and
409 for which types of nodes they are defined.
414 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
416 CONSTRUCTOR, IDENTIFIER_NODE
417 STMT_EXPR, it means we want the result of the enclosed expression
419 CALL_EXPR_TAILCALL in
428 VAR_DECL, FUNCTION_DECL
431 TREE_NO_TRAMPOLINE in
437 TREE_SYMBOL_REFERENCED in
441 TARGET_EXPR, WITH_CLEANUP_EXPR
443 TRY_CATCH_IS_CLEANUP in
449 TYPE_REF_CAN_ALIAS_ALL in
450 POINTER_TYPE, REFERENCE_TYPE
458 CALL_CANNOT_INLINE_P in
464 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
467 VAR_DECL, FUNCTION_DECL
473 CALL_EXPR_VA_ARG_PACK in
476 TYPE_CACHED_VALUES_P in
479 SAVE_EXPR_RESOLVED_P in
482 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
483 OMP_CLAUSE_LASTPRIVATE
485 OMP_CLAUSE_PRIVATE_DEBUG in
493 CALL_EXPR_RETURN_SLOT_OPT in
499 OMP_PARALLEL_COMBINED in
501 OMP_CLAUSE_PRIVATE_OUTER_REF in
525 TREE_THIS_VOLATILE in
548 TYPE_SIZES_GIMPLIFIED in
559 REGISTER_DEFS_IN_THIS_STMT in
560 all expressions (tree-into-ssa.c)
565 VAR_DECL, FUNCTION_DECL
566 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
567 BLOCK, SSA_NAME, STRING_CST
570 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
589 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
597 IDENTIFIER_TRANSPARENT_ALIAS in
600 STMT_IN_SSA_EDGE_WORKLIST in
601 all expressions (tree-ssa-propagate.c)
606 all trees (used liberally by many passes)
621 TYPE_VECTOR_OPAQUE in
624 SSA_NAME_IS_DEFAULT_DEF in
629 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
630 enum tree_node_structure_enum {
631 #include "treestruct.def"
636 /* Define accessors for the fields that all tree nodes have
637 (though some fields are not used for all kinds of nodes). */
639 /* The tree-code says what kind of node it is.
640 Codes are defined in tree.def. */
641 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
642 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
644 /* When checking is enabled, errors will be generated if a tree node
645 is accessed incorrectly. The macros die with a fatal error. */
646 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
648 #define TREE_CHECK(T, CODE) __extension__ \
649 ({ __typeof (T) const __t = (T); \
650 if (TREE_CODE (__t) != (CODE)) \
651 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
655 #define TREE_NOT_CHECK(T, CODE) __extension__ \
656 ({ __typeof (T) const __t = (T); \
657 if (TREE_CODE (__t) == (CODE)) \
658 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
662 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
663 ({ __typeof (T) const __t = (T); \
664 if (TREE_CODE (__t) != (CODE1) \
665 && TREE_CODE (__t) != (CODE2)) \
666 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
667 (CODE1), (CODE2), 0); \
670 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
671 ({ __typeof (T) const __t = (T); \
672 if (TREE_CODE (__t) == (CODE1) \
673 || TREE_CODE (__t) == (CODE2)) \
674 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
675 (CODE1), (CODE2), 0); \
678 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) != (CODE1) \
681 && TREE_CODE (__t) != (CODE2) \
682 && TREE_CODE (__t) != (CODE3)) \
683 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
684 (CODE1), (CODE2), (CODE3), 0); \
687 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
688 ({ __typeof (T) const __t = (T); \
689 if (TREE_CODE (__t) == (CODE1) \
690 || TREE_CODE (__t) == (CODE2) \
691 || TREE_CODE (__t) == (CODE3)) \
692 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
693 (CODE1), (CODE2), (CODE3), 0); \
696 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
697 ({ __typeof (T) const __t = (T); \
698 if (TREE_CODE (__t) != (CODE1) \
699 && TREE_CODE (__t) != (CODE2) \
700 && TREE_CODE (__t) != (CODE3) \
701 && TREE_CODE (__t) != (CODE4)) \
702 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
703 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
706 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
707 ({ __typeof (T) const __t = (T); \
708 if (TREE_CODE (__t) == (CODE1) \
709 || TREE_CODE (__t) == (CODE2) \
710 || TREE_CODE (__t) == (CODE3) \
711 || TREE_CODE (__t) == (CODE4)) \
712 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
713 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
716 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
717 ({ __typeof (T) const __t = (T); \
718 if (TREE_CODE (__t) != (CODE1) \
719 && TREE_CODE (__t) != (CODE2) \
720 && TREE_CODE (__t) != (CODE3) \
721 && TREE_CODE (__t) != (CODE4) \
722 && TREE_CODE (__t) != (CODE5)) \
723 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
724 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
727 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
728 ({ __typeof (T) const __t = (T); \
729 if (TREE_CODE (__t) == (CODE1) \
730 || TREE_CODE (__t) == (CODE2) \
731 || TREE_CODE (__t) == (CODE3) \
732 || TREE_CODE (__t) == (CODE4) \
733 || TREE_CODE (__t) == (CODE5)) \
734 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
735 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
738 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
739 ({ __typeof (T) const __t = (T); \
740 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
741 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
745 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
746 ({ __typeof (T) const __t = (T); \
747 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
748 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
752 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
753 ({ __typeof (T) const __t = (T); \
754 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
755 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
759 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
760 ({ __typeof (T) const __t = (T); \
761 if (TREE_CODE (__t) != OMP_CLAUSE) \
762 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
764 if (__t->omp_clause.code != (CODE)) \
765 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
769 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
770 ({ __typeof (T) const __t = (T); \
771 if (TREE_CODE (__t) != OMP_CLAUSE) \
772 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
774 if ((int) __t->omp_clause.code < (int) (CODE1) \
775 || (int) __t->omp_clause.code > (int) (CODE2)) \
776 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
777 __FUNCTION__, (CODE1), (CODE2)); \
780 /* These checks have to be special cased. */
781 #define EXPR_CHECK(T) __extension__ \
782 ({ __typeof (T) const __t = (T); \
783 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
784 if (!IS_EXPR_CODE_CLASS (__c)) \
785 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
789 /* These checks have to be special cased. */
790 #define NON_TYPE_CHECK(T) __extension__ \
791 ({ __typeof (T) const __t = (T); \
793 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
797 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
798 (*({__typeof (T) const __t = (T); \
799 const int __i = (I); \
800 if (TREE_CODE (__t) != TREE_VEC) \
801 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
803 if (__i < 0 || __i >= __t->vec.length) \
804 tree_vec_elt_check_failed (__i, __t->vec.length, \
805 __FILE__, __LINE__, __FUNCTION__); \
806 &__t->vec.a[__i]; }))
808 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
809 (*({__typeof (T) const __t = (T); \
810 const int __i = (I); \
811 if (TREE_CODE (__t) != OMP_CLAUSE) \
812 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
814 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
815 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
817 &__t->omp_clause.ops[__i]; }))
819 /* Special checks for TREE_OPERANDs. */
820 #define TREE_OPERAND_CHECK(T, I) __extension__ \
821 (*({__typeof (T) const __t = EXPR_CHECK (T); \
822 const int __i = (I); \
823 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
824 tree_operand_check_failed (__i, __t, \
825 __FILE__, __LINE__, __FUNCTION__); \
826 &__t->exp.operands[__i]; }))
828 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
829 (*({__typeof (T) const __t = (T); \
830 const int __i = (I); \
831 if (TREE_CODE (__t) != CODE) \
832 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
833 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
834 tree_operand_check_failed (__i, __t, \
835 __FILE__, __LINE__, __FUNCTION__); \
836 &__t->exp.operands[__i]; }))
838 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
840 ({__typeof (T) const __t = (T); \
841 const int __i = (I); \
842 if (TREE_CODE (__t) != (CODE)) \
843 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
844 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
845 tree_operand_check_failed (__i, __t, \
846 __FILE__, __LINE__, __FUNCTION__); \
847 &__t->exp.operands[__i]; }))
849 /* Nodes are chained together for many purposes.
850 Types are chained together to record them for being output to the debugger
851 (see the function `chain_type').
852 Decls in the same scope are chained together to record the contents
854 Statement nodes for successive statements used to be chained together.
855 Often lists of things are represented by TREE_LIST nodes that
856 are chained together. */
858 #define TREE_CHAIN(NODE) __extension__ \
859 (*({__typeof (NODE) const __t = (NODE); \
860 &__t->common.chain; }))
862 /* In all nodes that are expressions, this is the data type of the expression.
863 In POINTER_TYPE nodes, this is the type that the pointer points to.
864 In ARRAY_TYPE nodes, this is the type of the elements.
865 In VECTOR_TYPE nodes, this is the type of the elements. */
866 #define TREE_TYPE(NODE) __extension__ \
867 (*({__typeof (NODE) const __t = (NODE); \
868 &__t->common.type; }))
870 extern void tree_contains_struct_check_failed (const_tree,
871 const enum tree_node_structure_enum,
872 const char *, int, const char *)
875 extern void tree_check_failed (const_tree, const char *, int, const char *,
876 ...) ATTRIBUTE_NORETURN;
877 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
878 ...) ATTRIBUTE_NORETURN;
879 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
880 const char *, int, const char *)
882 extern void tree_range_check_failed (const_tree, const char *, int,
883 const char *, enum tree_code,
885 extern void tree_not_class_check_failed (const_tree,
886 const enum tree_code_class,
887 const char *, int, const char *)
889 extern void tree_vec_elt_check_failed (int, int, const char *,
892 extern void phi_node_elt_check_failed (int, int, const char *,
895 extern void tree_operand_check_failed (int, const_tree,
896 const char *, int, const char *)
898 extern void omp_clause_check_failed (const_tree, const char *, int,
899 const char *, enum omp_clause_code)
901 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
904 extern void omp_clause_range_check_failed (const_tree, const char *, int,
905 const char *, enum omp_clause_code,
906 enum omp_clause_code)
909 #else /* not ENABLE_TREE_CHECKING, or not gcc */
911 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
912 #define TREE_CHECK(T, CODE) (T)
913 #define TREE_NOT_CHECK(T, CODE) (T)
914 #define TREE_CHECK2(T, CODE1, CODE2) (T)
915 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
916 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
917 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
918 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
919 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
920 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
921 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
922 #define TREE_CLASS_CHECK(T, CODE) (T)
923 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
924 #define EXPR_CHECK(T) (T)
925 #define NON_TYPE_CHECK(T) (T)
926 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
927 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
928 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
929 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
930 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
931 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
932 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
934 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
935 #define TREE_TYPE(NODE) ((NODE)->common.type)
939 #define TREE_BLOCK(NODE) *(tree_block (NODE))
941 #include "tree-check.h"
943 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
944 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
945 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
946 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
947 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
948 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
949 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
950 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
951 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
952 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
953 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
955 #define RECORD_OR_UNION_CHECK(T) \
956 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
957 #define NOT_RECORD_OR_UNION_CHECK(T) \
958 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
960 #define NUMERICAL_TYPE_CHECK(T) \
961 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
964 /* Here is how primitive or already-canonicalized types' hash codes
966 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
968 /* A simple hash function for an arbitrary tree node. This must not be
969 used in hash tables which are saved to a PCH. */
970 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
972 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
973 #define CONVERT_EXPR_CODE_P(CODE) \
974 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
976 /* Similarly, but accept an expressions instead of a tree code. */
977 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
979 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
981 #define CASE_CONVERT \
985 /* Given an expression as a tree, strip any conversion that generates
986 no instruction. Accepts both tree and const_tree arguments since
987 we are not modifying the tree itself. */
989 #define STRIP_NOPS(EXP) \
990 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
992 /* Like STRIP_NOPS, but don't let the signedness change either. */
994 #define STRIP_SIGN_NOPS(EXP) \
995 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
997 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
999 #define STRIP_TYPE_NOPS(EXP) \
1000 while ((CONVERT_EXPR_P (EXP) \
1001 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1002 && TREE_OPERAND (EXP, 0) != error_mark_node \
1003 && (TREE_TYPE (EXP) \
1004 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1005 (EXP) = TREE_OPERAND (EXP, 0)
1007 /* Remove unnecessary type conversions according to
1008 tree_ssa_useless_type_conversion. */
1010 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1011 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1013 /* Nonzero if TYPE represents an integral type. Note that we do not
1014 include COMPLEX types here. Keep these checks in ascending code
1017 #define INTEGRAL_TYPE_P(TYPE) \
1018 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1019 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1020 || TREE_CODE (TYPE) == INTEGER_TYPE)
1022 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1024 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1025 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1027 /* Nonzero if TYPE represents a saturating fixed-point type. */
1029 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1030 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1032 /* Nonzero if TYPE represents a fixed-point type. */
1034 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1036 /* Nonzero if TYPE represents a scalar floating-point type. */
1038 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1040 /* Nonzero if TYPE represents a complex floating-point type. */
1042 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1043 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1044 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1046 /* Nonzero if TYPE represents a vector floating-point type. */
1048 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1049 (TREE_CODE (TYPE) == VECTOR_TYPE \
1050 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1052 /* Nonzero if TYPE represents a floating-point type, including complex
1053 and vector floating-point types. The vector and complex check does
1054 not use the previous two macros to enable early folding. */
1056 #define FLOAT_TYPE_P(TYPE) \
1057 (SCALAR_FLOAT_TYPE_P (TYPE) \
1058 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1059 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1060 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1062 /* Nonzero if TYPE represents a decimal floating-point type. */
1063 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1064 (SCALAR_FLOAT_TYPE_P (TYPE) \
1065 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1067 /* Nonzero if TYPE is a record or union type. */
1068 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1069 (TREE_CODE (TYPE) == RECORD_TYPE \
1070 || TREE_CODE (TYPE) == UNION_TYPE \
1071 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1073 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1074 Keep these checks in ascending code order. */
1076 #define AGGREGATE_TYPE_P(TYPE) \
1077 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1079 /* Nonzero if TYPE represents a pointer or reference type.
1080 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1081 ascending code order. */
1083 #define POINTER_TYPE_P(TYPE) \
1084 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1086 /* Nonzero if this type is a complete type. */
1087 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1089 /* Nonzero if this type is the (possibly qualified) void type. */
1090 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1092 /* Nonzero if this type is complete or is cv void. */
1093 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1094 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1096 /* Nonzero if this type is complete or is an array with unspecified bound. */
1097 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1098 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1101 /* Define many boolean fields that all tree nodes have. */
1103 /* In VAR_DECL nodes, nonzero means address of this is needed.
1104 So it cannot be in a register.
1105 In a FUNCTION_DECL, nonzero means its address is needed.
1106 So it must be compiled even if it is an inline function.
1107 In a FIELD_DECL node, it means that the programmer is permitted to
1108 construct the address of this field. This is used for aliasing
1109 purposes: see record_component_aliases.
1110 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1111 In LABEL_DECL nodes, it means a goto for this label has been seen
1112 from a place outside all binding contours that restore stack levels.
1113 In ..._TYPE nodes, it means that objects of this type must be fully
1114 addressable. This means that pieces of this object cannot go into
1115 register parameters, for example. If this a function type, this
1116 means that the value must be returned in memory.
1117 In IDENTIFIER_NODEs, this means that some extern decl for this name
1118 had its address taken. That matters for inline functions. */
1119 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1121 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1122 exit of a function. Calls for which this is true are candidates for tail
1123 call optimizations. */
1124 #define CALL_EXPR_TAILCALL(NODE) \
1125 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1127 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1128 CASE_LOW operand has been processed. */
1129 #define CASE_LOW_SEEN(NODE) \
1130 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1132 #define PREDICT_EXPR_OUTCOME(NODE) \
1133 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1134 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1135 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1136 #define PREDICT_EXPR_PREDICTOR(NODE) \
1137 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1139 /* In a VAR_DECL, nonzero means allocate static storage.
1140 In a FUNCTION_DECL, nonzero if function has been defined.
1141 In a CONSTRUCTOR, nonzero means allocate static storage. */
1142 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1144 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1145 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1147 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1148 should only be executed if an exception is thrown, not on normal exit
1150 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1152 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1153 separate cleanup in honor_protect_cleanup_actions. */
1154 #define TRY_CATCH_IS_CLEANUP(NODE) \
1155 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1157 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1158 CASE_HIGH operand has been processed. */
1159 #define CASE_HIGH_SEEN(NODE) \
1160 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1162 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1163 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1165 /* In an expr node (usually a conversion) this means the node was made
1166 implicitly and should not lead to any sort of warning. In a decl node,
1167 warnings concerning the decl should be suppressed. This is used at
1168 least for used-before-set warnings, and it set after one warning is
1170 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1172 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1173 this string as an argument. */
1174 #define TREE_SYMBOL_REFERENCED(NODE) \
1175 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1177 /* Nonzero in a pointer or reference type means the data pointed to
1178 by this type can alias anything. */
1179 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1180 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1182 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1183 #define MOVE_NONTEMPORAL(NODE) \
1184 (EXPR_CHECK (NODE)->base.static_flag)
1186 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1187 there was an overflow in folding. */
1189 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1191 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1193 #define TREE_OVERFLOW_P(EXPR) \
1194 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1196 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1197 nonzero means name is to be accessible from outside this translation unit.
1198 In an IDENTIFIER_NODE, nonzero means an external declaration
1199 accessible from outside this translation unit was previously seen
1200 for this name in an inner scope. */
1201 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1203 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1204 of cached values, or is something else. */
1205 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1207 /* In a SAVE_EXPR, indicates that the original expression has already
1208 been substituted with a VAR_DECL that contains the value. */
1209 #define SAVE_EXPR_RESOLVED_P(NODE) \
1210 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1212 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1214 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1215 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1217 /* In any expression, decl, or constant, nonzero means it has side effects or
1218 reevaluation of the whole expression could produce a different value.
1219 This is set if any subexpression is a function call, a side effect or a
1220 reference to a volatile variable. In a ..._DECL, this is set only if the
1221 declaration said `volatile'. This will never be set for a constant. */
1222 #define TREE_SIDE_EFFECTS(NODE) \
1223 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1225 /* In a LABEL_DECL, nonzero means this label had its address taken
1226 and therefore can never be deleted and is a jump target for
1228 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1230 /* Nonzero means this expression is volatile in the C sense:
1231 its address should be of type `volatile WHATEVER *'.
1232 In other words, the declared item is volatile qualified.
1233 This is used in _DECL nodes and _REF nodes.
1234 On a FUNCTION_DECL node, this means the function does not
1235 return normally. This is the same effect as setting
1236 the attribute noreturn on the function in C.
1238 In a ..._TYPE node, means this type is volatile-qualified.
1239 But use TYPE_VOLATILE instead of this macro when the node is a type,
1240 because eventually we may make that a different bit.
1242 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1243 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1245 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1246 accessing the memory pointed to won't generate a trap. However,
1247 this only applies to an object when used appropriately: it doesn't
1248 mean that writing a READONLY mem won't trap. Similarly for
1249 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1251 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1252 (or slice of the array) always belongs to the range of the array.
1253 I.e. that the access will not trap, provided that the access to
1254 the base to the array will not trap. */
1255 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1257 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1258 nonzero means it may not be the lhs of an assignment.
1259 Nonzero in a FUNCTION_DECL means this function should be treated
1260 as "const" function (can only read its arguments). */
1261 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1263 /* Value of expression is constant. Always on in all ..._CST nodes. May
1264 also appear in an expression or decl where the value is constant. */
1265 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1267 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1268 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1269 (TYPE_CHECK (NODE)->base.constant_flag)
1271 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1272 #define DECL_UNSIGNED(NODE) \
1273 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1275 /* In integral and pointer types, means an unsigned type. */
1276 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1278 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1279 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1280 This is interesting in an inline function, since it might not need
1281 to be compiled separately.
1282 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1283 if the debugging info for the type has been written.
1284 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1285 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1287 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1289 /* Nonzero in a _DECL if the name is used in its scope.
1290 Nonzero in an expr node means inhibit warning if value is unused.
1291 In IDENTIFIER_NODEs, this means that some extern decl for this name
1293 In a BLOCK, this means that the block contains variables that are used. */
1294 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1296 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1297 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1298 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1300 /* In a CALL_EXPR, means that it's safe to use the target of the call
1301 expansion as the return slot for a call that returns in memory. */
1302 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1303 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1305 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1306 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1308 #define DECL_BY_REFERENCE(NODE) \
1309 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1310 RESULT_DECL)->decl_common.decl_by_reference_flag)
1312 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1313 can be used as restricted tag to disambiguate against other restrict
1314 pointers. Used by fortran to capture something like non-addressability
1315 (which it isn't really because the middle-end does take addresses of
1317 #define DECL_RESTRICTED_P(NODE) \
1318 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1319 RESULT_DECL)->decl_common.decl_restricted_flag)
1321 #define DECL_READ_P(NODE) \
1322 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1324 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1325 thunked-to function. */
1326 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1328 /* In a type, nonzero means that all objects of the type are guaranteed by the
1329 language or front-end to be properly aligned, so we can indicate that a MEM
1330 of this type is aligned at least to the alignment of the type, even if it
1331 doesn't appear that it is. We see this, for example, in object-oriented
1332 languages where a tag field may show this is an object of a more-aligned
1333 variant of the more generic type.
1335 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1337 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1339 /* Used in classes in C++. */
1340 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1341 /* Used in classes in C++. */
1342 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1344 /* Nonzero in a _DECL if the use of the name is defined as a
1345 deprecated feature by __attribute__((deprecated)). */
1346 #define TREE_DEPRECATED(NODE) \
1347 ((NODE)->base.deprecated_flag)
1349 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1350 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1351 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1352 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1354 /* In fixed-point types, means a saturating type. */
1355 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1357 /* These flags are available for each language front end to use internally. */
1358 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1359 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1360 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1361 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1362 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1363 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1364 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1366 /* Define additional fields and accessors for nodes representing constants. */
1368 /* In an INTEGER_CST node. These two together make a 2-word integer.
1369 If the data type is signed, the value is sign-extended to 2 words
1370 even though not all of them may really be in use.
1371 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1372 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1373 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1374 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1376 #define INT_CST_LT(A, B) \
1377 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1378 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1379 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1381 #define INT_CST_LT_UNSIGNED(A, B) \
1382 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1383 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1384 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1385 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1386 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1388 struct GTY(()) tree_int_cst {
1389 struct tree_common common;
1393 /* In a REAL_CST node. struct real_value is an opaque entity, with
1394 manipulators defined in real.h. We don't want tree.h depending on
1395 real.h and transitively on tm.h. */
1398 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1399 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1401 struct GTY(()) tree_real_cst {
1402 struct tree_common common;
1403 struct real_value * real_cst_ptr;
1406 /* In a FIXED_CST node. */
1409 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1410 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1412 struct GTY(()) tree_fixed_cst {
1413 struct tree_common common;
1414 struct fixed_value * fixed_cst_ptr;
1417 /* In a STRING_CST */
1418 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1419 #define TREE_STRING_POINTER(NODE) \
1420 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1422 struct GTY(()) tree_string {
1423 struct tree_common common;
1428 /* In a COMPLEX_CST node. */
1429 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1430 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1432 struct GTY(()) tree_complex {
1433 struct tree_common common;
1438 /* In a VECTOR_CST node. */
1439 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1441 struct GTY(()) tree_vector {
1442 struct tree_common common;
1448 /* Define fields and accessors for some special-purpose tree nodes. */
1450 #define IDENTIFIER_LENGTH(NODE) \
1451 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1452 #define IDENTIFIER_POINTER(NODE) \
1453 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1454 #define IDENTIFIER_HASH_VALUE(NODE) \
1455 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1457 /* Translate a hash table identifier pointer to a tree_identifier
1458 pointer, and vice versa. */
1460 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1461 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1462 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1464 struct GTY(()) tree_identifier {
1465 struct tree_common common;
1466 struct ht_identifier id;
1469 /* In a TREE_LIST node. */
1470 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1471 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1473 struct GTY(()) tree_list {
1474 struct tree_common common;
1479 /* In a TREE_VEC node. */
1480 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1481 #define TREE_VEC_END(NODE) \
1482 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1484 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1486 struct GTY(()) tree_vec {
1487 struct tree_common common;
1489 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1492 /* In a CONSTRUCTOR node. */
1493 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1494 #define CONSTRUCTOR_ELT(NODE,IDX) \
1495 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1496 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1498 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1499 value of each element (stored within VAL). IX must be a scratch variable
1500 of unsigned integer type. */
1501 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1502 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1504 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1508 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1509 the value of each element (stored within VAL) and its index (stored
1510 within INDEX). IX must be a scratch variable of unsigned integer type. */
1511 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1512 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1514 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1515 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1519 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1520 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1522 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1523 _ce___->index = INDEX; \
1524 _ce___->value = VALUE; \
1527 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1528 constructor output purposes. */
1529 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1530 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1532 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1533 element. INDEX can optionally design the position of VALUE: in arrays,
1534 it is the index where VALUE has to be placed; in structures, it is the
1535 FIELD_DECL of the member. */
1536 typedef struct GTY(()) constructor_elt_d {
1541 DEF_VEC_O(constructor_elt);
1542 DEF_VEC_ALLOC_O(constructor_elt,gc);
1544 struct GTY(()) tree_constructor {
1545 struct tree_common common;
1546 VEC(constructor_elt,gc) *elts;
1549 /* Define fields and accessors for some nodes that represent expressions. */
1551 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1552 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1553 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1554 && integer_zerop (TREE_OPERAND (NODE, 0)))
1556 /* In ordinary expression nodes. */
1557 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1558 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1560 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1561 length. Its value includes the length operand itself; that is,
1562 the minimum valid length is 1.
1563 Note that we have to bypass the use of TREE_OPERAND to access
1564 that field to avoid infinite recursion in expanding the macros. */
1565 #define VL_EXP_OPERAND_LENGTH(NODE) \
1566 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1568 /* Nonzero if is_gimple_debug() may possibly hold. */
1569 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1571 /* In a LOOP_EXPR node. */
1572 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1574 /* The source location of this expression. Non-tree_exp nodes such as
1575 decls and constants can be shared among multiple locations, so
1577 #define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1578 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1579 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1580 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1581 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1583 /* True if a tree is an expression or statement that can have a
1585 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1587 extern void protected_set_expr_location (tree, location_t);
1589 /* In a TARGET_EXPR node. */
1590 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1591 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1592 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1594 /* DECL_EXPR accessor. This gives access to the DECL associated with
1595 the given declaration statement. */
1596 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1598 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1600 /* COMPOUND_LITERAL_EXPR accessors. */
1601 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1602 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1603 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1604 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1606 /* SWITCH_EXPR accessors. These give access to the condition, body and
1607 original condition type (before any compiler conversions)
1608 of the switch statement, respectively. */
1609 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1610 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1611 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1613 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1614 of a case label, respectively. */
1615 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1616 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1617 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1619 /* The operands of a TARGET_MEM_REF. */
1620 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1621 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1622 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1623 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1624 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1625 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1627 /* The operands of a BIND_EXPR. */
1628 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1629 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1630 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1632 /* GOTO_EXPR accessor. This gives access to the label associated with
1633 a goto statement. */
1634 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1636 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1637 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1638 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1640 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1641 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1642 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1643 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1644 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1645 /* Nonzero if we want to create an ASM_INPUT instead of an
1646 ASM_OPERAND with no operands. */
1647 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1648 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1650 /* COND_EXPR accessors. */
1651 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1652 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1653 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1655 /* Accessors for the chains of recurrences. */
1656 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1657 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1658 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1659 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1661 /* LABEL_EXPR accessor. This gives access to the label associated with
1662 the given label expression. */
1663 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1665 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1666 accessors for SSA operands. */
1668 /* CATCH_EXPR accessors. */
1669 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1670 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1672 /* EH_FILTER_EXPR accessors. */
1673 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1674 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1676 /* OBJ_TYPE_REF accessors. */
1677 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1678 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1679 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1681 /* ASSERT_EXPR accessors. */
1682 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1683 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1685 /* CALL_EXPR accessors.
1687 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1688 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1689 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1690 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1691 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1693 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1694 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1695 the argument count is zero when checking is enabled. Instead, do
1696 the pointer arithmetic to advance past the 3 fixed operands in a
1697 CALL_EXPR. That produces a valid pointer to just past the end of the
1698 operand array, even if it's not valid to dereference it. */
1699 #define CALL_EXPR_ARGP(NODE) \
1700 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1702 /* OpenMP directive and clause accessors. */
1704 #define OMP_BODY(NODE) \
1705 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1706 #define OMP_CLAUSES(NODE) \
1707 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1709 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1710 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1712 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1713 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1715 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1716 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1717 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1719 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1720 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1721 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1722 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1723 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1724 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1726 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1727 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1729 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1731 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1732 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1734 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1736 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1738 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1739 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1741 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1742 #define OMP_CLAUSE_DECL(NODE) \
1743 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1744 OMP_CLAUSE_PRIVATE, \
1745 OMP_CLAUSE_COPYPRIVATE), 0)
1746 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1747 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1748 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1750 /* True on an OMP_SECTION statement that was the last lexical member.
1751 This status is meaningful in the implementation of lastprivate. */
1752 #define OMP_SECTION_LAST(NODE) \
1753 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1755 /* True on an OMP_PARALLEL statement if it represents an explicit
1756 combined parallel work-sharing constructs. */
1757 #define OMP_PARALLEL_COMBINED(NODE) \
1758 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1760 /* True on a PRIVATE clause if its decl is kept around for debugging
1761 information only and its DECL_VALUE_EXPR is supposed to point
1762 to what it has been remapped to. */
1763 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1764 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1766 /* True on a PRIVATE clause if ctor needs access to outer region's
1768 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1769 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1771 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1772 decl is present in the chain. */
1773 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1774 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1775 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1776 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1777 OMP_CLAUSE_LASTPRIVATE),\
1779 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1780 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1782 #define OMP_CLAUSE_IF_EXPR(NODE) \
1783 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1784 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1785 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1786 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1787 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1789 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1790 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1791 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1792 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1793 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1794 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1796 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1797 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1798 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1799 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1800 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1801 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1802 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1803 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1804 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1805 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1806 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1807 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1809 enum omp_clause_schedule_kind
1811 OMP_CLAUSE_SCHEDULE_STATIC,
1812 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1813 OMP_CLAUSE_SCHEDULE_GUIDED,
1814 OMP_CLAUSE_SCHEDULE_AUTO,
1815 OMP_CLAUSE_SCHEDULE_RUNTIME
1818 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1819 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1821 enum omp_clause_default_kind
1823 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1824 OMP_CLAUSE_DEFAULT_SHARED,
1825 OMP_CLAUSE_DEFAULT_NONE,
1826 OMP_CLAUSE_DEFAULT_PRIVATE,
1827 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1830 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1831 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1833 struct GTY(()) tree_exp {
1834 struct tree_common common;
1837 tree GTY ((special ("tree_exp"),
1838 desc ("TREE_CODE ((tree) &%0)")))
1842 /* SSA_NAME accessors. */
1844 /* Returns the variable being referenced. Once released, this is the
1845 only field that can be relied upon. */
1846 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1848 /* Returns the statement which defines this SSA name. */
1849 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1851 /* Returns the SSA version number of this SSA name. Note that in
1852 tree SSA, version numbers are not per variable and may be recycled. */
1853 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1855 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1856 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1858 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1859 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1861 /* Nonzero if this SSA_NAME expression is currently on the free list of
1862 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1863 has no meaning for an SSA_NAME. */
1864 #define SSA_NAME_IN_FREE_LIST(NODE) \
1865 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1867 /* Nonzero if this SSA_NAME is the default definition for the
1868 underlying symbol. A default SSA name is created for symbol S if
1869 the very first reference to S in the function is a read operation.
1870 Default definitions are always created by an empty statement and
1871 belong to no basic block. */
1872 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1873 SSA_NAME_CHECK (NODE)->base.default_def_flag
1875 /* Attributes for SSA_NAMEs for pointer-type variables. */
1876 #define SSA_NAME_PTR_INFO(N) \
1877 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1879 #ifndef _TREE_FLOW_H
1880 struct ptr_info_def;
1885 /* Immediate use linking structure. This structure is used for maintaining
1886 a doubly linked list of uses of an SSA_NAME. */
1887 typedef struct GTY(()) ssa_use_operand_d {
1888 struct ssa_use_operand_d* GTY((skip(""))) prev;
1889 struct ssa_use_operand_d* GTY((skip(""))) next;
1890 /* Immediate uses for a given SSA name are maintained as a cyclic
1891 list. To recognize the root of this list, the location field
1892 needs to point to the original SSA name. Since statements and
1893 SSA names are of different data types, we need this union. See
1894 the explanation in struct immediate_use_iterator_d. */
1895 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1896 tree *GTY((skip(""))) use;
1897 } ssa_use_operand_t;
1899 /* Return the immediate_use information for an SSA_NAME. */
1900 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1902 struct GTY(()) tree_ssa_name {
1903 struct tree_common common;
1905 /* _DECL wrapped by this SSA name. */
1908 /* Statement that defines this SSA name. */
1911 /* SSA version number. */
1912 unsigned int version;
1914 /* Pointer attributes used for alias analysis. */
1915 struct ptr_info_def *ptr_info;
1917 /* Immediate uses list for this SSA_NAME. */
1918 struct ssa_use_operand_d imm_uses;
1921 struct GTY(()) phi_arg_d {
1922 /* imm_use MUST be the first element in struct because we do some
1923 pointer arithmetic with it. See phi_arg_index_from_use. */
1924 struct ssa_use_operand_d imm_use;
1930 #define OMP_CLAUSE_CODE(NODE) \
1931 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1933 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1934 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1936 #define OMP_CLAUSE_CODE(NODE) \
1937 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1939 #define OMP_CLAUSE_OPERAND(NODE, I) \
1940 OMP_CLAUSE_ELT_CHECK (NODE, I)
1942 struct GTY(()) tree_omp_clause {
1943 struct tree_common common;
1945 enum omp_clause_code code;
1946 union omp_clause_subcode {
1947 enum omp_clause_default_kind default_kind;
1948 enum omp_clause_schedule_kind schedule_kind;
1949 enum tree_code reduction_code;
1950 } GTY ((skip)) subcode;
1952 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1954 gimple_seq gimple_reduction_init;
1955 gimple_seq gimple_reduction_merge;
1957 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1961 struct varray_head_tag;
1963 /* In a BLOCK node. */
1964 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1965 #define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1966 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1967 #define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1968 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1969 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1970 /* Note: when changing this, make sure to find the places
1971 that use chainon or nreverse. */
1972 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1973 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1974 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1976 /* An index number for this block. These values are not guaranteed to
1977 be unique across functions -- whether or not they are depends on
1978 the debugging output format in use. */
1979 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1981 /* If block reordering splits a lexical block into discontiguous
1982 address ranges, we'll make a copy of the original block.
1984 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1985 In that case, we have one source block that has been replicated
1986 (through inlining or unrolling) into many logical blocks, and that
1987 these logical blocks have different physical variables in them.
1989 In this case, we have one logical block split into several
1990 non-contiguous address ranges. Most debug formats can't actually
1991 represent this idea directly, so we fake it by creating multiple
1992 logical blocks with the same variables in them. However, for those
1993 that do support non-contiguous regions, these allow the original
1994 logical block to be reconstructed, along with the set of address
1997 One of the logical block fragments is arbitrarily chosen to be
1998 the ORIGIN. The other fragments will point to the origin via
1999 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2000 be null. The list of fragments will be chained through
2001 BLOCK_FRAGMENT_CHAIN from the origin. */
2003 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2004 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2006 /* For an inlined function, this gives the location where it was called
2007 from. This is only set in the top level block, which corresponds to the
2008 inlined function scope. This is used in the debug output routines. */
2010 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2012 struct GTY(()) tree_block {
2013 struct tree_common common;
2015 unsigned abstract_flag : 1;
2016 unsigned block_num : 31;
2021 VEC(tree,gc) *nonlocalized_vars;
2025 tree abstract_origin;
2026 tree fragment_origin;
2027 tree fragment_chain;
2030 /* Define fields and accessors for nodes representing data types. */
2032 /* See tree.def for documentation of the use of these fields.
2033 Look at the documentation of the various ..._TYPE tree codes.
2035 Note that the type.values, type.minval, and type.maxval fields are
2036 overloaded and used for different macros in different kinds of types.
2037 Each macro must check to ensure the tree node is of the proper kind of
2038 type. Note also that some of the front-ends also overload these fields,
2039 so they must be checked as well. */
2041 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2042 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2043 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2044 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2045 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2046 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2047 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2048 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2049 (INTEGER_TYPE_CHECK (NODE)->type.values \
2050 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2051 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2052 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2053 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2054 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2055 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2056 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2057 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2058 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2059 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2060 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2061 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2062 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2063 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2064 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2065 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2066 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2067 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2068 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2069 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2070 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2071 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2073 /* Vector types need to check target flags to determine type. */
2074 extern enum machine_mode vector_type_mode (const_tree);
2075 #define TYPE_MODE(NODE) \
2076 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2077 ? vector_type_mode (NODE) : (NODE)->type.mode)
2078 #define SET_TYPE_MODE(NODE, MODE) \
2079 (TYPE_CHECK (NODE)->type.mode = (MODE))
2081 /* The "canonical" type for this type node, which can be used to
2082 compare the type for equality with another type. If two types are
2083 equal (based on the semantics of the language), then they will have
2084 equivalent TYPE_CANONICAL entries.
2086 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2087 be used for comparison against other types. Instead, the type is
2088 said to require structural equality checks, described in
2089 TYPE_STRUCTURAL_EQUALITY_P. */
2090 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2091 /* Indicates that the type node requires structural equality
2092 checks. The compiler will need to look at the composition of the
2093 type to determine whether it is equal to another type, rather than
2094 just comparing canonical type pointers. For instance, we would need
2095 to look at the return and parameter types of a FUNCTION_TYPE
2097 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2098 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2099 type node requires structural equality. */
2100 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2101 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2102 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2103 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2105 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2106 in the debugging output. We use this to describe a vector as a
2107 structure containing an array. */
2108 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2110 /* For record and union types, information about this type, as a base type
2112 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2114 /* For non record and union types, used in a language-dependent way. */
2115 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2117 /* The (language-specific) typed-based alias set for this type.
2118 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2119 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2120 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2121 type can alias objects of any type. */
2122 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2124 /* Nonzero iff the typed-based alias set for this type has been
2126 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2128 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2130 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2132 /* The alignment necessary for objects of this type.
2133 The value is an int, measured in bits. */
2134 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2136 /* 1 if the alignment for this type was requested by "aligned" attribute,
2137 0 if it is the default for this type. */
2138 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2140 /* The alignment for NODE, in bytes. */
2141 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2143 /* If your language allows you to declare types, and you want debug info
2144 for them, then you need to generate corresponding TYPE_DECL nodes.
2145 These "stub" TYPE_DECL nodes have no name, and simply point at the
2146 type node. You then set the TYPE_STUB_DECL field of the type node
2147 to point back at the TYPE_DECL node. This allows the debug routines
2148 to know that the two nodes represent the same type, so that we only
2149 get one debug info record for them. */
2150 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2152 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2153 has BLKmode only because it lacks the alignment requirement for
2155 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2157 /* In an INTEGER_TYPE, it means the type represents a size. We use
2158 this both for validity checking and to permit optimizations that
2159 are unsafe for other types. Note that the C `size_t' type should
2160 *not* have this flag set. The `size_t' type is simply a typedef
2161 for an ordinary integer type that happens to be the type of an
2162 expression returned by `sizeof'; `size_t' has no special
2163 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2164 always actual sizes. */
2165 #define TYPE_IS_SIZETYPE(NODE) \
2166 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2168 /* Nonzero in a type considered volatile as a whole. */
2169 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2171 /* Means this type is const-qualified. */
2172 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2174 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2176 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2178 /* The address space the type is in. */
2179 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2181 /* There is a TYPE_QUAL value for each type qualifier. They can be
2182 combined by bitwise-or to form the complete set of qualifiers for a
2185 #define TYPE_UNQUALIFIED 0x0
2186 #define TYPE_QUAL_CONST 0x1
2187 #define TYPE_QUAL_VOLATILE 0x2
2188 #define TYPE_QUAL_RESTRICT 0x4
2190 /* Encode/decode the named memory support as part of the qualifier. If more
2191 than 8 qualifiers are added, these macros need to be adjusted. */
2192 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2193 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2195 /* Return all qualifiers except for the address space qualifiers. */
2196 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2198 /* Only keep the address space out of the qualifiers and discard the other
2200 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2202 /* The set of type qualifiers for this type. */
2203 #define TYPE_QUALS(NODE) \
2204 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2205 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2206 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2207 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2209 /* The same as TYPE_QUALS without the address space qualifications. */
2210 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2211 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2212 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2213 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2215 /* These flags are available for each language front end to use internally. */
2216 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2217 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2218 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2219 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2220 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2221 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2222 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2224 /* Used to keep track of visited nodes in tree traversals. This is set to
2225 0 by copy_node and make_node. */
2226 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2228 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2229 that distinguish string from array of char).
2230 If set in a INTEGER_TYPE, indicates a character type. */
2231 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2233 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2234 object of the given ARRAY_TYPE. This allows temporaries to be
2236 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2237 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2239 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2240 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2241 (((unsigned HOST_WIDE_INT) 1) \
2242 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2244 /* Set precision to n when we have 2^n sub-parts of the vector. */
2245 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2246 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2248 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2249 about missing conversions to other vector types of the same size. */
2250 #define TYPE_VECTOR_OPAQUE(NODE) \
2251 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2253 /* Indicates that objects of this type must be initialized by calling a
2254 function when they are created. */
2255 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2256 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2258 /* Indicates that a UNION_TYPE object should be passed the same way that
2259 the first union alternative would be passed, or that a RECORD_TYPE
2260 object should be passed the same way that the first (and only) member
2262 #define TYPE_TRANSPARENT_AGGR(NODE) \
2263 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2265 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2266 address of a component of the type. This is the counterpart of
2267 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2268 #define TYPE_NONALIASED_COMPONENT(NODE) \
2269 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2271 /* Indicated that objects of this type should be laid out in as
2272 compact a way as possible. */
2273 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2275 /* Used by type_contains_placeholder_p to avoid recomputation.
2276 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2277 this field directly. */
2278 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2279 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2283 struct GTY(()) tree_type {
2284 struct tree_common common;
2291 unsigned int precision : 10;
2292 unsigned no_force_blk_flag : 1;
2293 unsigned needs_constructing_flag : 1;
2294 unsigned transparent_aggr_flag : 1;
2295 unsigned restrict_flag : 1;
2296 unsigned contains_placeholder_bits : 2;
2298 ENUM_BITFIELD(machine_mode) mode : 8;
2300 unsigned string_flag : 1;
2301 unsigned lang_flag_0 : 1;
2302 unsigned lang_flag_1 : 1;
2303 unsigned lang_flag_2 : 1;
2304 unsigned lang_flag_3 : 1;
2305 unsigned lang_flag_4 : 1;
2306 unsigned lang_flag_5 : 1;
2307 unsigned lang_flag_6 : 1;
2310 alias_set_type alias_set;
2313 union tree_type_symtab {
2314 int GTY ((tag ("0"))) address;
2315 const char * GTY ((tag ("1"))) pointer;
2316 struct die_struct * GTY ((tag ("2"))) die;
2317 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2318 descbits ("2"))) symtab;
2327 /* Points to a structure whose details depend on the language in use. */
2328 struct lang_type *lang_specific;
2331 /* Define accessor macros for information about type inheritance
2334 A "basetype" means a particular usage of a data type for inheritance
2335 in another type. Each such basetype usage has its own "binfo"
2336 object to describe it. The binfo object is a TREE_VEC node.
2338 Inheritance is represented by the binfo nodes allocated for a
2339 given type. For example, given types C and D, such that D is
2340 inherited by C, 3 binfo nodes will be allocated: one for describing
2341 the binfo properties of C, similarly one for D, and one for
2342 describing the binfo properties of D as a base type for C.
2343 Thus, given a pointer to class C, one can get a pointer to the binfo
2344 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2346 /* BINFO specific flags. */
2348 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2349 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2351 /* Flags for language dependent use. */
2352 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2353 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2354 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2355 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2356 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2357 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2358 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2360 /* The actual data type node being inherited in this basetype. */
2361 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2363 /* The offset where this basetype appears in its containing type.
2364 BINFO_OFFSET slot holds the offset (in bytes)
2365 from the base of the complete object to the base of the part of the
2366 object that is allocated on behalf of this `type'.
2367 This is always 0 except when there is multiple inheritance. */
2369 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2370 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2372 /* The virtual function table belonging to this basetype. Virtual
2373 function tables provide a mechanism for run-time method dispatching.
2374 The entries of a virtual function table are language-dependent. */
2376 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2378 /* The virtual functions in the virtual function table. This is
2379 a TREE_LIST that is used as an initial approximation for building
2380 a virtual function table for this basetype. */
2381 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2383 /* A vector of binfos for the direct basetypes inherited by this
2386 If this basetype describes type D as inherited in C, and if the
2387 basetypes of D are E and F, then this vector contains binfos for
2388 inheritance of E and F by C. */
2389 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2391 /* The number of basetypes for NODE. */
2392 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2394 /* Accessor macro to get to the Nth base binfo of this binfo. */
2395 #define BINFO_BASE_BINFO(NODE,N) \
2396 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2397 #define BINFO_BASE_ITERATE(NODE,N,B) \
2398 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2399 #define BINFO_BASE_APPEND(NODE,T) \
2400 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2402 /* For a BINFO record describing a virtual base class, i.e., one where
2403 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2404 base. The actual contents are language-dependent. In the C++
2405 front-end this field is an INTEGER_CST giving an offset into the
2406 vtable where the offset to the virtual base can be found. */
2407 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2409 /* Indicates the accesses this binfo has to its bases. The values are
2410 access_public_node, access_protected_node or access_private_node.
2411 If this array is not present, public access is implied. */
2412 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2414 #define BINFO_BASE_ACCESS(NODE,N) \
2415 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2416 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2417 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2419 /* The index in the VTT where this subobject's sub-VTT can be found.
2420 NULL_TREE if there is no sub-VTT. */
2421 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2423 /* The index in the VTT where the vptr for this subobject can be
2424 found. NULL_TREE if there is no secondary vptr in the VTT. */
2425 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2427 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2428 inheriting this base for non-virtual bases. For virtual bases it
2429 points either to the binfo for which this is a primary binfo, or to
2430 the binfo of the most derived type. */
2431 #define BINFO_INHERITANCE_CHAIN(NODE) \
2432 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2434 struct GTY (()) tree_binfo {
2435 struct tree_common common;
2441 VEC(tree,gc) *base_accesses;
2447 VEC(tree,none) base_binfos;
2451 /* Define fields and accessors for nodes representing declared names. */
2453 /* Nonzero if DECL represents a variable for the SSA passes. */
2454 #define SSA_VAR_P(DECL) \
2455 (TREE_CODE (DECL) == VAR_DECL \
2456 || TREE_CODE (DECL) == PARM_DECL \
2457 || TREE_CODE (DECL) == RESULT_DECL \
2458 || (TREE_CODE (DECL) == SSA_NAME \
2459 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2460 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2461 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2466 /* Enumerate visibility settings. */
2467 #ifndef SYMBOL_VISIBILITY_DEFINED
2468 #define SYMBOL_VISIBILITY_DEFINED
2469 enum symbol_visibility
2472 VISIBILITY_PROTECTED,
2481 /* This is the name of the object as written by the user.
2482 It is an IDENTIFIER_NODE. */
2483 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2485 /* Every ..._DECL node gets a unique number. */
2486 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2488 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2490 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2492 /* Every ..._DECL node gets a unique number that stays the same even
2493 when the decl is copied by the inliner once it is set. */
2494 #define DECL_PT_UID(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2495 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2496 #define SET_DECL_PT_UID(NODE, UID) (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2497 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2498 be preserved when copyin the decl. */
2499 #define DECL_PT_UID_SET_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2501 /* These two fields describe where in the source code the declaration
2502 was. If the declaration appears in several places (as for a C
2503 function that is declared first and then defined later), this
2504 information should refer to the definition. */
2505 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2506 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2507 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2508 #define DECL_IS_BUILTIN(DECL) \
2509 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2511 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2512 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2513 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2514 nodes, this points to either the FUNCTION_DECL for the containing
2515 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2516 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2518 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2519 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2520 struct GTY(()) tree_decl_minimal {
2521 struct tree_common common;
2529 /* For any sort of a ..._DECL node, this points to the original (abstract)
2530 decl node which this decl is an inlined/cloned instance of, or else it
2531 is NULL indicating that this decl is not an instance of some other decl.
2533 The C front-end also uses this in a nested declaration of an inline
2534 function, to point back to the definition. */
2535 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2537 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2538 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2539 #define DECL_ORIGIN(NODE) \
2540 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2542 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2543 inline instance of some original (abstract) decl from an inline function;
2544 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2545 nodes can also have their abstract origin set to themselves. */
2546 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2547 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2549 /* In a DECL this is the field where attributes are stored. */
2550 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2552 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2553 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2554 For a VAR_DECL, holds the initial value.
2555 For a PARM_DECL, used for DECL_ARG_TYPE--default
2556 values for parameters are encoded in the type of the function,
2557 not in the PARM_DECL slot.
2558 For a FIELD_DECL, this is used for enumeration values and the C
2559 frontend uses it for temporarily storing bitwidth of bitfields.
2561 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2562 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2564 /* Holds the size of the datum, in bits, as a tree expression.
2565 Need not be constant. */
2566 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2567 /* Likewise for the size in bytes. */
2568 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2569 /* Holds the alignment required for the datum, in bits. */
2570 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2571 /* The alignment of NODE, in bytes. */
2572 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2573 /* Set if the alignment of this DECL has been set by the user, for
2574 example with an 'aligned' attribute. */
2575 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2576 /* Holds the machine mode corresponding to the declaration of a variable or
2577 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2579 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2581 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2582 operation it is. Note, however, that this field is overloaded, with
2583 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2584 checked before any access to the former. */
2585 #define DECL_FUNCTION_CODE(NODE) \
2586 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2587 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2588 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2590 #define DECL_FUNCTION_PERSONALITY(NODE) \
2591 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2593 /* Nonzero for a given ..._DECL node means that the name of this node should
2594 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2595 the body of the function should also be ignored. */
2596 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2598 /* Nonzero for a given ..._DECL node means that this node represents an
2599 "abstract instance" of the given declaration (e.g. in the original
2600 declaration of an inline function). When generating symbolic debugging
2601 information, we mustn't try to generate any address information for nodes
2602 marked as "abstract instances" because we don't actually generate
2603 any code or allocate any data space for such instances. */
2604 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2606 /* Language-specific decl information. */
2607 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2609 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2610 do not allocate storage, and refer to a definition elsewhere. Note that
2611 this does not necessarily imply the entity represented by NODE
2612 has no program source-level definition in this translation unit. For
2613 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2614 DECL_EXTERNAL may be true simultaneously; that can be the case for
2615 a C99 "extern inline" function. */
2616 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2618 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2619 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2621 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2623 Also set in some languages for variables, etc., outside the normal
2624 lexical scope, such as class instance variables. */
2625 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2627 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2628 Used in FIELD_DECLs for vtable pointers.
2629 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2630 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2632 /* Used to indicate that this DECL represents a compiler-generated entity. */
2633 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2635 /* Additional flags for language-specific uses. */
2636 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2637 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2638 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2639 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2640 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2641 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2642 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2643 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2644 #define DECL_LANG_FLAG_8(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2646 /* Nonzero for a decl which is at file scope. */
2647 #define DECL_FILE_SCOPE_P(EXP) \
2648 (! DECL_CONTEXT (EXP) \
2649 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2651 /* Nonzero for a decl that is decorated using attribute used.
2652 This indicates to compiler tools that this decl needs to be preserved. */
2653 #define DECL_PRESERVE_P(DECL) \
2654 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2656 /* For function local variables of COMPLEX and VECTOR types,
2657 indicates that the variable is not aliased, and that all
2658 modifications to the variable have been adjusted so that
2659 they are killing assignments. Thus the variable may now
2660 be treated as a GIMPLE register, and use real instead of
2661 virtual ops in SSA form. */
2662 #define DECL_GIMPLE_REG_P(DECL) \
2663 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2665 struct GTY(()) tree_decl_common {
2666 struct tree_decl_minimal common;
2669 ENUM_BITFIELD(machine_mode) mode : 8;
2671 unsigned nonlocal_flag : 1;
2672 unsigned virtual_flag : 1;
2673 unsigned ignored_flag : 1;
2674 unsigned abstract_flag : 1;
2675 unsigned artificial_flag : 1;
2676 unsigned preserve_flag: 1;
2677 unsigned debug_expr_is_from : 1;
2679 unsigned lang_flag_0 : 1;
2680 unsigned lang_flag_1 : 1;
2681 unsigned lang_flag_2 : 1;
2682 unsigned lang_flag_3 : 1;
2683 unsigned lang_flag_4 : 1;
2684 unsigned lang_flag_5 : 1;
2685 unsigned lang_flag_6 : 1;
2686 unsigned lang_flag_7 : 1;
2687 unsigned lang_flag_8 : 1;
2689 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2690 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2691 unsigned decl_flag_0 : 1;
2692 /* In FIELD_DECL, this is DECL_BIT_FIELD
2693 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2694 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2695 unsigned decl_flag_1 : 1;
2696 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2697 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2698 unsigned decl_flag_2 : 1;
2699 /* Logically, these two would go in a theoretical base shared by var and
2701 unsigned gimple_reg_flag : 1;
2702 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2703 unsigned decl_by_reference_flag : 1;
2704 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2705 unsigned decl_restricted_flag : 1;
2707 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2709 unsigned decl_read_flag : 1;
2711 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2712 unsigned decl_common_unused : 1;
2714 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2715 unsigned int off_align : 8;
2717 /* 24-bits unused. */
2719 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2722 /* UID for points-to sets, stable over copying from inlining. */
2723 unsigned int pt_uid;
2728 tree abstract_origin;
2730 /* Points to a structure whose details depend on the language in use. */
2731 struct lang_decl *lang_specific;
2734 extern tree decl_value_expr_lookup (tree);
2735 extern void decl_value_expr_insert (tree, tree);
2737 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2738 if transformations have made this more complicated than evaluating the
2739 decl itself. This should only be used for debugging; once this field has
2740 been set, the decl itself may not legitimately appear in the function. */
2741 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2742 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2743 #define DECL_VALUE_EXPR(NODE) \
2744 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2745 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2746 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2748 /* Holds the RTL expression for the value of a variable or function.
2749 This value can be evaluated lazily for functions, variables with
2750 static storage duration, and labels. */
2751 #define DECL_RTL(NODE) \
2752 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2753 ? (NODE)->decl_with_rtl.rtl \
2754 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2756 /* Set the DECL_RTL for NODE to RTL. */
2757 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2759 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2760 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2762 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2763 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2765 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2766 NODE1, it will not be set for NODE2; this is a lazy copy. */
2767 #define COPY_DECL_RTL(NODE1, NODE2) \
2768 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2770 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2771 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2773 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2774 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2776 struct GTY(()) tree_decl_with_rtl {
2777 struct tree_decl_common common;
2781 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2782 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2783 of the structure. */
2784 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2786 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2787 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2788 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2789 natural alignment of the field's type). */
2790 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2792 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2793 if so, the type that was originally specified for it.
2794 TREE_TYPE may have been modified (in finish_struct). */
2795 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2797 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2798 if nonzero, indicates that the field occupies the type. */
2799 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2801 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2802 DECL_FIELD_OFFSET which are known to be always zero.
2803 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2805 #define DECL_OFFSET_ALIGN(NODE) \
2806 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2808 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2809 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2810 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2811 /* 1 if the alignment for this type was requested by "aligned" attribute,
2812 0 if it is the default for this type. */
2814 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2815 which this FIELD_DECL is defined. This information is needed when
2816 writing debugging information about vfield and vbase decls for C++. */
2817 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2819 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2820 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2822 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2824 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2826 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2827 this component. This makes it possible for Type-Based Alias Analysis
2828 to disambiguate accesses to this field with indirect accesses using
2831 struct S { int i; } s;
2834 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2836 From the implementation's viewpoint, the alias set of the type of the
2837 field 'i' (int) will not be recorded as a subset of that of the type of
2838 's' (struct S) in record_component_aliases. The counterpart is that
2839 accesses to s.i must not be given the alias set of the type of 'i'
2840 (int) but instead directly that of the type of 's' (struct S). */
2841 #define DECL_NONADDRESSABLE_P(NODE) \
2842 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2844 struct GTY(()) tree_field_decl {
2845 struct tree_decl_common common;
2848 tree bit_field_type;
2854 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2855 dense, unique within any one function, and may be used to index arrays.
2856 If the value is -1, then no UID has been assigned. */
2857 #define LABEL_DECL_UID(NODE) \
2858 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2860 /* In a LABEL_DECL, the EH region number for which the label is the
2861 post_landing_pad. */
2862 #define EH_LANDING_PAD_NR(NODE) \
2863 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2865 /* In LABEL_DECL nodes, nonzero means that an error message about
2866 jumping into such a binding contour has been printed for this label. */
2867 #define DECL_ERROR_ISSUED(NODE) \
2868 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2870 struct GTY(()) tree_label_decl {
2871 struct tree_decl_with_rtl common;
2873 int eh_landing_pad_nr;
2877 struct GTY(()) tree_result_decl {
2878 struct tree_decl_with_rtl common;
2879 struct var_ann_d *ann;
2882 struct GTY(()) tree_const_decl {
2883 struct tree_decl_with_rtl common;
2886 /* For a PARM_DECL, records the data type used to pass the argument,
2887 which may be different from the type seen in the program. */
2888 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2890 /* For PARM_DECL, holds an RTL for the stack slot or register
2891 where the data was actually passed. */
2892 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2894 struct GTY(()) tree_parm_decl {
2895 struct tree_decl_with_rtl common;
2897 struct var_ann_d *ann;
2901 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2902 this variable in a BIND_EXPR. */
2903 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2904 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2906 /* Used to indicate that the linkage status of this DECL is not yet known,
2907 so it should not be output now. */
2908 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2910 /* Nonzero for a given ..._DECL node means that no warnings should be
2911 generated just because this node is unused. */
2912 #define DECL_IN_SYSTEM_HEADER(NODE) \
2913 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2915 /* Used to indicate that this DECL has weak linkage. */
2916 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2918 /* Used to indicate that the DECL is a dllimport. */
2919 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2921 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2922 not be put out unless it is needed in this translation unit.
2923 Entities like this are shared across translation units (like weak
2924 entities), but are guaranteed to be generated by any translation
2925 unit that needs them, and therefore need not be put out anywhere
2926 where they are not needed. DECL_COMDAT is just a hint to the
2927 back-end; it is up to front-ends which set this flag to ensure
2928 that there will never be any harm, other than bloat, in putting out
2929 something which is DECL_COMDAT. */
2930 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2932 #define DECL_COMDAT_GROUP(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
2934 /* A replaceable function is one which may be replaced at link-time
2935 with an entirely different definition, provided that the
2936 replacement has the same type. For example, functions declared
2937 with __attribute__((weak)) on most systems are replaceable.
2939 COMDAT functions are not replaceable, since all definitions of the
2940 function must be equivalent. It is important that COMDAT functions
2941 not be treated as replaceable so that use of C++ template
2942 instantiations is not penalized.
2944 For example, DECL_REPLACEABLE is used to determine whether or not a
2945 function (including a template instantiation) which is not
2946 explicitly declared "inline" can be inlined. If the function is
2947 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2948 implementation chosen at link-time may be different. However, a
2949 function that is not DECL_REPLACEABLE can be inlined, since all
2950 versions of the function will be functionally identical. */
2951 #define DECL_REPLACEABLE_P(NODE) \
2952 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2954 /* The name of the object as the assembler will see it (but before any
2955 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2956 as DECL_NAME. It is an IDENTIFIER_NODE. */
2957 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
2959 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
2960 This is true of all DECL nodes except FIELD_DECL. */
2961 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2962 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
2964 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2965 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2967 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2968 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
2970 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2971 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2972 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
2974 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2975 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2976 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2977 semantics of using this macro, are different than saying:
2979 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
2981 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
2983 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2984 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2985 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2986 DECL_ASSEMBLER_NAME (DECL1)) \
2989 /* Records the section name in a section attribute. Used to pass
2990 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2991 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
2993 /* Value of the decls's visibility attribute */
2994 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2996 /* Nonzero means that the decl had its visibility specified rather than
2998 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3000 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3001 multiple translation units should be merged. */
3002 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3004 struct GTY(()) tree_decl_with_vis {
3005 struct tree_decl_with_rtl common;
3006 tree assembler_name;
3010 /* Belong to VAR_DECL exclusively. */
3011 unsigned defer_output : 1;
3012 unsigned hard_register : 1;
3013 unsigned thread_local : 1;
3014 unsigned common_flag : 1;
3015 unsigned in_text_section : 1;
3016 unsigned dllimport_flag : 1;
3017 /* Used by C++. Might become a generic decl flag. */
3018 unsigned shadowed_for_var_p : 1;
3019 /* Don't belong to VAR_DECL exclusively. */
3020 unsigned weak_flag : 1;
3022 unsigned seen_in_bind_expr : 1;
3023 unsigned comdat_flag : 1;
3024 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3025 unsigned visibility_specified : 1;
3026 /* Belongs to VAR_DECL exclusively. */
3027 ENUM_BITFIELD(tls_model) tls_model : 3;
3029 /* Belong to FUNCTION_DECL exclusively. */
3030 unsigned init_priority_p : 1;
3031 /* 15 unused bits. */
3034 /* In a VAR_DECL that's static,
3035 nonzero if the space is in the text section. */
3036 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3038 /* Nonzero for a given ..._DECL node means that this node should be
3039 put in .common, if possible. If a DECL_INITIAL is given, and it
3040 is not error_mark_node, then the decl cannot be put in .common. */
3041 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3043 /* In a VAR_DECL, nonzero if the decl is a register variable with
3044 an explicit asm specification. */
3045 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3047 extern tree decl_debug_expr_lookup (tree);
3048 extern void decl_debug_expr_insert (tree, tree);
3049 /* For VAR_DECL, this is set to either an expression that it was split
3050 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3051 subexpressions that it was split into. */
3052 #define DECL_DEBUG_EXPR(NODE) \
3053 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3055 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3056 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3058 /* An initialization priority. */
3059 typedef unsigned short priority_type;
3061 extern priority_type decl_init_priority_lookup (tree);
3062 extern priority_type decl_fini_priority_lookup (tree);
3063 extern void decl_init_priority_insert (tree, priority_type);
3064 extern void decl_fini_priority_insert (tree, priority_type);
3066 /* In a non-local VAR_DECL with static storage duration, true if the
3067 variable has an initialization priority. If false, the variable
3068 will be initialized at the DEFAULT_INIT_PRIORITY. */
3069 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3070 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3072 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3074 #define DECL_INIT_PRIORITY(NODE) \
3075 (decl_init_priority_lookup (NODE))
3076 /* Set the initialization priority for NODE to VAL. */
3077 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3078 (decl_init_priority_insert (NODE, VAL))
3080 /* For a FUNCTION_DECL the finalization priority of NODE. */
3081 #define DECL_FINI_PRIORITY(NODE) \
3082 (decl_fini_priority_lookup (NODE))
3083 /* Set the finalization priority for NODE to VAL. */
3084 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3085 (decl_fini_priority_insert (NODE, VAL))
3087 /* The initialization priority for entities for which no explicit
3088 initialization priority has been specified. */
3089 #define DEFAULT_INIT_PRIORITY 65535
3091 /* The maximum allowed initialization priority. */
3092 #define MAX_INIT_PRIORITY 65535
3094 /* The largest priority value reserved for use by system runtime
3096 #define MAX_RESERVED_INIT_PRIORITY 100
3098 /* In a VAR_DECL, the model to use if the data should be allocated from
3099 thread-local storage. */
3100 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3102 /* In a VAR_DECL, nonzero if the data should be allocated from
3103 thread-local storage. */
3104 #define DECL_THREAD_LOCAL_P(NODE) \
3105 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3107 #define DECL_VAR_ANN_PTR(NODE) \
3108 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3109 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3110 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3113 struct GTY(()) tree_var_decl {
3114 struct tree_decl_with_vis common;
3115 struct var_ann_d *ann;
3119 /* This field is used to reference anything in decl.result and is meant only
3120 for use by the garbage collector. */
3121 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3123 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3124 Before the struct containing the FUNCTION_DECL is laid out,
3125 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3126 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3127 function. When the class is laid out, this pointer is changed
3128 to an INTEGER_CST node which is suitable for use as an index
3129 into the virtual function table.
3130 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3131 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3134 tree_decl_non_common {
3135 struct tree_decl_with_vis common;
3136 /* C++ uses this in namespaces. */
3138 /* C++ uses this in templates. */
3140 /* Almost all FE's use this. */
3142 /* C++ uses this in namespaces. */
3146 /* In FUNCTION_DECL, holds the decl for the return value. */
3147 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3149 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3150 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3152 /* In a FUNCTION_DECL, the saved representation of the body of the
3154 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3156 /* Nonzero in a FUNCTION_DECL means this function should be treated
3157 as if it were a malloc, meaning it returns a pointer that is
3159 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3161 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3162 C++ operator new, meaning that it returns a pointer for which we
3163 should not use type based aliasing. */
3164 #define DECL_IS_OPERATOR_NEW(NODE) \
3165 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3167 /* Nonzero in a FUNCTION_DECL means this function may return more
3169 #define DECL_IS_RETURNS_TWICE(NODE) \
3170 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3172 /* Nonzero in a FUNCTION_DECL means this function should be treated
3173 as "pure" function (like const function, but may read global memory). */
3174 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3176 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3177 the const or pure function may not terminate. When this is nonzero
3178 for a const or pure function, it can be dealt with by cse passes
3179 but cannot be removed by dce passes since you are not allowed to
3180 change an infinite looping program into one that terminates without
3182 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3183 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3185 /* Nonzero in a FUNCTION_DECL means this function should be treated
3186 as "novops" function (function that does not read global memory,
3187 but may have arbitrary side effects). */
3188 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3190 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3191 at the beginning or end of execution. */
3192 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3193 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3195 #define DECL_STATIC_DESTRUCTOR(NODE) \
3196 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3198 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3199 be instrumented with calls to support routines. */
3200 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3201 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3203 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3204 disabled in this function. */
3205 #define DECL_NO_LIMIT_STACK(NODE) \
3206 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3208 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3209 #define DECL_STATIC_CHAIN(NODE) \
3210 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3212 /* Nonzero for a decl that cgraph has decided should be inlined into
3213 at least one call site. It is not meaningful to look at this
3214 directly; always use cgraph_function_possibly_inlined_p. */
3215 #define DECL_POSSIBLY_INLINED(DECL) \
3216 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3218 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3219 such as via the `inline' keyword in C/C++. This flag controls the linkage
3220 semantics of 'inline' */
3221 #define DECL_DECLARED_INLINE_P(NODE) \
3222 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3224 /* Nonzero in a FUNCTION_DECL means this function should not get
3225 -Winline warnings. */
3226 #define DECL_NO_INLINE_WARNING_P(NODE) \
3227 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3229 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3230 disregarding size and cost heuristics. This is equivalent to using
3231 the always_inline attribute without the required diagnostics if the
3232 function cannot be inlined. */
3233 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3234 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3236 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3237 that describes the status of this function. */
3238 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3240 /* In a FUNCTION_DECL, nonzero means a built in function. */
3241 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3243 /* For a builtin function, identify which part of the compiler defined it. */
3244 #define DECL_BUILT_IN_CLASS(NODE) \
3245 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3247 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3248 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3250 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3251 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3253 /* In FUNCTION_DECL, the function specific target options to use when compiling
3255 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3256 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3258 /* In FUNCTION_DECL, the function specific optimization options to use when
3259 compiling this function. */
3260 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3261 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3263 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3264 arguments/result/saved_tree fields by front ends. It was either inherit
3265 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3266 which seemed a bit strange. */
3268 struct GTY(()) tree_function_decl {
3269 struct tree_decl_non_common common;
3273 /* The personality function. Used for stack unwinding. */
3276 /* Function specific options that are used by this function. */
3277 tree function_specific_target; /* target options */
3278 tree function_specific_optimization; /* optimization options */
3280 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3281 DECL_FUNCTION_CODE. Otherwise unused.
3282 ??? The bitfield needs to be able to hold all target function
3284 ENUM_BITFIELD(built_in_function) function_code : 11;
3285 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3287 unsigned static_ctor_flag : 1;
3288 unsigned static_dtor_flag : 1;
3289 unsigned uninlinable : 1;
3291 unsigned possibly_inlined : 1;
3292 unsigned novops_flag : 1;
3293 unsigned returns_twice_flag : 1;
3294 unsigned malloc_flag : 1;
3295 unsigned operator_new_flag : 1;
3296 unsigned declared_inline_flag : 1;
3297 unsigned regdecl_flag : 1;
3299 unsigned no_inline_warning_flag : 1;
3300 unsigned no_instrument_function_entry_exit : 1;
3301 unsigned no_limit_stack : 1;
3302 unsigned disregard_inline_limits : 1;
3303 unsigned pure_flag : 1;
3304 unsigned looping_const_or_pure_flag : 1;
3310 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3311 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3313 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3314 into stabs. Instead it will generate cross reference ('x') of names.
3315 This uses the same flag as DECL_EXTERNAL. */
3316 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3317 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3319 /* Getter of the imported declaration associated to the
3320 IMPORTED_DECL node. */
3321 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3322 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3324 struct GTY(()) tree_type_decl {
3325 struct tree_decl_non_common common;
3329 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3330 To reduce overhead, the nodes containing the statements are not trees.
3331 This avoids the overhead of tree_common on all linked list elements.
3333 Use the interface in tree-iterator.h to access this node. */
3335 #define STATEMENT_LIST_HEAD(NODE) \
3336 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3337 #define STATEMENT_LIST_TAIL(NODE) \
3338 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3340 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3342 struct tree_statement_list_node *prev;
3343 struct tree_statement_list_node *next;
3347 struct GTY(()) tree_statement_list
3349 struct tree_common common;
3350 struct tree_statement_list_node *head;
3351 struct tree_statement_list_node *tail;
3355 /* Optimization options used by a function. */
3357 struct GTY(()) tree_optimization_option {
3358 struct tree_common common;
3360 /* The optimization options used by the user. */
3361 struct cl_optimization opts;
3364 #define TREE_OPTIMIZATION(NODE) \
3365 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3367 /* Return a tree node that encapsulates the current optimization options. */
3368 extern tree build_optimization_node (void);
3370 /* Target options used by a function. */
3372 struct GTY(()) tree_target_option {
3373 struct tree_common common;
3375 /* The optimization options used by the user. */
3376 struct cl_target_option opts;
3379 #define TREE_TARGET_OPTION(NODE) \
3380 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3382 /* Return a tree node that encapsulates the current target options. */
3383 extern tree build_target_option_node (void);
3386 /* Define the overall contents of a tree node.
3387 It may be any of the structures declared above
3388 for various types of node. */
3390 union GTY ((ptr_alias (union lang_tree_node),
3391 desc ("tree_node_structure (&%h)"))) tree_node {
3392 struct tree_base GTY ((tag ("TS_BASE"))) base;
3393 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3394 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3395 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3396 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3397 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3398 struct tree_string GTY ((tag ("TS_STRING"))) string;
3399 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3400 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3401 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3402 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3403 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3404 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3405 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3406 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3407 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3408 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3409 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3410 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3411 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3412 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3413 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3414 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3415 struct tree_list GTY ((tag ("TS_LIST"))) list;
3416 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3417 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3418 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3419 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3420 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3421 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3422 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3423 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3424 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3425 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3428 /* Standard named or nameless data types of the C compiler. */
3450 TI_INTEGER_MINUS_ONE,
3467 TI_COMPLEX_INTEGER_TYPE,
3468 TI_COMPLEX_FLOAT_TYPE,
3469 TI_COMPLEX_DOUBLE_TYPE,
3470 TI_COMPLEX_LONG_DOUBLE_TYPE,
3474 TI_LONG_DOUBLE_TYPE,
3478 TI_LONG_DOUBLE_PTR_TYPE,
3479 TI_INTEGER_PTR_TYPE,
3488 TI_VA_LIST_GPR_COUNTER_FIELD,
3489 TI_VA_LIST_FPR_COUNTER_FIELD,
3496 TI_DFLOAT32_PTR_TYPE,
3497 TI_DFLOAT64_PTR_TYPE,
3498 TI_DFLOAT128_PTR_TYPE,
3507 TI_SAT_LLFRACT_TYPE,
3508 TI_SAT_USFRACT_TYPE,
3510 TI_SAT_ULFRACT_TYPE,
3511 TI_SAT_ULLFRACT_TYPE,
3523 TI_SAT_LLACCUM_TYPE,
3524 TI_SAT_USACCUM_TYPE,
3526 TI_SAT_ULACCUM_TYPE,
3527 TI_SAT_ULLACCUM_TYPE,
3573 TI_OPTIMIZATION_DEFAULT,
3574 TI_OPTIMIZATION_CURRENT,
3575 TI_TARGET_OPTION_DEFAULT,
3576 TI_TARGET_OPTION_CURRENT,
3577 TI_CURRENT_TARGET_PRAGMA,
3578 TI_CURRENT_OPTIMIZE_PRAGMA,
3583 extern GTY(()) tree global_trees[TI_MAX];
3585 #define error_mark_node global_trees[TI_ERROR_MARK]
3587 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3588 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3589 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3590 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3591 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3593 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3594 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3595 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3596 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3597 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3599 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3600 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3602 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3603 #define integer_one_node global_trees[TI_INTEGER_ONE]
3604 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3605 #define size_zero_node global_trees[TI_SIZE_ZERO]
3606 #define size_one_node global_trees[TI_SIZE_ONE]
3607 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3608 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3609 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3611 /* Base access nodes. */
3612 #define access_public_node global_trees[TI_PUBLIC]
3613 #define access_protected_node global_trees[TI_PROTECTED]
3614 #define access_private_node global_trees[TI_PRIVATE]
3616 #define null_pointer_node global_trees[TI_NULL_POINTER]
3618 #define float_type_node global_trees[TI_FLOAT_TYPE]
3619 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3620 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3622 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3623 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3624 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3625 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3627 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3628 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3629 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3630 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3632 #define void_type_node global_trees[TI_VOID_TYPE]
3633 /* The C type `void *'. */
3634 #define ptr_type_node global_trees[TI_PTR_TYPE]
3635 /* The C type `const void *'. */
3636 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3637 /* The C type `size_t'. */
3638 #define size_type_node global_trees[TI_SIZE_TYPE]
3639 #define pid_type_node global_trees[TI_PID_TYPE]
3640 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3641 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3642 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3643 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3644 /* The C type `FILE *'. */
3645 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3647 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3648 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3649 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3651 /* The decimal floating point types. */
3652 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3653 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3654 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3655 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3656 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3657 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3659 /* The fixed-point types. */
3660 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3661 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3662 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3663 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3664 #define sat_unsigned_short_fract_type_node \
3665 global_trees[TI_SAT_USFRACT_TYPE]
3666 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3667 #define sat_unsigned_long_fract_type_node \
3668 global_trees[TI_SAT_ULFRACT_TYPE]
3669 #define sat_unsigned_long_long_fract_type_node \
3670 global_trees[TI_SAT_ULLFRACT_TYPE]
3671 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3672 #define fract_type_node global_trees[TI_FRACT_TYPE]
3673 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3674 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3675 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3676 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3677 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3678 #define unsigned_long_long_fract_type_node \
3679 global_trees[TI_ULLFRACT_TYPE]
3680 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3681 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3682 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3683 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3684 #define sat_unsigned_short_accum_type_node \
3685 global_trees[TI_SAT_USACCUM_TYPE]
3686 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3687 #define sat_unsigned_long_accum_type_node \
3688 global_trees[TI_SAT_ULACCUM_TYPE]
3689 #define sat_unsigned_long_long_accum_type_node \
3690 global_trees[TI_SAT_ULLACCUM_TYPE]
3691 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3692 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3693 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3694 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3695 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3696 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3697 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3698 #define unsigned_long_long_accum_type_node \
3699 global_trees[TI_ULLACCUM_TYPE]
3700 #define qq_type_node global_trees[TI_QQ_TYPE]
3701 #define hq_type_node global_trees[TI_HQ_TYPE]
3702 #define sq_type_node global_trees[TI_SQ_TYPE]
3703 #define dq_type_node global_trees[TI_DQ_TYPE]
3704 #define tq_type_node global_trees[TI_TQ_TYPE]
3705 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3706 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3707 #define usq_type_node global_trees[TI_USQ_TYPE]
3708 #define udq_type_node global_trees[TI_UDQ_TYPE]
3709 #define utq_type_node global_trees[TI_UTQ_TYPE]
3710 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3711 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3712 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3713 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3714 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3715 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3716 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3717 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3718 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3719 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3720 #define ha_type_node global_trees[TI_HA_TYPE]
3721 #define sa_type_node global_trees[TI_SA_TYPE]
3722 #define da_type_node global_trees[TI_DA_TYPE]
3723 #define ta_type_node global_trees[TI_TA_TYPE]
3724 #define uha_type_node global_trees[TI_UHA_TYPE]
3725 #define usa_type_node global_trees[TI_USA_TYPE]
3726 #define uda_type_node global_trees[TI_UDA_TYPE]
3727 #define uta_type_node global_trees[TI_UTA_TYPE]
3728 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3729 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3730 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3731 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3732 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3733 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3734 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3735 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3737 /* The node that should be placed at the end of a parameter list to
3738 indicate that the function does not take a variable number of
3739 arguments. The TREE_VALUE will be void_type_node and there will be
3740 no TREE_CHAIN. Language-independent code should not assume
3741 anything else about this node. */
3742 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3744 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3745 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3747 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3749 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3750 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3752 /* Default/current target options (TARGET_OPTION_NODE). */
3753 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3754 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3756 /* Default tree list option(), optimize() pragmas to be linked into the
3758 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3759 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3761 /* An enumeration of the standard C integer types. These must be
3762 ordered so that shorter types appear before longer ones, and so
3763 that signed types appear before unsigned ones, for the correct
3764 functioning of interpret_integer() in c-lex.c. */
3765 enum integer_type_kind
3777 itk_unsigned_long_long,
3781 typedef enum integer_type_kind integer_type_kind;
3783 /* The standard C integer types. Use integer_type_kind to index into
3785 extern GTY(()) tree integer_types[itk_none];
3787 #define char_type_node integer_types[itk_char]
3788 #define signed_char_type_node integer_types[itk_signed_char]
3789 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3790 #define short_integer_type_node integer_types[itk_short]
3791 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3792 #define integer_type_node integer_types[itk_int]
3793 #define unsigned_type_node integer_types[itk_unsigned_int]
3794 #define long_integer_type_node integer_types[itk_long]
3795 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3796 #define long_long_integer_type_node integer_types[itk_long_long]
3797 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3799 /* Set to the default thread-local storage (tls) model to use. */
3801 extern enum tls_model flag_tls_default;
3804 /* A pointer-to-function member type looks like:
3811 If __pfn is NULL, it is a NULL pointer-to-member-function.
3813 (Because the vtable is always the first thing in the object, we
3814 don't need its offset.) If the function is virtual, then PFN is
3815 one plus twice the index into the vtable; otherwise, it is just a
3816 pointer to the function.
3818 Unfortunately, using the lowest bit of PFN doesn't work in
3819 architectures that don't impose alignment requirements on function
3820 addresses, or that use the lowest bit to tell one ISA from another,
3821 for example. For such architectures, we use the lowest bit of
3822 DELTA instead of the lowest bit of the PFN, and DELTA will be
3825 enum ptrmemfunc_vbit_where_t
3827 ptrmemfunc_vbit_in_pfn,
3828 ptrmemfunc_vbit_in_delta
3831 #define NULL_TREE (tree) NULL
3833 extern tree decl_assembler_name (tree);
3834 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3835 extern hashval_t decl_assembler_name_hash (const_tree asmname);
3837 /* Compute the number of bytes occupied by 'node'. This routine only
3838 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3840 extern size_t tree_size (const_tree);
3842 /* Compute the number of bytes occupied by a tree with code CODE. This
3843 function cannot be used for TREE_VEC codes, which are of variable
3845 extern size_t tree_code_size (enum tree_code);
3847 /* Lowest level primitive for allocating a node.
3848 The TREE_CODE is the only argument. Contents are initialized
3849 to zero except for a few of the common fields. */
3851 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3852 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3854 /* Make a copy of a node, with all the same contents. */
3856 extern tree copy_node_stat (tree MEM_STAT_DECL);
3857 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3859 /* Make a copy of a chain of TREE_LIST nodes. */
3861 extern tree copy_list (tree);
3864 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3865 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3867 /* Make a TREE_VEC. */
3869 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3870 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3872 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3873 The name is supplied as a char *. */
3875 extern tree get_identifier (const char *);
3877 #if GCC_VERSION >= 3000
3878 #define get_identifier(str) \
3879 (__builtin_constant_p (str) \
3880 ? get_identifier_with_length ((str), strlen (str)) \
3881 : get_identifier (str))
3885 /* Identical to get_identifier, except that the length is assumed
3888 extern tree get_identifier_with_length (const char *, size_t);
3890 /* If an identifier with the name TEXT (a null-terminated string) has
3891 previously been referred to, return that node; otherwise return
3894 extern tree maybe_get_identifier (const char *);
3896 /* Construct various types of nodes. */
3898 extern tree build_nt (enum tree_code, ...);
3899 extern tree build_nt_call_list (tree, tree);
3900 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
3902 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3903 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3904 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3905 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3906 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3907 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3908 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3909 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3910 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3911 tree MEM_STAT_DECL);
3912 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3913 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3914 tree MEM_STAT_DECL);
3915 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3916 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3917 tree, tree MEM_STAT_DECL);
3918 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3919 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
3921 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
3922 #define build_var_debug_value(t1,t2) \
3923 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
3925 extern tree build_int_cst (tree, HOST_WIDE_INT);
3926 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3927 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3928 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3929 extern tree build_int_cst_wide_type (tree,
3930 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3931 extern tree build_vector (tree, tree);
3932 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3933 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3934 extern tree build_constructor_single (tree, tree, tree);
3935 extern tree build_constructor_from_list (tree, tree);
3936 extern tree build_real_from_int_cst (tree, const_tree);
3937 extern tree build_complex (tree, tree, tree);
3938 extern tree build_one_cst (tree);
3939 extern tree build_string (int, const char *);
3940 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3941 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3942 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
3943 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
3944 extern tree build_decl_stat (location_t, enum tree_code,
3945 tree, tree MEM_STAT_DECL);
3946 extern tree build_fn_decl (const char *, tree);
3947 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
3948 extern tree build_block (tree, tree, tree, tree);
3949 extern tree build_empty_stmt (location_t);
3950 extern tree build_omp_clause (location_t, enum omp_clause_code);
3952 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3953 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3955 extern tree build_call_list (tree, tree, tree);
3956 extern tree build_call_nary (tree, tree, int, ...);
3957 extern tree build_call_valist (tree, tree, int, va_list);
3958 #define build_call_array(T1,T2,N,T3)\
3959 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
3960 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
3961 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
3963 /* Construct various nodes representing data types. */
3965 extern tree make_signed_type (int);
3966 extern tree make_unsigned_type (int);
3967 extern tree signed_or_unsigned_type_for (int, tree);
3968 extern tree signed_type_for (tree);
3969 extern tree unsigned_type_for (tree);
3970 extern void initialize_sizetypes (void);
3971 extern void set_sizetype (tree);
3972 extern void fixup_unsigned_type (tree);
3973 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3974 extern tree build_pointer_type (tree);
3975 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3976 extern tree build_reference_type (tree);
3977 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3978 extern tree build_vector_type (tree innertype, int nunits);
3979 extern tree build_opaque_vector_type (tree innertype, int nunits);
3980 extern tree build_type_no_quals (tree);
3981 extern tree build_index_type (tree);
3982 extern tree build_index_2_type (tree, tree);
3983 extern tree build_array_type (tree, tree);
3984 extern tree build_function_type (tree, tree);
3985 extern tree build_function_type_list (tree, ...);
3986 extern tree build_function_type_skip_args (tree, bitmap);
3987 extern tree build_function_decl_skip_args (tree, bitmap);
3988 extern tree build_varargs_function_type_list (tree, ...);
3989 extern tree build_method_type_directly (tree, tree, tree);
3990 extern tree build_method_type (tree, tree);
3991 extern tree build_offset_type (tree, tree);
3992 extern tree build_complex_type (tree);
3993 extern tree array_type_nelts (const_tree);
3994 extern bool in_array_bounds_p (tree);
3995 extern bool range_in_array_bounds_p (tree);
3997 extern tree value_member (tree, tree);
3998 extern tree purpose_member (const_tree, tree);
3999 extern tree chain_index (int, tree);
4001 extern int attribute_list_equal (const_tree, const_tree);
4002 extern int attribute_list_contained (const_tree, const_tree);
4003 extern int tree_int_cst_equal (const_tree, const_tree);
4004 extern int tree_int_cst_lt (const_tree, const_tree);
4005 extern int tree_int_cst_compare (const_tree, const_tree);
4006 extern int host_integerp (const_tree, int);
4007 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4008 extern int tree_int_cst_msb (const_tree);
4009 extern int tree_int_cst_sgn (const_tree);
4010 extern int tree_int_cst_sign_bit (const_tree);
4011 extern unsigned int tree_int_cst_min_precision (tree, bool);
4012 extern bool tree_expr_nonnegative_p (tree);
4013 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4014 extern bool may_negate_without_overflow_p (const_tree);
4015 extern tree strip_array_types (tree);
4016 extern tree excess_precision_type (tree);
4018 /* Construct various nodes representing fract or accum data types. */
4020 extern tree make_fract_type (int, int, int);
4021 extern tree make_accum_type (int, int, int);
4023 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4024 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4025 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4026 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4027 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4028 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4029 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4030 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4032 #define make_or_reuse_signed_fract_type(P) \
4033 make_or_reuse_fract_type (P, 0, 0)
4034 #define make_or_reuse_unsigned_fract_type(P) \
4035 make_or_reuse_fract_type (P, 1, 0)
4036 #define make_or_reuse_sat_signed_fract_type(P) \
4037 make_or_reuse_fract_type (P, 0, 1)
4038 #define make_or_reuse_sat_unsigned_fract_type(P) \
4039 make_or_reuse_fract_type (P, 1, 1)
4040 #define make_or_reuse_signed_accum_type(P) \
4041 make_or_reuse_accum_type (P, 0, 0)
4042 #define make_or_reuse_unsigned_accum_type(P) \
4043 make_or_reuse_accum_type (P, 1, 0)
4044 #define make_or_reuse_sat_signed_accum_type(P) \
4045 make_or_reuse_accum_type (P, 0, 1)
4046 #define make_or_reuse_sat_unsigned_accum_type(P) \
4047 make_or_reuse_accum_type (P, 1, 1)
4049 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4050 put the prototype here. Rtl.h does declare the prototype if
4051 tree.h had been included. */
4053 extern tree make_tree (tree, rtx);
4055 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4058 Such modified types already made are recorded so that duplicates
4061 extern tree build_type_attribute_variant (tree, tree);
4062 extern tree build_decl_attribute_variant (tree, tree);
4063 extern tree build_type_attribute_qual_variant (tree, tree, int);
4065 /* Structure describing an attribute and a function to handle it. */
4066 struct attribute_spec
4068 /* The name of the attribute (without any leading or trailing __),
4069 or NULL to mark the end of a table of attributes. */
4070 const char *const name;
4071 /* The minimum length of the list of arguments of the attribute. */
4072 const int min_length;
4073 /* The maximum length of the list of arguments of the attribute
4074 (-1 for no maximum). */
4075 const int max_length;
4076 /* Whether this attribute requires a DECL. If it does, it will be passed
4077 from types of DECLs, function return types and array element types to
4078 the DECLs, function types and array types respectively; but when
4079 applied to a type in any other circumstances, it will be ignored with
4080 a warning. (If greater control is desired for a given attribute,
4081 this should be false, and the flags argument to the handler may be
4082 used to gain greater control in that case.) */
4083 const bool decl_required;
4084 /* Whether this attribute requires a type. If it does, it will be passed
4085 from a DECL to the type of that DECL. */
4086 const bool type_required;
4087 /* Whether this attribute requires a function (or method) type. If it does,
4088 it will be passed from a function pointer type to the target type,
4089 and from a function return type (which is not itself a function
4090 pointer type) to the function type. */
4091 const bool function_type_required;
4092 /* Function to handle this attribute. NODE points to the node to which
4093 the attribute is to be applied. If a DECL, it should be modified in
4094 place; if a TYPE, a copy should be created. NAME is the name of the
4095 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4096 of the arguments (which may be NULL). FLAGS gives further information
4097 about the context of the attribute. Afterwards, the attributes will
4098 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4099 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4100 as well as in any other cases when the attributes should not be added
4101 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4102 applied to another type or DECL later may be returned;
4103 otherwise the return value should be NULL_TREE. This pointer may be
4104 NULL if no special handling is required beyond the checks implied
4105 by the rest of this structure. */
4106 tree (*const handler) (tree *node, tree name, tree args,
4107 int flags, bool *no_add_attrs);
4110 /* Flags that may be passed in the third argument of decl_attributes, and
4111 to handler functions for attributes. */
4112 enum attribute_flags
4114 /* The type passed in is the type of a DECL, and any attributes that
4115 should be passed in again to be applied to the DECL rather than the
4116 type should be returned. */
4117 ATTR_FLAG_DECL_NEXT = 1,
4118 /* The type passed in is a function return type, and any attributes that
4119 should be passed in again to be applied to the function type rather
4120 than the return type should be returned. */
4121 ATTR_FLAG_FUNCTION_NEXT = 2,
4122 /* The type passed in is an array element type, and any attributes that
4123 should be passed in again to be applied to the array type rather
4124 than the element type should be returned. */
4125 ATTR_FLAG_ARRAY_NEXT = 4,
4126 /* The type passed in is a structure, union or enumeration type being
4127 created, and should be modified in place. */
4128 ATTR_FLAG_TYPE_IN_PLACE = 8,
4129 /* The attributes are being applied by default to a library function whose
4130 name indicates known behavior, and should be silently ignored if they
4131 are not in fact compatible with the function type. */
4132 ATTR_FLAG_BUILT_IN = 16
4135 /* Default versions of target-overridable functions. */
4137 extern tree merge_decl_attributes (tree, tree);
4138 extern tree merge_type_attributes (tree, tree);
4140 /* Given a tree node and a string, return nonzero if the tree node is
4141 a valid attribute name for the string. */
4143 extern int is_attribute_p (const char *, const_tree);
4145 /* Given an attribute name and a list of attributes, return the list element
4146 of the attribute or NULL_TREE if not found. */
4148 extern tree lookup_attribute (const char *, tree);
4150 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4153 extern tree remove_attribute (const char *, tree);
4155 /* Given two attributes lists, return a list of their union. */
4157 extern tree merge_attributes (tree, tree);
4159 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4160 /* Given two Windows decl attributes lists, possibly including
4161 dllimport, return a list of their union . */
4162 extern tree merge_dllimport_decl_attributes (tree, tree);
4164 /* Handle a "dllimport" or "dllexport" attribute. */
4165 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4168 /* Check whether CAND is suitable to be returned from get_qualified_type
4169 (BASE, TYPE_QUALS). */
4171 extern bool check_qualified_type (const_tree, const_tree, int);
4173 /* Return a version of the TYPE, qualified as indicated by the
4174 TYPE_QUALS, if one exists. If no qualified version exists yet,
4175 return NULL_TREE. */
4177 extern tree get_qualified_type (tree, int);
4179 /* Like get_qualified_type, but creates the type if it does not
4180 exist. This function never returns NULL_TREE. */
4182 extern tree build_qualified_type (tree, int);
4184 /* Like build_qualified_type, but only deals with the `const' and
4185 `volatile' qualifiers. This interface is retained for backwards
4186 compatibility with the various front-ends; new code should use
4187 build_qualified_type instead. */
4189 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4190 build_qualified_type ((TYPE), \
4191 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4192 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4194 /* Make a copy of a type node. */
4196 extern tree build_distinct_type_copy (tree);
4197 extern tree build_variant_type_copy (tree);
4199 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4200 fields. Optionally specify an alignment, and then lay it out. */
4202 extern void finish_builtin_struct (tree, const char *,
4205 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4206 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4207 node, does nothing except for the first time. */
4209 extern void layout_type (tree);
4211 /* These functions allow a front-end to perform a manual layout of a
4212 RECORD_TYPE. (For instance, if the placement of subsequent fields
4213 depends on the placement of fields so far.) Begin by calling
4214 start_record_layout. Then, call place_field for each of the
4215 fields. Then, call finish_record_layout. See layout_type for the
4216 default way in which these functions are used. */
4218 typedef struct record_layout_info_s
4220 /* The RECORD_TYPE that we are laying out. */
4222 /* The offset into the record so far, in bytes, not including bits in
4225 /* The last known alignment of SIZE. */
4226 unsigned int offset_align;
4227 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4229 /* The alignment of the record so far, in bits. */
4230 unsigned int record_align;
4231 /* The alignment of the record so far, ignoring #pragma pack and
4232 __attribute__ ((packed)), in bits. */
4233 unsigned int unpacked_align;
4234 /* The previous field layed out. */
4236 /* The static variables (i.e., class variables, as opposed to
4237 instance variables) encountered in T. */
4238 tree pending_statics;
4239 /* Bits remaining in the current alignment group */
4240 int remaining_in_alignment;
4241 /* True if we've seen a packed field that didn't have normal
4242 alignment anyway. */
4243 int packed_maybe_necessary;
4244 } *record_layout_info;
4246 extern record_layout_info start_record_layout (tree);
4247 extern tree bit_from_pos (tree, tree);
4248 extern tree byte_from_pos (tree, tree);
4249 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4250 extern void normalize_offset (tree *, tree *, unsigned int);
4251 extern tree rli_size_unit_so_far (record_layout_info);
4252 extern tree rli_size_so_far (record_layout_info);
4253 extern void normalize_rli (record_layout_info);
4254 extern void place_field (record_layout_info, tree);
4255 extern void compute_record_mode (tree);
4256 extern void finish_record_layout (record_layout_info, int);
4258 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4259 return a canonicalized ..._TYPE node, so that duplicates are not made.
4260 How the hash code is computed is up to the caller, as long as any two
4261 callers that could hash identical-looking type nodes agree. */
4263 extern tree type_hash_canon (unsigned int, tree);
4265 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4266 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4267 fields. Call this only once for any given decl node.
4269 Second argument is the boundary that this field can be assumed to
4270 be starting at (in bits). Zero means it can be assumed aligned
4271 on any boundary that may be needed. */
4273 extern void layout_decl (tree, unsigned);
4275 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4276 a previous call to layout_decl and calls it again. */
4278 extern void relayout_decl (tree);
4280 /* Return the mode for data of a given size SIZE and mode class CLASS.
4281 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4282 The value is BLKmode if no other mode is found. This is like
4283 mode_for_size, but is passed a tree. */
4285 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4287 /* Return an expr equal to X but certainly not valid as an lvalue. */
4289 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4290 extern tree non_lvalue_loc (location_t, tree);
4292 extern tree convert (tree, tree);
4293 extern unsigned int expr_align (const_tree);
4294 extern tree expr_first (tree);
4295 extern tree expr_last (tree);
4296 extern tree size_in_bytes (const_tree);
4297 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4298 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4299 extern tree tree_expr_size (const_tree);
4300 extern tree bit_position (const_tree);
4301 extern HOST_WIDE_INT int_bit_position (const_tree);
4302 extern tree byte_position (const_tree);
4303 extern HOST_WIDE_INT int_byte_position (const_tree);
4305 /* Define data structures, macros, and functions for handling sizes
4306 and the various types used to represent sizes. */
4310 SIZETYPE, /* Normal representation of sizes in bytes. */
4311 SSIZETYPE, /* Signed representation of sizes in bytes. */
4312 BITSIZETYPE, /* Normal representation of sizes in bits. */
4313 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4316 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4318 #define sizetype sizetype_tab[(int) SIZETYPE]
4319 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4320 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4321 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4323 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4324 #define size_binop(CODE,T1,T2)\
4325 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4326 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4327 #define size_diffop(T1,T2)\
4328 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4329 extern tree size_diffop_loc (location_t, tree, tree);
4331 #define size_int(L) size_int_kind (L, SIZETYPE)
4332 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4333 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4334 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4336 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4337 extern tree round_up_loc (location_t, tree, int);
4338 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4339 extern tree round_down_loc (location_t, tree, int);
4340 extern tree get_pending_sizes (void);
4341 extern void put_pending_size (tree);
4342 extern void put_pending_sizes (tree);
4343 extern void finalize_size_functions (void);
4345 /* Type for sizes of data-type. */
4347 #define BITS_PER_UNIT_LOG \
4348 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4349 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4350 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4352 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4353 extern unsigned int maximum_field_alignment;
4354 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4355 extern unsigned int initial_max_fld_align;
4357 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4358 by making the last node in X point to Y.
4359 Returns X, except if X is 0 returns Y. */
4361 extern tree chainon (tree, tree);
4363 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4365 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4366 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4368 /* Return the last tree node in a chain. */
4370 extern tree tree_last (tree);
4372 /* Reverse the order of elements in a chain, and return the new head. */
4374 extern tree nreverse (tree);
4376 /* Returns the length of a chain of nodes
4377 (number of chain pointers to follow before reaching a null pointer). */
4379 extern int list_length (const_tree);
4381 /* Returns the number of FIELD_DECLs in a type. */
4383 extern int fields_length (const_tree);
4385 /* Returns the first FIELD_DECL in a type. */
4387 extern tree first_field (const_tree);
4389 /* Given an initializer INIT, return TRUE if INIT is zero or some
4390 aggregate of zeros. Otherwise return FALSE. */
4392 extern bool initializer_zerop (const_tree);
4394 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4396 extern tree ctor_to_list (tree);
4398 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4400 extern VEC(tree,gc) *ctor_to_vec (tree);
4402 /* Examine CTOR to discover:
4403 * how many scalar fields are set to nonzero values,
4404 and place it in *P_NZ_ELTS;
4405 * how many scalar fields in total are in CTOR,
4406 and place it in *P_ELT_COUNT.
4407 * if a type is a union, and the initializer from the constructor
4408 is not the largest element in the union, then set *p_must_clear.
4410 Return whether or not CTOR is a valid static constant initializer, the same
4411 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4413 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4416 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4418 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4420 extern int integer_zerop (const_tree);
4422 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4424 extern int integer_onep (const_tree);
4426 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4427 all of whose significant bits are 1. */
4429 extern int integer_all_onesp (const_tree);
4431 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4432 exactly one bit 1. */
4434 extern int integer_pow2p (const_tree);
4436 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4437 with a nonzero value. */
4439 extern int integer_nonzerop (const_tree);
4441 extern bool cst_and_fits_in_hwi (const_tree);
4442 extern tree num_ending_zeros (const_tree);
4444 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4447 extern int fixed_zerop (const_tree);
4449 /* staticp (tree x) is nonzero if X is a reference to data allocated
4450 at a fixed address in memory. Returns the outermost data. */
4452 extern tree staticp (tree);
4454 /* save_expr (EXP) returns an expression equivalent to EXP
4455 but it can be used multiple times within context CTX
4456 and only evaluate EXP once. */
4458 extern tree save_expr (tree);
4460 /* Look inside EXPR and into any simple arithmetic operations. Return
4461 the innermost non-arithmetic node. */
4463 extern tree skip_simple_arithmetic (tree);
4465 /* Return which tree structure is used by T. */
4467 enum tree_node_structure_enum tree_node_structure (const_tree);
4469 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4470 or offset that depends on a field within a record.
4472 Note that we only allow such expressions within simple arithmetic
4475 extern bool contains_placeholder_p (const_tree);
4477 /* This macro calls the above function but short-circuits the common
4478 case of a constant to save time. Also check for null. */
4480 #define CONTAINS_PLACEHOLDER_P(EXP) \
4481 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4483 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4484 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4487 extern bool type_contains_placeholder_p (tree);
4489 /* Given a tree EXP, find all occurences of references to fields
4490 in a PLACEHOLDER_EXPR and place them in vector REFS without
4491 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4492 we assume here that EXP contains only arithmetic expressions
4493 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4496 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4498 /* This macro calls the above function but short-circuits the common
4499 case of a constant to save time and also checks for NULL. */
4501 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4503 if((EXP) && !TREE_CONSTANT (EXP)) \
4504 find_placeholder_in_expr (EXP, V); \
4507 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4508 return a tree with all occurrences of references to F in a
4509 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4510 CONST_DECLs. Note that we assume here that EXP contains only
4511 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4512 occurring only in their argument list. */
4514 extern tree substitute_in_expr (tree, tree, tree);
4516 /* This macro calls the above function but short-circuits the common
4517 case of a constant to save time and also checks for NULL. */
4519 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4520 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4522 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4523 for it within OBJ, a tree that is an object or a chain of references. */
4525 extern tree substitute_placeholder_in_expr (tree, tree);
4527 /* This macro calls the above function but short-circuits the common
4528 case of a constant to save time and also checks for NULL. */
4530 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4531 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4532 : substitute_placeholder_in_expr (EXP, OBJ))
4534 /* variable_size (EXP) is like save_expr (EXP) except that it
4535 is for the special case of something that is part of a
4536 variable size for a data type. It makes special arrangements
4537 to compute the value at the right time when the data type
4538 belongs to a function parameter. */
4540 extern tree variable_size (tree);
4542 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4543 but it can be used multiple times
4544 and only evaluate the subexpressions once. */
4546 extern tree stabilize_reference (tree);
4548 /* Subroutine of stabilize_reference; this is called for subtrees of
4549 references. Any expression with side-effects must be put in a SAVE_EXPR
4550 to ensure that it is only evaluated once. */
4552 extern tree stabilize_reference_1 (tree);
4554 /* Return EXP, stripped of any conversions to wider types
4555 in such a way that the result of converting to type FOR_TYPE
4556 is the same as if EXP were converted to FOR_TYPE.
4557 If FOR_TYPE is 0, it signifies EXP's type. */
4559 extern tree get_unwidened (tree, tree);
4561 /* Return OP or a simpler expression for a narrower value
4562 which can be sign-extended or zero-extended to give back OP.
4563 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4564 or 0 if the value should be sign-extended. */
4566 extern tree get_narrower (tree, int *);
4568 /* Return true if T is an expression that get_inner_reference handles. */
4571 handled_component_p (const_tree t)
4573 switch (TREE_CODE (t))
4578 case ARRAY_RANGE_REF:
4579 case VIEW_CONVERT_EXPR:
4589 /* Given an expression EXP that is a handled_component_p,
4590 look for the ultimate containing object, which is returned and specify
4591 the access position and size. */
4593 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4594 tree *, enum machine_mode *, int *, int *,
4597 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4598 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4599 EXP is marked as PACKED. */
4601 extern bool contains_packed_reference (const_tree exp);
4603 /* Return a tree of sizetype representing the size, in bytes, of the element
4604 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4606 extern tree array_ref_element_size (tree);
4608 /* Return a tree representing the lower bound of the array mentioned in
4609 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4611 extern tree array_ref_low_bound (tree);
4613 /* Return a tree representing the upper bound of the array mentioned in
4614 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4616 extern tree array_ref_up_bound (tree);
4618 /* Return a tree representing the offset, in bytes, of the field referenced
4619 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4621 extern tree component_ref_field_offset (tree);
4623 /* Given a DECL or TYPE, return the scope in which it was declared, or
4624 NUL_TREE if there is no containing scope. */
4626 extern tree get_containing_scope (const_tree);
4628 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4630 extern tree decl_function_context (const_tree);
4632 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4633 this _DECL with its context, or zero if none. */
4634 extern tree decl_type_context (const_tree);
4636 /* Return 1 if EXPR is the real constant zero. */
4637 extern int real_zerop (const_tree);
4639 /* Declare commonly used variables for tree structure. */
4641 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4642 Zero means allow extended lvalues. */
4644 extern int pedantic_lvalues;
4646 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4648 extern GTY(()) tree current_function_decl;
4650 /* Nonzero means a FUNC_BEGIN label was emitted. */
4651 extern GTY(()) const char * current_function_func_begin_label;
4653 /* Iterator for going through the function arguments. */
4655 tree fntype; /* function type declaration */
4656 tree next; /* TREE_LIST pointing to the next argument */
4657 } function_args_iterator;
4659 /* Initialize the iterator I with arguments from function FNDECL */
4662 function_args_iter_init (function_args_iterator *i, tree fntype)
4665 i->next = TYPE_ARG_TYPES (fntype);
4668 /* Return a pointer that holds the next argument if there are more arguments to
4669 handle, otherwise return NULL. */
4671 static inline tree *
4672 function_args_iter_cond_ptr (function_args_iterator *i)
4674 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4677 /* Return the next argument if there are more arguments to handle, otherwise
4681 function_args_iter_cond (function_args_iterator *i)
4683 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4686 /* Advance to the next argument. */
4688 function_args_iter_next (function_args_iterator *i)
4690 gcc_assert (i->next != NULL_TREE);
4691 i->next = TREE_CHAIN (i->next);
4694 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4697 inlined_function_outer_scope_p (const_tree block)
4699 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4702 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4703 to point to the next tree element. ITER is an instance of
4704 function_args_iterator used to iterate the arguments. */
4705 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4706 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4707 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4708 function_args_iter_next (&(ITER)))
4710 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4711 to the next tree element. ITER is an instance of function_args_iterator
4712 used to iterate the arguments. */
4713 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4714 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4715 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4716 function_args_iter_next (&(ITER)))
4721 extern unsigned crc32_string (unsigned, const char *);
4722 extern void clean_symbol_name (char *);
4723 extern tree get_file_function_name (const char *);
4724 extern tree get_callee_fndecl (const_tree);
4725 extern int type_num_arguments (const_tree);
4726 extern bool associative_tree_code (enum tree_code);
4727 extern bool commutative_tree_code (enum tree_code);
4728 extern tree upper_bound_in_type (tree, tree);
4729 extern tree lower_bound_in_type (tree, tree);
4730 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4731 extern tree call_expr_arg (tree, int);
4732 extern tree *call_expr_argp (tree, int);
4733 extern tree call_expr_arglist (tree);
4734 extern tree create_artificial_label (location_t);
4735 extern const char *get_name (tree);
4736 extern bool stdarg_p (tree);
4737 extern bool prototype_p (tree);
4738 extern bool auto_var_in_fn_p (const_tree, const_tree);
4739 extern tree build_low_bits_mask (tree, unsigned);
4740 extern tree tree_strip_nop_conversions (tree);
4741 extern tree tree_strip_sign_nop_conversions (tree);
4742 extern tree lhd_gcc_personality (void);
4743 extern void assign_assembler_name_if_neeeded (tree);
4747 extern void change_decl_assembler_name (tree, tree);
4750 extern tree unshare_expr (tree);
4754 extern void expand_expr_stmt (tree);
4755 extern int warn_if_unused_value (const_tree, location_t);
4756 extern void expand_label (tree);
4757 extern void expand_goto (tree);
4759 extern rtx expand_stack_save (void);
4760 extern void expand_stack_restore (tree);
4761 extern void expand_return (tree);
4764 extern void using_eh_for_cleanups (void);
4766 /* In fold-const.c */
4768 /* Non-zero if we are folding constants inside an initializer; zero
4770 extern int folding_initializer;
4772 /* Convert between trees and native memory representation. */
4773 extern int native_encode_expr (const_tree, unsigned char *, int);
4774 extern tree native_interpret_expr (tree, const unsigned char *, int);
4776 /* Fold constants as much as possible in an expression.
4777 Returns the simplified expression.
4778 Acts only on the top level of the expression;
4779 if the argument itself cannot be simplified, its
4780 subexpressions are not changed. */
4782 extern tree fold (tree);
4783 #define fold_unary(CODE,T1,T2)\
4784 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4785 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
4786 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4787 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4788 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
4789 #define fold_binary(CODE,T1,T2,T3)\
4790 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4791 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
4792 #define fold_ternary(CODE,T1,T2,T3,T4)\
4793 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4794 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
4795 #define fold_build1(c,t1,t2)\
4796 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4797 #define fold_build1_loc(l,c,t1,t2)\
4798 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4799 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
4800 tree MEM_STAT_DECL);
4801 #define fold_build2(c,t1,t2,t3)\
4802 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4803 #define fold_build2_loc(l,c,t1,t2,t3)\
4804 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4805 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
4806 tree MEM_STAT_DECL);
4807 #define fold_build3(c,t1,t2,t3,t4)\
4808 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4809 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4810 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4811 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
4812 tree MEM_STAT_DECL);
4813 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
4814 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
4815 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
4816 #define fold_build_call_array(T1,T2,N,T4)\
4817 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4818 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
4819 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4820 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4821 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
4822 extern bool fold_convertible_p (const_tree, const_tree);
4823 #define fold_convert(T1,T2)\
4824 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4825 extern tree fold_convert_loc (location_t, tree, tree);
4826 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
4827 extern tree fold_ignored_result (tree);
4828 extern tree fold_abs_const (tree, tree);
4829 extern tree fold_indirect_ref_1 (location_t, tree, tree);
4830 extern void fold_defer_overflow_warnings (void);
4831 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
4832 extern void fold_undefer_and_ignore_overflow_warnings (void);
4833 extern bool fold_deferring_overflow_warnings_p (void);
4835 enum operand_equal_flag
4841 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4842 extern int multiple_of_p (tree, const_tree, const_tree);
4843 #define omit_one_operand(T1,T2,T3)\
4844 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4845 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
4846 #define omit_two_operands(T1,T2,T3,T4)\
4847 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4848 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
4849 #define invert_truthvalue(T)\
4850 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4851 extern tree invert_truthvalue_loc (location_t, tree);
4852 extern tree fold_truth_not_expr (location_t, tree);
4853 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4854 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4855 extern tree fold_read_from_constant_string (tree);
4856 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4857 #define build_fold_addr_expr(T)\
4858 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4859 extern tree build_fold_addr_expr_loc (location_t, tree);
4860 #define build_fold_addr_expr_with_type(T,TYPE)\
4861 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4862 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
4863 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4864 extern tree fold_strip_sign_ops (tree);
4865 #define build_fold_indirect_ref(T)\
4866 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4867 extern tree build_fold_indirect_ref_loc (location_t, tree);
4868 #define fold_indirect_ref(T)\
4869 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4870 extern tree fold_indirect_ref_loc (location_t, tree);
4871 extern tree constant_boolean_node (int, tree);
4872 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
4874 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4875 extern enum tree_code swap_tree_comparison (enum tree_code);
4877 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4878 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4880 extern bool tree_expr_nonzero_p (tree);
4881 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4882 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4884 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4885 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4886 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4888 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4889 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4890 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
4892 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4894 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4895 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
4896 enum tree_code, tree, tree, tree);
4897 extern void debug_fold_checksum (const_tree);
4899 /* Return nonzero if CODE is a tree code that represents a truth value. */
4901 truth_value_p (enum tree_code code)
4903 return (TREE_CODE_CLASS (code) == tcc_comparison
4904 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4905 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4906 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4911 extern tree fold_call_expr (location_t, tree, bool);
4912 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
4913 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
4914 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
4915 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
4916 enum built_in_function);
4917 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
4918 enum built_in_function);
4919 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
4920 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
4921 extern bool fold_builtin_next_arg (tree, bool);
4922 extern enum built_in_function builtin_mathfn_code (const_tree);
4923 extern tree build_function_call_expr (location_t, tree, tree);
4924 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
4925 #define build_call_expr(...)\
4926 build_call_expr_loc (UNKNOWN_LOCATION, __VA_ARGS__)
4927 extern tree build_call_expr_loc (location_t, tree, int, ...);
4928 extern tree mathfn_built_in (tree, enum built_in_function fn);
4929 extern tree c_strlen (tree, int);
4930 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
4931 extern tree build_va_arg_indirect_ref (tree);
4932 extern tree build_string_literal (int, const char *);
4933 extern bool validate_arglist (const_tree, ...);
4934 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4935 extern bool can_trust_pointer_alignment (void);
4936 extern int get_pointer_alignment (tree, unsigned int);
4937 extern bool is_builtin_name (const char *);
4938 extern bool is_builtin_fn (tree);
4939 extern int get_object_alignment (tree, unsigned int, unsigned int);
4940 extern tree fold_call_stmt (gimple, bool);
4941 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
4942 extern tree make_range (tree, int *, tree *, tree *, bool *);
4943 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
4944 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
4946 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
4949 extern tree strip_float_extensions (tree);
4952 extern int really_constant_p (const_tree);
4953 extern bool decl_address_invariant_p (const_tree);
4954 extern bool decl_address_ip_invariant_p (const_tree);
4955 extern int int_fits_type_p (const_tree, const_tree);
4956 #ifndef GENERATOR_FILE
4957 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4959 extern bool variably_modified_type_p (tree, tree);
4960 extern int tree_log2 (const_tree);
4961 extern int tree_floor_log2 (const_tree);
4962 extern int simple_cst_equal (const_tree, const_tree);
4963 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4964 extern hashval_t iterative_hash_exprs_commutative (const_tree,
4965 const_tree, hashval_t);
4966 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4967 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
4968 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
4969 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4970 extern int type_list_equal (const_tree, const_tree);
4971 extern int chain_member (const_tree, const_tree);
4972 extern tree type_hash_lookup (unsigned int, tree);
4973 extern void type_hash_add (unsigned int, tree);
4974 extern int simple_cst_list_equal (const_tree, const_tree);
4975 extern void dump_tree_statistics (void);
4976 extern void recompute_tree_invariant_for_addr_expr (tree);
4977 extern bool needs_to_live_in_memory (const_tree);
4978 extern tree reconstruct_complex_type (tree, tree);
4980 extern int real_onep (const_tree);
4981 extern int real_twop (const_tree);
4982 extern int real_minus_onep (const_tree);
4983 extern void init_ttree (void);
4984 extern void build_common_tree_nodes (bool);
4985 extern void build_common_tree_nodes_2 (int);
4986 extern void build_common_builtin_nodes (void);
4987 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4988 extern tree build_range_type (tree, tree, tree);
4989 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
4990 extern HOST_WIDE_INT int_cst_value (const_tree);
4991 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
4993 extern bool fields_compatible_p (const_tree, const_tree);
4994 extern tree find_compatible_field (tree, tree);
4996 extern tree *tree_block (tree);
4997 extern location_t *block_nonartificial_location (tree);
4998 extern location_t tree_nonartificial_location (tree);
5000 extern tree block_ultimate_origin (const_tree);
5002 /* In tree-nested.c */
5003 extern tree build_addr (tree, tree);
5006 extern void expand_main_function (void);
5007 extern void expand_function_end (void);
5008 extern void expand_function_start (tree);
5009 extern void stack_protect_prologue (void);
5010 extern void stack_protect_epilogue (void);
5011 extern void init_dummy_function_start (void);
5012 extern void expand_dummy_function_end (void);
5013 extern unsigned int init_function_for_compilation (void);
5014 extern void allocate_struct_function (tree, bool);
5015 extern void push_struct_function (tree fndecl);
5016 extern void init_function_start (tree);
5017 extern bool use_register_for_decl (const_tree);
5018 extern void generate_setjmp_warnings (void);
5019 extern void init_temp_slots (void);
5020 extern void free_temp_slots (void);
5021 extern void pop_temp_slots (void);
5022 extern void push_temp_slots (void);
5023 extern void preserve_temp_slots (rtx);
5024 extern int aggregate_value_p (const_tree, const_tree);
5025 extern void push_function_context (void);
5026 extern void pop_function_context (void);
5027 extern gimple_seq gimplify_parameters (void);
5029 /* In print-rtl.c */
5031 extern void print_rtl (FILE *, const_rtx);
5034 /* In print-tree.c */
5035 extern void debug_tree (tree);
5037 extern void dump_addr (FILE*, const char *, const void *);
5038 extern void print_node (FILE *, const char *, tree, int);
5039 extern void print_node_brief (FILE *, const char *, const_tree, int);
5040 extern void indent_to (FILE *, int);
5043 /* In tree-inline.c: */
5044 extern bool debug_find_tree (tree, tree);
5045 /* This is in tree-inline.c since the routine uses
5046 data structures from the inliner. */
5047 extern tree unsave_expr_now (tree);
5048 extern tree build_duplicate_type (tree);
5052 /* Nonzero if this is a call to a function whose return value depends
5053 solely on its arguments, has no side effects, and does not read
5054 global memory. This corresponds to TREE_READONLY for function
5056 #define ECF_CONST (1 << 0)
5057 /* Nonzero if this is a call to "pure" function (like const function,
5058 but may read memory. This corresponds to DECL_PURE_P for function
5060 #define ECF_PURE (1 << 1)
5061 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5062 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5063 for function decls.*/
5064 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5065 /* Nonzero if this call will never return. */
5066 #define ECF_NORETURN (1 << 3)
5067 /* Nonzero if this is a call to malloc or a related function. */
5068 #define ECF_MALLOC (1 << 4)
5069 /* Nonzero if it is plausible that this is a call to alloca. */
5070 #define ECF_MAY_BE_ALLOCA (1 << 5)
5071 /* Nonzero if this is a call to a function that won't throw an exception. */
5072 #define ECF_NOTHROW (1 << 6)
5073 /* Nonzero if this is a call to setjmp or a related function. */
5074 #define ECF_RETURNS_TWICE (1 << 7)
5075 /* Nonzero if this call replaces the current stack frame. */
5076 #define ECF_SIBCALL (1 << 8)
5077 /* Function does not read or write memory (but may have side effects, so
5078 it does not necessarily fit ECF_CONST). */
5079 #define ECF_NOVOPS (1 << 9)
5081 extern int flags_from_decl_or_type (const_tree);
5082 extern int call_expr_flags (const_tree);
5084 extern int setjmp_call_p (const_tree);
5085 extern bool gimple_alloca_call_p (const_gimple);
5086 extern bool alloca_call_p (const_tree);
5087 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5088 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5092 extern const struct attribute_spec *lookup_attribute_spec (tree);
5094 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5095 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5096 it should be modified in place; if a TYPE, a copy should be created
5097 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5098 information, in the form of a bitwise OR of flags in enum attribute_flags
5099 from tree.h. Depending on these flags, some attributes may be
5100 returned to be applied at a later stage (for example, to apply
5101 a decl attribute to the declaration rather than to its type). */
5102 extern tree decl_attributes (tree *, tree, int);
5104 /* In integrate.c */
5105 extern void set_decl_abstract_flags (tree, int);
5106 extern void set_decl_origin_self (tree);
5108 /* In stor-layout.c */
5109 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5110 extern void fixup_signed_type (tree);
5111 extern void internal_reference_types (void);
5112 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5115 extern void make_decl_rtl (tree);
5116 extern rtx make_decl_rtl_for_debug (tree);
5117 extern void make_decl_one_only (tree, tree);
5118 extern int supports_one_only (void);
5119 extern void resolve_unique_section (tree, int, int);
5120 extern void mark_referenced (tree);
5121 extern void mark_decl_referenced (tree);
5122 extern void notice_global_symbol (tree);
5123 extern void set_user_assembler_name (tree, const char *);
5124 extern void process_pending_assemble_externals (void);
5125 extern void finish_aliases_1 (void);
5126 extern void finish_aliases_2 (void);
5127 extern tree emutls_decl (tree);
5128 extern void remove_unreachable_alias_pairs (void);
5131 extern void expand_computed_goto (tree);
5132 extern bool parse_output_constraint (const char **, int, int, int,
5133 bool *, bool *, bool *);
5134 extern bool parse_input_constraint (const char **, int, int, int, int,
5135 const char * const *, bool *, bool *);
5136 extern void expand_asm_stmt (gimple);
5137 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5138 extern void expand_case (gimple);
5139 extern void expand_decl (tree);
5141 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5142 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5146 /* In dwarf2out.c */
5147 /* Interface of the DWARF2 unwind info support. */
5149 /* Generate a new label for the CFI info to refer to. */
5151 extern char *dwarf2out_cfi_label (bool);
5153 /* Entry point to update the canonical frame address (CFA). */
5155 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5157 /* Add the CFI for saving a register window. */
5159 extern void dwarf2out_window_save (const char *);
5161 /* Entry point for saving a register to the stack. */
5163 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5165 /* Entry point for saving the return address in the stack. */
5167 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5169 /* Entry point for saving the return address in a register. */
5171 extern void dwarf2out_return_reg (const char *, unsigned);
5173 /* Entry point for saving the first register into the second. */
5175 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5177 /* In tree-inline.c */
5179 /* The type of a set of already-visited pointers. Functions for creating
5180 and manipulating it are declared in pointer-set.h */
5181 struct pointer_set_t;
5183 /* The type of a callback function for walking over tree structure. */
5185 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5187 /* The type of a callback function that represents a custom walk_tree. */
5189 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5190 void *, struct pointer_set_t*);
5192 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5194 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5196 #define walk_tree(a,b,c,d) \
5197 walk_tree_1 (a, b, c, d, NULL)
5198 #define walk_tree_without_duplicates(a,b,c) \
5199 walk_tree_without_duplicates_1 (a, b, c, NULL)
5202 /* Assign the RTX to declaration. */
5204 extern void set_decl_rtl (tree, rtx);
5205 extern void set_decl_incoming_rtl (tree, rtx, bool);
5207 /* Enum and arrays used for tree allocation stats.
5208 Keep in sync with tree.c:tree_node_kind_names. */
5232 extern int tree_node_counts[];
5233 extern int tree_node_sizes[];
5235 /* True if we are in gimple form and the actions of the folders need to
5236 be restricted. False if we are not in gimple form and folding is not
5237 restricted to creating gimple expressions. */
5238 extern bool in_gimple_form;
5241 extern tree get_base_address (tree t);
5242 extern void mark_addressable (tree);
5244 /* In tree-vectorizer.c. */
5245 extern void vect_set_verbosity_level (const char *);
5249 struct GTY(()) tree_map_base {
5253 extern int tree_map_base_eq (const void *, const void *);
5254 extern unsigned int tree_map_base_hash (const void *);
5255 extern int tree_map_base_marked_p (const void *);
5256 extern bool list_equal_p (const_tree, const_tree);
5258 /* Map from a tree to another tree. */
5260 struct GTY(()) tree_map {
5261 struct tree_map_base base;
5266 #define tree_map_eq tree_map_base_eq
5267 extern unsigned int tree_map_hash (const void *);
5268 #define tree_map_marked_p tree_map_base_marked_p
5270 /* Map from a tree to an int. */
5272 struct GTY(()) tree_int_map {
5273 struct tree_map_base base;
5277 #define tree_int_map_eq tree_map_base_eq
5278 #define tree_int_map_hash tree_map_base_hash
5279 #define tree_int_map_marked_p tree_map_base_marked_p
5281 /* Map from a tree to initialization/finalization priorities. */
5283 struct GTY(()) tree_priority_map {
5284 struct tree_map_base base;
5289 #define tree_priority_map_eq tree_map_base_eq
5290 #define tree_priority_map_hash tree_map_base_hash
5291 #define tree_priority_map_marked_p tree_map_base_marked_p
5295 tree target_for_debug_bind (tree);
5297 /* In tree-ssa-address.c. */
5298 extern tree tree_mem_ref_addr (tree, tree);
5299 extern void copy_mem_ref_info (tree, tree);
5302 extern bool ssa_name_nonnegative_p (const_tree);
5304 /* In tree-object-size.c. */
5305 extern void init_object_sizes (void);
5306 extern void fini_object_sizes (void);
5307 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5310 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5311 extern tree build_personality_function (const char *);
5313 /* In tree-inline.c. */
5315 void init_inline_once (void);
5317 /* In ipa-reference.c. Used for parsing attributes of asm code. */
5318 extern GTY(()) tree memory_identifier_string;
5320 /* Compute the number of operands in an expression node NODE. For
5321 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5322 otherwise it is looked up from the node's code. */
5324 tree_operand_length (const_tree node)
5326 if (VL_EXP_CLASS_P (node))
5327 return VL_EXP_OPERAND_LENGTH (node);
5329 return TREE_CODE_LENGTH (TREE_CODE (node));
5332 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5333 have to go towards the end of tree.h so that union tree_node is fully
5334 defined by this point. */
5336 /* Structure containing iterator state. */
5337 typedef struct GTY (()) call_expr_arg_iterator_d {
5338 tree t; /* the call_expr */
5339 int n; /* argument count */
5340 int i; /* next argument index */
5341 } call_expr_arg_iterator;
5343 typedef struct GTY (()) const_call_expr_arg_iterator_d {
5344 const_tree t; /* the call_expr */
5345 int n; /* argument count */
5346 int i; /* next argument index */
5347 } const_call_expr_arg_iterator;
5349 /* Initialize the abstract argument list iterator object ITER with the
5350 arguments from CALL_EXPR node EXP. */
5352 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5355 iter->n = call_expr_nargs (exp);
5360 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5363 iter->n = call_expr_nargs (exp);
5367 /* Return the next argument from abstract argument list iterator object ITER,
5368 and advance its state. Return NULL_TREE if there are no more arguments. */
5370 next_call_expr_arg (call_expr_arg_iterator *iter)
5373 if (iter->i >= iter->n)
5375 result = CALL_EXPR_ARG (iter->t, iter->i);
5380 static inline const_tree
5381 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5384 if (iter->i >= iter->n)
5386 result = CALL_EXPR_ARG (iter->t, iter->i);
5391 /* Initialize the abstract argument list iterator object ITER, then advance
5392 past and return the first argument. Useful in for expressions, e.g.
5393 for (arg = first_call_expr_arg (exp, &iter); arg;
5394 arg = next_call_expr_arg (&iter)) */
5396 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5398 init_call_expr_arg_iterator (exp, iter);
5399 return next_call_expr_arg (iter);
5402 static inline const_tree
5403 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5405 init_const_call_expr_arg_iterator (exp, iter);
5406 return next_const_call_expr_arg (iter);
5409 /* Test whether there are more arguments in abstract argument list iterator
5410 ITER, without changing its state. */
5412 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5414 return (iter->i < iter->n);
5418 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5420 return (iter->i < iter->n);
5423 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5424 (of type call_expr_arg_iterator) to hold the iteration state. */
5425 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5426 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5427 (arg) = next_call_expr_arg (&(iter)))
5429 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5430 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5431 (arg) = next_const_call_expr_arg (&(iter)))
5433 /* Return true if tree node T is a language-specific node. */
5435 is_lang_specific (tree t)
5437 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5440 #endif /* GCC_TREE_H */