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 \
121 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
123 /* Nonzero if CODE represents a reference. */
125 #define REFERENCE_CLASS_P(CODE)\
126 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
128 /* Nonzero if CODE represents a comparison. */
130 #define COMPARISON_CLASS_P(CODE)\
131 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
133 /* Nonzero if CODE represents a unary arithmetic expression. */
135 #define UNARY_CLASS_P(CODE)\
136 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
138 /* Nonzero if CODE represents a binary arithmetic expression. */
140 #define BINARY_CLASS_P(CODE)\
141 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
143 /* Nonzero if CODE represents a statement expression. */
145 #define STATEMENT_CLASS_P(CODE)\
146 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
148 /* Nonzero if CODE represents a function call-like expression with a
149 variable-length operand vector. */
151 #define VL_EXP_CLASS_P(CODE)\
152 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
154 /* Nonzero if CODE represents any other expression. */
156 #define EXPRESSION_CLASS_P(CODE)\
157 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
159 /* Returns nonzero iff CODE represents a type or declaration. */
161 #define IS_TYPE_OR_DECL_P(CODE)\
162 (TYPE_P (CODE) || DECL_P (CODE))
164 /* Returns nonzero iff CLASS is the tree-code class of an
167 #define IS_EXPR_CODE_CLASS(CLASS)\
168 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
170 /* Returns nonzero iff NODE is an expression of some kind. */
172 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
174 /* Number of argument-words in each kind of tree-node. */
176 extern const unsigned char tree_code_length
[];
177 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
179 /* Names of tree components. */
181 extern const char *const tree_code_name
[];
183 /* We have to be able to tell cgraph about the needed-ness of the target
184 of an alias. This requires that the decl have been defined. Aliases
185 that precede their definition have to be queued for later processing. */
187 /* The deferred processing proceeds in several passes. We memorize the
188 diagnostics emitted for a pair to prevent repeating messages when the
189 queue gets re-scanned after possible updates. */
192 ALIAS_DIAG_NONE
= 0x0,
193 ALIAS_DIAG_TO_UNDEF
= 0x1,
194 ALIAS_DIAG_TO_EXTERN
= 0x2
197 typedef struct GTY(()) alias_pair
201 int emitted_diags
; /* alias_diags already emitted for this pair. */
204 /* Define gc'd vector type. */
205 DEF_VEC_O(alias_pair
);
206 DEF_VEC_ALLOC_O(alias_pair
,gc
);
208 extern GTY(()) VEC(alias_pair
,gc
) * alias_pairs
;
211 /* Classify which part of the compiler has defined a given builtin function.
212 Note that we assume below that this is no more than two bits. */
221 /* Names for the above. */
222 extern const char *const built_in_class_names
[4];
224 /* Codes that identify the various built in functions
225 so that expand_call can identify them quickly. */
227 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
228 enum built_in_function
230 #include "builtins.def"
232 /* Complex division routines in libgcc. These are done via builtins
233 because emit_library_call_value can't handle complex values. */
234 BUILT_IN_COMPLEX_MUL_MIN
,
235 BUILT_IN_COMPLEX_MUL_MAX
236 = BUILT_IN_COMPLEX_MUL_MIN
237 + MAX_MODE_COMPLEX_FLOAT
238 - MIN_MODE_COMPLEX_FLOAT
,
240 BUILT_IN_COMPLEX_DIV_MIN
,
241 BUILT_IN_COMPLEX_DIV_MAX
242 = BUILT_IN_COMPLEX_DIV_MIN
243 + MAX_MODE_COMPLEX_FLOAT
244 - MIN_MODE_COMPLEX_FLOAT
,
246 /* Upper bound on non-language-specific builtins. */
251 /* Names for the above. */
252 extern const char * built_in_names
[(int) END_BUILTINS
];
254 /* Helper macros for math builtins. */
256 #define BUILTIN_EXP10_P(FN) \
257 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
258 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
260 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
261 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
262 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
264 #define BUILTIN_SQRT_P(FN) \
265 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
267 #define BUILTIN_CBRT_P(FN) \
268 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
270 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
272 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
273 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
274 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
276 /* An array of _DECL trees for the above. */
277 extern GTY(()) tree built_in_decls
[(int) END_BUILTINS
];
278 extern GTY(()) tree implicit_built_in_decls
[(int) END_BUILTINS
];
280 /* In an OMP_CLAUSE node. */
282 /* Number of operands and names for each clause. */
283 extern unsigned const char omp_clause_num_ops
[];
284 extern const char * const omp_clause_code_name
[];
286 /* Clause codes. Do not reorder, as this is used to index into the tables
287 omp_clause_num_ops and omp_clause_code_name. */
290 /* Clause zero is special-cased inside the parser
291 (c_parser_omp_variable_list). */
292 OMP_CLAUSE_ERROR
= 0,
294 /* OpenMP clause: private (variable_list). */
297 /* OpenMP clause: shared (variable_list). */
300 /* OpenMP clause: firstprivate (variable_list). */
301 OMP_CLAUSE_FIRSTPRIVATE
,
303 /* OpenMP clause: lastprivate (variable_list). */
304 OMP_CLAUSE_LASTPRIVATE
,
306 /* OpenMP clause: reduction (operator:variable_list).
307 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
308 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
309 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
311 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
312 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
313 OMP_CLAUSE_REDUCTION
,
315 /* OpenMP clause: copyin (variable_list). */
318 /* OpenMP clause: copyprivate (variable_list). */
319 OMP_CLAUSE_COPYPRIVATE
,
321 /* OpenMP clause: if (scalar-expression). */
324 /* OpenMP clause: num_threads (integer-expression). */
325 OMP_CLAUSE_NUM_THREADS
,
327 /* OpenMP clause: schedule. */
330 /* OpenMP clause: nowait. */
333 /* OpenMP clause: ordered. */
336 /* OpenMP clause: default. */
339 /* OpenMP clause: collapse (constant-integer-expression). */
342 /* OpenMP clause: untied. */
346 /* The definition of tree nodes fills the next several pages. */
348 /* A tree node can represent a data type, a variable, an expression
349 or a statement. Each node has a TREE_CODE which says what kind of
350 thing it represents. Some common codes are:
351 INTEGER_TYPE -- represents a type of integers.
352 ARRAY_TYPE -- represents a type of pointer.
353 VAR_DECL -- represents a declared variable.
354 INTEGER_CST -- represents a constant integer value.
355 PLUS_EXPR -- represents a sum (an expression).
357 As for the contents of a tree node: there are some fields
358 that all nodes share. Each TREE_CODE has various special-purpose
359 fields as well. The fields of a node are never accessed directly,
360 always through accessor macros. */
362 /* Every kind of tree node starts with this structure,
363 so all nodes have these fields.
365 See the accessor macros, defined below, for documentation of the
368 struct GTY(()) tree_base
{
369 ENUM_BITFIELD(tree_code
) code
: 16;
371 unsigned side_effects_flag
: 1;
372 unsigned constant_flag
: 1;
373 unsigned addressable_flag
: 1;
374 unsigned volatile_flag
: 1;
375 unsigned readonly_flag
: 1;
376 unsigned unsigned_flag
: 1;
377 unsigned asm_written_flag
: 1;
378 unsigned nowarning_flag
: 1;
380 unsigned used_flag
: 1;
381 unsigned nothrow_flag
: 1;
382 unsigned static_flag
: 1;
383 unsigned public_flag
: 1;
384 unsigned private_flag
: 1;
385 unsigned protected_flag
: 1;
386 unsigned deprecated_flag
: 1;
387 unsigned saturating_flag
: 1;
389 unsigned default_def_flag
: 1;
390 unsigned lang_flag_0
: 1;
391 unsigned lang_flag_1
: 1;
392 unsigned lang_flag_2
: 1;
393 unsigned lang_flag_3
: 1;
394 unsigned lang_flag_4
: 1;
395 unsigned lang_flag_5
: 1;
396 unsigned lang_flag_6
: 1;
398 unsigned visited
: 1;
399 unsigned packed_flag
: 1;
400 unsigned user_align
: 1;
401 unsigned nameless_flag
: 1;
405 /* This field is only used with type nodes; the only reason it is present
406 in tree_base instead of tree_type is to save space. The size of the
407 field must be large enough to hold addr_space_t values. */
408 unsigned address_space
: 8;
411 struct GTY(()) tree_common
{
412 struct tree_base base
;
417 /* The following table lists the uses of each of the above flags and
418 for which types of nodes they are defined.
423 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
425 CONSTRUCTOR, IDENTIFIER_NODE
426 STMT_EXPR, it means we want the result of the enclosed expression
428 CALL_EXPR_TAILCALL in
437 VAR_DECL, FUNCTION_DECL
440 TREE_NO_TRAMPOLINE in
446 TREE_SYMBOL_REFERENCED in
450 TARGET_EXPR, WITH_CLEANUP_EXPR
452 TRY_CATCH_IS_CLEANUP in
458 TYPE_REF_CAN_ALIAS_ALL in
459 POINTER_TYPE, REFERENCE_TYPE
467 CALL_CANNOT_INLINE_P in
476 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
479 VAR_DECL, FUNCTION_DECL
485 CALL_EXPR_VA_ARG_PACK in
488 TYPE_CACHED_VALUES_P in
491 SAVE_EXPR_RESOLVED_P in
494 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
495 OMP_CLAUSE_LASTPRIVATE
497 OMP_CLAUSE_PRIVATE_DEBUG in
505 CALL_EXPR_RETURN_SLOT_OPT in
511 OMP_PARALLEL_COMBINED in
513 OMP_CLAUSE_PRIVATE_OUTER_REF in
516 TYPE_REF_IS_RVALUE in
525 CALL_FROM_THUNK_P and
541 TREE_THIS_VOLATILE in
564 TYPE_SIZES_GIMPLIFIED in
575 REGISTER_DEFS_IN_THIS_STMT in
576 all expressions (tree-into-ssa.c)
581 VAR_DECL, FUNCTION_DECL
582 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
583 BLOCK, SSA_NAME, STRING_CST
586 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
605 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
613 IDENTIFIER_TRANSPARENT_ALIAS in
616 STMT_IN_SSA_EDGE_WORKLIST in
617 all expressions (tree-ssa-propagate.c)
622 all trees (used liberally by many passes)
637 TYPE_VECTOR_OPAQUE in
640 SSA_NAME_IS_DEFAULT_DEF in
645 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
646 enum tree_node_structure_enum
{
647 #include "treestruct.def"
652 /* Define accessors for the fields that all tree nodes have
653 (though some fields are not used for all kinds of nodes). */
655 /* The tree-code says what kind of node it is.
656 Codes are defined in tree.def. */
657 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
658 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
660 /* When checking is enabled, errors will be generated if a tree node
661 is accessed incorrectly. The macros die with a fatal error. */
662 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
664 #define TREE_CHECK(T, CODE) __extension__ \
665 ({ __typeof (T) const __t = (T); \
666 if (TREE_CODE (__t) != (CODE)) \
667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
671 #define TREE_NOT_CHECK(T, CODE) __extension__ \
672 ({ __typeof (T) const __t = (T); \
673 if (TREE_CODE (__t) == (CODE)) \
674 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
678 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
679 ({ __typeof (T) const __t = (T); \
680 if (TREE_CODE (__t) != (CODE1) \
681 && TREE_CODE (__t) != (CODE2)) \
682 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
683 (CODE1), (CODE2), 0); \
686 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
687 ({ __typeof (T) const __t = (T); \
688 if (TREE_CODE (__t) == (CODE1) \
689 || TREE_CODE (__t) == (CODE2)) \
690 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
691 (CODE1), (CODE2), 0); \
694 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
695 ({ __typeof (T) const __t = (T); \
696 if (TREE_CODE (__t) != (CODE1) \
697 && TREE_CODE (__t) != (CODE2) \
698 && TREE_CODE (__t) != (CODE3)) \
699 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
700 (CODE1), (CODE2), (CODE3), 0); \
703 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
704 ({ __typeof (T) const __t = (T); \
705 if (TREE_CODE (__t) == (CODE1) \
706 || TREE_CODE (__t) == (CODE2) \
707 || TREE_CODE (__t) == (CODE3)) \
708 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
709 (CODE1), (CODE2), (CODE3), 0); \
712 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
713 ({ __typeof (T) const __t = (T); \
714 if (TREE_CODE (__t) != (CODE1) \
715 && TREE_CODE (__t) != (CODE2) \
716 && TREE_CODE (__t) != (CODE3) \
717 && TREE_CODE (__t) != (CODE4)) \
718 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
722 #define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
723 ({ __typeof (T) const __t = (T); \
724 if (TREE_CODE (__t) == (CODE1) \
725 || TREE_CODE (__t) == (CODE2) \
726 || TREE_CODE (__t) == (CODE3) \
727 || TREE_CODE (__t) == (CODE4)) \
728 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
729 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
732 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
733 ({ __typeof (T) const __t = (T); \
734 if (TREE_CODE (__t) != (CODE1) \
735 && TREE_CODE (__t) != (CODE2) \
736 && TREE_CODE (__t) != (CODE3) \
737 && TREE_CODE (__t) != (CODE4) \
738 && TREE_CODE (__t) != (CODE5)) \
739 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
740 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
743 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
744 ({ __typeof (T) const __t = (T); \
745 if (TREE_CODE (__t) == (CODE1) \
746 || TREE_CODE (__t) == (CODE2) \
747 || TREE_CODE (__t) == (CODE3) \
748 || TREE_CODE (__t) == (CODE4) \
749 || TREE_CODE (__t) == (CODE5)) \
750 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
751 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
754 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
755 ({ __typeof (T) const __t = (T); \
756 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
757 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
761 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
762 ({ __typeof (T) const __t = (T); \
763 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
764 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
768 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
769 ({ __typeof (T) const __t = (T); \
770 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
771 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
775 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
776 ({ __typeof (T) const __t = (T); \
777 if (TREE_CODE (__t) != OMP_CLAUSE) \
778 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
780 if (__t->omp_clause.code != (CODE)) \
781 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
785 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
786 ({ __typeof (T) const __t = (T); \
787 if (TREE_CODE (__t) != OMP_CLAUSE) \
788 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
790 if ((int) __t->omp_clause.code < (int) (CODE1) \
791 || (int) __t->omp_clause.code > (int) (CODE2)) \
792 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
793 __FUNCTION__, (CODE1), (CODE2)); \
796 /* These checks have to be special cased. */
797 #define EXPR_CHECK(T) __extension__ \
798 ({ __typeof (T) const __t = (T); \
799 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
800 if (!IS_EXPR_CODE_CLASS (__c)) \
801 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
805 /* These checks have to be special cased. */
806 #define NON_TYPE_CHECK(T) __extension__ \
807 ({ __typeof (T) const __t = (T); \
809 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
813 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
814 (*({__typeof (T) const __t = (T); \
815 const int __i = (I); \
816 if (TREE_CODE (__t) != TREE_VEC) \
817 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
819 if (__i < 0 || __i >= __t->vec.length) \
820 tree_vec_elt_check_failed (__i, __t->vec.length, \
821 __FILE__, __LINE__, __FUNCTION__); \
822 &__t->vec.a[__i]; }))
824 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
825 (*({__typeof (T) const __t = (T); \
826 const int __i = (I); \
827 if (TREE_CODE (__t) != OMP_CLAUSE) \
828 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
830 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
831 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
833 &__t->omp_clause.ops[__i]; }))
835 /* Special checks for TREE_OPERANDs. */
836 #define TREE_OPERAND_CHECK(T, I) __extension__ \
837 (*({__typeof (T) const __t = EXPR_CHECK (T); \
838 const int __i = (I); \
839 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
840 tree_operand_check_failed (__i, __t, \
841 __FILE__, __LINE__, __FUNCTION__); \
842 &__t->exp.operands[__i]; }))
844 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
845 (*({__typeof (T) const __t = (T); \
846 const int __i = (I); \
847 if (TREE_CODE (__t) != CODE) \
848 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
849 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
850 tree_operand_check_failed (__i, __t, \
851 __FILE__, __LINE__, __FUNCTION__); \
852 &__t->exp.operands[__i]; }))
854 /* Nodes are chained together for many purposes.
855 Types are chained together to record them for being output to the debugger
856 (see the function `chain_type').
857 Decls in the same scope are chained together to record the contents
859 Statement nodes for successive statements used to be chained together.
860 Often lists of things are represented by TREE_LIST nodes that
861 are chained together. */
863 #define TREE_CHAIN(NODE) __extension__ \
864 (*({__typeof (NODE) const __t = (NODE); \
865 &__t->common.chain; }))
867 /* In all nodes that are expressions, this is the data type of the expression.
868 In POINTER_TYPE nodes, this is the type that the pointer points to.
869 In ARRAY_TYPE nodes, this is the type of the elements.
870 In VECTOR_TYPE nodes, this is the type of the elements. */
871 #define TREE_TYPE(NODE) __extension__ \
872 (*({__typeof (NODE) const __t = (NODE); \
873 &__t->common.type; }))
875 extern void tree_contains_struct_check_failed (const_tree
,
876 const enum tree_node_structure_enum
,
877 const char *, int, const char *)
880 extern void tree_check_failed (const_tree
, const char *, int, const char *,
881 ...) ATTRIBUTE_NORETURN
;
882 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
883 ...) ATTRIBUTE_NORETURN
;
884 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
885 const char *, int, const char *)
887 extern void tree_range_check_failed (const_tree
, const char *, int,
888 const char *, enum tree_code
,
891 extern void tree_not_class_check_failed (const_tree
,
892 const enum tree_code_class
,
893 const char *, int, const char *)
895 extern void tree_vec_elt_check_failed (int, int, const char *,
898 extern void phi_node_elt_check_failed (int, int, const char *,
901 extern void tree_operand_check_failed (int, const_tree
,
902 const char *, int, const char *)
904 extern void omp_clause_check_failed (const_tree
, const char *, int,
905 const char *, enum omp_clause_code
)
907 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
910 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
911 const char *, enum omp_clause_code
,
912 enum omp_clause_code
)
915 #else /* not ENABLE_TREE_CHECKING, or not gcc */
917 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
918 #define TREE_CHECK(T, CODE) (T)
919 #define TREE_NOT_CHECK(T, CODE) (T)
920 #define TREE_CHECK2(T, CODE1, CODE2) (T)
921 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
922 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
923 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
924 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
925 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
926 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
927 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
928 #define TREE_CLASS_CHECK(T, CODE) (T)
929 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
930 #define EXPR_CHECK(T) (T)
931 #define NON_TYPE_CHECK(T) (T)
932 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
933 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
934 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
935 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
936 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
937 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
939 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
940 #define TREE_TYPE(NODE) ((NODE)->common.type)
944 #define TREE_BLOCK(NODE) *(tree_block (NODE))
946 #include "tree-check.h"
948 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
949 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
950 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
951 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
952 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
953 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
954 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
955 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
956 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
957 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
958 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
960 #define RECORD_OR_UNION_CHECK(T) \
961 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
962 #define NOT_RECORD_OR_UNION_CHECK(T) \
963 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
965 #define NUMERICAL_TYPE_CHECK(T) \
966 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
969 /* Here is how primitive or already-canonicalized types' hash codes
971 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
973 /* A simple hash function for an arbitrary tree node. This must not be
974 used in hash tables which are saved to a PCH. */
975 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
977 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
978 #define CONVERT_EXPR_CODE_P(CODE) \
979 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
981 /* Similarly, but accept an expressions instead of a tree code. */
982 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
984 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
986 #define CASE_CONVERT \
990 /* Given an expression as a tree, strip any conversion that generates
991 no instruction. Accepts both tree and const_tree arguments since
992 we are not modifying the tree itself. */
994 #define STRIP_NOPS(EXP) \
995 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
997 /* Like STRIP_NOPS, but don't let the signedness change either. */
999 #define STRIP_SIGN_NOPS(EXP) \
1000 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1002 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1004 #define STRIP_TYPE_NOPS(EXP) \
1005 while ((CONVERT_EXPR_P (EXP) \
1006 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1007 && TREE_OPERAND (EXP, 0) != error_mark_node \
1008 && (TREE_TYPE (EXP) \
1009 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1010 (EXP) = TREE_OPERAND (EXP, 0)
1012 /* Remove unnecessary type conversions according to
1013 tree_ssa_useless_type_conversion. */
1015 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1016 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1018 /* Nonzero if TYPE represents an integral type. Note that we do not
1019 include COMPLEX types here. Keep these checks in ascending code
1022 #define INTEGRAL_TYPE_P(TYPE) \
1023 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1024 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1025 || TREE_CODE (TYPE) == INTEGER_TYPE)
1027 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1029 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1030 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1032 /* Nonzero if TYPE represents a saturating fixed-point type. */
1034 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1035 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1037 /* Nonzero if TYPE represents a fixed-point type. */
1039 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1041 /* Nonzero if TYPE represents a scalar floating-point type. */
1043 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1045 /* Nonzero if TYPE represents a complex floating-point type. */
1047 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1048 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1049 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1051 /* Nonzero if TYPE represents a vector floating-point type. */
1053 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1054 (TREE_CODE (TYPE) == VECTOR_TYPE \
1055 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1057 /* Nonzero if TYPE represents a floating-point type, including complex
1058 and vector floating-point types. The vector and complex check does
1059 not use the previous two macros to enable early folding. */
1061 #define FLOAT_TYPE_P(TYPE) \
1062 (SCALAR_FLOAT_TYPE_P (TYPE) \
1063 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1064 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1065 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1067 /* Nonzero if TYPE represents a decimal floating-point type. */
1068 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1069 (SCALAR_FLOAT_TYPE_P (TYPE) \
1070 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1072 /* Nonzero if TYPE is a record or union type. */
1073 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1074 (TREE_CODE (TYPE) == RECORD_TYPE \
1075 || TREE_CODE (TYPE) == UNION_TYPE \
1076 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1078 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1079 Keep these checks in ascending code order. */
1081 #define AGGREGATE_TYPE_P(TYPE) \
1082 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1084 /* Nonzero if TYPE represents a pointer or reference type.
1085 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1086 ascending code order. */
1088 #define POINTER_TYPE_P(TYPE) \
1089 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1091 /* Nonzero if this type is a complete type. */
1092 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1094 /* Nonzero if this type is the (possibly qualified) void type. */
1095 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1097 /* Nonzero if this type is complete or is cv void. */
1098 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1099 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1101 /* Nonzero if this type is complete or is an array with unspecified bound. */
1102 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1103 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1106 /* Define many boolean fields that all tree nodes have. */
1108 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1109 of this is needed. So it cannot be in a register.
1110 In a FUNCTION_DECL, nonzero means its address is needed.
1111 So it must be compiled even if it is an inline function.
1112 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1113 In LABEL_DECL nodes, it means a goto for this label has been seen
1114 from a place outside all binding contours that restore stack levels.
1115 In ..._TYPE nodes, it means that objects of this type must be fully
1116 addressable. This means that pieces of this object cannot go into
1117 register parameters, for example. If this a function type, this
1118 means that the value must be returned in memory.
1119 In IDENTIFIER_NODEs, this means that some extern decl for this name
1120 had its address taken. That matters for inline functions. */
1121 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1123 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1124 exit of a function. Calls for which this is true are candidates for tail
1125 call optimizations. */
1126 #define CALL_EXPR_TAILCALL(NODE) \
1127 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1129 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1130 CASE_LOW operand has been processed. */
1131 #define CASE_LOW_SEEN(NODE) \
1132 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1134 #define PREDICT_EXPR_OUTCOME(NODE) \
1135 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1136 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1137 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1138 #define PREDICT_EXPR_PREDICTOR(NODE) \
1139 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1141 /* In a VAR_DECL, nonzero means allocate static storage.
1142 In a FUNCTION_DECL, nonzero if function has been defined.
1143 In a CONSTRUCTOR, nonzero means allocate static storage. */
1144 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1146 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1147 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1149 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1150 should only be executed if an exception is thrown, not on normal exit
1152 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1154 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1155 separate cleanup in honor_protect_cleanup_actions. */
1156 #define TRY_CATCH_IS_CLEANUP(NODE) \
1157 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1159 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1160 CASE_HIGH operand has been processed. */
1161 #define CASE_HIGH_SEEN(NODE) \
1162 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1164 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1165 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1167 /* Used to mark scoped enums. */
1168 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1170 /* In an expr node (usually a conversion) this means the node was made
1171 implicitly and should not lead to any sort of warning. In a decl node,
1172 warnings concerning the decl should be suppressed. This is used at
1173 least for used-before-set warnings, and it set after one warning is
1175 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1177 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1178 this string as an argument. */
1179 #define TREE_SYMBOL_REFERENCED(NODE) \
1180 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1182 /* Nonzero in a pointer or reference type means the data pointed to
1183 by this type can alias anything. */
1184 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1185 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1187 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1188 #define MOVE_NONTEMPORAL(NODE) \
1189 (EXPR_CHECK (NODE)->base.static_flag)
1191 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1192 there was an overflow in folding. */
1194 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1196 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1198 #define TREE_OVERFLOW_P(EXPR) \
1199 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1201 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1202 nonzero means name is to be accessible from outside this translation unit.
1203 In an IDENTIFIER_NODE, nonzero means an external declaration
1204 accessible from outside this translation unit was previously seen
1205 for this name in an inner scope. */
1206 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1208 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1209 of cached values, or is something else. */
1210 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1212 /* In a SAVE_EXPR, indicates that the original expression has already
1213 been substituted with a VAR_DECL that contains the value. */
1214 #define SAVE_EXPR_RESOLVED_P(NODE) \
1215 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1217 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1219 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1220 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1222 /* In any expression, decl, or constant, nonzero means it has side effects or
1223 reevaluation of the whole expression could produce a different value.
1224 This is set if any subexpression is a function call, a side effect or a
1225 reference to a volatile variable. In a ..._DECL, this is set only if the
1226 declaration said `volatile'. This will never be set for a constant. */
1227 #define TREE_SIDE_EFFECTS(NODE) \
1228 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1230 /* In a LABEL_DECL, nonzero means this label had its address taken
1231 and therefore can never be deleted and is a jump target for
1233 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1235 /* Nonzero means this expression is volatile in the C sense:
1236 its address should be of type `volatile WHATEVER *'.
1237 In other words, the declared item is volatile qualified.
1238 This is used in _DECL nodes and _REF nodes.
1239 On a FUNCTION_DECL node, this means the function does not
1240 return normally. This is the same effect as setting
1241 the attribute noreturn on the function in C.
1243 In a ..._TYPE node, means this type is volatile-qualified.
1244 But use TYPE_VOLATILE instead of this macro when the node is a type,
1245 because eventually we may make that a different bit.
1247 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1248 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1250 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1251 accessing the memory pointed to won't generate a trap. However,
1252 this only applies to an object when used appropriately: it doesn't
1253 mean that writing a READONLY mem won't trap. Similarly for
1254 MISALIGNED_INDIRECT_REF.
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) ((NODE)->base.nothrow_flag)
1262 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1263 nonzero means it may not be the lhs of an assignment.
1264 Nonzero in a FUNCTION_DECL means this function should be treated
1265 as "const" function (can only read its arguments). */
1266 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1268 /* Value of expression is constant. Always on in all ..._CST nodes. May
1269 also appear in an expression or decl where the value is constant. */
1270 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1272 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1273 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1274 (TYPE_CHECK (NODE)->base.constant_flag)
1276 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1277 #define DECL_UNSIGNED(NODE) \
1278 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1280 /* In integral and pointer types, means an unsigned type. */
1281 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1283 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1284 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1285 This is interesting in an inline function, since it might not need
1286 to be compiled separately.
1287 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1288 if the debugging info for the type has been written.
1289 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1290 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1292 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1294 /* Nonzero in a _DECL if the name is used in its scope.
1295 Nonzero in an expr node means inhibit warning if value is unused.
1296 In IDENTIFIER_NODEs, this means that some extern decl for this name
1298 In a BLOCK, this means that the block contains variables that are used. */
1299 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1301 /* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1302 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
1303 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1305 /* In a CALL_EXPR, means that it's safe to use the target of the call
1306 expansion as the return slot for a call that returns in memory. */
1307 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1308 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1310 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1311 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1313 #define DECL_BY_REFERENCE(NODE) \
1314 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1315 RESULT_DECL)->decl_common.decl_by_reference_flag)
1317 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1318 can be used as restricted tag to disambiguate against other restrict
1319 pointers. Used by fortran to capture something like non-addressability
1320 (which it isn't really because the middle-end does take addresses of
1322 #define DECL_RESTRICTED_P(NODE) \
1323 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1324 RESULT_DECL)->decl_common.decl_restricted_flag)
1326 #define DECL_READ_P(NODE) \
1327 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1329 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1330 thunked-to function. */
1331 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1333 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1334 it has been built for the declaration of a variable-sized object. */
1335 #define ALLOCA_FOR_VAR_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1337 /* In a type, nonzero means that all objects of the type are guaranteed by the
1338 language or front-end to be properly aligned, so we can indicate that a MEM
1339 of this type is aligned at least to the alignment of the type, even if it
1340 doesn't appear that it is. We see this, for example, in object-oriented
1341 languages where a tag field may show this is an object of a more-aligned
1342 variant of the more generic type.
1344 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1346 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1348 /* Used in classes in C++. */
1349 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1350 /* Used in classes in C++. */
1351 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1353 /* True if reference type NODE is a C++ rvalue reference. */
1354 #define TYPE_REF_IS_RVALUE(NODE) \
1355 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1357 /* Nonzero in a _DECL if the use of the name is defined as a
1358 deprecated feature by __attribute__((deprecated)). */
1359 #define TREE_DEPRECATED(NODE) \
1360 ((NODE)->base.deprecated_flag)
1362 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1363 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1364 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1365 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1367 /* In fixed-point types, means a saturating type. */
1368 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1370 /* These flags are available for each language front end to use internally. */
1371 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1372 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1373 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1374 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1375 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1376 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1377 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1379 /* Define additional fields and accessors for nodes representing constants. */
1381 /* In an INTEGER_CST node. These two together make a 2-word integer.
1382 If the data type is signed, the value is sign-extended to 2 words
1383 even though not all of them may really be in use.
1384 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1385 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1386 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1387 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1389 #define INT_CST_LT(A, B) \
1390 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1391 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1392 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1394 #define INT_CST_LT_UNSIGNED(A, B) \
1395 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1396 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1397 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1398 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1399 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1401 struct GTY(()) tree_int_cst
{
1402 struct tree_common common
;
1406 /* In a REAL_CST node. struct real_value is an opaque entity, with
1407 manipulators defined in real.h. We don't want tree.h depending on
1408 real.h and transitively on tm.h. */
1411 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1412 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1414 struct GTY(()) tree_real_cst
{
1415 struct tree_common common
;
1416 struct real_value
* real_cst_ptr
;
1419 /* In a FIXED_CST node. */
1422 #define TREE_FIXED_CST_PTR(NODE) \
1423 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1424 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1426 struct GTY(()) tree_fixed_cst
{
1427 struct tree_common common
;
1428 struct fixed_value
* fixed_cst_ptr
;
1431 /* In a STRING_CST */
1432 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1433 #define TREE_STRING_POINTER(NODE) \
1434 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1436 struct GTY(()) tree_string
{
1437 struct tree_common common
;
1442 /* In a COMPLEX_CST node. */
1443 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1444 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1446 struct GTY(()) tree_complex
{
1447 struct tree_common common
;
1452 /* In a VECTOR_CST node. */
1453 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1455 struct GTY(()) tree_vector
{
1456 struct tree_common common
;
1462 /* Define fields and accessors for some special-purpose tree nodes. */
1464 #define IDENTIFIER_LENGTH(NODE) \
1465 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1466 #define IDENTIFIER_POINTER(NODE) \
1467 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1468 #define IDENTIFIER_HASH_VALUE(NODE) \
1469 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1471 /* Translate a hash table identifier pointer to a tree_identifier
1472 pointer, and vice versa. */
1474 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1475 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1476 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1478 struct GTY(()) tree_identifier
{
1479 struct tree_common common
;
1480 struct ht_identifier id
;
1483 /* In a TREE_LIST node. */
1484 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1485 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1487 struct GTY(()) tree_list
{
1488 struct tree_common common
;
1493 /* In a TREE_VEC node. */
1494 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1495 #define TREE_VEC_END(NODE) \
1496 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1498 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1500 struct GTY(()) tree_vec
{
1501 struct tree_common common
;
1503 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1506 /* In a CONSTRUCTOR node. */
1507 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1508 #define CONSTRUCTOR_ELT(NODE,IDX) \
1509 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1510 #define CONSTRUCTOR_NELTS(NODE) \
1511 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1513 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1514 value of each element (stored within VAL). IX must be a scratch variable
1515 of unsigned integer type. */
1516 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1517 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1519 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1523 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1524 the value of each element (stored within VAL) and its index (stored
1525 within INDEX). IX must be a scratch variable of unsigned integer type. */
1526 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1527 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1529 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1530 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1534 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1535 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1537 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1538 _ce___->index = INDEX; \
1539 _ce___->value = VALUE; \
1542 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1543 constructor output purposes. */
1544 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1545 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1547 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1548 element. INDEX can optionally design the position of VALUE: in arrays,
1549 it is the index where VALUE has to be placed; in structures, it is the
1550 FIELD_DECL of the member. */
1551 typedef struct GTY(()) constructor_elt_d
{
1556 DEF_VEC_O(constructor_elt
);
1557 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1559 struct GTY(()) tree_constructor
{
1560 struct tree_common common
;
1561 VEC(constructor_elt
,gc
) *elts
;
1564 /* Define fields and accessors for some nodes that represent expressions. */
1566 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1567 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1568 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1569 && integer_zerop (TREE_OPERAND (NODE, 0)))
1571 /* In ordinary expression nodes. */
1572 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1573 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1575 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1576 length. Its value includes the length operand itself; that is,
1577 the minimum valid length is 1.
1578 Note that we have to bypass the use of TREE_OPERAND to access
1579 that field to avoid infinite recursion in expanding the macros. */
1580 #define VL_EXP_OPERAND_LENGTH(NODE) \
1581 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1583 /* Nonzero if is_gimple_debug() may possibly hold. */
1584 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1586 /* In a LOOP_EXPR node. */
1587 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1589 /* The source location of this expression. Non-tree_exp nodes such as
1590 decls and constants can be shared among multiple locations, so
1592 #define EXPR_LOCATION(NODE) \
1593 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1594 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1595 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1596 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1597 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1599 /* True if a tree is an expression or statement that can have a
1601 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1603 extern void protected_set_expr_location (tree
, location_t
);
1605 /* In a TARGET_EXPR node. */
1606 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1607 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1608 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1610 /* DECL_EXPR accessor. This gives access to the DECL associated with
1611 the given declaration statement. */
1612 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1614 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1616 /* COMPOUND_LITERAL_EXPR accessors. */
1617 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1618 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1619 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1620 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1622 /* SWITCH_EXPR accessors. These give access to the condition, body and
1623 original condition type (before any compiler conversions)
1624 of the switch statement, respectively. */
1625 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1626 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1627 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1629 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1630 of a case label, respectively. */
1631 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1632 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1633 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1635 /* The operands of a TARGET_MEM_REF. */
1636 #define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1637 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1638 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1639 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1640 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1642 /* The operands of a BIND_EXPR. */
1643 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1644 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1645 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1647 /* GOTO_EXPR accessor. This gives access to the label associated with
1648 a goto statement. */
1649 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1651 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1652 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1653 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1655 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1656 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1657 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1658 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1659 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1660 /* Nonzero if we want to create an ASM_INPUT instead of an
1661 ASM_OPERAND with no operands. */
1662 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1663 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1665 /* COND_EXPR accessors. */
1666 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1667 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1668 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1670 /* Accessors for the chains of recurrences. */
1671 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1672 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1673 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1674 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1676 /* LABEL_EXPR accessor. This gives access to the label associated with
1677 the given label expression. */
1678 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1680 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1681 accessors for SSA operands. */
1683 /* CATCH_EXPR accessors. */
1684 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1685 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1687 /* EH_FILTER_EXPR accessors. */
1688 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1689 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1691 /* OBJ_TYPE_REF accessors. */
1692 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1693 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1694 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1696 /* ASSERT_EXPR accessors. */
1697 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1698 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1700 /* CALL_EXPR accessors.
1702 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1703 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1704 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1705 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1707 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1708 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1709 the argument count is zero when checking is enabled. Instead, do
1710 the pointer arithmetic to advance past the 3 fixed operands in a
1711 CALL_EXPR. That produces a valid pointer to just past the end of the
1712 operand array, even if it's not valid to dereference it. */
1713 #define CALL_EXPR_ARGP(NODE) \
1714 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1716 /* OpenMP directive and clause accessors. */
1718 #define OMP_BODY(NODE) \
1719 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1720 #define OMP_CLAUSES(NODE) \
1721 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1723 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1724 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1726 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1727 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1729 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1730 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1731 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1733 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1734 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1735 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1736 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1737 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1738 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1740 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1741 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1743 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1745 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1746 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1748 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1750 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1752 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1753 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1755 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1756 #define OMP_CLAUSE_DECL(NODE) \
1757 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1758 OMP_CLAUSE_PRIVATE, \
1759 OMP_CLAUSE_COPYPRIVATE), 0)
1760 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1761 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1762 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1764 /* True on an OMP_SECTION statement that was the last lexical member.
1765 This status is meaningful in the implementation of lastprivate. */
1766 #define OMP_SECTION_LAST(NODE) \
1767 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1769 /* True on an OMP_PARALLEL statement if it represents an explicit
1770 combined parallel work-sharing constructs. */
1771 #define OMP_PARALLEL_COMBINED(NODE) \
1772 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1774 /* True on a PRIVATE clause if its decl is kept around for debugging
1775 information only and its DECL_VALUE_EXPR is supposed to point
1776 to what it has been remapped to. */
1777 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1778 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1780 /* True on a PRIVATE clause if ctor needs access to outer region's
1782 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1783 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1785 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1786 decl is present in the chain. */
1787 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1788 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1789 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1790 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1791 OMP_CLAUSE_LASTPRIVATE),\
1793 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1794 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1796 #define OMP_CLAUSE_IF_EXPR(NODE) \
1797 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1798 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1799 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1800 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1801 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1803 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1804 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1805 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1806 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1807 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1808 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1810 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1811 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1812 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1813 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1814 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1815 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1816 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1817 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1818 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1819 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1820 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1821 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1823 enum omp_clause_schedule_kind
1825 OMP_CLAUSE_SCHEDULE_STATIC
,
1826 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1827 OMP_CLAUSE_SCHEDULE_GUIDED
,
1828 OMP_CLAUSE_SCHEDULE_AUTO
,
1829 OMP_CLAUSE_SCHEDULE_RUNTIME
1832 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1833 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1835 enum omp_clause_default_kind
1837 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1838 OMP_CLAUSE_DEFAULT_SHARED
,
1839 OMP_CLAUSE_DEFAULT_NONE
,
1840 OMP_CLAUSE_DEFAULT_PRIVATE
,
1841 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1844 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1845 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1847 struct GTY(()) tree_exp
{
1848 struct tree_common common
;
1851 tree
GTY ((special ("tree_exp"),
1852 desc ("TREE_CODE ((tree) &%0)")))
1856 /* SSA_NAME accessors. */
1858 /* Returns the variable being referenced. Once released, this is the
1859 only field that can be relied upon. */
1860 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1862 /* Returns the statement which defines this SSA name. */
1863 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1865 /* Returns the SSA version number of this SSA name. Note that in
1866 tree SSA, version numbers are not per variable and may be recycled. */
1867 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1869 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1870 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1872 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1873 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1875 /* Nonzero if this SSA_NAME expression is currently on the free list of
1876 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1877 has no meaning for an SSA_NAME. */
1878 #define SSA_NAME_IN_FREE_LIST(NODE) \
1879 SSA_NAME_CHECK (NODE)->base.nothrow_flag
1881 /* Nonzero if this SSA_NAME is the default definition for the
1882 underlying symbol. A default SSA name is created for symbol S if
1883 the very first reference to S in the function is a read operation.
1884 Default definitions are always created by an empty statement and
1885 belong to no basic block. */
1886 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
1887 SSA_NAME_CHECK (NODE)->base.default_def_flag
1889 /* Attributes for SSA_NAMEs for pointer-type variables. */
1890 #define SSA_NAME_PTR_INFO(N) \
1891 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1893 /* Defined in tree-flow.h. */
1894 struct ptr_info_def
;
1896 /* Immediate use linking structure. This structure is used for maintaining
1897 a doubly linked list of uses of an SSA_NAME. */
1898 typedef struct GTY(()) ssa_use_operand_d
{
1899 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
1900 struct ssa_use_operand_d
* GTY((skip(""))) next
;
1901 /* Immediate uses for a given SSA name are maintained as a cyclic
1902 list. To recognize the root of this list, the location field
1903 needs to point to the original SSA name. Since statements and
1904 SSA names are of different data types, we need this union. See
1905 the explanation in struct immediate_use_iterator_d. */
1906 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
1907 tree
*GTY((skip(""))) use
;
1908 } ssa_use_operand_t
;
1910 /* Return the immediate_use information for an SSA_NAME. */
1911 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1913 struct GTY(()) tree_ssa_name
{
1914 struct tree_common common
;
1916 /* _DECL wrapped by this SSA name. */
1919 /* Statement that defines this SSA name. */
1922 /* SSA version number. */
1923 unsigned int version
;
1925 /* Pointer attributes used for alias analysis. */
1926 struct ptr_info_def
*ptr_info
;
1928 /* Immediate uses list for this SSA_NAME. */
1929 struct ssa_use_operand_d imm_uses
;
1932 struct GTY(()) phi_arg_d
{
1933 /* imm_use MUST be the first element in struct because we do some
1934 pointer arithmetic with it. See phi_arg_index_from_use. */
1935 struct ssa_use_operand_d imm_use
;
1941 #define OMP_CLAUSE_CODE(NODE) \
1942 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1944 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1945 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1947 #define OMP_CLAUSE_CODE(NODE) \
1948 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1950 #define OMP_CLAUSE_OPERAND(NODE, I) \
1951 OMP_CLAUSE_ELT_CHECK (NODE, I)
1953 struct GTY(()) tree_omp_clause
{
1954 struct tree_common common
;
1956 enum omp_clause_code code
;
1957 union omp_clause_subcode
{
1958 enum omp_clause_default_kind default_kind
;
1959 enum omp_clause_schedule_kind schedule_kind
;
1960 enum tree_code reduction_code
;
1961 } GTY ((skip
)) subcode
;
1963 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1965 gimple_seq gimple_reduction_init
;
1966 gimple_seq gimple_reduction_merge
;
1968 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
1972 /* In a BLOCK node. */
1973 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
1974 #define BLOCK_NONLOCALIZED_VARS(NODE) \
1975 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1976 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
1977 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1978 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
1979 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
1980 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1981 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
1982 /* Note: when changing this, make sure to find the places
1983 that use chainon or nreverse. */
1984 #define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
1985 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1986 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
1988 /* An index number for this block. These values are not guaranteed to
1989 be unique across functions -- whether or not they are depends on
1990 the debugging output format in use. */
1991 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1993 /* If block reordering splits a lexical block into discontiguous
1994 address ranges, we'll make a copy of the original block.
1996 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1997 In that case, we have one source block that has been replicated
1998 (through inlining or unrolling) into many logical blocks, and that
1999 these logical blocks have different physical variables in them.
2001 In this case, we have one logical block split into several
2002 non-contiguous address ranges. Most debug formats can't actually
2003 represent this idea directly, so we fake it by creating multiple
2004 logical blocks with the same variables in them. However, for those
2005 that do support non-contiguous regions, these allow the original
2006 logical block to be reconstructed, along with the set of address
2009 One of the logical block fragments is arbitrarily chosen to be
2010 the ORIGIN. The other fragments will point to the origin via
2011 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2012 be null. The list of fragments will be chained through
2013 BLOCK_FRAGMENT_CHAIN from the origin. */
2015 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2016 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2018 /* For an inlined function, this gives the location where it was called
2019 from. This is only set in the top level block, which corresponds to the
2020 inlined function scope. This is used in the debug output routines. */
2022 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2024 struct GTY(()) tree_block
{
2025 struct tree_common common
;
2027 unsigned abstract_flag
: 1;
2028 unsigned block_num
: 31;
2033 VEC(tree
,gc
) *nonlocalized_vars
;
2037 tree abstract_origin
;
2038 tree fragment_origin
;
2039 tree fragment_chain
;
2042 /* Define fields and accessors for nodes representing data types. */
2044 /* See tree.def for documentation of the use of these fields.
2045 Look at the documentation of the various ..._TYPE tree codes.
2047 Note that the type.values, type.minval, and type.maxval fields are
2048 overloaded and used for different macros in different kinds of types.
2049 Each macro must check to ensure the tree node is of the proper kind of
2050 type. Note also that some of the front-ends also overload these fields,
2051 so they must be checked as well. */
2053 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2054 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2055 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
2056 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
2057 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
2058 #define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
2059 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2060 #define TYPE_ORIG_SIZE_TYPE(NODE) \
2061 (INTEGER_TYPE_CHECK (NODE)->type.values \
2062 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
2063 #define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2064 #define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
2065 #define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2066 #define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2067 #define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
2068 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2069 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
2070 #define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2071 #define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
2072 #define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2073 #define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
2074 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2075 #define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2076 #define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
2077 #define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
2078 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2079 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2080 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
2081 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
2082 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type.maxval)
2083 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type.minval)
2085 /* Vector types need to check target flags to determine type. */
2086 extern enum machine_mode
vector_type_mode (const_tree
);
2087 #define TYPE_MODE(NODE) \
2088 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2089 ? vector_type_mode (NODE) : (NODE)->type.mode)
2090 #define SET_TYPE_MODE(NODE, MODE) \
2091 (TYPE_CHECK (NODE)->type.mode = (MODE))
2093 /* The "canonical" type for this type node, which is used by frontends to
2094 compare the type for equality with another type. If two types are
2095 equal (based on the semantics of the language), then they will have
2096 equivalent TYPE_CANONICAL entries.
2098 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2099 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2100 be used for comparison against other types. Instead, the type is
2101 said to require structural equality checks, described in
2102 TYPE_STRUCTURAL_EQUALITY_P.
2104 For unqualified aggregate and function types the middle-end relies on
2105 TYPE_CANONICAL to tell whether two variables can be assigned
2106 to each other without a conversion. The middle-end also makes sure
2107 to assign the same alias-sets to the type partition with equal
2108 TYPE_CANONICAL of their unqualified variants. */
2109 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2110 /* Indicates that the type node requires structural equality
2111 checks. The compiler will need to look at the composition of the
2112 type to determine whether it is equal to another type, rather than
2113 just comparing canonical type pointers. For instance, we would need
2114 to look at the return and parameter types of a FUNCTION_TYPE
2116 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2117 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2118 type node requires structural equality. */
2119 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2121 #define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
2122 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2123 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2125 /* For a VECTOR_TYPE node, this describes a different type which is emitted
2126 in the debugging output. We use this to describe a vector as a
2127 structure containing an array. */
2128 #define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) \
2129 (VECTOR_TYPE_CHECK (NODE)->type.values)
2131 /* For record and union types, information about this type, as a base type
2133 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2135 /* For non record and union types, used in a language-dependent way. */
2136 #define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2138 /* The (language-specific) typed-based alias set for this type.
2139 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2140 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2141 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2142 type can alias objects of any type. */
2143 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2145 /* Nonzero iff the typed-based alias set for this type has been
2147 #define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
2149 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2151 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
2153 /* The alignment necessary for objects of this type.
2154 The value is an int, measured in bits. */
2155 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
2157 /* 1 if the alignment for this type was requested by "aligned" attribute,
2158 0 if it is the default for this type. */
2159 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->common.base.user_align)
2161 /* The alignment for NODE, in bytes. */
2162 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2164 /* If your language allows you to declare types, and you want debug info
2165 for them, then you need to generate corresponding TYPE_DECL nodes.
2166 These "stub" TYPE_DECL nodes have no name, and simply point at the
2167 type node. You then set the TYPE_STUB_DECL field of the type node
2168 to point back at the TYPE_DECL node. This allows the debug routines
2169 to know that the two nodes represent the same type, so that we only
2170 get one debug info record for them. */
2171 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2173 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2174 has BLKmode only because it lacks the alignment requirement for
2176 #define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
2178 /* In an INTEGER_TYPE, it means the type represents a size. We use
2179 this both for validity checking and to permit optimizations that
2180 are unsafe for other types. Note that the C `size_t' type should
2181 *not* have this flag set. The `size_t' type is simply a typedef
2182 for an ordinary integer type that happens to be the type of an
2183 expression returned by `sizeof'; `size_t' has no special
2184 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2185 always actual sizes. */
2186 #define TYPE_IS_SIZETYPE(NODE) \
2187 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2189 /* Nonzero in a type considered volatile as a whole. */
2190 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2192 /* Means this type is const-qualified. */
2193 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2195 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2197 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2199 /* If nonzero, type's name shouldn't be emitted into debug info. */
2200 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2202 /* The address space the type is in. */
2203 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2205 /* There is a TYPE_QUAL value for each type qualifier. They can be
2206 combined by bitwise-or to form the complete set of qualifiers for a
2209 #define TYPE_UNQUALIFIED 0x0
2210 #define TYPE_QUAL_CONST 0x1
2211 #define TYPE_QUAL_VOLATILE 0x2
2212 #define TYPE_QUAL_RESTRICT 0x4
2214 /* Encode/decode the named memory support as part of the qualifier. If more
2215 than 8 qualifiers are added, these macros need to be adjusted. */
2216 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2217 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2219 /* Return all qualifiers except for the address space qualifiers. */
2220 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2222 /* Only keep the address space out of the qualifiers and discard the other
2224 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2226 /* The set of type qualifiers for this type. */
2227 #define TYPE_QUALS(NODE) \
2228 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2229 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2230 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2231 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2233 /* The same as TYPE_QUALS without the address space qualifications. */
2234 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2235 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2236 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2237 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2239 /* These flags are available for each language front end to use internally. */
2240 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2241 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2242 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2243 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2244 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2245 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2246 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
2248 /* Used to keep track of visited nodes in tree traversals. This is set to
2249 0 by copy_node and make_node. */
2250 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2252 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2253 that distinguish string from array of char).
2254 If set in a INTEGER_TYPE, indicates a character type. */
2255 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
2257 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2258 object of the given ARRAY_TYPE. This allows temporaries to be
2260 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2261 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2263 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2264 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2265 (((unsigned HOST_WIDE_INT) 1) \
2266 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2268 /* Set precision to n when we have 2^n sub-parts of the vector. */
2269 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2270 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
2272 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2273 about missing conversions to other vector types of the same size. */
2274 #define TYPE_VECTOR_OPAQUE(NODE) \
2275 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2277 /* Indicates that objects of this type must be initialized by calling a
2278 function when they are created. */
2279 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2280 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
2282 /* Indicates that a UNION_TYPE object should be passed the same way that
2283 the first union alternative would be passed, or that a RECORD_TYPE
2284 object should be passed the same way that the first (and only) member
2286 #define TYPE_TRANSPARENT_AGGR(NODE) \
2287 (RECORD_OR_UNION_CHECK (NODE)->type.transparent_aggr_flag)
2289 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2290 address of a component of the type. This is the counterpart of
2291 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2292 #define TYPE_NONALIASED_COMPONENT(NODE) \
2293 (ARRAY_TYPE_CHECK (NODE)->type.transparent_aggr_flag)
2295 /* Indicated that objects of this type should be laid out in as
2296 compact a way as possible. */
2297 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->common.base.packed_flag)
2299 /* Used by type_contains_placeholder_p to avoid recomputation.
2300 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2301 this field directly. */
2302 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2303 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2307 struct GTY(()) tree_type
{
2308 struct tree_common common
;
2315 unsigned int precision
: 10;
2316 unsigned no_force_blk_flag
: 1;
2317 unsigned needs_constructing_flag
: 1;
2318 unsigned transparent_aggr_flag
: 1;
2319 unsigned restrict_flag
: 1;
2320 unsigned contains_placeholder_bits
: 2;
2322 ENUM_BITFIELD(machine_mode
) mode
: 8;
2324 unsigned string_flag
: 1;
2325 unsigned lang_flag_0
: 1;
2326 unsigned lang_flag_1
: 1;
2327 unsigned lang_flag_2
: 1;
2328 unsigned lang_flag_3
: 1;
2329 unsigned lang_flag_4
: 1;
2330 unsigned lang_flag_5
: 1;
2331 unsigned lang_flag_6
: 1;
2334 alias_set_type alias_set
;
2337 union tree_type_symtab
{
2338 int GTY ((tag ("0"))) address
;
2339 const char * GTY ((tag ("1"))) pointer
;
2340 struct die_struct
* GTY ((tag ("2"))) die
;
2341 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
2342 descbits ("2"))) symtab
;
2351 /* Points to a structure whose details depend on the language in use. */
2352 struct lang_type
*lang_specific
;
2355 /* Define accessor macros for information about type inheritance
2358 A "basetype" means a particular usage of a data type for inheritance
2359 in another type. Each such basetype usage has its own "binfo"
2360 object to describe it. The binfo object is a TREE_VEC node.
2362 Inheritance is represented by the binfo nodes allocated for a
2363 given type. For example, given types C and D, such that D is
2364 inherited by C, 3 binfo nodes will be allocated: one for describing
2365 the binfo properties of C, similarly one for D, and one for
2366 describing the binfo properties of D as a base type for C.
2367 Thus, given a pointer to class C, one can get a pointer to the binfo
2368 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2370 /* BINFO specific flags. */
2372 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2373 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2375 /* Flags for language dependent use. */
2376 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2377 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2378 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2379 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2380 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2381 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2382 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2384 /* The actual data type node being inherited in this basetype. */
2385 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2387 /* The offset where this basetype appears in its containing type.
2388 BINFO_OFFSET slot holds the offset (in bytes)
2389 from the base of the complete object to the base of the part of the
2390 object that is allocated on behalf of this `type'.
2391 This is always 0 except when there is multiple inheritance. */
2393 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2394 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2396 /* The virtual function table belonging to this basetype. Virtual
2397 function tables provide a mechanism for run-time method dispatching.
2398 The entries of a virtual function table are language-dependent. */
2400 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2402 /* The virtual functions in the virtual function table. This is
2403 a TREE_LIST that is used as an initial approximation for building
2404 a virtual function table for this basetype. */
2405 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2407 /* A vector of binfos for the direct basetypes inherited by this
2410 If this basetype describes type D as inherited in C, and if the
2411 basetypes of D are E and F, then this vector contains binfos for
2412 inheritance of E and F by C. */
2413 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2415 /* The number of basetypes for NODE. */
2416 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2418 /* Accessor macro to get to the Nth base binfo of this binfo. */
2419 #define BINFO_BASE_BINFO(NODE,N) \
2420 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2421 #define BINFO_BASE_ITERATE(NODE,N,B) \
2422 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2423 #define BINFO_BASE_APPEND(NODE,T) \
2424 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2426 /* For a BINFO record describing a virtual base class, i.e., one where
2427 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2428 base. The actual contents are language-dependent. In the C++
2429 front-end this field is an INTEGER_CST giving an offset into the
2430 vtable where the offset to the virtual base can be found. */
2431 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2433 /* Indicates the accesses this binfo has to its bases. The values are
2434 access_public_node, access_protected_node or access_private_node.
2435 If this array is not present, public access is implied. */
2436 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2438 #define BINFO_BASE_ACCESS(NODE,N) \
2439 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2440 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2441 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2443 /* The index in the VTT where this subobject's sub-VTT can be found.
2444 NULL_TREE if there is no sub-VTT. */
2445 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2447 /* The index in the VTT where the vptr for this subobject can be
2448 found. NULL_TREE if there is no secondary vptr in the VTT. */
2449 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2451 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2452 inheriting this base for non-virtual bases. For virtual bases it
2453 points either to the binfo for which this is a primary binfo, or to
2454 the binfo of the most derived type. */
2455 #define BINFO_INHERITANCE_CHAIN(NODE) \
2456 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2458 struct GTY (()) tree_binfo
{
2459 struct tree_common common
;
2465 VEC(tree
,gc
) *base_accesses
;
2471 VEC(tree
,none
) base_binfos
;
2475 /* Define fields and accessors for nodes representing declared names. */
2477 /* Nonzero if DECL represents a variable for the SSA passes. */
2478 #define SSA_VAR_P(DECL) \
2479 (TREE_CODE (DECL) == VAR_DECL \
2480 || TREE_CODE (DECL) == PARM_DECL \
2481 || TREE_CODE (DECL) == RESULT_DECL \
2482 || (TREE_CODE (DECL) == SSA_NAME \
2483 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2484 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2485 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2490 /* Enumerate visibility settings. */
2491 #ifndef SYMBOL_VISIBILITY_DEFINED
2492 #define SYMBOL_VISIBILITY_DEFINED
2493 enum symbol_visibility
2496 VISIBILITY_PROTECTED
,
2504 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2506 /* This is the name of the object as written by the user.
2507 It is an IDENTIFIER_NODE. */
2508 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2510 /* Every ..._DECL node gets a unique number. */
2511 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2513 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2515 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2517 /* Every ..._DECL node gets a unique number that stays the same even
2518 when the decl is copied by the inliner once it is set. */
2519 #define DECL_PT_UID(NODE) \
2520 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2521 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2522 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2523 #define SET_DECL_PT_UID(NODE, UID) \
2524 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2525 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2526 be preserved when copyin the decl. */
2527 #define DECL_PT_UID_SET_P(NODE) \
2528 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2530 /* These two fields describe where in the source code the declaration
2531 was. If the declaration appears in several places (as for a C
2532 function that is declared first and then defined later), this
2533 information should refer to the definition. */
2534 #define DECL_SOURCE_LOCATION(NODE) \
2535 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2536 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2537 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2538 #define DECL_IS_BUILTIN(DECL) \
2539 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2541 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2542 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2543 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2544 nodes, this points to either the FUNCTION_DECL for the containing
2545 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2546 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2548 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2549 #define DECL_FIELD_CONTEXT(NODE) \
2550 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2552 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2553 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2555 struct GTY(()) tree_decl_minimal
{
2556 struct tree_common common
;
2564 /* For any sort of a ..._DECL node, this points to the original (abstract)
2565 decl node which this decl is an inlined/cloned instance of, or else it
2566 is NULL indicating that this decl is not an instance of some other decl.
2568 The C front-end also uses this in a nested declaration of an inline
2569 function, to point back to the definition. */
2570 #define DECL_ABSTRACT_ORIGIN(NODE) \
2571 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2573 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2574 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2575 #define DECL_ORIGIN(NODE) \
2576 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2578 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2579 inline instance of some original (abstract) decl from an inline function;
2580 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2581 nodes can also have their abstract origin set to themselves. */
2582 #define DECL_FROM_INLINE(NODE) \
2583 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2584 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2586 /* In a DECL this is the field where attributes are stored. */
2587 #define DECL_ATTRIBUTES(NODE) \
2588 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2590 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2591 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2592 For a VAR_DECL, holds the initial value.
2593 For a PARM_DECL, used for DECL_ARG_TYPE--default
2594 values for parameters are encoded in the type of the function,
2595 not in the PARM_DECL slot.
2596 For a FIELD_DECL, this is used for enumeration values and the C
2597 frontend uses it for temporarily storing bitwidth of bitfields.
2599 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2600 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2602 /* Holds the size of the datum, in bits, as a tree expression.
2603 Need not be constant. */
2604 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2605 /* Likewise for the size in bytes. */
2606 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2607 /* Holds the alignment required for the datum, in bits. */
2608 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2609 /* The alignment of NODE, in bytes. */
2610 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2611 /* Set if the alignment of this DECL has been set by the user, for
2612 example with an 'aligned' attribute. */
2613 #define DECL_USER_ALIGN(NODE) \
2614 (DECL_COMMON_CHECK (NODE)->common.base.user_align)
2615 /* Holds the machine mode corresponding to the declaration of a variable or
2616 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2618 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2620 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2621 operation it is. Note, however, that this field is overloaded, with
2622 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2623 checked before any access to the former. */
2624 #define DECL_FUNCTION_CODE(NODE) \
2625 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2626 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2627 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2629 #define DECL_FUNCTION_PERSONALITY(NODE) \
2630 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2632 /* Nonzero for a given ..._DECL node means that the name of this node should
2633 be ignored for symbolic debug purposes. Moreover, for a FUNCTION_DECL,
2634 the body of the function should also be ignored. */
2635 #define DECL_IGNORED_P(NODE) \
2636 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2638 /* Nonzero for a given ..._DECL node means that this node represents an
2639 "abstract instance" of the given declaration (e.g. in the original
2640 declaration of an inline function). When generating symbolic debugging
2641 information, we mustn't try to generate any address information for nodes
2642 marked as "abstract instances" because we don't actually generate
2643 any code or allocate any data space for such instances. */
2644 #define DECL_ABSTRACT(NODE) \
2645 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2647 /* Language-specific decl information. */
2648 #define DECL_LANG_SPECIFIC(NODE) \
2649 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2651 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2652 do not allocate storage, and refer to a definition elsewhere. Note that
2653 this does not necessarily imply the entity represented by NODE
2654 has no program source-level definition in this translation unit. For
2655 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2656 DECL_EXTERNAL may be true simultaneously; that can be the case for
2657 a C99 "extern inline" function. */
2658 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2660 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2661 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2663 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2665 Also set in some languages for variables, etc., outside the normal
2666 lexical scope, such as class instance variables. */
2667 #define DECL_NONLOCAL(NODE) \
2668 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2670 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2671 Used in FIELD_DECLs for vtable pointers.
2672 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2673 #define DECL_VIRTUAL_P(NODE) \
2674 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2676 /* Used to indicate that this DECL represents a compiler-generated entity. */
2677 #define DECL_ARTIFICIAL(NODE) \
2678 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2680 /* Additional flags for language-specific uses. */
2681 #define DECL_LANG_FLAG_0(NODE) \
2682 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2683 #define DECL_LANG_FLAG_1(NODE) \
2684 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2685 #define DECL_LANG_FLAG_2(NODE) \
2686 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2687 #define DECL_LANG_FLAG_3(NODE) \
2688 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2689 #define DECL_LANG_FLAG_4(NODE) \
2690 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2691 #define DECL_LANG_FLAG_5(NODE) \
2692 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2693 #define DECL_LANG_FLAG_6(NODE) \
2694 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2695 #define DECL_LANG_FLAG_7(NODE) \
2696 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2697 #define DECL_LANG_FLAG_8(NODE) \
2698 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2700 /* Nonzero for a decl which is at file scope. */
2701 #define DECL_FILE_SCOPE_P(EXP) \
2702 (! DECL_CONTEXT (EXP) \
2703 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
2705 /* Nonzero for a decl that is decorated using attribute used.
2706 This indicates to compiler tools that this decl needs to be preserved. */
2707 #define DECL_PRESERVE_P(DECL) \
2708 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2710 /* For function local variables of COMPLEX and VECTOR types,
2711 indicates that the variable is not aliased, and that all
2712 modifications to the variable have been adjusted so that
2713 they are killing assignments. Thus the variable may now
2714 be treated as a GIMPLE register, and use real instead of
2715 virtual ops in SSA form. */
2716 #define DECL_GIMPLE_REG_P(DECL) \
2717 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2719 struct GTY(()) tree_decl_common
{
2720 struct tree_decl_minimal common
;
2723 ENUM_BITFIELD(machine_mode
) mode
: 8;
2725 unsigned nonlocal_flag
: 1;
2726 unsigned virtual_flag
: 1;
2727 unsigned ignored_flag
: 1;
2728 unsigned abstract_flag
: 1;
2729 unsigned artificial_flag
: 1;
2730 unsigned preserve_flag
: 1;
2731 unsigned debug_expr_is_from
: 1;
2733 unsigned lang_flag_0
: 1;
2734 unsigned lang_flag_1
: 1;
2735 unsigned lang_flag_2
: 1;
2736 unsigned lang_flag_3
: 1;
2737 unsigned lang_flag_4
: 1;
2738 unsigned lang_flag_5
: 1;
2739 unsigned lang_flag_6
: 1;
2740 unsigned lang_flag_7
: 1;
2741 unsigned lang_flag_8
: 1;
2743 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2744 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2745 unsigned decl_flag_0
: 1;
2746 /* In FIELD_DECL, this is DECL_BIT_FIELD
2747 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2748 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2749 unsigned decl_flag_1
: 1;
2750 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2751 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR_P. */
2752 unsigned decl_flag_2
: 1;
2753 /* Logically, these two would go in a theoretical base shared by var and
2755 unsigned gimple_reg_flag
: 1;
2756 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2757 unsigned decl_by_reference_flag
: 1;
2758 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2759 unsigned decl_restricted_flag
: 1;
2761 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2763 unsigned decl_read_flag
: 1;
2765 /* Padding so that 'off_align' can be on a 32-bit boundary. */
2766 unsigned decl_common_unused
: 1;
2768 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2769 unsigned int off_align
: 8;
2771 /* 24-bits unused. */
2773 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2776 /* UID for points-to sets, stable over copying from inlining. */
2777 unsigned int pt_uid
;
2782 tree abstract_origin
;
2784 /* Points to a structure whose details depend on the language in use. */
2785 struct lang_decl
*lang_specific
;
2788 extern tree
decl_value_expr_lookup (tree
);
2789 extern void decl_value_expr_insert (tree
, tree
);
2791 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2792 if transformations have made this more complicated than evaluating the
2793 decl itself. This should only be used for debugging; once this field has
2794 been set, the decl itself may not legitimately appear in the function. */
2795 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2796 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_2)
2797 #define DECL_VALUE_EXPR(NODE) \
2798 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2799 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2800 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2802 /* Holds the RTL expression for the value of a variable or function.
2803 This value can be evaluated lazily for functions, variables with
2804 static storage duration, and labels. */
2805 #define DECL_RTL(NODE) \
2806 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2807 ? (NODE)->decl_with_rtl.rtl \
2808 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2810 /* Set the DECL_RTL for NODE to RTL. */
2811 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2813 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2814 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2816 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2817 #define DECL_RTL_SET_P(NODE) \
2818 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2820 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2821 NODE1, it will not be set for NODE2; this is a lazy copy. */
2822 #define COPY_DECL_RTL(NODE1, NODE2) \
2823 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2824 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2826 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2827 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2829 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2830 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2832 struct GTY(()) tree_decl_with_rtl
{
2833 struct tree_decl_common common
;
2837 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
2838 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2839 of the structure. */
2840 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2842 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
2843 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2844 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2845 natural alignment of the field's type). */
2846 #define DECL_FIELD_BIT_OFFSET(NODE) \
2847 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2849 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
2850 if so, the type that was originally specified for it.
2851 TREE_TYPE may have been modified (in finish_struct). */
2852 #define DECL_BIT_FIELD_TYPE(NODE) \
2853 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2855 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2856 if nonzero, indicates that the field occupies the type. */
2857 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2859 /* For FIELD_DECLs, off_align holds the number of low-order bits of
2860 DECL_FIELD_OFFSET which are known to be always zero.
2861 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2863 #define DECL_OFFSET_ALIGN(NODE) \
2864 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
2866 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2867 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
2868 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
2870 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2871 which this FIELD_DECL is defined. This information is needed when
2872 writing debugging information about vfield and vbase decls for C++. */
2873 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2875 /* In a FIELD_DECL, indicates this field should be bit-packed. */
2876 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->common.base.packed_flag)
2878 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2880 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2882 /* Used in a FIELD_DECL to indicate that we cannot form the address of
2883 this component. This makes it possible for Type-Based Alias Analysis
2884 to disambiguate accesses to this field with indirect accesses using
2887 struct S { int i; } s;
2890 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2892 From the implementation's viewpoint, the alias set of the type of the
2893 field 'i' (int) will not be recorded as a subset of that of the type of
2894 's' (struct S) in record_component_aliases. The counterpart is that
2895 accesses to s.i must not be given the alias set of the type of 'i'
2896 (int) but instead directly that of the type of 's' (struct S). */
2897 #define DECL_NONADDRESSABLE_P(NODE) \
2898 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
2900 struct GTY(()) tree_field_decl
{
2901 struct tree_decl_common common
;
2904 tree bit_field_type
;
2910 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2911 dense, unique within any one function, and may be used to index arrays.
2912 If the value is -1, then no UID has been assigned. */
2913 #define LABEL_DECL_UID(NODE) \
2914 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
2916 /* In a LABEL_DECL, the EH region number for which the label is the
2917 post_landing_pad. */
2918 #define EH_LANDING_PAD_NR(NODE) \
2919 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
2921 /* In LABEL_DECL nodes, nonzero means that an error message about
2922 jumping into such a binding contour has been printed for this label. */
2923 #define DECL_ERROR_ISSUED(NODE) \
2924 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
2926 struct GTY(()) tree_label_decl
{
2927 struct tree_decl_with_rtl common
;
2929 int eh_landing_pad_nr
;
2933 struct GTY(()) tree_result_decl
{
2934 struct tree_decl_with_rtl common
;
2935 struct var_ann_d
*ann
;
2938 struct GTY(()) tree_const_decl
{
2939 struct tree_decl_with_rtl common
;
2942 /* For a PARM_DECL, records the data type used to pass the argument,
2943 which may be different from the type seen in the program. */
2944 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2946 /* For PARM_DECL, holds an RTL for the stack slot or register
2947 where the data was actually passed. */
2948 #define DECL_INCOMING_RTL(NODE) \
2949 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
2951 struct GTY(()) tree_parm_decl
{
2952 struct tree_decl_with_rtl common
;
2954 struct var_ann_d
*ann
;
2958 /* Nonzero for a given ..._DECL node means that no warnings should be
2959 generated just because this node is unused. */
2960 #define DECL_IN_SYSTEM_HEADER(NODE) \
2961 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
2963 /* Used to indicate that the linkage status of this DECL is not yet known,
2964 so it should not be output now. */
2965 #define DECL_DEFER_OUTPUT(NODE) \
2966 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2968 /* In a VAR_DECL that's static,
2969 nonzero if the space is in the text section. */
2970 #define DECL_IN_TEXT_SECTION(NODE) \
2971 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2973 /* In a VAR_DECL that's static,
2974 nonzero if it belongs to the global constant pool. */
2975 #define DECL_IN_CONSTANT_POOL(NODE) \
2976 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
2978 /* Nonzero for a given ..._DECL node means that this node should be
2979 put in .common, if possible. If a DECL_INITIAL is given, and it
2980 is not error_mark_node, then the decl cannot be put in .common. */
2981 #define DECL_COMMON(NODE) \
2982 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2984 /* In a VAR_DECL, nonzero if the decl is a register variable with
2985 an explicit asm specification. */
2986 #define DECL_HARD_REGISTER(NODE) \
2987 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2989 /* Used to indicate that this DECL has weak linkage. */
2990 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2992 /* Used to indicate that the DECL is a dllimport. */
2993 #define DECL_DLLIMPORT_P(NODE) \
2994 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
2996 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2997 not be put out unless it is needed in this translation unit.
2998 Entities like this are shared across translation units (like weak
2999 entities), but are guaranteed to be generated by any translation
3000 unit that needs them, and therefore need not be put out anywhere
3001 where they are not needed. DECL_COMDAT is just a hint to the
3002 back-end; it is up to front-ends which set this flag to ensure
3003 that there will never be any harm, other than bloat, in putting out
3004 something which is DECL_COMDAT. */
3005 #define DECL_COMDAT(NODE) \
3006 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3008 #define DECL_COMDAT_GROUP(NODE) \
3009 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3011 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3012 multiple translation units should be merged. */
3013 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3015 /* A replaceable function is one which may be replaced at link-time
3016 with an entirely different definition, provided that the
3017 replacement has the same type. For example, functions declared
3018 with __attribute__((weak)) on most systems are replaceable.
3020 COMDAT functions are not replaceable, since all definitions of the
3021 function must be equivalent. It is important that COMDAT functions
3022 not be treated as replaceable so that use of C++ template
3023 instantiations is not penalized.
3025 In other respects, the condition is usually equivalent to whether
3026 the function binds to the current module (shared library or executable).
3027 However, weak functions can always be overridden by earlier TUs
3028 in the same module, even if they bind locally to that module.
3030 For example, DECL_REPLACEABLE is used to determine whether or not a
3031 function (including a template instantiation) which is not
3032 explicitly declared "inline" can be inlined. If the function is
3033 DECL_REPLACEABLE then it is not safe to do the inlining, since the
3034 implementation chosen at link-time may be different. However, a
3035 function that is not DECL_REPLACEABLE can be inlined, since all
3036 versions of the function will be functionally identical. */
3037 #define DECL_REPLACEABLE_P(NODE) \
3038 (!DECL_COMDAT (NODE) && (DECL_WEAK (NODE) || !targetm.binds_local_p (NODE)))
3040 /* The name of the object as the assembler will see it (but before any
3041 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3042 as DECL_NAME. It is an IDENTIFIER_NODE. */
3043 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3045 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3046 This is true of all DECL nodes except FIELD_DECL. */
3047 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3048 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3050 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3051 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3053 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3054 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3055 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3057 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3058 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3059 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3061 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3062 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3063 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3064 semantics of using this macro, are different than saying:
3066 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3068 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3070 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3071 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3072 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3073 DECL_ASSEMBLER_NAME (DECL1)) \
3076 /* Records the section name in a section attribute. Used to pass
3077 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3078 #define DECL_SECTION_NAME(NODE) \
3079 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3081 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3082 this variable in a BIND_EXPR. */
3083 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3084 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3086 /* Value of the decls's visibility attribute */
3087 #define DECL_VISIBILITY(NODE) \
3088 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3090 /* Nonzero means that the decl had its visibility specified rather than
3092 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3093 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3095 /* In a VAR_DECL, the model to use if the data should be allocated from
3096 thread-local storage. */
3097 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3099 /* In a VAR_DECL, nonzero if the data should be allocated from
3100 thread-local storage. */
3101 #define DECL_THREAD_LOCAL_P(NODE) \
3102 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3104 /* In a non-local VAR_DECL with static storage duration, true if the
3105 variable has an initialization priority. If false, the variable
3106 will be initialized at the DEFAULT_INIT_PRIORITY. */
3107 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3108 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3110 struct GTY(()) tree_decl_with_vis
{
3111 struct tree_decl_with_rtl common
;
3112 tree assembler_name
;
3116 /* Belong to VAR_DECL exclusively. */
3117 unsigned defer_output
: 1;
3118 unsigned hard_register
: 1;
3119 unsigned thread_local
: 1;
3120 unsigned common_flag
: 1;
3121 unsigned in_text_section
: 1;
3122 unsigned in_constant_pool
: 1;
3123 unsigned dllimport_flag
: 1;
3124 /* Don't belong to VAR_DECL exclusively. */
3125 unsigned weak_flag
: 1;
3127 unsigned seen_in_bind_expr
: 1;
3128 unsigned comdat_flag
: 1;
3129 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3130 unsigned visibility_specified
: 1;
3131 /* Belongs to VAR_DECL exclusively. */
3132 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3134 /* Belong to FUNCTION_DECL exclusively. */
3135 unsigned init_priority_p
: 1;
3136 /* Used by C++ only. Might become a generic decl flag. */
3137 unsigned shadowed_for_var_p
: 1;
3138 /* 14 unused bits. */
3141 extern tree
decl_debug_expr_lookup (tree
);
3142 extern void decl_debug_expr_insert (tree
, tree
);
3143 /* For VAR_DECL, this is set to either an expression that it was split
3144 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3145 subexpressions that it was split into. */
3146 #define DECL_DEBUG_EXPR(NODE) \
3147 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3149 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3150 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3152 /* An initialization priority. */
3153 typedef unsigned short priority_type
;
3155 extern priority_type
decl_init_priority_lookup (tree
);
3156 extern priority_type
decl_fini_priority_lookup (tree
);
3157 extern void decl_init_priority_insert (tree
, priority_type
);
3158 extern void decl_fini_priority_insert (tree
, priority_type
);
3160 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3162 #define DECL_INIT_PRIORITY(NODE) \
3163 (decl_init_priority_lookup (NODE))
3164 /* Set the initialization priority for NODE to VAL. */
3165 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3166 (decl_init_priority_insert (NODE, VAL))
3168 /* For a FUNCTION_DECL the finalization priority of NODE. */
3169 #define DECL_FINI_PRIORITY(NODE) \
3170 (decl_fini_priority_lookup (NODE))
3171 /* Set the finalization priority for NODE to VAL. */
3172 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3173 (decl_fini_priority_insert (NODE, VAL))
3175 /* The initialization priority for entities for which no explicit
3176 initialization priority has been specified. */
3177 #define DEFAULT_INIT_PRIORITY 65535
3179 /* The maximum allowed initialization priority. */
3180 #define MAX_INIT_PRIORITY 65535
3182 /* The largest priority value reserved for use by system runtime
3184 #define MAX_RESERVED_INIT_PRIORITY 100
3186 #define DECL_VAR_ANN_PTR(NODE) \
3187 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3188 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3189 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3192 struct GTY(()) tree_var_decl
{
3193 struct tree_decl_with_vis common
;
3194 struct var_ann_d
*ann
;
3198 /* This field is used to reference anything in decl.result and is meant only
3199 for use by the garbage collector. */
3200 #define DECL_RESULT_FLD(NODE) \
3201 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3203 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3204 Before the struct containing the FUNCTION_DECL is laid out,
3205 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3206 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3207 function. When the class is laid out, this pointer is changed
3208 to an INTEGER_CST node which is suitable for use as an index
3209 into the virtual function table.
3210 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3211 #define DECL_VINDEX(NODE) \
3212 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3215 tree_decl_non_common
{
3216 struct tree_decl_with_vis common
;
3217 /* C++ uses this in namespaces. */
3219 /* C++ uses this in templates. */
3221 /* Almost all FE's use this. */
3223 /* C++ uses this in namespaces. */
3227 /* In FUNCTION_DECL, holds the decl for the return value. */
3228 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3230 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3231 #define DECL_UNINLINABLE(NODE) \
3232 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3234 /* In a FUNCTION_DECL, the saved representation of the body of the
3236 #define DECL_SAVED_TREE(NODE) \
3237 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3239 /* Nonzero in a FUNCTION_DECL means this function should be treated
3240 as if it were a malloc, meaning it returns a pointer that is
3242 #define DECL_IS_MALLOC(NODE) \
3243 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3245 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3246 C++ operator new, meaning that it returns a pointer for which we
3247 should not use type based aliasing. */
3248 #define DECL_IS_OPERATOR_NEW(NODE) \
3249 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3251 /* Nonzero in a FUNCTION_DECL means this function may return more
3253 #define DECL_IS_RETURNS_TWICE(NODE) \
3254 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3256 /* Nonzero in a FUNCTION_DECL means this function should be treated
3257 as "pure" function (like const function, but may read global memory). */
3258 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3260 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3261 the const or pure function may not terminate. When this is nonzero
3262 for a const or pure function, it can be dealt with by cse passes
3263 but cannot be removed by dce passes since you are not allowed to
3264 change an infinite looping program into one that terminates without
3266 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3267 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3269 /* Nonzero in a FUNCTION_DECL means this function should be treated
3270 as "novops" function (function that does not read global memory,
3271 but may have arbitrary side effects). */
3272 #define DECL_IS_NOVOPS(NODE) \
3273 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3275 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3276 at the beginning or end of execution. */
3277 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3278 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3280 #define DECL_STATIC_DESTRUCTOR(NODE) \
3281 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3283 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3284 be instrumented with calls to support routines. */
3285 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3286 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3288 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3289 disabled in this function. */
3290 #define DECL_NO_LIMIT_STACK(NODE) \
3291 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3293 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3294 #define DECL_STATIC_CHAIN(NODE) \
3295 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3297 /* Nonzero for a decl that cgraph has decided should be inlined into
3298 at least one call site. It is not meaningful to look at this
3299 directly; always use cgraph_function_possibly_inlined_p. */
3300 #define DECL_POSSIBLY_INLINED(DECL) \
3301 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3303 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3304 such as via the `inline' keyword in C/C++. This flag controls the linkage
3305 semantics of 'inline' */
3306 #define DECL_DECLARED_INLINE_P(NODE) \
3307 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3309 /* Nonzero in a FUNCTION_DECL means this function should not get
3310 -Winline warnings. */
3311 #define DECL_NO_INLINE_WARNING_P(NODE) \
3312 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3314 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3315 disregarding size and cost heuristics. This is equivalent to using
3316 the always_inline attribute without the required diagnostics if the
3317 function cannot be inlined. */
3318 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3319 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3321 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3322 that describes the status of this function. */
3323 #define DECL_STRUCT_FUNCTION(NODE) \
3324 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3326 /* In a FUNCTION_DECL, nonzero means a built in function. */
3327 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3329 /* For a builtin function, identify which part of the compiler defined it. */
3330 #define DECL_BUILT_IN_CLASS(NODE) \
3331 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3333 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3334 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3336 #define DECL_ARGUMENTS(NODE) \
3337 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3338 #define DECL_ARGUMENT_FLD(NODE) \
3339 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3341 /* In FUNCTION_DECL, the function specific target options to use when compiling
3343 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3344 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3346 /* In FUNCTION_DECL, the function specific optimization options to use when
3347 compiling this function. */
3348 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3349 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3351 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3352 arguments/result/saved_tree fields by front ends. It was either inherit
3353 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3354 which seemed a bit strange. */
3356 struct GTY(()) tree_function_decl
{
3357 struct tree_decl_non_common common
;
3361 /* The personality function. Used for stack unwinding. */
3364 /* Function specific options that are used by this function. */
3365 tree function_specific_target
; /* target options */
3366 tree function_specific_optimization
; /* optimization options */
3368 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3369 DECL_FUNCTION_CODE. Otherwise unused.
3370 ??? The bitfield needs to be able to hold all target function
3372 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3373 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3375 unsigned static_ctor_flag
: 1;
3376 unsigned static_dtor_flag
: 1;
3377 unsigned uninlinable
: 1;
3379 unsigned possibly_inlined
: 1;
3380 unsigned novops_flag
: 1;
3381 unsigned returns_twice_flag
: 1;
3382 unsigned malloc_flag
: 1;
3383 unsigned operator_new_flag
: 1;
3384 unsigned declared_inline_flag
: 1;
3385 unsigned regdecl_flag
: 1;
3387 unsigned no_inline_warning_flag
: 1;
3388 unsigned no_instrument_function_entry_exit
: 1;
3389 unsigned no_limit_stack
: 1;
3390 unsigned disregard_inline_limits
: 1;
3391 unsigned pure_flag
: 1;
3392 unsigned looping_const_or_pure_flag
: 1;
3398 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3399 #define DECL_ORIGINAL_TYPE(NODE) \
3400 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3402 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3403 into stabs. Instead it will generate cross reference ('x') of names.
3404 This uses the same flag as DECL_EXTERNAL. */
3405 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3406 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3408 /* Getter of the imported declaration associated to the
3409 IMPORTED_DECL node. */
3410 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3411 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3413 struct GTY(()) tree_type_decl
{
3414 struct tree_decl_non_common common
;
3418 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3419 To reduce overhead, the nodes containing the statements are not trees.
3420 This avoids the overhead of tree_common on all linked list elements.
3422 Use the interface in tree-iterator.h to access this node. */
3424 #define STATEMENT_LIST_HEAD(NODE) \
3425 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3426 #define STATEMENT_LIST_TAIL(NODE) \
3427 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3429 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3431 struct tree_statement_list_node
*prev
;
3432 struct tree_statement_list_node
*next
;
3436 struct GTY(()) tree_statement_list
3438 struct tree_common common
;
3439 struct tree_statement_list_node
*head
;
3440 struct tree_statement_list_node
*tail
;
3444 /* Optimization options used by a function. */
3446 struct GTY(()) tree_optimization_option
{
3447 struct tree_common common
;
3449 /* The optimization options used by the user. */
3450 struct cl_optimization opts
;
3453 #define TREE_OPTIMIZATION(NODE) \
3454 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3456 /* Return a tree node that encapsulates the current optimization options. */
3457 extern tree
build_optimization_node (void);
3459 /* Target options used by a function. */
3461 struct GTY(()) tree_target_option
{
3462 struct tree_common common
;
3464 /* The optimization options used by the user. */
3465 struct cl_target_option opts
;
3468 #define TREE_TARGET_OPTION(NODE) \
3469 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3471 /* Return a tree node that encapsulates the current target options. */
3472 extern tree
build_target_option_node (void);
3475 /* Define the overall contents of a tree node.
3476 It may be any of the structures declared above
3477 for various types of node. */
3479 union GTY ((ptr_alias (union lang_tree_node
),
3480 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3481 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3482 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3483 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3484 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3485 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3486 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3487 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3488 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3489 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3490 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3491 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3492 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3493 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3494 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3495 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3496 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3497 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3498 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3499 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3500 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3501 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3502 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3503 struct tree_type
GTY ((tag ("TS_TYPE"))) type
;
3504 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3505 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3506 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3507 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3508 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3509 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3510 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3511 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3512 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3513 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3514 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3517 /* Standard named or nameless data types of the C compiler. */
3540 TI_INTEGER_MINUS_ONE
,
3557 TI_COMPLEX_INTEGER_TYPE
,
3558 TI_COMPLEX_FLOAT_TYPE
,
3559 TI_COMPLEX_DOUBLE_TYPE
,
3560 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3564 TI_LONG_DOUBLE_TYPE
,
3568 TI_LONG_DOUBLE_PTR_TYPE
,
3569 TI_INTEGER_PTR_TYPE
,
3578 TI_VA_LIST_GPR_COUNTER_FIELD
,
3579 TI_VA_LIST_FPR_COUNTER_FIELD
,
3586 TI_DFLOAT32_PTR_TYPE
,
3587 TI_DFLOAT64_PTR_TYPE
,
3588 TI_DFLOAT128_PTR_TYPE
,
3597 TI_SAT_LLFRACT_TYPE
,
3598 TI_SAT_USFRACT_TYPE
,
3600 TI_SAT_ULFRACT_TYPE
,
3601 TI_SAT_ULLFRACT_TYPE
,
3613 TI_SAT_LLACCUM_TYPE
,
3614 TI_SAT_USACCUM_TYPE
,
3616 TI_SAT_ULACCUM_TYPE
,
3617 TI_SAT_ULLACCUM_TYPE
,
3663 TI_OPTIMIZATION_DEFAULT
,
3664 TI_OPTIMIZATION_CURRENT
,
3665 TI_TARGET_OPTION_DEFAULT
,
3666 TI_TARGET_OPTION_CURRENT
,
3667 TI_CURRENT_TARGET_PRAGMA
,
3668 TI_CURRENT_OPTIMIZE_PRAGMA
,
3673 extern GTY(()) tree global_trees
[TI_MAX
];
3675 #define error_mark_node global_trees[TI_ERROR_MARK]
3677 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3678 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3679 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3680 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3681 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3683 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3684 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3685 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3686 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3687 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3689 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3690 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3692 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3693 #define integer_one_node global_trees[TI_INTEGER_ONE]
3694 #define integer_three_node global_trees[TI_INTEGER_THREE]
3695 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3696 #define size_zero_node global_trees[TI_SIZE_ZERO]
3697 #define size_one_node global_trees[TI_SIZE_ONE]
3698 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3699 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3700 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3702 /* Base access nodes. */
3703 #define access_public_node global_trees[TI_PUBLIC]
3704 #define access_protected_node global_trees[TI_PROTECTED]
3705 #define access_private_node global_trees[TI_PRIVATE]
3707 #define null_pointer_node global_trees[TI_NULL_POINTER]
3709 #define float_type_node global_trees[TI_FLOAT_TYPE]
3710 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3711 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3713 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3714 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3715 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3716 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3718 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3719 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3720 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3721 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3723 #define void_type_node global_trees[TI_VOID_TYPE]
3724 /* The C type `void *'. */
3725 #define ptr_type_node global_trees[TI_PTR_TYPE]
3726 /* The C type `const void *'. */
3727 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3728 /* The C type `size_t'. */
3729 #define size_type_node global_trees[TI_SIZE_TYPE]
3730 #define pid_type_node global_trees[TI_PID_TYPE]
3731 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3732 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3733 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3734 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3735 /* The C type `FILE *'. */
3736 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3738 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3739 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3740 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3742 /* The decimal floating point types. */
3743 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3744 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3745 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3746 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3747 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3748 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3750 /* The fixed-point types. */
3751 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3752 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3753 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3754 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3755 #define sat_unsigned_short_fract_type_node \
3756 global_trees[TI_SAT_USFRACT_TYPE]
3757 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3758 #define sat_unsigned_long_fract_type_node \
3759 global_trees[TI_SAT_ULFRACT_TYPE]
3760 #define sat_unsigned_long_long_fract_type_node \
3761 global_trees[TI_SAT_ULLFRACT_TYPE]
3762 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3763 #define fract_type_node global_trees[TI_FRACT_TYPE]
3764 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3765 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3766 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3767 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3768 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3769 #define unsigned_long_long_fract_type_node \
3770 global_trees[TI_ULLFRACT_TYPE]
3771 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3772 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3773 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3774 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3775 #define sat_unsigned_short_accum_type_node \
3776 global_trees[TI_SAT_USACCUM_TYPE]
3777 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3778 #define sat_unsigned_long_accum_type_node \
3779 global_trees[TI_SAT_ULACCUM_TYPE]
3780 #define sat_unsigned_long_long_accum_type_node \
3781 global_trees[TI_SAT_ULLACCUM_TYPE]
3782 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3783 #define accum_type_node global_trees[TI_ACCUM_TYPE]
3784 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3785 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3786 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3787 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3788 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3789 #define unsigned_long_long_accum_type_node \
3790 global_trees[TI_ULLACCUM_TYPE]
3791 #define qq_type_node global_trees[TI_QQ_TYPE]
3792 #define hq_type_node global_trees[TI_HQ_TYPE]
3793 #define sq_type_node global_trees[TI_SQ_TYPE]
3794 #define dq_type_node global_trees[TI_DQ_TYPE]
3795 #define tq_type_node global_trees[TI_TQ_TYPE]
3796 #define uqq_type_node global_trees[TI_UQQ_TYPE]
3797 #define uhq_type_node global_trees[TI_UHQ_TYPE]
3798 #define usq_type_node global_trees[TI_USQ_TYPE]
3799 #define udq_type_node global_trees[TI_UDQ_TYPE]
3800 #define utq_type_node global_trees[TI_UTQ_TYPE]
3801 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3802 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3803 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3804 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3805 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3806 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3807 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3808 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3809 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3810 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3811 #define ha_type_node global_trees[TI_HA_TYPE]
3812 #define sa_type_node global_trees[TI_SA_TYPE]
3813 #define da_type_node global_trees[TI_DA_TYPE]
3814 #define ta_type_node global_trees[TI_TA_TYPE]
3815 #define uha_type_node global_trees[TI_UHA_TYPE]
3816 #define usa_type_node global_trees[TI_USA_TYPE]
3817 #define uda_type_node global_trees[TI_UDA_TYPE]
3818 #define uta_type_node global_trees[TI_UTA_TYPE]
3819 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3820 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3821 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3822 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3823 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3824 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3825 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3826 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3828 /* The node that should be placed at the end of a parameter list to
3829 indicate that the function does not take a variable number of
3830 arguments. The TREE_VALUE will be void_type_node and there will be
3831 no TREE_CHAIN. Language-independent code should not assume
3832 anything else about this node. */
3833 #define void_list_node global_trees[TI_VOID_LIST_NODE]
3835 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3836 #define MAIN_NAME_P(NODE) \
3837 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3839 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
3841 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3842 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
3844 /* Default/current target options (TARGET_OPTION_NODE). */
3845 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3846 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3848 /* Default tree list option(), optimize() pragmas to be linked into the
3850 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
3851 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3853 /* An enumeration of the standard C integer types. These must be
3854 ordered so that shorter types appear before longer ones, and so
3855 that signed types appear before unsigned ones, for the correct
3856 functioning of interpret_integer() in c-lex.c. */
3857 enum integer_type_kind
3869 itk_unsigned_long_long
,
3871 itk_unsigned_int128
,
3875 typedef enum integer_type_kind integer_type_kind
;
3877 /* The standard C integer types. Use integer_type_kind to index into
3879 extern GTY(()) tree integer_types
[itk_none
];
3881 #define char_type_node integer_types[itk_char]
3882 #define signed_char_type_node integer_types[itk_signed_char]
3883 #define unsigned_char_type_node integer_types[itk_unsigned_char]
3884 #define short_integer_type_node integer_types[itk_short]
3885 #define short_unsigned_type_node integer_types[itk_unsigned_short]
3886 #define integer_type_node integer_types[itk_int]
3887 #define unsigned_type_node integer_types[itk_unsigned_int]
3888 #define long_integer_type_node integer_types[itk_long]
3889 #define long_unsigned_type_node integer_types[itk_unsigned_long]
3890 #define long_long_integer_type_node integer_types[itk_long_long]
3891 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
3892 #define int128_integer_type_node integer_types[itk_int128]
3893 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
3895 /* Set to the default thread-local storage (tls) model to use. */
3897 extern enum tls_model flag_tls_default
;
3900 /* A pointer-to-function member type looks like:
3907 If __pfn is NULL, it is a NULL pointer-to-member-function.
3909 (Because the vtable is always the first thing in the object, we
3910 don't need its offset.) If the function is virtual, then PFN is
3911 one plus twice the index into the vtable; otherwise, it is just a
3912 pointer to the function.
3914 Unfortunately, using the lowest bit of PFN doesn't work in
3915 architectures that don't impose alignment requirements on function
3916 addresses, or that use the lowest bit to tell one ISA from another,
3917 for example. For such architectures, we use the lowest bit of
3918 DELTA instead of the lowest bit of the PFN, and DELTA will be
3921 enum ptrmemfunc_vbit_where_t
3923 ptrmemfunc_vbit_in_pfn
,
3924 ptrmemfunc_vbit_in_delta
3927 #define NULL_TREE (tree) NULL
3929 extern tree
decl_assembler_name (tree
);
3930 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
3931 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
3933 /* Compute the number of bytes occupied by 'node'. This routine only
3934 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3936 extern size_t tree_size (const_tree
);
3938 /* Compute the number of bytes occupied by a tree with code CODE. This
3939 function cannot be used for TREE_VEC codes, which are of variable
3941 extern size_t tree_code_size (enum tree_code
);
3943 /* Lowest level primitive for allocating a node.
3944 The TREE_CODE is the only argument. Contents are initialized
3945 to zero except for a few of the common fields. */
3947 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
3948 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
3950 /* Make a copy of a node, with all the same contents. */
3952 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
3953 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
3955 /* Make a copy of a chain of TREE_LIST nodes. */
3957 extern tree
copy_list (tree
);
3960 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
3961 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3963 /* Make a TREE_VEC. */
3965 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
3966 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
3968 /* Return the (unique) IDENTIFIER_NODE node for a given name.
3969 The name is supplied as a char *. */
3971 extern tree
get_identifier (const char *);
3973 #if GCC_VERSION >= 3000
3974 #define get_identifier(str) \
3975 (__builtin_constant_p (str) \
3976 ? get_identifier_with_length ((str), strlen (str)) \
3977 : get_identifier (str))
3981 /* Identical to get_identifier, except that the length is assumed
3984 extern tree
get_identifier_with_length (const char *, size_t);
3986 /* If an identifier with the name TEXT (a null-terminated string) has
3987 previously been referred to, return that node; otherwise return
3990 extern tree
maybe_get_identifier (const char *);
3992 /* Construct various types of nodes. */
3994 extern tree
build_nt (enum tree_code
, ...);
3995 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
3997 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
3998 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3999 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4000 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4001 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4002 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4003 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4004 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4005 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4006 tree MEM_STAT_DECL
);
4007 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4008 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4009 tree MEM_STAT_DECL
);
4010 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4011 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4012 tree
, tree MEM_STAT_DECL
);
4013 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4014 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4016 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4017 #define build_var_debug_value(t1,t2) \
4018 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4020 /* Constructs double_int from tree CST. */
4022 static inline double_int
4023 tree_to_double_int (const_tree cst
)
4025 return TREE_INT_CST (cst
);
4028 extern tree
double_int_to_tree (tree
, double_int
);
4029 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4030 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4032 /* Create an INT_CST node with a CST value zero extended. */
4035 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4037 return double_int_to_tree (type
, uhwi_to_double_int (cst
));
4040 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4041 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4042 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4043 extern tree
build_vector (tree
, tree
);
4044 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4045 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4046 extern tree
build_constructor_single (tree
, tree
, tree
);
4047 extern tree
build_constructor_from_list (tree
, tree
);
4048 extern tree
build_real_from_int_cst (tree
, const_tree
);
4049 extern tree
build_complex (tree
, tree
, tree
);
4050 extern tree
build_one_cst (tree
);
4051 extern tree
build_string (int, const char *);
4052 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4053 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4054 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4055 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4056 extern tree
build_decl_stat (location_t
, enum tree_code
,
4057 tree
, tree MEM_STAT_DECL
);
4058 extern tree
build_fn_decl (const char *, tree
);
4059 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4060 extern tree
build_block (tree
, tree
, tree
, tree
);
4061 extern tree
build_empty_stmt (location_t
);
4062 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4064 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4065 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4067 extern tree
build_call_nary (tree
, tree
, int, ...);
4068 extern tree
build_call_valist (tree
, tree
, int, va_list);
4069 #define build_call_array(T1,T2,N,T3)\
4070 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4071 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4072 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4074 /* Construct various nodes representing data types. */
4076 extern tree
make_signed_type (int);
4077 extern tree
make_unsigned_type (int);
4078 extern tree
signed_or_unsigned_type_for (int, tree
);
4079 extern tree
signed_type_for (tree
);
4080 extern tree
unsigned_type_for (tree
);
4081 extern void initialize_sizetypes (void);
4082 extern void set_sizetype (tree
);
4083 extern void fixup_unsigned_type (tree
);
4084 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4085 extern tree
build_pointer_type (tree
);
4086 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4087 extern tree
build_reference_type (tree
);
4088 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4089 extern tree
build_vector_type (tree innertype
, int nunits
);
4090 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4091 extern tree
build_type_no_quals (tree
);
4092 extern tree
build_index_type (tree
);
4093 extern tree
build_index_2_type (tree
, tree
);
4094 extern tree
build_array_type (tree
, tree
);
4095 extern tree
build_function_type (tree
, tree
);
4096 extern tree
build_function_type_list (tree
, ...);
4097 extern tree
build_function_type_skip_args (tree
, bitmap
);
4098 extern tree
build_function_decl_skip_args (tree
, bitmap
);
4099 extern tree
build_varargs_function_type_list (tree
, ...);
4100 extern tree
build_method_type_directly (tree
, tree
, tree
);
4101 extern tree
build_method_type (tree
, tree
);
4102 extern tree
build_offset_type (tree
, tree
);
4103 extern tree
build_complex_type (tree
);
4104 extern tree
array_type_nelts (const_tree
);
4105 extern bool in_array_bounds_p (tree
);
4106 extern bool range_in_array_bounds_p (tree
);
4108 extern tree
value_member (tree
, tree
);
4109 extern tree
purpose_member (const_tree
, tree
);
4110 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4111 extern tree
chain_index (int, tree
);
4113 extern int attribute_list_equal (const_tree
, const_tree
);
4114 extern int attribute_list_contained (const_tree
, const_tree
);
4115 extern int tree_int_cst_equal (const_tree
, const_tree
);
4116 extern int tree_int_cst_lt (const_tree
, const_tree
);
4117 extern int tree_int_cst_compare (const_tree
, const_tree
);
4118 extern int host_integerp (const_tree
, int)
4119 #ifndef ENABLE_TREE_CHECKING
4120 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4123 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4124 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4125 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4126 tree_low_cst (const_tree t
, int pos
)
4128 gcc_assert (host_integerp (t
, pos
));
4129 return TREE_INT_CST_LOW (t
);
4132 extern int tree_int_cst_msb (const_tree
);
4133 extern int tree_int_cst_sgn (const_tree
);
4134 extern int tree_int_cst_sign_bit (const_tree
);
4135 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4136 extern bool tree_expr_nonnegative_p (tree
);
4137 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4138 extern bool may_negate_without_overflow_p (const_tree
);
4139 extern tree
strip_array_types (tree
);
4140 extern tree
excess_precision_type (tree
);
4142 /* Construct various nodes representing fract or accum data types. */
4144 extern tree
make_fract_type (int, int, int);
4145 extern tree
make_accum_type (int, int, int);
4147 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4148 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4149 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4150 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4151 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4152 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4153 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4154 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4156 #define make_or_reuse_signed_fract_type(P) \
4157 make_or_reuse_fract_type (P, 0, 0)
4158 #define make_or_reuse_unsigned_fract_type(P) \
4159 make_or_reuse_fract_type (P, 1, 0)
4160 #define make_or_reuse_sat_signed_fract_type(P) \
4161 make_or_reuse_fract_type (P, 0, 1)
4162 #define make_or_reuse_sat_unsigned_fract_type(P) \
4163 make_or_reuse_fract_type (P, 1, 1)
4164 #define make_or_reuse_signed_accum_type(P) \
4165 make_or_reuse_accum_type (P, 0, 0)
4166 #define make_or_reuse_unsigned_accum_type(P) \
4167 make_or_reuse_accum_type (P, 1, 0)
4168 #define make_or_reuse_sat_signed_accum_type(P) \
4169 make_or_reuse_accum_type (P, 0, 1)
4170 #define make_or_reuse_sat_unsigned_accum_type(P) \
4171 make_or_reuse_accum_type (P, 1, 1)
4173 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4174 put the prototype here. Rtl.h does declare the prototype if
4175 tree.h had been included. */
4177 extern tree
make_tree (tree
, rtx
);
4179 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4182 Such modified types already made are recorded so that duplicates
4185 extern tree
build_type_attribute_variant (tree
, tree
);
4186 extern tree
build_decl_attribute_variant (tree
, tree
);
4187 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4189 /* Structure describing an attribute and a function to handle it. */
4190 struct attribute_spec
4192 /* The name of the attribute (without any leading or trailing __),
4193 or NULL to mark the end of a table of attributes. */
4194 const char *const name
;
4195 /* The minimum length of the list of arguments of the attribute. */
4196 const int min_length
;
4197 /* The maximum length of the list of arguments of the attribute
4198 (-1 for no maximum). */
4199 const int max_length
;
4200 /* Whether this attribute requires a DECL. If it does, it will be passed
4201 from types of DECLs, function return types and array element types to
4202 the DECLs, function types and array types respectively; but when
4203 applied to a type in any other circumstances, it will be ignored with
4204 a warning. (If greater control is desired for a given attribute,
4205 this should be false, and the flags argument to the handler may be
4206 used to gain greater control in that case.) */
4207 const bool decl_required
;
4208 /* Whether this attribute requires a type. If it does, it will be passed
4209 from a DECL to the type of that DECL. */
4210 const bool type_required
;
4211 /* Whether this attribute requires a function (or method) type. If it does,
4212 it will be passed from a function pointer type to the target type,
4213 and from a function return type (which is not itself a function
4214 pointer type) to the function type. */
4215 const bool function_type_required
;
4216 /* Function to handle this attribute. NODE points to the node to which
4217 the attribute is to be applied. If a DECL, it should be modified in
4218 place; if a TYPE, a copy should be created. NAME is the name of the
4219 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4220 of the arguments (which may be NULL). FLAGS gives further information
4221 about the context of the attribute. Afterwards, the attributes will
4222 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4223 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4224 as well as in any other cases when the attributes should not be added
4225 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4226 applied to another type or DECL later may be returned;
4227 otherwise the return value should be NULL_TREE. This pointer may be
4228 NULL if no special handling is required beyond the checks implied
4229 by the rest of this structure. */
4230 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4231 int flags
, bool *no_add_attrs
);
4234 /* Flags that may be passed in the third argument of decl_attributes, and
4235 to handler functions for attributes. */
4236 enum attribute_flags
4238 /* The type passed in is the type of a DECL, and any attributes that
4239 should be passed in again to be applied to the DECL rather than the
4240 type should be returned. */
4241 ATTR_FLAG_DECL_NEXT
= 1,
4242 /* The type passed in is a function return type, and any attributes that
4243 should be passed in again to be applied to the function type rather
4244 than the return type should be returned. */
4245 ATTR_FLAG_FUNCTION_NEXT
= 2,
4246 /* The type passed in is an array element type, and any attributes that
4247 should be passed in again to be applied to the array type rather
4248 than the element type should be returned. */
4249 ATTR_FLAG_ARRAY_NEXT
= 4,
4250 /* The type passed in is a structure, union or enumeration type being
4251 created, and should be modified in place. */
4252 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4253 /* The attributes are being applied by default to a library function whose
4254 name indicates known behavior, and should be silently ignored if they
4255 are not in fact compatible with the function type. */
4256 ATTR_FLAG_BUILT_IN
= 16
4259 /* Default versions of target-overridable functions. */
4261 extern tree
merge_decl_attributes (tree
, tree
);
4262 extern tree
merge_type_attributes (tree
, tree
);
4264 /* Given a tree node and a string, return nonzero if the tree node is
4265 a valid attribute name for the string. */
4267 extern int is_attribute_p (const char *, const_tree
);
4269 /* Given an attribute name and a list of attributes, return the list element
4270 of the attribute or NULL_TREE if not found. */
4272 extern tree
lookup_attribute (const char *, tree
);
4274 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4277 extern tree
remove_attribute (const char *, tree
);
4279 /* Given two attributes lists, return a list of their union. */
4281 extern tree
merge_attributes (tree
, tree
);
4283 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4284 /* Given two Windows decl attributes lists, possibly including
4285 dllimport, return a list of their union . */
4286 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4288 /* Handle a "dllimport" or "dllexport" attribute. */
4289 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4292 /* Check whether CAND is suitable to be returned from get_qualified_type
4293 (BASE, TYPE_QUALS). */
4295 extern bool check_qualified_type (const_tree
, const_tree
, int);
4297 /* Return a version of the TYPE, qualified as indicated by the
4298 TYPE_QUALS, if one exists. If no qualified version exists yet,
4299 return NULL_TREE. */
4301 extern tree
get_qualified_type (tree
, int);
4303 /* Like get_qualified_type, but creates the type if it does not
4304 exist. This function never returns NULL_TREE. */
4306 extern tree
build_qualified_type (tree
, int);
4308 /* Like build_qualified_type, but only deals with the `const' and
4309 `volatile' qualifiers. This interface is retained for backwards
4310 compatibility with the various front-ends; new code should use
4311 build_qualified_type instead. */
4313 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4314 build_qualified_type ((TYPE), \
4315 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4316 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4318 /* Make a copy of a type node. */
4320 extern tree
build_distinct_type_copy (tree
);
4321 extern tree
build_variant_type_copy (tree
);
4323 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4324 fields. Optionally specify an alignment, and then lay it out. */
4326 extern void finish_builtin_struct (tree
, const char *,
4329 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4330 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4331 node, does nothing except for the first time. */
4333 extern void layout_type (tree
);
4335 /* These functions allow a front-end to perform a manual layout of a
4336 RECORD_TYPE. (For instance, if the placement of subsequent fields
4337 depends on the placement of fields so far.) Begin by calling
4338 start_record_layout. Then, call place_field for each of the
4339 fields. Then, call finish_record_layout. See layout_type for the
4340 default way in which these functions are used. */
4342 typedef struct record_layout_info_s
4344 /* The RECORD_TYPE that we are laying out. */
4346 /* The offset into the record so far, in bytes, not including bits in
4349 /* The last known alignment of SIZE. */
4350 unsigned int offset_align
;
4351 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4353 /* The alignment of the record so far, in bits. */
4354 unsigned int record_align
;
4355 /* The alignment of the record so far, ignoring #pragma pack and
4356 __attribute__ ((packed)), in bits. */
4357 unsigned int unpacked_align
;
4358 /* The previous field layed out. */
4360 /* The static variables (i.e., class variables, as opposed to
4361 instance variables) encountered in T. */
4362 VEC(tree
,gc
) *pending_statics
;
4363 /* Bits remaining in the current alignment group */
4364 int remaining_in_alignment
;
4365 /* True if we've seen a packed field that didn't have normal
4366 alignment anyway. */
4367 int packed_maybe_necessary
;
4368 } *record_layout_info
;
4370 extern record_layout_info
start_record_layout (tree
);
4371 extern tree
bit_from_pos (tree
, tree
);
4372 extern tree
byte_from_pos (tree
, tree
);
4373 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4374 extern void normalize_offset (tree
*, tree
*, unsigned int);
4375 extern tree
rli_size_unit_so_far (record_layout_info
);
4376 extern tree
rli_size_so_far (record_layout_info
);
4377 extern void normalize_rli (record_layout_info
);
4378 extern void place_field (record_layout_info
, tree
);
4379 extern void compute_record_mode (tree
);
4380 extern void finish_record_layout (record_layout_info
, int);
4382 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4383 return a canonicalized ..._TYPE node, so that duplicates are not made.
4384 How the hash code is computed is up to the caller, as long as any two
4385 callers that could hash identical-looking type nodes agree. */
4387 extern tree
type_hash_canon (unsigned int, tree
);
4389 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4390 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4391 fields. Call this only once for any given decl node.
4393 Second argument is the boundary that this field can be assumed to
4394 be starting at (in bits). Zero means it can be assumed aligned
4395 on any boundary that may be needed. */
4397 extern void layout_decl (tree
, unsigned);
4399 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4400 a previous call to layout_decl and calls it again. */
4402 extern void relayout_decl (tree
);
4404 /* Return the mode for data of a given size SIZE and mode class CLASS.
4405 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4406 The value is BLKmode if no other mode is found. This is like
4407 mode_for_size, but is passed a tree. */
4409 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4411 /* Return an expr equal to X but certainly not valid as an lvalue. */
4413 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4414 extern tree
non_lvalue_loc (location_t
, tree
);
4416 extern tree
convert (tree
, tree
);
4417 extern unsigned int expr_align (const_tree
);
4418 extern tree
expr_first (tree
);
4419 extern tree
expr_last (tree
);
4420 extern tree
size_in_bytes (const_tree
);
4421 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4422 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4423 extern tree
tree_expr_size (const_tree
);
4424 extern tree
bit_position (const_tree
);
4425 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4426 extern tree
byte_position (const_tree
);
4427 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4429 /* Define data structures, macros, and functions for handling sizes
4430 and the various types used to represent sizes. */
4434 SIZETYPE
, /* Normal representation of sizes in bytes. */
4435 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4436 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4437 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4440 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4442 #define sizetype sizetype_tab[(int) SIZETYPE]
4443 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4444 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4445 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4447 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4448 #define size_binop(CODE,T1,T2)\
4449 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4450 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4451 #define size_diffop(T1,T2)\
4452 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4453 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4455 #define size_int(L) size_int_kind (L, SIZETYPE)
4456 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4457 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4458 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4460 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4461 extern tree
round_up_loc (location_t
, tree
, int);
4462 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4463 extern tree
round_down_loc (location_t
, tree
, int);
4464 extern VEC(tree
,gc
) *get_pending_sizes (void);
4465 extern void put_pending_size (tree
);
4466 extern void put_pending_sizes (VEC(tree
,gc
) *);
4467 extern void finalize_size_functions (void);
4469 /* Type for sizes of data-type. */
4471 #define BITS_PER_UNIT_LOG \
4472 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4473 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4474 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4476 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4477 extern unsigned int maximum_field_alignment
;
4478 /* and its original value in bytes, specified via -fpack-struct=<value>. */
4479 extern unsigned int initial_max_fld_align
;
4481 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4482 by making the last node in X point to Y.
4483 Returns X, except if X is 0 returns Y. */
4485 extern tree
chainon (tree
, tree
);
4487 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4489 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4490 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4492 /* Return the last tree node in a chain. */
4494 extern tree
tree_last (tree
);
4496 /* Reverse the order of elements in a chain, and return the new head. */
4498 extern tree
nreverse (tree
);
4500 /* Returns the length of a chain of nodes
4501 (number of chain pointers to follow before reaching a null pointer). */
4503 extern int list_length (const_tree
);
4505 /* Returns the number of FIELD_DECLs in a type. */
4507 extern int fields_length (const_tree
);
4509 /* Returns the first FIELD_DECL in a type. */
4511 extern tree
first_field (const_tree
);
4513 /* Given an initializer INIT, return TRUE if INIT is zero or some
4514 aggregate of zeros. Otherwise return FALSE. */
4516 extern bool initializer_zerop (const_tree
);
4518 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4520 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4522 /* Examine CTOR to discover:
4523 * how many scalar fields are set to nonzero values,
4524 and place it in *P_NZ_ELTS;
4525 * how many scalar fields in total are in CTOR,
4526 and place it in *P_ELT_COUNT.
4527 * if a type is a union, and the initializer from the constructor
4528 is not the largest element in the union, then set *p_must_clear.
4530 Return whether or not CTOR is a valid static constant initializer, the same
4531 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4533 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4536 extern HOST_WIDE_INT
count_type_elements (const_tree
, bool);
4538 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4540 extern int integer_zerop (const_tree
);
4542 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4544 extern int integer_onep (const_tree
);
4546 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4547 all of whose significant bits are 1. */
4549 extern int integer_all_onesp (const_tree
);
4551 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4552 exactly one bit 1. */
4554 extern int integer_pow2p (const_tree
);
4556 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4557 with a nonzero value. */
4559 extern int integer_nonzerop (const_tree
);
4561 extern bool cst_and_fits_in_hwi (const_tree
);
4562 extern tree
num_ending_zeros (const_tree
);
4564 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4567 extern int fixed_zerop (const_tree
);
4569 /* staticp (tree x) is nonzero if X is a reference to data allocated
4570 at a fixed address in memory. Returns the outermost data. */
4572 extern tree
staticp (tree
);
4574 /* save_expr (EXP) returns an expression equivalent to EXP
4575 but it can be used multiple times within context CTX
4576 and only evaluate EXP once. */
4578 extern tree
save_expr (tree
);
4580 /* Look inside EXPR and into any simple arithmetic operations. Return
4581 the innermost non-arithmetic node. */
4583 extern tree
skip_simple_arithmetic (tree
);
4585 /* Return which tree structure is used by T. */
4587 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4589 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4590 or offset that depends on a field within a record.
4592 Note that we only allow such expressions within simple arithmetic
4595 extern bool contains_placeholder_p (const_tree
);
4597 /* This macro calls the above function but short-circuits the common
4598 case of a constant to save time. Also check for null. */
4600 #define CONTAINS_PLACEHOLDER_P(EXP) \
4601 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4603 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4604 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4607 extern bool type_contains_placeholder_p (tree
);
4609 /* Given a tree EXP, find all occurences of references to fields
4610 in a PLACEHOLDER_EXPR and place them in vector REFS without
4611 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4612 we assume here that EXP contains only arithmetic expressions
4613 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4616 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
4618 /* This macro calls the above function but short-circuits the common
4619 case of a constant to save time and also checks for NULL. */
4621 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4623 if((EXP) && !TREE_CONSTANT (EXP)) \
4624 find_placeholder_in_expr (EXP, V); \
4627 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4628 return a tree with all occurrences of references to F in a
4629 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4630 CONST_DECLs. Note that we assume here that EXP contains only
4631 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4632 occurring only in their argument list. */
4634 extern tree
substitute_in_expr (tree
, tree
, tree
);
4636 /* This macro calls the above function but short-circuits the common
4637 case of a constant to save time and also checks for NULL. */
4639 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4640 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4642 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4643 for it within OBJ, a tree that is an object or a chain of references. */
4645 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4647 /* This macro calls the above function but short-circuits the common
4648 case of a constant to save time and also checks for NULL. */
4650 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4651 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4652 : substitute_placeholder_in_expr (EXP, OBJ))
4654 /* variable_size (EXP) is like save_expr (EXP) except that it
4655 is for the special case of something that is part of a
4656 variable size for a data type. It makes special arrangements
4657 to compute the value at the right time when the data type
4658 belongs to a function parameter. */
4660 extern tree
variable_size (tree
);
4662 /* stabilize_reference (EXP) returns a reference equivalent to EXP
4663 but it can be used multiple times
4664 and only evaluate the subexpressions once. */
4666 extern tree
stabilize_reference (tree
);
4668 /* Subroutine of stabilize_reference; this is called for subtrees of
4669 references. Any expression with side-effects must be put in a SAVE_EXPR
4670 to ensure that it is only evaluated once. */
4672 extern tree
stabilize_reference_1 (tree
);
4674 /* Return EXP, stripped of any conversions to wider types
4675 in such a way that the result of converting to type FOR_TYPE
4676 is the same as if EXP were converted to FOR_TYPE.
4677 If FOR_TYPE is 0, it signifies EXP's type. */
4679 extern tree
get_unwidened (tree
, tree
);
4681 /* Return OP or a simpler expression for a narrower value
4682 which can be sign-extended or zero-extended to give back OP.
4683 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4684 or 0 if the value should be sign-extended. */
4686 extern tree
get_narrower (tree
, int *);
4688 /* Return true if T is an expression that get_inner_reference handles. */
4691 handled_component_p (const_tree t
)
4693 switch (TREE_CODE (t
))
4698 case ARRAY_RANGE_REF
:
4699 case VIEW_CONVERT_EXPR
:
4709 /* Given an expression EXP that is a handled_component_p,
4710 look for the ultimate containing object, which is returned and specify
4711 the access position and size. */
4713 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
4714 tree
*, enum machine_mode
*, int *, int *,
4717 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4718 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4719 EXP is marked as PACKED. */
4721 extern bool contains_packed_reference (const_tree exp
);
4723 /* Return a tree of sizetype representing the size, in bytes, of the element
4724 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4726 extern tree
array_ref_element_size (tree
);
4728 /* Return a tree representing the lower bound of the array mentioned in
4729 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4731 extern tree
array_ref_low_bound (tree
);
4733 /* Return a tree representing the upper bound of the array mentioned in
4734 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
4736 extern tree
array_ref_up_bound (tree
);
4738 /* Return a tree representing the offset, in bytes, of the field referenced
4739 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4741 extern tree
component_ref_field_offset (tree
);
4743 /* Given a DECL or TYPE, return the scope in which it was declared, or
4744 NUL_TREE if there is no containing scope. */
4746 extern tree
get_containing_scope (const_tree
);
4748 /* Return the FUNCTION_DECL which provides this _DECL with its context,
4750 extern tree
decl_function_context (const_tree
);
4752 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4753 this _DECL with its context, or zero if none. */
4754 extern tree
decl_type_context (const_tree
);
4756 /* Return 1 if EXPR is the real constant zero. */
4757 extern int real_zerop (const_tree
);
4759 /* Declare commonly used variables for tree structure. */
4761 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4762 Zero means allow extended lvalues. */
4764 extern int pedantic_lvalues
;
4766 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
4768 extern GTY(()) tree current_function_decl
;
4770 /* Nonzero means a FUNC_BEGIN label was emitted. */
4771 extern GTY(()) const char * current_function_func_begin_label
;
4773 /* Iterator for going through the function arguments. */
4775 tree fntype
; /* function type declaration */
4776 tree next
; /* TREE_LIST pointing to the next argument */
4777 } function_args_iterator
;
4779 /* Initialize the iterator I with arguments from function FNDECL */
4782 function_args_iter_init (function_args_iterator
*i
, tree fntype
)
4785 i
->next
= TYPE_ARG_TYPES (fntype
);
4788 /* Return a pointer that holds the next argument if there are more arguments to
4789 handle, otherwise return NULL. */
4791 static inline tree
*
4792 function_args_iter_cond_ptr (function_args_iterator
*i
)
4794 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
4797 /* Return the next argument if there are more arguments to handle, otherwise
4801 function_args_iter_cond (function_args_iterator
*i
)
4803 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
4806 /* Advance to the next argument. */
4808 function_args_iter_next (function_args_iterator
*i
)
4810 gcc_assert (i
->next
!= NULL_TREE
);
4811 i
->next
= TREE_CHAIN (i
->next
);
4814 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4817 inlined_function_outer_scope_p (const_tree block
)
4819 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
4822 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4823 to point to the next tree element. ITER is an instance of
4824 function_args_iterator used to iterate the arguments. */
4825 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4826 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4827 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4828 function_args_iter_next (&(ITER)))
4830 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4831 to the next tree element. ITER is an instance of function_args_iterator
4832 used to iterate the arguments. */
4833 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4834 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4835 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4836 function_args_iter_next (&(ITER)))
4841 extern unsigned crc32_string (unsigned, const char *);
4842 extern void clean_symbol_name (char *);
4843 extern tree
get_file_function_name (const char *);
4844 extern tree
get_callee_fndecl (const_tree
);
4845 extern int type_num_arguments (const_tree
);
4846 extern bool associative_tree_code (enum tree_code
);
4847 extern bool commutative_tree_code (enum tree_code
);
4848 extern bool commutative_ternary_tree_code (enum tree_code
);
4849 extern tree
upper_bound_in_type (tree
, tree
);
4850 extern tree
lower_bound_in_type (tree
, tree
);
4851 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
4852 extern tree
call_expr_arg (tree
, int);
4853 extern tree
*call_expr_argp (tree
, int);
4854 extern tree
create_artificial_label (location_t
);
4855 extern const char *get_name (tree
);
4856 extern bool stdarg_p (tree
);
4857 extern bool prototype_p (tree
);
4858 extern bool is_typedef_decl (tree x
);
4859 extern bool typedef_variant_p (tree
);
4860 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
4861 extern tree
build_low_bits_mask (tree
, unsigned);
4862 extern tree
tree_strip_nop_conversions (tree
);
4863 extern tree
tree_strip_sign_nop_conversions (tree
);
4864 extern tree
lhd_gcc_personality (void);
4865 extern void assign_assembler_name_if_neeeded (tree
);
4869 extern void change_decl_assembler_name (tree
, tree
);
4872 extern tree
unshare_expr (tree
);
4876 extern void expand_expr_stmt (tree
);
4877 extern int warn_if_unused_value (const_tree
, location_t
);
4878 extern void expand_label (tree
);
4879 extern void expand_goto (tree
);
4881 extern rtx
expand_stack_save (void);
4882 extern void expand_stack_restore (tree
);
4883 extern void expand_return (tree
);
4886 extern void using_eh_for_cleanups (void);
4888 /* In fold-const.c */
4890 /* Non-zero if we are folding constants inside an initializer; zero
4892 extern int folding_initializer
;
4894 /* Convert between trees and native memory representation. */
4895 extern int native_encode_expr (const_tree
, unsigned char *, int);
4896 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
4898 /* Fold constants as much as possible in an expression.
4899 Returns the simplified expression.
4900 Acts only on the top level of the expression;
4901 if the argument itself cannot be simplified, its
4902 subexpressions are not changed. */
4904 extern tree
fold (tree
);
4905 #define fold_unary(CODE,T1,T2)\
4906 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4907 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
4908 #define fold_unary_ignore_overflow(CODE,T1,T2)\
4909 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4910 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
4911 #define fold_binary(CODE,T1,T2,T3)\
4912 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
4913 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4914 #define fold_ternary(CODE,T1,T2,T3,T4)\
4915 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
4916 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4917 #define fold_build1(c,t1,t2)\
4918 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
4919 #define fold_build1_loc(l,c,t1,t2)\
4920 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
4921 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
4922 tree MEM_STAT_DECL
);
4923 #define fold_build2(c,t1,t2,t3)\
4924 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
4925 #define fold_build2_loc(l,c,t1,t2,t3)\
4926 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
4927 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
4928 tree MEM_STAT_DECL
);
4929 #define fold_build3(c,t1,t2,t3,t4)\
4930 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
4931 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
4932 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
4933 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
4934 tree MEM_STAT_DECL
);
4935 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
4936 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
4937 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
4938 #define fold_build_call_array(T1,T2,N,T4)\
4939 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4940 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
4941 #define fold_build_call_array_initializer(T1,T2,N,T4)\
4942 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
4943 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
4944 extern bool fold_convertible_p (const_tree
, const_tree
);
4945 #define fold_convert(T1,T2)\
4946 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
4947 extern tree
fold_convert_loc (location_t
, tree
, tree
);
4948 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
4949 extern tree
fold_ignored_result (tree
);
4950 extern tree
fold_abs_const (tree
, tree
);
4951 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
4952 extern void fold_defer_overflow_warnings (void);
4953 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
4954 extern void fold_undefer_and_ignore_overflow_warnings (void);
4955 extern bool fold_deferring_overflow_warnings_p (void);
4957 enum operand_equal_flag
4963 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
4964 extern int multiple_of_p (tree
, const_tree
, const_tree
);
4965 #define omit_one_operand(T1,T2,T3)\
4966 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
4967 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
4968 #define omit_two_operands(T1,T2,T3,T4)\
4969 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
4970 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
4971 #define invert_truthvalue(T)\
4972 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
4973 extern tree
invert_truthvalue_loc (location_t
, tree
);
4974 extern tree
fold_truth_not_expr (location_t
, tree
);
4975 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
4976 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
4977 extern tree
fold_read_from_constant_string (tree
);
4978 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
, int);
4979 #define build_fold_addr_expr(T)\
4980 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
4981 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
4982 #define build_fold_addr_expr_with_type(T,TYPE)\
4983 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
4984 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
4985 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
4986 extern tree
fold_strip_sign_ops (tree
);
4987 #define build_fold_indirect_ref(T)\
4988 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4989 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
4990 #define fold_indirect_ref(T)\
4991 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
4992 extern tree
fold_indirect_ref_loc (location_t
, tree
);
4993 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
4994 #define build_simple_mem_ref(T)\
4995 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
4996 extern double_int
mem_ref_offset (const_tree
);
4997 extern tree
reference_alias_ptr_type (const_tree
);
4998 extern tree
constant_boolean_node (int, tree
);
4999 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5001 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5002 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5004 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5005 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5007 extern bool tree_expr_nonzero_p (tree
);
5008 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5009 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5011 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5012 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5013 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5015 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5016 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5017 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5019 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5021 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5022 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5023 enum tree_code
, tree
, tree
, tree
);
5024 extern void debug_fold_checksum (const_tree
);
5026 /* Return nonzero if CODE is a tree code that represents a truth value. */
5028 truth_value_p (enum tree_code code
)
5030 return (TREE_CODE_CLASS (code
) == tcc_comparison
5031 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5032 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5033 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5038 extern tree
fold_call_expr (location_t
, tree
, bool);
5039 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5040 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5041 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5042 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5043 enum built_in_function
);
5044 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5045 enum built_in_function
);
5046 extern tree
fold_builtin_strncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
);
5047 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5048 extern bool fold_builtin_next_arg (tree
, bool);
5049 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5050 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5051 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5052 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5053 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5054 extern tree
build_call_expr (tree
, int, ...);
5055 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5056 extern tree
c_strlen (tree
, int);
5057 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5058 extern tree
build_va_arg_indirect_ref (tree
);
5059 extern tree
build_string_literal (int, const char *);
5060 extern bool validate_arglist (const_tree
, ...);
5061 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5062 extern bool can_trust_pointer_alignment (void);
5063 extern unsigned int get_pointer_alignment (tree
, unsigned int);
5064 extern bool is_builtin_name (const char *);
5065 extern bool is_builtin_fn (tree
);
5066 extern unsigned int get_object_alignment (tree
, unsigned int);
5067 extern tree
fold_call_stmt (gimple
, bool);
5068 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5069 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5070 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5071 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5073 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5074 extern bool is_simple_builtin (tree
);
5075 extern bool is_inexpensive_builtin (tree
);
5078 extern tree
strip_float_extensions (tree
);
5081 extern int really_constant_p (const_tree
);
5082 extern bool decl_address_invariant_p (const_tree
);
5083 extern bool decl_address_ip_invariant_p (const_tree
);
5084 extern bool int_fits_type_p (const_tree
, const_tree
);
5085 #ifndef GENERATOR_FILE
5086 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5088 extern bool variably_modified_type_p (tree
, tree
);
5089 extern int tree_log2 (const_tree
);
5090 extern int tree_floor_log2 (const_tree
);
5091 extern int simple_cst_equal (const_tree
, const_tree
);
5092 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5093 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5094 const_tree
, hashval_t
);
5095 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5096 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5097 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5098 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5099 extern int type_list_equal (const_tree
, const_tree
);
5100 extern int chain_member (const_tree
, const_tree
);
5101 extern tree
type_hash_lookup (unsigned int, tree
);
5102 extern void type_hash_add (unsigned int, tree
);
5103 extern int simple_cst_list_equal (const_tree
, const_tree
);
5104 extern void dump_tree_statistics (void);
5105 extern void recompute_tree_invariant_for_addr_expr (tree
);
5106 extern bool needs_to_live_in_memory (const_tree
);
5107 extern tree
reconstruct_complex_type (tree
, tree
);
5109 extern int real_onep (const_tree
);
5110 extern int real_twop (const_tree
);
5111 extern int real_minus_onep (const_tree
);
5112 extern void init_ttree (void);
5113 extern void build_common_tree_nodes (bool);
5114 extern void build_common_tree_nodes_2 (int);
5115 extern void build_common_builtin_nodes (void);
5116 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5117 extern tree
build_range_type (tree
, tree
, tree
);
5118 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5119 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5120 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5122 extern bool fields_compatible_p (const_tree
, const_tree
);
5123 extern tree
find_compatible_field (tree
, tree
);
5125 extern tree
*tree_block (tree
);
5126 extern location_t
*block_nonartificial_location (tree
);
5127 extern location_t
tree_nonartificial_location (tree
);
5129 extern tree
block_ultimate_origin (const_tree
);
5131 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5133 /* In tree-nested.c */
5134 extern tree
build_addr (tree
, tree
);
5137 extern void expand_main_function (void);
5138 extern void expand_function_end (void);
5139 extern void expand_function_start (tree
);
5140 extern void stack_protect_prologue (void);
5141 extern void stack_protect_epilogue (void);
5142 extern void init_dummy_function_start (void);
5143 extern void expand_dummy_function_end (void);
5144 extern unsigned int init_function_for_compilation (void);
5145 extern void allocate_struct_function (tree
, bool);
5146 extern void push_struct_function (tree fndecl
);
5147 extern void init_function_start (tree
);
5148 extern bool use_register_for_decl (const_tree
);
5149 extern void generate_setjmp_warnings (void);
5150 extern void init_temp_slots (void);
5151 extern void free_temp_slots (void);
5152 extern void pop_temp_slots (void);
5153 extern void push_temp_slots (void);
5154 extern void preserve_temp_slots (rtx
);
5155 extern int aggregate_value_p (const_tree
, const_tree
);
5156 extern void push_function_context (void);
5157 extern void pop_function_context (void);
5158 extern gimple_seq
gimplify_parameters (void);
5160 /* In print-rtl.c */
5162 extern void print_rtl (FILE *, const_rtx
);
5165 /* In print-tree.c */
5166 extern void debug_tree (tree
);
5167 extern void debug_vec_tree (VEC(tree
,gc
) *);
5169 extern void dump_addr (FILE*, const char *, const void *);
5170 extern void print_node (FILE *, const char *, tree
, int);
5171 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5172 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5173 extern void indent_to (FILE *, int);
5176 /* In tree-inline.c: */
5177 extern bool debug_find_tree (tree
, tree
);
5178 /* This is in tree-inline.c since the routine uses
5179 data structures from the inliner. */
5180 extern tree
unsave_expr_now (tree
);
5181 extern tree
build_duplicate_type (tree
);
5185 /* Nonzero if this is a call to a function whose return value depends
5186 solely on its arguments, has no side effects, and does not read
5187 global memory. This corresponds to TREE_READONLY for function
5189 #define ECF_CONST (1 << 0)
5190 /* Nonzero if this is a call to "pure" function (like const function,
5191 but may read memory. This corresponds to DECL_PURE_P for function
5193 #define ECF_PURE (1 << 1)
5194 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5195 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5196 for function decls.*/
5197 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5198 /* Nonzero if this call will never return. */
5199 #define ECF_NORETURN (1 << 3)
5200 /* Nonzero if this is a call to malloc or a related function. */
5201 #define ECF_MALLOC (1 << 4)
5202 /* Nonzero if it is plausible that this is a call to alloca. */
5203 #define ECF_MAY_BE_ALLOCA (1 << 5)
5204 /* Nonzero if this is a call to a function that won't throw an exception. */
5205 #define ECF_NOTHROW (1 << 6)
5206 /* Nonzero if this is a call to setjmp or a related function. */
5207 #define ECF_RETURNS_TWICE (1 << 7)
5208 /* Nonzero if this call replaces the current stack frame. */
5209 #define ECF_SIBCALL (1 << 8)
5210 /* Function does not read or write memory (but may have side effects, so
5211 it does not necessarily fit ECF_CONST). */
5212 #define ECF_NOVOPS (1 << 9)
5214 extern int flags_from_decl_or_type (const_tree
);
5215 extern int call_expr_flags (const_tree
);
5217 /* Call argument flags. */
5219 /* Nonzero if the argument is not dereferenced recursively, thus only
5220 directly reachable memory is read or written. */
5221 #define EAF_DIRECT (1 << 0)
5222 /* Nonzero if memory reached by the argument is not clobbered. */
5223 #define EAF_NOCLOBBER (1 << 1)
5224 /* Nonzero if the argument does not escape. */
5225 #define EAF_NOESCAPE (1 << 2)
5226 /* Nonzero if the argument is not used by the function. */
5227 #define EAF_UNUSED (1 << 3)
5229 /* Call return flags. */
5231 /* Mask for the argument number that is returned. Lower two bits of
5232 the return flags, encodes argument slots zero to three. */
5233 #define ERF_RETURN_ARG_MASK (3)
5234 /* Nonzero if the return value is equal to the argument number
5235 flags & ERF_RETURN_ARG_MASK. */
5236 #define ERF_RETURNS_ARG (1 << 2)
5237 /* Nonzero if the return value does not alias with anything. Functions
5238 with the malloc attribute have this set on their return value. */
5239 #define ERF_NOALIAS (1 << 3)
5241 extern int setjmp_call_p (const_tree
);
5242 extern bool gimple_alloca_call_p (const_gimple
);
5243 extern bool alloca_call_p (const_tree
);
5244 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
5245 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5249 extern const struct attribute_spec
*lookup_attribute_spec (tree
);
5251 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5252 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5253 it should be modified in place; if a TYPE, a copy should be created
5254 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5255 information, in the form of a bitwise OR of flags in enum attribute_flags
5256 from tree.h. Depending on these flags, some attributes may be
5257 returned to be applied at a later stage (for example, to apply
5258 a decl attribute to the declaration rather than to its type). */
5259 extern tree
decl_attributes (tree
*, tree
, int);
5261 /* In integrate.c */
5262 extern void set_decl_abstract_flags (tree
, int);
5263 extern void set_decl_origin_self (tree
);
5265 /* In stor-layout.c */
5266 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5267 extern void fixup_signed_type (tree
);
5268 extern void internal_reference_types (void);
5269 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5272 extern tree
tree_output_constant_def (tree
);
5273 extern void make_decl_rtl (tree
);
5274 extern rtx
make_decl_rtl_for_debug (tree
);
5275 extern void make_decl_one_only (tree
, tree
);
5276 extern int supports_one_only (void);
5277 extern void resolve_unique_section (tree
, int, int);
5278 extern void mark_referenced (tree
);
5279 extern void mark_decl_referenced (tree
);
5280 extern void notice_global_symbol (tree
);
5281 extern void set_user_assembler_name (tree
, const char *);
5282 extern void process_pending_assemble_externals (void);
5283 extern void finish_aliases_1 (void);
5284 extern void finish_aliases_2 (void);
5285 extern void remove_unreachable_alias_pairs (void);
5288 extern void expand_computed_goto (tree
);
5289 extern bool parse_output_constraint (const char **, int, int, int,
5290 bool *, bool *, bool *);
5291 extern bool parse_input_constraint (const char **, int, int, int, int,
5292 const char * const *, bool *, bool *);
5293 extern void expand_asm_stmt (gimple
);
5294 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
5295 extern void expand_case (gimple
);
5296 extern void expand_decl (tree
);
5298 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5299 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5303 /* In dwarf2out.c */
5304 /* Interface of the DWARF2 unwind info support. */
5306 /* Generate a new label for the CFI info to refer to. */
5308 extern char *dwarf2out_cfi_label (bool);
5310 /* Entry point to update the canonical frame address (CFA). */
5312 extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT
);
5314 /* Add the CFI for saving a register window. */
5316 extern void dwarf2out_window_save (const char *);
5318 /* Entry point for saving a register to the stack. */
5320 extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT
);
5322 /* Entry point for saving the return address in the stack. */
5324 extern void dwarf2out_return_save (const char *, HOST_WIDE_INT
);
5326 /* Entry point for saving the return address in a register. */
5328 extern void dwarf2out_return_reg (const char *, unsigned);
5330 /* Entry point for saving the first register into the second. */
5332 extern void dwarf2out_reg_save_reg (const char *, rtx
, rtx
);
5334 /* In tree-inline.c */
5336 /* The type of a set of already-visited pointers. Functions for creating
5337 and manipulating it are declared in pointer-set.h */
5338 struct pointer_set_t
;
5340 /* The type of a callback function for walking over tree structure. */
5342 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5344 /* The type of a callback function that represents a custom walk_tree. */
5346 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5347 void *, struct pointer_set_t
*);
5349 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5351 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5353 #define walk_tree(a,b,c,d) \
5354 walk_tree_1 (a, b, c, d, NULL)
5355 #define walk_tree_without_duplicates(a,b,c) \
5356 walk_tree_without_duplicates_1 (a, b, c, NULL)
5359 /* Assign the RTX to declaration. */
5361 extern void set_decl_rtl (tree
, rtx
);
5362 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5364 /* Enum and arrays used for tree allocation stats.
5365 Keep in sync with tree.c:tree_node_kind_names. */
5387 extern int tree_node_counts
[];
5388 extern int tree_node_sizes
[];
5390 /* True if we are in gimple form and the actions of the folders need to
5391 be restricted. False if we are not in gimple form and folding is not
5392 restricted to creating gimple expressions. */
5393 extern bool in_gimple_form
;
5396 extern tree
get_base_address (tree t
);
5397 extern void mark_addressable (tree
);
5399 /* In tree-vectorizer.c. */
5400 extern void vect_set_verbosity_level (const char *);
5404 struct GTY(()) tree_map_base
{
5408 extern int tree_map_base_eq (const void *, const void *);
5409 extern unsigned int tree_map_base_hash (const void *);
5410 extern int tree_map_base_marked_p (const void *);
5411 extern bool list_equal_p (const_tree
, const_tree
);
5413 /* Map from a tree to another tree. */
5415 struct GTY(()) tree_map
{
5416 struct tree_map_base base
;
5421 #define tree_map_eq tree_map_base_eq
5422 extern unsigned int tree_map_hash (const void *);
5423 #define tree_map_marked_p tree_map_base_marked_p
5425 /* Map from a decl tree to another tree. */
5427 struct GTY(()) tree_decl_map
{
5428 struct tree_map_base base
;
5432 #define tree_decl_map_eq tree_map_base_eq
5433 extern unsigned int tree_decl_map_hash (const void *);
5434 #define tree_decl_map_marked_p tree_map_base_marked_p
5436 /* Map from a tree to an int. */
5438 struct GTY(()) tree_int_map
{
5439 struct tree_map_base base
;
5443 #define tree_int_map_eq tree_map_base_eq
5444 #define tree_int_map_hash tree_map_base_hash
5445 #define tree_int_map_marked_p tree_map_base_marked_p
5447 /* Map from a tree to initialization/finalization priorities. */
5449 struct GTY(()) tree_priority_map
{
5450 struct tree_map_base base
;
5455 #define tree_priority_map_eq tree_map_base_eq
5456 #define tree_priority_map_hash tree_map_base_hash
5457 #define tree_priority_map_marked_p tree_map_base_marked_p
5461 tree
target_for_debug_bind (tree
);
5463 /* In tree-ssa-address.c. */
5464 extern tree
tree_mem_ref_addr (tree
, tree
);
5465 extern void copy_mem_ref_info (tree
, tree
);
5468 extern bool ssa_name_nonnegative_p (const_tree
);
5470 /* In tree-object-size.c. */
5471 extern void init_object_sizes (void);
5472 extern void fini_object_sizes (void);
5473 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5476 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5477 extern tree
build_personality_function (const char *);
5479 /* In tree-inline.c. */
5481 void init_inline_once (void);
5483 /* Compute the number of operands in an expression node NODE. For
5484 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5485 otherwise it is looked up from the node's code. */
5487 tree_operand_length (const_tree node
)
5489 if (VL_EXP_CLASS_P (node
))
5490 return VL_EXP_OPERAND_LENGTH (node
);
5492 return TREE_CODE_LENGTH (TREE_CODE (node
));
5495 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5496 have to go towards the end of tree.h so that union tree_node is fully
5497 defined by this point. */
5499 /* Structure containing iterator state. */
5500 typedef struct GTY (()) call_expr_arg_iterator_d
{
5501 tree t
; /* the call_expr */
5502 int n
; /* argument count */
5503 int i
; /* next argument index */
5504 } call_expr_arg_iterator
;
5506 typedef struct GTY (()) const_call_expr_arg_iterator_d
{
5507 const_tree t
; /* the call_expr */
5508 int n
; /* argument count */
5509 int i
; /* next argument index */
5510 } const_call_expr_arg_iterator
;
5512 /* Initialize the abstract argument list iterator object ITER with the
5513 arguments from CALL_EXPR node EXP. */
5515 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5518 iter
->n
= call_expr_nargs (exp
);
5523 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5526 iter
->n
= call_expr_nargs (exp
);
5530 /* Return the next argument from abstract argument list iterator object ITER,
5531 and advance its state. Return NULL_TREE if there are no more arguments. */
5533 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5536 if (iter
->i
>= iter
->n
)
5538 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5543 static inline const_tree
5544 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5547 if (iter
->i
>= iter
->n
)
5549 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5554 /* Initialize the abstract argument list iterator object ITER, then advance
5555 past and return the first argument. Useful in for expressions, e.g.
5556 for (arg = first_call_expr_arg (exp, &iter); arg;
5557 arg = next_call_expr_arg (&iter)) */
5559 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5561 init_call_expr_arg_iterator (exp
, iter
);
5562 return next_call_expr_arg (iter
);
5565 static inline const_tree
5566 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5568 init_const_call_expr_arg_iterator (exp
, iter
);
5569 return next_const_call_expr_arg (iter
);
5572 /* Test whether there are more arguments in abstract argument list iterator
5573 ITER, without changing its state. */
5575 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5577 return (iter
->i
< iter
->n
);
5581 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
5583 return (iter
->i
< iter
->n
);
5586 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5587 (of type call_expr_arg_iterator) to hold the iteration state. */
5588 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5589 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5590 (arg) = next_call_expr_arg (&(iter)))
5592 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5593 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5594 (arg) = next_const_call_expr_arg (&(iter)))
5596 /* Return true if tree node T is a language-specific node. */
5598 is_lang_specific (tree t
)
5600 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
5603 /* In gimple-low.c. */
5604 extern bool block_may_fallthru (const_tree
);
5606 #endif /* GCC_TREE_H */