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
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"
33 /* Codes of tree nodes */
35 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
36 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
39 #include "all-tree.def"
44 #undef END_OF_BASE_TREE_CODES
46 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
47 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
49 /* Number of language-independent tree codes. */
50 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
52 /* Tree code classes. */
54 /* Each tree_code has an associated code class represented by a
57 enum tree_code_class {
58 tcc_exceptional, /* An exceptional code (fits no category). */
59 tcc_constant, /* A constant. */
60 /* Order of tcc_type and tcc_declaration is important. */
61 tcc_type, /* A type object code. */
62 tcc_declaration, /* A declaration (also serving as variable refs). */
63 tcc_reference, /* A reference to storage. */
64 tcc_comparison, /* A comparison expression. */
65 tcc_unary, /* A unary arithmetic expression. */
66 tcc_binary, /* A binary arithmetic expression. */
67 tcc_statement, /* A statement expression, which have side effects
68 but usually no interesting value. */
69 tcc_vl_exp, /* A function call or other expression with a
70 variable-length operand vector. */
71 tcc_expression, /* Any other expression. */
72 tcc_gimple_stmt /* A GIMPLE statement. */
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 CODE represents a memory tag. */
110 #define MTAG_P(CODE) \
111 (TREE_CODE (CODE) == NAME_MEMORY_TAG \
112 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
113 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
116 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
118 #define VAR_OR_FUNCTION_DECL_P(DECL)\
119 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
121 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
122 ascending code order. */
124 #define INDIRECT_REF_P(CODE)\
125 (TREE_CODE (CODE) == INDIRECT_REF \
126 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
127 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
129 /* Nonzero if CODE represents a reference. */
131 #define REFERENCE_CLASS_P(CODE)\
132 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
134 /* Nonzero if CODE represents a comparison. */
136 #define COMPARISON_CLASS_P(CODE)\
137 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
139 /* Nonzero if CODE represents a unary arithmetic expression. */
141 #define UNARY_CLASS_P(CODE)\
142 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
144 /* Nonzero if CODE represents a binary arithmetic expression. */
146 #define BINARY_CLASS_P(CODE)\
147 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
149 /* Nonzero if CODE represents a statement expression. */
151 #define STATEMENT_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
154 /* Nonzero if CODE represents a function call-like expression with a
155 variable-length operand vector. */
157 #define VL_EXP_CLASS_P(CODE)\
158 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
160 /* Nonzero if CODE represents any other expression. */
162 #define EXPRESSION_CLASS_P(CODE)\
163 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
165 /* Returns nonzero iff CODE represents a type or declaration. */
167 #define IS_TYPE_OR_DECL_P(CODE)\
168 (TYPE_P (CODE) || DECL_P (CODE))
170 /* Returns nonzero iff CLASS is the tree-code class of an
173 #define IS_EXPR_CODE_CLASS(CLASS)\
174 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
176 /* Returns nonzero iff CLASS is a GIMPLE statement. */
178 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
180 /* Returns nonzero iff NODE is an expression of some kind. */
182 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
184 /* Returns nonzero iff NODE is an OpenMP directive. */
186 #define OMP_DIRECTIVE_P(NODE) \
187 (TREE_CODE (NODE) == OMP_PARALLEL \
188 || TREE_CODE (NODE) == OMP_TASK \
189 || TREE_CODE (NODE) == OMP_FOR \
190 || TREE_CODE (NODE) == OMP_SECTIONS \
191 || TREE_CODE (NODE) == OMP_SECTIONS_SWITCH \
192 || TREE_CODE (NODE) == OMP_SINGLE \
193 || TREE_CODE (NODE) == OMP_SECTION \
194 || TREE_CODE (NODE) == OMP_MASTER \
195 || TREE_CODE (NODE) == OMP_ORDERED \
196 || TREE_CODE (NODE) == OMP_CRITICAL \
197 || TREE_CODE (NODE) == OMP_RETURN \
198 || TREE_CODE (NODE) == OMP_ATOMIC_LOAD \
199 || TREE_CODE (NODE) == OMP_ATOMIC_STORE \
200 || TREE_CODE (NODE) == OMP_CONTINUE)
202 /* Number of argument-words in each kind of tree-node. */
204 extern const unsigned char tree_code_length[];
205 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
207 /* Names of tree components. */
209 extern const char *const tree_code_name[];
211 /* A vectors of trees. */
213 DEF_VEC_ALLOC_P(tree,gc);
214 DEF_VEC_ALLOC_P(tree,heap);
217 /* Classify which part of the compiler has defined a given builtin function.
218 Note that we assume below that this is no more than two bits. */
227 /* Names for the above. */
228 extern const char *const built_in_class_names[4];
230 /* Codes that identify the various built in functions
231 so that expand_call can identify them quickly. */
233 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
234 enum built_in_function
236 #include "builtins.def"
238 /* Complex division routines in libgcc. These are done via builtins
239 because emit_library_call_value can't handle complex values. */
240 BUILT_IN_COMPLEX_MUL_MIN,
241 BUILT_IN_COMPLEX_MUL_MAX
242 = BUILT_IN_COMPLEX_MUL_MIN
243 + MAX_MODE_COMPLEX_FLOAT
244 - MIN_MODE_COMPLEX_FLOAT,
246 BUILT_IN_COMPLEX_DIV_MIN,
247 BUILT_IN_COMPLEX_DIV_MAX
248 = BUILT_IN_COMPLEX_DIV_MIN
249 + MAX_MODE_COMPLEX_FLOAT
250 - MIN_MODE_COMPLEX_FLOAT,
252 /* Upper bound on non-language-specific builtins. */
257 /* Names for the above. */
258 extern const char * built_in_names[(int) END_BUILTINS];
260 /* Helper macros for math builtins. */
262 #define BUILTIN_EXP10_P(FN) \
263 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
264 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
266 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
267 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
268 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
270 #define BUILTIN_SQRT_P(FN) \
271 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
273 #define BUILTIN_CBRT_P(FN) \
274 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
276 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
278 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
279 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
280 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
282 /* An array of _DECL trees for the above. */
283 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
284 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
286 /* In an OMP_CLAUSE node. */
288 /* Number of operands and names for each clause. */
289 extern unsigned const char omp_clause_num_ops[];
290 extern const char * const omp_clause_code_name[];
292 /* Clause codes. Do not reorder, as this is used to index into the tables
293 omp_clause_num_ops and omp_clause_code_name. */
296 /* Clause zero is special-cased inside the parser
297 (c_parser_omp_variable_list). */
298 OMP_CLAUSE_ERROR = 0,
300 /* OpenMP clause: private (variable_list). */
303 /* OpenMP clause: shared (variable_list). */
306 /* OpenMP clause: firstprivate (variable_list). */
307 OMP_CLAUSE_FIRSTPRIVATE,
309 /* OpenMP clause: lastprivate (variable_list). */
310 OMP_CLAUSE_LASTPRIVATE,
312 /* OpenMP clause: reduction (operator:variable_list).
313 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
314 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
315 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
317 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
318 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
319 OMP_CLAUSE_REDUCTION,
321 /* OpenMP clause: copyin (variable_list). */
324 /* OpenMP clause: copyprivate (variable_list). */
325 OMP_CLAUSE_COPYPRIVATE,
327 /* OpenMP clause: if (scalar-expression). */
330 /* OpenMP clause: num_threads (integer-expression). */
331 OMP_CLAUSE_NUM_THREADS,
333 /* OpenMP clause: schedule. */
336 /* OpenMP clause: nowait. */
339 /* OpenMP clause: ordered. */
342 /* OpenMP clause: default. */
345 /* OpenMP clause: collapse (constant-integer-expression). */
348 /* OpenMP clause: untied. */
352 /* The definition of tree nodes fills the next several pages. */
354 /* A tree node can represent a data type, a variable, an expression
355 or a statement. Each node has a TREE_CODE which says what kind of
356 thing it represents. Some common codes are:
357 INTEGER_TYPE -- represents a type of integers.
358 ARRAY_TYPE -- represents a type of pointer.
359 VAR_DECL -- represents a declared variable.
360 INTEGER_CST -- represents a constant integer value.
361 PLUS_EXPR -- represents a sum (an expression).
363 As for the contents of a tree node: there are some fields
364 that all nodes share. Each TREE_CODE has various special-purpose
365 fields as well. The fields of a node are never accessed directly,
366 always through accessor macros. */
368 /* Every kind of tree node starts with this structure,
369 so all nodes have these fields.
371 See the accessor macros, defined below, for documentation of the
375 struct tree_base GTY(())
377 ENUM_BITFIELD(tree_code) code : 16;
379 unsigned side_effects_flag : 1;
380 unsigned constant_flag : 1;
381 unsigned addressable_flag : 1;
382 unsigned volatile_flag : 1;
383 unsigned readonly_flag : 1;
384 unsigned unsigned_flag : 1;
385 unsigned asm_written_flag: 1;
386 unsigned nowarning_flag : 1;
388 unsigned used_flag : 1;
389 unsigned nothrow_flag : 1;
390 unsigned static_flag : 1;
391 unsigned public_flag : 1;
392 unsigned private_flag : 1;
393 unsigned protected_flag : 1;
394 unsigned deprecated_flag : 1;
395 unsigned saturating_flag : 1;
396 unsigned default_def_flag : 1;
398 unsigned lang_flag_0 : 1;
399 unsigned lang_flag_1 : 1;
400 unsigned lang_flag_2 : 1;
401 unsigned lang_flag_3 : 1;
402 unsigned lang_flag_4 : 1;
403 unsigned lang_flag_5 : 1;
404 unsigned lang_flag_6 : 1;
405 unsigned visited : 1;
409 /* FIXME tuples: Eventually, we need to move this somewhere external to
411 union tree_ann_d *ann;
414 struct tree_common GTY(())
416 struct tree_base base;
421 /* GIMPLE_MODIFY_STMT */
422 struct gimple_stmt GTY(())
424 struct tree_base base;
427 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
428 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
431 /* The following table lists the uses of each of the above flags and
432 for which types of nodes they are defined.
437 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
439 CONSTRUCTOR, IDENTIFIER_NODE
440 STMT_EXPR, it means we want the result of the enclosed expression
442 CALL_EXPR_TAILCALL in
451 VAR_DECL, FUNCTION_DECL
454 TREE_NO_TRAMPOLINE in
460 TREE_SYMBOL_REFERENCED in
464 TARGET_EXPR, WITH_CLEANUP_EXPR
466 TRY_CATCH_IS_CLEANUP in
472 EH_FILTER_MUST_NOT_THROW in
475 TYPE_REF_CAN_ALIAS_ALL in
476 POINTER_TYPE, REFERENCE_TYPE
484 CALL_CANNOT_INLINE_P in
490 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
493 VAR_DECL, FUNCTION_DECL
499 CALL_EXPR_VA_ARG_PACK in
502 TYPE_CACHED_VALUES_P in
505 SAVE_EXPR_RESOLVED_P in
508 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
509 OMP_CLAUSE_LASTPRIVATE
511 OMP_CLAUSE_PRIVATE_DEBUG in
519 CALL_EXPR_RETURN_SLOT_OPT in
523 PARM_DECL, RESULT_DECL
531 OMP_PARALLEL_COMBINED in
533 OMP_CLAUSE_PRIVATE_OUTER_REF in
557 TREE_THIS_VOLATILE in
580 TYPE_SIZES_GIMPLIFIED in
591 REGISTER_DEFS_IN_THIS_STMT in
592 all expressions (tree-into-ssa.c)
597 VAR_DECL, FUNCTION_DECL
598 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
599 BLOCK, SSA_NAME, STRING_CST
602 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
621 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
628 IDENTIFIER_TRANSPARENT_ALIAS in
631 STMT_IN_SSA_EDGE_WORKLIST in
632 all expressions (tree-ssa-propagate.c)
637 all trees (used liberally by many passes)
652 SSA_NAME_IS_DEFAULT_DEF in
657 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
658 enum tree_node_structure_enum {
659 #include "treestruct.def"
664 /* Define accessors for the fields that all tree nodes have
665 (though some fields are not used for all kinds of nodes). */
667 /* The tree-code says what kind of node it is.
668 Codes are defined in tree.def. */
669 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
670 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
672 /* When checking is enabled, errors will be generated if a tree node
673 is accessed incorrectly. The macros die with a fatal error. */
674 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
676 #define TREE_CHECK(T, CODE) __extension__ \
677 ({ __typeof (T) const __t = (T); \
678 if (TREE_CODE (__t) != (CODE)) \
679 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
683 #define TREE_NOT_CHECK(T, CODE) __extension__ \
684 ({ __typeof (T) const __t = (T); \
685 if (TREE_CODE (__t) == (CODE)) \
686 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
691 ({ __typeof (T) const __t = (T); \
692 if (TREE_CODE (__t) != (CODE1) \
693 && TREE_CODE (__t) != (CODE2)) \
694 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
695 (CODE1), (CODE2), 0); \
698 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
699 ({ __typeof (T) const __t = (T); \
700 if (TREE_CODE (__t) == (CODE1) \
701 || TREE_CODE (__t) == (CODE2)) \
702 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
703 (CODE1), (CODE2), 0); \
706 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __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_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
712 (CODE1), (CODE2), (CODE3), 0); \
715 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
716 ({ __typeof (T) const __t = (T); \
717 if (TREE_CODE (__t) == (CODE1) \
718 || TREE_CODE (__t) == (CODE2) \
719 || TREE_CODE (__t) == (CODE3)) \
720 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
721 (CODE1), (CODE2), (CODE3), 0); \
724 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
725 ({ __typeof (T) const __t = (T); \
726 if (TREE_CODE (__t) != (CODE1) \
727 && TREE_CODE (__t) != (CODE2) \
728 && TREE_CODE (__t) != (CODE3) \
729 && TREE_CODE (__t) != (CODE4)) \
730 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
731 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
734 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
735 ({ __typeof (T) const __t = (T); \
736 if (TREE_CODE (__t) == (CODE1) \
737 || TREE_CODE (__t) == (CODE2) \
738 || TREE_CODE (__t) == (CODE3) \
739 || TREE_CODE (__t) == (CODE4)) \
740 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
741 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
744 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
745 ({ __typeof (T) const __t = (T); \
746 if (TREE_CODE (__t) != (CODE1) \
747 && TREE_CODE (__t) != (CODE2) \
748 && TREE_CODE (__t) != (CODE3) \
749 && TREE_CODE (__t) != (CODE4) \
750 && TREE_CODE (__t) != (CODE5)) \
751 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
752 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
755 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
756 ({ __typeof (T) const __t = (T); \
757 if (TREE_CODE (__t) == (CODE1) \
758 || TREE_CODE (__t) == (CODE2) \
759 || TREE_CODE (__t) == (CODE3) \
760 || TREE_CODE (__t) == (CODE4) \
761 || TREE_CODE (__t) == (CODE5)) \
762 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
763 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
766 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
767 ({ __typeof (T) const __t = (T); \
768 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
769 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
773 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
774 ({ __typeof (T) const __t = (T); \
775 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
776 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
780 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
781 ({ __typeof (T) const __t = (T); \
782 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
783 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
787 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
788 ({ __typeof (T) const __t = (T); \
789 if (TREE_CODE (__t) != OMP_CLAUSE) \
790 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
792 if (__t->omp_clause.code != (CODE)) \
793 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
797 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
798 ({ __typeof (T) const __t = (T); \
799 if (TREE_CODE (__t) != OMP_CLAUSE) \
800 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
802 if ((int) __t->omp_clause.code < (int) (CODE1) \
803 || (int) __t->omp_clause.code > (int) (CODE2)) \
804 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
805 __FUNCTION__, (CODE1), (CODE2)); \
808 /* These checks have to be special cased. */
809 #define EXPR_CHECK(T) __extension__ \
810 ({ __typeof (T) const __t = (T); \
811 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
812 if (!IS_EXPR_CODE_CLASS (__c)) \
813 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
817 #define GIMPLE_STMT_CHECK(T) __extension__ \
818 ({ __typeof (T) const __t = (T); \
819 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
820 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
821 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
825 /* These checks have to be special cased. */
826 #define NON_TYPE_CHECK(T) __extension__ \
827 ({ __typeof (T) const __t = (T); \
829 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
833 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
834 (*({__typeof (T) const __t = (T); \
835 const int __i = (I); \
836 if (TREE_CODE (__t) != TREE_VEC) \
837 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
839 if (__i < 0 || __i >= __t->vec.length) \
840 tree_vec_elt_check_failed (__i, __t->vec.length, \
841 __FILE__, __LINE__, __FUNCTION__); \
842 &__t->vec.a[__i]; }))
844 #define PHI_NODE_ELT_CHECK(T, I) __extension__ \
845 (*({__typeof (T) const __t = (T); \
846 const int __i = (I); \
847 if (TREE_CODE (__t) != PHI_NODE) \
848 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
850 if (__i < 0 || __i >= __t->phi.capacity) \
851 phi_node_elt_check_failed (__i, __t->phi.num_args, \
852 __FILE__, __LINE__, __FUNCTION__); \
853 &__t->phi.a[__i]; }))
855 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
856 (*({__typeof (T) const __t = (T); \
857 const int __i = (I); \
858 if (TREE_CODE (__t) != OMP_CLAUSE) \
859 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
861 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
862 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
864 &__t->omp_clause.ops[__i]; }))
866 /* Special checks for TREE_OPERANDs. */
867 #define TREE_OPERAND_CHECK(T, I) __extension__ \
868 (*({__typeof (T) const __t = EXPR_CHECK (T); \
869 const int __i = (I); \
870 if (GIMPLE_TUPLE_P (__t)) \
871 gcc_unreachable (); \
872 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
873 tree_operand_check_failed (__i, __t, \
874 __FILE__, __LINE__, __FUNCTION__); \
875 &__t->exp.operands[__i]; }))
877 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
878 (*({__typeof (T) const __t = (T); \
879 const int __i = (I); \
880 if (TREE_CODE (__t) != CODE) \
881 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
882 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
883 tree_operand_check_failed (__i, __t, \
884 __FILE__, __LINE__, __FUNCTION__); \
885 &__t->exp.operands[__i]; }))
887 /* Special checks for GIMPLE_STMT_OPERANDs. */
888 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
889 (*({__typeof (T) const __t = GIMPLE_STMT_CHECK (T); \
890 const int __i = (I); \
891 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
892 tree_operand_check_failed (__i, __t, \
893 __FILE__, __LINE__, __FUNCTION__); \
894 &__t->gstmt.operands[__i]; }))
896 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
898 ({__typeof (T) const __t = (T); \
899 const int __i = (I); \
900 if (TREE_CODE (__t) != (CODE)) \
901 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
902 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
903 tree_operand_check_failed (__i, __t, \
904 __FILE__, __LINE__, __FUNCTION__); \
905 &__t->exp.operands[__i]; }))
907 /* Nodes are chained together for many purposes.
908 Types are chained together to record them for being output to the debugger
909 (see the function `chain_type').
910 Decls in the same scope are chained together to record the contents
912 Statement nodes for successive statements used to be chained together.
913 Often lists of things are represented by TREE_LIST nodes that
914 are chained together. */
916 #define TREE_CHAIN(NODE) __extension__ \
917 (*({__typeof (NODE) const __t = (NODE); \
918 if (GIMPLE_TUPLE_P (__t)) \
919 gcc_unreachable (); \
920 &__t->common.chain; }))
922 /* In all nodes that are expressions, this is the data type of the expression.
923 In POINTER_TYPE nodes, this is the type that the pointer points to.
924 In ARRAY_TYPE nodes, this is the type of the elements.
925 In VECTOR_TYPE nodes, this is the type of the elements. */
926 #define TREE_TYPE(NODE) __extension__ \
927 (*({__typeof (NODE) const __t = (NODE); \
928 if (GIMPLE_TUPLE_P (__t)) \
929 gcc_unreachable (); \
930 &__t->common.type; }))
932 extern void tree_contains_struct_check_failed (const_tree,
933 const enum tree_node_structure_enum,
934 const char *, int, const char *)
937 extern void tree_check_failed (const_tree, const char *, int, const char *,
938 ...) ATTRIBUTE_NORETURN;
939 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
940 ...) ATTRIBUTE_NORETURN;
941 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
942 const char *, int, const char *)
944 extern void tree_range_check_failed (const_tree, const char *, int,
945 const char *, enum tree_code,
947 extern void tree_not_class_check_failed (const_tree,
948 const enum tree_code_class,
949 const char *, int, const char *)
951 extern void tree_vec_elt_check_failed (int, int, const char *,
954 extern void phi_node_elt_check_failed (int, int, const char *,
957 extern void tree_operand_check_failed (int, const_tree,
958 const char *, int, const char *)
960 extern void omp_clause_check_failed (const_tree, const char *, int,
961 const char *, enum omp_clause_code)
963 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
966 extern void omp_clause_range_check_failed (const_tree, const char *, int,
967 const char *, enum omp_clause_code,
968 enum omp_clause_code)
971 #else /* not ENABLE_TREE_CHECKING, or not gcc */
973 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
974 #define TREE_CHECK(T, CODE) (T)
975 #define TREE_NOT_CHECK(T, CODE) (T)
976 #define TREE_CHECK2(T, CODE1, CODE2) (T)
977 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
978 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
979 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
980 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
981 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
982 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
983 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
984 #define TREE_CLASS_CHECK(T, CODE) (T)
985 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
986 #define EXPR_CHECK(T) (T)
987 #define GIMPLE_STMT_CHECK(T) (T)
988 #define NON_TYPE_CHECK(T) (T)
989 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
990 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
991 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
992 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
993 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
994 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
995 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
996 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
997 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
999 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
1000 #define TREE_TYPE(NODE) ((NODE)->common.type)
1004 #define TREE_BLOCK(NODE) *(tree_block (NODE))
1006 #include "tree-check.h"
1008 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
1009 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
1010 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
1011 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
1012 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
1013 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
1014 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
1015 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
1016 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
1017 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
1018 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
1019 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
1021 #define RECORD_OR_UNION_CHECK(T) \
1022 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1023 #define NOT_RECORD_OR_UNION_CHECK(T) \
1024 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1026 #define NUMERICAL_TYPE_CHECK(T) \
1027 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
1030 /* Nonzero if NODE is a GIMPLE statement. */
1031 #define GIMPLE_STMT_P(NODE) \
1032 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
1034 /* Nonzero if NODE is a GIMPLE tuple. */
1035 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
1037 /* A GIMPLE tuple that has a ``locus'' field. */
1038 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
1040 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
1042 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
1043 NODE code is unknown at compile time, use this macro. */
1044 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
1046 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
1049 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
1051 /* Here is how primitive or already-canonicalized types' hash codes
1053 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
1055 /* A simple hash function for an arbitrary tree node. This must not be
1056 used in hash tables which are saved to a PCH. */
1057 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1059 /* The TREE_CHAIN but it is able to handle tuples. */
1060 #define GENERIC_NEXT(NODE) \
1061 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
1062 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
1064 /* Tests if expression is conversion expr (NOP_EXPRs or CONVERT_EXPRs). */
1066 #define CONVERT_EXPR_P(EXP) \
1067 (TREE_CODE (EXP) == NOP_EXPR \
1068 || TREE_CODE (EXP) == CONVERT_EXPR)
1070 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
1072 #define CASE_CONVERT \
1076 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
1077 that don't change the machine mode. */
1079 #define STRIP_NOPS(EXP) \
1080 while ((CONVERT_EXPR_P (EXP) \
1081 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1082 && TREE_OPERAND (EXP, 0) != error_mark_node \
1083 && (TYPE_MODE (TREE_TYPE (EXP)) \
1084 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1085 (EXP) = TREE_OPERAND (EXP, 0)
1087 /* Like STRIP_NOPS, but don't let the signedness change either. */
1089 #define STRIP_SIGN_NOPS(EXP) \
1090 while ((CONVERT_EXPR_P (EXP) \
1091 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1092 && TREE_OPERAND (EXP, 0) != error_mark_node \
1093 && (TYPE_MODE (TREE_TYPE (EXP)) \
1094 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1095 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1096 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1097 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
1098 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1099 (EXP) = TREE_OPERAND (EXP, 0)
1101 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1103 #define STRIP_TYPE_NOPS(EXP) \
1104 while ((CONVERT_EXPR_P (EXP) \
1105 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1106 && TREE_OPERAND (EXP, 0) != error_mark_node \
1107 && (TREE_TYPE (EXP) \
1108 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1109 (EXP) = TREE_OPERAND (EXP, 0)
1111 /* Remove unnecessary type conversions according to
1112 tree_ssa_useless_type_conversion. */
1114 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1115 while (tree_ssa_useless_type_conversion (EXP)) \
1116 EXP = TREE_OPERAND (EXP, 0)
1118 /* Nonzero if TYPE represents an integral type. Note that we do not
1119 include COMPLEX types here. Keep these checks in ascending code
1122 #define INTEGRAL_TYPE_P(TYPE) \
1123 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1124 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1125 || TREE_CODE (TYPE) == INTEGER_TYPE)
1127 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1129 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1130 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1132 /* Nonzero if TYPE represents a saturating fixed-point type. */
1134 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1135 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1137 /* Nonzero if TYPE represents a fixed-point type. */
1139 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1141 /* Nonzero if TYPE represents a scalar floating-point type. */
1143 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1145 /* Nonzero if TYPE represents a complex floating-point type. */
1147 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1148 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1149 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1151 /* Nonzero if TYPE represents a vector floating-point type. */
1153 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1154 (TREE_CODE (TYPE) == VECTOR_TYPE \
1155 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1157 /* Nonzero if TYPE represents a floating-point type, including complex
1158 and vector floating-point types. The vector and complex check does
1159 not use the previous two macros to enable early folding. */
1161 #define FLOAT_TYPE_P(TYPE) \
1162 (SCALAR_FLOAT_TYPE_P (TYPE) \
1163 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1164 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1165 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1167 /* Nonzero if TYPE represents a decimal floating-point type. */
1168 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1169 (SCALAR_FLOAT_TYPE_P (TYPE) \
1170 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1172 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1173 Keep these checks in ascending code order. */
1175 #define AGGREGATE_TYPE_P(TYPE) \
1176 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1177 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1179 /* Nonzero if TYPE represents a pointer or reference type.
1180 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1181 ascending code order. */
1183 #define POINTER_TYPE_P(TYPE) \
1184 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1186 /* Nonzero if this type is a complete type. */
1187 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1189 /* Nonzero if this type is the (possibly qualified) void type. */
1190 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1192 /* Nonzero if this type is complete or is cv void. */
1193 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1194 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1196 /* Nonzero if this type is complete or is an array with unspecified bound. */
1197 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1198 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1201 /* Define many boolean fields that all tree nodes have. */
1203 /* In VAR_DECL nodes, nonzero means address of this is needed.
1204 So it cannot be in a register.
1205 In a FUNCTION_DECL, nonzero means its address is needed.
1206 So it must be compiled even if it is an inline function.
1207 In a FIELD_DECL node, it means that the programmer is permitted to
1208 construct the address of this field. This is used for aliasing
1209 purposes: see record_component_aliases.
1210 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1211 In LABEL_DECL nodes, it means a goto for this label has been seen
1212 from a place outside all binding contours that restore stack levels.
1213 In ..._TYPE nodes, it means that objects of this type must
1214 be fully addressable. This means that pieces of this
1215 object cannot go into register parameters, for example.
1216 In IDENTIFIER_NODEs, this means that some extern decl for this name
1217 had its address taken. That matters for inline functions. */
1218 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1220 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1221 exit of a function. Calls for which this is true are candidates for tail
1222 call optimizations. */
1223 #define CALL_EXPR_TAILCALL(NODE) \
1224 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1226 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1227 CASE_LOW operand has been processed. */
1228 #define CASE_LOW_SEEN(NODE) \
1229 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1231 #define PREDICT_EXPR_OUTCOME(NODE) \
1232 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag)
1233 #define PREDICT_EXPR_PREDICTOR(NODE) \
1234 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1236 /* In a VAR_DECL, nonzero means allocate static storage.
1237 In a FUNCTION_DECL, nonzero if function has been defined.
1238 In a CONSTRUCTOR, nonzero means allocate static storage. */
1239 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1241 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1242 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1244 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1245 should only be executed if an exception is thrown, not on normal exit
1247 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1249 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1250 separate cleanup in honor_protect_cleanup_actions. */
1251 #define TRY_CATCH_IS_CLEANUP(NODE) \
1252 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1254 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1255 CASE_HIGH operand has been processed. */
1256 #define CASE_HIGH_SEEN(NODE) \
1257 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1259 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1260 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1262 /* In an expr node (usually a conversion) this means the node was made
1263 implicitly and should not lead to any sort of warning. In a decl node,
1264 warnings concerning the decl should be suppressed. This is used at
1265 least for used-before-set warnings, and it set after one warning is
1267 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1269 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1270 this string as an argument. */
1271 #define TREE_SYMBOL_REFERENCED(NODE) \
1272 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1274 /* Nonzero in a pointer or reference type means the data pointed to
1275 by this type can alias anything. */
1276 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1277 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1279 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1280 #define MOVE_NONTEMPORAL(NODE) \
1281 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1283 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1284 there was an overflow in folding. */
1286 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1288 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1289 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1291 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1293 #define TREE_OVERFLOW_P(EXPR) \
1294 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1296 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1297 nonzero means name is to be accessible from outside this module.
1298 In an IDENTIFIER_NODE, nonzero means an external declaration
1299 accessible from outside this module was previously seen
1300 for this name in an inner scope. */
1301 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1303 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1304 of cached values, or is something else. */
1305 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1307 /* In a SAVE_EXPR, indicates that the original expression has already
1308 been substituted with a VAR_DECL that contains the value. */
1309 #define SAVE_EXPR_RESOLVED_P(NODE) \
1310 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1312 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1314 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1315 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1317 /* In any expression, decl, or constant, nonzero means it has side effects or
1318 reevaluation of the whole expression could produce a different value.
1319 This is set if any subexpression is a function call, a side effect or a
1320 reference to a volatile variable. In a ..._DECL, this is set only if the
1321 declaration said `volatile'. This will never be set for a constant. */
1322 #define TREE_SIDE_EFFECTS(NODE) \
1323 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1325 /* In a LABEL_DECL, nonzero means this label had its address taken
1326 and therefore can never be deleted and is a jump target for
1328 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1330 /* Nonzero means this expression is volatile in the C sense:
1331 its address should be of type `volatile WHATEVER *'.
1332 In other words, the declared item is volatile qualified.
1333 This is used in _DECL nodes and _REF nodes.
1334 On a FUNCTION_DECL node, this means the function does not
1335 return normally. This is the same effect as setting
1336 the attribute noreturn on the function in C.
1338 In a ..._TYPE node, means this type is volatile-qualified.
1339 But use TYPE_VOLATILE instead of this macro when the node is a type,
1340 because eventually we may make that a different bit.
1342 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1343 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1345 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1346 accessing the memory pointed to won't generate a trap. However,
1347 this only applies to an object when used appropriately: it doesn't
1348 mean that writing a READONLY mem won't trap. Similarly for
1349 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1351 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1352 (or slice of the array) always belongs to the range of the array.
1353 I.e. that the access will not trap, provided that the access to
1354 the base to the array will not trap. */
1355 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1357 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1358 nonzero means it may not be the lhs of an assignment.
1359 Nonzero in a FUNCTION_DECL means this function should be treated
1360 as "const" function (can only read its arguments). */
1361 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1363 /* Value of expression is constant. Always on in all ..._CST nodes. May
1364 also appear in an expression or decl where the value is constant. */
1365 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1367 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1368 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1369 (TYPE_CHECK (NODE)->base.constant_flag)
1371 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1372 #define DECL_UNSIGNED(NODE) \
1373 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1375 /* In integral and pointer types, means an unsigned type. */
1376 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1378 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1379 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1380 This is interesting in an inline function, since it might not need
1381 to be compiled separately.
1382 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1383 if the sdb debugging info for the type has been written.
1384 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1385 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1387 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1389 /* Nonzero in a _DECL if the name is used in its scope.
1390 Nonzero in an expr node means inhibit warning if value is unused.
1391 In IDENTIFIER_NODEs, this means that some extern decl for this name
1393 In a BLOCK, this means that the block contains variables that are used. */
1394 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1396 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1397 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1398 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1400 /* In a CALL_EXPR, means that it's safe to use the target of the call
1401 expansion as the return slot for a call that returns in memory. */
1402 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1403 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1405 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1406 reference (and the TREE_TYPE is a pointer to the true type). */
1407 #define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->base.private_flag)
1409 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1410 thunked-to function. */
1411 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1413 /* In a type, nonzero means that all objects of the type are guaranteed by the
1414 language or front-end to be properly aligned, so we can indicate that a MEM
1415 of this type is aligned at least to the alignment of the type, even if it
1416 doesn't appear that it is. We see this, for example, in object-oriented
1417 languages where a tag field may show this is an object of a more-aligned
1418 variant of the more generic type.
1420 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1422 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1424 /* Used in classes in C++. */
1425 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1426 /* Used in classes in C++.
1427 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1428 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1430 /* Nonzero in a _DECL if the use of the name is defined as a
1431 deprecated feature by __attribute__((deprecated)). */
1432 #define TREE_DEPRECATED(NODE) \
1433 ((NODE)->base.deprecated_flag)
1435 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1436 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1437 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1438 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1440 /* In fixed-point types, means a saturating type. */
1441 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1443 /* These flags are available for each language front end to use internally. */
1444 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1445 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1446 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1447 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1448 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1449 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1450 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1452 /* Define additional fields and accessors for nodes representing constants. */
1454 /* In an INTEGER_CST node. These two together make a 2-word integer.
1455 If the data type is signed, the value is sign-extended to 2 words
1456 even though not all of them may really be in use.
1457 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1458 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1459 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1460 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1462 #define INT_CST_LT(A, B) \
1463 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1464 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1465 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1467 #define INT_CST_LT_UNSIGNED(A, B) \
1468 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1469 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1470 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1471 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1472 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1474 struct tree_int_cst GTY(())
1476 struct tree_common common;
1480 /* In a REAL_CST node. struct real_value is an opaque entity, with
1481 manipulators defined in real.h. We don't want tree.h depending on
1482 real.h and transitively on tm.h. */
1485 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1486 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1488 struct tree_real_cst GTY(())
1490 struct tree_common common;
1491 struct real_value * real_cst_ptr;
1494 /* In a FIXED_CST node. */
1497 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1498 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1500 struct tree_fixed_cst GTY(())
1502 struct tree_common common;
1503 struct fixed_value * fixed_cst_ptr;
1506 /* In a STRING_CST */
1507 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1508 #define TREE_STRING_POINTER(NODE) \
1509 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1511 struct tree_string GTY(())
1513 struct tree_common common;
1518 /* In a COMPLEX_CST node. */
1519 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1520 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1522 struct tree_complex GTY(())
1524 struct tree_common common;
1529 /* In a VECTOR_CST node. */
1530 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1532 struct tree_vector GTY(())
1534 struct tree_common common;
1540 /* Define fields and accessors for some special-purpose tree nodes. */
1542 #define IDENTIFIER_LENGTH(NODE) \
1543 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1544 #define IDENTIFIER_POINTER(NODE) \
1545 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1546 #define IDENTIFIER_HASH_VALUE(NODE) \
1547 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1549 /* Translate a hash table identifier pointer to a tree_identifier
1550 pointer, and vice versa. */
1552 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1553 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1554 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1556 struct tree_identifier GTY(())
1558 struct tree_common common;
1559 struct ht_identifier id;
1562 /* In a TREE_LIST node. */
1563 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1564 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1566 struct tree_list GTY(())
1568 struct tree_common common;
1573 /* In a TREE_VEC node. */
1574 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1575 #define TREE_VEC_END(NODE) \
1576 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1578 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1580 struct tree_vec GTY(())
1582 struct tree_common common;
1584 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1587 /* In a CONSTRUCTOR node. */
1588 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1589 #define CONSTRUCTOR_ELT(NODE,IDX) \
1590 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1591 #define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1593 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1594 value of each element (stored within VAL). IX must be a scratch variable
1595 of unsigned integer type. */
1596 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1597 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1599 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1603 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1604 the value of each element (stored within VAL) and its index (stored
1605 within INDEX). IX must be a scratch variable of unsigned integer type. */
1606 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1607 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1609 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1610 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1614 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1615 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1617 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1618 _ce___->index = INDEX; \
1619 _ce___->value = VALUE; \
1622 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1623 element. INDEX can optionally design the position of VALUE: in arrays,
1624 it is the index where VALUE has to be placed; in structures, it is the
1625 FIELD_DECL of the member. */
1626 typedef struct constructor_elt_d GTY(())
1632 DEF_VEC_O(constructor_elt);
1633 DEF_VEC_ALLOC_O(constructor_elt,gc);
1635 struct tree_constructor GTY(())
1637 struct tree_common common;
1638 VEC(constructor_elt,gc) *elts;
1641 /* Define fields and accessors for some nodes that represent expressions. */
1643 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1644 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1645 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1646 && integer_zerop (TREE_OPERAND (NODE, 0)))
1648 /* In ordinary expression nodes. */
1649 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1650 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1652 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1653 length. Its value includes the length operand itself; that is,
1654 the minimum valid length is 1.
1655 Note that we have to bypass the use of TREE_OPERAND to access
1656 that field to avoid infinite recursion in expanding the macros. */
1657 #define VL_EXP_OPERAND_LENGTH(NODE) \
1658 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1660 /* In gimple statements. */
1661 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1662 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1663 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1665 /* In a LOOP_EXPR node. */
1666 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1668 /* The source location of this expression. Non-tree_exp nodes such as
1669 decls and constants can be shared among multiple locations, so
1671 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1672 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1673 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1674 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1675 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1676 #define EXPR_FILENAME(NODE) (expr_filename ((NODE)))
1677 #define EXPR_LINENO(NODE) (expr_lineno ((NODE)))
1679 /* True if a tree is an expression or statement that can have a
1681 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1683 /* In a TARGET_EXPR node. */
1684 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1685 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1686 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1688 /* DECL_EXPR accessor. This gives access to the DECL associated with
1689 the given declaration statement. */
1690 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1692 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1694 /* SWITCH_EXPR accessors. These give access to the condition, body and
1695 original condition type (before any compiler conversions)
1696 of the switch statement, respectively. */
1697 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1698 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1699 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1701 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1702 of a case label, respectively. */
1703 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1704 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1705 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1707 /* The operands of a TARGET_MEM_REF. */
1708 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1709 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1710 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1711 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1712 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1713 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1714 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1716 /* The operands of a BIND_EXPR. */
1717 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1718 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1719 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1721 /* GOTO_EXPR accessor. This gives access to the label associated with
1722 a goto statement. */
1723 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1725 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1726 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1727 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1729 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1730 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1731 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1732 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1733 /* Nonzero if we want to create an ASM_INPUT instead of an
1734 ASM_OPERAND with no operands. */
1735 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1736 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1738 /* COND_EXPR accessors. */
1739 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1740 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1741 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1743 /* Accessors for the chains of recurrences. */
1744 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1745 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1746 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1747 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1749 /* LABEL_EXPR accessor. This gives access to the label associated with
1750 the given label expression. */
1751 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1753 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1754 accessors for SSA operands. */
1756 /* CATCH_EXPR accessors. */
1757 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1758 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1760 /* EH_FILTER_EXPR accessors. */
1761 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1762 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1763 #define EH_FILTER_MUST_NOT_THROW(NODE) \
1764 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
1766 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1767 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1768 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1769 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1770 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1772 /* OBJ_TYPE_REF accessors. */
1773 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1774 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1775 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1777 /* ASSERT_EXPR accessors. */
1778 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1779 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1781 /* CALL_EXPR accessors.
1783 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1784 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1785 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1786 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1787 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1789 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1790 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1791 the argument count is zero when checking is enabled. Instead, do
1792 the pointer arithmetic to advance past the 3 fixed operands in a
1793 CALL_EXPR. That produces a valid pointer to just past the end of the
1794 operand array, even if it's not valid to dereference it. */
1795 #define CALL_EXPR_ARGP(NODE) \
1796 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1798 /* OpenMP directive and clause accessors. */
1800 #define OMP_BODY(NODE) \
1801 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1802 #define OMP_CLAUSES(NODE) \
1803 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1805 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1806 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1807 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1808 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1810 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1811 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1812 #define OMP_TASK_FN(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 2)
1813 #define OMP_TASK_DATA_ARG(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 3)
1814 #define OMP_TASK_COPYFN(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 4)
1815 #define OMP_TASK_ARG_SIZE(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 5)
1816 #define OMP_TASK_ARG_ALIGN(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 6)
1818 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1819 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1820 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1821 #define OMP_TASKREG_FN(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 2)
1822 #define OMP_TASKREG_DATA_ARG(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 3)
1824 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1825 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1826 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1827 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1828 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1829 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1831 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1832 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1833 #define OMP_SECTIONS_CONTROL(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 2)
1835 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1837 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1838 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1840 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1842 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1844 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1845 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1847 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1848 #define OMP_CLAUSE_DECL(NODE) \
1849 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1850 OMP_CLAUSE_PRIVATE, \
1851 OMP_CLAUSE_COPYPRIVATE), 0)
1853 /* True on an OMP_SECTION statement that was the last lexical member.
1854 This status is meaningful in the implementation of lastprivate. */
1855 #define OMP_SECTION_LAST(NODE) \
1856 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1858 /* True on an OMP_RETURN statement if the return does not require a
1859 thread synchronization via some sort of barrier. The exact barrier
1860 that would otherwise be emitted is dependent on the OMP statement
1861 with which this return is associated. */
1862 #define OMP_RETURN_NOWAIT(NODE) \
1863 (OMP_RETURN_CHECK (NODE)->base.private_flag)
1865 /* True on an OMP_PARALLEL statement if it represents an explicit
1866 combined parallel work-sharing constructs. */
1867 #define OMP_PARALLEL_COMBINED(NODE) \
1868 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1870 /* True on a PRIVATE clause if its decl is kept around for debugging
1871 information only and its DECL_VALUE_EXPR is supposed to point
1872 to what it has been remapped to. */
1873 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1874 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1876 /* True on a PRIVATE clause if ctor needs access to outer region's
1878 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1879 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1881 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1882 decl is present in the chain. */
1883 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1884 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1885 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1886 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1887 OMP_CLAUSE_LASTPRIVATE),\
1890 #define OMP_CLAUSE_IF_EXPR(NODE) \
1891 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1892 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1893 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1894 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1895 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1897 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1898 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1899 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1900 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1901 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1902 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1904 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1905 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1906 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1907 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1908 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1909 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1910 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1911 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1913 enum omp_clause_schedule_kind
1915 OMP_CLAUSE_SCHEDULE_STATIC,
1916 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1917 OMP_CLAUSE_SCHEDULE_GUIDED,
1918 OMP_CLAUSE_SCHEDULE_AUTO,
1919 OMP_CLAUSE_SCHEDULE_RUNTIME
1922 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1923 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1925 enum omp_clause_default_kind
1927 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1928 OMP_CLAUSE_DEFAULT_SHARED,
1929 OMP_CLAUSE_DEFAULT_NONE,
1930 OMP_CLAUSE_DEFAULT_PRIVATE,
1931 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1934 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1935 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1937 struct tree_exp GTY(())
1939 struct tree_common common;
1942 tree GTY ((special ("tree_exp"),
1943 desc ("TREE_CODE ((tree) &%0)")))
1947 /* SSA_NAME accessors. */
1949 /* Returns the variable being referenced. Once released, this is the
1950 only field that can be relied upon. */
1951 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1953 /* Returns the statement which defines this reference. Note that
1954 we use the same field when chaining SSA_NAME nodes together on
1955 the SSA_NAME freelist. */
1956 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1958 /* Returns the SSA version number of this SSA name. Note that in
1959 tree SSA, version numbers are not per variable and may be recycled. */
1960 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1962 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1963 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1965 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1966 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1968 /* Nonzero if this SSA_NAME expression is currently on the free list of
1969 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1970 has no meaning for an SSA_NAME. */
1971 #define SSA_NAME_IN_FREE_LIST(NODE) \
1972 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1974 /* Nonzero if this SSA_NAME is the default definition for the
1975 underlying symbol. A default SSA name is created for symbol S if
1976 the very first reference to S in the function is a read operation.
1977 Default definitions are always created by an empty statement and
1978 belong to no basic block. */
1979 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1980 SSA_NAME_CHECK (NODE)->base.default_def_flag
1982 /* Attributes for SSA_NAMEs for pointer-type variables. */
1983 #define SSA_NAME_PTR_INFO(N) \
1984 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1986 /* Get the value of this SSA_NAME, if available. */
1987 #define SSA_NAME_VALUE(N) \
1988 SSA_NAME_CHECK (N)->ssa_name.value_handle
1990 #ifndef _TREE_FLOW_H
1991 struct ptr_info_def;
1996 /* Immediate use linking structure. This structure is used for maintaining
1997 a doubly linked list of uses of an SSA_NAME. */
1998 typedef struct ssa_use_operand_d GTY(())
2000 struct ssa_use_operand_d* GTY((skip(""))) prev;
2001 struct ssa_use_operand_d* GTY((skip(""))) next;
2002 tree GTY((skip(""))) stmt;
2003 tree *GTY((skip(""))) use;
2004 } ssa_use_operand_t;
2006 /* Return the immediate_use information for an SSA_NAME. */
2007 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2009 struct tree_ssa_name GTY(())
2011 struct tree_common common;
2013 /* _DECL wrapped by this SSA name. */
2016 /* SSA version number. */
2017 unsigned int version;
2019 /* Pointer attributes used for alias analysis. */
2020 struct ptr_info_def *ptr_info;
2022 /* Value for SSA name used by various passes.
2024 Right now only invariants are allowed to persist beyond a pass in
2025 this field; in the future we will allow VALUE_HANDLEs to persist
2029 /* Immediate uses list for this SSA_NAME. */
2030 struct ssa_use_operand_d imm_uses;
2033 /* In a PHI_NODE node. */
2035 /* These 2 macros should be considered off limits for use by developers. If
2036 you wish to access the use or def fields of a PHI_NODE in the SSA
2037 optimizers, use the accessor macros found in tree-ssa-operands.h.
2038 These two macros are to be used only by those accessor macros, and other
2039 select places where we *absolutely* must take the address of the tree. */
2041 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
2042 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
2044 /* PHI_NODEs for each basic block are chained together in a single linked
2045 list. The head of the list is linked from the block annotation, and
2046 the link to the next PHI is in PHI_CHAIN. */
2047 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
2049 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
2050 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
2051 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
2052 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
2053 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
2054 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
2056 struct phi_arg_d GTY(())
2058 /* imm_use MUST be the first element in struct because we do some
2059 pointer arithmetic with it. See phi_arg_index_from_use. */
2060 struct ssa_use_operand_d imm_use;
2064 struct tree_phi_node GTY(())
2066 struct tree_base common;
2072 /* Basic block holding this PHI node. */
2073 struct basic_block_def *bb;
2075 /* Arguments of the PHI node. These are maintained in the same
2076 order as predecessor edge vector BB->PREDS. */
2077 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
2081 #define OMP_CLAUSE_CODE(NODE) \
2082 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2084 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2085 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2087 #define OMP_CLAUSE_CODE(NODE) \
2088 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2090 #define OMP_CLAUSE_OPERAND(NODE, I) \
2091 OMP_CLAUSE_ELT_CHECK (NODE, I)
2093 struct tree_omp_clause GTY(())
2095 struct tree_common common;
2096 enum omp_clause_code code;
2097 union omp_clause_subcode {
2098 enum omp_clause_default_kind default_kind;
2099 enum omp_clause_schedule_kind schedule_kind;
2100 enum tree_code reduction_code;
2101 } GTY ((skip)) subcode;
2102 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
2106 struct varray_head_tag;
2108 /* In a BLOCK node. */
2109 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2110 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2111 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2112 /* Note: when changing this, make sure to find the places
2113 that use chainon or nreverse. */
2114 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
2115 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2116 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2118 /* Nonzero means that this block is prepared to handle exceptions
2119 listed in the BLOCK_VARS slot. */
2120 #define BLOCK_HANDLER_BLOCK(NODE) \
2121 (BLOCK_CHECK (NODE)->block.handler_block_flag)
2123 /* An index number for this block. These values are not guaranteed to
2124 be unique across functions -- whether or not they are depends on
2125 the debugging output format in use. */
2126 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2128 /* If block reordering splits a lexical block into discontiguous
2129 address ranges, we'll make a copy of the original block.
2131 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2132 In that case, we have one source block that has been replicated
2133 (through inlining or unrolling) into many logical blocks, and that
2134 these logical blocks have different physical variables in them.
2136 In this case, we have one logical block split into several
2137 non-contiguous address ranges. Most debug formats can't actually
2138 represent this idea directly, so we fake it by creating multiple
2139 logical blocks with the same variables in them. However, for those
2140 that do support non-contiguous regions, these allow the original
2141 logical block to be reconstructed, along with the set of address
2144 One of the logical block fragments is arbitrarily chosen to be
2145 the ORIGIN. The other fragments will point to the origin via
2146 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2147 be null. The list of fragments will be chained through
2148 BLOCK_FRAGMENT_CHAIN from the origin. */
2150 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2151 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2153 /* For an inlined function, this gives the location where it was called
2154 from. This is only set in the top level block, which corresponds to the
2155 inlined function scope. This is used in the debug output routines. */
2157 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2159 struct tree_block GTY(())
2161 struct tree_common common;
2163 unsigned handler_block_flag : 1;
2164 unsigned abstract_flag : 1;
2165 unsigned block_num : 30;
2172 tree abstract_origin;
2173 tree fragment_origin;
2174 tree fragment_chain;
2177 /* Define fields and accessors for nodes representing data types. */
2179 /* See tree.def for documentation of the use of these fields.
2180 Look at the documentation of the various ..._TYPE tree codes.
2182 Note that the type.values, type.minval, and type.maxval fields are
2183 overloaded and used for different macros in different kinds of types.
2184 Each macro must check to ensure the tree node is of the proper kind of
2185 type. Note also that some of the front-ends also overload these fields,
2186 so they must be checked as well. */
2188 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2189 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2190 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2191 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2192 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2193 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2194 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2195 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2196 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2197 (INTEGER_TYPE_CHECK (NODE)->type.values \
2198 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2199 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2200 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2201 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2202 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2203 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2204 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2205 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2206 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2207 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2208 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2209 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2210 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2211 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2212 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2213 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2214 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2215 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2216 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2217 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2219 /* The "canonical" type for this type node, which can be used to
2220 compare the type for equality with another type. If two types are
2221 equal (based on the semantics of the language), then they will have
2222 equivalent TYPE_CANONICAL entries.
2224 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2225 be used for comparison against other types. Instead, the type is
2226 said to require structural equality checks, described in
2227 TYPE_STRUCTURAL_EQUALITY_P. */
2228 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2229 /* Indicates that the type node requires structural equality
2230 checks. The compiler will need to look at the composition of the
2231 type to determine whether it is equal to another type, rather than
2232 just comparing canonical type pointers. For instance, we would need
2233 to look at the return and parameter types of a FUNCTION_TYPE
2235 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2236 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2237 type node requires structural equality. */
2238 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2239 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2240 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2241 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2243 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2244 in the debugging output. We use this to describe a vector as a
2245 structure containing an array. */
2246 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2248 /* For record and union types, information about this type, as a base type
2250 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2252 /* For non record and union types, used in a language-dependent way. */
2253 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2255 /* The (language-specific) typed-based alias set for this type.
2256 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2257 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2258 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2259 type can alias objects of any type. */
2260 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2262 /* Nonzero iff the typed-based alias set for this type has been
2264 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2266 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2268 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2270 /* The alignment necessary for objects of this type.
2271 The value is an int, measured in bits. */
2272 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2274 /* 1 if the alignment for this type was requested by "aligned" attribute,
2275 0 if it is the default for this type. */
2276 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2278 /* The alignment for NODE, in bytes. */
2279 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2281 /* If your language allows you to declare types, and you want debug info
2282 for them, then you need to generate corresponding TYPE_DECL nodes.
2283 These "stub" TYPE_DECL nodes have no name, and simply point at the
2284 type node. You then set the TYPE_STUB_DECL field of the type node
2285 to point back at the TYPE_DECL node. This allows the debug routines
2286 to know that the two nodes represent the same type, so that we only
2287 get one debug info record for them. */
2288 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2290 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2291 has BLKmode only because it lacks the alignment requirement for
2293 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2295 /* In an INTEGER_TYPE, it means the type represents a size. We use
2296 this both for validity checking and to permit optimizations that
2297 are unsafe for other types. Note that the C `size_t' type should
2298 *not* have this flag set. The `size_t' type is simply a typedef
2299 for an ordinary integer type that happens to be the type of an
2300 expression returned by `sizeof'; `size_t' has no special
2301 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2302 always actual sizes. */
2303 #define TYPE_IS_SIZETYPE(NODE) \
2304 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2306 /* Nonzero in a type considered volatile as a whole. */
2307 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2309 /* Means this type is const-qualified. */
2310 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2312 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2314 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2316 /* There is a TYPE_QUAL value for each type qualifier. They can be
2317 combined by bitwise-or to form the complete set of qualifiers for a
2320 #define TYPE_UNQUALIFIED 0x0
2321 #define TYPE_QUAL_CONST 0x1
2322 #define TYPE_QUAL_VOLATILE 0x2
2323 #define TYPE_QUAL_RESTRICT 0x4
2325 /* The set of type qualifiers for this type. */
2326 #define TYPE_QUALS(NODE) \
2327 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2328 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2329 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2331 /* These flags are available for each language front end to use internally. */
2332 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2333 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2334 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2335 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2336 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2337 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2338 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2340 /* Used to keep track of visited nodes in tree traversals. This is set to
2341 0 by copy_node and make_node. */
2342 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2344 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2345 that distinguish string from array of char).
2346 If set in a INTEGER_TYPE, indicates a character type. */
2347 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2349 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2350 object of the given ARRAY_TYPE. This allows temporaries to be
2352 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2353 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2355 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2356 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2357 (((unsigned HOST_WIDE_INT) 1) \
2358 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2360 /* Set precision to n when we have 2^n sub-parts of the vector. */
2361 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2362 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2364 /* Indicates that objects of this type must be initialized by calling a
2365 function when they are created. */
2366 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2367 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2369 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2370 the same way that the first union alternative would be passed. */
2371 #define TYPE_TRANSPARENT_UNION(NODE) \
2372 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2374 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2375 address of a component of the type. This is the counterpart of
2376 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2377 #define TYPE_NONALIASED_COMPONENT(NODE) \
2378 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2380 /* Indicated that objects of this type should be laid out in as
2381 compact a way as possible. */
2382 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2384 /* Used by type_contains_placeholder_p to avoid recomputation.
2385 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2386 this field directly. */
2387 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2388 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2392 struct tree_type GTY(())
2394 struct tree_common common;
2401 unsigned int precision : 9;
2402 ENUM_BITFIELD(machine_mode) mode : 7;
2404 unsigned string_flag : 1;
2405 unsigned no_force_blk_flag : 1;
2406 unsigned needs_constructing_flag : 1;
2407 unsigned transparent_union_flag : 1;
2408 unsigned packed_flag : 1;
2409 unsigned restrict_flag : 1;
2410 unsigned contains_placeholder_bits : 2;
2412 unsigned lang_flag_0 : 1;
2413 unsigned lang_flag_1 : 1;
2414 unsigned lang_flag_2 : 1;
2415 unsigned lang_flag_3 : 1;
2416 unsigned lang_flag_4 : 1;
2417 unsigned lang_flag_5 : 1;
2418 unsigned lang_flag_6 : 1;
2419 unsigned user_align : 1;
2424 union tree_type_symtab {
2425 int GTY ((tag ("0"))) address;
2426 const char * GTY ((tag ("1"))) pointer;
2427 struct die_struct * GTY ((tag ("2"))) die;
2428 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2429 descbits ("2"))) symtab;
2438 alias_set_type alias_set;
2439 /* Points to a structure whose details depend on the language in use. */
2440 struct lang_type *lang_specific;
2443 /* Define accessor macros for information about type inheritance
2446 A "basetype" means a particular usage of a data type for inheritance
2447 in another type. Each such basetype usage has its own "binfo"
2448 object to describe it. The binfo object is a TREE_VEC node.
2450 Inheritance is represented by the binfo nodes allocated for a
2451 given type. For example, given types C and D, such that D is
2452 inherited by C, 3 binfo nodes will be allocated: one for describing
2453 the binfo properties of C, similarly one for D, and one for
2454 describing the binfo properties of D as a base type for C.
2455 Thus, given a pointer to class C, one can get a pointer to the binfo
2456 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2458 /* BINFO specific flags. */
2460 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2461 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2463 /* Flags for language dependent use. */
2464 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2465 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2466 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2467 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2468 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2469 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2470 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2472 /* The actual data type node being inherited in this basetype. */
2473 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2475 /* The offset where this basetype appears in its containing type.
2476 BINFO_OFFSET slot holds the offset (in bytes)
2477 from the base of the complete object to the base of the part of the
2478 object that is allocated on behalf of this `type'.
2479 This is always 0 except when there is multiple inheritance. */
2481 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2482 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2484 /* The virtual function table belonging to this basetype. Virtual
2485 function tables provide a mechanism for run-time method dispatching.
2486 The entries of a virtual function table are language-dependent. */
2488 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2490 /* The virtual functions in the virtual function table. This is
2491 a TREE_LIST that is used as an initial approximation for building
2492 a virtual function table for this basetype. */
2493 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2495 /* A vector of binfos for the direct basetypes inherited by this
2498 If this basetype describes type D as inherited in C, and if the
2499 basetypes of D are E and F, then this vector contains binfos for
2500 inheritance of E and F by C. */
2501 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2503 /* The number of basetypes for NODE. */
2504 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2506 /* Accessor macro to get to the Nth base binfo of this binfo. */
2507 #define BINFO_BASE_BINFO(NODE,N) \
2508 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2509 #define BINFO_BASE_ITERATE(NODE,N,B) \
2510 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2511 #define BINFO_BASE_APPEND(NODE,T) \
2512 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2514 /* For a BINFO record describing a virtual base class, i.e., one where
2515 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2516 base. The actual contents are language-dependent. In the C++
2517 front-end this field is an INTEGER_CST giving an offset into the
2518 vtable where the offset to the virtual base can be found. */
2519 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2521 /* Indicates the accesses this binfo has to its bases. The values are
2522 access_public_node, access_protected_node or access_private_node.
2523 If this array is not present, public access is implied. */
2524 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2526 #define BINFO_BASE_ACCESS(NODE,N) \
2527 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2528 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2529 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2531 /* The index in the VTT where this subobject's sub-VTT can be found.
2532 NULL_TREE if there is no sub-VTT. */
2533 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2535 /* The index in the VTT where the vptr for this subobject can be
2536 found. NULL_TREE if there is no secondary vptr in the VTT. */
2537 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2539 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2540 inheriting this base for non-virtual bases. For virtual bases it
2541 points either to the binfo for which this is a primary binfo, or to
2542 the binfo of the most derived type. */
2543 #define BINFO_INHERITANCE_CHAIN(NODE) \
2544 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2546 struct tree_binfo GTY (())
2548 struct tree_common common;
2554 VEC(tree,gc) *base_accesses;
2560 VEC(tree,none) base_binfos;
2564 /* Define fields and accessors for nodes representing declared names. */
2566 /* Nonzero if DECL represents a variable for the SSA passes. */
2567 #define SSA_VAR_P(DECL) \
2568 (TREE_CODE (DECL) == VAR_DECL \
2569 || TREE_CODE (DECL) == PARM_DECL \
2570 || TREE_CODE (DECL) == RESULT_DECL \
2572 || (TREE_CODE (DECL) == SSA_NAME \
2573 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2574 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2575 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2576 || MTAG_P (SSA_NAME_VAR (DECL)))))
2581 /* Enumerate visibility settings. */
2582 #ifndef SYMBOL_VISIBILITY_DEFINED
2583 #define SYMBOL_VISIBILITY_DEFINED
2584 enum symbol_visibility
2587 VISIBILITY_PROTECTED,
2596 /* This is the name of the object as written by the user.
2597 It is an IDENTIFIER_NODE. */
2598 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2600 /* Every ..._DECL node gets a unique number. */
2601 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2603 /* These two fields describe where in the source code the declaration
2604 was. If the declaration appears in several places (as for a C
2605 function that is declared first and then defined later), this
2606 information should refer to the definition. */
2607 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2608 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2609 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2610 #define DECL_IS_BUILTIN(DECL) \
2611 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2613 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2614 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2615 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2616 points to either the FUNCTION_DECL for the containing function,
2617 the RECORD_TYPE or UNION_TYPE for the containing type, or
2618 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2620 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2621 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2622 struct tree_decl_minimal GTY(())
2624 struct tree_common common;
2631 /* When computing aliasing information, we represent the memory pointed-to
2632 by pointers with artificial variables called "memory tags" (MT). There
2633 are two kinds of tags, namely symbol and name:
2635 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2636 represent all the pointed-to locations and variables pointed-to by
2637 the same pointer symbol. Usually, this set is computed using
2638 type-based analysis (i.e., alias set classes), but this may not
2641 Name tags (NMT) are used in flow-sensitive points-to alias
2642 analysis, they represent the variables and memory locations
2643 pointed-to by a specific SSA_NAME pointer.
2645 In general, given a pointer P with a symbol tag SMT, the alias set
2646 of SMT should be the union of all the alias sets of the NMTs of
2647 every SSA_NAME for P. */
2648 struct tree_memory_tag GTY(())
2650 struct tree_decl_minimal common;
2652 bitmap GTY ((skip)) aliases;
2654 /* True if this tag has global scope. */
2655 unsigned int is_global : 1;
2658 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2659 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2661 /* Memory Partition Tags (MPTs) group memory symbols under one
2662 common name for the purposes of placing memory PHI nodes. */
2664 struct tree_memory_partition_tag GTY(())
2666 struct tree_memory_tag common;
2668 /* Set of symbols grouped under this MPT. */
2672 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2675 /* For any sort of a ..._DECL node, this points to the original (abstract)
2676 decl node which this decl is an instance of, or else it is NULL indicating
2677 that this decl is not an instance of some other decl. For example,
2678 in a nested declaration of an inline function, this points back to the
2680 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2682 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2683 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2684 #define DECL_ORIGIN(NODE) \
2685 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2687 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2688 inline instance of some original (abstract) decl from an inline function;
2689 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2690 nodes can also have their abstract origin set to themselves. */
2691 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2692 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2694 /* In a DECL this is the field where attributes are stored. */
2695 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2697 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2698 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2699 For a VAR_DECL, holds the initial value.
2700 For a PARM_DECL, not used--default
2701 values for parameters are encoded in the type of the function,
2702 not in the PARM_DECL slot.
2703 For a FIELD_DECL, this is used for enumeration values and the C
2704 frontend uses it for temporarily storing bitwidth of bitfields.
2706 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2707 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2709 /* Holds the size of the datum, in bits, as a tree expression.
2710 Need not be constant. */
2711 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2712 /* Likewise for the size in bytes. */
2713 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2714 /* Holds the alignment required for the datum, in bits. */
2715 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2716 /* The alignment of NODE, in bytes. */
2717 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2718 /* Set if the alignment of this DECL has been set by the user, for
2719 example with an 'aligned' attribute. */
2720 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2721 /* Holds the machine mode corresponding to the declaration of a variable or
2722 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2724 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2726 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2727 operation it is. Note, however, that this field is overloaded, with
2728 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2729 checked before any access to the former. */
2730 #define DECL_FUNCTION_CODE(NODE) \
2731 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2732 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2733 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2735 /* Nonzero for a given ..._DECL node means that the name of this node should
2736 be ignored for symbolic debug purposes. */
2737 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2739 /* Nonzero for a given ..._DECL node means that this node represents an
2740 "abstract instance" of the given declaration (e.g. in the original
2741 declaration of an inline function). When generating symbolic debugging
2742 information, we mustn't try to generate any address information for nodes
2743 marked as "abstract instances" because we don't actually generate
2744 any code or allocate any data space for such instances. */
2745 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2747 /* Language-specific decl information. */
2748 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2750 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2751 do not allocate storage, and refer to a definition elsewhere. Note that
2752 this does not necessarily imply the entity represented by NODE
2753 has no program source-level definition in this translation unit. For
2754 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2755 DECL_EXTERNAL may be true simultaneously; that can be the case for
2756 a C99 "extern inline" function. */
2757 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2759 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2760 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2762 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2764 Also set in some languages for variables, etc., outside the normal
2765 lexical scope, such as class instance variables. */
2766 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2768 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2769 Used in FIELD_DECLs for vtable pointers.
2770 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2771 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2773 /* Used to indicate that this DECL represents a compiler-generated entity. */
2774 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2776 /* Additional flags for language-specific uses. */
2777 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2778 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2779 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2780 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2781 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2782 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2783 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2784 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2786 /* Used to indicate an alias set for the memory pointed to by this
2787 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2788 pointer (or reference) type. */
2789 #define DECL_POINTER_ALIAS_SET(NODE) \
2790 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2792 /* Nonzero if an alias set has been assigned to this declaration. */
2793 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2794 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2796 /* Nonzero for a decl which is at file scope. */
2797 #define DECL_FILE_SCOPE_P(EXP) \
2798 (! DECL_CONTEXT (EXP) \
2799 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2801 /* Nonzero for a decl that is decorated using attribute used.
2802 This indicates compiler tools that this decl needs to be preserved. */
2803 #define DECL_PRESERVE_P(DECL) \
2804 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2806 /* For function local variables of COMPLEX and VECTOR types,
2807 indicates that the variable is not aliased, and that all
2808 modifications to the variable have been adjusted so that
2809 they are killing assignments. Thus the variable may now
2810 be treated as a GIMPLE register, and use real instead of
2811 virtual ops in SSA form. */
2812 #define DECL_GIMPLE_REG_P(DECL) \
2813 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2815 /* For a DECL with pointer type, this is set if Type Based Alias
2816 Analysis should not be applied to this DECL. */
2817 #define DECL_NO_TBAA_P(DECL) \
2818 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2820 struct tree_decl_common GTY(())
2822 struct tree_decl_minimal common;
2825 ENUM_BITFIELD(machine_mode) mode : 8;
2827 unsigned nonlocal_flag : 1;
2828 unsigned virtual_flag : 1;
2829 unsigned ignored_flag : 1;
2830 unsigned abstract_flag : 1;
2831 unsigned artificial_flag : 1;
2832 unsigned user_align : 1;
2833 unsigned preserve_flag: 1;
2834 unsigned debug_expr_is_from : 1;
2836 unsigned lang_flag_0 : 1;
2837 unsigned lang_flag_1 : 1;
2838 unsigned lang_flag_2 : 1;
2839 unsigned lang_flag_3 : 1;
2840 unsigned lang_flag_4 : 1;
2841 unsigned lang_flag_5 : 1;
2842 unsigned lang_flag_6 : 1;
2843 unsigned lang_flag_7 : 1;
2845 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2846 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2847 unsigned decl_flag_0 : 1;
2848 /* In FIELD_DECL, this is DECL_PACKED. */
2849 unsigned decl_flag_1 : 1;
2850 /* In FIELD_DECL, this is DECL_BIT_FIELD
2851 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2852 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2853 unsigned decl_flag_2 : 1;
2854 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2855 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2856 unsigned decl_flag_3 : 1;
2857 /* Logically, these two would go in a theoretical base shared by var and
2859 unsigned gimple_reg_flag : 1;
2860 /* In a DECL with pointer type, set if no TBAA should be done. */
2861 unsigned no_tbaa_flag : 1;
2862 /* Padding so that 'align' can be on a 32-bit boundary. */
2863 unsigned decl_common_unused : 2;
2865 unsigned int align : 24;
2866 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2867 unsigned int off_align : 8;
2872 tree abstract_origin;
2874 alias_set_type pointer_alias_set;
2875 /* Points to a structure whose details depend on the language in use. */
2876 struct lang_decl *lang_specific;
2879 extern tree decl_value_expr_lookup (tree);
2880 extern void decl_value_expr_insert (tree, tree);
2882 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2883 if transformations have made this more complicated than evaluating the
2884 decl itself. This should only be used for debugging; once this field has
2885 been set, the decl itself may not legitimately appear in the function. */
2886 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2887 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2888 #define DECL_VALUE_EXPR(NODE) \
2889 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2890 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2891 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2893 /* Holds the RTL expression for the value of a variable or function.
2894 This value can be evaluated lazily for functions, variables with
2895 static storage duration, and labels. */
2896 #define DECL_RTL(NODE) \
2897 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2898 ? (NODE)->decl_with_rtl.rtl \
2899 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2901 /* Set the DECL_RTL for NODE to RTL. */
2902 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2904 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2905 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2907 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2908 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2910 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2911 NODE1, it will not be set for NODE2; this is a lazy copy. */
2912 #define COPY_DECL_RTL(NODE1, NODE2) \
2913 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2915 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2916 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2918 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2919 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2921 struct tree_decl_with_rtl GTY(())
2923 struct tree_decl_common common;
2927 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2928 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2929 of the structure. */
2930 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2932 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2933 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2934 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2935 natural alignment of the field's type). */
2936 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2938 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2939 if so, the type that was originally specified for it.
2940 TREE_TYPE may have been modified (in finish_struct). */
2941 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2943 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2944 if nonzero, indicates that the field occupies the type. */
2945 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2947 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2948 DECL_FIELD_OFFSET which are known to be always zero.
2949 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2951 #define DECL_OFFSET_ALIGN(NODE) \
2952 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2954 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2955 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2956 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2957 /* 1 if the alignment for this type was requested by "aligned" attribute,
2958 0 if it is the default for this type. */
2960 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2961 which this FIELD_DECL is defined. This information is needed when
2962 writing debugging information about vfield and vbase decls for C++. */
2963 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2965 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2966 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2968 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2970 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2972 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2973 this component. This makes it possible for Type-Based Alias Analysis
2974 to disambiguate accesses to this field with indirect accesses using
2977 struct S { int i; } s;
2980 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2982 From the implementation's viewpoint, the alias set of the type of the
2983 field 'i' (int) will not be recorded as a subset of that of the type of
2984 's' (struct S) in record_component_aliases. The counterpart is that
2985 accesses to s.i must not be given the alias set of the type of 'i'
2986 (int) but instead directly that of the type of 's' (struct S). */
2987 #define DECL_NONADDRESSABLE_P(NODE) \
2988 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2990 struct tree_field_decl GTY(())
2992 struct tree_decl_common common;
2995 tree bit_field_type;
3002 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3003 dense, unique within any one function, and may be used to index arrays.
3004 If the value is -1, then no UID has been assigned. */
3005 #define LABEL_DECL_UID(NODE) \
3006 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
3008 /* In LABEL_DECL nodes, nonzero means that an error message about
3009 jumping into such a binding contour has been printed for this label. */
3010 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3012 struct tree_label_decl GTY(())
3014 struct tree_decl_with_rtl common;
3017 struct tree_result_decl GTY(())
3019 struct tree_decl_with_rtl common;
3022 struct tree_const_decl GTY(())
3024 struct tree_decl_with_rtl common;
3027 /* For a PARM_DECL, records the data type used to pass the argument,
3028 which may be different from the type seen in the program. */
3029 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3031 /* For PARM_DECL, holds an RTL for the stack slot or register
3032 where the data was actually passed. */
3033 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3035 struct tree_parm_decl GTY(())
3037 struct tree_decl_with_rtl common;
3042 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3043 this variable in a BIND_EXPR. */
3044 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3045 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3047 /* Used to indicate that the linkage status of this DECL is not yet known,
3048 so it should not be output now. */
3049 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3051 /* Nonzero for a given ..._DECL node means that no warnings should be
3052 generated just because this node is unused. */
3053 #define DECL_IN_SYSTEM_HEADER(NODE) \
3054 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
3056 /* Used to indicate that this DECL has weak linkage. */
3057 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3059 /* Internal to the gimplifier. Indicates that the value is a formal
3060 temporary controlled by the gimplifier. */
3061 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
3062 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
3064 /* Used to indicate that the DECL is a dllimport. */
3065 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3067 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
3068 based on a variable with a restrict qualified type. If it is,
3069 DECL_RESTRICT_BASE returns the restrict qualified variable on which
3072 #define DECL_BASED_ON_RESTRICT_P(NODE) \
3073 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
3074 #define DECL_GET_RESTRICT_BASE(NODE) \
3075 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
3076 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
3077 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
3079 extern tree decl_restrict_base_lookup (tree);
3080 extern void decl_restrict_base_insert (tree, tree);
3082 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3083 not be put out unless it is needed in this translation unit.
3084 Entities like this are shared across translation units (like weak
3085 entities), but are guaranteed to be generated by any translation
3086 unit that needs them, and therefore need not be put out anywhere
3087 where they are not needed. DECL_COMDAT is just a hint to the
3088 back-end; it is up to front-ends which set this flag to ensure
3089 that there will never be any harm, other than bloat, in putting out
3090 something which is DECL_COMDAT. */
3091 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3093 /* A replaceable function is one which may be replaced at link-time
3094 with an entirely different definition, provided that the
3095 replacement has the same type. For example, functions declared
3096 with __attribute__((weak)) on most systems are replaceable.
3098 COMDAT functions are not replaceable, since all definitions of the
3099 function must be equivalent. It is important that COMDAT functions
3100 not be treated as replaceable so that use of C++ template
3101 instantiations is not penalized.
3103 For example, DECL_REPLACEABLE is used to determine whether or not a
3104 function (including a template instantiation) which is not
3105 explicitly declared "inline" can be inlined. If the function is
3106 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3107 implementation chosen at link-time may be different. However, a
3108 function that is not DECL_REPLACEABLE can be inlined, since all
3109 versions of the function will be functionally identical. */
3110 #define DECL_REPLACEABLE_P(NODE) \
3111 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3113 /* The name of the object as the assembler will see it (but before any
3114 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3115 as DECL_NAME. It is an IDENTIFIER_NODE. */
3116 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3118 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3119 This is true of all DECL nodes except FIELD_DECL. */
3120 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3121 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3123 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3124 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3126 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3127 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3129 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3130 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3131 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3133 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3134 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3135 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3136 semantics of using this macro, are different than saying:
3138 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3140 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3142 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3143 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3144 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3145 DECL_ASSEMBLER_NAME (DECL1)) \
3148 /* Records the section name in a section attribute. Used to pass
3149 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3150 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3152 /* Value of the decls's visibility attribute */
3153 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3155 /* Nonzero means that the decl had its visibility specified rather than
3157 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3159 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3160 multiple translation units should be merged. */
3161 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3163 struct tree_decl_with_vis GTY(())
3165 struct tree_decl_with_rtl common;
3166 tree assembler_name;
3169 /* Belong to VAR_DECL exclusively. */
3170 unsigned defer_output:1;
3171 unsigned hard_register:1;
3172 unsigned thread_local:1;
3173 unsigned common_flag:1;
3174 unsigned in_text_section : 1;
3175 unsigned gimple_formal_temp : 1;
3176 unsigned dllimport_flag : 1;
3177 unsigned based_on_restrict_p : 1;
3178 /* Used by C++. Might become a generic decl flag. */
3179 unsigned shadowed_for_var_p : 1;
3181 /* Don't belong to VAR_DECL exclusively. */
3182 unsigned in_system_header_flag : 1;
3183 unsigned weak_flag:1;
3184 unsigned seen_in_bind_expr : 1;
3185 unsigned comdat_flag : 1;
3186 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3187 unsigned visibility_specified : 1;
3188 /* Belong to FUNCTION_DECL exclusively. */
3189 unsigned one_only : 1;
3190 unsigned init_priority_p:1;
3192 /* Belongs to VAR_DECL exclusively. */
3193 ENUM_BITFIELD(tls_model) tls_model : 3;
3194 /* 11 unused bits. */
3197 /* In a VAR_DECL that's static,
3198 nonzero if the space is in the text section. */
3199 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3201 /* Nonzero for a given ..._DECL node means that this node should be
3202 put in .common, if possible. If a DECL_INITIAL is given, and it
3203 is not error_mark_node, then the decl cannot be put in .common. */
3204 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3206 /* In a VAR_DECL, nonzero if the decl is a register variable with
3207 an explicit asm specification. */
3208 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3210 extern tree decl_debug_expr_lookup (tree);
3211 extern void decl_debug_expr_insert (tree, tree);
3212 /* For VAR_DECL, this is set to either an expression that it was split
3213 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3214 subexpressions that it was split into. */
3215 #define DECL_DEBUG_EXPR(NODE) \
3216 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3218 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3219 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3221 /* An initialization priority. */
3222 typedef unsigned short priority_type;
3224 extern priority_type decl_init_priority_lookup (tree);
3225 extern priority_type decl_fini_priority_lookup (tree);
3226 extern void decl_init_priority_insert (tree, priority_type);
3227 extern void decl_fini_priority_insert (tree, priority_type);
3229 /* In a non-local VAR_DECL with static storage duration, true if the
3230 variable has an initialization priority. If false, the variable
3231 will be initialized at the DEFAULT_INIT_PRIORITY. */
3232 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3233 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3235 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3237 #define DECL_INIT_PRIORITY(NODE) \
3238 (decl_init_priority_lookup (NODE))
3239 /* Set the initialization priority for NODE to VAL. */
3240 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3241 (decl_init_priority_insert (NODE, VAL))
3243 /* For a FUNCTION_DECL the finalization priority of NODE. */
3244 #define DECL_FINI_PRIORITY(NODE) \
3245 (decl_fini_priority_lookup (NODE))
3246 /* Set the finalization priority for NODE to VAL. */
3247 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3248 (decl_fini_priority_insert (NODE, VAL))
3250 /* The initialization priority for entities for which no explicit
3251 initialization priority has been specified. */
3252 #define DEFAULT_INIT_PRIORITY 65535
3254 /* The maximum allowed initialization priority. */
3255 #define MAX_INIT_PRIORITY 65535
3257 /* The largest priority value reserved for use by system runtime
3259 #define MAX_RESERVED_INIT_PRIORITY 100
3261 /* In a VAR_DECL, the model to use if the data should be allocated from
3262 thread-local storage. */
3263 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3265 /* In a VAR_DECL, nonzero if the data should be allocated from
3266 thread-local storage. */
3267 #define DECL_THREAD_LOCAL_P(NODE) \
3268 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3270 struct tree_var_decl GTY(())
3272 struct tree_decl_with_vis common;
3276 /* This field is used to reference anything in decl.result and is meant only
3277 for use by the garbage collector. */
3278 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3280 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3281 Before the struct containing the FUNCTION_DECL is laid out,
3282 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3283 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3284 function. When the class is laid out, this pointer is changed
3285 to an INTEGER_CST node which is suitable for use as an index
3286 into the virtual function table.
3287 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3288 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3290 struct tree_decl_non_common GTY(())
3293 struct tree_decl_with_vis common;
3294 /* C++ uses this in namespaces. */
3296 /* C++ uses this in templates. */
3298 /* Almost all FE's use this. */
3300 /* C++ uses this in namespaces. */
3304 /* In FUNCTION_DECL, holds the decl for the return value. */
3305 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3307 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3308 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3310 /* In a FUNCTION_DECL, the saved representation of the body of the
3312 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3314 /* Nonzero in a FUNCTION_DECL means this function should be treated
3315 as if it were a malloc, meaning it returns a pointer that is
3317 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3319 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3320 C++ operator new, meaning that it returns a pointer for which we
3321 should not use type based aliasing. */
3322 #define DECL_IS_OPERATOR_NEW(NODE) \
3323 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3325 /* Nonzero in a FUNCTION_DECL means this function may return more
3327 #define DECL_IS_RETURNS_TWICE(NODE) \
3328 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3330 /* Nonzero in a FUNCTION_DECL means this function should be treated
3331 as "pure" function (like const function, but may read global memory). */
3332 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3334 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3335 the const or pure function may not terminate. When this is nonzero
3336 for a const or pure function, it can be dealt with by cse passes
3337 but cannot be removed by dce passes since you are not allowed to
3338 change an infinite looping program into one that terminates without
3340 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3341 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3343 /* Nonzero in a FUNCTION_DECL means this function should be treated
3344 as "novops" function (function that does not read global memory,
3345 but may have arbitrary side effects). */
3346 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3348 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3349 at the beginning or end of execution. */
3350 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3351 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3353 #define DECL_STATIC_DESTRUCTOR(NODE) \
3354 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3356 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3357 be instrumented with calls to support routines. */
3358 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3359 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3361 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3362 disabled in this function. */
3363 #define DECL_NO_LIMIT_STACK(NODE) \
3364 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3366 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3367 static chain is not needed. */
3368 #define DECL_NO_STATIC_CHAIN(NODE) \
3369 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3371 /* Nonzero for a decl that cgraph has decided should be inlined into
3372 at least one call site. It is not meaningful to look at this
3373 directly; always use cgraph_function_possibly_inlined_p. */
3374 #define DECL_POSSIBLY_INLINED(DECL) \
3375 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3377 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3378 where it is called. */
3379 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3381 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3382 such as via the `inline' keyword in C/C++. This flag controls the linkage
3383 semantics of 'inline'; whether or not the function is inlined is
3384 controlled by DECL_INLINE. */
3385 #define DECL_DECLARED_INLINE_P(NODE) \
3386 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3388 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3389 disregarding size and cost heuristics. This is equivalent to using
3390 the always_inline attribute without the required diagnostics if the
3391 function cannot be inlined. */
3392 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3393 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3395 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3396 that describes the status of this function. */
3397 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3399 /* In a FUNCTION_DECL, nonzero means a built in function. */
3400 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3402 /* For a builtin function, identify which part of the compiler defined it. */
3403 #define DECL_BUILT_IN_CLASS(NODE) \
3404 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3406 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3407 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3409 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3410 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3412 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3413 arguments/result/saved_tree fields by front ends. It was either inherit
3414 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3415 which seemed a bit strange. */
3417 struct tree_function_decl GTY(())
3419 struct tree_decl_non_common common;
3423 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3424 DECL_FUNCTION_CODE. Otherwise unused.
3425 ??? The bitfield needs to be able to hold all target function
3427 ENUM_BITFIELD(built_in_function) function_code : 11;
3428 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3430 unsigned static_ctor_flag : 1;
3431 unsigned static_dtor_flag : 1;
3432 unsigned uninlinable : 1;
3434 unsigned possibly_inlined : 1;
3435 unsigned novops_flag : 1;
3436 unsigned returns_twice_flag : 1;
3437 unsigned malloc_flag : 1;
3438 unsigned operator_new_flag : 1;
3439 unsigned declared_inline_flag : 1;
3440 unsigned regdecl_flag : 1;
3442 unsigned inline_flag : 1;
3443 unsigned no_instrument_function_entry_exit : 1;
3444 unsigned no_limit_stack : 1;
3445 unsigned disregard_inline_limits : 1;
3446 unsigned pure_flag : 1;
3447 unsigned looping_const_or_pure_flag : 1;
3453 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3454 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3456 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3457 into stabs. Instead it will generate cross reference ('x') of names.
3458 This uses the same flag as DECL_EXTERNAL. */
3459 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3460 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3462 struct tree_type_decl GTY(())
3464 struct tree_decl_non_common common;
3468 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3469 To reduce overhead, the nodes containing the statements are not trees.
3470 This avoids the overhead of tree_common on all linked list elements.
3472 Use the interface in tree-iterator.h to access this node. */
3474 #define STATEMENT_LIST_HEAD(NODE) \
3475 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3476 #define STATEMENT_LIST_TAIL(NODE) \
3477 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3479 struct tree_statement_list_node
3480 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3482 struct tree_statement_list_node *prev;
3483 struct tree_statement_list_node *next;
3487 struct tree_statement_list
3490 struct tree_common common;
3491 struct tree_statement_list_node *head;
3492 struct tree_statement_list_node *tail;
3495 #define VALUE_HANDLE_ID(NODE) \
3496 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3498 #define VALUE_HANDLE_EXPR_SET(NODE) \
3499 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3501 /* Defined and used in tree-ssa-pre.c. */
3503 struct tree_value_handle GTY(())
3505 struct tree_common common;
3507 /* The set of expressions represented by this handle. */
3508 struct bitmap_set * GTY ((skip)) expr_set;
3510 /* Unique ID for this value handle. IDs are handed out in a
3511 conveniently dense form starting at 0, so that we can make
3512 bitmaps of value handles. */
3516 /* Define the overall contents of a tree node.
3517 It may be any of the structures declared above
3518 for various types of node. */
3520 union tree_node GTY ((ptr_alias (union lang_tree_node),
3521 desc ("tree_node_structure (&%h)")))
3523 struct tree_base GTY ((tag ("TS_BASE"))) base;
3524 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3525 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3526 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3527 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3528 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3529 struct tree_string GTY ((tag ("TS_STRING"))) string;
3530 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3531 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3532 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3533 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3534 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3535 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3536 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3537 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3538 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3539 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3540 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3541 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3542 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3543 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3544 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3545 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3546 struct tree_list GTY ((tag ("TS_LIST"))) list;
3547 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3548 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3549 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3550 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3551 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3552 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3553 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3554 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3555 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3556 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3557 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3558 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3559 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3562 /* Standard named or nameless data types of the C compiler. */
3584 TI_INTEGER_MINUS_ONE,
3601 TI_COMPLEX_INTEGER_TYPE,
3602 TI_COMPLEX_FLOAT_TYPE,
3603 TI_COMPLEX_DOUBLE_TYPE,
3604 TI_COMPLEX_LONG_DOUBLE_TYPE,
3608 TI_LONG_DOUBLE_TYPE,
3612 TI_LONG_DOUBLE_PTR_TYPE,
3613 TI_INTEGER_PTR_TYPE,
3622 TI_VA_LIST_GPR_COUNTER_FIELD,
3623 TI_VA_LIST_FPR_COUNTER_FIELD,
3630 TI_DFLOAT32_PTR_TYPE,
3631 TI_DFLOAT64_PTR_TYPE,
3632 TI_DFLOAT128_PTR_TYPE,
3641 TI_SAT_LLFRACT_TYPE,
3642 TI_SAT_USFRACT_TYPE,
3644 TI_SAT_ULFRACT_TYPE,
3645 TI_SAT_ULLFRACT_TYPE,
3657 TI_SAT_LLACCUM_TYPE,
3658 TI_SAT_USACCUM_TYPE,
3660 TI_SAT_ULACCUM_TYPE,
3661 TI_SAT_ULLACCUM_TYPE,
3710 extern GTY(()) tree global_trees[TI_MAX];
3712 #define error_mark_node global_trees[TI_ERROR_MARK]
3714 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3715 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3716 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3717 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3718 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3720 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3721 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3722 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3723 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3724 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3726 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3727 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3729 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3730 #define integer_one_node global_trees[TI_INTEGER_ONE]
3731 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3732 #define size_zero_node global_trees[TI_SIZE_ZERO]
3733 #define size_one_node global_trees[TI_SIZE_ONE]
3734 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3735 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3736 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3738 /* Base access nodes. */
3739 #define access_public_node global_trees[TI_PUBLIC]
3740 #define access_protected_node global_trees[TI_PROTECTED]
3741 #define access_private_node global_trees[TI_PRIVATE]
3743 #define null_pointer_node global_trees[TI_NULL_POINTER]
3745 #define float_type_node global_trees[TI_FLOAT_TYPE]
3746 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3747 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3749 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3750 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3751 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3752 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3754 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3755 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3756 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3757 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3759 #define void_type_node global_trees[TI_VOID_TYPE]
3760 /* The C type `void *'. */
3761 #define ptr_type_node global_trees[TI_PTR_TYPE]
3762 /* The C type `const void *'. */
3763 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3764 /* The C type `size_t'. */
3765 #define size_type_node global_trees[TI_SIZE_TYPE]
3766 #define pid_type_node global_trees[TI_PID_TYPE]
3767 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3768 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3769 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3770 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3771 /* The C type `FILE *'. */
3772 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3774 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3775 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3776 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3778 /* The decimal floating point types. */
3779 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3780 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3781 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3782 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3783 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3784 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3786 /* The fixed-point types. */
3787 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3788 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3789 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3790 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3791 #define sat_unsigned_short_fract_type_node \
3792 global_trees[TI_SAT_USFRACT_TYPE]
3793 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3794 #define sat_unsigned_long_fract_type_node \
3795 global_trees[TI_SAT_ULFRACT_TYPE]
3796 #define sat_unsigned_long_long_fract_type_node \
3797 global_trees[TI_SAT_ULLFRACT_TYPE]
3798 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3799 #define fract_type_node global_trees[TI_FRACT_TYPE]
3800 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3801 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3802 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3803 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3804 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3805 #define unsigned_long_long_fract_type_node \
3806 global_trees[TI_ULLFRACT_TYPE]
3807 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3808 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3809 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3810 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3811 #define sat_unsigned_short_accum_type_node \
3812 global_trees[TI_SAT_USACCUM_TYPE]
3813 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3814 #define sat_unsigned_long_accum_type_node \
3815 global_trees[TI_SAT_ULACCUM_TYPE]
3816 #define sat_unsigned_long_long_accum_type_node \
3817 global_trees[TI_SAT_ULLACCUM_TYPE]
3818 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3819 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3820 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3821 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3822 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3823 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3824 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3825 #define unsigned_long_long_accum_type_node \
3826 global_trees[TI_ULLACCUM_TYPE]
3827 #define qq_type_node global_trees[TI_QQ_TYPE]
3828 #define hq_type_node global_trees[TI_HQ_TYPE]
3829 #define sq_type_node global_trees[TI_SQ_TYPE]
3830 #define dq_type_node global_trees[TI_DQ_TYPE]
3831 #define tq_type_node global_trees[TI_TQ_TYPE]
3832 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3833 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3834 #define usq_type_node global_trees[TI_USQ_TYPE]
3835 #define udq_type_node global_trees[TI_UDQ_TYPE]
3836 #define utq_type_node global_trees[TI_UTQ_TYPE]
3837 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3838 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3839 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3840 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3841 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3842 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3843 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3844 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3845 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3846 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3847 #define ha_type_node global_trees[TI_HA_TYPE]
3848 #define sa_type_node global_trees[TI_SA_TYPE]
3849 #define da_type_node global_trees[TI_DA_TYPE]
3850 #define ta_type_node global_trees[TI_TA_TYPE]
3851 #define uha_type_node global_trees[TI_UHA_TYPE]
3852 #define usa_type_node global_trees[TI_USA_TYPE]
3853 #define uda_type_node global_trees[TI_UDA_TYPE]
3854 #define uta_type_node global_trees[TI_UTA_TYPE]
3855 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3856 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3857 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3858 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3859 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3860 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3861 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3862 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3864 /* The node that should be placed at the end of a parameter list to
3865 indicate that the function does not take a variable number of
3866 arguments. The TREE_VALUE will be void_type_node and there will be
3867 no TREE_CHAIN. Language-independent code should not assume
3868 anything else about this node. */
3869 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3871 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3872 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3874 /* An enumeration of the standard C integer types. These must be
3875 ordered so that shorter types appear before longer ones, and so
3876 that signed types appear before unsigned ones, for the correct
3877 functioning of interpret_integer() in c-lex.c. */
3878 enum integer_type_kind
3890 itk_unsigned_long_long,
3894 typedef enum integer_type_kind integer_type_kind;
3896 /* The standard C integer types. Use integer_type_kind to index into
3898 extern GTY(()) tree integer_types[itk_none];
3900 #define char_type_node integer_types[itk_char]
3901 #define signed_char_type_node integer_types[itk_signed_char]
3902 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3903 #define short_integer_type_node integer_types[itk_short]
3904 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3905 #define integer_type_node integer_types[itk_int]
3906 #define unsigned_type_node integer_types[itk_unsigned_int]
3907 #define long_integer_type_node integer_types[itk_long]
3908 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3909 #define long_long_integer_type_node integer_types[itk_long_long]
3910 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3912 /* Set to the default thread-local storage (tls) model to use. */
3914 extern enum tls_model flag_tls_default;
3917 /* A pointer-to-function member type looks like:
3924 If __pfn is NULL, it is a NULL pointer-to-member-function.
3926 (Because the vtable is always the first thing in the object, we
3927 don't need its offset.) If the function is virtual, then PFN is
3928 one plus twice the index into the vtable; otherwise, it is just a
3929 pointer to the function.
3931 Unfortunately, using the lowest bit of PFN doesn't work in
3932 architectures that don't impose alignment requirements on function
3933 addresses, or that use the lowest bit to tell one ISA from another,
3934 for example. For such architectures, we use the lowest bit of
3935 DELTA instead of the lowest bit of the PFN, and DELTA will be
3938 enum ptrmemfunc_vbit_where_t
3940 ptrmemfunc_vbit_in_pfn,
3941 ptrmemfunc_vbit_in_delta
3944 #define NULL_TREE (tree) NULL
3946 extern tree decl_assembler_name (tree);
3947 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3949 /* Compute the number of bytes occupied by 'node'. This routine only
3950 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3952 extern size_t tree_size (const_tree);
3954 /* Compute the number of bytes occupied by a tree with code CODE. This
3955 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3957 extern size_t tree_code_size (enum tree_code);
3959 /* Lowest level primitive for allocating a node.
3960 The TREE_CODE is the only argument. Contents are initialized
3961 to zero except for a few of the common fields. */
3963 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3964 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3966 /* Make a copy of a node, with all the same contents. */
3968 extern tree copy_node_stat (tree MEM_STAT_DECL);
3969 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3971 /* Make a copy of a chain of TREE_LIST nodes. */
3973 extern tree copy_list (tree);
3976 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3977 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3979 /* Make a TREE_VEC. */
3981 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3982 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3984 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3985 The name is supplied as a char *. */
3987 extern tree get_identifier (const char *);
3989 #if GCC_VERSION >= 3000
3990 #define get_identifier(str) \
3991 (__builtin_constant_p (str) \
3992 ? get_identifier_with_length ((str), strlen (str)) \
3993 : get_identifier (str))
3997 /* Identical to get_identifier, except that the length is assumed
4000 extern tree get_identifier_with_length (const char *, size_t);
4002 /* If an identifier with the name TEXT (a null-terminated string) has
4003 previously been referred to, return that node; otherwise return
4006 extern tree maybe_get_identifier (const char *);
4008 /* Construct various types of nodes. */
4010 extern tree build_nt (enum tree_code, ...);
4011 extern tree build_nt_call_list (tree, tree);
4013 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
4014 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4015 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4016 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4017 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4018 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4019 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4020 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4021 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
4022 tree MEM_STAT_DECL);
4023 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4024 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
4025 tree MEM_STAT_DECL);
4026 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4027 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
4028 tree, tree, tree MEM_STAT_DECL);
4029 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
4030 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
4032 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
4033 #define build_gimple_modify_stmt(t1,t2) \
4034 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
4036 extern tree build_int_cst (tree, HOST_WIDE_INT);
4037 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
4038 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
4039 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4040 extern tree build_int_cst_wide_type (tree,
4041 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4042 extern tree build_vector (tree, tree);
4043 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
4044 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
4045 extern tree build_constructor_single (tree, tree, tree);
4046 extern tree build_constructor_from_list (tree, tree);
4047 extern tree build_real_from_int_cst (tree, const_tree);
4048 extern tree build_complex (tree, tree, tree);
4049 extern tree build_one_cst (tree);
4050 extern tree build_string (int, const char *);
4051 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
4052 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4053 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4054 extern tree build_fn_decl (const char *, tree);
4055 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
4056 extern tree build_block (tree, tree, tree, tree);
4057 extern tree build_empty_stmt (void);
4058 extern tree build_omp_clause (enum omp_clause_code);
4060 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
4061 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4063 extern tree build_call_list (tree, tree, tree);
4064 extern tree build_call_nary (tree, tree, int, ...);
4065 extern tree build_call_valist (tree, tree, int, va_list);
4066 extern tree build_call_array (tree, tree, int, tree*);
4068 /* Construct various nodes representing data types. */
4070 extern tree make_signed_type (int);
4071 extern tree make_unsigned_type (int);
4072 extern tree signed_or_unsigned_type_for (int, tree);
4073 extern tree signed_type_for (tree);
4074 extern tree unsigned_type_for (tree);
4075 extern void initialize_sizetypes (bool);
4076 extern void set_sizetype (tree);
4077 extern void fixup_unsigned_type (tree);
4078 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4079 extern tree build_pointer_type (tree);
4080 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4081 extern tree build_reference_type (tree);
4082 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4083 extern tree build_vector_type (tree innertype, int nunits);
4084 extern tree build_type_no_quals (tree);
4085 extern tree build_index_type (tree);
4086 extern tree build_index_2_type (tree, tree);
4087 extern tree build_array_type (tree, tree);
4088 extern tree build_function_type (tree, tree);
4089 extern tree build_function_type_list (tree, ...);
4090 extern tree build_varargs_function_type_list (tree, ...);
4091 extern tree build_method_type_directly (tree, tree, tree);
4092 extern tree build_method_type (tree, tree);
4093 extern tree build_offset_type (tree, tree);
4094 extern tree build_complex_type (tree);
4095 extern tree build_resx (int);
4096 extern tree array_type_nelts (const_tree);
4097 extern bool in_array_bounds_p (tree);
4098 extern bool range_in_array_bounds_p (tree);
4100 extern tree value_member (tree, tree);
4101 extern tree purpose_member (const_tree, tree);
4103 extern int attribute_list_equal (const_tree, const_tree);
4104 extern int attribute_list_contained (const_tree, const_tree);
4105 extern int tree_int_cst_equal (const_tree, const_tree);
4106 extern int tree_int_cst_lt (const_tree, const_tree);
4107 extern int tree_int_cst_compare (const_tree, const_tree);
4108 extern int host_integerp (const_tree, int);
4109 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4110 extern int tree_int_cst_msb (const_tree);
4111 extern int tree_int_cst_sgn (const_tree);
4112 extern int tree_int_cst_sign_bit (const_tree);
4113 extern bool tree_expr_nonnegative_p (tree);
4114 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4115 extern bool may_negate_without_overflow_p (const_tree);
4116 extern tree strip_array_types (tree);
4118 /* Construct various nodes representing fract or accum data types. */
4120 extern tree make_fract_type (int, int, int);
4121 extern tree make_accum_type (int, int, int);
4123 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4124 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4125 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4126 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4127 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4128 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4129 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4130 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4132 #define make_or_reuse_signed_fract_type(P) \
4133 make_or_reuse_fract_type (P, 0, 0)
4134 #define make_or_reuse_unsigned_fract_type(P) \
4135 make_or_reuse_fract_type (P, 1, 0)
4136 #define make_or_reuse_sat_signed_fract_type(P) \
4137 make_or_reuse_fract_type (P, 0, 1)
4138 #define make_or_reuse_sat_unsigned_fract_type(P) \
4139 make_or_reuse_fract_type (P, 1, 1)
4140 #define make_or_reuse_signed_accum_type(P) \
4141 make_or_reuse_accum_type (P, 0, 0)
4142 #define make_or_reuse_unsigned_accum_type(P) \
4143 make_or_reuse_accum_type (P, 1, 0)
4144 #define make_or_reuse_sat_signed_accum_type(P) \
4145 make_or_reuse_accum_type (P, 0, 1)
4146 #define make_or_reuse_sat_unsigned_accum_type(P) \
4147 make_or_reuse_accum_type (P, 1, 1)
4149 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4150 put the prototype here. Rtl.h does declare the prototype if
4151 tree.h had been included. */
4153 extern tree make_tree (tree, rtx);
4155 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4158 Such modified types already made are recorded so that duplicates
4161 extern tree build_type_attribute_variant (tree, tree);
4162 extern tree build_decl_attribute_variant (tree, tree);
4164 /* Structure describing an attribute and a function to handle it. */
4165 struct attribute_spec
4167 /* The name of the attribute (without any leading or trailing __),
4168 or NULL to mark the end of a table of attributes. */
4169 const char *const name;
4170 /* The minimum length of the list of arguments of the attribute. */
4171 const int min_length;
4172 /* The maximum length of the list of arguments of the attribute
4173 (-1 for no maximum). */
4174 const int max_length;
4175 /* Whether this attribute requires a DECL. If it does, it will be passed
4176 from types of DECLs, function return types and array element types to
4177 the DECLs, function types and array types respectively; but when
4178 applied to a type in any other circumstances, it will be ignored with
4179 a warning. (If greater control is desired for a given attribute,
4180 this should be false, and the flags argument to the handler may be
4181 used to gain greater control in that case.) */
4182 const bool decl_required;
4183 /* Whether this attribute requires a type. If it does, it will be passed
4184 from a DECL to the type of that DECL. */
4185 const bool type_required;
4186 /* Whether this attribute requires a function (or method) type. If it does,
4187 it will be passed from a function pointer type to the target type,
4188 and from a function return type (which is not itself a function
4189 pointer type) to the function type. */
4190 const bool function_type_required;
4191 /* Function to handle this attribute. NODE points to the node to which
4192 the attribute is to be applied. If a DECL, it should be modified in
4193 place; if a TYPE, a copy should be created. NAME is the name of the
4194 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4195 of the arguments (which may be NULL). FLAGS gives further information
4196 about the context of the attribute. Afterwards, the attributes will
4197 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4198 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4199 as well as in any other cases when the attributes should not be added
4200 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4201 applied to another type or DECL later may be returned;
4202 otherwise the return value should be NULL_TREE. This pointer may be
4203 NULL if no special handling is required beyond the checks implied
4204 by the rest of this structure. */
4205 tree (*const handler) (tree *node, tree name, tree args,
4206 int flags, bool *no_add_attrs);
4209 /* Flags that may be passed in the third argument of decl_attributes, and
4210 to handler functions for attributes. */
4211 enum attribute_flags
4213 /* The type passed in is the type of a DECL, and any attributes that
4214 should be passed in again to be applied to the DECL rather than the
4215 type should be returned. */
4216 ATTR_FLAG_DECL_NEXT = 1,
4217 /* The type passed in is a function return type, and any attributes that
4218 should be passed in again to be applied to the function type rather
4219 than the return type should be returned. */
4220 ATTR_FLAG_FUNCTION_NEXT = 2,
4221 /* The type passed in is an array element type, and any attributes that
4222 should be passed in again to be applied to the array type rather
4223 than the element type should be returned. */
4224 ATTR_FLAG_ARRAY_NEXT = 4,
4225 /* The type passed in is a structure, union or enumeration type being
4226 created, and should be modified in place. */
4227 ATTR_FLAG_TYPE_IN_PLACE = 8,
4228 /* The attributes are being applied by default to a library function whose
4229 name indicates known behavior, and should be silently ignored if they
4230 are not in fact compatible with the function type. */
4231 ATTR_FLAG_BUILT_IN = 16
4234 /* Default versions of target-overridable functions. */
4236 extern tree merge_decl_attributes (tree, tree);
4237 extern tree merge_type_attributes (tree, tree);
4239 /* Given a tree node and a string, return nonzero if the tree node is
4240 a valid attribute name for the string. */
4242 extern int is_attribute_p (const char *, const_tree);
4244 /* Given an attribute name and a list of attributes, return the list element
4245 of the attribute or NULL_TREE if not found. */
4247 extern tree lookup_attribute (const char *, tree);
4249 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4252 extern tree remove_attribute (const char *, tree);
4254 /* Given two attributes lists, return a list of their union. */
4256 extern tree merge_attributes (tree, tree);
4258 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4259 /* Given two Windows decl attributes lists, possibly including
4260 dllimport, return a list of their union . */
4261 extern tree merge_dllimport_decl_attributes (tree, tree);
4263 /* Handle a "dllimport" or "dllexport" attribute. */
4264 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4267 /* Check whether CAND is suitable to be returned from get_qualified_type
4268 (BASE, TYPE_QUALS). */
4270 extern bool check_qualified_type (const_tree, const_tree, int);
4272 /* Return a version of the TYPE, qualified as indicated by the
4273 TYPE_QUALS, if one exists. If no qualified version exists yet,
4274 return NULL_TREE. */
4276 extern tree get_qualified_type (tree, int);
4278 /* Like get_qualified_type, but creates the type if it does not
4279 exist. This function never returns NULL_TREE. */
4281 extern tree build_qualified_type (tree, int);
4283 /* Like build_qualified_type, but only deals with the `const' and
4284 `volatile' qualifiers. This interface is retained for backwards
4285 compatibility with the various front-ends; new code should use
4286 build_qualified_type instead. */
4288 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4289 build_qualified_type ((TYPE), \
4290 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4291 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4293 /* Make a copy of a type node. */
4295 extern tree build_distinct_type_copy (tree);
4296 extern tree build_variant_type_copy (tree);
4298 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4299 fields. Optionally specify an alignment, and then lay it out. */
4301 extern void finish_builtin_struct (tree, const char *,
4304 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4305 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4306 node, does nothing except for the first time. */
4308 extern void layout_type (tree);
4310 /* These functions allow a front-end to perform a manual layout of a
4311 RECORD_TYPE. (For instance, if the placement of subsequent fields
4312 depends on the placement of fields so far.) Begin by calling
4313 start_record_layout. Then, call place_field for each of the
4314 fields. Then, call finish_record_layout. See layout_type for the
4315 default way in which these functions are used. */
4317 typedef struct record_layout_info_s
4319 /* The RECORD_TYPE that we are laying out. */
4321 /* The offset into the record so far, in bytes, not including bits in
4324 /* The last known alignment of SIZE. */
4325 unsigned int offset_align;
4326 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4328 /* The alignment of the record so far, in bits. */
4329 unsigned int record_align;
4330 /* The alignment of the record so far, ignoring #pragma pack and
4331 __attribute__ ((packed)), in bits. */
4332 unsigned int unpacked_align;
4333 /* The previous field layed out. */
4335 /* The static variables (i.e., class variables, as opposed to
4336 instance variables) encountered in T. */
4337 tree pending_statics;
4338 /* Bits remaining in the current alignment group */
4339 int remaining_in_alignment;
4340 /* True if we've seen a packed field that didn't have normal
4341 alignment anyway. */
4342 int packed_maybe_necessary;
4343 } *record_layout_info;
4345 extern record_layout_info start_record_layout (tree);
4346 extern tree bit_from_pos (tree, tree);
4347 extern tree byte_from_pos (tree, tree);
4348 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4349 extern void normalize_offset (tree *, tree *, unsigned int);
4350 extern tree rli_size_unit_so_far (record_layout_info);
4351 extern tree rli_size_so_far (record_layout_info);
4352 extern void normalize_rli (record_layout_info);
4353 extern void place_field (record_layout_info, tree);
4354 extern void compute_record_mode (tree);
4355 extern void finish_record_layout (record_layout_info, int);
4357 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4358 return a canonicalized ..._TYPE node, so that duplicates are not made.
4359 How the hash code is computed is up to the caller, as long as any two
4360 callers that could hash identical-looking type nodes agree. */
4362 extern tree type_hash_canon (unsigned int, tree);
4364 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4365 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4366 fields. Call this only once for any given decl node.
4368 Second argument is the boundary that this field can be assumed to
4369 be starting at (in bits). Zero means it can be assumed aligned
4370 on any boundary that may be needed. */
4372 extern void layout_decl (tree, unsigned);
4374 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4375 a previous call to layout_decl and calls it again. */
4377 extern void relayout_decl (tree);
4379 /* Return the mode for data of a given size SIZE and mode class CLASS.
4380 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4381 The value is BLKmode if no other mode is found. This is like
4382 mode_for_size, but is passed a tree. */
4384 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4386 /* Return an expr equal to X but certainly not valid as an lvalue. */
4388 extern tree non_lvalue (tree);
4390 extern tree convert (tree, tree);
4391 extern unsigned int expr_align (const_tree);
4392 extern tree expr_first (tree);
4393 extern tree expr_last (tree);
4394 extern tree expr_only (tree);
4395 extern tree size_in_bytes (const_tree);
4396 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4397 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4398 extern tree bit_position (const_tree);
4399 extern HOST_WIDE_INT int_bit_position (const_tree);
4400 extern tree byte_position (const_tree);
4401 extern HOST_WIDE_INT int_byte_position (const_tree);
4403 /* Define data structures, macros, and functions for handling sizes
4404 and the various types used to represent sizes. */
4408 SIZETYPE, /* Normal representation of sizes in bytes. */
4409 SSIZETYPE, /* Signed representation of sizes in bytes. */
4410 BITSIZETYPE, /* Normal representation of sizes in bits. */
4411 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4414 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4416 #define sizetype sizetype_tab[(int) SIZETYPE]
4417 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4418 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4419 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4421 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4422 extern tree size_binop (enum tree_code, tree, tree);
4423 extern tree size_diffop (tree, tree);
4425 #define size_int(L) size_int_kind (L, SIZETYPE)
4426 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4427 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4428 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4430 extern tree round_up (tree, int);
4431 extern tree round_down (tree, int);
4432 extern tree get_pending_sizes (void);
4433 extern void put_pending_size (tree);
4434 extern void put_pending_sizes (tree);
4436 /* Type for sizes of data-type. */
4438 #define BITS_PER_UNIT_LOG \
4439 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4440 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4441 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4443 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4444 extern unsigned int maximum_field_alignment;
4445 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4446 extern unsigned int initial_max_fld_align;
4448 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4449 by making the last node in X point to Y.
4450 Returns X, except if X is 0 returns Y. */
4452 extern tree chainon (tree, tree);
4454 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4456 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4457 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4459 /* Return the last tree node in a chain. */
4461 extern tree tree_last (tree);
4463 /* Reverse the order of elements in a chain, and return the new head. */
4465 extern tree nreverse (tree);
4467 /* Returns the length of a chain of nodes
4468 (number of chain pointers to follow before reaching a null pointer). */
4470 extern int list_length (const_tree);
4472 /* Returns the number of FIELD_DECLs in a type. */
4474 extern int fields_length (const_tree);
4476 /* Given an initializer INIT, return TRUE if INIT is zero or some
4477 aggregate of zeros. Otherwise return FALSE. */
4479 extern bool initializer_zerop (const_tree);
4481 /* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4483 extern tree ctor_to_list (tree);
4485 /* Examine CTOR to discover:
4486 * how many scalar fields are set to nonzero values,
4487 and place it in *P_NZ_ELTS;
4488 * how many scalar fields in total are in CTOR,
4489 and place it in *P_ELT_COUNT.
4490 * if a type is a union, and the initializer from the constructor
4491 is not the largest element in the union, then set *p_must_clear.
4493 Return whether or not CTOR is a valid static constant initializer, the same
4494 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4496 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4499 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4501 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4503 extern int integer_zerop (const_tree);
4505 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4507 extern int integer_onep (const_tree);
4509 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4510 all of whose significant bits are 1. */
4512 extern int integer_all_onesp (const_tree);
4514 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4515 exactly one bit 1. */
4517 extern int integer_pow2p (const_tree);
4519 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4520 with a nonzero value. */
4522 extern int integer_nonzerop (const_tree);
4524 extern bool cst_and_fits_in_hwi (const_tree);
4525 extern tree num_ending_zeros (const_tree);
4527 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4530 extern int fixed_zerop (const_tree);
4532 /* staticp (tree x) is nonzero if X is a reference to data allocated
4533 at a fixed address in memory. Returns the outermost data. */
4535 extern tree staticp (tree);
4537 /* save_expr (EXP) returns an expression equivalent to EXP
4538 but it can be used multiple times within context CTX
4539 and only evaluate EXP once. */
4541 extern tree save_expr (tree);
4543 /* Look inside EXPR and into any simple arithmetic operations. Return
4544 the innermost non-arithmetic node. */
4546 extern tree skip_simple_arithmetic (tree);
4548 /* Return which tree structure is used by T. */
4550 enum tree_node_structure_enum tree_node_structure (const_tree);
4552 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4553 or offset that depends on a field within a record.
4555 Note that we only allow such expressions within simple arithmetic
4558 extern bool contains_placeholder_p (const_tree);
4560 /* This macro calls the above function but short-circuits the common
4561 case of a constant to save time. Also check for null. */
4563 #define CONTAINS_PLACEHOLDER_P(EXP) \
4564 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4566 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4567 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4570 extern bool type_contains_placeholder_p (tree);
4572 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4573 return a tree with all occurrences of references to F in a
4574 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4575 contains only arithmetic expressions. */
4577 extern tree substitute_in_expr (tree, tree, tree);
4579 /* This macro calls the above function but short-circuits the common
4580 case of a constant to save time and also checks for NULL. */
4582 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4583 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4585 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4586 for it within OBJ, a tree that is an object or a chain of references. */
4588 extern tree substitute_placeholder_in_expr (tree, tree);
4590 /* This macro calls the above function but short-circuits the common
4591 case of a constant to save time and also checks for NULL. */
4593 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4594 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4595 : substitute_placeholder_in_expr (EXP, OBJ))
4597 /* variable_size (EXP) is like save_expr (EXP) except that it
4598 is for the special case of something that is part of a
4599 variable size for a data type. It makes special arrangements
4600 to compute the value at the right time when the data type
4601 belongs to a function parameter. */
4603 extern tree variable_size (tree);
4605 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4606 but it can be used multiple times
4607 and only evaluate the subexpressions once. */
4609 extern tree stabilize_reference (tree);
4611 /* Subroutine of stabilize_reference; this is called for subtrees of
4612 references. Any expression with side-effects must be put in a SAVE_EXPR
4613 to ensure that it is only evaluated once. */
4615 extern tree stabilize_reference_1 (tree);
4617 /* Return EXP, stripped of any conversions to wider types
4618 in such a way that the result of converting to type FOR_TYPE
4619 is the same as if EXP were converted to FOR_TYPE.
4620 If FOR_TYPE is 0, it signifies EXP's type. */
4622 extern tree get_unwidened (tree, tree);
4624 /* Return OP or a simpler expression for a narrower value
4625 which can be sign-extended or zero-extended to give back OP.
4626 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4627 or 0 if the value should be sign-extended. */
4629 extern tree get_narrower (tree, int *);
4631 /* Return true if T is an expression that get_inner_reference handles. */
4633 extern int handled_component_p (const_tree);
4635 /* Given an expression EXP that is a handled_component_p,
4636 look for the ultimate containing object, which is returned and specify
4637 the access position and size. */
4639 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4640 tree *, enum machine_mode *, int *, int *,
4643 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4644 look for whether EXP or any nested component-refs within EXP is marked
4647 extern bool contains_packed_reference (const_tree exp);
4649 /* Return a tree of sizetype representing the size, in bytes, of the element
4650 of EXP, an ARRAY_REF. */
4652 extern tree array_ref_element_size (tree);
4654 /* Return a tree representing the lower bound of the array mentioned in
4655 EXP, an ARRAY_REF. */
4657 extern tree array_ref_low_bound (tree);
4659 /* Return a tree representing the upper bound of the array mentioned in
4660 EXP, an ARRAY_REF. */
4662 extern tree array_ref_up_bound (tree);
4664 /* Return a tree representing the offset, in bytes, of the field referenced
4665 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4667 extern tree component_ref_field_offset (tree);
4669 /* Given a DECL or TYPE, return the scope in which it was declared, or
4670 NUL_TREE if there is no containing scope. */
4672 extern tree get_containing_scope (const_tree);
4674 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4676 extern tree decl_function_context (const_tree);
4678 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4679 this _DECL with its context, or zero if none. */
4680 extern tree decl_type_context (const_tree);
4682 /* Return 1 if EXPR is the real constant zero. */
4683 extern int real_zerop (const_tree);
4685 /* Declare commonly used variables for tree structure. */
4687 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4688 Zero means allow extended lvalues. */
4690 extern int pedantic_lvalues;
4692 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4694 extern GTY(()) tree current_function_decl;
4696 /* Nonzero means a FUNC_BEGIN label was emitted. */
4697 extern GTY(()) const char * current_function_func_begin_label;
4699 /* Iterator for going through the function arguments. */
4701 tree fntype; /* function type declaration */
4702 tree next; /* TREE_LIST pointing to the next argument */
4703 } function_args_iterator;
4705 /* Initialize the iterator I with arguments from function FNDECL */
4708 function_args_iter_init (function_args_iterator *i, tree fntype)
4711 i->next = TYPE_ARG_TYPES (fntype);
4714 /* Return a pointer that holds the next argument if there are more arguments to
4715 handle, otherwise return NULL. */
4717 static inline tree *
4718 function_args_iter_cond_ptr (function_args_iterator *i)
4720 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4723 /* Return the next argument if there are more arguments to handle, otherwise
4727 function_args_iter_cond (function_args_iterator *i)
4729 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4732 /* Advance to the next argument. */
4734 function_args_iter_next (function_args_iterator *i)
4736 gcc_assert (i->next != NULL_TREE);
4737 i->next = TREE_CHAIN (i->next);
4740 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4741 to point to the next tree element. ITER is an instance of
4742 function_args_iterator used to iterate the arguments. */
4743 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4744 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4745 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4746 function_args_iter_next (&(ITER)))
4748 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4749 to the next tree element. ITER is an instance of function_args_iterator
4750 used to iterate the arguments. */
4751 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4752 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4753 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4754 function_args_iter_next (&(ITER)))
4759 extern unsigned crc32_string (unsigned, const char *);
4760 extern void clean_symbol_name (char *);
4761 extern tree get_file_function_name (const char *);
4762 extern tree get_callee_fndecl (const_tree);
4763 extern void change_decl_assembler_name (tree, tree);
4764 extern int type_num_arguments (const_tree);
4765 extern bool associative_tree_code (enum tree_code);
4766 extern bool commutative_tree_code (enum tree_code);
4767 extern tree upper_bound_in_type (tree, tree);
4768 extern tree lower_bound_in_type (tree, tree);
4769 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4770 extern bool empty_body_p (tree);
4771 extern tree call_expr_arg (tree, int);
4772 extern tree *call_expr_argp (tree, int);
4773 extern tree call_expr_arglist (tree);
4774 extern bool stdarg_p (tree);
4775 extern bool prototype_p (tree);
4776 extern int function_args_count (tree);
4777 extern bool auto_var_in_fn_p (const_tree, const_tree);
4781 extern void expand_expr_stmt (tree);
4782 extern int warn_if_unused_value (const_tree, location_t);
4783 extern void expand_label (tree);
4784 extern void expand_goto (tree);
4786 extern rtx expand_stack_save (void);
4787 extern void expand_stack_restore (tree);
4788 extern void expand_return (tree);
4789 extern int is_body_block (const_tree);
4792 extern void using_eh_for_cleanups (void);
4794 /* In fold-const.c */
4796 /* Non-zero if we are folding constants inside an initializer; zero
4798 extern int folding_initializer;
4800 /* Convert between trees and native memory representation. */
4801 extern int native_encode_expr (const_tree, unsigned char *, int);
4802 extern tree native_interpret_expr (tree, const unsigned char *, int);
4804 /* Fold constants as much as possible in an expression.
4805 Returns the simplified expression.
4806 Acts only on the top level of the expression;
4807 if the argument itself cannot be simplified, its
4808 subexpressions are not changed. */
4810 extern tree fold (tree);
4811 extern tree fold_unary (enum tree_code, tree, tree);
4812 extern tree fold_binary (enum tree_code, tree, tree, tree);
4813 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4814 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4815 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4816 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4817 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4818 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4819 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4820 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4821 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4822 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4823 extern tree fold_build_call_array (tree, tree, int, tree *);
4824 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4825 extern bool fold_convertible_p (const_tree, const_tree);
4826 extern tree fold_convert (tree, tree);
4827 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4828 extern tree fold_ignored_result (tree);
4829 extern tree fold_abs_const (tree, tree);
4830 extern tree fold_indirect_ref_1 (tree, tree);
4831 extern void fold_defer_overflow_warnings (void);
4832 extern void fold_undefer_overflow_warnings (bool, const_tree, int);
4833 extern void fold_undefer_and_ignore_overflow_warnings (void);
4834 extern bool fold_deferring_overflow_warnings_p (void);
4835 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4837 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4840 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4841 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4842 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4843 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4844 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4846 #define add_double(l1,h1,l2,h2,lv,hv) \
4847 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4848 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4849 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4850 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4851 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4852 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4854 #define mul_double(l1,h1,l2,h2,lv,hv) \
4855 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4856 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4857 HOST_WIDE_INT, unsigned int,
4858 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4859 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4860 HOST_WIDE_INT, unsigned int,
4861 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4862 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4863 HOST_WIDE_INT, unsigned int,
4864 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4865 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4866 HOST_WIDE_INT, unsigned int,
4867 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4869 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4870 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4871 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4872 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4875 enum operand_equal_flag
4881 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4882 extern int multiple_of_p (tree, const_tree, const_tree);
4883 extern tree omit_one_operand (tree, tree, tree);
4884 extern tree omit_two_operands (tree, tree, tree, tree);
4885 extern tree invert_truthvalue (tree);
4886 extern tree fold_truth_not_expr (tree);
4887 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4888 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4889 extern tree fold_read_from_constant_string (tree);
4890 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4891 extern tree build_fold_addr_expr (tree);
4892 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4893 extern tree fold_strip_sign_ops (tree);
4894 extern tree build_fold_addr_expr_with_type (tree, tree);
4895 extern tree build_fold_indirect_ref (tree);
4896 extern tree fold_indirect_ref (tree);
4897 extern tree constant_boolean_node (int, tree);
4898 extern tree build_low_bits_mask (tree, unsigned);
4900 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4901 extern void swap_tree_operands (tree, tree *, tree *);
4902 extern enum tree_code swap_tree_comparison (enum tree_code);
4904 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4905 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4907 extern bool tree_expr_nonzero_p (tree);
4908 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4909 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4911 extern bool tree_single_nonzero_warnv_p (tree, bool *);
4912 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4913 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4914 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4916 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4917 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4918 extern bool tree_call_nonnegative_warnv_p (enum tree_code code, tree, tree,
4919 tree, tree, bool *);
4921 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4923 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
4926 extern tree fold_call_expr (tree, bool);
4927 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4928 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4929 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4930 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4931 enum built_in_function);
4932 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4933 enum built_in_function);
4934 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4935 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4936 extern bool fold_builtin_next_arg (tree, bool);
4937 extern enum built_in_function builtin_mathfn_code (const_tree);
4938 extern tree build_function_call_expr (tree, tree);
4939 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4940 extern void debug_fold_checksum (const_tree);
4941 extern tree build_call_expr (tree, int, ...);
4942 extern tree mathfn_built_in (tree, enum built_in_function fn);
4943 extern tree strip_float_extensions (tree);
4944 extern tree c_strlen (tree, int);
4945 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4946 extern tree build_va_arg_indirect_ref (tree);
4947 extern tree build_string_literal (int, const char *);
4948 extern bool validate_arglist (const_tree, ...);
4949 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4950 extern int get_pointer_alignment (tree, unsigned int);
4953 extern tree strip_float_extensions (tree);
4956 extern int really_constant_p (const_tree);
4957 extern bool decl_address_invariant_p (const_tree);
4958 extern int int_fits_type_p (const_tree, const_tree);
4959 #ifndef GENERATOR_FILE
4960 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4962 extern bool variably_modified_type_p (tree, tree);
4963 extern int tree_log2 (const_tree);
4964 extern int tree_floor_log2 (const_tree);
4965 extern int simple_cst_equal (const_tree, const_tree);
4966 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4967 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4968 extern int type_list_equal (const_tree, const_tree);
4969 extern int chain_member (const_tree, const_tree);
4970 extern tree type_hash_lookup (unsigned int, tree);
4971 extern void type_hash_add (unsigned int, tree);
4972 extern int simple_cst_list_equal (const_tree, const_tree);
4973 extern void dump_tree_statistics (void);
4974 extern void expand_function_end (void);
4975 extern void expand_function_start (tree);
4976 extern void stack_protect_prologue (void);
4977 extern void stack_protect_epilogue (void);
4978 extern void recompute_tree_invariant_for_addr_expr (tree);
4979 extern bool needs_to_live_in_memory (const_tree);
4980 extern tree reconstruct_complex_type (tree, tree);
4982 extern int real_onep (const_tree);
4983 extern int real_twop (const_tree);
4984 extern int real_minus_onep (const_tree);
4985 extern void init_ttree (void);
4986 extern void build_common_tree_nodes (bool, bool);
4987 extern void build_common_tree_nodes_2 (int);
4988 extern void build_common_builtin_nodes (void);
4989 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4990 extern tree build_range_type (tree, tree, tree);
4991 extern HOST_WIDE_INT int_cst_value (const_tree);
4992 extern tree build_addr (tree, tree);
4994 extern bool fields_compatible_p (const_tree, const_tree);
4995 extern tree find_compatible_field (tree, tree);
4997 extern location_t expr_location (const_tree);
4998 extern void set_expr_location (tree, location_t);
4999 extern bool expr_has_location (const_tree);
5001 extern location_t *expr_locus (const_tree);
5002 extern void set_expr_locus (tree, source_location *);
5003 extern const char *expr_filename (const_tree);
5004 extern int expr_lineno (const_tree);
5006 extern tree *tree_block (tree);
5007 extern tree *generic_tree_operand (tree, int);
5008 extern tree *generic_tree_type (tree);
5009 extern location_t *block_nonartificial_location (tree);
5012 extern void expand_main_function (void);
5013 extern void init_dummy_function_start (void);
5014 extern void expand_dummy_function_end (void);
5015 extern unsigned int init_function_for_compilation (void);
5016 extern void allocate_struct_function (tree, bool);
5017 extern void push_struct_function (tree fndecl);
5018 extern void init_function_start (tree);
5019 extern bool use_register_for_decl (const_tree);
5020 extern void generate_setjmp_warnings (void);
5021 extern void init_temp_slots (void);
5022 extern void free_temp_slots (void);
5023 extern void pop_temp_slots (void);
5024 extern void push_temp_slots (void);
5025 extern void preserve_temp_slots (rtx);
5026 extern int aggregate_value_p (const_tree, const_tree);
5027 extern void push_function_context (void);
5028 extern void pop_function_context (void);
5029 extern tree gimplify_parameters (void);
5031 /* In print-rtl.c */
5033 extern void print_rtl (FILE *, const_rtx);
5036 /* In print-tree.c */
5037 extern void debug_tree (tree);
5039 extern void dump_addr (FILE*, const char *, const void *);
5040 extern void print_node (FILE *, const char *, tree, int);
5041 extern void print_node_brief (FILE *, const char *, const_tree, int);
5042 extern void indent_to (FILE *, int);
5045 /* In tree-inline.c: */
5046 extern bool debug_find_tree (tree, tree);
5047 /* This is in tree-inline.c since the routine uses
5048 data structures from the inliner. */
5049 extern tree unsave_expr_now (tree);
5050 extern tree build_duplicate_type (tree);
5054 /* Nonzero if this is a call to a function whose return value depends
5055 solely on its arguments, has no side effects, and does not read
5056 global memory. This corresponds to TREE_READONLY for function
5058 #define ECF_CONST (1 << 0)
5059 /* Nonzero if this is a call to "pure" function (like const function,
5060 but may read memory. This corresponds to DECL_PURE_P for function
5062 #define ECF_PURE (1 << 1)
5063 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5064 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5065 for function decls.*/
5066 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5067 /* Nonzero if this call will never return. */
5068 #define ECF_NORETURN (1 << 3)
5069 /* Nonzero if this is a call to malloc or a related function. */
5070 #define ECF_MALLOC (1 << 4)
5071 /* Nonzero if it is plausible that this is a call to alloca. */
5072 #define ECF_MAY_BE_ALLOCA (1 << 5)
5073 /* Nonzero if this is a call to a function that won't throw an exception. */
5074 #define ECF_NOTHROW (1 << 6)
5075 /* Nonzero if this is a call to setjmp or a related function. */
5076 #define ECF_RETURNS_TWICE (1 << 7)
5077 /* Nonzero if this call replaces the current stack frame. */
5078 #define ECF_SIBCALL (1 << 8)
5079 /* Function does not read or write memory (but may have side effects, so
5080 it does not necessarily fit ECF_CONST). */
5081 #define ECF_NOVOPS (1 << 9)
5083 extern int flags_from_decl_or_type (const_tree);
5084 extern int call_expr_flags (const_tree);
5086 extern int setjmp_call_p (const_tree);
5087 extern bool alloca_call_p (const_tree);
5088 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5089 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5093 extern const struct attribute_spec *lookup_attribute_spec (tree);
5095 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5096 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5097 it should be modified in place; if a TYPE, a copy should be created
5098 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5099 information, in the form of a bitwise OR of flags in enum attribute_flags
5100 from tree.h. Depending on these flags, some attributes may be
5101 returned to be applied at a later stage (for example, to apply
5102 a decl attribute to the declaration rather than to its type). */
5103 extern tree decl_attributes (tree *, tree, int);
5105 /* In integrate.c */
5106 extern void set_decl_abstract_flags (tree, int);
5107 extern void set_decl_origin_self (tree);
5109 /* In stor-layout.c */
5110 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5111 extern void fixup_signed_type (tree);
5112 extern void internal_reference_types (void);
5113 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5116 extern void make_decl_rtl (tree);
5117 extern void make_decl_one_only (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);
5130 extern void expand_computed_goto (tree);
5131 extern bool parse_output_constraint (const char **, int, int, int,
5132 bool *, bool *, bool *);
5133 extern bool parse_input_constraint (const char **, int, int, int, int,
5134 const char * const *, bool *, bool *);
5135 extern void expand_asm_expr (tree);
5136 extern tree resolve_asm_operand_names (tree, tree, tree);
5137 extern void expand_case (tree);
5138 extern void expand_decl (tree);
5139 extern void expand_anon_union_decl (tree, tree, 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 *);
5145 /* In gimplify.c. */
5146 extern tree create_artificial_label (void);
5147 extern void gimplify_function_tree (tree);
5148 extern const char *get_name (const_tree);
5149 extern tree unshare_expr (tree);
5150 extern void sort_case_labels (tree);
5152 /* Interface of the DWARF2 unwind info support. */
5154 /* Generate a new label for the CFI info to refer to. */
5156 extern char *dwarf2out_cfi_label (void);
5158 /* Entry point to update the canonical frame address (CFA). */
5160 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5162 /* Add the CFI for saving a register window. */
5164 extern void dwarf2out_window_save (const char *);
5166 /* Add a CFI to update the running total of the size of arguments pushed
5169 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5171 /* Entry point for saving a register to the stack. */
5173 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5175 /* Entry point for saving the return address in the stack. */
5177 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5179 /* Entry point for saving the return address in a register. */
5181 extern void dwarf2out_return_reg (const char *, unsigned);
5183 /* Entry point for saving the first register into the second. */
5185 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5187 /* In tree-inline.c */
5189 /* The type of a set of already-visited pointers. Functions for creating
5190 and manipulating it are declared in pointer-set.h */
5191 struct pointer_set_t;
5193 /* The type of a callback function for walking over tree structure. */
5195 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5197 /* The type of a callback function that represents a custom walk_tree. */
5199 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5200 void *, struct pointer_set_t*);
5202 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5204 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5206 #define walk_tree(a,b,c,d) \
5207 walk_tree_1 (a, b, c, d, NULL)
5208 #define walk_tree_without_duplicates(a,b,c) \
5209 walk_tree_without_duplicates_1 (a, b, c, NULL)
5211 /* Assign the RTX to declaration. */
5213 extern void set_decl_rtl (tree, rtx);
5214 extern void set_decl_incoming_rtl (tree, rtx, bool);
5216 /* Enum and arrays used for tree allocation stats.
5217 Keep in sync with tree.c:tree_node_kind_names. */
5243 extern int tree_node_counts[];
5244 extern int tree_node_sizes[];
5246 /* True if we are in gimple form and the actions of the folders need to
5247 be restricted. False if we are not in gimple form and folding is not
5248 restricted to creating gimple expressions. */
5249 extern bool in_gimple_form;
5251 /* In tree-gimple.c. */
5252 extern tree get_base_address (tree t);
5254 /* In tree-vectorizer.c. */
5255 extern void vect_set_verbosity_level (const char *);
5259 struct tree_map_base GTY(())
5264 extern int tree_map_base_eq (const void *, const void *);
5265 extern unsigned int tree_map_base_hash (const void *);
5266 extern int tree_map_base_marked_p (const void *);
5268 /* Map from a tree to another tree. */
5270 struct tree_map GTY(())
5272 struct tree_map_base base;
5277 #define tree_map_eq tree_map_base_eq
5278 extern unsigned int tree_map_hash (const void *);
5279 #define tree_map_marked_p tree_map_base_marked_p
5281 /* Map from a tree to an int. */
5283 struct tree_int_map GTY(())
5285 struct tree_map_base base;
5289 #define tree_int_map_eq tree_map_base_eq
5290 #define tree_int_map_hash tree_map_base_hash
5291 #define tree_int_map_marked_p tree_map_base_marked_p
5293 /* Map from a tree to initialization/finalization priorities. */
5295 struct tree_priority_map GTY(())
5297 struct tree_map_base base;
5302 #define tree_priority_map_eq tree_map_base_eq
5303 #define tree_priority_map_hash tree_map_base_hash
5304 #define tree_priority_map_marked_p tree_map_base_marked_p
5306 /* In tree-ssa-address.c. */
5307 extern tree tree_mem_ref_addr (tree, tree);
5308 extern void copy_mem_ref_info (tree, tree);
5311 extern bool ssa_name_nonzero_p (const_tree);
5312 extern bool ssa_name_nonnegative_p (const_tree);
5314 /* In tree-object-size.c. */
5315 extern void init_object_sizes (void);
5316 extern void fini_object_sizes (void);
5317 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5320 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5322 /* In tree-inline.c. */
5324 void init_inline_once (void);
5326 /* Compute the number of operands in an expression node NODE. For
5327 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5328 otherwise it is looked up from the node's code. */
5330 tree_operand_length (const_tree node)
5332 if (VL_EXP_CLASS_P (node))
5333 return VL_EXP_OPERAND_LENGTH (node);
5335 return TREE_CODE_LENGTH (TREE_CODE (node));
5338 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5339 have to go towards the end of tree.h so that union tree_node is fully
5340 defined by this point. */
5342 /* Structure containing iterator state. */
5343 typedef struct call_expr_arg_iterator_d GTY (())
5345 tree t; /* the call_expr */
5346 int n; /* argument count */
5347 int i; /* next argument index */
5348 } call_expr_arg_iterator;
5350 typedef struct const_call_expr_arg_iterator_d GTY (())
5352 const_tree t; /* the call_expr */
5353 int n; /* argument count */
5354 int i; /* next argument index */
5355 } const_call_expr_arg_iterator;
5357 /* Initialize the abstract argument list iterator object ITER with the
5358 arguments from CALL_EXPR node EXP. */
5360 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5363 iter->n = call_expr_nargs (exp);
5368 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5371 iter->n = call_expr_nargs (exp);
5375 /* Return the next argument from abstract argument list iterator object ITER,
5376 and advance its state. Return NULL_TREE if there are no more arguments. */
5378 next_call_expr_arg (call_expr_arg_iterator *iter)
5381 if (iter->i >= iter->n)
5383 result = CALL_EXPR_ARG (iter->t, iter->i);
5388 static inline const_tree
5389 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5392 if (iter->i >= iter->n)
5394 result = CALL_EXPR_ARG (iter->t, iter->i);
5399 /* Initialize the abstract argument list iterator object ITER, then advance
5400 past and return the first argument. Useful in for expressions, e.g.
5401 for (arg = first_call_expr_arg (exp, &iter); arg;
5402 arg = next_call_expr_arg (&iter)) */
5404 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5406 init_call_expr_arg_iterator (exp, iter);
5407 return next_call_expr_arg (iter);
5410 static inline const_tree
5411 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5413 init_const_call_expr_arg_iterator (exp, iter);
5414 return next_const_call_expr_arg (iter);
5417 /* Test whether there are more arguments in abstract argument list iterator
5418 ITER, without changing its state. */
5420 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5422 return (iter->i < iter->n);
5426 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5428 return (iter->i < iter->n);
5431 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5432 (of type call_expr_arg_iterator) to hold the iteration state. */
5433 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5434 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5435 (arg) = next_call_expr_arg (&(iter)))
5437 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5438 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5439 (arg) = next_const_call_expr_arg (&(iter)))
5441 #endif /* GCC_TREE_H */