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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
27 #include "statistics.h"
29 #include "double-int.h"
32 /* Codes of tree nodes */
34 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
39 LAST_AND_UNUSED_TREE_CODE /* A convenient way to get a value for
45 #define MAX_TREE_CODES 512
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) == STRUCT_FIELD_TAG \
112 || TREE_CODE (CODE) == NAME_MEMORY_TAG \
113 || TREE_CODE (CODE) == SYMBOL_MEMORY_TAG \
114 || TREE_CODE (CODE) == MEMORY_PARTITION_TAG)
117 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
119 #define VAR_OR_FUNCTION_DECL_P(DECL)\
120 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
122 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
123 ascending code order. */
125 #define INDIRECT_REF_P(CODE)\
126 (TREE_CODE (CODE) == INDIRECT_REF \
127 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
128 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
130 /* Nonzero if CODE represents a reference. */
132 #define REFERENCE_CLASS_P(CODE)\
133 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
135 /* Nonzero if CODE represents a comparison. */
137 #define COMPARISON_CLASS_P(CODE)\
138 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
140 /* Nonzero if CODE represents a unary arithmetic expression. */
142 #define UNARY_CLASS_P(CODE)\
143 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
145 /* Nonzero if CODE represents a binary arithmetic expression. */
147 #define BINARY_CLASS_P(CODE)\
148 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
150 /* Nonzero if CODE represents a statement expression. */
152 #define STATEMENT_CLASS_P(CODE)\
153 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
155 /* Nonzero if CODE represents a function call-like expression with a
156 variable-length operand vector. */
158 #define VL_EXP_CLASS_P(CODE)\
159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
161 /* Nonzero if CODE represents any other expression. */
163 #define EXPRESSION_CLASS_P(CODE)\
164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
166 /* Returns nonzero iff CODE represents a type or declaration. */
168 #define IS_TYPE_OR_DECL_P(CODE)\
169 (TYPE_P (CODE) || DECL_P (CODE))
171 /* Returns nonzero iff CLASS is the tree-code class of an
174 #define IS_EXPR_CODE_CLASS(CLASS)\
175 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
177 /* Returns nonzer iff CLASS is a GIMPLE statement. */
179 #define IS_GIMPLE_STMT_CODE_CLASS(CLASS) ((CLASS) == tcc_gimple_stmt)
181 /* Returns nonzero iff NODE is an expression of some kind. */
183 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
185 /* Returns nonzero iff NODE is an OpenMP directive. */
187 #define OMP_DIRECTIVE_P(NODE) \
188 (TREE_CODE (NODE) == OMP_PARALLEL \
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_CONTINUE)
200 /* Number of argument-words in each kind of tree-node. */
202 extern const unsigned char tree_code_length[];
203 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
205 /* Names of tree components. */
207 extern const char *const tree_code_name[];
209 /* A vectors of trees. */
211 DEF_VEC_ALLOC_P(tree,gc);
212 DEF_VEC_ALLOC_P(tree,heap);
215 /* Classify which part of the compiler has defined a given builtin function.
216 Note that we assume below that this is no more than two bits. */
225 /* Names for the above. */
226 extern const char *const built_in_class_names[4];
228 /* Codes that identify the various built in functions
229 so that expand_call can identify them quickly. */
231 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
232 enum built_in_function
234 #include "builtins.def"
236 /* Complex division routines in libgcc. These are done via builtins
237 because emit_library_call_value can't handle complex values. */
238 BUILT_IN_COMPLEX_MUL_MIN,
239 BUILT_IN_COMPLEX_MUL_MAX
240 = BUILT_IN_COMPLEX_MUL_MIN
241 + MAX_MODE_COMPLEX_FLOAT
242 - MIN_MODE_COMPLEX_FLOAT,
244 BUILT_IN_COMPLEX_DIV_MIN,
245 BUILT_IN_COMPLEX_DIV_MAX
246 = BUILT_IN_COMPLEX_DIV_MIN
247 + MAX_MODE_COMPLEX_FLOAT
248 - MIN_MODE_COMPLEX_FLOAT,
250 /* Upper bound on non-language-specific builtins. */
255 /* Names for the above. */
256 extern const char * built_in_names[(int) END_BUILTINS];
258 /* Helper macros for math builtins. */
260 #define BUILTIN_EXP10_P(FN) \
261 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
262 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
264 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
265 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
266 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
268 #define BUILTIN_SQRT_P(FN) \
269 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
271 #define BUILTIN_CBRT_P(FN) \
272 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
274 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
276 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
277 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
278 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
280 /* An array of _DECL trees for the above. */
281 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
282 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
284 /* In an OMP_CLAUSE node. */
286 /* Number of operands and names for each clause. */
287 extern unsigned const char omp_clause_num_ops[];
288 extern const char * const omp_clause_code_name[];
290 /* Clause codes. Do not reorder, as this is used to index into the tables
291 omp_clause_num_ops and omp_clause_code_name. */
294 /* Clause zero is special-cased inside the parser
295 (c_parser_omp_variable_list). */
296 OMP_CLAUSE_ERROR = 0,
298 /* OpenMP clause: private (variable_list). */
301 /* OpenMP clause: shared (variable_list). */
304 /* OpenMP clause: firstprivate (variable_list). */
305 OMP_CLAUSE_FIRSTPRIVATE,
307 /* OpenMP clause: lastprivate (variable_list). */
308 OMP_CLAUSE_LASTPRIVATE,
310 /* OpenMP clause: reduction (operator:variable_list).
311 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
312 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
313 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
315 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
316 placeholder used in OMP_CLAUSE_REDUCTION_MERGE. */
317 OMP_CLAUSE_REDUCTION,
319 /* OpenMP clause: copyin (variable_list). */
322 /* OpenMP clause: copyprivate (variable_list). */
323 OMP_CLAUSE_COPYPRIVATE,
325 /* OpenMP clause: if (scalar-expression). */
328 /* OpenMP clause: num_threads (integer-expression). */
329 OMP_CLAUSE_NUM_THREADS,
331 /* OpenMP clause: schedule. */
334 /* OpenMP clause: nowait. */
337 /* OpenMP clause: ordered. */
340 /* OpenMP clause: default. */
344 /* The definition of tree nodes fills the next several pages. */
346 /* A tree node can represent a data type, a variable, an expression
347 or a statement. Each node has a TREE_CODE which says what kind of
348 thing it represents. Some common codes are:
349 INTEGER_TYPE -- represents a type of integers.
350 ARRAY_TYPE -- represents a type of pointer.
351 VAR_DECL -- represents a declared variable.
352 INTEGER_CST -- represents a constant integer value.
353 PLUS_EXPR -- represents a sum (an expression).
355 As for the contents of a tree node: there are some fields
356 that all nodes share. Each TREE_CODE has various special-purpose
357 fields as well. The fields of a node are never accessed directly,
358 always through accessor macros. */
360 /* Every kind of tree node starts with this structure,
361 so all nodes have these fields.
363 See the accessor macros, defined below, for documentation of the
367 struct tree_base GTY(())
369 ENUM_BITFIELD(tree_code) code : 16;
371 unsigned side_effects_flag : 1;
372 unsigned constant_flag : 1;
373 unsigned addressable_flag : 1;
374 unsigned volatile_flag : 1;
375 unsigned readonly_flag : 1;
376 unsigned unsigned_flag : 1;
377 unsigned asm_written_flag: 1;
378 unsigned nowarning_flag : 1;
380 unsigned used_flag : 1;
381 unsigned nothrow_flag : 1;
382 unsigned static_flag : 1;
383 unsigned public_flag : 1;
384 unsigned private_flag : 1;
385 unsigned protected_flag : 1;
386 unsigned deprecated_flag : 1;
387 unsigned invariant_flag : 1;
388 unsigned saturating_flag : 1;
390 unsigned lang_flag_0 : 1;
391 unsigned lang_flag_1 : 1;
392 unsigned lang_flag_2 : 1;
393 unsigned lang_flag_3 : 1;
394 unsigned lang_flag_4 : 1;
395 unsigned lang_flag_5 : 1;
396 unsigned lang_flag_6 : 1;
397 unsigned visited : 1;
401 /* FIXME tuples: Eventually, we need to move this somewhere external to
403 union tree_ann_d *ann;
406 struct tree_common GTY(())
408 struct tree_base base;
413 /* GIMPLE_MODIFY_STMT */
414 struct gimple_stmt GTY(())
416 struct tree_base base;
419 /* FIXME tuples: Eventually this should be of type ``struct gimple_expr''. */
420 tree GTY ((length ("TREE_CODE_LENGTH (TREE_CODE (&%h))"))) operands[1];
423 /* The following table lists the uses of each of the above flags and
424 for which types of nodes they are defined. Note that expressions
430 VAR_DECL, FUNCTION_DECL, FIELD_DECL, CONSTRUCTOR, LABEL_DECL,
431 ..._TYPE, IDENTIFIER_NODE.
432 In a STMT_EXPR, it means we want the result of the enclosed
434 CALL_EXPR_TAILCALL in CALL_EXPR
435 CASE_LOW_SEEN in CASE_LABEL_EXPR
440 VAR_DECL, FUNCTION_DECL, CONSTRUCTOR, ADDR_EXPR
443 TREE_SYMBOL_REFERENCED in
446 TARGET_EXPR, WITH_CLEANUP_EXPR
449 EH_FILTER_MUST_NOT_THROW in EH_FILTER_EXPR
450 TYPE_REF_CAN_ALIAS_ALL in
451 POINTER_TYPE, REFERENCE_TYPE
456 CALL_CANNOT_INLINE_P in
462 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
464 VAR_DECL or FUNCTION_DECL or IDENTIFIER_NODE
467 TYPE_CACHED_VALUES_P in
469 SAVE_EXPR_RESOLVED_P in
471 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
472 OMP_CLAUSE_LASTPRIVATE
473 OMP_CLAUSE_PRIVATE_DEBUG in
480 CALL_EXPR_RETURN_SLOT_OPT in
483 PARM_DECL, RESULT_DECL
488 OMP_PARALLEL_COMBINED in
511 TREE_THIS_VOLATILE in
529 TYPE_SIZES_GIMPLIFIED
538 BIT_FIELD_REF_UNSIGNED in
544 VAR_DECL, FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
550 expressions, IDENTIFIER_NODE
555 CALL_EXPR, FUNCTION_DECL
561 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
568 IDENTIFIER_TRANSPARENT_ALIAS in
573 Used in tree traversals to mark visited nodes.
588 ... any expr or decl node
591 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
592 enum tree_node_structure_enum {
593 #include "treestruct.def"
598 /* Define accessors for the fields that all tree nodes have
599 (though some fields are not used for all kinds of nodes). */
601 /* The tree-code says what kind of node it is.
602 Codes are defined in tree.def. */
603 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
604 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
606 /* When checking is enabled, errors will be generated if a tree node
607 is accessed incorrectly. The macros die with a fatal error. */
608 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
610 #define TREE_CHECK(T, CODE) __extension__ \
611 ({ __typeof (T) const __t = (T); \
612 if (TREE_CODE (__t) != (CODE)) \
613 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
617 #define TREE_NOT_CHECK(T, CODE) __extension__ \
618 ({ __typeof (T) const __t = (T); \
619 if (TREE_CODE (__t) == (CODE)) \
620 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
624 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
625 ({ __typeof (T) const __t = (T); \
626 if (TREE_CODE (__t) != (CODE1) \
627 && TREE_CODE (__t) != (CODE2)) \
628 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
629 (CODE1), (CODE2), 0); \
632 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
633 ({ __typeof (T) const __t = (T); \
634 if (TREE_CODE (__t) == (CODE1) \
635 || TREE_CODE (__t) == (CODE2)) \
636 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
637 (CODE1), (CODE2), 0); \
640 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
641 ({ __typeof (T) const __t = (T); \
642 if (TREE_CODE (__t) != (CODE1) \
643 && TREE_CODE (__t) != (CODE2) \
644 && TREE_CODE (__t) != (CODE3)) \
645 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
646 (CODE1), (CODE2), (CODE3), 0); \
649 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
650 ({ __typeof (T) const __t = (T); \
651 if (TREE_CODE (__t) == (CODE1) \
652 || TREE_CODE (__t) == (CODE2) \
653 || TREE_CODE (__t) == (CODE3)) \
654 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
655 (CODE1), (CODE2), (CODE3), 0); \
658 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
659 ({ __typeof (T) const __t = (T); \
660 if (TREE_CODE (__t) != (CODE1) \
661 && TREE_CODE (__t) != (CODE2) \
662 && TREE_CODE (__t) != (CODE3) \
663 && TREE_CODE (__t) != (CODE4)) \
664 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
665 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
668 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
669 ({ __typeof (T) const __t = (T); \
670 if (TREE_CODE (__t) == (CODE1) \
671 || TREE_CODE (__t) == (CODE2) \
672 || TREE_CODE (__t) == (CODE3) \
673 || TREE_CODE (__t) == (CODE4)) \
674 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
675 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
678 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) != (CODE1) \
681 && TREE_CODE (__t) != (CODE2) \
682 && TREE_CODE (__t) != (CODE3) \
683 && TREE_CODE (__t) != (CODE4) \
684 && TREE_CODE (__t) != (CODE5)) \
685 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
686 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
689 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
690 ({ __typeof (T) const __t = (T); \
691 if (TREE_CODE (__t) == (CODE1) \
692 || TREE_CODE (__t) == (CODE2) \
693 || TREE_CODE (__t) == (CODE3) \
694 || TREE_CODE (__t) == (CODE4) \
695 || TREE_CODE (__t) == (CODE5)) \
696 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
697 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
700 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
701 ({ __typeof (T) const __t = (T); \
702 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
703 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
707 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
708 ({ __typeof (T) const __t = (T); \
709 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
710 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
714 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
715 ({ __typeof (T) const __t = (T); \
716 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
717 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
721 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
722 ({ __typeof (T) const __t = (T); \
723 if (TREE_CODE (__t) != OMP_CLAUSE) \
724 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
726 if (__t->omp_clause.code != (CODE)) \
727 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
731 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
732 ({ __typeof (T) const __t = (T); \
733 if (TREE_CODE (__t) != OMP_CLAUSE) \
734 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
736 if ((int) __t->omp_clause.code < (int) (CODE1) \
737 || (int) __t->omp_clause.code > (int) (CODE2)) \
738 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
739 __FUNCTION__, (CODE1), (CODE2)); \
742 /* These checks have to be special cased. */
743 #define EXPR_CHECK(T) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
746 if (!IS_EXPR_CODE_CLASS (__c)) \
747 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
751 #define GIMPLE_STMT_CHECK(T) __extension__ \
752 ({ __typeof (T) const __t = (T); \
753 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
754 if (!IS_GIMPLE_STMT_CODE_CLASS (__c)) \
755 tree_class_check_failed (__t, tcc_gimple_stmt, __FILE__, __LINE__,\
759 /* These checks have to be special cased. */
760 #define NON_TYPE_CHECK(T) __extension__ \
761 ({ __typeof (T) const __t = (T); \
763 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
767 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
768 (*({__typeof (T) const __t = (T); \
769 const int __i = (I); \
770 if (TREE_CODE (__t) != TREE_VEC) \
771 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
773 if (__i < 0 || __i >= __t->vec.length) \
774 tree_vec_elt_check_failed (__i, __t->vec.length, \
775 __FILE__, __LINE__, __FUNCTION__); \
776 &__t->vec.a[__i]; }))
778 #define PHI_NODE_ELT_CHECK(T, I) __extension__ \
779 (*({__typeof (T) const __t = (T); \
780 const int __i = (I); \
781 if (TREE_CODE (__t) != PHI_NODE) \
782 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
784 if (__i < 0 || __i >= __t->phi.capacity) \
785 phi_node_elt_check_failed (__i, __t->phi.num_args, \
786 __FILE__, __LINE__, __FUNCTION__); \
787 &__t->phi.a[__i]; }))
789 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
790 (*({__typeof (T) const __t = (T); \
791 const int __i = (I); \
792 if (TREE_CODE (__t) != OMP_CLAUSE) \
793 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
795 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
796 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
798 &__t->omp_clause.ops[__i]; }))
800 /* Special checks for TREE_OPERANDs. */
801 #define TREE_OPERAND_CHECK(T, I) __extension__ \
802 (*({__typeof (T) const __t = EXPR_CHECK (T); \
803 const int __i = (I); \
804 if (GIMPLE_TUPLE_P (__t)) \
805 gcc_unreachable (); \
806 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
807 tree_operand_check_failed (__i, __t, \
808 __FILE__, __LINE__, __FUNCTION__); \
809 &__t->exp.operands[__i]; }))
811 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
812 (*({__typeof (T) const __t = (T); \
813 const int __i = (I); \
814 if (TREE_CODE (__t) != CODE) \
815 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
816 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
817 tree_operand_check_failed (__i, __t, \
818 __FILE__, __LINE__, __FUNCTION__); \
819 &__t->exp.operands[__i]; }))
821 /* Special checks for GIMPLE_STMT_OPERANDs. */
822 #define GIMPLE_STMT_OPERAND_CHECK(T, I) __extension__ \
823 (*({__typeof (T) const __t = GIMPLE_STMT_CHECK (T); \
824 const int __i = (I); \
825 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
826 tree_operand_check_failed (__i, __t, \
827 __FILE__, __LINE__, __FUNCTION__); \
828 &__t->gstmt.operands[__i]; }))
830 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
832 ({__typeof (T) const __t = (T); \
833 const int __i = (I); \
834 if (TREE_CODE (__t) != (CODE)) \
835 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
836 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
837 tree_operand_check_failed (__i, __t, \
838 __FILE__, __LINE__, __FUNCTION__); \
839 &__t->exp.operands[__i]; }))
841 /* Nodes are chained together for many purposes.
842 Types are chained together to record them for being output to the debugger
843 (see the function `chain_type').
844 Decls in the same scope are chained together to record the contents
846 Statement nodes for successive statements used to be chained together.
847 Often lists of things are represented by TREE_LIST nodes that
848 are chained together. */
850 #define TREE_CHAIN(NODE) __extension__ \
851 (*({__typeof (NODE) const __t = (NODE); \
852 if (GIMPLE_TUPLE_P (__t)) \
853 gcc_unreachable (); \
854 &__t->common.chain; }))
856 /* In all nodes that are expressions, this is the data type of the expression.
857 In POINTER_TYPE nodes, this is the type that the pointer points to.
858 In ARRAY_TYPE nodes, this is the type of the elements.
859 In VECTOR_TYPE nodes, this is the type of the elements. */
860 #define TREE_TYPE(NODE) __extension__ \
861 (*({__typeof (NODE) const __t = (NODE); \
862 if (GIMPLE_TUPLE_P (__t)) \
863 gcc_unreachable (); \
864 &__t->common.type; }))
866 extern void tree_contains_struct_check_failed (const_tree,
867 const enum tree_node_structure_enum,
868 const char *, int, const char *)
871 extern void tree_check_failed (const_tree, const char *, int, const char *,
872 ...) ATTRIBUTE_NORETURN;
873 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
874 ...) ATTRIBUTE_NORETURN;
875 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
876 const char *, int, const char *)
878 extern void tree_range_check_failed (const_tree, const char *, int,
879 const char *, enum tree_code,
881 extern void tree_not_class_check_failed (const_tree,
882 const enum tree_code_class,
883 const char *, int, const char *)
885 extern void tree_vec_elt_check_failed (int, int, const char *,
888 extern void phi_node_elt_check_failed (int, int, const char *,
891 extern void tree_operand_check_failed (int, const_tree,
892 const char *, int, const char *)
894 extern void omp_clause_check_failed (const_tree, const char *, int,
895 const char *, enum omp_clause_code)
897 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
900 extern void omp_clause_range_check_failed (const_tree, const char *, int,
901 const char *, enum omp_clause_code,
902 enum omp_clause_code)
905 #else /* not ENABLE_TREE_CHECKING, or not gcc */
907 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
908 #define TREE_CHECK(T, CODE) (T)
909 #define TREE_NOT_CHECK(T, CODE) (T)
910 #define TREE_CHECK2(T, CODE1, CODE2) (T)
911 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
912 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
913 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
914 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
915 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
916 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
917 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
918 #define TREE_CLASS_CHECK(T, CODE) (T)
919 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
920 #define EXPR_CHECK(T) (T)
921 #define GIMPLE_STMT_CHECK(T) (T)
922 #define NON_TYPE_CHECK(T) (T)
923 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
924 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
925 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
926 #define GIMPLE_STMT_OPERAND_CHECK(T, I) ((T)->gstmt.operands[I])
927 #define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
928 #define PHI_NODE_ELT_CHECK(T, i) ((T)->phi.a[i])
929 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
930 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
931 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
933 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
934 #define TREE_TYPE(NODE) ((NODE)->common.type)
938 #define TREE_BLOCK(NODE) *(tree_block (NODE))
940 #include "tree-check.h"
942 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
943 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
944 #define TREE_MEMORY_TAG_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_MEMORY_TAG)
945 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
946 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
947 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
948 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
949 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
950 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
951 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
952 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
953 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
955 #define RECORD_OR_UNION_CHECK(T) \
956 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
957 #define NOT_RECORD_OR_UNION_CHECK(T) \
958 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
960 #define NUMERICAL_TYPE_CHECK(T) \
961 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
964 /* Nonzero if NODE is a GIMPLE statement. */
965 #define GIMPLE_STMT_P(NODE) \
966 (TREE_CODE_CLASS (TREE_CODE ((NODE))) == tcc_gimple_stmt)
968 /* Nonzero if NODE is a GIMPLE tuple. */
969 #define GIMPLE_TUPLE_P(NODE) (GIMPLE_STMT_P (NODE) || TREE_CODE (NODE) == PHI_NODE)
971 /* A GIMPLE tuple that has a ``locus'' field. */
972 #define GIMPLE_TUPLE_HAS_LOCUS_P(NODE) GIMPLE_STMT_P ((NODE))
974 /* Like TREE_OPERAND but works with GIMPLE stmt tuples as well.
976 If you know the NODE is a GIMPLE statement, use GIMPLE_STMT_OPERAND. If the
977 NODE code is unknown at compile time, use this macro. */
978 #define GENERIC_TREE_OPERAND(NODE, I) *(generic_tree_operand ((NODE), (I)))
980 /* Like TREE_TYPE but returns void_type_node for gimple tuples that have
983 #define GENERIC_TREE_TYPE(NODE) *(generic_tree_type ((NODE)))
985 /* Here is how primitive or already-canonicalized types' hash codes
987 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
989 /* A simple hash function for an arbitrary tree node. This must not be
990 used in hash tables which are saved to a PCH. */
991 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
993 /* The TREE_CHAIN but it is able to handle tuples. */
994 #define GENERIC_NEXT(NODE) \
995 (TREE_CODE (NODE) == PHI_NODE ? PHI_CHAIN (NODE) : \
996 GIMPLE_STMT_P (NODE) ? NULL_TREE : TREE_CHAIN (NODE))
998 /* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
999 that don't change the machine mode. */
1001 #define STRIP_NOPS(EXP) \
1002 while ((TREE_CODE (EXP) == NOP_EXPR \
1003 || TREE_CODE (EXP) == CONVERT_EXPR \
1004 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1005 && TREE_OPERAND (EXP, 0) != error_mark_node \
1006 && (TYPE_MODE (TREE_TYPE (EXP)) \
1007 == TYPE_MODE (GENERIC_TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1008 (EXP) = TREE_OPERAND (EXP, 0)
1010 /* Like STRIP_NOPS, but don't let the signedness change either. */
1012 #define STRIP_SIGN_NOPS(EXP) \
1013 while ((TREE_CODE (EXP) == NOP_EXPR \
1014 || TREE_CODE (EXP) == CONVERT_EXPR \
1015 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1016 && TREE_OPERAND (EXP, 0) != error_mark_node \
1017 && (TYPE_MODE (TREE_TYPE (EXP)) \
1018 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1019 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
1020 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
1021 (EXP) = TREE_OPERAND (EXP, 0)
1023 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1025 #define STRIP_TYPE_NOPS(EXP) \
1026 while ((TREE_CODE (EXP) == NOP_EXPR \
1027 || TREE_CODE (EXP) == CONVERT_EXPR \
1028 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1029 && TREE_OPERAND (EXP, 0) != error_mark_node \
1030 && (TREE_TYPE (EXP) \
1031 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1032 (EXP) = TREE_OPERAND (EXP, 0)
1034 /* Remove unnecessary type conversions according to
1035 tree_ssa_useless_type_conversion. */
1037 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1038 while (tree_ssa_useless_type_conversion (EXP)) \
1039 EXP = TREE_OPERAND (EXP, 0)
1041 /* Nonzero if TYPE represents an integral type. Note that we do not
1042 include COMPLEX types here. Keep these checks in ascending code
1045 #define INTEGRAL_TYPE_P(TYPE) \
1046 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1047 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1048 || TREE_CODE (TYPE) == INTEGER_TYPE)
1050 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1052 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1053 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1055 /* Nonzero if TYPE represents a saturating fixed-point type. */
1057 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1058 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1060 /* Nonzero if TYPE represents a fixed-point type. */
1062 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1064 /* Nonzero if TYPE represents a scalar floating-point type. */
1066 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1068 /* Nonzero if TYPE represents a complex floating-point type. */
1070 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1071 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1072 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1074 /* Nonzero if TYPE represents a vector floating-point type. */
1076 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1077 (TREE_CODE (TYPE) == VECTOR_TYPE \
1078 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1080 /* Nonzero if TYPE represents a floating-point type, including complex
1081 and vector floating-point types. The vector and complex check does
1082 not use the previous two macros to enable early folding. */
1084 #define FLOAT_TYPE_P(TYPE) \
1085 (SCALAR_FLOAT_TYPE_P (TYPE) \
1086 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1087 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1088 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1090 /* Nonzero if TYPE represents a decimal floating-point type. */
1091 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1092 (SCALAR_FLOAT_TYPE_P (TYPE) \
1093 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1095 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1096 Keep these checks in ascending code order. */
1098 #define AGGREGATE_TYPE_P(TYPE) \
1099 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
1100 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1102 /* Nonzero if TYPE represents a pointer or reference type.
1103 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1104 ascending code order. */
1106 #define POINTER_TYPE_P(TYPE) \
1107 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1109 /* Nonzero if this type is a complete type. */
1110 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1112 /* Nonzero if this type is the (possibly qualified) void type. */
1113 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1115 /* Nonzero if this type is complete or is cv void. */
1116 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1117 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1119 /* Nonzero if this type is complete or is an array with unspecified bound. */
1120 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1121 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1124 /* Define many boolean fields that all tree nodes have. */
1126 /* In VAR_DECL nodes, nonzero means address of this is needed.
1127 So it cannot be in a register.
1128 In a FUNCTION_DECL, nonzero means its address is needed.
1129 So it must be compiled even if it is an inline function.
1130 In a FIELD_DECL node, it means that the programmer is permitted to
1131 construct the address of this field. This is used for aliasing
1132 purposes: see record_component_aliases.
1133 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1134 In LABEL_DECL nodes, it means a goto for this label has been seen
1135 from a place outside all binding contours that restore stack levels.
1136 In ..._TYPE nodes, it means that objects of this type must
1137 be fully addressable. This means that pieces of this
1138 object cannot go into register parameters, for example.
1139 In IDENTIFIER_NODEs, this means that some extern decl for this name
1140 had its address taken. That matters for inline functions. */
1141 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1143 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1144 exit of a function. Calls for which this is true are candidates for tail
1145 call optimizations. */
1146 #define CALL_EXPR_TAILCALL(NODE) \
1147 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1149 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1150 CASE_LOW operand has been processed. */
1151 #define CASE_LOW_SEEN(NODE) \
1152 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1154 /* In a VAR_DECL, nonzero means allocate static storage.
1155 In a FUNCTION_DECL, nonzero if function has been defined.
1156 In a CONSTRUCTOR, nonzero means allocate static storage.
1158 ??? This is also used in lots of other nodes in unclear ways which
1159 should be cleaned up some day. */
1160 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1162 /* In a TARGET_EXPR, WITH_CLEANUP_EXPR, means that the pertinent cleanup
1163 should only be executed if an exception is thrown, not on normal exit
1165 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1167 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1168 CASE_HIGH operand has been processed. */
1169 #define CASE_HIGH_SEEN(NODE) \
1170 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1172 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1173 #define CALL_CANNOT_INLINE_P(NODE) ((NODE)->base.static_flag)
1175 /* In an expr node (usually a conversion) this means the node was made
1176 implicitly and should not lead to any sort of warning. In a decl node,
1177 warnings concerning the decl should be suppressed. This is used at
1178 least for used-before-set warnings, and it set after one warning is
1180 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1182 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1183 this string as an argument. */
1184 #define TREE_SYMBOL_REFERENCED(NODE) \
1185 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1187 /* Nonzero in a pointer or reference type means the data pointed to
1188 by this type can alias anything. */
1189 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1190 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1192 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1193 #define MOVE_NONTEMPORAL(NODE) \
1194 (GIMPLE_MODIFY_STMT_CHECK (NODE)->base.static_flag)
1196 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1197 there was an overflow in folding. */
1199 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1201 /* ??? This is an obsolete synonym for TREE_OVERFLOW. */
1202 #define TREE_CONSTANT_OVERFLOW(NODE) TREE_OVERFLOW(NODE)
1204 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1206 #define TREE_OVERFLOW_P(EXPR) \
1207 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1209 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1210 nonzero means name is to be accessible from outside this module.
1211 In an IDENTIFIER_NODE, nonzero means an external declaration
1212 accessible from outside this module was previously seen
1213 for this name in an inner scope. */
1214 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1216 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1217 of cached values, or is something else. */
1218 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1220 /* In a SAVE_EXPR, indicates that the original expression has already
1221 been substituted with a VAR_DECL that contains the value. */
1222 #define SAVE_EXPR_RESOLVED_P(NODE) \
1223 (TREE_CHECK (NODE, SAVE_EXPR)->base.public_flag)
1225 /* In any expression, decl, or constant, nonzero means it has side effects or
1226 reevaluation of the whole expression could produce a different value.
1227 This is set if any subexpression is a function call, a side effect or a
1228 reference to a volatile variable. In a ..._DECL, this is set only if the
1229 declaration said `volatile'. This will never be set for a constant. */
1230 #define TREE_SIDE_EFFECTS(NODE) \
1231 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1233 /* In a LABEL_DECL, nonzero means this label had its address taken
1234 and therefore can never be deleted and is a jump target for
1236 #define FORCED_LABEL(NODE) ((NODE)->base.side_effects_flag)
1238 /* Nonzero means this expression is volatile in the C sense:
1239 its address should be of type `volatile WHATEVER *'.
1240 In other words, the declared item is volatile qualified.
1241 This is used in _DECL nodes and _REF nodes.
1242 On a FUNCTION_DECL node, this means the function does not
1243 return normally. This is the same effect as setting
1244 the attribute noreturn on the function in C.
1246 In a ..._TYPE node, means this type is volatile-qualified.
1247 But use TYPE_VOLATILE instead of this macro when the node is a type,
1248 because eventually we may make that a different bit.
1250 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1251 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1253 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1254 accessing the memory pointed to won't generate a trap. However,
1255 this only applies to an object when used appropriately: it doesn't
1256 mean that writing a READONLY mem won't trap. Similarly for
1257 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1259 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1260 (or slice of the array) always belongs to the range of the array.
1261 I.e. that the access will not trap, provided that the access to
1262 the base to the array will not trap. */
1263 #define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
1265 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1266 nonzero means it may not be the lhs of an assignment. */
1267 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1269 /* Nonzero if NODE is a _DECL with TREE_READONLY set. */
1270 #define TREE_READONLY_DECL_P(NODE)\
1271 (DECL_P (NODE) && TREE_READONLY (NODE))
1273 /* Value of expression is constant. Always on in all ..._CST nodes. May
1274 also appear in an expression or decl where the value is constant. */
1275 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1277 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1278 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1279 (TYPE_CHECK (NODE)->base.constant_flag)
1281 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1282 #define DECL_UNSIGNED(NODE) \
1283 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1285 /* In a BIT_FIELD_REF, means the bitfield is to be interpreted as unsigned. */
1286 #define BIT_FIELD_REF_UNSIGNED(NODE) \
1287 (BIT_FIELD_REF_CHECK (NODE)->base.unsigned_flag)
1289 /* In integral and pointer types, means an unsigned type. */
1290 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1292 /* Nonzero in a VAR_DECL means assembler code has been written.
1293 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1294 This is interesting in an inline function, since it might not need
1295 to be compiled separately.
1296 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1297 if the sdb debugging info for the type has been written.
1298 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1299 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1301 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1303 /* Nonzero in a _DECL if the name is used in its scope.
1304 Nonzero in an expr node means inhibit warning if value is unused.
1305 In IDENTIFIER_NODEs, this means that some extern decl for this name
1307 In a BLOCK, this means that the block contains variables that are used. */
1308 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1310 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1311 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1312 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1314 /* In a CALL_EXPR, means that it's safe to use the target of the call
1315 expansion as the return slot for a call that returns in memory. */
1316 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) ((NODE)->base.private_flag)
1318 /* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1319 reference (and the TREE_TYPE is a pointer to the true type). */
1320 #define DECL_BY_REFERENCE(NODE) \
1321 (DECL_COMMON_CHECK (NODE)->base.private_flag)
1323 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1324 thunked-to function. */
1325 #define CALL_FROM_THUNK_P(NODE) \
1326 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1328 /* In a type, nonzero means that all objects of the type are guaranteed by the
1329 language or front-end to be properly aligned, so we can indicate that a MEM
1330 of this type is aligned at least to the alignment of the type, even if it
1331 doesn't appear that it is. We see this, for example, in object-oriented
1332 languages where a tag field may show this is an object of a more-aligned
1333 variant of the more generic type.
1335 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1337 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1339 /* Used in classes in C++. */
1340 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1341 /* Used in classes in C++.
1342 In a BLOCK node, this is BLOCK_HANDLER_BLOCK. */
1343 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1345 /* Nonzero in a _DECL if the use of the name is defined as a
1346 deprecated feature by __attribute__((deprecated)). */
1347 #define TREE_DEPRECATED(NODE) \
1348 ((NODE)->base.deprecated_flag)
1350 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1351 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1352 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1353 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1355 /* Value of expression is function invariant. A strict subset of
1356 TREE_CONSTANT, such an expression is constant over any one function
1357 invocation, though not across different invocations. May appear in
1358 any expression node. */
1359 #define TREE_INVARIANT(NODE) ((NODE)->base.invariant_flag)
1361 /* In fixed-point types, means a saturating type. */
1362 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1364 /* These flags are available for each language front end to use internally. */
1365 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1366 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1367 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1368 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1369 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1370 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1371 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1373 /* Define additional fields and accessors for nodes representing constants. */
1375 /* In an INTEGER_CST node. These two together make a 2-word integer.
1376 If the data type is signed, the value is sign-extended to 2 words
1377 even though not all of them may really be in use.
1378 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1379 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1380 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1381 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1383 #define INT_CST_LT(A, B) \
1384 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1385 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1386 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1388 #define INT_CST_LT_UNSIGNED(A, B) \
1389 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1390 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1391 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1392 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1393 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1395 struct tree_int_cst GTY(())
1397 struct tree_common common;
1401 /* In a REAL_CST node. struct real_value is an opaque entity, with
1402 manipulators defined in real.h. We don't want tree.h depending on
1403 real.h and transitively on tm.h. */
1406 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1407 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1409 struct tree_real_cst GTY(())
1411 struct tree_common common;
1412 struct real_value * real_cst_ptr;
1415 /* In a FIXED_CST node. */
1418 #define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1419 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1421 struct tree_fixed_cst GTY(())
1423 struct tree_common common;
1424 struct fixed_value * fixed_cst_ptr;
1427 /* In a STRING_CST */
1428 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1429 #define TREE_STRING_POINTER(NODE) \
1430 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1432 struct tree_string GTY(())
1434 struct tree_common common;
1439 /* In a COMPLEX_CST node. */
1440 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1441 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1443 struct tree_complex GTY(())
1445 struct tree_common common;
1450 /* In a VECTOR_CST node. */
1451 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1453 struct tree_vector GTY(())
1455 struct tree_common common;
1461 /* Define fields and accessors for some special-purpose tree nodes. */
1463 #define IDENTIFIER_LENGTH(NODE) \
1464 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1465 #define IDENTIFIER_POINTER(NODE) \
1466 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1467 #define IDENTIFIER_HASH_VALUE(NODE) \
1468 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1470 /* Translate a hash table identifier pointer to a tree_identifier
1471 pointer, and vice versa. */
1473 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1474 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1475 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1477 struct tree_identifier GTY(())
1479 struct tree_common common;
1480 struct ht_identifier id;
1483 /* In a TREE_LIST node. */
1484 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1485 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1487 struct tree_list GTY(())
1489 struct tree_common common;
1494 /* In a TREE_VEC node. */
1495 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1496 #define TREE_VEC_END(NODE) \
1497 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1499 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1501 struct tree_vec GTY(())
1503 struct tree_common common;
1505 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1508 /* In a CONSTRUCTOR node. */
1509 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1511 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1512 value of each element (stored within VAL). IX must be a scratch variable
1513 of unsigned integer type. */
1514 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1515 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1517 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1521 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1522 the value of each element (stored within VAL) and its index (stored
1523 within INDEX). IX must be a scratch variable of unsigned integer type. */
1524 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1525 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1527 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1528 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1532 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1533 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1535 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1536 _ce___->index = INDEX; \
1537 _ce___->value = VALUE; \
1540 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1541 element. INDEX can optionally design the position of VALUE: in arrays,
1542 it is the index where VALUE has to be placed; in structures, it is the
1543 FIELD_DECL of the member. */
1544 typedef struct constructor_elt_d GTY(())
1550 DEF_VEC_O(constructor_elt);
1551 DEF_VEC_ALLOC_O(constructor_elt,gc);
1553 struct tree_constructor GTY(())
1555 struct tree_common common;
1556 VEC(constructor_elt,gc) *elts;
1559 /* Define fields and accessors for some nodes that represent expressions. */
1561 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1562 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1563 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1564 && integer_zerop (TREE_OPERAND (NODE, 0)))
1566 /* In ordinary expression nodes. */
1567 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1568 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1570 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1571 length. Its value includes the length operand itself; that is,
1572 the minimum valid length is 1.
1573 Note that we have to bypass the use of TREE_OPERAND to access
1574 that field to avoid infinite recursion in expanding the macros. */
1575 #define VL_EXP_OPERAND_LENGTH(NODE) \
1576 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1578 /* In gimple statements. */
1579 #define GIMPLE_STMT_OPERAND(NODE, I) GIMPLE_STMT_OPERAND_CHECK (NODE, I)
1580 #define GIMPLE_STMT_LOCUS(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.locus)
1581 #define GIMPLE_STMT_BLOCK(NODE) (GIMPLE_STMT_CHECK (NODE)->gstmt.block)
1583 /* In a LOOP_EXPR node. */
1584 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1586 /* The source location of this expression. Non-tree_exp nodes such as
1587 decls and constants can be shared among multiple locations, so
1589 #define EXPR_LOCATION(NODE) expr_location ((NODE))
1590 #define SET_EXPR_LOCATION(NODE, FROM) set_expr_location ((NODE), (FROM))
1591 #define EXPR_HAS_LOCATION(NODE) expr_has_location ((NODE))
1592 #define EXPR_LOCUS(NODE) expr_locus ((NODE))
1593 #define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
1594 #define EXPR_FILENAME(NODE) *(expr_filename ((NODE)))
1595 #define EXPR_LINENO(NODE) *(expr_lineno ((NODE)))
1597 /* True if a tree is an expression or statement that can have a
1599 #define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE) || GIMPLE_STMT_P (NODE))
1601 /* In a TARGET_EXPR node. */
1602 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1603 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1604 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1606 /* DECL_EXPR accessor. This gives access to the DECL associated with
1607 the given declaration statement. */
1608 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1610 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1612 /* SWITCH_EXPR accessors. These give access to the condition, body and
1613 original condition type (before any compiler conversions)
1614 of the switch statement, respectively. */
1615 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1616 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1617 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1619 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1620 of a case label, respectively. */
1621 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1622 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1623 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1625 /* The operands of a TARGET_MEM_REF. */
1626 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1627 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1628 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1629 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1630 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1631 #define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
1632 #define TMR_TAG(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 6))
1634 /* The operands of a BIND_EXPR. */
1635 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1636 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1637 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1639 /* GOTO_EXPR accessor. This gives access to the label associated with
1640 a goto statement. */
1641 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1643 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1644 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1645 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1647 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1648 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1649 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1650 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1651 /* Nonzero if we want to create an ASM_INPUT instead of an
1652 ASM_OPERAND with no operands. */
1653 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE))
1654 #define ASM_VOLATILE_P(NODE) (TREE_PUBLIC (NODE))
1656 /* COND_EXPR accessors. */
1657 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1658 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1659 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1661 /* Accessors for the chains of recurrences. */
1662 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1663 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1664 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1665 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1667 /* LABEL_EXPR accessor. This gives access to the label associated with
1668 the given label expression. */
1669 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1671 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1672 accessors for SSA operands. */
1674 /* CATCH_EXPR accessors. */
1675 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1676 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1678 /* EH_FILTER_EXPR accessors. */
1679 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1680 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1681 #define EH_FILTER_MUST_NOT_THROW(NODE) TREE_STATIC (EH_FILTER_EXPR_CHECK (NODE))
1683 /* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1684 #define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1685 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1686 #define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1687 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1689 /* OBJ_TYPE_REF accessors. */
1690 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1691 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1692 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1694 /* ASSERT_EXPR accessors. */
1695 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1696 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1698 /* CALL_EXPR accessors.
1700 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1701 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1702 #define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1703 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1704 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1706 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1707 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1708 the argument count is zero when checking is enabled. Instead, do
1709 the pointer arithmetic to advance past the 3 fixed operands in a
1710 CALL_EXPR. That produces a valid pointer to just past the end of the
1711 operand array, even if it's not valid to dereference it. */
1712 #define CALL_EXPR_ARGP(NODE) \
1713 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1715 /* OpenMP directive and clause accessors. */
1717 #define OMP_BODY(NODE) \
1718 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1719 #define OMP_CLAUSES(NODE) \
1720 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1722 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1723 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1724 #define OMP_PARALLEL_FN(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 2)
1725 #define OMP_PARALLEL_DATA_ARG(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 3)
1727 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1728 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1729 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1730 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1731 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1732 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1734 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1735 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1736 #define OMP_SECTIONS_CONTROL(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 2)
1738 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1740 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1741 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1743 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1745 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1747 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1748 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1750 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1751 #define OMP_CLAUSE_DECL(NODE) \
1752 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1753 OMP_CLAUSE_PRIVATE, \
1754 OMP_CLAUSE_COPYPRIVATE), 0)
1756 /* True on an OMP_SECTION statement that was the last lexical member.
1757 This status is meaningful in the implementation of lastprivate. */
1758 #define OMP_SECTION_LAST(NODE) \
1759 TREE_PRIVATE (OMP_SECTION_CHECK (NODE))
1761 /* True on an OMP_RETURN statement if the return does not require a
1762 thread synchronization via some sort of barrier. The exact barrier
1763 that would otherwise be emitted is dependent on the OMP statement
1764 with which this return is associated. */
1765 #define OMP_RETURN_NOWAIT(NODE) \
1766 TREE_PRIVATE (OMP_RETURN_CHECK (NODE))
1768 /* True on an OMP_PARALLEL statement if it represents an explicit
1769 combined parallel work-sharing constructs. */
1770 #define OMP_PARALLEL_COMBINED(NODE) \
1771 TREE_PRIVATE (OMP_PARALLEL_CHECK (NODE))
1773 /* True on a PRIVATE clause if its decl is kept around for debugging
1774 information only and its DECL_VALUE_EXPR is supposed to point
1775 to what it has been remapped to. */
1776 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1777 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1779 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1780 decl is present in the chain. */
1781 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1782 TREE_PUBLIC (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE))
1784 #define OMP_CLAUSE_IF_EXPR(NODE) \
1785 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1786 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1787 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1788 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1789 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1791 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1792 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1793 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1794 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1795 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1796 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1797 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1798 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1800 enum omp_clause_schedule_kind
1802 OMP_CLAUSE_SCHEDULE_STATIC,
1803 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1804 OMP_CLAUSE_SCHEDULE_GUIDED,
1805 OMP_CLAUSE_SCHEDULE_RUNTIME
1808 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1809 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1811 enum omp_clause_default_kind
1813 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1814 OMP_CLAUSE_DEFAULT_SHARED,
1815 OMP_CLAUSE_DEFAULT_NONE,
1816 OMP_CLAUSE_DEFAULT_PRIVATE
1819 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1820 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1822 struct tree_exp GTY(())
1824 struct tree_common common;
1827 tree GTY ((special ("tree_exp"),
1828 desc ("TREE_CODE ((tree) &%0)")))
1832 /* SSA_NAME accessors. */
1834 /* Returns the variable being referenced. Once released, this is the
1835 only field that can be relied upon. */
1836 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1838 /* Returns the statement which defines this reference. Note that
1839 we use the same field when chaining SSA_NAME nodes together on
1840 the SSA_NAME freelist. */
1841 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->common.chain
1843 /* Returns the SSA version number of this SSA name. Note that in
1844 tree SSA, version numbers are not per variable and may be recycled. */
1845 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1847 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1848 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1850 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1851 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1853 /* Nonzero if this SSA_NAME expression is currently on the free list of
1854 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1855 has no meaning for an SSA_NAME. */
1856 #define SSA_NAME_IN_FREE_LIST(NODE) \
1857 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1859 /* Nonzero if this SSA_NAME is the default definition for the
1860 underlying symbol. A default SSA name is created for symbol S if
1861 the very first reference to S in the function is a read operation.
1862 Default definitions are always created by an empty statement and
1863 belong to no basic block. */
1864 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1865 SSA_NAME_CHECK (NODE)->base.volatile_flag
1867 /* Attributes for SSA_NAMEs for pointer-type variables. */
1868 #define SSA_NAME_PTR_INFO(N) \
1869 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1871 /* Get the value of this SSA_NAME, if available. */
1872 #define SSA_NAME_VALUE(N) \
1873 SSA_NAME_CHECK (N)->ssa_name.value_handle
1875 #ifndef _TREE_FLOW_H
1876 struct ptr_info_def;
1881 /* Immediate use linking structure. This structure is used for maintaining
1882 a doubly linked list of uses of an SSA_NAME. */
1883 typedef struct ssa_use_operand_d GTY(())
1885 struct ssa_use_operand_d* GTY((skip(""))) prev;
1886 struct ssa_use_operand_d* GTY((skip(""))) next;
1887 tree GTY((skip(""))) stmt;
1888 tree *GTY((skip(""))) use;
1889 } ssa_use_operand_t;
1891 /* Return the immediate_use information for an SSA_NAME. */
1892 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1894 struct tree_ssa_name GTY(())
1896 struct tree_common common;
1898 /* _DECL wrapped by this SSA name. */
1901 /* SSA version number. */
1902 unsigned int version;
1904 /* Pointer attributes used for alias analysis. */
1905 struct ptr_info_def *ptr_info;
1907 /* Value for SSA name used by various passes.
1909 Right now only invariants are allowed to persist beyond a pass in
1910 this field; in the future we will allow VALUE_HANDLEs to persist
1914 /* Immediate uses list for this SSA_NAME. */
1915 struct ssa_use_operand_d imm_uses;
1918 /* In a PHI_NODE node. */
1920 /* These 2 macros should be considered off limits for use by developers. If
1921 you wish to access the use or def fields of a PHI_NODE in the SSA
1922 optimizers, use the accessor macros found in tree-ssa-operands.h.
1923 These two macros are to be used only by those accessor macros, and other
1924 select places where we *absolutely* must take the address of the tree. */
1926 #define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
1927 #define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
1929 /* PHI_NODEs for each basic block are chained together in a single linked
1930 list. The head of the list is linked from the block annotation, and
1931 the link to the next PHI is in PHI_CHAIN. */
1932 #define PHI_CHAIN(NODE) PHI_NODE_CHECK (NODE)->phi.chain
1934 #define PHI_NUM_ARGS(NODE) PHI_NODE_CHECK (NODE)->phi.num_args
1935 #define PHI_ARG_CAPACITY(NODE) PHI_NODE_CHECK (NODE)->phi.capacity
1936 #define PHI_ARG_ELT(NODE, I) PHI_NODE_ELT_CHECK (NODE, I)
1937 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
1938 #define PHI_BB(NODE) PHI_NODE_CHECK (NODE)->phi.bb
1939 #define PHI_ARG_IMM_USE_NODE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).imm_use
1941 struct phi_arg_d GTY(())
1943 /* imm_use MUST be the first element in struct because we do some
1944 pointer arithmetic with it. See phi_arg_index_from_use. */
1945 struct ssa_use_operand_d imm_use;
1949 struct tree_phi_node GTY(())
1951 struct tree_base common;
1957 /* Basic block holding this PHI node. */
1958 struct basic_block_def *bb;
1960 /* Arguments of the PHI node. These are maintained in the same
1961 order as predecessor edge vector BB->PREDS. */
1962 struct phi_arg_d GTY ((length ("((tree)&%h)->phi.num_args"))) a[1];
1966 #define OMP_CLAUSE_CODE(NODE) \
1967 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1969 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1970 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1972 #define OMP_CLAUSE_CODE(NODE) \
1973 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1975 #define OMP_CLAUSE_OPERAND(NODE, I) \
1976 OMP_CLAUSE_ELT_CHECK (NODE, I)
1978 struct tree_omp_clause GTY(())
1980 struct tree_common common;
1981 enum omp_clause_code code;
1982 union omp_clause_subcode {
1983 enum omp_clause_default_kind default_kind;
1984 enum omp_clause_schedule_kind schedule_kind;
1985 enum tree_code reduction_code;
1986 } GTY ((skip)) subcode;
1987 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
1991 struct varray_head_tag;
1993 /* In a BLOCK node. */
1994 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1995 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1996 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1997 /* Note: when changing this, make sure to find the places
1998 that use chainon or nreverse. */
1999 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
2000 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2001 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2003 /* Nonzero means that this block is prepared to handle exceptions
2004 listed in the BLOCK_VARS slot. */
2005 #define BLOCK_HANDLER_BLOCK(NODE) \
2006 (BLOCK_CHECK (NODE)->block.handler_block_flag)
2008 /* An index number for this block. These values are not guaranteed to
2009 be unique across functions -- whether or not they are depends on
2010 the debugging output format in use. */
2011 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2013 /* If block reordering splits a lexical block into discontiguous
2014 address ranges, we'll make a copy of the original block.
2016 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2017 In that case, we have one source block that has been replicated
2018 (through inlining or unrolling) into many logical blocks, and that
2019 these logical blocks have different physical variables in them.
2021 In this case, we have one logical block split into several
2022 non-contiguous address ranges. Most debug formats can't actually
2023 represent this idea directly, so we fake it by creating multiple
2024 logical blocks with the same variables in them. However, for those
2025 that do support non-contiguous regions, these allow the original
2026 logical block to be reconstructed, along with the set of address
2029 One of the logical block fragments is arbitrarily chosen to be
2030 the ORIGIN. The other fragments will point to the origin via
2031 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2032 be null. The list of fragments will be chained through
2033 BLOCK_FRAGMENT_CHAIN from the origin. */
2035 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2036 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2038 /* For an inlined function, this gives the location where it was called
2039 from. This is only set in the top level block, which corresponds to the
2040 inlined function scope. This is used in the debug output routines. */
2042 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2044 struct tree_block GTY(())
2046 struct tree_common common;
2048 unsigned handler_block_flag : 1;
2049 unsigned abstract_flag : 1;
2050 unsigned block_num : 30;
2055 tree abstract_origin;
2056 tree fragment_origin;
2057 tree fragment_chain;
2061 /* Define fields and accessors for nodes representing data types. */
2063 /* See tree.def for documentation of the use of these fields.
2064 Look at the documentation of the various ..._TYPE tree codes.
2066 Note that the type.values, type.minval, and type.maxval fields are
2067 overloaded and used for different macros in different kinds of types.
2068 Each macro must check to ensure the tree node is of the proper kind of
2069 type. Note also that some of the front-ends also overload these fields,
2070 so they must be checked as well. */
2072 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2073 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2074 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2075 #define TYPE_MODE(NODE) (TYPE_CHECK (NODE)->type.mode)
2076 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2077 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2078 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2079 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2080 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2081 (INTEGER_TYPE_CHECK (NODE)->type.values \
2082 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2083 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2084 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2085 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2086 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2087 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2088 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2089 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2090 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2091 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2092 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2093 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2094 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2095 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2096 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2097 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2098 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2099 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2100 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2101 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2103 /* The "canonical" type for this type node, which can be used to
2104 compare the type for equality with another type. If two types are
2105 equal (based on the semantics of the language), then they will have
2106 equivalent TYPE_CANONICAL entries.
2108 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2109 be used for comparison against other types. Instead, the type is
2110 said to require structural equality checks, described in
2111 TYPE_STRUCTURAL_EQUALITY_P. */
2112 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2113 /* Indicates that the type node requires structural equality
2114 checks. The compiler will need to look at the composition of the
2115 type to determine whether it is equal to another type, rather than
2116 just comparing canonical type pointers. For instance, we would need
2117 to look at the return and parameter types of a FUNCTION_TYPE
2119 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2120 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2121 type node requires structural equality. */
2122 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2123 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2124 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2125 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2127 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2128 in the debugging output. We use this to describe a vector as a
2129 structure containing an array. */
2130 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
2132 /* For record and union types, information about this type, as a base type
2134 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2136 /* For non record and union types, used in a language-dependent way. */
2137 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2139 /* The (language-specific) typed-based alias set for this type.
2140 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2141 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2142 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2143 type can alias objects of any type. */
2144 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2146 /* Nonzero iff the typed-based alias set for this type has been
2148 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2150 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2152 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2154 /* The alignment necessary for objects of this type.
2155 The value is an int, measured in bits. */
2156 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2158 /* 1 if the alignment for this type was requested by "aligned" attribute,
2159 0 if it is the default for this type. */
2160 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2162 /* The alignment for NODE, in bytes. */
2163 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2165 /* If your language allows you to declare types, and you want debug info
2166 for them, then you need to generate corresponding TYPE_DECL nodes.
2167 These "stub" TYPE_DECL nodes have no name, and simply point at the
2168 type node. You then set the TYPE_STUB_DECL field of the type node
2169 to point back at the TYPE_DECL node. This allows the debug routines
2170 to know that the two nodes represent the same type, so that we only
2171 get one debug info record for them. */
2172 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2174 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2175 has BLKmode only because it lacks the alignment requirement for
2177 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2179 /* In an INTEGER_TYPE, it means the type represents a size. We use
2180 this both for validity checking and to permit optimizations that
2181 are unsafe for other types. Note that the C `size_t' type should
2182 *not* have this flag set. The `size_t' type is simply a typedef
2183 for an ordinary integer type that happens to be the type of an
2184 expression returned by `sizeof'; `size_t' has no special
2185 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2186 always actual sizes. */
2187 #define TYPE_IS_SIZETYPE(NODE) \
2188 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2190 /* In a FUNCTION_TYPE, indicates that the function returns with the stack
2191 pointer depressed. */
2192 #define TYPE_RETURNS_STACK_DEPRESSED(NODE) \
2193 (FUNCTION_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2195 /* Nonzero in a type considered volatile as a whole. */
2196 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2198 /* Means this type is const-qualified. */
2199 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2201 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2203 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2205 /* There is a TYPE_QUAL value for each type qualifier. They can be
2206 combined by bitwise-or to form the complete set of qualifiers for a
2209 #define TYPE_UNQUALIFIED 0x0
2210 #define TYPE_QUAL_CONST 0x1
2211 #define TYPE_QUAL_VOLATILE 0x2
2212 #define TYPE_QUAL_RESTRICT 0x4
2214 /* The set of type qualifiers for this type. */
2215 #define TYPE_QUALS(NODE) \
2216 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2217 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2218 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2220 /* These flags are available for each language front end to use internally. */
2221 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2222 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2223 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2224 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2225 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2226 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2227 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2229 /* Used to keep track of visited nodes in tree traversals. This is set to
2230 0 by copy_node and make_node. */
2231 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2233 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2234 that distinguish string from array of char).
2235 If set in a INTEGER_TYPE, indicates a character type. */
2236 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2238 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2239 object of the given ARRAY_TYPE. This allows temporaries to be
2241 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2242 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2244 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2245 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2246 (((unsigned HOST_WIDE_INT) 1) \
2247 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2249 /* Set precision to n when we have 2^n sub-parts of the vector. */
2250 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2251 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2253 /* Indicates that objects of this type must be initialized by calling a
2254 function when they are created. */
2255 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2256 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2258 /* Indicates that objects of this type (a UNION_TYPE), should be passed
2259 the same way that the first union alternative would be passed. */
2260 #define TYPE_TRANSPARENT_UNION(NODE) \
2261 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2263 /* For an ARRAY_TYPE, indicates that it is not permitted to
2264 take the address of a component of the type. */
2265 #define TYPE_NONALIASED_COMPONENT(NODE) \
2266 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
2268 /* Indicated that objects of this type should be laid out in as
2269 compact a way as possible. */
2270 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
2272 /* Used by type_contains_placeholder_p to avoid recomputation.
2273 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2274 this field directly. */
2275 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2276 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2280 struct tree_type GTY(())
2282 struct tree_common common;
2289 unsigned int precision : 9;
2290 ENUM_BITFIELD(machine_mode) mode : 7;
2292 unsigned string_flag : 1;
2293 unsigned no_force_blk_flag : 1;
2294 unsigned needs_constructing_flag : 1;
2295 unsigned transparent_union_flag : 1;
2296 unsigned packed_flag : 1;
2297 unsigned restrict_flag : 1;
2298 unsigned contains_placeholder_bits : 2;
2300 unsigned lang_flag_0 : 1;
2301 unsigned lang_flag_1 : 1;
2302 unsigned lang_flag_2 : 1;
2303 unsigned lang_flag_3 : 1;
2304 unsigned lang_flag_4 : 1;
2305 unsigned lang_flag_5 : 1;
2306 unsigned lang_flag_6 : 1;
2307 unsigned user_align : 1;
2312 union tree_type_symtab {
2313 int GTY ((tag ("0"))) address;
2314 const char * GTY ((tag ("1"))) pointer;
2315 struct die_struct * GTY ((tag ("2"))) die;
2316 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2317 descbits ("2"))) symtab;
2326 alias_set_type alias_set;
2327 /* Points to a structure whose details depend on the language in use. */
2328 struct lang_type *lang_specific;
2331 /* Define accessor macros for information about type inheritance
2334 A "basetype" means a particular usage of a data type for inheritance
2335 in another type. Each such basetype usage has its own "binfo"
2336 object to describe it. The binfo object is a TREE_VEC node.
2338 Inheritance is represented by the binfo nodes allocated for a
2339 given type. For example, given types C and D, such that D is
2340 inherited by C, 3 binfo nodes will be allocated: one for describing
2341 the binfo properties of C, similarly one for D, and one for
2342 describing the binfo properties of D as a base type for C.
2343 Thus, given a pointer to class C, one can get a pointer to the binfo
2344 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2346 /* BINFO specific flags. */
2348 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2349 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2351 /* Flags for language dependent use. */
2352 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2353 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2354 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2355 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2356 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2357 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2358 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2360 /* The actual data type node being inherited in this basetype. */
2361 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2363 /* The offset where this basetype appears in its containing type.
2364 BINFO_OFFSET slot holds the offset (in bytes)
2365 from the base of the complete object to the base of the part of the
2366 object that is allocated on behalf of this `type'.
2367 This is always 0 except when there is multiple inheritance. */
2369 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2370 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2372 /* The virtual function table belonging to this basetype. Virtual
2373 function tables provide a mechanism for run-time method dispatching.
2374 The entries of a virtual function table are language-dependent. */
2376 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2378 /* The virtual functions in the virtual function table. This is
2379 a TREE_LIST that is used as an initial approximation for building
2380 a virtual function table for this basetype. */
2381 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2383 /* A vector of binfos for the direct basetypes inherited by this
2386 If this basetype describes type D as inherited in C, and if the
2387 basetypes of D are E and F, then this vector contains binfos for
2388 inheritance of E and F by C. */
2389 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2391 /* The number of basetypes for NODE. */
2392 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2394 /* Accessor macro to get to the Nth base binfo of this binfo. */
2395 #define BINFO_BASE_BINFO(NODE,N) \
2396 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2397 #define BINFO_BASE_ITERATE(NODE,N,B) \
2398 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2399 #define BINFO_BASE_APPEND(NODE,T) \
2400 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2402 /* For a BINFO record describing a virtual base class, i.e., one where
2403 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2404 base. The actual contents are language-dependent. In the C++
2405 front-end this field is an INTEGER_CST giving an offset into the
2406 vtable where the offset to the virtual base can be found. */
2407 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2409 /* Indicates the accesses this binfo has to its bases. The values are
2410 access_public_node, access_protected_node or access_private_node.
2411 If this array is not present, public access is implied. */
2412 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2414 #define BINFO_BASE_ACCESS(NODE,N) \
2415 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2416 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2417 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2419 /* The index in the VTT where this subobject's sub-VTT can be found.
2420 NULL_TREE if there is no sub-VTT. */
2421 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2423 /* The index in the VTT where the vptr for this subobject can be
2424 found. NULL_TREE if there is no secondary vptr in the VTT. */
2425 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2427 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2428 inheriting this base for non-virtual bases. For virtual bases it
2429 points either to the binfo for which this is a primary binfo, or to
2430 the binfo of the most derived type. */
2431 #define BINFO_INHERITANCE_CHAIN(NODE) \
2432 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2434 struct tree_binfo GTY (())
2436 struct tree_common common;
2442 VEC(tree,gc) *base_accesses;
2448 VEC(tree,none) base_binfos;
2452 /* Define fields and accessors for nodes representing declared names. */
2454 /* Nonzero if DECL represents a variable for the SSA passes. */
2455 #define SSA_VAR_P(DECL) \
2456 (TREE_CODE (DECL) == VAR_DECL \
2457 || TREE_CODE (DECL) == PARM_DECL \
2458 || TREE_CODE (DECL) == RESULT_DECL \
2460 || (TREE_CODE (DECL) == SSA_NAME \
2461 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2462 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2463 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL \
2464 || MTAG_P (SSA_NAME_VAR (DECL)))))
2469 /* Enumerate visibility settings. */
2470 #ifndef SYMBOL_VISIBILITY_DEFINED
2471 #define SYMBOL_VISIBILITY_DEFINED
2472 enum symbol_visibility
2475 VISIBILITY_PROTECTED,
2484 /* This is the name of the object as written by the user.
2485 It is an IDENTIFIER_NODE. */
2486 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2488 /* Every ..._DECL node gets a unique number. */
2489 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2491 /* These two fields describe where in the source code the declaration
2492 was. If the declaration appears in several places (as for a C
2493 function that is declared first and then defined later), this
2494 information should refer to the definition. */
2495 #define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2496 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2497 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2498 #ifdef USE_MAPPED_LOCATION
2499 #define DECL_IS_BUILTIN(DECL) \
2500 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2502 #define DECL_IS_BUILTIN(DECL) (DECL_SOURCE_LINE(DECL) == 0)
2505 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2506 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2507 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2508 points to either the FUNCTION_DECL for the containing function,
2509 the RECORD_TYPE or UNION_TYPE for the containing type, or
2510 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2512 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2513 #define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2514 struct tree_decl_minimal GTY(())
2516 struct tree_common common;
2523 /* When computing aliasing information, we represent the memory pointed-to
2524 by pointers with artificial variables called "memory tags" (MT). There
2525 are two kinds of tags, namely symbol and name:
2527 Symbol tags (SMT) are used in flow-insensitive alias analysis, they
2528 represent all the pointed-to locations and variables pointed-to by
2529 the same pointer symbol. Usually, this set is computed using
2530 type-based analysis (i.e., alias set classes), but this may not
2533 Name tags (NMT) are used in flow-sensitive points-to alias
2534 analysis, they represent the variables and memory locations
2535 pointed-to by a specific SSA_NAME pointer.
2537 In general, given a pointer P with a symbol tag SMT, the alias set
2538 of SMT should be the union of all the alias sets of the NMTs of
2539 every SSA_NAME for P. */
2540 struct tree_memory_tag GTY(())
2542 struct tree_decl_minimal common;
2544 bitmap GTY ((skip)) aliases;
2546 unsigned int is_global:1;
2549 #define MTAG_GLOBAL(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.is_global)
2550 #define MTAG_ALIASES(NODE) (TREE_MEMORY_TAG_CHECK (NODE)->mtag.aliases)
2552 struct tree_struct_field_tag GTY(())
2554 struct tree_memory_tag common;
2556 /* Parent variable. */
2559 /* Offset inside structure. */
2560 unsigned HOST_WIDE_INT offset;
2562 /* Size of the field. */
2563 unsigned HOST_WIDE_INT size;
2565 /* Alias set for a DECL_NONADDRESSABLE_P field. Otherwise -1. */
2566 alias_set_type alias_set;
2568 #define SFT_PARENT_VAR(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.parent_var)
2569 #define SFT_OFFSET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.offset)
2570 #define SFT_SIZE(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.size)
2571 #define SFT_NONADDRESSABLE_P(NODE) \
2572 (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set != -1)
2573 #define SFT_ALIAS_SET(NODE) (STRUCT_FIELD_TAG_CHECK (NODE)->sft.alias_set)
2575 /* Memory Partition Tags (MPTs) group memory symbols under one
2576 common name for the purposes of placing memory PHI nodes. */
2578 struct tree_memory_partition_tag GTY(())
2580 struct tree_memory_tag common;
2582 /* Set of symbols grouped under this MPT. */
2586 #define MPT_SYMBOLS(NODE) (MEMORY_PARTITION_TAG_CHECK (NODE)->mpt.symbols)
2589 /* For any sort of a ..._DECL node, this points to the original (abstract)
2590 decl node which this decl is an instance of, or else it is NULL indicating
2591 that this decl is not an instance of some other decl. For example,
2592 in a nested declaration of an inline function, this points back to the
2594 #define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2596 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2597 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2598 #define DECL_ORIGIN(NODE) \
2599 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2601 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2602 inline instance of some original (abstract) decl from an inline function;
2603 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2604 nodes can also have their abstract origin set to themselves. */
2605 #define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2606 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2608 /* In a DECL this is the field where attributes are stored. */
2609 #define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2611 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2612 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2613 For a VAR_DECL, holds the initial value.
2614 For a PARM_DECL, not used--default
2615 values for parameters are encoded in the type of the function,
2616 not in the PARM_DECL slot.
2617 For a FIELD_DECL, this is used for enumeration values and the C
2618 frontend uses it for temporarily storing bitwidth of bitfields.
2620 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2621 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2623 /* Holds the size of the datum, in bits, as a tree expression.
2624 Need not be constant. */
2625 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2626 /* Likewise for the size in bytes. */
2627 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2628 /* Holds the alignment required for the datum, in bits. */
2629 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2630 /* The alignment of NODE, in bytes. */
2631 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2632 /* Set if the alignment of this DECL has been set by the user, for
2633 example with an 'aligned' attribute. */
2634 #define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
2635 /* Holds the machine mode corresponding to the declaration of a variable or
2636 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2638 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2640 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2641 operation it is. Note, however, that this field is overloaded, with
2642 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2643 checked before any access to the former. */
2644 #define DECL_FUNCTION_CODE(NODE) \
2645 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2646 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2647 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2649 /* Nonzero for a given ..._DECL node means that the name of this node should
2650 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2651 the body of the function should also be ignored. */
2652 #define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2654 /* Nonzero for a given ..._DECL node means that this node represents an
2655 "abstract instance" of the given declaration (e.g. in the original
2656 declaration of an inline function). When generating symbolic debugging
2657 information, we mustn't try to generate any address information for nodes
2658 marked as "abstract instances" because we don't actually generate
2659 any code or allocate any data space for such instances. */
2660 #define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2662 /* Language-specific decl information. */
2663 #define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2665 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2666 do not allocate storage, and refer to a definition elsewhere. Note that
2667 this does not necessarily imply the entity represented by NODE
2668 has no program source-level definition in this translation unit. For
2669 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2670 DECL_EXTERNAL may be true simultaneously; that can be the case for
2671 a C99 "extern inline" function. */
2672 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
2674 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2675 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2677 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2679 Also set in some languages for variables, etc., outside the normal
2680 lexical scope, such as class instance variables. */
2681 #define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2683 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2684 Used in FIELD_DECLs for vtable pointers.
2685 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2686 #define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2688 /* Used to indicate that this DECL represents a compiler-generated entity. */
2689 #define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2691 /* Additional flags for language-specific uses. */
2692 #define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2693 #define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2694 #define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2695 #define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2696 #define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2697 #define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2698 #define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2699 #define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2701 /* Used to indicate an alias set for the memory pointed to by this
2702 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2703 pointer (or reference) type. */
2704 #define DECL_POINTER_ALIAS_SET(NODE) \
2705 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
2707 /* Nonzero if an alias set has been assigned to this declaration. */
2708 #define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2709 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
2711 /* Nonzero for a decl which is at file scope. */
2712 #define DECL_FILE_SCOPE_P(EXP) \
2713 (! DECL_CONTEXT (EXP) \
2714 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2716 /* Nonzero for a decl that is decorated using attribute used.
2717 This indicates compiler tools that this decl needs to be preserved. */
2718 #define DECL_PRESERVE_P(DECL) \
2719 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2721 /* For function local variables of COMPLEX and VECTOR types,
2722 indicates that the variable is not aliased, and that all
2723 modifications to the variable have been adjusted so that
2724 they are killing assignments. Thus the variable may now
2725 be treated as a GIMPLE register, and use real instead of
2726 virtual ops in SSA form. */
2727 #define DECL_GIMPLE_REG_P(DECL) \
2728 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2730 /* For a DECL with pointer type, this is set if Type Based Alias
2731 Analysis should not be applied to this DECL. */
2732 #define DECL_NO_TBAA_P(DECL) \
2733 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2735 struct tree_decl_common GTY(())
2737 struct tree_decl_minimal common;
2740 ENUM_BITFIELD(machine_mode) mode : 8;
2742 unsigned nonlocal_flag : 1;
2743 unsigned virtual_flag : 1;
2744 unsigned ignored_flag : 1;
2745 unsigned abstract_flag : 1;
2746 unsigned artificial_flag : 1;
2747 unsigned user_align : 1;
2748 unsigned preserve_flag: 1;
2749 unsigned debug_expr_is_from : 1;
2751 unsigned lang_flag_0 : 1;
2752 unsigned lang_flag_1 : 1;
2753 unsigned lang_flag_2 : 1;
2754 unsigned lang_flag_3 : 1;
2755 unsigned lang_flag_4 : 1;
2756 unsigned lang_flag_5 : 1;
2757 unsigned lang_flag_6 : 1;
2758 unsigned lang_flag_7 : 1;
2760 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2761 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2762 unsigned decl_flag_0 : 1;
2763 /* In FIELD_DECL, this is DECL_PACKED. */
2764 unsigned decl_flag_1 : 1;
2765 /* In FIELD_DECL, this is DECL_BIT_FIELD
2766 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2767 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2768 unsigned decl_flag_2 : 1;
2769 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2770 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
2771 unsigned decl_flag_3 : 1;
2772 /* Logically, these two would go in a theoretical base shared by var and
2774 unsigned gimple_reg_flag : 1;
2775 /* In a DECL with pointer type, set if no TBAA should be done. */
2776 unsigned no_tbaa_flag : 1;
2777 /* Padding so that 'align' can be on a 32-bit boundary. */
2778 unsigned decl_common_unused : 2;
2780 unsigned int align : 24;
2781 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2782 unsigned int off_align : 8;
2787 tree abstract_origin;
2789 alias_set_type pointer_alias_set;
2790 /* Points to a structure whose details depend on the language in use. */
2791 struct lang_decl *lang_specific;
2794 extern tree decl_value_expr_lookup (tree);
2795 extern void decl_value_expr_insert (tree, tree);
2797 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2798 if transformations have made this more complicated than evaluating the
2799 decl itself. This should only be used for debugging; once this field has
2800 been set, the decl itself may not legitimately appear in the function. */
2801 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2802 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
2803 #define DECL_VALUE_EXPR(NODE) \
2804 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2805 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2806 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2808 /* Holds the RTL expression for the value of a variable or function.
2809 This value can be evaluated lazily for functions, variables with
2810 static storage duration, and labels. */
2811 #define DECL_RTL(NODE) \
2812 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2813 ? (NODE)->decl_with_rtl.rtl \
2814 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2816 /* Set the DECL_RTL for NODE to RTL. */
2817 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2819 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2820 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2822 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2823 #define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2825 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2826 NODE1, it will not be set for NODE2; this is a lazy copy. */
2827 #define COPY_DECL_RTL(NODE1, NODE2) \
2828 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2830 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2831 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2833 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2834 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2836 struct tree_decl_with_rtl GTY(())
2838 struct tree_decl_common common;
2842 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2843 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2844 of the structure. */
2845 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2847 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2848 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2849 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2850 natural alignment of the field's type). */
2851 #define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2853 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2854 if so, the type that was originally specified for it.
2855 TREE_TYPE may have been modified (in finish_struct). */
2856 #define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2858 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2859 if nonzero, indicates that the field occupies the type. */
2860 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2862 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2863 DECL_FIELD_OFFSET which are known to be always zero.
2864 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2866 #define DECL_OFFSET_ALIGN(NODE) \
2867 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2869 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2870 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2871 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
2872 /* 1 if the alignment for this type was requested by "aligned" attribute,
2873 0 if it is the default for this type. */
2875 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2876 which this FIELD_DECL is defined. This information is needed when
2877 writing debugging information about vfield and vbase decls for C++. */
2878 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2880 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2881 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2883 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2885 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2887 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2889 #define DECL_NONADDRESSABLE_P(NODE) \
2890 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
2892 struct tree_field_decl GTY(())
2894 struct tree_decl_common common;
2897 tree bit_field_type;
2904 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2905 dense, unique within any one function, and may be used to index arrays.
2906 If the value is -1, then no UID has been assigned. */
2907 #define LABEL_DECL_UID(NODE) \
2908 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
2910 /* In LABEL_DECL nodes, nonzero means that an error message about
2911 jumping into such a binding contour has been printed for this label. */
2912 #define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2914 struct tree_label_decl GTY(())
2916 struct tree_decl_with_rtl common;
2919 struct tree_result_decl GTY(())
2921 struct tree_decl_with_rtl common;
2924 struct tree_const_decl GTY(())
2926 struct tree_decl_with_rtl common;
2929 /* For a PARM_DECL, records the data type used to pass the argument,
2930 which may be different from the type seen in the program. */
2931 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2933 /* For PARM_DECL, holds an RTL for the stack slot or register
2934 where the data was actually passed. */
2935 #define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2937 struct tree_parm_decl GTY(())
2939 struct tree_decl_with_rtl common;
2944 /* Nonzero in a decl means that the gimplifier has seen (or placed)
2945 this variable in a BIND_EXPR. */
2946 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2947 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
2949 /* Used to indicate that the linkage status of this DECL is not yet known,
2950 so it should not be output now. */
2951 #define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2953 /* Nonzero for a given ..._DECL node means that no warnings should be
2954 generated just because this node is unused. */
2955 #define DECL_IN_SYSTEM_HEADER(NODE) \
2956 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.in_system_header_flag)
2958 /* Used to indicate that this DECL has weak linkage. */
2959 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2961 /* Internal to the gimplifier. Indicates that the value is a formal
2962 temporary controlled by the gimplifier. */
2963 #define DECL_GIMPLE_FORMAL_TEMP_P(DECL) \
2964 DECL_WITH_VIS_CHECK (DECL)->decl_with_vis.gimple_formal_temp
2966 /* Used to indicate that the DECL is a dllimport. */
2967 #define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2969 /* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2970 based on a variable with a restrict qualified type. If it is,
2971 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2974 #define DECL_BASED_ON_RESTRICT_P(NODE) \
2975 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2976 #define DECL_GET_RESTRICT_BASE(NODE) \
2977 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2978 #define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2979 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2981 extern tree decl_restrict_base_lookup (tree);
2982 extern void decl_restrict_base_insert (tree, tree);
2984 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2985 not be put out unless it is needed in this translation unit.
2986 Entities like this are shared across translation units (like weak
2987 entities), but are guaranteed to be generated by any translation
2988 unit that needs them, and therefore need not be put out anywhere
2989 where they are not needed. DECL_COMDAT is just a hint to the
2990 back-end; it is up to front-ends which set this flag to ensure
2991 that there will never be any harm, other than bloat, in putting out
2992 something which is DECL_COMDAT. */
2993 #define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
2995 /* A replaceable function is one which may be replaced at link-time
2996 with an entirely different definition, provided that the
2997 replacement has the same type. For example, functions declared
2998 with __attribute__((weak)) on most systems are replaceable.
3000 COMDAT functions are not replaceable, since all definitions of the
3001 function must be equivalent. It is important that COMDAT functions
3002 not be treated as replaceable so that use of C++ template
3003 instantiations is not penalized.
3005 For example, DECL_REPLACEABLE is used to determine whether or not a
3006 function (including a template instantiation) which is not
3007 explicitly declared "inline" can be inlined. If the function is
3008 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3009 implementation chosen at link-time may be different. However, a
3010 function that is not DECL_REPLACEABLE can be inlined, since all
3011 versions of the function will be functionally identical. */
3012 #define DECL_REPLACEABLE_P(NODE) \
3013 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
3015 /* The name of the object as the assembler will see it (but before any
3016 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3017 as DECL_NAME. It is an IDENTIFIER_NODE. */
3018 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3020 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3021 This is true of all DECL nodes except FIELD_DECL. */
3022 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3023 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3025 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3026 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3028 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3029 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3031 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3032 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3033 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3035 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3036 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3037 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3038 semantics of using this macro, are different than saying:
3040 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3042 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3044 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3045 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3046 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3047 DECL_ASSEMBLER_NAME (DECL1)) \
3050 /* Records the section name in a section attribute. Used to pass
3051 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3052 #define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3054 /* Value of the decls's visibility attribute */
3055 #define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3057 /* Nonzero means that the decl had its visibility specified rather than
3059 #define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3061 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3062 multiple translation units should be merged. */
3063 #define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
3065 struct tree_decl_with_vis GTY(())
3067 struct tree_decl_with_rtl common;
3068 tree assembler_name;
3071 /* Belong to VAR_DECL exclusively. */
3072 unsigned defer_output:1;
3073 unsigned hard_register:1;
3074 unsigned thread_local:1;
3075 unsigned common_flag:1;
3076 unsigned in_text_section : 1;
3077 unsigned gimple_formal_temp : 1;
3078 unsigned dllimport_flag : 1;
3079 unsigned based_on_restrict_p : 1;
3080 /* Used by C++. Might become a generic decl flag. */
3081 unsigned shadowed_for_var_p : 1;
3083 /* Don't belong to VAR_DECL exclusively. */
3084 unsigned in_system_header_flag : 1;
3085 unsigned weak_flag:1;
3086 unsigned seen_in_bind_expr : 1;
3087 unsigned comdat_flag : 1;
3088 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3089 unsigned visibility_specified : 1;
3090 /* Belong to FUNCTION_DECL exclusively. */
3091 unsigned one_only : 1;
3092 unsigned init_priority_p:1;
3094 /* Belongs to VAR_DECL exclusively. */
3095 ENUM_BITFIELD(tls_model) tls_model : 3;
3096 /* 11 unused bits. */
3099 /* In a VAR_DECL that's static,
3100 nonzero if the space is in the text section. */
3101 #define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3103 /* Nonzero for a given ..._DECL node means that this node should be
3104 put in .common, if possible. If a DECL_INITIAL is given, and it
3105 is not error_mark_node, then the decl cannot be put in .common. */
3106 #define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3108 /* In a VAR_DECL, nonzero if the decl is a register variable with
3109 an explicit asm specification. */
3110 #define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3112 extern tree decl_debug_expr_lookup (tree);
3113 extern void decl_debug_expr_insert (tree, tree);
3114 /* For VAR_DECL, this is set to either an expression that it was split
3115 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3116 subexpressions that it was split into. */
3117 #define DECL_DEBUG_EXPR(NODE) \
3118 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3120 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3121 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3123 /* An initializationp priority. */
3124 typedef unsigned short priority_type;
3126 extern priority_type decl_init_priority_lookup (tree);
3127 extern priority_type decl_fini_priority_lookup (tree);
3128 extern void decl_init_priority_insert (tree, priority_type);
3129 extern void decl_fini_priority_insert (tree, priority_type);
3131 /* In a non-local VAR_DECL with static storage duration, true if the
3132 variable has an initialization priority. If false, the variable
3133 will be initialized at the DEFAULT_INIT_PRIORITY. */
3134 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3135 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3137 /* For a VAR_DECL or FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set,
3138 the initialization priority of NODE. */
3139 #define DECL_INIT_PRIORITY(NODE) \
3140 (decl_init_priority_lookup (NODE))
3141 /* Set the initialization priority for NODE to VAL. */
3142 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3143 (decl_init_priority_insert (NODE, VAL))
3145 /* For a FUNCTION_DECL with DECL_HAS_INIT_PRIORITY_P set, the
3146 finalization priority of NODE. */
3147 #define DECL_FINI_PRIORITY(NODE) \
3148 (decl_fini_priority_lookup (NODE))
3149 /* Set the finalization priority for NODE to VAL. */
3150 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3151 (decl_fini_priority_insert (NODE, VAL))
3153 /* The initialization priority for entities for which no explicit
3154 initialization priority has been specified. */
3155 #define DEFAULT_INIT_PRIORITY 65535
3157 /* The maximum allowed initialization priority. */
3158 #define MAX_INIT_PRIORITY 65535
3160 /* The largest priority value reserved for use by system runtime
3162 #define MAX_RESERVED_INIT_PRIORITY 100
3164 /* In a VAR_DECL, the model to use if the data should be allocated from
3165 thread-local storage. */
3166 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3168 /* In a VAR_DECL, nonzero if the data should be allocated from
3169 thread-local storage. */
3170 #define DECL_THREAD_LOCAL_P(NODE) \
3171 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model != TLS_MODEL_NONE)
3173 struct tree_var_decl GTY(())
3175 struct tree_decl_with_vis common;
3179 /* This field is used to reference anything in decl.result and is meant only
3180 for use by the garbage collector. */
3181 #define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3183 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3184 Before the struct containing the FUNCTION_DECL is laid out,
3185 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3186 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3187 function. When the class is laid out, this pointer is changed
3188 to an INTEGER_CST node which is suitable for use as an index
3189 into the virtual function table.
3190 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3191 #define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3193 struct tree_decl_non_common GTY(())
3196 struct tree_decl_with_vis common;
3197 /* C++ uses this in namespaces. */
3199 /* C++ uses this in templates. */
3201 /* Almost all FE's use this. */
3203 /* C++ uses this in namespaces. */
3207 /* In FUNCTION_DECL, holds the decl for the return value. */
3208 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3210 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3211 #define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3213 /* In a FUNCTION_DECL, the saved representation of the body of the
3215 #define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3217 /* Nonzero in a FUNCTION_DECL means this function should be treated
3218 as if it were a malloc, meaning it returns a pointer that is
3220 #define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3222 /* Nonzero in a FUNCTION_DECL means this function may return more
3224 #define DECL_IS_RETURNS_TWICE(NODE) \
3225 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3227 /* Nonzero in a FUNCTION_DECL means this function should be treated
3228 as "pure" function (like const function, but may read global memory). */
3229 #define DECL_IS_PURE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3231 /* Nonzero in a FUNCTION_DECL means this function should be treated
3232 as "novops" function (function that does not read global memory,
3233 but may have arbitrary side effects). */
3234 #define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3236 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3237 at the beginning or end of execution. */
3238 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3239 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3241 #define DECL_STATIC_DESTRUCTOR(NODE) \
3242 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3244 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3245 be instrumented with calls to support routines. */
3246 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3247 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3249 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3250 disabled in this function. */
3251 #define DECL_NO_LIMIT_STACK(NODE) \
3252 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3254 /* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3255 static chain is not needed. */
3256 #define DECL_NO_STATIC_CHAIN(NODE) \
3257 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3259 /* Nonzero for a decl that cgraph has decided should be inlined into
3260 at least one call site. It is not meaningful to look at this
3261 directly; always use cgraph_function_possibly_inlined_p. */
3262 #define DECL_POSSIBLY_INLINED(DECL) \
3263 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3265 /* Nonzero in a FUNCTION_DECL means this function can be substituted
3266 where it is called. */
3267 #define DECL_INLINE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.inline_flag)
3269 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3270 such as via the `inline' keyword in C/C++. This flag controls the linkage
3271 semantics of 'inline'; whether or not the function is inlined is
3272 controlled by DECL_INLINE. */
3273 #define DECL_DECLARED_INLINE_P(NODE) \
3274 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3276 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3277 that describes the status of this function. */
3278 #define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3280 /* In a FUNCTION_DECL, nonzero means a built in function. */
3281 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3283 /* For a builtin function, identify which part of the compiler defined it. */
3284 #define DECL_BUILT_IN_CLASS(NODE) \
3285 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3287 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3288 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3290 #define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3291 #define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3293 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3294 arguments/result/saved_tree fields by front ends. It was either inherit
3295 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3296 which seemed a bit strange. */
3298 struct tree_function_decl GTY(())
3300 struct tree_decl_non_common common;
3302 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3303 DECL_FUNCTION_CODE. Otherwise unused. */
3304 enum built_in_function function_code;
3306 unsigned static_ctor_flag : 1;
3307 unsigned static_dtor_flag : 1;
3308 unsigned uninlinable : 1;
3309 unsigned possibly_inlined : 1;
3310 unsigned novops_flag : 1;
3311 unsigned returns_twice_flag : 1;
3312 unsigned malloc_flag : 1;
3313 unsigned pure_flag : 1;
3315 unsigned declared_inline_flag : 1;
3316 unsigned regdecl_flag : 1;
3317 unsigned inline_flag : 1;
3318 unsigned no_instrument_function_entry_exit : 1;
3319 unsigned no_limit_stack : 1;
3320 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3325 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3326 #define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3328 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3329 into stabs. Instead it will generate cross reference ('x') of names.
3330 This uses the same flag as DECL_EXTERNAL. */
3331 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3332 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3334 struct tree_type_decl GTY(())
3336 struct tree_decl_non_common common;
3340 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3341 To reduce overhead, the nodes containing the statements are not trees.
3342 This avoids the overhead of tree_common on all linked list elements.
3344 Use the interface in tree-iterator.h to access this node. */
3346 #define STATEMENT_LIST_HEAD(NODE) \
3347 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3348 #define STATEMENT_LIST_TAIL(NODE) \
3349 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3351 struct tree_statement_list_node
3352 GTY ((chain_next ("%h.next"), chain_prev ("%h.prev")))
3354 struct tree_statement_list_node *prev;
3355 struct tree_statement_list_node *next;
3359 struct tree_statement_list
3362 struct tree_common common;
3363 struct tree_statement_list_node *head;
3364 struct tree_statement_list_node *tail;
3367 #define VALUE_HANDLE_ID(NODE) \
3368 (VALUE_HANDLE_CHECK (NODE)->value_handle.id)
3370 #define VALUE_HANDLE_EXPR_SET(NODE) \
3371 (VALUE_HANDLE_CHECK (NODE)->value_handle.expr_set)
3373 /* Defined and used in tree-ssa-pre.c. */
3375 struct tree_value_handle GTY(())
3377 struct tree_common common;
3379 /* The set of expressions represented by this handle. */
3380 struct bitmap_set * GTY ((skip)) expr_set;
3382 /* Unique ID for this value handle. IDs are handed out in a
3383 conveniently dense form starting at 0, so that we can make
3384 bitmaps of value handles. */
3388 /* Define the overall contents of a tree node.
3389 It may be any of the structures declared above
3390 for various types of node. */
3392 union tree_node GTY ((ptr_alias (union lang_tree_node),
3393 desc ("tree_node_structure (&%h)")))
3395 struct tree_base GTY ((tag ("TS_BASE"))) base;
3396 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3397 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3398 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3399 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3400 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3401 struct tree_string GTY ((tag ("TS_STRING"))) string;
3402 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3403 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3404 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3405 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3406 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3407 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3408 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3409 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3410 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3411 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3412 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3413 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3414 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3415 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3416 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3417 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3418 struct tree_list GTY ((tag ("TS_LIST"))) list;
3419 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3420 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3421 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3422 struct tree_phi_node GTY ((tag ("TS_PHI_NODE"))) phi;
3423 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3424 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3425 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3426 struct gimple_stmt GTY ((tag ("TS_GIMPLE_STATEMENT"))) gstmt;
3427 struct tree_value_handle GTY ((tag ("TS_VALUE_HANDLE"))) value_handle;
3428 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3429 struct tree_memory_tag GTY ((tag ("TS_MEMORY_TAG"))) mtag;
3430 struct tree_struct_field_tag GTY ((tag ("TS_STRUCT_FIELD_TAG"))) sft;
3431 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3432 struct tree_memory_partition_tag GTY ((tag ("TS_MEMORY_PARTITION_TAG"))) mpt;
3435 /* Standard named or nameless data types of the C compiler. */
3457 TI_INTEGER_MINUS_ONE,
3474 TI_COMPLEX_INTEGER_TYPE,
3475 TI_COMPLEX_FLOAT_TYPE,
3476 TI_COMPLEX_DOUBLE_TYPE,
3477 TI_COMPLEX_LONG_DOUBLE_TYPE,
3481 TI_LONG_DOUBLE_TYPE,
3485 TI_LONG_DOUBLE_PTR_TYPE,
3486 TI_INTEGER_PTR_TYPE,
3495 TI_VA_LIST_GPR_COUNTER_FIELD,
3496 TI_VA_LIST_FPR_COUNTER_FIELD,
3503 TI_DFLOAT32_PTR_TYPE,
3504 TI_DFLOAT64_PTR_TYPE,
3505 TI_DFLOAT128_PTR_TYPE,
3514 TI_SAT_LLFRACT_TYPE,
3515 TI_SAT_USFRACT_TYPE,
3517 TI_SAT_ULFRACT_TYPE,
3518 TI_SAT_ULLFRACT_TYPE,
3530 TI_SAT_LLACCUM_TYPE,
3531 TI_SAT_USACCUM_TYPE,
3533 TI_SAT_ULACCUM_TYPE,
3534 TI_SAT_ULLACCUM_TYPE,
3583 extern GTY(()) tree global_trees[TI_MAX];
3585 #define error_mark_node global_trees[TI_ERROR_MARK]
3587 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3588 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3589 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3590 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3591 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3593 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3594 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3595 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3596 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3597 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3599 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3600 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3602 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3603 #define integer_one_node global_trees[TI_INTEGER_ONE]
3604 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3605 #define size_zero_node global_trees[TI_SIZE_ZERO]
3606 #define size_one_node global_trees[TI_SIZE_ONE]
3607 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3608 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3609 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3611 /* Base access nodes. */
3612 #define access_public_node global_trees[TI_PUBLIC]
3613 #define access_protected_node global_trees[TI_PROTECTED]
3614 #define access_private_node global_trees[TI_PRIVATE]
3616 #define null_pointer_node global_trees[TI_NULL_POINTER]
3618 #define float_type_node global_trees[TI_FLOAT_TYPE]
3619 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3620 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3622 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3623 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3624 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3625 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3627 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3628 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3629 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3630 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3632 #define void_type_node global_trees[TI_VOID_TYPE]
3633 /* The C type `void *'. */
3634 #define ptr_type_node global_trees[TI_PTR_TYPE]
3635 /* The C type `const void *'. */
3636 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3637 /* The C type `size_t'. */
3638 #define size_type_node global_trees[TI_SIZE_TYPE]
3639 #define pid_type_node global_trees[TI_PID_TYPE]
3640 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3641 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3642 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3643 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3644 /* The C type `FILE *'. */
3645 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3647 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3648 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3649 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3651 /* The decimal floating point types. */
3652 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3653 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3654 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3655 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3656 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3657 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3659 /* The fixed-point types. */
3660 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3661 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3662 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3663 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3664 #define sat_unsigned_short_fract_type_node \
3665 global_trees[TI_SAT_USFRACT_TYPE]
3666 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3667 #define sat_unsigned_long_fract_type_node \
3668 global_trees[TI_SAT_ULFRACT_TYPE]
3669 #define sat_unsigned_long_long_fract_type_node \
3670 global_trees[TI_SAT_ULLFRACT_TYPE]
3671 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3672 #define fract_type_node global_trees[TI_FRACT_TYPE]
3673 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3674 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3675 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3676 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3677 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3678 #define unsigned_long_long_fract_type_node \
3679 global_trees[TI_ULLFRACT_TYPE]
3680 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3681 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3682 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3683 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3684 #define sat_unsigned_short_accum_type_node \
3685 global_trees[TI_SAT_USACCUM_TYPE]
3686 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3687 #define sat_unsigned_long_accum_type_node \
3688 global_trees[TI_SAT_ULACCUM_TYPE]
3689 #define sat_unsigned_long_long_accum_type_node \
3690 global_trees[TI_SAT_ULLACCUM_TYPE]
3691 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3692 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3693 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3694 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3695 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3696 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3697 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3698 #define unsigned_long_long_accum_type_node \
3699 global_trees[TI_ULLACCUM_TYPE]
3700 #define qq_type_node global_trees[TI_QQ_TYPE]
3701 #define hq_type_node global_trees[TI_HQ_TYPE]
3702 #define sq_type_node global_trees[TI_SQ_TYPE]
3703 #define dq_type_node global_trees[TI_DQ_TYPE]
3704 #define tq_type_node global_trees[TI_TQ_TYPE]
3705 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3706 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3707 #define usq_type_node global_trees[TI_USQ_TYPE]
3708 #define udq_type_node global_trees[TI_UDQ_TYPE]
3709 #define utq_type_node global_trees[TI_UTQ_TYPE]
3710 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3711 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3712 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3713 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3714 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3715 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3716 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3717 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3718 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3719 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3720 #define ha_type_node global_trees[TI_HA_TYPE]
3721 #define sa_type_node global_trees[TI_SA_TYPE]
3722 #define da_type_node global_trees[TI_DA_TYPE]
3723 #define ta_type_node global_trees[TI_TA_TYPE]
3724 #define uha_type_node global_trees[TI_UHA_TYPE]
3725 #define usa_type_node global_trees[TI_USA_TYPE]
3726 #define uda_type_node global_trees[TI_UDA_TYPE]
3727 #define uta_type_node global_trees[TI_UTA_TYPE]
3728 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3729 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3730 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3731 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3732 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3733 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3734 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3735 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3737 /* The node that should be placed at the end of a parameter list to
3738 indicate that the function does not take a variable number of
3739 arguments. The TREE_VALUE will be void_type_node and there will be
3740 no TREE_CHAIN. Language-independent code should not assume
3741 anything else about this node. */
3742 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3744 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3745 #define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3747 /* An enumeration of the standard C integer types. These must be
3748 ordered so that shorter types appear before longer ones, and so
3749 that signed types appear before unsigned ones, for the correct
3750 functioning of interpret_integer() in c-lex.c. */
3751 enum integer_type_kind
3763 itk_unsigned_long_long,
3767 typedef enum integer_type_kind integer_type_kind;
3769 /* The standard C integer types. Use integer_type_kind to index into
3771 extern GTY(()) tree integer_types[itk_none];
3773 #define char_type_node integer_types[itk_char]
3774 #define signed_char_type_node integer_types[itk_signed_char]
3775 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3776 #define short_integer_type_node integer_types[itk_short]
3777 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3778 #define integer_type_node integer_types[itk_int]
3779 #define unsigned_type_node integer_types[itk_unsigned_int]
3780 #define long_integer_type_node integer_types[itk_long]
3781 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3782 #define long_long_integer_type_node integer_types[itk_long_long]
3783 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3785 /* Set to the default thread-local storage (tls) model to use. */
3787 extern enum tls_model flag_tls_default;
3790 /* A pointer-to-function member type looks like:
3797 If __pfn is NULL, it is a NULL pointer-to-member-function.
3799 (Because the vtable is always the first thing in the object, we
3800 don't need its offset.) If the function is virtual, then PFN is
3801 one plus twice the index into the vtable; otherwise, it is just a
3802 pointer to the function.
3804 Unfortunately, using the lowest bit of PFN doesn't work in
3805 architectures that don't impose alignment requirements on function
3806 addresses, or that use the lowest bit to tell one ISA from another,
3807 for example. For such architectures, we use the lowest bit of
3808 DELTA instead of the lowest bit of the PFN, and DELTA will be
3811 enum ptrmemfunc_vbit_where_t
3813 ptrmemfunc_vbit_in_pfn,
3814 ptrmemfunc_vbit_in_delta
3817 #define NULL_TREE (tree) NULL
3819 extern tree decl_assembler_name (tree);
3820 extern bool decl_assembler_name_equal (tree decl, tree asmname);
3822 /* Compute the number of bytes occupied by 'node'. This routine only
3823 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3825 extern size_t tree_size (const_tree);
3827 /* Compute the number of bytes occupied by a tree with code CODE. This
3828 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
3830 extern size_t tree_code_size (enum tree_code);
3832 /* Lowest level primitive for allocating a node.
3833 The TREE_CODE is the only argument. Contents are initialized
3834 to zero except for a few of the common fields. */
3836 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3837 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3839 /* Make a copy of a node, with all the same contents. */
3841 extern tree copy_node_stat (tree MEM_STAT_DECL);
3842 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3844 /* Make a copy of a chain of TREE_LIST nodes. */
3846 extern tree copy_list (tree);
3849 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3850 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3852 /* Make a TREE_VEC. */
3854 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3855 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3857 /* Tree nodes for SSA analysis. */
3859 extern void init_phinodes (void);
3860 extern void fini_phinodes (void);
3861 extern void release_phi_node (tree);
3862 #ifdef GATHER_STATISTICS
3863 extern void phinodes_print_statistics (void);
3866 extern void init_ssanames (void);
3867 extern void fini_ssanames (void);
3868 extern tree make_ssa_name (tree, tree);
3869 extern tree duplicate_ssa_name (tree, tree);
3870 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
3871 extern void release_ssa_name (tree);
3872 extern void release_defs (tree);
3873 extern void replace_ssa_name_symbol (tree, tree);
3875 #ifdef GATHER_STATISTICS
3876 extern void ssanames_print_statistics (void);
3879 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3880 The name is supplied as a char *. */
3882 extern tree get_identifier (const char *);
3884 #if GCC_VERSION >= 3000
3885 #define get_identifier(str) \
3886 (__builtin_constant_p (str) \
3887 ? get_identifier_with_length ((str), strlen (str)) \
3888 : get_identifier (str))
3892 /* Identical to get_identifier, except that the length is assumed
3895 extern tree get_identifier_with_length (const char *, size_t);
3897 /* If an identifier with the name TEXT (a null-terminated string) has
3898 previously been referred to, return that node; otherwise return
3901 extern tree maybe_get_identifier (const char *);
3903 /* Construct various types of nodes. */
3905 extern tree build_nt (enum tree_code, ...);
3906 extern tree build_nt_call_list (tree, tree);
3908 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3909 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3910 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3911 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3912 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3913 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3914 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3915 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3916 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3917 tree MEM_STAT_DECL);
3918 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
3919 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3920 tree MEM_STAT_DECL);
3921 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
3922 extern tree build7_stat (enum tree_code, tree, tree, tree, tree, tree,
3923 tree, tree, tree MEM_STAT_DECL);
3924 #define build7(c,t1,t2,t3,t4,t5,t6,t7,t8) \
3925 build7_stat (c,t1,t2,t3,t4,t5,t6,t7,t8 MEM_STAT_INFO)
3927 extern tree build_gimple_modify_stmt_stat (tree, tree MEM_STAT_DECL);
3928 #define build_gimple_modify_stmt(t1,t2) \
3929 build_gimple_modify_stmt_stat (t1,t2 MEM_STAT_INFO)
3931 extern tree build_int_cst (tree, HOST_WIDE_INT);
3932 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
3933 extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3934 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3935 extern tree build_int_cst_wide_type (tree,
3936 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
3937 extern tree build_vector (tree, tree);
3938 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3939 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3940 extern tree build_constructor_single (tree, tree, tree);
3941 extern tree build_constructor_from_list (tree, tree);
3942 extern tree build_real_from_int_cst (tree, const_tree);
3943 extern tree build_complex (tree, tree, tree);
3944 extern tree build_one_cst (tree);
3945 extern tree build_string (int, const char *);
3946 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3947 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3948 extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3949 extern tree build_fn_decl (const char *, tree);
3950 #define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
3951 extern tree build_block (tree, tree, tree, tree);
3952 #ifndef USE_MAPPED_LOCATION
3953 extern void annotate_with_file_line (tree, const char *, int);
3954 extern void annotate_with_locus (tree, location_t);
3956 extern tree build_empty_stmt (void);
3957 extern tree build_omp_clause (enum omp_clause_code);
3959 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3960 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3962 extern tree build_call_list (tree, tree, tree);
3963 extern tree build_call_nary (tree, tree, int, ...);
3964 extern tree build_call_valist (tree, tree, int, va_list);
3965 extern tree build_call_array (tree, tree, int, tree*);
3967 /* Construct various nodes representing data types. */
3969 extern tree make_signed_type (int);
3970 extern tree make_unsigned_type (int);
3971 extern tree signed_or_unsigned_type_for (int, tree);
3972 extern tree signed_type_for (tree);
3973 extern tree unsigned_type_for (tree);
3974 extern void initialize_sizetypes (bool);
3975 extern void set_sizetype (tree);
3976 extern void fixup_unsigned_type (tree);
3977 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
3978 extern tree build_pointer_type (tree);
3979 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
3980 extern tree build_reference_type (tree);
3981 extern tree build_vector_type_for_mode (tree, enum machine_mode);
3982 extern tree build_vector_type (tree innertype, int nunits);
3983 extern tree build_type_no_quals (tree);
3984 extern tree build_index_type (tree);
3985 extern tree build_index_2_type (tree, tree);
3986 extern tree build_array_type (tree, tree);
3987 extern tree build_function_type (tree, tree);
3988 extern tree build_function_type_list (tree, ...);
3989 extern tree build_method_type_directly (tree, tree, tree);
3990 extern tree build_method_type (tree, tree);
3991 extern tree build_offset_type (tree, tree);
3992 extern tree build_complex_type (tree);
3993 extern tree build_resx (int);
3994 extern tree array_type_nelts (const_tree);
3995 extern bool in_array_bounds_p (tree);
3996 extern bool range_in_array_bounds_p (tree);
3998 extern tree value_member (tree, tree);
3999 extern tree purpose_member (const_tree, tree);
4001 extern int attribute_list_equal (const_tree, const_tree);
4002 extern int attribute_list_contained (const_tree, const_tree);
4003 extern int tree_int_cst_equal (const_tree, const_tree);
4004 extern int tree_int_cst_lt (const_tree, const_tree);
4005 extern int tree_int_cst_compare (const_tree, const_tree);
4006 extern int host_integerp (const_tree, int);
4007 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4008 extern int tree_int_cst_msb (const_tree);
4009 extern int tree_int_cst_sgn (const_tree);
4010 extern int tree_int_cst_sign_bit (const_tree);
4011 extern bool tree_expr_nonnegative_p (tree);
4012 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4013 extern bool may_negate_without_overflow_p (const_tree);
4014 extern tree get_inner_array_type (const_tree);
4016 /* Construct various nodes representing fract or accum data types. */
4018 extern tree make_fract_type (int, int, int);
4019 extern tree make_accum_type (int, int, int);
4021 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4022 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4023 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4024 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4025 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4026 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4027 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4028 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4030 #define make_or_reuse_signed_fract_type(P) \
4031 make_or_reuse_fract_type (P, 0, 0)
4032 #define make_or_reuse_unsigned_fract_type(P) \
4033 make_or_reuse_fract_type (P, 1, 0)
4034 #define make_or_reuse_sat_signed_fract_type(P) \
4035 make_or_reuse_fract_type (P, 0, 1)
4036 #define make_or_reuse_sat_unsigned_fract_type(P) \
4037 make_or_reuse_fract_type (P, 1, 1)
4038 #define make_or_reuse_signed_accum_type(P) \
4039 make_or_reuse_accum_type (P, 0, 0)
4040 #define make_or_reuse_unsigned_accum_type(P) \
4041 make_or_reuse_accum_type (P, 1, 0)
4042 #define make_or_reuse_sat_signed_accum_type(P) \
4043 make_or_reuse_accum_type (P, 0, 1)
4044 #define make_or_reuse_sat_unsigned_accum_type(P) \
4045 make_or_reuse_accum_type (P, 1, 1)
4047 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4048 put the prototype here. Rtl.h does declare the prototype if
4049 tree.h had been included. */
4051 extern tree make_tree (tree, rtx);
4053 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4056 Such modified types already made are recorded so that duplicates
4059 extern tree build_type_attribute_variant (tree, tree);
4060 extern tree build_decl_attribute_variant (tree, tree);
4062 /* Structure describing an attribute and a function to handle it. */
4063 struct attribute_spec
4065 /* The name of the attribute (without any leading or trailing __),
4066 or NULL to mark the end of a table of attributes. */
4067 const char *const name;
4068 /* The minimum length of the list of arguments of the attribute. */
4069 const int min_length;
4070 /* The maximum length of the list of arguments of the attribute
4071 (-1 for no maximum). */
4072 const int max_length;
4073 /* Whether this attribute requires a DECL. If it does, it will be passed
4074 from types of DECLs, function return types and array element types to
4075 the DECLs, function types and array types respectively; but when
4076 applied to a type in any other circumstances, it will be ignored with
4077 a warning. (If greater control is desired for a given attribute,
4078 this should be false, and the flags argument to the handler may be
4079 used to gain greater control in that case.) */
4080 const bool decl_required;
4081 /* Whether this attribute requires a type. If it does, it will be passed
4082 from a DECL to the type of that DECL. */
4083 const bool type_required;
4084 /* Whether this attribute requires a function (or method) type. If it does,
4085 it will be passed from a function pointer type to the target type,
4086 and from a function return type (which is not itself a function
4087 pointer type) to the function type. */
4088 const bool function_type_required;
4089 /* Function to handle this attribute. NODE points to the node to which
4090 the attribute is to be applied. If a DECL, it should be modified in
4091 place; if a TYPE, a copy should be created. NAME is the name of the
4092 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4093 of the arguments (which may be NULL). FLAGS gives further information
4094 about the context of the attribute. Afterwards, the attributes will
4095 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4096 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4097 as well as in any other cases when the attributes should not be added
4098 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4099 applied to another type or DECL later may be returned;
4100 otherwise the return value should be NULL_TREE. This pointer may be
4101 NULL if no special handling is required beyond the checks implied
4102 by the rest of this structure. */
4103 tree (*const handler) (tree *node, tree name, tree args,
4104 int flags, bool *no_add_attrs);
4107 /* Flags that may be passed in the third argument of decl_attributes, and
4108 to handler functions for attributes. */
4109 enum attribute_flags
4111 /* The type passed in is the type of a DECL, and any attributes that
4112 should be passed in again to be applied to the DECL rather than the
4113 type should be returned. */
4114 ATTR_FLAG_DECL_NEXT = 1,
4115 /* The type passed in is a function return type, and any attributes that
4116 should be passed in again to be applied to the function type rather
4117 than the return type should be returned. */
4118 ATTR_FLAG_FUNCTION_NEXT = 2,
4119 /* The type passed in is an array element type, and any attributes that
4120 should be passed in again to be applied to the array type rather
4121 than the element type should be returned. */
4122 ATTR_FLAG_ARRAY_NEXT = 4,
4123 /* The type passed in is a structure, union or enumeration type being
4124 created, and should be modified in place. */
4125 ATTR_FLAG_TYPE_IN_PLACE = 8,
4126 /* The attributes are being applied by default to a library function whose
4127 name indicates known behavior, and should be silently ignored if they
4128 are not in fact compatible with the function type. */
4129 ATTR_FLAG_BUILT_IN = 16
4132 /* Default versions of target-overridable functions. */
4134 extern tree merge_decl_attributes (tree, tree);
4135 extern tree merge_type_attributes (tree, tree);
4137 /* Given a tree node and a string, return nonzero if the tree node is
4138 a valid attribute name for the string. */
4140 extern int is_attribute_p (const char *, const_tree);
4142 /* Given an attribute name and a list of attributes, return the list element
4143 of the attribute or NULL_TREE if not found. */
4145 extern tree lookup_attribute (const char *, tree);
4146 extern const_tree const_lookup_attribute (const char *, const_tree);
4148 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4151 extern tree remove_attribute (const char *, tree);
4153 /* Given two attributes lists, return a list of their union. */
4155 extern tree merge_attributes (tree, tree);
4157 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4158 /* Given two Windows decl attributes lists, possibly including
4159 dllimport, return a list of their union . */
4160 extern tree merge_dllimport_decl_attributes (tree, tree);
4162 /* Handle a "dllimport" or "dllexport" attribute. */
4163 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4166 /* Check whether CAND is suitable to be returned from get_qualified_type
4167 (BASE, TYPE_QUALS). */
4169 extern bool check_qualified_type (const_tree, const_tree, int);
4171 /* Return a version of the TYPE, qualified as indicated by the
4172 TYPE_QUALS, if one exists. If no qualified version exists yet,
4173 return NULL_TREE. */
4175 extern tree get_qualified_type (tree, int);
4177 /* Like get_qualified_type, but creates the type if it does not
4178 exist. This function never returns NULL_TREE. */
4180 extern tree build_qualified_type (tree, int);
4182 /* Like build_qualified_type, but only deals with the `const' and
4183 `volatile' qualifiers. This interface is retained for backwards
4184 compatibility with the various front-ends; new code should use
4185 build_qualified_type instead. */
4187 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4188 build_qualified_type ((TYPE), \
4189 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4190 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4192 /* Make a copy of a type node. */
4194 extern tree build_distinct_type_copy (tree);
4195 extern tree build_variant_type_copy (tree);
4197 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4198 fields. Optionally specify an alignment, and then lay it out. */
4200 extern void finish_builtin_struct (tree, const char *,
4203 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4204 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4205 node, does nothing except for the first time. */
4207 extern void layout_type (tree);
4209 /* These functions allow a front-end to perform a manual layout of a
4210 RECORD_TYPE. (For instance, if the placement of subsequent fields
4211 depends on the placement of fields so far.) Begin by calling
4212 start_record_layout. Then, call place_field for each of the
4213 fields. Then, call finish_record_layout. See layout_type for the
4214 default way in which these functions are used. */
4216 typedef struct record_layout_info_s
4218 /* The RECORD_TYPE that we are laying out. */
4220 /* The offset into the record so far, in bytes, not including bits in
4223 /* The last known alignment of SIZE. */
4224 unsigned int offset_align;
4225 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4227 /* The alignment of the record so far, in bits. */
4228 unsigned int record_align;
4229 /* The alignment of the record so far, ignoring #pragma pack and
4230 __attribute__ ((packed)), in bits. */
4231 unsigned int unpacked_align;
4232 /* The previous field layed out. */
4234 /* The static variables (i.e., class variables, as opposed to
4235 instance variables) encountered in T. */
4236 tree pending_statics;
4237 /* Bits remaining in the current alignment group */
4238 int remaining_in_alignment;
4239 /* True if we've seen a packed field that didn't have normal
4240 alignment anyway. */
4241 int packed_maybe_necessary;
4242 } *record_layout_info;
4244 extern void set_lang_adjust_rli (void (*) (record_layout_info));
4245 extern record_layout_info start_record_layout (tree);
4246 extern tree bit_from_pos (tree, tree);
4247 extern tree byte_from_pos (tree, tree);
4248 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4249 extern void normalize_offset (tree *, tree *, unsigned int);
4250 extern tree rli_size_unit_so_far (record_layout_info);
4251 extern tree rli_size_so_far (record_layout_info);
4252 extern void normalize_rli (record_layout_info);
4253 extern void place_field (record_layout_info, tree);
4254 extern void compute_record_mode (tree);
4255 extern void finish_record_layout (record_layout_info, int);
4257 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4258 return a canonicalized ..._TYPE node, so that duplicates are not made.
4259 How the hash code is computed is up to the caller, as long as any two
4260 callers that could hash identical-looking type nodes agree. */
4262 extern tree type_hash_canon (unsigned int, tree);
4264 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4265 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4266 fields. Call this only once for any given decl node.
4268 Second argument is the boundary that this field can be assumed to
4269 be starting at (in bits). Zero means it can be assumed aligned
4270 on any boundary that may be needed. */
4272 extern void layout_decl (tree, unsigned);
4274 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4275 a previous call to layout_decl and calls it again. */
4277 extern void relayout_decl (tree);
4279 /* Return the mode for data of a given size SIZE and mode class CLASS.
4280 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4281 The value is BLKmode if no other mode is found. This is like
4282 mode_for_size, but is passed a tree. */
4284 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4286 /* Return an expr equal to X but certainly not valid as an lvalue. */
4288 extern tree non_lvalue (tree);
4290 extern tree convert (tree, tree);
4291 extern unsigned int expr_align (const_tree);
4292 extern tree expr_first (tree);
4293 extern const_tree const_expr_first (const_tree);
4294 extern tree expr_last (tree);
4295 extern const_tree const_expr_last (const_tree);
4296 extern tree expr_only (tree);
4297 extern const_tree const_expr_only (const_tree);
4298 extern tree size_in_bytes (const_tree);
4299 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4300 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4301 extern tree bit_position (const_tree);
4302 extern HOST_WIDE_INT int_bit_position (const_tree);
4303 extern tree byte_position (const_tree);
4304 extern HOST_WIDE_INT int_byte_position (const_tree);
4306 /* Define data structures, macros, and functions for handling sizes
4307 and the various types used to represent sizes. */
4311 SIZETYPE, /* Normal representation of sizes in bytes. */
4312 SSIZETYPE, /* Signed representation of sizes in bytes. */
4313 BITSIZETYPE, /* Normal representation of sizes in bits. */
4314 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4317 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4319 #define sizetype sizetype_tab[(int) SIZETYPE]
4320 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4321 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4322 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4324 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4325 extern tree size_binop (enum tree_code, tree, tree);
4326 extern tree size_diffop (tree, tree);
4328 #define size_int(L) size_int_kind (L, SIZETYPE)
4329 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4330 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4331 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4333 extern tree round_up (tree, int);
4334 extern tree round_down (tree, int);
4335 extern tree get_pending_sizes (void);
4336 extern void put_pending_size (tree);
4337 extern void put_pending_sizes (tree);
4339 /* Type for sizes of data-type. */
4341 #define BITS_PER_UNIT_LOG \
4342 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4343 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4344 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4346 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4347 extern unsigned int maximum_field_alignment;
4348 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4349 extern unsigned int initial_max_fld_align;
4351 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4352 by making the last node in X point to Y.
4353 Returns X, except if X is 0 returns Y. */
4355 extern tree chainon (tree, tree);
4357 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4359 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4360 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4362 /* Return the last tree node in a chain. */
4364 extern tree tree_last (tree);
4366 /* Reverse the order of elements in a chain, and return the new head. */
4368 extern tree nreverse (tree);
4370 /* Returns the length of a chain of nodes
4371 (number of chain pointers to follow before reaching a null pointer). */
4373 extern int list_length (const_tree);
4375 /* Returns the number of FIELD_DECLs in a type. */
4377 extern int fields_length (const_tree);
4379 /* Given an initializer INIT, return TRUE if INIT is zero or some
4380 aggregate of zeros. Otherwise return FALSE. */
4382 extern bool initializer_zerop (const_tree);
4384 /* Examine CTOR to discover:
4385 * how many scalar fields are set to nonzero values,
4386 and place it in *P_NZ_ELTS;
4387 * how many scalar fields in total are in CTOR,
4388 and place it in *P_ELT_COUNT.
4389 * if a type is a union, and the initializer from the constructor
4390 is not the largest element in the union, then set *p_must_clear.
4392 Return whether or not CTOR is a valid static constant initializer, the same
4393 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4395 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4398 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4400 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4402 extern int integer_zerop (const_tree);
4404 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4406 extern int integer_onep (const_tree);
4408 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4409 all of whose significant bits are 1. */
4411 extern int integer_all_onesp (const_tree);
4413 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4414 exactly one bit 1. */
4416 extern int integer_pow2p (const_tree);
4418 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4419 with a nonzero value. */
4421 extern int integer_nonzerop (const_tree);
4423 extern bool cst_and_fits_in_hwi (const_tree);
4424 extern tree num_ending_zeros (const_tree);
4426 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4429 extern int fixed_zerop (const_tree);
4431 /* staticp (tree x) is nonzero if X is a reference to data allocated
4432 at a fixed address in memory. Returns the outermost data. */
4434 extern tree staticp (tree);
4436 /* save_expr (EXP) returns an expression equivalent to EXP
4437 but it can be used multiple times within context CTX
4438 and only evaluate EXP once. */
4440 extern tree save_expr (tree);
4442 /* Look inside EXPR and into any simple arithmetic operations. Return
4443 the innermost non-arithmetic node. */
4445 extern tree skip_simple_arithmetic (tree);
4447 /* Return which tree structure is used by T. */
4449 enum tree_node_structure_enum tree_node_structure (const_tree);
4451 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4452 or offset that depends on a field within a record.
4454 Note that we only allow such expressions within simple arithmetic
4457 extern bool contains_placeholder_p (const_tree);
4459 /* This macro calls the above function but short-circuits the common
4460 case of a constant to save time. Also check for null. */
4462 #define CONTAINS_PLACEHOLDER_P(EXP) \
4463 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4465 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4466 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4469 extern bool type_contains_placeholder_p (tree);
4471 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4472 return a tree with all occurrences of references to F in a
4473 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4474 contains only arithmetic expressions. */
4476 extern tree substitute_in_expr (tree, tree, tree);
4478 /* This macro calls the above function but short-circuits the common
4479 case of a constant to save time and also checks for NULL. */
4481 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4482 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4484 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4485 for it within OBJ, a tree that is an object or a chain of references. */
4487 extern tree substitute_placeholder_in_expr (tree, tree);
4489 /* This macro calls the above function but short-circuits the common
4490 case of a constant to save time and also checks for NULL. */
4492 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4493 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4494 : substitute_placeholder_in_expr (EXP, OBJ))
4496 /* variable_size (EXP) is like save_expr (EXP) except that it
4497 is for the special case of something that is part of a
4498 variable size for a data type. It makes special arrangements
4499 to compute the value at the right time when the data type
4500 belongs to a function parameter. */
4502 extern tree variable_size (tree);
4504 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4505 but it can be used multiple times
4506 and only evaluate the subexpressions once. */
4508 extern tree stabilize_reference (tree);
4510 /* Subroutine of stabilize_reference; this is called for subtrees of
4511 references. Any expression with side-effects must be put in a SAVE_EXPR
4512 to ensure that it is only evaluated once. */
4514 extern tree stabilize_reference_1 (tree);
4516 /* Return EXP, stripped of any conversions to wider types
4517 in such a way that the result of converting to type FOR_TYPE
4518 is the same as if EXP were converted to FOR_TYPE.
4519 If FOR_TYPE is 0, it signifies EXP's type. */
4521 extern tree get_unwidened (tree, tree);
4523 /* Return OP or a simpler expression for a narrower value
4524 which can be sign-extended or zero-extended to give back OP.
4525 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4526 or 0 if the value should be sign-extended. */
4528 extern tree get_narrower (tree, int *);
4530 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4531 look for nested component-refs or array-refs at constant positions
4532 and find the ultimate containing object, which is returned. */
4534 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4535 tree *, enum machine_mode *, int *, int *,
4538 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
4539 look for whether EXP or any nested component-refs within EXP is marked
4542 extern bool contains_packed_reference (const_tree exp);
4544 /* Return 1 if T is an expression that get_inner_reference handles. */
4546 extern int handled_component_p (const_tree);
4548 /* Return a tree of sizetype representing the size, in bytes, of the element
4549 of EXP, an ARRAY_REF. */
4551 extern tree array_ref_element_size (tree);
4553 /* Return a tree representing the lower bound of the array mentioned in
4554 EXP, an ARRAY_REF. */
4556 extern tree array_ref_low_bound (tree);
4558 /* Return a tree representing the upper bound of the array mentioned in
4559 EXP, an ARRAY_REF. */
4561 extern tree array_ref_up_bound (tree);
4563 /* Return a tree representing the offset, in bytes, of the field referenced
4564 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4566 extern tree component_ref_field_offset (tree);
4568 /* Given a DECL or TYPE, return the scope in which it was declared, or
4569 NUL_TREE if there is no containing scope. */
4571 extern tree get_containing_scope (const_tree);
4573 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4575 extern tree decl_function_context (const_tree);
4577 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4578 this _DECL with its context, or zero if none. */
4579 extern tree decl_type_context (const_tree);
4581 /* Return 1 if EXPR is the real constant zero. */
4582 extern int real_zerop (const_tree);
4584 /* Declare commonly used variables for tree structure. */
4586 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4587 Zero means allow extended lvalues. */
4589 extern int pedantic_lvalues;
4591 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4593 extern GTY(()) tree current_function_decl;
4595 /* Nonzero means a FUNC_BEGIN label was emitted. */
4596 extern GTY(()) const char * current_function_func_begin_label;
4599 extern unsigned crc32_string (unsigned, const char *);
4600 extern void clean_symbol_name (char *);
4601 extern tree get_file_function_name (const char *);
4602 extern tree get_callee_fndecl (const_tree);
4603 extern void change_decl_assembler_name (tree, tree);
4604 extern int type_num_arguments (const_tree);
4605 extern bool associative_tree_code (enum tree_code);
4606 extern bool commutative_tree_code (enum tree_code);
4607 extern tree upper_bound_in_type (tree, tree);
4608 extern tree lower_bound_in_type (tree, tree);
4609 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
4610 extern bool empty_body_p (const_tree);
4611 extern tree call_expr_arg (tree, int);
4612 extern tree *call_expr_argp (tree, int);
4613 extern tree call_expr_arglist (tree);
4614 extern bool auto_var_in_fn_p (const_tree, const_tree);
4618 extern void expand_expr_stmt (tree);
4619 extern int warn_if_unused_value (const_tree, location_t);
4620 extern void expand_label (tree);
4621 extern void expand_goto (tree);
4623 extern rtx expand_stack_save (void);
4624 extern void expand_stack_restore (tree);
4625 extern void expand_return (tree);
4626 extern int is_body_block (const_tree);
4629 extern void using_eh_for_cleanups (void);
4631 /* In fold-const.c */
4633 /* Non-zero if we are folding constants inside an initializer; zero
4635 extern int folding_initializer;
4637 /* Convert between trees and native memory representation. */
4638 extern int native_encode_expr (const_tree, unsigned char *, int);
4639 extern tree native_interpret_expr (tree, const unsigned char *, int);
4641 /* Fold constants as much as possible in an expression.
4642 Returns the simplified expression.
4643 Acts only on the top level of the expression;
4644 if the argument itself cannot be simplified, its
4645 subexpressions are not changed. */
4647 extern tree fold (tree);
4648 extern tree fold_unary (enum tree_code, tree, tree);
4649 extern tree fold_binary (enum tree_code, tree, tree, tree);
4650 extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
4651 extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4652 #define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4653 extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4654 #define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4655 extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4656 #define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
4657 extern tree fold_build1_initializer (enum tree_code, tree, tree);
4658 extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4659 extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
4660 extern tree fold_build_call_array (tree, tree, int, tree *);
4661 extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
4662 extern bool fold_convertible_p (const_tree, const_tree);
4663 extern tree fold_convert (tree, tree);
4664 extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
4665 extern tree fold_ignored_result (tree);
4666 extern tree fold_abs_const (tree, tree);
4667 extern tree fold_indirect_ref_1 (tree, tree);
4668 extern void fold_defer_overflow_warnings (void);
4669 extern void fold_undefer_overflow_warnings (bool, tree, int);
4670 extern void fold_undefer_and_ignore_overflow_warnings (void);
4671 extern bool fold_deferring_overflow_warnings_p (void);
4672 extern tree maybe_fold_offset_to_reference (tree, tree, tree);
4674 extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4677 extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4678 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
4679 extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4680 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4681 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4683 #define add_double(l1,h1,l2,h2,lv,hv) \
4684 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4685 extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4686 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4687 extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4688 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4689 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4691 #define mul_double(l1,h1,l2,h2,lv,hv) \
4692 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
4693 extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4694 HOST_WIDE_INT, unsigned int,
4695 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4696 extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4697 HOST_WIDE_INT, unsigned int,
4698 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4699 extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4700 HOST_WIDE_INT, unsigned int,
4701 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4702 extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4703 HOST_WIDE_INT, unsigned int,
4704 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4706 extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4707 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4708 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4709 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4712 enum operand_equal_flag
4718 extern int operand_equal_p (const_tree, const_tree, unsigned int);
4719 extern int multiple_of_p (tree, tree, tree);
4720 extern tree omit_one_operand (tree, tree, tree);
4721 extern tree omit_two_operands (tree, tree, tree, tree);
4722 extern tree invert_truthvalue (tree);
4723 extern tree fold_truth_not_expr (tree);
4724 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4725 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
4726 extern tree fold_read_from_constant_string (tree);
4727 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
4728 extern tree build_fold_addr_expr (tree);
4729 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4730 extern tree fold_strip_sign_ops (tree);
4731 extern tree build_fold_addr_expr_with_type (tree, tree);
4732 extern tree build_fold_indirect_ref (tree);
4733 extern tree fold_indirect_ref (tree);
4734 extern tree constant_boolean_node (int, tree);
4735 extern tree build_low_bits_mask (tree, unsigned);
4737 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
4738 extern void swap_tree_operands (tree, tree *, tree *);
4739 extern enum tree_code swap_tree_comparison (enum tree_code);
4741 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
4742 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
4744 extern bool tree_expr_nonzero_p (tree);
4745 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4746 extern int multiple_of_p (tree, tree, tree);
4749 extern tree fold_call_expr (tree, bool);
4750 extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4751 extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4752 extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4753 extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
4754 enum built_in_function);
4755 extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
4756 enum built_in_function);
4757 extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
4758 extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
4759 extern bool fold_builtin_next_arg (tree, bool);
4760 extern enum built_in_function builtin_mathfn_code (const_tree);
4761 extern tree build_function_call_expr (tree, tree);
4762 extern tree fold_build_call_expr (tree, tree, tree, tree);
4763 extern tree fold_builtin_call_array (tree, tree, int, tree *);
4764 extern void debug_fold_checksum (tree);
4765 extern tree build_call_expr (tree, int, ...);
4766 extern tree mathfn_built_in (tree, enum built_in_function fn);
4767 extern tree strip_float_extensions (tree);
4768 extern tree c_strlen (tree, int);
4769 extern tree std_gimplify_va_arg_expr (tree, tree, tree *, tree *);
4770 extern tree build_va_arg_indirect_ref (tree);
4771 extern tree build_string_literal (int, const char *);
4772 extern bool validate_arglist (const_tree, ...);
4773 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4774 extern int get_pointer_alignment (tree, unsigned int);
4777 extern tree strip_float_extensions (tree);
4780 extern void record_component_aliases (tree);
4781 extern alias_set_type get_alias_set (tree);
4782 extern int alias_sets_conflict_p (alias_set_type, alias_set_type);
4783 extern int alias_sets_must_conflict_p (alias_set_type, alias_set_type);
4784 extern int objects_must_conflict_p (tree, tree);
4787 extern int really_constant_p (const_tree);
4788 extern int int_fits_type_p (const_tree, const_tree);
4789 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
4790 extern bool variably_modified_type_p (tree, tree);
4791 extern int tree_log2 (const_tree);
4792 extern int tree_floor_log2 (const_tree);
4793 extern int simple_cst_equal (const_tree, const_tree);
4794 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
4795 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
4796 extern int type_list_equal (const_tree, const_tree);
4797 extern int chain_member (const_tree, const_tree);
4798 extern tree type_hash_lookup (unsigned int, tree);
4799 extern void type_hash_add (unsigned int, tree);
4800 extern int simple_cst_list_equal (const_tree, const_tree);
4801 extern void dump_tree_statistics (void);
4802 extern void expand_function_end (void);
4803 extern void expand_function_start (tree);
4804 extern void stack_protect_prologue (void);
4805 extern void stack_protect_epilogue (void);
4806 extern void recompute_tree_invariant_for_addr_expr (tree);
4807 extern bool needs_to_live_in_memory (const_tree);
4808 extern tree reconstruct_complex_type (tree, tree);
4810 extern int real_onep (const_tree);
4811 extern int real_twop (const_tree);
4812 extern int real_minus_onep (const_tree);
4813 extern void init_ttree (void);
4814 extern void build_common_tree_nodes (bool, bool);
4815 extern void build_common_tree_nodes_2 (int);
4816 extern void build_common_builtin_nodes (void);
4817 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
4818 extern tree build_range_type (tree, tree, tree);
4819 extern HOST_WIDE_INT int_cst_value (const_tree);
4820 extern tree build_addr (tree, tree);
4822 extern bool fields_compatible_p (const_tree, const_tree);
4823 extern tree find_compatible_field (tree, tree);
4825 extern location_t expr_location (const_tree);
4826 extern void set_expr_location (tree, location_t);
4827 extern bool expr_has_location (const_tree);
4829 #ifdef USE_MAPPED_LOCATION
4834 expr_locus (const_tree);
4835 extern void set_expr_locus (tree,
4836 #ifdef USE_MAPPED_LOCATION
4837 source_location *loc
4842 extern const char **expr_filename (const_tree);
4843 extern int *expr_lineno (const_tree);
4844 extern tree *tree_block (tree);
4845 extern tree *generic_tree_operand (tree, int);
4846 extern tree *generic_tree_type (tree);
4849 extern void expand_main_function (void);
4850 extern void init_dummy_function_start (void);
4851 extern void expand_dummy_function_end (void);
4852 extern unsigned int init_function_for_compilation (void);
4853 extern void allocate_struct_function (tree);
4854 extern void init_function_start (tree);
4855 extern bool use_register_for_decl (const_tree);
4856 extern void generate_setjmp_warnings (void);
4857 extern void init_temp_slots (void);
4858 extern void free_temp_slots (void);
4859 extern void pop_temp_slots (void);
4860 extern void push_temp_slots (void);
4861 extern void preserve_temp_slots (rtx);
4862 extern int aggregate_value_p (const_tree, const_tree);
4863 extern void push_function_context (void);
4864 extern void pop_function_context (void);
4865 extern void push_function_context_to (tree);
4866 extern void pop_function_context_from (tree);
4867 extern tree gimplify_parameters (void);
4869 /* In print-rtl.c */
4871 extern void print_rtl (FILE *, const_rtx);
4874 /* In print-tree.c */
4875 extern void debug_tree (tree);
4877 extern void dump_addr (FILE*, const char *, const void *);
4878 extern void print_node (FILE *, const char *, tree, int);
4879 extern void print_node_brief (FILE *, const char *, const_tree, int);
4880 extern void indent_to (FILE *, int);
4883 /* In tree-inline.c: */
4884 extern bool debug_find_tree (tree, tree);
4885 /* This is in tree-inline.c since the routine uses
4886 data structures from the inliner. */
4887 extern tree unsave_expr_now (tree);
4888 extern tree build_duplicate_type (tree);
4892 /* Nonzero if this is a call to a function whose return value depends
4893 solely on its arguments, has no side effects, and does not read
4896 /* Nonzero if this call will never return. */
4897 #define ECF_NORETURN 2
4898 /* Nonzero if this is a call to malloc or a related function. */
4899 #define ECF_MALLOC 4
4900 /* Nonzero if it is plausible that this is a call to alloca. */
4901 #define ECF_MAY_BE_ALLOCA 8
4902 /* Nonzero if this is a call to a function that won't throw an exception. */
4903 #define ECF_NOTHROW 16
4904 /* Nonzero if this is a call to setjmp or a related function. */
4905 #define ECF_RETURNS_TWICE 32
4906 /* Nonzero if this call replaces the current stack frame. */
4907 #define ECF_SIBCALL 64
4908 /* Nonzero if this is a call to "pure" function (like const function,
4909 but may read memory. */
4910 #define ECF_PURE 128
4911 /* Nonzero if this is a call to a function that returns with the stack
4912 pointer depressed. */
4913 #define ECF_SP_DEPRESSED 256
4914 /* Create libcall block around the call. */
4915 #define ECF_LIBCALL_BLOCK 512
4916 /* Function does not read or write memory (but may have side effects, so
4917 it does not necessarily fit ECF_CONST). */
4918 #define ECF_NOVOPS 1024
4920 extern int flags_from_decl_or_type (const_tree);
4921 extern int call_expr_flags (const_tree);
4923 extern int setjmp_call_p (const_tree);
4924 extern bool alloca_call_p (const_tree);
4925 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
4926 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
4930 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4931 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4932 it should be modified in place; if a TYPE, a copy should be created
4933 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4934 information, in the form of a bitwise OR of flags in enum attribute_flags
4935 from tree.h. Depending on these flags, some attributes may be
4936 returned to be applied at a later stage (for example, to apply
4937 a decl attribute to the declaration rather than to its type). */
4938 extern tree decl_attributes (tree *, tree, int);
4940 /* In integrate.c */
4941 extern void set_decl_abstract_flags (tree, int);
4942 extern void set_decl_origin_self (tree);
4944 /* In stor-layout.c */
4945 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
4946 extern void fixup_signed_type (tree);
4947 extern void internal_reference_types (void);
4948 extern unsigned int update_alignment_for_field (record_layout_info, tree,
4951 extern void make_decl_rtl (tree);
4952 extern void make_decl_one_only (tree);
4953 extern int supports_one_only (void);
4954 extern void resolve_unique_section (tree, int, int);
4955 extern void mark_referenced (tree);
4956 extern void mark_decl_referenced (tree);
4957 extern void notice_global_symbol (tree);
4958 extern void set_user_assembler_name (tree, const char *);
4959 extern void process_pending_assemble_externals (void);
4960 extern void finish_aliases_1 (void);
4961 extern void finish_aliases_2 (void);
4962 extern tree emutls_decl (tree);
4965 extern void expand_computed_goto (tree);
4966 extern bool parse_output_constraint (const char **, int, int, int,
4967 bool *, bool *, bool *);
4968 extern bool parse_input_constraint (const char **, int, int, int, int,
4969 const char * const *, bool *, bool *);
4970 extern void expand_asm_expr (tree);
4971 extern tree resolve_asm_operand_names (tree, tree, tree);
4972 extern void expand_case (tree);
4973 extern void expand_decl (tree);
4974 extern void expand_anon_union_decl (tree, tree, tree);
4976 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
4977 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
4980 /* In gimplify.c. */
4981 extern tree create_artificial_label (void);
4982 extern void gimplify_function_tree (tree);
4983 extern const char *get_name (const_tree);
4984 extern tree unshare_expr (tree);
4985 extern void sort_case_labels (tree);
4987 /* Interface of the DWARF2 unwind info support. */
4989 /* Generate a new label for the CFI info to refer to. */
4991 extern char *dwarf2out_cfi_label (void);
4993 /* Entry point to update the canonical frame address (CFA). */
4995 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
4997 /* Add the CFI for saving a register window. */
4999 extern void dwarf2out_window_save (const char *);
5001 /* Add a CFI to update the running total of the size of arguments pushed
5004 extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
5006 /* Entry point for saving a register to the stack. */
5008 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5010 /* Entry point for saving the return address in the stack. */
5012 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5014 /* Entry point for saving the return address in a register. */
5016 extern void dwarf2out_return_reg (const char *, unsigned);
5018 /* Entry point for saving the first register into the second. */
5020 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5022 /* In tree-inline.c */
5024 /* The type of a set of already-visited pointers. Functions for creating
5025 and manipulating it are declared in pointer-set.h */
5026 struct pointer_set_t;
5028 /* The type of a callback function for walking over tree structure. */
5030 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5032 /* The type of a callback function that represents a custom walk_tree. */
5034 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5035 void *, struct pointer_set_t*);
5037 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5039 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5041 #define walk_tree(a,b,c,d) \
5042 walk_tree_1 (a, b, c, d, NULL)
5043 #define walk_tree_without_duplicates(a,b,c) \
5044 walk_tree_without_duplicates_1 (a, b, c, NULL)
5046 /* Assign the RTX to declaration. */
5048 extern void set_decl_rtl (tree, rtx);
5049 extern void set_decl_incoming_rtl (tree, rtx);
5051 /* Enum and arrays used for tree allocation stats.
5052 Keep in sync with tree.c:tree_node_kind_names. */
5078 extern int tree_node_counts[];
5079 extern int tree_node_sizes[];
5081 /* True if we are in gimple form and the actions of the folders need to
5082 be restricted. False if we are not in gimple form and folding is not
5083 restricted to creating gimple expressions. */
5084 extern bool in_gimple_form;
5086 /* In tree-gimple.c. */
5087 extern tree get_base_address (tree t);
5089 /* In tree-vectorizer.c. */
5090 extern void vect_set_verbosity_level (const char *);
5094 struct tree_map_base GTY(())
5099 extern int tree_map_base_eq (const void *, const void *);
5100 extern unsigned int tree_map_base_hash (const void *);
5101 extern int tree_map_base_marked_p (const void *);
5103 /* Map from a tree to another tree. */
5105 struct tree_map GTY(())
5107 struct tree_map_base base;
5112 #define tree_map_eq tree_map_base_eq
5113 extern unsigned int tree_map_hash (const void *);
5114 #define tree_map_marked_p tree_map_base_marked_p
5116 /* Map from a tree to an int. */
5118 struct tree_int_map GTY(())
5120 struct tree_map_base base;
5124 #define tree_int_map_eq tree_map_base_eq
5125 #define tree_int_map_hash tree_map_base_hash
5126 #define tree_int_map_marked_p tree_map_base_marked_p
5128 /* Map from a tree to initialization/finalization priorities. */
5130 struct tree_priority_map GTY(())
5132 struct tree_map_base base;
5137 #define tree_priority_map_eq tree_map_base_eq
5138 #define tree_priority_map_hash tree_map_base_hash
5139 #define tree_priority_map_marked_p tree_map_base_marked_p
5141 /* In tree-ssa-address.c. */
5142 extern tree tree_mem_ref_addr (tree, tree);
5143 extern void copy_mem_ref_info (tree, tree);
5146 extern bool ssa_name_nonzero_p (const_tree);
5147 extern bool ssa_name_nonnegative_p (const_tree);
5149 /* In tree-object-size.c. */
5150 extern void init_object_sizes (void);
5151 extern void fini_object_sizes (void);
5152 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5155 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5157 /* In tree-inline.c. */
5159 void init_inline_once (void);
5161 /* Compute the number of operands in an expression node NODE. For
5162 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5163 otherwise it is looked up from the node's code. */
5165 tree_operand_length (const_tree node)
5167 if (VL_EXP_CLASS_P (node))
5168 return VL_EXP_OPERAND_LENGTH (node);
5170 return TREE_CODE_LENGTH (TREE_CODE (node));
5173 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5174 have to go towards the end of tree.h so that union tree_node is fully
5175 defined by this point. */
5177 /* Structure containing iterator state. */
5178 typedef struct call_expr_arg_iterator_d GTY (())
5180 tree t; /* the call_expr */
5181 int n; /* argument count */
5182 int i; /* next argument index */
5183 } call_expr_arg_iterator;
5185 typedef struct const_call_expr_arg_iterator_d GTY (())
5187 const_tree t; /* the call_expr */
5188 int n; /* argument count */
5189 int i; /* next argument index */
5190 } const_call_expr_arg_iterator;
5192 /* Initialize the abstract argument list iterator object ITER with the
5193 arguments from CALL_EXPR node EXP. */
5195 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5198 iter->n = call_expr_nargs (exp);
5203 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5206 iter->n = call_expr_nargs (exp);
5210 /* Return the next argument from abstract argument list iterator object ITER,
5211 and advance its state. Return NULL_TREE if there are no more arguments. */
5213 next_call_expr_arg (call_expr_arg_iterator *iter)
5216 if (iter->i >= iter->n)
5218 result = CALL_EXPR_ARG (iter->t, iter->i);
5223 static inline const_tree
5224 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5227 if (iter->i >= iter->n)
5229 result = CALL_EXPR_ARG (iter->t, iter->i);
5234 /* Initialize the abstract argument list iterator object ITER, then advance
5235 past and return the first argument. Useful in for expressions, e.g.
5236 for (arg = first_call_expr_arg (exp, &iter); arg;
5237 arg = next_call_expr_arg (&iter)) */
5239 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5241 init_call_expr_arg_iterator (exp, iter);
5242 return next_call_expr_arg (iter);
5245 static inline const_tree
5246 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5248 init_const_call_expr_arg_iterator (exp, iter);
5249 return next_const_call_expr_arg (iter);
5252 /* Test whether there are more arguments in abstract argument list iterator
5253 ITER, without changing its state. */
5255 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5257 return (iter->i < iter->n);
5261 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5263 return (iter->i < iter->n);
5266 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5267 (of type call_expr_arg_iterator) to hold the iteration state. */
5268 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5269 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5270 (arg) = next_call_expr_arg (&(iter)))
5272 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5273 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5274 (arg) = next_const_call_expr_arg (&(iter)))
5276 #endif /* GCC_TREE_H */