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, 2011
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
28 #include "statistics.h"
31 #include "double-int.h"
33 #include "fixed-value.h"
37 /* Codes of tree nodes */
39 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
40 #define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
43 #include "all-tree.def"
48 #undef END_OF_BASE_TREE_CODES
50 extern unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
51 #define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
53 /* Macros for initializing `tree_contains_struct'. */
54 #define MARK_TS_BASE(C) \
56 tree_contains_struct[C][TS_BASE] = 1; \
59 #define MARK_TS_TYPED(C) \
62 tree_contains_struct[C][TS_TYPED] = 1; \
65 #define MARK_TS_COMMON(C) \
68 tree_contains_struct[C][TS_COMMON] = 1; \
71 #define MARK_TS_TYPE_COMMON(C) \
74 tree_contains_struct[C][TS_TYPE_COMMON] = 1; \
77 #define MARK_TS_TYPE_WITH_LANG_SPECIFIC(C) \
79 MARK_TS_TYPE_COMMON (C); \
80 tree_contains_struct[C][TS_TYPE_WITH_LANG_SPECIFIC] = 1; \
83 #define MARK_TS_DECL_MINIMAL(C) \
86 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
89 #define MARK_TS_DECL_COMMON(C) \
91 MARK_TS_DECL_MINIMAL (C); \
92 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
95 #define MARK_TS_DECL_WRTL(C) \
97 MARK_TS_DECL_COMMON (C); \
98 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
101 #define MARK_TS_DECL_WITH_VIS(C) \
103 MARK_TS_DECL_WRTL (C); \
104 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
107 #define MARK_TS_DECL_NON_COMMON(C) \
109 MARK_TS_DECL_WITH_VIS (C); \
110 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
113 /* Number of language-independent tree codes. */
114 #define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
116 /* Tree code classes. */
118 /* Each tree_code has an associated code class represented by a
121 enum tree_code_class
{
122 tcc_exceptional
, /* An exceptional code (fits no category). */
123 tcc_constant
, /* A constant. */
124 /* Order of tcc_type and tcc_declaration is important. */
125 tcc_type
, /* A type object code. */
126 tcc_declaration
, /* A declaration (also serving as variable refs). */
127 tcc_reference
, /* A reference to storage. */
128 tcc_comparison
, /* A comparison expression. */
129 tcc_unary
, /* A unary arithmetic expression. */
130 tcc_binary
, /* A binary arithmetic expression. */
131 tcc_statement
, /* A statement expression, which have side effects
132 but usually no interesting value. */
133 tcc_vl_exp
, /* A function call or other expression with a
134 variable-length operand vector. */
135 tcc_expression
/* Any other expression. */
138 /* Each tree code class has an associated string representation.
139 These must correspond to the tree_code_class entries. */
141 extern const char *const tree_code_class_strings
[];
143 /* Returns the string representing CLASS. */
145 #define TREE_CODE_CLASS_STRING(CLASS)\
146 tree_code_class_strings[(int) (CLASS)]
148 extern const enum tree_code_class tree_code_type
[];
149 #define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
151 /* Nonzero if CODE represents an exceptional code. */
153 #define EXCEPTIONAL_CLASS_P(CODE)\
154 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
156 /* Nonzero if CODE represents a constant. */
158 #define CONSTANT_CLASS_P(CODE)\
159 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
161 /* Nonzero if CODE represents a type. */
163 #define TYPE_P(CODE)\
164 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
166 /* Nonzero if CODE represents a declaration. */
168 #define DECL_P(CODE)\
169 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
171 /* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
173 #define VAR_OR_FUNCTION_DECL_P(DECL)\
174 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
176 /* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
177 ascending code order. */
179 #define INDIRECT_REF_P(CODE)\
180 (TREE_CODE (CODE) == INDIRECT_REF)
182 /* Nonzero if CODE represents a reference. */
184 #define REFERENCE_CLASS_P(CODE)\
185 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
187 /* Nonzero if CODE represents a comparison. */
189 #define COMPARISON_CLASS_P(CODE)\
190 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
192 /* Nonzero if CODE represents a unary arithmetic expression. */
194 #define UNARY_CLASS_P(CODE)\
195 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
197 /* Nonzero if CODE represents a binary arithmetic expression. */
199 #define BINARY_CLASS_P(CODE)\
200 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
202 /* Nonzero if CODE represents a statement expression. */
204 #define STATEMENT_CLASS_P(CODE)\
205 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
207 /* Nonzero if CODE represents a function call-like expression with a
208 variable-length operand vector. */
210 #define VL_EXP_CLASS_P(CODE)\
211 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
213 /* Nonzero if CODE represents any other expression. */
215 #define EXPRESSION_CLASS_P(CODE)\
216 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
218 /* Returns nonzero iff CODE represents a type or declaration. */
220 #define IS_TYPE_OR_DECL_P(CODE)\
221 (TYPE_P (CODE) || DECL_P (CODE))
223 /* Returns nonzero iff CLASS is the tree-code class of an
226 #define IS_EXPR_CODE_CLASS(CLASS)\
227 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
229 /* Returns nonzero iff NODE is an expression of some kind. */
231 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
233 /* Number of argument-words in each kind of tree-node. */
235 extern const unsigned char tree_code_length
[];
236 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
238 /* Names of tree components. */
240 extern const char *const tree_code_name
[];
242 /* We have to be able to tell cgraph about the needed-ness of the target
243 of an alias. This requires that the decl have been defined. Aliases
244 that precede their definition have to be queued for later processing. */
246 /* The deferred processing proceeds in several passes. We memorize the
247 diagnostics emitted for a pair to prevent repeating messages when the
248 queue gets re-scanned after possible updates. */
251 ALIAS_DIAG_NONE
= 0x0,
252 ALIAS_DIAG_TO_UNDEF
= 0x1,
253 ALIAS_DIAG_TO_EXTERN
= 0x2
256 typedef struct GTY(()) alias_pair
260 int emitted_diags
; /* alias_diags already emitted for this pair. */
263 /* Define gc'd vector type. */
264 DEF_VEC_O(alias_pair
);
265 DEF_VEC_ALLOC_O(alias_pair
,gc
);
267 extern GTY(()) VEC(alias_pair
,gc
) * alias_pairs
;
270 /* Classify which part of the compiler has defined a given builtin function.
271 Note that we assume below that this is no more than two bits. */
280 /* Last marker used for LTO stremaing of built_in_class. We can not add it
281 to the enum since we need the enumb to fit in 2 bits. */
282 #define BUILT_IN_LAST (BUILT_IN_NORMAL + 1)
284 /* Names for the above. */
285 extern const char *const built_in_class_names
[4];
287 /* Codes that identify the various built in functions
288 so that expand_call can identify them quickly. */
290 #define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
291 enum built_in_function
293 #include "builtins.def"
295 /* Complex division routines in libgcc. These are done via builtins
296 because emit_library_call_value can't handle complex values. */
297 BUILT_IN_COMPLEX_MUL_MIN
,
298 BUILT_IN_COMPLEX_MUL_MAX
299 = BUILT_IN_COMPLEX_MUL_MIN
300 + MAX_MODE_COMPLEX_FLOAT
301 - MIN_MODE_COMPLEX_FLOAT
,
303 BUILT_IN_COMPLEX_DIV_MIN
,
304 BUILT_IN_COMPLEX_DIV_MAX
305 = BUILT_IN_COMPLEX_DIV_MIN
306 + MAX_MODE_COMPLEX_FLOAT
307 - MIN_MODE_COMPLEX_FLOAT
,
309 /* Upper bound on non-language-specific builtins. */
314 /* Names for the above. */
315 extern const char * built_in_names
[(int) END_BUILTINS
];
317 /* Helper macros for math builtins. */
319 #define BUILTIN_EXP10_P(FN) \
320 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
321 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
323 #define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
324 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
325 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
327 #define BUILTIN_SQRT_P(FN) \
328 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
330 #define BUILTIN_CBRT_P(FN) \
331 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
333 #define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
335 #define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
336 #define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
337 #define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
339 /* In an OMP_CLAUSE node. */
341 /* Number of operands and names for each clause. */
342 extern unsigned const char omp_clause_num_ops
[];
343 extern const char * const omp_clause_code_name
[];
345 /* Clause codes. Do not reorder, as this is used to index into the tables
346 omp_clause_num_ops and omp_clause_code_name. */
349 /* Clause zero is special-cased inside the parser
350 (c_parser_omp_variable_list). */
351 OMP_CLAUSE_ERROR
= 0,
353 /* OpenMP clause: private (variable_list). */
356 /* OpenMP clause: shared (variable_list). */
359 /* OpenMP clause: firstprivate (variable_list). */
360 OMP_CLAUSE_FIRSTPRIVATE
,
362 /* OpenMP clause: lastprivate (variable_list). */
363 OMP_CLAUSE_LASTPRIVATE
,
365 /* OpenMP clause: reduction (operator:variable_list).
366 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
367 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
368 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
370 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
371 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
372 OMP_CLAUSE_REDUCTION
,
374 /* OpenMP clause: copyin (variable_list). */
377 /* OpenMP clause: copyprivate (variable_list). */
378 OMP_CLAUSE_COPYPRIVATE
,
380 /* OpenMP clause: if (scalar-expression). */
383 /* OpenMP clause: num_threads (integer-expression). */
384 OMP_CLAUSE_NUM_THREADS
,
386 /* OpenMP clause: schedule. */
389 /* OpenMP clause: nowait. */
392 /* OpenMP clause: ordered. */
395 /* OpenMP clause: default. */
398 /* OpenMP clause: collapse (constant-integer-expression). */
401 /* OpenMP clause: untied. */
404 /* OpenMP clause: final (scalar-expression). */
407 /* OpenMP clause: mergeable. */
411 /* The definition of tree nodes fills the next several pages. */
413 /* A tree node can represent a data type, a variable, an expression
414 or a statement. Each node has a TREE_CODE which says what kind of
415 thing it represents. Some common codes are:
416 INTEGER_TYPE -- represents a type of integers.
417 ARRAY_TYPE -- represents a type of pointer.
418 VAR_DECL -- represents a declared variable.
419 INTEGER_CST -- represents a constant integer value.
420 PLUS_EXPR -- represents a sum (an expression).
422 As for the contents of a tree node: there are some fields
423 that all nodes share. Each TREE_CODE has various special-purpose
424 fields as well. The fields of a node are never accessed directly,
425 always through accessor macros. */
427 /* Every kind of tree node starts with this structure,
428 so all nodes have these fields.
430 See the accessor macros, defined below, for documentation of the
433 struct GTY(()) tree_base
{
434 ENUM_BITFIELD(tree_code
) code
: 16;
436 unsigned side_effects_flag
: 1;
437 unsigned constant_flag
: 1;
438 unsigned addressable_flag
: 1;
439 unsigned volatile_flag
: 1;
440 unsigned readonly_flag
: 1;
441 unsigned unsigned_flag
: 1;
442 unsigned asm_written_flag
: 1;
443 unsigned nowarning_flag
: 1;
445 unsigned used_flag
: 1;
446 unsigned nothrow_flag
: 1;
447 unsigned static_flag
: 1;
448 unsigned public_flag
: 1;
449 unsigned private_flag
: 1;
450 unsigned protected_flag
: 1;
451 unsigned deprecated_flag
: 1;
452 unsigned saturating_flag
: 1;
454 unsigned default_def_flag
: 1;
455 unsigned lang_flag_0
: 1;
456 unsigned lang_flag_1
: 1;
457 unsigned lang_flag_2
: 1;
458 unsigned lang_flag_3
: 1;
459 unsigned lang_flag_4
: 1;
460 unsigned lang_flag_5
: 1;
461 unsigned lang_flag_6
: 1;
463 unsigned visited
: 1;
464 unsigned packed_flag
: 1;
465 unsigned user_align
: 1;
466 unsigned nameless_flag
: 1;
470 /* This field is only used with type nodes; the only reason it is present
471 in tree_base instead of tree_type is to save space. The size of the
472 field must be large enough to hold addr_space_t values. */
473 unsigned address_space
: 8;
476 struct GTY(()) tree_typed
{
477 struct tree_base base
;
481 struct GTY(()) tree_common
{
482 struct tree_typed typed
;
486 /* The following table lists the uses of each of the above flags and
487 for which types of nodes they are defined.
492 VAR_DECL, PARM_DECL, RESULT_DECL, FUNCTION_DECL, LABEL_DECL
494 CONSTRUCTOR, IDENTIFIER_NODE
495 STMT_EXPR, it means we want the result of the enclosed expression
497 CALL_EXPR_TAILCALL in
506 VAR_DECL, FUNCTION_DECL
509 TREE_NO_TRAMPOLINE in
515 TREE_SYMBOL_REFERENCED in
519 TARGET_EXPR, WITH_CLEANUP_EXPR
521 TRY_CATCH_IS_CLEANUP in
527 TYPE_REF_CAN_ALIAS_ALL in
528 POINTER_TYPE, REFERENCE_TYPE
536 CALL_CANNOT_INLINE_P in
542 TRANSACTION_EXPR_OUTER in
548 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
551 VAR_DECL, FUNCTION_DECL
557 CALL_EXPR_VA_ARG_PACK in
560 TYPE_CACHED_VALUES_P in
563 SAVE_EXPR_RESOLVED_P in
566 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
567 OMP_CLAUSE_LASTPRIVATE
569 OMP_CLAUSE_PRIVATE_DEBUG in
572 TRANSACTION_EXPR_RELAXED in
580 CALL_EXPR_RETURN_SLOT_OPT in
586 OMP_PARALLEL_COMBINED in
588 OMP_CLAUSE_PRIVATE_OUTER_REF in
591 TYPE_REF_IS_RVALUE in
600 CALL_FROM_THUNK_P and
601 CALL_ALLOCA_FOR_VAR_P in
616 TREE_THIS_VOLATILE in
639 TYPE_SIZES_GIMPLIFIED in
650 REGISTER_DEFS_IN_THIS_STMT in
651 all expressions (tree-into-ssa.c)
656 VAR_DECL, FUNCTION_DECL
657 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
658 BLOCK, SSA_NAME, STRING_CST
661 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
680 INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, ARRAY_RANGE_REF
688 IDENTIFIER_TRANSPARENT_ALIAS in
691 STMT_IN_SSA_EDGE_WORKLIST in
692 all expressions (tree-ssa-propagate.c)
697 all trees (used liberally by many passes)
715 TYPE_VECTOR_OPAQUE in
718 SSA_NAME_IS_DEFAULT_DEF in
723 #define DEFTREESTRUCT(ENUM, NAME) ENUM,
724 enum tree_node_structure_enum
{
725 #include "treestruct.def"
730 /* Define accessors for the fields that all tree nodes have
731 (though some fields are not used for all kinds of nodes). */
733 /* The tree-code says what kind of node it is.
734 Codes are defined in tree.def. */
735 #define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
736 #define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
738 /* When checking is enabled, errors will be generated if a tree node
739 is accessed incorrectly. The macros die with a fatal error. */
740 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
742 #define TREE_CHECK(T, CODE) __extension__ \
743 ({ __typeof (T) const __t = (T); \
744 if (TREE_CODE (__t) != (CODE)) \
745 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
749 #define TREE_NOT_CHECK(T, CODE) __extension__ \
750 ({ __typeof (T) const __t = (T); \
751 if (TREE_CODE (__t) == (CODE)) \
752 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
756 #define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
757 ({ __typeof (T) const __t = (T); \
758 if (TREE_CODE (__t) != (CODE1) \
759 && TREE_CODE (__t) != (CODE2)) \
760 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
761 (CODE1), (CODE2), 0); \
764 #define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
765 ({ __typeof (T) const __t = (T); \
766 if (TREE_CODE (__t) == (CODE1) \
767 || TREE_CODE (__t) == (CODE2)) \
768 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
769 (CODE1), (CODE2), 0); \
772 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
773 ({ __typeof (T) const __t = (T); \
774 if (TREE_CODE (__t) != (CODE1) \
775 && TREE_CODE (__t) != (CODE2) \
776 && TREE_CODE (__t) != (CODE3)) \
777 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
778 (CODE1), (CODE2), (CODE3), 0); \
781 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
782 ({ __typeof (T) const __t = (T); \
783 if (TREE_CODE (__t) == (CODE1) \
784 || TREE_CODE (__t) == (CODE2) \
785 || TREE_CODE (__t) == (CODE3)) \
786 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
787 (CODE1), (CODE2), (CODE3), 0); \
790 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
791 ({ __typeof (T) const __t = (T); \
792 if (TREE_CODE (__t) != (CODE1) \
793 && TREE_CODE (__t) != (CODE2) \
794 && TREE_CODE (__t) != (CODE3) \
795 && TREE_CODE (__t) != (CODE4)) \
796 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
797 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
800 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
801 ({ __typeof (T) const __t = (T); \
802 if (TREE_CODE (__t) == (CODE1) \
803 || TREE_CODE (__t) == (CODE2) \
804 || TREE_CODE (__t) == (CODE3) \
805 || TREE_CODE (__t) == (CODE4)) \
806 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
807 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
810 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
811 ({ __typeof (T) const __t = (T); \
812 if (TREE_CODE (__t) != (CODE1) \
813 && TREE_CODE (__t) != (CODE2) \
814 && TREE_CODE (__t) != (CODE3) \
815 && TREE_CODE (__t) != (CODE4) \
816 && TREE_CODE (__t) != (CODE5)) \
817 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
818 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
821 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
822 ({ __typeof (T) const __t = (T); \
823 if (TREE_CODE (__t) == (CODE1) \
824 || TREE_CODE (__t) == (CODE2) \
825 || TREE_CODE (__t) == (CODE3) \
826 || TREE_CODE (__t) == (CODE4) \
827 || TREE_CODE (__t) == (CODE5)) \
828 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
829 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
832 #define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
833 ({ __typeof (T) const __t = (T); \
834 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
835 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
839 #define TREE_CLASS_CHECK(T, CLASS) __extension__ \
840 ({ __typeof (T) const __t = (T); \
841 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
842 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
846 #define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
847 ({ __typeof (T) const __t = (T); \
848 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
849 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
853 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
854 ({ __typeof (T) const __t = (T); \
855 if (TREE_CODE (__t) != OMP_CLAUSE) \
856 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
858 if (__t->omp_clause.code != (CODE)) \
859 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
863 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
864 ({ __typeof (T) const __t = (T); \
865 if (TREE_CODE (__t) != OMP_CLAUSE) \
866 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
868 if ((int) __t->omp_clause.code < (int) (CODE1) \
869 || (int) __t->omp_clause.code > (int) (CODE2)) \
870 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
871 __FUNCTION__, (CODE1), (CODE2)); \
874 /* These checks have to be special cased. */
875 #define EXPR_CHECK(T) __extension__ \
876 ({ __typeof (T) const __t = (T); \
877 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
878 if (!IS_EXPR_CODE_CLASS (__c)) \
879 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
883 /* These checks have to be special cased. */
884 #define NON_TYPE_CHECK(T) __extension__ \
885 ({ __typeof (T) const __t = (T); \
887 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
891 #define TREE_VEC_ELT_CHECK(T, I) __extension__ \
892 (*({__typeof (T) const __t = (T); \
893 const int __i = (I); \
894 if (TREE_CODE (__t) != TREE_VEC) \
895 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
897 if (__i < 0 || __i >= __t->vec.length) \
898 tree_vec_elt_check_failed (__i, __t->vec.length, \
899 __FILE__, __LINE__, __FUNCTION__); \
900 &__t->vec.a[__i]; }))
902 #define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
903 (*({__typeof (T) const __t = (T); \
904 const int __i = (I); \
905 if (TREE_CODE (__t) != OMP_CLAUSE) \
906 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
908 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
909 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
911 &__t->omp_clause.ops[__i]; }))
913 /* Special checks for TREE_OPERANDs. */
914 #define TREE_OPERAND_CHECK(T, I) __extension__ \
915 (*({__typeof (T) const __t = EXPR_CHECK (T); \
916 const int __i = (I); \
917 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
918 tree_operand_check_failed (__i, __t, \
919 __FILE__, __LINE__, __FUNCTION__); \
920 &__t->exp.operands[__i]; }))
922 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
923 (*({__typeof (T) const __t = (T); \
924 const int __i = (I); \
925 if (TREE_CODE (__t) != CODE) \
926 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
927 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
928 tree_operand_check_failed (__i, __t, \
929 __FILE__, __LINE__, __FUNCTION__); \
930 &__t->exp.operands[__i]; }))
932 /* Nodes are chained together for many purposes.
933 Types are chained together to record them for being output to the debugger
934 (see the function `chain_type').
935 Decls in the same scope are chained together to record the contents
937 Statement nodes for successive statements used to be chained together.
938 Often lists of things are represented by TREE_LIST nodes that
939 are chained together. */
941 #define TREE_CHAIN(NODE) __extension__ \
942 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_COMMON);\
943 &__t->common.chain; }))
945 /* In all nodes that are expressions, this is the data type of the expression.
946 In POINTER_TYPE nodes, this is the type that the pointer points to.
947 In ARRAY_TYPE nodes, this is the type of the elements.
948 In VECTOR_TYPE nodes, this is the type of the elements. */
949 #define TREE_TYPE(NODE) __extension__ \
950 (*({__typeof (NODE) const __t = CONTAINS_STRUCT_CHECK (NODE, TS_TYPED); \
951 &__t->typed.type; }))
953 extern void tree_contains_struct_check_failed (const_tree
,
954 const enum tree_node_structure_enum
,
955 const char *, int, const char *)
958 extern void tree_check_failed (const_tree
, const char *, int, const char *,
959 ...) ATTRIBUTE_NORETURN
;
960 extern void tree_not_check_failed (const_tree
, const char *, int, const char *,
961 ...) ATTRIBUTE_NORETURN
;
962 extern void tree_class_check_failed (const_tree
, const enum tree_code_class
,
963 const char *, int, const char *)
965 extern void tree_range_check_failed (const_tree
, const char *, int,
966 const char *, enum tree_code
,
969 extern void tree_not_class_check_failed (const_tree
,
970 const enum tree_code_class
,
971 const char *, int, const char *)
973 extern void tree_vec_elt_check_failed (int, int, const char *,
976 extern void phi_node_elt_check_failed (int, int, const char *,
979 extern void tree_operand_check_failed (int, const_tree
,
980 const char *, int, const char *)
982 extern void omp_clause_check_failed (const_tree
, const char *, int,
983 const char *, enum omp_clause_code
)
985 extern void omp_clause_operand_check_failed (int, const_tree
, const char *,
988 extern void omp_clause_range_check_failed (const_tree
, const char *, int,
989 const char *, enum omp_clause_code
,
990 enum omp_clause_code
)
993 #else /* not ENABLE_TREE_CHECKING, or not gcc */
995 #define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
996 #define TREE_CHECK(T, CODE) (T)
997 #define TREE_NOT_CHECK(T, CODE) (T)
998 #define TREE_CHECK2(T, CODE1, CODE2) (T)
999 #define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
1000 #define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
1001 #define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
1002 #define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
1003 #define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
1004 #define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
1005 #define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
1006 #define TREE_CLASS_CHECK(T, CODE) (T)
1007 #define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
1008 #define EXPR_CHECK(T) (T)
1009 #define NON_TYPE_CHECK(T) (T)
1010 #define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
1011 #define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
1012 #define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
1013 #define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
1014 #define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
1015 #define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
1017 #define TREE_CHAIN(NODE) ((NODE)->common.chain)
1018 #define TREE_TYPE(NODE) ((NODE)->typed.type)
1022 #define TREE_BLOCK(NODE) *(tree_block (NODE))
1024 #include "tree-check.h"
1026 #define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
1027 #define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
1028 #define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
1029 #define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
1030 #define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
1031 #define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
1032 #define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
1033 #define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
1034 #define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
1035 #define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
1036 #define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
1038 #define RECORD_OR_UNION_CHECK(T) \
1039 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1040 #define NOT_RECORD_OR_UNION_CHECK(T) \
1041 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
1043 #define NUMERICAL_TYPE_CHECK(T) \
1044 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
1047 /* Here is how primitive or already-canonicalized types' hash codes
1049 #define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
1051 /* A simple hash function for an arbitrary tree node. This must not be
1052 used in hash tables which are saved to a PCH. */
1053 #define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1055 /* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
1056 #define CONVERT_EXPR_CODE_P(CODE) \
1057 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
1059 /* Similarly, but accept an expressions instead of a tree code. */
1060 #define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
1062 /* Generate case for NOP_EXPR, CONVERT_EXPR. */
1064 #define CASE_CONVERT \
1068 /* Given an expression as a tree, strip any conversion that generates
1069 no instruction. Accepts both tree and const_tree arguments since
1070 we are not modifying the tree itself. */
1072 #define STRIP_NOPS(EXP) \
1073 (EXP) = tree_strip_nop_conversions (CONST_CAST_TREE (EXP))
1075 /* Like STRIP_NOPS, but don't let the signedness change either. */
1077 #define STRIP_SIGN_NOPS(EXP) \
1078 (EXP) = tree_strip_sign_nop_conversions (CONST_CAST_TREE (EXP))
1080 /* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
1082 #define STRIP_TYPE_NOPS(EXP) \
1083 while ((CONVERT_EXPR_P (EXP) \
1084 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
1085 && TREE_OPERAND (EXP, 0) != error_mark_node \
1086 && (TREE_TYPE (EXP) \
1087 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
1088 (EXP) = TREE_OPERAND (EXP, 0)
1090 /* Remove unnecessary type conversions according to
1091 tree_ssa_useless_type_conversion. */
1093 #define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1094 (EXP) = tree_ssa_strip_useless_type_conversions (EXP)
1096 /* Nonzero if TYPE represents an integral type. Note that we do not
1097 include COMPLEX types here. Keep these checks in ascending code
1100 #define INTEGRAL_TYPE_P(TYPE) \
1101 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1102 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
1103 || TREE_CODE (TYPE) == INTEGER_TYPE)
1105 /* Nonzero if TYPE represents a non-saturating fixed-point type. */
1107 #define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1108 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1110 /* Nonzero if TYPE represents a saturating fixed-point type. */
1112 #define SAT_FIXED_POINT_TYPE_P(TYPE) \
1113 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1115 /* Nonzero if TYPE represents a fixed-point type. */
1117 #define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1119 /* Nonzero if TYPE represents a scalar floating-point type. */
1121 #define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1123 /* Nonzero if TYPE represents a complex floating-point type. */
1125 #define COMPLEX_FLOAT_TYPE_P(TYPE) \
1126 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1127 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1129 /* Nonzero if TYPE represents a vector integer type. */
1131 #define VECTOR_INTEGER_TYPE_P(TYPE) \
1132 (TREE_CODE (TYPE) == VECTOR_TYPE \
1133 && TREE_CODE (TREE_TYPE (TYPE)) == INTEGER_TYPE)
1136 /* Nonzero if TYPE represents a vector floating-point type. */
1138 #define VECTOR_FLOAT_TYPE_P(TYPE) \
1139 (TREE_CODE (TYPE) == VECTOR_TYPE \
1140 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1142 /* Nonzero if TYPE represents a floating-point type, including complex
1143 and vector floating-point types. The vector and complex check does
1144 not use the previous two macros to enable early folding. */
1146 #define FLOAT_TYPE_P(TYPE) \
1147 (SCALAR_FLOAT_TYPE_P (TYPE) \
1148 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1149 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1150 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
1152 /* Nonzero if TYPE represents a decimal floating-point type. */
1153 #define DECIMAL_FLOAT_TYPE_P(TYPE) \
1154 (SCALAR_FLOAT_TYPE_P (TYPE) \
1155 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1157 /* Nonzero if TYPE is a record or union type. */
1158 #define RECORD_OR_UNION_TYPE_P(TYPE) \
1159 (TREE_CODE (TYPE) == RECORD_TYPE \
1160 || TREE_CODE (TYPE) == UNION_TYPE \
1161 || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
1163 /* Nonzero if TYPE represents an aggregate (multi-component) type.
1164 Keep these checks in ascending code order. */
1166 #define AGGREGATE_TYPE_P(TYPE) \
1167 (TREE_CODE (TYPE) == ARRAY_TYPE || RECORD_OR_UNION_TYPE_P (TYPE))
1169 /* Nonzero if TYPE represents a pointer or reference type.
1170 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1171 ascending code order. */
1173 #define POINTER_TYPE_P(TYPE) \
1174 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
1176 /* Nonzero if this type is a complete type. */
1177 #define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1179 /* Nonzero if this type is the (possibly qualified) void type. */
1180 #define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
1182 /* Nonzero if this type is complete or is cv void. */
1183 #define COMPLETE_OR_VOID_TYPE_P(NODE) \
1184 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1186 /* Nonzero if this type is complete or is an array with unspecified bound. */
1187 #define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
1188 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1191 /* Define many boolean fields that all tree nodes have. */
1193 /* In VAR_DECL, PARM_DECL and RESULT_DECL nodes, nonzero means address
1194 of this is needed. So it cannot be in a register.
1195 In a FUNCTION_DECL it has no meaning.
1196 In CONSTRUCTOR nodes, it means object constructed must be in memory.
1197 In LABEL_DECL nodes, it means a goto for this label has been seen
1198 from a place outside all binding contours that restore stack levels.
1199 In ..._TYPE nodes, it means that objects of this type must be fully
1200 addressable. This means that pieces of this object cannot go into
1201 register parameters, for example. If this a function type, this
1202 means that the value must be returned in memory.
1203 In IDENTIFIER_NODEs, this means that some extern decl for this name
1204 had its address taken. That matters for inline functions. */
1205 #define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
1207 /* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1208 exit of a function. Calls for which this is true are candidates for tail
1209 call optimizations. */
1210 #define CALL_EXPR_TAILCALL(NODE) \
1211 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
1213 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1214 CASE_LOW operand has been processed. */
1215 #define CASE_LOW_SEEN(NODE) \
1216 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
1218 #define PREDICT_EXPR_OUTCOME(NODE) \
1219 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1220 #define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1221 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
1222 #define PREDICT_EXPR_PREDICTOR(NODE) \
1223 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1225 /* In a VAR_DECL, nonzero means allocate static storage.
1226 In a FUNCTION_DECL, nonzero if function has been defined.
1227 In a CONSTRUCTOR, nonzero means allocate static storage. */
1228 #define TREE_STATIC(NODE) ((NODE)->base.static_flag)
1230 /* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1231 #define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1233 /* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
1234 should only be executed if an exception is thrown, not on normal exit
1236 #define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
1238 /* In a TRY_CATCH_EXPR, means that the handler should be considered a
1239 separate cleanup in honor_protect_cleanup_actions. */
1240 #define TRY_CATCH_IS_CLEANUP(NODE) \
1241 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1243 /* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1244 CASE_HIGH operand has been processed. */
1245 #define CASE_HIGH_SEEN(NODE) \
1246 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
1248 /* Used to mark a CALL_EXPR as not suitable for inlining. */
1249 #define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
1251 /* Used to mark scoped enums. */
1252 #define ENUM_IS_SCOPED(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.static_flag)
1254 /* Determines whether an ENUMERAL_TYPE has defined the list of constants. */
1255 #define ENUM_IS_OPAQUE(NODE) (ENUMERAL_TYPE_CHECK (NODE)->base.private_flag)
1257 /* In an expr node (usually a conversion) this means the node was made
1258 implicitly and should not lead to any sort of warning. In a decl node,
1259 warnings concerning the decl should be suppressed. This is used at
1260 least for used-before-set warnings, and it set after one warning is
1262 #define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
1264 /* Used to indicate that this TYPE represents a compiler-generated entity. */
1265 #define TYPE_ARTIFICIAL(NODE) (TYPE_CHECK (NODE)->base.nowarning_flag)
1267 /* In an IDENTIFIER_NODE, this means that assemble_name was called with
1268 this string as an argument. */
1269 #define TREE_SYMBOL_REFERENCED(NODE) \
1270 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
1272 /* Nonzero in a pointer or reference type means the data pointed to
1273 by this type can alias anything. */
1274 #define TYPE_REF_CAN_ALIAS_ALL(NODE) \
1275 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
1277 /* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1278 #define MOVE_NONTEMPORAL(NODE) \
1279 (EXPR_CHECK (NODE)->base.static_flag)
1281 /* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
1282 there was an overflow in folding. */
1284 #define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
1286 /* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1288 #define TREE_OVERFLOW_P(EXPR) \
1289 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1291 /* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
1292 nonzero means name is to be accessible from outside this translation unit.
1293 In an IDENTIFIER_NODE, nonzero means an external declaration
1294 accessible from outside this translation unit was previously seen
1295 for this name in an inner scope. */
1296 #define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
1298 /* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1299 of cached values, or is something else. */
1300 #define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
1302 /* In a SAVE_EXPR, indicates that the original expression has already
1303 been substituted with a VAR_DECL that contains the value. */
1304 #define SAVE_EXPR_RESOLVED_P(NODE) \
1305 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
1307 /* Set on a CALL_EXPR if this stdarg call should be passed the argument
1309 #define CALL_EXPR_VA_ARG_PACK(NODE) \
1310 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1312 /* In any expression, decl, or constant, nonzero means it has side effects or
1313 reevaluation of the whole expression could produce a different value.
1314 This is set if any subexpression is a function call, a side effect or a
1315 reference to a volatile variable. In a ..._DECL, this is set only if the
1316 declaration said `volatile'. This will never be set for a constant. */
1317 #define TREE_SIDE_EFFECTS(NODE) \
1318 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
1320 /* In a LABEL_DECL, nonzero means this label had its address taken
1321 and therefore can never be deleted and is a jump target for
1323 #define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
1325 /* Nonzero means this expression is volatile in the C sense:
1326 its address should be of type `volatile WHATEVER *'.
1327 In other words, the declared item is volatile qualified.
1328 This is used in _DECL nodes and _REF nodes.
1329 On a FUNCTION_DECL node, this means the function does not
1330 return normally. This is the same effect as setting
1331 the attribute noreturn on the function in C.
1333 In a ..._TYPE node, means this type is volatile-qualified.
1334 But use TYPE_VOLATILE instead of this macro when the node is a type,
1335 because eventually we may make that a different bit.
1337 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
1338 #define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
1340 /* Nonzero means this node will not trap. In an INDIRECT_REF, means
1341 accessing the memory pointed to won't generate a trap. However,
1342 this only applies to an object when used appropriately: it doesn't
1343 mean that writing a READONLY mem won't trap.
1345 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1346 (or slice of the array) always belongs to the range of the array.
1347 I.e. that the access will not trap, provided that the access to
1348 the base to the array will not trap. */
1349 #define TREE_THIS_NOTRAP(NODE) \
1350 (TREE_CHECK5 (NODE, INDIRECT_REF, MEM_REF, TARGET_MEM_REF, ARRAY_REF, \
1351 ARRAY_RANGE_REF)->base.nothrow_flag)
1353 /* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
1354 nonzero means it may not be the lhs of an assignment.
1355 Nonzero in a FUNCTION_DECL means this function should be treated
1356 as "const" function (can only read its arguments). */
1357 #define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
1359 /* Value of expression is constant. Always on in all ..._CST nodes. May
1360 also appear in an expression or decl where the value is constant. */
1361 #define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
1363 /* Nonzero if NODE, a type, has had its sizes gimplified. */
1364 #define TYPE_SIZES_GIMPLIFIED(NODE) \
1365 (TYPE_CHECK (NODE)->base.constant_flag)
1367 /* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
1368 #define DECL_UNSIGNED(NODE) \
1369 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
1371 /* In integral and pointer types, means an unsigned type. */
1372 #define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
1374 /* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
1375 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1376 This is interesting in an inline function, since it might not need
1377 to be compiled separately.
1378 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
1379 if the debugging info for the type has been written.
1380 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
1381 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1383 #define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
1385 /* Nonzero in a _DECL if the name is used in its scope.
1386 Nonzero in an expr node means inhibit warning if value is unused.
1387 In IDENTIFIER_NODEs, this means that some extern decl for this name
1389 In a BLOCK, this means that the block contains variables that are used. */
1390 #define TREE_USED(NODE) ((NODE)->base.used_flag)
1392 /* In a FUNCTION_DECL, nonzero means a call to the function cannot
1393 throw an exception. In a CALL_EXPR, nonzero means the call cannot
1394 throw. We can't easily check the node type here as the C++
1395 frontend also uses this flag (for AGGR_INIT_EXPR). */
1396 #define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
1398 /* In a CALL_EXPR, means that it's safe to use the target of the call
1399 expansion as the return slot for a call that returns in memory. */
1400 #define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1401 (CALL_EXPR_CHECK (NODE)->base.private_flag)
1403 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that it is
1404 passed by invisible reference (and the TREE_TYPE is a pointer to the true
1406 #define DECL_BY_REFERENCE(NODE) \
1407 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1408 RESULT_DECL)->decl_common.decl_by_reference_flag)
1410 /* In a RESULT_DECL, PARM_DECL and VAR_DECL, means that this decl
1411 can be used as restricted tag to disambiguate against other restrict
1412 pointers. Used by fortran to capture something like non-addressability
1413 (which it isn't really because the middle-end does take addresses of
1415 #define DECL_RESTRICTED_P(NODE) \
1416 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, \
1417 RESULT_DECL)->decl_common.decl_restricted_flag)
1419 #define DECL_READ_P(NODE) \
1420 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_read_flag)
1422 #define DECL_NONSHAREABLE(NODE) \
1423 (TREE_CHECK2 (NODE, VAR_DECL, \
1424 RESULT_DECL)->decl_common.decl_nonshareable_flag)
1426 /* In a CALL_EXPR, means that the call is the jump from a thunk to the
1427 thunked-to function. */
1428 #define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1430 /* In a CALL_EXPR, if the function being called is BUILT_IN_ALLOCA, means that
1431 it has been built for the declaration of a variable-sized object. */
1432 #define CALL_ALLOCA_FOR_VAR_P(NODE) \
1433 (CALL_EXPR_CHECK (NODE)->base.protected_flag)
1435 /* In a type, nonzero means that all objects of the type are guaranteed by the
1436 language or front-end to be properly aligned, so we can indicate that a MEM
1437 of this type is aligned at least to the alignment of the type, even if it
1438 doesn't appear that it is. We see this, for example, in object-oriented
1439 languages where a tag field may show this is an object of a more-aligned
1440 variant of the more generic type.
1442 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1444 #define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
1446 /* Used in classes in C++. */
1447 #define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
1448 /* Used in classes in C++. */
1449 #define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
1451 /* True if reference type NODE is a C++ rvalue reference. */
1452 #define TYPE_REF_IS_RVALUE(NODE) \
1453 (REFERENCE_TYPE_CHECK (NODE)->base.private_flag)
1455 /* Nonzero in a _DECL if the use of the name is defined as a
1456 deprecated feature by __attribute__((deprecated)). */
1457 #define TREE_DEPRECATED(NODE) \
1458 ((NODE)->base.deprecated_flag)
1460 /* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1461 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1462 #define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
1463 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
1465 /* In fixed-point types, means a saturating type. */
1466 #define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1468 /* These flags are available for each language front end to use internally. */
1469 #define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1470 #define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1471 #define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1472 #define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1473 #define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1474 #define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1475 #define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
1477 /* Define additional fields and accessors for nodes representing constants. */
1479 /* In an INTEGER_CST node. These two together make a 2-word integer.
1480 If the data type is signed, the value is sign-extended to 2 words
1481 even though not all of them may really be in use.
1482 In an unsigned constant shorter than 2 words, the extra bits are 0. */
1483 #define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1484 #define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1485 #define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
1487 #define INT_CST_LT(A, B) \
1488 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1489 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
1490 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1492 #define INT_CST_LT_UNSIGNED(A, B) \
1493 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1494 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1495 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1496 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1497 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
1499 struct GTY(()) tree_int_cst
{
1500 struct tree_typed typed
;
1504 /* In a REAL_CST node. struct real_value is an opaque entity, with
1505 manipulators defined in real.h. We don't want tree.h depending on
1506 real.h and transitively on tm.h. */
1509 #define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1510 #define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
1512 struct GTY(()) tree_real_cst
{
1513 struct tree_typed typed
;
1514 struct real_value
* real_cst_ptr
;
1517 /* In a FIXED_CST node. */
1520 #define TREE_FIXED_CST_PTR(NODE) \
1521 (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1522 #define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1524 struct GTY(()) tree_fixed_cst
{
1525 struct tree_typed typed
;
1526 struct fixed_value
* fixed_cst_ptr
;
1529 /* In a STRING_CST */
1530 /* In C terms, this is sizeof, not strlen. */
1531 #define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
1532 #define TREE_STRING_POINTER(NODE) \
1533 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
1535 struct GTY(()) tree_string
{
1536 struct tree_typed typed
;
1541 /* In a COMPLEX_CST node. */
1542 #define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1543 #define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
1545 struct GTY(()) tree_complex
{
1546 struct tree_typed typed
;
1551 /* In a VECTOR_CST node. */
1552 #define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1554 struct GTY(()) tree_vector
{
1555 struct tree_typed typed
;
1561 /* Define fields and accessors for some special-purpose tree nodes. */
1563 #define IDENTIFIER_LENGTH(NODE) \
1564 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
1565 #define IDENTIFIER_POINTER(NODE) \
1566 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
1567 #define IDENTIFIER_HASH_VALUE(NODE) \
1568 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
1570 /* Translate a hash table identifier pointer to a tree_identifier
1571 pointer, and vice versa. */
1573 #define HT_IDENT_TO_GCC_IDENT(NODE) \
1574 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1575 #define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
1577 struct GTY(()) tree_identifier
{
1578 struct tree_common common
;
1579 struct ht_identifier id
;
1582 /* In a TREE_LIST node. */
1583 #define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1584 #define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
1586 struct GTY(()) tree_list
{
1587 struct tree_common common
;
1592 /* In a TREE_VEC node. */
1593 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
1594 #define TREE_VEC_END(NODE) \
1595 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1597 #define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1599 struct GTY(()) tree_vec
{
1600 struct tree_common common
;
1602 tree
GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a
[1];
1605 /* In a CONSTRUCTOR node. */
1606 #define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
1607 #define CONSTRUCTOR_ELT(NODE,IDX) \
1608 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1609 #define CONSTRUCTOR_NELTS(NODE) \
1610 (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
1612 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1613 value of each element (stored within VAL). IX must be a scratch variable
1614 of unsigned integer type. */
1615 #define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1616 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1618 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1622 /* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1623 the value of each element (stored within VAL) and its index (stored
1624 within INDEX). IX must be a scratch variable of unsigned integer type. */
1625 #define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1626 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1628 : (((void) (VAL = VEC_index (constructor_elt, V, IX)->value)), \
1629 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1633 /* Append a new constructor element to V, with the specified INDEX and VAL. */
1634 #define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1636 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1637 _ce___->index = INDEX; \
1638 _ce___->value = VALUE; \
1641 /* True if NODE, a FIELD_DECL, is to be processed as a bitfield for
1642 constructor output purposes. */
1643 #define CONSTRUCTOR_BITFIELD_P(NODE) \
1644 (DECL_BIT_FIELD (FIELD_DECL_CHECK (NODE)) && DECL_MODE (NODE) != BLKmode)
1646 /* True if NODE is a clobber right hand side, an expression of indeterminate
1647 value that clobbers the LHS in a copy instruction. We use a volatile
1648 empty CONSTRUCTOR for this, as it matches most of the necessary semantic.
1649 In particular the volatile flag causes us to not prematurely remove
1650 such clobber instructions. */
1651 #define TREE_CLOBBER_P(NODE) \
1652 (TREE_CODE (NODE) == CONSTRUCTOR && TREE_THIS_VOLATILE (NODE))
1654 /* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1655 element. INDEX can optionally design the position of VALUE: in arrays,
1656 it is the index where VALUE has to be placed; in structures, it is the
1657 FIELD_DECL of the member. */
1658 typedef struct GTY(()) constructor_elt_d
{
1663 DEF_VEC_O(constructor_elt
);
1664 DEF_VEC_ALLOC_O(constructor_elt
,gc
);
1666 struct GTY(()) tree_constructor
{
1667 struct tree_typed typed
;
1668 VEC(constructor_elt
,gc
) *elts
;
1671 /* Define fields and accessors for some nodes that represent expressions. */
1673 /* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
1674 #define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1675 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1676 && integer_zerop (TREE_OPERAND (NODE, 0)))
1678 /* In ordinary expression nodes. */
1679 #define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
1680 #define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
1682 /* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1683 length. Its value includes the length operand itself; that is,
1684 the minimum valid length is 1.
1685 Note that we have to bypass the use of TREE_OPERAND to access
1686 that field to avoid infinite recursion in expanding the macros. */
1687 #define VL_EXP_OPERAND_LENGTH(NODE) \
1688 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1690 /* Nonzero if is_gimple_debug() may possibly hold. */
1691 #define MAY_HAVE_DEBUG_STMTS (flag_var_tracking_assignments)
1693 /* In a LOOP_EXPR node. */
1694 #define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
1696 /* The source location of this expression. Non-tree_exp nodes such as
1697 decls and constants can be shared among multiple locations, so
1699 #define EXPR_LOCATION(NODE) \
1700 (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1701 #define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1702 #define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1703 #define EXPR_LOC_OR_HERE(NODE) (EXPR_HAS_LOCATION (NODE) ? (NODE)->exp.locus : input_location)
1704 #define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1705 #define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
1707 /* True if a tree is an expression or statement that can have a
1709 #define CAN_HAVE_LOCATION_P(NODE) ((NODE) && EXPR_P (NODE))
1711 extern void protected_set_expr_location (tree
, location_t
);
1713 /* In a TARGET_EXPR node. */
1714 #define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1715 #define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1716 #define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
1718 /* DECL_EXPR accessor. This gives access to the DECL associated with
1719 the given declaration statement. */
1720 #define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1722 #define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1724 /* COMPOUND_LITERAL_EXPR accessors. */
1725 #define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1726 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1727 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1728 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1730 /* SWITCH_EXPR accessors. These give access to the condition, body and
1731 original condition type (before any compiler conversions)
1732 of the switch statement, respectively. */
1733 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1734 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1735 #define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
1737 /* CASE_LABEL_EXPR accessors. These give access to the high and low values
1738 of a case label, respectively. */
1739 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1740 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1741 #define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
1742 #define CASE_CHAIN(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 3)
1744 /* The operands of a TARGET_MEM_REF. Operands 0 and 1 have to match
1745 corresponding MEM_REF operands. */
1746 #define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1747 #define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1748 #define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1749 #define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1750 #define TMR_INDEX2(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1752 /* The operands of a BIND_EXPR. */
1753 #define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1754 #define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1755 #define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1757 /* GOTO_EXPR accessor. This gives access to the label associated with
1758 a goto statement. */
1759 #define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1761 /* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
1762 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1763 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1765 #define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1766 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1767 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1768 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
1769 #define ASM_LABELS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 4)
1770 /* Nonzero if we want to create an ASM_INPUT instead of an
1771 ASM_OPERAND with no operands. */
1772 #define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1773 #define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
1775 /* COND_EXPR accessors. */
1776 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1777 #define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1778 #define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1780 /* Accessors for the chains of recurrences. */
1781 #define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1782 #define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1783 #define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1784 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1786 /* LABEL_EXPR accessor. This gives access to the label associated with
1787 the given label expression. */
1788 #define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1790 /* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1791 accessors for SSA operands. */
1793 /* CATCH_EXPR accessors. */
1794 #define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1795 #define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1797 /* EH_FILTER_EXPR accessors. */
1798 #define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1799 #define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
1801 /* OBJ_TYPE_REF accessors. */
1802 #define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1803 #define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1804 #define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1806 /* ASSERT_EXPR accessors. */
1807 #define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1808 #define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1810 /* CALL_EXPR accessors.
1812 #define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1813 #define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1814 #define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1815 #define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1817 /* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1818 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1819 the argument count is zero when checking is enabled. Instead, do
1820 the pointer arithmetic to advance past the 3 fixed operands in a
1821 CALL_EXPR. That produces a valid pointer to just past the end of the
1822 operand array, even if it's not valid to dereference it. */
1823 #define CALL_EXPR_ARGP(NODE) \
1824 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1826 /* TM directives and accessors. */
1827 #define TRANSACTION_EXPR_BODY(NODE) \
1828 TREE_OPERAND (TRANSACTION_EXPR_CHECK (NODE), 0)
1829 #define TRANSACTION_EXPR_OUTER(NODE) \
1830 (TRANSACTION_EXPR_CHECK (NODE)->base.static_flag)
1831 #define TRANSACTION_EXPR_RELAXED(NODE) \
1832 (TRANSACTION_EXPR_CHECK (NODE)->base.public_flag)
1834 /* OpenMP directive and clause accessors. */
1836 #define OMP_BODY(NODE) \
1837 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1838 #define OMP_CLAUSES(NODE) \
1839 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1841 #define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1842 #define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1844 #define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1845 #define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
1847 #define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1848 #define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1849 #define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
1851 #define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1852 #define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1853 #define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1854 #define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1855 #define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1856 #define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1858 #define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1859 #define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1861 #define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1863 #define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1864 #define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1866 #define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1868 #define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1870 #define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1871 #define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1873 #define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1874 #define OMP_CLAUSE_DECL(NODE) \
1875 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1876 OMP_CLAUSE_PRIVATE, \
1877 OMP_CLAUSE_COPYPRIVATE), 0)
1878 #define OMP_CLAUSE_HAS_LOCATION(NODE) \
1879 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.locus != UNKNOWN_LOCATION)
1880 #define OMP_CLAUSE_LOCATION(NODE) (OMP_CLAUSE_CHECK (NODE))->omp_clause.locus
1882 /* True on an OMP_SECTION statement that was the last lexical member.
1883 This status is meaningful in the implementation of lastprivate. */
1884 #define OMP_SECTION_LAST(NODE) \
1885 (OMP_SECTION_CHECK (NODE)->base.private_flag)
1887 /* True on an OMP_PARALLEL statement if it represents an explicit
1888 combined parallel work-sharing constructs. */
1889 #define OMP_PARALLEL_COMBINED(NODE) \
1890 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
1892 /* True on a PRIVATE clause if its decl is kept around for debugging
1893 information only and its DECL_VALUE_EXPR is supposed to point
1894 to what it has been remapped to. */
1895 #define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
1896 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
1898 /* True on a PRIVATE clause if ctor needs access to outer region's
1900 #define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1901 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1903 /* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1904 decl is present in the chain. */
1905 #define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
1906 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
1907 #define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1908 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1909 OMP_CLAUSE_LASTPRIVATE),\
1911 #define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1912 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1914 #define OMP_CLAUSE_FINAL_EXPR(NODE) \
1915 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_FINAL), 0)
1916 #define OMP_CLAUSE_IF_EXPR(NODE) \
1917 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
1918 #define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
1919 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
1920 #define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
1921 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
1923 #define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1924 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1925 #define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1926 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1927 #define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1928 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1930 #define OMP_CLAUSE_REDUCTION_CODE(NODE) \
1931 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
1932 #define OMP_CLAUSE_REDUCTION_INIT(NODE) \
1933 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
1934 #define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
1935 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
1936 #define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1937 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1938 #define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1939 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
1940 #define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
1941 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
1943 enum omp_clause_schedule_kind
1945 OMP_CLAUSE_SCHEDULE_STATIC
,
1946 OMP_CLAUSE_SCHEDULE_DYNAMIC
,
1947 OMP_CLAUSE_SCHEDULE_GUIDED
,
1948 OMP_CLAUSE_SCHEDULE_AUTO
,
1949 OMP_CLAUSE_SCHEDULE_RUNTIME
1952 #define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
1953 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
1955 enum omp_clause_default_kind
1957 OMP_CLAUSE_DEFAULT_UNSPECIFIED
,
1958 OMP_CLAUSE_DEFAULT_SHARED
,
1959 OMP_CLAUSE_DEFAULT_NONE
,
1960 OMP_CLAUSE_DEFAULT_PRIVATE
,
1961 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
1964 #define OMP_CLAUSE_DEFAULT_KIND(NODE) \
1965 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
1967 struct GTY(()) tree_exp
{
1968 struct tree_typed typed
;
1971 tree
GTY ((special ("tree_exp"),
1972 desc ("TREE_CODE ((tree) &%0)")))
1976 /* SSA_NAME accessors. */
1978 /* Returns the variable being referenced. Once released, this is the
1979 only field that can be relied upon. */
1980 #define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1982 /* Returns the statement which defines this SSA name. */
1983 #define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
1985 /* Returns the SSA version number of this SSA name. Note that in
1986 tree SSA, version numbers are not per variable and may be recycled. */
1987 #define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1989 /* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1990 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1992 #define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
1993 SSA_NAME_CHECK (NODE)->base.asm_written_flag
1995 /* Nonzero if this SSA_NAME expression is currently on the free list of
1996 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1997 has no meaning for an SSA_NAME. */
1998 #define SSA_NAME_IN_FREE_LIST(NODE) \
1999 SSA_NAME_CHECK (NODE)->base.nothrow_flag
2001 /* Nonzero if this SSA_NAME is the default definition for the
2002 underlying symbol. A default SSA name is created for symbol S if
2003 the very first reference to S in the function is a read operation.
2004 Default definitions are always created by an empty statement and
2005 belong to no basic block. */
2006 #define SSA_NAME_IS_DEFAULT_DEF(NODE) \
2007 SSA_NAME_CHECK (NODE)->base.default_def_flag
2009 /* Attributes for SSA_NAMEs for pointer-type variables. */
2010 #define SSA_NAME_PTR_INFO(N) \
2011 SSA_NAME_CHECK (N)->ssa_name.ptr_info
2013 /* Defined in tree-flow.h. */
2014 struct ptr_info_def
;
2016 /* Immediate use linking structure. This structure is used for maintaining
2017 a doubly linked list of uses of an SSA_NAME. */
2018 typedef struct GTY(()) ssa_use_operand_d
{
2019 struct ssa_use_operand_d
* GTY((skip(""))) prev
;
2020 struct ssa_use_operand_d
* GTY((skip(""))) next
;
2021 /* Immediate uses for a given SSA name are maintained as a cyclic
2022 list. To recognize the root of this list, the location field
2023 needs to point to the original SSA name. Since statements and
2024 SSA names are of different data types, we need this union. See
2025 the explanation in struct immediate_use_iterator_d. */
2026 union { gimple stmt
; tree ssa_name
; } GTY((skip(""))) loc
;
2027 tree
*GTY((skip(""))) use
;
2028 } ssa_use_operand_t
;
2030 /* Return the immediate_use information for an SSA_NAME. */
2031 #define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
2033 struct GTY(()) tree_ssa_name
{
2034 struct tree_typed typed
;
2036 /* _DECL wrapped by this SSA name. */
2039 /* Statement that defines this SSA name. */
2042 /* SSA version number. */
2043 unsigned int version
;
2045 /* Pointer attributes used for alias analysis. */
2046 struct ptr_info_def
*ptr_info
;
2048 /* Immediate uses list for this SSA_NAME. */
2049 struct ssa_use_operand_d imm_uses
;
2052 struct GTY(()) phi_arg_d
{
2053 /* imm_use MUST be the first element in struct because we do some
2054 pointer arithmetic with it. See phi_arg_index_from_use. */
2055 struct ssa_use_operand_d imm_use
;
2061 #define OMP_CLAUSE_CODE(NODE) \
2062 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2064 #define OMP_CLAUSE_SET_CODE(NODE, CODE) \
2065 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
2067 #define OMP_CLAUSE_CODE(NODE) \
2068 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
2070 #define OMP_CLAUSE_OPERAND(NODE, I) \
2071 OMP_CLAUSE_ELT_CHECK (NODE, I)
2073 struct GTY(()) tree_omp_clause
{
2074 struct tree_common common
;
2076 enum omp_clause_code code
;
2077 union omp_clause_subcode
{
2078 enum omp_clause_default_kind default_kind
;
2079 enum omp_clause_schedule_kind schedule_kind
;
2080 enum tree_code reduction_code
;
2081 } GTY ((skip
)) subcode
;
2083 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
2085 gimple_seq gimple_reduction_init
;
2086 gimple_seq gimple_reduction_merge
;
2088 tree
GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops
[1];
2092 /* In a BLOCK node. */
2093 #define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
2094 #define BLOCK_NONLOCALIZED_VARS(NODE) \
2095 (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
2096 #define BLOCK_NUM_NONLOCALIZED_VARS(NODE) \
2097 VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
2098 #define BLOCK_NONLOCALIZED_VAR(NODE,N) \
2099 VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
2100 #define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
2101 #define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
2102 #define BLOCK_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.chain)
2103 #define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
2104 #define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
2106 /* An index number for this block. These values are not guaranteed to
2107 be unique across functions -- whether or not they are depends on
2108 the debugging output format in use. */
2109 #define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
2111 /* If block reordering splits a lexical block into discontiguous
2112 address ranges, we'll make a copy of the original block.
2114 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
2115 In that case, we have one source block that has been replicated
2116 (through inlining or unrolling) into many logical blocks, and that
2117 these logical blocks have different physical variables in them.
2119 In this case, we have one logical block split into several
2120 non-contiguous address ranges. Most debug formats can't actually
2121 represent this idea directly, so we fake it by creating multiple
2122 logical blocks with the same variables in them. However, for those
2123 that do support non-contiguous regions, these allow the original
2124 logical block to be reconstructed, along with the set of address
2127 One of the logical block fragments is arbitrarily chosen to be
2128 the ORIGIN. The other fragments will point to the origin via
2129 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
2130 be null. The list of fragments will be chained through
2131 BLOCK_FRAGMENT_CHAIN from the origin. */
2133 #define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
2134 #define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
2136 /* For an inlined function, this gives the location where it was called
2137 from. This is only set in the top level block, which corresponds to the
2138 inlined function scope. This is used in the debug output routines. */
2140 #define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
2142 struct GTY(()) tree_block
{
2143 struct tree_base base
;
2146 unsigned abstract_flag
: 1;
2147 unsigned block_num
: 31;
2152 VEC(tree
,gc
) *nonlocalized_vars
;
2156 tree abstract_origin
;
2157 tree fragment_origin
;
2158 tree fragment_chain
;
2161 /* Define fields and accessors for nodes representing data types. */
2163 /* See tree.def for documentation of the use of these fields.
2164 Look at the documentation of the various ..._TYPE tree codes.
2166 Note that the type.values, type.minval, and type.maxval fields are
2167 overloaded and used for different macros in different kinds of types.
2168 Each macro must check to ensure the tree node is of the proper kind of
2169 type. Note also that some of the front-ends also overload these fields,
2170 so they must be checked as well. */
2172 #define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type_common.uid)
2173 #define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type_common.size)
2174 #define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type_common.size_unit)
2175 #define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type_common.pointer_to)
2176 #define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type_common.reference_to)
2177 #define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type_common.precision)
2178 #define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type_common.name)
2179 #define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.next_variant)
2180 #define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type_common.main_variant)
2181 #define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type_common.context)
2183 /* Vector types need to check target flags to determine type. */
2184 extern enum machine_mode
vector_type_mode (const_tree
);
2185 #define TYPE_MODE(NODE) \
2186 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2187 ? vector_type_mode (NODE) : (NODE)->type_common.mode)
2188 #define SET_TYPE_MODE(NODE, MODE) \
2189 (TYPE_CHECK (NODE)->type_common.mode = (MODE))
2191 /* The "canonical" type for this type node, which is used by frontends to
2192 compare the type for equality with another type. If two types are
2193 equal (based on the semantics of the language), then they will have
2194 equivalent TYPE_CANONICAL entries.
2196 As a special case, if TYPE_CANONICAL is NULL_TREE, and thus
2197 TYPE_STRUCTURAL_EQUALITY_P is true, then it cannot
2198 be used for comparison against other types. Instead, the type is
2199 said to require structural equality checks, described in
2200 TYPE_STRUCTURAL_EQUALITY_P.
2202 For unqualified aggregate and function types the middle-end relies on
2203 TYPE_CANONICAL to tell whether two variables can be assigned
2204 to each other without a conversion. The middle-end also makes sure
2205 to assign the same alias-sets to the type partition with equal
2206 TYPE_CANONICAL of their unqualified variants. */
2207 #define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type_common.canonical)
2208 /* Indicates that the type node requires structural equality
2209 checks. The compiler will need to look at the composition of the
2210 type to determine whether it is equal to another type, rather than
2211 just comparing canonical type pointers. For instance, we would need
2212 to look at the return and parameter types of a FUNCTION_TYPE
2214 #define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2215 /* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2216 type node requires structural equality. */
2217 #define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
2219 #define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2220 #define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
2222 /* The (language-specific) typed-based alias set for this type.
2223 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2224 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2225 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2226 type can alias objects of any type. */
2227 #define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type_common.alias_set)
2229 /* Nonzero iff the typed-based alias set for this type has been
2231 #define TYPE_ALIAS_SET_KNOWN_P(NODE) \
2232 (TYPE_CHECK (NODE)->type_common.alias_set != -1)
2234 /* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2236 #define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type_common.attributes)
2238 /* The alignment necessary for objects of this type.
2239 The value is an int, measured in bits. */
2240 #define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type_common.align)
2242 /* 1 if the alignment for this type was requested by "aligned" attribute,
2243 0 if it is the default for this type. */
2244 #define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->base.user_align)
2246 /* The alignment for NODE, in bytes. */
2247 #define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
2249 /* If your language allows you to declare types, and you want debug info
2250 for them, then you need to generate corresponding TYPE_DECL nodes.
2251 These "stub" TYPE_DECL nodes have no name, and simply point at the
2252 type node. You then set the TYPE_STUB_DECL field of the type node
2253 to point back at the TYPE_DECL node. This allows the debug routines
2254 to know that the two nodes represent the same type, so that we only
2255 get one debug info record for them. */
2256 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
2258 /* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2259 has BLKmode only because it lacks the alignment requirement for
2261 #define TYPE_NO_FORCE_BLK(NODE) \
2262 (TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2264 /* In an INTEGER_TYPE, it means the type represents a size. We use
2265 this both for validity checking and to permit optimizations that
2266 are unsafe for other types. Note that the C `size_t' type should
2267 *not* have this flag set. The `size_t' type is simply a typedef
2268 for an ordinary integer type that happens to be the type of an
2269 expression returned by `sizeof'; `size_t' has no special
2270 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2271 always actual sizes. */
2272 #define TYPE_IS_SIZETYPE(NODE) \
2273 (INTEGER_TYPE_CHECK (NODE)->type_common.no_force_blk_flag)
2275 /* Nonzero in a type considered volatile as a whole. */
2276 #define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
2278 /* Means this type is const-qualified. */
2279 #define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
2281 /* If nonzero, this type is `restrict'-qualified, in the C sense of
2283 #define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type_common.restrict_flag)
2285 /* If nonzero, type's name shouldn't be emitted into debug info. */
2286 #define TYPE_NAMELESS(NODE) (TYPE_CHECK (NODE)->base.nameless_flag)
2288 /* The address space the type is in. */
2289 #define TYPE_ADDR_SPACE(NODE) (TYPE_CHECK (NODE)->base.address_space)
2291 /* There is a TYPE_QUAL value for each type qualifier. They can be
2292 combined by bitwise-or to form the complete set of qualifiers for a
2296 TYPE_UNQUALIFIED
= 0x0,
2297 TYPE_QUAL_CONST
= 0x1,
2298 TYPE_QUAL_VOLATILE
= 0x2,
2299 TYPE_QUAL_RESTRICT
= 0x4
2302 /* Encode/decode the named memory support as part of the qualifier. If more
2303 than 8 qualifiers are added, these macros need to be adjusted. */
2304 #define ENCODE_QUAL_ADDR_SPACE(NUM) ((NUM & 0xFF) << 8)
2305 #define DECODE_QUAL_ADDR_SPACE(X) (((X) >> 8) & 0xFF)
2307 /* Return all qualifiers except for the address space qualifiers. */
2308 #define CLEAR_QUAL_ADDR_SPACE(X) ((X) & ~0xFF00)
2310 /* Only keep the address space out of the qualifiers and discard the other
2312 #define KEEP_QUAL_ADDR_SPACE(X) ((X) & 0xFF00)
2314 /* The set of type qualifiers for this type. */
2315 #define TYPE_QUALS(NODE) \
2316 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2317 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2318 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT) \
2319 | (ENCODE_QUAL_ADDR_SPACE (TYPE_ADDR_SPACE (NODE))))
2321 /* The same as TYPE_QUALS without the address space qualifications. */
2322 #define TYPE_QUALS_NO_ADDR_SPACE(NODE) \
2323 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2324 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
2325 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
2327 /* These flags are available for each language front end to use internally. */
2328 #define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_0)
2329 #define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_1)
2330 #define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_2)
2331 #define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_3)
2332 #define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_4)
2333 #define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_5)
2334 #define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type_common.lang_flag_6)
2336 /* Used to keep track of visited nodes in tree traversals. This is set to
2337 0 by copy_node and make_node. */
2338 #define TREE_VISITED(NODE) ((NODE)->base.visited)
2340 /* If set in an ARRAY_TYPE, indicates a string type (for languages
2341 that distinguish string from array of char).
2342 If set in a INTEGER_TYPE, indicates a character type. */
2343 #define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type_common.string_flag)
2345 /* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
2346 #define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
2347 (((unsigned HOST_WIDE_INT) 1) \
2348 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision)
2350 /* Set precision to n when we have 2^n sub-parts of the vector. */
2351 #define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2352 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type_common.precision = exact_log2 (X))
2354 /* Nonzero in a VECTOR_TYPE if the frontends should not emit warnings
2355 about missing conversions to other vector types of the same size. */
2356 #define TYPE_VECTOR_OPAQUE(NODE) \
2357 (VECTOR_TYPE_CHECK (NODE)->base.default_def_flag)
2359 /* Indicates that objects of this type must be initialized by calling a
2360 function when they are created. */
2361 #define TYPE_NEEDS_CONSTRUCTING(NODE) \
2362 (TYPE_CHECK (NODE)->type_common.needs_constructing_flag)
2364 /* Indicates that a UNION_TYPE object should be passed the same way that
2365 the first union alternative would be passed, or that a RECORD_TYPE
2366 object should be passed the same way that the first (and only) member
2368 #define TYPE_TRANSPARENT_AGGR(NODE) \
2369 (RECORD_OR_UNION_CHECK (NODE)->type_common.transparent_aggr_flag)
2371 /* For an ARRAY_TYPE, indicates that it is not permitted to take the
2372 address of a component of the type. This is the counterpart of
2373 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2374 #define TYPE_NONALIASED_COMPONENT(NODE) \
2375 (ARRAY_TYPE_CHECK (NODE)->type_common.transparent_aggr_flag)
2377 /* Indicated that objects of this type should be laid out in as
2378 compact a way as possible. */
2379 #define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->base.packed_flag)
2381 /* Used by type_contains_placeholder_p to avoid recomputation.
2382 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2383 this field directly. */
2384 #define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2385 (TYPE_CHECK (NODE)->type_common.contains_placeholder_bits)
2387 /* The debug output functions use the symtab union field to store
2388 information specific to the debugging format. The different debug
2389 output hooks store different types in the union field. These three
2390 macros are used to access different fields in the union. The debug
2391 hooks are responsible for consistently using only a specific
2394 /* Symtab field as an integer. Used by stabs generator in dbxout.c to
2395 hold the type's number in the generated stabs. */
2396 #define TYPE_SYMTAB_ADDRESS(NODE) \
2397 (TYPE_CHECK (NODE)->type_common.symtab.address)
2399 /* Symtab field as a string. Used by COFF generator in sdbout.c to
2400 hold struct/union type tag names. */
2401 #define TYPE_SYMTAB_POINTER(NODE) \
2402 (TYPE_CHECK (NODE)->type_common.symtab.pointer)
2404 /* Symtab field as a pointer to a DWARF DIE. Used by DWARF generator
2405 in dwarf2out.c to point to the DIE generated for the type. */
2406 #define TYPE_SYMTAB_DIE(NODE) \
2407 (TYPE_CHECK (NODE)->type_common.symtab.die)
2409 /* The garbage collector needs to know the interpretation of the
2410 symtab field. These constants represent the different types in the
2413 #define TYPE_SYMTAB_IS_ADDRESS (0)
2414 #define TYPE_SYMTAB_IS_POINTER (1)
2415 #define TYPE_SYMTAB_IS_DIE (2)
2419 struct GTY(()) tree_type_common
{
2420 struct tree_common common
;
2426 unsigned int precision
: 10;
2427 unsigned no_force_blk_flag
: 1;
2428 unsigned needs_constructing_flag
: 1;
2429 unsigned transparent_aggr_flag
: 1;
2430 unsigned restrict_flag
: 1;
2431 unsigned contains_placeholder_bits
: 2;
2433 ENUM_BITFIELD(machine_mode
) mode
: 8;
2435 unsigned string_flag
: 1;
2436 unsigned lang_flag_0
: 1;
2437 unsigned lang_flag_1
: 1;
2438 unsigned lang_flag_2
: 1;
2439 unsigned lang_flag_3
: 1;
2440 unsigned lang_flag_4
: 1;
2441 unsigned lang_flag_5
: 1;
2442 unsigned lang_flag_6
: 1;
2445 alias_set_type alias_set
;
2448 union tree_type_symtab
{
2449 int GTY ((tag ("TYPE_SYMTAB_IS_ADDRESS"))) address
;
2450 const char * GTY ((tag ("TYPE_SYMTAB_IS_POINTER"))) pointer
;
2451 struct die_struct
* GTY ((tag ("TYPE_SYMTAB_IS_DIE"))) die
;
2452 } GTY ((desc ("debug_hooks->tree_type_symtab_field"))) symtab
;
2460 #define TYPE_LANG_SPECIFIC(NODE) \
2461 (TYPE_CHECK (NODE)->type_with_lang_specific.lang_specific)
2463 struct GTY(()) tree_type_with_lang_specific
{
2464 struct tree_type_common common
;
2465 /* Points to a structure whose details depend on the language in use. */
2466 struct lang_type
*lang_specific
;
2469 #define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type_non_common.values)
2470 #define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type_non_common.values)
2471 #define TYPE_FIELDS(NODE) \
2472 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.values)
2473 #define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2474 #define TYPE_ARG_TYPES(NODE) \
2475 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.values)
2476 #define TYPE_VALUES_RAW(NODE) (TYPE_CHECK(NODE)->type_non_common.values)
2478 #define TYPE_METHODS(NODE) \
2479 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.maxval)
2480 #define TYPE_VFIELD(NODE) \
2481 (RECORD_OR_UNION_CHECK (NODE)->type_non_common.minval)
2482 #define TYPE_METHOD_BASETYPE(NODE) \
2483 (FUNC_OR_METHOD_CHECK (NODE)->type_non_common.maxval)
2484 #define TYPE_OFFSET_BASETYPE(NODE) \
2485 (OFFSET_TYPE_CHECK (NODE)->type_non_common.maxval)
2486 #define TYPE_MAXVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.maxval)
2487 #define TYPE_MINVAL(NODE) (TYPE_CHECK (NODE)->type_non_common.minval)
2488 #define TYPE_NEXT_PTR_TO(NODE) \
2489 (POINTER_TYPE_CHECK (NODE)->type_non_common.minval)
2490 #define TYPE_NEXT_REF_TO(NODE) \
2491 (REFERENCE_TYPE_CHECK (NODE)->type_non_common.minval)
2492 #define TYPE_MIN_VALUE(NODE) \
2493 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.minval)
2494 #define TYPE_MAX_VALUE(NODE) \
2495 (NUMERICAL_TYPE_CHECK (NODE)->type_non_common.maxval)
2497 /* If non-NULL, this is an upper bound of the size (in bytes) of an
2498 object of the given ARRAY_TYPE_NON_COMMON. This allows temporaries to be
2500 #define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
2501 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type_non_common.maxval)
2503 /* For record and union types, information about this type, as a base type
2505 #define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2507 /* For non record and union types, used in a language-dependent way. */
2508 #define TYPE_LANG_SLOT_1(NODE) \
2509 (NOT_RECORD_OR_UNION_CHECK(NODE)->type_non_common.binfo)
2511 struct GTY(()) tree_type_non_common
{
2512 struct tree_type_with_lang_specific with_lang_specific
;
2519 /* Define accessor macros for information about type inheritance
2522 A "basetype" means a particular usage of a data type for inheritance
2523 in another type. Each such basetype usage has its own "binfo"
2524 object to describe it. The binfo object is a TREE_VEC node.
2526 Inheritance is represented by the binfo nodes allocated for a
2527 given type. For example, given types C and D, such that D is
2528 inherited by C, 3 binfo nodes will be allocated: one for describing
2529 the binfo properties of C, similarly one for D, and one for
2530 describing the binfo properties of D as a base type for C.
2531 Thus, given a pointer to class C, one can get a pointer to the binfo
2532 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2534 /* BINFO specific flags. */
2536 /* Nonzero means that the derivation chain is via a `virtual' declaration. */
2537 #define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
2539 /* Flags for language dependent use. */
2540 #define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2541 #define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2542 #define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2543 #define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2544 #define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2545 #define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2546 #define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2548 /* The actual data type node being inherited in this basetype. */
2549 #define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
2551 /* The offset where this basetype appears in its containing type.
2552 BINFO_OFFSET slot holds the offset (in bytes)
2553 from the base of the complete object to the base of the part of the
2554 object that is allocated on behalf of this `type'.
2555 This is always 0 except when there is multiple inheritance. */
2557 #define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
2558 #define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
2560 /* The virtual function table belonging to this basetype. Virtual
2561 function tables provide a mechanism for run-time method dispatching.
2562 The entries of a virtual function table are language-dependent. */
2564 #define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
2566 /* The virtual functions in the virtual function table. This is
2567 a TREE_LIST that is used as an initial approximation for building
2568 a virtual function table for this basetype. */
2569 #define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
2571 /* A vector of binfos for the direct basetypes inherited by this
2574 If this basetype describes type D as inherited in C, and if the
2575 basetypes of D are E and F, then this vector contains binfos for
2576 inheritance of E and F by C. */
2577 #define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
2579 /* The number of basetypes for NODE. */
2580 #define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
2582 /* Accessor macro to get to the Nth base binfo of this binfo. */
2583 #define BINFO_BASE_BINFO(NODE,N) \
2584 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2585 #define BINFO_BASE_ITERATE(NODE,N,B) \
2586 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2587 #define BINFO_BASE_APPEND(NODE,T) \
2588 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
2590 /* For a BINFO record describing a virtual base class, i.e., one where
2591 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
2592 base. The actual contents are language-dependent. In the C++
2593 front-end this field is an INTEGER_CST giving an offset into the
2594 vtable where the offset to the virtual base can be found. */
2595 #define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2597 /* Indicates the accesses this binfo has to its bases. The values are
2598 access_public_node, access_protected_node or access_private_node.
2599 If this array is not present, public access is implied. */
2600 #define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
2602 #define BINFO_BASE_ACCESS(NODE,N) \
2603 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2604 #define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2605 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
2607 /* The index in the VTT where this subobject's sub-VTT can be found.
2608 NULL_TREE if there is no sub-VTT. */
2609 #define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
2611 /* The index in the VTT where the vptr for this subobject can be
2612 found. NULL_TREE if there is no secondary vptr in the VTT. */
2613 #define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2615 /* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2616 inheriting this base for non-virtual bases. For virtual bases it
2617 points either to the binfo for which this is a primary binfo, or to
2618 the binfo of the most derived type. */
2619 #define BINFO_INHERITANCE_CHAIN(NODE) \
2620 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2622 struct GTY (()) tree_binfo
{
2623 struct tree_common common
;
2629 VEC(tree
,gc
) *base_accesses
;
2635 VEC(tree
,none
) base_binfos
;
2639 /* Define fields and accessors for nodes representing declared names. */
2641 /* Nonzero if DECL represents a variable for the SSA passes. */
2642 #define SSA_VAR_P(DECL) \
2643 (TREE_CODE (DECL) == VAR_DECL \
2644 || TREE_CODE (DECL) == PARM_DECL \
2645 || TREE_CODE (DECL) == RESULT_DECL \
2646 || (TREE_CODE (DECL) == SSA_NAME \
2647 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2648 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
2649 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
2654 /* Enumerate visibility settings. */
2655 #ifndef SYMBOL_VISIBILITY_DEFINED
2656 #define SYMBOL_VISIBILITY_DEFINED
2657 enum symbol_visibility
2660 VISIBILITY_PROTECTED
,
2668 #define DECL_CHAIN(NODE) (TREE_CHAIN (DECL_MINIMAL_CHECK (NODE)))
2670 /* This is the name of the object as written by the user.
2671 It is an IDENTIFIER_NODE. */
2672 #define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
2674 /* Every ..._DECL node gets a unique number. */
2675 #define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
2677 /* DEBUG_EXPR_DECLs get negative UID numbers, to catch erroneous
2679 #define DEBUG_TEMP_UID(NODE) (-DECL_UID (TREE_CHECK ((NODE), DEBUG_EXPR_DECL)))
2681 /* Every ..._DECL node gets a unique number that stays the same even
2682 when the decl is copied by the inliner once it is set. */
2683 #define DECL_PT_UID(NODE) \
2684 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid == -1u \
2685 ? (NODE)->decl_minimal.uid : (NODE)->decl_common.pt_uid)
2686 /* Initialize the ..._DECL node pt-uid to the decls uid. */
2687 #define SET_DECL_PT_UID(NODE, UID) \
2688 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid = (UID))
2689 /* Whether the ..._DECL node pt-uid has been initialized and thus needs to
2690 be preserved when copyin the decl. */
2691 #define DECL_PT_UID_SET_P(NODE) \
2692 (DECL_COMMON_CHECK (NODE)->decl_common.pt_uid != -1u)
2694 /* These two fields describe where in the source code the declaration
2695 was. If the declaration appears in several places (as for a C
2696 function that is declared first and then defined later), this
2697 information should refer to the definition. */
2698 #define DECL_SOURCE_LOCATION(NODE) \
2699 (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2700 #define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2701 #define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
2702 #define DECL_IS_BUILTIN(DECL) \
2703 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
2705 /* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2706 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2707 PARM_DECL, FUNCTION_DECL, LABEL_DECL, RESULT_DECL, and CONST_DECL
2708 nodes, this points to either the FUNCTION_DECL for the containing
2709 function, the RECORD_TYPE or UNION_TYPE for the containing type, or
2710 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2711 scope". In particular, for VAR_DECLs which are virtual table pointers
2712 (they have DECL_VIRTUAL set), we use DECL_CONTEXT to determine the type
2714 #define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2715 #define DECL_FIELD_CONTEXT(NODE) \
2716 (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
2718 /* If nonzero, decl's name shouldn't be emitted into debug info. */
2719 #define DECL_NAMELESS(NODE) (DECL_MINIMAL_CHECK (NODE)->base.nameless_flag)
2721 struct GTY(()) tree_decl_minimal
{
2722 struct tree_common common
;
2730 /* For any sort of a ..._DECL node, this points to the original (abstract)
2731 decl node which this decl is an inlined/cloned instance of, or else it
2732 is NULL indicating that this decl is not an instance of some other decl.
2734 The C front-end also uses this in a nested declaration of an inline
2735 function, to point back to the definition. */
2736 #define DECL_ABSTRACT_ORIGIN(NODE) \
2737 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2739 /* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2740 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2741 #define DECL_ORIGIN(NODE) \
2742 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2744 /* Nonzero for any sort of ..._DECL node means this decl node represents an
2745 inline instance of some original (abstract) decl from an inline function;
2746 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2747 nodes can also have their abstract origin set to themselves. */
2748 #define DECL_FROM_INLINE(NODE) \
2749 (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2750 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2752 /* In a DECL this is the field where attributes are stored. */
2753 #define DECL_ATTRIBUTES(NODE) \
2754 (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2756 /* For a FUNCTION_DECL, holds the tree of BINDINGs.
2757 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
2758 For a VAR_DECL, holds the initial value.
2759 For a PARM_DECL, used for DECL_ARG_TYPE--default
2760 values for parameters are encoded in the type of the function,
2761 not in the PARM_DECL slot.
2762 For a FIELD_DECL, this is used for enumeration values and the C
2763 frontend uses it for temporarily storing bitwidth of bitfields.
2765 ??? Need to figure out some way to check this isn't a PARM_DECL. */
2766 #define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2768 /* Holds the size of the datum, in bits, as a tree expression.
2769 Need not be constant. */
2770 #define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
2771 /* Likewise for the size in bytes. */
2772 #define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
2773 /* Holds the alignment required for the datum, in bits. */
2774 #define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
2775 /* The alignment of NODE, in bytes. */
2776 #define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
2777 /* Set if the alignment of this DECL has been set by the user, for
2778 example with an 'aligned' attribute. */
2779 #define DECL_USER_ALIGN(NODE) \
2780 (DECL_COMMON_CHECK (NODE)->base.user_align)
2781 /* Holds the machine mode corresponding to the declaration of a variable or
2782 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2784 #define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
2786 /* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2787 operation it is. Note, however, that this field is overloaded, with
2788 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2789 checked before any access to the former. */
2790 #define DECL_FUNCTION_CODE(NODE) \
2791 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
2792 #define DECL_DEBUG_EXPR_IS_FROM(NODE) \
2793 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
2795 #define DECL_FUNCTION_PERSONALITY(NODE) \
2796 (FUNCTION_DECL_CHECK (NODE)->function_decl.personality)
2798 /* Nonzero for a given ..._DECL node means that the name of this node should
2799 be ignored for symbolic debug purposes. For a TYPE_DECL, this means that
2800 the associated type should be ignored. For a FUNCTION_DECL, the body of
2801 the function should also be ignored. */
2802 #define DECL_IGNORED_P(NODE) \
2803 (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
2805 /* Nonzero for a given ..._DECL node means that this node represents an
2806 "abstract instance" of the given declaration (e.g. in the original
2807 declaration of an inline function). When generating symbolic debugging
2808 information, we mustn't try to generate any address information for nodes
2809 marked as "abstract instances" because we don't actually generate
2810 any code or allocate any data space for such instances. */
2811 #define DECL_ABSTRACT(NODE) \
2812 (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2814 /* Language-specific decl information. */
2815 #define DECL_LANG_SPECIFIC(NODE) \
2816 (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
2818 /* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
2819 do not allocate storage, and refer to a definition elsewhere. Note that
2820 this does not necessarily imply the entity represented by NODE
2821 has no program source-level definition in this translation unit. For
2822 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2823 DECL_EXTERNAL may be true simultaneously; that can be the case for
2824 a C99 "extern inline" function. */
2825 #define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_1)
2827 /* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2828 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2830 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2832 Also set in some languages for variables, etc., outside the normal
2833 lexical scope, such as class instance variables. */
2834 #define DECL_NONLOCAL(NODE) \
2835 (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
2837 /* Used in VAR_DECLs to indicate that the variable is a vtable.
2838 Used in FIELD_DECLs for vtable pointers.
2839 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2840 #define DECL_VIRTUAL_P(NODE) \
2841 (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
2843 /* Used to indicate that this DECL represents a compiler-generated entity. */
2844 #define DECL_ARTIFICIAL(NODE) \
2845 (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
2847 /* Additional flags for language-specific uses. */
2848 #define DECL_LANG_FLAG_0(NODE) \
2849 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2850 #define DECL_LANG_FLAG_1(NODE) \
2851 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2852 #define DECL_LANG_FLAG_2(NODE) \
2853 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2854 #define DECL_LANG_FLAG_3(NODE) \
2855 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2856 #define DECL_LANG_FLAG_4(NODE) \
2857 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2858 #define DECL_LANG_FLAG_5(NODE) \
2859 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2860 #define DECL_LANG_FLAG_6(NODE) \
2861 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2862 #define DECL_LANG_FLAG_7(NODE) \
2863 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
2864 #define DECL_LANG_FLAG_8(NODE) \
2865 (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_8)
2867 /* Nonzero for a scope which is equal to file scope. */
2868 #define SCOPE_FILE_SCOPE_P(EXP) \
2869 (! (EXP) || TREE_CODE (EXP) == TRANSLATION_UNIT_DECL)
2870 /* Nonzero for a decl which is at file scope. */
2871 #define DECL_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (DECL_CONTEXT (EXP))
2872 /* Nonzero for a type which is at file scope. */
2873 #define TYPE_FILE_SCOPE_P(EXP) SCOPE_FILE_SCOPE_P (TYPE_CONTEXT (EXP))
2875 /* Nonzero for a decl that is decorated using attribute used.
2876 This indicates to compiler tools that this decl needs to be preserved. */
2877 #define DECL_PRESERVE_P(DECL) \
2878 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
2880 /* For function local variables of COMPLEX and VECTOR types,
2881 indicates that the variable is not aliased, and that all
2882 modifications to the variable have been adjusted so that
2883 they are killing assignments. Thus the variable may now
2884 be treated as a GIMPLE register, and use real instead of
2885 virtual ops in SSA form. */
2886 #define DECL_GIMPLE_REG_P(DECL) \
2887 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
2889 struct GTY(()) tree_decl_common
{
2890 struct tree_decl_minimal common
;
2893 ENUM_BITFIELD(machine_mode
) mode
: 8;
2895 unsigned nonlocal_flag
: 1;
2896 unsigned virtual_flag
: 1;
2897 unsigned ignored_flag
: 1;
2898 unsigned abstract_flag
: 1;
2899 unsigned artificial_flag
: 1;
2900 unsigned preserve_flag
: 1;
2901 unsigned debug_expr_is_from
: 1;
2903 unsigned lang_flag_0
: 1;
2904 unsigned lang_flag_1
: 1;
2905 unsigned lang_flag_2
: 1;
2906 unsigned lang_flag_3
: 1;
2907 unsigned lang_flag_4
: 1;
2908 unsigned lang_flag_5
: 1;
2909 unsigned lang_flag_6
: 1;
2910 unsigned lang_flag_7
: 1;
2911 unsigned lang_flag_8
: 1;
2913 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2914 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2915 unsigned decl_flag_0
: 1;
2916 /* In FIELD_DECL, this is DECL_BIT_FIELD
2917 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2918 In TYPE_DECL, this is TYPE_DECL_SUPPRESS_DEBUG. */
2919 unsigned decl_flag_1
: 1;
2920 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2921 In VAR_DECL, PARM_DECL and RESULT_DECL, this is
2922 DECL_HAS_VALUE_EXPR_P. */
2923 unsigned decl_flag_2
: 1;
2924 /* Logically, these two would go in a theoretical base shared by var and
2926 unsigned gimple_reg_flag
: 1;
2927 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_BY_REFERENCE. */
2928 unsigned decl_by_reference_flag
: 1;
2929 /* In VAR_DECL, PARM_DECL and RESULT_DECL, this is DECL_RESTRICTED_P. */
2930 unsigned decl_restricted_flag
: 1;
2932 /* In VAR_DECL and PARM_DECL set when the decl has been used except for
2934 unsigned decl_read_flag
: 1;
2936 /* In VAR_DECL or RESULT_DECL set when significant code movement precludes
2937 attempting to share the stack slot with some other variable. */
2938 unsigned decl_nonshareable_flag
: 1;
2940 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2941 unsigned int off_align
: 8;
2943 /* 24-bits unused. */
2945 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2948 /* UID for points-to sets, stable over copying from inlining. */
2949 unsigned int pt_uid
;
2954 tree abstract_origin
;
2956 /* Points to a structure whose details depend on the language in use. */
2957 struct lang_decl
*lang_specific
;
2960 extern tree
decl_value_expr_lookup (tree
);
2961 extern void decl_value_expr_insert (tree
, tree
);
2963 /* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2964 if transformations have made this more complicated than evaluating the
2965 decl itself. This should only be used for debugging; once this field has
2966 been set, the decl itself may not legitimately appear in the function. */
2967 #define DECL_HAS_VALUE_EXPR_P(NODE) \
2968 (TREE_CHECK3 (NODE, VAR_DECL, PARM_DECL, RESULT_DECL) \
2969 ->decl_common.decl_flag_2)
2970 #define DECL_VALUE_EXPR(NODE) \
2971 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
2972 #define SET_DECL_VALUE_EXPR(NODE, VAL) \
2973 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
2975 /* Holds the RTL expression for the value of a variable or function.
2976 This value can be evaluated lazily for functions, variables with
2977 static storage duration, and labels. */
2978 #define DECL_RTL(NODE) \
2979 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2980 ? (NODE)->decl_with_rtl.rtl \
2981 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
2983 /* Set the DECL_RTL for NODE to RTL. */
2984 #define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
2986 /* Returns nonzero if NODE is a tree node that can contain RTL. */
2987 #define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2989 /* Returns nonzero if the DECL_RTL for NODE has already been set. */
2990 #define DECL_RTL_SET_P(NODE) \
2991 (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2993 /* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2994 NODE1, it will not be set for NODE2; this is a lazy copy. */
2995 #define COPY_DECL_RTL(NODE1, NODE2) \
2996 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl \
2997 = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2999 /* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
3000 #define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
3002 #if (GCC_VERSION >= 2007)
3003 #define DECL_RTL_KNOWN_SET(decl) __extension__ \
3004 ({ tree const __d = (decl); \
3005 gcc_checking_assert (DECL_RTL_SET_P (__d)); \
3006 /* Dereference it so the compiler knows it can't be NULL even \
3007 without assertion checking. */ \
3008 &*DECL_RTL_IF_SET (__d); })
3010 #define DECL_RTL_KNOWN_SET(decl) (&*DECL_RTL_IF_SET (decl))
3013 /* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
3014 #define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
3016 struct GTY(()) tree_decl_with_rtl
{
3017 struct tree_decl_common common
;
3021 /* In a FIELD_DECL, this is the field position, counting in bytes, of the
3022 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
3023 of the structure. */
3024 #define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
3026 /* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
3027 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
3028 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
3029 natural alignment of the field's type). */
3030 #define DECL_FIELD_BIT_OFFSET(NODE) \
3031 (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
3033 /* In a FIELD_DECL, this indicates whether the field was a bit-field and
3034 if so, the type that was originally specified for it.
3035 TREE_TYPE may have been modified (in finish_struct). */
3036 #define DECL_BIT_FIELD_TYPE(NODE) \
3037 (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
3039 /* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
3040 if nonzero, indicates that the field occupies the type. */
3041 #define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
3043 /* For FIELD_DECLs, off_align holds the number of low-order bits of
3044 DECL_FIELD_OFFSET which are known to be always zero.
3045 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
3047 #define DECL_OFFSET_ALIGN(NODE) \
3048 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
3050 /* Specify that DECL_ALIGN(NODE) is a multiple of X. */
3051 #define SET_DECL_OFFSET_ALIGN(NODE, X) \
3052 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = ffs_hwi (X) - 1)
3054 /* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
3055 which this FIELD_DECL is defined. This information is needed when
3056 writing debugging information about vfield and vbase decls for C++. */
3057 #define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
3059 /* In a FIELD_DECL, indicates this field should be bit-packed. */
3060 #define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->base.packed_flag)
3062 /* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
3064 #define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3066 /* Used in a FIELD_DECL to indicate that we cannot form the address of
3067 this component. This makes it possible for Type-Based Alias Analysis
3068 to disambiguate accesses to this field with indirect accesses using
3071 struct S { int i; } s;
3074 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
3076 From the implementation's viewpoint, the alias set of the type of the
3077 field 'i' (int) will not be recorded as a subset of that of the type of
3078 's' (struct S) in record_component_aliases. The counterpart is that
3079 accesses to s.i must not be given the alias set of the type of 'i'
3080 (int) but instead directly that of the type of 's' (struct S). */
3081 #define DECL_NONADDRESSABLE_P(NODE) \
3082 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
3084 struct GTY(()) tree_field_decl
{
3085 struct tree_decl_common common
;
3088 tree bit_field_type
;
3094 /* A numeric unique identifier for a LABEL_DECL. The UID allocation is
3095 dense, unique within any one function, and may be used to index arrays.
3096 If the value is -1, then no UID has been assigned. */
3097 #define LABEL_DECL_UID(NODE) \
3098 (LABEL_DECL_CHECK (NODE)->label_decl.label_decl_uid)
3100 /* In a LABEL_DECL, the EH region number for which the label is the
3101 post_landing_pad. */
3102 #define EH_LANDING_PAD_NR(NODE) \
3103 (LABEL_DECL_CHECK (NODE)->label_decl.eh_landing_pad_nr)
3105 /* In LABEL_DECL nodes, nonzero means that an error message about
3106 jumping into such a binding contour has been printed for this label. */
3107 #define DECL_ERROR_ISSUED(NODE) \
3108 (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
3110 struct GTY(()) tree_label_decl
{
3111 struct tree_decl_with_rtl common
;
3113 int eh_landing_pad_nr
;
3117 struct GTY(()) tree_result_decl
{
3118 struct tree_decl_with_rtl common
;
3119 struct var_ann_d
*ann
;
3122 struct GTY(()) tree_const_decl
{
3123 struct tree_decl_common common
;
3126 /* For a PARM_DECL, records the data type used to pass the argument,
3127 which may be different from the type seen in the program. */
3128 #define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
3130 /* For PARM_DECL, holds an RTL for the stack slot or register
3131 where the data was actually passed. */
3132 #define DECL_INCOMING_RTL(NODE) \
3133 (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
3135 struct GTY(()) tree_parm_decl
{
3136 struct tree_decl_with_rtl common
;
3138 struct var_ann_d
*ann
;
3142 /* Nonzero for a given ..._DECL node means that no warnings should be
3143 generated just because this node is unused. */
3144 #define DECL_IN_SYSTEM_HEADER(NODE) \
3145 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
3147 /* Used to indicate that the linkage status of this DECL is not yet known,
3148 so it should not be output now. */
3149 #define DECL_DEFER_OUTPUT(NODE) \
3150 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
3152 /* In a VAR_DECL that's static,
3153 nonzero if the space is in the text section. */
3154 #define DECL_IN_TEXT_SECTION(NODE) \
3155 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
3157 /* In a VAR_DECL that's static,
3158 nonzero if it belongs to the global constant pool. */
3159 #define DECL_IN_CONSTANT_POOL(NODE) \
3160 (VAR_DECL_CHECK (NODE)->decl_with_vis.in_constant_pool)
3162 /* Nonzero for a given ..._DECL node means that this node should be
3163 put in .common, if possible. If a DECL_INITIAL is given, and it
3164 is not error_mark_node, then the decl cannot be put in .common. */
3165 #define DECL_COMMON(NODE) \
3166 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
3168 /* In a VAR_DECL, nonzero if the decl is a register variable with
3169 an explicit asm specification. */
3170 #define DECL_HARD_REGISTER(NODE) \
3171 (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
3173 /* Used to indicate that this DECL has weak linkage. */
3174 #define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
3176 /* Used to indicate that the DECL is a dllimport. */
3177 #define DECL_DLLIMPORT_P(NODE) \
3178 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
3180 /* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
3181 not be put out unless it is needed in this translation unit.
3182 Entities like this are shared across translation units (like weak
3183 entities), but are guaranteed to be generated by any translation
3184 unit that needs them, and therefore need not be put out anywhere
3185 where they are not needed. DECL_COMDAT is just a hint to the
3186 back-end; it is up to front-ends which set this flag to ensure
3187 that there will never be any harm, other than bloat, in putting out
3188 something which is DECL_COMDAT. */
3189 #define DECL_COMDAT(NODE) \
3190 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
3192 #define DECL_COMDAT_GROUP(NODE) \
3193 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_group)
3195 /* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
3196 multiple translation units should be merged. */
3197 #define DECL_ONE_ONLY(NODE) (DECL_COMDAT_GROUP (NODE) != NULL_TREE)
3199 /* The name of the object as the assembler will see it (but before any
3200 translations made by ASM_OUTPUT_LABELREF). Often this is the same
3201 as DECL_NAME. It is an IDENTIFIER_NODE. */
3202 #define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
3204 /* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
3205 This is true of all DECL nodes except FIELD_DECL. */
3206 #define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
3207 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
3209 /* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
3210 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
3212 #define DECL_ASSEMBLER_NAME_SET_P(NODE) \
3213 (HAS_DECL_ASSEMBLER_NAME_P (NODE) \
3214 && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
3216 /* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
3217 #define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
3218 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
3220 /* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
3221 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
3222 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
3223 semantics of using this macro, are different than saying:
3225 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3227 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
3229 #define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
3230 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
3231 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
3232 DECL_ASSEMBLER_NAME (DECL1)) \
3235 /* Records the section name in a section attribute. Used to pass
3236 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
3237 #define DECL_SECTION_NAME(NODE) \
3238 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3240 /* Nonzero in a decl means that the gimplifier has seen (or placed)
3241 this variable in a BIND_EXPR. */
3242 #define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
3243 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3245 /* Value of the decls's visibility attribute */
3246 #define DECL_VISIBILITY(NODE) \
3247 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
3249 /* Nonzero means that the decl had its visibility specified rather than
3251 #define DECL_VISIBILITY_SPECIFIED(NODE) \
3252 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
3254 /* In a VAR_DECL, the model to use if the data should be allocated from
3255 thread-local storage. */
3256 #define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3258 /* In a VAR_DECL, nonzero if the data should be allocated from
3259 thread-local storage. */
3260 #define DECL_THREAD_LOCAL_P(NODE) \
3261 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
3263 /* In a non-local VAR_DECL with static storage duration, true if the
3264 variable has an initialization priority. If false, the variable
3265 will be initialized at the DEFAULT_INIT_PRIORITY. */
3266 #define DECL_HAS_INIT_PRIORITY_P(NODE) \
3267 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
3269 /* Specify whether the section name was set by user or by
3270 compiler via -ffunction-sections. */
3271 #define DECL_HAS_IMPLICIT_SECTION_NAME_P(NODE) \
3272 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.implicit_section_name_p)
3274 struct GTY(()) tree_decl_with_vis
{
3275 struct tree_decl_with_rtl common
;
3276 tree assembler_name
;
3280 /* Belong to VAR_DECL exclusively. */
3281 unsigned defer_output
: 1;
3282 unsigned hard_register
: 1;
3283 unsigned thread_local
: 1;
3284 unsigned common_flag
: 1;
3285 unsigned in_text_section
: 1;
3286 unsigned in_constant_pool
: 1;
3287 unsigned dllimport_flag
: 1;
3288 /* Don't belong to VAR_DECL exclusively. */
3289 unsigned weak_flag
: 1;
3291 unsigned seen_in_bind_expr
: 1;
3292 unsigned comdat_flag
: 1;
3293 ENUM_BITFIELD(symbol_visibility
) visibility
: 2;
3294 unsigned visibility_specified
: 1;
3295 /* Belongs to VAR_DECL exclusively. */
3296 ENUM_BITFIELD(tls_model
) tls_model
: 3;
3298 /* Belong to FUNCTION_DECL exclusively. */
3299 unsigned init_priority_p
: 1;
3300 /* Used by C++ only. Might become a generic decl flag. */
3301 unsigned shadowed_for_var_p
: 1;
3302 /* When SECTION_NAME is implied by -ffunsection-section. */
3303 unsigned implicit_section_name_p
: 1;
3304 /* 13 unused bits. */
3307 extern tree
decl_debug_expr_lookup (tree
);
3308 extern void decl_debug_expr_insert (tree
, tree
);
3309 /* For VAR_DECL, this is set to either an expression that it was split
3310 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3311 subexpressions that it was split into. */
3312 #define DECL_DEBUG_EXPR(NODE) \
3313 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3315 #define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3316 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3318 /* An initialization priority. */
3319 typedef unsigned short priority_type
;
3321 extern priority_type
decl_init_priority_lookup (tree
);
3322 extern priority_type
decl_fini_priority_lookup (tree
);
3323 extern void decl_init_priority_insert (tree
, priority_type
);
3324 extern void decl_fini_priority_insert (tree
, priority_type
);
3326 /* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3328 #define DECL_INIT_PRIORITY(NODE) \
3329 (decl_init_priority_lookup (NODE))
3330 /* Set the initialization priority for NODE to VAL. */
3331 #define SET_DECL_INIT_PRIORITY(NODE, VAL) \
3332 (decl_init_priority_insert (NODE, VAL))
3334 /* For a FUNCTION_DECL the finalization priority of NODE. */
3335 #define DECL_FINI_PRIORITY(NODE) \
3336 (decl_fini_priority_lookup (NODE))
3337 /* Set the finalization priority for NODE to VAL. */
3338 #define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3339 (decl_fini_priority_insert (NODE, VAL))
3341 /* The initialization priority for entities for which no explicit
3342 initialization priority has been specified. */
3343 #define DEFAULT_INIT_PRIORITY 65535
3345 /* The maximum allowed initialization priority. */
3346 #define MAX_INIT_PRIORITY 65535
3348 /* The largest priority value reserved for use by system runtime
3350 #define MAX_RESERVED_INIT_PRIORITY 100
3352 #define DECL_VAR_ANN_PTR(NODE) \
3353 (TREE_CODE (NODE) == VAR_DECL ? &(NODE)->var_decl.ann \
3354 : TREE_CODE (NODE) == PARM_DECL ? &(NODE)->parm_decl.ann \
3355 : TREE_CODE (NODE) == RESULT_DECL ? &(NODE)->result_decl.ann \
3358 struct GTY(()) tree_var_decl
{
3359 struct tree_decl_with_vis common
;
3360 struct var_ann_d
*ann
;
3364 /* This field is used to reference anything in decl.result and is meant only
3365 for use by the garbage collector. */
3366 #define DECL_RESULT_FLD(NODE) \
3367 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3369 /* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3370 Before the struct containing the FUNCTION_DECL is laid out,
3371 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3372 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3373 function. When the class is laid out, this pointer is changed
3374 to an INTEGER_CST node which is suitable for use as an index
3375 into the virtual function table.
3376 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3377 #define DECL_VINDEX(NODE) \
3378 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3381 tree_decl_non_common
{
3382 struct tree_decl_with_vis common
;
3383 /* C++ uses this in namespaces. */
3385 /* C++ uses this in templates. */
3387 /* Almost all FE's use this. */
3389 /* C++ uses this in namespaces and function_decls. */
3393 /* In FUNCTION_DECL, holds the decl for the return value. */
3394 #define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3396 /* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3397 #define DECL_UNINLINABLE(NODE) \
3398 (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3400 /* In a FUNCTION_DECL, the saved representation of the body of the
3402 #define DECL_SAVED_TREE(NODE) \
3403 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3405 /* Nonzero in a FUNCTION_DECL means this function should be treated
3406 as if it were a malloc, meaning it returns a pointer that is
3408 #define DECL_IS_MALLOC(NODE) \
3409 (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3411 /* Nonzero in a FUNCTION_DECL means this function should be treated as
3412 C++ operator new, meaning that it returns a pointer for which we
3413 should not use type based aliasing. */
3414 #define DECL_IS_OPERATOR_NEW(NODE) \
3415 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3417 /* Nonzero in a FUNCTION_DECL means this function may return more
3419 #define DECL_IS_RETURNS_TWICE(NODE) \
3420 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3422 /* Nonzero in a FUNCTION_DECL means this function should be treated
3423 as "pure" function (like const function, but may read global memory). */
3424 #define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3426 /* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3427 the const or pure function may not terminate. When this is nonzero
3428 for a const or pure function, it can be dealt with by cse passes
3429 but cannot be removed by dce passes since you are not allowed to
3430 change an infinite looping program into one that terminates without
3432 #define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3433 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
3435 /* Nonzero in a FUNCTION_DECL means this function should be treated
3436 as "novops" function (function that does not read global memory,
3437 but may have arbitrary side effects). */
3438 #define DECL_IS_NOVOPS(NODE) \
3439 (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3441 /* Used in FUNCTION_DECLs to indicate that they should be run automatically
3442 at the beginning or end of execution. */
3443 #define DECL_STATIC_CONSTRUCTOR(NODE) \
3444 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3446 #define DECL_STATIC_DESTRUCTOR(NODE) \
3447 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3449 /* Used in FUNCTION_DECLs to indicate that function entry and exit should
3450 be instrumented with calls to support routines. */
3451 #define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3452 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3454 /* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3455 disabled in this function. */
3456 #define DECL_NO_LIMIT_STACK(NODE) \
3457 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3459 /* In a FUNCTION_DECL indicates that a static chain is needed. */
3460 #define DECL_STATIC_CHAIN(NODE) \
3461 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
3463 /* Nonzero for a decl that cgraph has decided should be inlined into
3464 at least one call site. It is not meaningful to look at this
3465 directly; always use cgraph_function_possibly_inlined_p. */
3466 #define DECL_POSSIBLY_INLINED(DECL) \
3467 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
3469 /* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3470 such as via the `inline' keyword in C/C++. This flag controls the linkage
3471 semantics of 'inline' */
3472 #define DECL_DECLARED_INLINE_P(NODE) \
3473 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
3475 /* Nonzero in a FUNCTION_DECL means this function should not get
3476 -Winline warnings. */
3477 #define DECL_NO_INLINE_WARNING_P(NODE) \
3478 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3480 /* Nonzero if a FUNCTION_CODE is a TM load/store. */
3481 #define BUILTIN_TM_LOAD_STORE_P(FN) \
3482 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3484 /* Nonzero if a FUNCTION_CODE is a TM load. */
3485 #define BUILTIN_TM_LOAD_P(FN) \
3486 ((FN) >= BUILT_IN_TM_LOAD_1 && (FN) <= BUILT_IN_TM_LOAD_RFW_LDOUBLE)
3488 /* Nonzero if a FUNCTION_CODE is a TM store. */
3489 #define BUILTIN_TM_STORE_P(FN) \
3490 ((FN) >= BUILT_IN_TM_STORE_1 && (FN) <= BUILT_IN_TM_STORE_WAW_LDOUBLE)
3492 #define CASE_BUILT_IN_TM_LOAD(FN) \
3493 case BUILT_IN_TM_LOAD_##FN: \
3494 case BUILT_IN_TM_LOAD_RAR_##FN: \
3495 case BUILT_IN_TM_LOAD_RAW_##FN: \
3496 case BUILT_IN_TM_LOAD_RFW_##FN
3498 #define CASE_BUILT_IN_TM_STORE(FN) \
3499 case BUILT_IN_TM_STORE_##FN: \
3500 case BUILT_IN_TM_STORE_WAR_##FN: \
3501 case BUILT_IN_TM_STORE_WAW_##FN
3503 /* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3504 disregarding size and cost heuristics. This is equivalent to using
3505 the always_inline attribute without the required diagnostics if the
3506 function cannot be inlined. */
3507 #define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3508 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3510 extern VEC(tree
, gc
) **decl_debug_args_lookup (tree
);
3511 extern VEC(tree
, gc
) **decl_debug_args_insert (tree
);
3513 /* Nonzero if a FUNCTION_DECL has DEBUG arguments attached to it. */
3514 #define DECL_HAS_DEBUG_ARGS_P(NODE) \
3515 (FUNCTION_DECL_CHECK (NODE)->function_decl.has_debug_args_flag)
3517 /* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3518 that describes the status of this function. */
3519 #define DECL_STRUCT_FUNCTION(NODE) \
3520 (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
3522 /* In a FUNCTION_DECL, nonzero means a built in function. */
3523 #define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
3525 /* For a builtin function, identify which part of the compiler defined it. */
3526 #define DECL_BUILT_IN_CLASS(NODE) \
3527 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
3529 /* In FUNCTION_DECL, a chain of ..._DECL nodes.
3530 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3532 #define DECL_ARGUMENTS(NODE) \
3533 (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
3534 #define DECL_ARGUMENT_FLD(NODE) \
3535 (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
3537 /* In FUNCTION_DECL, the function specific target options to use when compiling
3539 #define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3540 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3542 /* In FUNCTION_DECL, the function specific optimization options to use when
3543 compiling this function. */
3544 #define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3545 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3547 /* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3548 arguments/result/saved_tree fields by front ends. It was either inherit
3549 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3550 which seemed a bit strange. */
3552 struct GTY(()) tree_function_decl
{
3553 struct tree_decl_non_common common
;
3557 /* The personality function. Used for stack unwinding. */
3560 /* Function specific options that are used by this function. */
3561 tree function_specific_target
; /* target options */
3562 tree function_specific_optimization
; /* optimization options */
3564 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
3565 DECL_FUNCTION_CODE. Otherwise unused.
3566 ??? The bitfield needs to be able to hold all target function
3568 ENUM_BITFIELD(built_in_function
) function_code
: 11;
3569 ENUM_BITFIELD(built_in_class
) built_in_class
: 2;
3571 unsigned static_ctor_flag
: 1;
3572 unsigned static_dtor_flag
: 1;
3573 unsigned uninlinable
: 1;
3575 unsigned possibly_inlined
: 1;
3576 unsigned novops_flag
: 1;
3577 unsigned returns_twice_flag
: 1;
3578 unsigned malloc_flag
: 1;
3579 unsigned operator_new_flag
: 1;
3580 unsigned declared_inline_flag
: 1;
3581 unsigned regdecl_flag
: 1;
3582 unsigned no_inline_warning_flag
: 1;
3584 unsigned no_instrument_function_entry_exit
: 1;
3585 unsigned no_limit_stack
: 1;
3586 unsigned disregard_inline_limits
: 1;
3587 unsigned pure_flag
: 1;
3588 unsigned looping_const_or_pure_flag
: 1;
3589 unsigned has_debug_args_flag
: 1;
3590 unsigned tm_clone_flag
: 1;
3595 /* The source language of the translation-unit. */
3596 #define TRANSLATION_UNIT_LANGUAGE(NODE) \
3597 (TRANSLATION_UNIT_DECL_CHECK (NODE)->translation_unit_decl.language)
3599 /* TRANSLATION_UNIT_DECL inherits from DECL_MINIMAL. */
3601 struct GTY(()) tree_translation_unit_decl
{
3602 struct tree_decl_common common
;
3603 /* Source language of this translation unit. Used for DWARF output. */
3604 const char * GTY((skip(""))) language
;
3605 /* TODO: Non-optimization used to build this translation unit. */
3606 /* TODO: Root of a partial DWARF tree for global types and decls. */
3609 /* A vector of all translation-units. */
3610 extern GTY (()) VEC(tree
,gc
) *all_translation_units
;
3612 /* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3613 #define DECL_ORIGINAL_TYPE(NODE) \
3614 (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
3616 /* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3617 into stabs. Instead it will generate cross reference ('x') of names.
3618 This uses the same flag as DECL_EXTERNAL. */
3619 #define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3620 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_1)
3622 /* Getter of the imported declaration associated to the
3623 IMPORTED_DECL node. */
3624 #define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3625 (DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3627 struct GTY(()) tree_type_decl
{
3628 struct tree_decl_non_common common
;
3632 /* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3633 To reduce overhead, the nodes containing the statements are not trees.
3634 This avoids the overhead of tree_common on all linked list elements.
3636 Use the interface in tree-iterator.h to access this node. */
3638 #define STATEMENT_LIST_HEAD(NODE) \
3639 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3640 #define STATEMENT_LIST_TAIL(NODE) \
3641 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3643 struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3645 struct tree_statement_list_node
*prev
;
3646 struct tree_statement_list_node
*next
;
3650 struct GTY(()) tree_statement_list
3652 struct tree_typed typed
;
3653 struct tree_statement_list_node
*head
;
3654 struct tree_statement_list_node
*tail
;
3658 /* Optimization options used by a function. */
3660 struct GTY(()) tree_optimization_option
{
3661 struct tree_common common
;
3663 /* The optimization options used by the user. */
3664 struct cl_optimization opts
;
3667 #define TREE_OPTIMIZATION(NODE) \
3668 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3670 /* Return a tree node that encapsulates the current optimization options. */
3671 extern tree
build_optimization_node (void);
3673 /* Target options used by a function. */
3675 struct GTY(()) tree_target_option
{
3676 struct tree_common common
;
3678 /* The optimization options used by the user. */
3679 struct cl_target_option opts
;
3682 #define TREE_TARGET_OPTION(NODE) \
3683 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3685 /* Return a tree node that encapsulates the current target options. */
3686 extern tree
build_target_option_node (void);
3689 /* Define the overall contents of a tree node.
3690 It may be any of the structures declared above
3691 for various types of node. */
3693 union GTY ((ptr_alias (union lang_tree_node
),
3694 desc ("tree_node_structure (&%h)"), variable_size
)) tree_node
{
3695 struct tree_base
GTY ((tag ("TS_BASE"))) base
;
3696 struct tree_typed
GTY ((tag ("TS_TYPED"))) typed
;
3697 struct tree_common
GTY ((tag ("TS_COMMON"))) common
;
3698 struct tree_int_cst
GTY ((tag ("TS_INT_CST"))) int_cst
;
3699 struct tree_real_cst
GTY ((tag ("TS_REAL_CST"))) real_cst
;
3700 struct tree_fixed_cst
GTY ((tag ("TS_FIXED_CST"))) fixed_cst
;
3701 struct tree_vector
GTY ((tag ("TS_VECTOR"))) vector
;
3702 struct tree_string
GTY ((tag ("TS_STRING"))) string
;
3703 struct tree_complex
GTY ((tag ("TS_COMPLEX"))) complex;
3704 struct tree_identifier
GTY ((tag ("TS_IDENTIFIER"))) identifier
;
3705 struct tree_decl_minimal
GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal
;
3706 struct tree_decl_common
GTY ((tag ("TS_DECL_COMMON"))) decl_common
;
3707 struct tree_decl_with_rtl
GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl
;
3708 struct tree_decl_non_common
GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common
;
3709 struct tree_parm_decl
GTY ((tag ("TS_PARM_DECL"))) parm_decl
;
3710 struct tree_decl_with_vis
GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis
;
3711 struct tree_var_decl
GTY ((tag ("TS_VAR_DECL"))) var_decl
;
3712 struct tree_field_decl
GTY ((tag ("TS_FIELD_DECL"))) field_decl
;
3713 struct tree_label_decl
GTY ((tag ("TS_LABEL_DECL"))) label_decl
;
3714 struct tree_result_decl
GTY ((tag ("TS_RESULT_DECL"))) result_decl
;
3715 struct tree_const_decl
GTY ((tag ("TS_CONST_DECL"))) const_decl
;
3716 struct tree_type_decl
GTY ((tag ("TS_TYPE_DECL"))) type_decl
;
3717 struct tree_function_decl
GTY ((tag ("TS_FUNCTION_DECL"))) function_decl
;
3718 struct tree_translation_unit_decl
GTY ((tag ("TS_TRANSLATION_UNIT_DECL")))
3719 translation_unit_decl
;
3720 struct tree_type_common
GTY ((tag ("TS_TYPE_COMMON"))) type_common
;
3721 struct tree_type_with_lang_specific
GTY ((tag ("TS_TYPE_WITH_LANG_SPECIFIC")))
3722 type_with_lang_specific
;
3723 struct tree_type_non_common
GTY ((tag ("TS_TYPE_NON_COMMON")))
3725 struct tree_list
GTY ((tag ("TS_LIST"))) list
;
3726 struct tree_vec
GTY ((tag ("TS_VEC"))) vec
;
3727 struct tree_exp
GTY ((tag ("TS_EXP"))) exp
;
3728 struct tree_ssa_name
GTY ((tag ("TS_SSA_NAME"))) ssa_name
;
3729 struct tree_block
GTY ((tag ("TS_BLOCK"))) block
;
3730 struct tree_binfo
GTY ((tag ("TS_BINFO"))) binfo
;
3731 struct tree_statement_list
GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list
;
3732 struct tree_constructor
GTY ((tag ("TS_CONSTRUCTOR"))) constructor
;
3733 struct tree_omp_clause
GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause
;
3734 struct tree_optimization_option
GTY ((tag ("TS_OPTIMIZATION"))) optimization
;
3735 struct tree_target_option
GTY ((tag ("TS_TARGET_OPTION"))) target_option
;
3738 /* Standard named or nameless data types of the C compiler. */
3761 TI_INTEGER_MINUS_ONE
,
3778 TI_COMPLEX_INTEGER_TYPE
,
3779 TI_COMPLEX_FLOAT_TYPE
,
3780 TI_COMPLEX_DOUBLE_TYPE
,
3781 TI_COMPLEX_LONG_DOUBLE_TYPE
,
3785 TI_LONG_DOUBLE_TYPE
,
3789 TI_LONG_DOUBLE_PTR_TYPE
,
3790 TI_INTEGER_PTR_TYPE
,
3799 TI_VA_LIST_GPR_COUNTER_FIELD
,
3800 TI_VA_LIST_FPR_COUNTER_FIELD
,
3807 TI_DFLOAT32_PTR_TYPE
,
3808 TI_DFLOAT64_PTR_TYPE
,
3809 TI_DFLOAT128_PTR_TYPE
,
3818 TI_SAT_LLFRACT_TYPE
,
3819 TI_SAT_USFRACT_TYPE
,
3821 TI_SAT_ULFRACT_TYPE
,
3822 TI_SAT_ULLFRACT_TYPE
,
3834 TI_SAT_LLACCUM_TYPE
,
3835 TI_SAT_USACCUM_TYPE
,
3837 TI_SAT_ULACCUM_TYPE
,
3838 TI_SAT_ULLACCUM_TYPE
,
3884 TI_OPTIMIZATION_DEFAULT
,
3885 TI_OPTIMIZATION_CURRENT
,
3886 TI_TARGET_OPTION_DEFAULT
,
3887 TI_TARGET_OPTION_CURRENT
,
3888 TI_CURRENT_TARGET_PRAGMA
,
3889 TI_CURRENT_OPTIMIZE_PRAGMA
,
3894 extern GTY(()) tree global_trees
[TI_MAX
];
3896 #define error_mark_node global_trees[TI_ERROR_MARK]
3898 #define intQI_type_node global_trees[TI_INTQI_TYPE]
3899 #define intHI_type_node global_trees[TI_INTHI_TYPE]
3900 #define intSI_type_node global_trees[TI_INTSI_TYPE]
3901 #define intDI_type_node global_trees[TI_INTDI_TYPE]
3902 #define intTI_type_node global_trees[TI_INTTI_TYPE]
3904 #define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3905 #define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3906 #define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3907 #define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3908 #define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3910 #define uint32_type_node global_trees[TI_UINT32_TYPE]
3911 #define uint64_type_node global_trees[TI_UINT64_TYPE]
3913 #define integer_zero_node global_trees[TI_INTEGER_ZERO]
3914 #define integer_one_node global_trees[TI_INTEGER_ONE]
3915 #define integer_three_node global_trees[TI_INTEGER_THREE]
3916 #define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
3917 #define size_zero_node global_trees[TI_SIZE_ZERO]
3918 #define size_one_node global_trees[TI_SIZE_ONE]
3919 #define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3920 #define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3921 #define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3923 /* Base access nodes. */
3924 #define access_public_node global_trees[TI_PUBLIC]
3925 #define access_protected_node global_trees[TI_PROTECTED]
3926 #define access_private_node global_trees[TI_PRIVATE]
3928 #define null_pointer_node global_trees[TI_NULL_POINTER]
3930 #define float_type_node global_trees[TI_FLOAT_TYPE]
3931 #define double_type_node global_trees[TI_DOUBLE_TYPE]
3932 #define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3934 #define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3935 #define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3936 #define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3937 #define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3939 #define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3940 #define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3941 #define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3942 #define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3944 #define void_type_node global_trees[TI_VOID_TYPE]
3945 /* The C type `void *'. */
3946 #define ptr_type_node global_trees[TI_PTR_TYPE]
3947 /* The C type `const void *'. */
3948 #define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
3949 /* The C type `size_t'. */
3950 #define size_type_node global_trees[TI_SIZE_TYPE]
3951 #define pid_type_node global_trees[TI_PID_TYPE]
3952 #define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3953 #define va_list_type_node global_trees[TI_VA_LIST_TYPE]
3954 #define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3955 #define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
3956 /* The C type `FILE *'. */
3957 #define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
3959 #define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3960 #define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3961 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3963 /* The decimal floating point types. */
3964 #define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3965 #define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3966 #define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3967 #define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3968 #define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3969 #define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3971 /* The fixed-point types. */
3972 #define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3973 #define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3974 #define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3975 #define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3976 #define sat_unsigned_short_fract_type_node \
3977 global_trees[TI_SAT_USFRACT_TYPE]
3978 #define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3979 #define sat_unsigned_long_fract_type_node \
3980 global_trees[TI_SAT_ULFRACT_TYPE]
3981 #define sat_unsigned_long_long_fract_type_node \
3982 global_trees[TI_SAT_ULLFRACT_TYPE]
3983 #define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3984 #define fract_type_node global_trees[TI_FRACT_TYPE]
3985 #define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3986 #define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3987 #define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3988 #define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3989 #define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3990 #define unsigned_long_long_fract_type_node \
3991 global_trees[TI_ULLFRACT_TYPE]
3992 #define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3993 #define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3994 #define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3995 #define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3996 #define sat_unsigned_short_accum_type_node \
3997 global_trees[TI_SAT_USACCUM_TYPE]
3998 #define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3999 #define sat_unsigned_long_accum_type_node \
4000 global_trees[TI_SAT_ULACCUM_TYPE]
4001 #define sat_unsigned_long_long_accum_type_node \
4002 global_trees[TI_SAT_ULLACCUM_TYPE]
4003 #define short_accum_type_node global_trees[TI_SACCUM_TYPE]
4004 #define accum_type_node global_trees[TI_ACCUM_TYPE]
4005 #define long_accum_type_node global_trees[TI_LACCUM_TYPE]
4006 #define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
4007 #define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
4008 #define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
4009 #define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
4010 #define unsigned_long_long_accum_type_node \
4011 global_trees[TI_ULLACCUM_TYPE]
4012 #define qq_type_node global_trees[TI_QQ_TYPE]
4013 #define hq_type_node global_trees[TI_HQ_TYPE]
4014 #define sq_type_node global_trees[TI_SQ_TYPE]
4015 #define dq_type_node global_trees[TI_DQ_TYPE]
4016 #define tq_type_node global_trees[TI_TQ_TYPE]
4017 #define uqq_type_node global_trees[TI_UQQ_TYPE]
4018 #define uhq_type_node global_trees[TI_UHQ_TYPE]
4019 #define usq_type_node global_trees[TI_USQ_TYPE]
4020 #define udq_type_node global_trees[TI_UDQ_TYPE]
4021 #define utq_type_node global_trees[TI_UTQ_TYPE]
4022 #define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
4023 #define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
4024 #define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
4025 #define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
4026 #define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
4027 #define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
4028 #define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
4029 #define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
4030 #define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
4031 #define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
4032 #define ha_type_node global_trees[TI_HA_TYPE]
4033 #define sa_type_node global_trees[TI_SA_TYPE]
4034 #define da_type_node global_trees[TI_DA_TYPE]
4035 #define ta_type_node global_trees[TI_TA_TYPE]
4036 #define uha_type_node global_trees[TI_UHA_TYPE]
4037 #define usa_type_node global_trees[TI_USA_TYPE]
4038 #define uda_type_node global_trees[TI_UDA_TYPE]
4039 #define uta_type_node global_trees[TI_UTA_TYPE]
4040 #define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
4041 #define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
4042 #define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
4043 #define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
4044 #define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
4045 #define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
4046 #define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
4047 #define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
4049 /* The node that should be placed at the end of a parameter list to
4050 indicate that the function does not take a variable number of
4051 arguments. The TREE_VALUE will be void_type_node and there will be
4052 no TREE_CHAIN. Language-independent code should not assume
4053 anything else about this node. */
4054 #define void_list_node global_trees[TI_VOID_LIST_NODE]
4056 #define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
4057 #define MAIN_NAME_P(NODE) \
4058 (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
4060 /* Optimization options (OPTIMIZATION_NODE) to use for default and current
4062 #define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
4063 #define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
4065 /* Default/current target options (TARGET_OPTION_NODE). */
4066 #define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
4067 #define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
4069 /* Default tree list option(), optimize() pragmas to be linked into the
4071 #define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
4072 #define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
4074 /* An enumeration of the standard C integer types. These must be
4075 ordered so that shorter types appear before longer ones, and so
4076 that signed types appear before unsigned ones, for the correct
4077 functioning of interpret_integer() in c-lex.c. */
4078 enum integer_type_kind
4090 itk_unsigned_long_long
,
4092 itk_unsigned_int128
,
4096 typedef enum integer_type_kind integer_type_kind
;
4098 /* The standard C integer types. Use integer_type_kind to index into
4100 extern GTY(()) tree integer_types
[itk_none
];
4102 #define char_type_node integer_types[itk_char]
4103 #define signed_char_type_node integer_types[itk_signed_char]
4104 #define unsigned_char_type_node integer_types[itk_unsigned_char]
4105 #define short_integer_type_node integer_types[itk_short]
4106 #define short_unsigned_type_node integer_types[itk_unsigned_short]
4107 #define integer_type_node integer_types[itk_int]
4108 #define unsigned_type_node integer_types[itk_unsigned_int]
4109 #define long_integer_type_node integer_types[itk_long]
4110 #define long_unsigned_type_node integer_types[itk_unsigned_long]
4111 #define long_long_integer_type_node integer_types[itk_long_long]
4112 #define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
4113 #define int128_integer_type_node integer_types[itk_int128]
4114 #define int128_unsigned_type_node integer_types[itk_unsigned_int128]
4116 /* A pointer-to-function member type looks like:
4123 If __pfn is NULL, it is a NULL pointer-to-member-function.
4125 (Because the vtable is always the first thing in the object, we
4126 don't need its offset.) If the function is virtual, then PFN is
4127 one plus twice the index into the vtable; otherwise, it is just a
4128 pointer to the function.
4130 Unfortunately, using the lowest bit of PFN doesn't work in
4131 architectures that don't impose alignment requirements on function
4132 addresses, or that use the lowest bit to tell one ISA from another,
4133 for example. For such architectures, we use the lowest bit of
4134 DELTA instead of the lowest bit of the PFN, and DELTA will be
4137 enum ptrmemfunc_vbit_where_t
4139 ptrmemfunc_vbit_in_pfn
,
4140 ptrmemfunc_vbit_in_delta
4143 #define NULL_TREE (tree) NULL
4145 /* True if NODE is an erroneous expression. */
4147 #define error_operand_p(NODE) \
4148 ((NODE) == error_mark_node \
4149 || ((NODE) && TREE_TYPE ((NODE)) == error_mark_node))
4151 extern tree
decl_assembler_name (tree
);
4152 extern bool decl_assembler_name_equal (tree decl
, const_tree asmname
);
4153 extern hashval_t
decl_assembler_name_hash (const_tree asmname
);
4155 /* Compute the number of bytes occupied by 'node'. This routine only
4156 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
4158 extern size_t tree_size (const_tree
);
4160 /* Compute the number of bytes occupied by a tree with code CODE. This
4161 function cannot be used for TREE_VEC codes, which are of variable
4163 extern size_t tree_code_size (enum tree_code
);
4165 /* Allocate and return a new UID from the DECL_UID namespace. */
4166 extern int allocate_decl_uid (void);
4168 /* Lowest level primitive for allocating a node.
4169 The TREE_CODE is the only argument. Contents are initialized
4170 to zero except for a few of the common fields. */
4172 extern tree
make_node_stat (enum tree_code MEM_STAT_DECL
);
4173 #define make_node(t) make_node_stat (t MEM_STAT_INFO)
4175 /* Make a copy of a node, with all the same contents. */
4177 extern tree
copy_node_stat (tree MEM_STAT_DECL
);
4178 #define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
4180 /* Make a copy of a chain of TREE_LIST nodes. */
4182 extern tree
copy_list (tree
);
4184 /* Make a CASE_LABEL_EXPR. */
4186 extern tree
build_case_label (tree
, tree
, tree
);
4189 extern tree
make_tree_binfo_stat (unsigned MEM_STAT_DECL
);
4190 #define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
4192 /* Make a TREE_VEC. */
4194 extern tree
make_tree_vec_stat (int MEM_STAT_DECL
);
4195 #define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
4197 /* Return the (unique) IDENTIFIER_NODE node for a given name.
4198 The name is supplied as a char *. */
4200 extern tree
get_identifier (const char *);
4202 #if GCC_VERSION >= 3000
4203 #define get_identifier(str) \
4204 (__builtin_constant_p (str) \
4205 ? get_identifier_with_length ((str), strlen (str)) \
4206 : get_identifier (str))
4210 /* Identical to get_identifier, except that the length is assumed
4213 extern tree
get_identifier_with_length (const char *, size_t);
4215 /* If an identifier with the name TEXT (a null-terminated string) has
4216 previously been referred to, return that node; otherwise return
4219 extern tree
maybe_get_identifier (const char *);
4221 /* Construct various types of nodes. */
4223 extern tree
build_nt (enum tree_code
, ...);
4224 extern tree
build_nt_call_vec (tree
, VEC(tree
,gc
) *);
4226 extern tree
build0_stat (enum tree_code
, tree MEM_STAT_DECL
);
4227 #define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
4228 extern tree
build1_stat (enum tree_code
, tree
, tree MEM_STAT_DECL
);
4229 #define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
4230 extern tree
build2_stat (enum tree_code
, tree
, tree
, tree MEM_STAT_DECL
);
4231 #define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
4232 extern tree
build3_stat (enum tree_code
, tree
, tree
, tree
, tree MEM_STAT_DECL
);
4233 #define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
4234 extern tree
build4_stat (enum tree_code
, tree
, tree
, tree
, tree
,
4235 tree MEM_STAT_DECL
);
4236 #define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4237 extern tree
build5_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4238 tree MEM_STAT_DECL
);
4239 #define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4240 extern tree
build6_stat (enum tree_code
, tree
, tree
, tree
, tree
, tree
,
4241 tree
, tree MEM_STAT_DECL
);
4242 #define build6(c,t1,t2,t3,t4,t5,t6,t7) \
4243 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4245 /* _loc versions of build[1-6]. */
4248 build1_stat_loc (location_t loc
, enum tree_code code
, tree type
,
4249 tree arg1 MEM_STAT_DECL
)
4251 tree t
= build1_stat (code
, type
, arg1 PASS_MEM_STAT
);
4252 if (CAN_HAVE_LOCATION_P (t
))
4253 SET_EXPR_LOCATION (t
, loc
);
4256 #define build1_loc(l,c,t1,t2) build1_stat_loc (l,c,t1,t2 MEM_STAT_INFO)
4259 build2_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4260 tree arg1 MEM_STAT_DECL
)
4262 tree t
= build2_stat (code
, type
, arg0
, arg1 PASS_MEM_STAT
);
4263 if (CAN_HAVE_LOCATION_P (t
))
4264 SET_EXPR_LOCATION (t
, loc
);
4267 #define build2_loc(l,c,t1,t2,t3) build2_stat_loc (l,c,t1,t2,t3 MEM_STAT_INFO)
4270 build3_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4271 tree arg1
, tree arg2 MEM_STAT_DECL
)
4273 tree t
= build3_stat (code
, type
, arg0
, arg1
, arg2 PASS_MEM_STAT
);
4274 if (CAN_HAVE_LOCATION_P (t
))
4275 SET_EXPR_LOCATION (t
, loc
);
4278 #define build3_loc(l,c,t1,t2,t3,t4) \
4279 build3_stat_loc (l,c,t1,t2,t3,t4 MEM_STAT_INFO)
4282 build4_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4283 tree arg1
, tree arg2
, tree arg3 MEM_STAT_DECL
)
4285 tree t
= build4_stat (code
, type
, arg0
, arg1
, arg2
, arg3 PASS_MEM_STAT
);
4286 if (CAN_HAVE_LOCATION_P (t
))
4287 SET_EXPR_LOCATION (t
, loc
);
4290 #define build4_loc(l,c,t1,t2,t3,t4,t5) \
4291 build4_stat_loc (l,c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
4294 build5_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4295 tree arg1
, tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4297 tree t
= build5_stat (code
, type
, arg0
, arg1
, arg2
, arg3
,
4298 arg4 PASS_MEM_STAT
);
4299 if (CAN_HAVE_LOCATION_P (t
))
4300 SET_EXPR_LOCATION (t
, loc
);
4303 #define build5_loc(l,c,t1,t2,t3,t4,t5,t6) \
4304 build5_stat_loc (l,c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
4307 build6_stat_loc (location_t loc
, enum tree_code code
, tree type
, tree arg0
,
4308 tree arg1
, tree arg2
, tree arg3
, tree arg4
,
4309 tree arg5 MEM_STAT_DECL
)
4311 tree t
= build6_stat (code
, type
, arg0
, arg1
, arg2
, arg3
, arg4
,
4312 arg5 PASS_MEM_STAT
);
4313 if (CAN_HAVE_LOCATION_P (t
))
4314 SET_EXPR_LOCATION (t
, loc
);
4317 #define build6_loc(l,c,t1,t2,t3,t4,t5,t6,t7) \
4318 build6_stat_loc (l,c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4320 extern tree
build_var_debug_value_stat (tree
, tree MEM_STAT_DECL
);
4321 #define build_var_debug_value(t1,t2) \
4322 build_var_debug_value_stat (t1,t2 MEM_STAT_INFO)
4324 /* Constructs double_int from tree CST. */
4326 static inline double_int
4327 tree_to_double_int (const_tree cst
)
4329 return TREE_INT_CST (cst
);
4332 extern tree
double_int_to_tree (tree
, double_int
);
4333 extern bool double_int_fits_to_tree_p (const_tree
, double_int
);
4334 extern tree
force_fit_type_double (tree
, double_int
, int, bool);
4336 /* Create an INT_CST node with a CST value zero extended. */
4339 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
4341 return double_int_to_tree (type
, uhwi_to_double_int (cst
));
4344 extern tree
build_int_cst (tree
, HOST_WIDE_INT
);
4345 extern tree
build_int_cst_type (tree
, HOST_WIDE_INT
);
4346 extern tree
build_int_cst_wide (tree
, unsigned HOST_WIDE_INT
, HOST_WIDE_INT
);
4347 extern tree
build_vector (tree
, tree
);
4348 extern tree
build_vector_from_ctor (tree
, VEC(constructor_elt
,gc
) *);
4349 extern tree
build_vector_from_val (tree
, tree
);
4350 extern tree
build_constructor (tree
, VEC(constructor_elt
,gc
) *);
4351 extern tree
build_constructor_single (tree
, tree
, tree
);
4352 extern tree
build_constructor_from_list (tree
, tree
);
4353 extern tree
build_real_from_int_cst (tree
, const_tree
);
4354 extern tree
build_complex (tree
, tree
, tree
);
4355 extern tree
build_one_cst (tree
);
4356 extern tree
build_zero_cst (tree
);
4357 extern tree
build_string (int, const char *);
4358 extern tree
build_tree_list_stat (tree
, tree MEM_STAT_DECL
);
4359 #define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
4360 extern tree
build_tree_list_vec_stat (const VEC(tree
,gc
) * MEM_STAT_DECL
);
4361 #define build_tree_list_vec(v) build_tree_list_vec_stat (v MEM_STAT_INFO)
4362 extern tree
build_decl_stat (location_t
, enum tree_code
,
4363 tree
, tree MEM_STAT_DECL
);
4364 extern tree
build_fn_decl (const char *, tree
);
4365 #define build_decl(l,c,t,q) build_decl_stat (l,c,t,q MEM_STAT_INFO)
4366 extern tree
build_translation_unit_decl (tree
);
4367 extern tree
build_block (tree
, tree
, tree
, tree
);
4368 extern tree
build_empty_stmt (location_t
);
4369 extern tree
build_omp_clause (location_t
, enum omp_clause_code
);
4371 extern tree
build_vl_exp_stat (enum tree_code
, int MEM_STAT_DECL
);
4372 #define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
4374 extern tree
build_call_nary (tree
, tree
, int, ...);
4375 extern tree
build_call_valist (tree
, tree
, int, va_list);
4376 #define build_call_array(T1,T2,N,T3)\
4377 build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T3)
4378 extern tree
build_call_array_loc (location_t
, tree
, tree
, int, const tree
*);
4379 extern tree
build_call_vec (tree
, tree
, VEC(tree
,gc
) *);
4381 /* Construct various nodes representing data types. */
4383 extern tree
make_signed_type (int);
4384 extern tree
make_unsigned_type (int);
4385 extern tree
signed_or_unsigned_type_for (int, tree
);
4386 extern tree
signed_type_for (tree
);
4387 extern tree
unsigned_type_for (tree
);
4388 extern void initialize_sizetypes (void);
4389 extern void fixup_unsigned_type (tree
);
4390 extern tree
build_pointer_type_for_mode (tree
, enum machine_mode
, bool);
4391 extern tree
build_pointer_type (tree
);
4392 extern tree
build_reference_type_for_mode (tree
, enum machine_mode
, bool);
4393 extern tree
build_reference_type (tree
);
4394 extern tree
build_vector_type_for_mode (tree
, enum machine_mode
);
4395 extern tree
build_vector_type (tree innertype
, int nunits
);
4396 extern tree
build_opaque_vector_type (tree innertype
, int nunits
);
4397 extern tree
build_type_no_quals (tree
);
4398 extern tree
build_index_type (tree
);
4399 extern tree
build_array_type (tree
, tree
);
4400 extern tree
build_nonshared_array_type (tree
, tree
);
4401 extern tree
build_array_type_nelts (tree
, unsigned HOST_WIDE_INT
);
4402 extern tree
build_function_type (tree
, tree
);
4403 extern tree
build_function_type_list (tree
, ...);
4404 extern tree
build_function_type_skip_args (tree
, bitmap
);
4405 extern tree
build_function_decl_skip_args (tree
, bitmap
);
4406 extern tree
build_varargs_function_type_list (tree
, ...);
4407 extern tree
build_function_type_array (tree
, int, tree
*);
4408 extern tree
build_varargs_function_type_array (tree
, int, tree
*);
4409 #define build_function_type_vec(RET, V) \
4410 build_function_type_array (RET, VEC_length (tree, V), VEC_address (tree, V))
4411 #define build_varargs_function_type_vec(RET, V) \
4412 build_varargs_function_type_array (RET, VEC_length (tree, V), \
4413 VEC_address (tree, V))
4414 extern tree
build_method_type_directly (tree
, tree
, tree
);
4415 extern tree
build_method_type (tree
, tree
);
4416 extern tree
build_offset_type (tree
, tree
);
4417 extern tree
build_complex_type (tree
);
4418 extern tree
array_type_nelts (const_tree
);
4419 extern bool in_array_bounds_p (tree
);
4420 extern bool range_in_array_bounds_p (tree
);
4422 extern tree
value_member (tree
, tree
);
4423 extern tree
purpose_member (const_tree
, tree
);
4424 extern bool vec_member (const_tree
, VEC(tree
,gc
) *);
4425 extern tree
chain_index (int, tree
);
4427 extern int attribute_list_equal (const_tree
, const_tree
);
4428 extern int attribute_list_contained (const_tree
, const_tree
);
4429 extern int tree_int_cst_equal (const_tree
, const_tree
);
4430 extern int tree_int_cst_lt (const_tree
, const_tree
);
4431 extern int tree_int_cst_compare (const_tree
, const_tree
);
4432 extern int host_integerp (const_tree
, int)
4433 #ifndef ENABLE_TREE_CHECKING
4434 ATTRIBUTE_PURE
/* host_integerp is pure only when checking is disabled. */
4437 extern HOST_WIDE_INT
tree_low_cst (const_tree
, int);
4438 #if !defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 4003)
4439 extern inline __attribute__ ((__gnu_inline__
)) HOST_WIDE_INT
4440 tree_low_cst (const_tree t
, int pos
)
4442 gcc_assert (host_integerp (t
, pos
));
4443 return TREE_INT_CST_LOW (t
);
4446 extern int tree_int_cst_sgn (const_tree
);
4447 extern int tree_int_cst_sign_bit (const_tree
);
4448 extern unsigned int tree_int_cst_min_precision (tree
, bool);
4449 extern bool tree_expr_nonnegative_p (tree
);
4450 extern bool tree_expr_nonnegative_warnv_p (tree
, bool *);
4451 extern bool may_negate_without_overflow_p (const_tree
);
4452 extern tree
strip_array_types (tree
);
4453 extern tree
excess_precision_type (tree
);
4455 /* Construct various nodes representing fract or accum data types. */
4457 extern tree
make_fract_type (int, int, int);
4458 extern tree
make_accum_type (int, int, int);
4460 #define make_signed_fract_type(P) make_fract_type (P, 0, 0)
4461 #define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
4462 #define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
4463 #define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
4464 #define make_signed_accum_type(P) make_accum_type (P, 0, 0)
4465 #define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
4466 #define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
4467 #define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
4469 #define make_or_reuse_signed_fract_type(P) \
4470 make_or_reuse_fract_type (P, 0, 0)
4471 #define make_or_reuse_unsigned_fract_type(P) \
4472 make_or_reuse_fract_type (P, 1, 0)
4473 #define make_or_reuse_sat_signed_fract_type(P) \
4474 make_or_reuse_fract_type (P, 0, 1)
4475 #define make_or_reuse_sat_unsigned_fract_type(P) \
4476 make_or_reuse_fract_type (P, 1, 1)
4477 #define make_or_reuse_signed_accum_type(P) \
4478 make_or_reuse_accum_type (P, 0, 0)
4479 #define make_or_reuse_unsigned_accum_type(P) \
4480 make_or_reuse_accum_type (P, 1, 0)
4481 #define make_or_reuse_sat_signed_accum_type(P) \
4482 make_or_reuse_accum_type (P, 0, 1)
4483 #define make_or_reuse_sat_unsigned_accum_type(P) \
4484 make_or_reuse_accum_type (P, 1, 1)
4486 /* From expmed.c. Since rtl.h is included after tree.h, we can't
4487 put the prototype here. Rtl.h does declare the prototype if
4488 tree.h had been included. */
4490 extern tree
make_tree (tree
, rtx
);
4492 /* Return a type like TTYPE except that its TYPE_ATTRIBUTES
4495 Such modified types already made are recorded so that duplicates
4498 extern tree
build_type_attribute_variant (tree
, tree
);
4499 extern tree
build_decl_attribute_variant (tree
, tree
);
4500 extern tree
build_type_attribute_qual_variant (tree
, tree
, int);
4502 /* Return 0 if the attributes for two types are incompatible, 1 if they
4503 are compatible, and 2 if they are nearly compatible (which causes a
4504 warning to be generated). */
4505 extern int comp_type_attributes (const_tree
, const_tree
);
4507 /* Structure describing an attribute and a function to handle it. */
4508 struct attribute_spec
4510 /* The name of the attribute (without any leading or trailing __),
4511 or NULL to mark the end of a table of attributes. */
4512 const char *const name
;
4513 /* The minimum length of the list of arguments of the attribute. */
4514 const int min_length
;
4515 /* The maximum length of the list of arguments of the attribute
4516 (-1 for no maximum). */
4517 const int max_length
;
4518 /* Whether this attribute requires a DECL. If it does, it will be passed
4519 from types of DECLs, function return types and array element types to
4520 the DECLs, function types and array types respectively; but when
4521 applied to a type in any other circumstances, it will be ignored with
4522 a warning. (If greater control is desired for a given attribute,
4523 this should be false, and the flags argument to the handler may be
4524 used to gain greater control in that case.) */
4525 const bool decl_required
;
4526 /* Whether this attribute requires a type. If it does, it will be passed
4527 from a DECL to the type of that DECL. */
4528 const bool type_required
;
4529 /* Whether this attribute requires a function (or method) type. If it does,
4530 it will be passed from a function pointer type to the target type,
4531 and from a function return type (which is not itself a function
4532 pointer type) to the function type. */
4533 const bool function_type_required
;
4534 /* Function to handle this attribute. NODE points to the node to which
4535 the attribute is to be applied. If a DECL, it should be modified in
4536 place; if a TYPE, a copy should be created. NAME is the name of the
4537 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4538 of the arguments (which may be NULL). FLAGS gives further information
4539 about the context of the attribute. Afterwards, the attributes will
4540 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4541 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4542 as well as in any other cases when the attributes should not be added
4543 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4544 applied to another type or DECL later may be returned;
4545 otherwise the return value should be NULL_TREE. This pointer may be
4546 NULL if no special handling is required beyond the checks implied
4547 by the rest of this structure. */
4548 tree (*const handler
) (tree
*node
, tree name
, tree args
,
4549 int flags
, bool *no_add_attrs
);
4550 /* Specifies if attribute affects type's identity. */
4551 const bool affects_type_identity
;
4554 /* Flags that may be passed in the third argument of decl_attributes, and
4555 to handler functions for attributes. */
4556 enum attribute_flags
4558 /* The type passed in is the type of a DECL, and any attributes that
4559 should be passed in again to be applied to the DECL rather than the
4560 type should be returned. */
4561 ATTR_FLAG_DECL_NEXT
= 1,
4562 /* The type passed in is a function return type, and any attributes that
4563 should be passed in again to be applied to the function type rather
4564 than the return type should be returned. */
4565 ATTR_FLAG_FUNCTION_NEXT
= 2,
4566 /* The type passed in is an array element type, and any attributes that
4567 should be passed in again to be applied to the array type rather
4568 than the element type should be returned. */
4569 ATTR_FLAG_ARRAY_NEXT
= 4,
4570 /* The type passed in is a structure, union or enumeration type being
4571 created, and should be modified in place. */
4572 ATTR_FLAG_TYPE_IN_PLACE
= 8,
4573 /* The attributes are being applied by default to a library function whose
4574 name indicates known behavior, and should be silently ignored if they
4575 are not in fact compatible with the function type. */
4576 ATTR_FLAG_BUILT_IN
= 16
4579 /* Default versions of target-overridable functions. */
4581 extern tree
merge_decl_attributes (tree
, tree
);
4582 extern tree
merge_type_attributes (tree
, tree
);
4584 /* This function is a private implementation detail of lookup_attribute()
4585 and you should never call it directly. */
4586 extern tree
private_lookup_attribute (const char *, size_t, tree
);
4588 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
4589 return a pointer to the attribute's list element if the attribute
4590 is part of the list, or NULL_TREE if not found. If the attribute
4591 appears more than once, this only returns the first occurrence; the
4592 TREE_CHAIN of the return value should be passed back in if further
4593 occurrences are wanted. ATTR_NAME must be in the form 'text' (not
4597 lookup_attribute (const char *attr_name
, tree list
)
4599 gcc_checking_assert (attr_name
[0] != '_');
4600 /* In most cases, list is NULL_TREE. */
4601 if (list
== NULL_TREE
)
4604 /* Do the strlen() before calling the out-of-line implementation.
4605 In most cases attr_name is a string constant, and the compiler
4606 will optimize the strlen() away. */
4607 return private_lookup_attribute (attr_name
, strlen (attr_name
), list
);
4610 /* This function is a private implementation detail of
4611 is_attribute_p() and you should never call it directly. */
4612 extern bool private_is_attribute_p (const char *, size_t, const_tree
);
4614 /* Given an identifier node IDENT and a string ATTR_NAME, return true
4615 if the identifier node is a valid attribute name for the string.
4616 ATTR_NAME must be in the form 'text' (not '__text__'). IDENT could
4617 be the identifier for 'text' or for '__text__'. */
4620 is_attribute_p (const char *attr_name
, const_tree ident
)
4622 gcc_checking_assert (attr_name
[0] != '_');
4623 /* Do the strlen() before calling the out-of-line implementation.
4624 In most cases attr_name is a string constant, and the compiler
4625 will optimize the strlen() away. */
4626 return private_is_attribute_p (attr_name
, strlen (attr_name
), ident
);
4629 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4630 modified list. ATTR_NAME must be in the form 'text' (not
4633 extern tree
remove_attribute (const char *, tree
);
4635 /* Given two attributes lists, return a list of their union. */
4637 extern tree
merge_attributes (tree
, tree
);
4639 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4640 /* Given two Windows decl attributes lists, possibly including
4641 dllimport, return a list of their union . */
4642 extern tree
merge_dllimport_decl_attributes (tree
, tree
);
4644 /* Handle a "dllimport" or "dllexport" attribute. */
4645 extern tree
handle_dll_attribute (tree
*, tree
, tree
, int, bool *);
4648 /* Check whether CAND is suitable to be returned from get_qualified_type
4649 (BASE, TYPE_QUALS). */
4651 extern bool check_qualified_type (const_tree
, const_tree
, int);
4653 /* Return a version of the TYPE, qualified as indicated by the
4654 TYPE_QUALS, if one exists. If no qualified version exists yet,
4655 return NULL_TREE. */
4657 extern tree
get_qualified_type (tree
, int);
4659 /* Like get_qualified_type, but creates the type if it does not
4660 exist. This function never returns NULL_TREE. */
4662 extern tree
build_qualified_type (tree
, int);
4664 /* Create a variant of type T with alignment ALIGN. */
4666 extern tree
build_aligned_type (tree
, unsigned int);
4668 /* Like build_qualified_type, but only deals with the `const' and
4669 `volatile' qualifiers. This interface is retained for backwards
4670 compatibility with the various front-ends; new code should use
4671 build_qualified_type instead. */
4673 #define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
4674 build_qualified_type ((TYPE), \
4675 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4676 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
4678 /* Make a copy of a type node. */
4680 extern tree
build_distinct_type_copy (tree
);
4681 extern tree
build_variant_type_copy (tree
);
4683 /* Finish up a builtin RECORD_TYPE. Give it a name and provide its
4684 fields. Optionally specify an alignment, and then lay it out. */
4686 extern void finish_builtin_struct (tree
, const char *,
4689 /* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
4690 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4691 node, does nothing except for the first time. */
4693 extern void layout_type (tree
);
4695 /* These functions allow a front-end to perform a manual layout of a
4696 RECORD_TYPE. (For instance, if the placement of subsequent fields
4697 depends on the placement of fields so far.) Begin by calling
4698 start_record_layout. Then, call place_field for each of the
4699 fields. Then, call finish_record_layout. See layout_type for the
4700 default way in which these functions are used. */
4702 typedef struct record_layout_info_s
4704 /* The RECORD_TYPE that we are laying out. */
4706 /* The offset into the record so far, in bytes, not including bits in
4709 /* The last known alignment of SIZE. */
4710 unsigned int offset_align
;
4711 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4713 /* The alignment of the record so far, in bits. */
4714 unsigned int record_align
;
4715 /* The alignment of the record so far, ignoring #pragma pack and
4716 __attribute__ ((packed)), in bits. */
4717 unsigned int unpacked_align
;
4718 /* The previous field layed out. */
4720 /* The static variables (i.e., class variables, as opposed to
4721 instance variables) encountered in T. */
4722 VEC(tree
,gc
) *pending_statics
;
4723 /* Bits remaining in the current alignment group */
4724 int remaining_in_alignment
;
4725 /* True if we've seen a packed field that didn't have normal
4726 alignment anyway. */
4727 int packed_maybe_necessary
;
4728 } *record_layout_info
;
4730 extern record_layout_info
start_record_layout (tree
);
4731 extern tree
bit_from_pos (tree
, tree
);
4732 extern tree
byte_from_pos (tree
, tree
);
4733 extern void pos_from_bit (tree
*, tree
*, unsigned int, tree
);
4734 extern void normalize_offset (tree
*, tree
*, unsigned int);
4735 extern tree
rli_size_unit_so_far (record_layout_info
);
4736 extern tree
rli_size_so_far (record_layout_info
);
4737 extern void normalize_rli (record_layout_info
);
4738 extern void place_field (record_layout_info
, tree
);
4739 extern void compute_record_mode (tree
);
4740 extern void finish_record_layout (record_layout_info
, int);
4742 /* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4743 return a canonicalized ..._TYPE node, so that duplicates are not made.
4744 How the hash code is computed is up to the caller, as long as any two
4745 callers that could hash identical-looking type nodes agree. */
4747 extern tree
type_hash_canon (unsigned int, tree
);
4749 /* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4750 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4751 fields. Call this only once for any given decl node.
4753 Second argument is the boundary that this field can be assumed to
4754 be starting at (in bits). Zero means it can be assumed aligned
4755 on any boundary that may be needed. */
4757 extern void layout_decl (tree
, unsigned);
4759 /* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4760 a previous call to layout_decl and calls it again. */
4762 extern void relayout_decl (tree
);
4764 /* Return the mode for data of a given size SIZE and mode class CLASS.
4765 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4766 The value is BLKmode if no other mode is found. This is like
4767 mode_for_size, but is passed a tree. */
4769 extern enum machine_mode
mode_for_size_tree (const_tree
, enum mode_class
, int);
4771 /* Return an expr equal to X but certainly not valid as an lvalue. */
4773 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
4774 extern tree
non_lvalue_loc (location_t
, tree
);
4776 extern tree
convert (tree
, tree
);
4777 extern unsigned int expr_align (const_tree
);
4778 extern tree
expr_first (tree
);
4779 extern tree
expr_last (tree
);
4780 extern tree
size_in_bytes (const_tree
);
4781 extern HOST_WIDE_INT
int_size_in_bytes (const_tree
);
4782 extern HOST_WIDE_INT
max_int_size_in_bytes (const_tree
);
4783 extern tree
tree_expr_size (const_tree
);
4784 extern tree
bit_position (const_tree
);
4785 extern HOST_WIDE_INT
int_bit_position (const_tree
);
4786 extern tree
byte_position (const_tree
);
4787 extern HOST_WIDE_INT
int_byte_position (const_tree
);
4789 /* Define data structures, macros, and functions for handling sizes
4790 and the various types used to represent sizes. */
4794 SIZETYPE
, /* Normal representation of sizes in bytes. */
4795 SSIZETYPE
, /* Signed representation of sizes in bytes. */
4796 BITSIZETYPE
, /* Normal representation of sizes in bits. */
4797 SBITSIZETYPE
, /* Signed representation of sizes in bits. */
4800 extern GTY(()) tree sizetype_tab
[(int) TYPE_KIND_LAST
];
4802 #define sizetype sizetype_tab[(int) SIZETYPE]
4803 #define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4804 #define ssizetype sizetype_tab[(int) SSIZETYPE]
4805 #define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
4807 extern tree
size_int_kind (HOST_WIDE_INT
, enum size_type_kind
);
4808 #define size_binop(CODE,T1,T2)\
4809 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
4810 extern tree
size_binop_loc (location_t
, enum tree_code
, tree
, tree
);
4811 #define size_diffop(T1,T2)\
4812 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
4813 extern tree
size_diffop_loc (location_t
, tree
, tree
);
4815 #define size_int(L) size_int_kind (L, SIZETYPE)
4816 #define ssize_int(L) size_int_kind (L, SSIZETYPE)
4817 #define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4818 #define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
4820 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
4821 extern tree
round_up_loc (location_t
, tree
, int);
4822 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
4823 extern tree
round_down_loc (location_t
, tree
, int);
4824 extern void finalize_size_functions (void);
4826 /* Type for sizes of data-type. */
4828 #define BITS_PER_UNIT_LOG \
4829 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4830 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4831 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4833 /* If nonzero, an upper limit on alignment of structure fields, in bits, */
4834 extern unsigned int maximum_field_alignment
;
4836 /* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4837 by making the last node in X point to Y.
4838 Returns X, except if X is 0 returns Y. */
4840 extern tree
chainon (tree
, tree
);
4842 /* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4844 extern tree
tree_cons_stat (tree
, tree
, tree MEM_STAT_DECL
);
4845 #define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
4847 /* Return the last tree node in a chain. */
4849 extern tree
tree_last (tree
);
4851 /* Reverse the order of elements in a chain, and return the new head. */
4853 extern tree
nreverse (tree
);
4855 /* Returns the length of a chain of nodes
4856 (number of chain pointers to follow before reaching a null pointer). */
4858 extern int list_length (const_tree
);
4860 /* Returns the number of FIELD_DECLs in a type. */
4862 extern int fields_length (const_tree
);
4864 /* Returns the first FIELD_DECL in a type. */
4866 extern tree
first_field (const_tree
);
4868 /* Given an initializer INIT, return TRUE if INIT is zero or some
4869 aggregate of zeros. Otherwise return FALSE. */
4871 extern bool initializer_zerop (const_tree
);
4873 /* Given a CONSTRUCTOR CTOR, return the element values as a vector. */
4875 extern VEC(tree
,gc
) *ctor_to_vec (tree
);
4877 extern bool categorize_ctor_elements (const_tree
, HOST_WIDE_INT
*,
4878 HOST_WIDE_INT
*, bool *);
4880 extern bool complete_ctor_at_level_p (const_tree
, HOST_WIDE_INT
, const_tree
);
4882 /* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
4884 extern int integer_zerop (const_tree
);
4886 /* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
4888 extern int integer_onep (const_tree
);
4890 /* integer_all_onesp (tree x) is nonzero if X is an integer constant
4891 all of whose significant bits are 1. */
4893 extern int integer_all_onesp (const_tree
);
4895 /* integer_pow2p (tree x) is nonzero is X is an integer constant with
4896 exactly one bit 1. */
4898 extern int integer_pow2p (const_tree
);
4900 /* integer_nonzerop (tree x) is nonzero if X is an integer constant
4901 with a nonzero value. */
4903 extern int integer_nonzerop (const_tree
);
4905 extern bool cst_and_fits_in_hwi (const_tree
);
4906 extern tree
num_ending_zeros (const_tree
);
4908 /* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4911 extern int fixed_zerop (const_tree
);
4913 /* staticp (tree x) is nonzero if X is a reference to data allocated
4914 at a fixed address in memory. Returns the outermost data. */
4916 extern tree
staticp (tree
);
4918 /* save_expr (EXP) returns an expression equivalent to EXP
4919 but it can be used multiple times within context CTX
4920 and only evaluate EXP once. */
4922 extern tree
save_expr (tree
);
4924 /* Look inside EXPR and into any simple arithmetic operations. Return
4925 the innermost non-arithmetic node. */
4927 extern tree
skip_simple_arithmetic (tree
);
4929 /* Return which tree structure is used by T. */
4931 enum tree_node_structure_enum
tree_node_structure (const_tree
);
4933 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4934 size or offset that depends on a field within a record. */
4936 extern bool contains_placeholder_p (const_tree
);
4938 /* This macro calls the above function but short-circuits the common
4939 case of a constant to save time. Also check for null. */
4941 #define CONTAINS_PLACEHOLDER_P(EXP) \
4942 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4944 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4945 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4948 extern bool type_contains_placeholder_p (tree
);
4950 /* Given a tree EXP, find all occurences of references to fields
4951 in a PLACEHOLDER_EXPR and place them in vector REFS without
4952 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4953 we assume here that EXP contains only arithmetic expressions
4954 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4957 extern void find_placeholder_in_expr (tree
, VEC (tree
, heap
) **);
4959 /* This macro calls the above function but short-circuits the common
4960 case of a constant to save time and also checks for NULL. */
4962 #define FIND_PLACEHOLDER_IN_EXPR(EXP, V) \
4964 if((EXP) && !TREE_CONSTANT (EXP)) \
4965 find_placeholder_in_expr (EXP, V); \
4968 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4969 return a tree with all occurrences of references to F in a
4970 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4971 CONST_DECLs. Note that we assume here that EXP contains only
4972 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4973 occurring only in their argument list. */
4975 extern tree
substitute_in_expr (tree
, tree
, tree
);
4977 /* This macro calls the above function but short-circuits the common
4978 case of a constant to save time and also checks for NULL. */
4980 #define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4981 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4983 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4984 for it within OBJ, a tree that is an object or a chain of references. */
4986 extern tree
substitute_placeholder_in_expr (tree
, tree
);
4988 /* This macro calls the above function but short-circuits the common
4989 case of a constant to save time and also checks for NULL. */
4991 #define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4992 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4993 : substitute_placeholder_in_expr (EXP, OBJ))
4995 /* variable_size (EXP) is like save_expr (EXP) except that it
4996 is for the special case of something that is part of a
4997 variable size for a data type. It makes special arrangements
4998 to compute the value at the right time when the data type
4999 belongs to a function parameter. */
5001 extern tree
variable_size (tree
);
5003 /* stabilize_reference (EXP) returns a reference equivalent to EXP
5004 but it can be used multiple times
5005 and only evaluate the subexpressions once. */
5007 extern tree
stabilize_reference (tree
);
5009 /* Subroutine of stabilize_reference; this is called for subtrees of
5010 references. Any expression with side-effects must be put in a SAVE_EXPR
5011 to ensure that it is only evaluated once. */
5013 extern tree
stabilize_reference_1 (tree
);
5015 /* Return EXP, stripped of any conversions to wider types
5016 in such a way that the result of converting to type FOR_TYPE
5017 is the same as if EXP were converted to FOR_TYPE.
5018 If FOR_TYPE is 0, it signifies EXP's type. */
5020 extern tree
get_unwidened (tree
, tree
);
5022 /* Return OP or a simpler expression for a narrower value
5023 which can be sign-extended or zero-extended to give back OP.
5024 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5025 or 0 if the value should be sign-extended. */
5027 extern tree
get_narrower (tree
, int *);
5029 /* Return true if T is an expression that get_inner_reference handles. */
5032 handled_component_p (const_tree t
)
5034 switch (TREE_CODE (t
))
5039 case ARRAY_RANGE_REF
:
5040 case VIEW_CONVERT_EXPR
:
5050 /* Given an expression EXP that is a handled_component_p,
5051 look for the ultimate containing object, which is returned and specify
5052 the access position and size. */
5054 extern tree
get_inner_reference (tree
, HOST_WIDE_INT
*, HOST_WIDE_INT
*,
5055 tree
*, enum machine_mode
*, int *, int *,
5058 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
5059 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
5060 EXP is marked as PACKED. */
5062 extern bool contains_packed_reference (const_tree exp
);
5064 /* Return a tree of sizetype representing the size, in bytes, of the element
5065 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5067 extern tree
array_ref_element_size (tree
);
5069 /* Return a tree representing the lower bound of the array mentioned in
5070 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5072 extern tree
array_ref_low_bound (tree
);
5074 /* Return a tree representing the upper bound of the array mentioned in
5075 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
5077 extern tree
array_ref_up_bound (tree
);
5079 /* Return a tree representing the offset, in bytes, of the field referenced
5080 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5082 extern tree
component_ref_field_offset (tree
);
5084 /* Given a DECL or TYPE, return the scope in which it was declared, or
5085 NUL_TREE if there is no containing scope. */
5087 extern tree
get_containing_scope (const_tree
);
5089 /* Return the FUNCTION_DECL which provides this _DECL with its context,
5091 extern tree
decl_function_context (const_tree
);
5093 /* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
5094 this _DECL with its context, or zero if none. */
5095 extern tree
decl_type_context (const_tree
);
5097 /* Return 1 if EXPR is the real constant zero. */
5098 extern int real_zerop (const_tree
);
5100 /* Declare commonly used variables for tree structure. */
5102 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
5103 Zero means allow extended lvalues. */
5105 extern int pedantic_lvalues
;
5107 /* Points to the FUNCTION_DECL of the function whose body we are reading. */
5109 extern GTY(()) tree current_function_decl
;
5111 /* Nonzero means a FUNC_BEGIN label was emitted. */
5112 extern GTY(()) const char * current_function_func_begin_label
;
5114 /* Iterator for going through the function arguments. */
5116 tree next
; /* TREE_LIST pointing to the next argument */
5117 } function_args_iterator
;
5119 /* Initialize the iterator I with arguments from function FNDECL */
5122 function_args_iter_init (function_args_iterator
*i
, const_tree fntype
)
5124 i
->next
= TYPE_ARG_TYPES (fntype
);
5127 /* Return a pointer that holds the next argument if there are more arguments to
5128 handle, otherwise return NULL. */
5130 static inline tree
*
5131 function_args_iter_cond_ptr (function_args_iterator
*i
)
5133 return (i
->next
) ? &TREE_VALUE (i
->next
) : NULL
;
5136 /* Return the next argument if there are more arguments to handle, otherwise
5140 function_args_iter_cond (function_args_iterator
*i
)
5142 return (i
->next
) ? TREE_VALUE (i
->next
) : NULL_TREE
;
5145 /* Advance to the next argument. */
5147 function_args_iter_next (function_args_iterator
*i
)
5149 gcc_assert (i
->next
!= NULL_TREE
);
5150 i
->next
= TREE_CHAIN (i
->next
);
5153 /* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
5156 inlined_function_outer_scope_p (const_tree block
)
5158 return BLOCK_SOURCE_LOCATION (block
) != UNKNOWN_LOCATION
;
5161 /* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
5162 to point to the next tree element. ITER is an instance of
5163 function_args_iterator used to iterate the arguments. */
5164 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
5165 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5166 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
5167 function_args_iter_next (&(ITER)))
5169 /* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
5170 to the next tree element. ITER is an instance of function_args_iterator
5171 used to iterate the arguments. */
5172 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
5173 for (function_args_iter_init (&(ITER), (FNTYPE)); \
5174 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
5175 function_args_iter_next (&(ITER)))
5180 extern unsigned crc32_string (unsigned, const char *);
5181 extern unsigned crc32_byte (unsigned, char);
5182 extern void clean_symbol_name (char *);
5183 extern tree
get_file_function_name (const char *);
5184 extern tree
get_callee_fndecl (const_tree
);
5185 extern int type_num_arguments (const_tree
);
5186 extern bool associative_tree_code (enum tree_code
);
5187 extern bool commutative_tree_code (enum tree_code
);
5188 extern bool commutative_ternary_tree_code (enum tree_code
);
5189 extern tree
upper_bound_in_type (tree
, tree
);
5190 extern tree
lower_bound_in_type (tree
, tree
);
5191 extern int operand_equal_for_phi_arg_p (const_tree
, const_tree
);
5192 extern tree
create_artificial_label (location_t
);
5193 extern const char *get_name (tree
);
5194 extern bool stdarg_p (const_tree
);
5195 extern bool prototype_p (tree
);
5196 extern bool is_typedef_decl (tree x
);
5197 extern bool typedef_variant_p (tree
);
5198 extern bool auto_var_in_fn_p (const_tree
, const_tree
);
5199 extern tree
build_low_bits_mask (tree
, unsigned);
5200 extern tree
tree_strip_nop_conversions (tree
);
5201 extern tree
tree_strip_sign_nop_conversions (tree
);
5202 extern const_tree
strip_invariant_refs (const_tree
);
5203 extern tree
lhd_gcc_personality (void);
5204 extern void assign_assembler_name_if_neeeded (tree
);
5205 extern void warn_deprecated_use (tree
, tree
);
5209 extern void change_decl_assembler_name (tree
, tree
);
5212 extern tree
unshare_expr (tree
);
5216 extern void expand_expr_stmt (tree
);
5217 extern int warn_if_unused_value (const_tree
, location_t
);
5218 extern void expand_label (tree
);
5219 extern void expand_goto (tree
);
5221 extern rtx
expand_stack_save (void);
5222 extern void expand_stack_restore (tree
);
5223 extern void expand_return (tree
);
5226 extern void using_eh_for_cleanups (void);
5228 /* Compare and hash for any structure which begins with a canonical
5229 pointer. Assumes all pointers are interchangeable, which is sort
5230 of already assumed by gcc elsewhere IIRC. */
5233 struct_ptr_eq (const void *a
, const void *b
)
5235 const void * const * x
= (const void * const *) a
;
5236 const void * const * y
= (const void * const *) b
;
5240 static inline hashval_t
5241 struct_ptr_hash (const void *a
)
5243 const void * const * x
= (const void * const *) a
;
5244 return (intptr_t)*x
>> 4;
5247 /* In fold-const.c */
5249 /* Non-zero if we are folding constants inside an initializer; zero
5251 extern int folding_initializer
;
5253 /* Convert between trees and native memory representation. */
5254 extern int native_encode_expr (const_tree
, unsigned char *, int);
5255 extern tree
native_interpret_expr (tree
, const unsigned char *, int);
5257 /* Fold constants as much as possible in an expression.
5258 Returns the simplified expression.
5259 Acts only on the top level of the expression;
5260 if the argument itself cannot be simplified, its
5261 subexpressions are not changed. */
5263 extern tree
fold (tree
);
5264 #define fold_unary(CODE,T1,T2)\
5265 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5266 extern tree
fold_unary_loc (location_t
, enum tree_code
, tree
, tree
);
5267 #define fold_unary_ignore_overflow(CODE,T1,T2)\
5268 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
5269 extern tree
fold_unary_ignore_overflow_loc (location_t
, enum tree_code
, tree
, tree
);
5270 #define fold_binary(CODE,T1,T2,T3)\
5271 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
5272 extern tree
fold_binary_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5273 #define fold_ternary(CODE,T1,T2,T3,T4)\
5274 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
5275 extern tree
fold_ternary_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5276 #define fold_build1(c,t1,t2)\
5277 fold_build1_stat_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
5278 #define fold_build1_loc(l,c,t1,t2)\
5279 fold_build1_stat_loc (l, c, t1, t2 MEM_STAT_INFO)
5280 extern tree
fold_build1_stat_loc (location_t
, enum tree_code
, tree
,
5281 tree MEM_STAT_DECL
);
5282 #define fold_build2(c,t1,t2,t3)\
5283 fold_build2_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
5284 #define fold_build2_loc(l,c,t1,t2,t3)\
5285 fold_build2_stat_loc (l, c, t1, t2, t3 MEM_STAT_INFO)
5286 extern tree
fold_build2_stat_loc (location_t
, enum tree_code
, tree
, tree
,
5287 tree MEM_STAT_DECL
);
5288 #define fold_build3(c,t1,t2,t3,t4)\
5289 fold_build3_stat_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
5290 #define fold_build3_loc(l,c,t1,t2,t3,t4)\
5291 fold_build3_stat_loc (l, c, t1, t2, t3, t4 MEM_STAT_INFO)
5292 extern tree
fold_build3_stat_loc (location_t
, enum tree_code
, tree
, tree
, tree
,
5293 tree MEM_STAT_DECL
);
5294 extern tree
fold_build1_initializer_loc (location_t
, enum tree_code
, tree
, tree
);
5295 extern tree
fold_build2_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
);
5296 extern tree
fold_build3_initializer_loc (location_t
, enum tree_code
, tree
, tree
, tree
, tree
);
5297 #define fold_build_call_array(T1,T2,N,T4)\
5298 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5299 extern tree
fold_build_call_array_loc (location_t
, tree
, tree
, int, tree
*);
5300 #define fold_build_call_array_initializer(T1,T2,N,T4)\
5301 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
5302 extern tree
fold_build_call_array_initializer_loc (location_t
, tree
, tree
, int, tree
*);
5303 extern bool fold_convertible_p (const_tree
, const_tree
);
5304 #define fold_convert(T1,T2)\
5305 fold_convert_loc(UNKNOWN_LOCATION, T1, T2)
5306 extern tree
fold_convert_loc (location_t
, tree
, tree
);
5307 extern tree
fold_single_bit_test (location_t
, enum tree_code
, tree
, tree
, tree
);
5308 extern tree
fold_ignored_result (tree
);
5309 extern tree
fold_abs_const (tree
, tree
);
5310 extern tree
fold_indirect_ref_1 (location_t
, tree
, tree
);
5311 extern void fold_defer_overflow_warnings (void);
5312 extern void fold_undefer_overflow_warnings (bool, const_gimple
, int);
5313 extern void fold_undefer_and_ignore_overflow_warnings (void);
5314 extern bool fold_deferring_overflow_warnings_p (void);
5315 extern tree
fold_fma (location_t
, tree
, tree
, tree
, tree
);
5317 enum operand_equal_flag
5321 OEP_CONSTANT_ADDRESS_OF
= 4
5324 extern int operand_equal_p (const_tree
, const_tree
, unsigned int);
5325 extern int multiple_of_p (tree
, const_tree
, const_tree
);
5326 #define omit_one_operand(T1,T2,T3)\
5327 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
5328 extern tree
omit_one_operand_loc (location_t
, tree
, tree
, tree
);
5329 #define omit_two_operands(T1,T2,T3,T4)\
5330 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
5331 extern tree
omit_two_operands_loc (location_t
, tree
, tree
, tree
, tree
);
5332 #define invert_truthvalue(T)\
5333 invert_truthvalue_loc(UNKNOWN_LOCATION, T)
5334 extern tree
invert_truthvalue_loc (location_t
, tree
);
5335 extern tree
fold_truth_not_expr (location_t
, tree
);
5336 extern tree
fold_unary_to_constant (enum tree_code
, tree
, tree
);
5337 extern tree
fold_binary_to_constant (enum tree_code
, tree
, tree
, tree
);
5338 extern tree
fold_read_from_constant_string (tree
);
5339 extern tree
int_const_binop (enum tree_code
, const_tree
, const_tree
);
5340 #define build_fold_addr_expr(T)\
5341 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
5342 extern tree
build_fold_addr_expr_loc (location_t
, tree
);
5343 #define build_fold_addr_expr_with_type(T,TYPE)\
5344 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
5345 extern tree
build_fold_addr_expr_with_type_loc (location_t
, tree
, tree
);
5346 extern tree
fold_build_cleanup_point_expr (tree type
, tree expr
);
5347 extern tree
fold_strip_sign_ops (tree
);
5348 #define build_fold_indirect_ref(T)\
5349 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5350 extern tree
build_fold_indirect_ref_loc (location_t
, tree
);
5351 #define fold_indirect_ref(T)\
5352 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
5353 extern tree
fold_indirect_ref_loc (location_t
, tree
);
5354 extern tree
build_simple_mem_ref_loc (location_t
, tree
);
5355 #define build_simple_mem_ref(T)\
5356 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
5357 extern double_int
mem_ref_offset (const_tree
);
5358 extern tree
reference_alias_ptr_type (const_tree
);
5359 extern tree
build_invariant_address (tree
, tree
, HOST_WIDE_INT
);
5360 extern tree
constant_boolean_node (bool, tree
);
5361 extern tree
div_if_zero_remainder (enum tree_code
, const_tree
, const_tree
);
5363 extern bool tree_swap_operands_p (const_tree
, const_tree
, bool);
5364 extern enum tree_code
swap_tree_comparison (enum tree_code
);
5366 extern bool ptr_difference_const (tree
, tree
, HOST_WIDE_INT
*);
5367 extern enum tree_code
invert_tree_comparison (enum tree_code
, bool);
5369 extern bool tree_expr_nonzero_p (tree
);
5370 extern bool tree_unary_nonzero_warnv_p (enum tree_code
, tree
, tree
, bool *);
5371 extern bool tree_binary_nonzero_warnv_p (enum tree_code
, tree
, tree
, tree op1
,
5373 extern bool tree_single_nonzero_warnv_p (tree
, bool *);
5374 extern bool tree_unary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, bool *);
5375 extern bool tree_binary_nonnegative_warnv_p (enum tree_code
, tree
, tree
, tree
,
5377 extern bool tree_single_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5378 extern bool tree_invalid_nonnegative_warnv_p (tree t
, bool *strict_overflow_p
);
5379 extern bool tree_call_nonnegative_warnv_p (tree
, tree
, tree
, tree
, bool *);
5381 extern bool tree_expr_nonzero_warnv_p (tree
, bool *);
5383 extern bool fold_real_zero_addition_p (const_tree
, const_tree
, int);
5384 extern tree
combine_comparisons (location_t
, enum tree_code
, enum tree_code
,
5385 enum tree_code
, tree
, tree
, tree
);
5386 extern void debug_fold_checksum (const_tree
);
5388 /* Return nonzero if CODE is a tree code that represents a truth value. */
5390 truth_value_p (enum tree_code code
)
5392 return (TREE_CODE_CLASS (code
) == tcc_comparison
5393 || code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5394 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5395 || code
== TRUTH_XOR_EXPR
|| code
== TRUTH_NOT_EXPR
);
5398 /* Return whether TYPE is a type suitable for an offset for
5399 a POINTER_PLUS_EXPR. */
5401 ptrofftype_p (tree type
)
5403 return (INTEGRAL_TYPE_P (type
)
5404 && TYPE_PRECISION (type
) == TYPE_PRECISION (sizetype
)
5405 && TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (sizetype
));
5408 /* Return OFF converted to a pointer offset type suitable as offset for
5409 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
5411 convert_to_ptrofftype_loc (location_t loc
, tree off
)
5413 return fold_convert_loc (loc
, sizetype
, off
);
5415 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
5417 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5419 fold_build_pointer_plus_loc (location_t loc
, tree ptr
, tree off
)
5421 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5422 ptr
, fold_convert_loc (loc
, sizetype
, off
));
5424 #define fold_build_pointer_plus(p,o) \
5425 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
5427 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
5429 fold_build_pointer_plus_hwi_loc (location_t loc
, tree ptr
, HOST_WIDE_INT off
)
5431 return fold_build2_loc (loc
, POINTER_PLUS_EXPR
, TREE_TYPE (ptr
),
5432 ptr
, size_int (off
));
5434 #define fold_build_pointer_plus_hwi(p,o) \
5435 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
5438 extern bool avoid_folding_inline_builtin (tree
);
5439 extern tree
fold_call_expr (location_t
, tree
, bool);
5440 extern tree
fold_builtin_fputs (location_t
, tree
, tree
, bool, bool, tree
);
5441 extern tree
fold_builtin_strcpy (location_t
, tree
, tree
, tree
, tree
);
5442 extern tree
fold_builtin_strncpy (location_t
, tree
, tree
, tree
, tree
, tree
);
5443 extern tree
fold_builtin_memory_chk (location_t
, tree
, tree
, tree
, tree
, tree
, tree
, bool,
5444 enum built_in_function
);
5445 extern tree
fold_builtin_stxcpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
, bool,
5446 enum built_in_function
);
5447 extern tree
fold_builtin_strncpy_chk (location_t
, tree
, tree
, tree
, tree
, tree
);
5448 extern tree
fold_builtin_snprintf_chk (location_t
, tree
, tree
, enum built_in_function
);
5449 extern bool fold_builtin_next_arg (tree
, bool);
5450 extern enum built_in_function
builtin_mathfn_code (const_tree
);
5451 extern tree
fold_builtin_call_array (location_t
, tree
, tree
, int, tree
*);
5452 extern tree
build_call_expr_loc_array (location_t
, tree
, int, tree
*);
5453 extern tree
build_call_expr_loc_vec (location_t
, tree
, VEC(tree
,gc
) *);
5454 extern tree
build_call_expr_loc (location_t
, tree
, int, ...);
5455 extern tree
build_call_expr (tree
, int, ...);
5456 extern tree
mathfn_built_in (tree
, enum built_in_function fn
);
5457 extern tree
c_strlen (tree
, int);
5458 extern tree
std_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
5459 extern tree
build_va_arg_indirect_ref (tree
);
5460 extern tree
build_string_literal (int, const char *);
5461 extern bool validate_arglist (const_tree
, ...);
5462 extern rtx
builtin_memset_read_str (void *, HOST_WIDE_INT
, enum machine_mode
);
5463 extern bool is_builtin_name (const char *);
5464 extern bool is_builtin_fn (tree
);
5465 extern unsigned int get_object_alignment_1 (tree
, unsigned HOST_WIDE_INT
*);
5466 extern unsigned int get_object_alignment (tree
);
5467 extern unsigned int get_pointer_alignment (tree
);
5468 extern tree
fold_call_stmt (gimple
, bool);
5469 extern tree
gimple_fold_builtin_snprintf_chk (gimple
, tree
, enum built_in_function
);
5470 extern tree
make_range (tree
, int *, tree
*, tree
*, bool *);
5471 extern tree
make_range_step (location_t
, enum tree_code
, tree
, tree
, tree
,
5472 tree
*, tree
*, int *, bool *);
5473 extern tree
build_range_check (location_t
, tree
, tree
, int, tree
, tree
);
5474 extern bool merge_ranges (int *, tree
*, tree
*, int, tree
, tree
, int,
5476 extern void set_builtin_user_assembler_name (tree decl
, const char *asmspec
);
5477 extern bool is_simple_builtin (tree
);
5478 extern bool is_inexpensive_builtin (tree
);
5481 extern tree
strip_float_extensions (tree
);
5484 extern int really_constant_p (const_tree
);
5485 extern bool decl_address_invariant_p (const_tree
);
5486 extern bool decl_address_ip_invariant_p (const_tree
);
5487 extern bool int_fits_type_p (const_tree
, const_tree
);
5488 #ifndef GENERATOR_FILE
5489 extern void get_type_static_bounds (const_tree
, mpz_t
, mpz_t
);
5491 extern bool variably_modified_type_p (tree
, tree
);
5492 extern int tree_log2 (const_tree
);
5493 extern int tree_floor_log2 (const_tree
);
5494 extern int simple_cst_equal (const_tree
, const_tree
);
5495 extern hashval_t
iterative_hash_expr (const_tree
, hashval_t
);
5496 extern hashval_t
iterative_hash_exprs_commutative (const_tree
,
5497 const_tree
, hashval_t
);
5498 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5499 extern hashval_t
iterative_hash_hashval_t (hashval_t
, hashval_t
);
5500 extern hashval_t
iterative_hash_host_wide_int (HOST_WIDE_INT
, hashval_t
);
5501 extern int compare_tree_int (const_tree
, unsigned HOST_WIDE_INT
);
5502 extern int type_list_equal (const_tree
, const_tree
);
5503 extern int chain_member (const_tree
, const_tree
);
5504 extern tree
type_hash_lookup (unsigned int, tree
);
5505 extern void type_hash_add (unsigned int, tree
);
5506 extern int simple_cst_list_equal (const_tree
, const_tree
);
5507 extern void dump_tree_statistics (void);
5508 extern void recompute_tree_invariant_for_addr_expr (tree
);
5509 extern bool needs_to_live_in_memory (const_tree
);
5510 extern tree
reconstruct_complex_type (tree
, tree
);
5512 extern int real_onep (const_tree
);
5513 extern int real_twop (const_tree
);
5514 extern int real_minus_onep (const_tree
);
5515 extern void init_ttree (void);
5516 extern void build_common_tree_nodes (bool, bool);
5517 extern void build_common_builtin_nodes (void);
5518 extern tree
build_nonstandard_integer_type (unsigned HOST_WIDE_INT
, int);
5519 extern tree
build_range_type (tree
, tree
, tree
);
5520 extern tree
build_nonshared_range_type (tree
, tree
, tree
);
5521 extern bool subrange_type_for_debug_p (const_tree
, tree
*, tree
*);
5522 extern HOST_WIDE_INT
int_cst_value (const_tree
);
5523 extern HOST_WIDEST_INT
widest_int_cst_value (const_tree
);
5525 extern tree
*tree_block (tree
);
5526 extern location_t
*block_nonartificial_location (tree
);
5527 extern location_t
tree_nonartificial_location (tree
);
5529 extern tree
block_ultimate_origin (const_tree
);
5531 extern tree
get_binfo_at_offset (tree
, HOST_WIDE_INT
, tree
);
5533 /* In tree-nested.c */
5534 extern tree
build_addr (tree
, tree
);
5537 extern void expand_main_function (void);
5538 extern void expand_function_end (void);
5539 extern void expand_function_start (tree
);
5540 extern void stack_protect_prologue (void);
5541 extern void stack_protect_epilogue (void);
5542 extern void init_dummy_function_start (void);
5543 extern void expand_dummy_function_end (void);
5544 extern unsigned int init_function_for_compilation (void);
5545 extern void allocate_struct_function (tree
, bool);
5546 extern void push_struct_function (tree fndecl
);
5547 extern void init_function_start (tree
);
5548 extern bool use_register_for_decl (const_tree
);
5549 extern void generate_setjmp_warnings (void);
5550 extern void init_temp_slots (void);
5551 extern void free_temp_slots (void);
5552 extern void pop_temp_slots (void);
5553 extern void push_temp_slots (void);
5554 extern void preserve_temp_slots (rtx
);
5555 extern int aggregate_value_p (const_tree
, const_tree
);
5556 extern void push_function_context (void);
5557 extern void pop_function_context (void);
5558 extern gimple_seq
gimplify_parameters (void);
5560 /* In print-rtl.c */
5562 extern void print_rtl (FILE *, const_rtx
);
5565 /* In print-tree.c */
5566 extern void debug_tree (tree
);
5567 extern void debug_vec_tree (VEC(tree
,gc
) *);
5569 extern void dump_addr (FILE*, const char *, const void *);
5570 extern void print_node (FILE *, const char *, tree
, int);
5571 extern void print_vec_tree (FILE *, const char *, VEC(tree
,gc
) *, int);
5572 extern void print_node_brief (FILE *, const char *, const_tree
, int);
5573 extern void indent_to (FILE *, int);
5576 /* In tree-inline.c: */
5577 extern bool debug_find_tree (tree
, tree
);
5578 /* This is in tree-inline.c since the routine uses
5579 data structures from the inliner. */
5580 extern tree
unsave_expr_now (tree
);
5581 extern tree
build_duplicate_type (tree
);
5585 /* Nonzero if this is a call to a function whose return value depends
5586 solely on its arguments, has no side effects, and does not read
5587 global memory. This corresponds to TREE_READONLY for function
5589 #define ECF_CONST (1 << 0)
5590 /* Nonzero if this is a call to "pure" function (like const function,
5591 but may read memory. This corresponds to DECL_PURE_P for function
5593 #define ECF_PURE (1 << 1)
5594 /* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
5595 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
5596 for function decls.*/
5597 #define ECF_LOOPING_CONST_OR_PURE (1 << 2)
5598 /* Nonzero if this call will never return. */
5599 #define ECF_NORETURN (1 << 3)
5600 /* Nonzero if this is a call to malloc or a related function. */
5601 #define ECF_MALLOC (1 << 4)
5602 /* Nonzero if it is plausible that this is a call to alloca. */
5603 #define ECF_MAY_BE_ALLOCA (1 << 5)
5604 /* Nonzero if this is a call to a function that won't throw an exception. */
5605 #define ECF_NOTHROW (1 << 6)
5606 /* Nonzero if this is a call to setjmp or a related function. */
5607 #define ECF_RETURNS_TWICE (1 << 7)
5608 /* Nonzero if this call replaces the current stack frame. */
5609 #define ECF_SIBCALL (1 << 8)
5610 /* Function does not read or write memory (but may have side effects, so
5611 it does not necessarily fit ECF_CONST). */
5612 #define ECF_NOVOPS (1 << 9)
5613 /* The function does not lead to calls within current function unit. */
5614 #define ECF_LEAF (1 << 10)
5615 /* Nonzero if this call does not affect transactions. */
5616 #define ECF_TM_PURE (1 << 11)
5617 /* Nonzero if this call is into the transaction runtime library. */
5618 #define ECF_TM_BUILTIN (1 << 12)
5620 extern int flags_from_decl_or_type (const_tree
);
5621 extern int call_expr_flags (const_tree
);
5623 /* Call argument flags. */
5625 /* Nonzero if the argument is not dereferenced recursively, thus only
5626 directly reachable memory is read or written. */
5627 #define EAF_DIRECT (1 << 0)
5628 /* Nonzero if memory reached by the argument is not clobbered. */
5629 #define EAF_NOCLOBBER (1 << 1)
5630 /* Nonzero if the argument does not escape. */
5631 #define EAF_NOESCAPE (1 << 2)
5632 /* Nonzero if the argument is not used by the function. */
5633 #define EAF_UNUSED (1 << 3)
5635 /* Call return flags. */
5637 /* Mask for the argument number that is returned. Lower two bits of
5638 the return flags, encodes argument slots zero to three. */
5639 #define ERF_RETURN_ARG_MASK (3)
5640 /* Nonzero if the return value is equal to the argument number
5641 flags & ERF_RETURN_ARG_MASK. */
5642 #define ERF_RETURNS_ARG (1 << 2)
5643 /* Nonzero if the return value does not alias with anything. Functions
5644 with the malloc attribute have this set on their return value. */
5645 #define ERF_NOALIAS (1 << 3)
5647 extern int setjmp_call_p (const_tree
);
5648 extern bool gimple_alloca_call_p (const_gimple
);
5649 extern bool alloca_call_p (const_tree
);
5650 extern bool must_pass_in_stack_var_size (enum machine_mode
, const_tree
);
5651 extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode
, const_tree
);
5655 extern const struct attribute_spec
*lookup_attribute_spec (const_tree
);
5657 extern void init_attributes (void);
5659 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
5660 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
5661 it should be modified in place; if a TYPE, a copy should be created
5662 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
5663 information, in the form of a bitwise OR of flags in enum attribute_flags
5664 from tree.h. Depending on these flags, some attributes may be
5665 returned to be applied at a later stage (for example, to apply
5666 a decl attribute to the declaration rather than to its type). */
5667 extern tree
decl_attributes (tree
*, tree
, int);
5669 extern void apply_tm_attr (tree
, tree
);
5671 /* In integrate.c */
5672 extern void set_decl_abstract_flags (tree
, int);
5673 extern void set_decl_origin_self (tree
);
5675 /* In stor-layout.c */
5676 extern void set_min_and_max_values_for_integral_type (tree
, int, bool);
5677 extern void fixup_signed_type (tree
);
5678 extern void internal_reference_types (void);
5679 extern unsigned int update_alignment_for_field (record_layout_info
, tree
,
5682 extern tree
tree_output_constant_def (tree
);
5683 extern void make_decl_rtl (tree
);
5684 extern rtx
make_decl_rtl_for_debug (tree
);
5685 extern void make_decl_one_only (tree
, tree
);
5686 extern int supports_one_only (void);
5687 extern void resolve_unique_section (tree
, int, int);
5688 extern void mark_referenced (tree
);
5689 extern void mark_decl_referenced (tree
);
5690 extern void notice_global_symbol (tree
);
5691 extern void set_user_assembler_name (tree
, const char *);
5692 extern void process_pending_assemble_externals (void);
5693 extern void finish_aliases_1 (void);
5694 extern void finish_aliases_2 (void);
5695 extern void remove_unreachable_alias_pairs (void);
5696 extern bool decl_replaceable_p (tree
);
5697 extern bool decl_binds_to_current_def_p (tree
);
5699 /* Derived type for use by compute_visible_aliases and callers. A symbol
5700 alias set is a pointer set into which we enter IDENTIFIER_NODES bearing
5701 the canonicalised assembler-level symbol names corresponding to decls
5702 and their aliases. */
5703 typedef struct pointer_set_t symbol_alias_set_t
;
5705 extern void symbol_alias_set_destroy (symbol_alias_set_t
*);
5706 extern int symbol_alias_set_contains (const symbol_alias_set_t
*, tree
);
5707 extern symbol_alias_set_t
* propagate_aliases_backward (bool (*)
5708 (tree
, tree
, void *),
5712 extern void expand_computed_goto (tree
);
5713 extern bool parse_output_constraint (const char **, int, int, int,
5714 bool *, bool *, bool *);
5715 extern bool parse_input_constraint (const char **, int, int, int, int,
5716 const char * const *, bool *, bool *);
5717 extern void expand_asm_stmt (gimple
);
5718 extern tree
resolve_asm_operand_names (tree
, tree
, tree
, tree
);
5719 extern bool expand_switch_using_bit_tests_p (tree
, tree
, unsigned int,
5721 extern void expand_case (gimple
);
5722 extern void expand_decl (tree
);
5724 /* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
5725 extern tree
tree_overlaps_hard_reg_set (tree
, HARD_REG_SET
*);
5729 /* In tree-inline.c */
5731 /* The type of a set of already-visited pointers. Functions for creating
5732 and manipulating it are declared in pointer-set.h */
5733 struct pointer_set_t
;
5735 /* The type of a callback function for walking over tree structure. */
5737 typedef tree (*walk_tree_fn
) (tree
*, int *, void *);
5739 /* The type of a callback function that represents a custom walk_tree. */
5741 typedef tree (*walk_tree_lh
) (tree
*, int *, tree (*) (tree
*, int *, void *),
5742 void *, struct pointer_set_t
*);
5744 extern tree
walk_tree_1 (tree
*, walk_tree_fn
, void*, struct pointer_set_t
*,
5746 extern tree
walk_tree_without_duplicates_1 (tree
*, walk_tree_fn
, void*,
5748 #define walk_tree(a,b,c,d) \
5749 walk_tree_1 (a, b, c, d, NULL)
5750 #define walk_tree_without_duplicates(a,b,c) \
5751 walk_tree_without_duplicates_1 (a, b, c, NULL)
5754 /* Assign the RTX to declaration. */
5756 extern void set_decl_rtl (tree
, rtx
);
5757 extern void set_decl_incoming_rtl (tree
, rtx
, bool);
5759 /* Enum and arrays used for tree allocation stats.
5760 Keep in sync with tree.c:tree_node_kind_names. */
5782 extern int tree_node_counts
[];
5783 extern int tree_node_sizes
[];
5785 /* True if we are in gimple form and the actions of the folders need to
5786 be restricted. False if we are not in gimple form and folding is not
5787 restricted to creating gimple expressions. */
5788 extern bool in_gimple_form
;
5791 extern tree
get_base_address (tree t
);
5792 extern void mark_addressable (tree
);
5796 struct GTY(()) tree_map_base
{
5800 extern int tree_map_base_eq (const void *, const void *);
5801 extern unsigned int tree_map_base_hash (const void *);
5802 extern int tree_map_base_marked_p (const void *);
5803 extern bool list_equal_p (const_tree
, const_tree
);
5805 /* Map from a tree to another tree. */
5807 struct GTY(()) tree_map
{
5808 struct tree_map_base base
;
5813 #define tree_map_eq tree_map_base_eq
5814 extern unsigned int tree_map_hash (const void *);
5815 #define tree_map_marked_p tree_map_base_marked_p
5817 /* Map from a decl tree to another tree. */
5819 struct GTY(()) tree_decl_map
{
5820 struct tree_map_base base
;
5824 #define tree_decl_map_eq tree_map_base_eq
5825 extern unsigned int tree_decl_map_hash (const void *);
5826 #define tree_decl_map_marked_p tree_map_base_marked_p
5828 /* Map from a tree to an int. */
5830 struct GTY(()) tree_int_map
{
5831 struct tree_map_base base
;
5835 #define tree_int_map_eq tree_map_base_eq
5836 #define tree_int_map_hash tree_map_base_hash
5837 #define tree_int_map_marked_p tree_map_base_marked_p
5839 /* Map from a tree to initialization/finalization priorities. */
5841 struct GTY(()) tree_priority_map
{
5842 struct tree_map_base base
;
5847 #define tree_priority_map_eq tree_map_base_eq
5848 #define tree_priority_map_hash tree_map_base_hash
5849 #define tree_priority_map_marked_p tree_map_base_marked_p
5851 /* Map from a decl tree to a tree vector. */
5853 struct GTY(()) tree_vec_map
{
5854 struct tree_map_base base
;
5858 #define tree_vec_map_eq tree_map_base_eq
5859 #define tree_vec_map_hash tree_decl_map_hash
5860 #define tree_vec_map_marked_p tree_map_base_marked_p
5864 tree
target_for_debug_bind (tree
);
5866 /* In tree-ssa-address.c. */
5867 extern tree
tree_mem_ref_addr (tree
, tree
);
5868 extern void copy_mem_ref_info (tree
, tree
);
5869 extern void copy_ref_info (tree
, tree
);
5872 extern bool ssa_name_nonnegative_p (const_tree
);
5874 /* In tree-object-size.c. */
5875 extern void init_object_sizes (void);
5876 extern void fini_object_sizes (void);
5877 extern unsigned HOST_WIDE_INT
compute_builtin_object_size (tree
, int);
5880 extern unsigned HOST_WIDE_INT
highest_pow2_factor (const_tree
);
5881 extern tree
build_personality_function (const char *);
5883 /* In trans-mem.c. */
5884 extern tree
build_tm_abort_call (location_t
, bool);
5885 extern bool is_tm_safe (const_tree
);
5886 extern bool is_tm_pure (const_tree
);
5887 extern bool is_tm_may_cancel_outer (tree
);
5888 extern bool is_tm_ending_fndecl (tree
);
5889 extern void record_tm_replacement (tree
, tree
);
5890 extern void tm_malloc_replacement (tree
);
5893 is_tm_safe_or_pure (const_tree x
)
5895 return is_tm_safe (x
) || is_tm_pure (x
);
5898 /* In tree-inline.c. */
5900 void init_inline_once (void);
5902 /* Compute the number of operands in an expression node NODE. For
5903 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5904 otherwise it is looked up from the node's code. */
5906 tree_operand_length (const_tree node
)
5908 if (VL_EXP_CLASS_P (node
))
5909 return VL_EXP_OPERAND_LENGTH (node
);
5911 return TREE_CODE_LENGTH (TREE_CODE (node
));
5914 /* Abstract iterators for CALL_EXPRs. These static inline definitions
5915 have to go towards the end of tree.h so that union tree_node is fully
5916 defined by this point. */
5918 /* Structure containing iterator state. */
5919 typedef struct call_expr_arg_iterator_d
{
5920 tree t
; /* the call_expr */
5921 int n
; /* argument count */
5922 int i
; /* next argument index */
5923 } call_expr_arg_iterator
;
5925 typedef struct const_call_expr_arg_iterator_d
{
5926 const_tree t
; /* the call_expr */
5927 int n
; /* argument count */
5928 int i
; /* next argument index */
5929 } const_call_expr_arg_iterator
;
5931 /* Initialize the abstract argument list iterator object ITER with the
5932 arguments from CALL_EXPR node EXP. */
5934 init_call_expr_arg_iterator (tree exp
, call_expr_arg_iterator
*iter
)
5937 iter
->n
= call_expr_nargs (exp
);
5942 init_const_call_expr_arg_iterator (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5945 iter
->n
= call_expr_nargs (exp
);
5949 /* Return the next argument from abstract argument list iterator object ITER,
5950 and advance its state. Return NULL_TREE if there are no more arguments. */
5952 next_call_expr_arg (call_expr_arg_iterator
*iter
)
5955 if (iter
->i
>= iter
->n
)
5957 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5962 static inline const_tree
5963 next_const_call_expr_arg (const_call_expr_arg_iterator
*iter
)
5966 if (iter
->i
>= iter
->n
)
5968 result
= CALL_EXPR_ARG (iter
->t
, iter
->i
);
5973 /* Initialize the abstract argument list iterator object ITER, then advance
5974 past and return the first argument. Useful in for expressions, e.g.
5975 for (arg = first_call_expr_arg (exp, &iter); arg;
5976 arg = next_call_expr_arg (&iter)) */
5978 first_call_expr_arg (tree exp
, call_expr_arg_iterator
*iter
)
5980 init_call_expr_arg_iterator (exp
, iter
);
5981 return next_call_expr_arg (iter
);
5984 static inline const_tree
5985 first_const_call_expr_arg (const_tree exp
, const_call_expr_arg_iterator
*iter
)
5987 init_const_call_expr_arg_iterator (exp
, iter
);
5988 return next_const_call_expr_arg (iter
);
5991 /* Test whether there are more arguments in abstract argument list iterator
5992 ITER, without changing its state. */
5994 more_call_expr_args_p (const call_expr_arg_iterator
*iter
)
5996 return (iter
->i
< iter
->n
);
6000 more_const_call_expr_args_p (const const_call_expr_arg_iterator
*iter
)
6002 return (iter
->i
< iter
->n
);
6005 /* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
6006 (of type call_expr_arg_iterator) to hold the iteration state. */
6007 #define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
6008 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
6009 (arg) = next_call_expr_arg (&(iter)))
6011 #define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
6012 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
6013 (arg) = next_const_call_expr_arg (&(iter)))
6015 /* Return true if tree node T is a language-specific node. */
6017 is_lang_specific (tree t
)
6019 return TREE_CODE (t
) == LANG_TYPE
|| TREE_CODE (t
) >= NUM_TREE_CODES
;
6022 /* In gimple-low.c. */
6023 extern bool block_may_fallthru (const_tree
);
6026 /* Functional interface to the builtin functions. */
6028 /* The builtin_info structure holds the FUNCTION_DECL of the standard builtin
6029 function, and a flag that says if the function is available implicitly, or
6030 whether the user has to code explicit calls to __builtin_<xxx>. */
6032 typedef struct GTY(()) builtin_info_type_d
{
6033 tree decl
[(int)END_BUILTINS
];
6034 bool implicit_p
[(int)END_BUILTINS
];
6035 } builtin_info_type
;
6037 extern GTY(()) builtin_info_type builtin_info
;
6039 /* Valid builtin number. */
6040 #define BUILTIN_VALID_P(FNCODE) \
6041 (IN_RANGE ((int)FNCODE, ((int)BUILT_IN_NONE) + 1, ((int) END_BUILTINS) - 1))
6043 /* Return the tree node for an explicit standard builtin function or NULL. */
6045 builtin_decl_explicit (enum built_in_function fncode
)
6047 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6049 return builtin_info
.decl
[(size_t)fncode
];
6052 /* Return the tree node for an implicit builtin function or NULL. */
6054 builtin_decl_implicit (enum built_in_function fncode
)
6056 size_t uns_fncode
= (size_t)fncode
;
6057 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6059 if (!builtin_info
.implicit_p
[uns_fncode
])
6062 return builtin_info
.decl
[uns_fncode
];
6065 /* Set explicit builtin function nodes and whether it is an implicit
6069 set_builtin_decl (enum built_in_function fncode
, tree decl
, bool implicit_p
)
6071 size_t ufncode
= (size_t)fncode
;
6073 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6074 && (decl
!= NULL_TREE
|| !implicit_p
));
6076 builtin_info
.decl
[ufncode
] = decl
;
6077 builtin_info
.implicit_p
[ufncode
] = implicit_p
;
6080 /* Set the implicit flag for a builtin function. */
6083 set_builtin_decl_implicit_p (enum built_in_function fncode
, bool implicit_p
)
6085 size_t uns_fncode
= (size_t)fncode
;
6087 gcc_checking_assert (BUILTIN_VALID_P (fncode
)
6088 && builtin_info
.decl
[uns_fncode
] != NULL_TREE
);
6090 builtin_info
.implicit_p
[uns_fncode
] = implicit_p
;
6093 /* Return whether the standard builtin function can be used as an explicit
6097 builtin_decl_explicit_p (enum built_in_function fncode
)
6099 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6100 return (builtin_info
.decl
[(size_t)fncode
] != NULL_TREE
);
6103 /* Return whether the standard builtin function can be used implicitly. */
6106 builtin_decl_implicit_p (enum built_in_function fncode
)
6108 size_t uns_fncode
= (size_t)fncode
;
6110 gcc_checking_assert (BUILTIN_VALID_P (fncode
));
6111 return (builtin_info
.decl
[uns_fncode
] != NULL_TREE
6112 && builtin_info
.implicit_p
[uns_fncode
]);
6115 #endif /* GCC_TREE_H */