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 /* Number of language-independent tree codes. */
54 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
56 /* Tree code classes. */
58 /* Each tree_code has an associated code class represented by a
61 enum tree_code_class
{
62 tcc_exceptional
, /* An exceptional code (fits no category). */
63 tcc_constant
, /* A constant. */
64 /* Order of tcc_type and tcc_declaration is important. */
65 tcc_type
, /* A type object code. */
66 tcc_declaration
, /* A declaration (also serving as variable refs). */
67 tcc_reference
, /* A reference to storage. */
68 tcc_comparison
, /* A comparison expression. */
69 tcc_unary
, /* A unary arithmetic expression. */
70 tcc_binary
, /* A binary arithmetic expression. */
71 tcc_statement
, /* A statement expression, which have side effects
72 but usually no interesting value. */
73 tcc_vl_exp
, /* A function call or other expression with a
74 variable-length operand vector. */
75 tcc_expression
/* Any other expression. */
78 /* Each tree code class has an associated string representation.
79 These must correspond to the tree_code_class entries. */
81 extern const char *const tree_code_class_strings
[];
83 /* Returns the string representing CLASS. */
85 #define TREE_CODE_CLASS_STRING(CLASS)\
86 tree_code_class_strings[(int) (CLASS)]
88 extern const enum tree_code_class tree_code_type
[];
89 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
91 /* Nonzero if CODE represents an exceptional code. */
93 #define EXCEPTIONAL_CLASS_P(CODE)\
94 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
96 /* Nonzero if CODE represents a constant. */
98 #define CONSTANT_CLASS_P(CODE)\
99 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
101 /* Nonzero if CODE represents a type. */
103 #define TYPE_P(CODE)\
104 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
106 /* Nonzero if CODE represents a declaration. */
108 #define DECL_P(CODE)\
109 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
111 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
113 #define VAR_OR_FUNCTION_DECL_P(DECL)\
114 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
116 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
117 ascending code order. */
119 #define INDIRECT_REF_P(CODE)\
120 (TREE_CODE (CODE) == INDIRECT_REF)
122 /* Nonzero if CODE represents a reference. */
124 #define REFERENCE_CLASS_P(CODE)\
125 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
127 /* Nonzero if CODE represents a comparison. */
129 #define COMPARISON_CLASS_P(CODE)\
130 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
132 /* Nonzero if CODE represents a unary arithmetic expression. */
134 #define UNARY_CLASS_P(CODE)\
135 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
137 /* Nonzero if CODE represents a binary arithmetic expression. */
139 #define BINARY_CLASS_P(CODE)\
140 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
142 /* Nonzero if CODE represents a statement expression. */
144 #define STATEMENT_CLASS_P(CODE)\
145 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
147 /* Nonzero if CODE represents a function call-like expression with a
148 variable-length operand vector. */
150 #define VL_EXP_CLASS_P(CODE)\
151 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
153 /* Nonzero if CODE represents any other expression. */
155 #define EXPRESSION_CLASS_P(CODE)\
156 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
158 /* Returns nonzero iff CODE represents a type or declaration. */
160 #define IS_TYPE_OR_DECL_P(CODE)\
161 (TYPE_P (CODE) || DECL_P (CODE))
163 /* Returns nonzero iff CLASS is the tree-code class of an
166 #define IS_EXPR_CODE_CLASS(CLASS)\
167 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
169 /* Returns nonzero iff NODE is an expression of some kind. */
171 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
173 /* Number of argument-words in each kind of tree-node. */
175 extern const unsigned char tree_code_length
[];
176 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
178 /* Names of tree components. */
180 extern const char *const tree_code_name
[];
182 /* We have to be able to tell cgraph about the needed-ness of the target
183 of an alias. This requires that the decl have been defined. Aliases
184 that precede their definition have to be queued for later processing. */
186 /* The deferred processing proceeds in several passes. We memorize the
187 diagnostics emitted for a pair to prevent repeating messages when the
188 queue gets re-scanned after possible updates. */
191 ALIAS_DIAG_NONE
= 0x0,
192 ALIAS_DIAG_TO_UNDEF
= 0x1,
193 ALIAS_DIAG_TO_EXTERN
= 0x2
196 typedef struct GTY(()) alias_pair
200 int emitted_diags
; /* alias_diags already emitted for this pair. */
203 /* Define gc'd vector type. */
204 DEF_VEC_O(alias_pair
);
205 DEF_VEC_ALLOC_O(alias_pair
,gc
);
207 extern GTY(()) VEC(alias_pair
,gc
) * alias_pairs
;
210 /* Classify which part of the compiler has defined a given builtin function.
211 Note that we assume below that this is no more than two bits. */
220 /* Names for the above. */
221 extern const char *const built_in_class_names
[4];
223 /* Codes that identify the various built in functions
224 so that expand_call can identify them quickly. */
226 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
227 enum built_in_function
229 #include "builtins.def"
231 /* Complex division routines in libgcc. These are done via builtins
232 because emit_library_call_value can't handle complex values. */
233 BUILT_IN_COMPLEX_MUL_MIN
,
234 BUILT_IN_COMPLEX_MUL_MAX
235 = BUILT_IN_COMPLEX_MUL_MIN
236 + MAX_MODE_COMPLEX_FLOAT
237 - MIN_MODE_COMPLEX_FLOAT
,
239 BUILT_IN_COMPLEX_DIV_MIN
,
240 BUILT_IN_COMPLEX_DIV_MAX
241 = BUILT_IN_COMPLEX_DIV_MIN
242 + MAX_MODE_COMPLEX_FLOAT
243 - MIN_MODE_COMPLEX_FLOAT
,
245 /* Upper bound on non-language-specific builtins. */
250 /* Names for the above. */
251 extern const char * built_in_names
[(int) END_BUILTINS
];
253 /* Helper macros for math builtins. */
255 #define BUILTIN_EXP10_P(FN) \
256 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
257 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
259 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
260 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
261 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
263 #define BUILTIN_SQRT_P(FN) \
264 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
266 #define BUILTIN_CBRT_P(FN) \
267 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
269 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
271 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
272 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
273 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
275 /* An array of _DECL trees for the above. */
276 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
277 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
279 /* In an OMP_CLAUSE node. */
281 /* Number of operands and names for each clause. */
282 extern unsigned const char omp_clause_num_ops
[];
283 extern const char * const omp_clause_code_name
[];
285 /* Clause codes. Do not reorder, as this is used to index into the tables
286 omp_clause_num_ops and omp_clause_code_name. */
289 /* Clause zero is special-cased inside the parser
290 (c_parser_omp_variable_list). */
291 OMP_CLAUSE_ERROR
= 0,
293 /* OpenMP clause: private (variable_list). */
296 /* OpenMP clause: shared (variable_list). */
299 /* OpenMP clause: firstprivate (variable_list). */
300 OMP_CLAUSE_FIRSTPRIVATE
,
302 /* OpenMP clause: lastprivate (variable_list). */
303 OMP_CLAUSE_LASTPRIVATE
,
305 /* OpenMP clause: reduction (operator:variable_list).
306 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
307 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
308 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
310 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
311 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
312 OMP_CLAUSE_REDUCTION
,
314 /* OpenMP clause: copyin (variable_list). */
317 /* OpenMP clause: copyprivate (variable_list). */
318 OMP_CLAUSE_COPYPRIVATE
,
320 /* OpenMP clause: if (scalar-expression). */
323 /* OpenMP clause: num_threads (integer-expression). */
324 OMP_CLAUSE_NUM_THREADS
,
326 /* OpenMP clause: schedule. */
329 /* OpenMP clause: nowait. */
332 /* OpenMP clause: ordered. */
335 /* OpenMP clause: default. */
338 /* OpenMP clause: collapse (constant-integer-expression). */
341 /* OpenMP clause: untied. */
345 /* The definition of tree nodes fills the next several pages. */
347 /* A tree node can represent a data type, a variable, an expression
348 or a statement. Each node has a TREE_CODE which says what kind of
349 thing it represents. Some common codes are:
350 INTEGER_TYPE -- represents a type of integers.
351 ARRAY_TYPE -- represents a type of pointer.
352 VAR_DECL -- represents a declared variable.
353 INTEGER_CST -- represents a constant integer value.
354 PLUS_EXPR -- represents a sum (an expression).
356 As for the contents of a tree node: there are some fields
357 that all nodes share. Each TREE_CODE has various special-purpose
358 fields as well. The fields of a node are never accessed directly,
359 always through accessor macros. */
361 /* Every kind of tree node starts with this structure,
362 so all nodes have these fields.
364 See the accessor macros, defined below, for documentation of the
367 struct GTY(()) tree_base
{
368 ENUM_BITFIELD(tree_code
) code
: 16;
370 unsigned side_effects_flag
: 1;
371 unsigned constant_flag
: 1;
372 unsigned addressable_flag
: 1;
373 unsigned volatile_flag
: 1;
374 unsigned readonly_flag
: 1;
375 unsigned unsigned_flag
: 1;
376 unsigned asm_written_flag
: 1;
377 unsigned nowarning_flag
: 1;
379 unsigned used_flag
: 1;
380 unsigned nothrow_flag
: 1;
381 unsigned static_flag
: 1;
382 unsigned public_flag
: 1;
383 unsigned private_flag
: 1;
384 unsigned protected_flag
: 1;
385 unsigned deprecated_flag
: 1;
386 unsigned saturating_flag
: 1;
388 unsigned default_def_flag
: 1;
389 unsigned lang_flag_0
: 1;
390 unsigned lang_flag_1
: 1;
391 unsigned lang_flag_2
: 1;
392 unsigned lang_flag_3
: 1;
393 unsigned lang_flag_4
: 1;
394 unsigned lang_flag_5
: 1;
395 unsigned lang_flag_6
: 1;
397 unsigned visited
: 1;
398 unsigned packed_flag
: 1;
399 unsigned user_align
: 1;
400 unsigned nameless_flag
: 1;
404 /* This field is only used with type nodes; the only reason it is present
405 in tree_base instead of tree_type is to save space. The size of the
406 field must be large enough to hold addr_space_t values. */
407 unsigned address_space
: 8;
410 struct GTY(()) tree_common
{
411 struct tree_base base
;
416 /* The following table lists the uses of each of the above flags and
417 for which types of nodes they are defined.
422 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
424 CONSTRUCTOR, IDENTIFIER_NODE
425 STMT_EXPR, it means we want the result of the enclosed expression
427 CALL_EXPR_TAILCALL in
436 VAR_DECL, FUNCTION_DECL
439 TREE_NO_TRAMPOLINE in
445 TREE_SYMBOL_REFERENCED in
449 TARGET_EXPR, WITH_CLEANUP_EXPR
451 TRY_CATCH_IS_CLEANUP in
457 TYPE_REF_CAN_ALIAS_ALL in
458 POINTER_TYPE, REFERENCE_TYPE
466 CALL_CANNOT_INLINE_P in
475 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
478 VAR_DECL, FUNCTION_DECL
484 CALL_EXPR_VA_ARG_PACK in
487 TYPE_CACHED_VALUES_P in
490 SAVE_EXPR_RESOLVED_P in
493 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
494 OMP_CLAUSE_LASTPRIVATE
496 OMP_CLAUSE_PRIVATE_DEBUG in
504 CALL_EXPR_RETURN_SLOT_OPT in
510 OMP_PARALLEL_COMBINED in
512 OMP_CLAUSE_PRIVATE_OUTER_REF in
515 TYPE_REF_IS_RVALUE in
524 CALL_FROM_THUNK_P and
540 TREE_THIS_VOLATILE in
563 TYPE_SIZES_GIMPLIFIED in
574 REGISTER_DEFS_IN_THIS_STMT in
575 all expressions (tree-into-ssa.c)
580 VAR_DECL, FUNCTION_DECL
581 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
582 BLOCK, SSA_NAME, STRING_CST
585 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
604 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
612 IDENTIFIER_TRANSPARENT_ALIAS in
615 STMT_IN_SSA_EDGE_WORKLIST in
616 all expressions (tree-ssa-propagate.c)
621 all trees (used liberally by many passes)
636 TYPE_VECTOR_OPAQUE in
639 SSA_NAME_IS_DEFAULT_DEF in
644 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
645 enum tree_node_structure_enum
{
646 #include "treestruct.def"
651 /* Define accessors for the fields that all tree nodes have
652 (though some fields are not used for all kinds of nodes). */
654 /* The tree-code says what kind of node it is.
655 Codes are defined in tree.def. */
656 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
657 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
659 /* When checking is enabled, errors will be generated if a tree node
660 is accessed incorrectly. The macros die with a fatal error. */
661 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
663 #define TREE_CHECK(T, CODE) __extension__ \
664 ({ __typeof (T) const __t = (T); \
665 if (TREE_CODE (__t) != (CODE)) \
666 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
670 #define TREE_NOT_CHECK(T, CODE) __extension__ \
671 ({ __typeof (T) const __t = (T); \
672 if (TREE_CODE (__t) == (CODE)) \
673 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
677 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
678 ({ __typeof (T) const __t = (T); \
679 if (TREE_CODE (__t) != (CODE1) \
680 && TREE_CODE (__t) != (CODE2)) \
681 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
682 (CODE1), (CODE2), 0); \
685 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
686 ({ __typeof (T) const __t = (T); \
687 if (TREE_CODE (__t) == (CODE1) \
688 || TREE_CODE (__t) == (CODE2)) \
689 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
690 (CODE1), (CODE2), 0); \
693 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
694 ({ __typeof (T) const __t = (T); \
695 if (TREE_CODE (__t) != (CODE1) \
696 && TREE_CODE (__t) != (CODE2) \
697 && TREE_CODE (__t) != (CODE3)) \
698 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
699 (CODE1), (CODE2), (CODE3), 0); \
702 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
703 ({ __typeof (T) const __t = (T); \
704 if (TREE_CODE (__t) == (CODE1) \
705 || TREE_CODE (__t) == (CODE2) \
706 || TREE_CODE (__t) == (CODE3)) \
707 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
708 (CODE1), (CODE2), (CODE3), 0); \
711 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
712 ({ __typeof (T) const __t = (T); \
713 if (TREE_CODE (__t) != (CODE1) \
714 && TREE_CODE (__t) != (CODE2) \
715 && TREE_CODE (__t) != (CODE3) \
716 && TREE_CODE (__t) != (CODE4)) \
717 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
718 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
721 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
722 ({ __typeof (T) const __t = (T); \
723 if (TREE_CODE (__t) == (CODE1) \
724 || TREE_CODE (__t) == (CODE2) \
725 || TREE_CODE (__t) == (CODE3) \
726 || TREE_CODE (__t) == (CODE4)) \
727 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
728 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
731 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
732 ({ __typeof (T) const __t = (T); \
733 if (TREE_CODE (__t) != (CODE1) \
734 && TREE_CODE (__t) != (CODE2) \
735 && TREE_CODE (__t) != (CODE3) \
736 && TREE_CODE (__t) != (CODE4) \
737 && TREE_CODE (__t) != (CODE5)) \
738 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
739 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
742 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
743 ({ __typeof (T) const __t = (T); \
744 if (TREE_CODE (__t) == (CODE1) \
745 || TREE_CODE (__t) == (CODE2) \
746 || TREE_CODE (__t) == (CODE3) \
747 || TREE_CODE (__t) == (CODE4) \
748 || TREE_CODE (__t) == (CODE5)) \
749 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
750 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
753 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
754 ({ __typeof (T) const __t = (T); \
755 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
756 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
760 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
761 ({ __typeof (T) const __t = (T); \
762 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
763 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
767 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
768 ({ __typeof (T) const __t = (T); \
769 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
770 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
774 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
775 ({ __typeof (T) const __t = (T); \
776 if (TREE_CODE (__t) != OMP_CLAUSE) \
777 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
779 if (__t->omp_clause.code != (CODE)) \
780 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
784 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
785 ({ __typeof (T) const __t = (T); \
786 if (TREE_CODE (__t) != OMP_CLAUSE) \
787 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
789 if ((int) __t->omp_clause.code < (int) (CODE1) \
790 || (int) __t->omp_clause.code > (int) (CODE2)) \
791 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
792 __FUNCTION__, (CODE1), (CODE2)); \
795 /* These checks have to be special cased. */
796 #define EXPR_CHECK(T) __extension__ \
797 ({ __typeof (T) const __t = (T); \
798 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
799 if (!IS_EXPR_CODE_CLASS (__c)) \
800 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
804 /* These checks have to be special cased. */
805 #define NON_TYPE_CHECK(T) __extension__ \
806 ({ __typeof (T) const __t = (T); \
808 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
812 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
813 (*({__typeof (T) const __t = (T); \
814 const int __i = (I); \
815 if (TREE_CODE (__t) != TREE_VEC) \
816 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
818 if (__i < 0 || __i >= __t->vec.length) \
819 tree_vec_elt_check_failed (__i, __t->vec.length, \
820 __FILE__, __LINE__, __FUNCTION__); \
821 &__t->vec.a[__i]; }))
823 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
824 (*({__typeof (T) const __t = (T); \
825 const int __i = (I); \
826 if (TREE_CODE (__t) != OMP_CLAUSE) \
827 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
829 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
830 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
832 &__t->omp_clause.ops[__i]; }))
834 /* Special checks for TREE_OPERANDs. */
835 #define TREE_OPERAND_CHECK(T, I) __extension__ \
836 (*({__typeof (T) const __t = EXPR_CHECK (T); \
837 const int __i = (I); \
838 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
839 tree_operand_check_failed (__i, __t, \
840 __FILE__, __LINE__, __FUNCTION__); \
841 &__t->exp.operands[__i]; }))
843 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
844 (*({__typeof (T) const __t = (T); \
845 const int __i = (I); \
846 if (TREE_CODE (__t) != CODE) \
847 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
848 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
849 tree_operand_check_failed (__i, __t, \
850 __FILE__, __LINE__, __FUNCTION__); \
851 &__t->exp.operands[__i]; }))
853 /* Nodes are chained together for many purposes.
854 Types are chained together to record them for being output to the debugger
855 (see the function `chain_type').
856 Decls in the same scope are chained together to record the contents
858 Statement nodes for successive statements used to be chained together.
859 Often lists of things are represented by TREE_LIST nodes that
860 are chained together. */
862 #define TREE_CHAIN(NODE) __extension__ \
863 (*({__typeof (NODE) const __t = (NODE); \
864 &__t->common.chain; }))
866 /* In all nodes that are expressions, this is the data type of the expression.
867 In POINTER_TYPE nodes, this is the type that the pointer points to.
868 In ARRAY_TYPE nodes, this is the type of the elements.
869 In VECTOR_TYPE nodes, this is the type of the elements. */
870 #define TREE_TYPE(NODE) __extension__ \
871 (*({__typeof (NODE) const __t = (NODE); \
872 &__t->common.type; }))
874 extern void tree_contains_struct_check_failed (const_tree
,
875 const enum tree_node_structure_enum
,
876 const char *, int, const char *)
879 extern void tree_check_failed (const_tree
, const char *, int, const char *,
880 ...) ATTRIBUTE_NORETURN
;
881 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
882 ...) ATTRIBUTE_NORETURN
;
883 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
884 const char *, int, const char *)
886 extern void tree_range_check_failed (const_tree
, const char *, int,
887 const char *, enum tree_code
,
890 extern void tree_not_class_check_failed (const_tree
,
891 const enum tree_code_class
,
892 const char *, int, const char *)
894 extern void tree_vec_elt_check_failed (int, int, const char *,
897 extern void phi_node_elt_check_failed (int, int, const char *,
900 extern void tree_operand_check_failed (int, const_tree
,
901 const char *, int, const char *)
903 extern void omp_clause_check_failed (const_tree
, const char *, int,
904 const char *, enum omp_clause_code
)
906 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
909 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
910 const char *, enum omp_clause_code
,
911 enum omp_clause_code
)
914 #else /* not ENABLE_TREE_CHECKING, or not gcc */
916 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
917 #define TREE_CHECK(T, CODE) (T)
918 #define TREE_NOT_CHECK(T, CODE) (T)
919 #define TREE_CHECK2(T, CODE1, CODE2) (T)
920 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
921 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
922 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
923 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
924 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
925 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
926 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
927 #define TREE_CLASS_CHECK(T, CODE) (T)
928 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
929 #define EXPR_CHECK(T) (T)
930 #define NON_TYPE_CHECK(T) (T)
931 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
932 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
933 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
934 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
935 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
936 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
938 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
939 #define TREE_TYPE(NODE) ((NODE)->common.type)
943 #define TREE_BLOCK(NODE) *(tree_block (NODE))
945 #include "tree-check.h"
947 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
948 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
949 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
950 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
951 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
952 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
953 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
954 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
955 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
956 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
957 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
959 #define RECORD_OR_UNION_CHECK(T) \
960 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
961 #define NOT_RECORD_OR_UNION_CHECK(T) \
962 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
964 #define NUMERICAL_TYPE_CHECK(T) \
965 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
968 /* Here is how primitive or already-canonicalized types' hash codes
970 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
972 /* A simple hash function for an arbitrary tree node. This must not be
973 used in hash tables which are saved to a PCH. */
974 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
976 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
977 #define CONVERT_EXPR_CODE_P(CODE) \
978 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
980 /* Similarly, but accept an expressions instead of a tree code. */
981 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
983 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
985 #define CASE_CONVERT \
989 /* Given an expression as a tree, strip any conversion that generates
990 no instruction. Accepts both tree and const_tree arguments since
991 we are not modifying the tree itself. */
993 #define STRIP_NOPS(EXP) \
994 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
996 /* Like STRIP_NOPS, but don't let the signedness change either. */
998 #define STRIP_SIGN_NOPS(EXP) \
999 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1001 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1003 #define STRIP_TYPE_NOPS(EXP) \
1004 while ((CONVERT_EXPR_P (EXP) \
1005 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1006 && TREE_OPERAND (EXP, 0) != error_mark_node \
1007 && (TREE_TYPE (EXP) \
1008 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1009 (EXP) = TREE_OPERAND (EXP, 0)
1011 /* Remove unnecessary type conversions according to
1012 tree_ssa_useless_type_conversion. */
1014 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1015 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1017 /* Nonzero if TYPE represents an integral type. Note that we do not
1018 include COMPLEX types here. Keep these checks in ascending code
1021 #define INTEGRAL_TYPE_P(TYPE) \
1022 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1023 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1024 || TREE_CODE (TYPE) == INTEGER_TYPE)
1026 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1028 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1029 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1031 /* Nonzero if TYPE represents a saturating fixed-point type. */
1033 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1034 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1036 /* Nonzero if TYPE represents a fixed-point type. */
1038 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1040 /* Nonzero if TYPE represents a scalar floating-point type. */
1042 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1044 /* Nonzero if TYPE represents a complex floating-point type. */
1046 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1047 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1048 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1050 /* Nonzero if TYPE represents a vector floating-point type. */
1052 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1053 (TREE_CODE (TYPE) == VECTOR_TYPE \
1054 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1056 /* Nonzero if TYPE represents a floating-point type, including complex
1057 and vector floating-point types. The vector and complex check does
1058 not use the previous two macros to enable early folding. */
1060 #define FLOAT_TYPE_P(TYPE) \
1061 (SCALAR_FLOAT_TYPE_P (TYPE) \
1062 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1063 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1064 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1066 /* Nonzero if TYPE represents a decimal floating-point type. */
1067 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1068 (SCALAR_FLOAT_TYPE_P (TYPE) \
1069 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1071 /* Nonzero if TYPE is a record or union type. */
1072 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1073 (TREE_CODE (TYPE) == RECORD_TYPE \
1074 || TREE_CODE (TYPE) == UNION_TYPE \
1075 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1077 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1078 Keep these checks in ascending code order. */
1080 #define AGGREGATE_TYPE_P(TYPE) \
1081 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1083 /* Nonzero if TYPE represents a pointer or reference type.
1084 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1085 ascending code order. */
1087 #define POINTER_TYPE_P(TYPE) \
1088 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1090 /* Nonzero if this type is a complete type. */
1091 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1093 /* Nonzero if this type is the (possibly qualified) void type. */
1094 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1096 /* Nonzero if this type is complete or is cv void. */
1097 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1098 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1100 /* Nonzero if this type is complete or is an array with unspecified bound. */
1101 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1102 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1105 /* Define many boolean fields that all tree nodes have. */
1107 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1108 of this is needed. So it cannot be in a register.
1109 In a FUNCTION_DECL it has no meaning.
1110 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1111 In LABEL_DECL nodes, it means a goto for this label has been seen
1112 from a place outside all binding contours that restore stack levels.
1113 In ..._TYPE nodes, it means that objects of this type must be fully
1114 addressable. This means that pieces of this object cannot go into
1115 register parameters, for example. If this a function type, this
1116 means that the value must be returned in memory.
1117 In IDENTIFIER_NODEs, this means that some extern decl for this name
1118 had its address taken. That matters for inline functions. */
1119 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1121 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1122 exit of a function. Calls for which this is true are candidates for tail
1123 call optimizations. */
1124 #define CALL_EXPR_TAILCALL(NODE) \
1125 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1127 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1128 CASE_LOW operand has been processed. */
1129 #define CASE_LOW_SEEN(NODE) \
1130 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1132 #define PREDICT_EXPR_OUTCOME(NODE) \
1133 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1134 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1135 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1136 #define PREDICT_EXPR_PREDICTOR(NODE) \
1137 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1139 /* In a VAR_DECL, nonzero means allocate static storage.
1140 In a FUNCTION_DECL, nonzero if function has been defined.
1141 In a CONSTRUCTOR, nonzero means allocate static storage. */
1142 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1144 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1145 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1147 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1148 should only be executed if an exception is thrown, not on normal exit
1150 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1152 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1153 separate cleanup in honor_protect_cleanup_actions. */
1154 #define TRY_CATCH_IS_CLEANUP(NODE) \
1155 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1157 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1158 CASE_HIGH operand has been processed. */
1159 #define CASE_HIGH_SEEN(NODE) \
1160 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1162 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1163 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1165 /* Used to mark scoped enums. */
1166 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1168 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1169 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1171 /* In an expr node (usually a conversion) this means the node was made
1172 implicitly and should not lead to any sort of warning. In a decl node,
1173 warnings concerning the decl should be suppressed. This is used at
1174 least for used-before-set warnings, and it set after one warning is
1176 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1178 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1179 this string as an argument. */
1180 #define TREE_SYMBOL_REFERENCED(NODE) \
1181 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1183 /* Nonzero in a pointer or reference type means the data pointed to
1184 by this type can alias anything. */
1185 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1186 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1188 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1189 #define MOVE_NONTEMPORAL(NODE) \
1190 (EXPR_CHECK (NODE)->base.static_flag)
1192 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1193 there was an overflow in folding. */
1195 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1197 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1199 #define TREE_OVERFLOW_P(EXPR) \
1200 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1202 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1203 nonzero means name is to be accessible from outside this translation unit.
1204 In an IDENTIFIER_NODE, nonzero means an external declaration
1205 accessible from outside this translation unit was previously seen
1206 for this name in an inner scope. */
1207 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1209 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1210 of cached values, or is something else. */
1211 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1213 /* In a SAVE_EXPR, indicates that the original expression has already
1214 been substituted with a VAR_DECL that contains the value. */
1215 #define SAVE_EXPR_RESOLVED_P(NODE) \
1216 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1218 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1220 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1221 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1223 /* In any expression, decl, or constant, nonzero means it has side effects or
1224 reevaluation of the whole expression could produce a different value.
1225 This is set if any subexpression is a function call, a side effect or a
1226 reference to a volatile variable. In a ..._DECL, this is set only if the
1227 declaration said `volatile'. This will never be set for a constant. */
1228 #define TREE_SIDE_EFFECTS(NODE) \
1229 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1231 /* In a LABEL_DECL, nonzero means this label had its address taken
1232 and therefore can never be deleted and is a jump target for
1234 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1236 /* Nonzero means this expression is volatile in the C sense:
1237 its address should be of type `volatile WHATEVER *'.
1238 In other words, the declared item is volatile qualified.
1239 This is used in _DECL nodes and _REF nodes.
1240 On a FUNCTION_DECL node, this means the function does not
1241 return normally. This is the same effect as setting
1242 the attribute noreturn on the function in C.
1244 In a ..._TYPE node, means this type is volatile-qualified.
1245 But use TYPE_VOLATILE instead of this macro when the node is a type,
1246 because eventually we may make that a different bit.
1248 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1249 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1251 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1252 accessing the memory pointed to won't generate a trap. However,
1253 this only applies to an object when used appropriately: it doesn't
1254 mean that writing a READONLY mem won't trap.
1256 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1257 (or slice of the array) always belongs to the range of the array.
1258 I.e. that the access will not trap, provided that the access to
1259 the base to the array will not trap. */
1260 #define TREE_THIS_NOTRAP(NODE) \
1261 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1262 ARRAY_RANGE_REF)->base.nothrow_flag)
1264 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1265 nonzero means it may not be the lhs of an assignment.
1266 Nonzero in a FUNCTION_DECL means this function should be treated
1267 as "const" function (can only read its arguments). */
1268 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1270 /* Value of expression is constant. Always on in all ..._CST nodes. May
1271 also appear in an expression or decl where the value is constant. */
1272 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1274 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1275 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1276 (TYPE_CHECK (NODE)->base.constant_flag)
1278 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1279 #define DECL_UNSIGNED(NODE) \
1280 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1282 /* In integral and pointer types, means an unsigned type. */
1283 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1285 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1286 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1287 This is interesting in an inline function, since it might not need
1288 to be compiled separately.
1289 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1290 if the debugging info for the type has been written.
1291 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1292 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1294 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1296 /* Nonzero in a _DECL if the name is used in its scope.
1297 Nonzero in an expr node means inhibit warning if value is unused.
1298 In IDENTIFIER_NODEs, this means that some extern decl for this name
1300 In a BLOCK, this means that the block contains variables that are used. */
1301 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1303 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1304 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1305 throw. We can't easily check the node type here as the C++
1306 frontend also uses this flag (for AGGR_INIT_EXPR). */
1307 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1309 /* In a CALL_EXPR, means that it's safe to use the target of the call
1310 expansion as the return slot for a call that returns in memory. */
1311 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1312 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1314 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1315 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1317 #define DECL_BY_REFERENCE(NODE) \
1318 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1319 RESULT_DECL)->decl_common.decl_by_reference_flag)
1321 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1322 can be used as restricted tag to disambiguate against other restrict
1323 pointers. Used by fortran to capture something like non-addressability
1324 (which it isn't really because the middle-end does take addresses of
1326 #define DECL_RESTRICTED_P(NODE) \
1327 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1328 RESULT_DECL)->decl_common.decl_restricted_flag)
1330 #define DECL_READ_P(NODE) \
1331 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1333 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1334 thunked-to function. */
1335 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1337 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1338 it has been built for the declaration of a variable-sized object. */
1339 #define ALLOCA_FOR_VAR_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1341 /* In a type, nonzero means that all objects of the type are guaranteed by the
1342 language or front-end to be properly aligned, so we can indicate that a MEM
1343 of this type is aligned at least to the alignment of the type, even if it
1344 doesn't appear that it is. We see this, for example, in object-oriented
1345 languages where a tag field may show this is an object of a more-aligned
1346 variant of the more generic type.
1348 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1350 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1352 /* Used in classes in C++. */
1353 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1354 /* Used in classes in C++. */
1355 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1357 /* True if reference type NODE is a C++ rvalue reference. */
1358 #define TYPE_REF_IS_RVALUE(NODE) \
1359 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1361 /* Nonzero in a _DECL if the use of the name is defined as a
1362 deprecated feature by __attribute__((deprecated)). */
1363 #define TREE_DEPRECATED(NODE) \
1364 ((NODE)->base.deprecated_flag)
1366 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1367 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1368 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1369 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1371 /* In fixed-point types, means a saturating type. */
1372 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1374 /* These flags are available for each language front end to use internally. */
1375 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1376 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1377 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1378 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1379 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1380 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1381 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1383 /* Define additional fields and accessors for nodes representing constants. */
1385 /* In an INTEGER_CST node. These two together make a 2-word integer.
1386 If the data type is signed, the value is sign-extended to 2 words
1387 even though not all of them may really be in use.
1388 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1389 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1390 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1391 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1393 #define INT_CST_LT(A, B) \
1394 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1395 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1396 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1398 #define INT_CST_LT_UNSIGNED(A, B) \
1399 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1400 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1401 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1402 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1403 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1405 struct GTY(()) tree_int_cst
{
1406 struct tree_common common
;
1410 /* In a REAL_CST node. struct real_value is an opaque entity, with
1411 manipulators defined in real.h. We don't want tree.h depending on
1412 real.h and transitively on tm.h. */
1415 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1416 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1418 struct GTY(()) tree_real_cst
{
1419 struct tree_common common
;
1420 struct real_value
* real_cst_ptr
;
1423 /* In a FIXED_CST node. */
1426 #define TREE_FIXED_CST_PTR(NODE) \
1427 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1428 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1430 struct GTY(()) tree_fixed_cst
{
1431 struct tree_common common
;
1432 struct fixed_value
* fixed_cst_ptr
;
1435 /* In a STRING_CST */
1436 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1437 #define TREE_STRING_POINTER(NODE) \
1438 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1440 struct GTY(()) tree_string
{
1441 struct tree_common common
;
1446 /* In a COMPLEX_CST node. */
1447 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1448 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1450 struct GTY(()) tree_complex
{
1451 struct tree_common common
;
1456 /* In a VECTOR_CST node. */
1457 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1459 struct GTY(()) tree_vector
{
1460 struct tree_common common
;
1466 /* Define fields and accessors for some special-purpose tree nodes. */
1468 #define IDENTIFIER_LENGTH(NODE) \
1469 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1470 #define IDENTIFIER_POINTER(NODE) \
1471 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1472 #define IDENTIFIER_HASH_VALUE(NODE) \
1473 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1475 /* Translate a hash table identifier pointer to a tree_identifier
1476 pointer, and vice versa. */
1478 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1479 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1480 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1482 struct GTY(()) tree_identifier
{
1483 struct tree_common common
;
1484 struct ht_identifier id
;
1487 /* In a TREE_LIST node. */
1488 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1489 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1491 struct GTY(()) tree_list
{
1492 struct tree_common common
;
1497 /* In a TREE_VEC node. */
1498 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1499 #define TREE_VEC_END(NODE) \
1500 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1502 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1504 struct GTY(()) tree_vec
{
1505 struct tree_common common
;
1507 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1510 /* In a CONSTRUCTOR node. */
1511 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1512 #define CONSTRUCTOR_ELT(NODE,IDX) \
1513 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1514 #define CONSTRUCTOR_NELTS(NODE) \
1515 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1517 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1518 value of each element (stored within VAL). IX must be a scratch variable
1519 of unsigned integer type. */
1520 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1521 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1523 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1527 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1528 the value of each element (stored within VAL) and its index (stored
1529 within INDEX). IX must be a scratch variable of unsigned integer type. */
1530 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1531 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1533 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1534 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1538 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1539 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1541 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1542 _ce___->index = INDEX; \
1543 _ce___->value = VALUE; \
1546 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1547 constructor output purposes. */
1548 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1549 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1551 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1552 element. INDEX can optionally design the position of VALUE: in arrays,
1553 it is the index where VALUE has to be placed; in structures, it is the
1554 FIELD_DECL of the member. */
1555 typedef struct GTY(()) constructor_elt_d
{
1560 DEF_VEC_O(constructor_elt
);
1561 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1563 struct GTY(()) tree_constructor
{
1564 struct tree_common common
;
1565 VEC(constructor_elt
,gc
) *elts
;
1568 /* Define fields and accessors for some nodes that represent expressions. */
1570 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1571 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1572 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1573 && integer_zerop (TREE_OPERAND (NODE, 0)))
1575 /* In ordinary expression nodes. */
1576 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1577 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1579 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1580 length. Its value includes the length operand itself; that is,
1581 the minimum valid length is 1.
1582 Note that we have to bypass the use of TREE_OPERAND to access
1583 that field to avoid infinite recursion in expanding the macros. */
1584 #define VL_EXP_OPERAND_LENGTH(NODE) \
1585 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1587 /* Nonzero if is_gimple_debug() may possibly hold. */
1588 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1590 /* In a LOOP_EXPR node. */
1591 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1593 /* The source location of this expression. Non-tree_exp nodes such as
1594 decls and constants can be shared among multiple locations, so
1596 #define EXPR_LOCATION(NODE) \
1597 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1598 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1599 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1600 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location)
1601 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1602 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1604 /* True if a tree is an expression or statement that can have a
1606 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1608 extern void protected_set_expr_location (tree
, location_t
);
1610 /* In a TARGET_EXPR node. */
1611 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1612 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1613 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1615 /* DECL_EXPR accessor. This gives access to the DECL associated with
1616 the given declaration statement. */
1617 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1619 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1621 /* COMPOUND_LITERAL_EXPR accessors. */
1622 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1623 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1624 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1625 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1627 /* SWITCH_EXPR accessors. These give access to the condition, body and
1628 original condition type (before any compiler conversions)
1629 of the switch statement, respectively. */
1630 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1631 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1632 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1634 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1635 of a case label, respectively. */
1636 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1637 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1638 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1639 #define CASE_CHAIN(NODE) TREE_CHAIN (CASE_LABEL_EXPR_CHECK (NODE))
1641 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1642 corresponding MEM_REF operands. */
1643 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1644 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1645 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1646 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1647 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1649 /* The operands of a BIND_EXPR. */
1650 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1651 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1652 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1654 /* GOTO_EXPR accessor. This gives access to the label associated with
1655 a goto statement. */
1656 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1658 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1659 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1660 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1662 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1663 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1664 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1665 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1666 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1667 /* Nonzero if we want to create an ASM_INPUT instead of an
1668 ASM_OPERAND with no operands. */
1669 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1670 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1672 /* COND_EXPR accessors. */
1673 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1674 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1675 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1677 /* Accessors for the chains of recurrences. */
1678 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1679 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1680 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1681 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1683 /* LABEL_EXPR accessor. This gives access to the label associated with
1684 the given label expression. */
1685 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1687 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1688 accessors for SSA operands. */
1690 /* CATCH_EXPR accessors. */
1691 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1692 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1694 /* EH_FILTER_EXPR accessors. */
1695 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1696 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1698 /* OBJ_TYPE_REF accessors. */
1699 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1700 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1701 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1703 /* ASSERT_EXPR accessors. */
1704 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1705 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1707 /* CALL_EXPR accessors.
1709 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1710 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1711 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1712 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1714 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1715 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1716 the argument count is zero when checking is enabled. Instead, do
1717 the pointer arithmetic to advance past the 3 fixed operands in a
1718 CALL_EXPR. That produces a valid pointer to just past the end of the
1719 operand array, even if it's not valid to dereference it. */
1720 #define CALL_EXPR_ARGP(NODE) \
1721 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1723 /* OpenMP directive and clause accessors. */
1725 #define OMP_BODY(NODE) \
1726 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1727 #define OMP_CLAUSES(NODE) \
1728 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1730 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1731 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1733 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1734 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1736 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1737 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1738 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1740 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1741 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1742 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1743 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1744 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1745 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1747 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1748 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1750 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1752 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1753 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1755 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1757 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1759 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1760 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1762 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1763 #define OMP_CLAUSE_DECL(NODE) \
1764 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1765 OMP_CLAUSE_PRIVATE, \
1766 OMP_CLAUSE_COPYPRIVATE), 0)
1767 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1768 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1769 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1771 /* True on an OMP_SECTION statement that was the last lexical member.
1772 This status is meaningful in the implementation of lastprivate. */
1773 #define OMP_SECTION_LAST(NODE) \
1774 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1776 /* True on an OMP_PARALLEL statement if it represents an explicit
1777 combined parallel work-sharing constructs. */
1778 #define OMP_PARALLEL_COMBINED(NODE) \
1779 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1781 /* True on a PRIVATE clause if its decl is kept around for debugging
1782 information only and its DECL_VALUE_EXPR is supposed to point
1783 to what it has been remapped to. */
1784 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1785 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1787 /* True on a PRIVATE clause if ctor needs access to outer region's
1789 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1790 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1792 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1793 decl is present in the chain. */
1794 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1795 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1796 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1797 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1798 OMP_CLAUSE_LASTPRIVATE),\
1800 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1801 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1803 #define OMP_CLAUSE_IF_EXPR(NODE) \
1804 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1805 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1806 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1807 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1808 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1810 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1811 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1812 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1813 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1814 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1815 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1817 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1818 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1819 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1820 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1821 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1822 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1823 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1824 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1825 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1826 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1827 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1828 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1830 enum omp_clause_schedule_kind
1832 OMP_CLAUSE_SCHEDULE_STATIC
,
1833 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1834 OMP_CLAUSE_SCHEDULE_GUIDED
,
1835 OMP_CLAUSE_SCHEDULE_AUTO
,
1836 OMP_CLAUSE_SCHEDULE_RUNTIME
1839 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1840 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1842 enum omp_clause_default_kind
1844 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1845 OMP_CLAUSE_DEFAULT_SHARED
,
1846 OMP_CLAUSE_DEFAULT_NONE
,
1847 OMP_CLAUSE_DEFAULT_PRIVATE
,
1848 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1851 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1852 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1854 struct GTY(()) tree_exp
{
1855 struct tree_common common
;
1858 tree
GTY ((special ("tree_exp"),
1859 desc ("TREE_CODE ((tree) &%0)")))
1863 /* SSA_NAME accessors. */
1865 /* Returns the variable being referenced. Once released, this is the
1866 only field that can be relied upon. */
1867 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1869 /* Returns the statement which defines this SSA name. */
1870 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1872 /* Returns the SSA version number of this SSA name. Note that in
1873 tree SSA, version numbers are not per variable and may be recycled. */
1874 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1876 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1877 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1879 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1880 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1882 /* Nonzero if this SSA_NAME expression is currently on the free list of
1883 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1884 has no meaning for an SSA_NAME. */
1885 #define SSA_NAME_IN_FREE_LIST(NODE) \
1886 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1888 /* Nonzero if this SSA_NAME is the default definition for the
1889 underlying symbol. A default SSA name is created for symbol S if
1890 the very first reference to S in the function is a read operation.
1891 Default definitions are always created by an empty statement and
1892 belong to no basic block. */
1893 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1894 SSA_NAME_CHECK (NODE)->base.default_def_flag
1896 /* Attributes for SSA_NAMEs for pointer-type variables. */
1897 #define SSA_NAME_PTR_INFO(N) \
1898 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1900 /* Defined in tree-flow.h. */
1901 struct ptr_info_def
;
1903 /* Immediate use linking structure. This structure is used for maintaining
1904 a doubly linked list of uses of an SSA_NAME. */
1905 typedef struct GTY(()) ssa_use_operand_d
{
1906 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1907 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1908 /* Immediate uses for a given SSA name are maintained as a cyclic
1909 list. To recognize the root of this list, the location field
1910 needs to point to the original SSA name. Since statements and
1911 SSA names are of different data types, we need this union. See
1912 the explanation in struct immediate_use_iterator_d. */
1913 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1914 tree
*GTY((skip(""))) use
;
1915 } ssa_use_operand_t
;
1917 /* Return the immediate_use information for an SSA_NAME. */
1918 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1920 struct GTY(()) tree_ssa_name
{
1921 struct tree_common common
;
1923 /* _DECL wrapped by this SSA name. */
1926 /* Statement that defines this SSA name. */
1929 /* SSA version number. */
1930 unsigned int version
;
1932 /* Pointer attributes used for alias analysis. */
1933 struct ptr_info_def
*ptr_info
;
1935 /* Immediate uses list for this SSA_NAME. */
1936 struct ssa_use_operand_d imm_uses
;
1939 struct GTY(()) phi_arg_d
{
1940 /* imm_use MUST be the first element in struct because we do some
1941 pointer arithmetic with it. See phi_arg_index_from_use. */
1942 struct ssa_use_operand_d imm_use
;
1948 #define OMP_CLAUSE_CODE(NODE) \
1949 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1951 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1952 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1954 #define OMP_CLAUSE_CODE(NODE) \
1955 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1957 #define OMP_CLAUSE_OPERAND(NODE, I) \
1958 OMP_CLAUSE_ELT_CHECK (NODE, I)
1960 struct GTY(()) tree_omp_clause
{
1961 struct tree_common common
;
1963 enum omp_clause_code code
;
1964 union omp_clause_subcode
{
1965 enum omp_clause_default_kind default_kind
;
1966 enum omp_clause_schedule_kind schedule_kind
;
1967 enum tree_code reduction_code
;
1968 } GTY ((skip
)) subcode
;
1970 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1972 gimple_seq gimple_reduction_init
;
1973 gimple_seq gimple_reduction_merge
;
1975 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
1979 /* In a BLOCK node. */
1980 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1981 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1982 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1983 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1984 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1985 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
1986 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1987 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1988 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1989 /* Note: when changing this, make sure to find the places
1990 that use chainon or nreverse. */
1991 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1992 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1993 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1995 /* An index number for this block. These values are not guaranteed to
1996 be unique across functions -- whether or not they are depends on
1997 the debugging output format in use. */
1998 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2000 /* If block reordering splits a lexical block into discontiguous
2001 address ranges, we'll make a copy of the original block.
2003 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2004 In that case, we have one source block that has been replicated
2005 (through inlining or unrolling) into many logical blocks, and that
2006 these logical blocks have different physical variables in them.
2008 In this case, we have one logical block split into several
2009 non-contiguous address ranges. Most debug formats can't actually
2010 represent this idea directly, so we fake it by creating multiple
2011 logical blocks with the same variables in them. However, for those
2012 that do support non-contiguous regions, these allow the original
2013 logical block to be reconstructed, along with the set of address
2016 One of the logical block fragments is arbitrarily chosen to be
2017 the ORIGIN. The other fragments will point to the origin via
2018 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2019 be null. The list of fragments will be chained through
2020 BLOCK_FRAGMENT_CHAIN from the origin. */
2022 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2023 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2025 /* For an inlined function, this gives the location where it was called
2026 from. This is only set in the top level block, which corresponds to the
2027 inlined function scope. This is used in the debug output routines. */
2029 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2031 struct GTY(()) tree_block
{
2032 struct tree_common common
;
2034 unsigned abstract_flag
: 1;
2035 unsigned block_num
: 31;
2040 VEC(tree
,gc
) *nonlocalized_vars
;
2044 tree abstract_origin
;
2045 tree fragment_origin
;
2046 tree fragment_chain
;
2049 /* Define fields and accessors for nodes representing data types. */
2051 /* See tree.def for documentation of the use of these fields.
2052 Look at the documentation of the various ..._TYPE tree codes.
2054 Note that the type.values, type.minval, and type.maxval fields are
2055 overloaded and used for different macros in different kinds of types.
2056 Each macro must check to ensure the tree node is of the proper kind of
2057 type. Note also that some of the front-ends also overload these fields,
2058 so they must be checked as well. */
2060 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2061 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2062 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2063 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2064 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2065 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2066 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2067 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2068 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2069 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2070 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2071 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2072 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2073 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2074 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2075 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2076 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2077 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2078 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2079 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2080 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2081 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2082 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2083 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2084 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2086 /* Vector types need to check target flags to determine type. */
2087 extern enum machine_mode
vector_type_mode (const_tree
);
2088 #define TYPE_MODE(NODE) \
2089 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2090 ? vector_type_mode (NODE) : (NODE)->type.mode)
2091 #define SET_TYPE_MODE(NODE, MODE) \
2092 (TYPE_CHECK (NODE)->type.mode = (MODE))
2094 /* The "canonical" type for this type node, which is used by frontends to
2095 compare the type for equality with another type. If two types are
2096 equal (based on the semantics of the language), then they will have
2097 equivalent TYPE_CANONICAL entries.
2099 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2100 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2101 be used for comparison against other types. Instead, the type is
2102 said to require structural equality checks, described in
2103 TYPE_STRUCTURAL_EQUALITY_P.
2105 For unqualified aggregate and function types the middle-end relies on
2106 TYPE_CANONICAL to tell whether two variables can be assigned
2107 to each other without a conversion. The middle-end also makes sure
2108 to assign the same alias-sets to the type partition with equal
2109 TYPE_CANONICAL of their unqualified variants. */
2110 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2111 /* Indicates that the type node requires structural equality
2112 checks. The compiler will need to look at the composition of the
2113 type to determine whether it is equal to another type, rather than
2114 just comparing canonical type pointers. For instance, we would need
2115 to look at the return and parameter types of a FUNCTION_TYPE
2117 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2118 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2119 type node requires structural equality. */
2120 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2122 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2123 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2124 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2126 /* For record and union types, information about this type, as a base type
2128 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2130 /* For non record and union types, used in a language-dependent way. */
2131 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2133 /* The (language-specific) typed-based alias set for this type.
2134 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2135 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2136 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2137 type can alias objects of any type. */
2138 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2140 /* Nonzero iff the typed-based alias set for this type has been
2142 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2144 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2146 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2148 /* The alignment necessary for objects of this type.
2149 The value is an int, measured in bits. */
2150 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2152 /* 1 if the alignment for this type was requested by "aligned" attribute,
2153 0 if it is the default for this type. */
2154 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2156 /* The alignment for NODE, in bytes. */
2157 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2159 /* If your language allows you to declare types, and you want debug info
2160 for them, then you need to generate corresponding TYPE_DECL nodes.
2161 These "stub" TYPE_DECL nodes have no name, and simply point at the
2162 type node. You then set the TYPE_STUB_DECL field of the type node
2163 to point back at the TYPE_DECL node. This allows the debug routines
2164 to know that the two nodes represent the same type, so that we only
2165 get one debug info record for them. */
2166 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2168 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2169 has BLKmode only because it lacks the alignment requirement for
2171 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2173 /* In an INTEGER_TYPE, it means the type represents a size. We use
2174 this both for validity checking and to permit optimizations that
2175 are unsafe for other types. Note that the C `size_t' type should
2176 *not* have this flag set. The `size_t' type is simply a typedef
2177 for an ordinary integer type that happens to be the type of an
2178 expression returned by `sizeof'; `size_t' has no special
2179 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2180 always actual sizes. */
2181 #define TYPE_IS_SIZETYPE(NODE) \
2182 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2184 /* Nonzero in a type considered volatile as a whole. */
2185 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2187 /* Means this type is const-qualified. */
2188 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2190 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2192 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2194 /* If nonzero, type's name shouldn't be emitted into debug info. */
2195 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2197 /* The address space the type is in. */
2198 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2200 /* There is a TYPE_QUAL value for each type qualifier. They can be
2201 combined by bitwise-or to form the complete set of qualifiers for a
2204 #define TYPE_UNQUALIFIED 0x0
2205 #define TYPE_QUAL_CONST 0x1
2206 #define TYPE_QUAL_VOLATILE 0x2
2207 #define TYPE_QUAL_RESTRICT 0x4
2209 /* Encode/decode the named memory support as part of the qualifier. If more
2210 than 8 qualifiers are added, these macros need to be adjusted. */
2211 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2212 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2214 /* Return all qualifiers except for the address space qualifiers. */
2215 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2217 /* Only keep the address space out of the qualifiers and discard the other
2219 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2221 /* The set of type qualifiers for this type. */
2222 #define TYPE_QUALS(NODE) \
2223 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2224 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2225 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2226 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2228 /* The same as TYPE_QUALS without the address space qualifications. */
2229 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2230 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2231 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2232 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2234 /* These flags are available for each language front end to use internally. */
2235 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2236 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2237 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2238 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2239 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2240 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2241 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2243 /* Used to keep track of visited nodes in tree traversals. This is set to
2244 0 by copy_node and make_node. */
2245 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2247 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2248 that distinguish string from array of char).
2249 If set in a INTEGER_TYPE, indicates a character type. */
2250 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2252 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2253 object of the given ARRAY_TYPE. This allows temporaries to be
2255 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2256 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2258 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2259 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2260 (((unsigned HOST_WIDE_INT) 1) \
2261 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2263 /* Set precision to n when we have 2^n sub-parts of the vector. */
2264 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2265 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2267 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2268 about missing conversions to other vector types of the same size. */
2269 #define TYPE_VECTOR_OPAQUE(NODE) \
2270 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2272 /* Indicates that objects of this type must be initialized by calling a
2273 function when they are created. */
2274 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2275 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2277 /* Indicates that a UNION_TYPE object should be passed the same way that
2278 the first union alternative would be passed, or that a RECORD_TYPE
2279 object should be passed the same way that the first (and only) member
2281 #define TYPE_TRANSPARENT_AGGR(NODE) \
2282 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2284 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2285 address of a component of the type. This is the counterpart of
2286 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2287 #define TYPE_NONALIASED_COMPONENT(NODE) \
2288 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2290 /* Indicated that objects of this type should be laid out in as
2291 compact a way as possible. */
2292 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2294 /* Used by type_contains_placeholder_p to avoid recomputation.
2295 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2296 this field directly. */
2297 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2298 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2300 /* The debug output functions use the symtab union field to store
2301 information specific to the debugging format. The different debug
2302 output hooks store different types in the union field. These three
2303 macros are used to access different fields in the union. The debug
2304 hooks are responsible for consistently using only a specific
2307 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2308 hold the type's number in the generated stabs. */
2309 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2311 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2312 hold struct/union type tag names. */
2313 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2315 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2316 in dwarf2out.c to point to the DIE generated for the type. */
2317 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2319 /* The garbage collector needs to know the interpretation of the
2320 symtab field. These constants represent the different types in the
2323 #define TYPE_SYMTAB_IS_ADDRESS (0)
2324 #define TYPE_SYMTAB_IS_POINTER (1)
2325 #define TYPE_SYMTAB_IS_DIE (2)
2329 struct GTY(()) tree_type
{
2330 struct tree_common common
;
2337 unsigned int precision
: 10;
2338 unsigned no_force_blk_flag
: 1;
2339 unsigned needs_constructing_flag
: 1;
2340 unsigned transparent_aggr_flag
: 1;
2341 unsigned restrict_flag
: 1;
2342 unsigned contains_placeholder_bits
: 2;
2344 ENUM_BITFIELD(machine_mode
) mode
: 8;
2346 unsigned string_flag
: 1;
2347 unsigned lang_flag_0
: 1;
2348 unsigned lang_flag_1
: 1;
2349 unsigned lang_flag_2
: 1;
2350 unsigned lang_flag_3
: 1;
2351 unsigned lang_flag_4
: 1;
2352 unsigned lang_flag_5
: 1;
2353 unsigned lang_flag_6
: 1;
2356 alias_set_type alias_set
;
2359 union tree_type_symtab
{
2360 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address
;
2361 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer
;
2362 struct die_struct
* GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die
;
2363 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab
;
2372 /* Points to a structure whose details depend on the language in use. */
2373 struct lang_type
*lang_specific
;
2376 /* Define accessor macros for information about type inheritance
2379 A "basetype" means a particular usage of a data type for inheritance
2380 in another type. Each such basetype usage has its own "binfo"
2381 object to describe it. The binfo object is a TREE_VEC node.
2383 Inheritance is represented by the binfo nodes allocated for a
2384 given type. For example, given types C and D, such that D is
2385 inherited by C, 3 binfo nodes will be allocated: one for describing
2386 the binfo properties of C, similarly one for D, and one for
2387 describing the binfo properties of D as a base type for C.
2388 Thus, given a pointer to class C, one can get a pointer to the binfo
2389 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2391 /* BINFO specific flags. */
2393 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2394 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2396 /* Flags for language dependent use. */
2397 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2398 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2399 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2400 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2401 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2402 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2403 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2405 /* The actual data type node being inherited in this basetype. */
2406 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2408 /* The offset where this basetype appears in its containing type.
2409 BINFO_OFFSET slot holds the offset (in bytes)
2410 from the base of the complete object to the base of the part of the
2411 object that is allocated on behalf of this `type'.
2412 This is always 0 except when there is multiple inheritance. */
2414 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2415 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2417 /* The virtual function table belonging to this basetype. Virtual
2418 function tables provide a mechanism for run-time method dispatching.
2419 The entries of a virtual function table are language-dependent. */
2421 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2423 /* The virtual functions in the virtual function table. This is
2424 a TREE_LIST that is used as an initial approximation for building
2425 a virtual function table for this basetype. */
2426 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2428 /* A vector of binfos for the direct basetypes inherited by this
2431 If this basetype describes type D as inherited in C, and if the
2432 basetypes of D are E and F, then this vector contains binfos for
2433 inheritance of E and F by C. */
2434 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2436 /* The number of basetypes for NODE. */
2437 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2439 /* Accessor macro to get to the Nth base binfo of this binfo. */
2440 #define BINFO_BASE_BINFO(NODE,N) \
2441 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2442 #define BINFO_BASE_ITERATE(NODE,N,B) \
2443 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2444 #define BINFO_BASE_APPEND(NODE,T) \
2445 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2447 /* For a BINFO record describing a virtual base class, i.e., one where
2448 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2449 base. The actual contents are language-dependent. In the C++
2450 front-end this field is an INTEGER_CST giving an offset into the
2451 vtable where the offset to the virtual base can be found. */
2452 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2454 /* Indicates the accesses this binfo has to its bases. The values are
2455 access_public_node, access_protected_node or access_private_node.
2456 If this array is not present, public access is implied. */
2457 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2459 #define BINFO_BASE_ACCESS(NODE,N) \
2460 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2461 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2462 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2464 /* The index in the VTT where this subobject's sub-VTT can be found.
2465 NULL_TREE if there is no sub-VTT. */
2466 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2468 /* The index in the VTT where the vptr for this subobject can be
2469 found. NULL_TREE if there is no secondary vptr in the VTT. */
2470 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2472 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2473 inheriting this base for non-virtual bases. For virtual bases it
2474 points either to the binfo for which this is a primary binfo, or to
2475 the binfo of the most derived type. */
2476 #define BINFO_INHERITANCE_CHAIN(NODE) \
2477 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2479 struct GTY (()) tree_binfo
{
2480 struct tree_common common
;
2486 VEC(tree
,gc
) *base_accesses
;
2492 VEC(tree
,none
) base_binfos
;
2496 /* Define fields and accessors for nodes representing declared names. */
2498 /* Nonzero if DECL represents a variable for the SSA passes. */
2499 #define SSA_VAR_P(DECL) \
2500 (TREE_CODE (DECL) == VAR_DECL \
2501 || TREE_CODE (DECL) == PARM_DECL \
2502 || TREE_CODE (DECL) == RESULT_DECL \
2503 || (TREE_CODE (DECL) == SSA_NAME \
2504 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2505 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2506 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2511 /* Enumerate visibility settings. */
2512 #ifndef SYMBOL_VISIBILITY_DEFINED
2513 #define SYMBOL_VISIBILITY_DEFINED
2514 enum symbol_visibility
2517 VISIBILITY_PROTECTED
,
2525 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2527 /* This is the name of the object as written by the user.
2528 It is an IDENTIFIER_NODE. */
2529 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2531 /* Every ..._DECL node gets a unique number. */
2532 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2534 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2536 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2538 /* Every ..._DECL node gets a unique number that stays the same even
2539 when the decl is copied by the inliner once it is set. */
2540 #define DECL_PT_UID(NODE) \
2541 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2542 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2543 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2544 #define SET_DECL_PT_UID(NODE, UID) \
2545 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2546 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2547 be preserved when copyin the decl. */
2548 #define DECL_PT_UID_SET_P(NODE) \
2549 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2551 /* These two fields describe where in the source code the declaration
2552 was. If the declaration appears in several places (as for a C
2553 function that is declared first and then defined later), this
2554 information should refer to the definition. */
2555 #define DECL_SOURCE_LOCATION(NODE) \
2556 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2557 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2558 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2559 #define DECL_IS_BUILTIN(DECL) \
2560 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2562 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2563 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2564 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2565 nodes, this points to either the FUNCTION_DECL for the containing
2566 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2567 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2569 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2570 #define DECL_FIELD_CONTEXT(NODE) \
2571 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2573 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2574 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2576 struct GTY(()) tree_decl_minimal
{
2577 struct tree_common common
;
2585 /* For any sort of a ..._DECL node, this points to the original (abstract)
2586 decl node which this decl is an inlined/cloned instance of, or else it
2587 is NULL indicating that this decl is not an instance of some other decl.
2589 The C front-end also uses this in a nested declaration of an inline
2590 function, to point back to the definition. */
2591 #define DECL_ABSTRACT_ORIGIN(NODE) \
2592 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2594 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2595 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2596 #define DECL_ORIGIN(NODE) \
2597 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2599 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2600 inline instance of some original (abstract) decl from an inline function;
2601 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2602 nodes can also have their abstract origin set to themselves. */
2603 #define DECL_FROM_INLINE(NODE) \
2604 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2605 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2607 /* In a DECL this is the field where attributes are stored. */
2608 #define DECL_ATTRIBUTES(NODE) \
2609 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2611 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2612 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2613 For a VAR_DECL, holds the initial value.
2614 For a PARM_DECL, used for DECL_ARG_TYPE--default
2615 values for parameters are encoded in the type of the function,
2616 not in the PARM_DECL slot.
2617 For a FIELD_DECL, this is used for enumeration values and the C
2618 frontend uses it for temporarily storing bitwidth of bitfields.
2620 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2621 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2623 /* Holds the size of the datum, in bits, as a tree expression.
2624 Need not be constant. */
2625 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2626 /* Likewise for the size in bytes. */
2627 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2628 /* Holds the alignment required for the datum, in bits. */
2629 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2630 /* The alignment of NODE, in bytes. */
2631 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2632 /* Set if the alignment of this DECL has been set by the user, for
2633 example with an 'aligned' attribute. */
2634 #define DECL_USER_ALIGN(NODE) \
2635 (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2636 /* Holds the machine mode corresponding to the declaration of a variable or
2637 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2639 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2641 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2642 operation it is. Note, however, that this field is overloaded, with
2643 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2644 checked before any access to the former. */
2645 #define DECL_FUNCTION_CODE(NODE) \
2646 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2647 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2648 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2650 #define DECL_FUNCTION_PERSONALITY(NODE) \
2651 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2653 /* Nonzero for a given ..._DECL node means that the name of this node should
2654 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2655 the associated type should be ignored. For a FUNCTION_DECL, the body of
2656 the function should also be ignored. */
2657 #define DECL_IGNORED_P(NODE) \
2658 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2660 /* Nonzero for a given ..._DECL node means that this node represents an
2661 "abstract instance" of the given declaration (e.g. in the original
2662 declaration of an inline function). When generating symbolic debugging
2663 information, we mustn't try to generate any address information for nodes
2664 marked as "abstract instances" because we don't actually generate
2665 any code or allocate any data space for such instances. */
2666 #define DECL_ABSTRACT(NODE) \
2667 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2669 /* Language-specific decl information. */
2670 #define DECL_LANG_SPECIFIC(NODE) \
2671 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2673 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2674 do not allocate storage, and refer to a definition elsewhere. Note that
2675 this does not necessarily imply the entity represented by NODE
2676 has no program source-level definition in this translation unit. For
2677 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2678 DECL_EXTERNAL may be true simultaneously; that can be the case for
2679 a C99 "extern inline" function. */
2680 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2682 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2683 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2685 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2687 Also set in some languages for variables, etc., outside the normal
2688 lexical scope, such as class instance variables. */
2689 #define DECL_NONLOCAL(NODE) \
2690 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2692 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2693 Used in FIELD_DECLs for vtable pointers.
2694 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2695 #define DECL_VIRTUAL_P(NODE) \
2696 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2698 /* Used to indicate that this DECL represents a compiler-generated entity. */
2699 #define DECL_ARTIFICIAL(NODE) \
2700 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2702 /* Additional flags for language-specific uses. */
2703 #define DECL_LANG_FLAG_0(NODE) \
2704 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2705 #define DECL_LANG_FLAG_1(NODE) \
2706 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2707 #define DECL_LANG_FLAG_2(NODE) \
2708 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2709 #define DECL_LANG_FLAG_3(NODE) \
2710 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2711 #define DECL_LANG_FLAG_4(NODE) \
2712 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2713 #define DECL_LANG_FLAG_5(NODE) \
2714 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2715 #define DECL_LANG_FLAG_6(NODE) \
2716 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2717 #define DECL_LANG_FLAG_7(NODE) \
2718 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2719 #define DECL_LANG_FLAG_8(NODE) \
2720 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2722 /* Nonzero for a scope which is equal to file scope. */
2723 #define SCOPE_FILE_SCOPE_P(EXP) \
2724 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2725 /* Nonzero for a decl which is at file scope. */
2726 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2727 /* Nonzero for a type which is at file scope. */
2728 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2730 /* Nonzero for a decl that is decorated using attribute used.
2731 This indicates to compiler tools that this decl needs to be preserved. */
2732 #define DECL_PRESERVE_P(DECL) \
2733 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2735 /* For function local variables of COMPLEX and VECTOR types,
2736 indicates that the variable is not aliased, and that all
2737 modifications to the variable have been adjusted so that
2738 they are killing assignments. Thus the variable may now
2739 be treated as a GIMPLE register, and use real instead of
2740 virtual ops in SSA form. */
2741 #define DECL_GIMPLE_REG_P(DECL) \
2742 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2744 struct GTY(()) tree_decl_common
{
2745 struct tree_decl_minimal common
;
2748 ENUM_BITFIELD(machine_mode
) mode
: 8;
2750 unsigned nonlocal_flag
: 1;
2751 unsigned virtual_flag
: 1;
2752 unsigned ignored_flag
: 1;
2753 unsigned abstract_flag
: 1;
2754 unsigned artificial_flag
: 1;
2755 unsigned preserve_flag
: 1;
2756 unsigned debug_expr_is_from
: 1;
2758 unsigned lang_flag_0
: 1;
2759 unsigned lang_flag_1
: 1;
2760 unsigned lang_flag_2
: 1;
2761 unsigned lang_flag_3
: 1;
2762 unsigned lang_flag_4
: 1;
2763 unsigned lang_flag_5
: 1;
2764 unsigned lang_flag_6
: 1;
2765 unsigned lang_flag_7
: 1;
2766 unsigned lang_flag_8
: 1;
2768 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2769 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2770 unsigned decl_flag_0
: 1;
2771 /* In FIELD_DECL, this is DECL_BIT_FIELD
2772 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2773 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2774 unsigned decl_flag_1
: 1;
2775 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2776 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2777 DECL_HAS_VALUE_EXPR_P. */
2778 unsigned decl_flag_2
: 1;
2779 /* Logically, these two would go in a theoretical base shared by var and
2781 unsigned gimple_reg_flag
: 1;
2782 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2783 unsigned decl_by_reference_flag
: 1;
2784 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2785 unsigned decl_restricted_flag
: 1;
2787 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2789 unsigned decl_read_flag
: 1;
2791 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2792 unsigned decl_common_unused
: 1;
2794 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2795 unsigned int off_align
: 8;
2797 /* 24-bits unused. */
2799 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2802 /* UID for points-to sets, stable over copying from inlining. */
2803 unsigned int pt_uid
;
2808 tree abstract_origin
;
2810 /* Points to a structure whose details depend on the language in use. */
2811 struct lang_decl
*lang_specific
;
2814 extern tree
decl_value_expr_lookup (tree
);
2815 extern void decl_value_expr_insert (tree
, tree
);
2817 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2818 if transformations have made this more complicated than evaluating the
2819 decl itself. This should only be used for debugging; once this field has
2820 been set, the decl itself may not legitimately appear in the function. */
2821 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2822 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2823 ->decl_common.decl_flag_2)
2824 #define DECL_VALUE_EXPR(NODE) \
2825 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2826 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2827 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2829 /* Holds the RTL expression for the value of a variable or function.
2830 This value can be evaluated lazily for functions, variables with
2831 static storage duration, and labels. */
2832 #define DECL_RTL(NODE) \
2833 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2834 ? (NODE)->decl_with_rtl.rtl \
2835 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2837 /* Set the DECL_RTL for NODE to RTL. */
2838 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2840 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2841 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2843 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2844 #define DECL_RTL_SET_P(NODE) \
2845 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2847 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2848 NODE1, it will not be set for NODE2; this is a lazy copy. */
2849 #define COPY_DECL_RTL(NODE1, NODE2) \
2850 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2851 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2853 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2854 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2856 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2857 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2859 struct GTY(()) tree_decl_with_rtl
{
2860 struct tree_decl_common common
;
2864 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2865 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2866 of the structure. */
2867 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2869 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2870 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2871 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2872 natural alignment of the field's type). */
2873 #define DECL_FIELD_BIT_OFFSET(NODE) \
2874 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2876 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2877 if so, the type that was originally specified for it.
2878 TREE_TYPE may have been modified (in finish_struct). */
2879 #define DECL_BIT_FIELD_TYPE(NODE) \
2880 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2882 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2883 if nonzero, indicates that the field occupies the type. */
2884 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2886 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2887 DECL_FIELD_OFFSET which are known to be always zero.
2888 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2890 #define DECL_OFFSET_ALIGN(NODE) \
2891 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2893 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2894 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2895 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2897 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2898 which this FIELD_DECL is defined. This information is needed when
2899 writing debugging information about vfield and vbase decls for C++. */
2900 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2902 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2903 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2905 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2907 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2909 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2910 this component. This makes it possible for Type-Based Alias Analysis
2911 to disambiguate accesses to this field with indirect accesses using
2914 struct S { int i; } s;
2917 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2919 From the implementation's viewpoint, the alias set of the type of the
2920 field 'i' (int) will not be recorded as a subset of that of the type of
2921 's' (struct S) in record_component_aliases. The counterpart is that
2922 accesses to s.i must not be given the alias set of the type of 'i'
2923 (int) but instead directly that of the type of 's' (struct S). */
2924 #define DECL_NONADDRESSABLE_P(NODE) \
2925 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2927 struct GTY(()) tree_field_decl
{
2928 struct tree_decl_common common
;
2931 tree bit_field_type
;
2937 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2938 dense, unique within any one function, and may be used to index arrays.
2939 If the value is -1, then no UID has been assigned. */
2940 #define LABEL_DECL_UID(NODE) \
2941 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2943 /* In a LABEL_DECL, the EH region number for which the label is the
2944 post_landing_pad. */
2945 #define EH_LANDING_PAD_NR(NODE) \
2946 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2948 /* In LABEL_DECL nodes, nonzero means that an error message about
2949 jumping into such a binding contour has been printed for this label. */
2950 #define DECL_ERROR_ISSUED(NODE) \
2951 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2953 struct GTY(()) tree_label_decl
{
2954 struct tree_decl_with_rtl common
;
2956 int eh_landing_pad_nr
;
2960 struct GTY(()) tree_result_decl
{
2961 struct tree_decl_with_rtl common
;
2962 struct var_ann_d
*ann
;
2965 struct GTY(()) tree_const_decl
{
2966 struct tree_decl_common common
;
2969 /* For a PARM_DECL, records the data type used to pass the argument,
2970 which may be different from the type seen in the program. */
2971 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2973 /* For PARM_DECL, holds an RTL for the stack slot or register
2974 where the data was actually passed. */
2975 #define DECL_INCOMING_RTL(NODE) \
2976 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2978 struct GTY(()) tree_parm_decl
{
2979 struct tree_decl_with_rtl common
;
2981 struct var_ann_d
*ann
;
2985 /* Nonzero for a given ..._DECL node means that no warnings should be
2986 generated just because this node is unused. */
2987 #define DECL_IN_SYSTEM_HEADER(NODE) \
2988 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2990 /* Used to indicate that the linkage status of this DECL is not yet known,
2991 so it should not be output now. */
2992 #define DECL_DEFER_OUTPUT(NODE) \
2993 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2995 /* In a VAR_DECL that's static,
2996 nonzero if the space is in the text section. */
2997 #define DECL_IN_TEXT_SECTION(NODE) \
2998 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3000 /* In a VAR_DECL that's static,
3001 nonzero if it belongs to the global constant pool. */
3002 #define DECL_IN_CONSTANT_POOL(NODE) \
3003 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3005 /* Nonzero for a given ..._DECL node means that this node should be
3006 put in .common, if possible. If a DECL_INITIAL is given, and it
3007 is not error_mark_node, then the decl cannot be put in .common. */
3008 #define DECL_COMMON(NODE) \
3009 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3011 /* In a VAR_DECL, nonzero if the decl is a register variable with
3012 an explicit asm specification. */
3013 #define DECL_HARD_REGISTER(NODE) \
3014 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3016 /* Used to indicate that this DECL has weak linkage. */
3017 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3019 /* Used to indicate that the DECL is a dllimport. */
3020 #define DECL_DLLIMPORT_P(NODE) \
3021 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3023 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3024 not be put out unless it is needed in this translation unit.
3025 Entities like this are shared across translation units (like weak
3026 entities), but are guaranteed to be generated by any translation
3027 unit that needs them, and therefore need not be put out anywhere
3028 where they are not needed. DECL_COMDAT is just a hint to the
3029 back-end; it is up to front-ends which set this flag to ensure
3030 that there will never be any harm, other than bloat, in putting out
3031 something which is DECL_COMDAT. */
3032 #define DECL_COMDAT(NODE) \
3033 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3035 #define DECL_COMDAT_GROUP(NODE) \
3036 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3038 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3039 multiple translation units should be merged. */
3040 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3042 /* The name of the object as the assembler will see it (but before any
3043 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3044 as DECL_NAME. It is an IDENTIFIER_NODE. */
3045 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3047 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3048 This is true of all DECL nodes except FIELD_DECL. */
3049 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3050 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3052 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3053 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3055 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3056 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3057 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3059 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3060 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3061 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3063 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3064 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3065 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3066 semantics of using this macro, are different than saying:
3068 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3070 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3072 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3073 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3074 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3075 DECL_ASSEMBLER_NAME (DECL1)) \
3078 /* Records the section name in a section attribute. Used to pass
3079 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3080 #define DECL_SECTION_NAME(NODE) \
3081 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3083 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3084 this variable in a BIND_EXPR. */
3085 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3086 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3088 /* Value of the decls's visibility attribute */
3089 #define DECL_VISIBILITY(NODE) \
3090 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3092 /* Nonzero means that the decl had its visibility specified rather than
3094 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3095 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3097 /* In a VAR_DECL, the model to use if the data should be allocated from
3098 thread-local storage. */
3099 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3101 /* In a VAR_DECL, nonzero if the data should be allocated from
3102 thread-local storage. */
3103 #define DECL_THREAD_LOCAL_P(NODE) \
3104 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3106 /* In a non-local VAR_DECL with static storage duration, true if the
3107 variable has an initialization priority. If false, the variable
3108 will be initialized at the DEFAULT_INIT_PRIORITY. */
3109 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3110 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3112 /* Specify whether the section name was set by user or by
3113 compiler via -ffunction-sections. */
3114 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3115 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3117 struct GTY(()) tree_decl_with_vis
{
3118 struct tree_decl_with_rtl common
;
3119 tree assembler_name
;
3123 /* Belong to VAR_DECL exclusively. */
3124 unsigned defer_output
: 1;
3125 unsigned hard_register
: 1;
3126 unsigned thread_local
: 1;
3127 unsigned common_flag
: 1;
3128 unsigned in_text_section
: 1;
3129 unsigned in_constant_pool
: 1;
3130 unsigned dllimport_flag
: 1;
3131 /* Don't belong to VAR_DECL exclusively. */
3132 unsigned weak_flag
: 1;
3134 unsigned seen_in_bind_expr
: 1;
3135 unsigned comdat_flag
: 1;
3136 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3137 unsigned visibility_specified
: 1;
3138 /* Belongs to VAR_DECL exclusively. */
3139 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3141 /* Belong to FUNCTION_DECL exclusively. */
3142 unsigned init_priority_p
: 1;
3143 /* Used by C++ only. Might become a generic decl flag. */
3144 unsigned shadowed_for_var_p
: 1;
3145 /* When SECTION_NAME is implied by -ffunsection-section. */
3146 unsigned implicit_section_name_p
: 1;
3147 /* 13 unused bits. */
3150 extern tree
decl_debug_expr_lookup (tree
);
3151 extern void decl_debug_expr_insert (tree
, tree
);
3152 /* For VAR_DECL, this is set to either an expression that it was split
3153 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3154 subexpressions that it was split into. */
3155 #define DECL_DEBUG_EXPR(NODE) \
3156 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3158 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3159 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3161 /* An initialization priority. */
3162 typedef unsigned short priority_type
;
3164 extern priority_type
decl_init_priority_lookup (tree
);
3165 extern priority_type
decl_fini_priority_lookup (tree
);
3166 extern void decl_init_priority_insert (tree
, priority_type
);
3167 extern void decl_fini_priority_insert (tree
, priority_type
);
3169 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3171 #define DECL_INIT_PRIORITY(NODE) \
3172 (decl_init_priority_lookup (NODE))
3173 /* Set the initialization priority for NODE to VAL. */
3174 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3175 (decl_init_priority_insert (NODE, VAL))
3177 /* For a FUNCTION_DECL the finalization priority of NODE. */
3178 #define DECL_FINI_PRIORITY(NODE) \
3179 (decl_fini_priority_lookup (NODE))
3180 /* Set the finalization priority for NODE to VAL. */
3181 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3182 (decl_fini_priority_insert (NODE, VAL))
3184 /* The initialization priority for entities for which no explicit
3185 initialization priority has been specified. */
3186 #define DEFAULT_INIT_PRIORITY 65535
3188 /* The maximum allowed initialization priority. */
3189 #define MAX_INIT_PRIORITY 65535
3191 /* The largest priority value reserved for use by system runtime
3193 #define MAX_RESERVED_INIT_PRIORITY 100
3195 #define DECL_VAR_ANN_PTR(NODE) \
3196 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3197 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3198 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3201 struct GTY(()) tree_var_decl
{
3202 struct tree_decl_with_vis common
;
3203 struct var_ann_d
*ann
;
3207 /* This field is used to reference anything in decl.result and is meant only
3208 for use by the garbage collector. */
3209 #define DECL_RESULT_FLD(NODE) \
3210 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3212 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3213 Before the struct containing the FUNCTION_DECL is laid out,
3214 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3215 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3216 function. When the class is laid out, this pointer is changed
3217 to an INTEGER_CST node which is suitable for use as an index
3218 into the virtual function table.
3219 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3220 #define DECL_VINDEX(NODE) \
3221 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3224 tree_decl_non_common
{
3225 struct tree_decl_with_vis common
;
3226 /* C++ uses this in namespaces. */
3228 /* C++ uses this in templates. */
3230 /* Almost all FE's use this. */
3232 /* C++ uses this in namespaces and function_decls. */
3236 /* In FUNCTION_DECL, holds the decl for the return value. */
3237 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3239 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3240 #define DECL_UNINLINABLE(NODE) \
3241 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3243 /* In a FUNCTION_DECL, the saved representation of the body of the
3245 #define DECL_SAVED_TREE(NODE) \
3246 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3248 /* Nonzero in a FUNCTION_DECL means this function should be treated
3249 as if it were a malloc, meaning it returns a pointer that is
3251 #define DECL_IS_MALLOC(NODE) \
3252 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3254 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3255 C++ operator new, meaning that it returns a pointer for which we
3256 should not use type based aliasing. */
3257 #define DECL_IS_OPERATOR_NEW(NODE) \
3258 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3260 /* Nonzero in a FUNCTION_DECL means this function may return more
3262 #define DECL_IS_RETURNS_TWICE(NODE) \
3263 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3265 /* Nonzero in a FUNCTION_DECL means this function should be treated
3266 as "pure" function (like const function, but may read global memory). */
3267 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3269 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3270 the const or pure function may not terminate. When this is nonzero
3271 for a const or pure function, it can be dealt with by cse passes
3272 but cannot be removed by dce passes since you are not allowed to
3273 change an infinite looping program into one that terminates without
3275 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3276 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3278 /* Nonzero in a FUNCTION_DECL means this function should be treated
3279 as "novops" function (function that does not read global memory,
3280 but may have arbitrary side effects). */
3281 #define DECL_IS_NOVOPS(NODE) \
3282 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3284 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3285 at the beginning or end of execution. */
3286 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3287 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3289 #define DECL_STATIC_DESTRUCTOR(NODE) \
3290 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3292 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3293 be instrumented with calls to support routines. */
3294 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3295 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3297 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3298 disabled in this function. */
3299 #define DECL_NO_LIMIT_STACK(NODE) \
3300 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3302 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3303 #define DECL_STATIC_CHAIN(NODE) \
3304 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3306 /* Nonzero for a decl that cgraph has decided should be inlined into
3307 at least one call site. It is not meaningful to look at this
3308 directly; always use cgraph_function_possibly_inlined_p. */
3309 #define DECL_POSSIBLY_INLINED(DECL) \
3310 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3312 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3313 such as via the `inline' keyword in C/C++. This flag controls the linkage
3314 semantics of 'inline' */
3315 #define DECL_DECLARED_INLINE_P(NODE) \
3316 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3318 /* Nonzero in a FUNCTION_DECL means this function should not get
3319 -Winline warnings. */
3320 #define DECL_NO_INLINE_WARNING_P(NODE) \
3321 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3323 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3324 disregarding size and cost heuristics. This is equivalent to using
3325 the always_inline attribute without the required diagnostics if the
3326 function cannot be inlined. */
3327 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3328 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3330 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3331 that describes the status of this function. */
3332 #define DECL_STRUCT_FUNCTION(NODE) \
3333 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3335 /* In a FUNCTION_DECL, nonzero means a built in function. */
3336 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3338 /* For a builtin function, identify which part of the compiler defined it. */
3339 #define DECL_BUILT_IN_CLASS(NODE) \
3340 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3342 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3343 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3345 #define DECL_ARGUMENTS(NODE) \
3346 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3347 #define DECL_ARGUMENT_FLD(NODE) \
3348 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3350 /* In FUNCTION_DECL, the function specific target options to use when compiling
3352 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3353 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3355 /* In FUNCTION_DECL, the function specific optimization options to use when
3356 compiling this function. */
3357 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3358 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3360 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3361 arguments/result/saved_tree fields by front ends. It was either inherit
3362 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3363 which seemed a bit strange. */
3365 struct GTY(()) tree_function_decl
{
3366 struct tree_decl_non_common common
;
3370 /* The personality function. Used for stack unwinding. */
3373 /* Function specific options that are used by this function. */
3374 tree function_specific_target
; /* target options */
3375 tree function_specific_optimization
; /* optimization options */
3377 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3378 DECL_FUNCTION_CODE. Otherwise unused.
3379 ??? The bitfield needs to be able to hold all target function
3381 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3382 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3384 unsigned static_ctor_flag
: 1;
3385 unsigned static_dtor_flag
: 1;
3386 unsigned uninlinable
: 1;
3388 unsigned possibly_inlined
: 1;
3389 unsigned novops_flag
: 1;
3390 unsigned returns_twice_flag
: 1;
3391 unsigned malloc_flag
: 1;
3392 unsigned operator_new_flag
: 1;
3393 unsigned declared_inline_flag
: 1;
3394 unsigned regdecl_flag
: 1;
3396 unsigned no_inline_warning_flag
: 1;
3397 unsigned no_instrument_function_entry_exit
: 1;
3398 unsigned no_limit_stack
: 1;
3399 unsigned disregard_inline_limits
: 1;
3400 unsigned pure_flag
: 1;
3401 unsigned looping_const_or_pure_flag
: 1;
3407 /* The source language of the translation-unit. */
3408 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3409 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3411 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3413 struct GTY(()) tree_translation_unit_decl
{
3414 struct tree_decl_common common
;
3415 /* Source language of this translation unit. Used for DWARF output. */
3416 const char * GTY((skip(""))) language
;
3417 /* TODO: Non-optimization used to build this translation unit. */
3418 /* TODO: Root of a partial DWARF tree for global types and decls. */
3421 /* A vector of all translation-units. */
3422 extern GTY (()) VEC(tree
,gc
) *all_translation_units
;
3424 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3425 #define DECL_ORIGINAL_TYPE(NODE) \
3426 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3428 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3429 into stabs. Instead it will generate cross reference ('x') of names.
3430 This uses the same flag as DECL_EXTERNAL. */
3431 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3432 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3434 /* Getter of the imported declaration associated to the
3435 IMPORTED_DECL node. */
3436 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3437 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3439 struct GTY(()) tree_type_decl
{
3440 struct tree_decl_non_common common
;
3444 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3445 To reduce overhead, the nodes containing the statements are not trees.
3446 This avoids the overhead of tree_common on all linked list elements.
3448 Use the interface in tree-iterator.h to access this node. */
3450 #define STATEMENT_LIST_HEAD(NODE) \
3451 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3452 #define STATEMENT_LIST_TAIL(NODE) \
3453 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3455 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3457 struct tree_statement_list_node
*prev
;
3458 struct tree_statement_list_node
*next
;
3462 struct GTY(()) tree_statement_list
3464 struct tree_common common
;
3465 struct tree_statement_list_node
*head
;
3466 struct tree_statement_list_node
*tail
;
3470 /* Optimization options used by a function. */
3472 struct GTY(()) tree_optimization_option
{
3473 struct tree_common common
;
3475 /* The optimization options used by the user. */
3476 struct cl_optimization opts
;
3479 #define TREE_OPTIMIZATION(NODE) \
3480 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3482 /* Return a tree node that encapsulates the current optimization options. */
3483 extern tree
build_optimization_node (void);
3485 /* Target options used by a function. */
3487 struct GTY(()) tree_target_option
{
3488 struct tree_common common
;
3490 /* The optimization options used by the user. */
3491 struct cl_target_option opts
;
3494 #define TREE_TARGET_OPTION(NODE) \
3495 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3497 /* Return a tree node that encapsulates the current target options. */
3498 extern tree
build_target_option_node (void);
3501 /* Define the overall contents of a tree node.
3502 It may be any of the structures declared above
3503 for various types of node. */
3505 union GTY ((ptr_alias (union lang_tree_node
),
3506 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3507 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3508 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3509 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3510 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3511 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3512 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3513 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3514 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3515 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3516 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3517 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3518 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3519 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3520 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3521 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3522 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3523 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3524 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3525 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3526 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3527 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3528 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3529 struct tree_translation_unit_decl
GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3530 translation_unit_decl
;
3531 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
3532 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3533 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3534 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3535 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3536 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3537 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3538 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3539 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3540 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3541 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3542 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3545 /* Standard named or nameless data types of the C compiler. */
3568 TI_INTEGER_MINUS_ONE
,
3585 TI_COMPLEX_INTEGER_TYPE
,
3586 TI_COMPLEX_FLOAT_TYPE
,
3587 TI_COMPLEX_DOUBLE_TYPE
,
3588 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3592 TI_LONG_DOUBLE_TYPE
,
3596 TI_LONG_DOUBLE_PTR_TYPE
,
3597 TI_INTEGER_PTR_TYPE
,
3606 TI_VA_LIST_GPR_COUNTER_FIELD
,
3607 TI_VA_LIST_FPR_COUNTER_FIELD
,
3614 TI_DFLOAT32_PTR_TYPE
,
3615 TI_DFLOAT64_PTR_TYPE
,
3616 TI_DFLOAT128_PTR_TYPE
,
3625 TI_SAT_LLFRACT_TYPE
,
3626 TI_SAT_USFRACT_TYPE
,
3628 TI_SAT_ULFRACT_TYPE
,
3629 TI_SAT_ULLFRACT_TYPE
,
3641 TI_SAT_LLACCUM_TYPE
,
3642 TI_SAT_USACCUM_TYPE
,
3644 TI_SAT_ULACCUM_TYPE
,
3645 TI_SAT_ULLACCUM_TYPE
,
3691 TI_OPTIMIZATION_DEFAULT
,
3692 TI_OPTIMIZATION_CURRENT
,
3693 TI_TARGET_OPTION_DEFAULT
,
3694 TI_TARGET_OPTION_CURRENT
,
3695 TI_CURRENT_TARGET_PRAGMA
,
3696 TI_CURRENT_OPTIMIZE_PRAGMA
,
3701 extern GTY(()) tree global_trees
[TI_MAX
];
3703 #define error_mark_node global_trees[TI_ERROR_MARK]
3705 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3706 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3707 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3708 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3709 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3711 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3712 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3713 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3714 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3715 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3717 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3718 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3720 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3721 #define integer_one_node global_trees[TI_INTEGER_ONE]
3722 #define integer_three_node global_trees[TI_INTEGER_THREE]
3723 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3724 #define size_zero_node global_trees[TI_SIZE_ZERO]
3725 #define size_one_node global_trees[TI_SIZE_ONE]
3726 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3727 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3728 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3730 /* Base access nodes. */
3731 #define access_public_node global_trees[TI_PUBLIC]
3732 #define access_protected_node global_trees[TI_PROTECTED]
3733 #define access_private_node global_trees[TI_PRIVATE]
3735 #define null_pointer_node global_trees[TI_NULL_POINTER]
3737 #define float_type_node global_trees[TI_FLOAT_TYPE]
3738 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3739 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3741 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3742 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3743 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3744 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3746 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3747 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3748 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3749 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3751 #define void_type_node global_trees[TI_VOID_TYPE]
3752 /* The C type `void *'. */
3753 #define ptr_type_node global_trees[TI_PTR_TYPE]
3754 /* The C type `const void *'. */
3755 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3756 /* The C type `size_t'. */
3757 #define size_type_node global_trees[TI_SIZE_TYPE]
3758 #define pid_type_node global_trees[TI_PID_TYPE]
3759 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3760 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3761 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3762 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3763 /* The C type `FILE *'. */
3764 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3766 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3767 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3768 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3770 /* The decimal floating point types. */
3771 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3772 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3773 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3774 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3775 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3776 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3778 /* The fixed-point types. */
3779 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3780 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3781 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3782 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3783 #define sat_unsigned_short_fract_type_node \
3784 global_trees[TI_SAT_USFRACT_TYPE]
3785 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3786 #define sat_unsigned_long_fract_type_node \
3787 global_trees[TI_SAT_ULFRACT_TYPE]
3788 #define sat_unsigned_long_long_fract_type_node \
3789 global_trees[TI_SAT_ULLFRACT_TYPE]
3790 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3791 #define fract_type_node global_trees[TI_FRACT_TYPE]
3792 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3793 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3794 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3795 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3796 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3797 #define unsigned_long_long_fract_type_node \
3798 global_trees[TI_ULLFRACT_TYPE]
3799 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3800 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3801 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3802 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3803 #define sat_unsigned_short_accum_type_node \
3804 global_trees[TI_SAT_USACCUM_TYPE]
3805 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3806 #define sat_unsigned_long_accum_type_node \
3807 global_trees[TI_SAT_ULACCUM_TYPE]
3808 #define sat_unsigned_long_long_accum_type_node \
3809 global_trees[TI_SAT_ULLACCUM_TYPE]
3810 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3811 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3812 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3813 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3814 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3815 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3816 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3817 #define unsigned_long_long_accum_type_node \
3818 global_trees[TI_ULLACCUM_TYPE]
3819 #define qq_type_node global_trees[TI_QQ_TYPE]
3820 #define hq_type_node global_trees[TI_HQ_TYPE]
3821 #define sq_type_node global_trees[TI_SQ_TYPE]
3822 #define dq_type_node global_trees[TI_DQ_TYPE]
3823 #define tq_type_node global_trees[TI_TQ_TYPE]
3824 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3825 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3826 #define usq_type_node global_trees[TI_USQ_TYPE]
3827 #define udq_type_node global_trees[TI_UDQ_TYPE]
3828 #define utq_type_node global_trees[TI_UTQ_TYPE]
3829 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3830 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3831 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3832 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3833 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3834 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3835 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3836 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3837 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3838 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3839 #define ha_type_node global_trees[TI_HA_TYPE]
3840 #define sa_type_node global_trees[TI_SA_TYPE]
3841 #define da_type_node global_trees[TI_DA_TYPE]
3842 #define ta_type_node global_trees[TI_TA_TYPE]
3843 #define uha_type_node global_trees[TI_UHA_TYPE]
3844 #define usa_type_node global_trees[TI_USA_TYPE]
3845 #define uda_type_node global_trees[TI_UDA_TYPE]
3846 #define uta_type_node global_trees[TI_UTA_TYPE]
3847 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3848 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3849 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3850 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3851 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3852 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3853 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3854 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3856 /* The node that should be placed at the end of a parameter list to
3857 indicate that the function does not take a variable number of
3858 arguments. The TREE_VALUE will be void_type_node and there will be
3859 no TREE_CHAIN. Language-independent code should not assume
3860 anything else about this node. */
3861 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3863 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3864 #define MAIN_NAME_P(NODE) \
3865 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3867 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3869 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3870 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3872 /* Default/current target options (TARGET_OPTION_NODE). */
3873 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3874 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3876 /* Default tree list option(), optimize() pragmas to be linked into the
3878 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3879 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3881 /* An enumeration of the standard C integer types. These must be
3882 ordered so that shorter types appear before longer ones, and so
3883 that signed types appear before unsigned ones, for the correct
3884 functioning of interpret_integer() in c-lex.c. */
3885 enum integer_type_kind
3897 itk_unsigned_long_long
,
3899 itk_unsigned_int128
,
3903 typedef enum integer_type_kind integer_type_kind
;
3905 /* The standard C integer types. Use integer_type_kind to index into
3907 extern GTY(()) tree integer_types
[itk_none
];
3909 #define char_type_node integer_types[itk_char]
3910 #define signed_char_type_node integer_types[itk_signed_char]
3911 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3912 #define short_integer_type_node integer_types[itk_short]
3913 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3914 #define integer_type_node integer_types[itk_int]
3915 #define unsigned_type_node integer_types[itk_unsigned_int]
3916 #define long_integer_type_node integer_types[itk_long]
3917 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3918 #define long_long_integer_type_node integer_types[itk_long_long]
3919 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3920 #define int128_integer_type_node integer_types[itk_int128]
3921 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3923 /* A pointer-to-function member type looks like:
3930 If __pfn is NULL, it is a NULL pointer-to-member-function.
3932 (Because the vtable is always the first thing in the object, we
3933 don't need its offset.) If the function is virtual, then PFN is
3934 one plus twice the index into the vtable; otherwise, it is just a
3935 pointer to the function.
3937 Unfortunately, using the lowest bit of PFN doesn't work in
3938 architectures that don't impose alignment requirements on function
3939 addresses, or that use the lowest bit to tell one ISA from another,
3940 for example. For such architectures, we use the lowest bit of
3941 DELTA instead of the lowest bit of the PFN, and DELTA will be
3944 enum ptrmemfunc_vbit_where_t
3946 ptrmemfunc_vbit_in_pfn
,
3947 ptrmemfunc_vbit_in_delta
3950 #define NULL_TREE (tree) NULL
3952 extern tree
decl_assembler_name (tree
);
3953 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3954 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3956 /* Compute the number of bytes occupied by 'node'. This routine only
3957 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3959 extern size_t tree_size (const_tree
);
3961 /* Compute the number of bytes occupied by a tree with code CODE. This
3962 function cannot be used for TREE_VEC codes, which are of variable
3964 extern size_t tree_code_size (enum tree_code
);
3966 /* Lowest level primitive for allocating a node.
3967 The TREE_CODE is the only argument. Contents are initialized
3968 to zero except for a few of the common fields. */
3970 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3971 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3973 /* Make a copy of a node, with all the same contents. */
3975 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3976 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3978 /* Make a copy of a chain of TREE_LIST nodes. */
3980 extern tree
copy_list (tree
);
3983 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3984 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3986 /* Make a TREE_VEC. */
3988 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3989 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3991 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3992 The name is supplied as a char *. */
3994 extern tree
get_identifier (const char *);
3996 #if GCC_VERSION >= 3000
3997 #define get_identifier(str) \
3998 (__builtin_constant_p (str) \
3999 ? get_identifier_with_length ((str), strlen (str)) \
4000 : get_identifier (str))
4004 /* Identical to get_identifier, except that the length is assumed
4007 extern tree
get_identifier_with_length (const char *, size_t);
4009 /* If an identifier with the name TEXT (a null-terminated string) has
4010 previously been referred to, return that node; otherwise return
4013 extern tree
maybe_get_identifier (const char *);
4015 /* Construct various types of nodes. */
4017 extern tree
build_nt (enum tree_code
, ...);
4018 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
4020 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
4021 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4022 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4023 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4024 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4025 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4026 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4027 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4028 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4029 tree MEM_STAT_DECL
);
4030 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4031 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4032 tree MEM_STAT_DECL
);
4033 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4034 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4035 tree
, tree MEM_STAT_DECL
);
4036 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4037 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4039 /* _loc versions of build[1-6]. */
4042 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
4043 tree arg1 MEM_STAT_DECL
)
4045 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
4046 if (CAN_HAVE_LOCATION_P (t
))
4047 SET_EXPR_LOCATION (t
, loc
);
4050 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4053 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4054 tree arg1 MEM_STAT_DECL
)
4056 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4057 if (CAN_HAVE_LOCATION_P (t
))
4058 SET_EXPR_LOCATION (t
, loc
);
4061 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4064 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4065 tree arg1
, tree arg2 MEM_STAT_DECL
)
4067 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4068 if (CAN_HAVE_LOCATION_P (t
))
4069 SET_EXPR_LOCATION (t
, loc
);
4072 #define build3_loc(l,c,t1,t2,t3,t4) \
4073 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4076 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4077 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
4079 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4080 if (CAN_HAVE_LOCATION_P (t
))
4081 SET_EXPR_LOCATION (t
, loc
);
4084 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4085 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4088 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4089 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4091 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
4092 arg4 PASS_MEM_STAT
);
4093 if (CAN_HAVE_LOCATION_P (t
))
4094 SET_EXPR_LOCATION (t
, loc
);
4097 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4098 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4101 build6_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4102 tree arg1
, tree arg2
, tree arg3
, tree arg4
,
4103 tree arg5 MEM_STAT_DECL
)
4105 tree t
= build6_stat (code
, type
, arg0
, arg1
, arg2
, arg3
, arg4
,
4106 arg5 PASS_MEM_STAT
);
4107 if (CAN_HAVE_LOCATION_P (t
))
4108 SET_EXPR_LOCATION (t
, loc
);
4111 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \
4112 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4114 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4115 #define build_var_debug_value(t1,t2) \
4116 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4118 /* Constructs double_int from tree CST. */
4120 static inline double_int
4121 tree_to_double_int (const_tree cst
)
4123 return TREE_INT_CST (cst
);
4126 extern tree
double_int_to_tree (tree
, double_int
);
4127 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4128 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4130 /* Create an INT_CST node with a CST value zero extended. */
4133 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4135 return double_int_to_tree (type
, uhwi_to_double_int (cst
));
4138 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4139 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4140 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4141 extern tree
build_vector (tree
, tree
);
4142 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4143 extern tree
build_vector_from_val (tree
, tree
);
4144 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4145 extern tree
build_constructor_single (tree
, tree
, tree
);
4146 extern tree
build_constructor_from_list (tree
, tree
);
4147 extern tree
build_real_from_int_cst (tree
, const_tree
);
4148 extern tree
build_complex (tree
, tree
, tree
);
4149 extern tree
build_one_cst (tree
);
4150 extern tree
build_zero_cst (tree
);
4151 extern tree
build_string (int, const char *);
4152 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4153 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4154 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4155 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4156 extern tree
build_decl_stat (location_t
, enum tree_code
,
4157 tree
, tree MEM_STAT_DECL
);
4158 extern tree
build_fn_decl (const char *, tree
);
4159 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4160 extern tree
build_translation_unit_decl (tree
);
4161 extern tree
build_block (tree
, tree
, tree
, tree
);
4162 extern tree
build_empty_stmt (location_t
);
4163 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4165 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4166 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4168 extern tree
build_call_nary (tree
, tree
, int, ...);
4169 extern tree
build_call_valist (tree
, tree
, int, va_list);
4170 #define build_call_array(T1,T2,N,T3)\
4171 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4172 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4173 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4175 /* Construct various nodes representing data types. */
4177 extern tree
make_signed_type (int);
4178 extern tree
make_unsigned_type (int);
4179 extern tree
signed_or_unsigned_type_for (int, tree
);
4180 extern tree
signed_type_for (tree
);
4181 extern tree
unsigned_type_for (tree
);
4182 extern void initialize_sizetypes (void);
4183 extern void set_sizetype (tree
);
4184 extern void fixup_unsigned_type (tree
);
4185 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4186 extern tree
build_pointer_type (tree
);
4187 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4188 extern tree
build_reference_type (tree
);
4189 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4190 extern tree
build_vector_type (tree innertype
, int nunits
);
4191 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4192 extern tree
build_type_no_quals (tree
);
4193 extern tree
build_index_type (tree
);
4194 extern tree
build_array_type (tree
, tree
);
4195 extern tree
build_nonshared_array_type (tree
, tree
);
4196 extern tree
build_function_type (tree
, tree
);
4197 extern tree
build_function_type_list (tree
, ...);
4198 extern tree
build_function_type_skip_args (tree
, bitmap
);
4199 extern tree
build_function_decl_skip_args (tree
, bitmap
);
4200 extern tree
build_varargs_function_type_list (tree
, ...);
4201 extern tree
build_method_type_directly (tree
, tree
, tree
);
4202 extern tree
build_method_type (tree
, tree
);
4203 extern tree
build_offset_type (tree
, tree
);
4204 extern tree
build_complex_type (tree
);
4205 extern tree
array_type_nelts (const_tree
);
4206 extern bool in_array_bounds_p (tree
);
4207 extern bool range_in_array_bounds_p (tree
);
4209 extern tree
value_member (tree
, tree
);
4210 extern tree
purpose_member (const_tree
, tree
);
4211 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4212 extern tree
chain_index (int, tree
);
4214 extern int attribute_list_equal (const_tree
, const_tree
);
4215 extern int attribute_list_contained (const_tree
, const_tree
);
4216 extern int tree_int_cst_equal (const_tree
, const_tree
);
4217 extern int tree_int_cst_lt (const_tree
, const_tree
);
4218 extern int tree_int_cst_compare (const_tree
, const_tree
);
4219 extern int host_integerp (const_tree
, int)
4220 #ifndef ENABLE_TREE_CHECKING
4221 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4224 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4225 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4226 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4227 tree_low_cst (const_tree t
, int pos
)
4229 gcc_assert (host_integerp (t
, pos
));
4230 return TREE_INT_CST_LOW (t
);
4233 extern int tree_int_cst_msb (const_tree
);
4234 extern int tree_int_cst_sgn (const_tree
);
4235 extern int tree_int_cst_sign_bit (const_tree
);
4236 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4237 extern bool tree_expr_nonnegative_p (tree
);
4238 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4239 extern bool may_negate_without_overflow_p (const_tree
);
4240 extern tree
strip_array_types (tree
);
4241 extern tree
excess_precision_type (tree
);
4243 /* Construct various nodes representing fract or accum data types. */
4245 extern tree
make_fract_type (int, int, int);
4246 extern tree
make_accum_type (int, int, int);
4248 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4249 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4250 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4251 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4252 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4253 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4254 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4255 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4257 #define make_or_reuse_signed_fract_type(P) \
4258 make_or_reuse_fract_type (P, 0, 0)
4259 #define make_or_reuse_unsigned_fract_type(P) \
4260 make_or_reuse_fract_type (P, 1, 0)
4261 #define make_or_reuse_sat_signed_fract_type(P) \
4262 make_or_reuse_fract_type (P, 0, 1)
4263 #define make_or_reuse_sat_unsigned_fract_type(P) \
4264 make_or_reuse_fract_type (P, 1, 1)
4265 #define make_or_reuse_signed_accum_type(P) \
4266 make_or_reuse_accum_type (P, 0, 0)
4267 #define make_or_reuse_unsigned_accum_type(P) \
4268 make_or_reuse_accum_type (P, 1, 0)
4269 #define make_or_reuse_sat_signed_accum_type(P) \
4270 make_or_reuse_accum_type (P, 0, 1)
4271 #define make_or_reuse_sat_unsigned_accum_type(P) \
4272 make_or_reuse_accum_type (P, 1, 1)
4274 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4275 put the prototype here. Rtl.h does declare the prototype if
4276 tree.h had been included. */
4278 extern tree
make_tree (tree
, rtx
);
4280 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4283 Such modified types already made are recorded so that duplicates
4286 extern tree
build_type_attribute_variant (tree
, tree
);
4287 extern tree
build_decl_attribute_variant (tree
, tree
);
4288 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4290 /* Return 0 if the attributes for two types are incompatible, 1 if they
4291 are compatible, and 2 if they are nearly compatible (which causes a
4292 warning to be generated). */
4293 extern int comp_type_attributes (const_tree
, const_tree
);
4295 /* Structure describing an attribute and a function to handle it. */
4296 struct attribute_spec
4298 /* The name of the attribute (without any leading or trailing __),
4299 or NULL to mark the end of a table of attributes. */
4300 const char *const name
;
4301 /* The minimum length of the list of arguments of the attribute. */
4302 const int min_length
;
4303 /* The maximum length of the list of arguments of the attribute
4304 (-1 for no maximum). */
4305 const int max_length
;
4306 /* Whether this attribute requires a DECL. If it does, it will be passed
4307 from types of DECLs, function return types and array element types to
4308 the DECLs, function types and array types respectively; but when
4309 applied to a type in any other circumstances, it will be ignored with
4310 a warning. (If greater control is desired for a given attribute,
4311 this should be false, and the flags argument to the handler may be
4312 used to gain greater control in that case.) */
4313 const bool decl_required
;
4314 /* Whether this attribute requires a type. If it does, it will be passed
4315 from a DECL to the type of that DECL. */
4316 const bool type_required
;
4317 /* Whether this attribute requires a function (or method) type. If it does,
4318 it will be passed from a function pointer type to the target type,
4319 and from a function return type (which is not itself a function
4320 pointer type) to the function type. */
4321 const bool function_type_required
;
4322 /* Function to handle this attribute. NODE points to the node to which
4323 the attribute is to be applied. If a DECL, it should be modified in
4324 place; if a TYPE, a copy should be created. NAME is the name of the
4325 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4326 of the arguments (which may be NULL). FLAGS gives further information
4327 about the context of the attribute. Afterwards, the attributes will
4328 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4329 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4330 as well as in any other cases when the attributes should not be added
4331 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4332 applied to another type or DECL later may be returned;
4333 otherwise the return value should be NULL_TREE. This pointer may be
4334 NULL if no special handling is required beyond the checks implied
4335 by the rest of this structure. */
4336 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4337 int flags
, bool *no_add_attrs
);
4338 /* Specifies if attribute affects type's identity. */
4339 const bool affects_type_identity
;
4342 /* Flags that may be passed in the third argument of decl_attributes, and
4343 to handler functions for attributes. */
4344 enum attribute_flags
4346 /* The type passed in is the type of a DECL, and any attributes that
4347 should be passed in again to be applied to the DECL rather than the
4348 type should be returned. */
4349 ATTR_FLAG_DECL_NEXT
= 1,
4350 /* The type passed in is a function return type, and any attributes that
4351 should be passed in again to be applied to the function type rather
4352 than the return type should be returned. */
4353 ATTR_FLAG_FUNCTION_NEXT
= 2,
4354 /* The type passed in is an array element type, and any attributes that
4355 should be passed in again to be applied to the array type rather
4356 than the element type should be returned. */
4357 ATTR_FLAG_ARRAY_NEXT
= 4,
4358 /* The type passed in is a structure, union or enumeration type being
4359 created, and should be modified in place. */
4360 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4361 /* The attributes are being applied by default to a library function whose
4362 name indicates known behavior, and should be silently ignored if they
4363 are not in fact compatible with the function type. */
4364 ATTR_FLAG_BUILT_IN
= 16
4367 /* Default versions of target-overridable functions. */
4369 extern tree
merge_decl_attributes (tree
, tree
);
4370 extern tree
merge_type_attributes (tree
, tree
);
4372 /* Given a tree node and a string, return nonzero if the tree node is
4373 a valid attribute name for the string. */
4375 extern int is_attribute_p (const char *, const_tree
);
4377 /* Given an attribute name and a list of attributes, return the list element
4378 of the attribute or NULL_TREE if not found. */
4380 extern tree
lookup_attribute (const char *, tree
);
4382 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4385 extern tree
remove_attribute (const char *, tree
);
4387 /* Given two attributes lists, return a list of their union. */
4389 extern tree
merge_attributes (tree
, tree
);
4391 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4392 /* Given two Windows decl attributes lists, possibly including
4393 dllimport, return a list of their union . */
4394 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4396 /* Handle a "dllimport" or "dllexport" attribute. */
4397 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4400 /* Check whether CAND is suitable to be returned from get_qualified_type
4401 (BASE, TYPE_QUALS). */
4403 extern bool check_qualified_type (const_tree
, const_tree
, int);
4405 /* Return a version of the TYPE, qualified as indicated by the
4406 TYPE_QUALS, if one exists. If no qualified version exists yet,
4407 return NULL_TREE. */
4409 extern tree
get_qualified_type (tree
, int);
4411 /* Like get_qualified_type, but creates the type if it does not
4412 exist. This function never returns NULL_TREE. */
4414 extern tree
build_qualified_type (tree
, int);
4416 /* Create a variant of type T with alignment ALIGN. */
4418 extern tree
build_aligned_type (tree
, unsigned int);
4420 /* Like build_qualified_type, but only deals with the `const' and
4421 `volatile' qualifiers. This interface is retained for backwards
4422 compatibility with the various front-ends; new code should use
4423 build_qualified_type instead. */
4425 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4426 build_qualified_type ((TYPE), \
4427 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4428 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4430 /* Make a copy of a type node. */
4432 extern tree
build_distinct_type_copy (tree
);
4433 extern tree
build_variant_type_copy (tree
);
4435 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4436 fields. Optionally specify an alignment, and then lay it out. */
4438 extern void finish_builtin_struct (tree
, const char *,
4441 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4442 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4443 node, does nothing except for the first time. */
4445 extern void layout_type (tree
);
4447 /* These functions allow a front-end to perform a manual layout of a
4448 RECORD_TYPE. (For instance, if the placement of subsequent fields
4449 depends on the placement of fields so far.) Begin by calling
4450 start_record_layout. Then, call place_field for each of the
4451 fields. Then, call finish_record_layout. See layout_type for the
4452 default way in which these functions are used. */
4454 typedef struct record_layout_info_s
4456 /* The RECORD_TYPE that we are laying out. */
4458 /* The offset into the record so far, in bytes, not including bits in
4461 /* The last known alignment of SIZE. */
4462 unsigned int offset_align
;
4463 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4465 /* The alignment of the record so far, in bits. */
4466 unsigned int record_align
;
4467 /* The alignment of the record so far, ignoring #pragma pack and
4468 __attribute__ ((packed)), in bits. */
4469 unsigned int unpacked_align
;
4470 /* The previous field layed out. */
4472 /* The static variables (i.e., class variables, as opposed to
4473 instance variables) encountered in T. */
4474 VEC(tree
,gc
) *pending_statics
;
4475 /* Bits remaining in the current alignment group */
4476 int remaining_in_alignment
;
4477 /* True if we've seen a packed field that didn't have normal
4478 alignment anyway. */
4479 int packed_maybe_necessary
;
4480 } *record_layout_info
;
4482 extern record_layout_info
start_record_layout (tree
);
4483 extern tree
bit_from_pos (tree
, tree
);
4484 extern tree
byte_from_pos (tree
, tree
);
4485 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4486 extern void normalize_offset (tree
*, tree
*, unsigned int);
4487 extern tree
rli_size_unit_so_far (record_layout_info
);
4488 extern tree
rli_size_so_far (record_layout_info
);
4489 extern void normalize_rli (record_layout_info
);
4490 extern void place_field (record_layout_info
, tree
);
4491 extern void compute_record_mode (tree
);
4492 extern void finish_record_layout (record_layout_info
, int);
4494 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4495 return a canonicalized ..._TYPE node, so that duplicates are not made.
4496 How the hash code is computed is up to the caller, as long as any two
4497 callers that could hash identical-looking type nodes agree. */
4499 extern tree
type_hash_canon (unsigned int, tree
);
4501 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4502 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4503 fields. Call this only once for any given decl node.
4505 Second argument is the boundary that this field can be assumed to
4506 be starting at (in bits). Zero means it can be assumed aligned
4507 on any boundary that may be needed. */
4509 extern void layout_decl (tree
, unsigned);
4511 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4512 a previous call to layout_decl and calls it again. */
4514 extern void relayout_decl (tree
);
4516 /* Return the mode for data of a given size SIZE and mode class CLASS.
4517 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4518 The value is BLKmode if no other mode is found. This is like
4519 mode_for_size, but is passed a tree. */
4521 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4523 /* Return an expr equal to X but certainly not valid as an lvalue. */
4525 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4526 extern tree
non_lvalue_loc (location_t
, tree
);
4528 extern tree
convert (tree
, tree
);
4529 extern unsigned int expr_align (const_tree
);
4530 extern tree
expr_first (tree
);
4531 extern tree
expr_last (tree
);
4532 extern tree
size_in_bytes (const_tree
);
4533 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4534 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4535 extern tree
tree_expr_size (const_tree
);
4536 extern tree
bit_position (const_tree
);
4537 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4538 extern tree
byte_position (const_tree
);
4539 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4541 /* Define data structures, macros, and functions for handling sizes
4542 and the various types used to represent sizes. */
4546 SIZETYPE
, /* Normal representation of sizes in bytes. */
4547 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4548 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4549 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4552 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4554 #define sizetype sizetype_tab[(int) SIZETYPE]
4555 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4556 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4557 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4559 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4560 #define size_binop(CODE,T1,T2)\
4561 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4562 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4563 #define size_diffop(T1,T2)\
4564 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4565 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4567 #define size_int(L) size_int_kind (L, SIZETYPE)
4568 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4569 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4570 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4572 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4573 extern tree
round_up_loc (location_t
, tree
, int);
4574 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4575 extern tree
round_down_loc (location_t
, tree
, int);
4576 extern VEC(tree
,gc
) *get_pending_sizes (void);
4577 extern void put_pending_size (tree
);
4578 extern void put_pending_sizes (VEC(tree
,gc
) *);
4579 extern void finalize_size_functions (void);
4581 /* Type for sizes of data-type. */
4583 #define BITS_PER_UNIT_LOG \
4584 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4585 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4586 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4588 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4589 extern unsigned int maximum_field_alignment
;
4591 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4592 by making the last node in X point to Y.
4593 Returns X, except if X is 0 returns Y. */
4595 extern tree
chainon (tree
, tree
);
4597 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4599 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4600 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4602 /* Return the last tree node in a chain. */
4604 extern tree
tree_last (tree
);
4606 /* Reverse the order of elements in a chain, and return the new head. */
4608 extern tree
nreverse (tree
);
4610 /* Returns the length of a chain of nodes
4611 (number of chain pointers to follow before reaching a null pointer). */
4613 extern int list_length (const_tree
);
4615 /* Returns the number of FIELD_DECLs in a type. */
4617 extern int fields_length (const_tree
);
4619 /* Returns the first FIELD_DECL in a type. */
4621 extern tree
first_field (const_tree
);
4623 /* Given an initializer INIT, return TRUE if INIT is zero or some
4624 aggregate of zeros. Otherwise return FALSE. */
4626 extern bool initializer_zerop (const_tree
);
4628 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4630 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4632 /* Examine CTOR to discover:
4633 * how many scalar fields are set to nonzero values,
4634 and place it in *P_NZ_ELTS;
4635 * how many scalar fields in total are in CTOR,
4636 and place it in *P_ELT_COUNT.
4637 * if a type is a union, and the initializer from the constructor
4638 is not the largest element in the union, then set *p_must_clear.
4640 Return whether or not CTOR is a valid static constant initializer, the same
4641 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4643 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4646 extern HOST_WIDE_INT
count_type_elements (const_tree
, bool);
4648 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4650 extern int integer_zerop (const_tree
);
4652 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4654 extern int integer_onep (const_tree
);
4656 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4657 all of whose significant bits are 1. */
4659 extern int integer_all_onesp (const_tree
);
4661 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4662 exactly one bit 1. */
4664 extern int integer_pow2p (const_tree
);
4666 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4667 with a nonzero value. */
4669 extern int integer_nonzerop (const_tree
);
4671 extern bool cst_and_fits_in_hwi (const_tree
);
4672 extern tree
num_ending_zeros (const_tree
);
4674 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4677 extern int fixed_zerop (const_tree
);
4679 /* staticp (tree x) is nonzero if X is a reference to data allocated
4680 at a fixed address in memory. Returns the outermost data. */
4682 extern tree
staticp (tree
);
4684 /* save_expr (EXP) returns an expression equivalent to EXP
4685 but it can be used multiple times within context CTX
4686 and only evaluate EXP once. */
4688 extern tree
save_expr (tree
);
4690 /* Look inside EXPR and into any simple arithmetic operations. Return
4691 the innermost non-arithmetic node. */
4693 extern tree
skip_simple_arithmetic (tree
);
4695 /* Return which tree structure is used by T. */
4697 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4699 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4700 size or offset that depends on a field within a record. */
4702 extern bool contains_placeholder_p (const_tree
);
4704 /* This macro calls the above function but short-circuits the common
4705 case of a constant to save time. Also check for null. */
4707 #define CONTAINS_PLACEHOLDER_P(EXP) \
4708 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4710 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4711 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4714 extern bool type_contains_placeholder_p (tree
);
4716 /* Given a tree EXP, find all occurences of references to fields
4717 in a PLACEHOLDER_EXPR and place them in vector REFS without
4718 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4719 we assume here that EXP contains only arithmetic expressions
4720 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4723 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
4725 /* This macro calls the above function but short-circuits the common
4726 case of a constant to save time and also checks for NULL. */
4728 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4730 if((EXP) && !TREE_CONSTANT (EXP)) \
4731 find_placeholder_in_expr (EXP, V); \
4734 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4735 return a tree with all occurrences of references to F in a
4736 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4737 CONST_DECLs. Note that we assume here that EXP contains only
4738 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4739 occurring only in their argument list. */
4741 extern tree
substitute_in_expr (tree
, tree
, tree
);
4743 /* This macro calls the above function but short-circuits the common
4744 case of a constant to save time and also checks for NULL. */
4746 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4747 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4749 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4750 for it within OBJ, a tree that is an object or a chain of references. */
4752 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4754 /* This macro calls the above function but short-circuits the common
4755 case of a constant to save time and also checks for NULL. */
4757 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4758 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4759 : substitute_placeholder_in_expr (EXP, OBJ))
4761 /* variable_size (EXP) is like save_expr (EXP) except that it
4762 is for the special case of something that is part of a
4763 variable size for a data type. It makes special arrangements
4764 to compute the value at the right time when the data type
4765 belongs to a function parameter. */
4767 extern tree
variable_size (tree
);
4769 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4770 but it can be used multiple times
4771 and only evaluate the subexpressions once. */
4773 extern tree
stabilize_reference (tree
);
4775 /* Subroutine of stabilize_reference; this is called for subtrees of
4776 references. Any expression with side-effects must be put in a SAVE_EXPR
4777 to ensure that it is only evaluated once. */
4779 extern tree
stabilize_reference_1 (tree
);
4781 /* Return EXP, stripped of any conversions to wider types
4782 in such a way that the result of converting to type FOR_TYPE
4783 is the same as if EXP were converted to FOR_TYPE.
4784 If FOR_TYPE is 0, it signifies EXP's type. */
4786 extern tree
get_unwidened (tree
, tree
);
4788 /* Return OP or a simpler expression for a narrower value
4789 which can be sign-extended or zero-extended to give back OP.
4790 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4791 or 0 if the value should be sign-extended. */
4793 extern tree
get_narrower (tree
, int *);
4795 /* Return true if T is an expression that get_inner_reference handles. */
4798 handled_component_p (const_tree t
)
4800 switch (TREE_CODE (t
))
4805 case ARRAY_RANGE_REF
:
4806 case VIEW_CONVERT_EXPR
:
4816 /* Given an expression EXP that is a handled_component_p,
4817 look for the ultimate containing object, which is returned and specify
4818 the access position and size. */
4820 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4821 tree
*, enum machine_mode
*, int *, int *,
4824 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4825 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4826 EXP is marked as PACKED. */
4828 extern bool contains_packed_reference (const_tree exp
);
4830 /* Return a tree of sizetype representing the size, in bytes, of the element
4831 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4833 extern tree
array_ref_element_size (tree
);
4835 /* Return a tree representing the lower bound of the array mentioned in
4836 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4838 extern tree
array_ref_low_bound (tree
);
4840 /* Return a tree representing the upper bound of the array mentioned in
4841 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4843 extern tree
array_ref_up_bound (tree
);
4845 /* Return a tree representing the offset, in bytes, of the field referenced
4846 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4848 extern tree
component_ref_field_offset (tree
);
4850 /* Given a DECL or TYPE, return the scope in which it was declared, or
4851 NUL_TREE if there is no containing scope. */
4853 extern tree
get_containing_scope (const_tree
);
4855 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4857 extern tree
decl_function_context (const_tree
);
4859 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4860 this _DECL with its context, or zero if none. */
4861 extern tree
decl_type_context (const_tree
);
4863 /* Return 1 if EXPR is the real constant zero. */
4864 extern int real_zerop (const_tree
);
4866 /* Declare commonly used variables for tree structure. */
4868 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4869 Zero means allow extended lvalues. */
4871 extern int pedantic_lvalues
;
4873 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4875 extern GTY(()) tree current_function_decl
;
4877 /* Nonzero means a FUNC_BEGIN label was emitted. */
4878 extern GTY(()) const char * current_function_func_begin_label
;
4880 /* Iterator for going through the function arguments. */
4882 tree next
; /* TREE_LIST pointing to the next argument */
4883 } function_args_iterator
;
4885 /* Initialize the iterator I with arguments from function FNDECL */
4888 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
4890 i
->next
= TYPE_ARG_TYPES (fntype
);
4893 /* Return a pointer that holds the next argument if there are more arguments to
4894 handle, otherwise return NULL. */
4896 static inline tree
*
4897 function_args_iter_cond_ptr (function_args_iterator
*i
)
4899 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4902 /* Return the next argument if there are more arguments to handle, otherwise
4906 function_args_iter_cond (function_args_iterator
*i
)
4908 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4911 /* Advance to the next argument. */
4913 function_args_iter_next (function_args_iterator
*i
)
4915 gcc_assert (i
->next
!= NULL_TREE
);
4916 i
->next
= TREE_CHAIN (i
->next
);
4919 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4922 inlined_function_outer_scope_p (const_tree block
)
4924 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
4927 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4928 to point to the next tree element. ITER is an instance of
4929 function_args_iterator used to iterate the arguments. */
4930 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4931 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4932 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4933 function_args_iter_next (&(ITER)))
4935 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4936 to the next tree element. ITER is an instance of function_args_iterator
4937 used to iterate the arguments. */
4938 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4939 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4940 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4941 function_args_iter_next (&(ITER)))
4946 extern unsigned crc32_string (unsigned, const char *);
4947 extern void clean_symbol_name (char *);
4948 extern tree
get_file_function_name (const char *);
4949 extern tree
get_callee_fndecl (const_tree
);
4950 extern int type_num_arguments (const_tree
);
4951 extern bool associative_tree_code (enum tree_code
);
4952 extern bool commutative_tree_code (enum tree_code
);
4953 extern bool commutative_ternary_tree_code (enum tree_code
);
4954 extern tree
upper_bound_in_type (tree
, tree
);
4955 extern tree
lower_bound_in_type (tree
, tree
);
4956 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4957 extern tree
call_expr_arg (tree
, int);
4958 extern tree
*call_expr_argp (tree
, int);
4959 extern tree
create_artificial_label (location_t
);
4960 extern const char *get_name (tree
);
4961 extern bool stdarg_p (const_tree
);
4962 extern bool prototype_p (tree
);
4963 extern bool is_typedef_decl (tree x
);
4964 extern bool typedef_variant_p (tree
);
4965 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4966 extern tree
build_low_bits_mask (tree
, unsigned);
4967 extern tree
tree_strip_nop_conversions (tree
);
4968 extern tree
tree_strip_sign_nop_conversions (tree
);
4969 extern tree
lhd_gcc_personality (void);
4970 extern void assign_assembler_name_if_neeeded (tree
);
4971 extern void warn_deprecated_use (tree
, tree
);
4975 extern void change_decl_assembler_name (tree
, tree
);
4978 extern tree
unshare_expr (tree
);
4982 extern void expand_expr_stmt (tree
);
4983 extern int warn_if_unused_value (const_tree
, location_t
);
4984 extern void expand_label (tree
);
4985 extern void expand_goto (tree
);
4987 extern rtx
expand_stack_save (void);
4988 extern void expand_stack_restore (tree
);
4989 extern void expand_return (tree
);
4992 extern void using_eh_for_cleanups (void);
4994 /* In fold-const.c */
4996 /* Non-zero if we are folding constants inside an initializer; zero
4998 extern int folding_initializer
;
5000 /* Convert between trees and native memory representation. */
5001 extern int native_encode_expr (const_tree
, unsigned char *, int);
5002 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
5004 /* Fold constants as much as possible in an expression.
5005 Returns the simplified expression.
5006 Acts only on the top level of the expression;
5007 if the argument itself cannot be simplified, its
5008 subexpressions are not changed. */
5010 extern tree
fold (tree
);
5011 #define fold_unary(CODE,T1,T2)\
5012 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5013 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
5014 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5015 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5016 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
5017 #define fold_binary(CODE,T1,T2,T3)\
5018 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5019 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5020 #define fold_ternary(CODE,T1,T2,T3,T4)\
5021 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5022 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5023 #define fold_build1(c,t1,t2)\
5024 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5025 #define fold_build1_loc(l,c,t1,t2)\
5026 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5027 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
5028 tree MEM_STAT_DECL
);
5029 #define fold_build2(c,t1,t2,t3)\
5030 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5031 #define fold_build2_loc(l,c,t1,t2,t3)\
5032 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5033 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
5034 tree MEM_STAT_DECL
);
5035 #define fold_build3(c,t1,t2,t3,t4)\
5036 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5037 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5038 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5039 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
5040 tree MEM_STAT_DECL
);
5041 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
5042 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5043 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5044 #define fold_build_call_array(T1,T2,N,T4)\
5045 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5046 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
5047 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5048 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5049 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
5050 extern bool fold_convertible_p (const_tree
, const_tree
);
5051 #define fold_convert(T1,T2)\
5052 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5053 extern tree
fold_convert_loc (location_t
, tree
, tree
);
5054 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
5055 extern tree
fold_ignored_result (tree
);
5056 extern tree
fold_abs_const (tree
, tree
);
5057 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
5058 extern void fold_defer_overflow_warnings (void);
5059 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
5060 extern void fold_undefer_and_ignore_overflow_warnings (void);
5061 extern bool fold_deferring_overflow_warnings_p (void);
5062 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
5064 enum operand_equal_flag
5070 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
5071 extern int multiple_of_p (tree
, const_tree
, const_tree
);
5072 #define omit_one_operand(T1,T2,T3)\
5073 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5074 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
5075 #define omit_two_operands(T1,T2,T3,T4)\
5076 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5077 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
5078 #define invert_truthvalue(T)\
5079 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5080 extern tree
invert_truthvalue_loc (location_t
, tree
);
5081 extern tree
fold_truth_not_expr (location_t
, tree
);
5082 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
5083 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
5084 extern tree
fold_read_from_constant_string (tree
);
5085 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
, int);
5086 #define build_fold_addr_expr(T)\
5087 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5088 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
5089 #define build_fold_addr_expr_with_type(T,TYPE)\
5090 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5091 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
5092 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
5093 extern tree
fold_strip_sign_ops (tree
);
5094 #define build_fold_indirect_ref(T)\
5095 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5096 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
5097 #define fold_indirect_ref(T)\
5098 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5099 extern tree
fold_indirect_ref_loc (location_t
, tree
);
5100 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
5101 #define build_simple_mem_ref(T)\
5102 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5103 extern double_int
mem_ref_offset (const_tree
);
5104 extern tree
reference_alias_ptr_type (const_tree
);
5105 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
5106 extern tree
constant_boolean_node (int, tree
);
5107 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5109 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5110 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5112 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5113 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5115 extern bool tree_expr_nonzero_p (tree
);
5116 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5117 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5119 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5120 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5121 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5123 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5124 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5125 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5127 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5129 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5130 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5131 enum tree_code
, tree
, tree
, tree
);
5132 extern void debug_fold_checksum (const_tree
);
5134 /* Return nonzero if CODE is a tree code that represents a truth value. */
5136 truth_value_p (enum tree_code code
)
5138 return (TREE_CODE_CLASS (code
) == tcc_comparison
5139 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5140 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5141 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5146 extern tree
fold_call_expr (location_t
, tree
, bool);
5147 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5148 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5149 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5150 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5151 enum built_in_function
);
5152 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5153 enum built_in_function
);
5154 extern tree
fold_builtin_strncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
);
5155 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5156 extern bool fold_builtin_next_arg (tree
, bool);
5157 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5158 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5159 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5160 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5161 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5162 extern tree
build_call_expr (tree
, int, ...);
5163 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5164 extern tree
c_strlen (tree
, int);
5165 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5166 extern tree
build_va_arg_indirect_ref (tree
);
5167 extern tree
build_string_literal (int, const char *);
5168 extern bool validate_arglist (const_tree
, ...);
5169 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5170 extern bool can_trust_pointer_alignment (void);
5171 extern unsigned int get_pointer_alignment (tree
, unsigned int);
5172 extern bool is_builtin_name (const char *);
5173 extern bool is_builtin_fn (tree
);
5174 extern unsigned int get_object_alignment (tree
, unsigned int);
5175 extern tree
fold_call_stmt (gimple
, bool);
5176 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5177 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5178 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5179 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5181 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5182 extern bool is_simple_builtin (tree
);
5183 extern bool is_inexpensive_builtin (tree
);
5186 extern tree
strip_float_extensions (tree
);
5189 extern int really_constant_p (const_tree
);
5190 extern bool decl_address_invariant_p (const_tree
);
5191 extern bool decl_address_ip_invariant_p (const_tree
);
5192 extern bool int_fits_type_p (const_tree
, const_tree
);
5193 #ifndef GENERATOR_FILE
5194 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5196 extern bool variably_modified_type_p (tree
, tree
);
5197 extern int tree_log2 (const_tree
);
5198 extern int tree_floor_log2 (const_tree
);
5199 extern int simple_cst_equal (const_tree
, const_tree
);
5200 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5201 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5202 const_tree
, hashval_t
);
5203 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5204 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5205 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5206 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5207 extern int type_list_equal (const_tree
, const_tree
);
5208 extern int chain_member (const_tree
, const_tree
);
5209 extern tree
type_hash_lookup (unsigned int, tree
);
5210 extern void type_hash_add (unsigned int, tree
);
5211 extern int simple_cst_list_equal (const_tree
, const_tree
);
5212 extern void dump_tree_statistics (void);
5213 extern void recompute_tree_invariant_for_addr_expr (tree
);
5214 extern bool needs_to_live_in_memory (const_tree
);
5215 extern tree
reconstruct_complex_type (tree
, tree
);
5217 extern int real_onep (const_tree
);
5218 extern int real_twop (const_tree
);
5219 extern int real_minus_onep (const_tree
);
5220 extern void init_ttree (void);
5221 extern void build_common_tree_nodes (bool);
5222 extern void build_common_tree_nodes_2 (int);
5223 extern void build_common_builtin_nodes (void);
5224 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5225 extern tree
build_range_type (tree
, tree
, tree
);
5226 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5227 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5228 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5229 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5231 extern tree
*tree_block (tree
);
5232 extern location_t
*block_nonartificial_location (tree
);
5233 extern location_t
tree_nonartificial_location (tree
);
5235 extern tree
block_ultimate_origin (const_tree
);
5237 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5239 /* In tree-nested.c */
5240 extern tree
build_addr (tree
, tree
);
5243 extern void expand_main_function (void);
5244 extern void expand_function_end (void);
5245 extern void expand_function_start (tree
);
5246 extern void stack_protect_prologue (void);
5247 extern void stack_protect_epilogue (void);
5248 extern void init_dummy_function_start (void);
5249 extern void expand_dummy_function_end (void);
5250 extern unsigned int init_function_for_compilation (void);
5251 extern void allocate_struct_function (tree
, bool);
5252 extern void push_struct_function (tree fndecl
);
5253 extern void init_function_start (tree
);
5254 extern bool use_register_for_decl (const_tree
);
5255 extern void generate_setjmp_warnings (void);
5256 extern void init_temp_slots (void);
5257 extern void free_temp_slots (void);
5258 extern void pop_temp_slots (void);
5259 extern void push_temp_slots (void);
5260 extern void preserve_temp_slots (rtx
);
5261 extern int aggregate_value_p (const_tree
, const_tree
);
5262 extern void push_function_context (void);
5263 extern void pop_function_context (void);
5264 extern gimple_seq
gimplify_parameters (void);
5266 /* In print-rtl.c */
5268 extern void print_rtl (FILE *, const_rtx
);
5271 /* In print-tree.c */
5272 extern void debug_tree (tree
);
5273 extern void debug_vec_tree (VEC(tree
,gc
) *);
5275 extern void dump_addr (FILE*, const char *, const void *);
5276 extern void print_node (FILE *, const char *, tree
, int);
5277 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5278 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5279 extern void indent_to (FILE *, int);
5282 /* In tree-inline.c: */
5283 extern bool debug_find_tree (tree
, tree
);
5284 /* This is in tree-inline.c since the routine uses
5285 data structures from the inliner. */
5286 extern tree
unsave_expr_now (tree
);
5287 extern tree
build_duplicate_type (tree
);
5291 /* Nonzero if this is a call to a function whose return value depends
5292 solely on its arguments, has no side effects, and does not read
5293 global memory. This corresponds to TREE_READONLY for function
5295 #define ECF_CONST (1 << 0)
5296 /* Nonzero if this is a call to "pure" function (like const function,
5297 but may read memory. This corresponds to DECL_PURE_P for function
5299 #define ECF_PURE (1 << 1)
5300 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5301 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5302 for function decls.*/
5303 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5304 /* Nonzero if this call will never return. */
5305 #define ECF_NORETURN (1 << 3)
5306 /* Nonzero if this is a call to malloc or a related function. */
5307 #define ECF_MALLOC (1 << 4)
5308 /* Nonzero if it is plausible that this is a call to alloca. */
5309 #define ECF_MAY_BE_ALLOCA (1 << 5)
5310 /* Nonzero if this is a call to a function that won't throw an exception. */
5311 #define ECF_NOTHROW (1 << 6)
5312 /* Nonzero if this is a call to setjmp or a related function. */
5313 #define ECF_RETURNS_TWICE (1 << 7)
5314 /* Nonzero if this call replaces the current stack frame. */
5315 #define ECF_SIBCALL (1 << 8)
5316 /* Function does not read or write memory (but may have side effects, so
5317 it does not necessarily fit ECF_CONST). */
5318 #define ECF_NOVOPS (1 << 9)
5319 /* The function does not lead to calls within current function unit. */
5320 #define ECF_LEAF (1 << 10)
5322 extern int flags_from_decl_or_type (const_tree
);
5323 extern int call_expr_flags (const_tree
);
5325 /* Call argument flags. */
5327 /* Nonzero if the argument is not dereferenced recursively, thus only
5328 directly reachable memory is read or written. */
5329 #define EAF_DIRECT (1 << 0)
5330 /* Nonzero if memory reached by the argument is not clobbered. */
5331 #define EAF_NOCLOBBER (1 << 1)
5332 /* Nonzero if the argument does not escape. */
5333 #define EAF_NOESCAPE (1 << 2)
5334 /* Nonzero if the argument is not used by the function. */
5335 #define EAF_UNUSED (1 << 3)
5337 /* Call return flags. */
5339 /* Mask for the argument number that is returned. Lower two bits of
5340 the return flags, encodes argument slots zero to three. */
5341 #define ERF_RETURN_ARG_MASK (3)
5342 /* Nonzero if the return value is equal to the argument number
5343 flags & ERF_RETURN_ARG_MASK. */
5344 #define ERF_RETURNS_ARG (1 << 2)
5345 /* Nonzero if the return value does not alias with anything. Functions
5346 with the malloc attribute have this set on their return value. */
5347 #define ERF_NOALIAS (1 << 3)
5349 extern int setjmp_call_p (const_tree
);
5350 extern bool gimple_alloca_call_p (const_gimple
);
5351 extern bool alloca_call_p (const_tree
);
5352 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
5353 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5357 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
5359 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5360 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5361 it should be modified in place; if a TYPE, a copy should be created
5362 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5363 information, in the form of a bitwise OR of flags in enum attribute_flags
5364 from tree.h. Depending on these flags, some attributes may be
5365 returned to be applied at a later stage (for example, to apply
5366 a decl attribute to the declaration rather than to its type). */
5367 extern tree
decl_attributes (tree
*, tree
, int);
5369 /* In integrate.c */
5370 extern void set_decl_abstract_flags (tree
, int);
5371 extern void set_decl_origin_self (tree
);
5373 /* In stor-layout.c */
5374 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5375 extern void fixup_signed_type (tree
);
5376 extern void internal_reference_types (void);
5377 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5380 extern tree
tree_output_constant_def (tree
);
5381 extern void make_decl_rtl (tree
);
5382 extern rtx
make_decl_rtl_for_debug (tree
);
5383 extern void make_decl_one_only (tree
, tree
);
5384 extern int supports_one_only (void);
5385 extern void resolve_unique_section (tree
, int, int);
5386 extern void mark_referenced (tree
);
5387 extern void mark_decl_referenced (tree
);
5388 extern void notice_global_symbol (tree
);
5389 extern void set_user_assembler_name (tree
, const char *);
5390 extern void process_pending_assemble_externals (void);
5391 extern void finish_aliases_1 (void);
5392 extern void finish_aliases_2 (void);
5393 extern void remove_unreachable_alias_pairs (void);
5394 extern bool decl_replaceable_p (tree
);
5395 extern bool decl_binds_to_current_def_p (tree
);
5397 /* Derived type for use by compute_visible_aliases and callers. A symbol
5398 alias set is a pointer set into which we enter IDENTIFIER_NODES bearing
5399 the canonicalised assembler-level symbol names corresponding to decls
5400 and their aliases. */
5401 typedef struct pointer_set_t symbol_alias_set_t
;
5403 extern void symbol_alias_set_destroy (symbol_alias_set_t
*);
5404 extern int symbol_alias_set_contains (const symbol_alias_set_t
*, tree
);
5405 extern symbol_alias_set_t
* propagate_aliases_backward (bool (*)
5406 (tree
, tree
, void *),
5410 extern void expand_computed_goto (tree
);
5411 extern bool parse_output_constraint (const char **, int, int, int,
5412 bool *, bool *, bool *);
5413 extern bool parse_input_constraint (const char **, int, int, int, int,
5414 const char * const *, bool *, bool *);
5415 extern void expand_asm_stmt (gimple
);
5416 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
5417 extern bool expand_switch_using_bit_tests_p (tree
, tree
, unsigned int,
5419 extern void expand_case (gimple
);
5420 extern void expand_decl (tree
);
5422 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5423 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5427 /* In dwarf2out.c */
5428 /* Interface of the DWARF2 unwind info support. */
5430 /* Generate a new label for the CFI info to refer to. */
5432 extern char *dwarf2out_cfi_label (bool);
5434 /* Entry point to update the canonical frame address (CFA). */
5436 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
5438 /* Add the CFI for saving a register window. */
5440 extern void dwarf2out_window_save (const char *);
5442 /* Entry point for saving a register to the stack. */
5444 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
5446 /* Entry point for saving the return address in the stack. */
5448 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
5450 /* Entry point for saving the return address in a register. */
5452 extern void dwarf2out_return_reg (const char *, unsigned);
5454 /* Entry point for saving the first register into the second. */
5456 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
5458 /* In tree-inline.c */
5460 /* The type of a set of already-visited pointers. Functions for creating
5461 and manipulating it are declared in pointer-set.h */
5462 struct pointer_set_t
;
5464 /* The type of a callback function for walking over tree structure. */
5466 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5468 /* The type of a callback function that represents a custom walk_tree. */
5470 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5471 void *, struct pointer_set_t
*);
5473 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5475 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5477 #define walk_tree(a,b,c,d) \
5478 walk_tree_1 (a, b, c, d, NULL)
5479 #define walk_tree_without_duplicates(a,b,c) \
5480 walk_tree_without_duplicates_1 (a, b, c, NULL)
5483 /* Assign the RTX to declaration. */
5485 extern void set_decl_rtl (tree
, rtx
);
5486 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5488 /* Enum and arrays used for tree allocation stats.
5489 Keep in sync with tree.c:tree_node_kind_names. */
5511 extern int tree_node_counts
[];
5512 extern int tree_node_sizes
[];
5514 /* True if we are in gimple form and the actions of the folders need to
5515 be restricted. False if we are not in gimple form and folding is not
5516 restricted to creating gimple expressions. */
5517 extern bool in_gimple_form
;
5520 extern tree
get_base_address (tree t
);
5521 extern void mark_addressable (tree
);
5525 struct GTY(()) tree_map_base
{
5529 extern int tree_map_base_eq (const void *, const void *);
5530 extern unsigned int tree_map_base_hash (const void *);
5531 extern int tree_map_base_marked_p (const void *);
5532 extern bool list_equal_p (const_tree
, const_tree
);
5534 /* Map from a tree to another tree. */
5536 struct GTY(()) tree_map
{
5537 struct tree_map_base base
;
5542 #define tree_map_eq tree_map_base_eq
5543 extern unsigned int tree_map_hash (const void *);
5544 #define tree_map_marked_p tree_map_base_marked_p
5546 /* Map from a decl tree to another tree. */
5548 struct GTY(()) tree_decl_map
{
5549 struct tree_map_base base
;
5553 #define tree_decl_map_eq tree_map_base_eq
5554 extern unsigned int tree_decl_map_hash (const void *);
5555 #define tree_decl_map_marked_p tree_map_base_marked_p
5557 /* Map from a tree to an int. */
5559 struct GTY(()) tree_int_map
{
5560 struct tree_map_base base
;
5564 #define tree_int_map_eq tree_map_base_eq
5565 #define tree_int_map_hash tree_map_base_hash
5566 #define tree_int_map_marked_p tree_map_base_marked_p
5568 /* Map from a tree to initialization/finalization priorities. */
5570 struct GTY(()) tree_priority_map
{
5571 struct tree_map_base base
;
5576 #define tree_priority_map_eq tree_map_base_eq
5577 #define tree_priority_map_hash tree_map_base_hash
5578 #define tree_priority_map_marked_p tree_map_base_marked_p
5582 tree
target_for_debug_bind (tree
);
5584 /* In tree-ssa-address.c. */
5585 extern tree
tree_mem_ref_addr (tree
, tree
);
5586 extern void copy_mem_ref_info (tree
, tree
);
5589 extern bool ssa_name_nonnegative_p (const_tree
);
5591 /* In tree-object-size.c. */
5592 extern void init_object_sizes (void);
5593 extern void fini_object_sizes (void);
5594 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5597 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5598 extern tree
build_personality_function (const char *);
5600 /* In tree-inline.c. */
5602 void init_inline_once (void);
5604 /* Compute the number of operands in an expression node NODE. For
5605 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5606 otherwise it is looked up from the node's code. */
5608 tree_operand_length (const_tree node
)
5610 if (VL_EXP_CLASS_P (node
))
5611 return VL_EXP_OPERAND_LENGTH (node
);
5613 return TREE_CODE_LENGTH (TREE_CODE (node
));
5616 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5617 have to go towards the end of tree.h so that union tree_node is fully
5618 defined by this point. */
5620 /* Structure containing iterator state. */
5621 typedef struct call_expr_arg_iterator_d
{
5622 tree t
; /* the call_expr */
5623 int n
; /* argument count */
5624 int i
; /* next argument index */
5625 } call_expr_arg_iterator
;
5627 typedef struct const_call_expr_arg_iterator_d
{
5628 const_tree t
; /* the call_expr */
5629 int n
; /* argument count */
5630 int i
; /* next argument index */
5631 } const_call_expr_arg_iterator
;
5633 /* Initialize the abstract argument list iterator object ITER with the
5634 arguments from CALL_EXPR node EXP. */
5636 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5639 iter
->n
= call_expr_nargs (exp
);
5644 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5647 iter
->n
= call_expr_nargs (exp
);
5651 /* Return the next argument from abstract argument list iterator object ITER,
5652 and advance its state. Return NULL_TREE if there are no more arguments. */
5654 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5657 if (iter
->i
>= iter
->n
)
5659 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5664 static inline const_tree
5665 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5668 if (iter
->i
>= iter
->n
)
5670 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5675 /* Initialize the abstract argument list iterator object ITER, then advance
5676 past and return the first argument. Useful in for expressions, e.g.
5677 for (arg = first_call_expr_arg (exp, &iter); arg;
5678 arg = next_call_expr_arg (&iter)) */
5680 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5682 init_call_expr_arg_iterator (exp
, iter
);
5683 return next_call_expr_arg (iter
);
5686 static inline const_tree
5687 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5689 init_const_call_expr_arg_iterator (exp
, iter
);
5690 return next_const_call_expr_arg (iter
);
5693 /* Test whether there are more arguments in abstract argument list iterator
5694 ITER, without changing its state. */
5696 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5698 return (iter
->i
< iter
->n
);
5702 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5704 return (iter
->i
< iter
->n
);
5707 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5708 (of type call_expr_arg_iterator) to hold the iteration state. */
5709 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5710 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5711 (arg) = next_call_expr_arg (&(iter)))
5713 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5714 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5715 (arg) = next_const_call_expr_arg (&(iter)))
5717 /* Return true if tree node T is a language-specific node. */
5719 is_lang_specific (tree t
)
5721 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5724 /* In gimple-low.c. */
5725 extern bool block_may_fallthru (const_tree
);
5727 #endif /* GCC_TREE_H */