1 /* Front-end tree definitions for GNU compiler.
2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
31 #include "double-int.h"
33 #include "fixed-value.h"
37 /* Codes of tree nodes */
39 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
40 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
43 #include "all-tree.def"
48 #undef END_OF_BASE_TREE_CODES
50 extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
51 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
53 /* Macros for initializing `tree_contains_struct'. */
54 #define MARK_TS_BASE(C) \
56 tree_contains_struct[C][TS_BASE] = 1; \
59 #define MARK_TS_TYPED(C) \
62 tree_contains_struct[C][TS_TYPED] = 1; \
65 #define MARK_TS_COMMON(C) \
68 tree_contains_struct[C][TS_COMMON] = 1; \
71 #define MARK_TS_TYPE_COMMON(C) \
74 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
77 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
79 MARK_TS_TYPE_COMMON (C); \
80 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
83 #define MARK_TS_DECL_MINIMAL(C) \
86 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
89 #define MARK_TS_DECL_COMMON(C) \
91 MARK_TS_DECL_MINIMAL (C); \
92 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
95 #define MARK_TS_DECL_WRTL(C) \
97 MARK_TS_DECL_COMMON (C); \
98 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
101 #define MARK_TS_DECL_WITH_VIS(C) \
103 MARK_TS_DECL_WRTL (C); \
104 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
107 #define MARK_TS_DECL_NON_COMMON(C) \
109 MARK_TS_DECL_WITH_VIS (C); \
110 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
113 /* Number of language-independent tree codes. */
114 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
116 /* Tree code classes. */
118 /* Each tree_code has an associated code class represented by a
121 enum tree_code_class {
122 tcc_exceptional, /* An exceptional code (fits no category). */
123 tcc_constant, /* A constant. */
124 /* Order of tcc_type and tcc_declaration is important. */
125 tcc_type, /* A type object code. */
126 tcc_declaration, /* A declaration (also serving as variable refs). */
127 tcc_reference, /* A reference to storage. */
128 tcc_comparison, /* A comparison expression. */
129 tcc_unary, /* A unary arithmetic expression. */
130 tcc_binary, /* A binary arithmetic expression. */
131 tcc_statement, /* A statement expression, which have side effects
132 but usually no interesting value. */
133 tcc_vl_exp, /* A function call or other expression with a
134 variable-length operand vector. */
135 tcc_expression /* Any other expression. */
138 /* Each tree code class has an associated string representation.
139 These must correspond to the tree_code_class entries. */
141 extern const char *const tree_code_class_strings[];
143 /* Returns the string representing CLASS. */
145 #define TREE_CODE_CLASS_STRING(CLASS)\
146 tree_code_class_strings[(int) (CLASS)]
148 extern const enum tree_code_class tree_code_type[];
149 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
151 /* Nonzero if CODE represents an exceptional code. */
153 #define EXCEPTIONAL_CLASS_P(CODE)\
154 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
156 /* Nonzero if CODE represents a constant. */
158 #define CONSTANT_CLASS_P(CODE)\
159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
161 /* Nonzero if CODE represents a type. */
163 #define TYPE_P(CODE)\
164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
166 /* Nonzero if CODE represents a declaration. */
168 #define DECL_P(CODE)\
169 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
171 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
173 #define VAR_OR_FUNCTION_DECL_P(DECL)\
174 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
176 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
177 ascending code order. */
179 #define INDIRECT_REF_P(CODE)\
180 (TREE_CODE (CODE) == INDIRECT_REF)
182 /* Nonzero if CODE represents a reference. */
184 #define REFERENCE_CLASS_P(CODE)\
185 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
187 /* Nonzero if CODE represents a comparison. */
189 #define COMPARISON_CLASS_P(CODE)\
190 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
192 /* Nonzero if CODE represents a unary arithmetic expression. */
194 #define UNARY_CLASS_P(CODE)\
195 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
197 /* Nonzero if CODE represents a binary arithmetic expression. */
199 #define BINARY_CLASS_P(CODE)\
200 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
202 /* Nonzero if CODE represents a statement expression. */
204 #define STATEMENT_CLASS_P(CODE)\
205 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
207 /* Nonzero if CODE represents a function call-like expression with a
208 variable-length operand vector. */
210 #define VL_EXP_CLASS_P(CODE)\
211 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
213 /* Nonzero if CODE represents any other expression. */
215 #define EXPRESSION_CLASS_P(CODE)\
216 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
218 /* Returns nonzero iff CODE represents a type or declaration. */
220 #define IS_TYPE_OR_DECL_P(CODE)\
221 (TYPE_P (CODE) || DECL_P (CODE))
223 /* Returns nonzero iff CLASS is the tree-code class of an
226 #define IS_EXPR_CODE_CLASS(CLASS)\
227 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
229 /* Returns nonzero iff NODE is an expression of some kind. */
231 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
233 /* Number of argument-words in each kind of tree-node. */
235 extern const unsigned char tree_code_length[];
236 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
238 /* Names of tree components. */
240 extern const char *const tree_code_name[];
242 /* We have to be able to tell cgraph about the needed-ness of the target
243 of an alias. This requires that the decl have been defined. Aliases
244 that precede their definition have to be queued for later processing. */
246 /* The deferred processing proceeds in several passes. We memorize the
247 diagnostics emitted for a pair to prevent repeating messages when the
248 queue gets re-scanned after possible updates. */
251 ALIAS_DIAG_NONE = 0x0,
252 ALIAS_DIAG_TO_UNDEF = 0x1,
253 ALIAS_DIAG_TO_EXTERN = 0x2
256 typedef struct GTY(()) alias_pair
260 int emitted_diags; /* alias_diags already emitted for this pair. */
263 /* Define gc'd vector type. */
264 DEF_VEC_O(alias_pair);
265 DEF_VEC_ALLOC_O(alias_pair,gc);
267 extern GTY(()) VEC(alias_pair,gc) * alias_pairs;
270 /* Classify which part of the compiler has defined a given builtin function.
271 Note that we assume below that this is no more than two bits. */
280 /* Names for the above. */
281 extern const char *const built_in_class_names[4];
283 /* Codes that identify the various built in functions
284 so that expand_call can identify them quickly. */
286 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
287 enum built_in_function
289 #include "builtins.def"
291 /* Complex division routines in libgcc. These are done via builtins
292 because emit_library_call_value can't handle complex values. */
293 BUILT_IN_COMPLEX_MUL_MIN,
294 BUILT_IN_COMPLEX_MUL_MAX
295 = BUILT_IN_COMPLEX_MUL_MIN
296 + MAX_MODE_COMPLEX_FLOAT
297 - MIN_MODE_COMPLEX_FLOAT,
299 BUILT_IN_COMPLEX_DIV_MIN,
300 BUILT_IN_COMPLEX_DIV_MAX
301 = BUILT_IN_COMPLEX_DIV_MIN
302 + MAX_MODE_COMPLEX_FLOAT
303 - MIN_MODE_COMPLEX_FLOAT,
305 /* Upper bound on non-language-specific builtins. */
310 /* Names for the above. */
311 extern const char * built_in_names[(int) END_BUILTINS];
313 /* Helper macros for math builtins. */
315 #define BUILTIN_EXP10_P(FN) \
316 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
317 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
319 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
320 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
321 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
323 #define BUILTIN_SQRT_P(FN) \
324 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
326 #define BUILTIN_CBRT_P(FN) \
327 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
329 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
331 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
332 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
333 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
335 /* An array of _DECL trees for the above. */
336 extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
337 extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
339 /* In an OMP_CLAUSE node. */
341 /* Number of operands and names for each clause. */
342 extern unsigned const char omp_clause_num_ops[];
343 extern const char * const omp_clause_code_name[];
345 /* Clause codes. Do not reorder, as this is used to index into the tables
346 omp_clause_num_ops and omp_clause_code_name. */
349 /* Clause zero is special-cased inside the parser
350 (c_parser_omp_variable_list). */
351 OMP_CLAUSE_ERROR = 0,
353 /* OpenMP clause: private (variable_list). */
356 /* OpenMP clause: shared (variable_list). */
359 /* OpenMP clause: firstprivate (variable_list). */
360 OMP_CLAUSE_FIRSTPRIVATE,
362 /* OpenMP clause: lastprivate (variable_list). */
363 OMP_CLAUSE_LASTPRIVATE,
365 /* OpenMP clause: reduction (operator:variable_list).
366 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
367 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
368 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
370 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
371 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
372 OMP_CLAUSE_REDUCTION,
374 /* OpenMP clause: copyin (variable_list). */
377 /* OpenMP clause: copyprivate (variable_list). */
378 OMP_CLAUSE_COPYPRIVATE,
380 /* OpenMP clause: if (scalar-expression). */
383 /* OpenMP clause: num_threads (integer-expression). */
384 OMP_CLAUSE_NUM_THREADS,
386 /* OpenMP clause: schedule. */
389 /* OpenMP clause: nowait. */
392 /* OpenMP clause: ordered. */
395 /* OpenMP clause: default. */
398 /* OpenMP clause: collapse (constant-integer-expression). */
401 /* OpenMP clause: untied. */
405 /* The definition of tree nodes fills the next several pages. */
407 /* A tree node can represent a data type, a variable, an expression
408 or a statement. Each node has a TREE_CODE which says what kind of
409 thing it represents. Some common codes are:
410 INTEGER_TYPE -- represents a type of integers.
411 ARRAY_TYPE -- represents a type of pointer.
412 VAR_DECL -- represents a declared variable.
413 INTEGER_CST -- represents a constant integer value.
414 PLUS_EXPR -- represents a sum (an expression).
416 As for the contents of a tree node: there are some fields
417 that all nodes share. Each TREE_CODE has various special-purpose
418 fields as well. The fields of a node are never accessed directly,
419 always through accessor macros. */
421 /* Every kind of tree node starts with this structure,
422 so all nodes have these fields.
424 See the accessor macros, defined below, for documentation of the
427 struct GTY(()) tree_base {
428 ENUM_BITFIELD(tree_code) code : 16;
430 unsigned side_effects_flag : 1;
431 unsigned constant_flag : 1;
432 unsigned addressable_flag : 1;
433 unsigned volatile_flag : 1;
434 unsigned readonly_flag : 1;
435 unsigned unsigned_flag : 1;
436 unsigned asm_written_flag: 1;
437 unsigned nowarning_flag : 1;
439 unsigned used_flag : 1;
440 unsigned nothrow_flag : 1;
441 unsigned static_flag : 1;
442 unsigned public_flag : 1;
443 unsigned private_flag : 1;
444 unsigned protected_flag : 1;
445 unsigned deprecated_flag : 1;
446 unsigned saturating_flag : 1;
448 unsigned default_def_flag : 1;
449 unsigned lang_flag_0 : 1;
450 unsigned lang_flag_1 : 1;
451 unsigned lang_flag_2 : 1;
452 unsigned lang_flag_3 : 1;
453 unsigned lang_flag_4 : 1;
454 unsigned lang_flag_5 : 1;
455 unsigned lang_flag_6 : 1;
457 unsigned visited : 1;
458 unsigned packed_flag : 1;
459 unsigned user_align : 1;
460 unsigned nameless_flag : 1;
464 /* This field is only used with type nodes; the only reason it is present
465 in tree_base instead of tree_type is to save space. The size of the
466 field must be large enough to hold addr_space_t values. */
467 unsigned address_space : 8;
470 struct GTY(()) tree_typed {
471 struct tree_base base;
475 struct GTY(()) tree_common {
476 struct tree_typed typed;
480 /* The following table lists the uses of each of the above flags and
481 for which types of nodes they are defined.
486 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
488 CONSTRUCTOR, IDENTIFIER_NODE
489 STMT_EXPR, it means we want the result of the enclosed expression
491 CALL_EXPR_TAILCALL in
500 VAR_DECL, FUNCTION_DECL
503 TREE_NO_TRAMPOLINE in
509 TREE_SYMBOL_REFERENCED in
513 TARGET_EXPR, WITH_CLEANUP_EXPR
515 TRY_CATCH_IS_CLEANUP in
521 TYPE_REF_CAN_ALIAS_ALL in
522 POINTER_TYPE, REFERENCE_TYPE
530 CALL_CANNOT_INLINE_P in
539 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
542 VAR_DECL, FUNCTION_DECL
548 CALL_EXPR_VA_ARG_PACK in
551 TYPE_CACHED_VALUES_P in
554 SAVE_EXPR_RESOLVED_P in
557 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
558 OMP_CLAUSE_LASTPRIVATE
560 OMP_CLAUSE_PRIVATE_DEBUG in
568 CALL_EXPR_RETURN_SLOT_OPT in
574 OMP_PARALLEL_COMBINED in
576 OMP_CLAUSE_PRIVATE_OUTER_REF in
579 TYPE_REF_IS_RVALUE in
588 CALL_FROM_THUNK_P and
589 CALL_ALLOCA_FOR_VAR_P in
604 TREE_THIS_VOLATILE in
627 TYPE_SIZES_GIMPLIFIED in
638 REGISTER_DEFS_IN_THIS_STMT in
639 all expressions (tree-into-ssa.c)
644 VAR_DECL, FUNCTION_DECL
645 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
646 BLOCK, SSA_NAME, STRING_CST
649 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
668 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
676 IDENTIFIER_TRANSPARENT_ALIAS in
679 STMT_IN_SSA_EDGE_WORKLIST in
680 all expressions (tree-ssa-propagate.c)
685 all trees (used liberally by many passes)
700 TYPE_VECTOR_OPAQUE in
703 SSA_NAME_IS_DEFAULT_DEF in
708 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
709 enum tree_node_structure_enum {
710 #include "treestruct.def"
715 /* Define accessors for the fields that all tree nodes have
716 (though some fields are not used for all kinds of nodes). */
718 /* The tree-code says what kind of node it is.
719 Codes are defined in tree.def. */
720 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
721 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
723 /* When checking is enabled, errors will be generated if a tree node
724 is accessed incorrectly. The macros die with a fatal error. */
725 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
727 #define TREE_CHECK(T, CODE) __extension__ \
728 ({ __typeof (T) const __t = (T); \
729 if (TREE_CODE (__t) != (CODE)) \
730 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
734 #define TREE_NOT_CHECK(T, CODE) __extension__ \
735 ({ __typeof (T) const __t = (T); \
736 if (TREE_CODE (__t) == (CODE)) \
737 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
741 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
742 ({ __typeof (T) const __t = (T); \
743 if (TREE_CODE (__t) != (CODE1) \
744 && TREE_CODE (__t) != (CODE2)) \
745 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
746 (CODE1), (CODE2), 0); \
749 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
750 ({ __typeof (T) const __t = (T); \
751 if (TREE_CODE (__t) == (CODE1) \
752 || TREE_CODE (__t) == (CODE2)) \
753 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
754 (CODE1), (CODE2), 0); \
757 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
758 ({ __typeof (T) const __t = (T); \
759 if (TREE_CODE (__t) != (CODE1) \
760 && TREE_CODE (__t) != (CODE2) \
761 && TREE_CODE (__t) != (CODE3)) \
762 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
763 (CODE1), (CODE2), (CODE3), 0); \
766 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
767 ({ __typeof (T) const __t = (T); \
768 if (TREE_CODE (__t) == (CODE1) \
769 || TREE_CODE (__t) == (CODE2) \
770 || TREE_CODE (__t) == (CODE3)) \
771 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
772 (CODE1), (CODE2), (CODE3), 0); \
775 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
776 ({ __typeof (T) const __t = (T); \
777 if (TREE_CODE (__t) != (CODE1) \
778 && TREE_CODE (__t) != (CODE2) \
779 && TREE_CODE (__t) != (CODE3) \
780 && TREE_CODE (__t) != (CODE4)) \
781 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
782 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
785 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
786 ({ __typeof (T) const __t = (T); \
787 if (TREE_CODE (__t) == (CODE1) \
788 || TREE_CODE (__t) == (CODE2) \
789 || TREE_CODE (__t) == (CODE3) \
790 || TREE_CODE (__t) == (CODE4)) \
791 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
792 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
795 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
796 ({ __typeof (T) const __t = (T); \
797 if (TREE_CODE (__t) != (CODE1) \
798 && TREE_CODE (__t) != (CODE2) \
799 && TREE_CODE (__t) != (CODE3) \
800 && TREE_CODE (__t) != (CODE4) \
801 && TREE_CODE (__t) != (CODE5)) \
802 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
803 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
806 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
807 ({ __typeof (T) const __t = (T); \
808 if (TREE_CODE (__t) == (CODE1) \
809 || TREE_CODE (__t) == (CODE2) \
810 || TREE_CODE (__t) == (CODE3) \
811 || TREE_CODE (__t) == (CODE4) \
812 || TREE_CODE (__t) == (CODE5)) \
813 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
814 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
817 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
818 ({ __typeof (T) const __t = (T); \
819 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
820 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
824 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
825 ({ __typeof (T) const __t = (T); \
826 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
827 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
831 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
832 ({ __typeof (T) const __t = (T); \
833 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
834 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
838 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
839 ({ __typeof (T) const __t = (T); \
840 if (TREE_CODE (__t) != OMP_CLAUSE) \
841 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
843 if (__t->omp_clause.code != (CODE)) \
844 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
848 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
849 ({ __typeof (T) const __t = (T); \
850 if (TREE_CODE (__t) != OMP_CLAUSE) \
851 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
853 if ((int) __t->omp_clause.code < (int) (CODE1) \
854 || (int) __t->omp_clause.code > (int) (CODE2)) \
855 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
856 __FUNCTION__, (CODE1), (CODE2)); \
859 /* These checks have to be special cased. */
860 #define EXPR_CHECK(T) __extension__ \
861 ({ __typeof (T) const __t = (T); \
862 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
863 if (!IS_EXPR_CODE_CLASS (__c)) \
864 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
868 /* These checks have to be special cased. */
869 #define NON_TYPE_CHECK(T) __extension__ \
870 ({ __typeof (T) const __t = (T); \
872 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
876 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
877 (*({__typeof (T) const __t = (T); \
878 const int __i = (I); \
879 if (TREE_CODE (__t) != TREE_VEC) \
880 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
882 if (__i < 0 || __i >= __t->vec.length) \
883 tree_vec_elt_check_failed (__i, __t->vec.length, \
884 __FILE__, __LINE__, __FUNCTION__); \
885 &__t->vec.a[__i]; }))
887 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
888 (*({__typeof (T) const __t = (T); \
889 const int __i = (I); \
890 if (TREE_CODE (__t) != OMP_CLAUSE) \
891 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
893 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
894 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
896 &__t->omp_clause.ops[__i]; }))
898 /* Special checks for TREE_OPERANDs. */
899 #define TREE_OPERAND_CHECK(T, I) __extension__ \
900 (*({__typeof (T) const __t = EXPR_CHECK (T); \
901 const int __i = (I); \
902 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
903 tree_operand_check_failed (__i, __t, \
904 __FILE__, __LINE__, __FUNCTION__); \
905 &__t->exp.operands[__i]; }))
907 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
908 (*({__typeof (T) const __t = (T); \
909 const int __i = (I); \
910 if (TREE_CODE (__t) != CODE) \
911 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
912 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
913 tree_operand_check_failed (__i, __t, \
914 __FILE__, __LINE__, __FUNCTION__); \
915 &__t->exp.operands[__i]; }))
917 /* Nodes are chained together for many purposes.
918 Types are chained together to record them for being output to the debugger
919 (see the function `chain_type').
920 Decls in the same scope are chained together to record the contents
922 Statement nodes for successive statements used to be chained together.
923 Often lists of things are represented by TREE_LIST nodes that
924 are chained together. */
926 #define TREE_CHAIN(NODE) __extension__ \
927 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_COMMON);\
928 &__t->common.chain; }))
930 /* In all nodes that are expressions, this is the data type of the expression.
931 In POINTER_TYPE nodes, this is the type that the pointer points to.
932 In ARRAY_TYPE nodes, this is the type of the elements.
933 In VECTOR_TYPE nodes, this is the type of the elements. */
934 #define TREE_TYPE(NODE) __extension__ \
935 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_TYPED); \
936 &__t->typed.type; }))
938 extern void tree_contains_struct_check_failed (const_tree,
939 const enum tree_node_structure_enum,
940 const char *, int, const char *)
943 extern void tree_check_failed (const_tree, const char *, int, const char *,
944 ...) ATTRIBUTE_NORETURN;
945 extern void tree_not_check_failed (const_tree, const char *, int, const char *,
946 ...) ATTRIBUTE_NORETURN;
947 extern void tree_class_check_failed (const_tree, const enum tree_code_class,
948 const char *, int, const char *)
950 extern void tree_range_check_failed (const_tree, const char *, int,
951 const char *, enum tree_code,
954 extern void tree_not_class_check_failed (const_tree,
955 const enum tree_code_class,
956 const char *, int, const char *)
958 extern void tree_vec_elt_check_failed (int, int, const char *,
961 extern void phi_node_elt_check_failed (int, int, const char *,
964 extern void tree_operand_check_failed (int, const_tree,
965 const char *, int, const char *)
967 extern void omp_clause_check_failed (const_tree, const char *, int,
968 const char *, enum omp_clause_code)
970 extern void omp_clause_operand_check_failed (int, const_tree, const char *,
973 extern void omp_clause_range_check_failed (const_tree, const char *, int,
974 const char *, enum omp_clause_code,
975 enum omp_clause_code)
978 #else /* not ENABLE_TREE_CHECKING, or not gcc */
980 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
981 #define TREE_CHECK(T, CODE) (T)
982 #define TREE_NOT_CHECK(T, CODE) (T)
983 #define TREE_CHECK2(T, CODE1, CODE2) (T)
984 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
985 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
986 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
987 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
988 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
989 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
990 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
991 #define TREE_CLASS_CHECK(T, CODE) (T)
992 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
993 #define EXPR_CHECK(T) (T)
994 #define NON_TYPE_CHECK(T) (T)
995 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
996 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
997 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
998 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
999 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
1000 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
1002 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
1003 #define TREE_TYPE(NODE) ((NODE)->typed.type)
1007 #define TREE_BLOCK(NODE) *(tree_block (NODE))
1009 #include "tree-check.h"
1011 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
1012 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
1013 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
1014 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
1015 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
1016 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
1017 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
1018 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
1019 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
1020 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
1021 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
1023 #define RECORD_OR_UNION_CHECK(T) \
1024 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1025 #define NOT_RECORD_OR_UNION_CHECK(T) \
1026 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1028 #define NUMERICAL_TYPE_CHECK(T) \
1029 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
1032 /* Here is how primitive or already-canonicalized types' hash codes
1034 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
1036 /* A simple hash function for an arbitrary tree node. This must not be
1037 used in hash tables which are saved to a PCH. */
1038 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1040 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
1041 #define CONVERT_EXPR_CODE_P(CODE) \
1042 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
1044 /* Similarly, but accept an expressions instead of a tree code. */
1045 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
1047 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
1049 #define CASE_CONVERT \
1053 /* Given an expression as a tree, strip any conversion that generates
1054 no instruction. Accepts both tree and const_tree arguments since
1055 we are not modifying the tree itself. */
1057 #define STRIP_NOPS(EXP) \
1058 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
1060 /* Like STRIP_NOPS, but don't let the signedness change either. */
1062 #define STRIP_SIGN_NOPS(EXP) \
1063 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1065 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1067 #define STRIP_TYPE_NOPS(EXP) \
1068 while ((CONVERT_EXPR_P (EXP) \
1069 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1070 && TREE_OPERAND (EXP, 0) != error_mark_node \
1071 && (TREE_TYPE (EXP) \
1072 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1073 (EXP) = TREE_OPERAND (EXP, 0)
1075 /* Remove unnecessary type conversions according to
1076 tree_ssa_useless_type_conversion. */
1078 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1079 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1081 /* Nonzero if TYPE represents an integral type. Note that we do not
1082 include COMPLEX types here. Keep these checks in ascending code
1085 #define INTEGRAL_TYPE_P(TYPE) \
1086 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1087 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1088 || TREE_CODE (TYPE) == INTEGER_TYPE)
1090 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1092 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1093 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1095 /* Nonzero if TYPE represents a saturating fixed-point type. */
1097 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1098 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1100 /* Nonzero if TYPE represents a fixed-point type. */
1102 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1104 /* Nonzero if TYPE represents a scalar floating-point type. */
1106 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1108 /* Nonzero if TYPE represents a complex floating-point type. */
1110 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1111 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1112 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1114 /* Nonzero if TYPE represents a vector floating-point type. */
1116 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1117 (TREE_CODE (TYPE) == VECTOR_TYPE \
1118 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1120 /* Nonzero if TYPE represents a floating-point type, including complex
1121 and vector floating-point types. The vector and complex check does
1122 not use the previous two macros to enable early folding. */
1124 #define FLOAT_TYPE_P(TYPE) \
1125 (SCALAR_FLOAT_TYPE_P (TYPE) \
1126 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1127 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1128 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1130 /* Nonzero if TYPE represents a decimal floating-point type. */
1131 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1132 (SCALAR_FLOAT_TYPE_P (TYPE) \
1133 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1135 /* Nonzero if TYPE is a record or union type. */
1136 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1137 (TREE_CODE (TYPE) == RECORD_TYPE \
1138 || TREE_CODE (TYPE) == UNION_TYPE \
1139 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1141 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1142 Keep these checks in ascending code order. */
1144 #define AGGREGATE_TYPE_P(TYPE) \
1145 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1147 /* Nonzero if TYPE represents a pointer or reference type.
1148 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1149 ascending code order. */
1151 #define POINTER_TYPE_P(TYPE) \
1152 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1154 /* Nonzero if this type is a complete type. */
1155 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1157 /* Nonzero if this type is the (possibly qualified) void type. */
1158 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1160 /* Nonzero if this type is complete or is cv void. */
1161 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1162 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1164 /* Nonzero if this type is complete or is an array with unspecified bound. */
1165 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1166 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1169 /* Define many boolean fields that all tree nodes have. */
1171 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1172 of this is needed. So it cannot be in a register.
1173 In a FUNCTION_DECL it has no meaning.
1174 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1175 In LABEL_DECL nodes, it means a goto for this label has been seen
1176 from a place outside all binding contours that restore stack levels.
1177 In ..._TYPE nodes, it means that objects of this type must be fully
1178 addressable. This means that pieces of this object cannot go into
1179 register parameters, for example. If this a function type, this
1180 means that the value must be returned in memory.
1181 In IDENTIFIER_NODEs, this means that some extern decl for this name
1182 had its address taken. That matters for inline functions. */
1183 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1185 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1186 exit of a function. Calls for which this is true are candidates for tail
1187 call optimizations. */
1188 #define CALL_EXPR_TAILCALL(NODE) \
1189 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1191 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1192 CASE_LOW operand has been processed. */
1193 #define CASE_LOW_SEEN(NODE) \
1194 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1196 #define PREDICT_EXPR_OUTCOME(NODE) \
1197 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1198 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1199 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1200 #define PREDICT_EXPR_PREDICTOR(NODE) \
1201 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1203 /* In a VAR_DECL, nonzero means allocate static storage.
1204 In a FUNCTION_DECL, nonzero if function has been defined.
1205 In a CONSTRUCTOR, nonzero means allocate static storage. */
1206 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1208 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1209 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1211 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1212 should only be executed if an exception is thrown, not on normal exit
1214 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1216 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1217 separate cleanup in honor_protect_cleanup_actions. */
1218 #define TRY_CATCH_IS_CLEANUP(NODE) \
1219 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1221 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1222 CASE_HIGH operand has been processed. */
1223 #define CASE_HIGH_SEEN(NODE) \
1224 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1226 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1227 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1229 /* Used to mark scoped enums. */
1230 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1232 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1233 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1235 /* In an expr node (usually a conversion) this means the node was made
1236 implicitly and should not lead to any sort of warning. In a decl node,
1237 warnings concerning the decl should be suppressed. This is used at
1238 least for used-before-set warnings, and it set after one warning is
1240 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1242 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1243 this string as an argument. */
1244 #define TREE_SYMBOL_REFERENCED(NODE) \
1245 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1247 /* Nonzero in a pointer or reference type means the data pointed to
1248 by this type can alias anything. */
1249 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1250 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1252 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1253 #define MOVE_NONTEMPORAL(NODE) \
1254 (EXPR_CHECK (NODE)->base.static_flag)
1256 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1257 there was an overflow in folding. */
1259 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1261 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1263 #define TREE_OVERFLOW_P(EXPR) \
1264 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1266 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1267 nonzero means name is to be accessible from outside this translation unit.
1268 In an IDENTIFIER_NODE, nonzero means an external declaration
1269 accessible from outside this translation unit was previously seen
1270 for this name in an inner scope. */
1271 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1273 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1274 of cached values, or is something else. */
1275 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1277 /* In a SAVE_EXPR, indicates that the original expression has already
1278 been substituted with a VAR_DECL that contains the value. */
1279 #define SAVE_EXPR_RESOLVED_P(NODE) \
1280 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1282 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1284 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1285 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1287 /* In any expression, decl, or constant, nonzero means it has side effects or
1288 reevaluation of the whole expression could produce a different value.
1289 This is set if any subexpression is a function call, a side effect or a
1290 reference to a volatile variable. In a ..._DECL, this is set only if the
1291 declaration said `volatile'. This will never be set for a constant. */
1292 #define TREE_SIDE_EFFECTS(NODE) \
1293 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1295 /* In a LABEL_DECL, nonzero means this label had its address taken
1296 and therefore can never be deleted and is a jump target for
1298 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1300 /* Nonzero means this expression is volatile in the C sense:
1301 its address should be of type `volatile WHATEVER *'.
1302 In other words, the declared item is volatile qualified.
1303 This is used in _DECL nodes and _REF nodes.
1304 On a FUNCTION_DECL node, this means the function does not
1305 return normally. This is the same effect as setting
1306 the attribute noreturn on the function in C.
1308 In a ..._TYPE node, means this type is volatile-qualified.
1309 But use TYPE_VOLATILE instead of this macro when the node is a type,
1310 because eventually we may make that a different bit.
1312 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1313 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1315 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1316 accessing the memory pointed to won't generate a trap. However,
1317 this only applies to an object when used appropriately: it doesn't
1318 mean that writing a READONLY mem won't trap.
1320 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1321 (or slice of the array) always belongs to the range of the array.
1322 I.e. that the access will not trap, provided that the access to
1323 the base to the array will not trap. */
1324 #define TREE_THIS_NOTRAP(NODE) \
1325 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1326 ARRAY_RANGE_REF)->base.nothrow_flag)
1328 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1329 nonzero means it may not be the lhs of an assignment.
1330 Nonzero in a FUNCTION_DECL means this function should be treated
1331 as "const" function (can only read its arguments). */
1332 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1334 /* Value of expression is constant. Always on in all ..._CST nodes. May
1335 also appear in an expression or decl where the value is constant. */
1336 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1338 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1339 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1340 (TYPE_CHECK (NODE)->base.constant_flag)
1342 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1343 #define DECL_UNSIGNED(NODE) \
1344 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1346 /* In integral and pointer types, means an unsigned type. */
1347 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1349 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1350 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1351 This is interesting in an inline function, since it might not need
1352 to be compiled separately.
1353 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1354 if the debugging info for the type has been written.
1355 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1356 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1358 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1360 /* Nonzero in a _DECL if the name is used in its scope.
1361 Nonzero in an expr node means inhibit warning if value is unused.
1362 In IDENTIFIER_NODEs, this means that some extern decl for this name
1364 In a BLOCK, this means that the block contains variables that are used. */
1365 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1367 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1368 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1369 throw. We can't easily check the node type here as the C++
1370 frontend also uses this flag (for AGGR_INIT_EXPR). */
1371 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1373 /* In a CALL_EXPR, means that it's safe to use the target of the call
1374 expansion as the return slot for a call that returns in memory. */
1375 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1376 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1378 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1379 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1381 #define DECL_BY_REFERENCE(NODE) \
1382 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1383 RESULT_DECL)->decl_common.decl_by_reference_flag)
1385 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1386 can be used as restricted tag to disambiguate against other restrict
1387 pointers. Used by fortran to capture something like non-addressability
1388 (which it isn't really because the middle-end does take addresses of
1390 #define DECL_RESTRICTED_P(NODE) \
1391 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1392 RESULT_DECL)->decl_common.decl_restricted_flag)
1394 #define DECL_READ_P(NODE) \
1395 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1397 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1398 thunked-to function. */
1399 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1401 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1402 it has been built for the declaration of a variable-sized object. */
1403 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1404 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1406 /* In a type, nonzero means that all objects of the type are guaranteed by the
1407 language or front-end to be properly aligned, so we can indicate that a MEM
1408 of this type is aligned at least to the alignment of the type, even if it
1409 doesn't appear that it is. We see this, for example, in object-oriented
1410 languages where a tag field may show this is an object of a more-aligned
1411 variant of the more generic type.
1413 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1415 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1417 /* Used in classes in C++. */
1418 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1419 /* Used in classes in C++. */
1420 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1422 /* True if reference type NODE is a C++ rvalue reference. */
1423 #define TYPE_REF_IS_RVALUE(NODE) \
1424 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1426 /* Nonzero in a _DECL if the use of the name is defined as a
1427 deprecated feature by __attribute__((deprecated)). */
1428 #define TREE_DEPRECATED(NODE) \
1429 ((NODE)->base.deprecated_flag)
1431 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1432 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1433 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1434 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1436 /* In fixed-point types, means a saturating type. */
1437 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1439 /* These flags are available for each language front end to use internally. */
1440 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1441 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1442 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1443 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1444 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1445 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1446 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1448 /* Define additional fields and accessors for nodes representing constants. */
1450 /* In an INTEGER_CST node. These two together make a 2-word integer.
1451 If the data type is signed, the value is sign-extended to 2 words
1452 even though not all of them may really be in use.
1453 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1454 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1455 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1456 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1458 #define INT_CST_LT(A, B) \
1459 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1460 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1461 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1463 #define INT_CST_LT_UNSIGNED(A, B) \
1464 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1465 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1466 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1467 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1468 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1470 struct GTY(()) tree_int_cst {
1471 struct tree_typed typed;
1475 /* In a REAL_CST node. struct real_value is an opaque entity, with
1476 manipulators defined in real.h. We don't want tree.h depending on
1477 real.h and transitively on tm.h. */
1480 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1481 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1483 struct GTY(()) tree_real_cst {
1484 struct tree_typed typed;
1485 struct real_value * real_cst_ptr;
1488 /* In a FIXED_CST node. */
1491 #define TREE_FIXED_CST_PTR(NODE) \
1492 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1493 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1495 struct GTY(()) tree_fixed_cst {
1496 struct tree_typed typed;
1497 struct fixed_value * fixed_cst_ptr;
1500 /* In a STRING_CST */
1501 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1502 #define TREE_STRING_POINTER(NODE) \
1503 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1505 struct GTY(()) tree_string {
1506 struct tree_typed typed;
1511 /* In a COMPLEX_CST node. */
1512 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1513 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1515 struct GTY(()) tree_complex {
1516 struct tree_typed typed;
1521 /* In a VECTOR_CST node. */
1522 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1524 struct GTY(()) tree_vector {
1525 struct tree_typed typed;
1531 /* Define fields and accessors for some special-purpose tree nodes. */
1533 #define IDENTIFIER_LENGTH(NODE) \
1534 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1535 #define IDENTIFIER_POINTER(NODE) \
1536 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1537 #define IDENTIFIER_HASH_VALUE(NODE) \
1538 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1540 /* Translate a hash table identifier pointer to a tree_identifier
1541 pointer, and vice versa. */
1543 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1544 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1545 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1547 struct GTY(()) tree_identifier {
1548 struct tree_common common;
1549 struct ht_identifier id;
1552 /* In a TREE_LIST node. */
1553 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1554 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1556 struct GTY(()) tree_list {
1557 struct tree_common common;
1562 /* In a TREE_VEC node. */
1563 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1564 #define TREE_VEC_END(NODE) \
1565 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1567 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1569 struct GTY(()) tree_vec {
1570 struct tree_common common;
1572 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
1575 /* In a CONSTRUCTOR node. */
1576 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1577 #define CONSTRUCTOR_ELT(NODE,IDX) \
1578 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1579 #define CONSTRUCTOR_NELTS(NODE) \
1580 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1582 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1583 value of each element (stored within VAL). IX must be a scratch variable
1584 of unsigned integer type. */
1585 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1586 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1588 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1592 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1593 the value of each element (stored within VAL) and its index (stored
1594 within INDEX). IX must be a scratch variable of unsigned integer type. */
1595 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1596 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1598 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1599 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1603 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1604 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1606 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1607 _ce___->index = INDEX; \
1608 _ce___->value = VALUE; \
1611 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1612 constructor output purposes. */
1613 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1614 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1616 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1617 element. INDEX can optionally design the position of VALUE: in arrays,
1618 it is the index where VALUE has to be placed; in structures, it is the
1619 FIELD_DECL of the member. */
1620 typedef struct GTY(()) constructor_elt_d {
1625 DEF_VEC_O(constructor_elt);
1626 DEF_VEC_ALLOC_O(constructor_elt,gc);
1628 struct GTY(()) tree_constructor {
1629 struct tree_typed typed;
1630 VEC(constructor_elt,gc) *elts;
1633 /* Define fields and accessors for some nodes that represent expressions. */
1635 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1636 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1637 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1638 && integer_zerop (TREE_OPERAND (NODE, 0)))
1640 /* In ordinary expression nodes. */
1641 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1642 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1644 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1645 length. Its value includes the length operand itself; that is,
1646 the minimum valid length is 1.
1647 Note that we have to bypass the use of TREE_OPERAND to access
1648 that field to avoid infinite recursion in expanding the macros. */
1649 #define VL_EXP_OPERAND_LENGTH(NODE) \
1650 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1652 /* Nonzero if is_gimple_debug() may possibly hold. */
1653 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1655 /* In a LOOP_EXPR node. */
1656 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1658 /* The source location of this expression. Non-tree_exp nodes such as
1659 decls and constants can be shared among multiple locations, so
1661 #define EXPR_LOCATION(NODE) \
1662 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1663 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1664 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1665 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location)
1666 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1667 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1669 /* True if a tree is an expression or statement that can have a
1671 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1673 extern void protected_set_expr_location (tree, location_t);
1675 /* In a TARGET_EXPR node. */
1676 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1677 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1678 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1680 /* DECL_EXPR accessor. This gives access to the DECL associated with
1681 the given declaration statement. */
1682 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1684 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1686 /* COMPOUND_LITERAL_EXPR accessors. */
1687 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1688 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1689 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1690 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1692 /* SWITCH_EXPR accessors. These give access to the condition, body and
1693 original condition type (before any compiler conversions)
1694 of the switch statement, respectively. */
1695 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1696 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1697 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1699 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1700 of a case label, respectively. */
1701 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1702 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1703 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1704 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1706 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1707 corresponding MEM_REF operands. */
1708 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1709 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1710 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1711 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1712 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1714 /* The operands of a BIND_EXPR. */
1715 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1716 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1717 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1719 /* GOTO_EXPR accessor. This gives access to the label associated with
1720 a goto statement. */
1721 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1723 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1724 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1725 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1727 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1728 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1729 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1730 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1731 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1732 /* Nonzero if we want to create an ASM_INPUT instead of an
1733 ASM_OPERAND with no operands. */
1734 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1735 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1737 /* COND_EXPR accessors. */
1738 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1739 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1740 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1742 /* Accessors for the chains of recurrences. */
1743 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1744 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1745 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1746 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1748 /* LABEL_EXPR accessor. This gives access to the label associated with
1749 the given label expression. */
1750 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1752 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1753 accessors for SSA operands. */
1755 /* CATCH_EXPR accessors. */
1756 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1757 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1759 /* EH_FILTER_EXPR accessors. */
1760 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1761 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1763 /* OBJ_TYPE_REF accessors. */
1764 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1765 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1766 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1768 /* ASSERT_EXPR accessors. */
1769 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1770 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1772 /* CALL_EXPR accessors.
1774 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1775 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1776 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1777 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1779 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1780 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1781 the argument count is zero when checking is enabled. Instead, do
1782 the pointer arithmetic to advance past the 3 fixed operands in a
1783 CALL_EXPR. That produces a valid pointer to just past the end of the
1784 operand array, even if it's not valid to dereference it. */
1785 #define CALL_EXPR_ARGP(NODE) \
1786 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1788 /* OpenMP directive and clause accessors. */
1790 #define OMP_BODY(NODE) \
1791 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1792 #define OMP_CLAUSES(NODE) \
1793 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1795 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1796 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1798 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1799 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1801 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1802 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1803 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1805 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1806 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1807 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1808 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1809 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1810 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1812 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1813 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1815 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1817 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1818 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1820 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1822 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1824 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1825 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1827 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1828 #define OMP_CLAUSE_DECL(NODE) \
1829 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1830 OMP_CLAUSE_PRIVATE, \
1831 OMP_CLAUSE_COPYPRIVATE), 0)
1832 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1833 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1834 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1836 /* True on an OMP_SECTION statement that was the last lexical member.
1837 This status is meaningful in the implementation of lastprivate. */
1838 #define OMP_SECTION_LAST(NODE) \
1839 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1841 /* True on an OMP_PARALLEL statement if it represents an explicit
1842 combined parallel work-sharing constructs. */
1843 #define OMP_PARALLEL_COMBINED(NODE) \
1844 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1846 /* True on a PRIVATE clause if its decl is kept around for debugging
1847 information only and its DECL_VALUE_EXPR is supposed to point
1848 to what it has been remapped to. */
1849 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1850 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1852 /* True on a PRIVATE clause if ctor needs access to outer region's
1854 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1855 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1857 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1858 decl is present in the chain. */
1859 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1860 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1861 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1862 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1863 OMP_CLAUSE_LASTPRIVATE),\
1865 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1866 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1868 #define OMP_CLAUSE_IF_EXPR(NODE) \
1869 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1870 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1871 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1872 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1873 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1875 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1876 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1877 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1878 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1879 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1880 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1882 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1883 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1884 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1885 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1886 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1887 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1888 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1889 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1890 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1891 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1892 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1893 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1895 enum omp_clause_schedule_kind
1897 OMP_CLAUSE_SCHEDULE_STATIC,
1898 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1899 OMP_CLAUSE_SCHEDULE_GUIDED,
1900 OMP_CLAUSE_SCHEDULE_AUTO,
1901 OMP_CLAUSE_SCHEDULE_RUNTIME
1904 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1905 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1907 enum omp_clause_default_kind
1909 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1910 OMP_CLAUSE_DEFAULT_SHARED,
1911 OMP_CLAUSE_DEFAULT_NONE,
1912 OMP_CLAUSE_DEFAULT_PRIVATE,
1913 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1916 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1917 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1919 struct GTY(()) tree_exp {
1920 struct tree_typed typed;
1923 tree GTY ((special ("tree_exp"),
1924 desc ("TREE_CODE ((tree) &%0)")))
1928 /* SSA_NAME accessors. */
1930 /* Returns the variable being referenced. Once released, this is the
1931 only field that can be relied upon. */
1932 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1934 /* Returns the statement which defines this SSA name. */
1935 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1937 /* Returns the SSA version number of this SSA name. Note that in
1938 tree SSA, version numbers are not per variable and may be recycled. */
1939 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1941 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1942 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1944 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1945 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1947 /* Nonzero if this SSA_NAME expression is currently on the free list of
1948 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1949 has no meaning for an SSA_NAME. */
1950 #define SSA_NAME_IN_FREE_LIST(NODE) \
1951 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1953 /* Nonzero if this SSA_NAME is the default definition for the
1954 underlying symbol. A default SSA name is created for symbol S if
1955 the very first reference to S in the function is a read operation.
1956 Default definitions are always created by an empty statement and
1957 belong to no basic block. */
1958 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1959 SSA_NAME_CHECK (NODE)->base.default_def_flag
1961 /* Attributes for SSA_NAMEs for pointer-type variables. */
1962 #define SSA_NAME_PTR_INFO(N) \
1963 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1965 /* Defined in tree-flow.h. */
1966 struct ptr_info_def;
1968 /* Immediate use linking structure. This structure is used for maintaining
1969 a doubly linked list of uses of an SSA_NAME. */
1970 typedef struct GTY(()) ssa_use_operand_d {
1971 struct ssa_use_operand_d* GTY((skip(""))) prev;
1972 struct ssa_use_operand_d* GTY((skip(""))) next;
1973 /* Immediate uses for a given SSA name are maintained as a cyclic
1974 list. To recognize the root of this list, the location field
1975 needs to point to the original SSA name. Since statements and
1976 SSA names are of different data types, we need this union. See
1977 the explanation in struct immediate_use_iterator_d. */
1978 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
1979 tree *GTY((skip(""))) use;
1980 } ssa_use_operand_t;
1982 /* Return the immediate_use information for an SSA_NAME. */
1983 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1985 struct GTY(()) tree_ssa_name {
1986 struct tree_typed typed;
1988 /* _DECL wrapped by this SSA name. */
1991 /* Statement that defines this SSA name. */
1994 /* SSA version number. */
1995 unsigned int version;
1997 /* Pointer attributes used for alias analysis. */
1998 struct ptr_info_def *ptr_info;
2000 /* Immediate uses list for this SSA_NAME. */
2001 struct ssa_use_operand_d imm_uses;
2004 struct GTY(()) phi_arg_d {
2005 /* imm_use MUST be the first element in struct because we do some
2006 pointer arithmetic with it. See phi_arg_index_from_use. */
2007 struct ssa_use_operand_d imm_use;
2013 #define OMP_CLAUSE_CODE(NODE) \
2014 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2016 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2017 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2019 #define OMP_CLAUSE_CODE(NODE) \
2020 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2022 #define OMP_CLAUSE_OPERAND(NODE, I) \
2023 OMP_CLAUSE_ELT_CHECK (NODE, I)
2025 struct GTY(()) tree_omp_clause {
2026 struct tree_common common;
2028 enum omp_clause_code code;
2029 union omp_clause_subcode {
2030 enum omp_clause_default_kind default_kind;
2031 enum omp_clause_schedule_kind schedule_kind;
2032 enum tree_code reduction_code;
2033 } GTY ((skip)) subcode;
2035 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
2037 gimple_seq gimple_reduction_init;
2038 gimple_seq gimple_reduction_merge;
2040 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
2044 /* In a BLOCK node. */
2045 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2046 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2047 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2048 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2049 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
2050 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
2051 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
2052 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2053 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2054 /* Note: when changing this, make sure to find the places
2055 that use chainon or nreverse. */
2056 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
2057 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2058 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2060 /* An index number for this block. These values are not guaranteed to
2061 be unique across functions -- whether or not they are depends on
2062 the debugging output format in use. */
2063 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2065 /* If block reordering splits a lexical block into discontiguous
2066 address ranges, we'll make a copy of the original block.
2068 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2069 In that case, we have one source block that has been replicated
2070 (through inlining or unrolling) into many logical blocks, and that
2071 these logical blocks have different physical variables in them.
2073 In this case, we have one logical block split into several
2074 non-contiguous address ranges. Most debug formats can't actually
2075 represent this idea directly, so we fake it by creating multiple
2076 logical blocks with the same variables in them. However, for those
2077 that do support non-contiguous regions, these allow the original
2078 logical block to be reconstructed, along with the set of address
2081 One of the logical block fragments is arbitrarily chosen to be
2082 the ORIGIN. The other fragments will point to the origin via
2083 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2084 be null. The list of fragments will be chained through
2085 BLOCK_FRAGMENT_CHAIN from the origin. */
2087 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2088 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2090 /* For an inlined function, this gives the location where it was called
2091 from. This is only set in the top level block, which corresponds to the
2092 inlined function scope. This is used in the debug output routines. */
2094 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2096 struct GTY(()) tree_block {
2097 struct tree_common common;
2099 unsigned abstract_flag : 1;
2100 unsigned block_num : 31;
2105 VEC(tree,gc) *nonlocalized_vars;
2109 tree abstract_origin;
2110 tree fragment_origin;
2111 tree fragment_chain;
2114 /* Define fields and accessors for nodes representing data types. */
2116 /* See tree.def for documentation of the use of these fields.
2117 Look at the documentation of the various ..._TYPE tree codes.
2119 Note that the type.values, type.minval, and type.maxval fields are
2120 overloaded and used for different macros in different kinds of types.
2121 Each macro must check to ensure the tree node is of the proper kind of
2122 type. Note also that some of the front-ends also overload these fields,
2123 so they must be checked as well. */
2125 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2126 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2127 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2128 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2129 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2130 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2131 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2132 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2133 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2134 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2136 /* Vector types need to check target flags to determine type. */
2137 extern enum machine_mode vector_type_mode (const_tree);
2138 #define TYPE_MODE(NODE) \
2139 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2140 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2141 #define SET_TYPE_MODE(NODE, MODE) \
2142 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2144 /* The "canonical" type for this type node, which is used by frontends to
2145 compare the type for equality with another type. If two types are
2146 equal (based on the semantics of the language), then they will have
2147 equivalent TYPE_CANONICAL entries.
2149 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2150 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2151 be used for comparison against other types. Instead, the type is
2152 said to require structural equality checks, described in
2153 TYPE_STRUCTURAL_EQUALITY_P.
2155 For unqualified aggregate and function types the middle-end relies on
2156 TYPE_CANONICAL to tell whether two variables can be assigned
2157 to each other without a conversion. The middle-end also makes sure
2158 to assign the same alias-sets to the type partition with equal
2159 TYPE_CANONICAL of their unqualified variants. */
2160 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2161 /* Indicates that the type node requires structural equality
2162 checks. The compiler will need to look at the composition of the
2163 type to determine whether it is equal to another type, rather than
2164 just comparing canonical type pointers. For instance, we would need
2165 to look at the return and parameter types of a FUNCTION_TYPE
2167 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2168 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2169 type node requires structural equality. */
2170 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2172 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2173 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2175 /* The (language-specific) typed-based alias set for this type.
2176 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2177 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2178 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2179 type can alias objects of any type. */
2180 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2182 /* Nonzero iff the typed-based alias set for this type has been
2184 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2185 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2187 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2189 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2191 /* The alignment necessary for objects of this type.
2192 The value is an int, measured in bits. */
2193 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
2195 /* 1 if the alignment for this type was requested by "aligned" attribute,
2196 0 if it is the default for this type. */
2197 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.user_align)
2199 /* The alignment for NODE, in bytes. */
2200 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2202 /* If your language allows you to declare types, and you want debug info
2203 for them, then you need to generate corresponding TYPE_DECL nodes.
2204 These "stub" TYPE_DECL nodes have no name, and simply point at the
2205 type node. You then set the TYPE_STUB_DECL field of the type node
2206 to point back at the TYPE_DECL node. This allows the debug routines
2207 to know that the two nodes represent the same type, so that we only
2208 get one debug info record for them. */
2209 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2211 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2212 has BLKmode only because it lacks the alignment requirement for
2214 #define TYPE_NO_FORCE_BLK(NODE) \
2215 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2217 /* In an INTEGER_TYPE, it means the type represents a size. We use
2218 this both for validity checking and to permit optimizations that
2219 are unsafe for other types. Note that the C `size_t' type should
2220 *not* have this flag set. The `size_t' type is simply a typedef
2221 for an ordinary integer type that happens to be the type of an
2222 expression returned by `sizeof'; `size_t' has no special
2223 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2224 always actual sizes. */
2225 #define TYPE_IS_SIZETYPE(NODE) \
2226 (INTEGER_TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2228 /* Nonzero in a type considered volatile as a whole. */
2229 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2231 /* Means this type is const-qualified. */
2232 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2234 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2236 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2238 /* If nonzero, type's name shouldn't be emitted into debug info. */
2239 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2241 /* The address space the type is in. */
2242 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2244 /* There is a TYPE_QUAL value for each type qualifier. They can be
2245 combined by bitwise-or to form the complete set of qualifiers for a
2249 TYPE_UNQUALIFIED = 0x0,
2250 TYPE_QUAL_CONST = 0x1,
2251 TYPE_QUAL_VOLATILE = 0x2,
2252 TYPE_QUAL_RESTRICT = 0x4
2255 /* Encode/decode the named memory support as part of the qualifier. If more
2256 than 8 qualifiers are added, these macros need to be adjusted. */
2257 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2258 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2260 /* Return all qualifiers except for the address space qualifiers. */
2261 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2263 /* Only keep the address space out of the qualifiers and discard the other
2265 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2267 /* The set of type qualifiers for this type. */
2268 #define TYPE_QUALS(NODE) \
2269 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2270 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2271 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2272 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2274 /* The same as TYPE_QUALS without the address space qualifications. */
2275 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2276 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2277 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2278 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2280 /* These flags are available for each language front end to use internally. */
2281 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2282 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2283 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2284 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2285 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2286 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2287 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2289 /* Used to keep track of visited nodes in tree traversals. This is set to
2290 0 by copy_node and make_node. */
2291 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2293 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2294 that distinguish string from array of char).
2295 If set in a INTEGER_TYPE, indicates a character type. */
2296 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
2298 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2299 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2300 (((unsigned HOST_WIDE_INT) 1) \
2301 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
2303 /* Set precision to n when we have 2^n sub-parts of the vector. */
2304 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2305 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
2307 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2308 about missing conversions to other vector types of the same size. */
2309 #define TYPE_VECTOR_OPAQUE(NODE) \
2310 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2312 /* Indicates that objects of this type must be initialized by calling a
2313 function when they are created. */
2314 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2315 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2317 /* Indicates that a UNION_TYPE object should be passed the same way that
2318 the first union alternative would be passed, or that a RECORD_TYPE
2319 object should be passed the same way that the first (and only) member
2321 #define TYPE_TRANSPARENT_AGGR(NODE) \
2322 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2324 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2325 address of a component of the type. This is the counterpart of
2326 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2327 #define TYPE_NONALIASED_COMPONENT(NODE) \
2328 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2330 /* Indicated that objects of this type should be laid out in as
2331 compact a way as possible. */
2332 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.packed_flag)
2334 /* Used by type_contains_placeholder_p to avoid recomputation.
2335 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2336 this field directly. */
2337 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2338 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2340 /* The debug output functions use the symtab union field to store
2341 information specific to the debugging format. The different debug
2342 output hooks store different types in the union field. These three
2343 macros are used to access different fields in the union. The debug
2344 hooks are responsible for consistently using only a specific
2347 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2348 hold the type's number in the generated stabs. */
2349 #define TYPE_SYMTAB_ADDRESS(NODE) \
2350 (TYPE_CHECK (NODE)->type_common.symtab.address)
2352 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2353 hold struct/union type tag names. */
2354 #define TYPE_SYMTAB_POINTER(NODE) \
2355 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2357 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2358 in dwarf2out.c to point to the DIE generated for the type. */
2359 #define TYPE_SYMTAB_DIE(NODE) \
2360 (TYPE_CHECK (NODE)->type_common.symtab.die)
2362 /* The garbage collector needs to know the interpretation of the
2363 symtab field. These constants represent the different types in the
2366 #define TYPE_SYMTAB_IS_ADDRESS (0)
2367 #define TYPE_SYMTAB_IS_POINTER (1)
2368 #define TYPE_SYMTAB_IS_DIE (2)
2372 struct GTY(()) tree_type_common {
2373 struct tree_common common;
2379 unsigned int precision : 10;
2380 unsigned no_force_blk_flag : 1;
2381 unsigned needs_constructing_flag : 1;
2382 unsigned transparent_aggr_flag : 1;
2383 unsigned restrict_flag : 1;
2384 unsigned contains_placeholder_bits : 2;
2386 ENUM_BITFIELD(machine_mode) mode : 8;
2388 unsigned string_flag : 1;
2389 unsigned lang_flag_0 : 1;
2390 unsigned lang_flag_1 : 1;
2391 unsigned lang_flag_2 : 1;
2392 unsigned lang_flag_3 : 1;
2393 unsigned lang_flag_4 : 1;
2394 unsigned lang_flag_5 : 1;
2395 unsigned lang_flag_6 : 1;
2398 alias_set_type alias_set;
2401 union tree_type_symtab {
2402 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address;
2403 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer;
2404 struct die_struct * GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die;
2405 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab;
2413 #define TYPE_LANG_SPECIFIC(NODE) \
2414 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2416 struct GTY(()) tree_type_with_lang_specific {
2417 struct tree_type_common common;
2418 /* Points to a structure whose details depend on the language in use. */
2419 struct lang_type *lang_specific;
2422 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2423 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2424 #define TYPE_FIELDS(NODE) \
2425 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2426 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2427 #define TYPE_ARG_TYPES(NODE) \
2428 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2429 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2431 #define TYPE_METHODS(NODE) \
2432 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2433 #define TYPE_VFIELD(NODE) \
2434 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2435 #define TYPE_METHOD_BASETYPE(NODE) \
2436 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2437 #define TYPE_OFFSET_BASETYPE(NODE) \
2438 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2439 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2440 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2441 #define TYPE_NEXT_PTR_TO(NODE) \
2442 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2443 #define TYPE_NEXT_REF_TO(NODE) \
2444 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2445 #define TYPE_MIN_VALUE(NODE) \
2446 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2447 #define TYPE_MAX_VALUE(NODE) \
2448 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2450 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2451 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2453 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2454 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2456 /* For record and union types, information about this type, as a base type
2458 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2460 /* For non record and union types, used in a language-dependent way. */
2461 #define TYPE_LANG_SLOT_1(NODE) \
2462 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2464 struct GTY(()) tree_type_non_common {
2465 struct tree_type_with_lang_specific with_lang_specific;
2472 /* Define accessor macros for information about type inheritance
2475 A "basetype" means a particular usage of a data type for inheritance
2476 in another type. Each such basetype usage has its own "binfo"
2477 object to describe it. The binfo object is a TREE_VEC node.
2479 Inheritance is represented by the binfo nodes allocated for a
2480 given type. For example, given types C and D, such that D is
2481 inherited by C, 3 binfo nodes will be allocated: one for describing
2482 the binfo properties of C, similarly one for D, and one for
2483 describing the binfo properties of D as a base type for C.
2484 Thus, given a pointer to class C, one can get a pointer to the binfo
2485 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2487 /* BINFO specific flags. */
2489 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2490 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2492 /* Flags for language dependent use. */
2493 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2494 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2495 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2496 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2497 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2498 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2499 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2501 /* The actual data type node being inherited in this basetype. */
2502 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2504 /* The offset where this basetype appears in its containing type.
2505 BINFO_OFFSET slot holds the offset (in bytes)
2506 from the base of the complete object to the base of the part of the
2507 object that is allocated on behalf of this `type'.
2508 This is always 0 except when there is multiple inheritance. */
2510 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2511 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2513 /* The virtual function table belonging to this basetype. Virtual
2514 function tables provide a mechanism for run-time method dispatching.
2515 The entries of a virtual function table are language-dependent. */
2517 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2519 /* The virtual functions in the virtual function table. This is
2520 a TREE_LIST that is used as an initial approximation for building
2521 a virtual function table for this basetype. */
2522 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2524 /* A vector of binfos for the direct basetypes inherited by this
2527 If this basetype describes type D as inherited in C, and if the
2528 basetypes of D are E and F, then this vector contains binfos for
2529 inheritance of E and F by C. */
2530 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2532 /* The number of basetypes for NODE. */
2533 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2535 /* Accessor macro to get to the Nth base binfo of this binfo. */
2536 #define BINFO_BASE_BINFO(NODE,N) \
2537 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2538 #define BINFO_BASE_ITERATE(NODE,N,B) \
2539 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2540 #define BINFO_BASE_APPEND(NODE,T) \
2541 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2543 /* For a BINFO record describing a virtual base class, i.e., one where
2544 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2545 base. The actual contents are language-dependent. In the C++
2546 front-end this field is an INTEGER_CST giving an offset into the
2547 vtable where the offset to the virtual base can be found. */
2548 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2550 /* Indicates the accesses this binfo has to its bases. The values are
2551 access_public_node, access_protected_node or access_private_node.
2552 If this array is not present, public access is implied. */
2553 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2555 #define BINFO_BASE_ACCESS(NODE,N) \
2556 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2557 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2558 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2560 /* The index in the VTT where this subobject's sub-VTT can be found.
2561 NULL_TREE if there is no sub-VTT. */
2562 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2564 /* The index in the VTT where the vptr for this subobject can be
2565 found. NULL_TREE if there is no secondary vptr in the VTT. */
2566 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2568 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2569 inheriting this base for non-virtual bases. For virtual bases it
2570 points either to the binfo for which this is a primary binfo, or to
2571 the binfo of the most derived type. */
2572 #define BINFO_INHERITANCE_CHAIN(NODE) \
2573 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2575 struct GTY (()) tree_binfo {
2576 struct tree_common common;
2582 VEC(tree,gc) *base_accesses;
2588 VEC(tree,none) base_binfos;
2592 /* Define fields and accessors for nodes representing declared names. */
2594 /* Nonzero if DECL represents a variable for the SSA passes. */
2595 #define SSA_VAR_P(DECL) \
2596 (TREE_CODE (DECL) == VAR_DECL \
2597 || TREE_CODE (DECL) == PARM_DECL \
2598 || TREE_CODE (DECL) == RESULT_DECL \
2599 || (TREE_CODE (DECL) == SSA_NAME \
2600 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2601 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2602 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2607 /* Enumerate visibility settings. */
2608 #ifndef SYMBOL_VISIBILITY_DEFINED
2609 #define SYMBOL_VISIBILITY_DEFINED
2610 enum symbol_visibility
2613 VISIBILITY_PROTECTED,
2621 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2623 /* This is the name of the object as written by the user.
2624 It is an IDENTIFIER_NODE. */
2625 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2627 /* Every ..._DECL node gets a unique number. */
2628 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2630 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2632 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2634 /* Every ..._DECL node gets a unique number that stays the same even
2635 when the decl is copied by the inliner once it is set. */
2636 #define DECL_PT_UID(NODE) \
2637 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2638 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2639 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2640 #define SET_DECL_PT_UID(NODE, UID) \
2641 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2642 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2643 be preserved when copyin the decl. */
2644 #define DECL_PT_UID_SET_P(NODE) \
2645 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2647 /* These two fields describe where in the source code the declaration
2648 was. If the declaration appears in several places (as for a C
2649 function that is declared first and then defined later), this
2650 information should refer to the definition. */
2651 #define DECL_SOURCE_LOCATION(NODE) \
2652 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2653 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2654 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2655 #define DECL_IS_BUILTIN(DECL) \
2656 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2658 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2659 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2660 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2661 nodes, this points to either the FUNCTION_DECL for the containing
2662 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2663 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2665 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2666 #define DECL_FIELD_CONTEXT(NODE) \
2667 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2669 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2670 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2672 struct GTY(()) tree_decl_minimal {
2673 struct tree_common common;
2681 /* For any sort of a ..._DECL node, this points to the original (abstract)
2682 decl node which this decl is an inlined/cloned instance of, or else it
2683 is NULL indicating that this decl is not an instance of some other decl.
2685 The C front-end also uses this in a nested declaration of an inline
2686 function, to point back to the definition. */
2687 #define DECL_ABSTRACT_ORIGIN(NODE) \
2688 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2690 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2691 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2692 #define DECL_ORIGIN(NODE) \
2693 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2695 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2696 inline instance of some original (abstract) decl from an inline function;
2697 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2698 nodes can also have their abstract origin set to themselves. */
2699 #define DECL_FROM_INLINE(NODE) \
2700 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2701 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2703 /* In a DECL this is the field where attributes are stored. */
2704 #define DECL_ATTRIBUTES(NODE) \
2705 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2707 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2708 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2709 For a VAR_DECL, holds the initial value.
2710 For a PARM_DECL, used for DECL_ARG_TYPE--default
2711 values for parameters are encoded in the type of the function,
2712 not in the PARM_DECL slot.
2713 For a FIELD_DECL, this is used for enumeration values and the C
2714 frontend uses it for temporarily storing bitwidth of bitfields.
2716 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2717 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2719 /* Holds the size of the datum, in bits, as a tree expression.
2720 Need not be constant. */
2721 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2722 /* Likewise for the size in bytes. */
2723 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2724 /* Holds the alignment required for the datum, in bits. */
2725 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2726 /* The alignment of NODE, in bytes. */
2727 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2728 /* Set if the alignment of this DECL has been set by the user, for
2729 example with an 'aligned' attribute. */
2730 #define DECL_USER_ALIGN(NODE) \
2731 (DECL_COMMON_CHECK (NODE)->base.user_align)
2732 /* Holds the machine mode corresponding to the declaration of a variable or
2733 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2735 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2737 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2738 operation it is. Note, however, that this field is overloaded, with
2739 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2740 checked before any access to the former. */
2741 #define DECL_FUNCTION_CODE(NODE) \
2742 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2743 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2744 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2746 #define DECL_FUNCTION_PERSONALITY(NODE) \
2747 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2749 /* Nonzero for a given ..._DECL node means that the name of this node should
2750 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2751 the associated type should be ignored. For a FUNCTION_DECL, the body of
2752 the function should also be ignored. */
2753 #define DECL_IGNORED_P(NODE) \
2754 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2756 /* Nonzero for a given ..._DECL node means that this node represents an
2757 "abstract instance" of the given declaration (e.g. in the original
2758 declaration of an inline function). When generating symbolic debugging
2759 information, we mustn't try to generate any address information for nodes
2760 marked as "abstract instances" because we don't actually generate
2761 any code or allocate any data space for such instances. */
2762 #define DECL_ABSTRACT(NODE) \
2763 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2765 /* Language-specific decl information. */
2766 #define DECL_LANG_SPECIFIC(NODE) \
2767 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2769 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2770 do not allocate storage, and refer to a definition elsewhere. Note that
2771 this does not necessarily imply the entity represented by NODE
2772 has no program source-level definition in this translation unit. For
2773 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2774 DECL_EXTERNAL may be true simultaneously; that can be the case for
2775 a C99 "extern inline" function. */
2776 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2778 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2779 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2781 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2783 Also set in some languages for variables, etc., outside the normal
2784 lexical scope, such as class instance variables. */
2785 #define DECL_NONLOCAL(NODE) \
2786 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2788 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2789 Used in FIELD_DECLs for vtable pointers.
2790 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2791 #define DECL_VIRTUAL_P(NODE) \
2792 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2794 /* Used to indicate that this DECL represents a compiler-generated entity. */
2795 #define DECL_ARTIFICIAL(NODE) \
2796 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2798 /* Additional flags for language-specific uses. */
2799 #define DECL_LANG_FLAG_0(NODE) \
2800 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2801 #define DECL_LANG_FLAG_1(NODE) \
2802 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2803 #define DECL_LANG_FLAG_2(NODE) \
2804 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2805 #define DECL_LANG_FLAG_3(NODE) \
2806 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2807 #define DECL_LANG_FLAG_4(NODE) \
2808 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2809 #define DECL_LANG_FLAG_5(NODE) \
2810 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2811 #define DECL_LANG_FLAG_6(NODE) \
2812 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2813 #define DECL_LANG_FLAG_7(NODE) \
2814 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2815 #define DECL_LANG_FLAG_8(NODE) \
2816 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2818 /* Nonzero for a scope which is equal to file scope. */
2819 #define SCOPE_FILE_SCOPE_P(EXP) \
2820 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2821 /* Nonzero for a decl which is at file scope. */
2822 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2823 /* Nonzero for a type which is at file scope. */
2824 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2826 /* Nonzero for a decl that is decorated using attribute used.
2827 This indicates to compiler tools that this decl needs to be preserved. */
2828 #define DECL_PRESERVE_P(DECL) \
2829 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2831 /* For function local variables of COMPLEX and VECTOR types,
2832 indicates that the variable is not aliased, and that all
2833 modifications to the variable have been adjusted so that
2834 they are killing assignments. Thus the variable may now
2835 be treated as a GIMPLE register, and use real instead of
2836 virtual ops in SSA form. */
2837 #define DECL_GIMPLE_REG_P(DECL) \
2838 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2840 struct GTY(()) tree_decl_common {
2841 struct tree_decl_minimal common;
2844 ENUM_BITFIELD(machine_mode) mode : 8;
2846 unsigned nonlocal_flag : 1;
2847 unsigned virtual_flag : 1;
2848 unsigned ignored_flag : 1;
2849 unsigned abstract_flag : 1;
2850 unsigned artificial_flag : 1;
2851 unsigned preserve_flag: 1;
2852 unsigned debug_expr_is_from : 1;
2854 unsigned lang_flag_0 : 1;
2855 unsigned lang_flag_1 : 1;
2856 unsigned lang_flag_2 : 1;
2857 unsigned lang_flag_3 : 1;
2858 unsigned lang_flag_4 : 1;
2859 unsigned lang_flag_5 : 1;
2860 unsigned lang_flag_6 : 1;
2861 unsigned lang_flag_7 : 1;
2862 unsigned lang_flag_8 : 1;
2864 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2865 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2866 unsigned decl_flag_0 : 1;
2867 /* In FIELD_DECL, this is DECL_BIT_FIELD
2868 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2869 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2870 unsigned decl_flag_1 : 1;
2871 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2872 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2873 DECL_HAS_VALUE_EXPR_P. */
2874 unsigned decl_flag_2 : 1;
2875 /* Logically, these two would go in a theoretical base shared by var and
2877 unsigned gimple_reg_flag : 1;
2878 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2879 unsigned decl_by_reference_flag : 1;
2880 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2881 unsigned decl_restricted_flag : 1;
2883 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2885 unsigned decl_read_flag : 1;
2887 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2888 unsigned decl_common_unused : 1;
2890 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2891 unsigned int off_align : 8;
2893 /* 24-bits unused. */
2895 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2898 /* UID for points-to sets, stable over copying from inlining. */
2899 unsigned int pt_uid;
2904 tree abstract_origin;
2906 /* Points to a structure whose details depend on the language in use. */
2907 struct lang_decl *lang_specific;
2910 extern tree decl_value_expr_lookup (tree);
2911 extern void decl_value_expr_insert (tree, tree);
2913 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2914 if transformations have made this more complicated than evaluating the
2915 decl itself. This should only be used for debugging; once this field has
2916 been set, the decl itself may not legitimately appear in the function. */
2917 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2918 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2919 ->decl_common.decl_flag_2)
2920 #define DECL_VALUE_EXPR(NODE) \
2921 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2922 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2923 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2925 /* Holds the RTL expression for the value of a variable or function.
2926 This value can be evaluated lazily for functions, variables with
2927 static storage duration, and labels. */
2928 #define DECL_RTL(NODE) \
2929 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2930 ? (NODE)->decl_with_rtl.rtl \
2931 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2933 /* Set the DECL_RTL for NODE to RTL. */
2934 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2936 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2937 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2939 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2940 #define DECL_RTL_SET_P(NODE) \
2941 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2943 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2944 NODE1, it will not be set for NODE2; this is a lazy copy. */
2945 #define COPY_DECL_RTL(NODE1, NODE2) \
2946 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2947 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2949 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2950 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2952 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2953 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2955 struct GTY(()) tree_decl_with_rtl {
2956 struct tree_decl_common common;
2960 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2961 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2962 of the structure. */
2963 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2965 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2966 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2967 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2968 natural alignment of the field's type). */
2969 #define DECL_FIELD_BIT_OFFSET(NODE) \
2970 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2972 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2973 if so, the type that was originally specified for it.
2974 TREE_TYPE may have been modified (in finish_struct). */
2975 #define DECL_BIT_FIELD_TYPE(NODE) \
2976 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2978 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2979 if nonzero, indicates that the field occupies the type. */
2980 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2982 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2983 DECL_FIELD_OFFSET which are known to be always zero.
2984 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2986 #define DECL_OFFSET_ALIGN(NODE) \
2987 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2989 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2990 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2991 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2993 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2994 which this FIELD_DECL is defined. This information is needed when
2995 writing debugging information about vfield and vbase decls for C++. */
2996 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2998 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2999 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.packed_flag)
3001 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3003 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3005 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3006 this component. This makes it possible for Type-Based Alias Analysis
3007 to disambiguate accesses to this field with indirect accesses using
3010 struct S { int i; } s;
3013 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3015 From the implementation's viewpoint, the alias set of the type of the
3016 field 'i' (int) will not be recorded as a subset of that of the type of
3017 's' (struct S) in record_component_aliases. The counterpart is that
3018 accesses to s.i must not be given the alias set of the type of 'i'
3019 (int) but instead directly that of the type of 's' (struct S). */
3020 #define DECL_NONADDRESSABLE_P(NODE) \
3021 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3023 struct GTY(()) tree_field_decl {
3024 struct tree_decl_common common;
3027 tree bit_field_type;
3033 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3034 dense, unique within any one function, and may be used to index arrays.
3035 If the value is -1, then no UID has been assigned. */
3036 #define LABEL_DECL_UID(NODE) \
3037 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3039 /* In a LABEL_DECL, the EH region number for which the label is the
3040 post_landing_pad. */
3041 #define EH_LANDING_PAD_NR(NODE) \
3042 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3044 /* In LABEL_DECL nodes, nonzero means that an error message about
3045 jumping into such a binding contour has been printed for this label. */
3046 #define DECL_ERROR_ISSUED(NODE) \
3047 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3049 struct GTY(()) tree_label_decl {
3050 struct tree_decl_with_rtl common;
3052 int eh_landing_pad_nr;
3056 struct GTY(()) tree_result_decl {
3057 struct tree_decl_with_rtl common;
3058 struct var_ann_d *ann;
3061 struct GTY(()) tree_const_decl {
3062 struct tree_decl_common common;
3065 /* For a PARM_DECL, records the data type used to pass the argument,
3066 which may be different from the type seen in the program. */
3067 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3069 /* For PARM_DECL, holds an RTL for the stack slot or register
3070 where the data was actually passed. */
3071 #define DECL_INCOMING_RTL(NODE) \
3072 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3074 struct GTY(()) tree_parm_decl {
3075 struct tree_decl_with_rtl common;
3077 struct var_ann_d *ann;
3081 /* Nonzero for a given ..._DECL node means that no warnings should be
3082 generated just because this node is unused. */
3083 #define DECL_IN_SYSTEM_HEADER(NODE) \
3084 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3086 /* Used to indicate that the linkage status of this DECL is not yet known,
3087 so it should not be output now. */
3088 #define DECL_DEFER_OUTPUT(NODE) \
3089 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3091 /* In a VAR_DECL that's static,
3092 nonzero if the space is in the text section. */
3093 #define DECL_IN_TEXT_SECTION(NODE) \
3094 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3096 /* In a VAR_DECL that's static,
3097 nonzero if it belongs to the global constant pool. */
3098 #define DECL_IN_CONSTANT_POOL(NODE) \
3099 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3101 /* Nonzero for a given ..._DECL node means that this node should be
3102 put in .common, if possible. If a DECL_INITIAL is given, and it
3103 is not error_mark_node, then the decl cannot be put in .common. */
3104 #define DECL_COMMON(NODE) \
3105 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3107 /* In a VAR_DECL, nonzero if the decl is a register variable with
3108 an explicit asm specification. */
3109 #define DECL_HARD_REGISTER(NODE) \
3110 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3112 /* Used to indicate that this DECL has weak linkage. */
3113 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3115 /* Used to indicate that the DECL is a dllimport. */
3116 #define DECL_DLLIMPORT_P(NODE) \
3117 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3119 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3120 not be put out unless it is needed in this translation unit.
3121 Entities like this are shared across translation units (like weak
3122 entities), but are guaranteed to be generated by any translation
3123 unit that needs them, and therefore need not be put out anywhere
3124 where they are not needed. DECL_COMDAT is just a hint to the
3125 back-end; it is up to front-ends which set this flag to ensure
3126 that there will never be any harm, other than bloat, in putting out
3127 something which is DECL_COMDAT. */
3128 #define DECL_COMDAT(NODE) \
3129 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3131 #define DECL_COMDAT_GROUP(NODE) \
3132 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3134 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3135 multiple translation units should be merged. */
3136 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3138 /* The name of the object as the assembler will see it (but before any
3139 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3140 as DECL_NAME. It is an IDENTIFIER_NODE. */
3141 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3143 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3144 This is true of all DECL nodes except FIELD_DECL. */
3145 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3146 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3148 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3149 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3151 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3152 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3153 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3155 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3156 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3157 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3159 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3160 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3161 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3162 semantics of using this macro, are different than saying:
3164 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3166 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3168 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3169 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3170 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3171 DECL_ASSEMBLER_NAME (DECL1)) \
3174 /* Records the section name in a section attribute. Used to pass
3175 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3176 #define DECL_SECTION_NAME(NODE) \
3177 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3179 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3180 this variable in a BIND_EXPR. */
3181 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3182 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3184 /* Value of the decls's visibility attribute */
3185 #define DECL_VISIBILITY(NODE) \
3186 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3188 /* Nonzero means that the decl had its visibility specified rather than
3190 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3191 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3193 /* In a VAR_DECL, the model to use if the data should be allocated from
3194 thread-local storage. */
3195 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3197 /* In a VAR_DECL, nonzero if the data should be allocated from
3198 thread-local storage. */
3199 #define DECL_THREAD_LOCAL_P(NODE) \
3200 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3202 /* In a non-local VAR_DECL with static storage duration, true if the
3203 variable has an initialization priority. If false, the variable
3204 will be initialized at the DEFAULT_INIT_PRIORITY. */
3205 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3206 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3208 /* Specify whether the section name was set by user or by
3209 compiler via -ffunction-sections. */
3210 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3211 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3213 struct GTY(()) tree_decl_with_vis {
3214 struct tree_decl_with_rtl common;
3215 tree assembler_name;
3219 /* Belong to VAR_DECL exclusively. */
3220 unsigned defer_output : 1;
3221 unsigned hard_register : 1;
3222 unsigned thread_local : 1;
3223 unsigned common_flag : 1;
3224 unsigned in_text_section : 1;
3225 unsigned in_constant_pool : 1;
3226 unsigned dllimport_flag : 1;
3227 /* Don't belong to VAR_DECL exclusively. */
3228 unsigned weak_flag : 1;
3230 unsigned seen_in_bind_expr : 1;
3231 unsigned comdat_flag : 1;
3232 ENUM_BITFIELD(symbol_visibility) visibility : 2;
3233 unsigned visibility_specified : 1;
3234 /* Belongs to VAR_DECL exclusively. */
3235 ENUM_BITFIELD(tls_model) tls_model : 3;
3237 /* Belong to FUNCTION_DECL exclusively. */
3238 unsigned init_priority_p : 1;
3239 /* Used by C++ only. Might become a generic decl flag. */
3240 unsigned shadowed_for_var_p : 1;
3241 /* When SECTION_NAME is implied by -ffunsection-section. */
3242 unsigned implicit_section_name_p : 1;
3243 /* 13 unused bits. */
3246 extern tree decl_debug_expr_lookup (tree);
3247 extern void decl_debug_expr_insert (tree, tree);
3248 /* For VAR_DECL, this is set to either an expression that it was split
3249 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3250 subexpressions that it was split into. */
3251 #define DECL_DEBUG_EXPR(NODE) \
3252 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3254 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3255 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3257 /* An initialization priority. */
3258 typedef unsigned short priority_type;
3260 extern priority_type decl_init_priority_lookup (tree);
3261 extern priority_type decl_fini_priority_lookup (tree);
3262 extern void decl_init_priority_insert (tree, priority_type);
3263 extern void decl_fini_priority_insert (tree, priority_type);
3265 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3267 #define DECL_INIT_PRIORITY(NODE) \
3268 (decl_init_priority_lookup (NODE))
3269 /* Set the initialization priority for NODE to VAL. */
3270 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3271 (decl_init_priority_insert (NODE, VAL))
3273 /* For a FUNCTION_DECL the finalization priority of NODE. */
3274 #define DECL_FINI_PRIORITY(NODE) \
3275 (decl_fini_priority_lookup (NODE))
3276 /* Set the finalization priority for NODE to VAL. */
3277 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3278 (decl_fini_priority_insert (NODE, VAL))
3280 /* The initialization priority for entities for which no explicit
3281 initialization priority has been specified. */
3282 #define DEFAULT_INIT_PRIORITY 65535
3284 /* The maximum allowed initialization priority. */
3285 #define MAX_INIT_PRIORITY 65535
3287 /* The largest priority value reserved for use by system runtime
3289 #define MAX_RESERVED_INIT_PRIORITY 100
3291 #define DECL_VAR_ANN_PTR(NODE) \
3292 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3293 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3294 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3297 struct GTY(()) tree_var_decl {
3298 struct tree_decl_with_vis common;
3299 struct var_ann_d *ann;
3303 /* This field is used to reference anything in decl.result and is meant only
3304 for use by the garbage collector. */
3305 #define DECL_RESULT_FLD(NODE) \
3306 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3308 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3309 Before the struct containing the FUNCTION_DECL is laid out,
3310 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3311 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3312 function. When the class is laid out, this pointer is changed
3313 to an INTEGER_CST node which is suitable for use as an index
3314 into the virtual function table.
3315 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3316 #define DECL_VINDEX(NODE) \
3317 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3320 tree_decl_non_common {
3321 struct tree_decl_with_vis common;
3322 /* C++ uses this in namespaces. */
3324 /* C++ uses this in templates. */
3326 /* Almost all FE's use this. */
3328 /* C++ uses this in namespaces and function_decls. */
3332 /* In FUNCTION_DECL, holds the decl for the return value. */
3333 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3335 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3336 #define DECL_UNINLINABLE(NODE) \
3337 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3339 /* In a FUNCTION_DECL, the saved representation of the body of the
3341 #define DECL_SAVED_TREE(NODE) \
3342 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3344 /* Nonzero in a FUNCTION_DECL means this function should be treated
3345 as if it were a malloc, meaning it returns a pointer that is
3347 #define DECL_IS_MALLOC(NODE) \
3348 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3350 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3351 C++ operator new, meaning that it returns a pointer for which we
3352 should not use type based aliasing. */
3353 #define DECL_IS_OPERATOR_NEW(NODE) \
3354 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3356 /* Nonzero in a FUNCTION_DECL means this function may return more
3358 #define DECL_IS_RETURNS_TWICE(NODE) \
3359 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3361 /* Nonzero in a FUNCTION_DECL means this function should be treated
3362 as "pure" function (like const function, but may read global memory). */
3363 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3365 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3366 the const or pure function may not terminate. When this is nonzero
3367 for a const or pure function, it can be dealt with by cse passes
3368 but cannot be removed by dce passes since you are not allowed to
3369 change an infinite looping program into one that terminates without
3371 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3372 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3374 /* Nonzero in a FUNCTION_DECL means this function should be treated
3375 as "novops" function (function that does not read global memory,
3376 but may have arbitrary side effects). */
3377 #define DECL_IS_NOVOPS(NODE) \
3378 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3380 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3381 at the beginning or end of execution. */
3382 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3383 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3385 #define DECL_STATIC_DESTRUCTOR(NODE) \
3386 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3388 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3389 be instrumented with calls to support routines. */
3390 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3391 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3393 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3394 disabled in this function. */
3395 #define DECL_NO_LIMIT_STACK(NODE) \
3396 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3398 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3399 #define DECL_STATIC_CHAIN(NODE) \
3400 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3402 /* Nonzero for a decl that cgraph has decided should be inlined into
3403 at least one call site. It is not meaningful to look at this
3404 directly; always use cgraph_function_possibly_inlined_p. */
3405 #define DECL_POSSIBLY_INLINED(DECL) \
3406 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3408 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3409 such as via the `inline' keyword in C/C++. This flag controls the linkage
3410 semantics of 'inline' */
3411 #define DECL_DECLARED_INLINE_P(NODE) \
3412 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3414 /* Nonzero in a FUNCTION_DECL means this function should not get
3415 -Winline warnings. */
3416 #define DECL_NO_INLINE_WARNING_P(NODE) \
3417 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3419 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3420 disregarding size and cost heuristics. This is equivalent to using
3421 the always_inline attribute without the required diagnostics if the
3422 function cannot be inlined. */
3423 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3424 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3426 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3427 that describes the status of this function. */
3428 #define DECL_STRUCT_FUNCTION(NODE) \
3429 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3431 /* In a FUNCTION_DECL, nonzero means a built in function. */
3432 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3434 /* For a builtin function, identify which part of the compiler defined it. */
3435 #define DECL_BUILT_IN_CLASS(NODE) \
3436 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3438 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3439 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3441 #define DECL_ARGUMENTS(NODE) \
3442 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3443 #define DECL_ARGUMENT_FLD(NODE) \
3444 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3446 /* In FUNCTION_DECL, the function specific target options to use when compiling
3448 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3449 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3451 /* In FUNCTION_DECL, the function specific optimization options to use when
3452 compiling this function. */
3453 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3454 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3456 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3457 arguments/result/saved_tree fields by front ends. It was either inherit
3458 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3459 which seemed a bit strange. */
3461 struct GTY(()) tree_function_decl {
3462 struct tree_decl_non_common common;
3466 /* The personality function. Used for stack unwinding. */
3469 /* Function specific options that are used by this function. */
3470 tree function_specific_target; /* target options */
3471 tree function_specific_optimization; /* optimization options */
3473 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3474 DECL_FUNCTION_CODE. Otherwise unused.
3475 ??? The bitfield needs to be able to hold all target function
3477 ENUM_BITFIELD(built_in_function) function_code : 11;
3478 ENUM_BITFIELD(built_in_class) built_in_class : 2;
3480 unsigned static_ctor_flag : 1;
3481 unsigned static_dtor_flag : 1;
3482 unsigned uninlinable : 1;
3484 unsigned possibly_inlined : 1;
3485 unsigned novops_flag : 1;
3486 unsigned returns_twice_flag : 1;
3487 unsigned malloc_flag : 1;
3488 unsigned operator_new_flag : 1;
3489 unsigned declared_inline_flag : 1;
3490 unsigned regdecl_flag : 1;
3492 unsigned no_inline_warning_flag : 1;
3493 unsigned no_instrument_function_entry_exit : 1;
3494 unsigned no_limit_stack : 1;
3495 unsigned disregard_inline_limits : 1;
3496 unsigned pure_flag : 1;
3497 unsigned looping_const_or_pure_flag : 1;
3503 /* The source language of the translation-unit. */
3504 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3505 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3507 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3509 struct GTY(()) tree_translation_unit_decl {
3510 struct tree_decl_common common;
3511 /* Source language of this translation unit. Used for DWARF output. */
3512 const char * GTY((skip(""))) language;
3513 /* TODO: Non-optimization used to build this translation unit. */
3514 /* TODO: Root of a partial DWARF tree for global types and decls. */
3517 /* A vector of all translation-units. */
3518 extern GTY (()) VEC(tree,gc) *all_translation_units;
3520 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3521 #define DECL_ORIGINAL_TYPE(NODE) \
3522 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3524 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3525 into stabs. Instead it will generate cross reference ('x') of names.
3526 This uses the same flag as DECL_EXTERNAL. */
3527 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3528 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3530 /* Getter of the imported declaration associated to the
3531 IMPORTED_DECL node. */
3532 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3533 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3535 struct GTY(()) tree_type_decl {
3536 struct tree_decl_non_common common;
3540 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3541 To reduce overhead, the nodes containing the statements are not trees.
3542 This avoids the overhead of tree_common on all linked list elements.
3544 Use the interface in tree-iterator.h to access this node. */
3546 #define STATEMENT_LIST_HEAD(NODE) \
3547 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3548 #define STATEMENT_LIST_TAIL(NODE) \
3549 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3551 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3553 struct tree_statement_list_node *prev;
3554 struct tree_statement_list_node *next;
3558 struct GTY(()) tree_statement_list
3560 struct tree_common common;
3561 struct tree_statement_list_node *head;
3562 struct tree_statement_list_node *tail;
3566 /* Optimization options used by a function. */
3568 struct GTY(()) tree_optimization_option {
3569 struct tree_common common;
3571 /* The optimization options used by the user. */
3572 struct cl_optimization opts;
3575 #define TREE_OPTIMIZATION(NODE) \
3576 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3578 /* Return a tree node that encapsulates the current optimization options. */
3579 extern tree build_optimization_node (void);
3581 /* Target options used by a function. */
3583 struct GTY(()) tree_target_option {
3584 struct tree_common common;
3586 /* The optimization options used by the user. */
3587 struct cl_target_option opts;
3590 #define TREE_TARGET_OPTION(NODE) \
3591 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3593 /* Return a tree node that encapsulates the current target options. */
3594 extern tree build_target_option_node (void);
3597 /* Define the overall contents of a tree node.
3598 It may be any of the structures declared above
3599 for various types of node. */
3601 union GTY ((ptr_alias (union lang_tree_node),
3602 desc ("tree_node_structure (&%h)"), variable_size)) tree_node {
3603 struct tree_base GTY ((tag ("TS_BASE"))) base;
3604 struct tree_typed GTY ((tag ("TS_TYPED"))) typed;
3605 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3606 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3607 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
3608 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
3609 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3610 struct tree_string GTY ((tag ("TS_STRING"))) string;
3611 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3612 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
3613 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3614 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3615 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3616 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3617 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3618 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3619 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3620 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3621 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3622 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3623 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3624 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3625 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
3626 struct tree_translation_unit_decl GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3627 translation_unit_decl;
3628 struct tree_type_common GTY ((tag ("TS_TYPE_COMMON"))) type_common;
3629 struct tree_type_with_lang_specific GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC")))
3630 type_with_lang_specific;
3631 struct tree_type_non_common GTY ((tag ("TS_TYPE_NON_COMMON")))
3633 struct tree_list GTY ((tag ("TS_LIST"))) list;
3634 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3635 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
3636 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
3637 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
3638 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
3639 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
3640 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
3641 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
3642 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3643 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
3646 /* Standard named or nameless data types of the C compiler. */
3669 TI_INTEGER_MINUS_ONE,
3686 TI_COMPLEX_INTEGER_TYPE,
3687 TI_COMPLEX_FLOAT_TYPE,
3688 TI_COMPLEX_DOUBLE_TYPE,
3689 TI_COMPLEX_LONG_DOUBLE_TYPE,
3693 TI_LONG_DOUBLE_TYPE,
3697 TI_LONG_DOUBLE_PTR_TYPE,
3698 TI_INTEGER_PTR_TYPE,
3707 TI_VA_LIST_GPR_COUNTER_FIELD,
3708 TI_VA_LIST_FPR_COUNTER_FIELD,
3715 TI_DFLOAT32_PTR_TYPE,
3716 TI_DFLOAT64_PTR_TYPE,
3717 TI_DFLOAT128_PTR_TYPE,
3726 TI_SAT_LLFRACT_TYPE,
3727 TI_SAT_USFRACT_TYPE,
3729 TI_SAT_ULFRACT_TYPE,
3730 TI_SAT_ULLFRACT_TYPE,
3742 TI_SAT_LLACCUM_TYPE,
3743 TI_SAT_USACCUM_TYPE,
3745 TI_SAT_ULACCUM_TYPE,
3746 TI_SAT_ULLACCUM_TYPE,
3792 TI_OPTIMIZATION_DEFAULT,
3793 TI_OPTIMIZATION_CURRENT,
3794 TI_TARGET_OPTION_DEFAULT,
3795 TI_TARGET_OPTION_CURRENT,
3796 TI_CURRENT_TARGET_PRAGMA,
3797 TI_CURRENT_OPTIMIZE_PRAGMA,
3802 extern GTY(()) tree global_trees[TI_MAX];
3804 #define error_mark_node global_trees[TI_ERROR_MARK]
3806 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3807 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3808 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3809 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3810 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3812 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3813 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3814 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3815 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3816 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3818 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3819 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3821 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3822 #define integer_one_node global_trees[TI_INTEGER_ONE]
3823 #define integer_three_node global_trees[TI_INTEGER_THREE]
3824 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3825 #define size_zero_node global_trees[TI_SIZE_ZERO]
3826 #define size_one_node global_trees[TI_SIZE_ONE]
3827 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3828 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3829 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3831 /* Base access nodes. */
3832 #define access_public_node global_trees[TI_PUBLIC]
3833 #define access_protected_node global_trees[TI_PROTECTED]
3834 #define access_private_node global_trees[TI_PRIVATE]
3836 #define null_pointer_node global_trees[TI_NULL_POINTER]
3838 #define float_type_node global_trees[TI_FLOAT_TYPE]
3839 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3840 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3842 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3843 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3844 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3845 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3847 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3848 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3849 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3850 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3852 #define void_type_node global_trees[TI_VOID_TYPE]
3853 /* The C type `void *'. */
3854 #define ptr_type_node global_trees[TI_PTR_TYPE]
3855 /* The C type `const void *'. */
3856 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3857 /* The C type `size_t'. */
3858 #define size_type_node global_trees[TI_SIZE_TYPE]
3859 #define pid_type_node global_trees[TI_PID_TYPE]
3860 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3861 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3862 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3863 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3864 /* The C type `FILE *'. */
3865 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3867 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3868 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3869 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3871 /* The decimal floating point types. */
3872 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3873 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3874 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3875 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3876 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3877 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3879 /* The fixed-point types. */
3880 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3881 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3882 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3883 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3884 #define sat_unsigned_short_fract_type_node \
3885 global_trees[TI_SAT_USFRACT_TYPE]
3886 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3887 #define sat_unsigned_long_fract_type_node \
3888 global_trees[TI_SAT_ULFRACT_TYPE]
3889 #define sat_unsigned_long_long_fract_type_node \
3890 global_trees[TI_SAT_ULLFRACT_TYPE]
3891 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3892 #define fract_type_node global_trees[TI_FRACT_TYPE]
3893 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3894 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3895 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3896 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3897 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3898 #define unsigned_long_long_fract_type_node \
3899 global_trees[TI_ULLFRACT_TYPE]
3900 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3901 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3902 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3903 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3904 #define sat_unsigned_short_accum_type_node \
3905 global_trees[TI_SAT_USACCUM_TYPE]
3906 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3907 #define sat_unsigned_long_accum_type_node \
3908 global_trees[TI_SAT_ULACCUM_TYPE]
3909 #define sat_unsigned_long_long_accum_type_node \
3910 global_trees[TI_SAT_ULLACCUM_TYPE]
3911 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3912 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3913 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3914 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3915 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3916 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3917 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3918 #define unsigned_long_long_accum_type_node \
3919 global_trees[TI_ULLACCUM_TYPE]
3920 #define qq_type_node global_trees[TI_QQ_TYPE]
3921 #define hq_type_node global_trees[TI_HQ_TYPE]
3922 #define sq_type_node global_trees[TI_SQ_TYPE]
3923 #define dq_type_node global_trees[TI_DQ_TYPE]
3924 #define tq_type_node global_trees[TI_TQ_TYPE]
3925 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3926 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3927 #define usq_type_node global_trees[TI_USQ_TYPE]
3928 #define udq_type_node global_trees[TI_UDQ_TYPE]
3929 #define utq_type_node global_trees[TI_UTQ_TYPE]
3930 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3931 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3932 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3933 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3934 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3935 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3936 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3937 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3938 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3939 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3940 #define ha_type_node global_trees[TI_HA_TYPE]
3941 #define sa_type_node global_trees[TI_SA_TYPE]
3942 #define da_type_node global_trees[TI_DA_TYPE]
3943 #define ta_type_node global_trees[TI_TA_TYPE]
3944 #define uha_type_node global_trees[TI_UHA_TYPE]
3945 #define usa_type_node global_trees[TI_USA_TYPE]
3946 #define uda_type_node global_trees[TI_UDA_TYPE]
3947 #define uta_type_node global_trees[TI_UTA_TYPE]
3948 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3949 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3950 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3951 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3952 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3953 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3954 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3955 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3957 /* The node that should be placed at the end of a parameter list to
3958 indicate that the function does not take a variable number of
3959 arguments. The TREE_VALUE will be void_type_node and there will be
3960 no TREE_CHAIN. Language-independent code should not assume
3961 anything else about this node. */
3962 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3964 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3965 #define MAIN_NAME_P(NODE) \
3966 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3968 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3970 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3971 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3973 /* Default/current target options (TARGET_OPTION_NODE). */
3974 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3975 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3977 /* Default tree list option(), optimize() pragmas to be linked into the
3979 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3980 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3982 /* An enumeration of the standard C integer types. These must be
3983 ordered so that shorter types appear before longer ones, and so
3984 that signed types appear before unsigned ones, for the correct
3985 functioning of interpret_integer() in c-lex.c. */
3986 enum integer_type_kind
3998 itk_unsigned_long_long,
4000 itk_unsigned_int128,
4004 typedef enum integer_type_kind integer_type_kind;
4006 /* The standard C integer types. Use integer_type_kind to index into
4008 extern GTY(()) tree integer_types[itk_none];
4010 #define char_type_node integer_types[itk_char]
4011 #define signed_char_type_node integer_types[itk_signed_char]
4012 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4013 #define short_integer_type_node integer_types[itk_short]
4014 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4015 #define integer_type_node integer_types[itk_int]
4016 #define unsigned_type_node integer_types[itk_unsigned_int]
4017 #define long_integer_type_node integer_types[itk_long]
4018 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4019 #define long_long_integer_type_node integer_types[itk_long_long]
4020 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4021 #define int128_integer_type_node integer_types[itk_int128]
4022 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
4024 /* A pointer-to-function member type looks like:
4031 If __pfn is NULL, it is a NULL pointer-to-member-function.
4033 (Because the vtable is always the first thing in the object, we
4034 don't need its offset.) If the function is virtual, then PFN is
4035 one plus twice the index into the vtable; otherwise, it is just a
4036 pointer to the function.
4038 Unfortunately, using the lowest bit of PFN doesn't work in
4039 architectures that don't impose alignment requirements on function
4040 addresses, or that use the lowest bit to tell one ISA from another,
4041 for example. For such architectures, we use the lowest bit of
4042 DELTA instead of the lowest bit of the PFN, and DELTA will be
4045 enum ptrmemfunc_vbit_where_t
4047 ptrmemfunc_vbit_in_pfn,
4048 ptrmemfunc_vbit_in_delta
4051 #define NULL_TREE (tree) NULL
4053 extern tree decl_assembler_name (tree);
4054 extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
4055 extern hashval_t decl_assembler_name_hash (const_tree asmname);
4057 /* Compute the number of bytes occupied by 'node'. This routine only
4058 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4060 extern size_t tree_size (const_tree);
4062 /* Compute the number of bytes occupied by a tree with code CODE. This
4063 function cannot be used for TREE_VEC codes, which are of variable
4065 extern size_t tree_code_size (enum tree_code);
4067 /* Allocate and return a new UID from the DECL_UID namespace. */
4068 extern int allocate_decl_uid (void);
4070 /* Lowest level primitive for allocating a node.
4071 The TREE_CODE is the only argument. Contents are initialized
4072 to zero except for a few of the common fields. */
4074 extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
4075 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
4077 /* Make a copy of a node, with all the same contents. */
4079 extern tree copy_node_stat (tree MEM_STAT_DECL);
4080 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
4082 /* Make a copy of a chain of TREE_LIST nodes. */
4084 extern tree copy_list (tree);
4086 /* Make a CASE_LABEL_EXPR. */
4088 extern tree build_case_label (tree, tree, tree);
4091 extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
4092 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
4094 /* Make a TREE_VEC. */
4096 extern tree make_tree_vec_stat (int MEM_STAT_DECL);
4097 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
4099 /* Return the (unique) IDENTIFIER_NODE node for a given name.
4100 The name is supplied as a char *. */
4102 extern tree get_identifier (const char *);
4104 #if GCC_VERSION >= 3000
4105 #define get_identifier(str) \
4106 (__builtin_constant_p (str) \
4107 ? get_identifier_with_length ((str), strlen (str)) \
4108 : get_identifier (str))
4112 /* Identical to get_identifier, except that the length is assumed
4115 extern tree get_identifier_with_length (const char *, size_t);
4117 /* If an identifier with the name TEXT (a null-terminated string) has
4118 previously been referred to, return that node; otherwise return
4121 extern tree maybe_get_identifier (const char *);
4123 /* Construct various types of nodes. */
4125 extern tree build_nt (enum tree_code, ...);
4126 extern tree build_nt_call_vec (tree, VEC(tree,gc) *);
4128 extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
4129 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4130 extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4131 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4132 extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4133 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4134 extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4135 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4136 extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
4137 tree MEM_STAT_DECL);
4138 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4139 extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
4140 tree MEM_STAT_DECL);
4141 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4142 extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
4143 tree, tree MEM_STAT_DECL);
4144 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4145 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4147 /* _loc versions of build[1-6]. */
4150 build1_stat_loc (location_t loc, enum tree_code code, tree type,
4151 tree arg1 MEM_STAT_DECL)
4153 tree t = build1_stat (code, type, arg1 PASS_MEM_STAT);
4154 if (CAN_HAVE_LOCATION_P (t))
4155 SET_EXPR_LOCATION (t, loc);
4158 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4161 build2_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4162 tree arg1 MEM_STAT_DECL)
4164 tree t = build2_stat (code, type, arg0, arg1 PASS_MEM_STAT);
4165 if (CAN_HAVE_LOCATION_P (t))
4166 SET_EXPR_LOCATION (t, loc);
4169 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4172 build3_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4173 tree arg1, tree arg2 MEM_STAT_DECL)
4175 tree t = build3_stat (code, type, arg0, arg1, arg2 PASS_MEM_STAT);
4176 if (CAN_HAVE_LOCATION_P (t))
4177 SET_EXPR_LOCATION (t, loc);
4180 #define build3_loc(l,c,t1,t2,t3,t4) \
4181 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4184 build4_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4185 tree arg1, tree arg2, tree arg3 MEM_STAT_DECL)
4187 tree t = build4_stat (code, type, arg0, arg1, arg2, arg3 PASS_MEM_STAT);
4188 if (CAN_HAVE_LOCATION_P (t))
4189 SET_EXPR_LOCATION (t, loc);
4192 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4193 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4196 build5_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4197 tree arg1, tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
4199 tree t = build5_stat (code, type, arg0, arg1, arg2, arg3,
4200 arg4 PASS_MEM_STAT);
4201 if (CAN_HAVE_LOCATION_P (t))
4202 SET_EXPR_LOCATION (t, loc);
4205 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4206 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4209 build6_stat_loc (location_t loc, enum tree_code code, tree type, tree arg0,
4210 tree arg1, tree arg2, tree arg3, tree arg4,
4211 tree arg5 MEM_STAT_DECL)
4213 tree t = build6_stat (code, type, arg0, arg1, arg2, arg3, arg4,
4214 arg5 PASS_MEM_STAT);
4215 if (CAN_HAVE_LOCATION_P (t))
4216 SET_EXPR_LOCATION (t, loc);
4219 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \
4220 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4222 extern tree build_var_debug_value_stat (tree, tree MEM_STAT_DECL);
4223 #define build_var_debug_value(t1,t2) \
4224 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4226 /* Constructs double_int from tree CST. */
4228 static inline double_int
4229 tree_to_double_int (const_tree cst)
4231 return TREE_INT_CST (cst);
4234 extern tree double_int_to_tree (tree, double_int);
4235 extern bool double_int_fits_to_tree_p (const_tree, double_int);
4236 extern tree force_fit_type_double (tree, double_int, int, bool);
4238 /* Create an INT_CST node with a CST value zero extended. */
4241 build_int_cstu (tree type, unsigned HOST_WIDE_INT cst)
4243 return double_int_to_tree (type, uhwi_to_double_int (cst));
4246 extern tree build_int_cst (tree, HOST_WIDE_INT);
4247 extern tree build_int_cst_type (tree, HOST_WIDE_INT);
4248 extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
4249 extern tree build_vector (tree, tree);
4250 extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
4251 extern tree build_vector_from_val (tree, tree);
4252 extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
4253 extern tree build_constructor_single (tree, tree, tree);
4254 extern tree build_constructor_from_list (tree, tree);
4255 extern tree build_real_from_int_cst (tree, const_tree);
4256 extern tree build_complex (tree, tree, tree);
4257 extern tree build_one_cst (tree);
4258 extern tree build_zero_cst (tree);
4259 extern tree build_string (int, const char *);
4260 extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
4261 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4262 extern tree build_tree_list_vec_stat (const VEC(tree,gc) * MEM_STAT_DECL);
4263 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4264 extern tree build_decl_stat (location_t, enum tree_code,
4265 tree, tree MEM_STAT_DECL);
4266 extern tree build_fn_decl (const char *, tree);
4267 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4268 extern tree build_translation_unit_decl (tree);
4269 extern tree build_block (tree, tree, tree, tree);
4270 extern tree build_empty_stmt (location_t);
4271 extern tree build_omp_clause (location_t, enum omp_clause_code);
4273 extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
4274 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4276 extern tree build_call_nary (tree, tree, int, ...);
4277 extern tree build_call_valist (tree, tree, int, va_list);
4278 #define build_call_array(T1,T2,N,T3)\
4279 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4280 extern tree build_call_array_loc (location_t, tree, tree, int, const tree *);
4281 extern tree build_call_vec (tree, tree, VEC(tree,gc) *);
4283 /* Construct various nodes representing data types. */
4285 extern tree make_signed_type (int);
4286 extern tree make_unsigned_type (int);
4287 extern tree signed_or_unsigned_type_for (int, tree);
4288 extern tree signed_type_for (tree);
4289 extern tree unsigned_type_for (tree);
4290 extern void initialize_sizetypes (void);
4291 extern void set_sizetype (tree);
4292 extern void fixup_unsigned_type (tree);
4293 extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
4294 extern tree build_pointer_type (tree);
4295 extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
4296 extern tree build_reference_type (tree);
4297 extern tree build_vector_type_for_mode (tree, enum machine_mode);
4298 extern tree build_vector_type (tree innertype, int nunits);
4299 extern tree build_opaque_vector_type (tree innertype, int nunits);
4300 extern tree build_type_no_quals (tree);
4301 extern tree build_index_type (tree);
4302 extern tree build_array_type (tree, tree);
4303 extern tree build_nonshared_array_type (tree, tree);
4304 extern tree build_array_type_nelts (tree, unsigned HOST_WIDE_INT);
4305 extern tree build_function_type (tree, tree);
4306 extern tree build_function_type_list (tree, ...);
4307 extern tree build_function_type_skip_args (tree, bitmap);
4308 extern tree build_function_decl_skip_args (tree, bitmap);
4309 extern tree build_varargs_function_type_list (tree, ...);
4310 extern tree build_function_type_array (tree, int, tree *);
4311 extern tree build_varargs_function_type_array (tree, int, tree *);
4312 #define build_function_type_vec(RET, V) \
4313 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V))
4314 #define build_varargs_function_type_vec(RET, V) \
4315 build_varargs_function_type_array (RET, VEC_length (tree, V), \
4316 VEC_address (tree, V))
4317 extern tree build_method_type_directly (tree, tree, tree);
4318 extern tree build_method_type (tree, tree);
4319 extern tree build_offset_type (tree, tree);
4320 extern tree build_complex_type (tree);
4321 extern tree array_type_nelts (const_tree);
4322 extern bool in_array_bounds_p (tree);
4323 extern bool range_in_array_bounds_p (tree);
4325 extern tree value_member (tree, tree);
4326 extern tree purpose_member (const_tree, tree);
4327 extern bool vec_member (const_tree, VEC(tree,gc) *);
4328 extern tree chain_index (int, tree);
4330 extern int attribute_list_equal (const_tree, const_tree);
4331 extern int attribute_list_contained (const_tree, const_tree);
4332 extern int tree_int_cst_equal (const_tree, const_tree);
4333 extern int tree_int_cst_lt (const_tree, const_tree);
4334 extern int tree_int_cst_compare (const_tree, const_tree);
4335 extern int host_integerp (const_tree, int)
4336 #ifndef ENABLE_TREE_CHECKING
4337 ATTRIBUTE_PURE /* host_integerp is pure only when checking is disabled. */
4340 extern HOST_WIDE_INT tree_low_cst (const_tree, int);
4341 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4342 extern inline __attribute__ ((__gnu_inline__)) HOST_WIDE_INT
4343 tree_low_cst (const_tree t, int pos)
4345 gcc_assert (host_integerp (t, pos));
4346 return TREE_INT_CST_LOW (t);
4349 extern int tree_int_cst_msb (const_tree);
4350 extern int tree_int_cst_sgn (const_tree);
4351 extern int tree_int_cst_sign_bit (const_tree);
4352 extern unsigned int tree_int_cst_min_precision (tree, bool);
4353 extern bool tree_expr_nonnegative_p (tree);
4354 extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
4355 extern bool may_negate_without_overflow_p (const_tree);
4356 extern tree strip_array_types (tree);
4357 extern tree excess_precision_type (tree);
4359 /* Construct various nodes representing fract or accum data types. */
4361 extern tree make_fract_type (int, int, int);
4362 extern tree make_accum_type (int, int, int);
4364 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4365 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4366 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4367 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4368 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4369 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4370 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4371 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4373 #define make_or_reuse_signed_fract_type(P) \
4374 make_or_reuse_fract_type (P, 0, 0)
4375 #define make_or_reuse_unsigned_fract_type(P) \
4376 make_or_reuse_fract_type (P, 1, 0)
4377 #define make_or_reuse_sat_signed_fract_type(P) \
4378 make_or_reuse_fract_type (P, 0, 1)
4379 #define make_or_reuse_sat_unsigned_fract_type(P) \
4380 make_or_reuse_fract_type (P, 1, 1)
4381 #define make_or_reuse_signed_accum_type(P) \
4382 make_or_reuse_accum_type (P, 0, 0)
4383 #define make_or_reuse_unsigned_accum_type(P) \
4384 make_or_reuse_accum_type (P, 1, 0)
4385 #define make_or_reuse_sat_signed_accum_type(P) \
4386 make_or_reuse_accum_type (P, 0, 1)
4387 #define make_or_reuse_sat_unsigned_accum_type(P) \
4388 make_or_reuse_accum_type (P, 1, 1)
4390 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4391 put the prototype here. Rtl.h does declare the prototype if
4392 tree.h had been included. */
4394 extern tree make_tree (tree, rtx);
4396 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4399 Such modified types already made are recorded so that duplicates
4402 extern tree build_type_attribute_variant (tree, tree);
4403 extern tree build_decl_attribute_variant (tree, tree);
4404 extern tree build_type_attribute_qual_variant (tree, tree, int);
4406 /* Return 0 if the attributes for two types are incompatible, 1 if they
4407 are compatible, and 2 if they are nearly compatible (which causes a
4408 warning to be generated). */
4409 extern int comp_type_attributes (const_tree, const_tree);
4411 /* Structure describing an attribute and a function to handle it. */
4412 struct attribute_spec
4414 /* The name of the attribute (without any leading or trailing __),
4415 or NULL to mark the end of a table of attributes. */
4416 const char *const name;
4417 /* The minimum length of the list of arguments of the attribute. */
4418 const int min_length;
4419 /* The maximum length of the list of arguments of the attribute
4420 (-1 for no maximum). */
4421 const int max_length;
4422 /* Whether this attribute requires a DECL. If it does, it will be passed
4423 from types of DECLs, function return types and array element types to
4424 the DECLs, function types and array types respectively; but when
4425 applied to a type in any other circumstances, it will be ignored with
4426 a warning. (If greater control is desired for a given attribute,
4427 this should be false, and the flags argument to the handler may be
4428 used to gain greater control in that case.) */
4429 const bool decl_required;
4430 /* Whether this attribute requires a type. If it does, it will be passed
4431 from a DECL to the type of that DECL. */
4432 const bool type_required;
4433 /* Whether this attribute requires a function (or method) type. If it does,
4434 it will be passed from a function pointer type to the target type,
4435 and from a function return type (which is not itself a function
4436 pointer type) to the function type. */
4437 const bool function_type_required;
4438 /* Function to handle this attribute. NODE points to the node to which
4439 the attribute is to be applied. If a DECL, it should be modified in
4440 place; if a TYPE, a copy should be created. NAME is the name of the
4441 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4442 of the arguments (which may be NULL). FLAGS gives further information
4443 about the context of the attribute. Afterwards, the attributes will
4444 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4445 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4446 as well as in any other cases when the attributes should not be added
4447 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4448 applied to another type or DECL later may be returned;
4449 otherwise the return value should be NULL_TREE. This pointer may be
4450 NULL if no special handling is required beyond the checks implied
4451 by the rest of this structure. */
4452 tree (*const handler) (tree *node, tree name, tree args,
4453 int flags, bool *no_add_attrs);
4454 /* Specifies if attribute affects type's identity. */
4455 const bool affects_type_identity;
4458 /* Flags that may be passed in the third argument of decl_attributes, and
4459 to handler functions for attributes. */
4460 enum attribute_flags
4462 /* The type passed in is the type of a DECL, and any attributes that
4463 should be passed in again to be applied to the DECL rather than the
4464 type should be returned. */
4465 ATTR_FLAG_DECL_NEXT = 1,
4466 /* The type passed in is a function return type, and any attributes that
4467 should be passed in again to be applied to the function type rather
4468 than the return type should be returned. */
4469 ATTR_FLAG_FUNCTION_NEXT = 2,
4470 /* The type passed in is an array element type, and any attributes that
4471 should be passed in again to be applied to the array type rather
4472 than the element type should be returned. */
4473 ATTR_FLAG_ARRAY_NEXT = 4,
4474 /* The type passed in is a structure, union or enumeration type being
4475 created, and should be modified in place. */
4476 ATTR_FLAG_TYPE_IN_PLACE = 8,
4477 /* The attributes are being applied by default to a library function whose
4478 name indicates known behavior, and should be silently ignored if they
4479 are not in fact compatible with the function type. */
4480 ATTR_FLAG_BUILT_IN = 16
4483 /* Default versions of target-overridable functions. */
4485 extern tree merge_decl_attributes (tree, tree);
4486 extern tree merge_type_attributes (tree, tree);
4488 /* Given a tree node and a string, return nonzero if the tree node is
4489 a valid attribute name for the string. */
4491 extern int is_attribute_p (const char *, const_tree);
4493 /* Given an attribute name and a list of attributes, return the list element
4494 of the attribute or NULL_TREE if not found. */
4496 extern tree lookup_attribute (const char *, tree);
4498 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4501 extern tree remove_attribute (const char *, tree);
4503 /* Given two attributes lists, return a list of their union. */
4505 extern tree merge_attributes (tree, tree);
4507 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4508 /* Given two Windows decl attributes lists, possibly including
4509 dllimport, return a list of their union . */
4510 extern tree merge_dllimport_decl_attributes (tree, tree);
4512 /* Handle a "dllimport" or "dllexport" attribute. */
4513 extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
4516 /* Check whether CAND is suitable to be returned from get_qualified_type
4517 (BASE, TYPE_QUALS). */
4519 extern bool check_qualified_type (const_tree, const_tree, int);
4521 /* Return a version of the TYPE, qualified as indicated by the
4522 TYPE_QUALS, if one exists. If no qualified version exists yet,
4523 return NULL_TREE. */
4525 extern tree get_qualified_type (tree, int);
4527 /* Like get_qualified_type, but creates the type if it does not
4528 exist. This function never returns NULL_TREE. */
4530 extern tree build_qualified_type (tree, int);
4532 /* Create a variant of type T with alignment ALIGN. */
4534 extern tree build_aligned_type (tree, unsigned int);
4536 /* Like build_qualified_type, but only deals with the `const' and
4537 `volatile' qualifiers. This interface is retained for backwards
4538 compatibility with the various front-ends; new code should use
4539 build_qualified_type instead. */
4541 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4542 build_qualified_type ((TYPE), \
4543 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4544 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4546 /* Make a copy of a type node. */
4548 extern tree build_distinct_type_copy (tree);
4549 extern tree build_variant_type_copy (tree);
4551 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4552 fields. Optionally specify an alignment, and then lay it out. */
4554 extern void finish_builtin_struct (tree, const char *,
4557 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4558 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4559 node, does nothing except for the first time. */
4561 extern void layout_type (tree);
4563 /* These functions allow a front-end to perform a manual layout of a
4564 RECORD_TYPE. (For instance, if the placement of subsequent fields
4565 depends on the placement of fields so far.) Begin by calling
4566 start_record_layout. Then, call place_field for each of the
4567 fields. Then, call finish_record_layout. See layout_type for the
4568 default way in which these functions are used. */
4570 typedef struct record_layout_info_s
4572 /* The RECORD_TYPE that we are laying out. */
4574 /* The offset into the record so far, in bytes, not including bits in
4577 /* The last known alignment of SIZE. */
4578 unsigned int offset_align;
4579 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4581 /* The alignment of the record so far, in bits. */
4582 unsigned int record_align;
4583 /* The alignment of the record so far, ignoring #pragma pack and
4584 __attribute__ ((packed)), in bits. */
4585 unsigned int unpacked_align;
4586 /* The previous field layed out. */
4588 /* The static variables (i.e., class variables, as opposed to
4589 instance variables) encountered in T. */
4590 VEC(tree,gc) *pending_statics;
4591 /* Bits remaining in the current alignment group */
4592 int remaining_in_alignment;
4593 /* True if we've seen a packed field that didn't have normal
4594 alignment anyway. */
4595 int packed_maybe_necessary;
4596 } *record_layout_info;
4598 extern record_layout_info start_record_layout (tree);
4599 extern tree bit_from_pos (tree, tree);
4600 extern tree byte_from_pos (tree, tree);
4601 extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4602 extern void normalize_offset (tree *, tree *, unsigned int);
4603 extern tree rli_size_unit_so_far (record_layout_info);
4604 extern tree rli_size_so_far (record_layout_info);
4605 extern void normalize_rli (record_layout_info);
4606 extern void place_field (record_layout_info, tree);
4607 extern void compute_record_mode (tree);
4608 extern void finish_record_layout (record_layout_info, int);
4610 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4611 return a canonicalized ..._TYPE node, so that duplicates are not made.
4612 How the hash code is computed is up to the caller, as long as any two
4613 callers that could hash identical-looking type nodes agree. */
4615 extern tree type_hash_canon (unsigned int, tree);
4617 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4618 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4619 fields. Call this only once for any given decl node.
4621 Second argument is the boundary that this field can be assumed to
4622 be starting at (in bits). Zero means it can be assumed aligned
4623 on any boundary that may be needed. */
4625 extern void layout_decl (tree, unsigned);
4627 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4628 a previous call to layout_decl and calls it again. */
4630 extern void relayout_decl (tree);
4632 /* Return the mode for data of a given size SIZE and mode class CLASS.
4633 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4634 The value is BLKmode if no other mode is found. This is like
4635 mode_for_size, but is passed a tree. */
4637 extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
4639 /* Return an expr equal to X but certainly not valid as an lvalue. */
4641 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4642 extern tree non_lvalue_loc (location_t, tree);
4644 extern tree convert (tree, tree);
4645 extern unsigned int expr_align (const_tree);
4646 extern tree expr_first (tree);
4647 extern tree expr_last (tree);
4648 extern tree size_in_bytes (const_tree);
4649 extern HOST_WIDE_INT int_size_in_bytes (const_tree);
4650 extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
4651 extern tree tree_expr_size (const_tree);
4652 extern tree bit_position (const_tree);
4653 extern HOST_WIDE_INT int_bit_position (const_tree);
4654 extern tree byte_position (const_tree);
4655 extern HOST_WIDE_INT int_byte_position (const_tree);
4657 /* Define data structures, macros, and functions for handling sizes
4658 and the various types used to represent sizes. */
4662 SIZETYPE, /* Normal representation of sizes in bytes. */
4663 SSIZETYPE, /* Signed representation of sizes in bytes. */
4664 BITSIZETYPE, /* Normal representation of sizes in bits. */
4665 SBITSIZETYPE, /* Signed representation of sizes in bits. */
4668 extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
4670 #define sizetype sizetype_tab[(int) SIZETYPE]
4671 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4672 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4673 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4675 extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
4676 #define size_binop(CODE,T1,T2)\
4677 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4678 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
4679 #define size_diffop(T1,T2)\
4680 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4681 extern tree size_diffop_loc (location_t, tree, tree);
4683 #define size_int(L) size_int_kind (L, SIZETYPE)
4684 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4685 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4686 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4688 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4689 extern tree round_up_loc (location_t, tree, int);
4690 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4691 extern tree round_down_loc (location_t, tree, int);
4692 extern void finalize_size_functions (void);
4694 /* Type for sizes of data-type. */
4696 #define BITS_PER_UNIT_LOG \
4697 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4698 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4699 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4701 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4702 extern unsigned int maximum_field_alignment;
4704 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4705 by making the last node in X point to Y.
4706 Returns X, except if X is 0 returns Y. */
4708 extern tree chainon (tree, tree);
4710 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4712 extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4713 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4715 /* Return the last tree node in a chain. */
4717 extern tree tree_last (tree);
4719 /* Reverse the order of elements in a chain, and return the new head. */
4721 extern tree nreverse (tree);
4723 /* Returns the length of a chain of nodes
4724 (number of chain pointers to follow before reaching a null pointer). */
4726 extern int list_length (const_tree);
4728 /* Returns the number of FIELD_DECLs in a type. */
4730 extern int fields_length (const_tree);
4732 /* Returns the first FIELD_DECL in a type. */
4734 extern tree first_field (const_tree);
4736 /* Given an initializer INIT, return TRUE if INIT is zero or some
4737 aggregate of zeros. Otherwise return FALSE. */
4739 extern bool initializer_zerop (const_tree);
4741 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4743 extern VEC(tree,gc) *ctor_to_vec (tree);
4745 /* Examine CTOR to discover:
4746 * how many scalar fields are set to nonzero values,
4747 and place it in *P_NZ_ELTS;
4748 * how many scalar fields in total are in CTOR,
4749 and place it in *P_ELT_COUNT.
4750 * if a type is a union, and the initializer from the constructor
4751 is not the largest element in the union, then set *p_must_clear.
4753 Return whether or not CTOR is a valid static constant initializer, the same
4754 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4756 extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4759 extern HOST_WIDE_INT count_type_elements (const_tree, bool);
4761 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4763 extern int integer_zerop (const_tree);
4765 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4767 extern int integer_onep (const_tree);
4769 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4770 all of whose significant bits are 1. */
4772 extern int integer_all_onesp (const_tree);
4774 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4775 exactly one bit 1. */
4777 extern int integer_pow2p (const_tree);
4779 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4780 with a nonzero value. */
4782 extern int integer_nonzerop (const_tree);
4784 extern bool cst_and_fits_in_hwi (const_tree);
4785 extern tree num_ending_zeros (const_tree);
4787 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4790 extern int fixed_zerop (const_tree);
4792 /* staticp (tree x) is nonzero if X is a reference to data allocated
4793 at a fixed address in memory. Returns the outermost data. */
4795 extern tree staticp (tree);
4797 /* save_expr (EXP) returns an expression equivalent to EXP
4798 but it can be used multiple times within context CTX
4799 and only evaluate EXP once. */
4801 extern tree save_expr (tree);
4803 /* Look inside EXPR and into any simple arithmetic operations. Return
4804 the innermost non-arithmetic node. */
4806 extern tree skip_simple_arithmetic (tree);
4808 /* Return which tree structure is used by T. */
4810 enum tree_node_structure_enum tree_node_structure (const_tree);
4812 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4813 size or offset that depends on a field within a record. */
4815 extern bool contains_placeholder_p (const_tree);
4817 /* This macro calls the above function but short-circuits the common
4818 case of a constant to save time. Also check for null. */
4820 #define CONTAINS_PLACEHOLDER_P(EXP) \
4821 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4823 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4824 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4827 extern bool type_contains_placeholder_p (tree);
4829 /* Given a tree EXP, find all occurences of references to fields
4830 in a PLACEHOLDER_EXPR and place them in vector REFS without
4831 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4832 we assume here that EXP contains only arithmetic expressions
4833 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4836 extern void find_placeholder_in_expr (tree, VEC (tree, heap) **);
4838 /* This macro calls the above function but short-circuits the common
4839 case of a constant to save time and also checks for NULL. */
4841 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4843 if((EXP) && !TREE_CONSTANT (EXP)) \
4844 find_placeholder_in_expr (EXP, V); \
4847 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4848 return a tree with all occurrences of references to F in a
4849 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4850 CONST_DECLs. Note that we assume here that EXP contains only
4851 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4852 occurring only in their argument list. */
4854 extern tree substitute_in_expr (tree, tree, tree);
4856 /* This macro calls the above function but short-circuits the common
4857 case of a constant to save time and also checks for NULL. */
4859 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4860 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4862 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4863 for it within OBJ, a tree that is an object or a chain of references. */
4865 extern tree substitute_placeholder_in_expr (tree, tree);
4867 /* This macro calls the above function but short-circuits the common
4868 case of a constant to save time and also checks for NULL. */
4870 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4871 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4872 : substitute_placeholder_in_expr (EXP, OBJ))
4874 /* variable_size (EXP) is like save_expr (EXP) except that it
4875 is for the special case of something that is part of a
4876 variable size for a data type. It makes special arrangements
4877 to compute the value at the right time when the data type
4878 belongs to a function parameter. */
4880 extern tree variable_size (tree);
4882 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4883 but it can be used multiple times
4884 and only evaluate the subexpressions once. */
4886 extern tree stabilize_reference (tree);
4888 /* Subroutine of stabilize_reference; this is called for subtrees of
4889 references. Any expression with side-effects must be put in a SAVE_EXPR
4890 to ensure that it is only evaluated once. */
4892 extern tree stabilize_reference_1 (tree);
4894 /* Return EXP, stripped of any conversions to wider types
4895 in such a way that the result of converting to type FOR_TYPE
4896 is the same as if EXP were converted to FOR_TYPE.
4897 If FOR_TYPE is 0, it signifies EXP's type. */
4899 extern tree get_unwidened (tree, tree);
4901 /* Return OP or a simpler expression for a narrower value
4902 which can be sign-extended or zero-extended to give back OP.
4903 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4904 or 0 if the value should be sign-extended. */
4906 extern tree get_narrower (tree, int *);
4908 /* Return true if T is an expression that get_inner_reference handles. */
4911 handled_component_p (const_tree t)
4913 switch (TREE_CODE (t))
4918 case ARRAY_RANGE_REF:
4919 case VIEW_CONVERT_EXPR:
4929 /* Given an expression EXP that is a handled_component_p,
4930 look for the ultimate containing object, which is returned and specify
4931 the access position and size. */
4933 extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
4934 tree *, enum machine_mode *, int *, int *,
4937 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4938 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4939 EXP is marked as PACKED. */
4941 extern bool contains_packed_reference (const_tree exp);
4943 /* Return a tree of sizetype representing the size, in bytes, of the element
4944 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4946 extern tree array_ref_element_size (tree);
4948 /* Return a tree representing the lower bound of the array mentioned in
4949 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4951 extern tree array_ref_low_bound (tree);
4953 /* Return a tree representing the upper bound of the array mentioned in
4954 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4956 extern tree array_ref_up_bound (tree);
4958 /* Return a tree representing the offset, in bytes, of the field referenced
4959 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4961 extern tree component_ref_field_offset (tree);
4963 /* Given a DECL or TYPE, return the scope in which it was declared, or
4964 NUL_TREE if there is no containing scope. */
4966 extern tree get_containing_scope (const_tree);
4968 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4970 extern tree decl_function_context (const_tree);
4972 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4973 this _DECL with its context, or zero if none. */
4974 extern tree decl_type_context (const_tree);
4976 /* Return 1 if EXPR is the real constant zero. */
4977 extern int real_zerop (const_tree);
4979 /* Declare commonly used variables for tree structure. */
4981 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4982 Zero means allow extended lvalues. */
4984 extern int pedantic_lvalues;
4986 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4988 extern GTY(()) tree current_function_decl;
4990 /* Nonzero means a FUNC_BEGIN label was emitted. */
4991 extern GTY(()) const char * current_function_func_begin_label;
4993 /* Iterator for going through the function arguments. */
4995 tree next; /* TREE_LIST pointing to the next argument */
4996 } function_args_iterator;
4998 /* Initialize the iterator I with arguments from function FNDECL */
5001 function_args_iter_init (function_args_iterator *i, const_tree fntype)
5003 i->next = TYPE_ARG_TYPES (fntype);
5006 /* Return a pointer that holds the next argument if there are more arguments to
5007 handle, otherwise return NULL. */
5009 static inline tree *
5010 function_args_iter_cond_ptr (function_args_iterator *i)
5012 return (i->next) ? &TREE_VALUE (i->next) : NULL;
5015 /* Return the next argument if there are more arguments to handle, otherwise
5019 function_args_iter_cond (function_args_iterator *i)
5021 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
5024 /* Advance to the next argument. */
5026 function_args_iter_next (function_args_iterator *i)
5028 gcc_assert (i->next != NULL_TREE);
5029 i->next = TREE_CHAIN (i->next);
5032 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5035 inlined_function_outer_scope_p (const_tree block)
5037 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
5040 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5041 to point to the next tree element. ITER is an instance of
5042 function_args_iterator used to iterate the arguments. */
5043 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5044 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5045 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5046 function_args_iter_next (&(ITER)))
5048 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5049 to the next tree element. ITER is an instance of function_args_iterator
5050 used to iterate the arguments. */
5051 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5052 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5053 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5054 function_args_iter_next (&(ITER)))
5059 extern unsigned crc32_string (unsigned, const char *);
5060 extern unsigned crc32_byte (unsigned, char);
5061 extern void clean_symbol_name (char *);
5062 extern tree get_file_function_name (const char *);
5063 extern tree get_callee_fndecl (const_tree);
5064 extern int type_num_arguments (const_tree);
5065 extern bool associative_tree_code (enum tree_code);
5066 extern bool commutative_tree_code (enum tree_code);
5067 extern bool commutative_ternary_tree_code (enum tree_code);
5068 extern tree upper_bound_in_type (tree, tree);
5069 extern tree lower_bound_in_type (tree, tree);
5070 extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
5071 extern tree call_expr_arg (tree, int);
5072 extern tree *call_expr_argp (tree, int);
5073 extern tree create_artificial_label (location_t);
5074 extern const char *get_name (tree);
5075 extern bool stdarg_p (const_tree);
5076 extern bool prototype_p (tree);
5077 extern bool is_typedef_decl (tree x);
5078 extern bool typedef_variant_p (tree);
5079 extern bool auto_var_in_fn_p (const_tree, const_tree);
5080 extern tree build_low_bits_mask (tree, unsigned);
5081 extern tree tree_strip_nop_conversions (tree);
5082 extern tree tree_strip_sign_nop_conversions (tree);
5083 extern tree lhd_gcc_personality (void);
5084 extern void assign_assembler_name_if_neeeded (tree);
5085 extern void warn_deprecated_use (tree, tree);
5089 extern void change_decl_assembler_name (tree, tree);
5092 extern tree unshare_expr (tree);
5096 extern void expand_expr_stmt (tree);
5097 extern int warn_if_unused_value (const_tree, location_t);
5098 extern void expand_label (tree);
5099 extern void expand_goto (tree);
5101 extern rtx expand_stack_save (void);
5102 extern void expand_stack_restore (tree);
5103 extern void expand_return (tree);
5106 extern void using_eh_for_cleanups (void);
5108 /* In fold-const.c */
5110 /* Non-zero if we are folding constants inside an initializer; zero
5112 extern int folding_initializer;
5114 /* Convert between trees and native memory representation. */
5115 extern int native_encode_expr (const_tree, unsigned char *, int);
5116 extern tree native_interpret_expr (tree, const unsigned char *, int);
5118 /* Fold constants as much as possible in an expression.
5119 Returns the simplified expression.
5120 Acts only on the top level of the expression;
5121 if the argument itself cannot be simplified, its
5122 subexpressions are not changed. */
5124 extern tree fold (tree);
5125 #define fold_unary(CODE,T1,T2)\
5126 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5127 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
5128 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5129 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5130 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
5131 #define fold_binary(CODE,T1,T2,T3)\
5132 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5133 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
5134 #define fold_ternary(CODE,T1,T2,T3,T4)\
5135 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5136 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
5137 #define fold_build1(c,t1,t2)\
5138 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5139 #define fold_build1_loc(l,c,t1,t2)\
5140 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5141 extern tree fold_build1_stat_loc (location_t, enum tree_code, tree,
5142 tree MEM_STAT_DECL);
5143 #define fold_build2(c,t1,t2,t3)\
5144 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5145 #define fold_build2_loc(l,c,t1,t2,t3)\
5146 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5147 extern tree fold_build2_stat_loc (location_t, enum tree_code, tree, tree,
5148 tree MEM_STAT_DECL);
5149 #define fold_build3(c,t1,t2,t3,t4)\
5150 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5151 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5152 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5153 extern tree fold_build3_stat_loc (location_t, enum tree_code, tree, tree, tree,
5154 tree MEM_STAT_DECL);
5155 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
5156 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
5157 extern tree fold_build3_initializer_loc (location_t, enum tree_code, tree, tree, tree, tree);
5158 #define fold_build_call_array(T1,T2,N,T4)\
5159 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5160 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
5161 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5162 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5163 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
5164 extern bool fold_convertible_p (const_tree, const_tree);
5165 #define fold_convert(T1,T2)\
5166 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5167 extern tree fold_convert_loc (location_t, tree, tree);
5168 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
5169 extern tree fold_ignored_result (tree);
5170 extern tree fold_abs_const (tree, tree);
5171 extern tree fold_indirect_ref_1 (location_t, tree, tree);
5172 extern void fold_defer_overflow_warnings (void);
5173 extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
5174 extern void fold_undefer_and_ignore_overflow_warnings (void);
5175 extern bool fold_deferring_overflow_warnings_p (void);
5176 extern tree fold_fma (location_t, tree, tree, tree, tree);
5178 enum operand_equal_flag
5182 OEP_CONSTANT_ADDRESS_OF = 4
5185 extern int operand_equal_p (const_tree, const_tree, unsigned int);
5186 extern int multiple_of_p (tree, const_tree, const_tree);
5187 #define omit_one_operand(T1,T2,T3)\
5188 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5189 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
5190 #define omit_two_operands(T1,T2,T3,T4)\
5191 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5192 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
5193 #define invert_truthvalue(T)\
5194 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5195 extern tree invert_truthvalue_loc (location_t, tree);
5196 extern tree fold_truth_not_expr (location_t, tree);
5197 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
5198 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
5199 extern tree fold_read_from_constant_string (tree);
5200 extern tree int_const_binop (enum tree_code, const_tree, const_tree);
5201 #define build_fold_addr_expr(T)\
5202 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5203 extern tree build_fold_addr_expr_loc (location_t, tree);
5204 #define build_fold_addr_expr_with_type(T,TYPE)\
5205 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5206 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
5207 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
5208 extern tree fold_strip_sign_ops (tree);
5209 #define build_fold_indirect_ref(T)\
5210 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5211 extern tree build_fold_indirect_ref_loc (location_t, tree);
5212 #define fold_indirect_ref(T)\
5213 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5214 extern tree fold_indirect_ref_loc (location_t, tree);
5215 extern tree build_simple_mem_ref_loc (location_t, tree);
5216 #define build_simple_mem_ref(T)\
5217 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5218 extern double_int mem_ref_offset (const_tree);
5219 extern tree reference_alias_ptr_type (const_tree);
5220 extern tree build_invariant_address (tree, tree, HOST_WIDE_INT);
5221 extern tree constant_boolean_node (int, tree);
5222 extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
5224 extern bool tree_swap_operands_p (const_tree, const_tree, bool);
5225 extern enum tree_code swap_tree_comparison (enum tree_code);
5227 extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
5228 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
5230 extern bool tree_expr_nonzero_p (tree);
5231 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
5232 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
5234 extern bool tree_single_nonzero_warnv_p (tree, bool *);
5235 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
5236 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
5238 extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
5239 extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
5240 extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
5242 extern bool tree_expr_nonzero_warnv_p (tree, bool *);
5244 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
5245 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
5246 enum tree_code, tree, tree, tree);
5247 extern void debug_fold_checksum (const_tree);
5249 /* Return nonzero if CODE is a tree code that represents a truth value. */
5251 truth_value_p (enum tree_code code)
5253 return (TREE_CODE_CLASS (code) == tcc_comparison
5254 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
5255 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
5256 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
5261 extern tree fold_call_expr (location_t, tree, bool);
5262 extern tree fold_builtin_fputs (location_t, tree, tree, bool, bool, tree);
5263 extern tree fold_builtin_strcpy (location_t, tree, tree, tree, tree);
5264 extern tree fold_builtin_strncpy (location_t, tree, tree, tree, tree, tree);
5265 extern tree fold_builtin_memory_chk (location_t, tree, tree, tree, tree, tree, tree, bool,
5266 enum built_in_function);
5267 extern tree fold_builtin_stxcpy_chk (location_t, tree, tree, tree, tree, tree, bool,
5268 enum built_in_function);
5269 extern tree fold_builtin_strncpy_chk (location_t, tree, tree, tree, tree, tree);
5270 extern tree fold_builtin_snprintf_chk (location_t, tree, tree, enum built_in_function);
5271 extern bool fold_builtin_next_arg (tree, bool);
5272 extern enum built_in_function builtin_mathfn_code (const_tree);
5273 extern tree fold_builtin_call_array (location_t, tree, tree, int, tree *);
5274 extern tree build_call_expr_loc_array (location_t, tree, int, tree *);
5275 extern tree build_call_expr_loc_vec (location_t, tree, VEC(tree,gc) *);
5276 extern tree build_call_expr_loc (location_t, tree, int, ...);
5277 extern tree build_call_expr (tree, int, ...);
5278 extern tree mathfn_built_in (tree, enum built_in_function fn);
5279 extern tree c_strlen (tree, int);
5280 extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
5281 extern tree build_va_arg_indirect_ref (tree);
5282 extern tree build_string_literal (int, const char *);
5283 extern bool validate_arglist (const_tree, ...);
5284 extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
5285 extern bool can_trust_pointer_alignment (void);
5286 extern unsigned int get_pointer_alignment (tree, unsigned int);
5287 extern bool is_builtin_name (const char *);
5288 extern bool is_builtin_fn (tree);
5289 extern unsigned int get_object_alignment_1 (tree, unsigned HOST_WIDE_INT *);
5290 extern unsigned int get_object_alignment (tree, unsigned int);
5291 extern tree fold_call_stmt (gimple, bool);
5292 extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
5293 extern tree make_range (tree, int *, tree *, tree *, bool *);
5294 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
5295 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
5297 extern void set_builtin_user_assembler_name (tree decl, const char *asmspec);
5298 extern bool is_simple_builtin (tree);
5299 extern bool is_inexpensive_builtin (tree);
5302 extern tree strip_float_extensions (tree);
5305 extern int really_constant_p (const_tree);
5306 extern bool decl_address_invariant_p (const_tree);
5307 extern bool decl_address_ip_invariant_p (const_tree);
5308 extern bool int_fits_type_p (const_tree, const_tree);
5309 #ifndef GENERATOR_FILE
5310 extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
5312 extern bool variably_modified_type_p (tree, tree);
5313 extern int tree_log2 (const_tree);
5314 extern int tree_floor_log2 (const_tree);
5315 extern int simple_cst_equal (const_tree, const_tree);
5316 extern hashval_t iterative_hash_expr (const_tree, hashval_t);
5317 extern hashval_t iterative_hash_exprs_commutative (const_tree,
5318 const_tree, hashval_t);
5319 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5320 extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
5321 extern hashval_t iterative_hash_host_wide_int (HOST_WIDE_INT, hashval_t);
5322 extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
5323 extern int type_list_equal (const_tree, const_tree);
5324 extern int chain_member (const_tree, const_tree);
5325 extern tree type_hash_lookup (unsigned int, tree);
5326 extern void type_hash_add (unsigned int, tree);
5327 extern int simple_cst_list_equal (const_tree, const_tree);
5328 extern void dump_tree_statistics (void);
5329 extern void recompute_tree_invariant_for_addr_expr (tree);
5330 extern bool needs_to_live_in_memory (const_tree);
5331 extern tree reconstruct_complex_type (tree, tree);
5333 extern int real_onep (const_tree);
5334 extern int real_twop (const_tree);
5335 extern int real_minus_onep (const_tree);
5336 extern void init_ttree (void);
5337 extern void build_common_tree_nodes (bool);
5338 extern void build_common_tree_nodes_2 (int);
5339 extern void build_common_builtin_nodes (void);
5340 extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
5341 extern tree build_range_type (tree, tree, tree);
5342 extern tree build_nonshared_range_type (tree, tree, tree);
5343 extern bool subrange_type_for_debug_p (const_tree, tree *, tree *);
5344 extern HOST_WIDE_INT int_cst_value (const_tree);
5345 extern HOST_WIDEST_INT widest_int_cst_value (const_tree);
5347 extern tree *tree_block (tree);
5348 extern location_t *block_nonartificial_location (tree);
5349 extern location_t tree_nonartificial_location (tree);
5351 extern tree block_ultimate_origin (const_tree);
5353 extern tree get_binfo_at_offset (tree, HOST_WIDE_INT, tree);
5355 /* In tree-nested.c */
5356 extern tree build_addr (tree, tree);
5359 extern void expand_main_function (void);
5360 extern void expand_function_end (void);
5361 extern void expand_function_start (tree);
5362 extern void stack_protect_prologue (void);
5363 extern void stack_protect_epilogue (void);
5364 extern void init_dummy_function_start (void);
5365 extern void expand_dummy_function_end (void);
5366 extern unsigned int init_function_for_compilation (void);
5367 extern void allocate_struct_function (tree, bool);
5368 extern void push_struct_function (tree fndecl);
5369 extern void init_function_start (tree);
5370 extern bool use_register_for_decl (const_tree);
5371 extern void generate_setjmp_warnings (void);
5372 extern void init_temp_slots (void);
5373 extern void free_temp_slots (void);
5374 extern void pop_temp_slots (void);
5375 extern void push_temp_slots (void);
5376 extern void preserve_temp_slots (rtx);
5377 extern int aggregate_value_p (const_tree, const_tree);
5378 extern void push_function_context (void);
5379 extern void pop_function_context (void);
5380 extern gimple_seq gimplify_parameters (void);
5382 /* In print-rtl.c */
5384 extern void print_rtl (FILE *, const_rtx);
5387 /* In print-tree.c */
5388 extern void debug_tree (tree);
5389 extern void debug_vec_tree (VEC(tree,gc) *);
5391 extern void dump_addr (FILE*, const char *, const void *);
5392 extern void print_node (FILE *, const char *, tree, int);
5393 extern void print_vec_tree (FILE *, const char *, VEC(tree,gc) *, int);
5394 extern void print_node_brief (FILE *, const char *, const_tree, int);
5395 extern void indent_to (FILE *, int);
5398 /* In tree-inline.c: */
5399 extern bool debug_find_tree (tree, tree);
5400 /* This is in tree-inline.c since the routine uses
5401 data structures from the inliner. */
5402 extern tree unsave_expr_now (tree);
5403 extern tree build_duplicate_type (tree);
5407 /* Nonzero if this is a call to a function whose return value depends
5408 solely on its arguments, has no side effects, and does not read
5409 global memory. This corresponds to TREE_READONLY for function
5411 #define ECF_CONST (1 << 0)
5412 /* Nonzero if this is a call to "pure" function (like const function,
5413 but may read memory. This corresponds to DECL_PURE_P for function
5415 #define ECF_PURE (1 << 1)
5416 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5417 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5418 for function decls.*/
5419 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5420 /* Nonzero if this call will never return. */
5421 #define ECF_NORETURN (1 << 3)
5422 /* Nonzero if this is a call to malloc or a related function. */
5423 #define ECF_MALLOC (1 << 4)
5424 /* Nonzero if it is plausible that this is a call to alloca. */
5425 #define ECF_MAY_BE_ALLOCA (1 << 5)
5426 /* Nonzero if this is a call to a function that won't throw an exception. */
5427 #define ECF_NOTHROW (1 << 6)
5428 /* Nonzero if this is a call to setjmp or a related function. */
5429 #define ECF_RETURNS_TWICE (1 << 7)
5430 /* Nonzero if this call replaces the current stack frame. */
5431 #define ECF_SIBCALL (1 << 8)
5432 /* Function does not read or write memory (but may have side effects, so
5433 it does not necessarily fit ECF_CONST). */
5434 #define ECF_NOVOPS (1 << 9)
5435 /* The function does not lead to calls within current function unit. */
5436 #define ECF_LEAF (1 << 10)
5438 extern int flags_from_decl_or_type (const_tree);
5439 extern int call_expr_flags (const_tree);
5441 /* Call argument flags. */
5443 /* Nonzero if the argument is not dereferenced recursively, thus only
5444 directly reachable memory is read or written. */
5445 #define EAF_DIRECT (1 << 0)
5446 /* Nonzero if memory reached by the argument is not clobbered. */
5447 #define EAF_NOCLOBBER (1 << 1)
5448 /* Nonzero if the argument does not escape. */
5449 #define EAF_NOESCAPE (1 << 2)
5450 /* Nonzero if the argument is not used by the function. */
5451 #define EAF_UNUSED (1 << 3)
5453 /* Call return flags. */
5455 /* Mask for the argument number that is returned. Lower two bits of
5456 the return flags, encodes argument slots zero to three. */
5457 #define ERF_RETURN_ARG_MASK (3)
5458 /* Nonzero if the return value is equal to the argument number
5459 flags & ERF_RETURN_ARG_MASK. */
5460 #define ERF_RETURNS_ARG (1 << 2)
5461 /* Nonzero if the return value does not alias with anything. Functions
5462 with the malloc attribute have this set on their return value. */
5463 #define ERF_NOALIAS (1 << 3)
5465 extern int setjmp_call_p (const_tree);
5466 extern bool gimple_alloca_call_p (const_gimple);
5467 extern bool alloca_call_p (const_tree);
5468 extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
5469 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
5473 extern const struct attribute_spec *lookup_attribute_spec (const_tree);
5475 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5476 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5477 it should be modified in place; if a TYPE, a copy should be created
5478 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5479 information, in the form of a bitwise OR of flags in enum attribute_flags
5480 from tree.h. Depending on these flags, some attributes may be
5481 returned to be applied at a later stage (for example, to apply
5482 a decl attribute to the declaration rather than to its type). */
5483 extern tree decl_attributes (tree *, tree, int);
5485 /* In integrate.c */
5486 extern void set_decl_abstract_flags (tree, int);
5487 extern void set_decl_origin_self (tree);
5489 /* In stor-layout.c */
5490 extern void set_min_and_max_values_for_integral_type (tree, int, bool);
5491 extern void fixup_signed_type (tree);
5492 extern void internal_reference_types (void);
5493 extern unsigned int update_alignment_for_field (record_layout_info, tree,
5496 extern tree tree_output_constant_def (tree);
5497 extern void make_decl_rtl (tree);
5498 extern rtx make_decl_rtl_for_debug (tree);
5499 extern void make_decl_one_only (tree, tree);
5500 extern int supports_one_only (void);
5501 extern void resolve_unique_section (tree, int, int);
5502 extern void mark_referenced (tree);
5503 extern void mark_decl_referenced (tree);
5504 extern void notice_global_symbol (tree);
5505 extern void set_user_assembler_name (tree, const char *);
5506 extern void process_pending_assemble_externals (void);
5507 extern void finish_aliases_1 (void);
5508 extern void finish_aliases_2 (void);
5509 extern void remove_unreachable_alias_pairs (void);
5510 extern bool decl_replaceable_p (tree);
5511 extern bool decl_binds_to_current_def_p (tree);
5513 /* Derived type for use by compute_visible_aliases and callers. A symbol
5514 alias set is a pointer set into which we enter IDENTIFIER_NODES bearing
5515 the canonicalised assembler-level symbol names corresponding to decls
5516 and their aliases. */
5517 typedef struct pointer_set_t symbol_alias_set_t;
5519 extern void symbol_alias_set_destroy (symbol_alias_set_t *);
5520 extern int symbol_alias_set_contains (const symbol_alias_set_t *, tree);
5521 extern symbol_alias_set_t * propagate_aliases_backward (bool (*)
5522 (tree, tree, void *),
5526 extern void expand_computed_goto (tree);
5527 extern bool parse_output_constraint (const char **, int, int, int,
5528 bool *, bool *, bool *);
5529 extern bool parse_input_constraint (const char **, int, int, int, int,
5530 const char * const *, bool *, bool *);
5531 extern void expand_asm_stmt (gimple);
5532 extern tree resolve_asm_operand_names (tree, tree, tree, tree);
5533 extern bool expand_switch_using_bit_tests_p (tree, tree, unsigned int,
5535 extern void expand_case (gimple);
5536 extern void expand_decl (tree);
5538 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5539 extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
5543 /* In dwarf2out.c */
5544 /* Interface of the DWARF2 unwind info support. */
5546 /* Generate a new label for the CFI info to refer to. */
5548 extern char *dwarf2out_cfi_label (bool);
5550 /* Entry point to update the canonical frame address (CFA). */
5552 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
5554 /* Add the CFI for saving a register window. */
5556 extern void dwarf2out_window_save (const char *);
5558 /* Entry point for saving a register to the stack. */
5560 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
5562 /* Entry point for saving the return address in the stack. */
5564 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
5566 /* Entry point for saving the return address in a register. */
5568 extern void dwarf2out_return_reg (const char *, unsigned);
5570 /* Entry point for saving the first register into the second. */
5572 extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5574 /* In tree-inline.c */
5576 /* The type of a set of already-visited pointers. Functions for creating
5577 and manipulating it are declared in pointer-set.h */
5578 struct pointer_set_t;
5580 /* The type of a callback function for walking over tree structure. */
5582 typedef tree (*walk_tree_fn) (tree *, int *, void *);
5584 /* The type of a callback function that represents a custom walk_tree. */
5586 typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5587 void *, struct pointer_set_t*);
5589 extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5591 extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5593 #define walk_tree(a,b,c,d) \
5594 walk_tree_1 (a, b, c, d, NULL)
5595 #define walk_tree_without_duplicates(a,b,c) \
5596 walk_tree_without_duplicates_1 (a, b, c, NULL)
5599 /* Assign the RTX to declaration. */
5601 extern void set_decl_rtl (tree, rtx);
5602 extern void set_decl_incoming_rtl (tree, rtx, bool);
5604 /* Enum and arrays used for tree allocation stats.
5605 Keep in sync with tree.c:tree_node_kind_names. */
5627 extern int tree_node_counts[];
5628 extern int tree_node_sizes[];
5630 /* True if we are in gimple form and the actions of the folders need to
5631 be restricted. False if we are not in gimple form and folding is not
5632 restricted to creating gimple expressions. */
5633 extern bool in_gimple_form;
5636 extern tree get_base_address (tree t);
5637 extern void mark_addressable (tree);
5641 struct GTY(()) tree_map_base {
5645 extern int tree_map_base_eq (const void *, const void *);
5646 extern unsigned int tree_map_base_hash (const void *);
5647 extern int tree_map_base_marked_p (const void *);
5648 extern bool list_equal_p (const_tree, const_tree);
5650 /* Map from a tree to another tree. */
5652 struct GTY(()) tree_map {
5653 struct tree_map_base base;
5658 #define tree_map_eq tree_map_base_eq
5659 extern unsigned int tree_map_hash (const void *);
5660 #define tree_map_marked_p tree_map_base_marked_p
5662 /* Map from a decl tree to another tree. */
5664 struct GTY(()) tree_decl_map {
5665 struct tree_map_base base;
5669 #define tree_decl_map_eq tree_map_base_eq
5670 extern unsigned int tree_decl_map_hash (const void *);
5671 #define tree_decl_map_marked_p tree_map_base_marked_p
5673 /* Map from a tree to an int. */
5675 struct GTY(()) tree_int_map {
5676 struct tree_map_base base;
5680 #define tree_int_map_eq tree_map_base_eq
5681 #define tree_int_map_hash tree_map_base_hash
5682 #define tree_int_map_marked_p tree_map_base_marked_p
5684 /* Map from a tree to initialization/finalization priorities. */
5686 struct GTY(()) tree_priority_map {
5687 struct tree_map_base base;
5692 #define tree_priority_map_eq tree_map_base_eq
5693 #define tree_priority_map_hash tree_map_base_hash
5694 #define tree_priority_map_marked_p tree_map_base_marked_p
5698 tree target_for_debug_bind (tree);
5700 /* In tree-ssa-address.c. */
5701 extern tree tree_mem_ref_addr (tree, tree);
5702 extern void copy_mem_ref_info (tree, tree);
5705 extern bool ssa_name_nonnegative_p (const_tree);
5707 /* In tree-object-size.c. */
5708 extern void init_object_sizes (void);
5709 extern void fini_object_sizes (void);
5710 extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5713 extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
5714 extern tree build_personality_function (const char *);
5716 /* In tree-inline.c. */
5718 void init_inline_once (void);
5720 /* Compute the number of operands in an expression node NODE. For
5721 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5722 otherwise it is looked up from the node's code. */
5724 tree_operand_length (const_tree node)
5726 if (VL_EXP_CLASS_P (node))
5727 return VL_EXP_OPERAND_LENGTH (node);
5729 return TREE_CODE_LENGTH (TREE_CODE (node));
5732 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5733 have to go towards the end of tree.h so that union tree_node is fully
5734 defined by this point. */
5736 /* Structure containing iterator state. */
5737 typedef struct call_expr_arg_iterator_d {
5738 tree t; /* the call_expr */
5739 int n; /* argument count */
5740 int i; /* next argument index */
5741 } call_expr_arg_iterator;
5743 typedef struct const_call_expr_arg_iterator_d {
5744 const_tree t; /* the call_expr */
5745 int n; /* argument count */
5746 int i; /* next argument index */
5747 } const_call_expr_arg_iterator;
5749 /* Initialize the abstract argument list iterator object ITER with the
5750 arguments from CALL_EXPR node EXP. */
5752 init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5755 iter->n = call_expr_nargs (exp);
5760 init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5763 iter->n = call_expr_nargs (exp);
5767 /* Return the next argument from abstract argument list iterator object ITER,
5768 and advance its state. Return NULL_TREE if there are no more arguments. */
5770 next_call_expr_arg (call_expr_arg_iterator *iter)
5773 if (iter->i >= iter->n)
5775 result = CALL_EXPR_ARG (iter->t, iter->i);
5780 static inline const_tree
5781 next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5784 if (iter->i >= iter->n)
5786 result = CALL_EXPR_ARG (iter->t, iter->i);
5791 /* Initialize the abstract argument list iterator object ITER, then advance
5792 past and return the first argument. Useful in for expressions, e.g.
5793 for (arg = first_call_expr_arg (exp, &iter); arg;
5794 arg = next_call_expr_arg (&iter)) */
5796 first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5798 init_call_expr_arg_iterator (exp, iter);
5799 return next_call_expr_arg (iter);
5802 static inline const_tree
5803 first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5805 init_const_call_expr_arg_iterator (exp, iter);
5806 return next_const_call_expr_arg (iter);
5809 /* Test whether there are more arguments in abstract argument list iterator
5810 ITER, without changing its state. */
5812 more_call_expr_args_p (const call_expr_arg_iterator *iter)
5814 return (iter->i < iter->n);
5818 more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5820 return (iter->i < iter->n);
5823 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5824 (of type call_expr_arg_iterator) to hold the iteration state. */
5825 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5826 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5827 (arg) = next_call_expr_arg (&(iter)))
5829 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5830 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5831 (arg) = next_const_call_expr_arg (&(iter)))
5833 /* Return true if tree node T is a language-specific node. */
5835 is_lang_specific (tree t)
5837 return TREE_CODE (t) == LANG_TYPE || TREE_CODE (t) >= NUM_TREE_CODES;
5840 /* In gimple-low.c. */
5841 extern bool block_may_fallthru (const_tree);
5843 #endif /* GCC_TREE_H */